From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 25216 invoked by alias); 10 Jan 2008 18:26:19 -0000 Received: (qmail 25054 invoked by uid 48); 10 Jan 2008 18:25:35 -0000 Date: Thu, 10 Jan 2008 19:12:00 -0000 Message-ID: <20080110182535.25053.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/30927] tree-nested creates pointless static chains and trampolines when the callgraph is non-trivial In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "baldrick at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2008-01/txt/msg00947.txt.bz2 ------- Comment #8 from baldrick at gcc dot gnu dot org 2008-01-10 18:25 ------- > Your solution seems to be somewhat complex though. Can't we get away with > an iterative propagation algorithm for the DECL_NO_STATIC_CHAIN flag? Yes, but it is less efficient: in the worst case the number of node visits goes up by a factor of the nesting depth. Since this depth is sure to be fairly small (typically 2 or 3) this probably is of no consequence. I am now working on a revised patch. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30927