public inbox for gcc-help@gcc.gnu.org
 help / color / mirror / Atom feed
* How to go for peephole optimizations
@ 2010-02-23 15:39 rohitgeek
  2010-02-23 22:00 ` Ian Lance Taylor
  0 siblings, 1 reply; 2+ messages in thread
From: rohitgeek @ 2010-02-23 15:39 UTC (permalink / raw)
  To: gcc-help


Hi,

Can i get the basic information about applying peephole optimizations when
porting gcc for a new processor. Also how to generate single instruction in
assembly for complex instructions like MAC( multiply and accumulate) instead
of two instructions( mul and add seperate).

Thanks
-- 
View this message in context: http://old.nabble.com/How-to-go-for-peephole-optimizations-tp27702216p27702216.html
Sent from the gcc - Help mailing list archive at Nabble.com.

^ permalink raw reply	[flat|nested] 2+ messages in thread

* Re: How to go for peephole optimizations
  2010-02-23 15:39 How to go for peephole optimizations rohitgeek
@ 2010-02-23 22:00 ` Ian Lance Taylor
  0 siblings, 0 replies; 2+ messages in thread
From: Ian Lance Taylor @ 2010-02-23 22:00 UTC (permalink / raw)
  To: rohitgeek; +Cc: gcc-help

rohitgeek <rohit23taneja@gmail.com> writes:

> Can i get the basic information about applying peephole optimizations when
> porting gcc for a new processor. Also how to generate single instruction in
> assembly for complex instructions like MAC( multiply and accumulate) instead
> of two instructions( mul and add seperate).

This is all documented in the gcc internals documentation.

http://gcc.gnu.org/onlinedocs/gccint/

Ian

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2010-02-23 18:30 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2010-02-23 15:39 How to go for peephole optimizations rohitgeek
2010-02-23 22:00 ` Ian Lance Taylor

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).