1 diff -Naur glibc-2.3-20031101.orig/elf/rtld.c glibc-2.3-20031101/elf/rtld.c
2 --- glibc-2.3-20031101.orig/elf/rtld.c 2003-11-01 23:47:33.236533536 +0200
3 +++ glibc-2.3-20031101/elf/rtld.c 2003-11-02 00:19:16.053261424 +0200
5 while (GL(dl_loaded)->l_searchlist.r_list[i] != &GL(dl_rtld_map))
7 GL(dl_rtld_map).l_prev = GL(dl_loaded)->l_searchlist.r_list[i - 1];
8 - if (__builtin_expect (mode, normal) == normal)
9 - GL(dl_rtld_map).l_next = (i + 1 < GL(dl_loaded)->l_searchlist.r_nlist
10 - ? GL(dl_loaded)->l_searchlist.r_list[i + 1]
13 - /* In trace mode there might be an invisible object (which we
14 - could not find) after the previous one in the search list.
15 - In this case it doesn't matter much where we put the
16 - interpreter object, so we just initialize the list pointer so
17 - that the assertion below holds. */
18 - GL(dl_rtld_map).l_next = GL(dl_rtld_map).l_prev->l_next;
20 - assert (GL(dl_rtld_map).l_prev->l_next == GL(dl_rtld_map).l_next);
21 + GL(dl_rtld_map).l_next = GL(dl_rtld_map).l_prev->l_next;
22 GL(dl_rtld_map).l_prev->l_next = &GL(dl_rtld_map);
23 if (GL(dl_rtld_map).l_next != NULL)