Related articles |
---|
Nop insertion shreyas76@gmail.com (shrey) (2009-10-27) |
Re: Nop insertion n.pipenbrinck@cubic.org (Nils) (2009-10-28) |
Re: Nop insertion cr88192@hotmail.com (BGB / cr88192) (2009-10-28) |
Re: Nop insertion walter@bytecraft.com (Walter Banks) (2009-10-28) |
Re: Nop insertion cfc@shell01.TheWorld.com (Chris F Clark) (2009-10-28) |
Re: Nop insertion gneuner2@comcast.net (George Neuner) (2009-10-29) |
Re: Nop insertion pertti.kellomaki@tut.fi (Pertti Kellomaki) (2009-10-29) |
From: | Walter Banks <walter@bytecraft.com> |
Newsgroups: | comp.compilers |
Date: | Wed, 28 Oct 2009 12:35:56 -0500 |
Organization: | Compilers Central |
References: | 09-10-032 |
Keywords: | architecture |
Posted-Date: | 30 Oct 2009 11:53:17 EDT |
Most of our compilers compile directly to machine code.
We have implemented this kind of code generation with a
constraint function that sits between the code generator
and the actual generated code.
We use this approach to implement many processor specific
requirements.
Regards,
Walter..
--
Walter Banks
Byte Craft Limited
Tel. (519) 888-6911
http://www.bytecraft.com
shrey wrote:
> 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?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.