|
Re: [perl #32208] [PATCH] Register allocation patch - scales better to mor: msg#00625lang.perl.perl6.internals
At 12:30 PM +0200 10/29/04, Leopold Toetsch wrote: Bill Coffman (via RT) wrote: I'll give it a shot as soon as I can. WANT TO DO: I should point out, for the folks following along at home, that it's 6K lines of source in the original language (DecisionPlus). The actual PIR code generated runs to 84k lines in the biggest sub. Some more notes WRT the patch: I'd like to get us down to a single global for all of Parrot. I don't think it's possible to safely go any lower than that, though I suppose we could if we really, really tried, and didn't mind things crashing and burning in some really odd fringe edge cases. * all functions should have an Interp* and a IMC_Unit* argument to allow reentrancy. I.e. all state should be in the unit structure. Definitely. * Variable names should be a bit more verbose, G.V is to terse. Yeah. This stuff is abstruse enough as it is -- take pity on those uf us with Very Little Brain. :) * alloca() isn't portable and not available everywhere Yep. This is a gcc-ism. Use Parrot's memory allocation functions instead. I'm waiting for Dan's comments on usability. I'd like the code issues cleaned up before it gets committed. I'll let you know the timing as soon as I can, though it'll probably take a few hours. -- Dan --------------------------------------it's like this------------------- Dan Sugalski even samurai dan@xxxxxxxxx have teddy bears and even teddy bears get drunk |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | Re: C89: 00625, Bryan Donlan |
|---|---|
| Next by Date: | Re: Q: newsub opcodes: 00625, Dan Sugalski |
| Previous by Thread: | Re: [perl #32208] [PATCH] Register allocation patch - scales better to more symbolsi: 00625, Leopold Toetsch |
| Next by Thread: | Re: [perl #32208] [PATCH] Register allocation patch - scales better to more symbols: 00625, Dan Sugalski |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |