delorie.com/archives/browse.cgi | search |
Date: | Wed, 27 Nov 1996 14:36:02 -0500 (EST) |
From: | Glen Miner <gminer AT Newbridge DOT COM> |
To: | kagel AT dg1 DOT bloomberg DOT com |
cc: | djgpp AT delorie DOT com |
Subject: | Re: Optimization |
In-Reply-To: | <9611271858.AA11183@quasar.bloomberg.com > |
Message-ID: | <Pine.SUN.3.90.961127143313.19919A-100000@coop10> |
MIME-Version: | 1.0 |
> Clearly -O3 optimizations using array indexing and optimizer determined > register allocation is the fastest scheme. This shows several points: > > 1) Using array indexing is superior to using pointers when any level of > optimization is used. > 2) Manual register allocation is only helpful if no optimization or -O > optimization is used! > 3) Manual register allocation is most helpful with variables used in the > array indexing than pointers. Umm, just a suggestion: this information _REALLY_ should find it's way into the faq. I did do a quick check for this kind of info and didn't come up with anything. Peace ===[ Gabo / [ABC] : gaminer AT undergrad DOT math DOT uwaterloo DOT ca ]=================== Latest ABC Shogi: http://www.undergrad.math.uwaterloo.ca/~gaminer/shogi.html "What Greenpeace spends in a year General Motors spends in four hours" -Moby
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |