This is the mail archive of the
glibc-bugs@sourceware.org
mailing list for the glibc project.
[Bug dynamic-link/15310] _dl_sort_fini is O(n^3) causing slow exit when many dsos
- From: "carlos at redhat dot com" <sourceware-bugzilla at sourceware dot org>
- To: glibc-bugs at sourceware dot org
- Date: Wed, 04 Nov 2015 19:56:13 +0000
- Subject: [Bug dynamic-link/15310] _dl_sort_fini is O(n^3) causing slow exit when many dsos
- Auto-submitted: auto-generated
- References: <bug-15310-131 at http dot sourceware dot org/bugzilla/>
https://sourceware.org/bugzilla/show_bug.cgi?id=15310
Carlos O'Donell <carlos at redhat dot com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |paulo.cesar.pereira.de.andr
| |ade at gmail dot com
--- Comment #21 from Carlos O'Donell <carlos at redhat dot com> ---
(In reply to Brooks Moses from comment #20)
> Ping; did anything ever happen with this?
No, but it would be awesome if someone moved this forward.
Unfortunately Don doesn't have a copyright assignment as far as I can tell, so
please don't look at the code in this patch if you plan to implement it.
Instead I suggest we look at bug 17645:
https://sourceware.org/bugzilla/show_bug.cgi?id=17645
Fedora bug:
https://bugzilla.redhat.com/show_bug.cgi?id=1162810
libc-alpha post:
https://sourceware.org/ml/libc-alpha/2014-11/msg00702.html
And take a serious look at Paulo's work.
It still needs someone to write a test that actually does some decent coverage
over the permutation of DT_NEEDED trees.
--
You are receiving this mail because:
You are on the CC list for the bug.