|Strength Reduction napi@rangkom.MY (1991-09-17)|
|Re:strength reduction firstname.lastname@example.org (1991-09-17)|
|Re: Strength Reduction email@example.com (1991-09-17)|
|Re: strength reduction albaugh@dms.UUCP (1991-09-23)|
|Re: strength reduction firstname.lastname@example.org (1991-09-25)|
|From:||email@example.com (Steve Simmons)|
|Organization:||CONVEX Computer Corporation, Richardson, Tx., USA|
|Date:||Tue, 17 Sep 1991 14:49:47 GMT|
Loop induction variable optimization has its biggest win by
transforming an index into the array to a direct pointer to the
element. Thus, the calculation of each element's address into
the array is removed from the body of the loop. For example,
the following pseudo code is less efficent than the later...
*(&A + (4*i)) = 0
Converted to loop induction variable
for ptr = loc(A), loc(a)+(4*(n-1)), 4
*ptr = 0
Notice, the address calculation has been completely optimized away.
Return to the
Search the comp.compilers archives again.