Mario Mommer <[EMAIL PROTECTED]> writes:
> I know that gcc uses lots of "peephole" optimizations. That is, they > substitute sequences of assembly with other sequences "known" to be > faster. I think that the reason is that in x86 there is a lot more > voodoo available than pipelining and cache-line-filling, like > implicit over-allocation of registers, etc (1). Wouldn't that be also an option for CL compilers? Are there any CL implementations out there which do "peephole" optimizations? (Disclaimer: I have no idea what I'm talking about. The last assembler programs I wrote were for the 6502 and I've no experiences with implementing compilers. I just thought this might be a route feasible for CMUCL or other CL compilers.) Cheers, Edi.
