cvs.perl.org moved

2002-06-05 Thread Ask Bjoern Hansen
Robert Spier and I moved cvs.perl.org to a new server tonight. Everything should work as usual, except maybe a bit faster. If anything is odd, not working as it used to, working better, not working at all, please send us mail at cvs at perl.org. The new server is faster, spiffier and better con

[Patch] fix check_source errors

2002-06-05 Thread Josh Wilmes
A few coding style errors have crept in lately. The attached patch should fix the majority of them. I didn't touch the MANIFEST errors mentioned, though. --Josh $ make check_source | grep ERROR | grep -v '^languages/' byteorder.c:35 (ERROR) Improper indenting for "# if INTVAL_SIZE == 4" (s

Re: Stack

2002-06-05 Thread Joe Mason
On Wed, Jun 05, 2002 at 12:07:26PM -0700, Sean O'Rourke wrote: > language feature, and that they will rarely be used. I'm sympathetic to > that point of view, having never felt the lack of continuations in my > brief programming life, but if that's the way we want to go, we should at > least be e

[PATCH] Re: Minimum perl version ?

2002-06-05 Thread Nicholas Clark
This is supposed to have one of those bug ID thingies, isn't it, so that it doesn't get lost? All tests successful, 9 subtests skipped. Files=19, Tests=359, 190 wallclock secs (162.14 cusr + 22.67 csys = 184.81 CPU) nwc10@colon [parrot5005]$ grep ^PERL Makefile PERL = /usr/bin/perl nwc10@colon

Re: Stack

2002-06-05 Thread Dan Sugalski
At 4:48 PM +0200 6/5/02, Jerome Vouillon wrote: >My feeling is that the current implementations of stacks are not >adequate: >- the control stacks store too many registers at once; The control stack doesn't store any registers at all. I presume you're talking about the four register frame stacks

Re: Stack

2002-06-05 Thread Jerome Vouillon
On Wed, Jun 05, 2002 at 12:07:26PM -0700, Sean O'Rourke wrote: > Another thing to toss into the discussion, preferably sooner rather than > later: continuations. From what I can tell, implementing continuations > relies on having an arbitrary graph of "stack" frames, and garbage > collecting them

[netlabs #674] [PATCH] saveall and restoreall

2002-06-05 Thread via RT
Index: core.ops === RCS file: /home/perlcvs/parrot/core.ops,v retrieving revision 1.147 diff -u -r1.147 core.ops --- core.ops5 Jun 2002 01:56:08 - 1.147 +++ core.ops5 Jun 2002 20:27:41 - @@ -2731,6 +2731,3

Re: Minimum perl version ?

2002-06-05 Thread Nicholas Clark
On Wed, Jun 05, 2002 at 01:44:07PM -0400, Andy Dougherty wrote: > because lib/Parrot/Makefile.PL contains > > WriteMakefile( > 'NAME' => 'Parrot::PakFile2', > 'VERSION_FROM' => 'PakFile2.pm', # finds $VERSION > > and PakFile2.pm says (among other things) > >

Re: Stack

2002-06-05 Thread Sean O'Rourke
Another thing to toss into the discussion, preferably sooner rather than later: continuations. From what I can tell, implementing continuations relies on having an arbitrary graph of "stack" frames, and garbage collecting them when they can no longer be reached. Putting continuations on top of a

[PATCH] vtable PDD patch

2002-06-05 Thread Jason Gloudon
This clarifies some semantics of the get_string and substr vtables. Index: docs/pdds/pdd02_vtables.pod === RCS file: /home/perlcvs/parrot/docs/pdds/pdd02_vtables.pod,v retrieving revision 1.10 diff -r1.10 pdd02_vtables.pod 175c175,1

Re: Stack

2002-06-05 Thread Melvin Smith
At 04:48 PM 6/5/2002 +0200, Jerome Vouillon wrote: >My feeling is that the current implementations of stacks are not >adequate: >- the control stacks store too many registers at once; They are register windows, so I think they work fine for that purpose. It doesn't mean the control stack must be

Minimum perl version ?

2002-06-05 Thread Andy Dougherty
According to README, You'll also need Perl 5.005 or above, compiled to support the types you wish to support in Parrot. (Parrot will make, but you'll be unable to assemble anything.) You can find what types are support by typing 'perl -V', and examining the values for ivtyp

Ix regs for keyed access, PMCs and other peeves

2002-06-05 Thread Melvin Smith
Warning, if this message is too long, please skim to the bottom and read the part marked IDEA, lest it get lost in the rant. Why make keyed access of arrays any more complicated than it needs to be? The Ix regs are for optimization, so it seems natural for Ix or ICx simply return the i-th elem

Stack

2002-06-05 Thread Jerome Vouillon
My feeling is that the current implementations of stacks are not adequate: - the control stacks store too many registers at once; - the generic stack is typed, so it is slow; - none of these stacks provide any support for register spilling/reload: there is no opcode to get or set the n-th ele

[netlabs #669] [PATCH] fix jako's use of inc and dec

2002-06-05 Thread via RT
Index: jakoc === RCS file: /cvs/public/parrot/languages/jako/jakoc,v retrieving revision 1.16 diff -u -u -p -r1.16 jakoc --- jakoc 28 Jan 2002 20:21:38 - 1.16 +++ jakoc 4 Jun 2002 20:26:45 - @@ -1895,7 +1895,7 @@ sub do_add