| /src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| 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...] |
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| hash.h | 29 typedef struct hash_table struct
37 hash_table; typedef in typeref:struct:hash_table
42 extern int hash_init (hash_table *htab, unsigned long int init_size);
46 extern int hash_destroy (hash_table *htab);
50 extern int hash_find_entry (hash_table *htab,
58 extern const void * hash_insert_entry (hash_table *htab,
64 extern int hash_set_value (hash_table *htab,
72 extern int hash_iterate (hash_table *htab, void **ptr,
81 extern int hash_iterate_modify (hash_table *htab, void **ptr,
|
| hash.c | 90 hash_init (hash_table *htab, unsigned long int init_size)
110 hash_destroy (hash_table *htab)
148 lookup (hash_table *htab,
191 hash_find_entry (hash_table *htab, const void *key, size_t keylen,
209 insert_entry_2 (hash_table *htab,
239 resize (hash_table *htab)
267 hash_insert_entry (hash_table *htab,
294 hash_set_value (hash_table *htab,
326 hash_iterate (hash_table *htab, void **ptr, const void **key, size_t *keylen,
359 hash_iterate_modify (hash_table *htab, void **ptr
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/libgettextpo/ |
| hash.h | 29 typedef struct hash_table struct
37 hash_table; typedef in typeref:struct:hash_table
42 extern int hash_init (hash_table *htab, unsigned long int init_size);
46 extern int hash_destroy (hash_table *htab);
50 extern int hash_find_entry (hash_table *htab,
58 extern const void * hash_insert_entry (hash_table *htab,
64 extern int hash_set_value (hash_table *htab,
72 extern int hash_iterate (hash_table *htab, void **ptr,
81 extern int hash_iterate_modify (hash_table *htab, void **ptr,
|
| hash.c | 90 hash_init (hash_table *htab, unsigned long int init_size)
110 hash_destroy (hash_table *htab)
148 lookup (hash_table *htab,
191 hash_find_entry (hash_table *htab, const void *key, size_t keylen,
209 insert_entry_2 (hash_table *htab,
239 resize (hash_table *htab)
267 hash_insert_entry (hash_table *htab,
294 hash_set_value (hash_table *htab,
326 hash_iterate (hash_table *htab, void **ptr, const void **key, size_t *keylen,
359 hash_iterate_modify (hash_table *htab, void **ptr
[all...] |
| /src/external/gpl2/gettext/dist/gnulib-local/lib/ |
| hash.h | 29 typedef struct hash_table struct
37 hash_table; typedef in typeref:struct:hash_table
42 extern int hash_init (hash_table *htab, unsigned long int init_size);
46 extern int hash_destroy (hash_table *htab);
50 extern int hash_find_entry (hash_table *htab,
58 extern const void * hash_insert_entry (hash_table *htab,
64 extern int hash_set_value (hash_table *htab,
72 extern int hash_iterate (hash_table *htab, void **ptr,
81 extern int hash_iterate_modify (hash_table *htab, void **ptr,
|
| hash.c | 90 hash_init (hash_table *htab, unsigned long int init_size)
110 hash_destroy (hash_table *htab)
148 lookup (hash_table *htab,
191 hash_find_entry (hash_table *htab, const void *key, size_t keylen,
209 insert_entry_2 (hash_table *htab,
239 resize (hash_table *htab)
267 hash_insert_entry (hash_table *htab,
294 hash_set_value (hash_table *htab,
326 hash_iterate (hash_table *htab, void **ptr, const void **key, size_t *keylen,
359 hash_iterate_modify (hash_table *htab, void **ptr
[all...] |
| /src/external/bsd/top/dist/ |
| hash.h | 63 typedef struct hash_table { struct
66 } hash_table; typedef in typeref:struct:hash_table
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...] |
| hash.m4h | 63 typedef struct hash_table {
66 } hash_table;
76 hash_table *hash_create(int num);
77 void hash_sizeinfo(unsigned int *sizes, int max, hash_table *ht);
85 void *hash_add_$1(hash_table *ht, $2 key, void *value);
86 void *hash_replace_$1(hash_table *ht, $2 key, void *value);
87 void *hash_lookup_$1(hash_table *ht, $2 key);
88 void *hash_remove_$1(hash_table *ht, $2 key);
89 hash_item_$1 *hash_first_$1(hash_table *ht, hash_pos *pos);
|
| /src/external/mpl/dhcp/dist/includes/omapip/ |
| hash.h | 61 struct hash_table { struct
75 struct hash_table *hash;
96 add_hash ((struct hash_table *)table, buf, \
103 delete_hash_entry ((struct hash_table *)table, buf, len, \
111 (struct hash_table *)table, \
117 return hash_report((struct hash_table *)table); \
122 return hash_foreach ((struct hash_table *)table, \
128 return new_hash ((struct hash_table **)tp, \
135 free_hash_table ((struct hash_table **)table, file, line); \
139 int new_hash_table (struct hash_table **, unsigned, const char *, int)
[all...] |
| /src/external/public-domain/xz/dist/src/liblzma/lz/ |
| lz_encoder_hash.h | 32 # define hash_table lzma_crc32_table[0] macro
37 # define hash_table lzma_lz_hash_table macro
64 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
70 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
75 ^ (hash_table[cur[3]] << 5)) & mf->hash_mask
81 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \
86 ^ hash_table[cur[3]] << 5); \
88 = (hash_4_value ^ (hash_table[cur[4]] << 3)) \
96 ^ hash_table[cur[2]]) & 0xFFFF
102 ^ hash_table[cur[1]]) & 0xFFF
[all...] |
| /src/external/gpl2/gmake/dist/ |
| hash.c | 27 static void hash_rehash __P((struct hash_table* ht));
43 hash_init (struct hash_table *ht, unsigned long size,
69 hash_load (struct hash_table *ht, void *item_table,
86 hash_find_slot (struct hash_table *ht, const void *key)
121 hash_find_item (struct hash_table *ht, const void *key)
128 hash_insert (struct hash_table *ht, const void *item)
137 hash_insert_at (struct hash_table *ht, const void *item, const void *slot)
158 hash_delete (struct hash_table *ht, const void *item)
165 hash_delete_at (struct hash_table *ht, const void *slot)
179 hash_free_items (struct hash_table *ht
[all...] |
| hash.h | 43 struct hash_table struct
60 void hash_init __P((struct hash_table *ht, unsigned long size,
62 void hash_load __P((struct hash_table *ht, void *item_table,
64 void **hash_find_slot __P((struct hash_table *ht, void const *key));
65 void *hash_find_item __P((struct hash_table *ht, void const *key));
66 void *hash_insert __P((struct hash_table *ht, const void *item));
67 void *hash_insert_at __P((struct hash_table *ht, const void *item, void const *slot));
68 void *hash_delete __P((struct hash_table *ht, void const *item));
69 void *hash_delete_at __P((struct hash_table *ht, void const *slot));
70 void hash_delete_items __P((struct hash_table *ht))
[all...] |
| /src/external/gpl3/gcc.old/dist/libcpp/ |
| identifiers.cc | 61 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));
120 ht_forall (pfile->hash_table, (ht_cb) cb, v);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-table.h | 160 AN EXAMPLE HASH_TABLE DECLARATION
164 hash_table <some_type_hasher> some_type_hash_table;
169 You can then use any of the functions in hash_table's public interface.
170 See hash_table for details. The interface is very similar to libiberty's
174 to construct the hash_table lazily before first use. This is done
177 hash_table <some_type_hasher, true> some_type_hash_table;
197 hash_table <nofree_ptr_hash <whatever_type> > whatever_type_hash_table;
209 typedef hash_table <some_info_hasher> info_table_type;
301 /* Limit number of comparisons when calling hash_table<>::verify. */
374 class hash_table class
646 hash_table<Descriptor, Lazy, Allocator>::hash_table (size_t size, bool ggc, function in class:hash_table
680 hash_table<Descriptor, Lazy, Allocator>::hash_table (const hash_table &h, function in class:hash_table
[all...] |
| libfuncs.h | 61 hash_table<libfunc_hasher> *GTY(()) x_libfunc_hash;
|
| tree-ssa-scopedtables.h | 130 avail_exprs_stack (hash_table<expr_elt_hasher> *table)
146 hash_table<expr_elt_hasher> *avail_exprs (void)
157 hash_table<expr_elt_hasher> *m_avail_exprs;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-table.h | 160 AN EXAMPLE HASH_TABLE DECLARATION
164 hash_table <some_type_hasher> some_type_hash_table;
169 You can then use any of the functions in hash_table's public interface.
170 See hash_table for details. The interface is very similar to libiberty's
174 to construct the hash_table lazily before first use. This is done
177 hash_table <some_type_hasher, true> some_type_hash_table;
197 hash_table <nofree_ptr_hash <whatever_type> > whatever_type_hash_table;
209 typedef hash_table <some_info_hasher> info_table_type;
301 /* Limit number of comparisons when calling hash_table<>::verify. */
374 class hash_table class
604 hash_table<Descriptor, Lazy, Allocator>::hash_table (size_t size, bool ggc, function in class:hash_table
635 hash_table<Descriptor, Lazy, Allocator>::hash_table (const hash_table &h, function in class:hash_table
[all...] |
| libfuncs.h | 61 hash_table<libfunc_hasher> *GTY(()) x_libfunc_hash;
|
| /src/external/gpl3/gcc/dist/libcc1/ |
| context.hh | 87 hash_table<decl_addr_hasher> address_map;
90 hash_table< nofree_ptr_hash<tree_node> > preserved;
93 hash_table<string_hasher> file_names;
|
| /src/external/gpl3/gcc.old/dist/libcc1/ |
| context.hh | 87 hash_table<decl_addr_hasher> address_map;
90 hash_table< nofree_ptr_hash<tree_node> > preserved;
93 hash_table<string_hasher> file_names;
|
| /src/external/gpl3/gcc/dist/libcpp/ |
| identifiers.cc | 68 pfile->hash_table = table;
91 ht_destroy (pfile->hash_table);
104 return CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_ALLOC));
113 node = CPP_HASHNODE (ht_lookup (pfile->hash_table, str, len, HT_NO_INSERT));
134 ht_forall (pfile->hash_table, (ht_cb) cb, v);
|
| /src/external/gpl3/gdb.old/dist/sim/cr16/ |
| interp.c | 65 struct hash_entry hash_table[MAX_HASH+1]; variable in typeref:struct:hash_entry
87 h = &hash_table[hash(ins,1)];
479 h = &hash_table[hash(s->opcode, 0)];
484 h = &hash_table[hash((s->opcode << 1) >> 4, 0)];
486 h = &hash_table[hash((s->opcode << 1), 0)];
491 h = &hash_table[hash(s->opcode >> 4, 0)];
493 h = &hash_table[hash(s->opcode, 0)];
498 h = &hash_table[hash((s->opcode >>1) >> 4, 0)];
500 h = &hash_table[hash((s->opcode >> 1), 0)];
505 h = &hash_table[hash(s->opcode >> 8, 0)]
[all...] |
| /src/external/gpl3/gdb/dist/sim/cr16/ |
| interp.c | 65 struct hash_entry hash_table[MAX_HASH+1]; variable in typeref:struct:hash_entry
87 h = &hash_table[hash(ins,1)];
479 h = &hash_table[hash(s->opcode, 0)];
484 h = &hash_table[hash((s->opcode << 1) >> 4, 0)];
486 h = &hash_table[hash((s->opcode << 1), 0)];
491 h = &hash_table[hash(s->opcode >> 4, 0)];
493 h = &hash_table[hash(s->opcode, 0)];
498 h = &hash_table[hash((s->opcode >>1) >> 4, 0)];
500 h = &hash_table[hash((s->opcode >> 1), 0)];
505 h = &hash_table[hash(s->opcode >> 8, 0)]
[all...] |
| /src/external/bsd/flex/dist/src/ |
| sym.c | 52 typedef struct hash_entry **hash_table; typedef in typeref:struct:hash_entry
65 static int addsym(char[], char *, int, hash_table, int);
66 static struct hash_entry *findsym (const char *sym, hash_table table,
76 static int addsym (char sym[], char *str_def, int int_def, hash_table table, int table_size)
141 static struct hash_entry *findsym (const char *sym, hash_table table, int table_size)
|
