From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 30156 invoked by alias); 12 Dec 2003 19:45:07 -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 30140 invoked from network); 12 Dec 2003 19:45:04 -0000 Received: from unknown (HELO nondot.org) (128.174.245.159) by sources.redhat.com with SMTP; 12 Dec 2003 19:45:04 -0000 Received: by nondot.org (Postfix, from userid 501) id A3E7F17C035; Fri, 12 Dec 2003 14:46:44 -0500 (EST) Received: from localhost (localhost [127.0.0.1]) by nondot.org (Postfix) with ESMTP id 960B924C2AD; Fri, 12 Dec 2003 13:46:44 -0600 (CST) Date: Fri, 12 Dec 2003 19:54:00 -0000 From: Chris Lattner To: Andrew MacLeod Cc: Zdenek Dvorak , Jeff Law , gcc mailing list Subject: Re: [tree-ssa] Lazy updating of stmt operands In-Reply-To: <1071258158.14021.272.camel@p4> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-SW-Source: 2003-12/txt/msg00736.txt.bz2 > > 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. > > > Scanning stmts is very cheap. You must not have run across programs that have PHI nodes with thousands of operands... > The uses/defs are all cached. Don't caches take space? > And if you do need it over a chain of optimizations, do it once, and > then keep the info up to date/. You'll be a lot better off I think Isn't that the whole idea? -Chris -- http://llvm.cs.uiuc.edu/ http://www.nondot.org/~sabre/Projects/