comparison mercurial/copies.py @ 23980:c1ce5442453f stable

_adjustlinkrev: reuse ancestors set during rename detection (issue4514)

The new linkrev adjustement mechanism makes rename detection very slow, because
each file rewalks the ancestor dag. To mitigate the issue in Mercurial 3.3, we
introduce a simplistic way to share the ancestors computation for the linkrev
validation phase.

We can reuse the ancestors in that case because we do not care about
sub-branching in the ancestors graph.

The cached set will be use to check if the linkrev is valid in the search
context. This is the vast majority of the ancestors usage during copies search
since the uncached one will only be used when linkrev is invalid, which is
hopefully rare.

23979:087603b50889

    # this means we can miss a case like 'hg rm b; hg cp a b'
    cm = {}
    missing = set(b.manifest().iterkeys())
    missing.difference_update(a.manifest().iterkeys())

    for f in missing:
        ofctx = _tracefile(b[f], am, limit)
        if ofctx:
            cm[f] = ofctx.path()

    # combine copies from dirstate if necessary
    if w is not None:

23980:c1ce5442453f

    # this means we can miss a case like 'hg rm b; hg cp a b'
    cm = {}
    missing = set(b.manifest().iterkeys())
    missing.difference_update(a.manifest().iterkeys())

    ancestrycontext = a._repo.changelog.ancestors([b.rev()], inclusive=True)
    for f in missing:
        fctx = b[f]
        fctx._ancestrycontext = ancestrycontext
        ofctx = _tracefile(fctx, am, limit)
        if ofctx:
            cm[f] = ofctx.path()

    # combine copies from dirstate if necessary
    if w is not None: