Home
last modified time | relevance | path

Searched refs:count (Results 1 – 13 of 13) sorted by relevance

/elf/
A Dtst-dl-iter-static.c27 int *count = data; in callback() local
30 (*count)++; in callback()
38 int count = 0; in do_test() local
41 status = dl_iterate_phdr (callback, &count); in do_test()
43 return status || count != 1; in do_test()
A Dgenrtldtbl.awk4 count=0;
9 dir[count++] = $i;
13 for (i = 0; i < count; ++i) {
23 for (i = 0; i < count; ++i) {
28 count);
A Ddl-scope.c44 fsl->count = 1; in _dl_scope_free()
47 else if (fsl->count < DL_SCOPE_FREE_LIST_SIZE) in _dl_scope_free()
48 fsl->list[fsl->count++] = old; in _dl_scope_free()
52 while (fsl->count > 0) in _dl_scope_free()
53 free (fsl->list[--fsl->count]); in _dl_scope_free()
A Dtst-stringtable.c45 TEST_COMPARE (s.count, 1); in do_test()
62 TEST_COMPARE (s.count, 1); in do_test()
80 TEST_COMPARE (s.count, 1); in do_test()
86 TEST_COMPARE (s.count, 2); in do_test()
101 enum { count = 1500 }; in do_test() enumerator
102 char *strings[2 * count]; in do_test()
105 for (int i = 0; i < count; ++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()
[all …]
A Dloadtest.c91 int count = TEST_ROUNDS; in main() local
106 while (count--) in main()
111 printf ("%4d: %4d: ", count + 1, nr); in main()
173 for (count = 0; count < (int) NOBJS; ++count) in main()
174 if (testobjs[count].handle != NULL) in main()
177 testobjs[count].name, in main()
178 ((struct link_map *) testobjs[count].handle)->l_initfini, in main()
179 ((struct link_map *) testobjs[count].handle)->l_versions); in main()
181 if (dlclose (testobjs[count].handle) != 0) in main()
183 printf ("failed to close %s\n", testobjs[count].name); in main()
A Dstringtable.c29 table->count = 0; in stringtable_init()
102 if (table->count >= (1U << 30)) in stringtable_add()
104 if (table->count * 3 > table->allocated * 2) in stringtable_add()
108 ++table->count; in stringtable_add()
152 if (table->count == 0) in stringtable_finalize()
160 struct stringtable_entry **array = xcalloc (table->count, sizeof (*array)); in stringtable_finalize()
170 assert (j == table->count); in stringtable_finalize()
172 qsort (array, table->count, sizeof (*array), finalize_compare); in stringtable_finalize()
176 for (uint32_t j = 1; j < table->count; ++j) in stringtable_finalize()
193 struct stringtable_entry *last = array[table->count - 1]; in stringtable_finalize()
A Ddl-find_object.c129 size_t count = 0; in _dlfo_mappings_segment_count_used() local
133 count += seg->objects[i].map != NULL; in _dlfo_mappings_segment_count_used()
134 return count; in _dlfo_mappings_segment_count_used()
142 size_t count = 0; in _dlfo_mappings_segment_count_allocated() local
144 count += seg->allocated; in _dlfo_mappings_segment_count_allocated()
145 return count; in _dlfo_mappings_segment_count_allocated()
642 size_t remaining_to_add = current_used + count; in _dl_find_object_update_1()
675 size_t loaded_index1 = count; in _dl_find_object_update_1()
766 size_t count = 0; in _dl_find_object_update() local
779 if (count == 0) in _dl_find_object_update()
[all …]
A Dstringtable.h38 uint32_t count; /* Number of elements in the table. */ member
A Ddl-hwcaps.c34 size_t count; member
54 ++counts->count; in update_hwcaps_counts()
189 compute_priorities (hwcaps_counts.count, glibc_hwcaps_prepend, in _dl_important_hwcaps()
196 size_t total = (hwcaps_counts.count * (strlen (GLIBC_HWCAPS_PREFIX) + 1) in _dl_important_hwcaps()
253 *sz = hwcaps_counts.count + (1 << cnt); in _dl_important_hwcaps()
A Dsprof.c136 uint32_t count; member
144 uintmax_t count; member
1028 sortsym[symbol_idx]->calls += data[cnt].count; in count_calls()
1220 newp->count = data[cnt].count; in add_arcs()
1226 runp->count += data[cnt].count; in add_arcs()
1250 newp->count = data[cnt].count; in add_arcs()
1256 runp->count += data[cnt].count; in add_arcs()
1355 runp->count, sortsym[cnt]->calls, in generate_call_graph()
1384 runp->count); in generate_call_graph()
1419 sortsym[cnt]->name, runp->count); in generate_call_pair_list()
[all …]
A Dcache.c106 size_t count = 0; in glibc_hwcaps_count() local
109 ++count; in glibc_hwcaps_count()
110 return count; in glibc_hwcaps_count()
119 size_t count = glibc_hwcaps_count (); in assign_glibc_hwcaps_indices() local
121 = xmalloc (sizeof (*array) * count); in assign_glibc_hwcaps_indices()
130 assert (i == count); in assign_glibc_hwcaps_indices()
133 qsort (array, count, sizeof (*array), assign_glibc_hwcaps_indices_compare); in assign_glibc_hwcaps_indices()
136 for (size_t i = 0; i < count; ++i) in assign_glibc_hwcaps_indices()
539 ext->count = xid; in write_extensions()
A Ddl-profile.c145 uint32_t count __attribute__ ((aligned (__alignof__ (uint32_t)))); member
574 data[newarc].count = 0; in _dl_mcount()
589 catomic_increment (&fromp->here->count); in _dl_mcount()
A Ddl-close.c496 && GL(dl_scope_free_list)->count))) in _dl_close_worker()
503 while (fsl->count > 0) in _dl_close_worker()
504 free (fsl->list[--fsl->count]); in _dl_close_worker()

Completed in 18 milliseconds