bisect: avoid copying ancestor list for non-merge commits During a bisection, hg needs to compute a list of all ancestors for every candidate commit. This is accomplished via a bottom-up traversal of the set of candidates, during which each revision's ancestor list is populated using the ancestor list of its parent(s). Previously, this involved copying the entire list, which could be very long in if the bisection range was large. To help improve this, we can observe that each candidate commit is visited exactly once, at which point its ancestor list is copied into its children's lists and then dropped. In the case of non-merge commits, a commit's ancestor list consists exactly of its parent's list plus itself. This means that we can trivially reuse the parent's existing list for one of its non-merge children, which avoids copying entirely if that commit is the parent's only child. This makes bisections over linear ranges of commits much faster. During some informal testing in the large publicly-available `mozilla-central` repository, this noticeably sped up bisections over large ranges of history: Setup: $ cd mozilla-central $ hg bisect --reset $ hg bisect --good 0 $ hg log -r tip -T '{rev}\n' 628417 Test: $ time hg bisect --bad tip --noupdate Before: real 3m35.927s user 3m35.553s sys 0m0.319s After: real 1m41.142s user 1m40.810s sys 0m0.285s

     1

#ifndef HG_BDIFF_H

     2

#define HG_BDIFF_H

     3

     4

#include "compat.h"

     5

     6

struct bdiff_line {

     7

	int hash, n, e;

     8

	ssize_t len;

     9

	const char *l;

    10

};

    11

    12

struct bdiff_hunk;

    13

struct bdiff_hunk {

    14

	int a1, a2, b1, b2;

    15

	struct bdiff_hunk *next;

    16

};

    17

    18

int bdiff_splitlines(const char *a, ssize_t len, struct bdiff_line **lr);

    19

int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b, int bn,

    20

               struct bdiff_hunk *base);

    21

void bdiff_freehunks(struct bdiff_hunk *l);

    22

    23

#endif