This is the mail archive of the
glibc-bugs@sourceware.org
mailing list for the glibc project.
Re: [Bug dynamic-link/15311] _dl_sort_fini static deps can be violated by dynamic ones
- From: OndÅej BÃlka <neleai at seznam dot cz>
- To: dhatch at ilm dot com <sourceware-bugzilla at sourceware dot org>
- Cc: glibc-bugs at sourceware dot org
- Date: Thu, 28 Mar 2013 08:15:22 +0100
- Subject: Re: [Bug dynamic-link/15311] _dl_sort_fini static deps can be violated by dynamic ones
- References: <bug-15311-131 at http dot sourceware dot org/bugzilla/> <bug-15311-131-vQ6lBgMO3g at http dot sourceware dot org/bugzilla/>
On Thu, Mar 28, 2013 at 05:00:18AM +0000, dhatch at ilm dot com wrote:
> http://sourceware.org/bugzilla/show_bug.cgi?id=15311
>
> --- Comment #6 from Don Hatch <dhatch at ilm dot com> 2013-03-28 05:00:18 UTC ---
> (In reply to comment #3)
> > If you do topologic sort it should suffice to take static dependency
> > edges before dynamic ones, it assures that static when static are acyclic then
> > they are always correctly ordered.
>
> Hi Ondrej,
>
> I'm sorry, I just realized that in my previous reply to this comment of yours,
> I outlined my strategy without actually addressing your simpler proposal at
> all.
>
> I don't think what you are suggesting will work.
> If I'm reading it correctly, you're saying that, when iterating through
> the successors of a given node, consider static successors first
> and dynamic onces after that.
>
That was late at nigth and I simplified too much.
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.