Benjamin Kosnik <[EMAIL PROTECTED]> writes: | > Okay, but you need to understand that reasonable bounds for compiling | > the entire program at once are usually 3x-7x more (and in the worst | > case, even wore) than doing it seperately. | > | > That is the case with completely state of the art algorithms, | > implementation techniques, etc. | > | > It's just the way the world goes. | > | > It's in no way reasonable to expect to be able to perform IPA | > optimizations on a 1 million line program in 30 seconds, even if we can | > compile it normally in 10 seconds. | | Tree-SSA managed to add new technology to the compiler without major | slowdowns. I'm suggesting that whatever LTO technology is used do | the same for non-LTO programs. I consider this reasonable.
Indeed. I don't quite understand why people suddently get on their horses. -- Gaby
