The Phalanx project has started its rampup to an official
announcement. Phalanx is going to beef up the tests, coverage and
docs on Perl and 100 heavily-used modules from CPAN.
The project page is at http://qa.perl.org/phalanx/. Please take a
look, tell me your thoughts, and if there are any
Leopold Toetsch wrote:
>
> IMHO is
>
>$a = \$h{"a"};
>print $$a;
>$$a = "xxx\n";
>$a = $h{"a"};
>print $a;
>
> the same as:
>
>new P1, .PerlHash
>set P0, P1["a"]
>print P0
>set P0, "xxx\n"
>set P2, P1["a"]
>print P2
>end
>
> (PMCs have referenc
Dan should really be answering this, but I'll try...
Tom Locke:
# The FAQ briefly mentions:
#
# we're already running with a faster opcode dispatch
# than [Perl, Python, and Ruby] are, and having registers just
# decreases the amount of stack thrash we get.
#
# Can I for one ask for
Juergen Boemmels wrote:
>
> "Vladimir Lipskiy" <[EMAIL PROTECTED]> writes:
>
> [...]
>
> > sub runstep {
> > my $inc = 'include/parrot';
> >
> > my @headers=(
> > sort
> > map { m{\./$inc/(.*)} }
> > glob "./$inc/*.h"
> > );
>
> in a non clean tree the gener
I would like for Parrot to have some way of creating Weak References; I
think that this is probably a vital feature.
The way I envision this is as follows. The following typedef and new
function would be added:
typedef void (*pobject_died_cb)(INTERP, PMC* who_asked,
Pobj* weakref, void *call
Tom Locke wrote:
>
> OK, here's what I'm hoping Parrot can provide for the language I'm building.
>
> My big requirement is for lightweight microthreads (hopefully *very*
> lightweight - I'm considering one scheduler that can handle *millions*
> of threads on a single machine).
Hmm, I can envi
Leopold Toetsch wrote:
>
> Benjamin Goldberg wrote:
>
> >
> > Leopold Toetsch wrote:
> > Not having an INTERP argument severely limits us, even in other ways.
>
> The INTERP argument is fine. The user defined encoding is/was my
> problem.
As in, you think we shouldn't have any, at all?
> > Sim
On Thu, Aug 21, 2003 at 10:19:35PM +0100, Fergal Daly wrote:
> ok 1.2.3 allows this
>
> ok 1.1.1
> ok 1.2.1
> ok 1.1.2
> ok 1.2.2
>
> so if people use the Test::AtRuntime they can also execute those tests at test
> time, just allocate subblock 1.* to all the runtime tests. They will appear
> in
> > But Parrot has continuations. Doesn't this gives me (cooperative)
> > microthreads? (with a little work on my part).
>
> Sure...
So these would be real cheap right? Time and space overheads similar to
regular procedure calls?
> The world could also use a pony. And a lollypop. :)
Um, I think
Sean O'Rourke wrote:
> From: Sean O'Rourke [mailto:[EMAIL PROTECTED]
> Sent: Thursday, August 21, 2003 1:56 PM
> To: Tom Locke
> Cc: [EMAIL PROTECTED]
> Subject: Re: Registers vs. Stack
>
>
> "Tom Locke" <[EMAIL PROTECTED]> writes:
> > p.s. (and at the risk of being controversial :) Why did Mig
Nicholas Clark wrote:
>
> On Wed, Aug 20, 2003 at 07:19:42PM -0400, Benjamin Goldberg wrote:
>
> > Leopold Toetsch wrote:
>
> > > But these could be converted to utf32 as soon as they are seen.
> >
> > For a long string, that could be quite a bit of bloat.
>
> Jarkko's view is that the combin
> > My big requirement is for lightweight microthreads...
>
> Parrot's going to live on top of the system thread library, so you may run
> into some issues that way. Not all systems can handle lots of
> threads--many of them (including Linux) have very low limits relative to
> what most microthread
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> On Thu, Aug 21, 2003 at 03:31:42PM +0200, Leopold Toetsch wrote:
>> When a PMC is shared it is either ro or rw - in all threads. I don't see
>> a problem here.
> I don't see a problem but I do see a possible optimisation.
> I can't remember if you were
Andy Bussey <[EMAIL PROTECTED]> wrote:
> It is a rather hasty attempt at a highlighter for
> KDE's Kate editor.
I seem to have forgotton to reply:
Its applied, thanks
> Cheers,
> Andy Bussey
leo
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> On Thu, Aug 21, 2003 at 11:03:58AM -0400, Tom Locke wrote:
>> Oh and I have to ask your opinions - will Guido get a pie in the face next
>> year?
> No, unless Dan gets good or lucky with his aim. 10 paces is a long way.
He will have to practice his skil
>Leo already applied this suggestion.
Yups. I found out that when I was sending my patch (~:
>Sometimes he is faster than light.
/me gets out a lightning-rod as me says: "Yes. He is all like that"
Hi,
Computed goto is a feature supported by GCC (not sure which others) that
allows using dynamic
addresses as jump targets from C. This allows the opcode tables to be
loaded and jumps to
the op can be much faster than a subroutine call. On the other hand, good
compilers can sometimes
optimize
ok 1.2.3 allows this
ok 1.1.1
ok 1.2.1
ok 1.1.2
ok 1.2.2
so if people use the Test::AtRuntime they can also execute those tests at test
time, just allocate subblock 1.* to all the runtime tests. They will appear
in the output, intermixed with all your other tests but they will not
interfere wi
Nicholas Clarke wrote:
>the computed-goto-predereference core
Zarniwoop! Can you explain what this means?
Thanks,
Nathanael Kuipers
On Thu, Aug 21, 2003 at 12:17:39PM -0700, Michael G Schwern wrote:
> Not if you introduce an end tag (though I'd rather not).
Why not? I'd like the ability to specify a variant of no plan that is
roughly "it ain't over until the fat lady sings" and then if I don't
print out a singing fat lady as
On Thu, Aug 21, 2003 at 02:39:56PM +0100, Fergal Daly wrote:
> Full nesting requires more state to be held and as it stands, doesn't help in
> your example below. It could be altered to support it though by adding
> support for standalone sub blocks, ie where the harness should temporarily
> for
On Thu, Aug 21, 2003 at 08:34:44AM -0500, Danny R. Faught wrote:
> Michael G Schwern wrote:
> >What books out there are of use for those wanting to learn Perl testing?
> >They don't necessarily have to be specificly about *Perl* testing.
> >I've put up a Wiki page to generate a listing.
> >http://w
On Thu, Aug 21, 2003 at 02:38:03PM +0100, Fergal Daly wrote:
> 1 problem here is that you have not indicated anywhere how many times you will
> be extending the plan
Some sort of *optional* way to specify that would be nice.
> > The former has the large disadvange of requiring all subtests to b
On Thu, Aug 21, 2003 at 03:31:42PM +0200, Leopold Toetsch wrote:
> Nicholas Clark <[EMAIL PROTECTED]> wrote:
> > I'm not sure if a simple read/write split also helps PMCs shared across
> > threads. Maybe sharing between threads is a whole new can of worms that we
> > should leave untouched for now
On Thu, Aug 21, 2003 at 11:03:58AM -0400, Tom Locke wrote:
> Oh and I have to ask your opinions - will Guido get a pie in the face next
> year?
No, unless Dan gets good or lucky with his aim. 10 paces is a long way.
However, given the sterling work of Daniel and Leo on the JIT, I expect
Dan will
"Tom Locke" <[EMAIL PROTECTED]> writes:
> p.s. (and at the risk of being controversial :) Why did Miguel de
> Icaza say Parrot was "based on religion"? Was it realted to this
> issue? Why is he wrong?
IIRC it is -- his take is that stack VM code provides useful
information about variable lifetimes
On Thu, 21 Aug 2003, Tom Locke wrote:
> > > My big requirement is for lightweight microthreads...
> >
> > Parrot's going to live on top of the system thread library, so you may run
> > into some issues that way. Not all systems can handle lots of
> > threads--many of them (including Linux) have ve
Dan Sugalski wrote:
> On Thu, 21 Aug 2003, Tom Locke wrote:
>
> > My big requirement is for lightweight microthreads (hopefully
> > *very* lightweight - I'm considering one scheduler that can
> > handle *millions* of threads on a single machine).
[...]
>
> Parrot's going to live on top of the sys
On Thu, 21 Aug 2003, Tom Locke wrote:
> OK, here's what I'm hoping Parrot can provide for the language I'm building.
>
> My big requirement is for lightweight microthreads (hopefully *very*
> lightweight - I'm considering one scheduler that can handle *millions* of
> threads on a single machine).
On Thu, 21 Aug 2003, Tom Locke wrote:
> Hi Michal
>
> > > My first choice is whether to go for a VM, or a C-Python style
> > > implementation. Right now I'm leaning towards VM.
> >
> > I'm not sure what you mean by the difference here. CPython
> > does have a VM, it's just a stack-based one.
>
>
On Thu, 21 Aug 2003, Elizabeth Mattijsen wrote:
> At 14:15 +0100 8/21/03, Nicholas Clark wrote:
> >On Wed, Aug 20, 2003 at 07:19:42PM -0400, Benjamin Goldberg wrote:
> > > Leopold Toetsch wrote:
> > > > But these could be converted to utf32 as soon as they are seen.
> > > For a long string, tha
Hi All
Is there somewhere you can point me to a discussion about the choice for a
register VM rather than a stack VM? If not, let's have it now - I'll
volunteer to tidy the end result into a postable form.
The FAQ briefly mentions:
we're already running with a faster opcode dispatch
than
Index: MANIFEST
===
RCS file: /cvs/public/parrot/MANIFEST,v
retrieving revision 1.405
diff -u -r1.405 MANIFEST
--- MANIFEST 20 Aug 2003 11:01:35 - 1.405
+++ MANIFEST 21 Aug 2003 11:43:47 -
@@ -1348,6 +1348,7 @@
io/TODO
At 14:15 +0100 8/21/03, Nicholas Clark wrote:
On Wed, Aug 20, 2003 at 07:19:42PM -0400, Benjamin Goldberg wrote:
> Leopold Toetsch wrote:
> > But these could be converted to utf32 as soon as they are seen.
> For a long string, that could be quite a bit of bloat.
Jarkko's view is that the combine
OK, here's what I'm hoping Parrot can provide for the language I'm building.
My big requirement is for lightweight microthreads (hopefully *very*
lightweight - I'm considering one scheduler that can handle *millions* of
threads on a single machine). Oh and I will need them to be serializable. I
ca
Hi Michal
> > My first choice is whether to go for a VM, or a C-Python style
> > implementation. Right now I'm leaning towards VM.
>
> I'm not sure what you mean by the difference here. CPython
> does have a VM, it's just a stack-based one.
OK so I'm learning already :)
I thought CPython was mor
IMHO is
$a = \$h{"a"};
print $$a;
$$a = "xxx\n";
$a = $h{"a"};
print $a;
the same as:
new P1, .PerlHash
set P0, P1["a"]
print P0
set P0, "xxx\n"
set P2, P1["a"]
print P2
end
(PMCs have reference semantics[1])
Shouldn't that print "xxx" as perl5 does? I.e. store the returne
> Done that, thanks for your suggestion.
PoWwoW! It's unfair. He passed ahead of me.
> in a non clean tree the generated files are picked up also.
Yepper. I'll prepare the FINAL EDITION of that patch.
> Non-generated headers should be found in MANIFEST so using maniread
> might help here
..
Thanks, Joergen.
headers.diff
Description: Binary data
On Thursday 21 August 2003 11:23, Tanton Gibbs wrote:
> I just wanted to let the list know that with the following configure
> options
>
> --cgoto=0 --jitcapable=0 --execcapable=0
Just to let you know --jitcapable=0 implies --execcapable=0.
>
> I had 100% pass rate on all cygwin tests.
Cool.
>
>
On Wed, Aug 20, 2003 at 09:46:07PM -0500, Danny R. Faught wrote:
> Re: The Craft of Software Testing...
>
> Adam Turoff wrote:
> >It's out of print and nearly impossible to find. I haven't read it yet,
> >so I can't say whether it is as seminal as McBreen says it is.
>
> Interesting - bn.com c
I just wanted to let the list know that with the following configure options
--cgoto=0 --jitcapable=0 --execcapable=0
I had 100% pass rate on all cygwin tests. I know some people have had
trouble with cygwin in the past, so I thought I would share my success.
Another thing that helps is using pe
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> On Wed, Aug 20, 2003 at 02:05:19PM +0200, Leopold Toetsch wrote:
>> This leads to changes in parsing the vtable.tbl - which we need anyway
>> to do the proposed var/value split of vtables.
>>
>> e.g.
>> [FETCH]
>> get_integer
>> ...
>> [STORE]
>> set_int
JüRgen" "BöMmels <[EMAIL PROTECTED]> wrote:
> Hello,
> I don't want to let my scheme playground to diverge to far from CVS,
> so here is an intermediate patch.
Thanks, applied.
leo
Juergen Boemmels <[EMAIL PROTECTED]> wrote:
>
> my @headers=(
> sort
> map { m{$inc/(.*)} }
> keys %{maniread()}
> );
Done that, thanks for your suggestion.
> bye
> boe
leo
On Wednesday 20 August 2003 22:19, Michael G Schwern wrote:
> That's subtests having overall test state. Ideally don't want the subtests
> to have *any* awareness that they're being run as a subtest.
The state is held in the Test::Builder object just as currently, it's just
that that object has
On Wednesday 20 August 2003 22:14, Michael G Schwern wrote:
> 1..2
> ok 1
> 1..3
> ok 1
> ok 2
> ok 3
> 3..1
> ok 2
1 problem here is that you have not indicated anywhere how many times you will
be extending the plan so maybe there's a
1..9
ok 1
...
ok 9
missing off the end, there's no way to
Michael G Schwern wrote:
What books out there are of use for those wanting to learn Perl testing?
They don't necessarily have to be specificly about *Perl* testing.
I've put up a Wiki page to generate a listing.
http://www.pobox.com/~schwern/cgi-bin/perl-qa-wiki.cgi?TestingBooks
Where is this page
On Wed, Aug 20, 2003 at 07:19:42PM -0400, Benjamin Goldberg wrote:
> Leopold Toetsch wrote:
> > But these could be converted to utf32 as soon as they are seen.
>
> For a long string, that could be quite a bit of bloat.
Jarkko's view is that the combined hit of the size of the extra code to skip
"Vladimir Lipskiy" <[EMAIL PROTECTED]> writes:
[...]
> sub runstep {
> my $inc = 'include/parrot';
>
> my @headers=(
> sort
> map { m{\./$inc/(.*)} }
> glob "./$inc/*.h"
> );
in a non clean tree the generated files are picked up also.
> $_ = "\
On Wed, Aug 20, 2003 at 10:14:04PM +0200, Leopold Toetsch wrote:
> The main time consuming task is just constructing the exception object.
> Real objects might be faster here, but all the runtime construction of
> such complex objects suffer of the same problem: we don't have constant
> and cac
On Wed, Aug 20, 2003 at 02:05:19PM +0200, Leopold Toetsch wrote:
> This leads to changes in parsing the vtable.tbl - which we need anyway
> to do the proposed var/value split of vtables.
>
> e.g.
> [FETCH]
> get_integer
> ...
> [STORE]
> set_integer
> ...
> [PUSH]
> push_integer
> ...
> and so o
[
The listserver does not like my attachments
ezmlm-send: fatal: Sorry, after removing unacceptable MIME parts from your message I
was left with nothing (#5.7.0)
ezmlm-gate: fatal: fatal error from child
Here is the resend with code inline
]
Leopold Toetsch <[EMAIL PROTECTED]> writes:
# New Ticket Created by Jürgen Bömmels
# Please include the string: [perl #23547]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=23547 >
Hello,
I don't want to let my scheme playground to diverge to far from CVS,
so here i
Vladimir Lipskiy <[EMAIL PROTECTED]> wrote:
> $description="Determinig nongenerated header files...";
Thank you, applied.
leo
In message <[EMAIL PROTECTED]>
Peter Gibbs <[EMAIL PROTECTED]> wrote:
> I do not believe that the two existing parameters are orthogonal,
> so the number of charset (or whatever) entities would be less than
> the cross product. e.g. the existing 2 chartypes x 4 encodings
> would really onl
headers.pl
Description: Binary data
classes2.diff
Description: Binary data
If the string API is to be revised, I would like to suggest that
consideration be given to having a single string vtable, merging
the current encoding and chartype structures into a single one.
This removes one pointer from each string header, and allows
a single parameter to be used instead of tw
Bernhard Schmalhofer <[EMAIL PROTECTED]> wrote:
> There I got a error from 'parrot' claiming that he can't find the op
> 'exists_i_p_sc'.
exists I0, P0["the_key"]
is the syntax.
> I have added this case in 't/pmc/perlhash.t'. A patch is attached.
> If that op is indeed missing, I could go ahe
Stephane @ Modxml . Org <[EMAIL PROTECTED]> wrote:
> This patch implements the op (cf. set.ops) for the i386
> JIT Core. Mainly, it does a "mov reg, imm" (or "mov mem, imm"
> if the parrot register is not mapped to a processor register).
> Thanks,
> Stéphane
Merci. Applied,
leo
Vladimir Lipskiy wrote:
The current implementation of find_lex (by_name) is suboptimal. A linear
scan over the list of lexical names is performed
(s. sub.c:lexicals_get_position()).
A better way would be to provide a list of lexicals plus a name hash,
where hash values are indices into the list.
W
> Could it be that your source contains traces of your #define patches?
I've found a blunder in my patch. I'll fix it in a minute.
# New Ticket Created by Bernhard Schmalhofer
# Please include the string: [perl #23427]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=23427 >
Hi,
I'm just working on a Getopt::Long::GetOptions subroutine for Parrot m4.
Of
From: "Tom Locke" <[EMAIL PROTECTED]>
Date: Wed, 20 Aug 2003 11:58:05 -0400
I'm sure you're all good Parrot advocates in here, so... If I post some
requirements I have to support my language features, would you folks care to
talk me into targetting Parrot. Is this the right group fo
# New Ticket Created by [EMAIL PROTECTED]
# Please include the string: [perl #23501]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=23501 >
This patch implements the op (cf. set.ops) for the i386
JIT Core. Mainly, it doe
> interpreter.c:25: parrot/oplib/core_ops_cg.h: No such file or directory
> interpreter.c:26: parrot/oplib/core_ops_cgp.h: No such file or directory
> make: *** [interpreter.o] Error 1
>
> Could it be that your source contains traces of your #define patches?
I deleted all changes that I made and
Andy Bussey <[EMAIL PROTECTED]> wrote:
> It is a rather hasty attempt at a highlighter for
> KDE's Kate editor.
Thanks, applied.
leo
Vladimir Lipskiy <[EMAIL PROTECTED]> wrote:
> This patch deals with only classes/*.pmc dependies. And I have no idea
> how to search out other missing dependies.
interpreter.c:25: parrot/oplib/core_ops_cg.h: No such file or directory
interpreter.c:26: parrot/oplib/core_ops_cgp.h: No such file or d
On Wed, 20 Aug 2003, Tom Locke wrote:
> I am currently embarking on a project to create a new language. Right now
> I'm in the process of selecting the platform that's going to give me the
> best starting point.
>
> My first choice is whether to go for a VM, or a C-Python style
> implementation.
70 matches
Mail list logo
