From owner-freebsd-hackers Tue Sep 15 03:06:45 1998 Return-Path: Received: (from majordom@localhost) by hub.freebsd.org (8.8.8/8.8.8) id DAA02456 for freebsd-hackers-outgoing; Tue, 15 Sep 1998 03:06:45 -0700 (PDT) (envelope-from owner-freebsd-hackers@FreeBSD.ORG) Received: from ns1.yes.no (ns1.yes.no [195.119.24.10]) by hub.freebsd.org (8.8.8/8.8.8) with ESMTP id DAA02447 for ; Tue, 15 Sep 1998 03:06:41 -0700 (PDT) (envelope-from eivind@bitbox.follo.net) Received: from bitbox.follo.net (bitbox.follo.net [195.204.143.218]) by ns1.yes.no (8.9.1a/8.9.1) with ESMTP id MAA07559; Tue, 15 Sep 1998 12:06:22 +0200 (CEST) Received: (from eivind@localhost) by bitbox.follo.net (8.8.8/8.8.6) id MAA22649; Tue, 15 Sep 1998 12:06:21 +0200 (MET DST) Message-ID: <19980915120620.32623@follo.net> Date: Tue, 15 Sep 1998 12:06:20 +0200 From: Eivind Eklund To: Terry Lambert Cc: freebsd-hackers@FreeBSD.ORG Subject: Re: Unused functions References: <199809140114.SAA08497@word.smith.net.au> <199809141806.LAA18220@usr05.primenet.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.89.1i In-Reply-To: <199809141806.LAA18220@usr05.primenet.com>; from Terry Lambert on Mon, Sep 14, 1998 at 06:06:24PM +0000 Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG [Moved to -chat] On Mon, Sep 14, 1998 at 06:06:24PM +0000, Terry Lambert wrote: [... on dead code elimination at the final code level ...] > > It allows the programmer and the C scoping rules to > > work together to determine what should be associated and what need not. > > Instead of the compiler merely calculating hamiltonian cycles in > the dependency graph to do dead code elimination. I don't get what Hamilton cycles has to do with this. It looks like a simple mark-and-sweep GC to me, and I can't see how looking for Hamilton cycles are going to find. Also, I can't think of a single case where I have written code that is likely to have even a single Hamilton cycle - I usually don't call main() from elsewhere in my program (and I certainly don't call _start). If you can involve Hamilton cycles at all here, it sounds like it must be on a subgraph. How? For those following: A Hamilton cycle touch every node in the graph exactly once, and forms a cycle. Eivind. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message