[gambit-list] Poor compilation of do-loops
lucier at math.purdue.edu
Sat Oct 17 13:16:25 EDT 2009
On Oct 16, 2009, at 12:51 PM, Bradley Lucier wrote:
> On Thu, 2009-10-15 at 15:57 -0400, Marc Feeley wrote:
>> So a heuristic would have to be developed to identify the cases where
>> your transformation is a win. Care to find one? It doesn't seem
> How about "do it if it doesn't increase the number of free variables
> k%", like inlining-limit.
After thinking about it some more, this doesn't seem like such a bad
What do you think?
More information about the Gambit-list