On 2/25/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
>
> Leopold Toetsch (via RT) wrote:
>
> > fill the function body of Parrot_register_move() (src/utils.c 633 ff).
>
> Parrot is now using this function [1] for recursive tailcalls. There are
> 2 new tests in t/compilers/imcc/imcpasm/optc.t.
>
>
On Tuesday 28 February 2006 14:19, Will Coleda wrote:
> Running "make test" in languages/tcl should be pretty painful.
Some tests will fail (STDERR is different), but you can set $ENV{VALGRIND} and
anything that uses Parrot::Test will run it. Nifty.
-- c
Running "make test" in languages/tcl should be pretty painful.
On Feb 28, 2006, at 5:13 PM, chromatic wrote:
Hi there,
I just managed to get Valgrind working on my Linux PPC box. Are
Valgrind
(memcheck, cachegrind, etc) reports useful from various platforms?
If so, is
there a good exampl
Hi there,
I just managed to get Valgrind working on my Linux PPC box. Are Valgrind
(memcheck, cachegrind, etc) reports useful from various platforms? If so, is
there a good example PIR file to run that stresses sufficient code (or should
someone add a new testgrind target that collects these
On Tue, Feb 28, 2006 at 03:37:23PM +0100, Leopold Toetsch wrote:
>
> On Feb 28, 2006, at 14:59, Tim Bunce wrote:
>
> >FYI I saw this once but haven't been able to repeat it:
> >
> >t/dynoplibs/myopsok 6/7
>
> This can happen if the machine is busy.
Okay. Can't the test be ma
The main flag sets for speed are -C, -Cj, -S, -Sj, -j, and sometimes
adding -Oc as well. On ppc, -C and -Cj are often the fastest. On x86,
-j is most often the fastest. But here's the cavaet, to use JIT, you
of course need someone to port it to that arch. With -C, your compiler
has to suppo
On Tue, February 28, 2006 12:35 am, Steffen Mueller wrote:
> The upside is that it might be using less bandwidth in the long run.
For us bandwidth is not at all an issue.
> You might want to look at
> http://search.cpan.org/~rjbs/CPAN-Mini-0.40/lib/CPAN/Mini.pm and
> possibly
> http://search.cpa
Doug McNutt wrote:
> Jonathan Lang wrote:
> >Technically, the result set is one element (the principle value),
> >since a mathematical function - by definition - produces a single
> >result for any given input.
>
> Please be careful of "definitions" like that. Computer science has quite
> differen
>
> On Feb 28, 2006, at 12:09, Nicolas Cannasse wrote:
>
>> Yesterday I did a quick fib(30) benchmark comparing Parrot Win32 daily
>> build (using jit core) and NekoVM (http://nekovm.org). The results are
>> showing that Parrot is 5 times slower than Neko (see my blog post on
>> this point there
On Mon, February 27, 2006 8:14 pm, Dr Bean wrote:
> There is some interesting advice in the subversion book.
>
>Linkname: Vendor branches
> URL:
>
> http://svnbook.red-bean.com/nightly/en/svn.advanced.vendorbr.html#svn.advanced.vendorbr.general
I've read this section and i
"Nicolas Cannasse" <[EMAIL PROTECTED]> wrote:
Yesterday I did a quick fib(30) benchmark comparing Parrot Win32 daily
build (using jit core)
I'm guessing that's the build that I'm to blame for, and it's maybe worth
pointing out that it ain't an optimized build. But I think leo supplied the
re
> On Fri, Feb 17, 2006 Andy Dougherty wrote:
[svn co on Solaris 8 is painfully *slow*]
> $ time wget http://cvs.perl.org/snapshots/parrot/parrot-latest.tar.gz
>
> real0m16.84s
> user0m0.09s
> sys 0m0.20s
>
> $ time svn co http://svn.perl.org/parrot/trunk parrot-trunk
>
> real 2:0
At 09:33 -0800 2/28/06, Jonathan Lang wrote:
>Technically, the result set is one element (the principle value),
>since a mathematical function - by definition - produces a single
>result for any given input.
Please be careful of "definitions" like that. Computer science has quite
different ideas
On Monday 27 February 2006 14:35, Beau E. Cox wrote:
> On Sunday 26 February 2006 20:48, Beau E. Cox wrote:
> > Hi -
> >
> > My Sunday svn download / make of parrot and pugs
> > failed today; parrot revision 11753 built fine, but
> > pugs revision 9188 failed in make smoke and
> > make install:
> >
Mark A. Biggar wrote:
> For the complex trig functions the result set is infinite with no
> obvious order to return the list in even lazily that provides anything
> useful.
Technically, the result set is one element (the principle value),
since a mathematical function - by definition - produces a
Author: autrijus
Date: Tue Feb 28 07:22:23 2006
New Revision: 7898
Modified:
doc/trunk/design/syn/S05.pod
Log:
* S05: Generalizing +$/ and ~$/ delegating to $(), by stipulating
that all explicit coercion forms, except for boolean, dispatch
from Match to its result object.
Modified: doc/tr
On Tue, Feb 14, 2006 at 10:04:59PM +0100, Leopold Toetsch wrote:
> On Feb 14, 2006, at 18:29, Tim Bunce wrote:
>
> >The runtime dlfunc code will need to be altered to normalize away the
> >trailing v so old code won't break. Should it warn about that?
>
> Yes, a warning please.
Here's the patch.
David Green wrote:
On 2/23/06, Jonathan Lang wrote:
(Another possibility would be to return a list of every possible
result when in list context, with the result that you'd get in scalar
context being element zero of the list. This even has its uses wrt
sqrt(Num), providing a two-element lis
On Feb 28, 2006, at 14:59, Tim Bunce wrote:
FYI I saw this once but haven't been able to repeat it:
t/dynoplibs/myopsok 6/7
This can happen if the machine is busy.
leo
I have released "Amber for Parrot" version 0.4.2 (Argument):
Downloads: http://xamber.org/download.html
Release history: http://xamber.org/history.html
Project home page: http://xamber.org/index.html
"Amber for Parrot" is an Eiffel-like scripting language for the Parrot
Virtual Machine.
Changes
On Feb 28, 2006, at 12:09, Nicolas Cannasse wrote:
Yesterday I did a quick fib(30) benchmark comparing Parrot Win32 daily
build (using jit core) and NekoVM (http://nekovm.org). The results are
showing that Parrot is 5 times slower than Neko (see my blog post on
this point there : http://ncann
FYI I saw this once but haven't been able to repeat it:
t/dynoplibs/myopsok 6/7
# Failed test (t/dynoplibs/myops.t at line 107)
# got: '1
# alarm1
# 2
# alarm2
# 3
# alarm3
# alarm1
# alarm3
# alarm3
# 4
# alarm3
# alarm3
# 5
# don
Matisse Enzer wrote:
>
> On Feb 27, 2006, at 6:59 PM, Tyler MacDonald wrote:
>
>> #3 seems like the lowest maintenence. Maintaining on a .tar.gz in CVS
>> seems easier than integrating diffs of the newest version whenever
>> you want
>> to upgrade.
>>
>
> We definitely do NOT want to be i
Hi list,
Yesterday I did a quick fib(30) benchmark comparing Parrot Win32 daily
build (using jit core) and NekoVM (http://nekovm.org). The results are
showing that Parrot is 5 times slower than Neko (see my blog post on
this point there : http://ncannasse.free.fr/?p=66).
I would like to unde
On 2/23/06, Jonathan Lang wrote:
(Another possibility would be to return a list of every possible
result when in list context, with the result that you'd get in scalar
context being element zero of the list. This even has its uses wrt
sqrt(Num), providing a two-element list of the positive an
On Sun, 26 Feb 2006 at 07:31 -0800, Bernhard Schmalhofer via RT...:
From: Bernhard Schmalhofer via RT <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
Date: Sun, 26 Feb 2006 07:31:10 -0800
Subject: [perl #37906] socklen_t not defined
Hi David,
why does parrot expect socklen_t to be defined?
Since
Matisse Enzer wrote:
#2 has it's benefits too - you could even mirror all of CPAN, and
just maintain a script with "install" commands to install the
versions you
want;
install "KWILLIAMS/Module-Build-0.27_04.tar.gz";
etc. That makes both upgrading easy and makes your build proces
27 matches
Mail list logo
