Show More
@@ -1,142 +1,152 b'' | |||||
1 | # changegroup.py - Mercurial changegroup manipulation functions |
|
1 | # changegroup.py - Mercurial changegroup manipulation functions | |
2 | # |
|
2 | # | |
3 | # Copyright 2006 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2006 Matt Mackall <mpm@selenic.com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from i18n import _ |
|
8 | from i18n import _ | |
9 | import util |
|
9 | import util | |
10 | import struct, os, bz2, zlib, tempfile |
|
10 | import struct, os, bz2, zlib, tempfile | |
11 |
|
11 | |||
12 | def getchunk(source): |
|
12 | def getchunk(source): | |
13 | """return the next chunk from changegroup 'source' as a string""" |
|
13 | """return the next chunk from changegroup 'source' as a string""" | |
14 | d = source.read(4) |
|
14 | d = source.read(4) | |
15 | if not d: |
|
15 | if not d: | |
16 | return "" |
|
16 | return "" | |
17 | l = struct.unpack(">l", d)[0] |
|
17 | l = struct.unpack(">l", d)[0] | |
18 | if l <= 4: |
|
18 | if l <= 4: | |
19 | return "" |
|
19 | return "" | |
20 | d = source.read(l - 4) |
|
20 | d = source.read(l - 4) | |
21 | if len(d) < l - 4: |
|
21 | if len(d) < l - 4: | |
22 | raise util.Abort(_("premature EOF reading chunk" |
|
22 | raise util.Abort(_("premature EOF reading chunk" | |
23 | " (got %d bytes, expected %d)") |
|
23 | " (got %d bytes, expected %d)") | |
24 | % (len(d), l - 4)) |
|
24 | % (len(d), l - 4)) | |
25 | return d |
|
25 | return d | |
26 |
|
26 | |||
27 | def chunkiter(source): |
|
27 | def chunkiter(source): | |
28 | """iterate through the chunks in source, yielding a sequence of chunks |
|
28 | """iterate through the chunks in source, yielding a sequence of chunks | |
29 | (strings)""" |
|
29 | (strings)""" | |
30 | while 1: |
|
30 | while 1: | |
31 | c = getchunk(source) |
|
31 | c = getchunk(source) | |
32 | if not c: |
|
32 | if not c: | |
33 | break |
|
33 | break | |
34 | yield c |
|
34 | yield c | |
35 |
|
35 | |||
36 | def chunkheader(length): |
|
36 | def chunkheader(length): | |
37 | """return a changegroup chunk header (string)""" |
|
37 | """return a changegroup chunk header (string)""" | |
38 | return struct.pack(">l", length + 4) |
|
38 | return struct.pack(">l", length + 4) | |
39 |
|
39 | |||
40 | def closechunk(): |
|
40 | def closechunk(): | |
41 | """return a changegroup chunk header (string) for a zero-length chunk""" |
|
41 | """return a changegroup chunk header (string) for a zero-length chunk""" | |
42 | return struct.pack(">l", 0) |
|
42 | return struct.pack(">l", 0) | |
43 |
|
43 | |||
44 | class nocompress(object): |
|
44 | class nocompress(object): | |
45 | def compress(self, x): |
|
45 | def compress(self, x): | |
46 | return x |
|
46 | return x | |
47 | def flush(self): |
|
47 | def flush(self): | |
48 | return "" |
|
48 | return "" | |
49 |
|
49 | |||
50 | bundletypes = { |
|
50 | bundletypes = { | |
51 | "": ("", nocompress), |
|
51 | "": ("", nocompress), | |
52 | "HG10UN": ("HG10UN", nocompress), |
|
52 | "HG10UN": ("HG10UN", nocompress), | |
53 | "HG10BZ": ("HG10", lambda: bz2.BZ2Compressor()), |
|
53 | "HG10BZ": ("HG10", lambda: bz2.BZ2Compressor()), | |
54 | "HG10GZ": ("HG10GZ", lambda: zlib.compressobj()), |
|
54 | "HG10GZ": ("HG10GZ", lambda: zlib.compressobj()), | |
55 | } |
|
55 | } | |
56 |
|
56 | |||
|
57 | def collector(cl, mmfs, files): | |||
|
58 | # Gather information about changeset nodes going out in a bundle. | |||
|
59 | # We want to gather manifests needed and filelogs affected. | |||
|
60 | def collect(node): | |||
|
61 | c = cl.read(node) | |||
|
62 | for fn in c[3]: | |||
|
63 | files.setdefault(fn, fn) | |||
|
64 | mmfs.setdefault(c[0], node) | |||
|
65 | return collect | |||
|
66 | ||||
57 | # hgweb uses this list to communicate its preferred type |
|
67 | # hgweb uses this list to communicate its preferred type | |
58 | bundlepriority = ['HG10GZ', 'HG10BZ', 'HG10UN'] |
|
68 | bundlepriority = ['HG10GZ', 'HG10BZ', 'HG10UN'] | |
59 |
|
69 | |||
60 | def writebundle(cg, filename, bundletype): |
|
70 | def writebundle(cg, filename, bundletype): | |
61 | """Write a bundle file and return its filename. |
|
71 | """Write a bundle file and return its filename. | |
62 |
|
72 | |||
63 | Existing files will not be overwritten. |
|
73 | Existing files will not be overwritten. | |
64 | If no filename is specified, a temporary file is created. |
|
74 | If no filename is specified, a temporary file is created. | |
65 | bz2 compression can be turned off. |
|
75 | bz2 compression can be turned off. | |
66 | The bundle file will be deleted in case of errors. |
|
76 | The bundle file will be deleted in case of errors. | |
67 | """ |
|
77 | """ | |
68 |
|
78 | |||
69 | fh = None |
|
79 | fh = None | |
70 | cleanup = None |
|
80 | cleanup = None | |
71 | try: |
|
81 | try: | |
72 | if filename: |
|
82 | if filename: | |
73 | fh = open(filename, "wb") |
|
83 | fh = open(filename, "wb") | |
74 | else: |
|
84 | else: | |
75 | fd, filename = tempfile.mkstemp(prefix="hg-bundle-", suffix=".hg") |
|
85 | fd, filename = tempfile.mkstemp(prefix="hg-bundle-", suffix=".hg") | |
76 | fh = os.fdopen(fd, "wb") |
|
86 | fh = os.fdopen(fd, "wb") | |
77 | cleanup = filename |
|
87 | cleanup = filename | |
78 |
|
88 | |||
79 | header, compressor = bundletypes[bundletype] |
|
89 | header, compressor = bundletypes[bundletype] | |
80 | fh.write(header) |
|
90 | fh.write(header) | |
81 | z = compressor() |
|
91 | z = compressor() | |
82 |
|
92 | |||
83 | # parse the changegroup data, otherwise we will block |
|
93 | # parse the changegroup data, otherwise we will block | |
84 | # in case of sshrepo because we don't know the end of the stream |
|
94 | # in case of sshrepo because we don't know the end of the stream | |
85 |
|
95 | |||
86 | # an empty chunkiter is the end of the changegroup |
|
96 | # an empty chunkiter is the end of the changegroup | |
87 | # a changegroup has at least 2 chunkiters (changelog and manifest). |
|
97 | # a changegroup has at least 2 chunkiters (changelog and manifest). | |
88 | # after that, an empty chunkiter is the end of the changegroup |
|
98 | # after that, an empty chunkiter is the end of the changegroup | |
89 | empty = False |
|
99 | empty = False | |
90 | count = 0 |
|
100 | count = 0 | |
91 | while not empty or count <= 2: |
|
101 | while not empty or count <= 2: | |
92 | empty = True |
|
102 | empty = True | |
93 | count += 1 |
|
103 | count += 1 | |
94 | for chunk in chunkiter(cg): |
|
104 | for chunk in chunkiter(cg): | |
95 | empty = False |
|
105 | empty = False | |
96 | fh.write(z.compress(chunkheader(len(chunk)))) |
|
106 | fh.write(z.compress(chunkheader(len(chunk)))) | |
97 | pos = 0 |
|
107 | pos = 0 | |
98 | while pos < len(chunk): |
|
108 | while pos < len(chunk): | |
99 | next = pos + 2**20 |
|
109 | next = pos + 2**20 | |
100 | fh.write(z.compress(chunk[pos:next])) |
|
110 | fh.write(z.compress(chunk[pos:next])) | |
101 | pos = next |
|
111 | pos = next | |
102 | fh.write(z.compress(closechunk())) |
|
112 | fh.write(z.compress(closechunk())) | |
103 | fh.write(z.flush()) |
|
113 | fh.write(z.flush()) | |
104 | cleanup = None |
|
114 | cleanup = None | |
105 | return filename |
|
115 | return filename | |
106 | finally: |
|
116 | finally: | |
107 | if fh is not None: |
|
117 | if fh is not None: | |
108 | fh.close() |
|
118 | fh.close() | |
109 | if cleanup is not None: |
|
119 | if cleanup is not None: | |
110 | os.unlink(cleanup) |
|
120 | os.unlink(cleanup) | |
111 |
|
121 | |||
112 | def unbundle(header, fh): |
|
122 | def unbundle(header, fh): | |
113 | if header == 'HG10UN': |
|
123 | if header == 'HG10UN': | |
114 | return fh |
|
124 | return fh | |
115 | elif not header.startswith('HG'): |
|
125 | elif not header.startswith('HG'): | |
116 | # old client with uncompressed bundle |
|
126 | # old client with uncompressed bundle | |
117 | def generator(f): |
|
127 | def generator(f): | |
118 | yield header |
|
128 | yield header | |
119 | for chunk in f: |
|
129 | for chunk in f: | |
120 | yield chunk |
|
130 | yield chunk | |
121 | elif header == 'HG10GZ': |
|
131 | elif header == 'HG10GZ': | |
122 | def generator(f): |
|
132 | def generator(f): | |
123 | zd = zlib.decompressobj() |
|
133 | zd = zlib.decompressobj() | |
124 | for chunk in f: |
|
134 | for chunk in f: | |
125 | yield zd.decompress(chunk) |
|
135 | yield zd.decompress(chunk) | |
126 | elif header == 'HG10BZ': |
|
136 | elif header == 'HG10BZ': | |
127 | def generator(f): |
|
137 | def generator(f): | |
128 | zd = bz2.BZ2Decompressor() |
|
138 | zd = bz2.BZ2Decompressor() | |
129 | zd.decompress("BZ") |
|
139 | zd.decompress("BZ") | |
130 | for chunk in util.filechunkiter(f, 4096): |
|
140 | for chunk in util.filechunkiter(f, 4096): | |
131 | yield zd.decompress(chunk) |
|
141 | yield zd.decompress(chunk) | |
132 | return util.chunkbuffer(generator(fh)) |
|
142 | return util.chunkbuffer(generator(fh)) | |
133 |
|
143 | |||
134 | def readbundle(fh, fname): |
|
144 | def readbundle(fh, fname): | |
135 | header = fh.read(6) |
|
145 | header = fh.read(6) | |
136 | if not header.startswith('HG'): |
|
146 | if not header.startswith('HG'): | |
137 | raise util.Abort(_('%s: not a Mercurial bundle file') % fname) |
|
147 | raise util.Abort(_('%s: not a Mercurial bundle file') % fname) | |
138 | if not header.startswith('HG10'): |
|
148 | if not header.startswith('HG10'): | |
139 | raise util.Abort(_('%s: unknown bundle version') % fname) |
|
149 | raise util.Abort(_('%s: unknown bundle version') % fname) | |
140 | elif header not in bundletypes: |
|
150 | elif header not in bundletypes: | |
141 | raise util.Abort(_('%s: unknown bundle compression type') % fname) |
|
151 | raise util.Abort(_('%s: unknown bundle compression type') % fname) | |
142 | return unbundle(header, fh) |
|
152 | return unbundle(header, fh) |
@@ -1,2168 +1,2142 b'' | |||||
1 | # localrepo.py - read/write repository class for mercurial |
|
1 | # localrepo.py - read/write repository class for mercurial | |
2 | # |
|
2 | # | |
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from node import bin, hex, nullid, nullrev, short |
|
8 | from node import bin, hex, nullid, nullrev, short | |
9 | from i18n import _ |
|
9 | from i18n import _ | |
10 | import repo, changegroup, subrepo |
|
10 | import repo, changegroup, subrepo | |
11 | import changelog, dirstate, filelog, manifest, context |
|
11 | import changelog, dirstate, filelog, manifest, context | |
12 | import lock, transaction, store, encoding |
|
12 | import lock, transaction, store, encoding | |
13 | import util, extensions, hook, error |
|
13 | import util, extensions, hook, error | |
14 | import match as match_ |
|
14 | import match as match_ | |
15 | import merge as merge_ |
|
15 | import merge as merge_ | |
16 | import tags as tags_ |
|
16 | import tags as tags_ | |
17 | from lock import release |
|
17 | from lock import release | |
18 | import weakref, stat, errno, os, time, inspect |
|
18 | import weakref, stat, errno, os, time, inspect | |
19 | propertycache = util.propertycache |
|
19 | propertycache = util.propertycache | |
20 |
|
20 | |||
21 | class localrepository(repo.repository): |
|
21 | class localrepository(repo.repository): | |
22 | capabilities = set(('lookup', 'changegroupsubset', 'branchmap')) |
|
22 | capabilities = set(('lookup', 'changegroupsubset', 'branchmap')) | |
23 | supported = set('revlogv1 store fncache shared'.split()) |
|
23 | supported = set('revlogv1 store fncache shared'.split()) | |
24 |
|
24 | |||
25 | def __init__(self, baseui, path=None, create=0): |
|
25 | def __init__(self, baseui, path=None, create=0): | |
26 | repo.repository.__init__(self) |
|
26 | repo.repository.__init__(self) | |
27 | self.root = os.path.realpath(path) |
|
27 | self.root = os.path.realpath(path) | |
28 | self.path = os.path.join(self.root, ".hg") |
|
28 | self.path = os.path.join(self.root, ".hg") | |
29 | self.origroot = path |
|
29 | self.origroot = path | |
30 | self.opener = util.opener(self.path) |
|
30 | self.opener = util.opener(self.path) | |
31 | self.wopener = util.opener(self.root) |
|
31 | self.wopener = util.opener(self.root) | |
32 | self.baseui = baseui |
|
32 | self.baseui = baseui | |
33 | self.ui = baseui.copy() |
|
33 | self.ui = baseui.copy() | |
34 |
|
34 | |||
35 | try: |
|
35 | try: | |
36 | self.ui.readconfig(self.join("hgrc"), self.root) |
|
36 | self.ui.readconfig(self.join("hgrc"), self.root) | |
37 | extensions.loadall(self.ui) |
|
37 | extensions.loadall(self.ui) | |
38 | except IOError: |
|
38 | except IOError: | |
39 | pass |
|
39 | pass | |
40 |
|
40 | |||
41 | if not os.path.isdir(self.path): |
|
41 | if not os.path.isdir(self.path): | |
42 | if create: |
|
42 | if create: | |
43 | if not os.path.exists(path): |
|
43 | if not os.path.exists(path): | |
44 | os.mkdir(path) |
|
44 | os.mkdir(path) | |
45 | os.mkdir(self.path) |
|
45 | os.mkdir(self.path) | |
46 | requirements = ["revlogv1"] |
|
46 | requirements = ["revlogv1"] | |
47 | if self.ui.configbool('format', 'usestore', True): |
|
47 | if self.ui.configbool('format', 'usestore', True): | |
48 | os.mkdir(os.path.join(self.path, "store")) |
|
48 | os.mkdir(os.path.join(self.path, "store")) | |
49 | requirements.append("store") |
|
49 | requirements.append("store") | |
50 | if self.ui.configbool('format', 'usefncache', True): |
|
50 | if self.ui.configbool('format', 'usefncache', True): | |
51 | requirements.append("fncache") |
|
51 | requirements.append("fncache") | |
52 | # create an invalid changelog |
|
52 | # create an invalid changelog | |
53 | self.opener("00changelog.i", "a").write( |
|
53 | self.opener("00changelog.i", "a").write( | |
54 | '\0\0\0\2' # represents revlogv2 |
|
54 | '\0\0\0\2' # represents revlogv2 | |
55 | ' dummy changelog to prevent using the old repo layout' |
|
55 | ' dummy changelog to prevent using the old repo layout' | |
56 | ) |
|
56 | ) | |
57 | reqfile = self.opener("requires", "w") |
|
57 | reqfile = self.opener("requires", "w") | |
58 | for r in requirements: |
|
58 | for r in requirements: | |
59 | reqfile.write("%s\n" % r) |
|
59 | reqfile.write("%s\n" % r) | |
60 | reqfile.close() |
|
60 | reqfile.close() | |
61 | else: |
|
61 | else: | |
62 | raise error.RepoError(_("repository %s not found") % path) |
|
62 | raise error.RepoError(_("repository %s not found") % path) | |
63 | elif create: |
|
63 | elif create: | |
64 | raise error.RepoError(_("repository %s already exists") % path) |
|
64 | raise error.RepoError(_("repository %s already exists") % path) | |
65 | else: |
|
65 | else: | |
66 | # find requirements |
|
66 | # find requirements | |
67 | requirements = set() |
|
67 | requirements = set() | |
68 | try: |
|
68 | try: | |
69 | requirements = set(self.opener("requires").read().splitlines()) |
|
69 | requirements = set(self.opener("requires").read().splitlines()) | |
70 | except IOError, inst: |
|
70 | except IOError, inst: | |
71 | if inst.errno != errno.ENOENT: |
|
71 | if inst.errno != errno.ENOENT: | |
72 | raise |
|
72 | raise | |
73 | for r in requirements - self.supported: |
|
73 | for r in requirements - self.supported: | |
74 | raise error.RepoError(_("requirement '%s' not supported") % r) |
|
74 | raise error.RepoError(_("requirement '%s' not supported") % r) | |
75 |
|
75 | |||
76 | self.sharedpath = self.path |
|
76 | self.sharedpath = self.path | |
77 | try: |
|
77 | try: | |
78 | s = os.path.realpath(self.opener("sharedpath").read()) |
|
78 | s = os.path.realpath(self.opener("sharedpath").read()) | |
79 | if not os.path.exists(s): |
|
79 | if not os.path.exists(s): | |
80 | raise error.RepoError( |
|
80 | raise error.RepoError( | |
81 | _('.hg/sharedpath points to nonexistent directory %s') % s) |
|
81 | _('.hg/sharedpath points to nonexistent directory %s') % s) | |
82 | self.sharedpath = s |
|
82 | self.sharedpath = s | |
83 | except IOError, inst: |
|
83 | except IOError, inst: | |
84 | if inst.errno != errno.ENOENT: |
|
84 | if inst.errno != errno.ENOENT: | |
85 | raise |
|
85 | raise | |
86 |
|
86 | |||
87 | self.store = store.store(requirements, self.sharedpath, util.opener) |
|
87 | self.store = store.store(requirements, self.sharedpath, util.opener) | |
88 | self.spath = self.store.path |
|
88 | self.spath = self.store.path | |
89 | self.sopener = self.store.opener |
|
89 | self.sopener = self.store.opener | |
90 | self.sjoin = self.store.join |
|
90 | self.sjoin = self.store.join | |
91 | self.opener.createmode = self.store.createmode |
|
91 | self.opener.createmode = self.store.createmode | |
92 | self.sopener.options = {} |
|
92 | self.sopener.options = {} | |
93 |
|
93 | |||
94 | # These two define the set of tags for this repository. _tags |
|
94 | # These two define the set of tags for this repository. _tags | |
95 | # maps tag name to node; _tagtypes maps tag name to 'global' or |
|
95 | # maps tag name to node; _tagtypes maps tag name to 'global' or | |
96 | # 'local'. (Global tags are defined by .hgtags across all |
|
96 | # 'local'. (Global tags are defined by .hgtags across all | |
97 | # heads, and local tags are defined in .hg/localtags.) They |
|
97 | # heads, and local tags are defined in .hg/localtags.) They | |
98 | # constitute the in-memory cache of tags. |
|
98 | # constitute the in-memory cache of tags. | |
99 | self._tags = None |
|
99 | self._tags = None | |
100 | self._tagtypes = None |
|
100 | self._tagtypes = None | |
101 |
|
101 | |||
102 | self._branchcache = None # in UTF-8 |
|
102 | self._branchcache = None # in UTF-8 | |
103 | self._branchcachetip = None |
|
103 | self._branchcachetip = None | |
104 | self.nodetagscache = None |
|
104 | self.nodetagscache = None | |
105 | self.filterpats = {} |
|
105 | self.filterpats = {} | |
106 | self._datafilters = {} |
|
106 | self._datafilters = {} | |
107 | self._transref = self._lockref = self._wlockref = None |
|
107 | self._transref = self._lockref = self._wlockref = None | |
108 |
|
108 | |||
109 | @propertycache |
|
109 | @propertycache | |
110 | def changelog(self): |
|
110 | def changelog(self): | |
111 | c = changelog.changelog(self.sopener) |
|
111 | c = changelog.changelog(self.sopener) | |
112 | if 'HG_PENDING' in os.environ: |
|
112 | if 'HG_PENDING' in os.environ: | |
113 | p = os.environ['HG_PENDING'] |
|
113 | p = os.environ['HG_PENDING'] | |
114 | if p.startswith(self.root): |
|
114 | if p.startswith(self.root): | |
115 | c.readpending('00changelog.i.a') |
|
115 | c.readpending('00changelog.i.a') | |
116 | self.sopener.options['defversion'] = c.version |
|
116 | self.sopener.options['defversion'] = c.version | |
117 | return c |
|
117 | return c | |
118 |
|
118 | |||
119 | @propertycache |
|
119 | @propertycache | |
120 | def manifest(self): |
|
120 | def manifest(self): | |
121 | return manifest.manifest(self.sopener) |
|
121 | return manifest.manifest(self.sopener) | |
122 |
|
122 | |||
123 | @propertycache |
|
123 | @propertycache | |
124 | def dirstate(self): |
|
124 | def dirstate(self): | |
125 | return dirstate.dirstate(self.opener, self.ui, self.root) |
|
125 | return dirstate.dirstate(self.opener, self.ui, self.root) | |
126 |
|
126 | |||
127 | def __getitem__(self, changeid): |
|
127 | def __getitem__(self, changeid): | |
128 | if changeid is None: |
|
128 | if changeid is None: | |
129 | return context.workingctx(self) |
|
129 | return context.workingctx(self) | |
130 | return context.changectx(self, changeid) |
|
130 | return context.changectx(self, changeid) | |
131 |
|
131 | |||
132 | def __contains__(self, changeid): |
|
132 | def __contains__(self, changeid): | |
133 | try: |
|
133 | try: | |
134 | return bool(self.lookup(changeid)) |
|
134 | return bool(self.lookup(changeid)) | |
135 | except error.RepoLookupError: |
|
135 | except error.RepoLookupError: | |
136 | return False |
|
136 | return False | |
137 |
|
137 | |||
138 | def __nonzero__(self): |
|
138 | def __nonzero__(self): | |
139 | return True |
|
139 | return True | |
140 |
|
140 | |||
141 | def __len__(self): |
|
141 | def __len__(self): | |
142 | return len(self.changelog) |
|
142 | return len(self.changelog) | |
143 |
|
143 | |||
144 | def __iter__(self): |
|
144 | def __iter__(self): | |
145 | for i in xrange(len(self)): |
|
145 | for i in xrange(len(self)): | |
146 | yield i |
|
146 | yield i | |
147 |
|
147 | |||
148 | def url(self): |
|
148 | def url(self): | |
149 | return 'file:' + self.root |
|
149 | return 'file:' + self.root | |
150 |
|
150 | |||
151 | def hook(self, name, throw=False, **args): |
|
151 | def hook(self, name, throw=False, **args): | |
152 | return hook.hook(self.ui, self, name, throw, **args) |
|
152 | return hook.hook(self.ui, self, name, throw, **args) | |
153 |
|
153 | |||
154 | tag_disallowed = ':\r\n' |
|
154 | tag_disallowed = ':\r\n' | |
155 |
|
155 | |||
156 | def _tag(self, names, node, message, local, user, date, extra={}): |
|
156 | def _tag(self, names, node, message, local, user, date, extra={}): | |
157 | if isinstance(names, str): |
|
157 | if isinstance(names, str): | |
158 | allchars = names |
|
158 | allchars = names | |
159 | names = (names,) |
|
159 | names = (names,) | |
160 | else: |
|
160 | else: | |
161 | allchars = ''.join(names) |
|
161 | allchars = ''.join(names) | |
162 | for c in self.tag_disallowed: |
|
162 | for c in self.tag_disallowed: | |
163 | if c in allchars: |
|
163 | if c in allchars: | |
164 | raise util.Abort(_('%r cannot be used in a tag name') % c) |
|
164 | raise util.Abort(_('%r cannot be used in a tag name') % c) | |
165 |
|
165 | |||
166 | for name in names: |
|
166 | for name in names: | |
167 | self.hook('pretag', throw=True, node=hex(node), tag=name, |
|
167 | self.hook('pretag', throw=True, node=hex(node), tag=name, | |
168 | local=local) |
|
168 | local=local) | |
169 |
|
169 | |||
170 | def writetags(fp, names, munge, prevtags): |
|
170 | def writetags(fp, names, munge, prevtags): | |
171 | fp.seek(0, 2) |
|
171 | fp.seek(0, 2) | |
172 | if prevtags and prevtags[-1] != '\n': |
|
172 | if prevtags and prevtags[-1] != '\n': | |
173 | fp.write('\n') |
|
173 | fp.write('\n') | |
174 | for name in names: |
|
174 | for name in names: | |
175 | m = munge and munge(name) or name |
|
175 | m = munge and munge(name) or name | |
176 | if self._tagtypes and name in self._tagtypes: |
|
176 | if self._tagtypes and name in self._tagtypes: | |
177 | old = self._tags.get(name, nullid) |
|
177 | old = self._tags.get(name, nullid) | |
178 | fp.write('%s %s\n' % (hex(old), m)) |
|
178 | fp.write('%s %s\n' % (hex(old), m)) | |
179 | fp.write('%s %s\n' % (hex(node), m)) |
|
179 | fp.write('%s %s\n' % (hex(node), m)) | |
180 | fp.close() |
|
180 | fp.close() | |
181 |
|
181 | |||
182 | prevtags = '' |
|
182 | prevtags = '' | |
183 | if local: |
|
183 | if local: | |
184 | try: |
|
184 | try: | |
185 | fp = self.opener('localtags', 'r+') |
|
185 | fp = self.opener('localtags', 'r+') | |
186 | except IOError: |
|
186 | except IOError: | |
187 | fp = self.opener('localtags', 'a') |
|
187 | fp = self.opener('localtags', 'a') | |
188 | else: |
|
188 | else: | |
189 | prevtags = fp.read() |
|
189 | prevtags = fp.read() | |
190 |
|
190 | |||
191 | # local tags are stored in the current charset |
|
191 | # local tags are stored in the current charset | |
192 | writetags(fp, names, None, prevtags) |
|
192 | writetags(fp, names, None, prevtags) | |
193 | for name in names: |
|
193 | for name in names: | |
194 | self.hook('tag', node=hex(node), tag=name, local=local) |
|
194 | self.hook('tag', node=hex(node), tag=name, local=local) | |
195 | return |
|
195 | return | |
196 |
|
196 | |||
197 | try: |
|
197 | try: | |
198 | fp = self.wfile('.hgtags', 'rb+') |
|
198 | fp = self.wfile('.hgtags', 'rb+') | |
199 | except IOError: |
|
199 | except IOError: | |
200 | fp = self.wfile('.hgtags', 'ab') |
|
200 | fp = self.wfile('.hgtags', 'ab') | |
201 | else: |
|
201 | else: | |
202 | prevtags = fp.read() |
|
202 | prevtags = fp.read() | |
203 |
|
203 | |||
204 | # committed tags are stored in UTF-8 |
|
204 | # committed tags are stored in UTF-8 | |
205 | writetags(fp, names, encoding.fromlocal, prevtags) |
|
205 | writetags(fp, names, encoding.fromlocal, prevtags) | |
206 |
|
206 | |||
207 | if '.hgtags' not in self.dirstate: |
|
207 | if '.hgtags' not in self.dirstate: | |
208 | self.add(['.hgtags']) |
|
208 | self.add(['.hgtags']) | |
209 |
|
209 | |||
210 | m = match_.exact(self.root, '', ['.hgtags']) |
|
210 | m = match_.exact(self.root, '', ['.hgtags']) | |
211 | tagnode = self.commit(message, user, date, extra=extra, match=m) |
|
211 | tagnode = self.commit(message, user, date, extra=extra, match=m) | |
212 |
|
212 | |||
213 | for name in names: |
|
213 | for name in names: | |
214 | self.hook('tag', node=hex(node), tag=name, local=local) |
|
214 | self.hook('tag', node=hex(node), tag=name, local=local) | |
215 |
|
215 | |||
216 | return tagnode |
|
216 | return tagnode | |
217 |
|
217 | |||
218 | def tag(self, names, node, message, local, user, date): |
|
218 | def tag(self, names, node, message, local, user, date): | |
219 | '''tag a revision with one or more symbolic names. |
|
219 | '''tag a revision with one or more symbolic names. | |
220 |
|
220 | |||
221 | names is a list of strings or, when adding a single tag, names may be a |
|
221 | names is a list of strings or, when adding a single tag, names may be a | |
222 | string. |
|
222 | string. | |
223 |
|
223 | |||
224 | if local is True, the tags are stored in a per-repository file. |
|
224 | if local is True, the tags are stored in a per-repository file. | |
225 | otherwise, they are stored in the .hgtags file, and a new |
|
225 | otherwise, they are stored in the .hgtags file, and a new | |
226 | changeset is committed with the change. |
|
226 | changeset is committed with the change. | |
227 |
|
227 | |||
228 | keyword arguments: |
|
228 | keyword arguments: | |
229 |
|
229 | |||
230 | local: whether to store tags in non-version-controlled file |
|
230 | local: whether to store tags in non-version-controlled file | |
231 | (default False) |
|
231 | (default False) | |
232 |
|
232 | |||
233 | message: commit message to use if committing |
|
233 | message: commit message to use if committing | |
234 |
|
234 | |||
235 | user: name of user to use if committing |
|
235 | user: name of user to use if committing | |
236 |
|
236 | |||
237 | date: date tuple to use if committing''' |
|
237 | date: date tuple to use if committing''' | |
238 |
|
238 | |||
239 | for x in self.status()[:5]: |
|
239 | for x in self.status()[:5]: | |
240 | if '.hgtags' in x: |
|
240 | if '.hgtags' in x: | |
241 | raise util.Abort(_('working copy of .hgtags is changed ' |
|
241 | raise util.Abort(_('working copy of .hgtags is changed ' | |
242 | '(please commit .hgtags manually)')) |
|
242 | '(please commit .hgtags manually)')) | |
243 |
|
243 | |||
244 | self.tags() # instantiate the cache |
|
244 | self.tags() # instantiate the cache | |
245 | self._tag(names, node, message, local, user, date) |
|
245 | self._tag(names, node, message, local, user, date) | |
246 |
|
246 | |||
247 | def tags(self): |
|
247 | def tags(self): | |
248 | '''return a mapping of tag to node''' |
|
248 | '''return a mapping of tag to node''' | |
249 | if self._tags is None: |
|
249 | if self._tags is None: | |
250 | (self._tags, self._tagtypes) = self._findtags() |
|
250 | (self._tags, self._tagtypes) = self._findtags() | |
251 |
|
251 | |||
252 | return self._tags |
|
252 | return self._tags | |
253 |
|
253 | |||
254 | def _findtags(self): |
|
254 | def _findtags(self): | |
255 | '''Do the hard work of finding tags. Return a pair of dicts |
|
255 | '''Do the hard work of finding tags. Return a pair of dicts | |
256 | (tags, tagtypes) where tags maps tag name to node, and tagtypes |
|
256 | (tags, tagtypes) where tags maps tag name to node, and tagtypes | |
257 | maps tag name to a string like \'global\' or \'local\'. |
|
257 | maps tag name to a string like \'global\' or \'local\'. | |
258 | Subclasses or extensions are free to add their own tags, but |
|
258 | Subclasses or extensions are free to add their own tags, but | |
259 | should be aware that the returned dicts will be retained for the |
|
259 | should be aware that the returned dicts will be retained for the | |
260 | duration of the localrepo object.''' |
|
260 | duration of the localrepo object.''' | |
261 |
|
261 | |||
262 | # XXX what tagtype should subclasses/extensions use? Currently |
|
262 | # XXX what tagtype should subclasses/extensions use? Currently | |
263 | # mq and bookmarks add tags, but do not set the tagtype at all. |
|
263 | # mq and bookmarks add tags, but do not set the tagtype at all. | |
264 | # Should each extension invent its own tag type? Should there |
|
264 | # Should each extension invent its own tag type? Should there | |
265 | # be one tagtype for all such "virtual" tags? Or is the status |
|
265 | # be one tagtype for all such "virtual" tags? Or is the status | |
266 | # quo fine? |
|
266 | # quo fine? | |
267 |
|
267 | |||
268 | alltags = {} # map tag name to (node, hist) |
|
268 | alltags = {} # map tag name to (node, hist) | |
269 | tagtypes = {} |
|
269 | tagtypes = {} | |
270 |
|
270 | |||
271 | tags_.findglobaltags(self.ui, self, alltags, tagtypes) |
|
271 | tags_.findglobaltags(self.ui, self, alltags, tagtypes) | |
272 | tags_.readlocaltags(self.ui, self, alltags, tagtypes) |
|
272 | tags_.readlocaltags(self.ui, self, alltags, tagtypes) | |
273 |
|
273 | |||
274 | # Build the return dicts. Have to re-encode tag names because |
|
274 | # Build the return dicts. Have to re-encode tag names because | |
275 | # the tags module always uses UTF-8 (in order not to lose info |
|
275 | # the tags module always uses UTF-8 (in order not to lose info | |
276 | # writing to the cache), but the rest of Mercurial wants them in |
|
276 | # writing to the cache), but the rest of Mercurial wants them in | |
277 | # local encoding. |
|
277 | # local encoding. | |
278 | tags = {} |
|
278 | tags = {} | |
279 | for (name, (node, hist)) in alltags.iteritems(): |
|
279 | for (name, (node, hist)) in alltags.iteritems(): | |
280 | if node != nullid: |
|
280 | if node != nullid: | |
281 | tags[encoding.tolocal(name)] = node |
|
281 | tags[encoding.tolocal(name)] = node | |
282 | tags['tip'] = self.changelog.tip() |
|
282 | tags['tip'] = self.changelog.tip() | |
283 | tagtypes = dict([(encoding.tolocal(name), value) |
|
283 | tagtypes = dict([(encoding.tolocal(name), value) | |
284 | for (name, value) in tagtypes.iteritems()]) |
|
284 | for (name, value) in tagtypes.iteritems()]) | |
285 | return (tags, tagtypes) |
|
285 | return (tags, tagtypes) | |
286 |
|
286 | |||
287 | def tagtype(self, tagname): |
|
287 | def tagtype(self, tagname): | |
288 | ''' |
|
288 | ''' | |
289 | return the type of the given tag. result can be: |
|
289 | return the type of the given tag. result can be: | |
290 |
|
290 | |||
291 | 'local' : a local tag |
|
291 | 'local' : a local tag | |
292 | 'global' : a global tag |
|
292 | 'global' : a global tag | |
293 | None : tag does not exist |
|
293 | None : tag does not exist | |
294 | ''' |
|
294 | ''' | |
295 |
|
295 | |||
296 | self.tags() |
|
296 | self.tags() | |
297 |
|
297 | |||
298 | return self._tagtypes.get(tagname) |
|
298 | return self._tagtypes.get(tagname) | |
299 |
|
299 | |||
300 | def tagslist(self): |
|
300 | def tagslist(self): | |
301 | '''return a list of tags ordered by revision''' |
|
301 | '''return a list of tags ordered by revision''' | |
302 | l = [] |
|
302 | l = [] | |
303 | for t, n in self.tags().iteritems(): |
|
303 | for t, n in self.tags().iteritems(): | |
304 | try: |
|
304 | try: | |
305 | r = self.changelog.rev(n) |
|
305 | r = self.changelog.rev(n) | |
306 | except: |
|
306 | except: | |
307 | r = -2 # sort to the beginning of the list if unknown |
|
307 | r = -2 # sort to the beginning of the list if unknown | |
308 | l.append((r, t, n)) |
|
308 | l.append((r, t, n)) | |
309 | return [(t, n) for r, t, n in sorted(l)] |
|
309 | return [(t, n) for r, t, n in sorted(l)] | |
310 |
|
310 | |||
311 | def nodetags(self, node): |
|
311 | def nodetags(self, node): | |
312 | '''return the tags associated with a node''' |
|
312 | '''return the tags associated with a node''' | |
313 | if not self.nodetagscache: |
|
313 | if not self.nodetagscache: | |
314 | self.nodetagscache = {} |
|
314 | self.nodetagscache = {} | |
315 | for t, n in self.tags().iteritems(): |
|
315 | for t, n in self.tags().iteritems(): | |
316 | self.nodetagscache.setdefault(n, []).append(t) |
|
316 | self.nodetagscache.setdefault(n, []).append(t) | |
317 | return self.nodetagscache.get(node, []) |
|
317 | return self.nodetagscache.get(node, []) | |
318 |
|
318 | |||
319 | def _branchtags(self, partial, lrev): |
|
319 | def _branchtags(self, partial, lrev): | |
320 | # TODO: rename this function? |
|
320 | # TODO: rename this function? | |
321 | tiprev = len(self) - 1 |
|
321 | tiprev = len(self) - 1 | |
322 | if lrev != tiprev: |
|
322 | if lrev != tiprev: | |
323 | self._updatebranchcache(partial, lrev + 1, tiprev + 1) |
|
323 | self._updatebranchcache(partial, lrev + 1, tiprev + 1) | |
324 | self._writebranchcache(partial, self.changelog.tip(), tiprev) |
|
324 | self._writebranchcache(partial, self.changelog.tip(), tiprev) | |
325 |
|
325 | |||
326 | return partial |
|
326 | return partial | |
327 |
|
327 | |||
328 | def branchmap(self): |
|
328 | def branchmap(self): | |
329 | '''returns a dictionary {branch: [branchheads]}''' |
|
329 | '''returns a dictionary {branch: [branchheads]}''' | |
330 | tip = self.changelog.tip() |
|
330 | tip = self.changelog.tip() | |
331 | if self._branchcache is not None and self._branchcachetip == tip: |
|
331 | if self._branchcache is not None and self._branchcachetip == tip: | |
332 | return self._branchcache |
|
332 | return self._branchcache | |
333 |
|
333 | |||
334 | oldtip = self._branchcachetip |
|
334 | oldtip = self._branchcachetip | |
335 | self._branchcachetip = tip |
|
335 | self._branchcachetip = tip | |
336 | if oldtip is None or oldtip not in self.changelog.nodemap: |
|
336 | if oldtip is None or oldtip not in self.changelog.nodemap: | |
337 | partial, last, lrev = self._readbranchcache() |
|
337 | partial, last, lrev = self._readbranchcache() | |
338 | else: |
|
338 | else: | |
339 | lrev = self.changelog.rev(oldtip) |
|
339 | lrev = self.changelog.rev(oldtip) | |
340 | partial = self._branchcache |
|
340 | partial = self._branchcache | |
341 |
|
341 | |||
342 | self._branchtags(partial, lrev) |
|
342 | self._branchtags(partial, lrev) | |
343 | # this private cache holds all heads (not just tips) |
|
343 | # this private cache holds all heads (not just tips) | |
344 | self._branchcache = partial |
|
344 | self._branchcache = partial | |
345 |
|
345 | |||
346 | return self._branchcache |
|
346 | return self._branchcache | |
347 |
|
347 | |||
348 | def branchtags(self): |
|
348 | def branchtags(self): | |
349 | '''return a dict where branch names map to the tipmost head of |
|
349 | '''return a dict where branch names map to the tipmost head of | |
350 | the branch, open heads come before closed''' |
|
350 | the branch, open heads come before closed''' | |
351 | bt = {} |
|
351 | bt = {} | |
352 | for bn, heads in self.branchmap().iteritems(): |
|
352 | for bn, heads in self.branchmap().iteritems(): | |
353 | head = None |
|
353 | head = None | |
354 | for i in range(len(heads)-1, -1, -1): |
|
354 | for i in range(len(heads)-1, -1, -1): | |
355 | h = heads[i] |
|
355 | h = heads[i] | |
356 | if 'close' not in self.changelog.read(h)[5]: |
|
356 | if 'close' not in self.changelog.read(h)[5]: | |
357 | head = h |
|
357 | head = h | |
358 | break |
|
358 | break | |
359 | # no open heads were found |
|
359 | # no open heads were found | |
360 | if head is None: |
|
360 | if head is None: | |
361 | head = heads[-1] |
|
361 | head = heads[-1] | |
362 | bt[bn] = head |
|
362 | bt[bn] = head | |
363 | return bt |
|
363 | return bt | |
364 |
|
364 | |||
365 |
|
365 | |||
366 | def _readbranchcache(self): |
|
366 | def _readbranchcache(self): | |
367 | partial = {} |
|
367 | partial = {} | |
368 | try: |
|
368 | try: | |
369 | f = self.opener("branchheads.cache") |
|
369 | f = self.opener("branchheads.cache") | |
370 | lines = f.read().split('\n') |
|
370 | lines = f.read().split('\n') | |
371 | f.close() |
|
371 | f.close() | |
372 | except (IOError, OSError): |
|
372 | except (IOError, OSError): | |
373 | return {}, nullid, nullrev |
|
373 | return {}, nullid, nullrev | |
374 |
|
374 | |||
375 | try: |
|
375 | try: | |
376 | last, lrev = lines.pop(0).split(" ", 1) |
|
376 | last, lrev = lines.pop(0).split(" ", 1) | |
377 | last, lrev = bin(last), int(lrev) |
|
377 | last, lrev = bin(last), int(lrev) | |
378 | if lrev >= len(self) or self[lrev].node() != last: |
|
378 | if lrev >= len(self) or self[lrev].node() != last: | |
379 | # invalidate the cache |
|
379 | # invalidate the cache | |
380 | raise ValueError('invalidating branch cache (tip differs)') |
|
380 | raise ValueError('invalidating branch cache (tip differs)') | |
381 | for l in lines: |
|
381 | for l in lines: | |
382 | if not l: |
|
382 | if not l: | |
383 | continue |
|
383 | continue | |
384 | node, label = l.split(" ", 1) |
|
384 | node, label = l.split(" ", 1) | |
385 | partial.setdefault(label.strip(), []).append(bin(node)) |
|
385 | partial.setdefault(label.strip(), []).append(bin(node)) | |
386 | except KeyboardInterrupt: |
|
386 | except KeyboardInterrupt: | |
387 | raise |
|
387 | raise | |
388 | except Exception, inst: |
|
388 | except Exception, inst: | |
389 | if self.ui.debugflag: |
|
389 | if self.ui.debugflag: | |
390 | self.ui.warn(str(inst), '\n') |
|
390 | self.ui.warn(str(inst), '\n') | |
391 | partial, last, lrev = {}, nullid, nullrev |
|
391 | partial, last, lrev = {}, nullid, nullrev | |
392 | return partial, last, lrev |
|
392 | return partial, last, lrev | |
393 |
|
393 | |||
394 | def _writebranchcache(self, branches, tip, tiprev): |
|
394 | def _writebranchcache(self, branches, tip, tiprev): | |
395 | try: |
|
395 | try: | |
396 | f = self.opener("branchheads.cache", "w", atomictemp=True) |
|
396 | f = self.opener("branchheads.cache", "w", atomictemp=True) | |
397 | f.write("%s %s\n" % (hex(tip), tiprev)) |
|
397 | f.write("%s %s\n" % (hex(tip), tiprev)) | |
398 | for label, nodes in branches.iteritems(): |
|
398 | for label, nodes in branches.iteritems(): | |
399 | for node in nodes: |
|
399 | for node in nodes: | |
400 | f.write("%s %s\n" % (hex(node), label)) |
|
400 | f.write("%s %s\n" % (hex(node), label)) | |
401 | f.rename() |
|
401 | f.rename() | |
402 | except (IOError, OSError): |
|
402 | except (IOError, OSError): | |
403 | pass |
|
403 | pass | |
404 |
|
404 | |||
405 | def _updatebranchcache(self, partial, start, end): |
|
405 | def _updatebranchcache(self, partial, start, end): | |
406 | # collect new branch entries |
|
406 | # collect new branch entries | |
407 | newbranches = {} |
|
407 | newbranches = {} | |
408 | for r in xrange(start, end): |
|
408 | for r in xrange(start, end): | |
409 | c = self[r] |
|
409 | c = self[r] | |
410 | newbranches.setdefault(c.branch(), []).append(c.node()) |
|
410 | newbranches.setdefault(c.branch(), []).append(c.node()) | |
411 | # if older branchheads are reachable from new ones, they aren't |
|
411 | # if older branchheads are reachable from new ones, they aren't | |
412 | # really branchheads. Note checking parents is insufficient: |
|
412 | # really branchheads. Note checking parents is insufficient: | |
413 | # 1 (branch a) -> 2 (branch b) -> 3 (branch a) |
|
413 | # 1 (branch a) -> 2 (branch b) -> 3 (branch a) | |
414 | for branch, newnodes in newbranches.iteritems(): |
|
414 | for branch, newnodes in newbranches.iteritems(): | |
415 | bheads = partial.setdefault(branch, []) |
|
415 | bheads = partial.setdefault(branch, []) | |
416 | bheads.extend(newnodes) |
|
416 | bheads.extend(newnodes) | |
417 | if len(bheads) < 2: |
|
417 | if len(bheads) < 2: | |
418 | continue |
|
418 | continue | |
419 | newbheads = [] |
|
419 | newbheads = [] | |
420 | # starting from tip means fewer passes over reachable |
|
420 | # starting from tip means fewer passes over reachable | |
421 | while newnodes: |
|
421 | while newnodes: | |
422 | latest = newnodes.pop() |
|
422 | latest = newnodes.pop() | |
423 | if latest not in bheads: |
|
423 | if latest not in bheads: | |
424 | continue |
|
424 | continue | |
425 | minbhrev = self[min([self[bh].rev() for bh in bheads])].node() |
|
425 | minbhrev = self[min([self[bh].rev() for bh in bheads])].node() | |
426 | reachable = self.changelog.reachable(latest, minbhrev) |
|
426 | reachable = self.changelog.reachable(latest, minbhrev) | |
427 | bheads = [b for b in bheads if b not in reachable] |
|
427 | bheads = [b for b in bheads if b not in reachable] | |
428 | newbheads.insert(0, latest) |
|
428 | newbheads.insert(0, latest) | |
429 | bheads.extend(newbheads) |
|
429 | bheads.extend(newbheads) | |
430 | partial[branch] = bheads |
|
430 | partial[branch] = bheads | |
431 |
|
431 | |||
432 | def lookup(self, key): |
|
432 | def lookup(self, key): | |
433 | if isinstance(key, int): |
|
433 | if isinstance(key, int): | |
434 | return self.changelog.node(key) |
|
434 | return self.changelog.node(key) | |
435 | elif key == '.': |
|
435 | elif key == '.': | |
436 | return self.dirstate.parents()[0] |
|
436 | return self.dirstate.parents()[0] | |
437 | elif key == 'null': |
|
437 | elif key == 'null': | |
438 | return nullid |
|
438 | return nullid | |
439 | elif key == 'tip': |
|
439 | elif key == 'tip': | |
440 | return self.changelog.tip() |
|
440 | return self.changelog.tip() | |
441 | n = self.changelog._match(key) |
|
441 | n = self.changelog._match(key) | |
442 | if n: |
|
442 | if n: | |
443 | return n |
|
443 | return n | |
444 | if key in self.tags(): |
|
444 | if key in self.tags(): | |
445 | return self.tags()[key] |
|
445 | return self.tags()[key] | |
446 | if key in self.branchtags(): |
|
446 | if key in self.branchtags(): | |
447 | return self.branchtags()[key] |
|
447 | return self.branchtags()[key] | |
448 | n = self.changelog._partialmatch(key) |
|
448 | n = self.changelog._partialmatch(key) | |
449 | if n: |
|
449 | if n: | |
450 | return n |
|
450 | return n | |
451 |
|
451 | |||
452 | # can't find key, check if it might have come from damaged dirstate |
|
452 | # can't find key, check if it might have come from damaged dirstate | |
453 | if key in self.dirstate.parents(): |
|
453 | if key in self.dirstate.parents(): | |
454 | raise error.Abort(_("working directory has unknown parent '%s'!") |
|
454 | raise error.Abort(_("working directory has unknown parent '%s'!") | |
455 | % short(key)) |
|
455 | % short(key)) | |
456 | try: |
|
456 | try: | |
457 | if len(key) == 20: |
|
457 | if len(key) == 20: | |
458 | key = hex(key) |
|
458 | key = hex(key) | |
459 | except: |
|
459 | except: | |
460 | pass |
|
460 | pass | |
461 | raise error.RepoLookupError(_("unknown revision '%s'") % key) |
|
461 | raise error.RepoLookupError(_("unknown revision '%s'") % key) | |
462 |
|
462 | |||
463 | def local(self): |
|
463 | def local(self): | |
464 | return True |
|
464 | return True | |
465 |
|
465 | |||
466 | def join(self, f): |
|
466 | def join(self, f): | |
467 | return os.path.join(self.path, f) |
|
467 | return os.path.join(self.path, f) | |
468 |
|
468 | |||
469 | def wjoin(self, f): |
|
469 | def wjoin(self, f): | |
470 | return os.path.join(self.root, f) |
|
470 | return os.path.join(self.root, f) | |
471 |
|
471 | |||
472 | def rjoin(self, f): |
|
472 | def rjoin(self, f): | |
473 | return os.path.join(self.root, util.pconvert(f)) |
|
473 | return os.path.join(self.root, util.pconvert(f)) | |
474 |
|
474 | |||
475 | def file(self, f): |
|
475 | def file(self, f): | |
476 | if f[0] == '/': |
|
476 | if f[0] == '/': | |
477 | f = f[1:] |
|
477 | f = f[1:] | |
478 | return filelog.filelog(self.sopener, f) |
|
478 | return filelog.filelog(self.sopener, f) | |
479 |
|
479 | |||
480 | def changectx(self, changeid): |
|
480 | def changectx(self, changeid): | |
481 | return self[changeid] |
|
481 | return self[changeid] | |
482 |
|
482 | |||
483 | def parents(self, changeid=None): |
|
483 | def parents(self, changeid=None): | |
484 | '''get list of changectxs for parents of changeid''' |
|
484 | '''get list of changectxs for parents of changeid''' | |
485 | return self[changeid].parents() |
|
485 | return self[changeid].parents() | |
486 |
|
486 | |||
487 | def filectx(self, path, changeid=None, fileid=None): |
|
487 | def filectx(self, path, changeid=None, fileid=None): | |
488 | """changeid can be a changeset revision, node, or tag. |
|
488 | """changeid can be a changeset revision, node, or tag. | |
489 | fileid can be a file revision or node.""" |
|
489 | fileid can be a file revision or node.""" | |
490 | return context.filectx(self, path, changeid, fileid) |
|
490 | return context.filectx(self, path, changeid, fileid) | |
491 |
|
491 | |||
492 | def getcwd(self): |
|
492 | def getcwd(self): | |
493 | return self.dirstate.getcwd() |
|
493 | return self.dirstate.getcwd() | |
494 |
|
494 | |||
495 | def pathto(self, f, cwd=None): |
|
495 | def pathto(self, f, cwd=None): | |
496 | return self.dirstate.pathto(f, cwd) |
|
496 | return self.dirstate.pathto(f, cwd) | |
497 |
|
497 | |||
498 | def wfile(self, f, mode='r'): |
|
498 | def wfile(self, f, mode='r'): | |
499 | return self.wopener(f, mode) |
|
499 | return self.wopener(f, mode) | |
500 |
|
500 | |||
501 | def _link(self, f): |
|
501 | def _link(self, f): | |
502 | return os.path.islink(self.wjoin(f)) |
|
502 | return os.path.islink(self.wjoin(f)) | |
503 |
|
503 | |||
504 | def _filter(self, filter, filename, data): |
|
504 | def _filter(self, filter, filename, data): | |
505 | if filter not in self.filterpats: |
|
505 | if filter not in self.filterpats: | |
506 | l = [] |
|
506 | l = [] | |
507 | for pat, cmd in self.ui.configitems(filter): |
|
507 | for pat, cmd in self.ui.configitems(filter): | |
508 | if cmd == '!': |
|
508 | if cmd == '!': | |
509 | continue |
|
509 | continue | |
510 | mf = match_.match(self.root, '', [pat]) |
|
510 | mf = match_.match(self.root, '', [pat]) | |
511 | fn = None |
|
511 | fn = None | |
512 | params = cmd |
|
512 | params = cmd | |
513 | for name, filterfn in self._datafilters.iteritems(): |
|
513 | for name, filterfn in self._datafilters.iteritems(): | |
514 | if cmd.startswith(name): |
|
514 | if cmd.startswith(name): | |
515 | fn = filterfn |
|
515 | fn = filterfn | |
516 | params = cmd[len(name):].lstrip() |
|
516 | params = cmd[len(name):].lstrip() | |
517 | break |
|
517 | break | |
518 | if not fn: |
|
518 | if not fn: | |
519 | fn = lambda s, c, **kwargs: util.filter(s, c) |
|
519 | fn = lambda s, c, **kwargs: util.filter(s, c) | |
520 | # Wrap old filters not supporting keyword arguments |
|
520 | # Wrap old filters not supporting keyword arguments | |
521 | if not inspect.getargspec(fn)[2]: |
|
521 | if not inspect.getargspec(fn)[2]: | |
522 | oldfn = fn |
|
522 | oldfn = fn | |
523 | fn = lambda s, c, **kwargs: oldfn(s, c) |
|
523 | fn = lambda s, c, **kwargs: oldfn(s, c) | |
524 | l.append((mf, fn, params)) |
|
524 | l.append((mf, fn, params)) | |
525 | self.filterpats[filter] = l |
|
525 | self.filterpats[filter] = l | |
526 |
|
526 | |||
527 | for mf, fn, cmd in self.filterpats[filter]: |
|
527 | for mf, fn, cmd in self.filterpats[filter]: | |
528 | if mf(filename): |
|
528 | if mf(filename): | |
529 | self.ui.debug("filtering %s through %s\n" % (filename, cmd)) |
|
529 | self.ui.debug("filtering %s through %s\n" % (filename, cmd)) | |
530 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) |
|
530 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) | |
531 | break |
|
531 | break | |
532 |
|
532 | |||
533 | return data |
|
533 | return data | |
534 |
|
534 | |||
535 | def adddatafilter(self, name, filter): |
|
535 | def adddatafilter(self, name, filter): | |
536 | self._datafilters[name] = filter |
|
536 | self._datafilters[name] = filter | |
537 |
|
537 | |||
538 | def wread(self, filename): |
|
538 | def wread(self, filename): | |
539 | if self._link(filename): |
|
539 | if self._link(filename): | |
540 | data = os.readlink(self.wjoin(filename)) |
|
540 | data = os.readlink(self.wjoin(filename)) | |
541 | else: |
|
541 | else: | |
542 | data = self.wopener(filename, 'r').read() |
|
542 | data = self.wopener(filename, 'r').read() | |
543 | return self._filter("encode", filename, data) |
|
543 | return self._filter("encode", filename, data) | |
544 |
|
544 | |||
545 | def wwrite(self, filename, data, flags): |
|
545 | def wwrite(self, filename, data, flags): | |
546 | data = self._filter("decode", filename, data) |
|
546 | data = self._filter("decode", filename, data) | |
547 | try: |
|
547 | try: | |
548 | os.unlink(self.wjoin(filename)) |
|
548 | os.unlink(self.wjoin(filename)) | |
549 | except OSError: |
|
549 | except OSError: | |
550 | pass |
|
550 | pass | |
551 | if 'l' in flags: |
|
551 | if 'l' in flags: | |
552 | self.wopener.symlink(data, filename) |
|
552 | self.wopener.symlink(data, filename) | |
553 | else: |
|
553 | else: | |
554 | self.wopener(filename, 'w').write(data) |
|
554 | self.wopener(filename, 'w').write(data) | |
555 | if 'x' in flags: |
|
555 | if 'x' in flags: | |
556 | util.set_flags(self.wjoin(filename), False, True) |
|
556 | util.set_flags(self.wjoin(filename), False, True) | |
557 |
|
557 | |||
558 | def wwritedata(self, filename, data): |
|
558 | def wwritedata(self, filename, data): | |
559 | return self._filter("decode", filename, data) |
|
559 | return self._filter("decode", filename, data) | |
560 |
|
560 | |||
561 | def transaction(self): |
|
561 | def transaction(self): | |
562 | tr = self._transref and self._transref() or None |
|
562 | tr = self._transref and self._transref() or None | |
563 | if tr and tr.running(): |
|
563 | if tr and tr.running(): | |
564 | return tr.nest() |
|
564 | return tr.nest() | |
565 |
|
565 | |||
566 | # abort here if the journal already exists |
|
566 | # abort here if the journal already exists | |
567 | if os.path.exists(self.sjoin("journal")): |
|
567 | if os.path.exists(self.sjoin("journal")): | |
568 | raise error.RepoError( |
|
568 | raise error.RepoError( | |
569 | _("abandoned transaction found - run hg recover")) |
|
569 | _("abandoned transaction found - run hg recover")) | |
570 |
|
570 | |||
571 | # save dirstate for rollback |
|
571 | # save dirstate for rollback | |
572 | try: |
|
572 | try: | |
573 | ds = self.opener("dirstate").read() |
|
573 | ds = self.opener("dirstate").read() | |
574 | except IOError: |
|
574 | except IOError: | |
575 | ds = "" |
|
575 | ds = "" | |
576 | self.opener("journal.dirstate", "w").write(ds) |
|
576 | self.opener("journal.dirstate", "w").write(ds) | |
577 | self.opener("journal.branch", "w").write(self.dirstate.branch()) |
|
577 | self.opener("journal.branch", "w").write(self.dirstate.branch()) | |
578 |
|
578 | |||
579 | renames = [(self.sjoin("journal"), self.sjoin("undo")), |
|
579 | renames = [(self.sjoin("journal"), self.sjoin("undo")), | |
580 | (self.join("journal.dirstate"), self.join("undo.dirstate")), |
|
580 | (self.join("journal.dirstate"), self.join("undo.dirstate")), | |
581 | (self.join("journal.branch"), self.join("undo.branch"))] |
|
581 | (self.join("journal.branch"), self.join("undo.branch"))] | |
582 | tr = transaction.transaction(self.ui.warn, self.sopener, |
|
582 | tr = transaction.transaction(self.ui.warn, self.sopener, | |
583 | self.sjoin("journal"), |
|
583 | self.sjoin("journal"), | |
584 | aftertrans(renames), |
|
584 | aftertrans(renames), | |
585 | self.store.createmode) |
|
585 | self.store.createmode) | |
586 | self._transref = weakref.ref(tr) |
|
586 | self._transref = weakref.ref(tr) | |
587 | return tr |
|
587 | return tr | |
588 |
|
588 | |||
589 | def recover(self): |
|
589 | def recover(self): | |
590 | lock = self.lock() |
|
590 | lock = self.lock() | |
591 | try: |
|
591 | try: | |
592 | if os.path.exists(self.sjoin("journal")): |
|
592 | if os.path.exists(self.sjoin("journal")): | |
593 | self.ui.status(_("rolling back interrupted transaction\n")) |
|
593 | self.ui.status(_("rolling back interrupted transaction\n")) | |
594 | transaction.rollback(self.sopener, self.sjoin("journal"), |
|
594 | transaction.rollback(self.sopener, self.sjoin("journal"), | |
595 | self.ui.warn) |
|
595 | self.ui.warn) | |
596 | self.invalidate() |
|
596 | self.invalidate() | |
597 | return True |
|
597 | return True | |
598 | else: |
|
598 | else: | |
599 | self.ui.warn(_("no interrupted transaction available\n")) |
|
599 | self.ui.warn(_("no interrupted transaction available\n")) | |
600 | return False |
|
600 | return False | |
601 | finally: |
|
601 | finally: | |
602 | lock.release() |
|
602 | lock.release() | |
603 |
|
603 | |||
604 | def rollback(self): |
|
604 | def rollback(self): | |
605 | wlock = lock = None |
|
605 | wlock = lock = None | |
606 | try: |
|
606 | try: | |
607 | wlock = self.wlock() |
|
607 | wlock = self.wlock() | |
608 | lock = self.lock() |
|
608 | lock = self.lock() | |
609 | if os.path.exists(self.sjoin("undo")): |
|
609 | if os.path.exists(self.sjoin("undo")): | |
610 | self.ui.status(_("rolling back last transaction\n")) |
|
610 | self.ui.status(_("rolling back last transaction\n")) | |
611 | transaction.rollback(self.sopener, self.sjoin("undo"), |
|
611 | transaction.rollback(self.sopener, self.sjoin("undo"), | |
612 | self.ui.warn) |
|
612 | self.ui.warn) | |
613 | util.rename(self.join("undo.dirstate"), self.join("dirstate")) |
|
613 | util.rename(self.join("undo.dirstate"), self.join("dirstate")) | |
614 | try: |
|
614 | try: | |
615 | branch = self.opener("undo.branch").read() |
|
615 | branch = self.opener("undo.branch").read() | |
616 | self.dirstate.setbranch(branch) |
|
616 | self.dirstate.setbranch(branch) | |
617 | except IOError: |
|
617 | except IOError: | |
618 | self.ui.warn(_("Named branch could not be reset, " |
|
618 | self.ui.warn(_("Named branch could not be reset, " | |
619 | "current branch still is: %s\n") |
|
619 | "current branch still is: %s\n") | |
620 | % encoding.tolocal(self.dirstate.branch())) |
|
620 | % encoding.tolocal(self.dirstate.branch())) | |
621 | self.invalidate() |
|
621 | self.invalidate() | |
622 | self.dirstate.invalidate() |
|
622 | self.dirstate.invalidate() | |
623 | self.destroyed() |
|
623 | self.destroyed() | |
624 | else: |
|
624 | else: | |
625 | self.ui.warn(_("no rollback information available\n")) |
|
625 | self.ui.warn(_("no rollback information available\n")) | |
626 | finally: |
|
626 | finally: | |
627 | release(lock, wlock) |
|
627 | release(lock, wlock) | |
628 |
|
628 | |||
629 | def invalidate(self): |
|
629 | def invalidate(self): | |
630 | for a in "changelog manifest".split(): |
|
630 | for a in "changelog manifest".split(): | |
631 | if a in self.__dict__: |
|
631 | if a in self.__dict__: | |
632 | delattr(self, a) |
|
632 | delattr(self, a) | |
633 | self._tags = None |
|
633 | self._tags = None | |
634 | self._tagtypes = None |
|
634 | self._tagtypes = None | |
635 | self.nodetagscache = None |
|
635 | self.nodetagscache = None | |
636 | self._branchcache = None # in UTF-8 |
|
636 | self._branchcache = None # in UTF-8 | |
637 | self._branchcachetip = None |
|
637 | self._branchcachetip = None | |
638 |
|
638 | |||
639 | def _lock(self, lockname, wait, releasefn, acquirefn, desc): |
|
639 | def _lock(self, lockname, wait, releasefn, acquirefn, desc): | |
640 | try: |
|
640 | try: | |
641 | l = lock.lock(lockname, 0, releasefn, desc=desc) |
|
641 | l = lock.lock(lockname, 0, releasefn, desc=desc) | |
642 | except error.LockHeld, inst: |
|
642 | except error.LockHeld, inst: | |
643 | if not wait: |
|
643 | if not wait: | |
644 | raise |
|
644 | raise | |
645 | self.ui.warn(_("waiting for lock on %s held by %r\n") % |
|
645 | self.ui.warn(_("waiting for lock on %s held by %r\n") % | |
646 | (desc, inst.locker)) |
|
646 | (desc, inst.locker)) | |
647 | # default to 600 seconds timeout |
|
647 | # default to 600 seconds timeout | |
648 | l = lock.lock(lockname, int(self.ui.config("ui", "timeout", "600")), |
|
648 | l = lock.lock(lockname, int(self.ui.config("ui", "timeout", "600")), | |
649 | releasefn, desc=desc) |
|
649 | releasefn, desc=desc) | |
650 | if acquirefn: |
|
650 | if acquirefn: | |
651 | acquirefn() |
|
651 | acquirefn() | |
652 | return l |
|
652 | return l | |
653 |
|
653 | |||
654 | def lock(self, wait=True): |
|
654 | def lock(self, wait=True): | |
655 | '''Lock the repository store (.hg/store) and return a weak reference |
|
655 | '''Lock the repository store (.hg/store) and return a weak reference | |
656 | to the lock. Use this before modifying the store (e.g. committing or |
|
656 | to the lock. Use this before modifying the store (e.g. committing or | |
657 | stripping). If you are opening a transaction, get a lock as well.)''' |
|
657 | stripping). If you are opening a transaction, get a lock as well.)''' | |
658 | l = self._lockref and self._lockref() |
|
658 | l = self._lockref and self._lockref() | |
659 | if l is not None and l.held: |
|
659 | if l is not None and l.held: | |
660 | l.lock() |
|
660 | l.lock() | |
661 | return l |
|
661 | return l | |
662 |
|
662 | |||
663 | l = self._lock(self.sjoin("lock"), wait, None, self.invalidate, |
|
663 | l = self._lock(self.sjoin("lock"), wait, None, self.invalidate, | |
664 | _('repository %s') % self.origroot) |
|
664 | _('repository %s') % self.origroot) | |
665 | self._lockref = weakref.ref(l) |
|
665 | self._lockref = weakref.ref(l) | |
666 | return l |
|
666 | return l | |
667 |
|
667 | |||
668 | def wlock(self, wait=True): |
|
668 | def wlock(self, wait=True): | |
669 | '''Lock the non-store parts of the repository (everything under |
|
669 | '''Lock the non-store parts of the repository (everything under | |
670 | .hg except .hg/store) and return a weak reference to the lock. |
|
670 | .hg except .hg/store) and return a weak reference to the lock. | |
671 | Use this before modifying files in .hg.''' |
|
671 | Use this before modifying files in .hg.''' | |
672 | l = self._wlockref and self._wlockref() |
|
672 | l = self._wlockref and self._wlockref() | |
673 | if l is not None and l.held: |
|
673 | if l is not None and l.held: | |
674 | l.lock() |
|
674 | l.lock() | |
675 | return l |
|
675 | return l | |
676 |
|
676 | |||
677 | l = self._lock(self.join("wlock"), wait, self.dirstate.write, |
|
677 | l = self._lock(self.join("wlock"), wait, self.dirstate.write, | |
678 | self.dirstate.invalidate, _('working directory of %s') % |
|
678 | self.dirstate.invalidate, _('working directory of %s') % | |
679 | self.origroot) |
|
679 | self.origroot) | |
680 | self._wlockref = weakref.ref(l) |
|
680 | self._wlockref = weakref.ref(l) | |
681 | return l |
|
681 | return l | |
682 |
|
682 | |||
683 | def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist): |
|
683 | def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist): | |
684 | """ |
|
684 | """ | |
685 | commit an individual file as part of a larger transaction |
|
685 | commit an individual file as part of a larger transaction | |
686 | """ |
|
686 | """ | |
687 |
|
687 | |||
688 | fname = fctx.path() |
|
688 | fname = fctx.path() | |
689 | text = fctx.data() |
|
689 | text = fctx.data() | |
690 | flog = self.file(fname) |
|
690 | flog = self.file(fname) | |
691 | fparent1 = manifest1.get(fname, nullid) |
|
691 | fparent1 = manifest1.get(fname, nullid) | |
692 | fparent2 = fparent2o = manifest2.get(fname, nullid) |
|
692 | fparent2 = fparent2o = manifest2.get(fname, nullid) | |
693 |
|
693 | |||
694 | meta = {} |
|
694 | meta = {} | |
695 | copy = fctx.renamed() |
|
695 | copy = fctx.renamed() | |
696 | if copy and copy[0] != fname: |
|
696 | if copy and copy[0] != fname: | |
697 | # Mark the new revision of this file as a copy of another |
|
697 | # Mark the new revision of this file as a copy of another | |
698 | # file. This copy data will effectively act as a parent |
|
698 | # file. This copy data will effectively act as a parent | |
699 | # of this new revision. If this is a merge, the first |
|
699 | # of this new revision. If this is a merge, the first | |
700 | # parent will be the nullid (meaning "look up the copy data") |
|
700 | # parent will be the nullid (meaning "look up the copy data") | |
701 | # and the second one will be the other parent. For example: |
|
701 | # and the second one will be the other parent. For example: | |
702 | # |
|
702 | # | |
703 | # 0 --- 1 --- 3 rev1 changes file foo |
|
703 | # 0 --- 1 --- 3 rev1 changes file foo | |
704 | # \ / rev2 renames foo to bar and changes it |
|
704 | # \ / rev2 renames foo to bar and changes it | |
705 | # \- 2 -/ rev3 should have bar with all changes and |
|
705 | # \- 2 -/ rev3 should have bar with all changes and | |
706 | # should record that bar descends from |
|
706 | # should record that bar descends from | |
707 | # bar in rev2 and foo in rev1 |
|
707 | # bar in rev2 and foo in rev1 | |
708 | # |
|
708 | # | |
709 | # this allows this merge to succeed: |
|
709 | # this allows this merge to succeed: | |
710 | # |
|
710 | # | |
711 | # 0 --- 1 --- 3 rev4 reverts the content change from rev2 |
|
711 | # 0 --- 1 --- 3 rev4 reverts the content change from rev2 | |
712 | # \ / merging rev3 and rev4 should use bar@rev2 |
|
712 | # \ / merging rev3 and rev4 should use bar@rev2 | |
713 | # \- 2 --- 4 as the merge base |
|
713 | # \- 2 --- 4 as the merge base | |
714 | # |
|
714 | # | |
715 |
|
715 | |||
716 | cfname = copy[0] |
|
716 | cfname = copy[0] | |
717 | crev = manifest1.get(cfname) |
|
717 | crev = manifest1.get(cfname) | |
718 | newfparent = fparent2 |
|
718 | newfparent = fparent2 | |
719 |
|
719 | |||
720 | if manifest2: # branch merge |
|
720 | if manifest2: # branch merge | |
721 | if fparent2 == nullid or crev is None: # copied on remote side |
|
721 | if fparent2 == nullid or crev is None: # copied on remote side | |
722 | if cfname in manifest2: |
|
722 | if cfname in manifest2: | |
723 | crev = manifest2[cfname] |
|
723 | crev = manifest2[cfname] | |
724 | newfparent = fparent1 |
|
724 | newfparent = fparent1 | |
725 |
|
725 | |||
726 | # find source in nearest ancestor if we've lost track |
|
726 | # find source in nearest ancestor if we've lost track | |
727 | if not crev: |
|
727 | if not crev: | |
728 | self.ui.debug(" %s: searching for copy revision for %s\n" % |
|
728 | self.ui.debug(" %s: searching for copy revision for %s\n" % | |
729 | (fname, cfname)) |
|
729 | (fname, cfname)) | |
730 | for ancestor in self['.'].ancestors(): |
|
730 | for ancestor in self['.'].ancestors(): | |
731 | if cfname in ancestor: |
|
731 | if cfname in ancestor: | |
732 | crev = ancestor[cfname].filenode() |
|
732 | crev = ancestor[cfname].filenode() | |
733 | break |
|
733 | break | |
734 |
|
734 | |||
735 | self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(crev))) |
|
735 | self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(crev))) | |
736 | meta["copy"] = cfname |
|
736 | meta["copy"] = cfname | |
737 | meta["copyrev"] = hex(crev) |
|
737 | meta["copyrev"] = hex(crev) | |
738 | fparent1, fparent2 = nullid, newfparent |
|
738 | fparent1, fparent2 = nullid, newfparent | |
739 | elif fparent2 != nullid: |
|
739 | elif fparent2 != nullid: | |
740 | # is one parent an ancestor of the other? |
|
740 | # is one parent an ancestor of the other? | |
741 | fparentancestor = flog.ancestor(fparent1, fparent2) |
|
741 | fparentancestor = flog.ancestor(fparent1, fparent2) | |
742 | if fparentancestor == fparent1: |
|
742 | if fparentancestor == fparent1: | |
743 | fparent1, fparent2 = fparent2, nullid |
|
743 | fparent1, fparent2 = fparent2, nullid | |
744 | elif fparentancestor == fparent2: |
|
744 | elif fparentancestor == fparent2: | |
745 | fparent2 = nullid |
|
745 | fparent2 = nullid | |
746 |
|
746 | |||
747 | # is the file changed? |
|
747 | # is the file changed? | |
748 | if fparent2 != nullid or flog.cmp(fparent1, text) or meta: |
|
748 | if fparent2 != nullid or flog.cmp(fparent1, text) or meta: | |
749 | changelist.append(fname) |
|
749 | changelist.append(fname) | |
750 | return flog.add(text, meta, tr, linkrev, fparent1, fparent2) |
|
750 | return flog.add(text, meta, tr, linkrev, fparent1, fparent2) | |
751 |
|
751 | |||
752 | # are just the flags changed during merge? |
|
752 | # are just the flags changed during merge? | |
753 | if fparent1 != fparent2o and manifest1.flags(fname) != fctx.flags(): |
|
753 | if fparent1 != fparent2o and manifest1.flags(fname) != fctx.flags(): | |
754 | changelist.append(fname) |
|
754 | changelist.append(fname) | |
755 |
|
755 | |||
756 | return fparent1 |
|
756 | return fparent1 | |
757 |
|
757 | |||
758 | def commit(self, text="", user=None, date=None, match=None, force=False, |
|
758 | def commit(self, text="", user=None, date=None, match=None, force=False, | |
759 | editor=False, extra={}): |
|
759 | editor=False, extra={}): | |
760 | """Add a new revision to current repository. |
|
760 | """Add a new revision to current repository. | |
761 |
|
761 | |||
762 | Revision information is gathered from the working directory, |
|
762 | Revision information is gathered from the working directory, | |
763 | match can be used to filter the committed files. If editor is |
|
763 | match can be used to filter the committed files. If editor is | |
764 | supplied, it is called to get a commit message. |
|
764 | supplied, it is called to get a commit message. | |
765 | """ |
|
765 | """ | |
766 |
|
766 | |||
767 | def fail(f, msg): |
|
767 | def fail(f, msg): | |
768 | raise util.Abort('%s: %s' % (f, msg)) |
|
768 | raise util.Abort('%s: %s' % (f, msg)) | |
769 |
|
769 | |||
770 | if not match: |
|
770 | if not match: | |
771 | match = match_.always(self.root, '') |
|
771 | match = match_.always(self.root, '') | |
772 |
|
772 | |||
773 | if not force: |
|
773 | if not force: | |
774 | vdirs = [] |
|
774 | vdirs = [] | |
775 | match.dir = vdirs.append |
|
775 | match.dir = vdirs.append | |
776 | match.bad = fail |
|
776 | match.bad = fail | |
777 |
|
777 | |||
778 | wlock = self.wlock() |
|
778 | wlock = self.wlock() | |
779 | try: |
|
779 | try: | |
780 | p1, p2 = self.dirstate.parents() |
|
780 | p1, p2 = self.dirstate.parents() | |
781 | wctx = self[None] |
|
781 | wctx = self[None] | |
782 |
|
782 | |||
783 | if (not force and p2 != nullid and match and |
|
783 | if (not force and p2 != nullid and match and | |
784 | (match.files() or match.anypats())): |
|
784 | (match.files() or match.anypats())): | |
785 | raise util.Abort(_('cannot partially commit a merge ' |
|
785 | raise util.Abort(_('cannot partially commit a merge ' | |
786 | '(do not specify files or patterns)')) |
|
786 | '(do not specify files or patterns)')) | |
787 |
|
787 | |||
788 | changes = self.status(match=match, clean=force) |
|
788 | changes = self.status(match=match, clean=force) | |
789 | if force: |
|
789 | if force: | |
790 | changes[0].extend(changes[6]) # mq may commit unchanged files |
|
790 | changes[0].extend(changes[6]) # mq may commit unchanged files | |
791 |
|
791 | |||
792 | # check subrepos |
|
792 | # check subrepos | |
793 | subs = [] |
|
793 | subs = [] | |
794 | for s in wctx.substate: |
|
794 | for s in wctx.substate: | |
795 | if match(s) and wctx.sub(s).dirty(): |
|
795 | if match(s) and wctx.sub(s).dirty(): | |
796 | subs.append(s) |
|
796 | subs.append(s) | |
797 | if subs and '.hgsubstate' not in changes[0]: |
|
797 | if subs and '.hgsubstate' not in changes[0]: | |
798 | changes[0].insert(0, '.hgsubstate') |
|
798 | changes[0].insert(0, '.hgsubstate') | |
799 |
|
799 | |||
800 | # make sure all explicit patterns are matched |
|
800 | # make sure all explicit patterns are matched | |
801 | if not force and match.files(): |
|
801 | if not force and match.files(): | |
802 | matched = set(changes[0] + changes[1] + changes[2]) |
|
802 | matched = set(changes[0] + changes[1] + changes[2]) | |
803 |
|
803 | |||
804 | for f in match.files(): |
|
804 | for f in match.files(): | |
805 | if f == '.' or f in matched or f in wctx.substate: |
|
805 | if f == '.' or f in matched or f in wctx.substate: | |
806 | continue |
|
806 | continue | |
807 | if f in changes[3]: # missing |
|
807 | if f in changes[3]: # missing | |
808 | fail(f, _('file not found!')) |
|
808 | fail(f, _('file not found!')) | |
809 | if f in vdirs: # visited directory |
|
809 | if f in vdirs: # visited directory | |
810 | d = f + '/' |
|
810 | d = f + '/' | |
811 | for mf in matched: |
|
811 | for mf in matched: | |
812 | if mf.startswith(d): |
|
812 | if mf.startswith(d): | |
813 | break |
|
813 | break | |
814 | else: |
|
814 | else: | |
815 | fail(f, _("no match under directory!")) |
|
815 | fail(f, _("no match under directory!")) | |
816 | elif f not in self.dirstate: |
|
816 | elif f not in self.dirstate: | |
817 | fail(f, _("file not tracked!")) |
|
817 | fail(f, _("file not tracked!")) | |
818 |
|
818 | |||
819 | if (not force and not extra.get("close") and p2 == nullid |
|
819 | if (not force and not extra.get("close") and p2 == nullid | |
820 | and not (changes[0] or changes[1] or changes[2]) |
|
820 | and not (changes[0] or changes[1] or changes[2]) | |
821 | and self[None].branch() == self['.'].branch()): |
|
821 | and self[None].branch() == self['.'].branch()): | |
822 | return None |
|
822 | return None | |
823 |
|
823 | |||
824 | ms = merge_.mergestate(self) |
|
824 | ms = merge_.mergestate(self) | |
825 | for f in changes[0]: |
|
825 | for f in changes[0]: | |
826 | if f in ms and ms[f] == 'u': |
|
826 | if f in ms and ms[f] == 'u': | |
827 | raise util.Abort(_("unresolved merge conflicts " |
|
827 | raise util.Abort(_("unresolved merge conflicts " | |
828 | "(see hg resolve)")) |
|
828 | "(see hg resolve)")) | |
829 |
|
829 | |||
830 | cctx = context.workingctx(self, (p1, p2), text, user, date, |
|
830 | cctx = context.workingctx(self, (p1, p2), text, user, date, | |
831 | extra, changes) |
|
831 | extra, changes) | |
832 | if editor: |
|
832 | if editor: | |
833 | cctx._text = editor(self, cctx, subs) |
|
833 | cctx._text = editor(self, cctx, subs) | |
834 | edited = (text != cctx._text) |
|
834 | edited = (text != cctx._text) | |
835 |
|
835 | |||
836 | # commit subs |
|
836 | # commit subs | |
837 | if subs: |
|
837 | if subs: | |
838 | state = wctx.substate.copy() |
|
838 | state = wctx.substate.copy() | |
839 | for s in subs: |
|
839 | for s in subs: | |
840 | self.ui.status(_('committing subrepository %s\n') % s) |
|
840 | self.ui.status(_('committing subrepository %s\n') % s) | |
841 | sr = wctx.sub(s).commit(cctx._text, user, date) |
|
841 | sr = wctx.sub(s).commit(cctx._text, user, date) | |
842 | state[s] = (state[s][0], sr) |
|
842 | state[s] = (state[s][0], sr) | |
843 | subrepo.writestate(self, state) |
|
843 | subrepo.writestate(self, state) | |
844 |
|
844 | |||
845 | # Save commit message in case this transaction gets rolled back |
|
845 | # Save commit message in case this transaction gets rolled back | |
846 | # (e.g. by a pretxncommit hook). Leave the content alone on |
|
846 | # (e.g. by a pretxncommit hook). Leave the content alone on | |
847 | # the assumption that the user will use the same editor again. |
|
847 | # the assumption that the user will use the same editor again. | |
848 | msgfile = self.opener('last-message.txt', 'wb') |
|
848 | msgfile = self.opener('last-message.txt', 'wb') | |
849 | msgfile.write(cctx._text) |
|
849 | msgfile.write(cctx._text) | |
850 | msgfile.close() |
|
850 | msgfile.close() | |
851 |
|
851 | |||
852 | try: |
|
852 | try: | |
853 | ret = self.commitctx(cctx, True) |
|
853 | ret = self.commitctx(cctx, True) | |
854 | except: |
|
854 | except: | |
855 | if edited: |
|
855 | if edited: | |
856 | msgfn = self.pathto(msgfile.name[len(self.root)+1:]) |
|
856 | msgfn = self.pathto(msgfile.name[len(self.root)+1:]) | |
857 | self.ui.write( |
|
857 | self.ui.write( | |
858 | _('note: commit message saved in %s\n') % msgfn) |
|
858 | _('note: commit message saved in %s\n') % msgfn) | |
859 | raise |
|
859 | raise | |
860 |
|
860 | |||
861 | # update dirstate and mergestate |
|
861 | # update dirstate and mergestate | |
862 | for f in changes[0] + changes[1]: |
|
862 | for f in changes[0] + changes[1]: | |
863 | self.dirstate.normal(f) |
|
863 | self.dirstate.normal(f) | |
864 | for f in changes[2]: |
|
864 | for f in changes[2]: | |
865 | self.dirstate.forget(f) |
|
865 | self.dirstate.forget(f) | |
866 | self.dirstate.setparents(ret) |
|
866 | self.dirstate.setparents(ret) | |
867 | ms.reset() |
|
867 | ms.reset() | |
868 |
|
868 | |||
869 | return ret |
|
869 | return ret | |
870 |
|
870 | |||
871 | finally: |
|
871 | finally: | |
872 | wlock.release() |
|
872 | wlock.release() | |
873 |
|
873 | |||
874 | def commitctx(self, ctx, error=False): |
|
874 | def commitctx(self, ctx, error=False): | |
875 | """Add a new revision to current repository. |
|
875 | """Add a new revision to current repository. | |
876 |
|
876 | |||
877 | Revision information is passed via the context argument. |
|
877 | Revision information is passed via the context argument. | |
878 | """ |
|
878 | """ | |
879 |
|
879 | |||
880 | tr = lock = None |
|
880 | tr = lock = None | |
881 | removed = ctx.removed() |
|
881 | removed = ctx.removed() | |
882 | p1, p2 = ctx.p1(), ctx.p2() |
|
882 | p1, p2 = ctx.p1(), ctx.p2() | |
883 | m1 = p1.manifest().copy() |
|
883 | m1 = p1.manifest().copy() | |
884 | m2 = p2.manifest() |
|
884 | m2 = p2.manifest() | |
885 | user = ctx.user() |
|
885 | user = ctx.user() | |
886 |
|
886 | |||
887 | xp1, xp2 = p1.hex(), p2 and p2.hex() or '' |
|
887 | xp1, xp2 = p1.hex(), p2 and p2.hex() or '' | |
888 | self.hook("precommit", throw=True, parent1=xp1, parent2=xp2) |
|
888 | self.hook("precommit", throw=True, parent1=xp1, parent2=xp2) | |
889 |
|
889 | |||
890 | lock = self.lock() |
|
890 | lock = self.lock() | |
891 | try: |
|
891 | try: | |
892 | tr = self.transaction() |
|
892 | tr = self.transaction() | |
893 | trp = weakref.proxy(tr) |
|
893 | trp = weakref.proxy(tr) | |
894 |
|
894 | |||
895 | # check in files |
|
895 | # check in files | |
896 | new = {} |
|
896 | new = {} | |
897 | changed = [] |
|
897 | changed = [] | |
898 | linkrev = len(self) |
|
898 | linkrev = len(self) | |
899 | for f in sorted(ctx.modified() + ctx.added()): |
|
899 | for f in sorted(ctx.modified() + ctx.added()): | |
900 | self.ui.note(f + "\n") |
|
900 | self.ui.note(f + "\n") | |
901 | try: |
|
901 | try: | |
902 | fctx = ctx[f] |
|
902 | fctx = ctx[f] | |
903 | new[f] = self._filecommit(fctx, m1, m2, linkrev, trp, |
|
903 | new[f] = self._filecommit(fctx, m1, m2, linkrev, trp, | |
904 | changed) |
|
904 | changed) | |
905 | m1.set(f, fctx.flags()) |
|
905 | m1.set(f, fctx.flags()) | |
906 | except (OSError, IOError): |
|
906 | except (OSError, IOError): | |
907 | if error: |
|
907 | if error: | |
908 | self.ui.warn(_("trouble committing %s!\n") % f) |
|
908 | self.ui.warn(_("trouble committing %s!\n") % f) | |
909 | raise |
|
909 | raise | |
910 | else: |
|
910 | else: | |
911 | removed.append(f) |
|
911 | removed.append(f) | |
912 |
|
912 | |||
913 | # update manifest |
|
913 | # update manifest | |
914 | m1.update(new) |
|
914 | m1.update(new) | |
915 | removed = [f for f in sorted(removed) if f in m1 or f in m2] |
|
915 | removed = [f for f in sorted(removed) if f in m1 or f in m2] | |
916 | drop = [f for f in removed if f in m1] |
|
916 | drop = [f for f in removed if f in m1] | |
917 | for f in drop: |
|
917 | for f in drop: | |
918 | del m1[f] |
|
918 | del m1[f] | |
919 | mn = self.manifest.add(m1, trp, linkrev, p1.manifestnode(), |
|
919 | mn = self.manifest.add(m1, trp, linkrev, p1.manifestnode(), | |
920 | p2.manifestnode(), (new, drop)) |
|
920 | p2.manifestnode(), (new, drop)) | |
921 |
|
921 | |||
922 | # update changelog |
|
922 | # update changelog | |
923 | self.changelog.delayupdate() |
|
923 | self.changelog.delayupdate() | |
924 | n = self.changelog.add(mn, changed + removed, ctx.description(), |
|
924 | n = self.changelog.add(mn, changed + removed, ctx.description(), | |
925 | trp, p1.node(), p2.node(), |
|
925 | trp, p1.node(), p2.node(), | |
926 | user, ctx.date(), ctx.extra().copy()) |
|
926 | user, ctx.date(), ctx.extra().copy()) | |
927 | p = lambda: self.changelog.writepending() and self.root or "" |
|
927 | p = lambda: self.changelog.writepending() and self.root or "" | |
928 | self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1, |
|
928 | self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1, | |
929 | parent2=xp2, pending=p) |
|
929 | parent2=xp2, pending=p) | |
930 | self.changelog.finalize(trp) |
|
930 | self.changelog.finalize(trp) | |
931 | tr.close() |
|
931 | tr.close() | |
932 |
|
932 | |||
933 | if self._branchcache: |
|
933 | if self._branchcache: | |
934 | self.branchtags() |
|
934 | self.branchtags() | |
935 |
|
935 | |||
936 | self.hook("commit", node=hex(n), parent1=xp1, parent2=xp2) |
|
936 | self.hook("commit", node=hex(n), parent1=xp1, parent2=xp2) | |
937 | return n |
|
937 | return n | |
938 | finally: |
|
938 | finally: | |
939 | del tr |
|
939 | del tr | |
940 | lock.release() |
|
940 | lock.release() | |
941 |
|
941 | |||
942 | def destroyed(self): |
|
942 | def destroyed(self): | |
943 | '''Inform the repository that nodes have been destroyed. |
|
943 | '''Inform the repository that nodes have been destroyed. | |
944 | Intended for use by strip and rollback, so there's a common |
|
944 | Intended for use by strip and rollback, so there's a common | |
945 | place for anything that has to be done after destroying history.''' |
|
945 | place for anything that has to be done after destroying history.''' | |
946 | # XXX it might be nice if we could take the list of destroyed |
|
946 | # XXX it might be nice if we could take the list of destroyed | |
947 | # nodes, but I don't see an easy way for rollback() to do that |
|
947 | # nodes, but I don't see an easy way for rollback() to do that | |
948 |
|
948 | |||
949 | # Ensure the persistent tag cache is updated. Doing it now |
|
949 | # Ensure the persistent tag cache is updated. Doing it now | |
950 | # means that the tag cache only has to worry about destroyed |
|
950 | # means that the tag cache only has to worry about destroyed | |
951 | # heads immediately after a strip/rollback. That in turn |
|
951 | # heads immediately after a strip/rollback. That in turn | |
952 | # guarantees that "cachetip == currenttip" (comparing both rev |
|
952 | # guarantees that "cachetip == currenttip" (comparing both rev | |
953 | # and node) always means no nodes have been added or destroyed. |
|
953 | # and node) always means no nodes have been added or destroyed. | |
954 |
|
954 | |||
955 | # XXX this is suboptimal when qrefresh'ing: we strip the current |
|
955 | # XXX this is suboptimal when qrefresh'ing: we strip the current | |
956 | # head, refresh the tag cache, then immediately add a new head. |
|
956 | # head, refresh the tag cache, then immediately add a new head. | |
957 | # But I think doing it this way is necessary for the "instant |
|
957 | # But I think doing it this way is necessary for the "instant | |
958 | # tag cache retrieval" case to work. |
|
958 | # tag cache retrieval" case to work. | |
959 | tags_.findglobaltags(self.ui, self, {}, {}) |
|
959 | tags_.findglobaltags(self.ui, self, {}, {}) | |
960 |
|
960 | |||
961 | def walk(self, match, node=None): |
|
961 | def walk(self, match, node=None): | |
962 | ''' |
|
962 | ''' | |
963 | walk recursively through the directory tree or a given |
|
963 | walk recursively through the directory tree or a given | |
964 | changeset, finding all files matched by the match |
|
964 | changeset, finding all files matched by the match | |
965 | function |
|
965 | function | |
966 | ''' |
|
966 | ''' | |
967 | return self[node].walk(match) |
|
967 | return self[node].walk(match) | |
968 |
|
968 | |||
969 | def status(self, node1='.', node2=None, match=None, |
|
969 | def status(self, node1='.', node2=None, match=None, | |
970 | ignored=False, clean=False, unknown=False): |
|
970 | ignored=False, clean=False, unknown=False): | |
971 | """return status of files between two nodes or node and working directory |
|
971 | """return status of files between two nodes or node and working directory | |
972 |
|
972 | |||
973 | If node1 is None, use the first dirstate parent instead. |
|
973 | If node1 is None, use the first dirstate parent instead. | |
974 | If node2 is None, compare node1 with working directory. |
|
974 | If node2 is None, compare node1 with working directory. | |
975 | """ |
|
975 | """ | |
976 |
|
976 | |||
977 | def mfmatches(ctx): |
|
977 | def mfmatches(ctx): | |
978 | mf = ctx.manifest().copy() |
|
978 | mf = ctx.manifest().copy() | |
979 | for fn in mf.keys(): |
|
979 | for fn in mf.keys(): | |
980 | if not match(fn): |
|
980 | if not match(fn): | |
981 | del mf[fn] |
|
981 | del mf[fn] | |
982 | return mf |
|
982 | return mf | |
983 |
|
983 | |||
984 | if isinstance(node1, context.changectx): |
|
984 | if isinstance(node1, context.changectx): | |
985 | ctx1 = node1 |
|
985 | ctx1 = node1 | |
986 | else: |
|
986 | else: | |
987 | ctx1 = self[node1] |
|
987 | ctx1 = self[node1] | |
988 | if isinstance(node2, context.changectx): |
|
988 | if isinstance(node2, context.changectx): | |
989 | ctx2 = node2 |
|
989 | ctx2 = node2 | |
990 | else: |
|
990 | else: | |
991 | ctx2 = self[node2] |
|
991 | ctx2 = self[node2] | |
992 |
|
992 | |||
993 | working = ctx2.rev() is None |
|
993 | working = ctx2.rev() is None | |
994 | parentworking = working and ctx1 == self['.'] |
|
994 | parentworking = working and ctx1 == self['.'] | |
995 | match = match or match_.always(self.root, self.getcwd()) |
|
995 | match = match or match_.always(self.root, self.getcwd()) | |
996 | listignored, listclean, listunknown = ignored, clean, unknown |
|
996 | listignored, listclean, listunknown = ignored, clean, unknown | |
997 |
|
997 | |||
998 | # load earliest manifest first for caching reasons |
|
998 | # load earliest manifest first for caching reasons | |
999 | if not working and ctx2.rev() < ctx1.rev(): |
|
999 | if not working and ctx2.rev() < ctx1.rev(): | |
1000 | ctx2.manifest() |
|
1000 | ctx2.manifest() | |
1001 |
|
1001 | |||
1002 | if not parentworking: |
|
1002 | if not parentworking: | |
1003 | def bad(f, msg): |
|
1003 | def bad(f, msg): | |
1004 | if f not in ctx1: |
|
1004 | if f not in ctx1: | |
1005 | self.ui.warn('%s: %s\n' % (self.dirstate.pathto(f), msg)) |
|
1005 | self.ui.warn('%s: %s\n' % (self.dirstate.pathto(f), msg)) | |
1006 | match.bad = bad |
|
1006 | match.bad = bad | |
1007 |
|
1007 | |||
1008 | if working: # we need to scan the working dir |
|
1008 | if working: # we need to scan the working dir | |
1009 | subrepos = ctx1.substate.keys() |
|
1009 | subrepos = ctx1.substate.keys() | |
1010 | s = self.dirstate.status(match, subrepos, listignored, |
|
1010 | s = self.dirstate.status(match, subrepos, listignored, | |
1011 | listclean, listunknown) |
|
1011 | listclean, listunknown) | |
1012 | cmp, modified, added, removed, deleted, unknown, ignored, clean = s |
|
1012 | cmp, modified, added, removed, deleted, unknown, ignored, clean = s | |
1013 |
|
1013 | |||
1014 | # check for any possibly clean files |
|
1014 | # check for any possibly clean files | |
1015 | if parentworking and cmp: |
|
1015 | if parentworking and cmp: | |
1016 | fixup = [] |
|
1016 | fixup = [] | |
1017 | # do a full compare of any files that might have changed |
|
1017 | # do a full compare of any files that might have changed | |
1018 | for f in sorted(cmp): |
|
1018 | for f in sorted(cmp): | |
1019 | if (f not in ctx1 or ctx2.flags(f) != ctx1.flags(f) |
|
1019 | if (f not in ctx1 or ctx2.flags(f) != ctx1.flags(f) | |
1020 | or ctx1[f].cmp(ctx2[f].data())): |
|
1020 | or ctx1[f].cmp(ctx2[f].data())): | |
1021 | modified.append(f) |
|
1021 | modified.append(f) | |
1022 | else: |
|
1022 | else: | |
1023 | fixup.append(f) |
|
1023 | fixup.append(f) | |
1024 |
|
1024 | |||
1025 | if listclean: |
|
1025 | if listclean: | |
1026 | clean += fixup |
|
1026 | clean += fixup | |
1027 |
|
1027 | |||
1028 | # update dirstate for files that are actually clean |
|
1028 | # update dirstate for files that are actually clean | |
1029 | if fixup: |
|
1029 | if fixup: | |
1030 | try: |
|
1030 | try: | |
1031 | # updating the dirstate is optional |
|
1031 | # updating the dirstate is optional | |
1032 | # so we don't wait on the lock |
|
1032 | # so we don't wait on the lock | |
1033 | wlock = self.wlock(False) |
|
1033 | wlock = self.wlock(False) | |
1034 | try: |
|
1034 | try: | |
1035 | for f in fixup: |
|
1035 | for f in fixup: | |
1036 | self.dirstate.normal(f) |
|
1036 | self.dirstate.normal(f) | |
1037 | finally: |
|
1037 | finally: | |
1038 | wlock.release() |
|
1038 | wlock.release() | |
1039 | except error.LockError: |
|
1039 | except error.LockError: | |
1040 | pass |
|
1040 | pass | |
1041 |
|
1041 | |||
1042 | if not parentworking: |
|
1042 | if not parentworking: | |
1043 | mf1 = mfmatches(ctx1) |
|
1043 | mf1 = mfmatches(ctx1) | |
1044 | if working: |
|
1044 | if working: | |
1045 | # we are comparing working dir against non-parent |
|
1045 | # we are comparing working dir against non-parent | |
1046 | # generate a pseudo-manifest for the working dir |
|
1046 | # generate a pseudo-manifest for the working dir | |
1047 | mf2 = mfmatches(self['.']) |
|
1047 | mf2 = mfmatches(self['.']) | |
1048 | for f in cmp + modified + added: |
|
1048 | for f in cmp + modified + added: | |
1049 | mf2[f] = None |
|
1049 | mf2[f] = None | |
1050 | mf2.set(f, ctx2.flags(f)) |
|
1050 | mf2.set(f, ctx2.flags(f)) | |
1051 | for f in removed: |
|
1051 | for f in removed: | |
1052 | if f in mf2: |
|
1052 | if f in mf2: | |
1053 | del mf2[f] |
|
1053 | del mf2[f] | |
1054 | else: |
|
1054 | else: | |
1055 | # we are comparing two revisions |
|
1055 | # we are comparing two revisions | |
1056 | deleted, unknown, ignored = [], [], [] |
|
1056 | deleted, unknown, ignored = [], [], [] | |
1057 | mf2 = mfmatches(ctx2) |
|
1057 | mf2 = mfmatches(ctx2) | |
1058 |
|
1058 | |||
1059 | modified, added, clean = [], [], [] |
|
1059 | modified, added, clean = [], [], [] | |
1060 | for fn in mf2: |
|
1060 | for fn in mf2: | |
1061 | if fn in mf1: |
|
1061 | if fn in mf1: | |
1062 | if (mf1.flags(fn) != mf2.flags(fn) or |
|
1062 | if (mf1.flags(fn) != mf2.flags(fn) or | |
1063 | (mf1[fn] != mf2[fn] and |
|
1063 | (mf1[fn] != mf2[fn] and | |
1064 | (mf2[fn] or ctx1[fn].cmp(ctx2[fn].data())))): |
|
1064 | (mf2[fn] or ctx1[fn].cmp(ctx2[fn].data())))): | |
1065 | modified.append(fn) |
|
1065 | modified.append(fn) | |
1066 | elif listclean: |
|
1066 | elif listclean: | |
1067 | clean.append(fn) |
|
1067 | clean.append(fn) | |
1068 | del mf1[fn] |
|
1068 | del mf1[fn] | |
1069 | else: |
|
1069 | else: | |
1070 | added.append(fn) |
|
1070 | added.append(fn) | |
1071 | removed = mf1.keys() |
|
1071 | removed = mf1.keys() | |
1072 |
|
1072 | |||
1073 | r = modified, added, removed, deleted, unknown, ignored, clean |
|
1073 | r = modified, added, removed, deleted, unknown, ignored, clean | |
1074 | [l.sort() for l in r] |
|
1074 | [l.sort() for l in r] | |
1075 | return r |
|
1075 | return r | |
1076 |
|
1076 | |||
1077 | def add(self, list): |
|
1077 | def add(self, list): | |
1078 | wlock = self.wlock() |
|
1078 | wlock = self.wlock() | |
1079 | try: |
|
1079 | try: | |
1080 | rejected = [] |
|
1080 | rejected = [] | |
1081 | for f in list: |
|
1081 | for f in list: | |
1082 | p = self.wjoin(f) |
|
1082 | p = self.wjoin(f) | |
1083 | try: |
|
1083 | try: | |
1084 | st = os.lstat(p) |
|
1084 | st = os.lstat(p) | |
1085 | except: |
|
1085 | except: | |
1086 | self.ui.warn(_("%s does not exist!\n") % f) |
|
1086 | self.ui.warn(_("%s does not exist!\n") % f) | |
1087 | rejected.append(f) |
|
1087 | rejected.append(f) | |
1088 | continue |
|
1088 | continue | |
1089 | if st.st_size > 10000000: |
|
1089 | if st.st_size > 10000000: | |
1090 | self.ui.warn(_("%s: files over 10MB may cause memory and" |
|
1090 | self.ui.warn(_("%s: files over 10MB may cause memory and" | |
1091 | " performance problems\n" |
|
1091 | " performance problems\n" | |
1092 | "(use 'hg revert %s' to unadd the file)\n") |
|
1092 | "(use 'hg revert %s' to unadd the file)\n") | |
1093 | % (f, f)) |
|
1093 | % (f, f)) | |
1094 | if not (stat.S_ISREG(st.st_mode) or stat.S_ISLNK(st.st_mode)): |
|
1094 | if not (stat.S_ISREG(st.st_mode) or stat.S_ISLNK(st.st_mode)): | |
1095 | self.ui.warn(_("%s not added: only files and symlinks " |
|
1095 | self.ui.warn(_("%s not added: only files and symlinks " | |
1096 | "supported currently\n") % f) |
|
1096 | "supported currently\n") % f) | |
1097 | rejected.append(p) |
|
1097 | rejected.append(p) | |
1098 | elif self.dirstate[f] in 'amn': |
|
1098 | elif self.dirstate[f] in 'amn': | |
1099 | self.ui.warn(_("%s already tracked!\n") % f) |
|
1099 | self.ui.warn(_("%s already tracked!\n") % f) | |
1100 | elif self.dirstate[f] == 'r': |
|
1100 | elif self.dirstate[f] == 'r': | |
1101 | self.dirstate.normallookup(f) |
|
1101 | self.dirstate.normallookup(f) | |
1102 | else: |
|
1102 | else: | |
1103 | self.dirstate.add(f) |
|
1103 | self.dirstate.add(f) | |
1104 | return rejected |
|
1104 | return rejected | |
1105 | finally: |
|
1105 | finally: | |
1106 | wlock.release() |
|
1106 | wlock.release() | |
1107 |
|
1107 | |||
1108 | def forget(self, list): |
|
1108 | def forget(self, list): | |
1109 | wlock = self.wlock() |
|
1109 | wlock = self.wlock() | |
1110 | try: |
|
1110 | try: | |
1111 | for f in list: |
|
1111 | for f in list: | |
1112 | if self.dirstate[f] != 'a': |
|
1112 | if self.dirstate[f] != 'a': | |
1113 | self.ui.warn(_("%s not added!\n") % f) |
|
1113 | self.ui.warn(_("%s not added!\n") % f) | |
1114 | else: |
|
1114 | else: | |
1115 | self.dirstate.forget(f) |
|
1115 | self.dirstate.forget(f) | |
1116 | finally: |
|
1116 | finally: | |
1117 | wlock.release() |
|
1117 | wlock.release() | |
1118 |
|
1118 | |||
1119 | def remove(self, list, unlink=False): |
|
1119 | def remove(self, list, unlink=False): | |
1120 | if unlink: |
|
1120 | if unlink: | |
1121 | for f in list: |
|
1121 | for f in list: | |
1122 | try: |
|
1122 | try: | |
1123 | util.unlink(self.wjoin(f)) |
|
1123 | util.unlink(self.wjoin(f)) | |
1124 | except OSError, inst: |
|
1124 | except OSError, inst: | |
1125 | if inst.errno != errno.ENOENT: |
|
1125 | if inst.errno != errno.ENOENT: | |
1126 | raise |
|
1126 | raise | |
1127 | wlock = self.wlock() |
|
1127 | wlock = self.wlock() | |
1128 | try: |
|
1128 | try: | |
1129 | for f in list: |
|
1129 | for f in list: | |
1130 | if unlink and os.path.exists(self.wjoin(f)): |
|
1130 | if unlink and os.path.exists(self.wjoin(f)): | |
1131 | self.ui.warn(_("%s still exists!\n") % f) |
|
1131 | self.ui.warn(_("%s still exists!\n") % f) | |
1132 | elif self.dirstate[f] == 'a': |
|
1132 | elif self.dirstate[f] == 'a': | |
1133 | self.dirstate.forget(f) |
|
1133 | self.dirstate.forget(f) | |
1134 | elif f not in self.dirstate: |
|
1134 | elif f not in self.dirstate: | |
1135 | self.ui.warn(_("%s not tracked!\n") % f) |
|
1135 | self.ui.warn(_("%s not tracked!\n") % f) | |
1136 | else: |
|
1136 | else: | |
1137 | self.dirstate.remove(f) |
|
1137 | self.dirstate.remove(f) | |
1138 | finally: |
|
1138 | finally: | |
1139 | wlock.release() |
|
1139 | wlock.release() | |
1140 |
|
1140 | |||
1141 | def undelete(self, list): |
|
1141 | def undelete(self, list): | |
1142 | manifests = [self.manifest.read(self.changelog.read(p)[0]) |
|
1142 | manifests = [self.manifest.read(self.changelog.read(p)[0]) | |
1143 | for p in self.dirstate.parents() if p != nullid] |
|
1143 | for p in self.dirstate.parents() if p != nullid] | |
1144 | wlock = self.wlock() |
|
1144 | wlock = self.wlock() | |
1145 | try: |
|
1145 | try: | |
1146 | for f in list: |
|
1146 | for f in list: | |
1147 | if self.dirstate[f] != 'r': |
|
1147 | if self.dirstate[f] != 'r': | |
1148 | self.ui.warn(_("%s not removed!\n") % f) |
|
1148 | self.ui.warn(_("%s not removed!\n") % f) | |
1149 | else: |
|
1149 | else: | |
1150 | m = f in manifests[0] and manifests[0] or manifests[1] |
|
1150 | m = f in manifests[0] and manifests[0] or manifests[1] | |
1151 | t = self.file(f).read(m[f]) |
|
1151 | t = self.file(f).read(m[f]) | |
1152 | self.wwrite(f, t, m.flags(f)) |
|
1152 | self.wwrite(f, t, m.flags(f)) | |
1153 | self.dirstate.normal(f) |
|
1153 | self.dirstate.normal(f) | |
1154 | finally: |
|
1154 | finally: | |
1155 | wlock.release() |
|
1155 | wlock.release() | |
1156 |
|
1156 | |||
1157 | def copy(self, source, dest): |
|
1157 | def copy(self, source, dest): | |
1158 | p = self.wjoin(dest) |
|
1158 | p = self.wjoin(dest) | |
1159 | if not (os.path.exists(p) or os.path.islink(p)): |
|
1159 | if not (os.path.exists(p) or os.path.islink(p)): | |
1160 | self.ui.warn(_("%s does not exist!\n") % dest) |
|
1160 | self.ui.warn(_("%s does not exist!\n") % dest) | |
1161 | elif not (os.path.isfile(p) or os.path.islink(p)): |
|
1161 | elif not (os.path.isfile(p) or os.path.islink(p)): | |
1162 | self.ui.warn(_("copy failed: %s is not a file or a " |
|
1162 | self.ui.warn(_("copy failed: %s is not a file or a " | |
1163 | "symbolic link\n") % dest) |
|
1163 | "symbolic link\n") % dest) | |
1164 | else: |
|
1164 | else: | |
1165 | wlock = self.wlock() |
|
1165 | wlock = self.wlock() | |
1166 | try: |
|
1166 | try: | |
1167 | if self.dirstate[dest] in '?r': |
|
1167 | if self.dirstate[dest] in '?r': | |
1168 | self.dirstate.add(dest) |
|
1168 | self.dirstate.add(dest) | |
1169 | self.dirstate.copy(source, dest) |
|
1169 | self.dirstate.copy(source, dest) | |
1170 | finally: |
|
1170 | finally: | |
1171 | wlock.release() |
|
1171 | wlock.release() | |
1172 |
|
1172 | |||
1173 | def heads(self, start=None): |
|
1173 | def heads(self, start=None): | |
1174 | heads = self.changelog.heads(start) |
|
1174 | heads = self.changelog.heads(start) | |
1175 | # sort the output in rev descending order |
|
1175 | # sort the output in rev descending order | |
1176 | heads = [(-self.changelog.rev(h), h) for h in heads] |
|
1176 | heads = [(-self.changelog.rev(h), h) for h in heads] | |
1177 | return [n for (r, n) in sorted(heads)] |
|
1177 | return [n for (r, n) in sorted(heads)] | |
1178 |
|
1178 | |||
1179 | def branchheads(self, branch=None, start=None, closed=False): |
|
1179 | def branchheads(self, branch=None, start=None, closed=False): | |
1180 | '''return a (possibly filtered) list of heads for the given branch |
|
1180 | '''return a (possibly filtered) list of heads for the given branch | |
1181 |
|
1181 | |||
1182 | Heads are returned in topological order, from newest to oldest. |
|
1182 | Heads are returned in topological order, from newest to oldest. | |
1183 | If branch is None, use the dirstate branch. |
|
1183 | If branch is None, use the dirstate branch. | |
1184 | If start is not None, return only heads reachable from start. |
|
1184 | If start is not None, return only heads reachable from start. | |
1185 | If closed is True, return heads that are marked as closed as well. |
|
1185 | If closed is True, return heads that are marked as closed as well. | |
1186 | ''' |
|
1186 | ''' | |
1187 | if branch is None: |
|
1187 | if branch is None: | |
1188 | branch = self[None].branch() |
|
1188 | branch = self[None].branch() | |
1189 | branches = self.branchmap() |
|
1189 | branches = self.branchmap() | |
1190 | if branch not in branches: |
|
1190 | if branch not in branches: | |
1191 | return [] |
|
1191 | return [] | |
1192 | # the cache returns heads ordered lowest to highest |
|
1192 | # the cache returns heads ordered lowest to highest | |
1193 | bheads = list(reversed(branches[branch])) |
|
1193 | bheads = list(reversed(branches[branch])) | |
1194 | if start is not None: |
|
1194 | if start is not None: | |
1195 | # filter out the heads that cannot be reached from startrev |
|
1195 | # filter out the heads that cannot be reached from startrev | |
1196 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) |
|
1196 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) | |
1197 | bheads = [h for h in bheads if h in fbheads] |
|
1197 | bheads = [h for h in bheads if h in fbheads] | |
1198 | if not closed: |
|
1198 | if not closed: | |
1199 | bheads = [h for h in bheads if |
|
1199 | bheads = [h for h in bheads if | |
1200 | ('close' not in self.changelog.read(h)[5])] |
|
1200 | ('close' not in self.changelog.read(h)[5])] | |
1201 | return bheads |
|
1201 | return bheads | |
1202 |
|
1202 | |||
1203 | def branches(self, nodes): |
|
1203 | def branches(self, nodes): | |
1204 | if not nodes: |
|
1204 | if not nodes: | |
1205 | nodes = [self.changelog.tip()] |
|
1205 | nodes = [self.changelog.tip()] | |
1206 | b = [] |
|
1206 | b = [] | |
1207 | for n in nodes: |
|
1207 | for n in nodes: | |
1208 | t = n |
|
1208 | t = n | |
1209 | while 1: |
|
1209 | while 1: | |
1210 | p = self.changelog.parents(n) |
|
1210 | p = self.changelog.parents(n) | |
1211 | if p[1] != nullid or p[0] == nullid: |
|
1211 | if p[1] != nullid or p[0] == nullid: | |
1212 | b.append((t, n, p[0], p[1])) |
|
1212 | b.append((t, n, p[0], p[1])) | |
1213 | break |
|
1213 | break | |
1214 | n = p[0] |
|
1214 | n = p[0] | |
1215 | return b |
|
1215 | return b | |
1216 |
|
1216 | |||
1217 | def between(self, pairs): |
|
1217 | def between(self, pairs): | |
1218 | r = [] |
|
1218 | r = [] | |
1219 |
|
1219 | |||
1220 | for top, bottom in pairs: |
|
1220 | for top, bottom in pairs: | |
1221 | n, l, i = top, [], 0 |
|
1221 | n, l, i = top, [], 0 | |
1222 | f = 1 |
|
1222 | f = 1 | |
1223 |
|
1223 | |||
1224 | while n != bottom and n != nullid: |
|
1224 | while n != bottom and n != nullid: | |
1225 | p = self.changelog.parents(n)[0] |
|
1225 | p = self.changelog.parents(n)[0] | |
1226 | if i == f: |
|
1226 | if i == f: | |
1227 | l.append(n) |
|
1227 | l.append(n) | |
1228 | f = f * 2 |
|
1228 | f = f * 2 | |
1229 | n = p |
|
1229 | n = p | |
1230 | i += 1 |
|
1230 | i += 1 | |
1231 |
|
1231 | |||
1232 | r.append(l) |
|
1232 | r.append(l) | |
1233 |
|
1233 | |||
1234 | return r |
|
1234 | return r | |
1235 |
|
1235 | |||
1236 | def findincoming(self, remote, base=None, heads=None, force=False): |
|
1236 | def findincoming(self, remote, base=None, heads=None, force=False): | |
1237 | """Return list of roots of the subsets of missing nodes from remote |
|
1237 | """Return list of roots of the subsets of missing nodes from remote | |
1238 |
|
1238 | |||
1239 | If base dict is specified, assume that these nodes and their parents |
|
1239 | If base dict is specified, assume that these nodes and their parents | |
1240 | exist on the remote side and that no child of a node of base exists |
|
1240 | exist on the remote side and that no child of a node of base exists | |
1241 | in both remote and self. |
|
1241 | in both remote and self. | |
1242 | Furthermore base will be updated to include the nodes that exists |
|
1242 | Furthermore base will be updated to include the nodes that exists | |
1243 | in self and remote but no children exists in self and remote. |
|
1243 | in self and remote but no children exists in self and remote. | |
1244 | If a list of heads is specified, return only nodes which are heads |
|
1244 | If a list of heads is specified, return only nodes which are heads | |
1245 | or ancestors of these heads. |
|
1245 | or ancestors of these heads. | |
1246 |
|
1246 | |||
1247 | All the ancestors of base are in self and in remote. |
|
1247 | All the ancestors of base are in self and in remote. | |
1248 | All the descendants of the list returned are missing in self. |
|
1248 | All the descendants of the list returned are missing in self. | |
1249 | (and so we know that the rest of the nodes are missing in remote, see |
|
1249 | (and so we know that the rest of the nodes are missing in remote, see | |
1250 | outgoing) |
|
1250 | outgoing) | |
1251 | """ |
|
1251 | """ | |
1252 | return self.findcommonincoming(remote, base, heads, force)[1] |
|
1252 | return self.findcommonincoming(remote, base, heads, force)[1] | |
1253 |
|
1253 | |||
1254 | def findcommonincoming(self, remote, base=None, heads=None, force=False): |
|
1254 | def findcommonincoming(self, remote, base=None, heads=None, force=False): | |
1255 | """Return a tuple (common, missing roots, heads) used to identify |
|
1255 | """Return a tuple (common, missing roots, heads) used to identify | |
1256 | missing nodes from remote. |
|
1256 | missing nodes from remote. | |
1257 |
|
1257 | |||
1258 | If base dict is specified, assume that these nodes and their parents |
|
1258 | If base dict is specified, assume that these nodes and their parents | |
1259 | exist on the remote side and that no child of a node of base exists |
|
1259 | exist on the remote side and that no child of a node of base exists | |
1260 | in both remote and self. |
|
1260 | in both remote and self. | |
1261 | Furthermore base will be updated to include the nodes that exists |
|
1261 | Furthermore base will be updated to include the nodes that exists | |
1262 | in self and remote but no children exists in self and remote. |
|
1262 | in self and remote but no children exists in self and remote. | |
1263 | If a list of heads is specified, return only nodes which are heads |
|
1263 | If a list of heads is specified, return only nodes which are heads | |
1264 | or ancestors of these heads. |
|
1264 | or ancestors of these heads. | |
1265 |
|
1265 | |||
1266 | All the ancestors of base are in self and in remote. |
|
1266 | All the ancestors of base are in self and in remote. | |
1267 | """ |
|
1267 | """ | |
1268 | m = self.changelog.nodemap |
|
1268 | m = self.changelog.nodemap | |
1269 | search = [] |
|
1269 | search = [] | |
1270 | fetch = set() |
|
1270 | fetch = set() | |
1271 | seen = set() |
|
1271 | seen = set() | |
1272 | seenbranch = set() |
|
1272 | seenbranch = set() | |
1273 | if base is None: |
|
1273 | if base is None: | |
1274 | base = {} |
|
1274 | base = {} | |
1275 |
|
1275 | |||
1276 | if not heads: |
|
1276 | if not heads: | |
1277 | heads = remote.heads() |
|
1277 | heads = remote.heads() | |
1278 |
|
1278 | |||
1279 | if self.changelog.tip() == nullid: |
|
1279 | if self.changelog.tip() == nullid: | |
1280 | base[nullid] = 1 |
|
1280 | base[nullid] = 1 | |
1281 | if heads != [nullid]: |
|
1281 | if heads != [nullid]: | |
1282 | return [nullid], [nullid], list(heads) |
|
1282 | return [nullid], [nullid], list(heads) | |
1283 | return [nullid], [], [] |
|
1283 | return [nullid], [], [] | |
1284 |
|
1284 | |||
1285 | # assume we're closer to the tip than the root |
|
1285 | # assume we're closer to the tip than the root | |
1286 | # and start by examining the heads |
|
1286 | # and start by examining the heads | |
1287 | self.ui.status(_("searching for changes\n")) |
|
1287 | self.ui.status(_("searching for changes\n")) | |
1288 |
|
1288 | |||
1289 | unknown = [] |
|
1289 | unknown = [] | |
1290 | for h in heads: |
|
1290 | for h in heads: | |
1291 | if h not in m: |
|
1291 | if h not in m: | |
1292 | unknown.append(h) |
|
1292 | unknown.append(h) | |
1293 | else: |
|
1293 | else: | |
1294 | base[h] = 1 |
|
1294 | base[h] = 1 | |
1295 |
|
1295 | |||
1296 | heads = unknown |
|
1296 | heads = unknown | |
1297 | if not unknown: |
|
1297 | if not unknown: | |
1298 | return base.keys(), [], [] |
|
1298 | return base.keys(), [], [] | |
1299 |
|
1299 | |||
1300 | req = set(unknown) |
|
1300 | req = set(unknown) | |
1301 | reqcnt = 0 |
|
1301 | reqcnt = 0 | |
1302 |
|
1302 | |||
1303 | # search through remote branches |
|
1303 | # search through remote branches | |
1304 | # a 'branch' here is a linear segment of history, with four parts: |
|
1304 | # a 'branch' here is a linear segment of history, with four parts: | |
1305 | # head, root, first parent, second parent |
|
1305 | # head, root, first parent, second parent | |
1306 | # (a branch always has two parents (or none) by definition) |
|
1306 | # (a branch always has two parents (or none) by definition) | |
1307 | unknown = remote.branches(unknown) |
|
1307 | unknown = remote.branches(unknown) | |
1308 | while unknown: |
|
1308 | while unknown: | |
1309 | r = [] |
|
1309 | r = [] | |
1310 | while unknown: |
|
1310 | while unknown: | |
1311 | n = unknown.pop(0) |
|
1311 | n = unknown.pop(0) | |
1312 | if n[0] in seen: |
|
1312 | if n[0] in seen: | |
1313 | continue |
|
1313 | continue | |
1314 |
|
1314 | |||
1315 | self.ui.debug("examining %s:%s\n" |
|
1315 | self.ui.debug("examining %s:%s\n" | |
1316 | % (short(n[0]), short(n[1]))) |
|
1316 | % (short(n[0]), short(n[1]))) | |
1317 | if n[0] == nullid: # found the end of the branch |
|
1317 | if n[0] == nullid: # found the end of the branch | |
1318 | pass |
|
1318 | pass | |
1319 | elif n in seenbranch: |
|
1319 | elif n in seenbranch: | |
1320 | self.ui.debug("branch already found\n") |
|
1320 | self.ui.debug("branch already found\n") | |
1321 | continue |
|
1321 | continue | |
1322 | elif n[1] and n[1] in m: # do we know the base? |
|
1322 | elif n[1] and n[1] in m: # do we know the base? | |
1323 | self.ui.debug("found incomplete branch %s:%s\n" |
|
1323 | self.ui.debug("found incomplete branch %s:%s\n" | |
1324 | % (short(n[0]), short(n[1]))) |
|
1324 | % (short(n[0]), short(n[1]))) | |
1325 | search.append(n[0:2]) # schedule branch range for scanning |
|
1325 | search.append(n[0:2]) # schedule branch range for scanning | |
1326 | seenbranch.add(n) |
|
1326 | seenbranch.add(n) | |
1327 | else: |
|
1327 | else: | |
1328 | if n[1] not in seen and n[1] not in fetch: |
|
1328 | if n[1] not in seen and n[1] not in fetch: | |
1329 | if n[2] in m and n[3] in m: |
|
1329 | if n[2] in m and n[3] in m: | |
1330 | self.ui.debug("found new changeset %s\n" % |
|
1330 | self.ui.debug("found new changeset %s\n" % | |
1331 | short(n[1])) |
|
1331 | short(n[1])) | |
1332 | fetch.add(n[1]) # earliest unknown |
|
1332 | fetch.add(n[1]) # earliest unknown | |
1333 | for p in n[2:4]: |
|
1333 | for p in n[2:4]: | |
1334 | if p in m: |
|
1334 | if p in m: | |
1335 | base[p] = 1 # latest known |
|
1335 | base[p] = 1 # latest known | |
1336 |
|
1336 | |||
1337 | for p in n[2:4]: |
|
1337 | for p in n[2:4]: | |
1338 | if p not in req and p not in m: |
|
1338 | if p not in req and p not in m: | |
1339 | r.append(p) |
|
1339 | r.append(p) | |
1340 | req.add(p) |
|
1340 | req.add(p) | |
1341 | seen.add(n[0]) |
|
1341 | seen.add(n[0]) | |
1342 |
|
1342 | |||
1343 | if r: |
|
1343 | if r: | |
1344 | reqcnt += 1 |
|
1344 | reqcnt += 1 | |
1345 | self.ui.debug("request %d: %s\n" % |
|
1345 | self.ui.debug("request %d: %s\n" % | |
1346 | (reqcnt, " ".join(map(short, r)))) |
|
1346 | (reqcnt, " ".join(map(short, r)))) | |
1347 | for p in xrange(0, len(r), 10): |
|
1347 | for p in xrange(0, len(r), 10): | |
1348 | for b in remote.branches(r[p:p + 10]): |
|
1348 | for b in remote.branches(r[p:p + 10]): | |
1349 | self.ui.debug("received %s:%s\n" % |
|
1349 | self.ui.debug("received %s:%s\n" % | |
1350 | (short(b[0]), short(b[1]))) |
|
1350 | (short(b[0]), short(b[1]))) | |
1351 | unknown.append(b) |
|
1351 | unknown.append(b) | |
1352 |
|
1352 | |||
1353 | # do binary search on the branches we found |
|
1353 | # do binary search on the branches we found | |
1354 | while search: |
|
1354 | while search: | |
1355 | newsearch = [] |
|
1355 | newsearch = [] | |
1356 | reqcnt += 1 |
|
1356 | reqcnt += 1 | |
1357 | for n, l in zip(search, remote.between(search)): |
|
1357 | for n, l in zip(search, remote.between(search)): | |
1358 | l.append(n[1]) |
|
1358 | l.append(n[1]) | |
1359 | p = n[0] |
|
1359 | p = n[0] | |
1360 | f = 1 |
|
1360 | f = 1 | |
1361 | for i in l: |
|
1361 | for i in l: | |
1362 | self.ui.debug("narrowing %d:%d %s\n" % (f, len(l), short(i))) |
|
1362 | self.ui.debug("narrowing %d:%d %s\n" % (f, len(l), short(i))) | |
1363 | if i in m: |
|
1363 | if i in m: | |
1364 | if f <= 2: |
|
1364 | if f <= 2: | |
1365 | self.ui.debug("found new branch changeset %s\n" % |
|
1365 | self.ui.debug("found new branch changeset %s\n" % | |
1366 | short(p)) |
|
1366 | short(p)) | |
1367 | fetch.add(p) |
|
1367 | fetch.add(p) | |
1368 | base[i] = 1 |
|
1368 | base[i] = 1 | |
1369 | else: |
|
1369 | else: | |
1370 | self.ui.debug("narrowed branch search to %s:%s\n" |
|
1370 | self.ui.debug("narrowed branch search to %s:%s\n" | |
1371 | % (short(p), short(i))) |
|
1371 | % (short(p), short(i))) | |
1372 | newsearch.append((p, i)) |
|
1372 | newsearch.append((p, i)) | |
1373 | break |
|
1373 | break | |
1374 | p, f = i, f * 2 |
|
1374 | p, f = i, f * 2 | |
1375 | search = newsearch |
|
1375 | search = newsearch | |
1376 |
|
1376 | |||
1377 | # sanity check our fetch list |
|
1377 | # sanity check our fetch list | |
1378 | for f in fetch: |
|
1378 | for f in fetch: | |
1379 | if f in m: |
|
1379 | if f in m: | |
1380 | raise error.RepoError(_("already have changeset ") |
|
1380 | raise error.RepoError(_("already have changeset ") | |
1381 | + short(f[:4])) |
|
1381 | + short(f[:4])) | |
1382 |
|
1382 | |||
1383 | if base.keys() == [nullid]: |
|
1383 | if base.keys() == [nullid]: | |
1384 | if force: |
|
1384 | if force: | |
1385 | self.ui.warn(_("warning: repository is unrelated\n")) |
|
1385 | self.ui.warn(_("warning: repository is unrelated\n")) | |
1386 | else: |
|
1386 | else: | |
1387 | raise util.Abort(_("repository is unrelated")) |
|
1387 | raise util.Abort(_("repository is unrelated")) | |
1388 |
|
1388 | |||
1389 | self.ui.debug("found new changesets starting at " + |
|
1389 | self.ui.debug("found new changesets starting at " + | |
1390 | " ".join([short(f) for f in fetch]) + "\n") |
|
1390 | " ".join([short(f) for f in fetch]) + "\n") | |
1391 |
|
1391 | |||
1392 | self.ui.debug("%d total queries\n" % reqcnt) |
|
1392 | self.ui.debug("%d total queries\n" % reqcnt) | |
1393 |
|
1393 | |||
1394 | return base.keys(), list(fetch), heads |
|
1394 | return base.keys(), list(fetch), heads | |
1395 |
|
1395 | |||
1396 | def findoutgoing(self, remote, base=None, heads=None, force=False): |
|
1396 | def findoutgoing(self, remote, base=None, heads=None, force=False): | |
1397 | """Return list of nodes that are roots of subsets not in remote |
|
1397 | """Return list of nodes that are roots of subsets not in remote | |
1398 |
|
1398 | |||
1399 | If base dict is specified, assume that these nodes and their parents |
|
1399 | If base dict is specified, assume that these nodes and their parents | |
1400 | exist on the remote side. |
|
1400 | exist on the remote side. | |
1401 | If a list of heads is specified, return only nodes which are heads |
|
1401 | If a list of heads is specified, return only nodes which are heads | |
1402 | or ancestors of these heads, and return a second element which |
|
1402 | or ancestors of these heads, and return a second element which | |
1403 | contains all remote heads which get new children. |
|
1403 | contains all remote heads which get new children. | |
1404 | """ |
|
1404 | """ | |
1405 | if base is None: |
|
1405 | if base is None: | |
1406 | base = {} |
|
1406 | base = {} | |
1407 | self.findincoming(remote, base, heads, force=force) |
|
1407 | self.findincoming(remote, base, heads, force=force) | |
1408 |
|
1408 | |||
1409 | self.ui.debug("common changesets up to " |
|
1409 | self.ui.debug("common changesets up to " | |
1410 | + " ".join(map(short, base.keys())) + "\n") |
|
1410 | + " ".join(map(short, base.keys())) + "\n") | |
1411 |
|
1411 | |||
1412 | remain = set(self.changelog.nodemap) |
|
1412 | remain = set(self.changelog.nodemap) | |
1413 |
|
1413 | |||
1414 | # prune everything remote has from the tree |
|
1414 | # prune everything remote has from the tree | |
1415 | remain.remove(nullid) |
|
1415 | remain.remove(nullid) | |
1416 | remove = base.keys() |
|
1416 | remove = base.keys() | |
1417 | while remove: |
|
1417 | while remove: | |
1418 | n = remove.pop(0) |
|
1418 | n = remove.pop(0) | |
1419 | if n in remain: |
|
1419 | if n in remain: | |
1420 | remain.remove(n) |
|
1420 | remain.remove(n) | |
1421 | for p in self.changelog.parents(n): |
|
1421 | for p in self.changelog.parents(n): | |
1422 | remove.append(p) |
|
1422 | remove.append(p) | |
1423 |
|
1423 | |||
1424 | # find every node whose parents have been pruned |
|
1424 | # find every node whose parents have been pruned | |
1425 | subset = [] |
|
1425 | subset = [] | |
1426 | # find every remote head that will get new children |
|
1426 | # find every remote head that will get new children | |
1427 | updated_heads = set() |
|
1427 | updated_heads = set() | |
1428 | for n in remain: |
|
1428 | for n in remain: | |
1429 | p1, p2 = self.changelog.parents(n) |
|
1429 | p1, p2 = self.changelog.parents(n) | |
1430 | if p1 not in remain and p2 not in remain: |
|
1430 | if p1 not in remain and p2 not in remain: | |
1431 | subset.append(n) |
|
1431 | subset.append(n) | |
1432 | if heads: |
|
1432 | if heads: | |
1433 | if p1 in heads: |
|
1433 | if p1 in heads: | |
1434 | updated_heads.add(p1) |
|
1434 | updated_heads.add(p1) | |
1435 | if p2 in heads: |
|
1435 | if p2 in heads: | |
1436 | updated_heads.add(p2) |
|
1436 | updated_heads.add(p2) | |
1437 |
|
1437 | |||
1438 | # this is the set of all roots we have to push |
|
1438 | # this is the set of all roots we have to push | |
1439 | if heads: |
|
1439 | if heads: | |
1440 | return subset, list(updated_heads) |
|
1440 | return subset, list(updated_heads) | |
1441 | else: |
|
1441 | else: | |
1442 | return subset |
|
1442 | return subset | |
1443 |
|
1443 | |||
1444 | def pull(self, remote, heads=None, force=False): |
|
1444 | def pull(self, remote, heads=None, force=False): | |
1445 | lock = self.lock() |
|
1445 | lock = self.lock() | |
1446 | try: |
|
1446 | try: | |
1447 | common, fetch, rheads = self.findcommonincoming(remote, heads=heads, |
|
1447 | common, fetch, rheads = self.findcommonincoming(remote, heads=heads, | |
1448 | force=force) |
|
1448 | force=force) | |
1449 | if fetch == [nullid]: |
|
1449 | if fetch == [nullid]: | |
1450 | self.ui.status(_("requesting all changes\n")) |
|
1450 | self.ui.status(_("requesting all changes\n")) | |
1451 |
|
1451 | |||
1452 | if not fetch: |
|
1452 | if not fetch: | |
1453 | self.ui.status(_("no changes found\n")) |
|
1453 | self.ui.status(_("no changes found\n")) | |
1454 | return 0 |
|
1454 | return 0 | |
1455 |
|
1455 | |||
1456 | if heads is None and remote.capable('changegroupsubset'): |
|
1456 | if heads is None and remote.capable('changegroupsubset'): | |
1457 | heads = rheads |
|
1457 | heads = rheads | |
1458 |
|
1458 | |||
1459 | if heads is None: |
|
1459 | if heads is None: | |
1460 | cg = remote.changegroup(fetch, 'pull') |
|
1460 | cg = remote.changegroup(fetch, 'pull') | |
1461 | else: |
|
1461 | else: | |
1462 | if not remote.capable('changegroupsubset'): |
|
1462 | if not remote.capable('changegroupsubset'): | |
1463 | raise util.Abort(_("Partial pull cannot be done because " |
|
1463 | raise util.Abort(_("Partial pull cannot be done because " | |
1464 | "other repository doesn't support " |
|
1464 | "other repository doesn't support " | |
1465 | "changegroupsubset.")) |
|
1465 | "changegroupsubset.")) | |
1466 | cg = remote.changegroupsubset(fetch, heads, 'pull') |
|
1466 | cg = remote.changegroupsubset(fetch, heads, 'pull') | |
1467 | return self.addchangegroup(cg, 'pull', remote.url()) |
|
1467 | return self.addchangegroup(cg, 'pull', remote.url()) | |
1468 | finally: |
|
1468 | finally: | |
1469 | lock.release() |
|
1469 | lock.release() | |
1470 |
|
1470 | |||
1471 | def push(self, remote, force=False, revs=None): |
|
1471 | def push(self, remote, force=False, revs=None): | |
1472 | # there are two ways to push to remote repo: |
|
1472 | # there are two ways to push to remote repo: | |
1473 | # |
|
1473 | # | |
1474 | # addchangegroup assumes local user can lock remote |
|
1474 | # addchangegroup assumes local user can lock remote | |
1475 | # repo (local filesystem, old ssh servers). |
|
1475 | # repo (local filesystem, old ssh servers). | |
1476 | # |
|
1476 | # | |
1477 | # unbundle assumes local user cannot lock remote repo (new ssh |
|
1477 | # unbundle assumes local user cannot lock remote repo (new ssh | |
1478 | # servers, http servers). |
|
1478 | # servers, http servers). | |
1479 |
|
1479 | |||
1480 | if remote.capable('unbundle'): |
|
1480 | if remote.capable('unbundle'): | |
1481 | return self.push_unbundle(remote, force, revs) |
|
1481 | return self.push_unbundle(remote, force, revs) | |
1482 | return self.push_addchangegroup(remote, force, revs) |
|
1482 | return self.push_addchangegroup(remote, force, revs) | |
1483 |
|
1483 | |||
1484 | def prepush(self, remote, force, revs): |
|
1484 | def prepush(self, remote, force, revs): | |
1485 | '''Analyze the local and remote repositories and determine which |
|
1485 | '''Analyze the local and remote repositories and determine which | |
1486 | changesets need to be pushed to the remote. Return a tuple |
|
1486 | changesets need to be pushed to the remote. Return a tuple | |
1487 | (changegroup, remoteheads). changegroup is a readable file-like |
|
1487 | (changegroup, remoteheads). changegroup is a readable file-like | |
1488 | object whose read() returns successive changegroup chunks ready to |
|
1488 | object whose read() returns successive changegroup chunks ready to | |
1489 | be sent over the wire. remoteheads is the list of remote heads. |
|
1489 | be sent over the wire. remoteheads is the list of remote heads. | |
1490 | ''' |
|
1490 | ''' | |
1491 | common = {} |
|
1491 | common = {} | |
1492 | remote_heads = remote.heads() |
|
1492 | remote_heads = remote.heads() | |
1493 | inc = self.findincoming(remote, common, remote_heads, force=force) |
|
1493 | inc = self.findincoming(remote, common, remote_heads, force=force) | |
1494 |
|
1494 | |||
1495 | update, updated_heads = self.findoutgoing(remote, common, remote_heads) |
|
1495 | update, updated_heads = self.findoutgoing(remote, common, remote_heads) | |
1496 | msng_cl, bases, heads = self.changelog.nodesbetween(update, revs) |
|
1496 | msng_cl, bases, heads = self.changelog.nodesbetween(update, revs) | |
1497 |
|
1497 | |||
1498 | def checkbranch(lheads, rheads, updatelb): |
|
1498 | def checkbranch(lheads, rheads, updatelb): | |
1499 | ''' |
|
1499 | ''' | |
1500 | check whether there are more local heads than remote heads on |
|
1500 | check whether there are more local heads than remote heads on | |
1501 | a specific branch. |
|
1501 | a specific branch. | |
1502 |
|
1502 | |||
1503 | lheads: local branch heads |
|
1503 | lheads: local branch heads | |
1504 | rheads: remote branch heads |
|
1504 | rheads: remote branch heads | |
1505 | updatelb: outgoing local branch bases |
|
1505 | updatelb: outgoing local branch bases | |
1506 | ''' |
|
1506 | ''' | |
1507 |
|
1507 | |||
1508 | warn = 0 |
|
1508 | warn = 0 | |
1509 |
|
1509 | |||
1510 | if not revs and len(lheads) > len(rheads): |
|
1510 | if not revs and len(lheads) > len(rheads): | |
1511 | warn = 1 |
|
1511 | warn = 1 | |
1512 | else: |
|
1512 | else: | |
1513 | # add local heads involved in the push |
|
1513 | # add local heads involved in the push | |
1514 | updatelheads = [self.changelog.heads(x, lheads) |
|
1514 | updatelheads = [self.changelog.heads(x, lheads) | |
1515 | for x in updatelb] |
|
1515 | for x in updatelb] | |
1516 | newheads = set(sum(updatelheads, [])) & set(lheads) |
|
1516 | newheads = set(sum(updatelheads, [])) & set(lheads) | |
1517 |
|
1517 | |||
1518 | if not newheads: |
|
1518 | if not newheads: | |
1519 | return True |
|
1519 | return True | |
1520 |
|
1520 | |||
1521 | # add heads we don't have or that are not involved in the push |
|
1521 | # add heads we don't have or that are not involved in the push | |
1522 | for r in rheads: |
|
1522 | for r in rheads: | |
1523 | if r in self.changelog.nodemap: |
|
1523 | if r in self.changelog.nodemap: | |
1524 | desc = self.changelog.heads(r, heads) |
|
1524 | desc = self.changelog.heads(r, heads) | |
1525 | l = [h for h in heads if h in desc] |
|
1525 | l = [h for h in heads if h in desc] | |
1526 | if not l: |
|
1526 | if not l: | |
1527 | newheads.add(r) |
|
1527 | newheads.add(r) | |
1528 | else: |
|
1528 | else: | |
1529 | newheads.add(r) |
|
1529 | newheads.add(r) | |
1530 | if len(newheads) > len(rheads): |
|
1530 | if len(newheads) > len(rheads): | |
1531 | warn = 1 |
|
1531 | warn = 1 | |
1532 |
|
1532 | |||
1533 | if warn: |
|
1533 | if warn: | |
1534 | self.ui.warn(_("abort: push creates new remote heads!\n")) |
|
1534 | self.ui.warn(_("abort: push creates new remote heads!\n")) | |
1535 | self.ui.status(_("(did you forget to merge?" |
|
1535 | self.ui.status(_("(did you forget to merge?" | |
1536 | " use push -f to force)\n")) |
|
1536 | " use push -f to force)\n")) | |
1537 | return False |
|
1537 | return False | |
1538 | return True |
|
1538 | return True | |
1539 |
|
1539 | |||
1540 | if not bases: |
|
1540 | if not bases: | |
1541 | self.ui.status(_("no changes found\n")) |
|
1541 | self.ui.status(_("no changes found\n")) | |
1542 | return None, 1 |
|
1542 | return None, 1 | |
1543 | elif not force: |
|
1543 | elif not force: | |
1544 | # Check for each named branch if we're creating new remote heads. |
|
1544 | # Check for each named branch if we're creating new remote heads. | |
1545 | # To be a remote head after push, node must be either: |
|
1545 | # To be a remote head after push, node must be either: | |
1546 | # - unknown locally |
|
1546 | # - unknown locally | |
1547 | # - a local outgoing head descended from update |
|
1547 | # - a local outgoing head descended from update | |
1548 | # - a remote head that's known locally and not |
|
1548 | # - a remote head that's known locally and not | |
1549 | # ancestral to an outgoing head |
|
1549 | # ancestral to an outgoing head | |
1550 | # |
|
1550 | # | |
1551 | # New named branches cannot be created without --force. |
|
1551 | # New named branches cannot be created without --force. | |
1552 |
|
1552 | |||
1553 | if remote_heads != [nullid]: |
|
1553 | if remote_heads != [nullid]: | |
1554 | if remote.capable('branchmap'): |
|
1554 | if remote.capable('branchmap'): | |
1555 | remotebrheads = remote.branchmap() |
|
1555 | remotebrheads = remote.branchmap() | |
1556 |
|
1556 | |||
1557 | if not revs: |
|
1557 | if not revs: | |
1558 | localbrheads = self.branchmap() |
|
1558 | localbrheads = self.branchmap() | |
1559 | else: |
|
1559 | else: | |
1560 | localbrheads = {} |
|
1560 | localbrheads = {} | |
1561 | for n in heads: |
|
1561 | for n in heads: | |
1562 | branch = self[n].branch() |
|
1562 | branch = self[n].branch() | |
1563 | localbrheads.setdefault(branch, []).append(n) |
|
1563 | localbrheads.setdefault(branch, []).append(n) | |
1564 |
|
1564 | |||
1565 | newbranches = list(set(localbrheads) - set(remotebrheads)) |
|
1565 | newbranches = list(set(localbrheads) - set(remotebrheads)) | |
1566 | if newbranches: # new branch requires --force |
|
1566 | if newbranches: # new branch requires --force | |
1567 | branchnames = ', '.join("'%s'" % b for b in newbranches) |
|
1567 | branchnames = ', '.join("'%s'" % b for b in newbranches) | |
1568 | self.ui.warn(_("abort: push creates " |
|
1568 | self.ui.warn(_("abort: push creates " | |
1569 | "new remote branches: %s!\n") |
|
1569 | "new remote branches: %s!\n") | |
1570 | % branchnames) |
|
1570 | % branchnames) | |
1571 | # propose 'push -b .' in the msg too? |
|
1571 | # propose 'push -b .' in the msg too? | |
1572 | self.ui.status(_("(use 'hg push -f' to force)\n")) |
|
1572 | self.ui.status(_("(use 'hg push -f' to force)\n")) | |
1573 | return None, 0 |
|
1573 | return None, 0 | |
1574 | for branch, lheads in localbrheads.iteritems(): |
|
1574 | for branch, lheads in localbrheads.iteritems(): | |
1575 | if branch in remotebrheads: |
|
1575 | if branch in remotebrheads: | |
1576 | rheads = remotebrheads[branch] |
|
1576 | rheads = remotebrheads[branch] | |
1577 | if not checkbranch(lheads, rheads, update): |
|
1577 | if not checkbranch(lheads, rheads, update): | |
1578 | return None, 0 |
|
1578 | return None, 0 | |
1579 | else: |
|
1579 | else: | |
1580 | if not checkbranch(heads, remote_heads, update): |
|
1580 | if not checkbranch(heads, remote_heads, update): | |
1581 | return None, 0 |
|
1581 | return None, 0 | |
1582 |
|
1582 | |||
1583 | if inc: |
|
1583 | if inc: | |
1584 | self.ui.warn(_("note: unsynced remote changes!\n")) |
|
1584 | self.ui.warn(_("note: unsynced remote changes!\n")) | |
1585 |
|
1585 | |||
1586 |
|
1586 | |||
1587 | if revs is None: |
|
1587 | if revs is None: | |
1588 | # use the fast path, no race possible on push |
|
1588 | # use the fast path, no race possible on push | |
1589 | nodes = self.changelog.findmissing(common.keys()) |
|
1589 | nodes = self.changelog.findmissing(common.keys()) | |
1590 | cg = self._changegroup(nodes, 'push') |
|
1590 | cg = self._changegroup(nodes, 'push') | |
1591 | else: |
|
1591 | else: | |
1592 | cg = self.changegroupsubset(update, revs, 'push') |
|
1592 | cg = self.changegroupsubset(update, revs, 'push') | |
1593 | return cg, remote_heads |
|
1593 | return cg, remote_heads | |
1594 |
|
1594 | |||
1595 | def push_addchangegroup(self, remote, force, revs): |
|
1595 | def push_addchangegroup(self, remote, force, revs): | |
1596 | lock = remote.lock() |
|
1596 | lock = remote.lock() | |
1597 | try: |
|
1597 | try: | |
1598 | ret = self.prepush(remote, force, revs) |
|
1598 | ret = self.prepush(remote, force, revs) | |
1599 | if ret[0] is not None: |
|
1599 | if ret[0] is not None: | |
1600 | cg, remote_heads = ret |
|
1600 | cg, remote_heads = ret | |
1601 | return remote.addchangegroup(cg, 'push', self.url()) |
|
1601 | return remote.addchangegroup(cg, 'push', self.url()) | |
1602 | return ret[1] |
|
1602 | return ret[1] | |
1603 | finally: |
|
1603 | finally: | |
1604 | lock.release() |
|
1604 | lock.release() | |
1605 |
|
1605 | |||
1606 | def push_unbundle(self, remote, force, revs): |
|
1606 | def push_unbundle(self, remote, force, revs): | |
1607 | # local repo finds heads on server, finds out what revs it |
|
1607 | # local repo finds heads on server, finds out what revs it | |
1608 | # must push. once revs transferred, if server finds it has |
|
1608 | # must push. once revs transferred, if server finds it has | |
1609 | # different heads (someone else won commit/push race), server |
|
1609 | # different heads (someone else won commit/push race), server | |
1610 | # aborts. |
|
1610 | # aborts. | |
1611 |
|
1611 | |||
1612 | ret = self.prepush(remote, force, revs) |
|
1612 | ret = self.prepush(remote, force, revs) | |
1613 | if ret[0] is not None: |
|
1613 | if ret[0] is not None: | |
1614 | cg, remote_heads = ret |
|
1614 | cg, remote_heads = ret | |
1615 | if force: |
|
1615 | if force: | |
1616 | remote_heads = ['force'] |
|
1616 | remote_heads = ['force'] | |
1617 | return remote.unbundle(cg, remote_heads, 'push') |
|
1617 | return remote.unbundle(cg, remote_heads, 'push') | |
1618 | return ret[1] |
|
1618 | return ret[1] | |
1619 |
|
1619 | |||
1620 | def changegroupinfo(self, nodes, source): |
|
1620 | def changegroupinfo(self, nodes, source): | |
1621 | if self.ui.verbose or source == 'bundle': |
|
1621 | if self.ui.verbose or source == 'bundle': | |
1622 | self.ui.status(_("%d changesets found\n") % len(nodes)) |
|
1622 | self.ui.status(_("%d changesets found\n") % len(nodes)) | |
1623 | if self.ui.debugflag: |
|
1623 | if self.ui.debugflag: | |
1624 | self.ui.debug("list of changesets:\n") |
|
1624 | self.ui.debug("list of changesets:\n") | |
1625 | for node in nodes: |
|
1625 | for node in nodes: | |
1626 | self.ui.debug("%s\n" % hex(node)) |
|
1626 | self.ui.debug("%s\n" % hex(node)) | |
1627 |
|
1627 | |||
1628 | def changegroupsubset(self, bases, heads, source, extranodes=None): |
|
1628 | def changegroupsubset(self, bases, heads, source, extranodes=None): | |
1629 | """Compute a changegroup consisting of all the nodes that are |
|
1629 | """Compute a changegroup consisting of all the nodes that are | |
1630 | descendents of any of the bases and ancestors of any of the heads. |
|
1630 | descendents of any of the bases and ancestors of any of the heads. | |
1631 | Return a chunkbuffer object whose read() method will return |
|
1631 | Return a chunkbuffer object whose read() method will return | |
1632 | successive changegroup chunks. |
|
1632 | successive changegroup chunks. | |
1633 |
|
1633 | |||
1634 | It is fairly complex as determining which filenodes and which |
|
1634 | It is fairly complex as determining which filenodes and which | |
1635 | manifest nodes need to be included for the changeset to be complete |
|
1635 | manifest nodes need to be included for the changeset to be complete | |
1636 | is non-trivial. |
|
1636 | is non-trivial. | |
1637 |
|
1637 | |||
1638 | Another wrinkle is doing the reverse, figuring out which changeset in |
|
1638 | Another wrinkle is doing the reverse, figuring out which changeset in | |
1639 | the changegroup a particular filenode or manifestnode belongs to. |
|
1639 | the changegroup a particular filenode or manifestnode belongs to. | |
1640 |
|
1640 | |||
1641 | The caller can specify some nodes that must be included in the |
|
1641 | The caller can specify some nodes that must be included in the | |
1642 | changegroup using the extranodes argument. It should be a dict |
|
1642 | changegroup using the extranodes argument. It should be a dict | |
1643 | where the keys are the filenames (or 1 for the manifest), and the |
|
1643 | where the keys are the filenames (or 1 for the manifest), and the | |
1644 | values are lists of (node, linknode) tuples, where node is a wanted |
|
1644 | values are lists of (node, linknode) tuples, where node is a wanted | |
1645 | node and linknode is the changelog node that should be transmitted as |
|
1645 | node and linknode is the changelog node that should be transmitted as | |
1646 | the linkrev. |
|
1646 | the linkrev. | |
1647 | """ |
|
1647 | """ | |
1648 |
|
1648 | |||
1649 | # Set up some initial variables |
|
1649 | # Set up some initial variables | |
1650 | # Make it easy to refer to self.changelog |
|
1650 | # Make it easy to refer to self.changelog | |
1651 | cl = self.changelog |
|
1651 | cl = self.changelog | |
1652 | # msng is short for missing - compute the list of changesets in this |
|
1652 | # msng is short for missing - compute the list of changesets in this | |
1653 | # changegroup. |
|
1653 | # changegroup. | |
1654 | if not bases: |
|
1654 | if not bases: | |
1655 | bases = [nullid] |
|
1655 | bases = [nullid] | |
1656 | msng_cl_lst, bases, heads = cl.nodesbetween(bases, heads) |
|
1656 | msng_cl_lst, bases, heads = cl.nodesbetween(bases, heads) | |
1657 |
|
1657 | |||
1658 | if extranodes is None: |
|
1658 | if extranodes is None: | |
1659 | # can we go through the fast path ? |
|
1659 | # can we go through the fast path ? | |
1660 | heads.sort() |
|
1660 | heads.sort() | |
1661 | allheads = self.heads() |
|
1661 | allheads = self.heads() | |
1662 | allheads.sort() |
|
1662 | allheads.sort() | |
1663 | if heads == allheads: |
|
1663 | if heads == allheads: | |
1664 | return self._changegroup(msng_cl_lst, source) |
|
1664 | return self._changegroup(msng_cl_lst, source) | |
1665 |
|
1665 | |||
1666 | # slow path |
|
1666 | # slow path | |
1667 | self.hook('preoutgoing', throw=True, source=source) |
|
1667 | self.hook('preoutgoing', throw=True, source=source) | |
1668 |
|
1668 | |||
1669 | self.changegroupinfo(msng_cl_lst, source) |
|
1669 | self.changegroupinfo(msng_cl_lst, source) | |
1670 | # Some bases may turn out to be superfluous, and some heads may be |
|
1670 | # Some bases may turn out to be superfluous, and some heads may be | |
1671 | # too. nodesbetween will return the minimal set of bases and heads |
|
1671 | # too. nodesbetween will return the minimal set of bases and heads | |
1672 | # necessary to re-create the changegroup. |
|
1672 | # necessary to re-create the changegroup. | |
1673 |
|
1673 | |||
1674 | # Known heads are the list of heads that it is assumed the recipient |
|
1674 | # Known heads are the list of heads that it is assumed the recipient | |
1675 | # of this changegroup will know about. |
|
1675 | # of this changegroup will know about. | |
1676 | knownheads = set() |
|
1676 | knownheads = set() | |
1677 | # We assume that all parents of bases are known heads. |
|
1677 | # We assume that all parents of bases are known heads. | |
1678 | for n in bases: |
|
1678 | for n in bases: | |
1679 | knownheads.update(cl.parents(n)) |
|
1679 | knownheads.update(cl.parents(n)) | |
1680 | knownheads.discard(nullid) |
|
1680 | knownheads.discard(nullid) | |
1681 | knownheads = list(knownheads) |
|
1681 | knownheads = list(knownheads) | |
1682 | if knownheads: |
|
1682 | if knownheads: | |
1683 | # Now that we know what heads are known, we can compute which |
|
1683 | # Now that we know what heads are known, we can compute which | |
1684 | # changesets are known. The recipient must know about all |
|
1684 | # changesets are known. The recipient must know about all | |
1685 | # changesets required to reach the known heads from the null |
|
1685 | # changesets required to reach the known heads from the null | |
1686 | # changeset. |
|
1686 | # changeset. | |
1687 | has_cl_set, junk, junk = cl.nodesbetween(None, knownheads) |
|
1687 | has_cl_set, junk, junk = cl.nodesbetween(None, knownheads) | |
1688 | junk = None |
|
1688 | junk = None | |
1689 | # Transform the list into a set. |
|
1689 | # Transform the list into a set. | |
1690 | has_cl_set = set(has_cl_set) |
|
1690 | has_cl_set = set(has_cl_set) | |
1691 | else: |
|
1691 | else: | |
1692 | # If there were no known heads, the recipient cannot be assumed to |
|
1692 | # If there were no known heads, the recipient cannot be assumed to | |
1693 | # know about any changesets. |
|
1693 | # know about any changesets. | |
1694 | has_cl_set = set() |
|
1694 | has_cl_set = set() | |
1695 |
|
1695 | |||
1696 | # Make it easy to refer to self.manifest |
|
1696 | # Make it easy to refer to self.manifest | |
1697 | mnfst = self.manifest |
|
1697 | mnfst = self.manifest | |
1698 | # We don't know which manifests are missing yet |
|
1698 | # We don't know which manifests are missing yet | |
1699 | msng_mnfst_set = {} |
|
1699 | msng_mnfst_set = {} | |
1700 | # Nor do we know which filenodes are missing. |
|
1700 | # Nor do we know which filenodes are missing. | |
1701 | msng_filenode_set = {} |
|
1701 | msng_filenode_set = {} | |
1702 |
|
1702 | |||
1703 | junk = mnfst.index[len(mnfst) - 1] # Get around a bug in lazyindex |
|
1703 | junk = mnfst.index[len(mnfst) - 1] # Get around a bug in lazyindex | |
1704 | junk = None |
|
1704 | junk = None | |
1705 |
|
1705 | |||
1706 | # A changeset always belongs to itself, so the changenode lookup |
|
1706 | # A changeset always belongs to itself, so the changenode lookup | |
1707 | # function for a changenode is identity. |
|
1707 | # function for a changenode is identity. | |
1708 | def identity(x): |
|
1708 | def identity(x): | |
1709 | return x |
|
1709 | return x | |
1710 |
|
1710 | |||
1711 | # If we determine that a particular file or manifest node must be a |
|
1711 | # If we determine that a particular file or manifest node must be a | |
1712 | # node that the recipient of the changegroup will already have, we can |
|
1712 | # node that the recipient of the changegroup will already have, we can | |
1713 | # also assume the recipient will have all the parents. This function |
|
1713 | # also assume the recipient will have all the parents. This function | |
1714 | # prunes them from the set of missing nodes. |
|
1714 | # prunes them from the set of missing nodes. | |
1715 | def prune_parents(revlog, hasset, msngset): |
|
1715 | def prune_parents(revlog, hasset, msngset): | |
1716 | for r in revlog.ancestors(*[revlog.rev(n) for n in hasset]): |
|
1716 | for r in revlog.ancestors(*[revlog.rev(n) for n in hasset]): | |
1717 | msngset.pop(revlog.node(r), None) |
|
1717 | msngset.pop(revlog.node(r), None) | |
1718 |
|
1718 | |||
1719 | # This is a function generating function used to set up an environment |
|
|||
1720 | # for the inner function to execute in. |
|
|||
1721 | def manifest_and_file_collector(changedfileset): |
|
|||
1722 | # This is an information gathering function that gathers |
|
|||
1723 | # information from each changeset node that goes out as part of |
|
|||
1724 | # the changegroup. The information gathered is a list of which |
|
|||
1725 | # manifest nodes are potentially required (the recipient may |
|
|||
1726 | # already have them) and total list of all files which were |
|
|||
1727 | # changed in any changeset in the changegroup. |
|
|||
1728 | # |
|
|||
1729 | # We also remember the first changenode we saw any manifest |
|
|||
1730 | # referenced by so we can later determine which changenode 'owns' |
|
|||
1731 | # the manifest. |
|
|||
1732 | def collect_manifests_and_files(clnode): |
|
|||
1733 | c = cl.read(clnode) |
|
|||
1734 | for f in c[3]: |
|
|||
1735 | # This is to make sure we only have one instance of each |
|
|||
1736 | # filename string for each filename. |
|
|||
1737 | changedfileset.setdefault(f, f) |
|
|||
1738 | msng_mnfst_set.setdefault(c[0], clnode) |
|
|||
1739 | return collect_manifests_and_files |
|
|||
1740 |
|
||||
1741 | # Figure out which manifest nodes (of the ones we think might be part |
|
1719 | # Figure out which manifest nodes (of the ones we think might be part | |
1742 | # of the changegroup) the recipient must know about and remove them |
|
1720 | # of the changegroup) the recipient must know about and remove them | |
1743 | # from the changegroup. |
|
1721 | # from the changegroup. | |
1744 | def prune_manifests(): |
|
1722 | def prune_manifests(): | |
1745 | has_mnfst_set = set() |
|
1723 | has_mnfst_set = set() | |
1746 | for n in msng_mnfst_set: |
|
1724 | for n in msng_mnfst_set: | |
1747 | # If a 'missing' manifest thinks it belongs to a changenode |
|
1725 | # If a 'missing' manifest thinks it belongs to a changenode | |
1748 | # the recipient is assumed to have, obviously the recipient |
|
1726 | # the recipient is assumed to have, obviously the recipient | |
1749 | # must have that manifest. |
|
1727 | # must have that manifest. | |
1750 | linknode = cl.node(mnfst.linkrev(mnfst.rev(n))) |
|
1728 | linknode = cl.node(mnfst.linkrev(mnfst.rev(n))) | |
1751 | if linknode in has_cl_set: |
|
1729 | if linknode in has_cl_set: | |
1752 | has_mnfst_set.add(n) |
|
1730 | has_mnfst_set.add(n) | |
1753 | prune_parents(mnfst, has_mnfst_set, msng_mnfst_set) |
|
1731 | prune_parents(mnfst, has_mnfst_set, msng_mnfst_set) | |
1754 |
|
1732 | |||
1755 | # Use the information collected in collect_manifests_and_files to say |
|
1733 | # Use the information collected in collect_manifests_and_files to say | |
1756 | # which changenode any manifestnode belongs to. |
|
1734 | # which changenode any manifestnode belongs to. | |
1757 | def lookup_manifest_link(mnfstnode): |
|
1735 | def lookup_manifest_link(mnfstnode): | |
1758 | return msng_mnfst_set[mnfstnode] |
|
1736 | return msng_mnfst_set[mnfstnode] | |
1759 |
|
1737 | |||
1760 | # A function generating function that sets up the initial environment |
|
1738 | # A function generating function that sets up the initial environment | |
1761 | # the inner function. |
|
1739 | # the inner function. | |
1762 | def filenode_collector(changedfiles): |
|
1740 | def filenode_collector(changedfiles): | |
1763 | # This gathers information from each manifestnode included in the |
|
1741 | # This gathers information from each manifestnode included in the | |
1764 | # changegroup about which filenodes the manifest node references |
|
1742 | # changegroup about which filenodes the manifest node references | |
1765 | # so we can include those in the changegroup too. |
|
1743 | # so we can include those in the changegroup too. | |
1766 | # |
|
1744 | # | |
1767 | # It also remembers which changenode each filenode belongs to. It |
|
1745 | # It also remembers which changenode each filenode belongs to. It | |
1768 | # does this by assuming the a filenode belongs to the changenode |
|
1746 | # does this by assuming the a filenode belongs to the changenode | |
1769 | # the first manifest that references it belongs to. |
|
1747 | # the first manifest that references it belongs to. | |
1770 | def collect_msng_filenodes(mnfstnode): |
|
1748 | def collect_msng_filenodes(mnfstnode): | |
1771 | r = mnfst.rev(mnfstnode) |
|
1749 | r = mnfst.rev(mnfstnode) | |
1772 | if r - 1 in mnfst.parentrevs(r): |
|
1750 | if r - 1 in mnfst.parentrevs(r): | |
1773 | # If the previous rev is one of the parents, |
|
1751 | # If the previous rev is one of the parents, | |
1774 | # we only need to see a diff. |
|
1752 | # we only need to see a diff. | |
1775 | deltamf = mnfst.readdelta(mnfstnode) |
|
1753 | deltamf = mnfst.readdelta(mnfstnode) | |
1776 | # For each line in the delta |
|
1754 | # For each line in the delta | |
1777 | for f, fnode in deltamf.iteritems(): |
|
1755 | for f, fnode in deltamf.iteritems(): | |
1778 | f = changedfiles.get(f, None) |
|
1756 | f = changedfiles.get(f, None) | |
1779 | # And if the file is in the list of files we care |
|
1757 | # And if the file is in the list of files we care | |
1780 | # about. |
|
1758 | # about. | |
1781 | if f is not None: |
|
1759 | if f is not None: | |
1782 | # Get the changenode this manifest belongs to |
|
1760 | # Get the changenode this manifest belongs to | |
1783 | clnode = msng_mnfst_set[mnfstnode] |
|
1761 | clnode = msng_mnfst_set[mnfstnode] | |
1784 | # Create the set of filenodes for the file if |
|
1762 | # Create the set of filenodes for the file if | |
1785 | # there isn't one already. |
|
1763 | # there isn't one already. | |
1786 | ndset = msng_filenode_set.setdefault(f, {}) |
|
1764 | ndset = msng_filenode_set.setdefault(f, {}) | |
1787 | # And set the filenode's changelog node to the |
|
1765 | # And set the filenode's changelog node to the | |
1788 | # manifest's if it hasn't been set already. |
|
1766 | # manifest's if it hasn't been set already. | |
1789 | ndset.setdefault(fnode, clnode) |
|
1767 | ndset.setdefault(fnode, clnode) | |
1790 | else: |
|
1768 | else: | |
1791 | # Otherwise we need a full manifest. |
|
1769 | # Otherwise we need a full manifest. | |
1792 | m = mnfst.read(mnfstnode) |
|
1770 | m = mnfst.read(mnfstnode) | |
1793 | # For every file in we care about. |
|
1771 | # For every file in we care about. | |
1794 | for f in changedfiles: |
|
1772 | for f in changedfiles: | |
1795 | fnode = m.get(f, None) |
|
1773 | fnode = m.get(f, None) | |
1796 | # If it's in the manifest |
|
1774 | # If it's in the manifest | |
1797 | if fnode is not None: |
|
1775 | if fnode is not None: | |
1798 | # See comments above. |
|
1776 | # See comments above. | |
1799 | clnode = msng_mnfst_set[mnfstnode] |
|
1777 | clnode = msng_mnfst_set[mnfstnode] | |
1800 | ndset = msng_filenode_set.setdefault(f, {}) |
|
1778 | ndset = msng_filenode_set.setdefault(f, {}) | |
1801 | ndset.setdefault(fnode, clnode) |
|
1779 | ndset.setdefault(fnode, clnode) | |
1802 | return collect_msng_filenodes |
|
1780 | return collect_msng_filenodes | |
1803 |
|
1781 | |||
1804 | # We have a list of filenodes we think we need for a file, lets remove |
|
1782 | # We have a list of filenodes we think we need for a file, lets remove | |
1805 | # all those we know the recipient must have. |
|
1783 | # all those we know the recipient must have. | |
1806 | def prune_filenodes(f, filerevlog): |
|
1784 | def prune_filenodes(f, filerevlog): | |
1807 | msngset = msng_filenode_set[f] |
|
1785 | msngset = msng_filenode_set[f] | |
1808 | hasset = set() |
|
1786 | hasset = set() | |
1809 | # If a 'missing' filenode thinks it belongs to a changenode we |
|
1787 | # If a 'missing' filenode thinks it belongs to a changenode we | |
1810 | # assume the recipient must have, then the recipient must have |
|
1788 | # assume the recipient must have, then the recipient must have | |
1811 | # that filenode. |
|
1789 | # that filenode. | |
1812 | for n in msngset: |
|
1790 | for n in msngset: | |
1813 | clnode = cl.node(filerevlog.linkrev(filerevlog.rev(n))) |
|
1791 | clnode = cl.node(filerevlog.linkrev(filerevlog.rev(n))) | |
1814 | if clnode in has_cl_set: |
|
1792 | if clnode in has_cl_set: | |
1815 | hasset.add(n) |
|
1793 | hasset.add(n) | |
1816 | prune_parents(filerevlog, hasset, msngset) |
|
1794 | prune_parents(filerevlog, hasset, msngset) | |
1817 |
|
1795 | |||
1818 | # A function generator function that sets up the a context for the |
|
1796 | # A function generator function that sets up the a context for the | |
1819 | # inner function. |
|
1797 | # inner function. | |
1820 | def lookup_filenode_link_func(fname): |
|
1798 | def lookup_filenode_link_func(fname): | |
1821 | msngset = msng_filenode_set[fname] |
|
1799 | msngset = msng_filenode_set[fname] | |
1822 | # Lookup the changenode the filenode belongs to. |
|
1800 | # Lookup the changenode the filenode belongs to. | |
1823 | def lookup_filenode_link(fnode): |
|
1801 | def lookup_filenode_link(fnode): | |
1824 | return msngset[fnode] |
|
1802 | return msngset[fnode] | |
1825 | return lookup_filenode_link |
|
1803 | return lookup_filenode_link | |
1826 |
|
1804 | |||
1827 | # Add the nodes that were explicitly requested. |
|
1805 | # Add the nodes that were explicitly requested. | |
1828 | def add_extra_nodes(name, nodes): |
|
1806 | def add_extra_nodes(name, nodes): | |
1829 | if not extranodes or name not in extranodes: |
|
1807 | if not extranodes or name not in extranodes: | |
1830 | return |
|
1808 | return | |
1831 |
|
1809 | |||
1832 | for node, linknode in extranodes[name]: |
|
1810 | for node, linknode in extranodes[name]: | |
1833 | if node not in nodes: |
|
1811 | if node not in nodes: | |
1834 | nodes[node] = linknode |
|
1812 | nodes[node] = linknode | |
1835 |
|
1813 | |||
1836 | # Now that we have all theses utility functions to help out and |
|
1814 | # Now that we have all theses utility functions to help out and | |
1837 | # logically divide up the task, generate the group. |
|
1815 | # logically divide up the task, generate the group. | |
1838 | def gengroup(): |
|
1816 | def gengroup(): | |
1839 | # The set of changed files starts empty. |
|
1817 | # The set of changed files starts empty. | |
1840 | changedfiles = {} |
|
1818 | changedfiles = {} | |
|
1819 | collect = changegroup.collector(cl, msng_mnfst_set, changedfiles) | |||
|
1820 | ||||
1841 | # Create a changenode group generator that will call our functions |
|
1821 | # Create a changenode group generator that will call our functions | |
1842 | # back to lookup the owning changenode and collect information. |
|
1822 | # back to lookup the owning changenode and collect information. | |
1843 | group = cl.group(msng_cl_lst, identity, |
|
1823 | group = cl.group(msng_cl_lst, identity, collect) | |
1844 | manifest_and_file_collector(changedfiles)) |
|
|||
1845 | for chnk in group: |
|
1824 | for chnk in group: | |
1846 | yield chnk |
|
1825 | yield chnk | |
1847 |
|
1826 | |||
1848 | # The list of manifests has been collected by the generator |
|
1827 | # The list of manifests has been collected by the generator | |
1849 | # calling our functions back. |
|
1828 | # calling our functions back. | |
1850 | prune_manifests() |
|
1829 | prune_manifests() | |
1851 | add_extra_nodes(1, msng_mnfst_set) |
|
1830 | add_extra_nodes(1, msng_mnfst_set) | |
1852 | msng_mnfst_lst = msng_mnfst_set.keys() |
|
1831 | msng_mnfst_lst = msng_mnfst_set.keys() | |
1853 | # Sort the manifestnodes by revision number. |
|
1832 | # Sort the manifestnodes by revision number. | |
1854 | msng_mnfst_lst.sort(key=mnfst.rev) |
|
1833 | msng_mnfst_lst.sort(key=mnfst.rev) | |
1855 | # Create a generator for the manifestnodes that calls our lookup |
|
1834 | # Create a generator for the manifestnodes that calls our lookup | |
1856 | # and data collection functions back. |
|
1835 | # and data collection functions back. | |
1857 | group = mnfst.group(msng_mnfst_lst, lookup_manifest_link, |
|
1836 | group = mnfst.group(msng_mnfst_lst, lookup_manifest_link, | |
1858 | filenode_collector(changedfiles)) |
|
1837 | filenode_collector(changedfiles)) | |
1859 | for chnk in group: |
|
1838 | for chnk in group: | |
1860 | yield chnk |
|
1839 | yield chnk | |
1861 |
|
1840 | |||
1862 | # These are no longer needed, dereference and toss the memory for |
|
1841 | # These are no longer needed, dereference and toss the memory for | |
1863 | # them. |
|
1842 | # them. | |
1864 | msng_mnfst_lst = None |
|
1843 | msng_mnfst_lst = None | |
1865 | msng_mnfst_set.clear() |
|
1844 | msng_mnfst_set.clear() | |
1866 |
|
1845 | |||
1867 | if extranodes: |
|
1846 | if extranodes: | |
1868 | for fname in extranodes: |
|
1847 | for fname in extranodes: | |
1869 | if isinstance(fname, int): |
|
1848 | if isinstance(fname, int): | |
1870 | continue |
|
1849 | continue | |
1871 | msng_filenode_set.setdefault(fname, {}) |
|
1850 | msng_filenode_set.setdefault(fname, {}) | |
1872 | changedfiles[fname] = 1 |
|
1851 | changedfiles[fname] = 1 | |
1873 | # Go through all our files in order sorted by name. |
|
1852 | # Go through all our files in order sorted by name. | |
1874 | for fname in sorted(changedfiles): |
|
1853 | for fname in sorted(changedfiles): | |
1875 | filerevlog = self.file(fname) |
|
1854 | filerevlog = self.file(fname) | |
1876 | if not len(filerevlog): |
|
1855 | if not len(filerevlog): | |
1877 | raise util.Abort(_("empty or missing revlog for %s") % fname) |
|
1856 | raise util.Abort(_("empty or missing revlog for %s") % fname) | |
1878 | # Toss out the filenodes that the recipient isn't really |
|
1857 | # Toss out the filenodes that the recipient isn't really | |
1879 | # missing. |
|
1858 | # missing. | |
1880 | if fname in msng_filenode_set: |
|
1859 | if fname in msng_filenode_set: | |
1881 | prune_filenodes(fname, filerevlog) |
|
1860 | prune_filenodes(fname, filerevlog) | |
1882 | add_extra_nodes(fname, msng_filenode_set[fname]) |
|
1861 | add_extra_nodes(fname, msng_filenode_set[fname]) | |
1883 | msng_filenode_lst = msng_filenode_set[fname].keys() |
|
1862 | msng_filenode_lst = msng_filenode_set[fname].keys() | |
1884 | else: |
|
1863 | else: | |
1885 | msng_filenode_lst = [] |
|
1864 | msng_filenode_lst = [] | |
1886 | # If any filenodes are left, generate the group for them, |
|
1865 | # If any filenodes are left, generate the group for them, | |
1887 | # otherwise don't bother. |
|
1866 | # otherwise don't bother. | |
1888 | if len(msng_filenode_lst) > 0: |
|
1867 | if len(msng_filenode_lst) > 0: | |
1889 | yield changegroup.chunkheader(len(fname)) |
|
1868 | yield changegroup.chunkheader(len(fname)) | |
1890 | yield fname |
|
1869 | yield fname | |
1891 | # Sort the filenodes by their revision # |
|
1870 | # Sort the filenodes by their revision # | |
1892 | msng_filenode_lst.sort(key=filerevlog.rev) |
|
1871 | msng_filenode_lst.sort(key=filerevlog.rev) | |
1893 | # Create a group generator and only pass in a changenode |
|
1872 | # Create a group generator and only pass in a changenode | |
1894 | # lookup function as we need to collect no information |
|
1873 | # lookup function as we need to collect no information | |
1895 | # from filenodes. |
|
1874 | # from filenodes. | |
1896 | group = filerevlog.group(msng_filenode_lst, |
|
1875 | group = filerevlog.group(msng_filenode_lst, | |
1897 | lookup_filenode_link_func(fname)) |
|
1876 | lookup_filenode_link_func(fname)) | |
1898 | for chnk in group: |
|
1877 | for chnk in group: | |
1899 | yield chnk |
|
1878 | yield chnk | |
1900 | if fname in msng_filenode_set: |
|
1879 | if fname in msng_filenode_set: | |
1901 | # Don't need this anymore, toss it to free memory. |
|
1880 | # Don't need this anymore, toss it to free memory. | |
1902 | del msng_filenode_set[fname] |
|
1881 | del msng_filenode_set[fname] | |
1903 | # Signal that no more groups are left. |
|
1882 | # Signal that no more groups are left. | |
1904 | yield changegroup.closechunk() |
|
1883 | yield changegroup.closechunk() | |
1905 |
|
1884 | |||
1906 | if msng_cl_lst: |
|
1885 | if msng_cl_lst: | |
1907 | self.hook('outgoing', node=hex(msng_cl_lst[0]), source=source) |
|
1886 | self.hook('outgoing', node=hex(msng_cl_lst[0]), source=source) | |
1908 |
|
1887 | |||
1909 | return util.chunkbuffer(gengroup()) |
|
1888 | return util.chunkbuffer(gengroup()) | |
1910 |
|
1889 | |||
1911 | def changegroup(self, basenodes, source): |
|
1890 | def changegroup(self, basenodes, source): | |
1912 | # to avoid a race we use changegroupsubset() (issue1320) |
|
1891 | # to avoid a race we use changegroupsubset() (issue1320) | |
1913 | return self.changegroupsubset(basenodes, self.heads(), source) |
|
1892 | return self.changegroupsubset(basenodes, self.heads(), source) | |
1914 |
|
1893 | |||
1915 | def _changegroup(self, nodes, source): |
|
1894 | def _changegroup(self, nodes, source): | |
1916 | """Compute the changegroup of all nodes that we have that a recipient |
|
1895 | """Compute the changegroup of all nodes that we have that a recipient | |
1917 | doesn't. Return a chunkbuffer object whose read() method will return |
|
1896 | doesn't. Return a chunkbuffer object whose read() method will return | |
1918 | successive changegroup chunks. |
|
1897 | successive changegroup chunks. | |
1919 |
|
1898 | |||
1920 | This is much easier than the previous function as we can assume that |
|
1899 | This is much easier than the previous function as we can assume that | |
1921 | the recipient has any changenode we aren't sending them. |
|
1900 | the recipient has any changenode we aren't sending them. | |
1922 |
|
1901 | |||
1923 | nodes is the set of nodes to send""" |
|
1902 | nodes is the set of nodes to send""" | |
1924 |
|
1903 | |||
1925 | self.hook('preoutgoing', throw=True, source=source) |
|
1904 | self.hook('preoutgoing', throw=True, source=source) | |
1926 |
|
1905 | |||
1927 | cl = self.changelog |
|
1906 | cl = self.changelog | |
1928 | revset = set([cl.rev(n) for n in nodes]) |
|
1907 | revset = set([cl.rev(n) for n in nodes]) | |
1929 | self.changegroupinfo(nodes, source) |
|
1908 | self.changegroupinfo(nodes, source) | |
1930 |
|
1909 | |||
1931 | def identity(x): |
|
1910 | def identity(x): | |
1932 | return x |
|
1911 | return x | |
1933 |
|
1912 | |||
1934 | def gennodelst(log): |
|
1913 | def gennodelst(log): | |
1935 | for r in log: |
|
1914 | for r in log: | |
1936 | if log.linkrev(r) in revset: |
|
1915 | if log.linkrev(r) in revset: | |
1937 | yield log.node(r) |
|
1916 | yield log.node(r) | |
1938 |
|
1917 | |||
1939 | def changed_file_collector(changedfileset): |
|
|||
1940 | def collect_changed_files(clnode): |
|
|||
1941 | c = cl.read(clnode) |
|
|||
1942 | changedfileset.update(c[3]) |
|
|||
1943 | return collect_changed_files |
|
|||
1944 |
|
||||
1945 | def lookuprevlink_func(revlog): |
|
1918 | def lookuprevlink_func(revlog): | |
1946 | def lookuprevlink(n): |
|
1919 | def lookuprevlink(n): | |
1947 | return cl.node(revlog.linkrev(revlog.rev(n))) |
|
1920 | return cl.node(revlog.linkrev(revlog.rev(n))) | |
1948 | return lookuprevlink |
|
1921 | return lookuprevlink | |
1949 |
|
1922 | |||
1950 | def gengroup(): |
|
1923 | def gengroup(): | |
1951 | '''yield a sequence of changegroup chunks (strings)''' |
|
1924 | '''yield a sequence of changegroup chunks (strings)''' | |
1952 | # construct a list of all changed files |
|
1925 | # construct a list of all changed files | |
1953 |
changedfiles = |
|
1926 | changedfiles = {} | |
|
1927 | mmfs = {} | |||
|
1928 | collect = changegroup.collector(cl, mmfs, changedfiles) | |||
1954 |
|
1929 | |||
1955 | for chnk in cl.group(nodes, identity, |
|
1930 | for chnk in cl.group(nodes, identity, collect): | |
1956 | changed_file_collector(changedfiles)): |
|
|||
1957 | yield chnk |
|
1931 | yield chnk | |
1958 |
|
1932 | |||
1959 | mnfst = self.manifest |
|
1933 | mnfst = self.manifest | |
1960 | nodeiter = gennodelst(mnfst) |
|
1934 | nodeiter = gennodelst(mnfst) | |
1961 | for chnk in mnfst.group(nodeiter, lookuprevlink_func(mnfst)): |
|
1935 | for chnk in mnfst.group(nodeiter, lookuprevlink_func(mnfst)): | |
1962 | yield chnk |
|
1936 | yield chnk | |
1963 |
|
1937 | |||
1964 | for fname in sorted(changedfiles): |
|
1938 | for fname in sorted(changedfiles): | |
1965 | filerevlog = self.file(fname) |
|
1939 | filerevlog = self.file(fname) | |
1966 | if not len(filerevlog): |
|
1940 | if not len(filerevlog): | |
1967 | raise util.Abort(_("empty or missing revlog for %s") % fname) |
|
1941 | raise util.Abort(_("empty or missing revlog for %s") % fname) | |
1968 | nodeiter = gennodelst(filerevlog) |
|
1942 | nodeiter = gennodelst(filerevlog) | |
1969 | nodeiter = list(nodeiter) |
|
1943 | nodeiter = list(nodeiter) | |
1970 | if nodeiter: |
|
1944 | if nodeiter: | |
1971 | yield changegroup.chunkheader(len(fname)) |
|
1945 | yield changegroup.chunkheader(len(fname)) | |
1972 | yield fname |
|
1946 | yield fname | |
1973 | lookup = lookuprevlink_func(filerevlog) |
|
1947 | lookup = lookuprevlink_func(filerevlog) | |
1974 | for chnk in filerevlog.group(nodeiter, lookup): |
|
1948 | for chnk in filerevlog.group(nodeiter, lookup): | |
1975 | yield chnk |
|
1949 | yield chnk | |
1976 |
|
1950 | |||
1977 | yield changegroup.closechunk() |
|
1951 | yield changegroup.closechunk() | |
1978 |
|
1952 | |||
1979 | if nodes: |
|
1953 | if nodes: | |
1980 | self.hook('outgoing', node=hex(nodes[0]), source=source) |
|
1954 | self.hook('outgoing', node=hex(nodes[0]), source=source) | |
1981 |
|
1955 | |||
1982 | return util.chunkbuffer(gengroup()) |
|
1956 | return util.chunkbuffer(gengroup()) | |
1983 |
|
1957 | |||
1984 | def addchangegroup(self, source, srctype, url, emptyok=False): |
|
1958 | def addchangegroup(self, source, srctype, url, emptyok=False): | |
1985 | """add changegroup to repo. |
|
1959 | """add changegroup to repo. | |
1986 |
|
1960 | |||
1987 | return values: |
|
1961 | return values: | |
1988 | - nothing changed or no source: 0 |
|
1962 | - nothing changed or no source: 0 | |
1989 | - more heads than before: 1+added heads (2..n) |
|
1963 | - more heads than before: 1+added heads (2..n) | |
1990 | - less heads than before: -1-removed heads (-2..-n) |
|
1964 | - less heads than before: -1-removed heads (-2..-n) | |
1991 | - number of heads stays the same: 1 |
|
1965 | - number of heads stays the same: 1 | |
1992 | """ |
|
1966 | """ | |
1993 | def csmap(x): |
|
1967 | def csmap(x): | |
1994 | self.ui.debug("add changeset %s\n" % short(x)) |
|
1968 | self.ui.debug("add changeset %s\n" % short(x)) | |
1995 | return len(cl) |
|
1969 | return len(cl) | |
1996 |
|
1970 | |||
1997 | def revmap(x): |
|
1971 | def revmap(x): | |
1998 | return cl.rev(x) |
|
1972 | return cl.rev(x) | |
1999 |
|
1973 | |||
2000 | if not source: |
|
1974 | if not source: | |
2001 | return 0 |
|
1975 | return 0 | |
2002 |
|
1976 | |||
2003 | self.hook('prechangegroup', throw=True, source=srctype, url=url) |
|
1977 | self.hook('prechangegroup', throw=True, source=srctype, url=url) | |
2004 |
|
1978 | |||
2005 | changesets = files = revisions = 0 |
|
1979 | changesets = files = revisions = 0 | |
2006 |
|
1980 | |||
2007 | # write changelog data to temp files so concurrent readers will not see |
|
1981 | # write changelog data to temp files so concurrent readers will not see | |
2008 | # inconsistent view |
|
1982 | # inconsistent view | |
2009 | cl = self.changelog |
|
1983 | cl = self.changelog | |
2010 | cl.delayupdate() |
|
1984 | cl.delayupdate() | |
2011 | oldheads = len(cl.heads()) |
|
1985 | oldheads = len(cl.heads()) | |
2012 |
|
1986 | |||
2013 | tr = self.transaction() |
|
1987 | tr = self.transaction() | |
2014 | try: |
|
1988 | try: | |
2015 | trp = weakref.proxy(tr) |
|
1989 | trp = weakref.proxy(tr) | |
2016 | # pull off the changeset group |
|
1990 | # pull off the changeset group | |
2017 | self.ui.status(_("adding changesets\n")) |
|
1991 | self.ui.status(_("adding changesets\n")) | |
2018 | clstart = len(cl) |
|
1992 | clstart = len(cl) | |
2019 | chunkiter = changegroup.chunkiter(source) |
|
1993 | chunkiter = changegroup.chunkiter(source) | |
2020 | if cl.addgroup(chunkiter, csmap, trp) is None and not emptyok: |
|
1994 | if cl.addgroup(chunkiter, csmap, trp) is None and not emptyok: | |
2021 | raise util.Abort(_("received changelog group is empty")) |
|
1995 | raise util.Abort(_("received changelog group is empty")) | |
2022 | clend = len(cl) |
|
1996 | clend = len(cl) | |
2023 | changesets = clend - clstart |
|
1997 | changesets = clend - clstart | |
2024 |
|
1998 | |||
2025 | # pull off the manifest group |
|
1999 | # pull off the manifest group | |
2026 | self.ui.status(_("adding manifests\n")) |
|
2000 | self.ui.status(_("adding manifests\n")) | |
2027 | chunkiter = changegroup.chunkiter(source) |
|
2001 | chunkiter = changegroup.chunkiter(source) | |
2028 | # no need to check for empty manifest group here: |
|
2002 | # no need to check for empty manifest group here: | |
2029 | # if the result of the merge of 1 and 2 is the same in 3 and 4, |
|
2003 | # if the result of the merge of 1 and 2 is the same in 3 and 4, | |
2030 | # no new manifest will be created and the manifest group will |
|
2004 | # no new manifest will be created and the manifest group will | |
2031 | # be empty during the pull |
|
2005 | # be empty during the pull | |
2032 | self.manifest.addgroup(chunkiter, revmap, trp) |
|
2006 | self.manifest.addgroup(chunkiter, revmap, trp) | |
2033 |
|
2007 | |||
2034 | # process the files |
|
2008 | # process the files | |
2035 | self.ui.status(_("adding file changes\n")) |
|
2009 | self.ui.status(_("adding file changes\n")) | |
2036 | while 1: |
|
2010 | while 1: | |
2037 | f = changegroup.getchunk(source) |
|
2011 | f = changegroup.getchunk(source) | |
2038 | if not f: |
|
2012 | if not f: | |
2039 | break |
|
2013 | break | |
2040 | self.ui.debug("adding %s revisions\n" % f) |
|
2014 | self.ui.debug("adding %s revisions\n" % f) | |
2041 | fl = self.file(f) |
|
2015 | fl = self.file(f) | |
2042 | o = len(fl) |
|
2016 | o = len(fl) | |
2043 | chunkiter = changegroup.chunkiter(source) |
|
2017 | chunkiter = changegroup.chunkiter(source) | |
2044 | if fl.addgroup(chunkiter, revmap, trp) is None: |
|
2018 | if fl.addgroup(chunkiter, revmap, trp) is None: | |
2045 | raise util.Abort(_("received file revlog group is empty")) |
|
2019 | raise util.Abort(_("received file revlog group is empty")) | |
2046 | revisions += len(fl) - o |
|
2020 | revisions += len(fl) - o | |
2047 | files += 1 |
|
2021 | files += 1 | |
2048 |
|
2022 | |||
2049 | newheads = len(cl.heads()) |
|
2023 | newheads = len(cl.heads()) | |
2050 | heads = "" |
|
2024 | heads = "" | |
2051 | if oldheads and newheads != oldheads: |
|
2025 | if oldheads and newheads != oldheads: | |
2052 | heads = _(" (%+d heads)") % (newheads - oldheads) |
|
2026 | heads = _(" (%+d heads)") % (newheads - oldheads) | |
2053 |
|
2027 | |||
2054 | self.ui.status(_("added %d changesets" |
|
2028 | self.ui.status(_("added %d changesets" | |
2055 | " with %d changes to %d files%s\n") |
|
2029 | " with %d changes to %d files%s\n") | |
2056 | % (changesets, revisions, files, heads)) |
|
2030 | % (changesets, revisions, files, heads)) | |
2057 |
|
2031 | |||
2058 | if changesets > 0: |
|
2032 | if changesets > 0: | |
2059 | p = lambda: cl.writepending() and self.root or "" |
|
2033 | p = lambda: cl.writepending() and self.root or "" | |
2060 | self.hook('pretxnchangegroup', throw=True, |
|
2034 | self.hook('pretxnchangegroup', throw=True, | |
2061 | node=hex(cl.node(clstart)), source=srctype, |
|
2035 | node=hex(cl.node(clstart)), source=srctype, | |
2062 | url=url, pending=p) |
|
2036 | url=url, pending=p) | |
2063 |
|
2037 | |||
2064 | # make changelog see real files again |
|
2038 | # make changelog see real files again | |
2065 | cl.finalize(trp) |
|
2039 | cl.finalize(trp) | |
2066 |
|
2040 | |||
2067 | tr.close() |
|
2041 | tr.close() | |
2068 | finally: |
|
2042 | finally: | |
2069 | del tr |
|
2043 | del tr | |
2070 |
|
2044 | |||
2071 | if changesets > 0: |
|
2045 | if changesets > 0: | |
2072 | # forcefully update the on-disk branch cache |
|
2046 | # forcefully update the on-disk branch cache | |
2073 | self.ui.debug("updating the branch cache\n") |
|
2047 | self.ui.debug("updating the branch cache\n") | |
2074 | self.branchtags() |
|
2048 | self.branchtags() | |
2075 | self.hook("changegroup", node=hex(cl.node(clstart)), |
|
2049 | self.hook("changegroup", node=hex(cl.node(clstart)), | |
2076 | source=srctype, url=url) |
|
2050 | source=srctype, url=url) | |
2077 |
|
2051 | |||
2078 | for i in xrange(clstart, clend): |
|
2052 | for i in xrange(clstart, clend): | |
2079 | self.hook("incoming", node=hex(cl.node(i)), |
|
2053 | self.hook("incoming", node=hex(cl.node(i)), | |
2080 | source=srctype, url=url) |
|
2054 | source=srctype, url=url) | |
2081 |
|
2055 | |||
2082 | # never return 0 here: |
|
2056 | # never return 0 here: | |
2083 | if newheads < oldheads: |
|
2057 | if newheads < oldheads: | |
2084 | return newheads - oldheads - 1 |
|
2058 | return newheads - oldheads - 1 | |
2085 | else: |
|
2059 | else: | |
2086 | return newheads - oldheads + 1 |
|
2060 | return newheads - oldheads + 1 | |
2087 |
|
2061 | |||
2088 |
|
2062 | |||
2089 | def stream_in(self, remote): |
|
2063 | def stream_in(self, remote): | |
2090 | fp = remote.stream_out() |
|
2064 | fp = remote.stream_out() | |
2091 | l = fp.readline() |
|
2065 | l = fp.readline() | |
2092 | try: |
|
2066 | try: | |
2093 | resp = int(l) |
|
2067 | resp = int(l) | |
2094 | except ValueError: |
|
2068 | except ValueError: | |
2095 | raise error.ResponseError( |
|
2069 | raise error.ResponseError( | |
2096 | _('Unexpected response from remote server:'), l) |
|
2070 | _('Unexpected response from remote server:'), l) | |
2097 | if resp == 1: |
|
2071 | if resp == 1: | |
2098 | raise util.Abort(_('operation forbidden by server')) |
|
2072 | raise util.Abort(_('operation forbidden by server')) | |
2099 | elif resp == 2: |
|
2073 | elif resp == 2: | |
2100 | raise util.Abort(_('locking the remote repository failed')) |
|
2074 | raise util.Abort(_('locking the remote repository failed')) | |
2101 | elif resp != 0: |
|
2075 | elif resp != 0: | |
2102 | raise util.Abort(_('the server sent an unknown error code')) |
|
2076 | raise util.Abort(_('the server sent an unknown error code')) | |
2103 | self.ui.status(_('streaming all changes\n')) |
|
2077 | self.ui.status(_('streaming all changes\n')) | |
2104 | l = fp.readline() |
|
2078 | l = fp.readline() | |
2105 | try: |
|
2079 | try: | |
2106 | total_files, total_bytes = map(int, l.split(' ', 1)) |
|
2080 | total_files, total_bytes = map(int, l.split(' ', 1)) | |
2107 | except (ValueError, TypeError): |
|
2081 | except (ValueError, TypeError): | |
2108 | raise error.ResponseError( |
|
2082 | raise error.ResponseError( | |
2109 | _('Unexpected response from remote server:'), l) |
|
2083 | _('Unexpected response from remote server:'), l) | |
2110 | self.ui.status(_('%d files to transfer, %s of data\n') % |
|
2084 | self.ui.status(_('%d files to transfer, %s of data\n') % | |
2111 | (total_files, util.bytecount(total_bytes))) |
|
2085 | (total_files, util.bytecount(total_bytes))) | |
2112 | start = time.time() |
|
2086 | start = time.time() | |
2113 | for i in xrange(total_files): |
|
2087 | for i in xrange(total_files): | |
2114 | # XXX doesn't support '\n' or '\r' in filenames |
|
2088 | # XXX doesn't support '\n' or '\r' in filenames | |
2115 | l = fp.readline() |
|
2089 | l = fp.readline() | |
2116 | try: |
|
2090 | try: | |
2117 | name, size = l.split('\0', 1) |
|
2091 | name, size = l.split('\0', 1) | |
2118 | size = int(size) |
|
2092 | size = int(size) | |
2119 | except (ValueError, TypeError): |
|
2093 | except (ValueError, TypeError): | |
2120 | raise error.ResponseError( |
|
2094 | raise error.ResponseError( | |
2121 | _('Unexpected response from remote server:'), l) |
|
2095 | _('Unexpected response from remote server:'), l) | |
2122 | self.ui.debug('adding %s (%s)\n' % (name, util.bytecount(size))) |
|
2096 | self.ui.debug('adding %s (%s)\n' % (name, util.bytecount(size))) | |
2123 | # for backwards compat, name was partially encoded |
|
2097 | # for backwards compat, name was partially encoded | |
2124 | ofp = self.sopener(store.decodedir(name), 'w') |
|
2098 | ofp = self.sopener(store.decodedir(name), 'w') | |
2125 | for chunk in util.filechunkiter(fp, limit=size): |
|
2099 | for chunk in util.filechunkiter(fp, limit=size): | |
2126 | ofp.write(chunk) |
|
2100 | ofp.write(chunk) | |
2127 | ofp.close() |
|
2101 | ofp.close() | |
2128 | elapsed = time.time() - start |
|
2102 | elapsed = time.time() - start | |
2129 | if elapsed <= 0: |
|
2103 | if elapsed <= 0: | |
2130 | elapsed = 0.001 |
|
2104 | elapsed = 0.001 | |
2131 | self.ui.status(_('transferred %s in %.1f seconds (%s/sec)\n') % |
|
2105 | self.ui.status(_('transferred %s in %.1f seconds (%s/sec)\n') % | |
2132 | (util.bytecount(total_bytes), elapsed, |
|
2106 | (util.bytecount(total_bytes), elapsed, | |
2133 | util.bytecount(total_bytes / elapsed))) |
|
2107 | util.bytecount(total_bytes / elapsed))) | |
2134 | self.invalidate() |
|
2108 | self.invalidate() | |
2135 | return len(self.heads()) + 1 |
|
2109 | return len(self.heads()) + 1 | |
2136 |
|
2110 | |||
2137 | def clone(self, remote, heads=[], stream=False): |
|
2111 | def clone(self, remote, heads=[], stream=False): | |
2138 | '''clone remote repository. |
|
2112 | '''clone remote repository. | |
2139 |
|
2113 | |||
2140 | keyword arguments: |
|
2114 | keyword arguments: | |
2141 | heads: list of revs to clone (forces use of pull) |
|
2115 | heads: list of revs to clone (forces use of pull) | |
2142 | stream: use streaming clone if possible''' |
|
2116 | stream: use streaming clone if possible''' | |
2143 |
|
2117 | |||
2144 | # now, all clients that can request uncompressed clones can |
|
2118 | # now, all clients that can request uncompressed clones can | |
2145 | # read repo formats supported by all servers that can serve |
|
2119 | # read repo formats supported by all servers that can serve | |
2146 | # them. |
|
2120 | # them. | |
2147 |
|
2121 | |||
2148 | # if revlog format changes, client will have to check version |
|
2122 | # if revlog format changes, client will have to check version | |
2149 | # and format flags on "stream" capability, and use |
|
2123 | # and format flags on "stream" capability, and use | |
2150 | # uncompressed only if compatible. |
|
2124 | # uncompressed only if compatible. | |
2151 |
|
2125 | |||
2152 | if stream and not heads and remote.capable('stream'): |
|
2126 | if stream and not heads and remote.capable('stream'): | |
2153 | return self.stream_in(remote) |
|
2127 | return self.stream_in(remote) | |
2154 | return self.pull(remote, heads) |
|
2128 | return self.pull(remote, heads) | |
2155 |
|
2129 | |||
2156 | # used to avoid circular references so destructors work |
|
2130 | # used to avoid circular references so destructors work | |
2157 | def aftertrans(files): |
|
2131 | def aftertrans(files): | |
2158 | renamefiles = [tuple(t) for t in files] |
|
2132 | renamefiles = [tuple(t) for t in files] | |
2159 | def a(): |
|
2133 | def a(): | |
2160 | for src, dest in renamefiles: |
|
2134 | for src, dest in renamefiles: | |
2161 | util.rename(src, dest) |
|
2135 | util.rename(src, dest) | |
2162 | return a |
|
2136 | return a | |
2163 |
|
2137 | |||
2164 | def instance(ui, path, create): |
|
2138 | def instance(ui, path, create): | |
2165 | return localrepository(ui, util.drop_scheme('file', path), create) |
|
2139 | return localrepository(ui, util.drop_scheme('file', path), create) | |
2166 |
|
2140 | |||
2167 | def islocal(path): |
|
2141 | def islocal(path): | |
2168 | return True |
|
2142 | return True |
General Comments 0
You need to be logged in to leave comments.
Login now