Searched refs:hash_entry (Results 1 - 7 of 7) sorted by path
/freebsd-11-stable/contrib/binutils/gas/ |
H A D | hash.c | 38 struct hash_entry { struct 40 struct hash_entry *next; 54 struct hash_entry **table; 118 alloc = size * sizeof (struct hash_entry *); 145 hash_entry, or NULL if the string is not in the table. If PLIST is 153 static struct hash_entry * 155 struct hash_entry ***plist, unsigned long *phash) 161 struct hash_entry **list; 162 struct hash_entry *p; 163 struct hash_entry *pre [all...] |
/freebsd-11-stable/contrib/binutils/ld/ |
H A D | ldlang.c | 1833 sort_def_symbol (hash_entry, info) 1834 struct bfd_link_hash_entry *hash_entry; 1837 if (hash_entry->type == bfd_link_hash_defined 1838 || hash_entry->type == bfd_link_hash_defweak) 1843 ud = get_userdata (hash_entry->u.def.section); 1848 init_map_userdata (0, hash_entry->u.def.section, 0); 1849 ud = get_userdata (hash_entry->u.def.section); 1855 def->entry = hash_entry; 3577 print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr) 3581 if ((hash_entry 3575 print_one_symbol(struct bfd_link_hash_entry *hash_entry, void *ptr) argument [all...] |
/freebsd-11-stable/contrib/flex/ |
H A D | sym.c | 42 struct hash_entry { struct 43 struct hash_entry *prev, *next; 49 typedef struct hash_entry **hash_table; 55 static struct hash_entry *ndtbl[NAME_TABLE_HASH_SIZE]; 56 static struct hash_entry *sctbl[START_COND_HASH_SIZE]; 57 static struct hash_entry *ccltab[CCL_HASH_SIZE]; 63 static struct hash_entry *findsym PROTO ((const char *sym, 83 struct hash_entry *sym_entry = table[hash_val]; 84 struct hash_entry *new_entry; 85 struct hash_entry *successo [all...] |
/freebsd-11-stable/contrib/gcc/config/rs6000/ |
H A D | rs6000.c | 15951 toc_hash_function (const void *hash_entry) 15954 (const struct toc_hash_struct *) hash_entry; 15916 toc_hash_function(const void *hash_entry) argument
|
/freebsd-11-stable/contrib/gcc/ |
H A D | protoize.c | 297 const hash_table_entry * hash_entry; /* -> to associated hash entry */ member in struct:file_info_struct 336 hash_table_entry * hash_entry; /* -> hash entry for function name */ member in struct:def_dec_info_struct 771 char const *f = fi_p->hash_entry->symbol; 1302 file_p->hash_entry = hash_entry_p; 1618 def_dec_p->hash_entry = lookup (function_name_primary, fn_string); 1640 for (other = def_dec_p->hash_entry->ddip; other; other = other->next_for_func) 1647 def_dec_p->file->hash_entry->symbol, 1649 def_dec_p->hash_entry->symbol); 1754 def_dec_p->next_for_func = def_dec_p->hash_entry->ddip; 1755 def_dec_p->hash_entry [all...] |
/freebsd-11-stable/usr.bin/catman/ |
H A D | catman.c | 104 struct hash_entry { struct 108 struct hash_entry *next; 114 static struct hash_entry *visited[HASHTABLE_ALLOC]; 115 static struct hash_entry *links[HASHTABLE_ALLOC]; 121 insert_hashtable(struct hash_entry **table, 126 struct hash_entry *new_entry; 127 struct hash_entry **chain; 129 new_entry = (struct hash_entry *) malloc(sizeof(struct hash_entry)); 144 find_hashtable(struct hash_entry **tabl [all...] |
/freebsd-11-stable/usr.bin/ctags/ |
H A D | C.c | 46 static void hash_entry(void); 133 hash_entry(); 318 * hash_entry -- 322 hash_entry(void) function
|
Completed in 481 milliseconds