Seems the issue has more to do with running an empty loop, rather than
performing a real computation.
This is a run on a 4-core box. Attempting to parallelize an empty loop makes
the execution 1 second slower:
my = { for ^2_000_000 { } };
my $start = now; (^4).map: my $stop = now;
# New Ticket Created by Zoffix Znet
# Please include the string: [perl #129790]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/Ticket/Display.html?id=129790 >
Attempting to give a map some invalid arg or a sub gives an error:
On my machine it's about 0.1 seconds.
The machine i'm using has this CPU in it:
Intel(R) Core(TM) i7-4600U CPU @ 2.10GHz
And it runs off an SSD.
- Timo
On Sun, Oct 02, 2016 at 11:00:38AM +0200, Thor Michael Støre wrote:
> Thormicks-MacBook-Pro-3:~ thormick$ time perl6 -e "say 'foo'"
> foo
>
> real 0m0.205s
> user 0m0.150s
> sys 0m0.045s
>
> [...]
>
> Foo indeed! ~200ms for this seems awfully slow to me.
On another hand, my machine shows:
Hey everyone!
Is this normal startup performance?
Thormicks-MacBook-Pro-3:~ thormick$ time perl6 -e "say 'foo'"
foo
real0m0.444s
user0m0.166s
sys 0m0.067s
Thormicks-MacBook-Pro-3:~ thormick$ time perl6 -e "say 'foo'"
foo
real0m0.202s
user0m0.148s
sys 0m0.044s
# New Ticket Created by Wenzel Peppmeyer
# Please include the string: [perl #129787]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/Ticket/Display.html?id=129787 >
sub f(){
my $c = Channel.new;
start {
for 1..* {
Sorry, I was running the profile on a 4-weeks-old rakudo. After the
optimizations i did to canonpath ~22 days ago the canonpath inclusive
time went down to about 18% ...
FILETEST-D and FILETEST-F are in spots 3 and 4, but they only take 3594
/ 26881 msec and 2749 / 216298 msec per invocation, so
Here's the results from a --profile-compile:
1. match (gen/moar/m-CORE.setting:12064), 12750 entries, 25.66%
inclusive time, 8.15% exclusive time
2. (gen/moar/m-BOOTSTRAP.nqp:2081), 111530 entries, 4.59%
inclusive time, 4.36% exclusive time
3. (gen/moar/m-CORE.setting:40776), 13148 entries,
On 02/10/16 04:41, Lloyd Fournier wrote:
> String concat takes On2 in rakudo I think. Using join in this kind of
> situation should be an improvement. (I'm commuting so can't test).
MoarVM implements "ropes" which make the performance a whole lot better.
join can still be a small improvement, but
For the records: This works with '--optimize=off' (as psch++ has shown in the
linked discussion on #perl6).
$ ./perl6-j --optimize=off -e 'my $value = 42 but False; say ?$value'
False
The optimizer adds a QAST::Want for the mixin which the JVM backend does not
handle correctly.
$
Here are my preliminary findings about this problem.
I used the following evaluation for my debugging:
$ ./perl6-j -e 'say (so 1).perl'
1
The optimizer generates a QAST::Want with two children
(output generated with RAKUDO_OPTIMIZER_DEBUG=1):
[...]
- QAST::Op(callstatic ) :statement_id say (so
Great advice. "How to find the answer" is always more useful than "The answer".
On 10/1/16, Moritz Lenz wrote:
> Hi,
>
> On 01.10.2016 04:22, Francis (Grizzly) Smit wrote:
>> I keep finding stuff like this:
>>
>> multi method spurt(IO::Path:D: Blob $contents, :$bin, |c)
>>
# New Ticket Created by Itsuki Toyota
# Please include the string: [perl #129785]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/Ticket/Display.html?id=129785 >
See the following results:
$ gcc ulonglong.c
$ ./a.out
unsigned long long max:
# New Ticket Created by Itsuki Toyota
# Please include the string: [perl #129784]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/Ticket/Display.html?id=129784 >
See the following codes and results. ( Sorry, it's little bit long. )
* codes *
14 matches
Mail list logo