|Loop Unroll firstname.lastname@example.org (Alkaid) (2001-05-18)|
|Re: Loop Unroll email@example.com (Mike Dimmick) (2001-05-21)|
|Re: Loop Unroll firstname.lastname@example.org (Venkatesha Murthy G.) (2001-05-21)|
|Re: Loop Unroll email@example.com (Scott Moore) (2001-05-21)|
|Re: Loop Unroll firstname.lastname@example.org (2001-05-21)|
|Re: Loop Unroll email@example.com (Christian Bau) (2001-05-22)|
|From:||"Mike Dimmick" <firstname.lastname@example.org>|
|Date:||21 May 2001 02:01:53 -0400|
|Posted-Date:||21 May 2001 02:01:53 EDT|
"Alkaid" <email@example.com> wrote in message
> When we do ILP optimization, loop unrolling is a kind of method.
> But there is a question: if loop time is a big prime number, how to unroll
> the loop?
> e.g. when loop time is 100, I can unroll the loop 4 times to get a new one
> which has 25 iterations. What shall I do if the loop time is 101?
The obvious solution is to unroll it four times, to get 25 iterations, then
follow the loop with another copy of the contents of the loop, to be
executed one further time.
This increases the size of the program code, but should still increase its
speed (fewer jumps).
[Many other people made similar suggestions. -John]
Return to the
Search the comp.compilers archives again.