in reply to Re^2: Benchmarking for loops?
in thread Benchmarking for loops?

Here's a diff. This is a vanilla 5.8.3 on Linux PPC.

--- postfix 2004-07-12 22:45:53.000000000 -0700 +++ block 2004-07-12 22:45:44.000000000 -0700 @@ -3,23 +3,23 @@ 2 <;> nextstate(main 1 -e:1) v ->3 5 <2> sassign vKS/2 ->6 3 <$> const(IV 0) s ->4 -4 <0> padsv[$total:1,2] sRM*/LVINTRO ->5 -6 <;> nextstate(main 2 -e:1) v ->7 -7 <;> nextstate(main 2 -e:1) v ->8 +4 <0> padsv[$total:1,4] sRM*/LVINTRO ->5 +6 <;> nextstate(main 3 -e:1) v ->7 j <2> leaveloop vK/2 ->k -c <{> enteriter(next->g last->j redo->d) lKS ->h -- <0> ex-pushmark s ->8 -- <1> ex-list lK ->b -8 <0> pushmark s ->9 -9 <$> const(IV 1) s ->a -a <$> const(NV 1000000) s ->b -b <$> gv(*_) s ->c +b <{> enteriter(next->g last->j redo->c) lKS ->h +- <0> ex-pushmark s ->7 +- <1> ex-list lK ->a +7 <0> pushmark s ->8 +8 <$> const(IV 1) s ->9 +9 <$> const(NV 1000000) s ->a +a <$> gv(*_) s ->b - <1> null vK/1 ->j -i <|> and(other->d) vK/1 ->j +i <|> and(other->c) vK/1 ->j h <0> iter s ->i - <@> lineseq vK ->- -f <2> add[t2] vKS/2 ->g -d <0> padsv[$total:1,2] sRM ->e +c <;> nextstate(main 2 -e:1) v ->d +f <2> add[t4] vKS/2 ->g +d <0> padsv[$total:1,4] sRM ->e - <1> ex-rv2sv sK/1 ->f e <$> gvsv(*_) s ->f g <0> unstack v ->h

Replies are listed 'Best First'.
Re^4: Benchmarking for loops?
by ysth (Canon) on Jul 13, 2004 at 06:18 UTC
    Thanks, somehow I missed that first nextstate. It's still there in bleadperl, and seems totally unnecessary to me.