From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 3827 invoked by alias); 28 Mar 2013 07:37:45 -0000 Mailing-List: contact glibc-bugs-help@sourceware.org; run by ezmlm Precedence: bulk List-Id: List-Subscribe: List-Post: List-Help: , Sender: glibc-bugs-owner@sourceware.org Received: (qmail 3417 invoked by uid 89); 28 Mar 2013 07:37:37 -0000 X-Spam-SWARE-Status: No, score=-0.8 required=5.0 tests=AWL,BAYES_00,FREEMAIL_FROM,SPF_NEUTRAL autolearn=no version=3.3.1 X-Spam-User: qpsmtpd, 2 recipients Received: from popelka.ms.mff.cuni.cz (HELO popelka.ms.mff.cuni.cz) (195.113.20.131) by sourceware.org (qpsmtpd/0.84/v0.84-167-ge50287c) with ESMTP; Thu, 28 Mar 2013 07:37:33 +0000 Received: from domone.kolej.mff.cuni.cz (popelka.ms.mff.cuni.cz [195.113.20.131]) by popelka.ms.mff.cuni.cz (Postfix) with ESMTPS id 730D762A92; Thu, 28 Mar 2013 08:37:28 +0100 (CET) Received: by domone.kolej.mff.cuni.cz (Postfix, from userid 1000) id 794386045C; Thu, 28 Mar 2013 08:15:22 +0100 (CET) Date: Thu, 28 Mar 2013 07:37:00 -0000 From: =?utf-8?B?T25kxZllaiBCw61sa2E=?= To: dhatch at ilm dot com Cc: glibc-bugs@sourceware.org Subject: Re: [Bug dynamic-link/15311] _dl_sort_fini static deps can be violated by dynamic ones Message-ID: <20130328071522.GA4879@domone.kolej.mff.cuni.cz> References: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.20 (2009-06-14) X-SW-Source: 2013-03/txt/msg00162.txt.bz2 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 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.