|Nop insertion email@example.com (shrey) (2009-10-27)|
|Re: Nop insertion firstname.lastname@example.org (Nils) (2009-10-28)|
|Re: Nop insertion email@example.com (BGB / cr88192) (2009-10-28)|
|Re: Nop insertion firstname.lastname@example.org (Walter Banks) (2009-10-28)|
|Re: Nop insertion cfc@shell01.TheWorld.com (Chris F Clark) (2009-10-28)|
|Re: Nop insertion email@example.com (George Neuner) (2009-10-29)|
|Re: Nop insertion firstname.lastname@example.org (Pertti Kellomaki) (2009-10-29)|
|Date:||Tue, 27 Oct 2009 20:06:55 -0700 (PDT)|
|Posted-Date:||28 Oct 2009 08:59:34 EDT|
This is both an architecture and compiler question.
Are there inorder architectures that need precise number of nops
inserted between operations. If so, how does a compiler guarantee
that ? I am especially thinking of producers and consumers in faraway
basic blocks. Any pointers to any exiting work?
[There have been a few, it's typically done by the assembler. -John]
Return to the
Search the comp.compilers archives again.