Date: Mon, 10 May 1999 21:54:55 +0200 To: pgcc AT delorie DOT com Subject: Re: Optimization question Message-ID: <19990510215455.E22062@cerebro.laendle> Mail-Followup-To: pgcc AT delorie DOT com References: <14135 DOT 5025 DOT 220697 DOT 966833 AT lrz DOT de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii In-Reply-To: <14135.5025.220697.966833@lrz.de>; from Eugene Leitl on Mon, May 10, 1999 at 10:14:14AM -0700 X-Operating-System: Linux version 2.2.7 (root AT cerebro) (gcc driver version pgcc-2.93.09 19990221 (gcc2 ss-980929 experimental) executing gcc version 2.7.2.3) From: Marc Lehmann Reply-To: pgcc AT delorie DOT com X-Mailing-List: pgcc AT delorie DOT com X-Unsubscribes-To: listserv AT delorie DOT com Precedence: bulk On Mon, May 10, 1999 at 10:14:14AM -0700, Eugene Leitl wrote: > > good compilers should optimize such expressions by itself, the method is > > called "common subexpression optimization". > > Historically, this has never worked very well. ????? > Also, I'm wary of software which attempts to act intelligently but > isn't. This has nothing to do with intellgence - the language (C in this example) defines which rules are ok and which are a no-no. Fortran allows much more freedom for example. -- -----==- | ----==-- _ | ---==---(_)__ __ ____ __ Marc Lehmann +-- --==---/ / _ \/ // /\ \/ / pcg AT goof DOT com |e| -=====/_/_//_/\_,_/ /_/\_\ XX11-RIPE --+ The choice of a GNU generation | |