| /glibc-2.36/elf/ |
| D | tst-stringtable.c | 103 struct stringtable_entry *entries[2 * count]; in do_test() local
108 entries[i] = stringtable_add (&s, strings[i]); in do_test()
109 TEST_COMPARE (entries[i]->length, strlen (strings[i])); in do_test()
110 TEST_COMPARE_STRING (entries[i]->string, strings[i]); in do_test()
112 entries[i + count] = stringtable_add (&s, strings[i + count]); in do_test()
113 TEST_COMPARE (entries[i + count]->length, strlen (strings[i + count])); in do_test()
114 TEST_COMPARE_STRING (entries[i + count]->string, strings[i + count]); in do_test()
122 TEST_COMPARE (entries[i]->length, strlen (strings[i])); in do_test()
123 TEST_COMPARE_STRING (entries[i]->string, strings[i]); in do_test()
124 TEST_COMPARE_STRING (f.strings + entries[i]->offset, strings[i]); in do_test()
[all …]
|
| D | dl-lookup.c | 227 struct unique_sym *entries = tab->entries; in do_lookup_unique() local
229 if (entries != NULL) in do_lookup_unique()
235 if (entries[idx].hashval == new_hash in do_lookup_unique()
236 && strcmp (entries[idx].name, undef_name) == 0) in do_lookup_unique()
248 result->s = entries[idx].sym; in do_lookup_unique()
249 result->m = (struct link_map *) entries[idx].map; in do_lookup_unique()
255 if (entries[idx].name == NULL) in do_lookup_unique()
281 if (entries[idx].name != NULL) in do_lookup_unique()
282 enter_unique_sym (newentries, newsize, entries[idx].hashval, in do_lookup_unique()
283 entries[idx].name, entries[idx].sym, in do_lookup_unique()
[all …]
|
| D | stringtable.c | 37 table->entries = xcalloc (table->allocated, sizeof (table->entries[0])); in stringtable_init()
62 = xcalloc (new_allocated, sizeof (table->entries[0])); in stringtable_rehash()
66 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_rehash()
76 free (table->entries); in stringtable_rehash()
77 table->entries = new_entries; in stringtable_rehash()
95 = table->entries[hash & (table->allocated - 1)]; in stringtable_add()
112 e->next = table->entries[index]; in stringtable_add()
113 table->entries[index] = e; in stringtable_add()
164 for (struct stringtable_entry *e = table->entries[i]; e != NULL; in stringtable_finalize()
205 for (struct stringtable_entry *e = table->entries[i]; e != NULL; in stringtable_finalize()
|
| D | cache.c | 158 static struct cache_entry *entries; variable
409 entries = NULL; in init_cache()
555 for (entry = entries; entry != NULL; entry = entry->next) in save_cache()
628 for (idx_old = 0, idx_new = 0, entry = entries; entry != NULL; in save_cache()
757 while (entries) in save_cache()
759 entry = entries; in save_cache()
760 entries = entries->next; in save_cache()
805 struct cache_entry *ptr = entries; in add_to_cache()
806 struct cache_entry *prev = entries; in add_to_cache()
815 if (ptr == entries) in add_to_cache()
[all …]
|
| D | stringtable_free.c | 25 for (struct stringtable_entry *e = table->entries[i]; e != NULL; ) in stringtable_free()
31 free (table->entries); in stringtable_free()
|
| D | dl-close.c | 634 struct unique_sym *entries = tab->entries; in _dl_close_worker() local
635 if (entries != NULL) in _dl_close_worker()
642 if (entries[idx].name != NULL in _dl_close_worker()
643 && entries[idx].map == imap) in _dl_close_worker()
645 entries[idx].name = NULL; in _dl_close_worker()
646 entries[idx].hashval = 0; in _dl_close_worker()
|
| D | stringtable.h | 37 struct stringtable_entry **entries; /* Array of hash table buckets. */ member
|
| /glibc-2.36/login/ |
| D | tst-updwtmpx.c | 38 struct utmpx entries[2]; in do_test() local
41 unsigned char *p = (unsigned char *) &entries[0]; in do_test()
42 for (size_t i = 0; i < sizeof (entries); ++i) in do_test()
75 updwtmpx (path, &entries[0]); in do_test()
82 TEST_COMPARE_BLOB (&entries[0], sizeof (entries[0]), in do_test()
91 updwtmpx (path, &entries[1]); in do_test()
97 TEST_COMPARE_BLOB (&entries[0], sizeof (entries[0]), in do_test()
101 TEST_COMPARE_BLOB (&entries[1], sizeof (entries[1]), in do_test()
|
| /glibc-2.36/include/ |
| D | inline-hashtab.h | 30 void **entries; member
52 ht->entries = malloc (sizeof (void *) * ht->size); in htab_create()
54 if (! ht->entries) in htab_create()
62 memset (ht->entries, 0, sizeof (void *) * ht->size); in htab_create()
75 free (htab->entries[i]); in htab_delete()
77 htab->free (htab->entries); in htab_delete()
93 void **slot = htab->entries + index; in find_empty_slot_for_expand()
106 slot = htab->entries + index; in find_empty_slot_for_expand()
129 oentries = htab->entries; in htab_expand()
142 htab->entries = nentries; in htab_expand()
[all …]
|
| /glibc-2.36/argp/ |
| D | argp-help.c | 418 struct hol_entry *entries; member
464 hol->entries = malloc (sizeof (struct hol_entry) * hol->num_entries); in make_hol()
467 assert (hol->entries && hol->short_options); in make_hol()
474 for (o = opts, entry = hol->entries; ! oend (o); entry++) in make_hol()
543 free (hol->entries); in hol_free()
638 struct hol_entry *entry = hol->entries; in hol_find_entry()
911 qsort (hol->entries, hol->num_entries, sizeof (struct hol_entry), in hol_sort()
937 hol->entries = more->entries; in hol_append()
949 struct hol_entry *entries = in hol_append() local
955 assert (entries && short_options); in hol_append()
[all …]
|
| /glibc-2.36/manual/ |
| D | summary.pl | 61 my %entries;
89 &print_entry($_) for sort keys %entries;
219 push @{$entries{$ele}{$proto}}, [$hdr, $std, $node];
338 for my $prototype (sort keys %{$entries{$element}}) {
340 for (@{$entries{$element}{$prototype}}) {
|
| D | debug.texi | 52 value is the actual number of entries of @var{buffer} that are obtained,
70 @c pointers to the strings into the array entries in the buffer.
82 of entries in that array (the return value of @code{backtrace}).
85 @var{size} entries just like the array @var{buffer}. Each string
129 entries probably all programs should be covered.
|
| /glibc-2.36/intl/ |
| D | l10nflist.c | 162 size_t entries; in _nl_make_l10nflist() local
271 entries = 0; in _nl_make_l10nflist()
284 retval->successor[entries++] in _nl_make_l10nflist()
289 retval->successor[entries] = NULL; in _nl_make_l10nflist()
|
| /glibc-2.36/ |
| D | shlib-versions | 5 # libraries. The entire list is processed, with earlier entries
6 # taking precedence over later entries (and the files from sysdeps
20 # no second column. The defaults must precede the entries they apply
|
| D | abi-tags | 6 # earlier entries taking precedence over later entries. So loose patterns
|
| D | libc-abis | 9 # add entries in the middle or where they seem "logical". Once a version
26 # They don't have to be in the same order relative to other entries. This
|
| /glibc-2.36/nss/ |
| D | makedb.c | 65 void *entries; member
493 last_database->entries = NULL; in process_input()
547 struct dbentry **found = tsearch (newp, &last_database->entries, in process_input()
700 twalk_r (db->entries, add_key, db); in compute_tables()
727 twalk_r (db->entries, add_key, db); in compute_tables()
760 if (db->entries != NULL) in write_output()
|
| /glibc-2.36/sysdeps/powerpc/powerpc64/ |
| D | configure | 7 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for support for overlapping .opd entries" >&5
8 $as_echo_n "checking for support for overlapping .opd entries... " >&6; }
|
| D | configure.ac | 6 AC_CACHE_CHECK(for support for overlapping .opd entries,
|
| /glibc-2.36/sysvipc/ |
| D | Versions | 17 # Cancellation point entries.
|
| /glibc-2.36/timezone/ |
| D | etcetera | 6 # These entries are mostly present for historical reasons, so that
10 # need now for the entries that are not on UTC are for ships at sea
|
| /glibc-2.36/nis/rpcsvc/ |
| D | nis_callback.h | 45 } entries; member
|
| /glibc-2.36/nis/ |
| D | nis_callback.c | 129 for (i = 0; i < argument.cbproc_receive_1_arg.entries.entries_len; ++i)
131 #define cbproc_entry(a) argument.cbproc_receive_1_arg.entries.entries_val[a]
|
| /glibc-2.36/localedata/locales/ |
| D | ss_ZA | 22 % - <UNNNN> escaped all entries
27 % - <UNNNN> escaped some entries
|
| /glibc-2.36/locale/ |
| D | categories.def | 26 where items itself is an array of entries in the form
226 DEFINE_ELEMENT (_NL_TIME_ERA_NUM_ENTRIES, "time-era-num-entries", opt, word)
227 DEFINE_ELEMENT (_NL_TIME_ERA_ENTRIES, "time-era-entries", opt, string)
|