Home
last modified time | relevance | path

Searched refs:j (Results 1 – 17 of 17) sorted by relevance

/elf/
A Dtst-dlmopen2.c23 for (int j = 0; j < DL_NNS - 1; ++j) in do_test() local
25 h[j] = dlmopen (LM_ID_NEWLM, "$ORIGIN/tst-dlmopen1mod.so", in do_test()
27 if (h[j] == NULL) in do_test()
30 i, j, dlerror ()); in do_test()
34 if (dlinfo (h[j], RTLD_DI_LMID, &ns) != 0) in do_test()
37 i, j, dlerror ()); in do_test()
43 i, j, (long int) ns); in do_test()
50 i, j, (long int) ns); in do_test()
57 for (int j = 0; j < DL_NNS - 1; ++j) in do_test() local
58 if (dlclose (h[j]) != 0) in do_test()
[all …]
A Dreldep6.c17 int i, j; in main() local
71 for (j = 0; j < CHUNKS; ++j) in main()
72 allocs[i][j] = calloc (1, j + 1); in main()
99 for (j = 0; j < CHUNKS; ++j) in main()
100 free (allocs[i][j]); in main()
A Dtst-tls-manydynamic.c123 for (int j = 0; j < PER_VALUE_COUNT; ++j) in do_test() local
124 values[i].num[j] = rand (); in do_test()
134 for (int j = 0; j < PER_VALUE_COUNT; ++j) in do_test() local
135 if (actual.num[j] != values[i].num[j]) in do_test()
138 i, j, actual.num[j], values[i].num[j]); in do_test()
A Dtst-dlopen-tlsmodid.h66 int j; in do_test() local
68 for (j = 0; j < 100; ++j) in do_test()
A Dreadelflib.c47 unsigned int j; in process_elf_file() local
115 for (j = 0; j < sizeof (interpreters) / sizeof (interpreters [0]); in process_elf_file()
116 ++j) in process_elf_file()
117 if (strcmp (program_interpreter, interpreters[j].soname) == 0) in process_elf_file()
119 *flag = interpreters[j].flag; in process_elf_file()
309 for (j = 0; in process_elf_file()
310 j < sizeof (known_libs) / sizeof (known_libs [0]); in process_elf_file()
311 ++j) in process_elf_file()
312 if (strcmp (name, known_libs [j].soname) == 0) in process_elf_file()
314 *flag = known_libs [j].flag; in process_elf_file()
A Ddl-init.c62 unsigned int j; in call_init() local
69 for (j = 0; j < jm; ++j) in call_init()
70 ((dl_init_t) addrs[j]) (argc, argv, env); in call_init()
A Dtst-unique4.h6 static const int j; member
A Dstringtable.c162 size_t j = 0; in stringtable_finalize() local
167 array[j] = e; in stringtable_finalize()
168 ++j; in stringtable_finalize()
170 assert (j == table->count); in stringtable_finalize()
176 for (uint32_t j = 1; j < table->count; ++j) in stringtable_finalize() local
178 struct stringtable_entry *previous = array[j - 1]; in stringtable_finalize()
179 struct stringtable_entry *current = array[j]; in stringtable_finalize()
A Dtst-unique4lib.cc7 const int S<N>::j __attribute__ ((used)) = -1; member in S<N>
17 static int b __attribute__ ((used)) = S<1>::j;
A Dtst-unique4.cc24 printf("\n%d\n", S<1>::j); in main()
25 result |= S<1>::j != -1; in main()
A Dpldd-xx.c130 for (unsigned int j = 0; j < p[i].p_filesz / sizeof (EW(Dyn)); ++j) in E() local
131 if (dyn[j].d_tag == DT_DEBUG && dyn[j].d_un.d_ptr != 0) in E()
134 if (pread (memfd, &r, sizeof (r), dyn[j].d_un.d_ptr) in E()
A Ddl-find_object.c529 for (size_t j = i + 1; j < size; ++j) in _dlfo_sort_mappings() local
530 if (objects[j].map_start < min_val) in _dlfo_sort_mappings()
532 min_idx = j; in _dlfo_sort_mappings()
533 min_val = objects[j].map_start; in _dlfo_sort_mappings()
601 for (size_t j = i + 1; j < size; ++j) in _dl_find_object_link_map_sort() local
602 if (loaded[j]->l_map_start < min_val) in _dl_find_object_link_map_sort()
604 min_idx = j; in _dl_find_object_link_map_sort()
605 min_val = loaded[j]->l_map_start; in _dl_find_object_link_map_sort()
A Ddl-deps.c515 unsigned int j, cnt; in _dl_map_object_deps() local
534 for (j = 0; j < cnt; j++) in _dl_map_object_deps()
536 l_initfini[j]->l_reserved = 0; in _dl_map_object_deps()
537 if (j && __builtin_expect (l_initfini[j]->l_info[DT_SYMBOLIC] in _dl_map_object_deps()
580 unsigned int j = i; in _dl_map_object_deps() local
585 l_reldeps->list[j++] = list[i]; in _dl_map_object_deps()
586 l_reldeps->act = j; in _dl_map_object_deps()
A Ddl-close.c241 for (unsigned int j = 0; j < l->l_reldeps->act; ++j) in _dl_close_worker() local
243 struct link_map *jmap = l->l_reldeps->list[j]; in _dl_close_worker()
472 unsigned int j = 0; in _dl_close_worker() local
480 j = cnt; in _dl_close_worker()
485 if (i != j) in _dl_close_worker()
486 ns_msl->r_list[j] = ns_msl->r_list[i]; in _dl_close_worker()
487 j++; in _dl_close_worker()
489 ns_msl->r_nlist = j; in _dl_close_worker()
A Ddl-hwcaps.c143 for (size_t j = i; j > 0; --j) in sort_priorities_by_name() local
145 struct dl_hwcaps_priority *previous = _dl_hwcaps_priorities + j - 1; in sort_priorities_by_name()
146 struct dl_hwcaps_priority *current = _dl_hwcaps_priorities + j; in sort_priorities_by_name()
A Ddl-tunables.c240 for (size_t j = 0; j < len; j++) in parse_tunables() local
241 tunestr[off++] = value[j]; in parse_tunables()
A Ddl-open.c641 unsigned int j = 0; in dl_open_worker_begin() local
648 first = j; in dl_open_worker_begin()
649 last = j + 1; in dl_open_worker_begin()
651 l = new->l_initfini[++j]; in dl_open_worker_begin()

Completed in 19 milliseconds