From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 28111 invoked by alias); 18 Jun 2010 20:17:03 -0000 Received: (qmail 28046 invoked by uid 48); 18 Jun 2010 20:16:43 -0000 Date: Fri, 18 Jun 2010 20:17:00 -0000 Message-ID: <20100618201643.28044.qmail@sourceware.org> From: "werkt0 at gmail dot com" To: glibc-bugs@sources.redhat.com In-Reply-To: <20100618183323.11724.werkt0@gmail.com> References: <20100618183323.11724.werkt0@gmail.com> Reply-To: sourceware-bugzilla@sourceware.org Subject: [Bug libc/11724] ld.so - Initialization and Termination Functions incorrectly ordered X-Bugzilla-Reason: CC 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 X-SW-Source: 2010-06/txt/msg00109.txt.bz2 ------- Additional Comments From werkt0 at gmail dot com 2010-06-18 20:16 ------- Created an attachment (id=4852) --> (http://sourceware.org/bugzilla/attachment.cgi?id=4852&action=view) topological sort implementation for dependency resolution I've used the implementation of tsort from coreutils here almost verbatim. One point of contention might be the (long) cast for comparison in dl-tsort.c - if there's a better portable pointer equiv integer type that will give a negative value for subtraction (since pointers won't), that will be fine. Obviously this introduces some recursion into ld.so, and I saw in a comment that that is not desirable. This implementation works to provide correct init and fini ordering for everything I've thrown at it. -- http://sourceware.org/bugzilla/show_bug.cgi?id=11724 ------- You are receiving this mail because: ------- You are on the CC list for the bug, or are watching someone who is.