| /glibc-2.36/locale/programs/ |
| D | simple-hash.c | 77 htab->table = (void *) xcalloc (init_size + 1, sizeof (hash_entry)); in init_hash()
78 if (htab->table == NULL) in init_hash()
90 free (htab->table); in delete_hash()
100 hash_entry *table = (hash_entry *) htab->table; in insert_entry() local
103 if (table[idx].used) in insert_entry()
119 hash_entry *table = (hash_entry *) htab->table; in insert_entry_2() local
121 table[idx].used = hval; in insert_entry_2()
122 table[idx].key = key; in insert_entry_2()
123 table[idx].keylen = keylen; in insert_entry_2()
124 table[idx].data = data; in insert_entry_2()
[all …]
|
| /glibc-2.36/nscd/ |
| D | cache.c | 74 struct database_dyn *table, uid_t owner) in cache_search() argument
76 unsigned long int hash = __nss_hash (key, len) % table->head->module; in cache_search()
81 ref_t work = table->head->array[hash]; in cache_search()
86 struct hashentry *here = (struct hashentry *) (table->data + work); in cache_search()
89 && memcmp (key, table->data + here->key, len) == 0 in cache_search()
94 = (struct datahead *) (table->data + here->packet); in cache_search()
103 ++table->head->neghit; in cache_search()
106 ++table->head->poshit; in cache_search()
120 if (nsearched > table->head->maxnsearched) in cache_search()
121 table->head->maxnsearched = nsearched; in cache_search()
[all …]
|
| /glibc-2.36/elf/ |
| D | stringtable.c | 27 stringtable_init (struct stringtable *table) in stringtable_init() argument
29 table->count = 0; in stringtable_init()
35 table->allocated = 128; in stringtable_init()
37 table->entries = xcalloc (table->allocated, sizeof (table->entries[0])); in stringtable_init()
56 stringtable_rehash (struct stringtable *table) in stringtable_rehash() argument
60 uint32_t new_allocated = table->allocated * 2; in stringtable_rehash()
62 = xcalloc (new_allocated, sizeof (table->entries[0])); in stringtable_rehash()
65 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_rehash()
66 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_rehash()
76 free (table->entries); in stringtable_rehash()
[all …]
|
| D | stringtable_free.c | 22 stringtable_free (struct stringtable *table) in stringtable_free() argument
24 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_free()
25 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_free()
31 free (table->entries); in stringtable_free()
32 *table = (struct stringtable) { 0, }; in stringtable_free()
|
| D | stringtable.h | 43 struct stringtable_entry *stringtable_add (struct stringtable *table,
56 void stringtable_finalize (struct stringtable *table,
62 void stringtable_free (struct stringtable *table);
|
| D | dl-lookup.c | 167 enter_unique_sym (struct unique_sym *table, size_t size, in enter_unique_sym() argument
173 while (table[idx].name != NULL) in enter_unique_sym()
180 table[idx].hashval = hash; in enter_unique_sym()
181 table[idx].name = name; in enter_unique_sym()
182 table[idx].sym = sym; in enter_unique_sym()
183 table[idx].map = map; in enter_unique_sym()
|
| /glibc-2.36/wctype/ |
| D | wchar-lookup.h | 51 wctype_table_lookup (const char *table, uint32_t wc) in wctype_table_lookup() argument
53 uint32_t shift1 = ((const uint32_t *) table)[0]; in wctype_table_lookup()
55 uint32_t bound = ((const uint32_t *) table)[1]; in wctype_table_lookup()
58 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1]; in wctype_table_lookup()
61 uint32_t shift2 = ((const uint32_t *) table)[2]; in wctype_table_lookup()
62 uint32_t mask2 = ((const uint32_t *) table)[3]; in wctype_table_lookup()
64 uint32_t lookup2 = ((const uint32_t *)(table + lookup1))[index2]; in wctype_table_lookup()
67 uint32_t mask3 = ((const uint32_t *) table)[4]; in wctype_table_lookup()
69 uint32_t lookup3 = ((const uint32_t *)(table + lookup2))[index3]; in wctype_table_lookup()
83 wcwidth_table_lookup (const char *table, uint32_t wc) in wcwidth_table_lookup() argument
[all …]
|
| /glibc-2.36/iconvdata/ |
| D | tst-table.sh | 36 ./tst-table-charmap.sh ${charmap:-$charset} \
38 > ${objpfx}tst-${charset}.charmap.table
42 grep '0x....$' < ${objpfx}tst-${charset}.charmap.table \
43 > ${objpfx}tst-${charset}.truncated.table
44 mv ${objpfx}tst-${charset}.truncated.table ${objpfx}tst-${charset}.charmap.table
53 (grep '^0x8EA1' ${objpfx}tst-${charset}.charmap.table
62 ${objpfx}tst-table-from ${charset} \
63 > ${objpfx}tst-${charset}.table
67 ${objpfx}tst-table-to ${charset} | sort \
68 > ${objpfx}tst-${charset}.inverse.table
[all …]
|
| /glibc-2.36/locale/ |
| D | coll-lookup.c | 22 __collidx_table_lookup (const char *table, uint32_t wc) in __collidx_table_lookup() argument
24 uint32_t shift1 = ((const uint32_t *) table)[0]; in __collidx_table_lookup()
26 uint32_t bound = ((const uint32_t *) table)[1]; in __collidx_table_lookup()
29 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1]; in __collidx_table_lookup()
32 uint32_t shift2 = ((const uint32_t *) table)[2]; in __collidx_table_lookup()
33 uint32_t mask2 = ((const uint32_t *) table)[3]; in __collidx_table_lookup()
35 uint32_t lookup2 = ((const uint32_t *)(table + lookup1))[index2]; in __collidx_table_lookup()
38 uint32_t mask3 = ((const uint32_t *) table)[4]; in __collidx_table_lookup()
40 int32_t lookup3 = ((const int32_t *)(table + lookup2))[index3]; in __collidx_table_lookup()
52 __collseq_table_lookup (const char *table, uint32_t wc) in __collseq_table_lookup() argument
[all …]
|
| D | coll-lookup.h | 21 extern int32_t __collidx_table_lookup (const char *table, uint32_t wc)
25 extern uint32_t __collseq_table_lookup (const char *table, uint32_t wc)
|
| D | weightwc.h | 25 findidx (const int32_t *table, in findidx() argument
39 int32_t i = __collidx_table_lookup ((const char *) table, ch); in findidx()
|
| /glibc-2.36/misc/ |
| D | hsearch_r.c | 72 if (htab->table != NULL) in __hcreate_r()
97 htab->table = (_ENTRY *) calloc (htab->size + 1, sizeof (_ENTRY)); in __hcreate_r()
98 if (htab->table == NULL) in __hcreate_r()
121 free (htab->table); in weak_alias()
124 htab->table = NULL; in weak_alias()
166 if (htab->table[idx].used) in weak_alias()
169 if (htab->table[idx].used == hval in weak_alias()
170 && strcmp (item.key, htab->table[idx].entry.key) == 0) in weak_alias()
172 *retval = &htab->table[idx].entry; in weak_alias()
194 if (htab->table[idx].used == hval in weak_alias()
[all …]
|
| /glibc-2.36/sysdeps/unix/sysv/linux/ |
| D | glibcsyscalls.py | 230 for table in tables:
231 table.numbers = load_arch_syscall_header(table.path)
234 defined = [table.name for table in tables
235 if nr in table.numbers]
236 undefined = [table.name for table in tables
237 if nr not in table.numbers]
|
| /glibc-2.36/string/ |
| D | strcoll_l.c | 66 const USTRING_TYPE *weights, const int32_t *table, in get_next_seq() argument
112 int32_t tmp = findidx (table, indirect, extra, &us, -1); in get_next_seq()
127 int32_t tmp = findidx (table, indirect, extra, &us, -1); in get_next_seq()
264 const int32_t *table; in STRCOLL() local
278 table = (const int32_t *) in STRCOLL()
287 assert (((uintptr_t) table) % __alignof__ (table[0]) == 0); in STRCOLL()
335 get_next_seq (&seq1, nrules, rulesets, weights, table, in STRCOLL()
337 get_next_seq (&seq2, nrules, rulesets, weights, table, in STRCOLL()
|
| D | ffs.c | 28 static const unsigned char table[] = in __ffs() local
44 return table[x >> a] + a; in __ffs()
|
| D | strcspn.c | 38 unsigned char table[256]; in STRCSPN() local
39 unsigned char *p = memset (table, 0, 64); in STRCSPN()
|
| D | strspn.c | 42 unsigned char table[256]; in STRSPN() local
43 unsigned char *p = memset (table, 0, 64); in STRSPN()
|
| D | strxfrm_l.c | 55 int32_t *table; member
102 int32_t tmp = findidx (l_data->table, l_data->indirect, l_data->extra, us, in find_idx()
695 l_data.table = (int32_t *) in STRXFRM()
704 assert (((uintptr_t) l_data.table) % __alignof__ (l_data.table[0]) == 0); in STRXFRM()
723 int32_t tmp = findidx (l_data.table, l_data.indirect, l_data.extra, &cur, in STRXFRM()
|
| /glibc-2.36/sysdeps/generic/ |
| D | unwind-dw2-fde-glibc.c | 182 const struct fde_table *table = (const struct fde_table *) p; in _Unwind_IteratePhdrCallback() local
190 if (data->pc < table[0].initial_loc + data_base) in _Unwind_IteratePhdrCallback()
192 else if (data->pc < table[mid].initial_loc + data_base) in _Unwind_IteratePhdrCallback()
200 if (data->pc < table[mid].initial_loc + data_base) in _Unwind_IteratePhdrCallback()
202 else if (data->pc >= table[mid + 1].initial_loc + data_base) in _Unwind_IteratePhdrCallback()
212 f = (fde *) (table[mid].fde + data_base); in _Unwind_IteratePhdrCallback()
217 if (data->pc < table[mid].initial_loc + data_base + range) in _Unwind_IteratePhdrCallback()
219 data->func = (void *) (table[mid].initial_loc + data_base); in _Unwind_IteratePhdrCallback()
|
| /glibc-2.36/manual/ |
| D | search.texi | 276 The @code{hcreate} function creates a hashing table which can contain at
277 least @var{nel} elements. There is no possibility to grow this table so
280 number of elements in the hashing table larger than the expected maximal
288 hashing table used through the whole program. The table is allocated
294 It is possible to use more than one hashing table in the program run if
295 the former table is first destroyed by a call to @code{hdestroy}.
299 table in use or the program ran out of memory.
310 table with possibly different size.
313 table at the time @code{hdestroy} is called are @emph{not} freed by this
317 function to iterate through all available elements in the hashing table.
[all …]
|
| D | header.texi | 11 @c This table runs wide. Shrink fonts.
15 @table @code
19 @end table
|
| D | resource.texi | 47 @table @code
50 @end table
62 @table @code
121 @end table
139 @table @dfn
155 @end table
201 @table @code
210 @end table
237 @table @code
243 @end table
[all …]
|
| /glibc-2.36/crypt/ |
| D | README.ufc-crypt | 53 Benchmark table:
56 The table shows how many operations per second UFC-crypt can
73 UFC-crypt wired into Crack. However, the table gives an outline of
92 - Implement DES 'f' function mostly by table lookup
113 - As described, the table based f function uses a 3 dimensional array:
|
| /glibc-2.36/scripts/ |
| D | documented.sh | 38 <p>The following table includes names of the function in glibc
58 <center><table>
95 </table></center>
|
| /glibc-2.36/sysdeps/unix/sysv/linux/mips/ |
| D | libc-abis | 19 # GNU-style hash table with translation table.
|