procutil: make stream detection in make_line_buffered more correct and strict In make_line_buffered(), we don’t want to wrap the stream if we know that lines get flushed to the underlying raw stream already. Previously, the heuristic was too optimistic. It assumed that any stream which is not an instance of io.BufferedIOBase doesn’t need wrapping. However, there are buffered streams that aren’t instances of io.BufferedIOBase, like Mercurial’s own winstdout. The new logic is different in two ways: First, only for the check, if unwraps any combination of WriteAllWrapper and winstdout. Second, it skips wrapping the stream only if it is an instance of io.RawIOBase (or already wrapped). If it is an instance of io.BufferedIOBase, it gets wrapped. In any other case, the function raises an exception. This ensures that, if an unknown stream is passed or we add another wrapper in the future, we don’t wrap the stream if it’s already line buffered or not wrap the stream if it’s not line buffered. In fact, this was already helpful during development of this change. Without it, I possibly would have forgot that WriteAllWrapper needs to be ignored for the check, leading to unnecessary wrapping if stdout is unbuffered. The alternative would have been to always wrap unknown streams. However, I don’t think that anyone would benefit from being less strict. We can expect streams from the standard library to be subclassing either io.RawIOBase or io.BufferedIOBase, so running Mercurial in the standard way should not regress by this change. Py2exe might replace sys.stdout and sys.stderr, but that currently breaks Mercurial anyway and also these streams don’t claim to be interactive, so this function is not called for them.

     1

% removeancestorsfrom(), example 1

     2

remaining (sorted): [5, 6, 8, 9]

     3

% removeancestorsfrom(), example 2

     4

remaining (sorted): [11, 12, 13, 14]

     5

% removeancestorsfrom(), example 3

     6

remaining (sorted): [3, 5]

     7

% missingancestors(), example 1

     8

return [3, 7, 11]

     9

% missingancestors(), example 2

    10

return [5, 10]

    11

% missingancestors(), example 3

    12

return [3, 6, 9, 11]

    13

% removeancestorsfrom(), bigger graph

    14

Ok

    15

% lazy ancestor set for [], stoprev = 0, inclusive = False

    16

membership: []

    17

iteration:  []

    18

% lazy ancestor set for [11, 13], stoprev = 0, inclusive = False

    19

membership: [7, 8, 3, 4, 1, 0]

    20

iteration:  [8, 7, 4, 3, 2, 1, 0]

    21

% lazy ancestor set for [1, 3], stoprev = 0, inclusive = False

    22

membership: [1, 0]

    23

iteration:  [1, 0]

    24

% lazy ancestor set for [11, 13], stoprev = 0, inclusive = True

    25

membership: [11, 13, 7, 8, 3, 4, 1, 0]

    26

iteration:  [13, 11, 8, 7, 4, 3, 2, 1, 0]

    27

% lazy ancestor set for [11, 13], stoprev = 6, inclusive = False

    28

membership: [7, 8]

    29

iteration:  [8, 7]

    30

% lazy ancestor set for [11, 13], stoprev = 6, inclusive = True

    31

membership: [11, 13, 7, 8]

    32

iteration:  [13, 11, 8, 7]

    33

% lazy ancestor set for [11, 13], stoprev = 11, inclusive = True

    34

membership: [11, 13]

    35

iteration:  [13, 11]

    36

% lazy ancestor set for [11, 13], stoprev = 12, inclusive = True

    37

membership: [13]

    38

iteration:  [13]

    39

% lazy ancestor set for [10, 1], stoprev = 0, inclusive = True

    40

membership: [2, 10, 4, 5, 0, 1]

    41

iteration:  [10, 5, 4, 2, 1, 0]