mercurial/cffi/bdiffbuild.py

match: add visitchildrenset complement to visitdir

`visitdir(d)` lets a caller query whether the directory is part of the matcher.
It can receive a response of 'all' (yes, and all children, you can stop calling
visitdir now), False (no, and no children either), or True (yes, either
something in this directory or a child is part of the matcher).

`visitchildrenset(d)` augments that by instead of returning True, it returns a
list of items to actually investigate.  With this, code can be modified from:

    for f in self.all_items:
        if match.visitdir(self.dir + '/' + f):
            <do stuff>

to be:

    for f in self.all_items.intersect(match.visitchildrenset(self.dir)):
        <do stuff>

use of this function can provide significant performance improvements,
especially when using narrow (so that the matcher is much smaller than the stuff
we see on disk) and/or treemanifests (so that we can avoid loading manifests for
trees that aren't part of the matcher).

Differential Revision: https://phab.mercurial-scm.org/D4130

from __future__ import absolute_import

import cffi
import os

ffi = cffi.FFI()
with open(os.path.join(os.path.join(os.path.dirname(__file__), '..'),
                       'bdiff.c')) as f:
    ffi.set_source("mercurial.cffi._bdiff",
                   f.read(), include_dirs=['mercurial'])
ffi.cdef("""
struct bdiff_line {
    int hash, n, e;
    ssize_t len;
    const char *l;
};

struct bdiff_hunk;
struct bdiff_hunk {
    int a1, a2, b1, b2;
    struct bdiff_hunk *next;
};

int bdiff_splitlines(const char *a, ssize_t len, struct bdiff_line **lr);
int bdiff_diff(struct bdiff_line *a, int an, struct bdiff_line *b, int bn,
    struct bdiff_hunk *base);
void bdiff_freehunks(struct bdiff_hunk *l);
void free(void*);
""")

if __name__ == '__main__':
    ffi.compile()