bdiff: don't check border condition in loop This is pretty much a copy of d500ddae7494, just to a different loop. The condition `p == plast` (`plast == a + len - 1`) was only true on the final iteration of the loop. So it was wasteful to check for it on every iteration. We decrease the iteration count by 1 and add an explicit check for `p == plast` after the loop. Again, we see modest wins. From the mozilla-unified repository: $ perfbdiff -m 3041e4d59df2 ! wall 0.035502 comb 0.040000 user 0.040000 sys 0.000000 (best of 100) ! wall 0.030480 comb 0.030000 user 0.030000 sys 0.000000 (best of 100) $ perfbdiff 0e9928989e9c --alldata --count 100 ! wall 4.097394 comb 4.100000 user 4.100000 sys 0.000000 (best of 3) ! wall 3.597798 comb 3.600000 user 3.600000 sys 0.000000 (best of 3) The 2nd example throws a total of ~3.3GB of data at bdiff. This change increases the throughput from ~811 MB/s to ~924 MB/s.

     1

#!/usr/bin/env python

     2

#

     3

# A portable replacement for 'seq'

     4

#

     5

# Usage:

     6

#   seq STOP              [1, STOP] stepping by 1

     7

#   seq START STOP        [START, STOP] stepping by 1

     8

#   seq START STEP STOP   [START, STOP] stepping by STEP

     9

    10

from __future__ import absolute_import, print_function

    11

import sys

    12

    13

start = 1

    14

if len(sys.argv) > 2:

    15

    start = int(sys.argv[1])

    16

    17

step = 1

    18

if len(sys.argv) > 3:

    19

    step = int(sys.argv[2])

    20

    21

stop = int(sys.argv[-1]) + 1

    22

    23

for i in xrange(start, stop, step):

    24

    print(i)