Dan Sugalski wrote:
> At 10:44 AM +0200 7/28/02, Leopold Toetsch wrote:
>
>> 2) Some Mops numbers, all on i386/linux Athlon 800, slightly shortend:
>> (»make mops« in parrot root)
>
>
> Just out of curiosity, I presume the (rather abysmal) perl 6 numbers
> include time to generate the assembl
--- Jonathan Sillito
> close_lex # end of nested lexical scope
>
> find_lex P3, "a"
> print P3 # prints 12
> print "\n"
> end
>
That's a typo, right? It should print the first value
of "a" (10). Just making sure I'm not crazy ...
Stephen Rawls
_
Dan Sugalski wrote:
> At 10:44 AM +0200 7/28/02, Leopold Toetsch wrote:
>
>> 2) Some Mops numbers, all on i386/linux Athlon 800, slightly shortend:
> Just out of curiosity, I presume the (rather abysmal) perl 6 numbers
After the bugfix in perlarray.pmc I can bring you new numbers, which are
On Mon, Jul 22, 2002 at 11:14:15AM +0100, Sam Vilain wrote:
> "Sean O'Rourke" <[EMAIL PROTECTED]> wrote:
>
> > languages/perl6/README sort of hides it, but it does say that "If you have
> > Perl <= 5.005_03, "$a += 3" may fail to parse." I guess we can upgrade
> > that to "if you have < 5.6, you
At 10:23 AM 7/30/2002 +0200, Leopold Toetsch wrote:
>Dan Sugalski wrote:
>>Just out of curiosity, I presume the (rather abysmal) perl 6 numbers
>We have already the same Mops as perl5, but additionaly 2.3 seconds
>overhead. Just running the byte code is as fast as perl5.
>
>Without jit, mops.p6 p
On Mon, 2002-07-29 at 17:12, Simon Glover wrote:
> I think you forgot to attach the patch...
oops, now the files are attached ...
- patch: lex.patch
- test file: lexicals.t
- example file: lexicals.pasm
On Tue, 2002-07-30 at 02:14, Stephen Rawls wrote:
> --- Jonathan Sillito
> > close_l
See my 2 comments:
> new P0, .PerlInt
> new P1, .PerlInt
> new P2, .PerlInt
> new P3, .PerlInt
> set P0, 10
> set P1, 11
> set P2, 12
>
> # outer most lexical scope
> open_lex
New pad
> store_lex P0, "a"
> find_lex P3, "a"
> print P3 # prints 10
> print "\n"
>
># nest
Thanks sir, applied.
-Melvin Smith
IBM :: Atlanta Innovation Center
[EMAIL PROTECTED] :: 770-835-6984
Nick Clark is working on ARM, but we are still missing at least the
following importantish JIT implementations:
* PPC - PowerPC (Motorola) and POWER (IBM) -- I know there's a "common"
instruction set that works both on the "consumer" PPCs and the HPC
(high performance computing) POWER chips.
Thanks for the correction. May I ask about the find_lex op? In my
implementation it looks back through the stack of pads for the given
lexical:
new P0, .PerlInt
new P1, .PerlInt
set P0, 10
open_lex
store_lex P0, "a"
# nested lexical scope
open_lex
find_lex P1, "a"
print P
At 10:43 AM -0400 7/29/02, Melvin Smith wrote:
>At 10:45 AM 7/29/2002 +0100, Nicholas Clark wrote:
>>[Maybe we should have a competition to suggest the most crazy three character
>>operator - ie state your sequence of three characters (not necessarily ASCII,
>>but it helps), state their name, and
At 9:47 PM + 7/29/02, Angel Faus (via RT) wrote:
>I've made a patch for the regex engine, designed with the single goal
>of seriously cheating for speed. :-)
Wow. Register spilling, and now this. Damn, with all the folks doing
clever things here, I'm feeling decidedly superfluous. :)
But...
At 8:12 AM +0200 7/30/02, =?latin1?Q?Josef_H=F6=F6k?= wrote:
>As im not that familiar with spamassasin maybe someone could help me
>stop getting my mail tagged as spam when mailing patches..
Sure. I'd send this privately, but as it affects some other folsk as well...
The biggest thing that kills
At 8:53 PM -0700 7/29/02, Sean O'Rourke wrote:
>On Mon, 29 Jul 2002, Dan Sugalski wrote:
>> If I thought anyone'd do control flow with it, I'd have a version of
>> the op for that, but I don't think we're going to see that, and perl
>> doesn't do it, so...
>
>Okay, writing this email has convin
At 10:34 PM -0300 7/29/02, Daniel Grunblatt wrote:
>On Mon, 29 Jul 2002, Nicholas Clark wrote:
> > As you can see from the patch all it does is implement the end
>and noop ops.
>> Everything else is being called. Interestingly, JITing like this is slower
>> than computed goto:
>
>Yes, function
On Tue, 30 Jul 2002, Jarkko Hietaniemi wrote:
> Nick Clark is working on ARM, but we are still missing at least the
> following importantish JIT implementations:
>
> * PPC - PowerPC (Motorola) and POWER (IBM) -- I know there's a "common"
> instruction set that works both on the "consumer" PPCs
Yes, we can do that, we can also try to go in and out from the computed
goto core if available.
Daniel Grunblatt.
On Tue, 30 Jul 2002, Dan Sugalski wrote:
> At 10:34 PM -0300 7/29/02, Daniel Grunblatt wrote:
> >On Mon, 29 Jul 2002, Nicholas Clark wrote:
> > > As you can see from the patch all
At 10:16 AM -0600 7/30/02, Jonathan Sillito wrote:
>Hey, thanks for reading this over. It is not a typo, but it may be
>incorrect. My code does overwrite previous lexicals in enclosing scopes
>(i.e. lexicals in pads lower on the stack), but maybe I have the
>semantics of the store_lex op wrong?
Y
> > * MIPS - I know a little bit more about these, but I *suspect there's
> > a simple common instruction set
> >
> > * HPPA - I know very little about these, is there a common instruction set?
> >
> > * IA64 - reports of the IA64 instruction set tell that it combines
> > the "elegance" of the
At 11:01 AM -0600 7/30/02, Jonathan Sillito wrote:
>Thanks for the correction. May I ask about the find_lex op? In my
>implementation it looks back through the stack of pads for the given
>lexical:
One thing we need to add is a constant type to initialize pads. It's
perfectly acceptable, and in
On Tue, 30 Jul 2002, Dan Sugalski wrote:
> I need to get Larry to nail some things down. On the one hand, he's
> said that chained comparisons evaluate their parameters just once.
> That argues for moving the values to N or S registers.
I read that as "expressions are evaluated once", not "PMC's
Dan wrote:
>At 10:43 AM -0400 7/29/02, Melvin Smith wrote:
>>At 10:45 AM 7/29/2002 +0100, Nicholas Clark wrote:
>>The VM and assembler does not need to provide every operator as
>>an new 'op'. Eventually, languages with funky operators need to start
thinking
>>about implementing them as methods or
On Tue, 30 Jul 2002, Sean O'Rourke wrote:
> And if you've tied a variable to have side effects every time it's
> accessed, you shouldn't care if the results are unpredictable.
s/tied a variable/implemented a type/. Argh.
/s
On Tue, 30 Jul 2002, Melvin Smith wrote:
> I think of Parrot as a CPU. When we have adequately designed the CPU,
> people don't need new ops.
I think of it as a VAX, in which case "adequately designed" means "just a
few microcode ops" ;).
/s
# New Ticket Created by Simon Glover
# Please include the string: [perl #15845]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15845 >
This code segfaults:
sweepoff
set I0, 0
LOOP: new P0, .PerlString
On Tue, Jul 30, 2002 at 11:08:46AM -0700, Sean O'Rourke wrote:
> On Tue, 30 Jul 2002, Dan Sugalski wrote:
> > I need to get Larry to nail some things down. On the one hand, he's
> > said that chained comparisons evaluate their parameters just once.
> > That argues for moving the values to N or S r
At 7:28 PM +0100 7/30/02, Graham Barr wrote:
>On Tue, Jul 30, 2002 at 11:08:46AM -0700, Sean O'Rourke wrote:
>> On Tue, 30 Jul 2002, Dan Sugalski wrote:
>> > I need to get Larry to nail some things down. On the one hand, he's
>> > said that chained comparisons evaluate their parameters just onc
# New Ticket Created by Jonathan Sillito
# Please include the string: [perl #15846]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15846 >
This patch supersedes my previous lexical scope patch
http://rt.perl.org/rt2/Ticke
The slides for the talk I presented at the O'Reilly Open Source
conference last week in Sad Diego are now available:
http://www.astray.com/targeting_parrot/
Note that more Parrot talks are at http://www.parrotcode.org/talks/
FYI The conference went well and I'm sure Dan will get his slides up
soo
# New Ticket Created by Angel Faus
# Please include the string: [perl #15850]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15850 >
Hi,
This patch makes imcc again take in account the data-flow information
gathered, in
On Tue, 30 Jul 2002, Leon Brocard wrote:
> The slides for the talk I presented at the O'Reilly Open Source
> conference last week in Sad Diego are now available:
> http://www.astray.com/targeting_parrot/
> Note that more Parrot talks are at http://www.parrotcode.org/talks/
>
> FYI The conference
On Sun, 28 Jul 2002, Leopold Toetsch wrote:
> [lt@thu8:~/src/parrot-007/examples/mops]
> $ perl mops.pl
> Iterations:1000
> M op/s:2.22
>
> (Iteration count for mops.pl was reduced, patch sent)
>
> Summary:
> Program
> Mops
> perl5.005_03
> 2.2
> perl6
>
On Mon, Jul 29, 2002 at 10:34:00PM -0300, Daniel Grunblatt wrote:
> On Mon, 29 Jul 2002, Nicholas Clark wrote:
>
> > Here's a very minimal ARM jit framework. It does work (at least as far as
> > passing all 10 t/op/basic.t subtests, and running mops.pbc)
>
> Cool, I have also been playing with A
On Tue, Jul 30, 2002 at 08:45:58PM +0300, Jarkko Hietaniemi wrote:
> For the HPPA and IA64 I think getting an account in the HP/CPQ Test
> Drive machines should help:
>
> http://www.testdrive.compaq.com/
>
> For MIPS, I dunno whether SGI has something similar.
PlayStation is little endian mips
On Mon, Jul 29, 2002 at 09:47:53PM +, Angel Faus wrote:
> I've made a patch for the regex engine, designed with the single goal
> of seriously cheating for speed. :-)
And what would be unperlish about this "cheating" concept? :-)
> Anyway, this patch has brought me the personal conviction t
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15865]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15865 >
Regarding the remaining warnings from perl #15805: SGI cc takes really
unkindly to
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15870]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15870 >
(Kind of a patch...)
It seems that UNICOS/mk needs ld to be cc for Configure.pl t
At 06:56 PM 7/30/2002 +, via RT wrote:
># New Ticket Created by Jonathan Sillito
># Please include the string: [perl #15846]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15846 >
>
>
>This patch supersedes my previous l
At 07:21 PM 7/30/2002 +, via RT wrote:
># New Ticket Created by Angel Faus
># Please include the string: [perl #15850]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15850 >
>
>This patch makes imcc again take in account
At 02:48 PM 7/22/2002 +, Stéphane Payrard wrote:
>On Sun, Jul 21, 2002 at 02:05:42PM +, s. payrard @ wanadoo. fr wrote:
> > # New Ticket Created by [EMAIL PROTECTED]
> > # Please include the string: [perl #15267]
> > # in the subject line of all future correspondence about this issue.
>
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15872]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15872 >
cc -DNO_RCHECK -I/usr/local/include -I./include -o platform.o -c platf
This patch implements native extensions and continuations as pmcs. It also
cleans up the existing Sub and Coroutine types, and removes the following
now-obsolete ops:
callco
callcc
capturecc
call
callnative
These are all handled through various uses of "invoke" (see t/pmc/sub.t
for simple exampl
# New Ticket Created by Stephen Rawls
# Please include the string: [perl #15876]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15876 >
NOTE: I'm resending this now that the minitutorial has
come out saying how to send upd
In my never-ending crusade to try and keep the bug system from passing
on lots of spam, some messages have been falsely flagged as spam.
Please look at tickets 15748 and 15877.
We've done a bunch of tweaking tonight, so hopefully the falsepos
count will drop and falseneg count will go up. In g
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15879]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15879 >
Using ld for ld does not work.
diff -ruN parrot/config/init/hints/unicosmk.pl
pa
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15880]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15880 >
I think the generic platform.c should not assume dynamic loading.
This patch helps
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15882]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15882 >
I thought "exit code 0.01171875" was odd.
diff -ruN parrot/lib/Parrot/Test.pm par
At 05:21 AM 7/31/2002 +, via RT wrote:
># New Ticket Created by Jarkko Hietaniemi
># Please include the string: [perl #15879]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15879 >
>
>
>Using ld for ld does not work.
Ap
# New Ticket Created by Jarkko Hietaniemi
# Please include the string: [perl #15883]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15883 >
SGI cc gets upset by enum bit arithmetics.
diff -ruN parrot/stacks.c parrot+cast/
At 05:24 AM 7/31/2002 +, via RT wrote:
># New Ticket Created by Jarkko Hietaniemi
># Please include the string: [perl #15880]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15880 >
>
>
>I think the generic platform.c sho
At 05:26 AM 7/31/2002 +, via RT wrote:
># New Ticket Created by Jarkko Hietaniemi
># Please include the string: [perl #15882]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15882 >
>
>
>I thought "exit code 0.01171875" w
At 05:28 AM 7/31/2002 +, via RT wrote:
># New Ticket Created by Jarkko Hietaniemi
># Please include the string: [perl #15883]
># in the subject line of all future correspondence about this issue.
># http://rt.perl.org/rt2/Ticket/Display.html?id=15883 >
>
>
>SGI cc gets upset by enum bit arit
# New Ticket Created by Leopold Toetsch
# Please include the string: [perl #15885]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=15885 >
Hi,
attached Patch fixes a small problem with string_2.pasm.
assemple.pl:_annotate_
Daniel Grunblatt wrote:
> On Sun, 28 Jul 2002, Leopold Toetsch wrote:
[ Mops ]
>>plain c 366
> You didn't use -O3 while compiling mops.c, did you?
No. Just Makefile's options as defined.
But interesting idea. It makes the inner loop look like this:
..L492:
54 matches
Mail list logo
