/haiku-buildtools/legacy/gcc/gcc/ |
H A D | hash.h | 50 struct hash_table struct 64 struct hash_table *, 76 PARAMS ((struct hash_table *, 78 struct hash_table *, 85 PARAMS ((struct hash_table *, 87 struct hash_table *, 94 extern void hash_table_free PARAMS ((struct hash_table *)); 101 PARAMS ((struct hash_table *, hash_table_key key, boolean create, 106 PARAMS ((struct hash_entry *, struct hash_table *, 110 extern PTR hash_allocate PARAMS ((struct hash_table *, [all...] |
H A D | hash.c | 39 struct hash_table *table; 41 struct hash_table *, 74 struct hash_table *table; 76 struct hash_table *, 88 struct hash_table *table; 98 struct hash_table *table; 142 struct hash_table *table; 155 struct hash_table *table; 170 struct hash_table *table;
|
H A D | tlink.c | 78 static struct hash_table symbol_table; 81 struct hash_table *, 86 struct hash_table *, 90 struct hash_table *, 118 struct hash_table *table; 148 static struct hash_table file_table; 156 struct hash_table *table; 185 static struct hash_table demangled_table; 193 struct hash_table *table;
|
H A D | halfpic.c | 93 static struct all_refs *hash_table[MAX_HASH_TABLE]; 117 ptr = first = hash_table[hash]; 126 hash_table[hash] = ptr; 155 hash_table[hash] = ptr; 92 static struct all_refs *hash_table[MAX_HASH_TABLE]; local
|
/haiku-buildtools/gcc/libvtv/testsuite/other-tests/ |
H A D | replace-fail.cc | 8 __vtv_verify_fail (void **hash_table, const void *vtbl_ptr) argument
|
/haiku-buildtools/gcc/libcpp/ |
H A D | identifiers.c | 61 pfile->hash_table = table; 83 ht_destroy (pfile->hash_table); 94 return CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_ALLOC)); 103 node = CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_NO_INSERT)); 119 ht_forall (pfile->hash_table, (ht_cb) cb, v);
|
/haiku-buildtools/gcc/gcc/ |
H A D | hash-table.h | 134 hash_table <some_type_hasher> some_type_hash_table; 139 You can then used any of the functions in hash_table's public interface. 140 See hash_table for details. The interface is very similar to libiberty's 150 hash_table <pointer_hash <whatever_type>> whatever_type_hash_table; 162 typedef hash_table <some_info_hasher> info_table_type; 606 class hash_table class 612 class hash_table<Descriptor, Allocator, false> class 618 hash_table (size_t); 619 ~hash_table (); 754 hash_table<Descripto function in class:hash_table 1113 class hash_table<Descriptor, Allocator, true> class 1298 hash_table<Descriptor, Allocator, true>::hash_table (size_t size, bool ggc) : function in class:hash_table [all...] |
H A D | tree-hasher.h | 66 typedef hash_table <int_tree_hasher> int_tree_htab_type;
|
H A D | vtable-verify.h | 67 typedef hash_table<registration_hasher> register_table_type;
|
H A D | gimple-ssa.h | 99 hash_table<ssa_name_hasher> *default_defs; 117 hash_table<tm_restart_hasher> *tm_restart;
|
H A D | tree-vectorizer.c | 121 /* hash_table support. */ 157 /* hash_table support. */ 180 adjust_simduid_builtins (hash_table<simduid_to_vf> *htab) 241 hash_table<simd_array_to_simduid> **htab; 262 *ns->htab = new hash_table<simd_array_to_simduid> (15); 283 note_simd_array_uses (hash_table<simd_array_to_simduid> **htab) 326 (hash_table<simd_array_to_simduid> *simd_array_to_simduid_htab, 327 hash_table<simduid_to_vf> *simduid_to_vf_htab) 329 for (hash_table<simd_array_to_simduid>::iterator iter 447 hash_table<simduid_to_v [all...] |
H A D | libfuncs.h | 78 hash_table<libfunc_hasher> *GTY(()) x_libfunc_hash;
|
H A D | valtrack.h | 42 /* Descriptor for hash_table to hash by dead_debug_global_entry's REG 86 hash_table<dead_debug_hash_descr> *htab;
|
H A D | hash-map.h | 254 for (typename hash_table<hash_entry>::iterator iter = m_table.begin (); 262 for (typename hash_table<hash_entry>::iterator iter = m_table.begin (); 273 explicit iterator (const typename hash_table<hash_entry>::iterator &iter) : 295 typename hash_table<hash_entry>::iterator m_iter; 309 hash_table<hash_entry> m_table;
|
H A D | cfg.c | 1071 static hash_table<bb_copy_hasher> *bb_original; 1072 static hash_table<bb_copy_hasher> *bb_copy; 1075 static hash_table<bb_copy_hasher> *loop_copy; 1088 bb_original = new hash_table<bb_copy_hasher> (10); 1089 bb_copy = new hash_table<bb_copy_hasher> (10); 1090 loop_copy = new hash_table<bb_copy_hasher> (10); 1112 copy_original_table_clear (hash_table<bb_copy_hasher> *tab, unsigned obj) 1134 copy_original_table_set (hash_table<bb_copy_hasher> *tab,
|
H A D | hash-set.h | 224 for (typename hash_table<hash_entry>::iterator iter = m_table.begin (); 239 hash_table<hash_entry> m_table;
|
H A D | lto-streamer.c | 314 static hash_table<tree_hash_entry> *tree_htab; 331 tree_htab = new hash_table<tree_hash_entry> (31);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | ifc-4.c | 27 struct ht *hash_table; member in struct:cpp_reader 35 (cpp_token *) pfile->hash_table->alloc_subobject (sizeof (cpp_token)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr58464.C | 72 ht *hash_table; member in struct:cpp_reader 104 cpp_hashnode *result = (cpp_hashnode *) ht_lookup_with_hash(pfile->hash_table, base, cur - base, hash, HT_NO_INSERT);
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | elf32-sh-symbian.c | 442 struct elf_link_hash_table * hash_table; local 450 hash_table = elf_hash_table (info); 463 ptr->current_hash = elf_link_hash_lookup (hash_table, ptr->current_name, FALSE, FALSE, TRUE); 472 new_hash = elf_link_hash_lookup (hash_table, ptr->new_name, FALSE, FALSE, TRUE);
|
/haiku-buildtools/binutils/bfd/ |
H A D | elf32-sh-symbian.c | 444 struct elf_link_hash_table * hash_table; local 452 hash_table = elf_hash_table (info); 465 ptr->current_hash = elf_link_hash_lookup (hash_table, ptr->current_name, FALSE, FALSE, TRUE); 474 new_hash = elf_link_hash_lookup (hash_table, ptr->new_name,
|
/haiku-buildtools/gcc/gcc/cp/ |
H A D | cp-objcp-common.c | 191 hash_table<tree_decl_map_cache_hasher> *shadowed_var_for_decl; 224 = hash_table<tree_decl_map_cache_hasher>::create_ggc (512);
|
/haiku-buildtools/gcc/gcc/config/ |
H A D | sol2.c | 211 static hash_table<comdat_entry_hasher> *solaris_comdat_htab; 253 solaris_comdat_htab = new hash_table<comdat_entry_hasher> (37);
|
/haiku-buildtools/legacy/binutils/opcodes/ |
H A D | sparc-dis.c | 396 sparc_opcode_hash **hash_table, 406 memset (hash_table, 0, HASH_SIZE * sizeof (hash_table[0])); 416 h->next = hash_table[hash]; 418 hash_table[hash] = h; 395 build_hash_table(const sparc_opcode **opcode_table, sparc_opcode_hash **hash_table, int num_opcodes) argument
|
/haiku-buildtools/binutils/opcodes/ |
H A D | sparc-dis.c | 429 sparc_opcode_hash **hash_table, 439 memset (hash_table, 0, HASH_SIZE * sizeof (hash_table[0])); 449 h->next = hash_table[hash]; 451 hash_table[hash] = h; 428 build_hash_table(const sparc_opcode **opcode_table, sparc_opcode_hash **hash_table, int num_opcodes) argument
|