Show More
@@ -1,2085 +1,2085 | |||||
1 | # merge.py - directory-level update/merge handling for Mercurial |
|
1 | # merge.py - directory-level update/merge handling for Mercurial | |
2 | # |
|
2 | # | |
3 | # Copyright 2006, 2007 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2006, 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 __future__ import absolute_import |
|
8 | from __future__ import absolute_import | |
9 |
|
9 | |||
10 | import errno |
|
10 | import errno | |
11 | import hashlib |
|
11 | import hashlib | |
12 | import shutil |
|
12 | import shutil | |
13 | import struct |
|
13 | import struct | |
14 |
|
14 | |||
15 | from .i18n import _ |
|
15 | from .i18n import _ | |
16 | from .node import ( |
|
16 | from .node import ( | |
17 | addednodeid, |
|
17 | addednodeid, | |
18 | bin, |
|
18 | bin, | |
19 | hex, |
|
19 | hex, | |
20 | modifiednodeid, |
|
20 | modifiednodeid, | |
21 | nullhex, |
|
21 | nullhex, | |
22 | nullid, |
|
22 | nullid, | |
23 | nullrev, |
|
23 | nullrev, | |
24 | ) |
|
24 | ) | |
25 | from . import ( |
|
25 | from . import ( | |
26 | copies, |
|
26 | copies, | |
27 | error, |
|
27 | error, | |
28 | filemerge, |
|
28 | filemerge, | |
29 | match as matchmod, |
|
29 | match as matchmod, | |
30 | obsutil, |
|
30 | obsutil, | |
31 | pycompat, |
|
31 | pycompat, | |
32 | scmutil, |
|
32 | scmutil, | |
33 | subrepoutil, |
|
33 | subrepoutil, | |
34 | util, |
|
34 | util, | |
35 | worker, |
|
35 | worker, | |
36 | ) |
|
36 | ) | |
37 |
|
37 | |||
38 | _pack = struct.pack |
|
38 | _pack = struct.pack | |
39 | _unpack = struct.unpack |
|
39 | _unpack = struct.unpack | |
40 |
|
40 | |||
41 | def _droponode(data): |
|
41 | def _droponode(data): | |
42 | # used for compatibility for v1 |
|
42 | # used for compatibility for v1 | |
43 | bits = data.split('\0') |
|
43 | bits = data.split('\0') | |
44 | bits = bits[:-2] + bits[-1:] |
|
44 | bits = bits[:-2] + bits[-1:] | |
45 | return '\0'.join(bits) |
|
45 | return '\0'.join(bits) | |
46 |
|
46 | |||
47 | class mergestate(object): |
|
47 | class mergestate(object): | |
48 | '''track 3-way merge state of individual files |
|
48 | '''track 3-way merge state of individual files | |
49 |
|
49 | |||
50 | The merge state is stored on disk when needed. Two files are used: one with |
|
50 | The merge state is stored on disk when needed. Two files are used: one with | |
51 | an old format (version 1), and one with a new format (version 2). Version 2 |
|
51 | an old format (version 1), and one with a new format (version 2). Version 2 | |
52 | stores a superset of the data in version 1, including new kinds of records |
|
52 | stores a superset of the data in version 1, including new kinds of records | |
53 | in the future. For more about the new format, see the documentation for |
|
53 | in the future. For more about the new format, see the documentation for | |
54 | `_readrecordsv2`. |
|
54 | `_readrecordsv2`. | |
55 |
|
55 | |||
56 | Each record can contain arbitrary content, and has an associated type. This |
|
56 | Each record can contain arbitrary content, and has an associated type. This | |
57 | `type` should be a letter. If `type` is uppercase, the record is mandatory: |
|
57 | `type` should be a letter. If `type` is uppercase, the record is mandatory: | |
58 | versions of Mercurial that don't support it should abort. If `type` is |
|
58 | versions of Mercurial that don't support it should abort. If `type` is | |
59 | lowercase, the record can be safely ignored. |
|
59 | lowercase, the record can be safely ignored. | |
60 |
|
60 | |||
61 | Currently known records: |
|
61 | Currently known records: | |
62 |
|
62 | |||
63 | L: the node of the "local" part of the merge (hexified version) |
|
63 | L: the node of the "local" part of the merge (hexified version) | |
64 | O: the node of the "other" part of the merge (hexified version) |
|
64 | O: the node of the "other" part of the merge (hexified version) | |
65 | F: a file to be merged entry |
|
65 | F: a file to be merged entry | |
66 | C: a change/delete or delete/change conflict |
|
66 | C: a change/delete or delete/change conflict | |
67 | D: a file that the external merge driver will merge internally |
|
67 | D: a file that the external merge driver will merge internally | |
68 | (experimental) |
|
68 | (experimental) | |
69 | P: a path conflict (file vs directory) |
|
69 | P: a path conflict (file vs directory) | |
70 | m: the external merge driver defined for this merge plus its run state |
|
70 | m: the external merge driver defined for this merge plus its run state | |
71 | (experimental) |
|
71 | (experimental) | |
72 | f: a (filename, dictionary) tuple of optional values for a given file |
|
72 | f: a (filename, dictionary) tuple of optional values for a given file | |
73 | X: unsupported mandatory record type (used in tests) |
|
73 | X: unsupported mandatory record type (used in tests) | |
74 | x: unsupported advisory record type (used in tests) |
|
74 | x: unsupported advisory record type (used in tests) | |
75 | l: the labels for the parts of the merge. |
|
75 | l: the labels for the parts of the merge. | |
76 |
|
76 | |||
77 | Merge driver run states (experimental): |
|
77 | Merge driver run states (experimental): | |
78 | u: driver-resolved files unmarked -- needs to be run next time we're about |
|
78 | u: driver-resolved files unmarked -- needs to be run next time we're about | |
79 | to resolve or commit |
|
79 | to resolve or commit | |
80 | m: driver-resolved files marked -- only needs to be run before commit |
|
80 | m: driver-resolved files marked -- only needs to be run before commit | |
81 | s: success/skipped -- does not need to be run any more |
|
81 | s: success/skipped -- does not need to be run any more | |
82 |
|
82 | |||
83 | Merge record states (stored in self._state, indexed by filename): |
|
83 | Merge record states (stored in self._state, indexed by filename): | |
84 | u: unresolved conflict |
|
84 | u: unresolved conflict | |
85 | r: resolved conflict |
|
85 | r: resolved conflict | |
86 | pu: unresolved path conflict (file conflicts with directory) |
|
86 | pu: unresolved path conflict (file conflicts with directory) | |
87 | pr: resolved path conflict |
|
87 | pr: resolved path conflict | |
88 | d: driver-resolved conflict |
|
88 | d: driver-resolved conflict | |
89 |
|
89 | |||
90 | The resolve command transitions between 'u' and 'r' for conflicts and |
|
90 | The resolve command transitions between 'u' and 'r' for conflicts and | |
91 | 'pu' and 'pr' for path conflicts. |
|
91 | 'pu' and 'pr' for path conflicts. | |
92 | ''' |
|
92 | ''' | |
93 | statepathv1 = 'merge/state' |
|
93 | statepathv1 = 'merge/state' | |
94 | statepathv2 = 'merge/state2' |
|
94 | statepathv2 = 'merge/state2' | |
95 |
|
95 | |||
96 | @staticmethod |
|
96 | @staticmethod | |
97 | def clean(repo, node=None, other=None, labels=None): |
|
97 | def clean(repo, node=None, other=None, labels=None): | |
98 | """Initialize a brand new merge state, removing any existing state on |
|
98 | """Initialize a brand new merge state, removing any existing state on | |
99 | disk.""" |
|
99 | disk.""" | |
100 | ms = mergestate(repo) |
|
100 | ms = mergestate(repo) | |
101 | ms.reset(node, other, labels) |
|
101 | ms.reset(node, other, labels) | |
102 | return ms |
|
102 | return ms | |
103 |
|
103 | |||
104 | @staticmethod |
|
104 | @staticmethod | |
105 | def read(repo): |
|
105 | def read(repo): | |
106 | """Initialize the merge state, reading it from disk.""" |
|
106 | """Initialize the merge state, reading it from disk.""" | |
107 | ms = mergestate(repo) |
|
107 | ms = mergestate(repo) | |
108 | ms._read() |
|
108 | ms._read() | |
109 | return ms |
|
109 | return ms | |
110 |
|
110 | |||
111 | def __init__(self, repo): |
|
111 | def __init__(self, repo): | |
112 | """Initialize the merge state. |
|
112 | """Initialize the merge state. | |
113 |
|
113 | |||
114 | Do not use this directly! Instead call read() or clean().""" |
|
114 | Do not use this directly! Instead call read() or clean().""" | |
115 | self._repo = repo |
|
115 | self._repo = repo | |
116 | self._dirty = False |
|
116 | self._dirty = False | |
117 | self._labels = None |
|
117 | self._labels = None | |
118 |
|
118 | |||
119 | def reset(self, node=None, other=None, labels=None): |
|
119 | def reset(self, node=None, other=None, labels=None): | |
120 | self._state = {} |
|
120 | self._state = {} | |
121 | self._stateextras = {} |
|
121 | self._stateextras = {} | |
122 | self._local = None |
|
122 | self._local = None | |
123 | self._other = None |
|
123 | self._other = None | |
124 | self._labels = labels |
|
124 | self._labels = labels | |
125 | for var in ('localctx', 'otherctx'): |
|
125 | for var in ('localctx', 'otherctx'): | |
126 | if var in vars(self): |
|
126 | if var in vars(self): | |
127 | delattr(self, var) |
|
127 | delattr(self, var) | |
128 | if node: |
|
128 | if node: | |
129 | self._local = node |
|
129 | self._local = node | |
130 | self._other = other |
|
130 | self._other = other | |
131 | self._readmergedriver = None |
|
131 | self._readmergedriver = None | |
132 | if self.mergedriver: |
|
132 | if self.mergedriver: | |
133 | self._mdstate = 's' |
|
133 | self._mdstate = 's' | |
134 | else: |
|
134 | else: | |
135 | self._mdstate = 'u' |
|
135 | self._mdstate = 'u' | |
136 | shutil.rmtree(self._repo.vfs.join('merge'), True) |
|
136 | shutil.rmtree(self._repo.vfs.join('merge'), True) | |
137 | self._results = {} |
|
137 | self._results = {} | |
138 | self._dirty = False |
|
138 | self._dirty = False | |
139 |
|
139 | |||
140 | def _read(self): |
|
140 | def _read(self): | |
141 | """Analyse each record content to restore a serialized state from disk |
|
141 | """Analyse each record content to restore a serialized state from disk | |
142 |
|
142 | |||
143 | This function process "record" entry produced by the de-serialization |
|
143 | This function process "record" entry produced by the de-serialization | |
144 | of on disk file. |
|
144 | of on disk file. | |
145 | """ |
|
145 | """ | |
146 | self._state = {} |
|
146 | self._state = {} | |
147 | self._stateextras = {} |
|
147 | self._stateextras = {} | |
148 | self._local = None |
|
148 | self._local = None | |
149 | self._other = None |
|
149 | self._other = None | |
150 | for var in ('localctx', 'otherctx'): |
|
150 | for var in ('localctx', 'otherctx'): | |
151 | if var in vars(self): |
|
151 | if var in vars(self): | |
152 | delattr(self, var) |
|
152 | delattr(self, var) | |
153 | self._readmergedriver = None |
|
153 | self._readmergedriver = None | |
154 | self._mdstate = 's' |
|
154 | self._mdstate = 's' | |
155 | unsupported = set() |
|
155 | unsupported = set() | |
156 | records = self._readrecords() |
|
156 | records = self._readrecords() | |
157 | for rtype, record in records: |
|
157 | for rtype, record in records: | |
158 | if rtype == 'L': |
|
158 | if rtype == 'L': | |
159 | self._local = bin(record) |
|
159 | self._local = bin(record) | |
160 | elif rtype == 'O': |
|
160 | elif rtype == 'O': | |
161 | self._other = bin(record) |
|
161 | self._other = bin(record) | |
162 | elif rtype == 'm': |
|
162 | elif rtype == 'm': | |
163 | bits = record.split('\0', 1) |
|
163 | bits = record.split('\0', 1) | |
164 | mdstate = bits[1] |
|
164 | mdstate = bits[1] | |
165 | if len(mdstate) != 1 or mdstate not in 'ums': |
|
165 | if len(mdstate) != 1 or mdstate not in 'ums': | |
166 | # the merge driver should be idempotent, so just rerun it |
|
166 | # the merge driver should be idempotent, so just rerun it | |
167 | mdstate = 'u' |
|
167 | mdstate = 'u' | |
168 |
|
168 | |||
169 | self._readmergedriver = bits[0] |
|
169 | self._readmergedriver = bits[0] | |
170 | self._mdstate = mdstate |
|
170 | self._mdstate = mdstate | |
171 | elif rtype in 'FDCP': |
|
171 | elif rtype in 'FDCP': | |
172 | bits = record.split('\0') |
|
172 | bits = record.split('\0') | |
173 | self._state[bits[0]] = bits[1:] |
|
173 | self._state[bits[0]] = bits[1:] | |
174 | elif rtype == 'f': |
|
174 | elif rtype == 'f': | |
175 | filename, rawextras = record.split('\0', 1) |
|
175 | filename, rawextras = record.split('\0', 1) | |
176 | extraparts = rawextras.split('\0') |
|
176 | extraparts = rawextras.split('\0') | |
177 | extras = {} |
|
177 | extras = {} | |
178 | i = 0 |
|
178 | i = 0 | |
179 | while i < len(extraparts): |
|
179 | while i < len(extraparts): | |
180 | extras[extraparts[i]] = extraparts[i + 1] |
|
180 | extras[extraparts[i]] = extraparts[i + 1] | |
181 | i += 2 |
|
181 | i += 2 | |
182 |
|
182 | |||
183 | self._stateextras[filename] = extras |
|
183 | self._stateextras[filename] = extras | |
184 | elif rtype == 'l': |
|
184 | elif rtype == 'l': | |
185 | labels = record.split('\0', 2) |
|
185 | labels = record.split('\0', 2) | |
186 | self._labels = [l for l in labels if len(l) > 0] |
|
186 | self._labels = [l for l in labels if len(l) > 0] | |
187 | elif not rtype.islower(): |
|
187 | elif not rtype.islower(): | |
188 | unsupported.add(rtype) |
|
188 | unsupported.add(rtype) | |
189 | self._results = {} |
|
189 | self._results = {} | |
190 | self._dirty = False |
|
190 | self._dirty = False | |
191 |
|
191 | |||
192 | if unsupported: |
|
192 | if unsupported: | |
193 | raise error.UnsupportedMergeRecords(unsupported) |
|
193 | raise error.UnsupportedMergeRecords(unsupported) | |
194 |
|
194 | |||
195 | def _readrecords(self): |
|
195 | def _readrecords(self): | |
196 | """Read merge state from disk and return a list of record (TYPE, data) |
|
196 | """Read merge state from disk and return a list of record (TYPE, data) | |
197 |
|
197 | |||
198 | We read data from both v1 and v2 files and decide which one to use. |
|
198 | We read data from both v1 and v2 files and decide which one to use. | |
199 |
|
199 | |||
200 | V1 has been used by version prior to 2.9.1 and contains less data than |
|
200 | V1 has been used by version prior to 2.9.1 and contains less data than | |
201 | v2. We read both versions and check if no data in v2 contradicts |
|
201 | v2. We read both versions and check if no data in v2 contradicts | |
202 | v1. If there is not contradiction we can safely assume that both v1 |
|
202 | v1. If there is not contradiction we can safely assume that both v1 | |
203 | and v2 were written at the same time and use the extract data in v2. If |
|
203 | and v2 were written at the same time and use the extract data in v2. If | |
204 | there is contradiction we ignore v2 content as we assume an old version |
|
204 | there is contradiction we ignore v2 content as we assume an old version | |
205 | of Mercurial has overwritten the mergestate file and left an old v2 |
|
205 | of Mercurial has overwritten the mergestate file and left an old v2 | |
206 | file around. |
|
206 | file around. | |
207 |
|
207 | |||
208 | returns list of record [(TYPE, data), ...]""" |
|
208 | returns list of record [(TYPE, data), ...]""" | |
209 | v1records = self._readrecordsv1() |
|
209 | v1records = self._readrecordsv1() | |
210 | v2records = self._readrecordsv2() |
|
210 | v2records = self._readrecordsv2() | |
211 | if self._v1v2match(v1records, v2records): |
|
211 | if self._v1v2match(v1records, v2records): | |
212 | return v2records |
|
212 | return v2records | |
213 | else: |
|
213 | else: | |
214 | # v1 file is newer than v2 file, use it |
|
214 | # v1 file is newer than v2 file, use it | |
215 | # we have to infer the "other" changeset of the merge |
|
215 | # we have to infer the "other" changeset of the merge | |
216 | # we cannot do better than that with v1 of the format |
|
216 | # we cannot do better than that with v1 of the format | |
217 | mctx = self._repo[None].parents()[-1] |
|
217 | mctx = self._repo[None].parents()[-1] | |
218 | v1records.append(('O', mctx.hex())) |
|
218 | v1records.append(('O', mctx.hex())) | |
219 | # add place holder "other" file node information |
|
219 | # add place holder "other" file node information | |
220 | # nobody is using it yet so we do no need to fetch the data |
|
220 | # nobody is using it yet so we do no need to fetch the data | |
221 | # if mctx was wrong `mctx[bits[-2]]` may fails. |
|
221 | # if mctx was wrong `mctx[bits[-2]]` may fails. | |
222 | for idx, r in enumerate(v1records): |
|
222 | for idx, r in enumerate(v1records): | |
223 | if r[0] == 'F': |
|
223 | if r[0] == 'F': | |
224 | bits = r[1].split('\0') |
|
224 | bits = r[1].split('\0') | |
225 | bits.insert(-2, '') |
|
225 | bits.insert(-2, '') | |
226 | v1records[idx] = (r[0], '\0'.join(bits)) |
|
226 | v1records[idx] = (r[0], '\0'.join(bits)) | |
227 | return v1records |
|
227 | return v1records | |
228 |
|
228 | |||
229 | def _v1v2match(self, v1records, v2records): |
|
229 | def _v1v2match(self, v1records, v2records): | |
230 | oldv2 = set() # old format version of v2 record |
|
230 | oldv2 = set() # old format version of v2 record | |
231 | for rec in v2records: |
|
231 | for rec in v2records: | |
232 | if rec[0] == 'L': |
|
232 | if rec[0] == 'L': | |
233 | oldv2.add(rec) |
|
233 | oldv2.add(rec) | |
234 | elif rec[0] == 'F': |
|
234 | elif rec[0] == 'F': | |
235 | # drop the onode data (not contained in v1) |
|
235 | # drop the onode data (not contained in v1) | |
236 | oldv2.add(('F', _droponode(rec[1]))) |
|
236 | oldv2.add(('F', _droponode(rec[1]))) | |
237 | for rec in v1records: |
|
237 | for rec in v1records: | |
238 | if rec not in oldv2: |
|
238 | if rec not in oldv2: | |
239 | return False |
|
239 | return False | |
240 | else: |
|
240 | else: | |
241 | return True |
|
241 | return True | |
242 |
|
242 | |||
243 | def _readrecordsv1(self): |
|
243 | def _readrecordsv1(self): | |
244 | """read on disk merge state for version 1 file |
|
244 | """read on disk merge state for version 1 file | |
245 |
|
245 | |||
246 | returns list of record [(TYPE, data), ...] |
|
246 | returns list of record [(TYPE, data), ...] | |
247 |
|
247 | |||
248 | Note: the "F" data from this file are one entry short |
|
248 | Note: the "F" data from this file are one entry short | |
249 | (no "other file node" entry) |
|
249 | (no "other file node" entry) | |
250 | """ |
|
250 | """ | |
251 | records = [] |
|
251 | records = [] | |
252 | try: |
|
252 | try: | |
253 | f = self._repo.vfs(self.statepathv1) |
|
253 | f = self._repo.vfs(self.statepathv1) | |
254 | for i, l in enumerate(f): |
|
254 | for i, l in enumerate(f): | |
255 | if i == 0: |
|
255 | if i == 0: | |
256 | records.append(('L', l[:-1])) |
|
256 | records.append(('L', l[:-1])) | |
257 | else: |
|
257 | else: | |
258 | records.append(('F', l[:-1])) |
|
258 | records.append(('F', l[:-1])) | |
259 | f.close() |
|
259 | f.close() | |
260 | except IOError as err: |
|
260 | except IOError as err: | |
261 | if err.errno != errno.ENOENT: |
|
261 | if err.errno != errno.ENOENT: | |
262 | raise |
|
262 | raise | |
263 | return records |
|
263 | return records | |
264 |
|
264 | |||
265 | def _readrecordsv2(self): |
|
265 | def _readrecordsv2(self): | |
266 | """read on disk merge state for version 2 file |
|
266 | """read on disk merge state for version 2 file | |
267 |
|
267 | |||
268 | This format is a list of arbitrary records of the form: |
|
268 | This format is a list of arbitrary records of the form: | |
269 |
|
269 | |||
270 | [type][length][content] |
|
270 | [type][length][content] | |
271 |
|
271 | |||
272 | `type` is a single character, `length` is a 4 byte integer, and |
|
272 | `type` is a single character, `length` is a 4 byte integer, and | |
273 | `content` is an arbitrary byte sequence of length `length`. |
|
273 | `content` is an arbitrary byte sequence of length `length`. | |
274 |
|
274 | |||
275 | Mercurial versions prior to 3.7 have a bug where if there are |
|
275 | Mercurial versions prior to 3.7 have a bug where if there are | |
276 | unsupported mandatory merge records, attempting to clear out the merge |
|
276 | unsupported mandatory merge records, attempting to clear out the merge | |
277 | state with hg update --clean or similar aborts. The 't' record type |
|
277 | state with hg update --clean or similar aborts. The 't' record type | |
278 | works around that by writing out what those versions treat as an |
|
278 | works around that by writing out what those versions treat as an | |
279 | advisory record, but later versions interpret as special: the first |
|
279 | advisory record, but later versions interpret as special: the first | |
280 | character is the 'real' record type and everything onwards is the data. |
|
280 | character is the 'real' record type and everything onwards is the data. | |
281 |
|
281 | |||
282 | Returns list of records [(TYPE, data), ...].""" |
|
282 | Returns list of records [(TYPE, data), ...].""" | |
283 | records = [] |
|
283 | records = [] | |
284 | try: |
|
284 | try: | |
285 | f = self._repo.vfs(self.statepathv2) |
|
285 | f = self._repo.vfs(self.statepathv2) | |
286 | data = f.read() |
|
286 | data = f.read() | |
287 | off = 0 |
|
287 | off = 0 | |
288 | end = len(data) |
|
288 | end = len(data) | |
289 | while off < end: |
|
289 | while off < end: | |
290 | rtype = data[off] |
|
290 | rtype = data[off] | |
291 | off += 1 |
|
291 | off += 1 | |
292 | length = _unpack('>I', data[off:(off + 4)])[0] |
|
292 | length = _unpack('>I', data[off:(off + 4)])[0] | |
293 | off += 4 |
|
293 | off += 4 | |
294 | record = data[off:(off + length)] |
|
294 | record = data[off:(off + length)] | |
295 | off += length |
|
295 | off += length | |
296 | if rtype == 't': |
|
296 | if rtype == 't': | |
297 | rtype, record = record[0], record[1:] |
|
297 | rtype, record = record[0], record[1:] | |
298 | records.append((rtype, record)) |
|
298 | records.append((rtype, record)) | |
299 | f.close() |
|
299 | f.close() | |
300 | except IOError as err: |
|
300 | except IOError as err: | |
301 | if err.errno != errno.ENOENT: |
|
301 | if err.errno != errno.ENOENT: | |
302 | raise |
|
302 | raise | |
303 | return records |
|
303 | return records | |
304 |
|
304 | |||
305 | @util.propertycache |
|
305 | @util.propertycache | |
306 | def mergedriver(self): |
|
306 | def mergedriver(self): | |
307 | # protect against the following: |
|
307 | # protect against the following: | |
308 | # - A configures a malicious merge driver in their hgrc, then |
|
308 | # - A configures a malicious merge driver in their hgrc, then | |
309 | # pauses the merge |
|
309 | # pauses the merge | |
310 | # - A edits their hgrc to remove references to the merge driver |
|
310 | # - A edits their hgrc to remove references to the merge driver | |
311 | # - A gives a copy of their entire repo, including .hg, to B |
|
311 | # - A gives a copy of their entire repo, including .hg, to B | |
312 | # - B inspects .hgrc and finds it to be clean |
|
312 | # - B inspects .hgrc and finds it to be clean | |
313 | # - B then continues the merge and the malicious merge driver |
|
313 | # - B then continues the merge and the malicious merge driver | |
314 | # gets invoked |
|
314 | # gets invoked | |
315 | configmergedriver = self._repo.ui.config('experimental', 'mergedriver') |
|
315 | configmergedriver = self._repo.ui.config('experimental', 'mergedriver') | |
316 | if (self._readmergedriver is not None |
|
316 | if (self._readmergedriver is not None | |
317 | and self._readmergedriver != configmergedriver): |
|
317 | and self._readmergedriver != configmergedriver): | |
318 | raise error.ConfigError( |
|
318 | raise error.ConfigError( | |
319 | _("merge driver changed since merge started"), |
|
319 | _("merge driver changed since merge started"), | |
320 | hint=_("revert merge driver change or abort merge")) |
|
320 | hint=_("revert merge driver change or abort merge")) | |
321 |
|
321 | |||
322 | return configmergedriver |
|
322 | return configmergedriver | |
323 |
|
323 | |||
324 | @util.propertycache |
|
324 | @util.propertycache | |
325 | def localctx(self): |
|
325 | def localctx(self): | |
326 | if self._local is None: |
|
326 | if self._local is None: | |
327 | msg = "localctx accessed but self._local isn't set" |
|
327 | msg = "localctx accessed but self._local isn't set" | |
328 | raise error.ProgrammingError(msg) |
|
328 | raise error.ProgrammingError(msg) | |
329 | return self._repo[self._local] |
|
329 | return self._repo[self._local] | |
330 |
|
330 | |||
331 | @util.propertycache |
|
331 | @util.propertycache | |
332 | def otherctx(self): |
|
332 | def otherctx(self): | |
333 | if self._other is None: |
|
333 | if self._other is None: | |
334 | msg = "otherctx accessed but self._other isn't set" |
|
334 | msg = "otherctx accessed but self._other isn't set" | |
335 | raise error.ProgrammingError(msg) |
|
335 | raise error.ProgrammingError(msg) | |
336 | return self._repo[self._other] |
|
336 | return self._repo[self._other] | |
337 |
|
337 | |||
338 | def active(self): |
|
338 | def active(self): | |
339 | """Whether mergestate is active. |
|
339 | """Whether mergestate is active. | |
340 |
|
340 | |||
341 | Returns True if there appears to be mergestate. This is a rough proxy |
|
341 | Returns True if there appears to be mergestate. This is a rough proxy | |
342 | for "is a merge in progress." |
|
342 | for "is a merge in progress." | |
343 | """ |
|
343 | """ | |
344 | # Check local variables before looking at filesystem for performance |
|
344 | # Check local variables before looking at filesystem for performance | |
345 | # reasons. |
|
345 | # reasons. | |
346 | return bool(self._local) or bool(self._state) or \ |
|
346 | return bool(self._local) or bool(self._state) or \ | |
347 | self._repo.vfs.exists(self.statepathv1) or \ |
|
347 | self._repo.vfs.exists(self.statepathv1) or \ | |
348 | self._repo.vfs.exists(self.statepathv2) |
|
348 | self._repo.vfs.exists(self.statepathv2) | |
349 |
|
349 | |||
350 | def commit(self): |
|
350 | def commit(self): | |
351 | """Write current state on disk (if necessary)""" |
|
351 | """Write current state on disk (if necessary)""" | |
352 | if self._dirty: |
|
352 | if self._dirty: | |
353 | records = self._makerecords() |
|
353 | records = self._makerecords() | |
354 | self._writerecords(records) |
|
354 | self._writerecords(records) | |
355 | self._dirty = False |
|
355 | self._dirty = False | |
356 |
|
356 | |||
357 | def _makerecords(self): |
|
357 | def _makerecords(self): | |
358 | records = [] |
|
358 | records = [] | |
359 | records.append(('L', hex(self._local))) |
|
359 | records.append(('L', hex(self._local))) | |
360 | records.append(('O', hex(self._other))) |
|
360 | records.append(('O', hex(self._other))) | |
361 | if self.mergedriver: |
|
361 | if self.mergedriver: | |
362 | records.append(('m', '\0'.join([ |
|
362 | records.append(('m', '\0'.join([ | |
363 | self.mergedriver, self._mdstate]))) |
|
363 | self.mergedriver, self._mdstate]))) | |
364 | # Write out state items. In all cases, the value of the state map entry |
|
364 | # Write out state items. In all cases, the value of the state map entry | |
365 | # is written as the contents of the record. The record type depends on |
|
365 | # is written as the contents of the record. The record type depends on | |
366 | # the type of state that is stored, and capital-letter records are used |
|
366 | # the type of state that is stored, and capital-letter records are used | |
367 | # to prevent older versions of Mercurial that do not support the feature |
|
367 | # to prevent older versions of Mercurial that do not support the feature | |
368 | # from loading them. |
|
368 | # from loading them. | |
369 | for filename, v in self._state.iteritems(): |
|
369 | for filename, v in self._state.iteritems(): | |
370 | if v[0] == 'd': |
|
370 | if v[0] == 'd': | |
371 | # Driver-resolved merge. These are stored in 'D' records. |
|
371 | # Driver-resolved merge. These are stored in 'D' records. | |
372 | records.append(('D', '\0'.join([filename] + v))) |
|
372 | records.append(('D', '\0'.join([filename] + v))) | |
373 | elif v[0] in ('pu', 'pr'): |
|
373 | elif v[0] in ('pu', 'pr'): | |
374 | # Path conflicts. These are stored in 'P' records. The current |
|
374 | # Path conflicts. These are stored in 'P' records. The current | |
375 | # resolution state ('pu' or 'pr') is stored within the record. |
|
375 | # resolution state ('pu' or 'pr') is stored within the record. | |
376 | records.append(('P', '\0'.join([filename] + v))) |
|
376 | records.append(('P', '\0'.join([filename] + v))) | |
377 | elif v[1] == nullhex or v[6] == nullhex: |
|
377 | elif v[1] == nullhex or v[6] == nullhex: | |
378 | # Change/Delete or Delete/Change conflicts. These are stored in |
|
378 | # Change/Delete or Delete/Change conflicts. These are stored in | |
379 | # 'C' records. v[1] is the local file, and is nullhex when the |
|
379 | # 'C' records. v[1] is the local file, and is nullhex when the | |
380 | # file is deleted locally ('dc'). v[6] is the remote file, and |
|
380 | # file is deleted locally ('dc'). v[6] is the remote file, and | |
381 | # is nullhex when the file is deleted remotely ('cd'). |
|
381 | # is nullhex when the file is deleted remotely ('cd'). | |
382 | records.append(('C', '\0'.join([filename] + v))) |
|
382 | records.append(('C', '\0'.join([filename] + v))) | |
383 | else: |
|
383 | else: | |
384 | # Normal files. These are stored in 'F' records. |
|
384 | # Normal files. These are stored in 'F' records. | |
385 | records.append(('F', '\0'.join([filename] + v))) |
|
385 | records.append(('F', '\0'.join([filename] + v))) | |
386 | for filename, extras in sorted(self._stateextras.iteritems()): |
|
386 | for filename, extras in sorted(self._stateextras.iteritems()): | |
387 | rawextras = '\0'.join('%s\0%s' % (k, v) for k, v in |
|
387 | rawextras = '\0'.join('%s\0%s' % (k, v) for k, v in | |
388 | extras.iteritems()) |
|
388 | extras.iteritems()) | |
389 | records.append(('f', '%s\0%s' % (filename, rawextras))) |
|
389 | records.append(('f', '%s\0%s' % (filename, rawextras))) | |
390 | if self._labels is not None: |
|
390 | if self._labels is not None: | |
391 | labels = '\0'.join(self._labels) |
|
391 | labels = '\0'.join(self._labels) | |
392 | records.append(('l', labels)) |
|
392 | records.append(('l', labels)) | |
393 | return records |
|
393 | return records | |
394 |
|
394 | |||
395 | def _writerecords(self, records): |
|
395 | def _writerecords(self, records): | |
396 | """Write current state on disk (both v1 and v2)""" |
|
396 | """Write current state on disk (both v1 and v2)""" | |
397 | self._writerecordsv1(records) |
|
397 | self._writerecordsv1(records) | |
398 | self._writerecordsv2(records) |
|
398 | self._writerecordsv2(records) | |
399 |
|
399 | |||
400 | def _writerecordsv1(self, records): |
|
400 | def _writerecordsv1(self, records): | |
401 | """Write current state on disk in a version 1 file""" |
|
401 | """Write current state on disk in a version 1 file""" | |
402 | f = self._repo.vfs(self.statepathv1, 'w') |
|
402 | f = self._repo.vfs(self.statepathv1, 'wb') | |
403 | irecords = iter(records) |
|
403 | irecords = iter(records) | |
404 | lrecords = next(irecords) |
|
404 | lrecords = next(irecords) | |
405 | assert lrecords[0] == 'L' |
|
405 | assert lrecords[0] == 'L' | |
406 | f.write(hex(self._local) + '\n') |
|
406 | f.write(hex(self._local) + '\n') | |
407 | for rtype, data in irecords: |
|
407 | for rtype, data in irecords: | |
408 | if rtype == 'F': |
|
408 | if rtype == 'F': | |
409 | f.write('%s\n' % _droponode(data)) |
|
409 | f.write('%s\n' % _droponode(data)) | |
410 | f.close() |
|
410 | f.close() | |
411 |
|
411 | |||
412 | def _writerecordsv2(self, records): |
|
412 | def _writerecordsv2(self, records): | |
413 | """Write current state on disk in a version 2 file |
|
413 | """Write current state on disk in a version 2 file | |
414 |
|
414 | |||
415 | See the docstring for _readrecordsv2 for why we use 't'.""" |
|
415 | See the docstring for _readrecordsv2 for why we use 't'.""" | |
416 | # these are the records that all version 2 clients can read |
|
416 | # these are the records that all version 2 clients can read | |
417 | whitelist = 'LOF' |
|
417 | whitelist = 'LOF' | |
418 | f = self._repo.vfs(self.statepathv2, 'w') |
|
418 | f = self._repo.vfs(self.statepathv2, 'wb') | |
419 | for key, data in records: |
|
419 | for key, data in records: | |
420 | assert len(key) == 1 |
|
420 | assert len(key) == 1 | |
421 | if key not in whitelist: |
|
421 | if key not in whitelist: | |
422 | key, data = 't', '%s%s' % (key, data) |
|
422 | key, data = 't', '%s%s' % (key, data) | |
423 | format = '>sI%is' % len(data) |
|
423 | format = '>sI%is' % len(data) | |
424 | f.write(_pack(format, key, len(data), data)) |
|
424 | f.write(_pack(format, key, len(data), data)) | |
425 | f.close() |
|
425 | f.close() | |
426 |
|
426 | |||
427 | def add(self, fcl, fco, fca, fd): |
|
427 | def add(self, fcl, fco, fca, fd): | |
428 | """add a new (potentially?) conflicting file the merge state |
|
428 | """add a new (potentially?) conflicting file the merge state | |
429 | fcl: file context for local, |
|
429 | fcl: file context for local, | |
430 | fco: file context for remote, |
|
430 | fco: file context for remote, | |
431 | fca: file context for ancestors, |
|
431 | fca: file context for ancestors, | |
432 | fd: file path of the resulting merge. |
|
432 | fd: file path of the resulting merge. | |
433 |
|
433 | |||
434 | note: also write the local version to the `.hg/merge` directory. |
|
434 | note: also write the local version to the `.hg/merge` directory. | |
435 | """ |
|
435 | """ | |
436 | if fcl.isabsent(): |
|
436 | if fcl.isabsent(): | |
437 | hash = nullhex |
|
437 | hash = nullhex | |
438 | else: |
|
438 | else: | |
439 | hash = hex(hashlib.sha1(fcl.path()).digest()) |
|
439 | hash = hex(hashlib.sha1(fcl.path()).digest()) | |
440 | self._repo.vfs.write('merge/' + hash, fcl.data()) |
|
440 | self._repo.vfs.write('merge/' + hash, fcl.data()) | |
441 | self._state[fd] = ['u', hash, fcl.path(), |
|
441 | self._state[fd] = ['u', hash, fcl.path(), | |
442 | fca.path(), hex(fca.filenode()), |
|
442 | fca.path(), hex(fca.filenode()), | |
443 | fco.path(), hex(fco.filenode()), |
|
443 | fco.path(), hex(fco.filenode()), | |
444 | fcl.flags()] |
|
444 | fcl.flags()] | |
445 | self._stateextras[fd] = {'ancestorlinknode': hex(fca.node())} |
|
445 | self._stateextras[fd] = {'ancestorlinknode': hex(fca.node())} | |
446 | self._dirty = True |
|
446 | self._dirty = True | |
447 |
|
447 | |||
448 | def addpath(self, path, frename, forigin): |
|
448 | def addpath(self, path, frename, forigin): | |
449 | """add a new conflicting path to the merge state |
|
449 | """add a new conflicting path to the merge state | |
450 | path: the path that conflicts |
|
450 | path: the path that conflicts | |
451 | frename: the filename the conflicting file was renamed to |
|
451 | frename: the filename the conflicting file was renamed to | |
452 | forigin: origin of the file ('l' or 'r' for local/remote) |
|
452 | forigin: origin of the file ('l' or 'r' for local/remote) | |
453 | """ |
|
453 | """ | |
454 | self._state[path] = ['pu', frename, forigin] |
|
454 | self._state[path] = ['pu', frename, forigin] | |
455 | self._dirty = True |
|
455 | self._dirty = True | |
456 |
|
456 | |||
457 | def __contains__(self, dfile): |
|
457 | def __contains__(self, dfile): | |
458 | return dfile in self._state |
|
458 | return dfile in self._state | |
459 |
|
459 | |||
460 | def __getitem__(self, dfile): |
|
460 | def __getitem__(self, dfile): | |
461 | return self._state[dfile][0] |
|
461 | return self._state[dfile][0] | |
462 |
|
462 | |||
463 | def __iter__(self): |
|
463 | def __iter__(self): | |
464 | return iter(sorted(self._state)) |
|
464 | return iter(sorted(self._state)) | |
465 |
|
465 | |||
466 | def files(self): |
|
466 | def files(self): | |
467 | return self._state.keys() |
|
467 | return self._state.keys() | |
468 |
|
468 | |||
469 | def mark(self, dfile, state): |
|
469 | def mark(self, dfile, state): | |
470 | self._state[dfile][0] = state |
|
470 | self._state[dfile][0] = state | |
471 | self._dirty = True |
|
471 | self._dirty = True | |
472 |
|
472 | |||
473 | def mdstate(self): |
|
473 | def mdstate(self): | |
474 | return self._mdstate |
|
474 | return self._mdstate | |
475 |
|
475 | |||
476 | def unresolved(self): |
|
476 | def unresolved(self): | |
477 | """Obtain the paths of unresolved files.""" |
|
477 | """Obtain the paths of unresolved files.""" | |
478 |
|
478 | |||
479 | for f, entry in self._state.iteritems(): |
|
479 | for f, entry in self._state.iteritems(): | |
480 | if entry[0] in ('u', 'pu'): |
|
480 | if entry[0] in ('u', 'pu'): | |
481 | yield f |
|
481 | yield f | |
482 |
|
482 | |||
483 | def driverresolved(self): |
|
483 | def driverresolved(self): | |
484 | """Obtain the paths of driver-resolved files.""" |
|
484 | """Obtain the paths of driver-resolved files.""" | |
485 |
|
485 | |||
486 | for f, entry in self._state.items(): |
|
486 | for f, entry in self._state.items(): | |
487 | if entry[0] == 'd': |
|
487 | if entry[0] == 'd': | |
488 | yield f |
|
488 | yield f | |
489 |
|
489 | |||
490 | def extras(self, filename): |
|
490 | def extras(self, filename): | |
491 | return self._stateextras.setdefault(filename, {}) |
|
491 | return self._stateextras.setdefault(filename, {}) | |
492 |
|
492 | |||
493 | def _resolve(self, preresolve, dfile, wctx): |
|
493 | def _resolve(self, preresolve, dfile, wctx): | |
494 | """rerun merge process for file path `dfile`""" |
|
494 | """rerun merge process for file path `dfile`""" | |
495 | if self[dfile] in 'rd': |
|
495 | if self[dfile] in 'rd': | |
496 | return True, 0 |
|
496 | return True, 0 | |
497 | stateentry = self._state[dfile] |
|
497 | stateentry = self._state[dfile] | |
498 | state, hash, lfile, afile, anode, ofile, onode, flags = stateentry |
|
498 | state, hash, lfile, afile, anode, ofile, onode, flags = stateentry | |
499 | octx = self._repo[self._other] |
|
499 | octx = self._repo[self._other] | |
500 | extras = self.extras(dfile) |
|
500 | extras = self.extras(dfile) | |
501 | anccommitnode = extras.get('ancestorlinknode') |
|
501 | anccommitnode = extras.get('ancestorlinknode') | |
502 | if anccommitnode: |
|
502 | if anccommitnode: | |
503 | actx = self._repo[anccommitnode] |
|
503 | actx = self._repo[anccommitnode] | |
504 | else: |
|
504 | else: | |
505 | actx = None |
|
505 | actx = None | |
506 | fcd = self._filectxorabsent(hash, wctx, dfile) |
|
506 | fcd = self._filectxorabsent(hash, wctx, dfile) | |
507 | fco = self._filectxorabsent(onode, octx, ofile) |
|
507 | fco = self._filectxorabsent(onode, octx, ofile) | |
508 | # TODO: move this to filectxorabsent |
|
508 | # TODO: move this to filectxorabsent | |
509 | fca = self._repo.filectx(afile, fileid=anode, changeid=actx) |
|
509 | fca = self._repo.filectx(afile, fileid=anode, changeid=actx) | |
510 | # "premerge" x flags |
|
510 | # "premerge" x flags | |
511 | flo = fco.flags() |
|
511 | flo = fco.flags() | |
512 | fla = fca.flags() |
|
512 | fla = fca.flags() | |
513 | if 'x' in flags + flo + fla and 'l' not in flags + flo + fla: |
|
513 | if 'x' in flags + flo + fla and 'l' not in flags + flo + fla: | |
514 | if fca.node() == nullid and flags != flo: |
|
514 | if fca.node() == nullid and flags != flo: | |
515 | if preresolve: |
|
515 | if preresolve: | |
516 | self._repo.ui.warn( |
|
516 | self._repo.ui.warn( | |
517 | _('warning: cannot merge flags for %s ' |
|
517 | _('warning: cannot merge flags for %s ' | |
518 | 'without common ancestor - keeping local flags\n') |
|
518 | 'without common ancestor - keeping local flags\n') | |
519 | % afile) |
|
519 | % afile) | |
520 | elif flags == fla: |
|
520 | elif flags == fla: | |
521 | flags = flo |
|
521 | flags = flo | |
522 | if preresolve: |
|
522 | if preresolve: | |
523 | # restore local |
|
523 | # restore local | |
524 | if hash != nullhex: |
|
524 | if hash != nullhex: | |
525 | f = self._repo.vfs('merge/' + hash) |
|
525 | f = self._repo.vfs('merge/' + hash) | |
526 | wctx[dfile].write(f.read(), flags) |
|
526 | wctx[dfile].write(f.read(), flags) | |
527 | f.close() |
|
527 | f.close() | |
528 | else: |
|
528 | else: | |
529 | wctx[dfile].remove(ignoremissing=True) |
|
529 | wctx[dfile].remove(ignoremissing=True) | |
530 | complete, r, deleted = filemerge.premerge(self._repo, wctx, |
|
530 | complete, r, deleted = filemerge.premerge(self._repo, wctx, | |
531 | self._local, lfile, fcd, |
|
531 | self._local, lfile, fcd, | |
532 | fco, fca, |
|
532 | fco, fca, | |
533 | labels=self._labels) |
|
533 | labels=self._labels) | |
534 | else: |
|
534 | else: | |
535 | complete, r, deleted = filemerge.filemerge(self._repo, wctx, |
|
535 | complete, r, deleted = filemerge.filemerge(self._repo, wctx, | |
536 | self._local, lfile, fcd, |
|
536 | self._local, lfile, fcd, | |
537 | fco, fca, |
|
537 | fco, fca, | |
538 | labels=self._labels) |
|
538 | labels=self._labels) | |
539 | if r is None: |
|
539 | if r is None: | |
540 | # no real conflict |
|
540 | # no real conflict | |
541 | del self._state[dfile] |
|
541 | del self._state[dfile] | |
542 | self._stateextras.pop(dfile, None) |
|
542 | self._stateextras.pop(dfile, None) | |
543 | self._dirty = True |
|
543 | self._dirty = True | |
544 | elif not r: |
|
544 | elif not r: | |
545 | self.mark(dfile, 'r') |
|
545 | self.mark(dfile, 'r') | |
546 |
|
546 | |||
547 | if complete: |
|
547 | if complete: | |
548 | action = None |
|
548 | action = None | |
549 | if deleted: |
|
549 | if deleted: | |
550 | if fcd.isabsent(): |
|
550 | if fcd.isabsent(): | |
551 | # dc: local picked. Need to drop if present, which may |
|
551 | # dc: local picked. Need to drop if present, which may | |
552 | # happen on re-resolves. |
|
552 | # happen on re-resolves. | |
553 | action = 'f' |
|
553 | action = 'f' | |
554 | else: |
|
554 | else: | |
555 | # cd: remote picked (or otherwise deleted) |
|
555 | # cd: remote picked (or otherwise deleted) | |
556 | action = 'r' |
|
556 | action = 'r' | |
557 | else: |
|
557 | else: | |
558 | if fcd.isabsent(): # dc: remote picked |
|
558 | if fcd.isabsent(): # dc: remote picked | |
559 | action = 'g' |
|
559 | action = 'g' | |
560 | elif fco.isabsent(): # cd: local picked |
|
560 | elif fco.isabsent(): # cd: local picked | |
561 | if dfile in self.localctx: |
|
561 | if dfile in self.localctx: | |
562 | action = 'am' |
|
562 | action = 'am' | |
563 | else: |
|
563 | else: | |
564 | action = 'a' |
|
564 | action = 'a' | |
565 | # else: regular merges (no action necessary) |
|
565 | # else: regular merges (no action necessary) | |
566 | self._results[dfile] = r, action |
|
566 | self._results[dfile] = r, action | |
567 |
|
567 | |||
568 | return complete, r |
|
568 | return complete, r | |
569 |
|
569 | |||
570 | def _filectxorabsent(self, hexnode, ctx, f): |
|
570 | def _filectxorabsent(self, hexnode, ctx, f): | |
571 | if hexnode == nullhex: |
|
571 | if hexnode == nullhex: | |
572 | return filemerge.absentfilectx(ctx, f) |
|
572 | return filemerge.absentfilectx(ctx, f) | |
573 | else: |
|
573 | else: | |
574 | return ctx[f] |
|
574 | return ctx[f] | |
575 |
|
575 | |||
576 | def preresolve(self, dfile, wctx): |
|
576 | def preresolve(self, dfile, wctx): | |
577 | """run premerge process for dfile |
|
577 | """run premerge process for dfile | |
578 |
|
578 | |||
579 | Returns whether the merge is complete, and the exit code.""" |
|
579 | Returns whether the merge is complete, and the exit code.""" | |
580 | return self._resolve(True, dfile, wctx) |
|
580 | return self._resolve(True, dfile, wctx) | |
581 |
|
581 | |||
582 | def resolve(self, dfile, wctx): |
|
582 | def resolve(self, dfile, wctx): | |
583 | """run merge process (assuming premerge was run) for dfile |
|
583 | """run merge process (assuming premerge was run) for dfile | |
584 |
|
584 | |||
585 | Returns the exit code of the merge.""" |
|
585 | Returns the exit code of the merge.""" | |
586 | return self._resolve(False, dfile, wctx)[1] |
|
586 | return self._resolve(False, dfile, wctx)[1] | |
587 |
|
587 | |||
588 | def counts(self): |
|
588 | def counts(self): | |
589 | """return counts for updated, merged and removed files in this |
|
589 | """return counts for updated, merged and removed files in this | |
590 | session""" |
|
590 | session""" | |
591 | updated, merged, removed = 0, 0, 0 |
|
591 | updated, merged, removed = 0, 0, 0 | |
592 | for r, action in self._results.itervalues(): |
|
592 | for r, action in self._results.itervalues(): | |
593 | if r is None: |
|
593 | if r is None: | |
594 | updated += 1 |
|
594 | updated += 1 | |
595 | elif r == 0: |
|
595 | elif r == 0: | |
596 | if action == 'r': |
|
596 | if action == 'r': | |
597 | removed += 1 |
|
597 | removed += 1 | |
598 | else: |
|
598 | else: | |
599 | merged += 1 |
|
599 | merged += 1 | |
600 | return updated, merged, removed |
|
600 | return updated, merged, removed | |
601 |
|
601 | |||
602 | def unresolvedcount(self): |
|
602 | def unresolvedcount(self): | |
603 | """get unresolved count for this merge (persistent)""" |
|
603 | """get unresolved count for this merge (persistent)""" | |
604 | return len(list(self.unresolved())) |
|
604 | return len(list(self.unresolved())) | |
605 |
|
605 | |||
606 | def actions(self): |
|
606 | def actions(self): | |
607 | """return lists of actions to perform on the dirstate""" |
|
607 | """return lists of actions to perform on the dirstate""" | |
608 | actions = {'r': [], 'f': [], 'a': [], 'am': [], 'g': []} |
|
608 | actions = {'r': [], 'f': [], 'a': [], 'am': [], 'g': []} | |
609 | for f, (r, action) in self._results.iteritems(): |
|
609 | for f, (r, action) in self._results.iteritems(): | |
610 | if action is not None: |
|
610 | if action is not None: | |
611 | actions[action].append((f, None, "merge result")) |
|
611 | actions[action].append((f, None, "merge result")) | |
612 | return actions |
|
612 | return actions | |
613 |
|
613 | |||
614 | def recordactions(self): |
|
614 | def recordactions(self): | |
615 | """record remove/add/get actions in the dirstate""" |
|
615 | """record remove/add/get actions in the dirstate""" | |
616 | branchmerge = self._repo.dirstate.p2() != nullid |
|
616 | branchmerge = self._repo.dirstate.p2() != nullid | |
617 | recordupdates(self._repo, self.actions(), branchmerge) |
|
617 | recordupdates(self._repo, self.actions(), branchmerge) | |
618 |
|
618 | |||
619 | def queueremove(self, f): |
|
619 | def queueremove(self, f): | |
620 | """queues a file to be removed from the dirstate |
|
620 | """queues a file to be removed from the dirstate | |
621 |
|
621 | |||
622 | Meant for use by custom merge drivers.""" |
|
622 | Meant for use by custom merge drivers.""" | |
623 | self._results[f] = 0, 'r' |
|
623 | self._results[f] = 0, 'r' | |
624 |
|
624 | |||
625 | def queueadd(self, f): |
|
625 | def queueadd(self, f): | |
626 | """queues a file to be added to the dirstate |
|
626 | """queues a file to be added to the dirstate | |
627 |
|
627 | |||
628 | Meant for use by custom merge drivers.""" |
|
628 | Meant for use by custom merge drivers.""" | |
629 | self._results[f] = 0, 'a' |
|
629 | self._results[f] = 0, 'a' | |
630 |
|
630 | |||
631 | def queueget(self, f): |
|
631 | def queueget(self, f): | |
632 | """queues a file to be marked modified in the dirstate |
|
632 | """queues a file to be marked modified in the dirstate | |
633 |
|
633 | |||
634 | Meant for use by custom merge drivers.""" |
|
634 | Meant for use by custom merge drivers.""" | |
635 | self._results[f] = 0, 'g' |
|
635 | self._results[f] = 0, 'g' | |
636 |
|
636 | |||
637 | def _getcheckunknownconfig(repo, section, name): |
|
637 | def _getcheckunknownconfig(repo, section, name): | |
638 | config = repo.ui.config(section, name) |
|
638 | config = repo.ui.config(section, name) | |
639 | valid = ['abort', 'ignore', 'warn'] |
|
639 | valid = ['abort', 'ignore', 'warn'] | |
640 | if config not in valid: |
|
640 | if config not in valid: | |
641 | validstr = ', '.join(["'" + v + "'" for v in valid]) |
|
641 | validstr = ', '.join(["'" + v + "'" for v in valid]) | |
642 | raise error.ConfigError(_("%s.%s not valid " |
|
642 | raise error.ConfigError(_("%s.%s not valid " | |
643 | "('%s' is none of %s)") |
|
643 | "('%s' is none of %s)") | |
644 | % (section, name, config, validstr)) |
|
644 | % (section, name, config, validstr)) | |
645 | return config |
|
645 | return config | |
646 |
|
646 | |||
647 | def _checkunknownfile(repo, wctx, mctx, f, f2=None): |
|
647 | def _checkunknownfile(repo, wctx, mctx, f, f2=None): | |
648 | if wctx.isinmemory(): |
|
648 | if wctx.isinmemory(): | |
649 | # Nothing to do in IMM because nothing in the "working copy" can be an |
|
649 | # Nothing to do in IMM because nothing in the "working copy" can be an | |
650 | # unknown file. |
|
650 | # unknown file. | |
651 | # |
|
651 | # | |
652 | # Note that we should bail out here, not in ``_checkunknownfiles()``, |
|
652 | # Note that we should bail out here, not in ``_checkunknownfiles()``, | |
653 | # because that function does other useful work. |
|
653 | # because that function does other useful work. | |
654 | return False |
|
654 | return False | |
655 |
|
655 | |||
656 | if f2 is None: |
|
656 | if f2 is None: | |
657 | f2 = f |
|
657 | f2 = f | |
658 | return (repo.wvfs.audit.check(f) |
|
658 | return (repo.wvfs.audit.check(f) | |
659 | and repo.wvfs.isfileorlink(f) |
|
659 | and repo.wvfs.isfileorlink(f) | |
660 | and repo.dirstate.normalize(f) not in repo.dirstate |
|
660 | and repo.dirstate.normalize(f) not in repo.dirstate | |
661 | and mctx[f2].cmp(wctx[f])) |
|
661 | and mctx[f2].cmp(wctx[f])) | |
662 |
|
662 | |||
663 | class _unknowndirschecker(object): |
|
663 | class _unknowndirschecker(object): | |
664 | """ |
|
664 | """ | |
665 | Look for any unknown files or directories that may have a path conflict |
|
665 | Look for any unknown files or directories that may have a path conflict | |
666 | with a file. If any path prefix of the file exists as a file or link, |
|
666 | with a file. If any path prefix of the file exists as a file or link, | |
667 | then it conflicts. If the file itself is a directory that contains any |
|
667 | then it conflicts. If the file itself is a directory that contains any | |
668 | file that is not tracked, then it conflicts. |
|
668 | file that is not tracked, then it conflicts. | |
669 |
|
669 | |||
670 | Returns the shortest path at which a conflict occurs, or None if there is |
|
670 | Returns the shortest path at which a conflict occurs, or None if there is | |
671 | no conflict. |
|
671 | no conflict. | |
672 | """ |
|
672 | """ | |
673 | def __init__(self): |
|
673 | def __init__(self): | |
674 | # A set of paths known to be good. This prevents repeated checking of |
|
674 | # A set of paths known to be good. This prevents repeated checking of | |
675 | # dirs. It will be updated with any new dirs that are checked and found |
|
675 | # dirs. It will be updated with any new dirs that are checked and found | |
676 | # to be safe. |
|
676 | # to be safe. | |
677 | self._unknowndircache = set() |
|
677 | self._unknowndircache = set() | |
678 |
|
678 | |||
679 | # A set of paths that are known to be absent. This prevents repeated |
|
679 | # A set of paths that are known to be absent. This prevents repeated | |
680 | # checking of subdirectories that are known not to exist. It will be |
|
680 | # checking of subdirectories that are known not to exist. It will be | |
681 | # updated with any new dirs that are checked and found to be absent. |
|
681 | # updated with any new dirs that are checked and found to be absent. | |
682 | self._missingdircache = set() |
|
682 | self._missingdircache = set() | |
683 |
|
683 | |||
684 | def __call__(self, repo, wctx, f): |
|
684 | def __call__(self, repo, wctx, f): | |
685 | if wctx.isinmemory(): |
|
685 | if wctx.isinmemory(): | |
686 | # Nothing to do in IMM for the same reason as ``_checkunknownfile``. |
|
686 | # Nothing to do in IMM for the same reason as ``_checkunknownfile``. | |
687 | return False |
|
687 | return False | |
688 |
|
688 | |||
689 | # Check for path prefixes that exist as unknown files. |
|
689 | # Check for path prefixes that exist as unknown files. | |
690 | for p in reversed(list(util.finddirs(f))): |
|
690 | for p in reversed(list(util.finddirs(f))): | |
691 | if p in self._missingdircache: |
|
691 | if p in self._missingdircache: | |
692 | return |
|
692 | return | |
693 | if p in self._unknowndircache: |
|
693 | if p in self._unknowndircache: | |
694 | continue |
|
694 | continue | |
695 | if repo.wvfs.audit.check(p): |
|
695 | if repo.wvfs.audit.check(p): | |
696 | if (repo.wvfs.isfileorlink(p) |
|
696 | if (repo.wvfs.isfileorlink(p) | |
697 | and repo.dirstate.normalize(p) not in repo.dirstate): |
|
697 | and repo.dirstate.normalize(p) not in repo.dirstate): | |
698 | return p |
|
698 | return p | |
699 | if not repo.wvfs.lexists(p): |
|
699 | if not repo.wvfs.lexists(p): | |
700 | self._missingdircache.add(p) |
|
700 | self._missingdircache.add(p) | |
701 | return |
|
701 | return | |
702 | self._unknowndircache.add(p) |
|
702 | self._unknowndircache.add(p) | |
703 |
|
703 | |||
704 | # Check if the file conflicts with a directory containing unknown files. |
|
704 | # Check if the file conflicts with a directory containing unknown files. | |
705 | if repo.wvfs.audit.check(f) and repo.wvfs.isdir(f): |
|
705 | if repo.wvfs.audit.check(f) and repo.wvfs.isdir(f): | |
706 | # Does the directory contain any files that are not in the dirstate? |
|
706 | # Does the directory contain any files that are not in the dirstate? | |
707 | for p, dirs, files in repo.wvfs.walk(f): |
|
707 | for p, dirs, files in repo.wvfs.walk(f): | |
708 | for fn in files: |
|
708 | for fn in files: | |
709 | relf = repo.dirstate.normalize(repo.wvfs.reljoin(p, fn)) |
|
709 | relf = repo.dirstate.normalize(repo.wvfs.reljoin(p, fn)) | |
710 | if relf not in repo.dirstate: |
|
710 | if relf not in repo.dirstate: | |
711 | return f |
|
711 | return f | |
712 | return None |
|
712 | return None | |
713 |
|
713 | |||
714 | def _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce): |
|
714 | def _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce): | |
715 | """ |
|
715 | """ | |
716 | Considers any actions that care about the presence of conflicting unknown |
|
716 | Considers any actions that care about the presence of conflicting unknown | |
717 | files. For some actions, the result is to abort; for others, it is to |
|
717 | files. For some actions, the result is to abort; for others, it is to | |
718 | choose a different action. |
|
718 | choose a different action. | |
719 | """ |
|
719 | """ | |
720 | fileconflicts = set() |
|
720 | fileconflicts = set() | |
721 | pathconflicts = set() |
|
721 | pathconflicts = set() | |
722 | warnconflicts = set() |
|
722 | warnconflicts = set() | |
723 | abortconflicts = set() |
|
723 | abortconflicts = set() | |
724 | unknownconfig = _getcheckunknownconfig(repo, 'merge', 'checkunknown') |
|
724 | unknownconfig = _getcheckunknownconfig(repo, 'merge', 'checkunknown') | |
725 | ignoredconfig = _getcheckunknownconfig(repo, 'merge', 'checkignored') |
|
725 | ignoredconfig = _getcheckunknownconfig(repo, 'merge', 'checkignored') | |
726 | pathconfig = repo.ui.configbool('experimental', 'merge.checkpathconflicts') |
|
726 | pathconfig = repo.ui.configbool('experimental', 'merge.checkpathconflicts') | |
727 | if not force: |
|
727 | if not force: | |
728 | def collectconflicts(conflicts, config): |
|
728 | def collectconflicts(conflicts, config): | |
729 | if config == 'abort': |
|
729 | if config == 'abort': | |
730 | abortconflicts.update(conflicts) |
|
730 | abortconflicts.update(conflicts) | |
731 | elif config == 'warn': |
|
731 | elif config == 'warn': | |
732 | warnconflicts.update(conflicts) |
|
732 | warnconflicts.update(conflicts) | |
733 |
|
733 | |||
734 | checkunknowndirs = _unknowndirschecker() |
|
734 | checkunknowndirs = _unknowndirschecker() | |
735 | for f, (m, args, msg) in actions.iteritems(): |
|
735 | for f, (m, args, msg) in actions.iteritems(): | |
736 | if m in ('c', 'dc'): |
|
736 | if m in ('c', 'dc'): | |
737 | if _checkunknownfile(repo, wctx, mctx, f): |
|
737 | if _checkunknownfile(repo, wctx, mctx, f): | |
738 | fileconflicts.add(f) |
|
738 | fileconflicts.add(f) | |
739 | elif pathconfig and f not in wctx: |
|
739 | elif pathconfig and f not in wctx: | |
740 | path = checkunknowndirs(repo, wctx, f) |
|
740 | path = checkunknowndirs(repo, wctx, f) | |
741 | if path is not None: |
|
741 | if path is not None: | |
742 | pathconflicts.add(path) |
|
742 | pathconflicts.add(path) | |
743 | elif m == 'dg': |
|
743 | elif m == 'dg': | |
744 | if _checkunknownfile(repo, wctx, mctx, f, args[0]): |
|
744 | if _checkunknownfile(repo, wctx, mctx, f, args[0]): | |
745 | fileconflicts.add(f) |
|
745 | fileconflicts.add(f) | |
746 |
|
746 | |||
747 | allconflicts = fileconflicts | pathconflicts |
|
747 | allconflicts = fileconflicts | pathconflicts | |
748 | ignoredconflicts = set([c for c in allconflicts |
|
748 | ignoredconflicts = set([c for c in allconflicts | |
749 | if repo.dirstate._ignore(c)]) |
|
749 | if repo.dirstate._ignore(c)]) | |
750 | unknownconflicts = allconflicts - ignoredconflicts |
|
750 | unknownconflicts = allconflicts - ignoredconflicts | |
751 | collectconflicts(ignoredconflicts, ignoredconfig) |
|
751 | collectconflicts(ignoredconflicts, ignoredconfig) | |
752 | collectconflicts(unknownconflicts, unknownconfig) |
|
752 | collectconflicts(unknownconflicts, unknownconfig) | |
753 | else: |
|
753 | else: | |
754 | for f, (m, args, msg) in actions.iteritems(): |
|
754 | for f, (m, args, msg) in actions.iteritems(): | |
755 | if m == 'cm': |
|
755 | if m == 'cm': | |
756 | fl2, anc = args |
|
756 | fl2, anc = args | |
757 | different = _checkunknownfile(repo, wctx, mctx, f) |
|
757 | different = _checkunknownfile(repo, wctx, mctx, f) | |
758 | if repo.dirstate._ignore(f): |
|
758 | if repo.dirstate._ignore(f): | |
759 | config = ignoredconfig |
|
759 | config = ignoredconfig | |
760 | else: |
|
760 | else: | |
761 | config = unknownconfig |
|
761 | config = unknownconfig | |
762 |
|
762 | |||
763 | # The behavior when force is True is described by this table: |
|
763 | # The behavior when force is True is described by this table: | |
764 | # config different mergeforce | action backup |
|
764 | # config different mergeforce | action backup | |
765 | # * n * | get n |
|
765 | # * n * | get n | |
766 | # * y y | merge - |
|
766 | # * y y | merge - | |
767 | # abort y n | merge - (1) |
|
767 | # abort y n | merge - (1) | |
768 | # warn y n | warn + get y |
|
768 | # warn y n | warn + get y | |
769 | # ignore y n | get y |
|
769 | # ignore y n | get y | |
770 | # |
|
770 | # | |
771 | # (1) this is probably the wrong behavior here -- we should |
|
771 | # (1) this is probably the wrong behavior here -- we should | |
772 | # probably abort, but some actions like rebases currently |
|
772 | # probably abort, but some actions like rebases currently | |
773 | # don't like an abort happening in the middle of |
|
773 | # don't like an abort happening in the middle of | |
774 | # merge.update. |
|
774 | # merge.update. | |
775 | if not different: |
|
775 | if not different: | |
776 | actions[f] = ('g', (fl2, False), "remote created") |
|
776 | actions[f] = ('g', (fl2, False), "remote created") | |
777 | elif mergeforce or config == 'abort': |
|
777 | elif mergeforce or config == 'abort': | |
778 | actions[f] = ('m', (f, f, None, False, anc), |
|
778 | actions[f] = ('m', (f, f, None, False, anc), | |
779 | "remote differs from untracked local") |
|
779 | "remote differs from untracked local") | |
780 | elif config == 'abort': |
|
780 | elif config == 'abort': | |
781 | abortconflicts.add(f) |
|
781 | abortconflicts.add(f) | |
782 | else: |
|
782 | else: | |
783 | if config == 'warn': |
|
783 | if config == 'warn': | |
784 | warnconflicts.add(f) |
|
784 | warnconflicts.add(f) | |
785 | actions[f] = ('g', (fl2, True), "remote created") |
|
785 | actions[f] = ('g', (fl2, True), "remote created") | |
786 |
|
786 | |||
787 | for f in sorted(abortconflicts): |
|
787 | for f in sorted(abortconflicts): | |
788 | warn = repo.ui.warn |
|
788 | warn = repo.ui.warn | |
789 | if f in pathconflicts: |
|
789 | if f in pathconflicts: | |
790 | if repo.wvfs.isfileorlink(f): |
|
790 | if repo.wvfs.isfileorlink(f): | |
791 | warn(_("%s: untracked file conflicts with directory\n") % f) |
|
791 | warn(_("%s: untracked file conflicts with directory\n") % f) | |
792 | else: |
|
792 | else: | |
793 | warn(_("%s: untracked directory conflicts with file\n") % f) |
|
793 | warn(_("%s: untracked directory conflicts with file\n") % f) | |
794 | else: |
|
794 | else: | |
795 | warn(_("%s: untracked file differs\n") % f) |
|
795 | warn(_("%s: untracked file differs\n") % f) | |
796 | if abortconflicts: |
|
796 | if abortconflicts: | |
797 | raise error.Abort(_("untracked files in working directory " |
|
797 | raise error.Abort(_("untracked files in working directory " | |
798 | "differ from files in requested revision")) |
|
798 | "differ from files in requested revision")) | |
799 |
|
799 | |||
800 | for f in sorted(warnconflicts): |
|
800 | for f in sorted(warnconflicts): | |
801 | if repo.wvfs.isfileorlink(f): |
|
801 | if repo.wvfs.isfileorlink(f): | |
802 | repo.ui.warn(_("%s: replacing untracked file\n") % f) |
|
802 | repo.ui.warn(_("%s: replacing untracked file\n") % f) | |
803 | else: |
|
803 | else: | |
804 | repo.ui.warn(_("%s: replacing untracked files in directory\n") % f) |
|
804 | repo.ui.warn(_("%s: replacing untracked files in directory\n") % f) | |
805 |
|
805 | |||
806 | for f, (m, args, msg) in actions.iteritems(): |
|
806 | for f, (m, args, msg) in actions.iteritems(): | |
807 | if m == 'c': |
|
807 | if m == 'c': | |
808 | backup = (f in fileconflicts or f in pathconflicts or |
|
808 | backup = (f in fileconflicts or f in pathconflicts or | |
809 | any(p in pathconflicts for p in util.finddirs(f))) |
|
809 | any(p in pathconflicts for p in util.finddirs(f))) | |
810 | flags, = args |
|
810 | flags, = args | |
811 | actions[f] = ('g', (flags, backup), msg) |
|
811 | actions[f] = ('g', (flags, backup), msg) | |
812 |
|
812 | |||
813 | def _forgetremoved(wctx, mctx, branchmerge): |
|
813 | def _forgetremoved(wctx, mctx, branchmerge): | |
814 | """ |
|
814 | """ | |
815 | Forget removed files |
|
815 | Forget removed files | |
816 |
|
816 | |||
817 | If we're jumping between revisions (as opposed to merging), and if |
|
817 | If we're jumping between revisions (as opposed to merging), and if | |
818 | neither the working directory nor the target rev has the file, |
|
818 | neither the working directory nor the target rev has the file, | |
819 | then we need to remove it from the dirstate, to prevent the |
|
819 | then we need to remove it from the dirstate, to prevent the | |
820 | dirstate from listing the file when it is no longer in the |
|
820 | dirstate from listing the file when it is no longer in the | |
821 | manifest. |
|
821 | manifest. | |
822 |
|
822 | |||
823 | If we're merging, and the other revision has removed a file |
|
823 | If we're merging, and the other revision has removed a file | |
824 | that is not present in the working directory, we need to mark it |
|
824 | that is not present in the working directory, we need to mark it | |
825 | as removed. |
|
825 | as removed. | |
826 | """ |
|
826 | """ | |
827 |
|
827 | |||
828 | actions = {} |
|
828 | actions = {} | |
829 | m = 'f' |
|
829 | m = 'f' | |
830 | if branchmerge: |
|
830 | if branchmerge: | |
831 | m = 'r' |
|
831 | m = 'r' | |
832 | for f in wctx.deleted(): |
|
832 | for f in wctx.deleted(): | |
833 | if f not in mctx: |
|
833 | if f not in mctx: | |
834 | actions[f] = m, None, "forget deleted" |
|
834 | actions[f] = m, None, "forget deleted" | |
835 |
|
835 | |||
836 | if not branchmerge: |
|
836 | if not branchmerge: | |
837 | for f in wctx.removed(): |
|
837 | for f in wctx.removed(): | |
838 | if f not in mctx: |
|
838 | if f not in mctx: | |
839 | actions[f] = 'f', None, "forget removed" |
|
839 | actions[f] = 'f', None, "forget removed" | |
840 |
|
840 | |||
841 | return actions |
|
841 | return actions | |
842 |
|
842 | |||
843 | def _checkcollision(repo, wmf, actions): |
|
843 | def _checkcollision(repo, wmf, actions): | |
844 | # build provisional merged manifest up |
|
844 | # build provisional merged manifest up | |
845 | pmmf = set(wmf) |
|
845 | pmmf = set(wmf) | |
846 |
|
846 | |||
847 | if actions: |
|
847 | if actions: | |
848 | # k, dr, e and rd are no-op |
|
848 | # k, dr, e and rd are no-op | |
849 | for m in 'a', 'am', 'f', 'g', 'cd', 'dc': |
|
849 | for m in 'a', 'am', 'f', 'g', 'cd', 'dc': | |
850 | for f, args, msg in actions[m]: |
|
850 | for f, args, msg in actions[m]: | |
851 | pmmf.add(f) |
|
851 | pmmf.add(f) | |
852 | for f, args, msg in actions['r']: |
|
852 | for f, args, msg in actions['r']: | |
853 | pmmf.discard(f) |
|
853 | pmmf.discard(f) | |
854 | for f, args, msg in actions['dm']: |
|
854 | for f, args, msg in actions['dm']: | |
855 | f2, flags = args |
|
855 | f2, flags = args | |
856 | pmmf.discard(f2) |
|
856 | pmmf.discard(f2) | |
857 | pmmf.add(f) |
|
857 | pmmf.add(f) | |
858 | for f, args, msg in actions['dg']: |
|
858 | for f, args, msg in actions['dg']: | |
859 | pmmf.add(f) |
|
859 | pmmf.add(f) | |
860 | for f, args, msg in actions['m']: |
|
860 | for f, args, msg in actions['m']: | |
861 | f1, f2, fa, move, anc = args |
|
861 | f1, f2, fa, move, anc = args | |
862 | if move: |
|
862 | if move: | |
863 | pmmf.discard(f1) |
|
863 | pmmf.discard(f1) | |
864 | pmmf.add(f) |
|
864 | pmmf.add(f) | |
865 |
|
865 | |||
866 | # check case-folding collision in provisional merged manifest |
|
866 | # check case-folding collision in provisional merged manifest | |
867 | foldmap = {} |
|
867 | foldmap = {} | |
868 | for f in pmmf: |
|
868 | for f in pmmf: | |
869 | fold = util.normcase(f) |
|
869 | fold = util.normcase(f) | |
870 | if fold in foldmap: |
|
870 | if fold in foldmap: | |
871 | raise error.Abort(_("case-folding collision between %s and %s") |
|
871 | raise error.Abort(_("case-folding collision between %s and %s") | |
872 | % (f, foldmap[fold])) |
|
872 | % (f, foldmap[fold])) | |
873 | foldmap[fold] = f |
|
873 | foldmap[fold] = f | |
874 |
|
874 | |||
875 | # check case-folding of directories |
|
875 | # check case-folding of directories | |
876 | foldprefix = unfoldprefix = lastfull = '' |
|
876 | foldprefix = unfoldprefix = lastfull = '' | |
877 | for fold, f in sorted(foldmap.items()): |
|
877 | for fold, f in sorted(foldmap.items()): | |
878 | if fold.startswith(foldprefix) and not f.startswith(unfoldprefix): |
|
878 | if fold.startswith(foldprefix) and not f.startswith(unfoldprefix): | |
879 | # the folded prefix matches but actual casing is different |
|
879 | # the folded prefix matches but actual casing is different | |
880 | raise error.Abort(_("case-folding collision between " |
|
880 | raise error.Abort(_("case-folding collision between " | |
881 | "%s and directory of %s") % (lastfull, f)) |
|
881 | "%s and directory of %s") % (lastfull, f)) | |
882 | foldprefix = fold + '/' |
|
882 | foldprefix = fold + '/' | |
883 | unfoldprefix = f + '/' |
|
883 | unfoldprefix = f + '/' | |
884 | lastfull = f |
|
884 | lastfull = f | |
885 |
|
885 | |||
886 | def driverpreprocess(repo, ms, wctx, labels=None): |
|
886 | def driverpreprocess(repo, ms, wctx, labels=None): | |
887 | """run the preprocess step of the merge driver, if any |
|
887 | """run the preprocess step of the merge driver, if any | |
888 |
|
888 | |||
889 | This is currently not implemented -- it's an extension point.""" |
|
889 | This is currently not implemented -- it's an extension point.""" | |
890 | return True |
|
890 | return True | |
891 |
|
891 | |||
892 | def driverconclude(repo, ms, wctx, labels=None): |
|
892 | def driverconclude(repo, ms, wctx, labels=None): | |
893 | """run the conclude step of the merge driver, if any |
|
893 | """run the conclude step of the merge driver, if any | |
894 |
|
894 | |||
895 | This is currently not implemented -- it's an extension point.""" |
|
895 | This is currently not implemented -- it's an extension point.""" | |
896 | return True |
|
896 | return True | |
897 |
|
897 | |||
898 | def _filesindirs(repo, manifest, dirs): |
|
898 | def _filesindirs(repo, manifest, dirs): | |
899 | """ |
|
899 | """ | |
900 | Generator that yields pairs of all the files in the manifest that are found |
|
900 | Generator that yields pairs of all the files in the manifest that are found | |
901 | inside the directories listed in dirs, and which directory they are found |
|
901 | inside the directories listed in dirs, and which directory they are found | |
902 | in. |
|
902 | in. | |
903 | """ |
|
903 | """ | |
904 | for f in manifest: |
|
904 | for f in manifest: | |
905 | for p in util.finddirs(f): |
|
905 | for p in util.finddirs(f): | |
906 | if p in dirs: |
|
906 | if p in dirs: | |
907 | yield f, p |
|
907 | yield f, p | |
908 | break |
|
908 | break | |
909 |
|
909 | |||
910 | def checkpathconflicts(repo, wctx, mctx, actions): |
|
910 | def checkpathconflicts(repo, wctx, mctx, actions): | |
911 | """ |
|
911 | """ | |
912 | Check if any actions introduce path conflicts in the repository, updating |
|
912 | Check if any actions introduce path conflicts in the repository, updating | |
913 | actions to record or handle the path conflict accordingly. |
|
913 | actions to record or handle the path conflict accordingly. | |
914 | """ |
|
914 | """ | |
915 | mf = wctx.manifest() |
|
915 | mf = wctx.manifest() | |
916 |
|
916 | |||
917 | # The set of local files that conflict with a remote directory. |
|
917 | # The set of local files that conflict with a remote directory. | |
918 | localconflicts = set() |
|
918 | localconflicts = set() | |
919 |
|
919 | |||
920 | # The set of directories that conflict with a remote file, and so may cause |
|
920 | # The set of directories that conflict with a remote file, and so may cause | |
921 | # conflicts if they still contain any files after the merge. |
|
921 | # conflicts if they still contain any files after the merge. | |
922 | remoteconflicts = set() |
|
922 | remoteconflicts = set() | |
923 |
|
923 | |||
924 | # The set of directories that appear as both a file and a directory in the |
|
924 | # The set of directories that appear as both a file and a directory in the | |
925 | # remote manifest. These indicate an invalid remote manifest, which |
|
925 | # remote manifest. These indicate an invalid remote manifest, which | |
926 | # can't be updated to cleanly. |
|
926 | # can't be updated to cleanly. | |
927 | invalidconflicts = set() |
|
927 | invalidconflicts = set() | |
928 |
|
928 | |||
929 | # The set of directories that contain files that are being created. |
|
929 | # The set of directories that contain files that are being created. | |
930 | createdfiledirs = set() |
|
930 | createdfiledirs = set() | |
931 |
|
931 | |||
932 | # The set of files deleted by all the actions. |
|
932 | # The set of files deleted by all the actions. | |
933 | deletedfiles = set() |
|
933 | deletedfiles = set() | |
934 |
|
934 | |||
935 | for f, (m, args, msg) in actions.items(): |
|
935 | for f, (m, args, msg) in actions.items(): | |
936 | if m in ('c', 'dc', 'm', 'cm'): |
|
936 | if m in ('c', 'dc', 'm', 'cm'): | |
937 | # This action may create a new local file. |
|
937 | # This action may create a new local file. | |
938 | createdfiledirs.update(util.finddirs(f)) |
|
938 | createdfiledirs.update(util.finddirs(f)) | |
939 | if mf.hasdir(f): |
|
939 | if mf.hasdir(f): | |
940 | # The file aliases a local directory. This might be ok if all |
|
940 | # The file aliases a local directory. This might be ok if all | |
941 | # the files in the local directory are being deleted. This |
|
941 | # the files in the local directory are being deleted. This | |
942 | # will be checked once we know what all the deleted files are. |
|
942 | # will be checked once we know what all the deleted files are. | |
943 | remoteconflicts.add(f) |
|
943 | remoteconflicts.add(f) | |
944 | # Track the names of all deleted files. |
|
944 | # Track the names of all deleted files. | |
945 | if m == 'r': |
|
945 | if m == 'r': | |
946 | deletedfiles.add(f) |
|
946 | deletedfiles.add(f) | |
947 | if m == 'm': |
|
947 | if m == 'm': | |
948 | f1, f2, fa, move, anc = args |
|
948 | f1, f2, fa, move, anc = args | |
949 | if move: |
|
949 | if move: | |
950 | deletedfiles.add(f1) |
|
950 | deletedfiles.add(f1) | |
951 | if m == 'dm': |
|
951 | if m == 'dm': | |
952 | f2, flags = args |
|
952 | f2, flags = args | |
953 | deletedfiles.add(f2) |
|
953 | deletedfiles.add(f2) | |
954 |
|
954 | |||
955 | # Check all directories that contain created files for path conflicts. |
|
955 | # Check all directories that contain created files for path conflicts. | |
956 | for p in createdfiledirs: |
|
956 | for p in createdfiledirs: | |
957 | if p in mf: |
|
957 | if p in mf: | |
958 | if p in mctx: |
|
958 | if p in mctx: | |
959 | # A file is in a directory which aliases both a local |
|
959 | # A file is in a directory which aliases both a local | |
960 | # and a remote file. This is an internal inconsistency |
|
960 | # and a remote file. This is an internal inconsistency | |
961 | # within the remote manifest. |
|
961 | # within the remote manifest. | |
962 | invalidconflicts.add(p) |
|
962 | invalidconflicts.add(p) | |
963 | else: |
|
963 | else: | |
964 | # A file is in a directory which aliases a local file. |
|
964 | # A file is in a directory which aliases a local file. | |
965 | # We will need to rename the local file. |
|
965 | # We will need to rename the local file. | |
966 | localconflicts.add(p) |
|
966 | localconflicts.add(p) | |
967 | if p in actions and actions[p][0] in ('c', 'dc', 'm', 'cm'): |
|
967 | if p in actions and actions[p][0] in ('c', 'dc', 'm', 'cm'): | |
968 | # The file is in a directory which aliases a remote file. |
|
968 | # The file is in a directory which aliases a remote file. | |
969 | # This is an internal inconsistency within the remote |
|
969 | # This is an internal inconsistency within the remote | |
970 | # manifest. |
|
970 | # manifest. | |
971 | invalidconflicts.add(p) |
|
971 | invalidconflicts.add(p) | |
972 |
|
972 | |||
973 | # Rename all local conflicting files that have not been deleted. |
|
973 | # Rename all local conflicting files that have not been deleted. | |
974 | for p in localconflicts: |
|
974 | for p in localconflicts: | |
975 | if p not in deletedfiles: |
|
975 | if p not in deletedfiles: | |
976 | ctxname = bytes(wctx).rstrip('+') |
|
976 | ctxname = bytes(wctx).rstrip('+') | |
977 | pnew = util.safename(p, ctxname, wctx, set(actions.keys())) |
|
977 | pnew = util.safename(p, ctxname, wctx, set(actions.keys())) | |
978 | actions[pnew] = ('pr', (p,), "local path conflict") |
|
978 | actions[pnew] = ('pr', (p,), "local path conflict") | |
979 | actions[p] = ('p', (pnew, 'l'), "path conflict") |
|
979 | actions[p] = ('p', (pnew, 'l'), "path conflict") | |
980 |
|
980 | |||
981 | if remoteconflicts: |
|
981 | if remoteconflicts: | |
982 | # Check if all files in the conflicting directories have been removed. |
|
982 | # Check if all files in the conflicting directories have been removed. | |
983 | ctxname = bytes(mctx).rstrip('+') |
|
983 | ctxname = bytes(mctx).rstrip('+') | |
984 | for f, p in _filesindirs(repo, mf, remoteconflicts): |
|
984 | for f, p in _filesindirs(repo, mf, remoteconflicts): | |
985 | if f not in deletedfiles: |
|
985 | if f not in deletedfiles: | |
986 | m, args, msg = actions[p] |
|
986 | m, args, msg = actions[p] | |
987 | pnew = util.safename(p, ctxname, wctx, set(actions.keys())) |
|
987 | pnew = util.safename(p, ctxname, wctx, set(actions.keys())) | |
988 | if m in ('dc', 'm'): |
|
988 | if m in ('dc', 'm'): | |
989 | # Action was merge, just update target. |
|
989 | # Action was merge, just update target. | |
990 | actions[pnew] = (m, args, msg) |
|
990 | actions[pnew] = (m, args, msg) | |
991 | else: |
|
991 | else: | |
992 | # Action was create, change to renamed get action. |
|
992 | # Action was create, change to renamed get action. | |
993 | fl = args[0] |
|
993 | fl = args[0] | |
994 | actions[pnew] = ('dg', (p, fl), "remote path conflict") |
|
994 | actions[pnew] = ('dg', (p, fl), "remote path conflict") | |
995 | actions[p] = ('p', (pnew, 'r'), "path conflict") |
|
995 | actions[p] = ('p', (pnew, 'r'), "path conflict") | |
996 | remoteconflicts.remove(p) |
|
996 | remoteconflicts.remove(p) | |
997 | break |
|
997 | break | |
998 |
|
998 | |||
999 | if invalidconflicts: |
|
999 | if invalidconflicts: | |
1000 | for p in invalidconflicts: |
|
1000 | for p in invalidconflicts: | |
1001 | repo.ui.warn(_("%s: is both a file and a directory\n") % p) |
|
1001 | repo.ui.warn(_("%s: is both a file and a directory\n") % p) | |
1002 | raise error.Abort(_("destination manifest contains path conflicts")) |
|
1002 | raise error.Abort(_("destination manifest contains path conflicts")) | |
1003 |
|
1003 | |||
1004 | def manifestmerge(repo, wctx, p2, pa, branchmerge, force, matcher, |
|
1004 | def manifestmerge(repo, wctx, p2, pa, branchmerge, force, matcher, | |
1005 | acceptremote, followcopies, forcefulldiff=False): |
|
1005 | acceptremote, followcopies, forcefulldiff=False): | |
1006 | """ |
|
1006 | """ | |
1007 | Merge wctx and p2 with ancestor pa and generate merge action list |
|
1007 | Merge wctx and p2 with ancestor pa and generate merge action list | |
1008 |
|
1008 | |||
1009 | branchmerge and force are as passed in to update |
|
1009 | branchmerge and force are as passed in to update | |
1010 | matcher = matcher to filter file lists |
|
1010 | matcher = matcher to filter file lists | |
1011 | acceptremote = accept the incoming changes without prompting |
|
1011 | acceptremote = accept the incoming changes without prompting | |
1012 | """ |
|
1012 | """ | |
1013 | if matcher is not None and matcher.always(): |
|
1013 | if matcher is not None and matcher.always(): | |
1014 | matcher = None |
|
1014 | matcher = None | |
1015 |
|
1015 | |||
1016 | copy, movewithdir, diverge, renamedelete, dirmove = {}, {}, {}, {}, {} |
|
1016 | copy, movewithdir, diverge, renamedelete, dirmove = {}, {}, {}, {}, {} | |
1017 |
|
1017 | |||
1018 | # manifests fetched in order are going to be faster, so prime the caches |
|
1018 | # manifests fetched in order are going to be faster, so prime the caches | |
1019 | [x.manifest() for x in |
|
1019 | [x.manifest() for x in | |
1020 | sorted(wctx.parents() + [p2, pa], key=scmutil.intrev)] |
|
1020 | sorted(wctx.parents() + [p2, pa], key=scmutil.intrev)] | |
1021 |
|
1021 | |||
1022 | if followcopies: |
|
1022 | if followcopies: | |
1023 | ret = copies.mergecopies(repo, wctx, p2, pa) |
|
1023 | ret = copies.mergecopies(repo, wctx, p2, pa) | |
1024 | copy, movewithdir, diverge, renamedelete, dirmove = ret |
|
1024 | copy, movewithdir, diverge, renamedelete, dirmove = ret | |
1025 |
|
1025 | |||
1026 | boolbm = pycompat.bytestr(bool(branchmerge)) |
|
1026 | boolbm = pycompat.bytestr(bool(branchmerge)) | |
1027 | boolf = pycompat.bytestr(bool(force)) |
|
1027 | boolf = pycompat.bytestr(bool(force)) | |
1028 | boolm = pycompat.bytestr(bool(matcher)) |
|
1028 | boolm = pycompat.bytestr(bool(matcher)) | |
1029 | repo.ui.note(_("resolving manifests\n")) |
|
1029 | repo.ui.note(_("resolving manifests\n")) | |
1030 | repo.ui.debug(" branchmerge: %s, force: %s, partial: %s\n" |
|
1030 | repo.ui.debug(" branchmerge: %s, force: %s, partial: %s\n" | |
1031 | % (boolbm, boolf, boolm)) |
|
1031 | % (boolbm, boolf, boolm)) | |
1032 | repo.ui.debug(" ancestor: %s, local: %s, remote: %s\n" % (pa, wctx, p2)) |
|
1032 | repo.ui.debug(" ancestor: %s, local: %s, remote: %s\n" % (pa, wctx, p2)) | |
1033 |
|
1033 | |||
1034 | m1, m2, ma = wctx.manifest(), p2.manifest(), pa.manifest() |
|
1034 | m1, m2, ma = wctx.manifest(), p2.manifest(), pa.manifest() | |
1035 | copied = set(copy.values()) |
|
1035 | copied = set(copy.values()) | |
1036 | copied.update(movewithdir.values()) |
|
1036 | copied.update(movewithdir.values()) | |
1037 |
|
1037 | |||
1038 | if '.hgsubstate' in m1: |
|
1038 | if '.hgsubstate' in m1: | |
1039 | # check whether sub state is modified |
|
1039 | # check whether sub state is modified | |
1040 | if any(wctx.sub(s).dirty() for s in wctx.substate): |
|
1040 | if any(wctx.sub(s).dirty() for s in wctx.substate): | |
1041 | m1['.hgsubstate'] = modifiednodeid |
|
1041 | m1['.hgsubstate'] = modifiednodeid | |
1042 |
|
1042 | |||
1043 | # Don't use m2-vs-ma optimization if: |
|
1043 | # Don't use m2-vs-ma optimization if: | |
1044 | # - ma is the same as m1 or m2, which we're just going to diff again later |
|
1044 | # - ma is the same as m1 or m2, which we're just going to diff again later | |
1045 | # - The caller specifically asks for a full diff, which is useful during bid |
|
1045 | # - The caller specifically asks for a full diff, which is useful during bid | |
1046 | # merge. |
|
1046 | # merge. | |
1047 | if (pa not in ([wctx, p2] + wctx.parents()) and not forcefulldiff): |
|
1047 | if (pa not in ([wctx, p2] + wctx.parents()) and not forcefulldiff): | |
1048 | # Identify which files are relevant to the merge, so we can limit the |
|
1048 | # Identify which files are relevant to the merge, so we can limit the | |
1049 | # total m1-vs-m2 diff to just those files. This has significant |
|
1049 | # total m1-vs-m2 diff to just those files. This has significant | |
1050 | # performance benefits in large repositories. |
|
1050 | # performance benefits in large repositories. | |
1051 | relevantfiles = set(ma.diff(m2).keys()) |
|
1051 | relevantfiles = set(ma.diff(m2).keys()) | |
1052 |
|
1052 | |||
1053 | # For copied and moved files, we need to add the source file too. |
|
1053 | # For copied and moved files, we need to add the source file too. | |
1054 | for copykey, copyvalue in copy.iteritems(): |
|
1054 | for copykey, copyvalue in copy.iteritems(): | |
1055 | if copyvalue in relevantfiles: |
|
1055 | if copyvalue in relevantfiles: | |
1056 | relevantfiles.add(copykey) |
|
1056 | relevantfiles.add(copykey) | |
1057 | for movedirkey in movewithdir: |
|
1057 | for movedirkey in movewithdir: | |
1058 | relevantfiles.add(movedirkey) |
|
1058 | relevantfiles.add(movedirkey) | |
1059 | filesmatcher = scmutil.matchfiles(repo, relevantfiles) |
|
1059 | filesmatcher = scmutil.matchfiles(repo, relevantfiles) | |
1060 | matcher = matchmod.intersectmatchers(matcher, filesmatcher) |
|
1060 | matcher = matchmod.intersectmatchers(matcher, filesmatcher) | |
1061 |
|
1061 | |||
1062 | diff = m1.diff(m2, match=matcher) |
|
1062 | diff = m1.diff(m2, match=matcher) | |
1063 |
|
1063 | |||
1064 | if matcher is None: |
|
1064 | if matcher is None: | |
1065 | matcher = matchmod.always('', '') |
|
1065 | matcher = matchmod.always('', '') | |
1066 |
|
1066 | |||
1067 | actions = {} |
|
1067 | actions = {} | |
1068 | for f, ((n1, fl1), (n2, fl2)) in diff.iteritems(): |
|
1068 | for f, ((n1, fl1), (n2, fl2)) in diff.iteritems(): | |
1069 | if n1 and n2: # file exists on both local and remote side |
|
1069 | if n1 and n2: # file exists on both local and remote side | |
1070 | if f not in ma: |
|
1070 | if f not in ma: | |
1071 | fa = copy.get(f, None) |
|
1071 | fa = copy.get(f, None) | |
1072 | if fa is not None: |
|
1072 | if fa is not None: | |
1073 | actions[f] = ('m', (f, f, fa, False, pa.node()), |
|
1073 | actions[f] = ('m', (f, f, fa, False, pa.node()), | |
1074 | "both renamed from " + fa) |
|
1074 | "both renamed from " + fa) | |
1075 | else: |
|
1075 | else: | |
1076 | actions[f] = ('m', (f, f, None, False, pa.node()), |
|
1076 | actions[f] = ('m', (f, f, None, False, pa.node()), | |
1077 | "both created") |
|
1077 | "both created") | |
1078 | else: |
|
1078 | else: | |
1079 | a = ma[f] |
|
1079 | a = ma[f] | |
1080 | fla = ma.flags(f) |
|
1080 | fla = ma.flags(f) | |
1081 | nol = 'l' not in fl1 + fl2 + fla |
|
1081 | nol = 'l' not in fl1 + fl2 + fla | |
1082 | if n2 == a and fl2 == fla: |
|
1082 | if n2 == a and fl2 == fla: | |
1083 | actions[f] = ('k', (), "remote unchanged") |
|
1083 | actions[f] = ('k', (), "remote unchanged") | |
1084 | elif n1 == a and fl1 == fla: # local unchanged - use remote |
|
1084 | elif n1 == a and fl1 == fla: # local unchanged - use remote | |
1085 | if n1 == n2: # optimization: keep local content |
|
1085 | if n1 == n2: # optimization: keep local content | |
1086 | actions[f] = ('e', (fl2,), "update permissions") |
|
1086 | actions[f] = ('e', (fl2,), "update permissions") | |
1087 | else: |
|
1087 | else: | |
1088 | actions[f] = ('g', (fl2, False), "remote is newer") |
|
1088 | actions[f] = ('g', (fl2, False), "remote is newer") | |
1089 | elif nol and n2 == a: # remote only changed 'x' |
|
1089 | elif nol and n2 == a: # remote only changed 'x' | |
1090 | actions[f] = ('e', (fl2,), "update permissions") |
|
1090 | actions[f] = ('e', (fl2,), "update permissions") | |
1091 | elif nol and n1 == a: # local only changed 'x' |
|
1091 | elif nol and n1 == a: # local only changed 'x' | |
1092 | actions[f] = ('g', (fl1, False), "remote is newer") |
|
1092 | actions[f] = ('g', (fl1, False), "remote is newer") | |
1093 | else: # both changed something |
|
1093 | else: # both changed something | |
1094 | actions[f] = ('m', (f, f, f, False, pa.node()), |
|
1094 | actions[f] = ('m', (f, f, f, False, pa.node()), | |
1095 | "versions differ") |
|
1095 | "versions differ") | |
1096 | elif n1: # file exists only on local side |
|
1096 | elif n1: # file exists only on local side | |
1097 | if f in copied: |
|
1097 | if f in copied: | |
1098 | pass # we'll deal with it on m2 side |
|
1098 | pass # we'll deal with it on m2 side | |
1099 | elif f in movewithdir: # directory rename, move local |
|
1099 | elif f in movewithdir: # directory rename, move local | |
1100 | f2 = movewithdir[f] |
|
1100 | f2 = movewithdir[f] | |
1101 | if f2 in m2: |
|
1101 | if f2 in m2: | |
1102 | actions[f2] = ('m', (f, f2, None, True, pa.node()), |
|
1102 | actions[f2] = ('m', (f, f2, None, True, pa.node()), | |
1103 | "remote directory rename, both created") |
|
1103 | "remote directory rename, both created") | |
1104 | else: |
|
1104 | else: | |
1105 | actions[f2] = ('dm', (f, fl1), |
|
1105 | actions[f2] = ('dm', (f, fl1), | |
1106 | "remote directory rename - move from " + f) |
|
1106 | "remote directory rename - move from " + f) | |
1107 | elif f in copy: |
|
1107 | elif f in copy: | |
1108 | f2 = copy[f] |
|
1108 | f2 = copy[f] | |
1109 | actions[f] = ('m', (f, f2, f2, False, pa.node()), |
|
1109 | actions[f] = ('m', (f, f2, f2, False, pa.node()), | |
1110 | "local copied/moved from " + f2) |
|
1110 | "local copied/moved from " + f2) | |
1111 | elif f in ma: # clean, a different, no remote |
|
1111 | elif f in ma: # clean, a different, no remote | |
1112 | if n1 != ma[f]: |
|
1112 | if n1 != ma[f]: | |
1113 | if acceptremote: |
|
1113 | if acceptremote: | |
1114 | actions[f] = ('r', None, "remote delete") |
|
1114 | actions[f] = ('r', None, "remote delete") | |
1115 | else: |
|
1115 | else: | |
1116 | actions[f] = ('cd', (f, None, f, False, pa.node()), |
|
1116 | actions[f] = ('cd', (f, None, f, False, pa.node()), | |
1117 | "prompt changed/deleted") |
|
1117 | "prompt changed/deleted") | |
1118 | elif n1 == addednodeid: |
|
1118 | elif n1 == addednodeid: | |
1119 | # This extra 'a' is added by working copy manifest to mark |
|
1119 | # This extra 'a' is added by working copy manifest to mark | |
1120 | # the file as locally added. We should forget it instead of |
|
1120 | # the file as locally added. We should forget it instead of | |
1121 | # deleting it. |
|
1121 | # deleting it. | |
1122 | actions[f] = ('f', None, "remote deleted") |
|
1122 | actions[f] = ('f', None, "remote deleted") | |
1123 | else: |
|
1123 | else: | |
1124 | actions[f] = ('r', None, "other deleted") |
|
1124 | actions[f] = ('r', None, "other deleted") | |
1125 | elif n2: # file exists only on remote side |
|
1125 | elif n2: # file exists only on remote side | |
1126 | if f in copied: |
|
1126 | if f in copied: | |
1127 | pass # we'll deal with it on m1 side |
|
1127 | pass # we'll deal with it on m1 side | |
1128 | elif f in movewithdir: |
|
1128 | elif f in movewithdir: | |
1129 | f2 = movewithdir[f] |
|
1129 | f2 = movewithdir[f] | |
1130 | if f2 in m1: |
|
1130 | if f2 in m1: | |
1131 | actions[f2] = ('m', (f2, f, None, False, pa.node()), |
|
1131 | actions[f2] = ('m', (f2, f, None, False, pa.node()), | |
1132 | "local directory rename, both created") |
|
1132 | "local directory rename, both created") | |
1133 | else: |
|
1133 | else: | |
1134 | actions[f2] = ('dg', (f, fl2), |
|
1134 | actions[f2] = ('dg', (f, fl2), | |
1135 | "local directory rename - get from " + f) |
|
1135 | "local directory rename - get from " + f) | |
1136 | elif f in copy: |
|
1136 | elif f in copy: | |
1137 | f2 = copy[f] |
|
1137 | f2 = copy[f] | |
1138 | if f2 in m2: |
|
1138 | if f2 in m2: | |
1139 | actions[f] = ('m', (f2, f, f2, False, pa.node()), |
|
1139 | actions[f] = ('m', (f2, f, f2, False, pa.node()), | |
1140 | "remote copied from " + f2) |
|
1140 | "remote copied from " + f2) | |
1141 | else: |
|
1141 | else: | |
1142 | actions[f] = ('m', (f2, f, f2, True, pa.node()), |
|
1142 | actions[f] = ('m', (f2, f, f2, True, pa.node()), | |
1143 | "remote moved from " + f2) |
|
1143 | "remote moved from " + f2) | |
1144 | elif f not in ma: |
|
1144 | elif f not in ma: | |
1145 | # local unknown, remote created: the logic is described by the |
|
1145 | # local unknown, remote created: the logic is described by the | |
1146 | # following table: |
|
1146 | # following table: | |
1147 | # |
|
1147 | # | |
1148 | # force branchmerge different | action |
|
1148 | # force branchmerge different | action | |
1149 | # n * * | create |
|
1149 | # n * * | create | |
1150 | # y n * | create |
|
1150 | # y n * | create | |
1151 | # y y n | create |
|
1151 | # y y n | create | |
1152 | # y y y | merge |
|
1152 | # y y y | merge | |
1153 | # |
|
1153 | # | |
1154 | # Checking whether the files are different is expensive, so we |
|
1154 | # Checking whether the files are different is expensive, so we | |
1155 | # don't do that when we can avoid it. |
|
1155 | # don't do that when we can avoid it. | |
1156 | if not force: |
|
1156 | if not force: | |
1157 | actions[f] = ('c', (fl2,), "remote created") |
|
1157 | actions[f] = ('c', (fl2,), "remote created") | |
1158 | elif not branchmerge: |
|
1158 | elif not branchmerge: | |
1159 | actions[f] = ('c', (fl2,), "remote created") |
|
1159 | actions[f] = ('c', (fl2,), "remote created") | |
1160 | else: |
|
1160 | else: | |
1161 | actions[f] = ('cm', (fl2, pa.node()), |
|
1161 | actions[f] = ('cm', (fl2, pa.node()), | |
1162 | "remote created, get or merge") |
|
1162 | "remote created, get or merge") | |
1163 | elif n2 != ma[f]: |
|
1163 | elif n2 != ma[f]: | |
1164 | df = None |
|
1164 | df = None | |
1165 | for d in dirmove: |
|
1165 | for d in dirmove: | |
1166 | if f.startswith(d): |
|
1166 | if f.startswith(d): | |
1167 | # new file added in a directory that was moved |
|
1167 | # new file added in a directory that was moved | |
1168 | df = dirmove[d] + f[len(d):] |
|
1168 | df = dirmove[d] + f[len(d):] | |
1169 | break |
|
1169 | break | |
1170 | if df is not None and df in m1: |
|
1170 | if df is not None and df in m1: | |
1171 | actions[df] = ('m', (df, f, f, False, pa.node()), |
|
1171 | actions[df] = ('m', (df, f, f, False, pa.node()), | |
1172 | "local directory rename - respect move from " + f) |
|
1172 | "local directory rename - respect move from " + f) | |
1173 | elif acceptremote: |
|
1173 | elif acceptremote: | |
1174 | actions[f] = ('c', (fl2,), "remote recreating") |
|
1174 | actions[f] = ('c', (fl2,), "remote recreating") | |
1175 | else: |
|
1175 | else: | |
1176 | actions[f] = ('dc', (None, f, f, False, pa.node()), |
|
1176 | actions[f] = ('dc', (None, f, f, False, pa.node()), | |
1177 | "prompt deleted/changed") |
|
1177 | "prompt deleted/changed") | |
1178 |
|
1178 | |||
1179 | if repo.ui.configbool('experimental', 'merge.checkpathconflicts'): |
|
1179 | if repo.ui.configbool('experimental', 'merge.checkpathconflicts'): | |
1180 | # If we are merging, look for path conflicts. |
|
1180 | # If we are merging, look for path conflicts. | |
1181 | checkpathconflicts(repo, wctx, p2, actions) |
|
1181 | checkpathconflicts(repo, wctx, p2, actions) | |
1182 |
|
1182 | |||
1183 | return actions, diverge, renamedelete |
|
1183 | return actions, diverge, renamedelete | |
1184 |
|
1184 | |||
1185 | def _resolvetrivial(repo, wctx, mctx, ancestor, actions): |
|
1185 | def _resolvetrivial(repo, wctx, mctx, ancestor, actions): | |
1186 | """Resolves false conflicts where the nodeid changed but the content |
|
1186 | """Resolves false conflicts where the nodeid changed but the content | |
1187 | remained the same.""" |
|
1187 | remained the same.""" | |
1188 | # We force a copy of actions.items() because we're going to mutate |
|
1188 | # We force a copy of actions.items() because we're going to mutate | |
1189 | # actions as we resolve trivial conflicts. |
|
1189 | # actions as we resolve trivial conflicts. | |
1190 | for f, (m, args, msg) in list(actions.items()): |
|
1190 | for f, (m, args, msg) in list(actions.items()): | |
1191 | if m == 'cd' and f in ancestor and not wctx[f].cmp(ancestor[f]): |
|
1191 | if m == 'cd' and f in ancestor and not wctx[f].cmp(ancestor[f]): | |
1192 | # local did change but ended up with same content |
|
1192 | # local did change but ended up with same content | |
1193 | actions[f] = 'r', None, "prompt same" |
|
1193 | actions[f] = 'r', None, "prompt same" | |
1194 | elif m == 'dc' and f in ancestor and not mctx[f].cmp(ancestor[f]): |
|
1194 | elif m == 'dc' and f in ancestor and not mctx[f].cmp(ancestor[f]): | |
1195 | # remote did change but ended up with same content |
|
1195 | # remote did change but ended up with same content | |
1196 | del actions[f] # don't get = keep local deleted |
|
1196 | del actions[f] # don't get = keep local deleted | |
1197 |
|
1197 | |||
1198 | def calculateupdates(repo, wctx, mctx, ancestors, branchmerge, force, |
|
1198 | def calculateupdates(repo, wctx, mctx, ancestors, branchmerge, force, | |
1199 | acceptremote, followcopies, matcher=None, |
|
1199 | acceptremote, followcopies, matcher=None, | |
1200 | mergeforce=False): |
|
1200 | mergeforce=False): | |
1201 | """Calculate the actions needed to merge mctx into wctx using ancestors""" |
|
1201 | """Calculate the actions needed to merge mctx into wctx using ancestors""" | |
1202 | # Avoid cycle. |
|
1202 | # Avoid cycle. | |
1203 | from . import sparse |
|
1203 | from . import sparse | |
1204 |
|
1204 | |||
1205 | if len(ancestors) == 1: # default |
|
1205 | if len(ancestors) == 1: # default | |
1206 | actions, diverge, renamedelete = manifestmerge( |
|
1206 | actions, diverge, renamedelete = manifestmerge( | |
1207 | repo, wctx, mctx, ancestors[0], branchmerge, force, matcher, |
|
1207 | repo, wctx, mctx, ancestors[0], branchmerge, force, matcher, | |
1208 | acceptremote, followcopies) |
|
1208 | acceptremote, followcopies) | |
1209 | _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce) |
|
1209 | _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce) | |
1210 |
|
1210 | |||
1211 | else: # only when merge.preferancestor=* - the default |
|
1211 | else: # only when merge.preferancestor=* - the default | |
1212 | repo.ui.note( |
|
1212 | repo.ui.note( | |
1213 | _("note: merging %s and %s using bids from ancestors %s\n") % |
|
1213 | _("note: merging %s and %s using bids from ancestors %s\n") % | |
1214 | (wctx, mctx, _(' and ').join(pycompat.bytestr(anc) |
|
1214 | (wctx, mctx, _(' and ').join(pycompat.bytestr(anc) | |
1215 | for anc in ancestors))) |
|
1215 | for anc in ancestors))) | |
1216 |
|
1216 | |||
1217 | # Call for bids |
|
1217 | # Call for bids | |
1218 | fbids = {} # mapping filename to bids (action method to list af actions) |
|
1218 | fbids = {} # mapping filename to bids (action method to list af actions) | |
1219 | diverge, renamedelete = None, None |
|
1219 | diverge, renamedelete = None, None | |
1220 | for ancestor in ancestors: |
|
1220 | for ancestor in ancestors: | |
1221 | repo.ui.note(_('\ncalculating bids for ancestor %s\n') % ancestor) |
|
1221 | repo.ui.note(_('\ncalculating bids for ancestor %s\n') % ancestor) | |
1222 | actions, diverge1, renamedelete1 = manifestmerge( |
|
1222 | actions, diverge1, renamedelete1 = manifestmerge( | |
1223 | repo, wctx, mctx, ancestor, branchmerge, force, matcher, |
|
1223 | repo, wctx, mctx, ancestor, branchmerge, force, matcher, | |
1224 | acceptremote, followcopies, forcefulldiff=True) |
|
1224 | acceptremote, followcopies, forcefulldiff=True) | |
1225 | _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce) |
|
1225 | _checkunknownfiles(repo, wctx, mctx, force, actions, mergeforce) | |
1226 |
|
1226 | |||
1227 | # Track the shortest set of warning on the theory that bid |
|
1227 | # Track the shortest set of warning on the theory that bid | |
1228 | # merge will correctly incorporate more information |
|
1228 | # merge will correctly incorporate more information | |
1229 | if diverge is None or len(diverge1) < len(diverge): |
|
1229 | if diverge is None or len(diverge1) < len(diverge): | |
1230 | diverge = diverge1 |
|
1230 | diverge = diverge1 | |
1231 | if renamedelete is None or len(renamedelete) < len(renamedelete1): |
|
1231 | if renamedelete is None or len(renamedelete) < len(renamedelete1): | |
1232 | renamedelete = renamedelete1 |
|
1232 | renamedelete = renamedelete1 | |
1233 |
|
1233 | |||
1234 | for f, a in sorted(actions.iteritems()): |
|
1234 | for f, a in sorted(actions.iteritems()): | |
1235 | m, args, msg = a |
|
1235 | m, args, msg = a | |
1236 | repo.ui.debug(' %s: %s -> %s\n' % (f, msg, m)) |
|
1236 | repo.ui.debug(' %s: %s -> %s\n' % (f, msg, m)) | |
1237 | if f in fbids: |
|
1237 | if f in fbids: | |
1238 | d = fbids[f] |
|
1238 | d = fbids[f] | |
1239 | if m in d: |
|
1239 | if m in d: | |
1240 | d[m].append(a) |
|
1240 | d[m].append(a) | |
1241 | else: |
|
1241 | else: | |
1242 | d[m] = [a] |
|
1242 | d[m] = [a] | |
1243 | else: |
|
1243 | else: | |
1244 | fbids[f] = {m: [a]} |
|
1244 | fbids[f] = {m: [a]} | |
1245 |
|
1245 | |||
1246 | # Pick the best bid for each file |
|
1246 | # Pick the best bid for each file | |
1247 | repo.ui.note(_('\nauction for merging merge bids\n')) |
|
1247 | repo.ui.note(_('\nauction for merging merge bids\n')) | |
1248 | actions = {} |
|
1248 | actions = {} | |
1249 | dms = [] # filenames that have dm actions |
|
1249 | dms = [] # filenames that have dm actions | |
1250 | for f, bids in sorted(fbids.items()): |
|
1250 | for f, bids in sorted(fbids.items()): | |
1251 | # bids is a mapping from action method to list af actions |
|
1251 | # bids is a mapping from action method to list af actions | |
1252 | # Consensus? |
|
1252 | # Consensus? | |
1253 | if len(bids) == 1: # all bids are the same kind of method |
|
1253 | if len(bids) == 1: # all bids are the same kind of method | |
1254 | m, l = list(bids.items())[0] |
|
1254 | m, l = list(bids.items())[0] | |
1255 | if all(a == l[0] for a in l[1:]): # len(bids) is > 1 |
|
1255 | if all(a == l[0] for a in l[1:]): # len(bids) is > 1 | |
1256 | repo.ui.note(_(" %s: consensus for %s\n") % (f, m)) |
|
1256 | repo.ui.note(_(" %s: consensus for %s\n") % (f, m)) | |
1257 | actions[f] = l[0] |
|
1257 | actions[f] = l[0] | |
1258 | if m == 'dm': |
|
1258 | if m == 'dm': | |
1259 | dms.append(f) |
|
1259 | dms.append(f) | |
1260 | continue |
|
1260 | continue | |
1261 | # If keep is an option, just do it. |
|
1261 | # If keep is an option, just do it. | |
1262 | if 'k' in bids: |
|
1262 | if 'k' in bids: | |
1263 | repo.ui.note(_(" %s: picking 'keep' action\n") % f) |
|
1263 | repo.ui.note(_(" %s: picking 'keep' action\n") % f) | |
1264 | actions[f] = bids['k'][0] |
|
1264 | actions[f] = bids['k'][0] | |
1265 | continue |
|
1265 | continue | |
1266 | # If there are gets and they all agree [how could they not?], do it. |
|
1266 | # If there are gets and they all agree [how could they not?], do it. | |
1267 | if 'g' in bids: |
|
1267 | if 'g' in bids: | |
1268 | ga0 = bids['g'][0] |
|
1268 | ga0 = bids['g'][0] | |
1269 | if all(a == ga0 for a in bids['g'][1:]): |
|
1269 | if all(a == ga0 for a in bids['g'][1:]): | |
1270 | repo.ui.note(_(" %s: picking 'get' action\n") % f) |
|
1270 | repo.ui.note(_(" %s: picking 'get' action\n") % f) | |
1271 | actions[f] = ga0 |
|
1271 | actions[f] = ga0 | |
1272 | continue |
|
1272 | continue | |
1273 | # TODO: Consider other simple actions such as mode changes |
|
1273 | # TODO: Consider other simple actions such as mode changes | |
1274 | # Handle inefficient democrazy. |
|
1274 | # Handle inefficient democrazy. | |
1275 | repo.ui.note(_(' %s: multiple bids for merge action:\n') % f) |
|
1275 | repo.ui.note(_(' %s: multiple bids for merge action:\n') % f) | |
1276 | for m, l in sorted(bids.items()): |
|
1276 | for m, l in sorted(bids.items()): | |
1277 | for _f, args, msg in l: |
|
1277 | for _f, args, msg in l: | |
1278 | repo.ui.note(' %s -> %s\n' % (msg, m)) |
|
1278 | repo.ui.note(' %s -> %s\n' % (msg, m)) | |
1279 | # Pick random action. TODO: Instead, prompt user when resolving |
|
1279 | # Pick random action. TODO: Instead, prompt user when resolving | |
1280 | m, l = list(bids.items())[0] |
|
1280 | m, l = list(bids.items())[0] | |
1281 | repo.ui.warn(_(' %s: ambiguous merge - picked %s action\n') % |
|
1281 | repo.ui.warn(_(' %s: ambiguous merge - picked %s action\n') % | |
1282 | (f, m)) |
|
1282 | (f, m)) | |
1283 | actions[f] = l[0] |
|
1283 | actions[f] = l[0] | |
1284 | if m == 'dm': |
|
1284 | if m == 'dm': | |
1285 | dms.append(f) |
|
1285 | dms.append(f) | |
1286 | continue |
|
1286 | continue | |
1287 | # Work around 'dm' that can cause multiple actions for the same file |
|
1287 | # Work around 'dm' that can cause multiple actions for the same file | |
1288 | for f in dms: |
|
1288 | for f in dms: | |
1289 | dm, (f0, flags), msg = actions[f] |
|
1289 | dm, (f0, flags), msg = actions[f] | |
1290 | assert dm == 'dm', dm |
|
1290 | assert dm == 'dm', dm | |
1291 | if f0 in actions and actions[f0][0] == 'r': |
|
1291 | if f0 in actions and actions[f0][0] == 'r': | |
1292 | # We have one bid for removing a file and another for moving it. |
|
1292 | # We have one bid for removing a file and another for moving it. | |
1293 | # These two could be merged as first move and then delete ... |
|
1293 | # These two could be merged as first move and then delete ... | |
1294 | # but instead drop moving and just delete. |
|
1294 | # but instead drop moving and just delete. | |
1295 | del actions[f] |
|
1295 | del actions[f] | |
1296 | repo.ui.note(_('end of auction\n\n')) |
|
1296 | repo.ui.note(_('end of auction\n\n')) | |
1297 |
|
1297 | |||
1298 | _resolvetrivial(repo, wctx, mctx, ancestors[0], actions) |
|
1298 | _resolvetrivial(repo, wctx, mctx, ancestors[0], actions) | |
1299 |
|
1299 | |||
1300 | if wctx.rev() is None: |
|
1300 | if wctx.rev() is None: | |
1301 | fractions = _forgetremoved(wctx, mctx, branchmerge) |
|
1301 | fractions = _forgetremoved(wctx, mctx, branchmerge) | |
1302 | actions.update(fractions) |
|
1302 | actions.update(fractions) | |
1303 |
|
1303 | |||
1304 | prunedactions = sparse.filterupdatesactions(repo, wctx, mctx, branchmerge, |
|
1304 | prunedactions = sparse.filterupdatesactions(repo, wctx, mctx, branchmerge, | |
1305 | actions) |
|
1305 | actions) | |
1306 |
|
1306 | |||
1307 | return prunedactions, diverge, renamedelete |
|
1307 | return prunedactions, diverge, renamedelete | |
1308 |
|
1308 | |||
1309 | def _getcwd(): |
|
1309 | def _getcwd(): | |
1310 | try: |
|
1310 | try: | |
1311 | return pycompat.getcwd() |
|
1311 | return pycompat.getcwd() | |
1312 | except OSError as err: |
|
1312 | except OSError as err: | |
1313 | if err.errno == errno.ENOENT: |
|
1313 | if err.errno == errno.ENOENT: | |
1314 | return None |
|
1314 | return None | |
1315 | raise |
|
1315 | raise | |
1316 |
|
1316 | |||
1317 | def batchremove(repo, wctx, actions): |
|
1317 | def batchremove(repo, wctx, actions): | |
1318 | """apply removes to the working directory |
|
1318 | """apply removes to the working directory | |
1319 |
|
1319 | |||
1320 | yields tuples for progress updates |
|
1320 | yields tuples for progress updates | |
1321 | """ |
|
1321 | """ | |
1322 | verbose = repo.ui.verbose |
|
1322 | verbose = repo.ui.verbose | |
1323 | cwd = _getcwd() |
|
1323 | cwd = _getcwd() | |
1324 | i = 0 |
|
1324 | i = 0 | |
1325 | for f, args, msg in actions: |
|
1325 | for f, args, msg in actions: | |
1326 | repo.ui.debug(" %s: %s -> r\n" % (f, msg)) |
|
1326 | repo.ui.debug(" %s: %s -> r\n" % (f, msg)) | |
1327 | if verbose: |
|
1327 | if verbose: | |
1328 | repo.ui.note(_("removing %s\n") % f) |
|
1328 | repo.ui.note(_("removing %s\n") % f) | |
1329 | wctx[f].audit() |
|
1329 | wctx[f].audit() | |
1330 | try: |
|
1330 | try: | |
1331 | wctx[f].remove(ignoremissing=True) |
|
1331 | wctx[f].remove(ignoremissing=True) | |
1332 | except OSError as inst: |
|
1332 | except OSError as inst: | |
1333 | repo.ui.warn(_("update failed to remove %s: %s!\n") % |
|
1333 | repo.ui.warn(_("update failed to remove %s: %s!\n") % | |
1334 | (f, inst.strerror)) |
|
1334 | (f, inst.strerror)) | |
1335 | if i == 100: |
|
1335 | if i == 100: | |
1336 | yield i, f |
|
1336 | yield i, f | |
1337 | i = 0 |
|
1337 | i = 0 | |
1338 | i += 1 |
|
1338 | i += 1 | |
1339 | if i > 0: |
|
1339 | if i > 0: | |
1340 | yield i, f |
|
1340 | yield i, f | |
1341 |
|
1341 | |||
1342 | if cwd and not _getcwd(): |
|
1342 | if cwd and not _getcwd(): | |
1343 | # cwd was removed in the course of removing files; print a helpful |
|
1343 | # cwd was removed in the course of removing files; print a helpful | |
1344 | # warning. |
|
1344 | # warning. | |
1345 | repo.ui.warn(_("current directory was removed\n" |
|
1345 | repo.ui.warn(_("current directory was removed\n" | |
1346 | "(consider changing to repo root: %s)\n") % repo.root) |
|
1346 | "(consider changing to repo root: %s)\n") % repo.root) | |
1347 |
|
1347 | |||
1348 | def batchget(repo, mctx, wctx, actions): |
|
1348 | def batchget(repo, mctx, wctx, actions): | |
1349 | """apply gets to the working directory |
|
1349 | """apply gets to the working directory | |
1350 |
|
1350 | |||
1351 | mctx is the context to get from |
|
1351 | mctx is the context to get from | |
1352 |
|
1352 | |||
1353 | yields tuples for progress updates |
|
1353 | yields tuples for progress updates | |
1354 | """ |
|
1354 | """ | |
1355 | verbose = repo.ui.verbose |
|
1355 | verbose = repo.ui.verbose | |
1356 | fctx = mctx.filectx |
|
1356 | fctx = mctx.filectx | |
1357 | ui = repo.ui |
|
1357 | ui = repo.ui | |
1358 | i = 0 |
|
1358 | i = 0 | |
1359 | with repo.wvfs.backgroundclosing(ui, expectedcount=len(actions)): |
|
1359 | with repo.wvfs.backgroundclosing(ui, expectedcount=len(actions)): | |
1360 | for f, (flags, backup), msg in actions: |
|
1360 | for f, (flags, backup), msg in actions: | |
1361 | repo.ui.debug(" %s: %s -> g\n" % (f, msg)) |
|
1361 | repo.ui.debug(" %s: %s -> g\n" % (f, msg)) | |
1362 | if verbose: |
|
1362 | if verbose: | |
1363 | repo.ui.note(_("getting %s\n") % f) |
|
1363 | repo.ui.note(_("getting %s\n") % f) | |
1364 |
|
1364 | |||
1365 | if backup: |
|
1365 | if backup: | |
1366 | # If a file or directory exists with the same name, back that |
|
1366 | # If a file or directory exists with the same name, back that | |
1367 | # up. Otherwise, look to see if there is a file that conflicts |
|
1367 | # up. Otherwise, look to see if there is a file that conflicts | |
1368 | # with a directory this file is in, and if so, back that up. |
|
1368 | # with a directory this file is in, and if so, back that up. | |
1369 | absf = repo.wjoin(f) |
|
1369 | absf = repo.wjoin(f) | |
1370 | if not repo.wvfs.lexists(f): |
|
1370 | if not repo.wvfs.lexists(f): | |
1371 | for p in util.finddirs(f): |
|
1371 | for p in util.finddirs(f): | |
1372 | if repo.wvfs.isfileorlink(p): |
|
1372 | if repo.wvfs.isfileorlink(p): | |
1373 | absf = repo.wjoin(p) |
|
1373 | absf = repo.wjoin(p) | |
1374 | break |
|
1374 | break | |
1375 | orig = scmutil.origpath(ui, repo, absf) |
|
1375 | orig = scmutil.origpath(ui, repo, absf) | |
1376 | if repo.wvfs.lexists(absf): |
|
1376 | if repo.wvfs.lexists(absf): | |
1377 | util.rename(absf, orig) |
|
1377 | util.rename(absf, orig) | |
1378 | wctx[f].clearunknown() |
|
1378 | wctx[f].clearunknown() | |
1379 | atomictemp = ui.configbool("experimental", "update.atomic-file") |
|
1379 | atomictemp = ui.configbool("experimental", "update.atomic-file") | |
1380 | wctx[f].write(fctx(f).data(), flags, backgroundclose=True, |
|
1380 | wctx[f].write(fctx(f).data(), flags, backgroundclose=True, | |
1381 | atomictemp=atomictemp) |
|
1381 | atomictemp=atomictemp) | |
1382 | if i == 100: |
|
1382 | if i == 100: | |
1383 | yield i, f |
|
1383 | yield i, f | |
1384 | i = 0 |
|
1384 | i = 0 | |
1385 | i += 1 |
|
1385 | i += 1 | |
1386 | if i > 0: |
|
1386 | if i > 0: | |
1387 | yield i, f |
|
1387 | yield i, f | |
1388 |
|
1388 | |||
1389 | def _prefetchfiles(repo, ctx, actions): |
|
1389 | def _prefetchfiles(repo, ctx, actions): | |
1390 | """Invoke ``scmutil.fileprefetchhooks()`` for the files relevant to the dict |
|
1390 | """Invoke ``scmutil.fileprefetchhooks()`` for the files relevant to the dict | |
1391 | of merge actions. ``ctx`` is the context being merged in.""" |
|
1391 | of merge actions. ``ctx`` is the context being merged in.""" | |
1392 |
|
1392 | |||
1393 | # Skipping 'a', 'am', 'f', 'r', 'dm', 'e', 'k', 'p' and 'pr', because they |
|
1393 | # Skipping 'a', 'am', 'f', 'r', 'dm', 'e', 'k', 'p' and 'pr', because they | |
1394 | # don't touch the context to be merged in. 'cd' is skipped, because |
|
1394 | # don't touch the context to be merged in. 'cd' is skipped, because | |
1395 | # changed/deleted never resolves to something from the remote side. |
|
1395 | # changed/deleted never resolves to something from the remote side. | |
1396 | oplist = [actions[a] for a in 'g dc dg m'.split()] |
|
1396 | oplist = [actions[a] for a in 'g dc dg m'.split()] | |
1397 | prefetch = scmutil.fileprefetchhooks |
|
1397 | prefetch = scmutil.fileprefetchhooks | |
1398 | prefetch(repo, ctx, [f for sublist in oplist for f, args, msg in sublist]) |
|
1398 | prefetch(repo, ctx, [f for sublist in oplist for f, args, msg in sublist]) | |
1399 |
|
1399 | |||
1400 | def applyupdates(repo, actions, wctx, mctx, overwrite, labels=None): |
|
1400 | def applyupdates(repo, actions, wctx, mctx, overwrite, labels=None): | |
1401 | """apply the merge action list to the working directory |
|
1401 | """apply the merge action list to the working directory | |
1402 |
|
1402 | |||
1403 | wctx is the working copy context |
|
1403 | wctx is the working copy context | |
1404 | mctx is the context to be merged into the working copy |
|
1404 | mctx is the context to be merged into the working copy | |
1405 |
|
1405 | |||
1406 | Return a tuple of counts (updated, merged, removed, unresolved) that |
|
1406 | Return a tuple of counts (updated, merged, removed, unresolved) that | |
1407 | describes how many files were affected by the update. |
|
1407 | describes how many files were affected by the update. | |
1408 | """ |
|
1408 | """ | |
1409 |
|
1409 | |||
1410 | _prefetchfiles(repo, mctx, actions) |
|
1410 | _prefetchfiles(repo, mctx, actions) | |
1411 |
|
1411 | |||
1412 | updated, merged, removed = 0, 0, 0 |
|
1412 | updated, merged, removed = 0, 0, 0 | |
1413 | ms = mergestate.clean(repo, wctx.p1().node(), mctx.node(), labels) |
|
1413 | ms = mergestate.clean(repo, wctx.p1().node(), mctx.node(), labels) | |
1414 | moves = [] |
|
1414 | moves = [] | |
1415 | for m, l in actions.items(): |
|
1415 | for m, l in actions.items(): | |
1416 | l.sort() |
|
1416 | l.sort() | |
1417 |
|
1417 | |||
1418 | # 'cd' and 'dc' actions are treated like other merge conflicts |
|
1418 | # 'cd' and 'dc' actions are treated like other merge conflicts | |
1419 | mergeactions = sorted(actions['cd']) |
|
1419 | mergeactions = sorted(actions['cd']) | |
1420 | mergeactions.extend(sorted(actions['dc'])) |
|
1420 | mergeactions.extend(sorted(actions['dc'])) | |
1421 | mergeactions.extend(actions['m']) |
|
1421 | mergeactions.extend(actions['m']) | |
1422 | for f, args, msg in mergeactions: |
|
1422 | for f, args, msg in mergeactions: | |
1423 | f1, f2, fa, move, anc = args |
|
1423 | f1, f2, fa, move, anc = args | |
1424 | if f == '.hgsubstate': # merged internally |
|
1424 | if f == '.hgsubstate': # merged internally | |
1425 | continue |
|
1425 | continue | |
1426 | if f1 is None: |
|
1426 | if f1 is None: | |
1427 | fcl = filemerge.absentfilectx(wctx, fa) |
|
1427 | fcl = filemerge.absentfilectx(wctx, fa) | |
1428 | else: |
|
1428 | else: | |
1429 | repo.ui.debug(" preserving %s for resolve of %s\n" % (f1, f)) |
|
1429 | repo.ui.debug(" preserving %s for resolve of %s\n" % (f1, f)) | |
1430 | fcl = wctx[f1] |
|
1430 | fcl = wctx[f1] | |
1431 | if f2 is None: |
|
1431 | if f2 is None: | |
1432 | fco = filemerge.absentfilectx(mctx, fa) |
|
1432 | fco = filemerge.absentfilectx(mctx, fa) | |
1433 | else: |
|
1433 | else: | |
1434 | fco = mctx[f2] |
|
1434 | fco = mctx[f2] | |
1435 | actx = repo[anc] |
|
1435 | actx = repo[anc] | |
1436 | if fa in actx: |
|
1436 | if fa in actx: | |
1437 | fca = actx[fa] |
|
1437 | fca = actx[fa] | |
1438 | else: |
|
1438 | else: | |
1439 | # TODO: move to absentfilectx |
|
1439 | # TODO: move to absentfilectx | |
1440 | fca = repo.filectx(f1, fileid=nullrev) |
|
1440 | fca = repo.filectx(f1, fileid=nullrev) | |
1441 | ms.add(fcl, fco, fca, f) |
|
1441 | ms.add(fcl, fco, fca, f) | |
1442 | if f1 != f and move: |
|
1442 | if f1 != f and move: | |
1443 | moves.append(f1) |
|
1443 | moves.append(f1) | |
1444 |
|
1444 | |||
1445 | _updating = _('updating') |
|
1445 | _updating = _('updating') | |
1446 | _files = _('files') |
|
1446 | _files = _('files') | |
1447 | progress = repo.ui.progress |
|
1447 | progress = repo.ui.progress | |
1448 |
|
1448 | |||
1449 | # remove renamed files after safely stored |
|
1449 | # remove renamed files after safely stored | |
1450 | for f in moves: |
|
1450 | for f in moves: | |
1451 | if wctx[f].lexists(): |
|
1451 | if wctx[f].lexists(): | |
1452 | repo.ui.debug("removing %s\n" % f) |
|
1452 | repo.ui.debug("removing %s\n" % f) | |
1453 | wctx[f].audit() |
|
1453 | wctx[f].audit() | |
1454 | wctx[f].remove() |
|
1454 | wctx[f].remove() | |
1455 |
|
1455 | |||
1456 | numupdates = sum(len(l) for m, l in actions.items() if m != 'k') |
|
1456 | numupdates = sum(len(l) for m, l in actions.items() if m != 'k') | |
1457 | z = 0 |
|
1457 | z = 0 | |
1458 |
|
1458 | |||
1459 | if [a for a in actions['r'] if a[0] == '.hgsubstate']: |
|
1459 | if [a for a in actions['r'] if a[0] == '.hgsubstate']: | |
1460 | subrepoutil.submerge(repo, wctx, mctx, wctx, overwrite, labels) |
|
1460 | subrepoutil.submerge(repo, wctx, mctx, wctx, overwrite, labels) | |
1461 |
|
1461 | |||
1462 | # record path conflicts |
|
1462 | # record path conflicts | |
1463 | for f, args, msg in actions['p']: |
|
1463 | for f, args, msg in actions['p']: | |
1464 | f1, fo = args |
|
1464 | f1, fo = args | |
1465 | s = repo.ui.status |
|
1465 | s = repo.ui.status | |
1466 | s(_("%s: path conflict - a file or link has the same name as a " |
|
1466 | s(_("%s: path conflict - a file or link has the same name as a " | |
1467 | "directory\n") % f) |
|
1467 | "directory\n") % f) | |
1468 | if fo == 'l': |
|
1468 | if fo == 'l': | |
1469 | s(_("the local file has been renamed to %s\n") % f1) |
|
1469 | s(_("the local file has been renamed to %s\n") % f1) | |
1470 | else: |
|
1470 | else: | |
1471 | s(_("the remote file has been renamed to %s\n") % f1) |
|
1471 | s(_("the remote file has been renamed to %s\n") % f1) | |
1472 | s(_("resolve manually then use 'hg resolve --mark %s'\n") % f) |
|
1472 | s(_("resolve manually then use 'hg resolve --mark %s'\n") % f) | |
1473 | ms.addpath(f, f1, fo) |
|
1473 | ms.addpath(f, f1, fo) | |
1474 | z += 1 |
|
1474 | z += 1 | |
1475 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1475 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1476 |
|
1476 | |||
1477 | # When merging in-memory, we can't support worker processes, so set the |
|
1477 | # When merging in-memory, we can't support worker processes, so set the | |
1478 | # per-item cost at 0 in that case. |
|
1478 | # per-item cost at 0 in that case. | |
1479 | cost = 0 if wctx.isinmemory() else 0.001 |
|
1479 | cost = 0 if wctx.isinmemory() else 0.001 | |
1480 |
|
1480 | |||
1481 | # remove in parallel (must come before resolving path conflicts and getting) |
|
1481 | # remove in parallel (must come before resolving path conflicts and getting) | |
1482 | prog = worker.worker(repo.ui, cost, batchremove, (repo, wctx), |
|
1482 | prog = worker.worker(repo.ui, cost, batchremove, (repo, wctx), | |
1483 | actions['r']) |
|
1483 | actions['r']) | |
1484 | for i, item in prog: |
|
1484 | for i, item in prog: | |
1485 | z += i |
|
1485 | z += i | |
1486 | progress(_updating, z, item=item, total=numupdates, unit=_files) |
|
1486 | progress(_updating, z, item=item, total=numupdates, unit=_files) | |
1487 | removed = len(actions['r']) |
|
1487 | removed = len(actions['r']) | |
1488 |
|
1488 | |||
1489 | # resolve path conflicts (must come before getting) |
|
1489 | # resolve path conflicts (must come before getting) | |
1490 | for f, args, msg in actions['pr']: |
|
1490 | for f, args, msg in actions['pr']: | |
1491 | repo.ui.debug(" %s: %s -> pr\n" % (f, msg)) |
|
1491 | repo.ui.debug(" %s: %s -> pr\n" % (f, msg)) | |
1492 | f0, = args |
|
1492 | f0, = args | |
1493 | if wctx[f0].lexists(): |
|
1493 | if wctx[f0].lexists(): | |
1494 | repo.ui.note(_("moving %s to %s\n") % (f0, f)) |
|
1494 | repo.ui.note(_("moving %s to %s\n") % (f0, f)) | |
1495 | wctx[f].audit() |
|
1495 | wctx[f].audit() | |
1496 | wctx[f].write(wctx.filectx(f0).data(), wctx.filectx(f0).flags()) |
|
1496 | wctx[f].write(wctx.filectx(f0).data(), wctx.filectx(f0).flags()) | |
1497 | wctx[f0].remove() |
|
1497 | wctx[f0].remove() | |
1498 | z += 1 |
|
1498 | z += 1 | |
1499 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1499 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1500 |
|
1500 | |||
1501 | # get in parallel |
|
1501 | # get in parallel | |
1502 | prog = worker.worker(repo.ui, cost, batchget, (repo, mctx, wctx), |
|
1502 | prog = worker.worker(repo.ui, cost, batchget, (repo, mctx, wctx), | |
1503 | actions['g']) |
|
1503 | actions['g']) | |
1504 | for i, item in prog: |
|
1504 | for i, item in prog: | |
1505 | z += i |
|
1505 | z += i | |
1506 | progress(_updating, z, item=item, total=numupdates, unit=_files) |
|
1506 | progress(_updating, z, item=item, total=numupdates, unit=_files) | |
1507 | updated = len(actions['g']) |
|
1507 | updated = len(actions['g']) | |
1508 |
|
1508 | |||
1509 | if [a for a in actions['g'] if a[0] == '.hgsubstate']: |
|
1509 | if [a for a in actions['g'] if a[0] == '.hgsubstate']: | |
1510 | subrepoutil.submerge(repo, wctx, mctx, wctx, overwrite, labels) |
|
1510 | subrepoutil.submerge(repo, wctx, mctx, wctx, overwrite, labels) | |
1511 |
|
1511 | |||
1512 | # forget (manifest only, just log it) (must come first) |
|
1512 | # forget (manifest only, just log it) (must come first) | |
1513 | for f, args, msg in actions['f']: |
|
1513 | for f, args, msg in actions['f']: | |
1514 | repo.ui.debug(" %s: %s -> f\n" % (f, msg)) |
|
1514 | repo.ui.debug(" %s: %s -> f\n" % (f, msg)) | |
1515 | z += 1 |
|
1515 | z += 1 | |
1516 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1516 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1517 |
|
1517 | |||
1518 | # re-add (manifest only, just log it) |
|
1518 | # re-add (manifest only, just log it) | |
1519 | for f, args, msg in actions['a']: |
|
1519 | for f, args, msg in actions['a']: | |
1520 | repo.ui.debug(" %s: %s -> a\n" % (f, msg)) |
|
1520 | repo.ui.debug(" %s: %s -> a\n" % (f, msg)) | |
1521 | z += 1 |
|
1521 | z += 1 | |
1522 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1522 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1523 |
|
1523 | |||
1524 | # re-add/mark as modified (manifest only, just log it) |
|
1524 | # re-add/mark as modified (manifest only, just log it) | |
1525 | for f, args, msg in actions['am']: |
|
1525 | for f, args, msg in actions['am']: | |
1526 | repo.ui.debug(" %s: %s -> am\n" % (f, msg)) |
|
1526 | repo.ui.debug(" %s: %s -> am\n" % (f, msg)) | |
1527 | z += 1 |
|
1527 | z += 1 | |
1528 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1528 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1529 |
|
1529 | |||
1530 | # keep (noop, just log it) |
|
1530 | # keep (noop, just log it) | |
1531 | for f, args, msg in actions['k']: |
|
1531 | for f, args, msg in actions['k']: | |
1532 | repo.ui.debug(" %s: %s -> k\n" % (f, msg)) |
|
1532 | repo.ui.debug(" %s: %s -> k\n" % (f, msg)) | |
1533 | # no progress |
|
1533 | # no progress | |
1534 |
|
1534 | |||
1535 | # directory rename, move local |
|
1535 | # directory rename, move local | |
1536 | for f, args, msg in actions['dm']: |
|
1536 | for f, args, msg in actions['dm']: | |
1537 | repo.ui.debug(" %s: %s -> dm\n" % (f, msg)) |
|
1537 | repo.ui.debug(" %s: %s -> dm\n" % (f, msg)) | |
1538 | z += 1 |
|
1538 | z += 1 | |
1539 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1539 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1540 | f0, flags = args |
|
1540 | f0, flags = args | |
1541 | repo.ui.note(_("moving %s to %s\n") % (f0, f)) |
|
1541 | repo.ui.note(_("moving %s to %s\n") % (f0, f)) | |
1542 | wctx[f].audit() |
|
1542 | wctx[f].audit() | |
1543 | wctx[f].write(wctx.filectx(f0).data(), flags) |
|
1543 | wctx[f].write(wctx.filectx(f0).data(), flags) | |
1544 | wctx[f0].remove() |
|
1544 | wctx[f0].remove() | |
1545 | updated += 1 |
|
1545 | updated += 1 | |
1546 |
|
1546 | |||
1547 | # local directory rename, get |
|
1547 | # local directory rename, get | |
1548 | for f, args, msg in actions['dg']: |
|
1548 | for f, args, msg in actions['dg']: | |
1549 | repo.ui.debug(" %s: %s -> dg\n" % (f, msg)) |
|
1549 | repo.ui.debug(" %s: %s -> dg\n" % (f, msg)) | |
1550 | z += 1 |
|
1550 | z += 1 | |
1551 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1551 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1552 | f0, flags = args |
|
1552 | f0, flags = args | |
1553 | repo.ui.note(_("getting %s to %s\n") % (f0, f)) |
|
1553 | repo.ui.note(_("getting %s to %s\n") % (f0, f)) | |
1554 | wctx[f].write(mctx.filectx(f0).data(), flags) |
|
1554 | wctx[f].write(mctx.filectx(f0).data(), flags) | |
1555 | updated += 1 |
|
1555 | updated += 1 | |
1556 |
|
1556 | |||
1557 | # exec |
|
1557 | # exec | |
1558 | for f, args, msg in actions['e']: |
|
1558 | for f, args, msg in actions['e']: | |
1559 | repo.ui.debug(" %s: %s -> e\n" % (f, msg)) |
|
1559 | repo.ui.debug(" %s: %s -> e\n" % (f, msg)) | |
1560 | z += 1 |
|
1560 | z += 1 | |
1561 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1561 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1562 | flags, = args |
|
1562 | flags, = args | |
1563 | wctx[f].audit() |
|
1563 | wctx[f].audit() | |
1564 | wctx[f].setflags('l' in flags, 'x' in flags) |
|
1564 | wctx[f].setflags('l' in flags, 'x' in flags) | |
1565 | updated += 1 |
|
1565 | updated += 1 | |
1566 |
|
1566 | |||
1567 | # the ordering is important here -- ms.mergedriver will raise if the merge |
|
1567 | # the ordering is important here -- ms.mergedriver will raise if the merge | |
1568 | # driver has changed, and we want to be able to bypass it when overwrite is |
|
1568 | # driver has changed, and we want to be able to bypass it when overwrite is | |
1569 | # True |
|
1569 | # True | |
1570 | usemergedriver = not overwrite and mergeactions and ms.mergedriver |
|
1570 | usemergedriver = not overwrite and mergeactions and ms.mergedriver | |
1571 |
|
1571 | |||
1572 | if usemergedriver: |
|
1572 | if usemergedriver: | |
1573 | if wctx.isinmemory(): |
|
1573 | if wctx.isinmemory(): | |
1574 | raise error.InMemoryMergeConflictsError("in-memory merge does not " |
|
1574 | raise error.InMemoryMergeConflictsError("in-memory merge does not " | |
1575 | "support mergedriver") |
|
1575 | "support mergedriver") | |
1576 | ms.commit() |
|
1576 | ms.commit() | |
1577 | proceed = driverpreprocess(repo, ms, wctx, labels=labels) |
|
1577 | proceed = driverpreprocess(repo, ms, wctx, labels=labels) | |
1578 | # the driver might leave some files unresolved |
|
1578 | # the driver might leave some files unresolved | |
1579 | unresolvedf = set(ms.unresolved()) |
|
1579 | unresolvedf = set(ms.unresolved()) | |
1580 | if not proceed: |
|
1580 | if not proceed: | |
1581 | # XXX setting unresolved to at least 1 is a hack to make sure we |
|
1581 | # XXX setting unresolved to at least 1 is a hack to make sure we | |
1582 | # error out |
|
1582 | # error out | |
1583 | return updated, merged, removed, max(len(unresolvedf), 1) |
|
1583 | return updated, merged, removed, max(len(unresolvedf), 1) | |
1584 | newactions = [] |
|
1584 | newactions = [] | |
1585 | for f, args, msg in mergeactions: |
|
1585 | for f, args, msg in mergeactions: | |
1586 | if f in unresolvedf: |
|
1586 | if f in unresolvedf: | |
1587 | newactions.append((f, args, msg)) |
|
1587 | newactions.append((f, args, msg)) | |
1588 | mergeactions = newactions |
|
1588 | mergeactions = newactions | |
1589 |
|
1589 | |||
1590 | try: |
|
1590 | try: | |
1591 | # premerge |
|
1591 | # premerge | |
1592 | tocomplete = [] |
|
1592 | tocomplete = [] | |
1593 | for f, args, msg in mergeactions: |
|
1593 | for f, args, msg in mergeactions: | |
1594 | repo.ui.debug(" %s: %s -> m (premerge)\n" % (f, msg)) |
|
1594 | repo.ui.debug(" %s: %s -> m (premerge)\n" % (f, msg)) | |
1595 | z += 1 |
|
1595 | z += 1 | |
1596 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1596 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1597 | if f == '.hgsubstate': # subrepo states need updating |
|
1597 | if f == '.hgsubstate': # subrepo states need updating | |
1598 | subrepoutil.submerge(repo, wctx, mctx, wctx.ancestor(mctx), |
|
1598 | subrepoutil.submerge(repo, wctx, mctx, wctx.ancestor(mctx), | |
1599 | overwrite, labels) |
|
1599 | overwrite, labels) | |
1600 | continue |
|
1600 | continue | |
1601 | wctx[f].audit() |
|
1601 | wctx[f].audit() | |
1602 | complete, r = ms.preresolve(f, wctx) |
|
1602 | complete, r = ms.preresolve(f, wctx) | |
1603 | if not complete: |
|
1603 | if not complete: | |
1604 | numupdates += 1 |
|
1604 | numupdates += 1 | |
1605 | tocomplete.append((f, args, msg)) |
|
1605 | tocomplete.append((f, args, msg)) | |
1606 |
|
1606 | |||
1607 | # merge |
|
1607 | # merge | |
1608 | for f, args, msg in tocomplete: |
|
1608 | for f, args, msg in tocomplete: | |
1609 | repo.ui.debug(" %s: %s -> m (merge)\n" % (f, msg)) |
|
1609 | repo.ui.debug(" %s: %s -> m (merge)\n" % (f, msg)) | |
1610 | z += 1 |
|
1610 | z += 1 | |
1611 | progress(_updating, z, item=f, total=numupdates, unit=_files) |
|
1611 | progress(_updating, z, item=f, total=numupdates, unit=_files) | |
1612 | ms.resolve(f, wctx) |
|
1612 | ms.resolve(f, wctx) | |
1613 |
|
1613 | |||
1614 | finally: |
|
1614 | finally: | |
1615 | ms.commit() |
|
1615 | ms.commit() | |
1616 |
|
1616 | |||
1617 | unresolved = ms.unresolvedcount() |
|
1617 | unresolved = ms.unresolvedcount() | |
1618 |
|
1618 | |||
1619 | if usemergedriver and not unresolved and ms.mdstate() != 's': |
|
1619 | if usemergedriver and not unresolved and ms.mdstate() != 's': | |
1620 | if not driverconclude(repo, ms, wctx, labels=labels): |
|
1620 | if not driverconclude(repo, ms, wctx, labels=labels): | |
1621 | # XXX setting unresolved to at least 1 is a hack to make sure we |
|
1621 | # XXX setting unresolved to at least 1 is a hack to make sure we | |
1622 | # error out |
|
1622 | # error out | |
1623 | unresolved = max(unresolved, 1) |
|
1623 | unresolved = max(unresolved, 1) | |
1624 |
|
1624 | |||
1625 | ms.commit() |
|
1625 | ms.commit() | |
1626 |
|
1626 | |||
1627 | msupdated, msmerged, msremoved = ms.counts() |
|
1627 | msupdated, msmerged, msremoved = ms.counts() | |
1628 | updated += msupdated |
|
1628 | updated += msupdated | |
1629 | merged += msmerged |
|
1629 | merged += msmerged | |
1630 | removed += msremoved |
|
1630 | removed += msremoved | |
1631 |
|
1631 | |||
1632 | extraactions = ms.actions() |
|
1632 | extraactions = ms.actions() | |
1633 | if extraactions: |
|
1633 | if extraactions: | |
1634 | mfiles = set(a[0] for a in actions['m']) |
|
1634 | mfiles = set(a[0] for a in actions['m']) | |
1635 | for k, acts in extraactions.iteritems(): |
|
1635 | for k, acts in extraactions.iteritems(): | |
1636 | actions[k].extend(acts) |
|
1636 | actions[k].extend(acts) | |
1637 | # Remove these files from actions['m'] as well. This is important |
|
1637 | # Remove these files from actions['m'] as well. This is important | |
1638 | # because in recordupdates, files in actions['m'] are processed |
|
1638 | # because in recordupdates, files in actions['m'] are processed | |
1639 | # after files in other actions, and the merge driver might add |
|
1639 | # after files in other actions, and the merge driver might add | |
1640 | # files to those actions via extraactions above. This can lead to a |
|
1640 | # files to those actions via extraactions above. This can lead to a | |
1641 | # file being recorded twice, with poor results. This is especially |
|
1641 | # file being recorded twice, with poor results. This is especially | |
1642 | # problematic for actions['r'] (currently only possible with the |
|
1642 | # problematic for actions['r'] (currently only possible with the | |
1643 | # merge driver in the initial merge process; interrupted merges |
|
1643 | # merge driver in the initial merge process; interrupted merges | |
1644 | # don't go through this flow). |
|
1644 | # don't go through this flow). | |
1645 | # |
|
1645 | # | |
1646 | # The real fix here is to have indexes by both file and action so |
|
1646 | # The real fix here is to have indexes by both file and action so | |
1647 | # that when the action for a file is changed it is automatically |
|
1647 | # that when the action for a file is changed it is automatically | |
1648 | # reflected in the other action lists. But that involves a more |
|
1648 | # reflected in the other action lists. But that involves a more | |
1649 | # complex data structure, so this will do for now. |
|
1649 | # complex data structure, so this will do for now. | |
1650 | # |
|
1650 | # | |
1651 | # We don't need to do the same operation for 'dc' and 'cd' because |
|
1651 | # We don't need to do the same operation for 'dc' and 'cd' because | |
1652 | # those lists aren't consulted again. |
|
1652 | # those lists aren't consulted again. | |
1653 | mfiles.difference_update(a[0] for a in acts) |
|
1653 | mfiles.difference_update(a[0] for a in acts) | |
1654 |
|
1654 | |||
1655 | actions['m'] = [a for a in actions['m'] if a[0] in mfiles] |
|
1655 | actions['m'] = [a for a in actions['m'] if a[0] in mfiles] | |
1656 |
|
1656 | |||
1657 | progress(_updating, None, total=numupdates, unit=_files) |
|
1657 | progress(_updating, None, total=numupdates, unit=_files) | |
1658 |
|
1658 | |||
1659 | return updated, merged, removed, unresolved |
|
1659 | return updated, merged, removed, unresolved | |
1660 |
|
1660 | |||
1661 | def recordupdates(repo, actions, branchmerge): |
|
1661 | def recordupdates(repo, actions, branchmerge): | |
1662 | "record merge actions to the dirstate" |
|
1662 | "record merge actions to the dirstate" | |
1663 | # remove (must come first) |
|
1663 | # remove (must come first) | |
1664 | for f, args, msg in actions.get('r', []): |
|
1664 | for f, args, msg in actions.get('r', []): | |
1665 | if branchmerge: |
|
1665 | if branchmerge: | |
1666 | repo.dirstate.remove(f) |
|
1666 | repo.dirstate.remove(f) | |
1667 | else: |
|
1667 | else: | |
1668 | repo.dirstate.drop(f) |
|
1668 | repo.dirstate.drop(f) | |
1669 |
|
1669 | |||
1670 | # forget (must come first) |
|
1670 | # forget (must come first) | |
1671 | for f, args, msg in actions.get('f', []): |
|
1671 | for f, args, msg in actions.get('f', []): | |
1672 | repo.dirstate.drop(f) |
|
1672 | repo.dirstate.drop(f) | |
1673 |
|
1673 | |||
1674 | # resolve path conflicts |
|
1674 | # resolve path conflicts | |
1675 | for f, args, msg in actions.get('pr', []): |
|
1675 | for f, args, msg in actions.get('pr', []): | |
1676 | f0, = args |
|
1676 | f0, = args | |
1677 | origf0 = repo.dirstate.copied(f0) or f0 |
|
1677 | origf0 = repo.dirstate.copied(f0) or f0 | |
1678 | repo.dirstate.add(f) |
|
1678 | repo.dirstate.add(f) | |
1679 | repo.dirstate.copy(origf0, f) |
|
1679 | repo.dirstate.copy(origf0, f) | |
1680 | if f0 == origf0: |
|
1680 | if f0 == origf0: | |
1681 | repo.dirstate.remove(f0) |
|
1681 | repo.dirstate.remove(f0) | |
1682 | else: |
|
1682 | else: | |
1683 | repo.dirstate.drop(f0) |
|
1683 | repo.dirstate.drop(f0) | |
1684 |
|
1684 | |||
1685 | # re-add |
|
1685 | # re-add | |
1686 | for f, args, msg in actions.get('a', []): |
|
1686 | for f, args, msg in actions.get('a', []): | |
1687 | repo.dirstate.add(f) |
|
1687 | repo.dirstate.add(f) | |
1688 |
|
1688 | |||
1689 | # re-add/mark as modified |
|
1689 | # re-add/mark as modified | |
1690 | for f, args, msg in actions.get('am', []): |
|
1690 | for f, args, msg in actions.get('am', []): | |
1691 | if branchmerge: |
|
1691 | if branchmerge: | |
1692 | repo.dirstate.normallookup(f) |
|
1692 | repo.dirstate.normallookup(f) | |
1693 | else: |
|
1693 | else: | |
1694 | repo.dirstate.add(f) |
|
1694 | repo.dirstate.add(f) | |
1695 |
|
1695 | |||
1696 | # exec change |
|
1696 | # exec change | |
1697 | for f, args, msg in actions.get('e', []): |
|
1697 | for f, args, msg in actions.get('e', []): | |
1698 | repo.dirstate.normallookup(f) |
|
1698 | repo.dirstate.normallookup(f) | |
1699 |
|
1699 | |||
1700 | # keep |
|
1700 | # keep | |
1701 | for f, args, msg in actions.get('k', []): |
|
1701 | for f, args, msg in actions.get('k', []): | |
1702 | pass |
|
1702 | pass | |
1703 |
|
1703 | |||
1704 | # get |
|
1704 | # get | |
1705 | for f, args, msg in actions.get('g', []): |
|
1705 | for f, args, msg in actions.get('g', []): | |
1706 | if branchmerge: |
|
1706 | if branchmerge: | |
1707 | repo.dirstate.otherparent(f) |
|
1707 | repo.dirstate.otherparent(f) | |
1708 | else: |
|
1708 | else: | |
1709 | repo.dirstate.normal(f) |
|
1709 | repo.dirstate.normal(f) | |
1710 |
|
1710 | |||
1711 | # merge |
|
1711 | # merge | |
1712 | for f, args, msg in actions.get('m', []): |
|
1712 | for f, args, msg in actions.get('m', []): | |
1713 | f1, f2, fa, move, anc = args |
|
1713 | f1, f2, fa, move, anc = args | |
1714 | if branchmerge: |
|
1714 | if branchmerge: | |
1715 | # We've done a branch merge, mark this file as merged |
|
1715 | # We've done a branch merge, mark this file as merged | |
1716 | # so that we properly record the merger later |
|
1716 | # so that we properly record the merger later | |
1717 | repo.dirstate.merge(f) |
|
1717 | repo.dirstate.merge(f) | |
1718 | if f1 != f2: # copy/rename |
|
1718 | if f1 != f2: # copy/rename | |
1719 | if move: |
|
1719 | if move: | |
1720 | repo.dirstate.remove(f1) |
|
1720 | repo.dirstate.remove(f1) | |
1721 | if f1 != f: |
|
1721 | if f1 != f: | |
1722 | repo.dirstate.copy(f1, f) |
|
1722 | repo.dirstate.copy(f1, f) | |
1723 | else: |
|
1723 | else: | |
1724 | repo.dirstate.copy(f2, f) |
|
1724 | repo.dirstate.copy(f2, f) | |
1725 | else: |
|
1725 | else: | |
1726 | # We've update-merged a locally modified file, so |
|
1726 | # We've update-merged a locally modified file, so | |
1727 | # we set the dirstate to emulate a normal checkout |
|
1727 | # we set the dirstate to emulate a normal checkout | |
1728 | # of that file some time in the past. Thus our |
|
1728 | # of that file some time in the past. Thus our | |
1729 | # merge will appear as a normal local file |
|
1729 | # merge will appear as a normal local file | |
1730 | # modification. |
|
1730 | # modification. | |
1731 | if f2 == f: # file not locally copied/moved |
|
1731 | if f2 == f: # file not locally copied/moved | |
1732 | repo.dirstate.normallookup(f) |
|
1732 | repo.dirstate.normallookup(f) | |
1733 | if move: |
|
1733 | if move: | |
1734 | repo.dirstate.drop(f1) |
|
1734 | repo.dirstate.drop(f1) | |
1735 |
|
1735 | |||
1736 | # directory rename, move local |
|
1736 | # directory rename, move local | |
1737 | for f, args, msg in actions.get('dm', []): |
|
1737 | for f, args, msg in actions.get('dm', []): | |
1738 | f0, flag = args |
|
1738 | f0, flag = args | |
1739 | if branchmerge: |
|
1739 | if branchmerge: | |
1740 | repo.dirstate.add(f) |
|
1740 | repo.dirstate.add(f) | |
1741 | repo.dirstate.remove(f0) |
|
1741 | repo.dirstate.remove(f0) | |
1742 | repo.dirstate.copy(f0, f) |
|
1742 | repo.dirstate.copy(f0, f) | |
1743 | else: |
|
1743 | else: | |
1744 | repo.dirstate.normal(f) |
|
1744 | repo.dirstate.normal(f) | |
1745 | repo.dirstate.drop(f0) |
|
1745 | repo.dirstate.drop(f0) | |
1746 |
|
1746 | |||
1747 | # directory rename, get |
|
1747 | # directory rename, get | |
1748 | for f, args, msg in actions.get('dg', []): |
|
1748 | for f, args, msg in actions.get('dg', []): | |
1749 | f0, flag = args |
|
1749 | f0, flag = args | |
1750 | if branchmerge: |
|
1750 | if branchmerge: | |
1751 | repo.dirstate.add(f) |
|
1751 | repo.dirstate.add(f) | |
1752 | repo.dirstate.copy(f0, f) |
|
1752 | repo.dirstate.copy(f0, f) | |
1753 | else: |
|
1753 | else: | |
1754 | repo.dirstate.normal(f) |
|
1754 | repo.dirstate.normal(f) | |
1755 |
|
1755 | |||
1756 | def update(repo, node, branchmerge, force, ancestor=None, |
|
1756 | def update(repo, node, branchmerge, force, ancestor=None, | |
1757 | mergeancestor=False, labels=None, matcher=None, mergeforce=False, |
|
1757 | mergeancestor=False, labels=None, matcher=None, mergeforce=False, | |
1758 | updatecheck=None, wc=None): |
|
1758 | updatecheck=None, wc=None): | |
1759 | """ |
|
1759 | """ | |
1760 | Perform a merge between the working directory and the given node |
|
1760 | Perform a merge between the working directory and the given node | |
1761 |
|
1761 | |||
1762 | node = the node to update to |
|
1762 | node = the node to update to | |
1763 | branchmerge = whether to merge between branches |
|
1763 | branchmerge = whether to merge between branches | |
1764 | force = whether to force branch merging or file overwriting |
|
1764 | force = whether to force branch merging or file overwriting | |
1765 | matcher = a matcher to filter file lists (dirstate not updated) |
|
1765 | matcher = a matcher to filter file lists (dirstate not updated) | |
1766 | mergeancestor = whether it is merging with an ancestor. If true, |
|
1766 | mergeancestor = whether it is merging with an ancestor. If true, | |
1767 | we should accept the incoming changes for any prompts that occur. |
|
1767 | we should accept the incoming changes for any prompts that occur. | |
1768 | If false, merging with an ancestor (fast-forward) is only allowed |
|
1768 | If false, merging with an ancestor (fast-forward) is only allowed | |
1769 | between different named branches. This flag is used by rebase extension |
|
1769 | between different named branches. This flag is used by rebase extension | |
1770 | as a temporary fix and should be avoided in general. |
|
1770 | as a temporary fix and should be avoided in general. | |
1771 | labels = labels to use for base, local and other |
|
1771 | labels = labels to use for base, local and other | |
1772 | mergeforce = whether the merge was run with 'merge --force' (deprecated): if |
|
1772 | mergeforce = whether the merge was run with 'merge --force' (deprecated): if | |
1773 | this is True, then 'force' should be True as well. |
|
1773 | this is True, then 'force' should be True as well. | |
1774 |
|
1774 | |||
1775 | The table below shows all the behaviors of the update command given the |
|
1775 | The table below shows all the behaviors of the update command given the | |
1776 | -c/--check and -C/--clean or no options, whether the working directory is |
|
1776 | -c/--check and -C/--clean or no options, whether the working directory is | |
1777 | dirty, whether a revision is specified, and the relationship of the parent |
|
1777 | dirty, whether a revision is specified, and the relationship of the parent | |
1778 | rev to the target rev (linear or not). Match from top first. The -n |
|
1778 | rev to the target rev (linear or not). Match from top first. The -n | |
1779 | option doesn't exist on the command line, but represents the |
|
1779 | option doesn't exist on the command line, but represents the | |
1780 | experimental.updatecheck=noconflict option. |
|
1780 | experimental.updatecheck=noconflict option. | |
1781 |
|
1781 | |||
1782 | This logic is tested by test-update-branches.t. |
|
1782 | This logic is tested by test-update-branches.t. | |
1783 |
|
1783 | |||
1784 | -c -C -n -m dirty rev linear | result |
|
1784 | -c -C -n -m dirty rev linear | result | |
1785 | y y * * * * * | (1) |
|
1785 | y y * * * * * | (1) | |
1786 | y * y * * * * | (1) |
|
1786 | y * y * * * * | (1) | |
1787 | y * * y * * * | (1) |
|
1787 | y * * y * * * | (1) | |
1788 | * y y * * * * | (1) |
|
1788 | * y y * * * * | (1) | |
1789 | * y * y * * * | (1) |
|
1789 | * y * y * * * | (1) | |
1790 | * * y y * * * | (1) |
|
1790 | * * y y * * * | (1) | |
1791 | * * * * * n n | x |
|
1791 | * * * * * n n | x | |
1792 | * * * * n * * | ok |
|
1792 | * * * * n * * | ok | |
1793 | n n n n y * y | merge |
|
1793 | n n n n y * y | merge | |
1794 | n n n n y y n | (2) |
|
1794 | n n n n y y n | (2) | |
1795 | n n n y y * * | merge |
|
1795 | n n n y y * * | merge | |
1796 | n n y n y * * | merge if no conflict |
|
1796 | n n y n y * * | merge if no conflict | |
1797 | n y n n y * * | discard |
|
1797 | n y n n y * * | discard | |
1798 | y n n n y * * | (3) |
|
1798 | y n n n y * * | (3) | |
1799 |
|
1799 | |||
1800 | x = can't happen |
|
1800 | x = can't happen | |
1801 | * = don't-care |
|
1801 | * = don't-care | |
1802 | 1 = incompatible options (checked in commands.py) |
|
1802 | 1 = incompatible options (checked in commands.py) | |
1803 | 2 = abort: uncommitted changes (commit or update --clean to discard changes) |
|
1803 | 2 = abort: uncommitted changes (commit or update --clean to discard changes) | |
1804 | 3 = abort: uncommitted changes (checked in commands.py) |
|
1804 | 3 = abort: uncommitted changes (checked in commands.py) | |
1805 |
|
1805 | |||
1806 | The merge is performed inside ``wc``, a workingctx-like objects. It defaults |
|
1806 | The merge is performed inside ``wc``, a workingctx-like objects. It defaults | |
1807 | to repo[None] if None is passed. |
|
1807 | to repo[None] if None is passed. | |
1808 |
|
1808 | |||
1809 | Return the same tuple as applyupdates(). |
|
1809 | Return the same tuple as applyupdates(). | |
1810 | """ |
|
1810 | """ | |
1811 | # Avoid cycle. |
|
1811 | # Avoid cycle. | |
1812 | from . import sparse |
|
1812 | from . import sparse | |
1813 |
|
1813 | |||
1814 | # This function used to find the default destination if node was None, but |
|
1814 | # This function used to find the default destination if node was None, but | |
1815 | # that's now in destutil.py. |
|
1815 | # that's now in destutil.py. | |
1816 | assert node is not None |
|
1816 | assert node is not None | |
1817 | if not branchmerge and not force: |
|
1817 | if not branchmerge and not force: | |
1818 | # TODO: remove the default once all callers that pass branchmerge=False |
|
1818 | # TODO: remove the default once all callers that pass branchmerge=False | |
1819 | # and force=False pass a value for updatecheck. We may want to allow |
|
1819 | # and force=False pass a value for updatecheck. We may want to allow | |
1820 | # updatecheck='abort' to better suppport some of these callers. |
|
1820 | # updatecheck='abort' to better suppport some of these callers. | |
1821 | if updatecheck is None: |
|
1821 | if updatecheck is None: | |
1822 | updatecheck = 'linear' |
|
1822 | updatecheck = 'linear' | |
1823 | assert updatecheck in ('none', 'linear', 'noconflict') |
|
1823 | assert updatecheck in ('none', 'linear', 'noconflict') | |
1824 | # If we're doing a partial update, we need to skip updating |
|
1824 | # If we're doing a partial update, we need to skip updating | |
1825 | # the dirstate, so make a note of any partial-ness to the |
|
1825 | # the dirstate, so make a note of any partial-ness to the | |
1826 | # update here. |
|
1826 | # update here. | |
1827 | if matcher is None or matcher.always(): |
|
1827 | if matcher is None or matcher.always(): | |
1828 | partial = False |
|
1828 | partial = False | |
1829 | else: |
|
1829 | else: | |
1830 | partial = True |
|
1830 | partial = True | |
1831 | with repo.wlock(): |
|
1831 | with repo.wlock(): | |
1832 | if wc is None: |
|
1832 | if wc is None: | |
1833 | wc = repo[None] |
|
1833 | wc = repo[None] | |
1834 | pl = wc.parents() |
|
1834 | pl = wc.parents() | |
1835 | p1 = pl[0] |
|
1835 | p1 = pl[0] | |
1836 | pas = [None] |
|
1836 | pas = [None] | |
1837 | if ancestor is not None: |
|
1837 | if ancestor is not None: | |
1838 | pas = [repo[ancestor]] |
|
1838 | pas = [repo[ancestor]] | |
1839 |
|
1839 | |||
1840 | overwrite = force and not branchmerge |
|
1840 | overwrite = force and not branchmerge | |
1841 |
|
1841 | |||
1842 | p2 = repo[node] |
|
1842 | p2 = repo[node] | |
1843 | if pas[0] is None: |
|
1843 | if pas[0] is None: | |
1844 | if repo.ui.configlist('merge', 'preferancestor') == ['*']: |
|
1844 | if repo.ui.configlist('merge', 'preferancestor') == ['*']: | |
1845 | cahs = repo.changelog.commonancestorsheads(p1.node(), p2.node()) |
|
1845 | cahs = repo.changelog.commonancestorsheads(p1.node(), p2.node()) | |
1846 | pas = [repo[anc] for anc in (sorted(cahs) or [nullid])] |
|
1846 | pas = [repo[anc] for anc in (sorted(cahs) or [nullid])] | |
1847 | else: |
|
1847 | else: | |
1848 | pas = [p1.ancestor(p2, warn=branchmerge)] |
|
1848 | pas = [p1.ancestor(p2, warn=branchmerge)] | |
1849 |
|
1849 | |||
1850 | fp1, fp2, xp1, xp2 = p1.node(), p2.node(), bytes(p1), bytes(p2) |
|
1850 | fp1, fp2, xp1, xp2 = p1.node(), p2.node(), bytes(p1), bytes(p2) | |
1851 |
|
1851 | |||
1852 | ### check phase |
|
1852 | ### check phase | |
1853 | if not overwrite: |
|
1853 | if not overwrite: | |
1854 | if len(pl) > 1: |
|
1854 | if len(pl) > 1: | |
1855 | raise error.Abort(_("outstanding uncommitted merge")) |
|
1855 | raise error.Abort(_("outstanding uncommitted merge")) | |
1856 | ms = mergestate.read(repo) |
|
1856 | ms = mergestate.read(repo) | |
1857 | if list(ms.unresolved()): |
|
1857 | if list(ms.unresolved()): | |
1858 | raise error.Abort(_("outstanding merge conflicts")) |
|
1858 | raise error.Abort(_("outstanding merge conflicts")) | |
1859 | if branchmerge: |
|
1859 | if branchmerge: | |
1860 | if pas == [p2]: |
|
1860 | if pas == [p2]: | |
1861 | raise error.Abort(_("merging with a working directory ancestor" |
|
1861 | raise error.Abort(_("merging with a working directory ancestor" | |
1862 | " has no effect")) |
|
1862 | " has no effect")) | |
1863 | elif pas == [p1]: |
|
1863 | elif pas == [p1]: | |
1864 | if not mergeancestor and wc.branch() == p2.branch(): |
|
1864 | if not mergeancestor and wc.branch() == p2.branch(): | |
1865 | raise error.Abort(_("nothing to merge"), |
|
1865 | raise error.Abort(_("nothing to merge"), | |
1866 | hint=_("use 'hg update' " |
|
1866 | hint=_("use 'hg update' " | |
1867 | "or check 'hg heads'")) |
|
1867 | "or check 'hg heads'")) | |
1868 | if not force and (wc.files() or wc.deleted()): |
|
1868 | if not force and (wc.files() or wc.deleted()): | |
1869 | raise error.Abort(_("uncommitted changes"), |
|
1869 | raise error.Abort(_("uncommitted changes"), | |
1870 | hint=_("use 'hg status' to list changes")) |
|
1870 | hint=_("use 'hg status' to list changes")) | |
1871 | if not wc.isinmemory(): |
|
1871 | if not wc.isinmemory(): | |
1872 | for s in sorted(wc.substate): |
|
1872 | for s in sorted(wc.substate): | |
1873 | wc.sub(s).bailifchanged() |
|
1873 | wc.sub(s).bailifchanged() | |
1874 |
|
1874 | |||
1875 | elif not overwrite: |
|
1875 | elif not overwrite: | |
1876 | if p1 == p2: # no-op update |
|
1876 | if p1 == p2: # no-op update | |
1877 | # call the hooks and exit early |
|
1877 | # call the hooks and exit early | |
1878 | repo.hook('preupdate', throw=True, parent1=xp2, parent2='') |
|
1878 | repo.hook('preupdate', throw=True, parent1=xp2, parent2='') | |
1879 | repo.hook('update', parent1=xp2, parent2='', error=0) |
|
1879 | repo.hook('update', parent1=xp2, parent2='', error=0) | |
1880 | return 0, 0, 0, 0 |
|
1880 | return 0, 0, 0, 0 | |
1881 |
|
1881 | |||
1882 | if (updatecheck == 'linear' and |
|
1882 | if (updatecheck == 'linear' and | |
1883 | pas not in ([p1], [p2])): # nonlinear |
|
1883 | pas not in ([p1], [p2])): # nonlinear | |
1884 | dirty = wc.dirty(missing=True) |
|
1884 | dirty = wc.dirty(missing=True) | |
1885 | if dirty: |
|
1885 | if dirty: | |
1886 | # Branching is a bit strange to ensure we do the minimal |
|
1886 | # Branching is a bit strange to ensure we do the minimal | |
1887 | # amount of call to obsutil.foreground. |
|
1887 | # amount of call to obsutil.foreground. | |
1888 | foreground = obsutil.foreground(repo, [p1.node()]) |
|
1888 | foreground = obsutil.foreground(repo, [p1.node()]) | |
1889 | # note: the <node> variable contains a random identifier |
|
1889 | # note: the <node> variable contains a random identifier | |
1890 | if repo[node].node() in foreground: |
|
1890 | if repo[node].node() in foreground: | |
1891 | pass # allow updating to successors |
|
1891 | pass # allow updating to successors | |
1892 | else: |
|
1892 | else: | |
1893 | msg = _("uncommitted changes") |
|
1893 | msg = _("uncommitted changes") | |
1894 | hint = _("commit or update --clean to discard changes") |
|
1894 | hint = _("commit or update --clean to discard changes") | |
1895 | raise error.UpdateAbort(msg, hint=hint) |
|
1895 | raise error.UpdateAbort(msg, hint=hint) | |
1896 | else: |
|
1896 | else: | |
1897 | # Allow jumping branches if clean and specific rev given |
|
1897 | # Allow jumping branches if clean and specific rev given | |
1898 | pass |
|
1898 | pass | |
1899 |
|
1899 | |||
1900 | if overwrite: |
|
1900 | if overwrite: | |
1901 | pas = [wc] |
|
1901 | pas = [wc] | |
1902 | elif not branchmerge: |
|
1902 | elif not branchmerge: | |
1903 | pas = [p1] |
|
1903 | pas = [p1] | |
1904 |
|
1904 | |||
1905 | # deprecated config: merge.followcopies |
|
1905 | # deprecated config: merge.followcopies | |
1906 | followcopies = repo.ui.configbool('merge', 'followcopies') |
|
1906 | followcopies = repo.ui.configbool('merge', 'followcopies') | |
1907 | if overwrite: |
|
1907 | if overwrite: | |
1908 | followcopies = False |
|
1908 | followcopies = False | |
1909 | elif not pas[0]: |
|
1909 | elif not pas[0]: | |
1910 | followcopies = False |
|
1910 | followcopies = False | |
1911 | if not branchmerge and not wc.dirty(missing=True): |
|
1911 | if not branchmerge and not wc.dirty(missing=True): | |
1912 | followcopies = False |
|
1912 | followcopies = False | |
1913 |
|
1913 | |||
1914 | ### calculate phase |
|
1914 | ### calculate phase | |
1915 | actionbyfile, diverge, renamedelete = calculateupdates( |
|
1915 | actionbyfile, diverge, renamedelete = calculateupdates( | |
1916 | repo, wc, p2, pas, branchmerge, force, mergeancestor, |
|
1916 | repo, wc, p2, pas, branchmerge, force, mergeancestor, | |
1917 | followcopies, matcher=matcher, mergeforce=mergeforce) |
|
1917 | followcopies, matcher=matcher, mergeforce=mergeforce) | |
1918 |
|
1918 | |||
1919 | if updatecheck == 'noconflict': |
|
1919 | if updatecheck == 'noconflict': | |
1920 | for f, (m, args, msg) in actionbyfile.iteritems(): |
|
1920 | for f, (m, args, msg) in actionbyfile.iteritems(): | |
1921 | if m not in ('g', 'k', 'e', 'r', 'pr'): |
|
1921 | if m not in ('g', 'k', 'e', 'r', 'pr'): | |
1922 | msg = _("conflicting changes") |
|
1922 | msg = _("conflicting changes") | |
1923 | hint = _("commit or update --clean to discard changes") |
|
1923 | hint = _("commit or update --clean to discard changes") | |
1924 | raise error.Abort(msg, hint=hint) |
|
1924 | raise error.Abort(msg, hint=hint) | |
1925 |
|
1925 | |||
1926 | # Prompt and create actions. Most of this is in the resolve phase |
|
1926 | # Prompt and create actions. Most of this is in the resolve phase | |
1927 | # already, but we can't handle .hgsubstate in filemerge or |
|
1927 | # already, but we can't handle .hgsubstate in filemerge or | |
1928 | # subrepoutil.submerge yet so we have to keep prompting for it. |
|
1928 | # subrepoutil.submerge yet so we have to keep prompting for it. | |
1929 | if '.hgsubstate' in actionbyfile: |
|
1929 | if '.hgsubstate' in actionbyfile: | |
1930 | f = '.hgsubstate' |
|
1930 | f = '.hgsubstate' | |
1931 | m, args, msg = actionbyfile[f] |
|
1931 | m, args, msg = actionbyfile[f] | |
1932 | prompts = filemerge.partextras(labels) |
|
1932 | prompts = filemerge.partextras(labels) | |
1933 | prompts['f'] = f |
|
1933 | prompts['f'] = f | |
1934 | if m == 'cd': |
|
1934 | if m == 'cd': | |
1935 | if repo.ui.promptchoice( |
|
1935 | if repo.ui.promptchoice( | |
1936 | _("local%(l)s changed %(f)s which other%(o)s deleted\n" |
|
1936 | _("local%(l)s changed %(f)s which other%(o)s deleted\n" | |
1937 | "use (c)hanged version or (d)elete?" |
|
1937 | "use (c)hanged version or (d)elete?" | |
1938 | "$$ &Changed $$ &Delete") % prompts, 0): |
|
1938 | "$$ &Changed $$ &Delete") % prompts, 0): | |
1939 | actionbyfile[f] = ('r', None, "prompt delete") |
|
1939 | actionbyfile[f] = ('r', None, "prompt delete") | |
1940 | elif f in p1: |
|
1940 | elif f in p1: | |
1941 | actionbyfile[f] = ('am', None, "prompt keep") |
|
1941 | actionbyfile[f] = ('am', None, "prompt keep") | |
1942 | else: |
|
1942 | else: | |
1943 | actionbyfile[f] = ('a', None, "prompt keep") |
|
1943 | actionbyfile[f] = ('a', None, "prompt keep") | |
1944 | elif m == 'dc': |
|
1944 | elif m == 'dc': | |
1945 | f1, f2, fa, move, anc = args |
|
1945 | f1, f2, fa, move, anc = args | |
1946 | flags = p2[f2].flags() |
|
1946 | flags = p2[f2].flags() | |
1947 | if repo.ui.promptchoice( |
|
1947 | if repo.ui.promptchoice( | |
1948 | _("other%(o)s changed %(f)s which local%(l)s deleted\n" |
|
1948 | _("other%(o)s changed %(f)s which local%(l)s deleted\n" | |
1949 | "use (c)hanged version or leave (d)eleted?" |
|
1949 | "use (c)hanged version or leave (d)eleted?" | |
1950 | "$$ &Changed $$ &Deleted") % prompts, 0) == 0: |
|
1950 | "$$ &Changed $$ &Deleted") % prompts, 0) == 0: | |
1951 | actionbyfile[f] = ('g', (flags, False), "prompt recreating") |
|
1951 | actionbyfile[f] = ('g', (flags, False), "prompt recreating") | |
1952 | else: |
|
1952 | else: | |
1953 | del actionbyfile[f] |
|
1953 | del actionbyfile[f] | |
1954 |
|
1954 | |||
1955 | # Convert to dictionary-of-lists format |
|
1955 | # Convert to dictionary-of-lists format | |
1956 | actions = dict((m, []) |
|
1956 | actions = dict((m, []) | |
1957 | for m in 'a am f g cd dc r dm dg m e k p pr'.split()) |
|
1957 | for m in 'a am f g cd dc r dm dg m e k p pr'.split()) | |
1958 | for f, (m, args, msg) in actionbyfile.iteritems(): |
|
1958 | for f, (m, args, msg) in actionbyfile.iteritems(): | |
1959 | if m not in actions: |
|
1959 | if m not in actions: | |
1960 | actions[m] = [] |
|
1960 | actions[m] = [] | |
1961 | actions[m].append((f, args, msg)) |
|
1961 | actions[m].append((f, args, msg)) | |
1962 |
|
1962 | |||
1963 | if not util.fscasesensitive(repo.path): |
|
1963 | if not util.fscasesensitive(repo.path): | |
1964 | # check collision between files only in p2 for clean update |
|
1964 | # check collision between files only in p2 for clean update | |
1965 | if (not branchmerge and |
|
1965 | if (not branchmerge and | |
1966 | (force or not wc.dirty(missing=True, branch=False))): |
|
1966 | (force or not wc.dirty(missing=True, branch=False))): | |
1967 | _checkcollision(repo, p2.manifest(), None) |
|
1967 | _checkcollision(repo, p2.manifest(), None) | |
1968 | else: |
|
1968 | else: | |
1969 | _checkcollision(repo, wc.manifest(), actions) |
|
1969 | _checkcollision(repo, wc.manifest(), actions) | |
1970 |
|
1970 | |||
1971 | # divergent renames |
|
1971 | # divergent renames | |
1972 | for f, fl in sorted(diverge.iteritems()): |
|
1972 | for f, fl in sorted(diverge.iteritems()): | |
1973 | repo.ui.warn(_("note: possible conflict - %s was renamed " |
|
1973 | repo.ui.warn(_("note: possible conflict - %s was renamed " | |
1974 | "multiple times to:\n") % f) |
|
1974 | "multiple times to:\n") % f) | |
1975 | for nf in fl: |
|
1975 | for nf in fl: | |
1976 | repo.ui.warn(" %s\n" % nf) |
|
1976 | repo.ui.warn(" %s\n" % nf) | |
1977 |
|
1977 | |||
1978 | # rename and delete |
|
1978 | # rename and delete | |
1979 | for f, fl in sorted(renamedelete.iteritems()): |
|
1979 | for f, fl in sorted(renamedelete.iteritems()): | |
1980 | repo.ui.warn(_("note: possible conflict - %s was deleted " |
|
1980 | repo.ui.warn(_("note: possible conflict - %s was deleted " | |
1981 | "and renamed to:\n") % f) |
|
1981 | "and renamed to:\n") % f) | |
1982 | for nf in fl: |
|
1982 | for nf in fl: | |
1983 | repo.ui.warn(" %s\n" % nf) |
|
1983 | repo.ui.warn(" %s\n" % nf) | |
1984 |
|
1984 | |||
1985 | ### apply phase |
|
1985 | ### apply phase | |
1986 | if not branchmerge: # just jump to the new rev |
|
1986 | if not branchmerge: # just jump to the new rev | |
1987 | fp1, fp2, xp1, xp2 = fp2, nullid, xp2, '' |
|
1987 | fp1, fp2, xp1, xp2 = fp2, nullid, xp2, '' | |
1988 | if not partial and not wc.isinmemory(): |
|
1988 | if not partial and not wc.isinmemory(): | |
1989 | repo.hook('preupdate', throw=True, parent1=xp1, parent2=xp2) |
|
1989 | repo.hook('preupdate', throw=True, parent1=xp1, parent2=xp2) | |
1990 | # note that we're in the middle of an update |
|
1990 | # note that we're in the middle of an update | |
1991 | repo.vfs.write('updatestate', p2.hex()) |
|
1991 | repo.vfs.write('updatestate', p2.hex()) | |
1992 |
|
1992 | |||
1993 | # Advertise fsmonitor when its presence could be useful. |
|
1993 | # Advertise fsmonitor when its presence could be useful. | |
1994 | # |
|
1994 | # | |
1995 | # We only advertise when performing an update from an empty working |
|
1995 | # We only advertise when performing an update from an empty working | |
1996 | # directory. This typically only occurs during initial clone. |
|
1996 | # directory. This typically only occurs during initial clone. | |
1997 | # |
|
1997 | # | |
1998 | # We give users a mechanism to disable the warning in case it is |
|
1998 | # We give users a mechanism to disable the warning in case it is | |
1999 | # annoying. |
|
1999 | # annoying. | |
2000 | # |
|
2000 | # | |
2001 | # We only allow on Linux and MacOS because that's where fsmonitor is |
|
2001 | # We only allow on Linux and MacOS because that's where fsmonitor is | |
2002 | # considered stable. |
|
2002 | # considered stable. | |
2003 | fsmonitorwarning = repo.ui.configbool('fsmonitor', 'warn_when_unused') |
|
2003 | fsmonitorwarning = repo.ui.configbool('fsmonitor', 'warn_when_unused') | |
2004 | fsmonitorthreshold = repo.ui.configint('fsmonitor', |
|
2004 | fsmonitorthreshold = repo.ui.configint('fsmonitor', | |
2005 | 'warn_update_file_count') |
|
2005 | 'warn_update_file_count') | |
2006 | try: |
|
2006 | try: | |
2007 | # avoid cycle: extensions -> cmdutil -> merge |
|
2007 | # avoid cycle: extensions -> cmdutil -> merge | |
2008 | from . import extensions |
|
2008 | from . import extensions | |
2009 | extensions.find('fsmonitor') |
|
2009 | extensions.find('fsmonitor') | |
2010 | fsmonitorenabled = repo.ui.config('fsmonitor', 'mode') != 'off' |
|
2010 | fsmonitorenabled = repo.ui.config('fsmonitor', 'mode') != 'off' | |
2011 | # We intentionally don't look at whether fsmonitor has disabled |
|
2011 | # We intentionally don't look at whether fsmonitor has disabled | |
2012 | # itself because a) fsmonitor may have already printed a warning |
|
2012 | # itself because a) fsmonitor may have already printed a warning | |
2013 | # b) we only care about the config state here. |
|
2013 | # b) we only care about the config state here. | |
2014 | except KeyError: |
|
2014 | except KeyError: | |
2015 | fsmonitorenabled = False |
|
2015 | fsmonitorenabled = False | |
2016 |
|
2016 | |||
2017 | if (fsmonitorwarning |
|
2017 | if (fsmonitorwarning | |
2018 | and not fsmonitorenabled |
|
2018 | and not fsmonitorenabled | |
2019 | and p1.node() == nullid |
|
2019 | and p1.node() == nullid | |
2020 | and len(actions['g']) >= fsmonitorthreshold |
|
2020 | and len(actions['g']) >= fsmonitorthreshold | |
2021 | and pycompat.sysplatform.startswith(('linux', 'darwin'))): |
|
2021 | and pycompat.sysplatform.startswith(('linux', 'darwin'))): | |
2022 | repo.ui.warn( |
|
2022 | repo.ui.warn( | |
2023 | _('(warning: large working directory being used without ' |
|
2023 | _('(warning: large working directory being used without ' | |
2024 | 'fsmonitor enabled; enable fsmonitor to improve performance; ' |
|
2024 | 'fsmonitor enabled; enable fsmonitor to improve performance; ' | |
2025 | 'see "hg help -e fsmonitor")\n')) |
|
2025 | 'see "hg help -e fsmonitor")\n')) | |
2026 |
|
2026 | |||
2027 | stats = applyupdates(repo, actions, wc, p2, overwrite, labels=labels) |
|
2027 | stats = applyupdates(repo, actions, wc, p2, overwrite, labels=labels) | |
2028 |
|
2028 | |||
2029 | if not partial and not wc.isinmemory(): |
|
2029 | if not partial and not wc.isinmemory(): | |
2030 | with repo.dirstate.parentchange(): |
|
2030 | with repo.dirstate.parentchange(): | |
2031 | repo.setparents(fp1, fp2) |
|
2031 | repo.setparents(fp1, fp2) | |
2032 | recordupdates(repo, actions, branchmerge) |
|
2032 | recordupdates(repo, actions, branchmerge) | |
2033 | # update completed, clear state |
|
2033 | # update completed, clear state | |
2034 | util.unlink(repo.vfs.join('updatestate')) |
|
2034 | util.unlink(repo.vfs.join('updatestate')) | |
2035 |
|
2035 | |||
2036 | if not branchmerge: |
|
2036 | if not branchmerge: | |
2037 | repo.dirstate.setbranch(p2.branch()) |
|
2037 | repo.dirstate.setbranch(p2.branch()) | |
2038 |
|
2038 | |||
2039 | # If we're updating to a location, clean up any stale temporary includes |
|
2039 | # If we're updating to a location, clean up any stale temporary includes | |
2040 | # (ex: this happens during hg rebase --abort). |
|
2040 | # (ex: this happens during hg rebase --abort). | |
2041 | if not branchmerge: |
|
2041 | if not branchmerge: | |
2042 | sparse.prunetemporaryincludes(repo) |
|
2042 | sparse.prunetemporaryincludes(repo) | |
2043 |
|
2043 | |||
2044 | if not partial: |
|
2044 | if not partial: | |
2045 | repo.hook('update', parent1=xp1, parent2=xp2, error=stats[3]) |
|
2045 | repo.hook('update', parent1=xp1, parent2=xp2, error=stats[3]) | |
2046 | return stats |
|
2046 | return stats | |
2047 |
|
2047 | |||
2048 | def graft(repo, ctx, pctx, labels, keepparent=False): |
|
2048 | def graft(repo, ctx, pctx, labels, keepparent=False): | |
2049 | """Do a graft-like merge. |
|
2049 | """Do a graft-like merge. | |
2050 |
|
2050 | |||
2051 | This is a merge where the merge ancestor is chosen such that one |
|
2051 | This is a merge where the merge ancestor is chosen such that one | |
2052 | or more changesets are grafted onto the current changeset. In |
|
2052 | or more changesets are grafted onto the current changeset. In | |
2053 | addition to the merge, this fixes up the dirstate to include only |
|
2053 | addition to the merge, this fixes up the dirstate to include only | |
2054 | a single parent (if keepparent is False) and tries to duplicate any |
|
2054 | a single parent (if keepparent is False) and tries to duplicate any | |
2055 | renames/copies appropriately. |
|
2055 | renames/copies appropriately. | |
2056 |
|
2056 | |||
2057 | ctx - changeset to rebase |
|
2057 | ctx - changeset to rebase | |
2058 | pctx - merge base, usually ctx.p1() |
|
2058 | pctx - merge base, usually ctx.p1() | |
2059 | labels - merge labels eg ['local', 'graft'] |
|
2059 | labels - merge labels eg ['local', 'graft'] | |
2060 | keepparent - keep second parent if any |
|
2060 | keepparent - keep second parent if any | |
2061 |
|
2061 | |||
2062 | """ |
|
2062 | """ | |
2063 | # If we're grafting a descendant onto an ancestor, be sure to pass |
|
2063 | # If we're grafting a descendant onto an ancestor, be sure to pass | |
2064 | # mergeancestor=True to update. This does two things: 1) allows the merge if |
|
2064 | # mergeancestor=True to update. This does two things: 1) allows the merge if | |
2065 | # the destination is the same as the parent of the ctx (so we can use graft |
|
2065 | # the destination is the same as the parent of the ctx (so we can use graft | |
2066 | # to copy commits), and 2) informs update that the incoming changes are |
|
2066 | # to copy commits), and 2) informs update that the incoming changes are | |
2067 | # newer than the destination so it doesn't prompt about "remote changed foo |
|
2067 | # newer than the destination so it doesn't prompt about "remote changed foo | |
2068 | # which local deleted". |
|
2068 | # which local deleted". | |
2069 | mergeancestor = repo.changelog.isancestor(repo['.'].node(), ctx.node()) |
|
2069 | mergeancestor = repo.changelog.isancestor(repo['.'].node(), ctx.node()) | |
2070 |
|
2070 | |||
2071 | stats = update(repo, ctx.node(), True, True, pctx.node(), |
|
2071 | stats = update(repo, ctx.node(), True, True, pctx.node(), | |
2072 | mergeancestor=mergeancestor, labels=labels) |
|
2072 | mergeancestor=mergeancestor, labels=labels) | |
2073 |
|
2073 | |||
2074 | pother = nullid |
|
2074 | pother = nullid | |
2075 | parents = ctx.parents() |
|
2075 | parents = ctx.parents() | |
2076 | if keepparent and len(parents) == 2 and pctx in parents: |
|
2076 | if keepparent and len(parents) == 2 and pctx in parents: | |
2077 | parents.remove(pctx) |
|
2077 | parents.remove(pctx) | |
2078 | pother = parents[0].node() |
|
2078 | pother = parents[0].node() | |
2079 |
|
2079 | |||
2080 | with repo.dirstate.parentchange(): |
|
2080 | with repo.dirstate.parentchange(): | |
2081 | repo.setparents(repo['.'].node(), pother) |
|
2081 | repo.setparents(repo['.'].node(), pother) | |
2082 | repo.dirstate.write(repo.currenttransaction()) |
|
2082 | repo.dirstate.write(repo.currenttransaction()) | |
2083 | # fix up dirstate for copies and renames |
|
2083 | # fix up dirstate for copies and renames | |
2084 | copies.duplicatecopies(repo, repo[None], ctx.rev(), pctx.rev()) |
|
2084 | copies.duplicatecopies(repo, repo[None], ctx.rev(), pctx.rev()) | |
2085 | return stats |
|
2085 | return stats |
General Comments 0
You need to be logged in to leave comments.
Login now