/dflybsd-src/usr.bin/top/ |
H A D | hash.h | 63 typedef struct hash_table { struct 66 } hash_table; argument 76 hash_table *hash_create(int num); 77 void hash_sizeinfo(unsigned int *sizes, int max, hash_table *ht); 87 void *hash_add_uint(hash_table *ht, unsigned int key, void *value); 88 void *hash_replace_uint(hash_table *ht, unsigned int key, void *value); 89 void *hash_lookup_uint(hash_table *ht, unsigned int key); 90 void *hash_remove_uint(hash_table *ht, unsigned int key); 91 hash_item_uint *hash_first_uint(hash_table *ht, hash_pos *pos); 101 void *hash_add_pid(hash_table *ht, pid_t key, void *value); [all …]
|
H A D | hash.c | 124 string_hash(hash_table *ht, char *key) in string_hash() 224 hash_table * 228 hash_table *result; in hash_create() 234 result = (hash_table *)malloc(sizeof(hash_table)); in hash_create() 262 hash_count(hash_table *ht) in hash_count() 287 hash_sizeinfo(unsigned int *sizes, int max, hash_table *ht) in hash_sizeinfo() 323 hash_add_uint(hash_table *ht, unsigned int key, void *value) in hash_add_uint() 386 hash_replace_uint(hash_table *ht, unsigned int key, void *value) in hash_replace_uint() 438 hash_lookup_uint(hash_table *ht, unsigned int key) in hash_lookup_uint() 476 hash_remove_uint(hash_table *ht, unsigned int key) in hash_remove_uint() [all …]
|
/dflybsd-src/contrib/lvm2/dist/libdm/datastruct/ |
H A D | hash.h | 21 struct hash_table; 26 struct hash_table *hash_create(unsigned size_hint); 27 void hash_destroy(struct hash_table *t); 28 void hash_wipe(struct hash_table *t); 30 void *hash_lookup(struct hash_table *t, const char *key); 31 int hash_insert(struct hash_table *t, const char *key, void *data); 32 void hash_remove(struct hash_table *t, const char *key); 34 void *hash_lookup_binary(struct hash_table *t, const char *key, uint32_t len); 35 int hash_insert_binary(struct hash_table *t, const char *key, uint32_t len, 37 void hash_remove_binary(struct hash_table *t, const char *key, uint32_t len); [all …]
|
/dflybsd-src/contrib/gcc-8.0/gcc/ |
H A D | hash-table.h | 358 class hash_table 364 explicit hash_table (size_t, bool ggc = false, 368 explicit hash_table (const hash_table &, bool ggc = false, 372 ~hash_table (); 375 static hash_table * 378 hash_table *table = ggc_alloc<hash_table> (); in create_ggc() 379 new (table) hash_table (n, true, GATHER_STATISTICS, in create_ggc() 488 template<typename T> friend void gt_ggc_mx (hash_table<T> *); 489 template<typename T> friend void gt_pch_nx (hash_table<T> *); 497 template<typename T> friend void gt_pch_nx (hash_table<T> *, [all …]
|
H A D | hash-set.h | 74 for (typename hash_table<Traits>::iterator iter = m_table.begin (); in traverse() 90 explicit iterator (const typename hash_table<Traits>::iterator &iter) : in iterator() 112 typename hash_table<Traits>::iterator m_iter; 127 hash_table<Traits> m_table;
|
H A D | tree-vectorizer.c | 154 adjust_simduid_builtins (hash_table<simduid_to_vf> *htab) in adjust_simduid_builtins() 247 hash_table<simd_array_to_simduid> **htab; 268 *ns->htab = new hash_table<simd_array_to_simduid> (15); in note_simd_array_uses_cb() 289 note_simd_array_uses (hash_table<simd_array_to_simduid> **htab) in note_simd_array_uses() 332 (hash_table<simd_array_to_simduid> *simd_array_to_simduid_htab, in shrink_simd_arrays() 333 hash_table<simduid_to_vf> *simduid_to_vf_htab) in shrink_simd_arrays() 335 for (hash_table<simd_array_to_simduid>::iterator iter in shrink_simd_arrays() 579 hash_table<simduid_to_vf> *simduid_to_vf_htab = NULL; in vectorize_loops() 580 hash_table<simd_array_to_simduid> *simd_array_to_simduid_htab = NULL; in vectorize_loops() 750 simduid_to_vf_htab = new hash_table<simduid_to_vf> (15); in vectorize_loops() [all …]
|
H A D | hash-map.h | 195 for (typename hash_table<hash_entry>::iterator iter = m_table.begin (); in class() 204 for (typename hash_table<hash_entry>::iterator iter = m_table.begin (); in class() 217 explicit iterator (const typename hash_table<hash_entry>::iterator &iter) : in class() 239 typename hash_table<hash_entry>::iterator m_iter; in class() 254 hash_table<hash_entry> m_table; in class()
|
H A D | gentarget-def.c | 53 static hash_table <insn_hasher> *insns; 57 static hash_table <nofree_string_hash> *stubs; 289 insns = new hash_table <insn_hasher> (31); in main() 290 stubs = new hash_table <nofree_string_hash> (31); in main()
|
H A D | tree-ssa-scopedtables.h | 130 avail_exprs_stack (hash_table<expr_elt_hasher> *table) in avail_exprs_stack() 146 hash_table<expr_elt_hasher> *avail_exprs (void) in avail_exprs() 157 hash_table<expr_elt_hasher> *m_avail_exprs;
|
H A D | cfg.c | 991 static hash_table<bb_copy_hasher> *bb_original; 992 static hash_table<bb_copy_hasher> *bb_copy; 995 static hash_table<bb_copy_hasher> *loop_copy; 1005 bb_original = new hash_table<bb_copy_hasher> (10); in initialize_original_copy_tables() 1006 bb_copy = new hash_table<bb_copy_hasher> (10); in initialize_original_copy_tables() 1007 loop_copy = new hash_table<bb_copy_hasher> (10); in initialize_original_copy_tables() 1050 copy_original_table_clear (hash_table<bb_copy_hasher> *tab, unsigned obj) in copy_original_table_clear() 1072 copy_original_table_set (hash_table<bb_copy_hasher> *tab, in copy_original_table_set()
|
H A D | gimple-ssa.h | 96 hash_table<ssa_name_hasher> *default_defs; 114 hash_table<tm_restart_hasher> *tm_restart;
|
H A D | hsa-common.c | 75 hash_table <hsa_noop_symbol_hasher> *hsa_global_variable_symbols; 109 hsa_global_variable_symbols = new hash_table <hsa_noop_symbol_hasher> (8); in hsa_init_compilation_unit_data() 111 hsa_emitted_internal_decls = new hash_table <hsa_internal_fn_hasher> (2); in hsa_init_compilation_unit_data() 125 for (hash_table <hsa_noop_symbol_hasher>::iterator it in hsa_deinit_compilation_unit_data()
|
/dflybsd-src/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder_hash.h | 21 # 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)) \ 88 ^ hash_table[cur[1]]) & 0xFFFF 92 = (hash_table[cur[0]] ^ cur[1]) & HASH_2_MASK [all …]
|
/dflybsd-src/contrib/gcc-4.7/libcpp/include/ |
H A D | symtab.h | 41 typedef struct ht hash_table; typedef 54 hashnode (*alloc_node) (hash_table *); 74 extern hash_table *ht_create (unsigned int order); 77 extern void ht_destroy (hash_table *); 79 extern hashnode ht_lookup (hash_table *, const unsigned char *, 81 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *, 91 extern void ht_forall (hash_table *, ht_cb, const void *); 95 extern void ht_purge (hash_table *, ht_cb, const void *); 98 extern void ht_load (hash_table *ht, hashnode *entries, 102 extern void ht_dump_statistics (hash_table *);
|
/dflybsd-src/tools/tools/toeplitz/ |
H A D | toeplitz.c | 23 static uint32_t hash_table[HASHLEN][256]; variable 92 toeplitz_init(hash_table, HASHLEN, toeplitz_key, KEYLEN); in main() 94 res = hash_table[0][(saddr >> 0) & 0xff]; in main() 95 res ^= hash_table[1][(saddr >> 8) & 0xff]; in main() 96 res ^= hash_table[2][(saddr >> 16) & 0xff]; in main() 97 res ^= hash_table[3][(saddr >> 24) & 0xff]; in main() 98 res ^= hash_table[4][(daddr >> 0) & 0xff]; in main() 99 res ^= hash_table[5][(daddr >> 8) & 0xff]; in main() 100 res ^= hash_table[6][(daddr >> 16) & 0xff]; in main() 101 res ^= hash_table[7][(daddr >> 24) & 0xff]; in main() [all …]
|
/dflybsd-src/contrib/gcc-4.7/libcpp/ |
H A D | identifiers.c | 31 static hashnode alloc_node (hash_table *); 36 alloc_node (hash_table *table) in alloc_node() 48 _cpp_init_hashtable (cpp_reader *pfile, hash_table *table) in _cpp_init_hashtable() 64 pfile->hash_table = table; in _cpp_init_hashtable() 84 ht_destroy (pfile->hash_table); in _cpp_destroy_hashtable() 95 return CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_ALLOC)); in cpp_lookup() 104 node = CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_NO_INSERT)); in cpp_defined() 120 ht_forall (pfile->hash_table, (ht_cb) cb, v); in cpp_forall_identifiers()
|
H A D | symtab.c | 34 static void ht_expand (hash_table *); 56 hash_table * 60 hash_table *table; in ht_create() 62 table = XCNEW (hash_table); in ht_create() 80 ht_destroy (hash_table *table) in ht_destroy() 94 ht_lookup (hash_table *table, const unsigned char *str, size_t len, in ht_lookup() 102 ht_lookup_with_hash (hash_table *table, const unsigned char *str, in ht_lookup_with_hash() 185 ht_expand (hash_table *table) in ht_expand() 227 ht_forall (hash_table *table, ht_cb cb, const void *v) in ht_forall() 245 ht_purge (hash_table *table, ht_cb cb, const void *v) in ht_purge() [all …]
|
/dflybsd-src/contrib/ncurses/ncurses/tinfo/ |
H A D | make_hash.c | 115 HashValue * hash_table, in _nc_make_hash_table() argument 123 hash_table[i] = UNUSED; in _nc_make_hash_table() 128 if (hash_table[hashvalue] >= 0) in _nc_make_hash_table() 131 if (hash_table[hashvalue] != UNUSED) { in _nc_make_hash_table() 132 table[i].ute_link = hash_table[hashvalue]; in _nc_make_hash_table() 134 hash_table[hashvalue] = (HashValue) i; in _nc_make_hash_table() 252 HashValue *hash_table = typeCalloc(HashValue, HASHTABSIZE); in main() local 276 || hash_table == 0) { in main() 353 _nc_make_hash_table(name_table, hash_table, tablesize); in main() 424 printf("\t%3d,\n", hash_table[n]); in main() [all …]
|
H A D | comp_hash.c | 57 const HashValue * hash_table) in NCURSES_EXPORT() 59 bool termcap = (hash_table != _nc_get_hash_table(FALSE)); in NCURSES_EXPORT()
|
/dflybsd-src/contrib/gcc-8.0/libcpp/ |
H A D | identifiers.c | 61 pfile->hash_table = table; in _cpp_init_hashtable() 85 ht_destroy (pfile->hash_table); in _cpp_destroy_hashtable() 96 return CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_ALLOC)); in cpp_lookup() 105 node = CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_NO_INSERT)); in cpp_defined() 121 ht_forall (pfile->hash_table, (ht_cb) cb, v); in cpp_forall_identifiers()
|
/dflybsd-src/contrib/flex/src/ |
H A D | sym.c | 49 typedef struct hash_entry **hash_table; typedef 62 static int addsym(char[], char *, int, hash_table, int); 63 static struct hash_entry *findsym (const char *sym, hash_table table, 73 static int addsym (char sym[], char *str_def, int int_def, hash_table table, int table_size) in addsym() 138 static struct hash_entry *findsym (const char *sym, hash_table table, int table_size) in findsym()
|
/dflybsd-src/contrib/grep/lib/ |
H A D | hash.h | 67 struct hash_table; 69 typedef struct hash_table Hash_table;
|
H A D | fts_.h | 169 struct hash_table *fts_leaf_optimization_works_ht; 184 struct hash_table *ht;
|
/dflybsd-src/contrib/gcc-4.7/gcc/ |
H A D | stringpool.c | 52 static hashnode alloc_node (hash_table *); 73 alloc_node (hash_table *table ATTRIBUTE_UNUSED) in alloc_node()
|
/dflybsd-src/contrib/gdb-7/bfd/ |
H A D | dwarf2.c | 409 struct info_hash_table *hash_table; in create_info_hash_table() local 411 hash_table = ((struct info_hash_table *) in create_info_hash_table() 413 if (!hash_table) in create_info_hash_table() 414 return hash_table; in create_info_hash_table() 416 if (!bfd_hash_table_init (&hash_table->base, info_hash_table_newfunc, in create_info_hash_table() 419 bfd_release (abfd, hash_table); in create_info_hash_table() 423 return hash_table; in create_info_hash_table() 432 insert_info_hash_table (struct info_hash_table *hash_table, in insert_info_hash_table() argument 440 entry = (struct info_hash_entry*) bfd_hash_lookup (&hash_table->base, in insert_info_hash_table() 445 node = (struct info_list_node *) bfd_hash_allocate (&hash_table->base, in insert_info_hash_table() [all …]
|