Searched refs:hash_table (Results 1 - 25 of 34) sorted by relevance

12

/freebsd-11-stable/contrib/gcclibs/libcpp/include/
H A Dsymtab.h37 typedef struct ht hash_table; typedef in typeref:struct:ht
50 hashnode (*alloc_node) (hash_table *);
70 extern hash_table *ht_create (unsigned int order);
73 extern void ht_destroy (hash_table *);
75 extern hashnode ht_lookup (hash_table *, const unsigned char *,
77 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *,
87 extern void ht_forall (hash_table *, ht_cb, const void *);
90 extern void ht_load (hash_table *ht, hashnode *entries,
94 extern void ht_dump_statistics (hash_table *);
/freebsd-11-stable/contrib/xz/src/liblzma/lz/
H A Dlz_encoder_hash.h21 # define hash_table lzma_lz_hash_table macro
24 # define hash_table lzma_crc32_table[0] macro
50 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
56 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
61 ^ (hash_table[cur[3]] << 5)) & mf->hash_mask
67 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
72 ^ hash_table[cur[3]] << 5); \
74 = (hash_4_value ^ (hash_table[cur[4]] << 3)) \
82 ^ hash_table[cur[2]]) & 0xFFFF
88 ^ hash_table[cu
[all...]
/freebsd-11-stable/contrib/gcclibs/libcpp/
H A Didentifiers.c31 static cpp_hashnode *alloc_node (hash_table *);
36 alloc_node (hash_table *table)
48 _cpp_init_hashtable (cpp_reader *pfile, hash_table *table)
56 table->alloc_node = (hashnode (*) (hash_table *)) alloc_node;
64 pfile->hash_table = table;
84 ht_destroy (pfile->hash_table);
95 return CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_ALLOC));
104 node = CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_NO_INSERT));
117 ht_forall (pfile->hash_table, (ht_cb) cb, v);
H A Dsymtab.c34 static void ht_expand (hash_table *);
53 hash_table *
57 hash_table *table;
59 table = XCNEW (hash_table);
77 ht_destroy (hash_table *table)
94 ht_lookup (hash_table *table, const unsigned char *str, size_t len,
102 ht_lookup_with_hash (hash_table *table, const unsigned char *str,
179 ht_expand (hash_table *table)
221 ht_forall (hash_table *table, ht_cb cb, const void *v)
238 ht_load (hash_table *h
[all...]
H A Dinternal.h430 struct ht *hash_table; member in struct:cpp_reader
522 extern void _cpp_init_hashtable (cpp_reader *, hash_table *);
H A Dmacro.c1457 if (pfile->hash_table->alloc_subobject)
1460 (cpp_hashnode **) pfile->hash_table->alloc_subobject
1571 if (pfile->hash_table->alloc_subobject)
1574 (cpp_token *) pfile->hash_table->alloc_subobject (sizeof (cpp_token)
1593 if (pfile->hash_table->alloc_subobject)
1594 macro = (cpp_macro *) pfile->hash_table->alloc_subobject
/freebsd-11-stable/sbin/dhclient/
H A Dalloc.c59 struct hash_table *
62 struct hash_table *rval;
64 rval = calloc(1, sizeof(struct hash_table) -
H A Dhash.c50 struct hash_table *
53 struct hash_table *rv = new_hash_table(DEFAULT_HASH_SIZE);
78 void add_hash(struct hash_table *table, const unsigned char *name, int len,
104 hash_lookup(struct hash_table *table, unsigned char *name, int len)
H A Dtree.h61 struct hash_table *hash;
H A Ddhcpd.h238 struct hash_table { struct
297 struct hash_table *new_hash_table(int);
327 struct hash_table *new_hash(void);
328 void add_hash(struct hash_table *, const unsigned char *, int, unsigned char *);
329 void *hash_lookup(struct hash_table *, unsigned char *, int);
335 extern struct hash_table universe_hash;
H A Dtables.c426 struct hash_table universe_hash;
/freebsd-11-stable/contrib/top/
H A Dusername.c50 #define is_empty_hash(x) (hash_table[x].name[0] == 0)
54 the hash_table. Applied abs() function to fix. 2/16/96 tpugh
59 /* We depend on that for hash_table and YOUR compiler had BETTER do it! */
60 struct hash_el hash_table[Table_size]; variable in typeref:struct:hash_el
82 if (is_empty_hash(hashindex) || (hash_table[hashindex].uid != uid))
87 return(hash_table[hashindex].name);
132 if (hash_table[hashindex].uid == uid)
137 hash_table[hashindex].uid = uid;
138 (void) strncpy(hash_table[hashindex].name, name, MAXLOGNAME - 1);
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/
H A Dmake_hash.c52 * Takes the entries in table[] and hashes them into hash_table[]
54 * slots in hash_table[].
105 HashValue * hash_table)
112 hash_table[i] = -1;
117 if (hash_table[hashvalue] >= 0)
120 if (hash_table[hashvalue] != 0)
121 table[i].nte_link = hash_table[hashvalue];
122 hash_table[hashvalue] = i;
196 HashValue *hash_table = typeCalloc(HashValue, HASHTABSIZE); local
219 || hash_table
104 _nc_make_hash_table(struct name_table_entry *table, HashValue * hash_table) argument
[all...]
H A Dcomp_hash.c56 const HashValue * hash_table)
58 bool termcap = (hash_table != _nc_get_hash_table(FALSE));
55 _nc_find_entry(const char *string, const HashValue * hash_table) argument
/freebsd-11-stable/contrib/flex/
H A Dsym.c49 typedef struct hash_entry **hash_table; typedef in typeref:struct:hash_entry
62 static int addsym PROTO ((char[], char *, int, hash_table, int));
64 hash_table table,
79 hash_table table;
151 hash_table table;
/freebsd-11-stable/contrib/gcc/
H A Dstringpool.c53 static hashnode alloc_node (hash_table *);
75 alloc_node (hash_table *table ATTRIBUTE_UNUSED)
H A Dgcse.c343 struct hash_table
360 static struct hash_table expr_hash_table;
363 static struct hash_table set_hash_table;
530 static void hash_scan_insn (rtx, struct hash_table *, int);
531 static void hash_scan_set (rtx, rtx, struct hash_table *);
532 static void hash_scan_clobber (rtx, rtx, struct hash_table *);
533 static void hash_scan_call (rtx, rtx, struct hash_table *);
541 struct hash_table *);
542 static void insert_set_in_table (rtx, rtx, struct hash_table *);
549 static void compute_hash_table (struct hash_table *);
342 struct hash_table struct
[all...]
/freebsd-11-stable/contrib/groff/src/utils/indxbib/
H A Dindxbib.cpp77 table_entry *hash_table; variable
79 // We make this the same size as hash_table so we only have to do one
671 hash_table = new table_entry[hash_table_size];
673 hash_table[i].ptr = 0;
708 table_entry *pp = hash_table + h;
724 block *ptr = hash_table[i].ptr;
726 hash_table[i].count = -1;
728 hash_table[i].count = li;
748 fwrite_or_die(hash_table, sizeof(int), hash_table_size, indxfp);
752 fwrite_or_die(&hash_table[
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/
H A DAppleObjCRuntimeV2.h116 RemoteNXMapTable &hash_table);
118 void UpdateSignature(const RemoteNXMapTable &hash_table);
294 bool UpdateISAToDescriptorMapFromMemory(RemoteNXMapTable &hash_table);
297 UpdateISAToDescriptorMapDynamic(RemoteNXMapTable &hash_table);
H A DAppleObjCRuntimeV2.cpp1144 const RemoteNXMapTable &hash_table) {
1145 m_count = hash_table.GetCount();
1146 m_num_buckets = hash_table.GetBucketCount();
1147 m_buckets_ptr = hash_table.GetBucketDataPointer();
1152 RemoteNXMapTable &hash_table) {
1153 if (!hash_table.ParseHeader(process, runtime->GetISAHashTablePointer())) {
1159 if (m_count == hash_table.GetCount() &&
1160 m_num_buckets == hash_table.GetBucketCount() &&
1161 m_buckets_ptr == hash_table.GetBucketDataPointer()) {
1286 RemoteNXMapTable &hash_table) {
[all...]
/freebsd-11-stable/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dst_parse.c54 static tdesc_t *hash_table[BUCKETS]; variable
130 hash_table[i] = NULL;
466 tdesc_t *tdp = hash_table[bucket];
1094 tdp->t_hash = hash_table[hash];
1095 hash_table[hash] = tdp;
1138 if (hash_table[i]) {
1139 for (tdp = hash_table[i]->t_hash;
1140 tdp && tdp != hash_table[i];
/freebsd-11-stable/contrib/binutils/opcodes/
H A Dsparc-dis.c396 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
/freebsd-11-stable/contrib/binutils/bfd/
H A Darchive.c272 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
276 if (hash_table)
278 struct ar_cache *entry = (struct ar_cache *) htab_find (hash_table, &m);
310 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
313 if (hash_table == NULL)
315 hash_table = htab_create_alloc (16, hash_file_ptr, eq_file_ptr,
317 if (hash_table == NULL)
319 bfd_ardata (arch_bfd)->cache = hash_table;
326 *htab_find_slot (hash_table, (const void *) cache, INSERT) = cache;
270 htab_t hash_table = bfd_ardata (arch_bfd)->cache; local
308 htab_t hash_table = bfd_ardata (arch_bfd)->cache; local
H A Delf32-arm.c2510 struct elf32_arm_link_hash_table *hash_table; local
2513 hash_table = elf32_arm_hash_table (link_info);
2523 (&(hash_table)->root, tmp_name, FALSE, FALSE, TRUE);
2543 struct elf32_arm_link_hash_table *hash_table; local
2546 hash_table = elf32_arm_hash_table (link_info);
2556 (&(hash_table)->root, tmp_name, FALSE, FALSE, TRUE);
2732 /* The only trick here is using hash_table->arm_glue_size as the value.
2770 struct elf32_arm_link_hash_table *hash_table; local
2773 hash_table = elf32_arm_hash_table (link_info);
2775 BFD_ASSERT (hash_table !
2879 struct elf32_arm_link_hash_table *hash_table; local
[all...]
H A Delflink.c136 struct elf_link_hash_table *hash_table;
138 hash_table = elf_hash_table (info);
139 if (hash_table->dynobj == NULL)
140 hash_table->dynobj = abfd;
142 if (hash_table->dynstr == NULL)
144 hash_table->dynstr = _bfd_elf_strtab_init ();
145 if (hash_table->dynstr == NULL)
2721 struct elf_link_hash_table *hash_table;
2747 hash_table = elf_hash_table (info);
2748 if (!is_elf_hash_table (hash_table))
135 struct elf_link_hash_table *hash_table; local
2714 struct elf_link_hash_table *hash_table; local
2777 struct elf_link_hash_table *hash_table; local
2989 struct elf_link_hash_table *hash_table; local
3029 struct elf_link_hash_table *hash_table; local
3126 struct elf_link_hash_table *hash_table = elf_hash_table (info); local
[all...]

Completed in 307 milliseconds

12