Show More
@@ -1,376 +1,375 b'' | |||
|
1 | 1 | # destutil.py - Mercurial utility function for command destination |
|
2 | 2 | # |
|
3 | 3 | # Copyright Matt Mackall <mpm@selenic.com> and other |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms of the |
|
6 | 6 | # GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | from __future__ import absolute_import |
|
9 | 9 | |
|
10 | 10 | from .i18n import _ |
|
11 | 11 | from . import ( |
|
12 | 12 | bookmarks, |
|
13 | 13 | error, |
|
14 | 14 | obsolete, |
|
15 | 15 | ) |
|
16 | 16 | |
|
17 | 17 | def _destupdatevalidate(repo, rev, clean, check): |
|
18 | 18 | """validate that the destination comply to various rules |
|
19 | 19 | |
|
20 | 20 | This exists as its own function to help wrapping from extensions.""" |
|
21 | 21 | wc = repo[None] |
|
22 | 22 | p1 = wc.p1() |
|
23 | 23 | if not clean: |
|
24 | 24 | # Check that the update is linear. |
|
25 | 25 | # |
|
26 | 26 | # Mercurial do not allow update-merge for non linear pattern |
|
27 | 27 | # (that would be technically possible but was considered too confusing |
|
28 | 28 | # for user a long time ago) |
|
29 | 29 | # |
|
30 | 30 | # See mercurial.merge.update for details |
|
31 | 31 | if p1.rev() not in repo.changelog.ancestors([rev], inclusive=True): |
|
32 | 32 | dirty = wc.dirty(missing=True) |
|
33 | 33 | foreground = obsolete.foreground(repo, [p1.node()]) |
|
34 | 34 | if not repo[rev].node() in foreground: |
|
35 | 35 | if dirty: |
|
36 | 36 | msg = _("uncommitted changes") |
|
37 | 37 | hint = _("commit and merge, or update --clean to" |
|
38 | 38 | " discard changes") |
|
39 | 39 | raise error.UpdateAbort(msg, hint=hint) |
|
40 | 40 | elif not check: # destination is not a descendant. |
|
41 | 41 | msg = _("not a linear update") |
|
42 | 42 | hint = _("merge or update --check to force update") |
|
43 | 43 | raise error.UpdateAbort(msg, hint=hint) |
|
44 | 44 | |
|
45 | 45 | def _destupdateobs(repo, clean, check): |
|
46 | 46 | """decide of an update destination from obsolescence markers""" |
|
47 | 47 | node = None |
|
48 | 48 | wc = repo[None] |
|
49 | 49 | p1 = wc.p1() |
|
50 | 50 | movemark = None |
|
51 | 51 | |
|
52 | 52 | if p1.obsolete() and not p1.children(): |
|
53 | 53 | # allow updating to successors |
|
54 | 54 | successors = obsolete.successorssets(repo, p1.node()) |
|
55 | 55 | |
|
56 | 56 | # behavior of certain cases is as follows, |
|
57 | 57 | # |
|
58 | 58 | # divergent changesets: update to highest rev, similar to what |
|
59 | 59 | # is currently done when there are more than one head |
|
60 | 60 | # (i.e. 'tip') |
|
61 | 61 | # |
|
62 | 62 | # replaced changesets: same as divergent except we know there |
|
63 | 63 | # is no conflict |
|
64 | 64 | # |
|
65 | 65 | # pruned changeset: no update is done; though, we could |
|
66 | 66 | # consider updating to the first non-obsolete parent, |
|
67 | 67 | # similar to what is current done for 'hg prune' |
|
68 | 68 | |
|
69 | 69 | if successors: |
|
70 | 70 | # flatten the list here handles both divergent (len > 1) |
|
71 | 71 | # and the usual case (len = 1) |
|
72 | 72 | successors = [n for sub in successors for n in sub] |
|
73 | 73 | |
|
74 | 74 | # get the max revision for the given successors set, |
|
75 | 75 | # i.e. the 'tip' of a set |
|
76 | 76 | node = repo.revs('max(%ln)', successors).first() |
|
77 | 77 | if bookmarks.isactivewdirparent(repo): |
|
78 | 78 | movemark = repo['.'].node() |
|
79 | 79 | return node, movemark, None |
|
80 | 80 | |
|
81 | 81 | def _destupdatebook(repo, clean, check): |
|
82 | 82 | """decide on an update destination from active bookmark""" |
|
83 | 83 | # we also move the active bookmark, if any |
|
84 | 84 | activemark = None |
|
85 | 85 | node, movemark = bookmarks.calculateupdate(repo.ui, repo, None) |
|
86 | 86 | if node is not None: |
|
87 | 87 | activemark = node |
|
88 | 88 | return node, movemark, activemark |
|
89 | 89 | |
|
90 | 90 | def _destupdatebranch(repo, clean, check): |
|
91 | 91 | """decide on an update destination from current branch""" |
|
92 | 92 | wc = repo[None] |
|
93 | 93 | movemark = node = None |
|
94 | 94 | try: |
|
95 | 95 | node = repo.revs('max(.::(head() and branch(%s)))' |
|
96 | 96 | , wc.branch()).first() |
|
97 | 97 | if bookmarks.isactivewdirparent(repo): |
|
98 | 98 | movemark = repo['.'].node() |
|
99 | 99 | except error.RepoLookupError: |
|
100 | 100 | if wc.branch() == 'default': # no default branch! |
|
101 | 101 | node = repo.lookup('tip') # update to tip |
|
102 | 102 | else: |
|
103 | 103 | raise error.Abort(_("branch %s not found") % wc.branch()) |
|
104 | 104 | return node, movemark, None |
|
105 | 105 | |
|
106 | 106 | # order in which each step should be evalutated |
|
107 | 107 | # steps are run until one finds a destination |
|
108 | 108 | destupdatesteps = ['evolution', 'bookmark', 'branch'] |
|
109 | 109 | # mapping to ease extension overriding steps. |
|
110 | 110 | destupdatestepmap = {'evolution': _destupdateobs, |
|
111 | 111 | 'bookmark': _destupdatebook, |
|
112 | 112 | 'branch': _destupdatebranch, |
|
113 | 113 | } |
|
114 | 114 | |
|
115 | 115 | def destupdate(repo, clean=False, check=False): |
|
116 | 116 | """destination for bare update operation |
|
117 | 117 | |
|
118 | 118 | return (rev, movemark, activemark) |
|
119 | 119 | |
|
120 | 120 | - rev: the revision to update to, |
|
121 | 121 | - movemark: node to move the active bookmark from |
|
122 | 122 | (cf bookmark.calculate update), |
|
123 | 123 | - activemark: a bookmark to activate at the end of the update. |
|
124 | 124 | """ |
|
125 | 125 | node = movemark = activemark = None |
|
126 | 126 | |
|
127 | 127 | for step in destupdatesteps: |
|
128 | 128 | node, movemark, activemark = destupdatestepmap[step](repo, clean, check) |
|
129 | 129 | if node is not None: |
|
130 | 130 | break |
|
131 | 131 | rev = repo[node].rev() |
|
132 | 132 | |
|
133 | 133 | _destupdatevalidate(repo, rev, clean, check) |
|
134 | 134 | |
|
135 | 135 | return rev, movemark, activemark |
|
136 | 136 | |
|
137 | 137 | msgdestmerge = { |
|
138 | 138 | # too many matching divergent bookmark |
|
139 | 139 | 'toomanybookmarks': |
|
140 | 140 | {'merge': |
|
141 | 141 | (_("multiple matching bookmarks to merge -" |
|
142 | 142 | " please merge with an explicit rev or bookmark"), |
|
143 | 143 | _("run 'hg heads' to see all heads")), |
|
144 | 144 | 'rebase': |
|
145 | 145 | (_("multiple matching bookmarks to rebase -" |
|
146 | 146 | " please rebase to an explicit rev or bookmark"), |
|
147 | 147 | _("run 'hg heads' to see all heads")), |
|
148 | 148 | }, |
|
149 | 149 | # no other matching divergent bookmark |
|
150 | 150 | 'nootherbookmarks': |
|
151 | 151 | {'merge': |
|
152 | 152 | (_("no matching bookmark to merge - " |
|
153 | 153 | "please merge with an explicit rev or bookmark"), |
|
154 | 154 | _("run 'hg heads' to see all heads")), |
|
155 | 155 | 'rebase': |
|
156 | 156 | (_("no matching bookmark to rebase - " |
|
157 | 157 | "please rebase to an explicit rev or bookmark"), |
|
158 | 158 | _("run 'hg heads' to see all heads")), |
|
159 | 159 | }, |
|
160 | 160 | # branch have too many unbookmarked heads, no obvious destination |
|
161 | 161 | 'toomanyheads': |
|
162 | 162 | {'merge': |
|
163 | 163 | (_("branch '%s' has %d heads - please merge with an explicit rev"), |
|
164 | 164 | _("run 'hg heads .' to see heads")), |
|
165 | 165 | 'rebase': |
|
166 | 166 | (_("branch '%s' has %d heads - please rebase to an explicit rev"), |
|
167 | 167 | _("run 'hg heads .' to see heads")), |
|
168 | 168 | }, |
|
169 | 169 | # branch have no other unbookmarked heads |
|
170 | 170 | 'bookmarkedheads': |
|
171 | 171 | {'merge': |
|
172 | 172 | (_("heads are bookmarked - please merge with an explicit rev"), |
|
173 | 173 | _("run 'hg heads' to see all heads")), |
|
174 | 174 | 'rebase': |
|
175 | 175 | (_("heads are bookmarked - please rebase to an explicit rev"), |
|
176 | 176 | _("run 'hg heads' to see all heads")), |
|
177 | 177 | }, |
|
178 | 178 | # branch have just a single heads, but there is other branches |
|
179 | 179 | 'nootherbranchheads': |
|
180 | 180 | {'merge': |
|
181 | 181 | (_("branch '%s' has one head - please merge with an explicit rev"), |
|
182 | 182 | _("run 'hg heads' to see all heads")), |
|
183 | 183 | 'rebase': |
|
184 | 184 | (_("branch '%s' has one head - please rebase to an explicit rev"), |
|
185 | 185 | _("run 'hg heads' to see all heads")), |
|
186 | 186 | }, |
|
187 | 187 | # repository have a single head |
|
188 | 188 | 'nootherheads': |
|
189 | 189 | {'merge': |
|
190 | 190 | (_('nothing to merge'), |
|
191 | 191 | None), |
|
192 | 192 | 'rebase': |
|
193 | 193 | (_('nothing to rebase'), |
|
194 | 194 | None), |
|
195 | 195 | }, |
|
196 | 196 | # repository have a single head and we are not on it |
|
197 | 197 | 'nootherheadsbehind': |
|
198 | 198 | {'merge': |
|
199 | 199 | (_('nothing to merge'), |
|
200 | 200 | _("use 'hg update' instead")), |
|
201 | 201 | 'rebase': |
|
202 | 202 | (_('nothing to rebase'), |
|
203 | 203 | _("use 'hg update' instead")), |
|
204 | 204 | }, |
|
205 | 205 | # We are not on a head |
|
206 | 206 | 'notatheads': |
|
207 | 207 | {'merge': |
|
208 | 208 | (_('working directory not at a head revision'), |
|
209 | 209 | _("use 'hg update' or merge with an explicit revision")), |
|
210 | 210 | 'rebase': |
|
211 | 211 | (_('working directory not at a head revision'), |
|
212 | 212 | _("use 'hg update' or rebase to an explicit revision")) |
|
213 | 213 | }, |
|
214 | 214 | 'emptysourceset': |
|
215 | 215 | {'merge': |
|
216 | 216 | (_('source set is empty'), |
|
217 | 217 | None), |
|
218 | 218 | 'rebase': |
|
219 | 219 | (_('source set is empty'), |
|
220 | 220 | None), |
|
221 | 221 | }, |
|
222 | 222 | 'multiplebranchessourceset': |
|
223 | 223 | {'merge': |
|
224 | 224 | (_('source set is rooted in multiple branches'), |
|
225 | 225 | None), |
|
226 | 226 | 'rebase': |
|
227 | 227 | (_('rebaseset is rooted in multiple named branches'), |
|
228 | 228 | _('specify an explicit destination with --dest')), |
|
229 | 229 | }, |
|
230 | 230 | } |
|
231 | 231 | |
|
232 | 232 | def _destmergebook(repo, action='merge', sourceset=None): |
|
233 | 233 | """find merge destination in the active bookmark case""" |
|
234 | 234 | node = None |
|
235 | 235 | bmheads = repo.bookmarkheads(repo._activebookmark) |
|
236 | 236 | curhead = repo[repo._activebookmark].node() |
|
237 | 237 | if len(bmheads) == 2: |
|
238 | 238 | if curhead == bmheads[0]: |
|
239 | 239 | node = bmheads[1] |
|
240 | 240 | else: |
|
241 | 241 | node = bmheads[0] |
|
242 | 242 | elif len(bmheads) > 2: |
|
243 | 243 | msg, hint = msgdestmerge['toomanybookmarks'][action] |
|
244 | 244 | raise error.ManyMergeDestAbort(msg, hint=hint) |
|
245 | 245 | elif len(bmheads) <= 1: |
|
246 | 246 | msg, hint = msgdestmerge['nootherbookmarks'][action] |
|
247 | 247 | raise error.NoMergeDestAbort(msg, hint=hint) |
|
248 | 248 | assert node is not None |
|
249 | 249 | return node |
|
250 | 250 | |
|
251 | 251 | def _destmergebranch(repo, action='merge', sourceset=None, onheadcheck=True): |
|
252 | 252 | """find merge destination based on branch heads""" |
|
253 | 253 | node = None |
|
254 | 254 | |
|
255 | 255 | if sourceset is None: |
|
256 | 256 | sourceset = [repo[repo.dirstate.p1()].rev()] |
|
257 | 257 | branch = repo.dirstate.branch() |
|
258 | 258 | elif not sourceset: |
|
259 | 259 | msg, hint = msgdestmerge['emptysourceset'][action] |
|
260 | 260 | raise error.NoMergeDestAbort(msg, hint=hint) |
|
261 | 261 | else: |
|
262 | 262 | branch = None |
|
263 | 263 | for ctx in repo.set('roots(%ld::%ld)', sourceset, sourceset): |
|
264 | 264 | if branch is not None and ctx.branch() != branch: |
|
265 | 265 | msg, hint = msgdestmerge['multiplebranchessourceset'][action] |
|
266 | 266 | raise error.ManyMergeDestAbort(msg, hint=hint) |
|
267 | 267 | branch = ctx.branch() |
|
268 | 268 | |
|
269 | 269 | bheads = repo.branchheads(branch) |
|
270 | 270 | onhead = repo.revs('%ld and %ln', sourceset, bheads) |
|
271 | 271 | if onheadcheck and not onhead: |
|
272 | 272 | # Case A: working copy if not on a head. (merge only) |
|
273 | 273 | # |
|
274 | 274 | # This is probably a user mistake We bailout pointing at 'hg update' |
|
275 | 275 | if len(repo.heads()) <= 1: |
|
276 | 276 | msg, hint = msgdestmerge['nootherheadsbehind'][action] |
|
277 | 277 | else: |
|
278 | 278 | msg, hint = msgdestmerge['notatheads'][action] |
|
279 | 279 | raise error.Abort(msg, hint=hint) |
|
280 | 280 | # remove heads descendants of source from the set |
|
281 | 281 | bheads = list(repo.revs('%ln - (%ld::)', bheads, sourceset)) |
|
282 | 282 | # filters out bookmarked heads |
|
283 | 283 | nbhs = list(repo.revs('%ld - bookmark()', bheads)) |
|
284 | 284 | if len(nbhs) > 1: |
|
285 | 285 | # Case B: There is more than 1 other anonymous heads |
|
286 | 286 | # |
|
287 | 287 | # This means that there will be more than 1 candidate. This is |
|
288 | 288 | # ambiguous. We abort asking the user to pick as explicit destination |
|
289 | 289 | # instead. |
|
290 | 290 | msg, hint = msgdestmerge['toomanyheads'][action] |
|
291 | 291 | msg %= (branch, len(bheads) + 1) |
|
292 | 292 | raise error.ManyMergeDestAbort(msg, hint=hint) |
|
293 | 293 | elif not nbhs: |
|
294 | 294 | # Case B: There is no other anonymous heads |
|
295 | 295 | # |
|
296 | 296 | # This means that there is no natural candidate to merge with. |
|
297 | 297 | # We abort, with various messages for various cases. |
|
298 | 298 | if bheads: |
|
299 | 299 | msg, hint = msgdestmerge['bookmarkedheads'][action] |
|
300 | 300 | elif len(repo.heads()) > 1: |
|
301 | 301 | msg, hint = msgdestmerge['nootherbranchheads'][action] |
|
302 | 302 | msg %= branch |
|
303 | 303 | elif not onhead: |
|
304 | 304 | # if 'onheadcheck == False' (rebase case), |
|
305 | 305 | # this was not caught in Case A. |
|
306 | 306 | msg, hint = msgdestmerge['nootherheadsbehind'][action] |
|
307 | 307 | else: |
|
308 | 308 | msg, hint = msgdestmerge['nootherheads'][action] |
|
309 | 309 | raise error.NoMergeDestAbort(msg, hint=hint) |
|
310 | 310 | else: |
|
311 | 311 | node = nbhs[0] |
|
312 | 312 | assert node is not None |
|
313 | 313 | return node |
|
314 | 314 | |
|
315 | 315 | def destmerge(repo, action='merge', sourceset=None, onheadcheck=True): |
|
316 | 316 | """return the default destination for a merge |
|
317 | 317 | |
|
318 | 318 | (or raise exception about why it can't pick one) |
|
319 | 319 | |
|
320 | 320 | :action: the action being performed, controls emitted error message |
|
321 | 321 | """ |
|
322 | 322 | if repo._activebookmark: |
|
323 | 323 | node = _destmergebook(repo, action=action, sourceset=sourceset) |
|
324 | 324 | else: |
|
325 | 325 | node = _destmergebranch(repo, action=action, sourceset=sourceset, |
|
326 | 326 | onheadcheck=onheadcheck) |
|
327 | 327 | return repo[node].rev() |
|
328 | 328 | |
|
329 | 329 | histeditdefaultrevset = 'reverse(only(.) and not public() and not ::merge())' |
|
330 | 330 | |
|
331 | 331 | def desthistedit(ui, repo): |
|
332 | 332 | """Default base revision to edit for `hg histedit`.""" |
|
333 | 333 | # Avoid cycle: scmutil -> revset -> destutil |
|
334 | 334 | from . import scmutil |
|
335 | 335 | |
|
336 | 336 | default = ui.config('histedit', 'defaultrev', histeditdefaultrevset) |
|
337 | 337 | if default: |
|
338 | 338 | revs = scmutil.revrange(repo, [default]) |
|
339 | 339 | if revs: |
|
340 | 340 | # The revset supplied by the user may not be in ascending order nor |
|
341 | 341 | # take the first revision. So do this manually. |
|
342 | 342 | revs.sort() |
|
343 | 343 | return revs.first() |
|
344 | 344 | |
|
345 | 345 | return None |
|
346 | 346 | |
|
347 | 347 | def _statusotherbook(ui, repo): |
|
348 | 348 | bmheads = repo.bookmarkheads(repo._activebookmark) |
|
349 | 349 | curhead = repo[repo._activebookmark].node() |
|
350 | 350 | if repo.revs('%n and parents()', curhead): |
|
351 | 351 | # we are on the active bookmark |
|
352 | 352 | bmheads = [b for b in bmheads if curhead != b] |
|
353 | 353 | if bmheads: |
|
354 | 354 | msg = _('%i other divergent bookmarks for "%s"\n') |
|
355 | 355 | ui.status(msg % (len(bmheads), repo._activebookmark)) |
|
356 | 356 | |
|
357 | 357 | def _statusotherbranchheads(ui, repo): |
|
358 | 358 | currentbranch = repo.dirstate.branch() |
|
359 | 359 | heads = repo.branchheads(currentbranch) |
|
360 | l = len(heads) | |
|
361 | 360 | if repo.revs('%ln and parents()', heads): |
|
362 | 361 | # we are on a head |
|
363 | 362 | otherheads = repo.revs('%ln - parents()', heads) |
|
364 |
if otherheads |
|
|
363 | if otherheads: | |
|
365 | 364 | ui.status(_('%i other heads for branch "%s"\n') % |
|
366 | 365 | (len(otherheads), currentbranch)) |
|
367 | 366 | |
|
368 | 367 | def statusotherdests(ui, repo): |
|
369 | 368 | """Print message about other head""" |
|
370 | 369 | # XXX we should probably include a hint: |
|
371 | 370 | # - about what to do |
|
372 | 371 | # - how to see such heads |
|
373 | 372 | if repo._activebookmark: |
|
374 | 373 | _statusotherbook(ui, repo) |
|
375 | 374 | else: |
|
376 | 375 | _statusotherbranchheads(ui, repo) |
General Comments 0
You need to be logged in to leave comments.
Login now