/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractTableReadTest.java | 36 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest 39 * Creates a table with the specified data. 41 * @param data the table data, repeating the sequence row key, column key, 51 assertEquals(expectedSize, table.size()); 56 table = create(); 60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 61 assertTrue(table.contains("foo", 1)); 62 assertTrue(table.contains("bar", 1)); 63 assertTrue(table.contains("foo", 3)); 64 assertFalse(table [all...] |
H A D | AbstractTableTest.java | 35 Table<String, Integer, Character> table, Object... data) { 38 table.put( 52 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 54 table.clear(); 55 assertEquals(0, table.size()); 56 assertFalse(table.containsRow("foo")); 59 table.clear(); 66 assertNull(table.put("foo", 1, 'a')); 67 assertNull(table.put("bar", 1, 'b')); 68 assertNull(table 34 populate( Table<String, Integer, Character> table, Object... data) argument [all...] |
H A D | ArrayTableTest.java | 42 ArrayTable<String, Integer, Character> table = 44 populate(table, data); 45 return table; 49 assertEquals(9, table.size()); 63 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 64 assertTrue(table.contains("foo", 1)); 65 assertTrue(table.contains("bar", 1)); 66 assertTrue(table.contains("foo", 3)); 67 assertTrue(table.contains("foo", 2)); 68 assertTrue(table [all...] |
/external/speex/libspeex/ |
H A D | fftwrap.h | 44 void spx_fft_destroy(void *table); 47 void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out); 50 void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out); 53 void spx_fft_float(void *table, float *in, float *out); 56 void spx_ifft_float(void *table, float *in, float *out);
|
H A D | fftwrap.c | 86 struct drft_lookup *table; local 87 table = speex_alloc(sizeof(struct drft_lookup)); 88 spx_drft_init((struct drft_lookup *)table, size); 89 return (void*)table; 92 void spx_fft_destroy(void *table) argument 94 spx_drft_clear(table); 95 speex_free(table); 98 void spx_fft(void *table, float *in, float *out) argument 103 float scale = 1./((struct drft_lookup *)table)->n; 105 for (i=0;i<((struct drft_lookup *)table) 116 spx_ifft(void *table, float *in, float *out) argument 139 struct mkl_config *table = (struct mkl_config *) speex_alloc(sizeof(struct mkl_config)); local 149 spx_fft_destroy(void *table) argument 156 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument 162 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument 182 struct fftw_config *table = (struct fftw_config *) speex_alloc(sizeof(struct fftw_config)); local 193 spx_fft_destroy(void *table) argument 204 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument 222 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument 255 struct kiss_config *table; local 263 spx_fft_destroy(void *table) argument 273 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument 285 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument 297 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument 315 spx_fft_float(void *table, float *in, float *out) argument 351 spx_ifft_float(void *table, float *in, float *out) argument 388 spx_fft_float(void *table, float *in, float *out) argument 392 spx_ifft_float(void *table, float *in, float *out) argument [all...] |
/external/skia/src/core/ |
H A D | SkFilterProc.h | 21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table, argument 24 SkASSERT(table); 29 return table[(y << 2) | x]; 32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table, argument 35 SkASSERT(table); 40 return table[(y << 2) | x]; 43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table, argument 46 SkASSERT(table); 48 return &table[y << 30 >> 28]; 66 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table, argument 77 SkGetFilter32Proc22Row(const SkFilter32Proc* table, unsigned y) argument 101 SkGetBilinearFilterPtrProc(const SkFilterPtrProc* table, SkFixed x, SkFixed y) argument 115 SkGetBilinearFilterPtrProcYTable(const SkFilterPtrProc* table, SkFixed y) argument 126 SkGetBilinearFilterPtrXProc(const SkFilterPtrProc* table, SkFixed x) argument [all...] |
/external/mesa3d/src/glsl/ |
H A D | glsl_symbol_table.h | 43 * type safe and some symbol table invariants. 48 _glsl_symbol_table_destructor (glsl_symbol_table *table) argument 50 table->~glsl_symbol_table(); 60 void *table; local 62 table = hieralloc_size(ctx, size); 63 assert(table != NULL); 65 hieralloc_set_destructor(table, (int (*)(void*)) _glsl_symbol_table_destructor); 66 return table; 72 static void operator delete(void *table) argument 74 hieralloc_set_destructor(table, NUL 121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table [all...] |
/external/valgrind/main/coregrind/ |
H A D | m_hashtable.c | 3 /*--- A separately-chained hash table. m_hashtable.c ---*/ 49 Bool iterOK; // table safe to iterate over? 50 HChar* name; // name of table (for debugging only) 72 VgHashTable table = VG_(calloc)("hashtable.Hc.1", local 74 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz); 75 table->n_chains = n_chains; 76 table->n_elements = 0; 77 table->iterOK = True; 78 table->name = name; 80 return table; 142 HT_add_node( VgHashTable table, void* vnode ) argument 158 HT_lookup( VgHashTable table, UWord key ) argument 172 HT_remove( VgHashTable table, UWord key ) argument 197 HT_to_array( VgHashTable table, UInt* n_elems ) argument 220 HT_ResetIter(VgHashTable table) argument 228 HT_Next(VgHashTable table) argument 252 HT_destruct(VgHashTable table) argument [all...] |
/external/icu4c/layout/ |
H A D | NonContextualGlyphSubst.h | 25 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
|
/external/javasqlite/src/main/java/SQLite/ |
H A D | BusyHandler.java | 10 * Invoked when a table is locked by another process 12 * until the table becomes unlocked, or false in order 15 * @param table the name of the locked table 16 * @param count number of times the table was locked 19 public boolean busy(String table, int count); argument
|
/external/bison/lib/ |
H A D | hash.c | 1 /* hash - hashing table processing. 22 /* A generic hash table package. */ 56 are not empty, there are N_ENTRIES active entries in the table. */ 86 /* A hash table contains many internal entries, each holding a pointer to 91 and the current table size. At each slot position in the hash table, 97 entries divided by the table size. Finding the slot for a data is usually 100 larger hash table size (that is, a larger number of buckets) is prone to 103 Long buckets slow down the lookup algorithm. One might use big hash table 105 become inordinate, as unused slots in the hash table tak 150 hash_get_n_buckets(const Hash_table *table) argument 158 hash_get_n_buckets_used(const Hash_table *table) argument 166 hash_get_n_entries(const Hash_table *table) argument 174 hash_get_max_bucket_length(const Hash_table *table) argument 201 hash_table_ok(const Hash_table *table) argument 230 hash_print_statistics(const Hash_table *table, FILE *stream) argument 250 hash_lookup(const Hash_table *table, const void *entry) argument 279 hash_get_first(const Hash_table *table) argument 298 hash_get_next(const Hash_table *table, const void *entry) argument 326 hash_get_entries(const Hash_table *table, void **buffer, size_t buffer_size) argument 358 hash_do_for_each(const Hash_table *table, Hash_processor processor, void *processor_data) argument 484 check_tuning(Hash_table *table) argument 544 Hash_table *table; local 605 hash_clear(Hash_table *table) argument 648 hash_free(Hash_table *table) argument 705 allocate_entry(Hash_table *table) argument 730 free_entry(Hash_table *table, struct hash_entry *entry) argument 744 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument 819 hash_rehash(Hash_table *table, size_t candidate) argument 908 hash_insert(Hash_table *table, const void *entry) argument 983 hash_delete(Hash_table *table, const void *entry) argument 1029 hash_print(const Hash_table *table) argument [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | hash.h | 3 * Generic hash table. 40 extern void _mesa_DeleteHashTable(struct _mesa_HashTable *table); 42 extern void *_mesa_HashLookup(struct _mesa_HashTable *table, GLuint key); 44 extern void _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data); 46 extern void _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key); 49 _mesa_HashDeleteAll(struct _mesa_HashTable *table, 54 _mesa_HashWalk(const struct _mesa_HashTable *table, 58 extern GLuint _mesa_HashFirstEntry(struct _mesa_HashTable *table); 60 extern GLuint _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key); 62 extern void _mesa_HashPrint(const struct _mesa_HashTable *table); [all...] |
/external/freetype/src/base/ |
H A D | ftdbgmem.c | 226 ft_mem_table_alloc( FT_MemTable table, argument 229 FT_Memory memory = table->memory; 233 memory->user = table->memory_user; 234 block = table->alloc( memory, size ); 235 memory->user = table; 242 ft_mem_table_free( FT_MemTable table, argument 245 FT_Memory memory = table->memory; 248 memory->user = table->memory_user; 249 table->free( memory, block ); 250 memory->user = table; 307 FT_MemTable table; local 430 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument 509 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_ULong size, FT_Long delta ) argument 608 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument 683 FT_MemTable table = (FT_MemTable)memory->user; local 719 FT_MemTable table = (FT_MemTable)memory->user; local 745 FT_MemTable table = (FT_MemTable)memory->user; local 826 FT_MemTable table; local 889 FT_MemTable table = (FT_MemTable)memory->user; local 925 FT_MemTable table = (FT_MemTable)memory->user; local [all...] |
/external/icu4c/samples/layout/ |
H A D | FontTableCache.cpp | 18 const void *table; member in struct:FontTableCacheEntry 33 fTableCache[i].table = NULL; 40 freeFontTable(fTableCache[i].table); 43 fTableCache[i].table = NULL; 52 void FontTableCache::freeFontTable(const void *table) const 54 LE_DELETE_ARRAY(table); 61 return fTableCache[i].table; 65 const void *table = readFontTable(tableTag); local 67 ((FontTableCache *) this)->add(tableTag, table); 69 return table; 72 add(LETag tableTag, const void *table) argument [all...] |
/external/icu4c/test/letest/ |
H A D | FontTableCache.cpp | 19 const void *table; member in struct:FontTableCacheEntry 34 fTableCache[i].table = NULL; 41 DELETE_ARRAY(fTableCache[i].table); 44 fTableCache[i].table = NULL; 52 void FontTableCache::freeFontTable(const void *table) const 54 DELETE_ARRAY(table); 61 return fTableCache[i].table; 65 const void *table = readFontTable(tableTag); local 67 ((FontTableCache *) this)->add(tableTag, table); 69 return table; 72 add(LETag tableTag, const void *table) argument [all...] |
/external/chromium-trace/trace-viewer/src/ |
H A D | timeline_analysis.css | 14 .timeline-analysis-table { 19 .timeline-analysis-table > tr > td:first-child { 23 .timeline-analysis-table > tr > td { 27 .timeline-analysis-table-header { 31 .timeline-analysis-table-row:nth-child(2n+0) { 35 .timeline-analysis-slice-table-col-0 { 37 .timeline-analysis-slice-table-col-1 { 40 .timeline-analysis-slices-table-col-0 { 42 .timeline-analysis-slices-table-col-1 { 45 .timeline-analysis-slices-table [all...] |
/external/dbus/dbus/ |
H A D | dbus-hash.h | 2 /* dbus-hash.h Generic hash table utility (internal to D-Bus implementation) 79 DBusHashTable* _dbus_hash_table_ref (DBusHashTable *table); 80 void _dbus_hash_table_unref (DBusHashTable *table); 81 void _dbus_hash_table_remove_all (DBusHashTable *table); 82 void _dbus_hash_iter_init (DBusHashTable *table, 93 dbus_bool_t _dbus_hash_iter_lookup (DBusHashTable *table, 97 void* _dbus_hash_table_lookup_string (DBusHashTable *table, 99 void* _dbus_hash_table_lookup_two_strings (DBusHashTable *table, 101 void* _dbus_hash_table_lookup_int (DBusHashTable *table, 103 void* _dbus_hash_table_lookup_pointer (DBusHashTable *table, [all...] |
H A D | dbus-hash.c | 2 /* dbus-hash.c Generic hash table utility (internal to D-Bus implementation) 8 * Hash table implementation based on generic/tclHash.c from the Tcl 83 * @defgroup DBusHashTable Hash table 91 * @defgroup DBusHashTableInternals Hash table implementation details 102 * the hash table to make it larger. 122 #define RANDOM_INDEX(table, i) \ 123 (((((intptr_t) (i))*1103515245) >> (table)->down_shift) & (table)->mask) 126 * Initial number of buckets in hash table (hash table staticall 214 DBusHashTable *table; /**< Pointer to table containing entry. */ member in struct:__anon4996 297 DBusHashTable *table; local 361 _dbus_hash_table_ref(DBusHashTable *table) argument 375 _dbus_hash_table_unref(DBusHashTable *table) argument 432 _dbus_hash_table_remove_all(DBusHashTable *table) argument 443 alloc_entry(DBusHashTable *table) argument 453 free_entry_data(DBusHashTable *table, DBusHashEntry *entry) argument 463 free_entry(DBusHashTable *table, DBusHashEntry *entry) argument 471 remove_entry(DBusHashTable *table, DBusHashEntry **bucket, DBusHashEntry *entry) argument 531 _dbus_hash_iter_init(DBusHashTable *table, DBusHashIter *iter) argument 774 _dbus_hash_iter_lookup(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashIter *iter) argument 805 add_allocated_entry(DBusHashTable *table, DBusHashEntry *entry, unsigned int idx, void *key, DBusHashEntry ***bucket) argument 833 add_entry(DBusHashTable *table, unsigned int idx, void *key, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 902 find_generic_function(DBusHashTable *table, void *key, unsigned int idx, KeyCompareFunc compare_func, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 943 find_string_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 980 find_two_strings_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 997 find_direct_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 1014 rebuild_table(DBusHashTable *table) argument 1151 _dbus_hash_table_lookup_string(DBusHashTable *table, const char *key) argument 1177 _dbus_hash_table_lookup_two_strings(DBusHashTable *table, const char *key) argument 1203 _dbus_hash_table_lookup_int(DBusHashTable *table, int key) argument 1230 _dbus_hash_table_lookup_pointer(DBusHashTable *table, void *key) argument 1256 _dbus_hash_table_lookup_uintptr(DBusHashTable *table, uintptr_t key) argument 1280 _dbus_hash_table_remove_string(DBusHashTable *table, const char *key) argument 1309 _dbus_hash_table_remove_two_strings(DBusHashTable *table, const char *key) argument 1338 _dbus_hash_table_remove_int(DBusHashTable *table, int key) argument 1368 _dbus_hash_table_remove_pointer(DBusHashTable *table, void *key) argument 1397 _dbus_hash_table_remove_uintptr(DBusHashTable *table, uintptr_t key) argument 1432 _dbus_hash_table_insert_string(DBusHashTable *table, char *key, void *value) argument 1467 _dbus_hash_table_insert_two_strings(DBusHashTable *table, char *key, void *value) argument 1509 _dbus_hash_table_insert_int(DBusHashTable *table, int key, void *value) argument 1552 _dbus_hash_table_insert_pointer(DBusHashTable *table, void *key, void *value) argument 1594 _dbus_hash_table_insert_uintptr(DBusHashTable *table, uintptr_t key, void *value) argument 1627 _dbus_hash_table_preallocate_entry(DBusHashTable *table) argument 1644 _dbus_hash_table_free_preallocated_entry(DBusHashTable *table, DBusPreallocatedHash *preallocated) argument 1671 _dbus_hash_table_insert_string_preallocated(DBusHashTable *table, DBusPreallocatedHash *preallocated, char *key, void *value) argument 1702 _dbus_hash_table_get_n_entries(DBusHashTable *table) argument 1718 count_entries(DBusHashTable *table) argument [all...] |
/external/libxml2/ |
H A D | hash.c | 55 * A single entry in the hash table 69 * The entire hash table 72 struct _xmlHashEntry *table; member in struct:_xmlHashTable 86 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument 92 value = table->random_seed; 110 return (value % table->size); 114 xmlHashComputeQKey(xmlHashTablePtr table, argument 122 value = table->random_seed; 162 return (value % table->size); 167 * @size: the size of the hash table 175 xmlHashTablePtr table; local 213 xmlHashTablePtr table; local 233 xmlHashGrow(xmlHashTablePtr table, int size) argument 324 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument 379 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument 396 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument 415 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument 435 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument 451 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument 466 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument 482 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument 500 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument 521 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument 637 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument 759 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument 803 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument 849 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument 865 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument 916 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument 937 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument 979 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument 1018 xmlHashSize(xmlHashTablePtr table) argument 1036 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument 1055 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument 1075 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument [all...] |
/external/v8/test/cctest/ |
H A D | test-dictionary.cc | 45 Handle<ObjectHashTable> table = FACTORY->NewObjectHashTable(23); local 48 table = PutIntoObjectHashTable(table, a, b); 49 CHECK_EQ(table->NumberOfElements(), 1); 50 CHECK_EQ(table->Lookup(*a), *b); 51 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value()); 55 CHECK_EQ(table->NumberOfElements(), 1); 56 CHECK_EQ(table->Lookup(*a), *b); 57 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value()); 60 table 106 Handle<ObjectHashSet> table = FACTORY->NewObjectHashSet(1); local 129 Handle<ObjectHashTable> table = FACTORY->NewObjectHashTable(1); local [all...] |
/external/chromium/chrome/browser/resources/options/ |
H A D | certificate_manager.css | 7 .certificate-tree-table {
|
/external/srec/portable/src/ |
H A D | phashtable.c | 40 PHashTable *table; member in struct:PHashTableEntry_t 76 PHashTable **table) 81 if (table == NULL || 125 *table = tmp; 129 ESR_ReturnCode PHashTableDestroy(PHashTable *table) argument 133 if (table == NULL) 136 block = table->entryBlock; 144 FREE(table->entries); 145 FREE(table); 149 ESR_ReturnCode PHashTableGetSize(PHashTable *table, argument 74 PHashTableCreate(PHashTableArgs *args, const LCHAR *memTag, PHashTable **table) argument 159 getEntry(PHashTable *table, const void *key, unsigned int hashCode, unsigned int idx) argument 208 PHashTableGetValue(PHashTable *table, const void *key, void **value) argument 231 PHashTableContainsKey(PHashTable *table, const void *key, ESR_BOOL* exists) argument 255 PHashTableGetEntry(PHashTable *table, const void *key, PHashTableEntry **entry) argument 274 PHashTableRehash(PHashTable *table) argument 338 PHashTablePutValue(PHashTable *table, const void *key, const void *value, void **oldValue) argument 422 PHashTableRemoveValue(PHashTable *table, const void *key, void **oldValue) argument 502 iteratorAdvance(PHashTable *table, PHashTableEntry *entry) argument 537 PHashTableEntryGetFirst(PHashTable *table, PHashTableEntry **entry) argument [all...] |
/external/valgrind/main/include/ |
H A D | pub_tool_hashtable.h | 3 /*--- A hash table implementation. pub_tool_hashtable.h ---*/ 34 /* Generic type for a separately-chained hash table. Via a kind of dodgy 52 /* Make a new table. Allocates the memory with VG_(calloc)(), so can 53 be freed with VG_(free)(). The table starts small but will 58 /* Count the number of nodes in a table. */ 59 extern Int VG_(HT_count_nodes) ( VgHashTable table ); 61 /* Add a node to the table. Duplicate keys are permitted. */ 64 /* Looks up a VgHashNode in the table. Returns NULL if not found. If entries 67 extern void* VG_(HT_lookup) ( VgHashTable table, UWord key ); 69 /* Removes a VgHashNode from the table [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | symbol_table.c | 30 * Link to the next symbol in the table with the same name 39 * Link to the next symbol in the table with the same scope 74 /** Linkage in list of all headers in a given symbol table. */ 101 /** Hash table containing all symbols in the symbol table. */ 107 /** List of all symbol headers in the table. */ 134 check_symbol_table(struct _mesa_symbol_table *table) argument 139 for (scope = table->current_scope; scope != NULL; scope = scope->next) { 159 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table) argument 161 struct scope_level *const scope = table 187 _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table) argument 198 find_symbol(struct _mesa_symbol_table *table, const char *name) argument 205 _mesa_symbol_table_iterator_ctor(struct _mesa_symbol_table *table, int name_space, const char *name) argument 280 _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *table, int name_space, const char *name) argument 302 _mesa_symbol_table_find_symbol(struct _mesa_symbol_table *table, int name_space, const char *name) argument 325 _mesa_symbol_table_add_symbol(struct _mesa_symbol_table *table, int name_space, const char *name, void *declaration) argument 380 _mesa_symbol_table_add_global_symbol(struct _mesa_symbol_table *table, int name_space, const char *name, void *declaration) argument 457 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local 471 _mesa_symbol_table_dtor(struct _mesa_symbol_table *table) argument [all...] |
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
H A D | symshift.pl | 3 # "plane" and create combined symbol table 9 # This script creates a symbol table which must be used when 87 and converts into one symbol table with ids in range [0..2^16-1] which 127 foreach $table (@alltables) { 128 $table{$plane{$table}} = $table; 184 foreach $table (@alltables) { 185 #printf STDERR "doing table $table (plan [all...] |