From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 18418 invoked by alias); 12 Dec 2003 19:25:01 -0000 Mailing-List: contact gcc-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-owner@gcc.gnu.org Received: (qmail 18406 invoked from network); 12 Dec 2003 19:24:59 -0000 Received: from unknown (HELO atrey.karlin.mff.cuni.cz) (195.113.31.123) by sources.redhat.com with SMTP; 12 Dec 2003 19:24:59 -0000 Received: by atrey.karlin.mff.cuni.cz (Postfix, from userid 29025) id 3A7214C0006; Fri, 12 Dec 2003 20:24:59 +0100 (CET) Date: Fri, 12 Dec 2003 19:42:00 -0000 From: Zdenek Dvorak To: Andrew MacLeod Cc: Chris Lattner , Jeff Law , gcc mailing list Subject: Re: [tree-ssa] Lazy updating of stmt operands Message-ID: <20031212192459.GA9411@atrey.karlin.mff.cuni.cz> References: <1071256652.14001.265.camel@p4> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <1071256652.14001.265.camel@p4> User-Agent: Mutt/1.5.4i X-SW-Source: 2003-12/txt/msg00734.txt.bz2 Hello, > I suspect the loop optimizations are going to fall into the same > category as CCP in that they are going to be interested in the immediate > uses of only a partial subset of variables most of the time. I think its > far more efficient to calculate those when you need them/know what they > are, and possibly maintain just those def->uses. hardly; you still must scan all statements to find the uses, so I don't see where you would want to get the extra efficiency. Zdenek