paul@UUNET.UU.NET (Paul Hudson) (04/10/89)
I was reading a book on compilers and there was a nice example with the fibonacci function where f(5) was expanded, and the result expanded, .. and so on 5 times, the result folded and the whole call replaced by a constant. The depth of recursive expansion was an option. It would be nice to have this in gcc. But a cursory examination of inlining shows that the rtl for an inlined function is spliced in to the rtl being generated from the tree for an expression. This would make it rather difficult. Am I barking up the wrong tree? (I knew there was a good reason for keeping functions as trees ;-) .... Ah well, perhaps in my yet-to-be m2 compiler since I'll have to build a tree anyway) Paul Hudson Snail mail: Monotype ADG Email: ...!ukc!acorn!moncam!paul Science Park, paul@moncam.co.uk Milton Road, "Sun Microsysytems: Cambridge, The Company is Arrogant (TM)" CB4 4FQ