This is the mail archive of the
glibc-bugs@sourceware.org
mailing list for the glibc project.
[Bug dynamic-link/15311] _dl_sort_fini static deps can be violated by dynamic ones
- From: "dhatch at ilm dot com" <sourceware-bugzilla at sourceware dot org>
- To: glibc-bugs at sourceware dot org
- Date: Fri, 29 Mar 2013 14:53:34 +0000
- Subject: [Bug dynamic-link/15311] _dl_sort_fini static deps can be violated by dynamic ones
- Auto-submitted: auto-generated
- References: <bug-15311-131 at http dot sourceware dot org/bugzilla/>
http://sourceware.org/bugzilla/show_bug.cgi?id=15311
--- Comment #9 from Don Hatch <dhatch at ilm dot com> 2013-03-29 14:53:34 UTC ---
(In reply to comment #7)
> My original alg. was
> 1. topsort dynamic and static, get order o.
> 2. do dfs on static, get tree and repeately output and remove leaf minimal in o.
So it's like mine except your second pass is a topsort by simple dfs
(reverse postordering)
rather than an SCC-coherent topsort like Kosaraju's or Tarjan's, for some
reason.
SCC-coherent is better.
For example, say the edges are 0 <-> 1 -> 2, then dfs can produce 1 2 0...
we'd prefer either of 0 1 2 or 1 0 2 instead, since we'd like 0 to come before
2.
In general whenever (A ->* B and not B ->* A),
A should come before B in the output order.
--
Configure bugmail: http://sourceware.org/bugzilla/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are on the CC list for the bug.