push: rework the computation of fallbackheads to be correct The previous computation tried to be smart but ended up being wrong. This was caught by phase movement test while reworking the phase discovery logic to be faster. The previous logic was failing to catch case where the pushed set was not based on a common heads (i.e. when the discovery seemed to have "over discovered" content, outside the pushed set) In the following graph, `e` is a common head and we `hg push -r f`. We need to detect `c` as a fallback heads and we previous failed to do so:: e | d f |/ c | b | a The performance impact of the change seems minimal. On the most impacted repository at hand (mozilla-try), the slowdown seems mostly mixed in the overall noise `hg push` but seems to be in the hundred of milliseconds order of magnitude. When using rust, we seems to be a bit faster, probably because we leverage more accelaratd internals. I added a couple of performance related common for further investigation later on.

     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