match.py
1021 lines
| 34.1 KiB
| text/x-python
|
PythonLexer
/ mercurial / match.py
|
r8761 | # match.py - filename matching | ||
|
r8231 | # | ||
# Copyright 2008, 2009 Matt Mackall <mpm@selenic.com> and others | ||||
# | ||||
# This software may be used and distributed according to the terms of the | ||||
|
r10263 | # GNU General Public License version 2 or any later version. | ||
|
r8231 | |||
|
r25958 | from __future__ import absolute_import | ||
import copy | ||||
import os | ||||
import re | ||||
from .i18n import _ | ||||
from . import ( | ||||
|
r26587 | error, | ||
|
r25958 | pathutil, | ||
util, | ||||
) | ||||
|
r6576 | |||
|
r24636 | propertycache = util.propertycache | ||
|
r21111 | def _rematcher(regex): | ||
'''compile the regexp with the best available regexp engine and return a | ||||
matcher function''' | ||||
|
r21909 | m = util.re.compile(regex) | ||
|
r16943 | try: | ||
# slightly faster, provided by facebook's re2 bindings | ||||
return m.test_match | ||||
except AttributeError: | ||||
return m.match | ||||
|
r25122 | def _expandsets(kindpats, ctx, listsubrepos): | ||
|
r21111 | '''Returns the kindpats list with the 'set' patterns expanded.''' | ||
|
r14675 | fset = set() | ||
other = [] | ||||
|
r25213 | for kind, pat, source in kindpats: | ||
|
r14675 | if kind == 'set': | ||
if not ctx: | ||||
|
r32444 | raise error.ProgrammingError("fileset expression with no " | ||
"context") | ||||
|
r21111 | s = ctx.getfileset(pat) | ||
|
r14675 | fset.update(s) | ||
|
r25122 | |||
if listsubrepos: | ||||
for subpath in ctx.substate: | ||||
s = ctx.sub(subpath).getfileset(pat) | ||||
fset.update(subpath + '/' + f for f in s) | ||||
|
r14675 | continue | ||
|
r25213 | other.append((kind, pat, source)) | ||
|
r14675 | return fset, other | ||
|
r25283 | def _expandsubinclude(kindpats, root): | ||
|
r32132 | '''Returns the list of subinclude matcher args and the kindpats without the | ||
|
r25283 | subincludes in it.''' | ||
relmatchers = [] | ||||
other = [] | ||||
for kind, pat, source in kindpats: | ||||
if kind == 'subinclude': | ||||
|
r25301 | sourceroot = pathutil.dirname(util.normpath(source)) | ||
|
r25283 | pat = util.pconvert(pat) | ||
path = pathutil.join(sourceroot, pat) | ||||
newroot = pathutil.dirname(path) | ||||
|
r32132 | matcherargs = (newroot, '', [], ['include:%s' % path]) | ||
|
r25283 | |||
prefix = pathutil.canonpath(root, root, newroot) | ||||
if prefix: | ||||
prefix += '/' | ||||
|
r32132 | relmatchers.append((prefix, matcherargs)) | ||
|
r25283 | else: | ||
other.append((kind, pat, source)) | ||||
return relmatchers, other | ||||
|
r24447 | def _kindpatsalwaysmatch(kindpats): | ||
""""Checks whether the kindspats match everything, as e.g. | ||||
'relpath:.' does. | ||||
""" | ||||
|
r25213 | for kind, pat, source in kindpats: | ||
|
r24447 | if pat != '' or kind not in ['relpath', 'glob']: | ||
return False | ||||
return True | ||||
|
r32728 | def match(root, cwd, patterns=None, include=None, exclude=None, default='glob', | ||
|
r32394 | exact=False, auditor=None, ctx=None, listsubrepos=False, warn=None, | ||
|
r32400 | badfn=None, icasefs=False): | ||
|
r32394 | """build an object to match a set of file patterns | ||
arguments: | ||||
root - the canonical root of the tree you're matching against | ||||
cwd - the current working directory, if relevant | ||||
patterns - patterns to find | ||||
include - patterns to include (unless they are excluded) | ||||
exclude - patterns to exclude (even if they are included) | ||||
default - if a pattern in patterns has no explicit type, assume this one | ||||
exact - patterns are actually filenames (include/exclude still apply) | ||||
warn - optional function used for printing warnings | ||||
badfn - optional bad() callback for this matcher instead of the default | ||||
|
r32400 | icasefs - make a matcher for wdir on case insensitive filesystems, which | ||
normalizes the given patterns to the case in the filesystem | ||||
|
r32394 | |||
a pattern is one of: | ||||
'glob:<glob>' - a glob relative to cwd | ||||
're:<regexp>' - a regular expression | ||||
'path:<path>' - a path relative to repository root, which is matched | ||||
recursively | ||||
'rootfilesin:<path>' - a path relative to repository root, which is | ||||
matched non-recursively (will not match subdirectories) | ||||
'relglob:<glob>' - an unrooted glob (*.c matches C files in all dirs) | ||||
'relpath:<path>' - a path relative to cwd | ||||
'relre:<regexp>' - a regexp that needn't match the start of a name | ||||
'set:<fileset>' - a fileset expression | ||||
'include:<path>' - a file of patterns to read and include | ||||
'subinclude:<path>' - a file of patterns to match against files under | ||||
the same directory | ||||
'<something>' - a pattern of the specified default type | ||||
""" | ||||
|
r32400 | normalize = _donormalize | ||
if icasefs: | ||||
|
r32415 | if exact: | ||
|
r32444 | raise error.ProgrammingError("a case-insensitive exact matcher " | ||
"doesn't make sense") | ||||
|
r32400 | dirstate = ctx.repo().dirstate | ||
dsnormalize = dirstate.normalize | ||||
def normalize(patterns, default, root, cwd, auditor, warn): | ||||
kp = _donormalize(patterns, default, root, cwd, auditor, warn) | ||||
kindpats = [] | ||||
for kind, pats, source in kp: | ||||
if kind not in ('re', 'relre'): # regex can't be normalized | ||||
p = pats | ||||
pats = dsnormalize(pats) | ||||
# Preserve the original to handle a case only rename. | ||||
if p != pats and p in dirstate: | ||||
kindpats.append((kind, p, source)) | ||||
kindpats.append((kind, pats, source)) | ||||
return kindpats | ||||
|
r32499 | if exact: | ||
m = exactmatcher(root, cwd, patterns, badfn) | ||||
|
r32553 | elif patterns: | ||
|
r32556 | kindpats = normalize(patterns, default, root, cwd, auditor, warn) | ||
|
r32557 | if _kindpatsalwaysmatch(kindpats): | ||
m = alwaysmatcher(root, cwd, badfn, relativeuipath=True) | ||||
else: | ||||
m = patternmatcher(root, cwd, kindpats, ctx=ctx, | ||||
listsubrepos=listsubrepos, badfn=badfn) | ||||
|
r32553 | else: | ||
# It's a little strange that no patterns means to match everything. | ||||
|
r32650 | # Consider changing this to match nothing (probably using nevermatcher). | ||
|
r32553 | m = alwaysmatcher(root, cwd, badfn) | ||
|
r32497 | if include: | ||
|
r32556 | kindpats = normalize(include, 'glob', root, cwd, auditor, warn) | ||
im = includematcher(root, cwd, kindpats, ctx=ctx, | ||||
listsubrepos=listsubrepos, badfn=None) | ||||
|
r32497 | m = intersectmatchers(m, im) | ||
|
r32465 | if exclude: | ||
|
r32556 | kindpats = normalize(exclude, 'glob', root, cwd, auditor, warn) | ||
em = includematcher(root, cwd, kindpats, ctx=ctx, | ||||
listsubrepos=listsubrepos, badfn=None) | ||||
|
r32465 | m = differencematcher(m, em) | ||
return m | ||||
|
r32394 | |||
def exact(root, cwd, files, badfn=None): | ||||
|
r32499 | return exactmatcher(root, cwd, files, badfn=badfn) | ||
|
r32394 | |||
def always(root, cwd): | ||||
|
r32553 | return alwaysmatcher(root, cwd) | ||
|
r32394 | |||
|
r32600 | def never(root, cwd): | ||
return nevermatcher(root, cwd) | ||||
|
r32394 | def badmatch(match, badfn): | ||
"""Make a copy of the given matcher, replacing its bad method with the given | ||||
one. | ||||
""" | ||||
m = copy.copy(match) | ||||
m.bad = badfn | ||||
return m | ||||
|
r32396 | def _donormalize(patterns, default, root, cwd, auditor, warn): | ||
'''Convert 'kind:pat' from the patterns list to tuples with kind and | ||||
normalized and rooted patterns and with listfiles expanded.''' | ||||
kindpats = [] | ||||
for kind, pat in [_patsplit(p, default) for p in patterns]: | ||||
if kind in ('glob', 'relpath'): | ||||
pat = pathutil.canonpath(root, cwd, pat, auditor) | ||||
elif kind in ('relglob', 'path', 'rootfilesin'): | ||||
pat = util.normpath(pat) | ||||
elif kind in ('listfile', 'listfile0'): | ||||
try: | ||||
files = util.readfile(pat) | ||||
if kind == 'listfile0': | ||||
files = files.split('\0') | ||||
else: | ||||
files = files.splitlines() | ||||
files = [f for f in files if f] | ||||
except EnvironmentError: | ||||
raise error.Abort(_("unable to read file list (%s)") % pat) | ||||
for k, p, source in _donormalize(files, default, root, cwd, | ||||
auditor, warn): | ||||
kindpats.append((k, p, pat)) | ||||
continue | ||||
elif kind == 'include': | ||||
try: | ||||
fullpath = os.path.join(root, util.localpath(pat)) | ||||
includepats = readpatternfile(fullpath, warn) | ||||
for k, p, source in _donormalize(includepats, default, | ||||
root, cwd, auditor, warn): | ||||
kindpats.append((k, p, source or pat)) | ||||
except error.Abort as inst: | ||||
raise error.Abort('%s: %s' % (pat, inst[0])) | ||||
except IOError as inst: | ||||
if warn: | ||||
warn(_("skipping unreadable pattern file '%s': %s\n") % | ||||
(pat, inst.strerror)) | ||||
continue | ||||
# else: re or relre - which cannot be normalized | ||||
kindpats.append((kind, pat, '')) | ||||
return kindpats | ||||
|
r32454 | class basematcher(object): | ||
|
r32496 | def __init__(self, root, cwd, badfn=None, relativeuipath=True): | ||
|
r32454 | self._root = root | ||
self._cwd = cwd | ||||
if badfn is not None: | ||||
self.bad = badfn | ||||
|
r32496 | self._relativeuipath = relativeuipath | ||
|
r32454 | |||
def __call__(self, fn): | ||||
return self.matchfn(fn) | ||||
def __iter__(self): | ||||
for f in self._files: | ||||
yield f | ||||
# Callbacks related to how the matcher is used by dirstate.walk. | ||||
# Subscribers to these events must monkeypatch the matcher object. | ||||
def bad(self, f, msg): | ||||
'''Callback from dirstate.walk for each explicit file that can't be | ||||
found/accessed, with an error message.''' | ||||
pass | ||||
# If an explicitdir is set, it will be called when an explicitly listed | ||||
# directory is visited. | ||||
explicitdir = None | ||||
# If an traversedir is set, it will be called when a directory discovered | ||||
# by recursive traversal is visited. | ||||
traversedir = None | ||||
def abs(self, f): | ||||
'''Convert a repo path back to path that is relative to the root of the | ||||
matcher.''' | ||||
return f | ||||
def rel(self, f): | ||||
'''Convert repo path back to path that is relative to cwd of matcher.''' | ||||
return util.pathto(self._root, self._cwd, f) | ||||
def uipath(self, f): | ||||
'''Convert repo path to a display path. If patterns or -I/-X were used | ||||
to create this matcher, the display path will be relative to cwd. | ||||
Otherwise it is relative to the root of the repo.''' | ||||
|
r32496 | return (self._relativeuipath and self.rel(f)) or self.abs(f) | ||
|
r32454 | |||
|
r32455 | @propertycache | ||
def _files(self): | ||||
return [] | ||||
|
r32454 | def files(self): | ||
'''Explicitly listed files or patterns or roots: | ||||
if no patterns or .always(): empty list, | ||||
if exact: list exact files, | ||||
if not .anypats(): list all files and dirs, | ||||
else: optimal roots''' | ||||
return self._files | ||||
@propertycache | ||||
def _fileset(self): | ||||
return set(self._files) | ||||
def exact(self, f): | ||||
'''Returns True if f is in .files().''' | ||||
return f in self._fileset | ||||
|
r32463 | def matchfn(self, f): | ||
return False | ||||
|
r32454 | def visitdir(self, dir): | ||
'''Decides whether a directory should be visited based on whether it | ||||
has potential matches in it or one of its subdirectories. This is | ||||
based on the match's primary, included, and excluded patterns. | ||||
Returns the string 'all' if the given directory and all subdirectories | ||||
should be visited. Otherwise returns True or False indicating whether | ||||
the given directory should be visited. | ||||
This function's behavior is undefined if it has returned False for | ||||
one of the dir's parent directories. | ||||
''' | ||||
|
r33478 | return True | ||
|
r32454 | |||
def always(self): | ||||
|
r33379 | '''Matcher will match everything and .files() will be empty -- | ||
optimization might be possible.''' | ||||
|
r32454 | return False | ||
def isexact(self): | ||||
|
r33379 | '''Matcher will match exactly the list of files in .files() -- | ||
optimization might be possible.''' | ||||
|
r32454 | return False | ||
def prefix(self): | ||||
|
r33379 | '''Matcher will match the paths in .files() recursively -- | ||
optimization might be possible.''' | ||||
return False | ||||
def anypats(self): | ||||
'''None of .always(), .isexact(), and .prefix() is true -- | ||||
optimizations will be difficult.''' | ||||
return not self.always() and not self.isexact() and not self.prefix() | ||||
|
r32454 | |||
|
r32553 | class alwaysmatcher(basematcher): | ||
'''Matches everything.''' | ||||
|
r32557 | def __init__(self, root, cwd, badfn=None, relativeuipath=False): | ||
|
r32553 | super(alwaysmatcher, self).__init__(root, cwd, badfn, | ||
|
r32557 | relativeuipath=relativeuipath) | ||
|
r32553 | |||
def always(self): | ||||
return True | ||||
def matchfn(self, f): | ||||
return True | ||||
def visitdir(self, dir): | ||||
return 'all' | ||||
def __repr__(self): | ||||
return '<alwaysmatcher>' | ||||
|
r32600 | class nevermatcher(basematcher): | ||
'''Matches nothing.''' | ||||
|
r32650 | def __init__(self, root, cwd, badfn=None): | ||
super(nevermatcher, self).__init__(root, cwd, badfn) | ||||
|
r32600 | |||
|
r33378 | # It's a little weird to say that the nevermatcher is an exact matcher | ||
# or a prefix matcher, but it seems to make sense to let callers take | ||||
# fast paths based on either. There will be no exact matches, nor any | ||||
# prefixes (files() returns []), so fast paths iterating over them should | ||||
# be efficient (and correct). | ||||
def isexact(self): | ||||
return True | ||||
def prefix(self): | ||||
return True | ||||
|
r32600 | def __repr__(self): | ||
return '<nevermatcher>' | ||||
|
r32501 | class patternmatcher(basematcher): | ||
|
r32394 | |||
|
r32556 | def __init__(self, root, cwd, kindpats, ctx=None, listsubrepos=False, | ||
|
r32504 | badfn=None): | ||
|
r32555 | super(patternmatcher, self).__init__(root, cwd, badfn) | ||
|
r8581 | |||
|
r32557 | self._files = _explicitfiles(kindpats) | ||
|
r33405 | self._prefix = _prefix(kindpats) | ||
|
r33306 | self._pats, self.matchfn = _buildmatch(ctx, kindpats, '$', listsubrepos, | ||
root) | ||||
|
r8587 | |||
|
r32323 | @propertycache | ||
|
r24636 | def _dirs(self): | ||
|
r32323 | return set(util.dirs(self._fileset)) | {'.'} | ||
|
r24636 | |||
def visitdir(self, dir): | ||||
|
r33405 | if self._prefix and dir in self._fileset: | ||
|
r27343 | return 'all' | ||
|
r32554 | return ('.' in self._fileset or | ||
|
r32323 | dir in self._fileset or | ||
|
r25576 | dir in self._dirs or | ||
|
r32323 | any(parentdir in self._fileset | ||
|
r25577 | for parentdir in util.finddirs(dir))) | ||
|
r24636 | |||
|
r33379 | def prefix(self): | ||
|
r33405 | return self._prefix | ||
|
r21111 | |||
|
r32406 | def __repr__(self): | ||
|
r33306 | return ('<patternmatcher patterns=%r>' % self._pats) | ||
|
r32501 | |||
class includematcher(basematcher): | ||||
|
r32556 | def __init__(self, root, cwd, kindpats, ctx=None, listsubrepos=False, | ||
badfn=None): | ||||
|
r32502 | super(includematcher, self).__init__(root, cwd, badfn) | ||
|
r32501 | |||
|
r33306 | self._pats, self.matchfn = _buildmatch(ctx, kindpats, '(?:/|$)', | ||
listsubrepos, root) | ||||
|
r33405 | self._prefix = _prefix(kindpats) | ||
|
r32502 | roots, dirs = _rootsanddirs(kindpats) | ||
# roots are directories which are recursively included. | ||||
|
r32503 | self._roots = set(roots) | ||
|
r32502 | # dirs are directories which are non-recursively included. | ||
|
r32503 | self._dirs = set(dirs) | ||
|
r32501 | |||
def visitdir(self, dir): | ||||
|
r33405 | if self._prefix and dir in self._roots: | ||
|
r32501 | return 'all' | ||
|
r32503 | return ('.' in self._roots or | ||
dir in self._roots or | ||||
dir in self._dirs or | ||||
any(parentdir in self._roots | ||||
for parentdir in util.finddirs(dir))) | ||||
|
r32501 | |||
def __repr__(self): | ||||
|
r33306 | return ('<includematcher includes=%r>' % self._pats) | ||
|
r32406 | |||
|
r32499 | class exactmatcher(basematcher): | ||
'''Matches the input files exactly. They are interpreted as paths, not | ||||
patterns (so no kind-prefixes). | ||||
''' | ||||
def __init__(self, root, cwd, files, badfn=None): | ||||
super(exactmatcher, self).__init__(root, cwd, badfn) | ||||
if isinstance(files, list): | ||||
self._files = files | ||||
else: | ||||
self._files = list(files) | ||||
|
r32543 | |||
matchfn = basematcher.exact | ||||
|
r32499 | |||
@propertycache | ||||
def _dirs(self): | ||||
return set(util.dirs(self._fileset)) | {'.'} | ||||
def visitdir(self, dir): | ||||
return dir in self._dirs | ||||
def isexact(self): | ||||
return True | ||||
def __repr__(self): | ||||
return ('<exactmatcher files=%r>' % self._files) | ||||
|
r32465 | class differencematcher(basematcher): | ||
'''Composes two matchers by matching if the first matches and the second | ||||
does not. Well, almost... If the user provides a pattern like "-X foo foo", | ||||
Mercurial actually does match "foo" against that. That's because exact | ||||
matches are treated specially. So, since this differencematcher is used for | ||||
excludes, it needs to special-case exact matching. | ||||
The second matcher's non-matching-attributes (root, cwd, bad, explicitdir, | ||||
traversedir) are ignored. | ||||
TODO: If we want to keep the behavior described above for exact matches, we | ||||
should consider instead treating the above case something like this: | ||||
union(exact(foo), difference(pattern(foo), include(foo))) | ||||
''' | ||||
def __init__(self, m1, m2): | ||||
super(differencematcher, self).__init__(m1._root, m1._cwd) | ||||
self._m1 = m1 | ||||
self._m2 = m2 | ||||
self.bad = m1.bad | ||||
self.explicitdir = m1.explicitdir | ||||
self.traversedir = m1.traversedir | ||||
def matchfn(self, f): | ||||
return self._m1(f) and (not self._m2(f) or self._m1.exact(f)) | ||||
@propertycache | ||||
def _files(self): | ||||
if self.isexact(): | ||||
return [f for f in self._m1.files() if self(f)] | ||||
# If m1 is not an exact matcher, we can't easily figure out the set of | ||||
# files, because its files() are not always files. For example, if | ||||
# m1 is "path:dir" and m2 is "rootfileins:.", we don't | ||||
# want to remove "dir" from the set even though it would match m2, | ||||
# because the "dir" in m1 may not be a file. | ||||
return self._m1.files() | ||||
def visitdir(self, dir): | ||||
if self._m2.visitdir(dir) == 'all': | ||||
# There's a bug here: If m1 matches file 'dir/file' and m2 excludes | ||||
# 'dir' (recursively), we should still visit 'dir' due to the | ||||
# exception we have for exact matches. | ||||
return False | ||||
return bool(self._m1.visitdir(dir)) | ||||
def isexact(self): | ||||
return self._m1.isexact() | ||||
def __repr__(self): | ||||
return ('<differencematcher m1=%r, m2=%r>' % (self._m1, self._m2)) | ||||
|
r32497 | def intersectmatchers(m1, m2): | ||
'''Composes two matchers by matching if both of them match. | ||||
The second matcher's non-matching-attributes (root, cwd, bad, explicitdir, | ||||
traversedir) are ignored. | ||||
''' | ||||
if m1 is None or m2 is None: | ||||
return m1 or m2 | ||||
if m1.always(): | ||||
m = copy.copy(m2) | ||||
# TODO: Consider encapsulating these things in a class so there's only | ||||
# one thing to copy from m1. | ||||
m.bad = m1.bad | ||||
m.explicitdir = m1.explicitdir | ||||
m.traversedir = m1.traversedir | ||||
m.abs = m1.abs | ||||
m.rel = m1.rel | ||||
m._relativeuipath |= m1._relativeuipath | ||||
return m | ||||
if m2.always(): | ||||
m = copy.copy(m1) | ||||
m._relativeuipath |= m2._relativeuipath | ||||
return m | ||||
return intersectionmatcher(m1, m2) | ||||
class intersectionmatcher(basematcher): | ||||
def __init__(self, m1, m2): | ||||
super(intersectionmatcher, self).__init__(m1._root, m1._cwd) | ||||
self._m1 = m1 | ||||
self._m2 = m2 | ||||
self.bad = m1.bad | ||||
self.explicitdir = m1.explicitdir | ||||
self.traversedir = m1.traversedir | ||||
@propertycache | ||||
def _files(self): | ||||
if self.isexact(): | ||||
m1, m2 = self._m1, self._m2 | ||||
if not m1.isexact(): | ||||
m1, m2 = m2, m1 | ||||
return [f for f in m1.files() if m2(f)] | ||||
# It neither m1 nor m2 is an exact matcher, we can't easily intersect | ||||
# the set of files, because their files() are not always files. For | ||||
# example, if intersecting a matcher "-I glob:foo.txt" with matcher of | ||||
# "path:dir2", we don't want to remove "dir2" from the set. | ||||
return self._m1.files() + self._m2.files() | ||||
def matchfn(self, f): | ||||
return self._m1(f) and self._m2(f) | ||||
def visitdir(self, dir): | ||||
visit1 = self._m1.visitdir(dir) | ||||
if visit1 == 'all': | ||||
return self._m2.visitdir(dir) | ||||
# bool() because visit1=True + visit2='all' should not be 'all' | ||||
return bool(visit1 and self._m2.visitdir(dir)) | ||||
def always(self): | ||||
return self._m1.always() and self._m2.always() | ||||
def isexact(self): | ||||
return self._m1.isexact() or self._m2.isexact() | ||||
def __repr__(self): | ||||
return ('<intersectionmatcher m1=%r, m2=%r>' % (self._m1, self._m2)) | ||||
|
r32456 | class subdirmatcher(basematcher): | ||
|
r12165 | """Adapt a matcher to work on a subdirectory only. | ||
The paths are remapped to remove/insert the path as needed: | ||||
>>> m1 = match('root', '', ['a.txt', 'sub/b.txt']) | ||||
|
r28017 | >>> m2 = subdirmatcher('sub', m1) | ||
|
r12165 | >>> bool(m2('a.txt')) | ||
False | ||||
>>> bool(m2('b.txt')) | ||||
True | ||||
>>> bool(m2.matchfn('a.txt')) | ||||
False | ||||
>>> bool(m2.matchfn('b.txt')) | ||||
True | ||||
>>> m2.files() | ||||
['b.txt'] | ||||
>>> m2.exact('b.txt') | ||||
True | ||||
|
r23686 | >>> util.pconvert(m2.rel('b.txt')) | ||
'sub/b.txt' | ||||
|
r12268 | >>> def bad(f, msg): | ||
... print "%s: %s" % (f, msg) | ||||
>>> m1.bad = bad | ||||
>>> m2.bad('x.txt', 'No such file') | ||||
sub/x.txt: No such file | ||||
|
r23685 | >>> m2.abs('c.txt') | ||
'sub/c.txt' | ||||
|
r12165 | """ | ||
def __init__(self, path, matcher): | ||||
|
r32456 | super(subdirmatcher, self).__init__(matcher._root, matcher._cwd) | ||
|
r12165 | self._path = path | ||
self._matcher = matcher | ||||
|
r32456 | self._always = matcher.always() | ||
|
r12165 | |||
self._files = [f[len(path) + 1:] for f in matcher._files | ||||
if f.startswith(path + "/")] | ||||
|
r25194 | |||
|
r32326 | # If the parent repo had a path to this subrepo and the matcher is | ||
# a prefix matcher, this submatcher always matches. | ||||
if matcher.prefix(): | ||||
|
r25195 | self._always = any(f == path for f in matcher._files) | ||
|
r25194 | |||
|
r32325 | def bad(self, f, msg): | ||
self._matcher.bad(self._path + "/" + f, msg) | ||||
|
r23685 | def abs(self, f): | ||
return self._matcher.abs(self._path + "/" + f) | ||||
|
r23686 | def rel(self, f): | ||
return self._matcher.rel(self._path + "/" + f) | ||||
|
r32325 | def uipath(self, f): | ||
return self._matcher.uipath(self._path + "/" + f) | ||||
|
r32464 | def matchfn(self, f): | ||
# Some information is lost in the superclass's constructor, so we | ||||
# can not accurately create the matching function for the subdirectory | ||||
# from the inputs. Instead, we override matchfn() and visitdir() to | ||||
# call the original matcher with the subdirectory path prepended. | ||||
return self._matcher.matchfn(self._path + "/" + f) | ||||
|
r32324 | def visitdir(self, dir): | ||
if dir == '.': | ||||
dir = self._path | ||||
else: | ||||
dir = self._path + "/" + dir | ||||
return self._matcher.visitdir(dir) | ||||
|
r32456 | def always(self): | ||
return self._always | ||||
|
r33379 | def prefix(self): | ||
return self._matcher.prefix() and not self._always | ||||
|
r32456 | |||
|
r32552 | def __repr__(self): | ||
return ('<subdirmatcher path=%r, matcher=%r>' % | ||||
(self._path, self._matcher)) | ||||
|
r33319 | class unionmatcher(basematcher): | ||
|
r33448 | """A matcher that is the union of several matchers. | ||
The non-matching-attributes (root, cwd, bad, explicitdir, traversedir) are | ||||
taken from the first matcher. | ||||
""" | ||||
|
r33319 | def __init__(self, matchers): | ||
|
r33448 | m1 = matchers[0] | ||
super(unionmatcher, self).__init__(m1._root, m1._cwd) | ||||
self.explicitdir = m1.explicitdir | ||||
self.traversedir = m1.traversedir | ||||
|
r33319 | self._matchers = matchers | ||
|
r33380 | def matchfn(self, f): | ||
|
r33319 | for match in self._matchers: | ||
|
r33380 | if match(f): | ||
|
r33319 | return True | ||
return False | ||||
|
r33448 | def visitdir(self, dir): | ||
r = False | ||||
for m in self._matchers: | ||||
v = m.visitdir(dir) | ||||
if v == 'all': | ||||
return v | ||||
r |= v | ||||
return r | ||||
|
r33319 | def __repr__(self): | ||
return ('<unionmatcher matchers=%r>' % self._matchers) | ||||
|
r21111 | def patkind(pattern, default=None): | ||
'''If pattern is 'kind:pat' with a known kind, return kind.''' | ||||
return _patsplit(pattern, default)[0] | ||||
|
r8570 | |||
|
r21111 | def _patsplit(pattern, default): | ||
"""Split a string into the optional pattern kind prefix and the actual | ||||
pattern.""" | ||||
if ':' in pattern: | ||||
kind, pat = pattern.split(':', 1) | ||||
|
r13218 | if kind in ('re', 'glob', 'path', 'relglob', 'relpath', 'relre', | ||
|
r31012 | 'listfile', 'listfile0', 'set', 'include', 'subinclude', | ||
'rootfilesin'): | ||||
|
r21111 | return kind, pat | ||
return default, pattern | ||||
|
r8570 | |||
|
r8582 | def _globre(pat): | ||
|
r21112 | r'''Convert an extended glob string to a regexp string. | ||
>>> print _globre(r'?') | ||||
. | ||||
>>> print _globre(r'*') | ||||
[^/]* | ||||
>>> print _globre(r'**') | ||||
.* | ||||
|
r21815 | >>> print _globre(r'**/a') | ||
(?:.*/)?a | ||||
>>> print _globre(r'a/**/b') | ||||
a\/(?:.*/)?b | ||||
|
r21112 | >>> print _globre(r'[a*?!^][^b][!c]') | ||
[a*?!^][\^b][^c] | ||||
>>> print _globre(r'{a,b}') | ||||
(?:a|b) | ||||
>>> print _globre(r'.\*\?') | ||||
\.\*\? | ||||
''' | ||||
|
r8570 | i, n = 0, len(pat) | ||
res = '' | ||||
group = 0 | ||||
|
r21915 | escape = util.re.escape | ||
|
r10282 | def peek(): | ||
|
r31421 | return i < n and pat[i:i + 1] | ||
|
r8570 | while i < n: | ||
|
r31421 | c = pat[i:i + 1] | ||
|
r10282 | i += 1 | ||
|
r8583 | if c not in '*?[{},\\': | ||
res += escape(c) | ||||
elif c == '*': | ||||
|
r8570 | if peek() == '*': | ||
i += 1 | ||||
|
r21815 | if peek() == '/': | ||
i += 1 | ||||
res += '(?:.*/)?' | ||||
else: | ||||
res += '.*' | ||||
|
r8570 | else: | ||
res += '[^/]*' | ||||
elif c == '?': | ||||
res += '.' | ||||
elif c == '[': | ||||
j = i | ||||
|
r31421 | if j < n and pat[j:j + 1] in '!]': | ||
|
r8570 | j += 1 | ||
|
r31421 | while j < n and pat[j:j + 1] != ']': | ||
|
r8570 | j += 1 | ||
if j >= n: | ||||
res += '\\[' | ||||
else: | ||||
stuff = pat[i:j].replace('\\','\\\\') | ||||
i = j + 1 | ||||
|
r31421 | if stuff[0:1] == '!': | ||
|
r8570 | stuff = '^' + stuff[1:] | ||
|
r31421 | elif stuff[0:1] == '^': | ||
|
r8570 | stuff = '\\' + stuff | ||
res = '%s[%s]' % (res, stuff) | ||||
elif c == '{': | ||||
group += 1 | ||||
res += '(?:' | ||||
elif c == '}' and group: | ||||
res += ')' | ||||
group -= 1 | ||||
elif c == ',' and group: | ||||
res += '|' | ||||
elif c == '\\': | ||||
p = peek() | ||||
if p: | ||||
i += 1 | ||||
|
r8583 | res += escape(p) | ||
|
r8570 | else: | ||
|
r8583 | res += escape(c) | ||
|
r8570 | else: | ||
|
r8583 | res += escape(c) | ||
|
r8582 | return res | ||
|
r8570 | |||
|
r21111 | def _regex(kind, pat, globsuffix): | ||
'''Convert a (normalized) pattern of any kind into a regular expression. | ||||
globsuffix is appended to the regexp of globs.''' | ||||
if not pat: | ||||
|
r8574 | return '' | ||
if kind == 're': | ||||
|
r21111 | return pat | ||
|
r33358 | if kind in ('path', 'relpath'): | ||
|
r25636 | if pat == '.': | ||
return '' | ||||
|
r33357 | return util.re.escape(pat) + '(?:/|$)' | ||
|
r31012 | if kind == 'rootfilesin': | ||
if pat == '.': | ||||
escaped = '' | ||||
else: | ||||
# Pattern is a directory name. | ||||
escaped = util.re.escape(pat) + '/' | ||||
# Anything after the pattern must be a non-directory. | ||||
|
r33357 | return escaped + '[^/]+$' | ||
|
r21111 | if kind == 'relglob': | ||
return '(?:|.*/)' + _globre(pat) + globsuffix | ||||
if kind == 'relre': | ||||
if pat.startswith('^'): | ||||
return pat | ||||
return '.*' + pat | ||||
return _globre(pat) + globsuffix | ||||
|
r8574 | |||
|
r25238 | def _buildmatch(ctx, kindpats, globsuffix, listsubrepos, root): | ||
|
r21111 | '''Return regexp string and a matcher function for kindpats. | ||
globsuffix is appended to the regexp of globs.''' | ||||
|
r25239 | matchfuncs = [] | ||
|
r25283 | subincludes, kindpats = _expandsubinclude(kindpats, root) | ||
if subincludes: | ||||
|
r32132 | submatchers = {} | ||
|
r25283 | def matchsubinclude(f): | ||
|
r32132 | for prefix, matcherargs in subincludes: | ||
if f.startswith(prefix): | ||||
mf = submatchers.get(prefix) | ||||
if mf is None: | ||||
mf = match(*matcherargs) | ||||
submatchers[prefix] = mf | ||||
if mf(f[len(prefix):]): | ||||
return True | ||||
|
r25283 | return False | ||
matchfuncs.append(matchsubinclude) | ||||
|
r14675 | |||
|
r25122 | fset, kindpats = _expandsets(kindpats, ctx, listsubrepos) | ||
|
r14675 | if fset: | ||
|
r25239 | matchfuncs.append(fset.__contains__) | ||
|
r14675 | |||
|
r25239 | regex = '' | ||
if kindpats: | ||||
regex, mf = _buildregexmatch(kindpats, globsuffix) | ||||
matchfuncs.append(mf) | ||||
if len(matchfuncs) == 1: | ||||
return regex, matchfuncs[0] | ||||
else: | ||||
return regex, lambda f: any(mf(f) for mf in matchfuncs) | ||||
|
r14675 | |||
|
r21111 | def _buildregexmatch(kindpats, globsuffix): | ||
"""Build a match function from a list of kinds and kindpats, | ||||
return regexp string and a matcher function.""" | ||||
|
r8574 | try: | ||
|
r21111 | regex = '(?:%s)' % '|'.join([_regex(k, p, globsuffix) | ||
|
r25213 | for (k, p, s) in kindpats]) | ||
|
r21111 | if len(regex) > 20000: | ||
|
r16687 | raise OverflowError | ||
|
r21111 | return regex, _rematcher(regex) | ||
|
r8574 | except OverflowError: | ||
# We're using a Python with a tiny regex engine and we | ||||
# made it explode, so we'll divide the pattern list in two | ||||
# until it works | ||||
|
r21111 | l = len(kindpats) | ||
|
r8574 | if l < 2: | ||
raise | ||||
|
r21111 | regexa, a = _buildregexmatch(kindpats[:l//2], globsuffix) | ||
regexb, b = _buildregexmatch(kindpats[l//2:], globsuffix) | ||||
|
r21191 | return regex, lambda s: a(s) or b(s) | ||
|
r8574 | except re.error: | ||
|
r25213 | for k, p, s in kindpats: | ||
|
r8574 | try: | ||
|
r21111 | _rematcher('(?:%s)' % _regex(k, p, globsuffix)) | ||
|
r8574 | except re.error: | ||
|
r25213 | if s: | ||
|
r26587 | raise error.Abort(_("%s: invalid pattern (%s): %s") % | ||
|
r25213 | (s, k, p)) | ||
else: | ||||
|
r26587 | raise error.Abort(_("invalid pattern (%s): %s") % (k, p)) | ||
raise error.Abort(_("invalid pattern")) | ||||
|
r8574 | |||
|
r31013 | def _patternrootsanddirs(kindpats): | ||
'''Returns roots and directories corresponding to each pattern. | ||||
|
r21079 | |||
|
r31013 | This calculates the roots and directories exactly matching the patterns and | ||
returns a tuple of (roots, dirs) for each. It does not return other | ||||
directories which may also need to be considered, like the parent | ||||
directories. | ||||
|
r21079 | ''' | ||
|
r8576 | r = [] | ||
|
r31013 | d = [] | ||
|
r25213 | for kind, pat, source in kindpats: | ||
|
r8584 | if kind == 'glob': # find the non-glob prefix | ||
root = [] | ||||
|
r21111 | for p in pat.split('/'): | ||
|
r8584 | if '[' in p or '{' in p or '*' in p or '?' in p: | ||
break | ||||
root.append(p) | ||||
r.append('/'.join(root) or '.') | ||||
|
r31013 | elif kind in ('relpath', 'path'): | ||
|
r21111 | r.append(pat or '.') | ||
|
r31013 | elif kind in ('rootfilesin',): | ||
d.append(pat or '.') | ||||
|
r19107 | else: # relglob, re, relre | ||
|
r8576 | r.append('.') | ||
|
r31013 | return r, d | ||
def _roots(kindpats): | ||||
'''Returns root directories to match recursively from the given patterns.''' | ||||
roots, dirs = _patternrootsanddirs(kindpats) | ||||
return roots | ||||
def _rootsanddirs(kindpats): | ||||
'''Returns roots and exact directories from patterns. | ||||
roots are directories to match recursively, whereas exact directories should | ||||
be matched non-recursively. The returned (roots, dirs) tuple will also | ||||
include directories that need to be implicitly considered as either, such as | ||||
parent directories. | ||||
>>> _rootsanddirs(\ | ||||
[('glob', 'g/h/*', ''), ('glob', 'g/h', ''), ('glob', 'g*', '')]) | ||||
|
r32176 | (['g/h', 'g/h', '.'], ['g', '.']) | ||
|
r31013 | >>> _rootsanddirs(\ | ||
[('rootfilesin', 'g/h', ''), ('rootfilesin', '', '')]) | ||||
|
r32176 | ([], ['g/h', '.', 'g', '.']) | ||
|
r31013 | >>> _rootsanddirs(\ | ||
[('relpath', 'r', ''), ('path', 'p/p', ''), ('path', '', '')]) | ||||
|
r32176 | (['r', 'p/p', '.'], ['p', '.']) | ||
|
r31013 | >>> _rootsanddirs(\ | ||
[('relglob', 'rg*', ''), ('re', 're/', ''), ('relre', 'rr', '')]) | ||||
|
r32176 | (['.', '.', '.'], ['.']) | ||
|
r31013 | ''' | ||
r, d = _patternrootsanddirs(kindpats) | ||||
# Append the parents as non-recursive/exact directories, since they must be | ||||
# scanned to get to either the roots or the other exact directories. | ||||
d.extend(util.dirs(d)) | ||||
d.extend(util.dirs(r)) | ||||
|
r32176 | # util.dirs() does not include the root directory, so add it manually | ||
d.append('.') | ||||
|
r31013 | |||
return r, d | ||||
|
r8576 | |||
|
r31012 | def _explicitfiles(kindpats): | ||
'''Returns the potential explicit filenames from the patterns. | ||||
>>> _explicitfiles([('path', 'foo/bar', '')]) | ||||
['foo/bar'] | ||||
>>> _explicitfiles([('rootfilesin', 'foo/bar', '')]) | ||||
[] | ||||
''' | ||||
# Keep only the pattern kinds where one can specify filenames (vs only | ||||
# directory names). | ||||
filable = [kp for kp in kindpats if kp[0] not in ('rootfilesin',)] | ||||
return _roots(filable) | ||||
|
r33405 | def _prefix(kindpats): | ||
'''Whether all the patterns match a prefix (i.e. recursively)''' | ||||
|
r25213 | for kind, pat, source in kindpats: | ||
|
r33405 | if kind not in ('path', 'relpath'): | ||
return False | ||||
return True | ||||
|
r25167 | |||
_commentre = None | ||||
|
r27595 | def readpatternfile(filepath, warn, sourceinfo=False): | ||
|
r25167 | '''parse a pattern file, returning a list of | ||
patterns. These patterns should be given to compile() | ||||
|
r25216 | to be validated and converted into a match function. | ||
trailing white space is dropped. | ||||
the escape character is backslash. | ||||
comments start with #. | ||||
empty lines are skipped. | ||||
lines can be of the following formats: | ||||
syntax: regexp # defaults following lines to non-rooted regexps | ||||
syntax: glob # defaults following lines to non-rooted globs | ||||
re:pattern # non-rooted regular expression | ||||
glob:pattern # non-rooted glob | ||||
|
r27595 | pattern # pattern of the current default type | ||
if sourceinfo is set, returns a list of tuples: | ||||
(pattern, lineno, originalline). This is useful to debug ignore patterns. | ||||
''' | ||||
|
r25216 | |||
|
r25215 | syntaxes = {'re': 'relre:', 'regexp': 'relre:', 'glob': 'relglob:', | ||
|
r25283 | 'include': 'include', 'subinclude': 'subinclude'} | ||
|
r25167 | syntax = 'relre:' | ||
patterns = [] | ||||
|
r31403 | fp = open(filepath, 'rb') | ||
|
r30399 | for lineno, line in enumerate(util.iterfile(fp), start=1): | ||
|
r25167 | if "#" in line: | ||
global _commentre | ||||
if not _commentre: | ||||
|
r31420 | _commentre = util.re.compile(br'((?:^|[^\\])(?:\\\\)*)#.*') | ||
|
r25167 | # remove comments prefixed by an even number of escapes | ||
|
r27327 | m = _commentre.search(line) | ||
if m: | ||||
line = line[:m.end(1)] | ||||
|
r25167 | # fixup properly escaped comments that survived the above | ||
line = line.replace("\\#", "#") | ||||
line = line.rstrip() | ||||
if not line: | ||||
continue | ||||
if line.startswith('syntax:'): | ||||
s = line[7:].strip() | ||||
try: | ||||
syntax = syntaxes[s] | ||||
except KeyError: | ||||
|
r25214 | if warn: | ||
warn(_("%s: ignoring invalid syntax '%s'\n") % | ||||
(filepath, s)) | ||||
|
r25167 | continue | ||
linesyntax = syntax | ||||
for s, rels in syntaxes.iteritems(): | ||||
if line.startswith(rels): | ||||
linesyntax = rels | ||||
line = line[len(rels):] | ||||
break | ||||
elif line.startswith(s+':'): | ||||
linesyntax = rels | ||||
line = line[len(s) + 1:] | ||||
break | ||||
|
r27595 | if sourceinfo: | ||
patterns.append((linesyntax + line, lineno, line)) | ||||
else: | ||||
patterns.append(linesyntax + line) | ||||
|
r25167 | fp.close() | ||
return patterns | ||||