##// END OF EJS Templates
merge with stable
Sune Foldager -
r10773:bd36e5c0 merge default
parent child Browse files
Show More
@@ -1,2793 +1,2795
1 1 # mq.py - patch queues for mercurial
2 2 #
3 3 # Copyright 2005, 2006 Chris Mason <mason@suse.com>
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 '''manage a stack of patches
9 9
10 10 This extension lets you work with a stack of patches in a Mercurial
11 11 repository. It manages two stacks of patches - all known patches, and
12 12 applied patches (subset of known patches).
13 13
14 14 Known patches are represented as patch files in the .hg/patches
15 15 directory. Applied patches are both patch files and changesets.
16 16
17 17 Common tasks (use "hg help command" for more details)::
18 18
19 19 create new patch qnew
20 20 import existing patch qimport
21 21
22 22 print patch series qseries
23 23 print applied patches qapplied
24 24
25 25 add known patch to applied stack qpush
26 26 remove patch from applied stack qpop
27 27 refresh contents of top applied patch qrefresh
28 28
29 29 By default, mq will automatically use git patches when required to
30 30 avoid losing file mode changes, copy records, binary files or empty
31 31 files creations or deletions. This behaviour can be configured with::
32 32
33 33 [mq]
34 34 git = auto/keep/yes/no
35 35
36 36 If set to 'keep', mq will obey the [diff] section configuration while
37 37 preserving existing git patches upon qrefresh. If set to 'yes' or
38 38 'no', mq will override the [diff] section and always generate git or
39 39 regular patches, possibly losing data in the second case.
40 40 '''
41 41
42 42 from mercurial.i18n import _
43 43 from mercurial.node import bin, hex, short, nullid, nullrev
44 44 from mercurial.lock import release
45 45 from mercurial import commands, cmdutil, hg, patch, util
46 46 from mercurial import repair, extensions, url, error
47 47 import os, sys, re, errno
48 48
49 49 commands.norepo += " qclone"
50 50
51 51 # Patch names looks like unix-file names.
52 52 # They must be joinable with queue directory and result in the patch path.
53 53 normname = util.normpath
54 54
55 55 class statusentry(object):
56 56 def __init__(self, node, name):
57 57 self.node, self.name = node, name
58 58
59 59 def __str__(self):
60 60 return hex(self.node) + ':' + self.name
61 61
62 62 class patchheader(object):
63 63 def __init__(self, pf, plainmode=False):
64 64 def eatdiff(lines):
65 65 while lines:
66 66 l = lines[-1]
67 67 if (l.startswith("diff -") or
68 68 l.startswith("Index:") or
69 69 l.startswith("===========")):
70 70 del lines[-1]
71 71 else:
72 72 break
73 73 def eatempty(lines):
74 74 while lines:
75 75 if not lines[-1].strip():
76 76 del lines[-1]
77 77 else:
78 78 break
79 79
80 80 message = []
81 81 comments = []
82 82 user = None
83 83 date = None
84 84 parent = None
85 85 format = None
86 86 subject = None
87 87 diffstart = 0
88 88
89 89 for line in file(pf):
90 90 line = line.rstrip()
91 91 if (line.startswith('diff --git')
92 92 or (diffstart and line.startswith('+++ '))):
93 93 diffstart = 2
94 94 break
95 95 diffstart = 0 # reset
96 96 if line.startswith("--- "):
97 97 diffstart = 1
98 98 continue
99 99 elif format == "hgpatch":
100 100 # parse values when importing the result of an hg export
101 101 if line.startswith("# User "):
102 102 user = line[7:]
103 103 elif line.startswith("# Date "):
104 104 date = line[7:]
105 105 elif line.startswith("# Parent "):
106 106 parent = line[9:]
107 107 elif not line.startswith("# ") and line:
108 108 message.append(line)
109 109 format = None
110 110 elif line == '# HG changeset patch':
111 111 message = []
112 112 format = "hgpatch"
113 113 elif (format != "tagdone" and (line.startswith("Subject: ") or
114 114 line.startswith("subject: "))):
115 115 subject = line[9:]
116 116 format = "tag"
117 117 elif (format != "tagdone" and (line.startswith("From: ") or
118 118 line.startswith("from: "))):
119 119 user = line[6:]
120 120 format = "tag"
121 121 elif (format != "tagdone" and (line.startswith("Date: ") or
122 122 line.startswith("date: "))):
123 123 date = line[6:]
124 124 format = "tag"
125 125 elif format == "tag" and line == "":
126 126 # when looking for tags (subject: from: etc) they
127 127 # end once you find a blank line in the source
128 128 format = "tagdone"
129 129 elif message or line:
130 130 message.append(line)
131 131 comments.append(line)
132 132
133 133 eatdiff(message)
134 134 eatdiff(comments)
135 135 eatempty(message)
136 136 eatempty(comments)
137 137
138 138 # make sure message isn't empty
139 139 if format and format.startswith("tag") and subject:
140 140 message.insert(0, "")
141 141 message.insert(0, subject)
142 142
143 143 self.message = message
144 144 self.comments = comments
145 145 self.user = user
146 146 self.date = date
147 147 self.parent = parent
148 148 self.haspatch = diffstart > 1
149 149 self.plainmode = plainmode
150 150
151 151 def setuser(self, user):
152 152 if not self.updateheader(['From: ', '# User '], user):
153 153 try:
154 154 patchheaderat = self.comments.index('# HG changeset patch')
155 155 self.comments.insert(patchheaderat + 1, '# User ' + user)
156 156 except ValueError:
157 157 if self.plainmode or self._hasheader(['Date: ']):
158 158 self.comments = ['From: ' + user] + self.comments
159 159 else:
160 160 tmp = ['# HG changeset patch', '# User ' + user, '']
161 161 self.comments = tmp + self.comments
162 162 self.user = user
163 163
164 164 def setdate(self, date):
165 165 if not self.updateheader(['Date: ', '# Date '], date):
166 166 try:
167 167 patchheaderat = self.comments.index('# HG changeset patch')
168 168 self.comments.insert(patchheaderat + 1, '# Date ' + date)
169 169 except ValueError:
170 170 if self.plainmode or self._hasheader(['From: ']):
171 171 self.comments = ['Date: ' + date] + self.comments
172 172 else:
173 173 tmp = ['# HG changeset patch', '# Date ' + date, '']
174 174 self.comments = tmp + self.comments
175 175 self.date = date
176 176
177 177 def setparent(self, parent):
178 178 if not self.updateheader(['# Parent '], parent):
179 179 try:
180 180 patchheaderat = self.comments.index('# HG changeset patch')
181 181 self.comments.insert(patchheaderat + 1, '# Parent ' + parent)
182 182 except ValueError:
183 183 pass
184 184 self.parent = parent
185 185
186 186 def setmessage(self, message):
187 187 if self.comments:
188 188 self._delmsg()
189 189 self.message = [message]
190 190 self.comments += self.message
191 191
192 192 def updateheader(self, prefixes, new):
193 193 '''Update all references to a field in the patch header.
194 194 Return whether the field is present.'''
195 195 res = False
196 196 for prefix in prefixes:
197 197 for i in xrange(len(self.comments)):
198 198 if self.comments[i].startswith(prefix):
199 199 self.comments[i] = prefix + new
200 200 res = True
201 201 break
202 202 return res
203 203
204 204 def _hasheader(self, prefixes):
205 205 '''Check if a header starts with any of the given prefixes.'''
206 206 for prefix in prefixes:
207 207 for comment in self.comments:
208 208 if comment.startswith(prefix):
209 209 return True
210 210 return False
211 211
212 212 def __str__(self):
213 213 if not self.comments:
214 214 return ''
215 215 return '\n'.join(self.comments) + '\n\n'
216 216
217 217 def _delmsg(self):
218 218 '''Remove existing message, keeping the rest of the comments fields.
219 219 If comments contains 'subject: ', message will prepend
220 220 the field and a blank line.'''
221 221 if self.message:
222 222 subj = 'subject: ' + self.message[0].lower()
223 223 for i in xrange(len(self.comments)):
224 224 if subj == self.comments[i].lower():
225 225 del self.comments[i]
226 226 self.message = self.message[2:]
227 227 break
228 228 ci = 0
229 229 for mi in self.message:
230 230 while mi != self.comments[ci]:
231 231 ci += 1
232 232 del self.comments[ci]
233 233
234 234 class queue(object):
235 235 def __init__(self, ui, path, patchdir=None):
236 236 self.basepath = path
237 237 self.path = patchdir or os.path.join(path, "patches")
238 238 self.opener = util.opener(self.path)
239 239 self.ui = ui
240 240 self.applied_dirty = 0
241 241 self.series_dirty = 0
242 242 self.series_path = "series"
243 243 self.status_path = "status"
244 244 self.guards_path = "guards"
245 245 self.active_guards = None
246 246 self.guards_dirty = False
247 247 # Handle mq.git as a bool with extended values
248 248 try:
249 249 gitmode = ui.configbool('mq', 'git', None)
250 250 if gitmode is None:
251 251 raise error.ConfigError()
252 252 self.gitmode = gitmode and 'yes' or 'no'
253 253 except error.ConfigError:
254 254 self.gitmode = ui.config('mq', 'git', 'auto').lower()
255 255 self.plainmode = ui.configbool('mq', 'plain', False)
256 256
257 257 @util.propertycache
258 258 def applied(self):
259 259 if os.path.exists(self.join(self.status_path)):
260 260 def parse(l):
261 261 n, name = l.split(':', 1)
262 262 return statusentry(bin(n), name)
263 263 lines = self.opener(self.status_path).read().splitlines()
264 264 return [parse(l) for l in lines]
265 265 return []
266 266
267 267 @util.propertycache
268 268 def full_series(self):
269 269 if os.path.exists(self.join(self.series_path)):
270 270 return self.opener(self.series_path).read().splitlines()
271 271 return []
272 272
273 273 @util.propertycache
274 274 def series(self):
275 275 self.parse_series()
276 276 return self.series
277 277
278 278 @util.propertycache
279 279 def series_guards(self):
280 280 self.parse_series()
281 281 return self.series_guards
282 282
283 283 def invalidate(self):
284 284 for a in 'applied full_series series series_guards'.split():
285 285 if a in self.__dict__:
286 286 delattr(self, a)
287 287 self.applied_dirty = 0
288 288 self.series_dirty = 0
289 289 self.guards_dirty = False
290 290 self.active_guards = None
291 291
292 292 def diffopts(self, opts={}, patchfn=None):
293 293 diffopts = patch.diffopts(self.ui, opts)
294 294 if self.gitmode == 'auto':
295 295 diffopts.upgrade = True
296 296 elif self.gitmode == 'keep':
297 297 pass
298 298 elif self.gitmode in ('yes', 'no'):
299 299 diffopts.git = self.gitmode == 'yes'
300 300 else:
301 301 raise util.Abort(_('mq.git option can be auto/keep/yes/no'
302 302 ' got %s') % self.gitmode)
303 303 if patchfn:
304 304 diffopts = self.patchopts(diffopts, patchfn)
305 305 return diffopts
306 306
307 307 def patchopts(self, diffopts, *patches):
308 308 """Return a copy of input diff options with git set to true if
309 309 referenced patch is a git patch and should be preserved as such.
310 310 """
311 311 diffopts = diffopts.copy()
312 312 if not diffopts.git and self.gitmode == 'keep':
313 313 for patchfn in patches:
314 314 patchf = self.opener(patchfn, 'r')
315 315 # if the patch was a git patch, refresh it as a git patch
316 316 for line in patchf:
317 317 if line.startswith('diff --git'):
318 318 diffopts.git = True
319 319 break
320 320 patchf.close()
321 321 return diffopts
322 322
323 323 def join(self, *p):
324 324 return os.path.join(self.path, *p)
325 325
326 326 def find_series(self, patch):
327 327 def matchpatch(l):
328 328 l = l.split('#', 1)[0]
329 329 return l.strip() == patch
330 330 for index, l in enumerate(self.full_series):
331 331 if matchpatch(l):
332 332 return index
333 333 return None
334 334
335 335 guard_re = re.compile(r'\s?#([-+][^-+# \t\r\n\f][^# \t\r\n\f]*)')
336 336
337 337 def parse_series(self):
338 338 self.series = []
339 339 self.series_guards = []
340 340 for l in self.full_series:
341 341 h = l.find('#')
342 342 if h == -1:
343 343 patch = l
344 344 comment = ''
345 345 elif h == 0:
346 346 continue
347 347 else:
348 348 patch = l[:h]
349 349 comment = l[h:]
350 350 patch = patch.strip()
351 351 if patch:
352 352 if patch in self.series:
353 353 raise util.Abort(_('%s appears more than once in %s') %
354 354 (patch, self.join(self.series_path)))
355 355 self.series.append(patch)
356 356 self.series_guards.append(self.guard_re.findall(comment))
357 357
358 358 def check_guard(self, guard):
359 359 if not guard:
360 360 return _('guard cannot be an empty string')
361 361 bad_chars = '# \t\r\n\f'
362 362 first = guard[0]
363 363 if first in '-+':
364 364 return (_('guard %r starts with invalid character: %r') %
365 365 (guard, first))
366 366 for c in bad_chars:
367 367 if c in guard:
368 368 return _('invalid character in guard %r: %r') % (guard, c)
369 369
370 370 def set_active(self, guards):
371 371 for guard in guards:
372 372 bad = self.check_guard(guard)
373 373 if bad:
374 374 raise util.Abort(bad)
375 375 guards = sorted(set(guards))
376 376 self.ui.debug('active guards: %s\n' % ' '.join(guards))
377 377 self.active_guards = guards
378 378 self.guards_dirty = True
379 379
380 380 def active(self):
381 381 if self.active_guards is None:
382 382 self.active_guards = []
383 383 try:
384 384 guards = self.opener(self.guards_path).read().split()
385 385 except IOError, err:
386 386 if err.errno != errno.ENOENT:
387 387 raise
388 388 guards = []
389 389 for i, guard in enumerate(guards):
390 390 bad = self.check_guard(guard)
391 391 if bad:
392 392 self.ui.warn('%s:%d: %s\n' %
393 393 (self.join(self.guards_path), i + 1, bad))
394 394 else:
395 395 self.active_guards.append(guard)
396 396 return self.active_guards
397 397
398 398 def set_guards(self, idx, guards):
399 399 for g in guards:
400 400 if len(g) < 2:
401 401 raise util.Abort(_('guard %r too short') % g)
402 402 if g[0] not in '-+':
403 403 raise util.Abort(_('guard %r starts with invalid char') % g)
404 404 bad = self.check_guard(g[1:])
405 405 if bad:
406 406 raise util.Abort(bad)
407 407 drop = self.guard_re.sub('', self.full_series[idx])
408 408 self.full_series[idx] = drop + ''.join([' #' + g for g in guards])
409 409 self.parse_series()
410 410 self.series_dirty = True
411 411
412 412 def pushable(self, idx):
413 413 if isinstance(idx, str):
414 414 idx = self.series.index(idx)
415 415 patchguards = self.series_guards[idx]
416 416 if not patchguards:
417 417 return True, None
418 418 guards = self.active()
419 419 exactneg = [g for g in patchguards if g[0] == '-' and g[1:] in guards]
420 420 if exactneg:
421 421 return False, exactneg[0]
422 422 pos = [g for g in patchguards if g[0] == '+']
423 423 exactpos = [g for g in pos if g[1:] in guards]
424 424 if pos:
425 425 if exactpos:
426 426 return True, exactpos[0]
427 427 return False, pos
428 428 return True, ''
429 429
430 430 def explain_pushable(self, idx, all_patches=False):
431 431 write = all_patches and self.ui.write or self.ui.warn
432 432 if all_patches or self.ui.verbose:
433 433 if isinstance(idx, str):
434 434 idx = self.series.index(idx)
435 435 pushable, why = self.pushable(idx)
436 436 if all_patches and pushable:
437 437 if why is None:
438 438 write(_('allowing %s - no guards in effect\n') %
439 439 self.series[idx])
440 440 else:
441 441 if not why:
442 442 write(_('allowing %s - no matching negative guards\n') %
443 443 self.series[idx])
444 444 else:
445 445 write(_('allowing %s - guarded by %r\n') %
446 446 (self.series[idx], why))
447 447 if not pushable:
448 448 if why:
449 449 write(_('skipping %s - guarded by %r\n') %
450 450 (self.series[idx], why))
451 451 else:
452 452 write(_('skipping %s - no matching guards\n') %
453 453 self.series[idx])
454 454
455 455 def save_dirty(self):
456 456 def write_list(items, path):
457 457 fp = self.opener(path, 'w')
458 458 for i in items:
459 459 fp.write("%s\n" % i)
460 460 fp.close()
461 461 if self.applied_dirty:
462 462 write_list(map(str, self.applied), self.status_path)
463 463 if self.series_dirty:
464 464 write_list(self.full_series, self.series_path)
465 465 if self.guards_dirty:
466 466 write_list(self.active_guards, self.guards_path)
467 467
468 468 def removeundo(self, repo):
469 469 undo = repo.sjoin('undo')
470 470 if not os.path.exists(undo):
471 471 return
472 472 try:
473 473 os.unlink(undo)
474 474 except OSError, inst:
475 475 self.ui.warn(_('error removing undo: %s\n') % str(inst))
476 476
477 477 def printdiff(self, repo, diffopts, node1, node2=None, files=None,
478 478 fp=None, changes=None, opts={}):
479 479 stat = opts.get('stat')
480 480 if stat:
481 481 opts['unified'] = '0'
482 482
483 483 m = cmdutil.match(repo, files, opts)
484 484 chunks = patch.diff(repo, node1, node2, m, changes, diffopts)
485 485 write = fp is None and repo.ui.write or fp.write
486 486 if stat:
487 487 width = self.ui.interactive() and util.termwidth() or 80
488 488 write(patch.diffstat(util.iterlines(chunks), width=width,
489 489 git=diffopts.git))
490 490 else:
491 491 for chunk in chunks:
492 492 write(chunk)
493 493
494 494 def mergeone(self, repo, mergeq, head, patch, rev, diffopts):
495 495 # first try just applying the patch
496 496 (err, n) = self.apply(repo, [patch], update_status=False,
497 497 strict=True, merge=rev)
498 498
499 499 if err == 0:
500 500 return (err, n)
501 501
502 502 if n is None:
503 503 raise util.Abort(_("apply failed for patch %s") % patch)
504 504
505 505 self.ui.warn(_("patch didn't work out, merging %s\n") % patch)
506 506
507 507 # apply failed, strip away that rev and merge.
508 508 hg.clean(repo, head)
509 509 self.strip(repo, n, update=False, backup='strip')
510 510
511 511 ctx = repo[rev]
512 512 ret = hg.merge(repo, rev)
513 513 if ret:
514 514 raise util.Abort(_("update returned %d") % ret)
515 515 n = repo.commit(ctx.description(), ctx.user(), force=True)
516 516 if n is None:
517 517 raise util.Abort(_("repo commit failed"))
518 518 try:
519 519 ph = patchheader(mergeq.join(patch), self.plainmode)
520 520 except:
521 521 raise util.Abort(_("unable to read %s") % patch)
522 522
523 523 diffopts = self.patchopts(diffopts, patch)
524 524 patchf = self.opener(patch, "w")
525 525 comments = str(ph)
526 526 if comments:
527 527 patchf.write(comments)
528 528 self.printdiff(repo, diffopts, head, n, fp=patchf)
529 529 patchf.close()
530 530 self.removeundo(repo)
531 531 return (0, n)
532 532
533 533 def qparents(self, repo, rev=None):
534 534 if rev is None:
535 535 (p1, p2) = repo.dirstate.parents()
536 536 if p2 == nullid:
537 537 return p1
538 538 if not self.applied:
539 539 return None
540 540 return self.applied[-1].node
541 541 p1, p2 = repo.changelog.parents(rev)
542 542 if p2 != nullid and p2 in [x.node for x in self.applied]:
543 543 return p2
544 544 return p1
545 545
546 546 def mergepatch(self, repo, mergeq, series, diffopts):
547 547 if not self.applied:
548 548 # each of the patches merged in will have two parents. This
549 549 # can confuse the qrefresh, qdiff, and strip code because it
550 550 # needs to know which parent is actually in the patch queue.
551 551 # so, we insert a merge marker with only one parent. This way
552 552 # the first patch in the queue is never a merge patch
553 553 #
554 554 pname = ".hg.patches.merge.marker"
555 555 n = repo.commit('[mq]: merge marker', force=True)
556 556 self.removeundo(repo)
557 557 self.applied.append(statusentry(n, pname))
558 558 self.applied_dirty = 1
559 559
560 560 head = self.qparents(repo)
561 561
562 562 for patch in series:
563 563 patch = mergeq.lookup(patch, strict=True)
564 564 if not patch:
565 565 self.ui.warn(_("patch %s does not exist\n") % patch)
566 566 return (1, None)
567 567 pushable, reason = self.pushable(patch)
568 568 if not pushable:
569 569 self.explain_pushable(patch, all_patches=True)
570 570 continue
571 571 info = mergeq.isapplied(patch)
572 572 if not info:
573 573 self.ui.warn(_("patch %s is not applied\n") % patch)
574 574 return (1, None)
575 575 rev = info[1]
576 576 err, head = self.mergeone(repo, mergeq, head, patch, rev, diffopts)
577 577 if head:
578 578 self.applied.append(statusentry(head, patch))
579 579 self.applied_dirty = 1
580 580 if err:
581 581 return (err, head)
582 582 self.save_dirty()
583 583 return (0, head)
584 584
585 585 def patch(self, repo, patchfile):
586 586 '''Apply patchfile to the working directory.
587 587 patchfile: name of patch file'''
588 588 files = {}
589 589 try:
590 590 fuzz = patch.patch(patchfile, self.ui, strip=1, cwd=repo.root,
591 591 files=files, eolmode=None)
592 592 except Exception, inst:
593 593 self.ui.note(str(inst) + '\n')
594 594 if not self.ui.verbose:
595 595 self.ui.warn(_("patch failed, unable to continue (try -v)\n"))
596 596 return (False, files, False)
597 597
598 598 return (True, files, fuzz)
599 599
600 600 def apply(self, repo, series, list=False, update_status=True,
601 601 strict=False, patchdir=None, merge=None, all_files=None):
602 602 wlock = lock = tr = None
603 603 try:
604 604 wlock = repo.wlock()
605 605 lock = repo.lock()
606 606 tr = repo.transaction()
607 607 try:
608 608 ret = self._apply(repo, series, list, update_status,
609 609 strict, patchdir, merge, all_files=all_files)
610 610 tr.close()
611 611 self.save_dirty()
612 612 return ret
613 613 except:
614 614 try:
615 615 tr.abort()
616 616 finally:
617 617 repo.invalidate()
618 618 repo.dirstate.invalidate()
619 619 raise
620 620 finally:
621 621 del tr
622 622 release(lock, wlock)
623 623 self.removeundo(repo)
624 624
625 625 def _apply(self, repo, series, list=False, update_status=True,
626 626 strict=False, patchdir=None, merge=None, all_files=None):
627 627 '''returns (error, hash)
628 628 error = 1 for unable to read, 2 for patch failed, 3 for patch fuzz'''
629 629 # TODO unify with commands.py
630 630 if not patchdir:
631 631 patchdir = self.path
632 632 err = 0
633 633 n = None
634 634 for patchname in series:
635 635 pushable, reason = self.pushable(patchname)
636 636 if not pushable:
637 637 self.explain_pushable(patchname, all_patches=True)
638 638 continue
639 639 self.ui.status(_("applying %s\n") % patchname)
640 640 pf = os.path.join(patchdir, patchname)
641 641
642 642 try:
643 643 ph = patchheader(self.join(patchname), self.plainmode)
644 644 except:
645 645 self.ui.warn(_("unable to read %s\n") % patchname)
646 646 err = 1
647 647 break
648 648
649 649 message = ph.message
650 650 if not message:
651 651 message = "imported patch %s\n" % patchname
652 652 else:
653 653 if list:
654 654 message.append("\nimported patch %s" % patchname)
655 655 message = '\n'.join(message)
656 656
657 657 if ph.haspatch:
658 658 (patcherr, files, fuzz) = self.patch(repo, pf)
659 659 if all_files is not None:
660 660 all_files.update(files)
661 661 patcherr = not patcherr
662 662 else:
663 663 self.ui.warn(_("patch %s is empty\n") % patchname)
664 664 patcherr, files, fuzz = 0, [], 0
665 665
666 666 if merge and files:
667 667 # Mark as removed/merged and update dirstate parent info
668 668 removed = []
669 669 merged = []
670 670 for f in files:
671 671 if os.path.exists(repo.wjoin(f)):
672 672 merged.append(f)
673 673 else:
674 674 removed.append(f)
675 675 for f in removed:
676 676 repo.dirstate.remove(f)
677 677 for f in merged:
678 678 repo.dirstate.merge(f)
679 679 p1, p2 = repo.dirstate.parents()
680 680 repo.dirstate.setparents(p1, merge)
681 681
682 682 files = patch.updatedir(self.ui, repo, files)
683 683 match = cmdutil.matchfiles(repo, files or [])
684 684 n = repo.commit(message, ph.user, ph.date, match=match, force=True)
685 685
686 686 if n is None:
687 687 raise util.Abort(_("repo commit failed"))
688 688
689 689 if update_status:
690 690 self.applied.append(statusentry(n, patchname))
691 691
692 692 if patcherr:
693 693 self.ui.warn(_("patch failed, rejects left in working dir\n"))
694 694 err = 2
695 695 break
696 696
697 697 if fuzz and strict:
698 698 self.ui.warn(_("fuzz found when applying patch, stopping\n"))
699 699 err = 3
700 700 break
701 701 return (err, n)
702 702
703 703 def _cleanup(self, patches, numrevs, keep=False):
704 704 if not keep:
705 705 r = self.qrepo()
706 706 if r:
707 707 r.remove(patches, True)
708 708 else:
709 709 for p in patches:
710 710 os.unlink(self.join(p))
711 711
712 712 if numrevs:
713 713 del self.applied[:numrevs]
714 714 self.applied_dirty = 1
715 715
716 716 for i in sorted([self.find_series(p) for p in patches], reverse=True):
717 717 del self.full_series[i]
718 718 self.parse_series()
719 719 self.series_dirty = 1
720 720
721 721 def _revpatches(self, repo, revs):
722 722 firstrev = repo[self.applied[0].node].rev()
723 723 patches = []
724 724 for i, rev in enumerate(revs):
725 725
726 726 if rev < firstrev:
727 727 raise util.Abort(_('revision %d is not managed') % rev)
728 728
729 729 ctx = repo[rev]
730 730 base = self.applied[i].node
731 731 if ctx.node() != base:
732 732 msg = _('cannot delete revision %d above applied patches')
733 733 raise util.Abort(msg % rev)
734 734
735 735 patch = self.applied[i].name
736 736 for fmt in ('[mq]: %s', 'imported patch %s'):
737 737 if ctx.description() == fmt % patch:
738 738 msg = _('patch %s finalized without changeset message\n')
739 739 repo.ui.status(msg % patch)
740 740 break
741 741
742 742 patches.append(patch)
743 743 return patches
744 744
745 745 def finish(self, repo, revs):
746 746 patches = self._revpatches(repo, sorted(revs))
747 747 self._cleanup(patches, len(patches))
748 748
749 749 def delete(self, repo, patches, opts):
750 750 if not patches and not opts.get('rev'):
751 751 raise util.Abort(_('qdelete requires at least one revision or '
752 752 'patch name'))
753 753
754 754 realpatches = []
755 755 for patch in patches:
756 756 patch = self.lookup(patch, strict=True)
757 757 info = self.isapplied(patch)
758 758 if info:
759 759 raise util.Abort(_("cannot delete applied patch %s") % patch)
760 760 if patch not in self.series:
761 761 raise util.Abort(_("patch %s not in series file") % patch)
762 762 realpatches.append(patch)
763 763
764 764 numrevs = 0
765 765 if opts.get('rev'):
766 766 if not self.applied:
767 767 raise util.Abort(_('no patches applied'))
768 768 revs = cmdutil.revrange(repo, opts['rev'])
769 769 if len(revs) > 1 and revs[0] > revs[1]:
770 770 revs.reverse()
771 771 revpatches = self._revpatches(repo, revs)
772 772 realpatches += revpatches
773 773 numrevs = len(revpatches)
774 774
775 775 self._cleanup(realpatches, numrevs, opts.get('keep'))
776 776
777 777 def check_toppatch(self, repo):
778 778 if self.applied:
779 779 top = self.applied[-1].node
780 780 patch = self.applied[-1].name
781 781 pp = repo.dirstate.parents()
782 782 if top not in pp:
783 783 raise util.Abort(_("working directory revision is not qtip"))
784 784 return top, patch
785 785 return None, None
786 786
787 787 def check_localchanges(self, repo, force=False, refresh=True):
788 788 m, a, r, d = repo.status()[:4]
789 789 if (m or a or r or d) and not force:
790 790 if refresh:
791 791 raise util.Abort(_("local changes found, refresh first"))
792 792 else:
793 793 raise util.Abort(_("local changes found"))
794 794 return m, a, r, d
795 795
796 796 _reserved = ('series', 'status', 'guards')
797 797 def check_reserved_name(self, name):
798 798 if (name in self._reserved or name.startswith('.hg')
799 799 or name.startswith('.mq') or '#' in name or ':' in name):
800 800 raise util.Abort(_('"%s" cannot be used as the name of a patch')
801 801 % name)
802 802
803 803 def new(self, repo, patchfn, *pats, **opts):
804 804 """options:
805 805 msg: a string or a no-argument function returning a string
806 806 """
807 807 msg = opts.get('msg')
808 808 user = opts.get('user')
809 809 date = opts.get('date')
810 810 if date:
811 811 date = util.parsedate(date)
812 812 diffopts = self.diffopts({'git': opts.get('git')})
813 813 self.check_reserved_name(patchfn)
814 814 if os.path.exists(self.join(patchfn)):
815 815 raise util.Abort(_('patch "%s" already exists') % patchfn)
816 816 if opts.get('include') or opts.get('exclude') or pats:
817 817 match = cmdutil.match(repo, pats, opts)
818 818 # detect missing files in pats
819 819 def badfn(f, msg):
820 820 raise util.Abort('%s: %s' % (f, msg))
821 821 match.bad = badfn
822 822 m, a, r, d = repo.status(match=match)[:4]
823 823 else:
824 824 m, a, r, d = self.check_localchanges(repo, force=True)
825 825 match = cmdutil.matchfiles(repo, m + a + r)
826 826 if len(repo[None].parents()) > 1:
827 827 raise util.Abort(_('cannot manage merge changesets'))
828 828 commitfiles = m + a + r
829 829 self.check_toppatch(repo)
830 830 insert = self.full_series_end()
831 831 wlock = repo.wlock()
832 832 try:
833 833 # if patch file write fails, abort early
834 834 p = self.opener(patchfn, "w")
835 835 try:
836 836 if self.plainmode:
837 837 if user:
838 838 p.write("From: " + user + "\n")
839 839 if not date:
840 840 p.write("\n")
841 841 if date:
842 842 p.write("Date: %d %d\n\n" % date)
843 843 else:
844 844 p.write("# HG changeset patch\n")
845 845 p.write("# Parent "
846 846 + hex(repo[None].parents()[0].node()) + "\n")
847 847 if user:
848 848 p.write("# User " + user + "\n")
849 849 if date:
850 850 p.write("# Date %s %s\n\n" % date)
851 851 if hasattr(msg, '__call__'):
852 852 msg = msg()
853 853 commitmsg = msg and msg or ("[mq]: %s" % patchfn)
854 854 n = repo.commit(commitmsg, user, date, match=match, force=True)
855 855 if n is None:
856 856 raise util.Abort(_("repo commit failed"))
857 857 try:
858 858 self.full_series[insert:insert] = [patchfn]
859 859 self.applied.append(statusentry(n, patchfn))
860 860 self.parse_series()
861 861 self.series_dirty = 1
862 862 self.applied_dirty = 1
863 863 if msg:
864 864 msg = msg + "\n\n"
865 865 p.write(msg)
866 866 if commitfiles:
867 867 parent = self.qparents(repo, n)
868 868 chunks = patch.diff(repo, node1=parent, node2=n,
869 869 match=match, opts=diffopts)
870 870 for chunk in chunks:
871 871 p.write(chunk)
872 872 p.close()
873 873 wlock.release()
874 874 wlock = None
875 875 r = self.qrepo()
876 876 if r:
877 877 r.add([patchfn])
878 878 except:
879 879 repo.rollback()
880 880 raise
881 881 except Exception:
882 882 patchpath = self.join(patchfn)
883 883 try:
884 884 os.unlink(patchpath)
885 885 except:
886 886 self.ui.warn(_('error unlinking %s\n') % patchpath)
887 887 raise
888 888 self.removeundo(repo)
889 889 finally:
890 890 release(wlock)
891 891
892 892 def strip(self, repo, rev, update=True, backup="all", force=None):
893 893 wlock = lock = None
894 894 try:
895 895 wlock = repo.wlock()
896 896 lock = repo.lock()
897 897
898 898 if update:
899 899 self.check_localchanges(repo, force=force, refresh=False)
900 900 urev = self.qparents(repo, rev)
901 901 hg.clean(repo, urev)
902 902 repo.dirstate.write()
903 903
904 904 self.removeundo(repo)
905 905 repair.strip(self.ui, repo, rev, backup)
906 906 # strip may have unbundled a set of backed up revisions after
907 907 # the actual strip
908 908 self.removeundo(repo)
909 909 finally:
910 910 release(lock, wlock)
911 911
912 912 def isapplied(self, patch):
913 913 """returns (index, rev, patch)"""
914 914 for i, a in enumerate(self.applied):
915 915 if a.name == patch:
916 916 return (i, a.node, a.name)
917 917 return None
918 918
919 919 # if the exact patch name does not exist, we try a few
920 920 # variations. If strict is passed, we try only #1
921 921 #
922 922 # 1) a number to indicate an offset in the series file
923 923 # 2) a unique substring of the patch name was given
924 924 # 3) patchname[-+]num to indicate an offset in the series file
925 925 def lookup(self, patch, strict=False):
926 926 patch = patch and str(patch)
927 927
928 928 def partial_name(s):
929 929 if s in self.series:
930 930 return s
931 931 matches = [x for x in self.series if s in x]
932 932 if len(matches) > 1:
933 933 self.ui.warn(_('patch name "%s" is ambiguous:\n') % s)
934 934 for m in matches:
935 935 self.ui.warn(' %s\n' % m)
936 936 return None
937 937 if matches:
938 938 return matches[0]
939 939 if self.series and self.applied:
940 940 if s == 'qtip':
941 941 return self.series[self.series_end(True)-1]
942 942 if s == 'qbase':
943 943 return self.series[0]
944 944 return None
945 945
946 946 if patch is None:
947 947 return None
948 948 if patch in self.series:
949 949 return patch
950 950
951 951 if not os.path.isfile(self.join(patch)):
952 952 try:
953 953 sno = int(patch)
954 954 except (ValueError, OverflowError):
955 955 pass
956 956 else:
957 957 if -len(self.series) <= sno < len(self.series):
958 958 return self.series[sno]
959 959
960 960 if not strict:
961 961 res = partial_name(patch)
962 962 if res:
963 963 return res
964 964 minus = patch.rfind('-')
965 965 if minus >= 0:
966 966 res = partial_name(patch[:minus])
967 967 if res:
968 968 i = self.series.index(res)
969 969 try:
970 970 off = int(patch[minus + 1:] or 1)
971 971 except (ValueError, OverflowError):
972 972 pass
973 973 else:
974 974 if i - off >= 0:
975 975 return self.series[i - off]
976 976 plus = patch.rfind('+')
977 977 if plus >= 0:
978 978 res = partial_name(patch[:plus])
979 979 if res:
980 980 i = self.series.index(res)
981 981 try:
982 982 off = int(patch[plus + 1:] or 1)
983 983 except (ValueError, OverflowError):
984 984 pass
985 985 else:
986 986 if i + off < len(self.series):
987 987 return self.series[i + off]
988 988 raise util.Abort(_("patch %s not in series") % patch)
989 989
990 990 def push(self, repo, patch=None, force=False, list=False,
991 991 mergeq=None, all=False):
992 992 diffopts = self.diffopts()
993 993 wlock = repo.wlock()
994 994 try:
995 995 heads = []
996 996 for b, ls in repo.branchmap().iteritems():
997 997 heads += ls
998 998 if not heads:
999 999 heads = [nullid]
1000 1000 if repo.dirstate.parents()[0] not in heads:
1001 1001 self.ui.status(_("(working directory not at a head)\n"))
1002 1002
1003 1003 if not self.series:
1004 1004 self.ui.warn(_('no patches in series\n'))
1005 1005 return 0
1006 1006
1007 1007 patch = self.lookup(patch)
1008 1008 # Suppose our series file is: A B C and the current 'top'
1009 1009 # patch is B. qpush C should be performed (moving forward)
1010 1010 # qpush B is a NOP (no change) qpush A is an error (can't
1011 1011 # go backwards with qpush)
1012 1012 if patch:
1013 1013 info = self.isapplied(patch)
1014 1014 if info:
1015 1015 if info[0] < len(self.applied) - 1:
1016 1016 raise util.Abort(
1017 1017 _("cannot push to a previous patch: %s") % patch)
1018 1018 self.ui.warn(
1019 1019 _('qpush: %s is already at the top\n') % patch)
1020 1020 return
1021 1021 pushable, reason = self.pushable(patch)
1022 1022 if not pushable:
1023 1023 if reason:
1024 1024 reason = _('guarded by %r') % reason
1025 1025 else:
1026 1026 reason = _('no matching guards')
1027 1027 self.ui.warn(_("cannot push '%s' - %s\n") % (patch, reason))
1028 1028 return 1
1029 1029 elif all:
1030 1030 patch = self.series[-1]
1031 1031 if self.isapplied(patch):
1032 1032 self.ui.warn(_('all patches are currently applied\n'))
1033 1033 return 0
1034 1034
1035 1035 # Following the above example, starting at 'top' of B:
1036 1036 # qpush should be performed (pushes C), but a subsequent
1037 1037 # qpush without an argument is an error (nothing to
1038 1038 # apply). This allows a loop of "...while hg qpush..." to
1039 1039 # work as it detects an error when done
1040 1040 start = self.series_end()
1041 1041 if start == len(self.series):
1042 1042 self.ui.warn(_('patch series already fully applied\n'))
1043 1043 return 1
1044 1044 if not force:
1045 1045 self.check_localchanges(repo)
1046 1046
1047 1047 self.applied_dirty = 1
1048 1048 if start > 0:
1049 1049 self.check_toppatch(repo)
1050 1050 if not patch:
1051 1051 patch = self.series[start]
1052 1052 end = start + 1
1053 1053 else:
1054 1054 end = self.series.index(patch, start) + 1
1055 1055
1056 1056 s = self.series[start:end]
1057 1057 all_files = set()
1058 1058 try:
1059 1059 if mergeq:
1060 1060 ret = self.mergepatch(repo, mergeq, s, diffopts)
1061 1061 else:
1062 1062 ret = self.apply(repo, s, list, all_files=all_files)
1063 1063 except:
1064 1064 self.ui.warn(_('cleaning up working directory...'))
1065 1065 node = repo.dirstate.parents()[0]
1066 1066 hg.revert(repo, node, None)
1067 1067 # only remove unknown files that we know we touched or
1068 1068 # created while patching
1069 1069 for f in all_files:
1070 1070 if f not in repo.dirstate:
1071 1071 try:
1072 1072 util.unlink(repo.wjoin(f))
1073 1073 except OSError, inst:
1074 1074 if inst.errno != errno.ENOENT:
1075 1075 raise
1076 1076 self.ui.warn(_('done\n'))
1077 1077 raise
1078 1078
1079 1079 if not self.applied:
1080 1080 return ret[0]
1081 1081 top = self.applied[-1].name
1082 1082 if ret[0] and ret[0] > 1:
1083 1083 msg = _("errors during apply, please fix and refresh %s\n")
1084 1084 self.ui.write(msg % top)
1085 1085 else:
1086 1086 self.ui.write(_("now at: %s\n") % top)
1087 1087 return ret[0]
1088 1088
1089 1089 finally:
1090 1090 wlock.release()
1091 1091
1092 1092 def pop(self, repo, patch=None, force=False, update=True, all=False):
1093 1093 wlock = repo.wlock()
1094 1094 try:
1095 1095 if patch:
1096 1096 # index, rev, patch
1097 1097 info = self.isapplied(patch)
1098 1098 if not info:
1099 1099 patch = self.lookup(patch)
1100 1100 info = self.isapplied(patch)
1101 1101 if not info:
1102 1102 raise util.Abort(_("patch %s is not applied") % patch)
1103 1103
1104 1104 if not self.applied:
1105 1105 # Allow qpop -a to work repeatedly,
1106 1106 # but not qpop without an argument
1107 1107 self.ui.warn(_("no patches applied\n"))
1108 1108 return not all
1109 1109
1110 1110 if all:
1111 1111 start = 0
1112 1112 elif patch:
1113 1113 start = info[0] + 1
1114 1114 else:
1115 1115 start = len(self.applied) - 1
1116 1116
1117 1117 if start >= len(self.applied):
1118 1118 self.ui.warn(_("qpop: %s is already at the top\n") % patch)
1119 1119 return
1120 1120
1121 1121 if not update:
1122 1122 parents = repo.dirstate.parents()
1123 1123 rr = [x.node for x in self.applied]
1124 1124 for p in parents:
1125 1125 if p in rr:
1126 1126 self.ui.warn(_("qpop: forcing dirstate update\n"))
1127 1127 update = True
1128 1128 else:
1129 1129 parents = [p.node() for p in repo[None].parents()]
1130 1130 needupdate = False
1131 1131 for entry in self.applied[start:]:
1132 1132 if entry.node in parents:
1133 1133 needupdate = True
1134 1134 break
1135 1135 update = needupdate
1136 1136
1137 1137 if not force and update:
1138 1138 self.check_localchanges(repo)
1139 1139
1140 1140 self.applied_dirty = 1
1141 1141 end = len(self.applied)
1142 1142 rev = self.applied[start].node
1143 1143 if update:
1144 1144 top = self.check_toppatch(repo)[0]
1145 1145
1146 1146 try:
1147 1147 heads = repo.changelog.heads(rev)
1148 1148 except error.LookupError:
1149 1149 node = short(rev)
1150 1150 raise util.Abort(_('trying to pop unknown node %s') % node)
1151 1151
1152 1152 if heads != [self.applied[-1].node]:
1153 1153 raise util.Abort(_("popping would remove a revision not "
1154 1154 "managed by this patch queue"))
1155 1155
1156 1156 # we know there are no local changes, so we can make a simplified
1157 1157 # form of hg.update.
1158 1158 if update:
1159 1159 qp = self.qparents(repo, rev)
1160 1160 ctx = repo[qp]
1161 1161 m, a, r, d = repo.status(qp, top)[:4]
1162 1162 if d:
1163 1163 raise util.Abort(_("deletions found between repo revs"))
1164 1164 for f in a:
1165 1165 try:
1166 1166 os.unlink(repo.wjoin(f))
1167 1167 except OSError, e:
1168 1168 if e.errno != errno.ENOENT:
1169 1169 raise
1170 1170 try: os.removedirs(os.path.dirname(repo.wjoin(f)))
1171 1171 except: pass
1172 1172 repo.dirstate.forget(f)
1173 1173 for f in m + r:
1174 1174 fctx = ctx[f]
1175 1175 repo.wwrite(f, fctx.data(), fctx.flags())
1176 1176 repo.dirstate.normal(f)
1177 1177 repo.dirstate.setparents(qp, nullid)
1178 1178 for patch in reversed(self.applied[start:end]):
1179 1179 self.ui.status(_("popping %s\n") % patch.name)
1180 1180 del self.applied[start:end]
1181 1181 self.strip(repo, rev, update=False, backup='strip')
1182 1182 if self.applied:
1183 1183 self.ui.write(_("now at: %s\n") % self.applied[-1].name)
1184 1184 else:
1185 1185 self.ui.write(_("patch queue now empty\n"))
1186 1186 finally:
1187 1187 wlock.release()
1188 1188
1189 1189 def diff(self, repo, pats, opts):
1190 1190 top, patch = self.check_toppatch(repo)
1191 1191 if not top:
1192 1192 self.ui.write(_("no patches applied\n"))
1193 1193 return
1194 1194 qp = self.qparents(repo, top)
1195 1195 if opts.get('reverse'):
1196 1196 node1, node2 = None, qp
1197 1197 else:
1198 1198 node1, node2 = qp, None
1199 1199 diffopts = self.diffopts(opts, patch)
1200 1200 self.printdiff(repo, diffopts, node1, node2, files=pats, opts=opts)
1201 1201
1202 1202 def refresh(self, repo, pats=None, **opts):
1203 1203 if not self.applied:
1204 1204 self.ui.write(_("no patches applied\n"))
1205 1205 return 1
1206 1206 msg = opts.get('msg', '').rstrip()
1207 1207 newuser = opts.get('user')
1208 1208 newdate = opts.get('date')
1209 1209 if newdate:
1210 1210 newdate = '%d %d' % util.parsedate(newdate)
1211 1211 wlock = repo.wlock()
1212 1212
1213 1213 try:
1214 1214 self.check_toppatch(repo)
1215 1215 (top, patchfn) = (self.applied[-1].node, self.applied[-1].name)
1216 1216 if repo.changelog.heads(top) != [top]:
1217 1217 raise util.Abort(_("cannot refresh a revision with children"))
1218 1218
1219 1219 cparents = repo.changelog.parents(top)
1220 1220 patchparent = self.qparents(repo, top)
1221 1221 ph = patchheader(self.join(patchfn), self.plainmode)
1222 1222 diffopts = self.diffopts({'git': opts.get('git')}, patchfn)
1223 1223 if msg:
1224 1224 ph.setmessage(msg)
1225 1225 if newuser:
1226 1226 ph.setuser(newuser)
1227 1227 if newdate:
1228 1228 ph.setdate(newdate)
1229 1229 ph.setparent(hex(patchparent))
1230 1230
1231 1231 # only commit new patch when write is complete
1232 1232 patchf = self.opener(patchfn, 'w', atomictemp=True)
1233 1233
1234 1234 comments = str(ph)
1235 1235 if comments:
1236 1236 patchf.write(comments)
1237 1237
1238 1238 # update the dirstate in place, strip off the qtip commit
1239 1239 # and then commit.
1240 1240 #
1241 1241 # this should really read:
1242 1242 # mm, dd, aa, aa2 = repo.status(tip, patchparent)[:4]
1243 1243 # but we do it backwards to take advantage of manifest/chlog
1244 1244 # caching against the next repo.status call
1245 1245 mm, aa, dd, aa2 = repo.status(patchparent, top)[:4]
1246 1246 changes = repo.changelog.read(top)
1247 1247 man = repo.manifest.read(changes[0])
1248 1248 aaa = aa[:]
1249 1249 matchfn = cmdutil.match(repo, pats, opts)
1250 1250 # in short mode, we only diff the files included in the
1251 1251 # patch already plus specified files
1252 1252 if opts.get('short'):
1253 1253 # if amending a patch, we start with existing
1254 1254 # files plus specified files - unfiltered
1255 1255 match = cmdutil.matchfiles(repo, mm + aa + dd + matchfn.files())
1256 1256 # filter with inc/exl options
1257 1257 matchfn = cmdutil.match(repo, opts=opts)
1258 1258 else:
1259 1259 match = cmdutil.matchall(repo)
1260 1260 m, a, r, d = repo.status(match=match)[:4]
1261 1261
1262 1262 # we might end up with files that were added between
1263 1263 # qtip and the dirstate parent, but then changed in the
1264 1264 # local dirstate. in this case, we want them to only
1265 1265 # show up in the added section
1266 1266 for x in m:
1267 1267 if x not in aa:
1268 1268 mm.append(x)
1269 1269 # we might end up with files added by the local dirstate that
1270 1270 # were deleted by the patch. In this case, they should only
1271 1271 # show up in the changed section.
1272 1272 for x in a:
1273 1273 if x in dd:
1274 1274 del dd[dd.index(x)]
1275 1275 mm.append(x)
1276 1276 else:
1277 1277 aa.append(x)
1278 1278 # make sure any files deleted in the local dirstate
1279 1279 # are not in the add or change column of the patch
1280 1280 forget = []
1281 1281 for x in d + r:
1282 1282 if x in aa:
1283 1283 del aa[aa.index(x)]
1284 1284 forget.append(x)
1285 1285 continue
1286 1286 elif x in mm:
1287 1287 del mm[mm.index(x)]
1288 1288 dd.append(x)
1289 1289
1290 1290 m = list(set(mm))
1291 1291 r = list(set(dd))
1292 1292 a = list(set(aa))
1293 1293 c = [filter(matchfn, l) for l in (m, a, r)]
1294 1294 match = cmdutil.matchfiles(repo, set(c[0] + c[1] + c[2]))
1295 1295 chunks = patch.diff(repo, patchparent, match=match,
1296 1296 changes=c, opts=diffopts)
1297 1297 for chunk in chunks:
1298 1298 patchf.write(chunk)
1299 1299
1300 1300 try:
1301 1301 if diffopts.git or diffopts.upgrade:
1302 1302 copies = {}
1303 1303 for dst in a:
1304 1304 src = repo.dirstate.copied(dst)
1305 1305 # during qfold, the source file for copies may
1306 1306 # be removed. Treat this as a simple add.
1307 1307 if src is not None and src in repo.dirstate:
1308 1308 copies.setdefault(src, []).append(dst)
1309 1309 repo.dirstate.add(dst)
1310 1310 # remember the copies between patchparent and qtip
1311 1311 for dst in aaa:
1312 1312 f = repo.file(dst)
1313 1313 src = f.renamed(man[dst])
1314 1314 if src:
1315 1315 copies.setdefault(src[0], []).extend(
1316 1316 copies.get(dst, []))
1317 1317 if dst in a:
1318 1318 copies[src[0]].append(dst)
1319 1319 # we can't copy a file created by the patch itself
1320 1320 if dst in copies:
1321 1321 del copies[dst]
1322 1322 for src, dsts in copies.iteritems():
1323 1323 for dst in dsts:
1324 1324 repo.dirstate.copy(src, dst)
1325 1325 else:
1326 1326 for dst in a:
1327 1327 repo.dirstate.add(dst)
1328 1328 # Drop useless copy information
1329 1329 for f in list(repo.dirstate.copies()):
1330 1330 repo.dirstate.copy(None, f)
1331 1331 for f in r:
1332 1332 repo.dirstate.remove(f)
1333 1333 # if the patch excludes a modified file, mark that
1334 1334 # file with mtime=0 so status can see it.
1335 1335 mm = []
1336 1336 for i in xrange(len(m)-1, -1, -1):
1337 1337 if not matchfn(m[i]):
1338 1338 mm.append(m[i])
1339 1339 del m[i]
1340 1340 for f in m:
1341 1341 repo.dirstate.normal(f)
1342 1342 for f in mm:
1343 1343 repo.dirstate.normallookup(f)
1344 1344 for f in forget:
1345 1345 repo.dirstate.forget(f)
1346 1346
1347 1347 if not msg:
1348 1348 if not ph.message:
1349 1349 message = "[mq]: %s\n" % patchfn
1350 1350 else:
1351 1351 message = "\n".join(ph.message)
1352 1352 else:
1353 1353 message = msg
1354 1354
1355 1355 user = ph.user or changes[1]
1356 1356
1357 1357 # assumes strip can roll itself back if interrupted
1358 1358 repo.dirstate.setparents(*cparents)
1359 1359 self.applied.pop()
1360 1360 self.applied_dirty = 1
1361 1361 self.strip(repo, top, update=False,
1362 1362 backup='strip')
1363 1363 except:
1364 1364 repo.dirstate.invalidate()
1365 1365 raise
1366 1366
1367 1367 try:
1368 1368 # might be nice to attempt to roll back strip after this
1369 1369 patchf.rename()
1370 1370 n = repo.commit(message, user, ph.date, match=match,
1371 1371 force=True)
1372 1372 self.applied.append(statusentry(n, patchfn))
1373 1373 except:
1374 1374 ctx = repo[cparents[0]]
1375 1375 repo.dirstate.rebuild(ctx.node(), ctx.manifest())
1376 1376 self.save_dirty()
1377 1377 self.ui.warn(_('refresh interrupted while patch was popped! '
1378 1378 '(revert --all, qpush to recover)\n'))
1379 1379 raise
1380 1380 finally:
1381 1381 wlock.release()
1382 1382 self.removeundo(repo)
1383 1383
1384 1384 def init(self, repo, create=False):
1385 1385 if not create and os.path.isdir(self.path):
1386 1386 raise util.Abort(_("patch queue directory already exists"))
1387 1387 try:
1388 1388 os.mkdir(self.path)
1389 1389 except OSError, inst:
1390 1390 if inst.errno != errno.EEXIST or not create:
1391 1391 raise
1392 1392 if create:
1393 1393 return self.qrepo(create=True)
1394 1394
1395 1395 def unapplied(self, repo, patch=None):
1396 1396 if patch and patch not in self.series:
1397 1397 raise util.Abort(_("patch %s is not in series file") % patch)
1398 1398 if not patch:
1399 1399 start = self.series_end()
1400 1400 else:
1401 1401 start = self.series.index(patch) + 1
1402 1402 unapplied = []
1403 1403 for i in xrange(start, len(self.series)):
1404 1404 pushable, reason = self.pushable(i)
1405 1405 if pushable:
1406 1406 unapplied.append((i, self.series[i]))
1407 1407 self.explain_pushable(i)
1408 1408 return unapplied
1409 1409
1410 1410 def qseries(self, repo, missing=None, start=0, length=None, status=None,
1411 1411 summary=False):
1412 1412 def displayname(pfx, patchname):
1413 1413 if summary:
1414 1414 ph = patchheader(self.join(patchname), self.plainmode)
1415 1415 msg = ph.message and ph.message[0] or ''
1416 1416 if self.ui.interactive():
1417 1417 width = util.termwidth() - len(pfx) - len(patchname) - 2
1418 1418 if width > 0:
1419 1419 msg = util.ellipsis(msg, width)
1420 1420 else:
1421 1421 msg = ''
1422 1422 msg = "%s%s: %s" % (pfx, patchname, msg)
1423 1423 else:
1424 1424 msg = pfx + patchname
1425 1425 self.ui.write(msg + '\n')
1426 1426
1427 1427 applied = set([p.name for p in self.applied])
1428 1428 if length is None:
1429 1429 length = len(self.series) - start
1430 1430 if not missing:
1431 1431 if self.ui.verbose:
1432 1432 idxwidth = len(str(start + length - 1))
1433 1433 for i in xrange(start, start + length):
1434 1434 patch = self.series[i]
1435 1435 if patch in applied:
1436 1436 stat = 'A'
1437 1437 elif self.pushable(i)[0]:
1438 1438 stat = 'U'
1439 1439 else:
1440 1440 stat = 'G'
1441 1441 pfx = ''
1442 1442 if self.ui.verbose:
1443 1443 pfx = '%*d %s ' % (idxwidth, i, stat)
1444 1444 elif status and status != stat:
1445 1445 continue
1446 1446 displayname(pfx, patch)
1447 1447 else:
1448 1448 msng_list = []
1449 1449 for root, dirs, files in os.walk(self.path):
1450 1450 d = root[len(self.path) + 1:]
1451 1451 for f in files:
1452 1452 fl = os.path.join(d, f)
1453 1453 if (fl not in self.series and
1454 1454 fl not in (self.status_path, self.series_path,
1455 1455 self.guards_path)
1456 1456 and not fl.startswith('.')):
1457 1457 msng_list.append(fl)
1458 1458 for x in sorted(msng_list):
1459 1459 pfx = self.ui.verbose and ('D ') or ''
1460 1460 displayname(pfx, x)
1461 1461
1462 1462 def issaveline(self, l):
1463 1463 if l.name == '.hg.patches.save.line':
1464 1464 return True
1465 1465
1466 1466 def qrepo(self, create=False):
1467 1467 if create or os.path.isdir(self.join(".hg")):
1468 1468 return hg.repository(self.ui, path=self.path, create=create)
1469 1469
1470 1470 def restore(self, repo, rev, delete=None, qupdate=None):
1471 1471 desc = repo[rev].description().strip()
1472 1472 lines = desc.splitlines()
1473 1473 i = 0
1474 1474 datastart = None
1475 1475 series = []
1476 1476 applied = []
1477 1477 qpp = None
1478 1478 for i, line in enumerate(lines):
1479 1479 if line == 'Patch Data:':
1480 1480 datastart = i + 1
1481 1481 elif line.startswith('Dirstate:'):
1482 1482 l = line.rstrip()
1483 1483 l = l[10:].split(' ')
1484 1484 qpp = [bin(x) for x in l]
1485 1485 elif datastart != None:
1486 1486 l = line.rstrip()
1487 1487 n, name = l.split(':', 1)
1488 1488 if n:
1489 1489 applied.append(statusentry(bin(n), name))
1490 1490 else:
1491 1491 series.append(l)
1492 1492 if datastart is None:
1493 1493 self.ui.warn(_("No saved patch data found\n"))
1494 1494 return 1
1495 1495 self.ui.warn(_("restoring status: %s\n") % lines[0])
1496 1496 self.full_series = series
1497 1497 self.applied = applied
1498 1498 self.parse_series()
1499 1499 self.series_dirty = 1
1500 1500 self.applied_dirty = 1
1501 1501 heads = repo.changelog.heads()
1502 1502 if delete:
1503 1503 if rev not in heads:
1504 1504 self.ui.warn(_("save entry has children, leaving it alone\n"))
1505 1505 else:
1506 1506 self.ui.warn(_("removing save entry %s\n") % short(rev))
1507 1507 pp = repo.dirstate.parents()
1508 1508 if rev in pp:
1509 1509 update = True
1510 1510 else:
1511 1511 update = False
1512 1512 self.strip(repo, rev, update=update, backup='strip')
1513 1513 if qpp:
1514 1514 self.ui.warn(_("saved queue repository parents: %s %s\n") %
1515 1515 (short(qpp[0]), short(qpp[1])))
1516 1516 if qupdate:
1517 1517 self.ui.status(_("queue directory updating\n"))
1518 1518 r = self.qrepo()
1519 1519 if not r:
1520 1520 self.ui.warn(_("Unable to load queue repository\n"))
1521 1521 return 1
1522 1522 hg.clean(r, qpp[0])
1523 1523
1524 1524 def save(self, repo, msg=None):
1525 1525 if not self.applied:
1526 1526 self.ui.warn(_("save: no patches applied, exiting\n"))
1527 1527 return 1
1528 1528 if self.issaveline(self.applied[-1]):
1529 1529 self.ui.warn(_("status is already saved\n"))
1530 1530 return 1
1531 1531
1532 1532 if not msg:
1533 1533 msg = _("hg patches saved state")
1534 1534 else:
1535 1535 msg = "hg patches: " + msg.rstrip('\r\n')
1536 1536 r = self.qrepo()
1537 1537 if r:
1538 1538 pp = r.dirstate.parents()
1539 1539 msg += "\nDirstate: %s %s" % (hex(pp[0]), hex(pp[1]))
1540 1540 msg += "\n\nPatch Data:\n"
1541 1541 msg += ''.join('%s\n' % x for x in self.applied)
1542 1542 msg += ''.join(':%s\n' % x for x in self.full_series)
1543 1543 n = repo.commit(msg, force=True)
1544 1544 if not n:
1545 1545 self.ui.warn(_("repo commit failed\n"))
1546 1546 return 1
1547 1547 self.applied.append(statusentry(n, '.hg.patches.save.line'))
1548 1548 self.applied_dirty = 1
1549 1549 self.removeundo(repo)
1550 1550
1551 1551 def full_series_end(self):
1552 1552 if self.applied:
1553 1553 p = self.applied[-1].name
1554 1554 end = self.find_series(p)
1555 1555 if end is None:
1556 1556 return len(self.full_series)
1557 1557 return end + 1
1558 1558 return 0
1559 1559
1560 1560 def series_end(self, all_patches=False):
1561 1561 """If all_patches is False, return the index of the next pushable patch
1562 1562 in the series, or the series length. If all_patches is True, return the
1563 1563 index of the first patch past the last applied one.
1564 1564 """
1565 1565 end = 0
1566 1566 def next(start):
1567 1567 if all_patches or start >= len(self.series):
1568 1568 return start
1569 1569 for i in xrange(start, len(self.series)):
1570 1570 p, reason = self.pushable(i)
1571 1571 if p:
1572 1572 break
1573 1573 self.explain_pushable(i)
1574 1574 return i
1575 1575 if self.applied:
1576 1576 p = self.applied[-1].name
1577 1577 try:
1578 1578 end = self.series.index(p)
1579 1579 except ValueError:
1580 1580 return 0
1581 1581 return next(end + 1)
1582 1582 return next(end)
1583 1583
1584 1584 def appliedname(self, index):
1585 1585 pname = self.applied[index].name
1586 1586 if not self.ui.verbose:
1587 1587 p = pname
1588 1588 else:
1589 1589 p = str(self.series.index(pname)) + " " + pname
1590 1590 return p
1591 1591
1592 1592 def qimport(self, repo, files, patchname=None, rev=None, existing=None,
1593 1593 force=None, git=False):
1594 1594 def checkseries(patchname):
1595 1595 if patchname in self.series:
1596 1596 raise util.Abort(_('patch %s is already in the series file')
1597 1597 % patchname)
1598 1598 def checkfile(patchname):
1599 1599 if not force and os.path.exists(self.join(patchname)):
1600 1600 raise util.Abort(_('patch "%s" already exists')
1601 1601 % patchname)
1602 1602
1603 1603 if rev:
1604 1604 if files:
1605 1605 raise util.Abort(_('option "-r" not valid when importing '
1606 1606 'files'))
1607 1607 rev = cmdutil.revrange(repo, rev)
1608 1608 rev.sort(reverse=True)
1609 1609 if (len(files) > 1 or len(rev) > 1) and patchname:
1610 1610 raise util.Abort(_('option "-n" not valid when importing multiple '
1611 1611 'patches'))
1612 1612 added = []
1613 1613 if rev:
1614 1614 # If mq patches are applied, we can only import revisions
1615 1615 # that form a linear path to qbase.
1616 1616 # Otherwise, they should form a linear path to a head.
1617 1617 heads = repo.changelog.heads(repo.changelog.node(rev[-1]))
1618 1618 if len(heads) > 1:
1619 1619 raise util.Abort(_('revision %d is the root of more than one '
1620 1620 'branch') % rev[-1])
1621 1621 if self.applied:
1622 1622 base = repo.changelog.node(rev[0])
1623 1623 if base in [n.node for n in self.applied]:
1624 1624 raise util.Abort(_('revision %d is already managed')
1625 1625 % rev[0])
1626 1626 if heads != [self.applied[-1].node]:
1627 1627 raise util.Abort(_('revision %d is not the parent of '
1628 1628 'the queue') % rev[0])
1629 1629 base = repo.changelog.rev(self.applied[0].node)
1630 1630 lastparent = repo.changelog.parentrevs(base)[0]
1631 1631 else:
1632 1632 if heads != [repo.changelog.node(rev[0])]:
1633 1633 raise util.Abort(_('revision %d has unmanaged children')
1634 1634 % rev[0])
1635 1635 lastparent = None
1636 1636
1637 1637 diffopts = self.diffopts({'git': git})
1638 1638 for r in rev:
1639 1639 p1, p2 = repo.changelog.parentrevs(r)
1640 1640 n = repo.changelog.node(r)
1641 1641 if p2 != nullrev:
1642 1642 raise util.Abort(_('cannot import merge revision %d') % r)
1643 1643 if lastparent and lastparent != r:
1644 1644 raise util.Abort(_('revision %d is not the parent of %d')
1645 1645 % (r, lastparent))
1646 1646 lastparent = p1
1647 1647
1648 1648 if not patchname:
1649 1649 patchname = normname('%d.diff' % r)
1650 1650 self.check_reserved_name(patchname)
1651 1651 checkseries(patchname)
1652 1652 checkfile(patchname)
1653 1653 self.full_series.insert(0, patchname)
1654 1654
1655 1655 patchf = self.opener(patchname, "w")
1656 1656 cmdutil.export(repo, [n], fp=patchf, opts=diffopts)
1657 1657 patchf.close()
1658 1658
1659 1659 se = statusentry(n, patchname)
1660 1660 self.applied.insert(0, se)
1661 1661
1662 1662 added.append(patchname)
1663 1663 patchname = None
1664 1664 self.parse_series()
1665 1665 self.applied_dirty = 1
1666 1666
1667 1667 for i, filename in enumerate(files):
1668 1668 if existing:
1669 1669 if filename == '-':
1670 1670 raise util.Abort(_('-e is incompatible with import from -'))
1671 1671 if not patchname:
1672 1672 patchname = normname(filename)
1673 1673 self.check_reserved_name(patchname)
1674 1674 if not os.path.isfile(self.join(patchname)):
1675 1675 raise util.Abort(_("patch %s does not exist") % patchname)
1676 1676 else:
1677 1677 try:
1678 1678 if filename == '-':
1679 1679 if not patchname:
1680 1680 raise util.Abort(
1681 1681 _('need --name to import a patch from -'))
1682 1682 text = sys.stdin.read()
1683 1683 else:
1684 1684 text = url.open(self.ui, filename).read()
1685 1685 except (OSError, IOError):
1686 1686 raise util.Abort(_("unable to read %s") % filename)
1687 1687 if not patchname:
1688 1688 patchname = normname(os.path.basename(filename))
1689 1689 self.check_reserved_name(patchname)
1690 1690 checkfile(patchname)
1691 1691 patchf = self.opener(patchname, "w")
1692 1692 patchf.write(text)
1693 1693 if not force:
1694 1694 checkseries(patchname)
1695 1695 if patchname not in self.series:
1696 1696 index = self.full_series_end() + i
1697 1697 self.full_series[index:index] = [patchname]
1698 1698 self.parse_series()
1699 1699 self.ui.warn(_("adding %s to series file\n") % patchname)
1700 1700 added.append(patchname)
1701 1701 patchname = None
1702 1702 self.series_dirty = 1
1703 1703 qrepo = self.qrepo()
1704 1704 if qrepo:
1705 1705 qrepo.add(added)
1706 1706
1707 1707 def delete(ui, repo, *patches, **opts):
1708 1708 """remove patches from queue
1709 1709
1710 1710 The patches must not be applied, and at least one patch is required. With
1711 1711 -k/--keep, the patch files are preserved in the patch directory.
1712 1712
1713 1713 To stop managing a patch and move it into permanent history,
1714 1714 use the qfinish command."""
1715 1715 q = repo.mq
1716 1716 q.delete(repo, patches, opts)
1717 1717 q.save_dirty()
1718 1718 return 0
1719 1719
1720 1720 def applied(ui, repo, patch=None, **opts):
1721 1721 """print the patches already applied"""
1722 1722
1723 1723 q = repo.mq
1724 1724 l = len(q.applied)
1725 1725
1726 1726 if patch:
1727 1727 if patch not in q.series:
1728 1728 raise util.Abort(_("patch %s is not in series file") % patch)
1729 1729 end = q.series.index(patch) + 1
1730 1730 else:
1731 1731 end = q.series_end(True)
1732 1732
1733 1733 if opts.get('last') and not end:
1734 1734 ui.write(_("no patches applied\n"))
1735 1735 return 1
1736 1736 elif opts.get('last') and end == 1:
1737 1737 ui.write(_("only one patch applied\n"))
1738 1738 return 1
1739 1739 elif opts.get('last'):
1740 1740 start = end - 2
1741 1741 end = 1
1742 1742 else:
1743 1743 start = 0
1744 1744
1745 1745 return q.qseries(repo, length=end, start=start, status='A',
1746 1746 summary=opts.get('summary'))
1747 1747
1748 1748 def unapplied(ui, repo, patch=None, **opts):
1749 1749 """print the patches not yet applied"""
1750 1750
1751 1751 q = repo.mq
1752 1752 if patch:
1753 1753 if patch not in q.series:
1754 1754 raise util.Abort(_("patch %s is not in series file") % patch)
1755 1755 start = q.series.index(patch) + 1
1756 1756 else:
1757 1757 start = q.series_end(True)
1758 1758
1759 1759 if start == len(q.series) and opts.get('first'):
1760 1760 ui.write(_("all patches applied\n"))
1761 1761 return 1
1762 1762
1763 1763 length = opts.get('first') and 1 or None
1764 1764 return q.qseries(repo, start=start, length=length, status='U',
1765 1765 summary=opts.get('summary'))
1766 1766
1767 1767 def qimport(ui, repo, *filename, **opts):
1768 1768 """import a patch
1769 1769
1770 1770 The patch is inserted into the series after the last applied
1771 1771 patch. If no patches have been applied, qimport prepends the patch
1772 1772 to the series.
1773 1773
1774 1774 The patch will have the same name as its source file unless you
1775 1775 give it a new one with -n/--name.
1776 1776
1777 1777 You can register an existing patch inside the patch directory with
1778 1778 the -e/--existing flag.
1779 1779
1780 1780 With -f/--force, an existing patch of the same name will be
1781 1781 overwritten.
1782 1782
1783 1783 An existing changeset may be placed under mq control with -r/--rev
1784 1784 (e.g. qimport --rev tip -n patch will place tip under mq control).
1785 1785 With -g/--git, patches imported with --rev will use the git diff
1786 1786 format. See the diffs help topic for information on why this is
1787 1787 important for preserving rename/copy information and permission
1788 1788 changes.
1789 1789
1790 1790 To import a patch from standard input, pass - as the patch file.
1791 1791 When importing from standard input, a patch name must be specified
1792 1792 using the --name flag.
1793 1793 """
1794 1794 q = repo.mq
1795 1795 q.qimport(repo, filename, patchname=opts['name'],
1796 1796 existing=opts['existing'], force=opts['force'], rev=opts['rev'],
1797 1797 git=opts['git'])
1798 1798 q.save_dirty()
1799 1799
1800 1800 if opts.get('push') and not opts.get('rev'):
1801 1801 return q.push(repo, None)
1802 1802 return 0
1803 1803
1804 1804 def qinit(ui, repo, create):
1805 1805 """initialize a new queue repository
1806 1806
1807 1807 This command also creates a series file for ordering patches, and
1808 1808 an mq-specific .hgignore file in the queue repository, to exclude
1809 1809 the status and guards files (these contain mostly transient state)."""
1810 1810 q = repo.mq
1811 1811 r = q.init(repo, create)
1812 1812 q.save_dirty()
1813 1813 if r:
1814 1814 if not os.path.exists(r.wjoin('.hgignore')):
1815 1815 fp = r.wopener('.hgignore', 'w')
1816 1816 fp.write('^\\.hg\n')
1817 1817 fp.write('^\\.mq\n')
1818 1818 fp.write('syntax: glob\n')
1819 1819 fp.write('status\n')
1820 1820 fp.write('guards\n')
1821 1821 fp.close()
1822 1822 if not os.path.exists(r.wjoin('series')):
1823 1823 r.wopener('series', 'w').close()
1824 1824 r.add(['.hgignore', 'series'])
1825 1825 commands.add(ui, r)
1826 1826 return 0
1827 1827
1828 1828 def init(ui, repo, **opts):
1829 1829 """init a new queue repository (DEPRECATED)
1830 1830
1831 1831 The queue repository is unversioned by default. If
1832 1832 -c/--create-repo is specified, qinit will create a separate nested
1833 1833 repository for patches (qinit -c may also be run later to convert
1834 1834 an unversioned patch repository into a versioned one). You can use
1835 1835 qcommit to commit changes to this queue repository.
1836 1836
1837 1837 This command is deprecated. Without -c, it's implied by other relevant
1838 1838 commands. With -c, use hg init --mq instead."""
1839 1839 return qinit(ui, repo, create=opts['create_repo'])
1840 1840
1841 1841 def clone(ui, source, dest=None, **opts):
1842 1842 '''clone main and patch repository at same time
1843 1843
1844 1844 If source is local, destination will have no patches applied. If
1845 1845 source is remote, this command can not check if patches are
1846 1846 applied in source, so cannot guarantee that patches are not
1847 1847 applied in destination. If you clone remote repository, be sure
1848 1848 before that it has no patches applied.
1849 1849
1850 1850 Source patch repository is looked for in <src>/.hg/patches by
1851 1851 default. Use -p <url> to change.
1852 1852
1853 1853 The patch directory must be a nested Mercurial repository, as
1854 1854 would be created by init --mq.
1855 1855 '''
1856 1856 def patchdir(repo):
1857 1857 url = repo.url()
1858 1858 if url.endswith('/'):
1859 1859 url = url[:-1]
1860 1860 return url + '/.hg/patches'
1861 1861 if dest is None:
1862 1862 dest = hg.defaultdest(source)
1863 1863 sr = hg.repository(cmdutil.remoteui(ui, opts), ui.expandpath(source))
1864 1864 if opts['patches']:
1865 1865 patchespath = ui.expandpath(opts['patches'])
1866 1866 else:
1867 1867 patchespath = patchdir(sr)
1868 1868 try:
1869 1869 hg.repository(ui, patchespath)
1870 1870 except error.RepoError:
1871 1871 raise util.Abort(_('versioned patch repository not found'
1872 1872 ' (see init --mq)'))
1873 1873 qbase, destrev = None, None
1874 1874 if sr.local():
1875 1875 if sr.mq.applied:
1876 1876 qbase = sr.mq.applied[0].node
1877 1877 if not hg.islocal(dest):
1878 1878 heads = set(sr.heads())
1879 1879 destrev = list(heads.difference(sr.heads(qbase)))
1880 1880 destrev.append(sr.changelog.parents(qbase)[0])
1881 1881 elif sr.capable('lookup'):
1882 1882 try:
1883 1883 qbase = sr.lookup('qbase')
1884 1884 except error.RepoError:
1885 1885 pass
1886 1886 ui.note(_('cloning main repository\n'))
1887 1887 sr, dr = hg.clone(ui, sr.url(), dest,
1888 1888 pull=opts['pull'],
1889 1889 rev=destrev,
1890 1890 update=False,
1891 1891 stream=opts['uncompressed'])
1892 1892 ui.note(_('cloning patch repository\n'))
1893 1893 hg.clone(ui, opts['patches'] or patchdir(sr), patchdir(dr),
1894 1894 pull=opts['pull'], update=not opts['noupdate'],
1895 1895 stream=opts['uncompressed'])
1896 1896 if dr.local():
1897 1897 if qbase:
1898 1898 ui.note(_('stripping applied patches from destination '
1899 1899 'repository\n'))
1900 1900 dr.mq.strip(dr, qbase, update=False, backup=None)
1901 1901 if not opts['noupdate']:
1902 1902 ui.note(_('updating destination repository\n'))
1903 1903 hg.update(dr, dr.changelog.tip())
1904 1904
1905 1905 def commit(ui, repo, *pats, **opts):
1906 1906 """commit changes in the queue repository (DEPRECATED)
1907 1907
1908 1908 This command is deprecated; use hg commit --mq instead."""
1909 1909 q = repo.mq
1910 1910 r = q.qrepo()
1911 1911 if not r:
1912 1912 raise util.Abort('no queue repository')
1913 1913 commands.commit(r.ui, r, *pats, **opts)
1914 1914
1915 1915 def series(ui, repo, **opts):
1916 1916 """print the entire series file"""
1917 1917 repo.mq.qseries(repo, missing=opts['missing'], summary=opts['summary'])
1918 1918 return 0
1919 1919
1920 1920 def top(ui, repo, **opts):
1921 1921 """print the name of the current patch"""
1922 1922 q = repo.mq
1923 1923 t = q.applied and q.series_end(True) or 0
1924 1924 if t:
1925 1925 return q.qseries(repo, start=t - 1, length=1, status='A',
1926 1926 summary=opts.get('summary'))
1927 1927 else:
1928 1928 ui.write(_("no patches applied\n"))
1929 1929 return 1
1930 1930
1931 1931 def next(ui, repo, **opts):
1932 1932 """print the name of the next patch"""
1933 1933 q = repo.mq
1934 1934 end = q.series_end()
1935 1935 if end == len(q.series):
1936 1936 ui.write(_("all patches applied\n"))
1937 1937 return 1
1938 1938 return q.qseries(repo, start=end, length=1, summary=opts.get('summary'))
1939 1939
1940 1940 def prev(ui, repo, **opts):
1941 1941 """print the name of the previous patch"""
1942 1942 q = repo.mq
1943 1943 l = len(q.applied)
1944 1944 if l == 1:
1945 1945 ui.write(_("only one patch applied\n"))
1946 1946 return 1
1947 1947 if not l:
1948 1948 ui.write(_("no patches applied\n"))
1949 1949 return 1
1950 1950 return q.qseries(repo, start=l - 2, length=1, status='A',
1951 1951 summary=opts.get('summary'))
1952 1952
1953 1953 def setupheaderopts(ui, opts):
1954 1954 if not opts.get('user') and opts.get('currentuser'):
1955 1955 opts['user'] = ui.username()
1956 1956 if not opts.get('date') and opts.get('currentdate'):
1957 1957 opts['date'] = "%d %d" % util.makedate()
1958 1958
1959 1959 def new(ui, repo, patch, *args, **opts):
1960 1960 """create a new patch
1961 1961
1962 1962 qnew creates a new patch on top of the currently-applied patch (if
1963 1963 any). It will refuse to run if there are any outstanding changes
1964 1964 unless -f/--force is specified, in which case the patch will be
1965 1965 initialized with them. You may also use -I/--include,
1966 1966 -X/--exclude, and/or a list of files after the patch name to add
1967 1967 only changes to matching files to the new patch, leaving the rest
1968 1968 as uncommitted modifications.
1969 1969
1970 1970 -u/--user and -d/--date can be used to set the (given) user and
1971 1971 date, respectively. -U/--currentuser and -D/--currentdate set user
1972 1972 to current user and date to current date.
1973 1973
1974 1974 -e/--edit, -m/--message or -l/--logfile set the patch header as
1975 1975 well as the commit message. If none is specified, the header is
1976 1976 empty and the commit message is '[mq]: PATCH'.
1977 1977
1978 1978 Use the -g/--git option to keep the patch in the git extended diff
1979 1979 format. Read the diffs help topic for more information on why this
1980 1980 is important for preserving permission changes and copy/rename
1981 1981 information.
1982 1982 """
1983 1983 msg = cmdutil.logmessage(opts)
1984 1984 def getmsg():
1985 1985 return ui.edit(msg, ui.username())
1986 1986 q = repo.mq
1987 1987 opts['msg'] = msg
1988 1988 if opts.get('edit'):
1989 1989 opts['msg'] = getmsg
1990 1990 else:
1991 1991 opts['msg'] = msg
1992 1992 setupheaderopts(ui, opts)
1993 1993 q.new(repo, patch, *args, **opts)
1994 1994 q.save_dirty()
1995 1995 return 0
1996 1996
1997 1997 def refresh(ui, repo, *pats, **opts):
1998 1998 """update the current patch
1999 1999
2000 2000 If any file patterns are provided, the refreshed patch will
2001 2001 contain only the modifications that match those patterns; the
2002 2002 remaining modifications will remain in the working directory.
2003 2003
2004 2004 If -s/--short is specified, files currently included in the patch
2005 2005 will be refreshed just like matched files and remain in the patch.
2006 2006
2007 2007 hg add/remove/copy/rename work as usual, though you might want to
2008 2008 use git-style patches (-g/--git or [diff] git=1) to track copies
2009 2009 and renames. See the diffs help topic for more information on the
2010 2010 git diff format.
2011 2011 """
2012 2012 q = repo.mq
2013 2013 message = cmdutil.logmessage(opts)
2014 2014 if opts['edit']:
2015 2015 if not q.applied:
2016 2016 ui.write(_("no patches applied\n"))
2017 2017 return 1
2018 2018 if message:
2019 2019 raise util.Abort(_('option "-e" incompatible with "-m" or "-l"'))
2020 2020 patch = q.applied[-1].name
2021 2021 ph = patchheader(q.join(patch), q.plainmode)
2022 2022 message = ui.edit('\n'.join(ph.message), ph.user or ui.username())
2023 2023 setupheaderopts(ui, opts)
2024 2024 ret = q.refresh(repo, pats, msg=message, **opts)
2025 2025 q.save_dirty()
2026 2026 return ret
2027 2027
2028 2028 def diff(ui, repo, *pats, **opts):
2029 2029 """diff of the current patch and subsequent modifications
2030 2030
2031 2031 Shows a diff which includes the current patch as well as any
2032 2032 changes which have been made in the working directory since the
2033 2033 last refresh (thus showing what the current patch would become
2034 2034 after a qrefresh).
2035 2035
2036 2036 Use 'hg diff' if you only want to see the changes made since the
2037 2037 last qrefresh, or 'hg export qtip' if you want to see changes made
2038 2038 by the current patch without including changes made since the
2039 2039 qrefresh.
2040 2040 """
2041 2041 repo.mq.diff(repo, pats, opts)
2042 2042 return 0
2043 2043
2044 2044 def fold(ui, repo, *files, **opts):
2045 2045 """fold the named patches into the current patch
2046 2046
2047 2047 Patches must not yet be applied. Each patch will be successively
2048 2048 applied to the current patch in the order given. If all the
2049 2049 patches apply successfully, the current patch will be refreshed
2050 2050 with the new cumulative patch, and the folded patches will be
2051 2051 deleted. With -k/--keep, the folded patch files will not be
2052 2052 removed afterwards.
2053 2053
2054 2054 The header for each folded patch will be concatenated with the
2055 2055 current patch header, separated by a line of '* * *'."""
2056 2056
2057 2057 q = repo.mq
2058 2058
2059 2059 if not files:
2060 2060 raise util.Abort(_('qfold requires at least one patch name'))
2061 2061 if not q.check_toppatch(repo)[0]:
2062 2062 raise util.Abort(_('No patches applied'))
2063 2063 q.check_localchanges(repo)
2064 2064
2065 2065 message = cmdutil.logmessage(opts)
2066 2066 if opts['edit']:
2067 2067 if message:
2068 2068 raise util.Abort(_('option "-e" incompatible with "-m" or "-l"'))
2069 2069
2070 2070 parent = q.lookup('qtip')
2071 2071 patches = []
2072 2072 messages = []
2073 2073 for f in files:
2074 2074 p = q.lookup(f)
2075 2075 if p in patches or p == parent:
2076 2076 ui.warn(_('Skipping already folded patch %s') % p)
2077 2077 if q.isapplied(p):
2078 2078 raise util.Abort(_('qfold cannot fold already applied patch %s') % p)
2079 2079 patches.append(p)
2080 2080
2081 2081 for p in patches:
2082 2082 if not message:
2083 2083 ph = patchheader(q.join(p), q.plainmode)
2084 2084 if ph.message:
2085 2085 messages.append(ph.message)
2086 2086 pf = q.join(p)
2087 2087 (patchsuccess, files, fuzz) = q.patch(repo, pf)
2088 2088 if not patchsuccess:
2089 2089 raise util.Abort(_('Error folding patch %s') % p)
2090 2090 patch.updatedir(ui, repo, files)
2091 2091
2092 2092 if not message:
2093 2093 ph = patchheader(q.join(parent), q.plainmode)
2094 2094 message, user = ph.message, ph.user
2095 2095 for msg in messages:
2096 2096 message.append('* * *')
2097 2097 message.extend(msg)
2098 2098 message = '\n'.join(message)
2099 2099
2100 2100 if opts['edit']:
2101 2101 message = ui.edit(message, user or ui.username())
2102 2102
2103 2103 diffopts = q.patchopts(q.diffopts(), *patches)
2104 2104 q.refresh(repo, msg=message, git=diffopts.git)
2105 2105 q.delete(repo, patches, opts)
2106 2106 q.save_dirty()
2107 2107
2108 2108 def goto(ui, repo, patch, **opts):
2109 2109 '''push or pop patches until named patch is at top of stack'''
2110 2110 q = repo.mq
2111 2111 patch = q.lookup(patch)
2112 2112 if q.isapplied(patch):
2113 2113 ret = q.pop(repo, patch, force=opts['force'])
2114 2114 else:
2115 2115 ret = q.push(repo, patch, force=opts['force'])
2116 2116 q.save_dirty()
2117 2117 return ret
2118 2118
2119 2119 def guard(ui, repo, *args, **opts):
2120 2120 '''set or print guards for a patch
2121 2121
2122 2122 Guards control whether a patch can be pushed. A patch with no
2123 2123 guards is always pushed. A patch with a positive guard ("+foo") is
2124 2124 pushed only if the qselect command has activated it. A patch with
2125 2125 a negative guard ("-foo") is never pushed if the qselect command
2126 2126 has activated it.
2127 2127
2128 2128 With no arguments, print the currently active guards.
2129 2129 With arguments, set guards for the named patch.
2130 2130 NOTE: Specifying negative guards now requires '--'.
2131 2131
2132 2132 To set guards on another patch::
2133 2133
2134 2134 hg qguard other.patch -- +2.6.17 -stable
2135 2135 '''
2136 2136 def status(idx):
2137 2137 guards = q.series_guards[idx] or ['unguarded']
2138 2138 ui.write('%s: %s\n' % (q.series[idx], ' '.join(guards)))
2139 2139 q = repo.mq
2140 2140 patch = None
2141 2141 args = list(args)
2142 2142 if opts['list']:
2143 2143 if args or opts['none']:
2144 2144 raise util.Abort(_('cannot mix -l/--list with options or arguments'))
2145 2145 for i in xrange(len(q.series)):
2146 2146 status(i)
2147 2147 return
2148 2148 if not args or args[0][0:1] in '-+':
2149 2149 if not q.applied:
2150 2150 raise util.Abort(_('no patches applied'))
2151 2151 patch = q.applied[-1].name
2152 2152 if patch is None and args[0][0:1] not in '-+':
2153 2153 patch = args.pop(0)
2154 2154 if patch is None:
2155 2155 raise util.Abort(_('no patch to work with'))
2156 2156 if args or opts['none']:
2157 2157 idx = q.find_series(patch)
2158 2158 if idx is None:
2159 2159 raise util.Abort(_('no patch named %s') % patch)
2160 2160 q.set_guards(idx, args)
2161 2161 q.save_dirty()
2162 2162 else:
2163 2163 status(q.series.index(q.lookup(patch)))
2164 2164
2165 2165 def header(ui, repo, patch=None):
2166 2166 """print the header of the topmost or specified patch"""
2167 2167 q = repo.mq
2168 2168
2169 2169 if patch:
2170 2170 patch = q.lookup(patch)
2171 2171 else:
2172 2172 if not q.applied:
2173 2173 ui.write(_('no patches applied\n'))
2174 2174 return 1
2175 2175 patch = q.lookup('qtip')
2176 2176 ph = patchheader(q.join(patch), q.plainmode)
2177 2177
2178 2178 ui.write('\n'.join(ph.message) + '\n')
2179 2179
2180 2180 def lastsavename(path):
2181 2181 (directory, base) = os.path.split(path)
2182 2182 names = os.listdir(directory)
2183 2183 namere = re.compile("%s.([0-9]+)" % base)
2184 2184 maxindex = None
2185 2185 maxname = None
2186 2186 for f in names:
2187 2187 m = namere.match(f)
2188 2188 if m:
2189 2189 index = int(m.group(1))
2190 2190 if maxindex is None or index > maxindex:
2191 2191 maxindex = index
2192 2192 maxname = f
2193 2193 if maxname:
2194 2194 return (os.path.join(directory, maxname), maxindex)
2195 2195 return (None, None)
2196 2196
2197 2197 def savename(path):
2198 2198 (last, index) = lastsavename(path)
2199 2199 if last is None:
2200 2200 index = 0
2201 2201 newpath = path + ".%d" % (index + 1)
2202 2202 return newpath
2203 2203
2204 2204 def push(ui, repo, patch=None, **opts):
2205 2205 """push the next patch onto the stack
2206 2206
2207 2207 When -f/--force is applied, all local changes in patched files
2208 2208 will be lost.
2209 2209 """
2210 2210 q = repo.mq
2211 2211 mergeq = None
2212 2212
2213 2213 if opts['merge']:
2214 2214 if opts['name']:
2215 2215 newpath = repo.join(opts['name'])
2216 2216 else:
2217 2217 newpath, i = lastsavename(q.path)
2218 2218 if not newpath:
2219 2219 ui.warn(_("no saved queues found, please use -n\n"))
2220 2220 return 1
2221 2221 mergeq = queue(ui, repo.join(""), newpath)
2222 2222 ui.warn(_("merging with queue at: %s\n") % mergeq.path)
2223 2223 ret = q.push(repo, patch, force=opts['force'], list=opts['list'],
2224 2224 mergeq=mergeq, all=opts.get('all'))
2225 2225 return ret
2226 2226
2227 2227 def pop(ui, repo, patch=None, **opts):
2228 2228 """pop the current patch off the stack
2229 2229
2230 2230 By default, pops off the top of the patch stack. If given a patch
2231 2231 name, keeps popping off patches until the named patch is at the
2232 2232 top of the stack.
2233 2233 """
2234 2234 localupdate = True
2235 2235 if opts['name']:
2236 2236 q = queue(ui, repo.join(""), repo.join(opts['name']))
2237 2237 ui.warn(_('using patch queue: %s\n') % q.path)
2238 2238 localupdate = False
2239 2239 else:
2240 2240 q = repo.mq
2241 2241 ret = q.pop(repo, patch, force=opts['force'], update=localupdate,
2242 2242 all=opts['all'])
2243 2243 q.save_dirty()
2244 2244 return ret
2245 2245
2246 2246 def rename(ui, repo, patch, name=None, **opts):
2247 2247 """rename a patch
2248 2248
2249 2249 With one argument, renames the current patch to PATCH1.
2250 2250 With two arguments, renames PATCH1 to PATCH2."""
2251 2251
2252 2252 q = repo.mq
2253 2253
2254 2254 if not name:
2255 2255 name = patch
2256 2256 patch = None
2257 2257
2258 2258 if patch:
2259 2259 patch = q.lookup(patch)
2260 2260 else:
2261 2261 if not q.applied:
2262 2262 ui.write(_('no patches applied\n'))
2263 2263 return
2264 2264 patch = q.lookup('qtip')
2265 2265 absdest = q.join(name)
2266 2266 if os.path.isdir(absdest):
2267 2267 name = normname(os.path.join(name, os.path.basename(patch)))
2268 2268 absdest = q.join(name)
2269 2269 if os.path.exists(absdest):
2270 2270 raise util.Abort(_('%s already exists') % absdest)
2271 2271
2272 2272 if name in q.series:
2273 2273 raise util.Abort(
2274 2274 _('A patch named %s already exists in the series file') % name)
2275 2275
2276 2276 ui.note(_('renaming %s to %s\n') % (patch, name))
2277 2277 i = q.find_series(patch)
2278 2278 guards = q.guard_re.findall(q.full_series[i])
2279 2279 q.full_series[i] = name + ''.join([' #' + g for g in guards])
2280 2280 q.parse_series()
2281 2281 q.series_dirty = 1
2282 2282
2283 2283 info = q.isapplied(patch)
2284 2284 if info:
2285 2285 q.applied[info[0]] = statusentry(info[1], name)
2286 2286 q.applied_dirty = 1
2287 2287
2288 2288 util.rename(q.join(patch), absdest)
2289 2289 r = q.qrepo()
2290 2290 if r:
2291 2291 wlock = r.wlock()
2292 2292 try:
2293 2293 if r.dirstate[patch] == 'a':
2294 2294 r.dirstate.forget(patch)
2295 2295 r.dirstate.add(name)
2296 2296 else:
2297 2297 if r.dirstate[name] == 'r':
2298 2298 r.undelete([name])
2299 2299 r.copy(patch, name)
2300 2300 r.remove([patch], False)
2301 2301 finally:
2302 2302 wlock.release()
2303 2303
2304 2304 q.save_dirty()
2305 2305
2306 2306 def restore(ui, repo, rev, **opts):
2307 2307 """restore the queue state saved by a revision (DEPRECATED)
2308 2308
2309 2309 This command is deprecated, use rebase --mq instead."""
2310 2310 rev = repo.lookup(rev)
2311 2311 q = repo.mq
2312 2312 q.restore(repo, rev, delete=opts['delete'],
2313 2313 qupdate=opts['update'])
2314 2314 q.save_dirty()
2315 2315 return 0
2316 2316
2317 2317 def save(ui, repo, **opts):
2318 2318 """save current queue state (DEPRECATED)
2319 2319
2320 2320 This command is deprecated, use rebase --mq instead."""
2321 2321 q = repo.mq
2322 2322 message = cmdutil.logmessage(opts)
2323 2323 ret = q.save(repo, msg=message)
2324 2324 if ret:
2325 2325 return ret
2326 2326 q.save_dirty()
2327 2327 if opts['copy']:
2328 2328 path = q.path
2329 2329 if opts['name']:
2330 2330 newpath = os.path.join(q.basepath, opts['name'])
2331 2331 if os.path.exists(newpath):
2332 2332 if not os.path.isdir(newpath):
2333 2333 raise util.Abort(_('destination %s exists and is not '
2334 2334 'a directory') % newpath)
2335 2335 if not opts['force']:
2336 2336 raise util.Abort(_('destination %s exists, '
2337 2337 'use -f to force') % newpath)
2338 2338 else:
2339 2339 newpath = savename(path)
2340 2340 ui.warn(_("copy %s to %s\n") % (path, newpath))
2341 2341 util.copyfiles(path, newpath)
2342 2342 if opts['empty']:
2343 2343 try:
2344 2344 os.unlink(q.join(q.status_path))
2345 2345 except:
2346 2346 pass
2347 2347 return 0
2348 2348
2349 2349 def strip(ui, repo, rev, **opts):
2350 2350 """strip a revision and all its descendants from the repository
2351 2351
2352 2352 If one of the working directory's parent revisions is stripped, the
2353 2353 working directory will be updated to the parent of the stripped
2354 2354 revision.
2355 2355 """
2356 2356 backup = 'all'
2357 2357 if opts['backup']:
2358 2358 backup = 'strip'
2359 2359 elif opts['nobackup']:
2360 2360 backup = 'none'
2361 2361
2362 2362 rev = repo.lookup(rev)
2363 2363 p = repo.dirstate.parents()
2364 2364 cl = repo.changelog
2365 2365 update = True
2366 2366 if p[0] == nullid:
2367 2367 update = False
2368 2368 elif p[1] == nullid and rev != cl.ancestor(p[0], rev):
2369 2369 update = False
2370 2370 elif rev not in (cl.ancestor(p[0], rev), cl.ancestor(p[1], rev)):
2371 2371 update = False
2372 2372
2373 2373 repo.mq.strip(repo, rev, backup=backup, update=update, force=opts['force'])
2374 2374 return 0
2375 2375
2376 2376 def select(ui, repo, *args, **opts):
2377 2377 '''set or print guarded patches to push
2378 2378
2379 2379 Use the qguard command to set or print guards on patch, then use
2380 2380 qselect to tell mq which guards to use. A patch will be pushed if
2381 2381 it has no guards or any positive guards match the currently
2382 2382 selected guard, but will not be pushed if any negative guards
2383 2383 match the current guard. For example::
2384 2384
2385 2385 qguard foo.patch -stable (negative guard)
2386 2386 qguard bar.patch +stable (positive guard)
2387 2387 qselect stable
2388 2388
2389 2389 This activates the "stable" guard. mq will skip foo.patch (because
2390 2390 it has a negative match) but push bar.patch (because it has a
2391 2391 positive match).
2392 2392
2393 2393 With no arguments, prints the currently active guards.
2394 2394 With one argument, sets the active guard.
2395 2395
2396 2396 Use -n/--none to deactivate guards (no other arguments needed).
2397 2397 When no guards are active, patches with positive guards are
2398 2398 skipped and patches with negative guards are pushed.
2399 2399
2400 2400 qselect can change the guards on applied patches. It does not pop
2401 2401 guarded patches by default. Use --pop to pop back to the last
2402 2402 applied patch that is not guarded. Use --reapply (which implies
2403 2403 --pop) to push back to the current patch afterwards, but skip
2404 2404 guarded patches.
2405 2405
2406 2406 Use -s/--series to print a list of all guards in the series file
2407 2407 (no other arguments needed). Use -v for more information.'''
2408 2408
2409 2409 q = repo.mq
2410 2410 guards = q.active()
2411 2411 if args or opts['none']:
2412 2412 old_unapplied = q.unapplied(repo)
2413 2413 old_guarded = [i for i in xrange(len(q.applied)) if
2414 2414 not q.pushable(i)[0]]
2415 2415 q.set_active(args)
2416 2416 q.save_dirty()
2417 2417 if not args:
2418 2418 ui.status(_('guards deactivated\n'))
2419 2419 if not opts['pop'] and not opts['reapply']:
2420 2420 unapplied = q.unapplied(repo)
2421 2421 guarded = [i for i in xrange(len(q.applied))
2422 2422 if not q.pushable(i)[0]]
2423 2423 if len(unapplied) != len(old_unapplied):
2424 2424 ui.status(_('number of unguarded, unapplied patches has '
2425 2425 'changed from %d to %d\n') %
2426 2426 (len(old_unapplied), len(unapplied)))
2427 2427 if len(guarded) != len(old_guarded):
2428 2428 ui.status(_('number of guarded, applied patches has changed '
2429 2429 'from %d to %d\n') %
2430 2430 (len(old_guarded), len(guarded)))
2431 2431 elif opts['series']:
2432 2432 guards = {}
2433 2433 noguards = 0
2434 2434 for gs in q.series_guards:
2435 2435 if not gs:
2436 2436 noguards += 1
2437 2437 for g in gs:
2438 2438 guards.setdefault(g, 0)
2439 2439 guards[g] += 1
2440 2440 if ui.verbose:
2441 2441 guards['NONE'] = noguards
2442 2442 guards = guards.items()
2443 2443 guards.sort(key=lambda x: x[0][1:])
2444 2444 if guards:
2445 2445 ui.note(_('guards in series file:\n'))
2446 2446 for guard, count in guards:
2447 2447 ui.note('%2d ' % count)
2448 2448 ui.write(guard, '\n')
2449 2449 else:
2450 2450 ui.note(_('no guards in series file\n'))
2451 2451 else:
2452 2452 if guards:
2453 2453 ui.note(_('active guards:\n'))
2454 2454 for g in guards:
2455 2455 ui.write(g, '\n')
2456 2456 else:
2457 2457 ui.write(_('no active guards\n'))
2458 2458 reapply = opts['reapply'] and q.applied and q.appliedname(-1)
2459 2459 popped = False
2460 2460 if opts['pop'] or opts['reapply']:
2461 2461 for i in xrange(len(q.applied)):
2462 2462 pushable, reason = q.pushable(i)
2463 2463 if not pushable:
2464 2464 ui.status(_('popping guarded patches\n'))
2465 2465 popped = True
2466 2466 if i == 0:
2467 2467 q.pop(repo, all=True)
2468 2468 else:
2469 2469 q.pop(repo, i - 1)
2470 2470 break
2471 2471 if popped:
2472 2472 try:
2473 2473 if reapply:
2474 2474 ui.status(_('reapplying unguarded patches\n'))
2475 2475 q.push(repo, reapply)
2476 2476 finally:
2477 2477 q.save_dirty()
2478 2478
2479 2479 def finish(ui, repo, *revrange, **opts):
2480 2480 """move applied patches into repository history
2481 2481
2482 2482 Finishes the specified revisions (corresponding to applied
2483 2483 patches) by moving them out of mq control into regular repository
2484 2484 history.
2485 2485
2486 2486 Accepts a revision range or the -a/--applied option. If --applied
2487 2487 is specified, all applied mq revisions are removed from mq
2488 2488 control. Otherwise, the given revisions must be at the base of the
2489 2489 stack of applied patches.
2490 2490
2491 2491 This can be especially useful if your changes have been applied to
2492 2492 an upstream repository, or if you are about to push your changes
2493 2493 to upstream.
2494 2494 """
2495 2495 if not opts['applied'] and not revrange:
2496 2496 raise util.Abort(_('no revisions specified'))
2497 2497 elif opts['applied']:
2498 2498 revrange = ('qbase:qtip',) + revrange
2499 2499
2500 2500 q = repo.mq
2501 2501 if not q.applied:
2502 2502 ui.status(_('no patches applied\n'))
2503 2503 return 0
2504 2504
2505 2505 revs = cmdutil.revrange(repo, revrange)
2506 2506 q.finish(repo, revs)
2507 2507 q.save_dirty()
2508 2508 return 0
2509 2509
2510 2510 def reposetup(ui, repo):
2511 2511 class mqrepo(repo.__class__):
2512 2512 @util.propertycache
2513 2513 def mq(self):
2514 2514 return queue(self.ui, self.join(""))
2515 2515
2516 2516 def abort_if_wdir_patched(self, errmsg, force=False):
2517 2517 if self.mq.applied and not force:
2518 2518 parent = self.dirstate.parents()[0]
2519 2519 if parent in [s.node for s in self.mq.applied]:
2520 2520 raise util.Abort(errmsg)
2521 2521
2522 2522 def commit(self, text="", user=None, date=None, match=None,
2523 2523 force=False, editor=False, extra={}):
2524 2524 self.abort_if_wdir_patched(
2525 2525 _('cannot commit over an applied mq patch'),
2526 2526 force)
2527 2527
2528 2528 return super(mqrepo, self).commit(text, user, date, match, force,
2529 2529 editor, extra)
2530 2530
2531 2531 def push(self, remote, force=False, revs=None):
2532 2532 if self.mq.applied and not force and not revs:
2533 2533 raise util.Abort(_('source has mq patches applied'))
2534 2534 return super(mqrepo, self).push(remote, force, revs)
2535 2535
2536 2536 def _findtags(self):
2537 2537 '''augment tags from base class with patch tags'''
2538 2538 result = super(mqrepo, self)._findtags()
2539 2539
2540 2540 q = self.mq
2541 2541 if not q.applied:
2542 2542 return result
2543 2543
2544 2544 mqtags = [(patch.node, patch.name) for patch in q.applied]
2545 2545
2546 2546 if mqtags[-1][0] not in self.changelog.nodemap:
2547 2547 self.ui.warn(_('mq status file refers to unknown node %s\n')
2548 2548 % short(mqtags[-1][0]))
2549 2549 return result
2550 2550
2551 2551 mqtags.append((mqtags[-1][0], 'qtip'))
2552 2552 mqtags.append((mqtags[0][0], 'qbase'))
2553 2553 mqtags.append((self.changelog.parents(mqtags[0][0])[0], 'qparent'))
2554 2554 tags = result[0]
2555 2555 for patch in mqtags:
2556 2556 if patch[1] in tags:
2557 2557 self.ui.warn(_('Tag %s overrides mq patch of the same name\n')
2558 2558 % patch[1])
2559 2559 else:
2560 2560 tags[patch[1]] = patch[0]
2561 2561
2562 2562 return result
2563 2563
2564 2564 def _branchtags(self, partial, lrev):
2565 2565 q = self.mq
2566 2566 if not q.applied:
2567 2567 return super(mqrepo, self)._branchtags(partial, lrev)
2568 2568
2569 2569 cl = self.changelog
2570 2570 qbasenode = q.applied[0].node
2571 2571 if qbasenode not in cl.nodemap:
2572 2572 self.ui.warn(_('mq status file refers to unknown node %s\n')
2573 2573 % short(qbasenode))
2574 2574 return super(mqrepo, self)._branchtags(partial, lrev)
2575 2575
2576 2576 qbase = cl.rev(qbasenode)
2577 2577 start = lrev + 1
2578 2578 if start < qbase:
2579 2579 # update the cache (excluding the patches) and save it
2580 self._updatebranchcache(partial, lrev + 1, qbase)
2580 ctxgen = (self[r] for r in xrange(lrev + 1, qbase))
2581 self._updatebranchcache(partial, ctxgen)
2581 2582 self._writebranchcache(partial, cl.node(qbase - 1), qbase - 1)
2582 2583 start = qbase
2583 2584 # if start = qbase, the cache is as updated as it should be.
2584 2585 # if start > qbase, the cache includes (part of) the patches.
2585 2586 # we might as well use it, but we won't save it.
2586 2587
2587 2588 # update the cache up to the tip
2588 self._updatebranchcache(partial, start, len(cl))
2589 ctxgen = (self[r] for r in xrange(start, len(cl)))
2590 self._updatebranchcache(partial, ctxgen)
2589 2591
2590 2592 return partial
2591 2593
2592 2594 if repo.local():
2593 2595 repo.__class__ = mqrepo
2594 2596
2595 2597 def mqimport(orig, ui, repo, *args, **kwargs):
2596 2598 if (hasattr(repo, 'abort_if_wdir_patched')
2597 2599 and not kwargs.get('no_commit', False)):
2598 2600 repo.abort_if_wdir_patched(_('cannot import over an applied patch'),
2599 2601 kwargs.get('force'))
2600 2602 return orig(ui, repo, *args, **kwargs)
2601 2603
2602 2604 def mqinit(orig, ui, *args, **kwargs):
2603 2605 mq = kwargs.pop('mq', None)
2604 2606
2605 2607 if not mq:
2606 2608 return orig(ui, *args, **kwargs)
2607 2609
2608 2610 if args:
2609 2611 repopath = args[0]
2610 2612 if not hg.islocal(repopath):
2611 2613 raise util.Abort(_('only a local queue repository '
2612 2614 'may be initialized'))
2613 2615 else:
2614 2616 repopath = cmdutil.findrepo(os.getcwd())
2615 2617 if not repopath:
2616 2618 raise util.Abort(_('There is no Mercurial repository here '
2617 2619 '(.hg not found)'))
2618 2620 repo = hg.repository(ui, repopath)
2619 2621 return qinit(ui, repo, True)
2620 2622
2621 2623 def mqcommand(orig, ui, repo, *args, **kwargs):
2622 2624 """Add --mq option to operate on patch repository instead of main"""
2623 2625
2624 2626 # some commands do not like getting unknown options
2625 2627 mq = kwargs.pop('mq', None)
2626 2628
2627 2629 if not mq:
2628 2630 return orig(ui, repo, *args, **kwargs)
2629 2631
2630 2632 q = repo.mq
2631 2633 r = q.qrepo()
2632 2634 if not r:
2633 2635 raise util.Abort('no queue repository')
2634 2636 return orig(r.ui, r, *args, **kwargs)
2635 2637
2636 2638 def uisetup(ui):
2637 2639 mqopt = [('', 'mq', None, _("operate on patch repository"))]
2638 2640
2639 2641 extensions.wrapcommand(commands.table, 'import', mqimport)
2640 2642
2641 2643 entry = extensions.wrapcommand(commands.table, 'init', mqinit)
2642 2644 entry[1].extend(mqopt)
2643 2645
2644 2646 for cmd in commands.table.keys():
2645 2647 cmd = cmdutil.parsealiases(cmd)[0]
2646 2648 if cmd in commands.norepo:
2647 2649 continue
2648 2650 entry = extensions.wrapcommand(commands.table, cmd, mqcommand)
2649 2651 entry[1].extend(mqopt)
2650 2652
2651 2653 seriesopts = [('s', 'summary', None, _('print first line of patch header'))]
2652 2654
2653 2655 cmdtable = {
2654 2656 "qapplied":
2655 2657 (applied,
2656 2658 [('1', 'last', None, _('show only the last patch'))] + seriesopts,
2657 2659 _('hg qapplied [-1] [-s] [PATCH]')),
2658 2660 "qclone":
2659 2661 (clone,
2660 2662 [('', 'pull', None, _('use pull protocol to copy metadata')),
2661 2663 ('U', 'noupdate', None, _('do not update the new working directories')),
2662 2664 ('', 'uncompressed', None,
2663 2665 _('use uncompressed transfer (fast over LAN)')),
2664 2666 ('p', 'patches', '', _('location of source patch repository')),
2665 2667 ] + commands.remoteopts,
2666 2668 _('hg qclone [OPTION]... SOURCE [DEST]')),
2667 2669 "qcommit|qci":
2668 2670 (commit,
2669 2671 commands.table["^commit|ci"][1],
2670 2672 _('hg qcommit [OPTION]... [FILE]...')),
2671 2673 "^qdiff":
2672 2674 (diff,
2673 2675 commands.diffopts + commands.diffopts2 + commands.walkopts,
2674 2676 _('hg qdiff [OPTION]... [FILE]...')),
2675 2677 "qdelete|qremove|qrm":
2676 2678 (delete,
2677 2679 [('k', 'keep', None, _('keep patch file')),
2678 2680 ('r', 'rev', [], _('stop managing a revision (DEPRECATED)'))],
2679 2681 _('hg qdelete [-k] [-r REV]... [PATCH]...')),
2680 2682 'qfold':
2681 2683 (fold,
2682 2684 [('e', 'edit', None, _('edit patch header')),
2683 2685 ('k', 'keep', None, _('keep folded patch files')),
2684 2686 ] + commands.commitopts,
2685 2687 _('hg qfold [-e] [-k] [-m TEXT] [-l FILE] PATCH...')),
2686 2688 'qgoto':
2687 2689 (goto,
2688 2690 [('f', 'force', None, _('overwrite any local changes'))],
2689 2691 _('hg qgoto [OPTION]... PATCH')),
2690 2692 'qguard':
2691 2693 (guard,
2692 2694 [('l', 'list', None, _('list all patches and guards')),
2693 2695 ('n', 'none', None, _('drop all guards'))],
2694 2696 _('hg qguard [-l] [-n] [PATCH] [-- [+GUARD]... [-GUARD]...]')),
2695 2697 'qheader': (header, [], _('hg qheader [PATCH]')),
2696 2698 "^qimport":
2697 2699 (qimport,
2698 2700 [('e', 'existing', None, _('import file in patch directory')),
2699 2701 ('n', 'name', '', _('name of patch file')),
2700 2702 ('f', 'force', None, _('overwrite existing files')),
2701 2703 ('r', 'rev', [], _('place existing revisions under mq control')),
2702 2704 ('g', 'git', None, _('use git extended diff format')),
2703 2705 ('P', 'push', None, _('qpush after importing'))],
2704 2706 _('hg qimport [-e] [-n NAME] [-f] [-g] [-P] [-r REV]... FILE...')),
2705 2707 "^qinit":
2706 2708 (init,
2707 2709 [('c', 'create-repo', None, _('create queue repository'))],
2708 2710 _('hg qinit [-c]')),
2709 2711 "qnew":
2710 2712 (new,
2711 2713 [('e', 'edit', None, _('edit commit message')),
2712 2714 ('f', 'force', None, _('import uncommitted changes (DEPRECATED)')),
2713 2715 ('g', 'git', None, _('use git extended diff format')),
2714 2716 ('U', 'currentuser', None, _('add "From: <current user>" to patch')),
2715 2717 ('u', 'user', '', _('add "From: <given user>" to patch')),
2716 2718 ('D', 'currentdate', None, _('add "Date: <current date>" to patch')),
2717 2719 ('d', 'date', '', _('add "Date: <given date>" to patch'))
2718 2720 ] + commands.walkopts + commands.commitopts,
2719 2721 _('hg qnew [-e] [-m TEXT] [-l FILE] [-f] PATCH [FILE]...')),
2720 2722 "qnext": (next, [] + seriesopts, _('hg qnext [-s]')),
2721 2723 "qprev": (prev, [] + seriesopts, _('hg qprev [-s]')),
2722 2724 "^qpop":
2723 2725 (pop,
2724 2726 [('a', 'all', None, _('pop all patches')),
2725 2727 ('n', 'name', '', _('queue name to pop (DEPRECATED)')),
2726 2728 ('f', 'force', None, _('forget any local changes to patched files'))],
2727 2729 _('hg qpop [-a] [-n NAME] [-f] [PATCH | INDEX]')),
2728 2730 "^qpush":
2729 2731 (push,
2730 2732 [('f', 'force', None, _('apply if the patch has rejects')),
2731 2733 ('l', 'list', None, _('list patch name in commit text')),
2732 2734 ('a', 'all', None, _('apply all patches')),
2733 2735 ('m', 'merge', None, _('merge from another queue (DEPRECATED)')),
2734 2736 ('n', 'name', '', _('merge queue name (DEPRECATED)'))],
2735 2737 _('hg qpush [-f] [-l] [-a] [-m] [-n NAME] [PATCH | INDEX]')),
2736 2738 "^qrefresh":
2737 2739 (refresh,
2738 2740 [('e', 'edit', None, _('edit commit message')),
2739 2741 ('g', 'git', None, _('use git extended diff format')),
2740 2742 ('s', 'short', None,
2741 2743 _('refresh only files already in the patch and specified files')),
2742 2744 ('U', 'currentuser', None,
2743 2745 _('add/update author field in patch with current user')),
2744 2746 ('u', 'user', '',
2745 2747 _('add/update author field in patch with given user')),
2746 2748 ('D', 'currentdate', None,
2747 2749 _('add/update date field in patch with current date')),
2748 2750 ('d', 'date', '',
2749 2751 _('add/update date field in patch with given date'))
2750 2752 ] + commands.walkopts + commands.commitopts,
2751 2753 _('hg qrefresh [-I] [-X] [-e] [-m TEXT] [-l FILE] [-s] [FILE]...')),
2752 2754 'qrename|qmv':
2753 2755 (rename, [], _('hg qrename PATCH1 [PATCH2]')),
2754 2756 "qrestore":
2755 2757 (restore,
2756 2758 [('d', 'delete', None, _('delete save entry')),
2757 2759 ('u', 'update', None, _('update queue working directory'))],
2758 2760 _('hg qrestore [-d] [-u] REV')),
2759 2761 "qsave":
2760 2762 (save,
2761 2763 [('c', 'copy', None, _('copy patch directory')),
2762 2764 ('n', 'name', '', _('copy directory name')),
2763 2765 ('e', 'empty', None, _('clear queue status file')),
2764 2766 ('f', 'force', None, _('force copy'))] + commands.commitopts,
2765 2767 _('hg qsave [-m TEXT] [-l FILE] [-c] [-n NAME] [-e] [-f]')),
2766 2768 "qselect":
2767 2769 (select,
2768 2770 [('n', 'none', None, _('disable all guards')),
2769 2771 ('s', 'series', None, _('list all guards in series file')),
2770 2772 ('', 'pop', None, _('pop to before first guarded applied patch')),
2771 2773 ('', 'reapply', None, _('pop, then reapply patches'))],
2772 2774 _('hg qselect [OPTION]... [GUARD]...')),
2773 2775 "qseries":
2774 2776 (series,
2775 2777 [('m', 'missing', None, _('print patches not in series')),
2776 2778 ] + seriesopts,
2777 2779 _('hg qseries [-ms]')),
2778 2780 "^strip":
2779 2781 (strip,
2780 2782 [('f', 'force', None, _('force removal with local changes')),
2781 2783 ('b', 'backup', None, _('bundle unrelated changesets')),
2782 2784 ('n', 'nobackup', None, _('no backups'))],
2783 2785 _('hg strip [-f] [-b] [-n] REV')),
2784 2786 "qtop": (top, [] + seriesopts, _('hg qtop [-s]')),
2785 2787 "qunapplied":
2786 2788 (unapplied,
2787 2789 [('1', 'first', None, _('show only the first patch'))] + seriesopts,
2788 2790 _('hg qunapplied [-1] [-s] [PATCH]')),
2789 2791 "qfinish":
2790 2792 (finish,
2791 2793 [('a', 'applied', None, _('finish all applied changesets'))],
2792 2794 _('hg qfinish [-a] [REV]...')),
2793 2795 }
@@ -1,2224 +1,2215
1 1 # localrepo.py - read/write repository class for mercurial
2 2 #
3 3 # Copyright 2005-2007 Matt Mackall <mpm@selenic.com>
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 node import bin, hex, nullid, nullrev, short
9 9 from i18n import _
10 10 import repo, changegroup, subrepo
11 11 import changelog, dirstate, filelog, manifest, context
12 12 import lock, transaction, store, encoding
13 13 import util, extensions, hook, error
14 14 import match as matchmod
15 15 import merge as mergemod
16 16 import tags as tagsmod
17 17 from lock import release
18 18 import weakref, stat, errno, os, time, inspect
19 19 propertycache = util.propertycache
20 20
21 21 class localrepository(repo.repository):
22 22 capabilities = set(('lookup', 'changegroupsubset', 'branchmap'))
23 23 supported = set('revlogv1 store fncache shared'.split())
24 24
25 25 def __init__(self, baseui, path=None, create=0):
26 26 repo.repository.__init__(self)
27 27 self.root = os.path.realpath(path)
28 28 self.path = os.path.join(self.root, ".hg")
29 29 self.origroot = path
30 30 self.opener = util.opener(self.path)
31 31 self.wopener = util.opener(self.root)
32 32 self.baseui = baseui
33 33 self.ui = baseui.copy()
34 34
35 35 try:
36 36 self.ui.readconfig(self.join("hgrc"), self.root)
37 37 extensions.loadall(self.ui)
38 38 except IOError:
39 39 pass
40 40
41 41 if not os.path.isdir(self.path):
42 42 if create:
43 43 if not os.path.exists(path):
44 44 os.mkdir(path)
45 45 os.mkdir(self.path)
46 46 requirements = ["revlogv1"]
47 47 if self.ui.configbool('format', 'usestore', True):
48 48 os.mkdir(os.path.join(self.path, "store"))
49 49 requirements.append("store")
50 50 if self.ui.configbool('format', 'usefncache', True):
51 51 requirements.append("fncache")
52 52 # create an invalid changelog
53 53 self.opener("00changelog.i", "a").write(
54 54 '\0\0\0\2' # represents revlogv2
55 55 ' dummy changelog to prevent using the old repo layout'
56 56 )
57 57 reqfile = self.opener("requires", "w")
58 58 for r in requirements:
59 59 reqfile.write("%s\n" % r)
60 60 reqfile.close()
61 61 else:
62 62 raise error.RepoError(_("repository %s not found") % path)
63 63 elif create:
64 64 raise error.RepoError(_("repository %s already exists") % path)
65 65 else:
66 66 # find requirements
67 67 requirements = set()
68 68 try:
69 69 requirements = set(self.opener("requires").read().splitlines())
70 70 except IOError, inst:
71 71 if inst.errno != errno.ENOENT:
72 72 raise
73 73 for r in requirements - self.supported:
74 74 raise error.RepoError(_("requirement '%s' not supported") % r)
75 75
76 76 self.sharedpath = self.path
77 77 try:
78 78 s = os.path.realpath(self.opener("sharedpath").read())
79 79 if not os.path.exists(s):
80 80 raise error.RepoError(
81 81 _('.hg/sharedpath points to nonexistent directory %s') % s)
82 82 self.sharedpath = s
83 83 except IOError, inst:
84 84 if inst.errno != errno.ENOENT:
85 85 raise
86 86
87 87 self.store = store.store(requirements, self.sharedpath, util.opener)
88 88 self.spath = self.store.path
89 89 self.sopener = self.store.opener
90 90 self.sjoin = self.store.join
91 91 self.opener.createmode = self.store.createmode
92 92 self.sopener.options = {}
93 93
94 94 # These two define the set of tags for this repository. _tags
95 95 # maps tag name to node; _tagtypes maps tag name to 'global' or
96 96 # 'local'. (Global tags are defined by .hgtags across all
97 97 # heads, and local tags are defined in .hg/localtags.) They
98 98 # constitute the in-memory cache of tags.
99 99 self._tags = None
100 100 self._tagtypes = None
101 101
102 102 self._branchcache = None # in UTF-8
103 103 self._branchcachetip = None
104 104 self.nodetagscache = None
105 105 self.filterpats = {}
106 106 self._datafilters = {}
107 107 self._transref = self._lockref = self._wlockref = None
108 108
109 109 @propertycache
110 110 def changelog(self):
111 111 c = changelog.changelog(self.sopener)
112 112 if 'HG_PENDING' in os.environ:
113 113 p = os.environ['HG_PENDING']
114 114 if p.startswith(self.root):
115 115 c.readpending('00changelog.i.a')
116 116 self.sopener.options['defversion'] = c.version
117 117 return c
118 118
119 119 @propertycache
120 120 def manifest(self):
121 121 return manifest.manifest(self.sopener)
122 122
123 123 @propertycache
124 124 def dirstate(self):
125 125 return dirstate.dirstate(self.opener, self.ui, self.root)
126 126
127 127 def __getitem__(self, changeid):
128 128 if changeid is None:
129 129 return context.workingctx(self)
130 130 return context.changectx(self, changeid)
131 131
132 132 def __contains__(self, changeid):
133 133 try:
134 134 return bool(self.lookup(changeid))
135 135 except error.RepoLookupError:
136 136 return False
137 137
138 138 def __nonzero__(self):
139 139 return True
140 140
141 141 def __len__(self):
142 142 return len(self.changelog)
143 143
144 144 def __iter__(self):
145 145 for i in xrange(len(self)):
146 146 yield i
147 147
148 148 def url(self):
149 149 return 'file:' + self.root
150 150
151 151 def hook(self, name, throw=False, **args):
152 152 return hook.hook(self.ui, self, name, throw, **args)
153 153
154 154 tag_disallowed = ':\r\n'
155 155
156 156 def _tag(self, names, node, message, local, user, date, extra={}):
157 157 if isinstance(names, str):
158 158 allchars = names
159 159 names = (names,)
160 160 else:
161 161 allchars = ''.join(names)
162 162 for c in self.tag_disallowed:
163 163 if c in allchars:
164 164 raise util.Abort(_('%r cannot be used in a tag name') % c)
165 165
166 166 for name in names:
167 167 self.hook('pretag', throw=True, node=hex(node), tag=name,
168 168 local=local)
169 169
170 170 def writetags(fp, names, munge, prevtags):
171 171 fp.seek(0, 2)
172 172 if prevtags and prevtags[-1] != '\n':
173 173 fp.write('\n')
174 174 for name in names:
175 175 m = munge and munge(name) or name
176 176 if self._tagtypes and name in self._tagtypes:
177 177 old = self._tags.get(name, nullid)
178 178 fp.write('%s %s\n' % (hex(old), m))
179 179 fp.write('%s %s\n' % (hex(node), m))
180 180 fp.close()
181 181
182 182 prevtags = ''
183 183 if local:
184 184 try:
185 185 fp = self.opener('localtags', 'r+')
186 186 except IOError:
187 187 fp = self.opener('localtags', 'a')
188 188 else:
189 189 prevtags = fp.read()
190 190
191 191 # local tags are stored in the current charset
192 192 writetags(fp, names, None, prevtags)
193 193 for name in names:
194 194 self.hook('tag', node=hex(node), tag=name, local=local)
195 195 return
196 196
197 197 try:
198 198 fp = self.wfile('.hgtags', 'rb+')
199 199 except IOError:
200 200 fp = self.wfile('.hgtags', 'ab')
201 201 else:
202 202 prevtags = fp.read()
203 203
204 204 # committed tags are stored in UTF-8
205 205 writetags(fp, names, encoding.fromlocal, prevtags)
206 206
207 207 if '.hgtags' not in self.dirstate:
208 208 self.add(['.hgtags'])
209 209
210 210 m = matchmod.exact(self.root, '', ['.hgtags'])
211 211 tagnode = self.commit(message, user, date, extra=extra, match=m)
212 212
213 213 for name in names:
214 214 self.hook('tag', node=hex(node), tag=name, local=local)
215 215
216 216 return tagnode
217 217
218 218 def tag(self, names, node, message, local, user, date):
219 219 '''tag a revision with one or more symbolic names.
220 220
221 221 names is a list of strings or, when adding a single tag, names may be a
222 222 string.
223 223
224 224 if local is True, the tags are stored in a per-repository file.
225 225 otherwise, they are stored in the .hgtags file, and a new
226 226 changeset is committed with the change.
227 227
228 228 keyword arguments:
229 229
230 230 local: whether to store tags in non-version-controlled file
231 231 (default False)
232 232
233 233 message: commit message to use if committing
234 234
235 235 user: name of user to use if committing
236 236
237 237 date: date tuple to use if committing'''
238 238
239 239 for x in self.status()[:5]:
240 240 if '.hgtags' in x:
241 241 raise util.Abort(_('working copy of .hgtags is changed '
242 242 '(please commit .hgtags manually)'))
243 243
244 244 self.tags() # instantiate the cache
245 245 self._tag(names, node, message, local, user, date)
246 246
247 247 def tags(self):
248 248 '''return a mapping of tag to node'''
249 249 if self._tags is None:
250 250 (self._tags, self._tagtypes) = self._findtags()
251 251
252 252 return self._tags
253 253
254 254 def _findtags(self):
255 255 '''Do the hard work of finding tags. Return a pair of dicts
256 256 (tags, tagtypes) where tags maps tag name to node, and tagtypes
257 257 maps tag name to a string like \'global\' or \'local\'.
258 258 Subclasses or extensions are free to add their own tags, but
259 259 should be aware that the returned dicts will be retained for the
260 260 duration of the localrepo object.'''
261 261
262 262 # XXX what tagtype should subclasses/extensions use? Currently
263 263 # mq and bookmarks add tags, but do not set the tagtype at all.
264 264 # Should each extension invent its own tag type? Should there
265 265 # be one tagtype for all such "virtual" tags? Or is the status
266 266 # quo fine?
267 267
268 268 alltags = {} # map tag name to (node, hist)
269 269 tagtypes = {}
270 270
271 271 tagsmod.findglobaltags(self.ui, self, alltags, tagtypes)
272 272 tagsmod.readlocaltags(self.ui, self, alltags, tagtypes)
273 273
274 274 # Build the return dicts. Have to re-encode tag names because
275 275 # the tags module always uses UTF-8 (in order not to lose info
276 276 # writing to the cache), but the rest of Mercurial wants them in
277 277 # local encoding.
278 278 tags = {}
279 279 for (name, (node, hist)) in alltags.iteritems():
280 280 if node != nullid:
281 281 tags[encoding.tolocal(name)] = node
282 282 tags['tip'] = self.changelog.tip()
283 283 tagtypes = dict([(encoding.tolocal(name), value)
284 284 for (name, value) in tagtypes.iteritems()])
285 285 return (tags, tagtypes)
286 286
287 287 def tagtype(self, tagname):
288 288 '''
289 289 return the type of the given tag. result can be:
290 290
291 291 'local' : a local tag
292 292 'global' : a global tag
293 293 None : tag does not exist
294 294 '''
295 295
296 296 self.tags()
297 297
298 298 return self._tagtypes.get(tagname)
299 299
300 300 def tagslist(self):
301 301 '''return a list of tags ordered by revision'''
302 302 l = []
303 303 for t, n in self.tags().iteritems():
304 304 try:
305 305 r = self.changelog.rev(n)
306 306 except:
307 307 r = -2 # sort to the beginning of the list if unknown
308 308 l.append((r, t, n))
309 309 return [(t, n) for r, t, n in sorted(l)]
310 310
311 311 def nodetags(self, node):
312 312 '''return the tags associated with a node'''
313 313 if not self.nodetagscache:
314 314 self.nodetagscache = {}
315 315 for t, n in self.tags().iteritems():
316 316 self.nodetagscache.setdefault(n, []).append(t)
317 317 return self.nodetagscache.get(node, [])
318 318
319 319 def _branchtags(self, partial, lrev):
320 320 # TODO: rename this function?
321 321 tiprev = len(self) - 1
322 322 if lrev != tiprev:
323 self._updatebranchcache(partial, lrev + 1, tiprev + 1)
323 ctxgen = (self[r] for r in xrange(lrev + 1, tiprev + 1))
324 self._updatebranchcache(partial, ctxgen)
324 325 self._writebranchcache(partial, self.changelog.tip(), tiprev)
325 326
326 327 return partial
327 328
328 329 def branchmap(self):
329 330 '''returns a dictionary {branch: [branchheads]}'''
330 331 tip = self.changelog.tip()
331 332 if self._branchcache is not None and self._branchcachetip == tip:
332 333 return self._branchcache
333 334
334 335 oldtip = self._branchcachetip
335 336 self._branchcachetip = tip
336 337 if oldtip is None or oldtip not in self.changelog.nodemap:
337 338 partial, last, lrev = self._readbranchcache()
338 339 else:
339 340 lrev = self.changelog.rev(oldtip)
340 341 partial = self._branchcache
341 342
342 343 self._branchtags(partial, lrev)
343 344 # this private cache holds all heads (not just tips)
344 345 self._branchcache = partial
345 346
346 347 return self._branchcache
347 348
348 349 def branchtags(self):
349 350 '''return a dict where branch names map to the tipmost head of
350 351 the branch, open heads come before closed'''
351 352 bt = {}
352 353 for bn, heads in self.branchmap().iteritems():
353 354 tip = heads[-1]
354 355 for h in reversed(heads):
355 356 if 'close' not in self.changelog.read(h)[5]:
356 357 tip = h
357 358 break
358 359 bt[bn] = tip
359 360 return bt
360 361
361 362
362 363 def _readbranchcache(self):
363 364 partial = {}
364 365 try:
365 366 f = self.opener("branchheads.cache")
366 367 lines = f.read().split('\n')
367 368 f.close()
368 369 except (IOError, OSError):
369 370 return {}, nullid, nullrev
370 371
371 372 try:
372 373 last, lrev = lines.pop(0).split(" ", 1)
373 374 last, lrev = bin(last), int(lrev)
374 375 if lrev >= len(self) or self[lrev].node() != last:
375 376 # invalidate the cache
376 377 raise ValueError('invalidating branch cache (tip differs)')
377 378 for l in lines:
378 379 if not l:
379 380 continue
380 381 node, label = l.split(" ", 1)
381 382 partial.setdefault(label.strip(), []).append(bin(node))
382 383 except KeyboardInterrupt:
383 384 raise
384 385 except Exception, inst:
385 386 if self.ui.debugflag:
386 387 self.ui.warn(str(inst), '\n')
387 388 partial, last, lrev = {}, nullid, nullrev
388 389 return partial, last, lrev
389 390
390 391 def _writebranchcache(self, branches, tip, tiprev):
391 392 try:
392 393 f = self.opener("branchheads.cache", "w", atomictemp=True)
393 394 f.write("%s %s\n" % (hex(tip), tiprev))
394 395 for label, nodes in branches.iteritems():
395 396 for node in nodes:
396 397 f.write("%s %s\n" % (hex(node), label))
397 398 f.rename()
398 399 except (IOError, OSError):
399 400 pass
400 401
401 def _updatebranchcache(self, partial, start, end):
402 def _updatebranchcache(self, partial, ctxgen):
402 403 # collect new branch entries
403 404 newbranches = {}
404 for r in xrange(start, end):
405 c = self[r]
405 for c in ctxgen:
406 406 newbranches.setdefault(c.branch(), []).append(c.node())
407 407 # if older branchheads are reachable from new ones, they aren't
408 408 # really branchheads. Note checking parents is insufficient:
409 409 # 1 (branch a) -> 2 (branch b) -> 3 (branch a)
410 410 for branch, newnodes in newbranches.iteritems():
411 411 bheads = partial.setdefault(branch, [])
412 412 bheads.extend(newnodes)
413 413 if len(bheads) < 2:
414 414 continue
415 415 newbheads = []
416 416 # starting from tip means fewer passes over reachable
417 417 while newnodes:
418 418 latest = newnodes.pop()
419 419 if latest not in bheads:
420 420 continue
421 421 minbhrev = self[min([self[bh].rev() for bh in bheads])].node()
422 422 reachable = self.changelog.reachable(latest, minbhrev)
423 423 bheads = [b for b in bheads if b not in reachable]
424 424 newbheads.insert(0, latest)
425 425 bheads.extend(newbheads)
426 426 partial[branch] = bheads
427 427
428 428 def lookup(self, key):
429 429 if isinstance(key, int):
430 430 return self.changelog.node(key)
431 431 elif key == '.':
432 432 return self.dirstate.parents()[0]
433 433 elif key == 'null':
434 434 return nullid
435 435 elif key == 'tip':
436 436 return self.changelog.tip()
437 437 n = self.changelog._match(key)
438 438 if n:
439 439 return n
440 440 if key in self.tags():
441 441 return self.tags()[key]
442 442 if key in self.branchtags():
443 443 return self.branchtags()[key]
444 444 n = self.changelog._partialmatch(key)
445 445 if n:
446 446 return n
447 447
448 448 # can't find key, check if it might have come from damaged dirstate
449 449 if key in self.dirstate.parents():
450 450 raise error.Abort(_("working directory has unknown parent '%s'!")
451 451 % short(key))
452 452 try:
453 453 if len(key) == 20:
454 454 key = hex(key)
455 455 except:
456 456 pass
457 457 raise error.RepoLookupError(_("unknown revision '%s'") % key)
458 458
459 459 def local(self):
460 460 return True
461 461
462 462 def join(self, f):
463 463 return os.path.join(self.path, f)
464 464
465 465 def wjoin(self, f):
466 466 return os.path.join(self.root, f)
467 467
468 468 def rjoin(self, f):
469 469 return os.path.join(self.root, util.pconvert(f))
470 470
471 471 def file(self, f):
472 472 if f[0] == '/':
473 473 f = f[1:]
474 474 return filelog.filelog(self.sopener, f)
475 475
476 476 def changectx(self, changeid):
477 477 return self[changeid]
478 478
479 479 def parents(self, changeid=None):
480 480 '''get list of changectxs for parents of changeid'''
481 481 return self[changeid].parents()
482 482
483 483 def filectx(self, path, changeid=None, fileid=None):
484 484 """changeid can be a changeset revision, node, or tag.
485 485 fileid can be a file revision or node."""
486 486 return context.filectx(self, path, changeid, fileid)
487 487
488 488 def getcwd(self):
489 489 return self.dirstate.getcwd()
490 490
491 491 def pathto(self, f, cwd=None):
492 492 return self.dirstate.pathto(f, cwd)
493 493
494 494 def wfile(self, f, mode='r'):
495 495 return self.wopener(f, mode)
496 496
497 497 def _link(self, f):
498 498 return os.path.islink(self.wjoin(f))
499 499
500 500 def _filter(self, filter, filename, data):
501 501 if filter not in self.filterpats:
502 502 l = []
503 503 for pat, cmd in self.ui.configitems(filter):
504 504 if cmd == '!':
505 505 continue
506 506 mf = matchmod.match(self.root, '', [pat])
507 507 fn = None
508 508 params = cmd
509 509 for name, filterfn in self._datafilters.iteritems():
510 510 if cmd.startswith(name):
511 511 fn = filterfn
512 512 params = cmd[len(name):].lstrip()
513 513 break
514 514 if not fn:
515 515 fn = lambda s, c, **kwargs: util.filter(s, c)
516 516 # Wrap old filters not supporting keyword arguments
517 517 if not inspect.getargspec(fn)[2]:
518 518 oldfn = fn
519 519 fn = lambda s, c, **kwargs: oldfn(s, c)
520 520 l.append((mf, fn, params))
521 521 self.filterpats[filter] = l
522 522
523 523 for mf, fn, cmd in self.filterpats[filter]:
524 524 if mf(filename):
525 525 self.ui.debug("filtering %s through %s\n" % (filename, cmd))
526 526 data = fn(data, cmd, ui=self.ui, repo=self, filename=filename)
527 527 break
528 528
529 529 return data
530 530
531 531 def adddatafilter(self, name, filter):
532 532 self._datafilters[name] = filter
533 533
534 534 def wread(self, filename):
535 535 if self._link(filename):
536 536 data = os.readlink(self.wjoin(filename))
537 537 else:
538 538 data = self.wopener(filename, 'r').read()
539 539 return self._filter("encode", filename, data)
540 540
541 541 def wwrite(self, filename, data, flags):
542 542 data = self._filter("decode", filename, data)
543 543 try:
544 544 os.unlink(self.wjoin(filename))
545 545 except OSError:
546 546 pass
547 547 if 'l' in flags:
548 548 self.wopener.symlink(data, filename)
549 549 else:
550 550 self.wopener(filename, 'w').write(data)
551 551 if 'x' in flags:
552 552 util.set_flags(self.wjoin(filename), False, True)
553 553
554 554 def wwritedata(self, filename, data):
555 555 return self._filter("decode", filename, data)
556 556
557 557 def transaction(self):
558 558 tr = self._transref and self._transref() or None
559 559 if tr and tr.running():
560 560 return tr.nest()
561 561
562 562 # abort here if the journal already exists
563 563 if os.path.exists(self.sjoin("journal")):
564 564 raise error.RepoError(
565 565 _("abandoned transaction found - run hg recover"))
566 566
567 567 # save dirstate for rollback
568 568 try:
569 569 ds = self.opener("dirstate").read()
570 570 except IOError:
571 571 ds = ""
572 572 self.opener("journal.dirstate", "w").write(ds)
573 573 self.opener("journal.branch", "w").write(self.dirstate.branch())
574 574
575 575 renames = [(self.sjoin("journal"), self.sjoin("undo")),
576 576 (self.join("journal.dirstate"), self.join("undo.dirstate")),
577 577 (self.join("journal.branch"), self.join("undo.branch"))]
578 578 tr = transaction.transaction(self.ui.warn, self.sopener,
579 579 self.sjoin("journal"),
580 580 aftertrans(renames),
581 581 self.store.createmode)
582 582 self._transref = weakref.ref(tr)
583 583 return tr
584 584
585 585 def recover(self):
586 586 lock = self.lock()
587 587 try:
588 588 if os.path.exists(self.sjoin("journal")):
589 589 self.ui.status(_("rolling back interrupted transaction\n"))
590 590 transaction.rollback(self.sopener, self.sjoin("journal"),
591 591 self.ui.warn)
592 592 self.invalidate()
593 593 return True
594 594 else:
595 595 self.ui.warn(_("no interrupted transaction available\n"))
596 596 return False
597 597 finally:
598 598 lock.release()
599 599
600 600 def rollback(self):
601 601 wlock = lock = None
602 602 try:
603 603 wlock = self.wlock()
604 604 lock = self.lock()
605 605 if os.path.exists(self.sjoin("undo")):
606 606 self.ui.status(_("rolling back last transaction\n"))
607 607 transaction.rollback(self.sopener, self.sjoin("undo"),
608 608 self.ui.warn)
609 609 util.rename(self.join("undo.dirstate"), self.join("dirstate"))
610 610 try:
611 611 branch = self.opener("undo.branch").read()
612 612 self.dirstate.setbranch(branch)
613 613 except IOError:
614 614 self.ui.warn(_("Named branch could not be reset, "
615 615 "current branch still is: %s\n")
616 616 % encoding.tolocal(self.dirstate.branch()))
617 617 self.invalidate()
618 618 self.dirstate.invalidate()
619 619 self.destroyed()
620 620 else:
621 621 self.ui.warn(_("no rollback information available\n"))
622 622 finally:
623 623 release(lock, wlock)
624 624
625 625 def invalidatecaches(self):
626 626 self._tags = None
627 627 self._tagtypes = None
628 628 self.nodetagscache = None
629 629 self._branchcache = None # in UTF-8
630 630 self._branchcachetip = None
631 631
632 632 def invalidate(self):
633 633 for a in "changelog manifest".split():
634 634 if a in self.__dict__:
635 635 delattr(self, a)
636 636 self.invalidatecaches()
637 637
638 638 def _lock(self, lockname, wait, releasefn, acquirefn, desc):
639 639 try:
640 640 l = lock.lock(lockname, 0, releasefn, desc=desc)
641 641 except error.LockHeld, inst:
642 642 if not wait:
643 643 raise
644 644 self.ui.warn(_("waiting for lock on %s held by %r\n") %
645 645 (desc, inst.locker))
646 646 # default to 600 seconds timeout
647 647 l = lock.lock(lockname, int(self.ui.config("ui", "timeout", "600")),
648 648 releasefn, desc=desc)
649 649 if acquirefn:
650 650 acquirefn()
651 651 return l
652 652
653 653 def lock(self, wait=True):
654 654 '''Lock the repository store (.hg/store) and return a weak reference
655 655 to the lock. Use this before modifying the store (e.g. committing or
656 656 stripping). If you are opening a transaction, get a lock as well.)'''
657 657 l = self._lockref and self._lockref()
658 658 if l is not None and l.held:
659 659 l.lock()
660 660 return l
661 661
662 662 l = self._lock(self.sjoin("lock"), wait, None, self.invalidate,
663 663 _('repository %s') % self.origroot)
664 664 self._lockref = weakref.ref(l)
665 665 return l
666 666
667 667 def wlock(self, wait=True):
668 668 '''Lock the non-store parts of the repository (everything under
669 669 .hg except .hg/store) and return a weak reference to the lock.
670 670 Use this before modifying files in .hg.'''
671 671 l = self._wlockref and self._wlockref()
672 672 if l is not None and l.held:
673 673 l.lock()
674 674 return l
675 675
676 676 l = self._lock(self.join("wlock"), wait, self.dirstate.write,
677 677 self.dirstate.invalidate, _('working directory of %s') %
678 678 self.origroot)
679 679 self._wlockref = weakref.ref(l)
680 680 return l
681 681
682 682 def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist):
683 683 """
684 684 commit an individual file as part of a larger transaction
685 685 """
686 686
687 687 fname = fctx.path()
688 688 text = fctx.data()
689 689 flog = self.file(fname)
690 690 fparent1 = manifest1.get(fname, nullid)
691 691 fparent2 = fparent2o = manifest2.get(fname, nullid)
692 692
693 693 meta = {}
694 694 copy = fctx.renamed()
695 695 if copy and copy[0] != fname:
696 696 # Mark the new revision of this file as a copy of another
697 697 # file. This copy data will effectively act as a parent
698 698 # of this new revision. If this is a merge, the first
699 699 # parent will be the nullid (meaning "look up the copy data")
700 700 # and the second one will be the other parent. For example:
701 701 #
702 702 # 0 --- 1 --- 3 rev1 changes file foo
703 703 # \ / rev2 renames foo to bar and changes it
704 704 # \- 2 -/ rev3 should have bar with all changes and
705 705 # should record that bar descends from
706 706 # bar in rev2 and foo in rev1
707 707 #
708 708 # this allows this merge to succeed:
709 709 #
710 710 # 0 --- 1 --- 3 rev4 reverts the content change from rev2
711 711 # \ / merging rev3 and rev4 should use bar@rev2
712 712 # \- 2 --- 4 as the merge base
713 713 #
714 714
715 715 cfname = copy[0]
716 716 crev = manifest1.get(cfname)
717 717 newfparent = fparent2
718 718
719 719 if manifest2: # branch merge
720 720 if fparent2 == nullid or crev is None: # copied on remote side
721 721 if cfname in manifest2:
722 722 crev = manifest2[cfname]
723 723 newfparent = fparent1
724 724
725 725 # find source in nearest ancestor if we've lost track
726 726 if not crev:
727 727 self.ui.debug(" %s: searching for copy revision for %s\n" %
728 728 (fname, cfname))
729 729 for ancestor in self['.'].ancestors():
730 730 if cfname in ancestor:
731 731 crev = ancestor[cfname].filenode()
732 732 break
733 733
734 734 self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(crev)))
735 735 meta["copy"] = cfname
736 736 meta["copyrev"] = hex(crev)
737 737 fparent1, fparent2 = nullid, newfparent
738 738 elif fparent2 != nullid:
739 739 # is one parent an ancestor of the other?
740 740 fparentancestor = flog.ancestor(fparent1, fparent2)
741 741 if fparentancestor == fparent1:
742 742 fparent1, fparent2 = fparent2, nullid
743 743 elif fparentancestor == fparent2:
744 744 fparent2 = nullid
745 745
746 746 # is the file changed?
747 747 if fparent2 != nullid or flog.cmp(fparent1, text) or meta:
748 748 changelist.append(fname)
749 749 return flog.add(text, meta, tr, linkrev, fparent1, fparent2)
750 750
751 751 # are just the flags changed during merge?
752 752 if fparent1 != fparent2o and manifest1.flags(fname) != fctx.flags():
753 753 changelist.append(fname)
754 754
755 755 return fparent1
756 756
757 757 def commit(self, text="", user=None, date=None, match=None, force=False,
758 758 editor=False, extra={}):
759 759 """Add a new revision to current repository.
760 760
761 761 Revision information is gathered from the working directory,
762 762 match can be used to filter the committed files. If editor is
763 763 supplied, it is called to get a commit message.
764 764 """
765 765
766 766 def fail(f, msg):
767 767 raise util.Abort('%s: %s' % (f, msg))
768 768
769 769 if not match:
770 770 match = matchmod.always(self.root, '')
771 771
772 772 if not force:
773 773 vdirs = []
774 774 match.dir = vdirs.append
775 775 match.bad = fail
776 776
777 777 wlock = self.wlock()
778 778 try:
779 779 p1, p2 = self.dirstate.parents()
780 780 wctx = self[None]
781 781
782 782 if (not force and p2 != nullid and match and
783 783 (match.files() or match.anypats())):
784 784 raise util.Abort(_('cannot partially commit a merge '
785 785 '(do not specify files or patterns)'))
786 786
787 787 changes = self.status(match=match, clean=force)
788 788 if force:
789 789 changes[0].extend(changes[6]) # mq may commit unchanged files
790 790
791 791 # check subrepos
792 792 subs = []
793 793 removedsubs = set()
794 794 for p in wctx.parents():
795 795 removedsubs.update(s for s in p.substate if match(s))
796 796 for s in wctx.substate:
797 797 removedsubs.discard(s)
798 798 if match(s) and wctx.sub(s).dirty():
799 799 subs.append(s)
800 800 if (subs or removedsubs) and '.hgsubstate' not in changes[0]:
801 801 changes[0].insert(0, '.hgsubstate')
802 802
803 803 # make sure all explicit patterns are matched
804 804 if not force and match.files():
805 805 matched = set(changes[0] + changes[1] + changes[2])
806 806
807 807 for f in match.files():
808 808 if f == '.' or f in matched or f in wctx.substate:
809 809 continue
810 810 if f in changes[3]: # missing
811 811 fail(f, _('file not found!'))
812 812 if f in vdirs: # visited directory
813 813 d = f + '/'
814 814 for mf in matched:
815 815 if mf.startswith(d):
816 816 break
817 817 else:
818 818 fail(f, _("no match under directory!"))
819 819 elif f not in self.dirstate:
820 820 fail(f, _("file not tracked!"))
821 821
822 822 if (not force and not extra.get("close") and p2 == nullid
823 823 and not (changes[0] or changes[1] or changes[2])
824 824 and self[None].branch() == self['.'].branch()):
825 825 return None
826 826
827 827 ms = mergemod.mergestate(self)
828 828 for f in changes[0]:
829 829 if f in ms and ms[f] == 'u':
830 830 raise util.Abort(_("unresolved merge conflicts "
831 831 "(see hg resolve)"))
832 832
833 833 cctx = context.workingctx(self, (p1, p2), text, user, date,
834 834 extra, changes)
835 835 if editor:
836 836 cctx._text = editor(self, cctx, subs)
837 837 edited = (text != cctx._text)
838 838
839 839 # commit subs
840 840 if subs or removedsubs:
841 841 state = wctx.substate.copy()
842 842 for s in subs:
843 843 self.ui.status(_('committing subrepository %s\n') % s)
844 844 sr = wctx.sub(s).commit(cctx._text, user, date)
845 845 state[s] = (state[s][0], sr)
846 846 subrepo.writestate(self, state)
847 847
848 848 # Save commit message in case this transaction gets rolled back
849 849 # (e.g. by a pretxncommit hook). Leave the content alone on
850 850 # the assumption that the user will use the same editor again.
851 851 msgfile = self.opener('last-message.txt', 'wb')
852 852 msgfile.write(cctx._text)
853 853 msgfile.close()
854 854
855 855 try:
856 856 hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or '')
857 857 self.hook("precommit", throw=True, parent1=hookp1, parent2=hookp2)
858 858 ret = self.commitctx(cctx, True)
859 859 except:
860 860 if edited:
861 861 msgfn = self.pathto(msgfile.name[len(self.root)+1:])
862 862 self.ui.write(
863 863 _('note: commit message saved in %s\n') % msgfn)
864 864 raise
865 865
866 866 # update dirstate and mergestate
867 867 for f in changes[0] + changes[1]:
868 868 self.dirstate.normal(f)
869 869 for f in changes[2]:
870 870 self.dirstate.forget(f)
871 871 self.dirstate.setparents(ret)
872 872 ms.reset()
873 873 finally:
874 874 wlock.release()
875 875
876 876 self.hook("commit", node=hex(ret), parent1=hookp1, parent2=hookp2)
877 877 return ret
878 878
879 879 def commitctx(self, ctx, error=False):
880 880 """Add a new revision to current repository.
881 881 Revision information is passed via the context argument.
882 882 """
883 883
884 884 tr = lock = None
885 885 removed = ctx.removed()
886 886 p1, p2 = ctx.p1(), ctx.p2()
887 887 m1 = p1.manifest().copy()
888 888 m2 = p2.manifest()
889 889 user = ctx.user()
890 890
891 891 lock = self.lock()
892 892 try:
893 893 tr = self.transaction()
894 894 trp = weakref.proxy(tr)
895 895
896 896 # check in files
897 897 new = {}
898 898 changed = []
899 899 linkrev = len(self)
900 900 for f in sorted(ctx.modified() + ctx.added()):
901 901 self.ui.note(f + "\n")
902 902 try:
903 903 fctx = ctx[f]
904 904 new[f] = self._filecommit(fctx, m1, m2, linkrev, trp,
905 905 changed)
906 906 m1.set(f, fctx.flags())
907 907 except OSError, inst:
908 908 self.ui.warn(_("trouble committing %s!\n") % f)
909 909 raise
910 910 except IOError, inst:
911 911 errcode = getattr(inst, 'errno', errno.ENOENT)
912 912 if error or errcode and errcode != errno.ENOENT:
913 913 self.ui.warn(_("trouble committing %s!\n") % f)
914 914 raise
915 915 else:
916 916 removed.append(f)
917 917
918 918 # update manifest
919 919 m1.update(new)
920 920 removed = [f for f in sorted(removed) if f in m1 or f in m2]
921 921 drop = [f for f in removed if f in m1]
922 922 for f in drop:
923 923 del m1[f]
924 924 mn = self.manifest.add(m1, trp, linkrev, p1.manifestnode(),
925 925 p2.manifestnode(), (new, drop))
926 926
927 927 # update changelog
928 928 self.changelog.delayupdate()
929 929 n = self.changelog.add(mn, changed + removed, ctx.description(),
930 930 trp, p1.node(), p2.node(),
931 931 user, ctx.date(), ctx.extra().copy())
932 932 p = lambda: self.changelog.writepending() and self.root or ""
933 933 xp1, xp2 = p1.hex(), p2 and p2.hex() or ''
934 934 self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1,
935 935 parent2=xp2, pending=p)
936 936 self.changelog.finalize(trp)
937 937 tr.close()
938 938
939 939 if self._branchcache:
940 940 self.branchtags()
941 941 return n
942 942 finally:
943 943 del tr
944 944 lock.release()
945 945
946 946 def destroyed(self):
947 947 '''Inform the repository that nodes have been destroyed.
948 948 Intended for use by strip and rollback, so there's a common
949 949 place for anything that has to be done after destroying history.'''
950 950 # XXX it might be nice if we could take the list of destroyed
951 951 # nodes, but I don't see an easy way for rollback() to do that
952 952
953 953 # Ensure the persistent tag cache is updated. Doing it now
954 954 # means that the tag cache only has to worry about destroyed
955 955 # heads immediately after a strip/rollback. That in turn
956 956 # guarantees that "cachetip == currenttip" (comparing both rev
957 957 # and node) always means no nodes have been added or destroyed.
958 958
959 959 # XXX this is suboptimal when qrefresh'ing: we strip the current
960 960 # head, refresh the tag cache, then immediately add a new head.
961 961 # But I think doing it this way is necessary for the "instant
962 962 # tag cache retrieval" case to work.
963 963 self.invalidatecaches()
964 964
965 965 def walk(self, match, node=None):
966 966 '''
967 967 walk recursively through the directory tree or a given
968 968 changeset, finding all files matched by the match
969 969 function
970 970 '''
971 971 return self[node].walk(match)
972 972
973 973 def status(self, node1='.', node2=None, match=None,
974 974 ignored=False, clean=False, unknown=False):
975 975 """return status of files between two nodes or node and working directory
976 976
977 977 If node1 is None, use the first dirstate parent instead.
978 978 If node2 is None, compare node1 with working directory.
979 979 """
980 980
981 981 def mfmatches(ctx):
982 982 mf = ctx.manifest().copy()
983 983 for fn in mf.keys():
984 984 if not match(fn):
985 985 del mf[fn]
986 986 return mf
987 987
988 988 if isinstance(node1, context.changectx):
989 989 ctx1 = node1
990 990 else:
991 991 ctx1 = self[node1]
992 992 if isinstance(node2, context.changectx):
993 993 ctx2 = node2
994 994 else:
995 995 ctx2 = self[node2]
996 996
997 997 working = ctx2.rev() is None
998 998 parentworking = working and ctx1 == self['.']
999 999 match = match or matchmod.always(self.root, self.getcwd())
1000 1000 listignored, listclean, listunknown = ignored, clean, unknown
1001 1001
1002 1002 # load earliest manifest first for caching reasons
1003 1003 if not working and ctx2.rev() < ctx1.rev():
1004 1004 ctx2.manifest()
1005 1005
1006 1006 if not parentworking:
1007 1007 def bad(f, msg):
1008 1008 if f not in ctx1:
1009 1009 self.ui.warn('%s: %s\n' % (self.dirstate.pathto(f), msg))
1010 1010 match.bad = bad
1011 1011
1012 1012 if working: # we need to scan the working dir
1013 1013 subrepos = ctx1.substate.keys()
1014 1014 s = self.dirstate.status(match, subrepos, listignored,
1015 1015 listclean, listunknown)
1016 1016 cmp, modified, added, removed, deleted, unknown, ignored, clean = s
1017 1017
1018 1018 # check for any possibly clean files
1019 1019 if parentworking and cmp:
1020 1020 fixup = []
1021 1021 # do a full compare of any files that might have changed
1022 1022 for f in sorted(cmp):
1023 1023 if (f not in ctx1 or ctx2.flags(f) != ctx1.flags(f)
1024 1024 or ctx1[f].cmp(ctx2[f].data())):
1025 1025 modified.append(f)
1026 1026 else:
1027 1027 fixup.append(f)
1028 1028
1029 1029 if listclean:
1030 1030 clean += fixup
1031 1031
1032 1032 # update dirstate for files that are actually clean
1033 1033 if fixup:
1034 1034 try:
1035 1035 # updating the dirstate is optional
1036 1036 # so we don't wait on the lock
1037 1037 wlock = self.wlock(False)
1038 1038 try:
1039 1039 for f in fixup:
1040 1040 self.dirstate.normal(f)
1041 1041 finally:
1042 1042 wlock.release()
1043 1043 except error.LockError:
1044 1044 pass
1045 1045
1046 1046 if not parentworking:
1047 1047 mf1 = mfmatches(ctx1)
1048 1048 if working:
1049 1049 # we are comparing working dir against non-parent
1050 1050 # generate a pseudo-manifest for the working dir
1051 1051 mf2 = mfmatches(self['.'])
1052 1052 for f in cmp + modified + added:
1053 1053 mf2[f] = None
1054 1054 mf2.set(f, ctx2.flags(f))
1055 1055 for f in removed:
1056 1056 if f in mf2:
1057 1057 del mf2[f]
1058 1058 else:
1059 1059 # we are comparing two revisions
1060 1060 deleted, unknown, ignored = [], [], []
1061 1061 mf2 = mfmatches(ctx2)
1062 1062
1063 1063 modified, added, clean = [], [], []
1064 1064 for fn in mf2:
1065 1065 if fn in mf1:
1066 1066 if (mf1.flags(fn) != mf2.flags(fn) or
1067 1067 (mf1[fn] != mf2[fn] and
1068 1068 (mf2[fn] or ctx1[fn].cmp(ctx2[fn].data())))):
1069 1069 modified.append(fn)
1070 1070 elif listclean:
1071 1071 clean.append(fn)
1072 1072 del mf1[fn]
1073 1073 else:
1074 1074 added.append(fn)
1075 1075 removed = mf1.keys()
1076 1076
1077 1077 r = modified, added, removed, deleted, unknown, ignored, clean
1078 1078 [l.sort() for l in r]
1079 1079 return r
1080 1080
1081 1081 def add(self, list):
1082 1082 wlock = self.wlock()
1083 1083 try:
1084 1084 rejected = []
1085 1085 for f in list:
1086 1086 p = self.wjoin(f)
1087 1087 try:
1088 1088 st = os.lstat(p)
1089 1089 except:
1090 1090 self.ui.warn(_("%s does not exist!\n") % f)
1091 1091 rejected.append(f)
1092 1092 continue
1093 1093 if st.st_size > 10000000:
1094 1094 self.ui.warn(_("%s: up to %d MB of RAM may be required "
1095 1095 "to manage this file\n"
1096 1096 "(use 'hg revert %s' to cancel the "
1097 1097 "pending addition)\n")
1098 1098 % (f, 3 * st.st_size // 1000000, f))
1099 1099 if not (stat.S_ISREG(st.st_mode) or stat.S_ISLNK(st.st_mode)):
1100 1100 self.ui.warn(_("%s not added: only files and symlinks "
1101 1101 "supported currently\n") % f)
1102 1102 rejected.append(p)
1103 1103 elif self.dirstate[f] in 'amn':
1104 1104 self.ui.warn(_("%s already tracked!\n") % f)
1105 1105 elif self.dirstate[f] == 'r':
1106 1106 self.dirstate.normallookup(f)
1107 1107 else:
1108 1108 self.dirstate.add(f)
1109 1109 return rejected
1110 1110 finally:
1111 1111 wlock.release()
1112 1112
1113 1113 def forget(self, list):
1114 1114 wlock = self.wlock()
1115 1115 try:
1116 1116 for f in list:
1117 1117 if self.dirstate[f] != 'a':
1118 1118 self.ui.warn(_("%s not added!\n") % f)
1119 1119 else:
1120 1120 self.dirstate.forget(f)
1121 1121 finally:
1122 1122 wlock.release()
1123 1123
1124 1124 def remove(self, list, unlink=False):
1125 1125 if unlink:
1126 1126 for f in list:
1127 1127 try:
1128 1128 util.unlink(self.wjoin(f))
1129 1129 except OSError, inst:
1130 1130 if inst.errno != errno.ENOENT:
1131 1131 raise
1132 1132 wlock = self.wlock()
1133 1133 try:
1134 1134 for f in list:
1135 1135 if unlink and os.path.exists(self.wjoin(f)):
1136 1136 self.ui.warn(_("%s still exists!\n") % f)
1137 1137 elif self.dirstate[f] == 'a':
1138 1138 self.dirstate.forget(f)
1139 1139 elif f not in self.dirstate:
1140 1140 self.ui.warn(_("%s not tracked!\n") % f)
1141 1141 else:
1142 1142 self.dirstate.remove(f)
1143 1143 finally:
1144 1144 wlock.release()
1145 1145
1146 1146 def undelete(self, list):
1147 1147 manifests = [self.manifest.read(self.changelog.read(p)[0])
1148 1148 for p in self.dirstate.parents() if p != nullid]
1149 1149 wlock = self.wlock()
1150 1150 try:
1151 1151 for f in list:
1152 1152 if self.dirstate[f] != 'r':
1153 1153 self.ui.warn(_("%s not removed!\n") % f)
1154 1154 else:
1155 1155 m = f in manifests[0] and manifests[0] or manifests[1]
1156 1156 t = self.file(f).read(m[f])
1157 1157 self.wwrite(f, t, m.flags(f))
1158 1158 self.dirstate.normal(f)
1159 1159 finally:
1160 1160 wlock.release()
1161 1161
1162 1162 def copy(self, source, dest):
1163 1163 p = self.wjoin(dest)
1164 1164 if not (os.path.exists(p) or os.path.islink(p)):
1165 1165 self.ui.warn(_("%s does not exist!\n") % dest)
1166 1166 elif not (os.path.isfile(p) or os.path.islink(p)):
1167 1167 self.ui.warn(_("copy failed: %s is not a file or a "
1168 1168 "symbolic link\n") % dest)
1169 1169 else:
1170 1170 wlock = self.wlock()
1171 1171 try:
1172 1172 if self.dirstate[dest] in '?r':
1173 1173 self.dirstate.add(dest)
1174 1174 self.dirstate.copy(source, dest)
1175 1175 finally:
1176 1176 wlock.release()
1177 1177
1178 1178 def heads(self, start=None):
1179 1179 heads = self.changelog.heads(start)
1180 1180 # sort the output in rev descending order
1181 1181 heads = [(-self.changelog.rev(h), h) for h in heads]
1182 1182 return [n for (r, n) in sorted(heads)]
1183 1183
1184 1184 def branchheads(self, branch=None, start=None, closed=False):
1185 1185 '''return a (possibly filtered) list of heads for the given branch
1186 1186
1187 1187 Heads are returned in topological order, from newest to oldest.
1188 1188 If branch is None, use the dirstate branch.
1189 1189 If start is not None, return only heads reachable from start.
1190 1190 If closed is True, return heads that are marked as closed as well.
1191 1191 '''
1192 1192 if branch is None:
1193 1193 branch = self[None].branch()
1194 1194 branches = self.branchmap()
1195 1195 if branch not in branches:
1196 1196 return []
1197 1197 # the cache returns heads ordered lowest to highest
1198 1198 bheads = list(reversed(branches[branch]))
1199 1199 if start is not None:
1200 1200 # filter out the heads that cannot be reached from startrev
1201 1201 fbheads = set(self.changelog.nodesbetween([start], bheads)[2])
1202 1202 bheads = [h for h in bheads if h in fbheads]
1203 1203 if not closed:
1204 1204 bheads = [h for h in bheads if
1205 1205 ('close' not in self.changelog.read(h)[5])]
1206 1206 return bheads
1207 1207
1208 1208 def branches(self, nodes):
1209 1209 if not nodes:
1210 1210 nodes = [self.changelog.tip()]
1211 1211 b = []
1212 1212 for n in nodes:
1213 1213 t = n
1214 1214 while 1:
1215 1215 p = self.changelog.parents(n)
1216 1216 if p[1] != nullid or p[0] == nullid:
1217 1217 b.append((t, n, p[0], p[1]))
1218 1218 break
1219 1219 n = p[0]
1220 1220 return b
1221 1221
1222 1222 def between(self, pairs):
1223 1223 r = []
1224 1224
1225 1225 for top, bottom in pairs:
1226 1226 n, l, i = top, [], 0
1227 1227 f = 1
1228 1228
1229 1229 while n != bottom and n != nullid:
1230 1230 p = self.changelog.parents(n)[0]
1231 1231 if i == f:
1232 1232 l.append(n)
1233 1233 f = f * 2
1234 1234 n = p
1235 1235 i += 1
1236 1236
1237 1237 r.append(l)
1238 1238
1239 1239 return r
1240 1240
1241 1241 def findincoming(self, remote, base=None, heads=None, force=False):
1242 1242 """Return list of roots of the subsets of missing nodes from remote
1243 1243
1244 1244 If base dict is specified, assume that these nodes and their parents
1245 1245 exist on the remote side and that no child of a node of base exists
1246 1246 in both remote and self.
1247 1247 Furthermore base will be updated to include the nodes that exists
1248 1248 in self and remote but no children exists in self and remote.
1249 1249 If a list of heads is specified, return only nodes which are heads
1250 1250 or ancestors of these heads.
1251 1251
1252 1252 All the ancestors of base are in self and in remote.
1253 1253 All the descendants of the list returned are missing in self.
1254 1254 (and so we know that the rest of the nodes are missing in remote, see
1255 1255 outgoing)
1256 1256 """
1257 1257 return self.findcommonincoming(remote, base, heads, force)[1]
1258 1258
1259 1259 def findcommonincoming(self, remote, base=None, heads=None, force=False):
1260 1260 """Return a tuple (common, missing roots, heads) used to identify
1261 1261 missing nodes from remote.
1262 1262
1263 1263 If base dict is specified, assume that these nodes and their parents
1264 1264 exist on the remote side and that no child of a node of base exists
1265 1265 in both remote and self.
1266 1266 Furthermore base will be updated to include the nodes that exists
1267 1267 in self and remote but no children exists in self and remote.
1268 1268 If a list of heads is specified, return only nodes which are heads
1269 1269 or ancestors of these heads.
1270 1270
1271 1271 All the ancestors of base are in self and in remote.
1272 1272 """
1273 1273 m = self.changelog.nodemap
1274 1274 search = []
1275 1275 fetch = set()
1276 1276 seen = set()
1277 1277 seenbranch = set()
1278 1278 if base is None:
1279 1279 base = {}
1280 1280
1281 1281 if not heads:
1282 1282 heads = remote.heads()
1283 1283
1284 1284 if self.changelog.tip() == nullid:
1285 1285 base[nullid] = 1
1286 1286 if heads != [nullid]:
1287 1287 return [nullid], [nullid], list(heads)
1288 1288 return [nullid], [], []
1289 1289
1290 1290 # assume we're closer to the tip than the root
1291 1291 # and start by examining the heads
1292 1292 self.ui.status(_("searching for changes\n"))
1293 1293
1294 1294 unknown = []
1295 1295 for h in heads:
1296 1296 if h not in m:
1297 1297 unknown.append(h)
1298 1298 else:
1299 1299 base[h] = 1
1300 1300
1301 1301 heads = unknown
1302 1302 if not unknown:
1303 1303 return base.keys(), [], []
1304 1304
1305 1305 req = set(unknown)
1306 1306 reqcnt = 0
1307 1307
1308 1308 # search through remote branches
1309 1309 # a 'branch' here is a linear segment of history, with four parts:
1310 1310 # head, root, first parent, second parent
1311 1311 # (a branch always has two parents (or none) by definition)
1312 1312 unknown = remote.branches(unknown)
1313 1313 while unknown:
1314 1314 r = []
1315 1315 while unknown:
1316 1316 n = unknown.pop(0)
1317 1317 if n[0] in seen:
1318 1318 continue
1319 1319
1320 1320 self.ui.debug("examining %s:%s\n"
1321 1321 % (short(n[0]), short(n[1])))
1322 1322 if n[0] == nullid: # found the end of the branch
1323 1323 pass
1324 1324 elif n in seenbranch:
1325 1325 self.ui.debug("branch already found\n")
1326 1326 continue
1327 1327 elif n[1] and n[1] in m: # do we know the base?
1328 1328 self.ui.debug("found incomplete branch %s:%s\n"
1329 1329 % (short(n[0]), short(n[1])))
1330 1330 search.append(n[0:2]) # schedule branch range for scanning
1331 1331 seenbranch.add(n)
1332 1332 else:
1333 1333 if n[1] not in seen and n[1] not in fetch:
1334 1334 if n[2] in m and n[3] in m:
1335 1335 self.ui.debug("found new changeset %s\n" %
1336 1336 short(n[1]))
1337 1337 fetch.add(n[1]) # earliest unknown
1338 1338 for p in n[2:4]:
1339 1339 if p in m:
1340 1340 base[p] = 1 # latest known
1341 1341
1342 1342 for p in n[2:4]:
1343 1343 if p not in req and p not in m:
1344 1344 r.append(p)
1345 1345 req.add(p)
1346 1346 seen.add(n[0])
1347 1347
1348 1348 if r:
1349 1349 reqcnt += 1
1350 1350 self.ui.progress(_('searching'), reqcnt, unit=_('queries'))
1351 1351 self.ui.debug("request %d: %s\n" %
1352 1352 (reqcnt, " ".join(map(short, r))))
1353 1353 for p in xrange(0, len(r), 10):
1354 1354 for b in remote.branches(r[p:p + 10]):
1355 1355 self.ui.debug("received %s:%s\n" %
1356 1356 (short(b[0]), short(b[1])))
1357 1357 unknown.append(b)
1358 1358
1359 1359 # do binary search on the branches we found
1360 1360 while search:
1361 1361 newsearch = []
1362 1362 reqcnt += 1
1363 1363 self.ui.progress(_('searching'), reqcnt, unit=_('queries'))
1364 1364 for n, l in zip(search, remote.between(search)):
1365 1365 l.append(n[1])
1366 1366 p = n[0]
1367 1367 f = 1
1368 1368 for i in l:
1369 1369 self.ui.debug("narrowing %d:%d %s\n" % (f, len(l), short(i)))
1370 1370 if i in m:
1371 1371 if f <= 2:
1372 1372 self.ui.debug("found new branch changeset %s\n" %
1373 1373 short(p))
1374 1374 fetch.add(p)
1375 1375 base[i] = 1
1376 1376 else:
1377 1377 self.ui.debug("narrowed branch search to %s:%s\n"
1378 1378 % (short(p), short(i)))
1379 1379 newsearch.append((p, i))
1380 1380 break
1381 1381 p, f = i, f * 2
1382 1382 search = newsearch
1383 1383
1384 1384 # sanity check our fetch list
1385 1385 for f in fetch:
1386 1386 if f in m:
1387 1387 raise error.RepoError(_("already have changeset ")
1388 1388 + short(f[:4]))
1389 1389
1390 1390 if base.keys() == [nullid]:
1391 1391 if force:
1392 1392 self.ui.warn(_("warning: repository is unrelated\n"))
1393 1393 else:
1394 1394 raise util.Abort(_("repository is unrelated"))
1395 1395
1396 1396 self.ui.debug("found new changesets starting at " +
1397 1397 " ".join([short(f) for f in fetch]) + "\n")
1398 1398
1399 1399 self.ui.progress(_('searching'), None)
1400 1400 self.ui.debug("%d total queries\n" % reqcnt)
1401 1401
1402 1402 return base.keys(), list(fetch), heads
1403 1403
1404 1404 def findoutgoing(self, remote, base=None, heads=None, force=False):
1405 1405 """Return list of nodes that are roots of subsets not in remote
1406 1406
1407 1407 If base dict is specified, assume that these nodes and their parents
1408 1408 exist on the remote side.
1409 1409 If a list of heads is specified, return only nodes which are heads
1410 1410 or ancestors of these heads, and return a second element which
1411 1411 contains all remote heads which get new children.
1412 1412 """
1413 1413 if base is None:
1414 1414 base = {}
1415 1415 self.findincoming(remote, base, heads, force=force)
1416 1416
1417 1417 self.ui.debug("common changesets up to "
1418 1418 + " ".join(map(short, base.keys())) + "\n")
1419 1419
1420 1420 remain = set(self.changelog.nodemap)
1421 1421
1422 1422 # prune everything remote has from the tree
1423 1423 remain.remove(nullid)
1424 1424 remove = base.keys()
1425 1425 while remove:
1426 1426 n = remove.pop(0)
1427 1427 if n in remain:
1428 1428 remain.remove(n)
1429 1429 for p in self.changelog.parents(n):
1430 1430 remove.append(p)
1431 1431
1432 1432 # find every node whose parents have been pruned
1433 1433 subset = []
1434 1434 # find every remote head that will get new children
1435 1435 updated_heads = set()
1436 1436 for n in remain:
1437 1437 p1, p2 = self.changelog.parents(n)
1438 1438 if p1 not in remain and p2 not in remain:
1439 1439 subset.append(n)
1440 1440 if heads:
1441 1441 if p1 in heads:
1442 1442 updated_heads.add(p1)
1443 1443 if p2 in heads:
1444 1444 updated_heads.add(p2)
1445 1445
1446 1446 # this is the set of all roots we have to push
1447 1447 if heads:
1448 1448 return subset, list(updated_heads)
1449 1449 else:
1450 1450 return subset
1451 1451
1452 1452 def pull(self, remote, heads=None, force=False):
1453 1453 lock = self.lock()
1454 1454 try:
1455 1455 common, fetch, rheads = self.findcommonincoming(remote, heads=heads,
1456 1456 force=force)
1457 1457 if fetch == [nullid]:
1458 1458 self.ui.status(_("requesting all changes\n"))
1459 1459
1460 1460 if not fetch:
1461 1461 self.ui.status(_("no changes found\n"))
1462 1462 return 0
1463 1463
1464 1464 if heads is None and remote.capable('changegroupsubset'):
1465 1465 heads = rheads
1466 1466
1467 1467 if heads is None:
1468 1468 cg = remote.changegroup(fetch, 'pull')
1469 1469 else:
1470 1470 if not remote.capable('changegroupsubset'):
1471 1471 raise util.Abort(_("Partial pull cannot be done because "
1472 1472 "other repository doesn't support "
1473 1473 "changegroupsubset."))
1474 1474 cg = remote.changegroupsubset(fetch, heads, 'pull')
1475 1475 return self.addchangegroup(cg, 'pull', remote.url())
1476 1476 finally:
1477 1477 lock.release()
1478 1478
1479 1479 def push(self, remote, force=False, revs=None):
1480 1480 # there are two ways to push to remote repo:
1481 1481 #
1482 1482 # addchangegroup assumes local user can lock remote
1483 1483 # repo (local filesystem, old ssh servers).
1484 1484 #
1485 1485 # unbundle assumes local user cannot lock remote repo (new ssh
1486 1486 # servers, http servers).
1487 1487
1488 1488 if remote.capable('unbundle'):
1489 1489 return self.push_unbundle(remote, force, revs)
1490 1490 return self.push_addchangegroup(remote, force, revs)
1491 1491
1492 1492 def prepush(self, remote, force, revs):
1493 1493 '''Analyze the local and remote repositories and determine which
1494 1494 changesets need to be pushed to the remote. Return a tuple
1495 1495 (changegroup, remoteheads). changegroup is a readable file-like
1496 1496 object whose read() returns successive changegroup chunks ready to
1497 1497 be sent over the wire. remoteheads is the list of remote heads.
1498 1498 '''
1499 1499 common = {}
1500 1500 remote_heads = remote.heads()
1501 1501 inc = self.findincoming(remote, common, remote_heads, force=force)
1502 1502
1503 1503 update, updated_heads = self.findoutgoing(remote, common, remote_heads)
1504 1504 msng_cl, bases, heads = self.changelog.nodesbetween(update, revs)
1505 1505
1506 def checkbranch(lheads, rheads, updatelb, branchname=None):
1506 def checkbranch(lheads, rheads, branchname=None):
1507 1507 '''
1508 1508 check whether there are more local heads than remote heads on
1509 1509 a specific branch.
1510 1510
1511 1511 lheads: local branch heads
1512 1512 rheads: remote branch heads
1513 updatelb: outgoing local branch bases
1514 1513 '''
1515 1514
1516 1515 warn = 0
1517 1516
1518 if not revs and len(lheads) > len(rheads):
1517 if len(lheads) > len(rheads):
1519 1518 warn = 1
1520 1519 else:
1521 # add local heads involved in the push
1522 updatelheads = [self.changelog.heads(x, lheads)
1523 for x in updatelb]
1524 newheads = set(sum(updatelheads, [])) & set(lheads)
1525
1526 if not newheads:
1527 return True
1528
1529 1520 # add heads we don't have or that are not involved in the push
1521 newheads = set(lheads)
1530 1522 for r in rheads:
1531 1523 if r in self.changelog.nodemap:
1532 1524 desc = self.changelog.heads(r, heads)
1533 1525 l = [h for h in heads if h in desc]
1534 1526 if not l:
1535 1527 newheads.add(r)
1536 1528 else:
1537 1529 newheads.add(r)
1538 1530 if len(newheads) > len(rheads):
1539 1531 warn = 1
1540 1532
1541 1533 if warn:
1542 1534 if branchname is not None:
1543 1535 msg = _("abort: push creates new remote heads"
1544 1536 " on branch '%s'!\n") % branchname
1545 1537 else:
1546 1538 msg = _("abort: push creates new remote heads!\n")
1547 1539 self.ui.warn(msg)
1548 1540 if len(lheads) > len(rheads):
1549 1541 self.ui.status(_("(did you forget to merge?"
1550 1542 " use push -f to force)\n"))
1551 1543 else:
1552 1544 self.ui.status(_("(you should pull and merge or"
1553 1545 " use push -f to force)\n"))
1554 1546 return False
1555 1547 return True
1556 1548
1557 1549 if not bases:
1558 1550 self.ui.status(_("no changes found\n"))
1559 1551 return None, 1
1560 1552 elif not force:
1561 1553 # Check for each named branch if we're creating new remote heads.
1562 1554 # To be a remote head after push, node must be either:
1563 1555 # - unknown locally
1564 1556 # - a local outgoing head descended from update
1565 1557 # - a remote head that's known locally and not
1566 1558 # ancestral to an outgoing head
1567 1559 #
1568 1560 # New named branches cannot be created without --force.
1569 1561
1570 1562 if remote_heads != [nullid]:
1571 1563 if remote.capable('branchmap'):
1572 1564 remotebrheads = remote.branchmap()
1573 1565
1574 1566 if not revs:
1575 1567 localbrheads = self.branchmap()
1576 1568 else:
1577 1569 localbrheads = {}
1578 for n in heads:
1579 branch = self[n].branch()
1580 localbrheads.setdefault(branch, []).append(n)
1570 ctxgen = (self[n] for n in msng_cl)
1571 self._updatebranchcache(localbrheads, ctxgen)
1581 1572
1582 1573 newbranches = list(set(localbrheads) - set(remotebrheads))
1583 1574 if newbranches: # new branch requires --force
1584 1575 branchnames = ', '.join("%s" % b for b in newbranches)
1585 1576 self.ui.warn(_("abort: push creates "
1586 1577 "new remote branches: %s!\n")
1587 1578 % branchnames)
1588 1579 # propose 'push -b .' in the msg too?
1589 1580 self.ui.status(_("(use 'hg push -f' to force)\n"))
1590 1581 return None, 0
1591 1582 for branch, lheads in localbrheads.iteritems():
1592 1583 if branch in remotebrheads:
1593 1584 rheads = remotebrheads[branch]
1594 if not checkbranch(lheads, rheads, update, branch):
1585 if not checkbranch(lheads, rheads, branch):
1595 1586 return None, 0
1596 1587 else:
1597 if not checkbranch(heads, remote_heads, update):
1588 if not checkbranch(heads, remote_heads):
1598 1589 return None, 0
1599 1590
1600 1591 if inc:
1601 1592 self.ui.warn(_("note: unsynced remote changes!\n"))
1602 1593
1603 1594
1604 1595 if revs is None:
1605 1596 # use the fast path, no race possible on push
1606 1597 nodes = self.changelog.findmissing(common.keys())
1607 1598 cg = self._changegroup(nodes, 'push')
1608 1599 else:
1609 1600 cg = self.changegroupsubset(update, revs, 'push')
1610 1601 return cg, remote_heads
1611 1602
1612 1603 def push_addchangegroup(self, remote, force, revs):
1613 1604 lock = remote.lock()
1614 1605 try:
1615 1606 ret = self.prepush(remote, force, revs)
1616 1607 if ret[0] is not None:
1617 1608 cg, remote_heads = ret
1618 1609 return remote.addchangegroup(cg, 'push', self.url())
1619 1610 return ret[1]
1620 1611 finally:
1621 1612 lock.release()
1622 1613
1623 1614 def push_unbundle(self, remote, force, revs):
1624 1615 # local repo finds heads on server, finds out what revs it
1625 1616 # must push. once revs transferred, if server finds it has
1626 1617 # different heads (someone else won commit/push race), server
1627 1618 # aborts.
1628 1619
1629 1620 ret = self.prepush(remote, force, revs)
1630 1621 if ret[0] is not None:
1631 1622 cg, remote_heads = ret
1632 1623 if force:
1633 1624 remote_heads = ['force']
1634 1625 return remote.unbundle(cg, remote_heads, 'push')
1635 1626 return ret[1]
1636 1627
1637 1628 def changegroupinfo(self, nodes, source):
1638 1629 if self.ui.verbose or source == 'bundle':
1639 1630 self.ui.status(_("%d changesets found\n") % len(nodes))
1640 1631 if self.ui.debugflag:
1641 1632 self.ui.debug("list of changesets:\n")
1642 1633 for node in nodes:
1643 1634 self.ui.debug("%s\n" % hex(node))
1644 1635
1645 1636 def changegroupsubset(self, bases, heads, source, extranodes=None):
1646 1637 """Compute a changegroup consisting of all the nodes that are
1647 1638 descendents of any of the bases and ancestors of any of the heads.
1648 1639 Return a chunkbuffer object whose read() method will return
1649 1640 successive changegroup chunks.
1650 1641
1651 1642 It is fairly complex as determining which filenodes and which
1652 1643 manifest nodes need to be included for the changeset to be complete
1653 1644 is non-trivial.
1654 1645
1655 1646 Another wrinkle is doing the reverse, figuring out which changeset in
1656 1647 the changegroup a particular filenode or manifestnode belongs to.
1657 1648
1658 1649 The caller can specify some nodes that must be included in the
1659 1650 changegroup using the extranodes argument. It should be a dict
1660 1651 where the keys are the filenames (or 1 for the manifest), and the
1661 1652 values are lists of (node, linknode) tuples, where node is a wanted
1662 1653 node and linknode is the changelog node that should be transmitted as
1663 1654 the linkrev.
1664 1655 """
1665 1656
1666 1657 # Set up some initial variables
1667 1658 # Make it easy to refer to self.changelog
1668 1659 cl = self.changelog
1669 1660 # msng is short for missing - compute the list of changesets in this
1670 1661 # changegroup.
1671 1662 if not bases:
1672 1663 bases = [nullid]
1673 1664 msng_cl_lst, bases, heads = cl.nodesbetween(bases, heads)
1674 1665
1675 1666 if extranodes is None:
1676 1667 # can we go through the fast path ?
1677 1668 heads.sort()
1678 1669 allheads = self.heads()
1679 1670 allheads.sort()
1680 1671 if heads == allheads:
1681 1672 return self._changegroup(msng_cl_lst, source)
1682 1673
1683 1674 # slow path
1684 1675 self.hook('preoutgoing', throw=True, source=source)
1685 1676
1686 1677 self.changegroupinfo(msng_cl_lst, source)
1687 1678 # Some bases may turn out to be superfluous, and some heads may be
1688 1679 # too. nodesbetween will return the minimal set of bases and heads
1689 1680 # necessary to re-create the changegroup.
1690 1681
1691 1682 # Known heads are the list of heads that it is assumed the recipient
1692 1683 # of this changegroup will know about.
1693 1684 knownheads = set()
1694 1685 # We assume that all parents of bases are known heads.
1695 1686 for n in bases:
1696 1687 knownheads.update(cl.parents(n))
1697 1688 knownheads.discard(nullid)
1698 1689 knownheads = list(knownheads)
1699 1690 if knownheads:
1700 1691 # Now that we know what heads are known, we can compute which
1701 1692 # changesets are known. The recipient must know about all
1702 1693 # changesets required to reach the known heads from the null
1703 1694 # changeset.
1704 1695 has_cl_set, junk, junk = cl.nodesbetween(None, knownheads)
1705 1696 junk = None
1706 1697 # Transform the list into a set.
1707 1698 has_cl_set = set(has_cl_set)
1708 1699 else:
1709 1700 # If there were no known heads, the recipient cannot be assumed to
1710 1701 # know about any changesets.
1711 1702 has_cl_set = set()
1712 1703
1713 1704 # Make it easy to refer to self.manifest
1714 1705 mnfst = self.manifest
1715 1706 # We don't know which manifests are missing yet
1716 1707 msng_mnfst_set = {}
1717 1708 # Nor do we know which filenodes are missing.
1718 1709 msng_filenode_set = {}
1719 1710
1720 1711 junk = mnfst.index[len(mnfst) - 1] # Get around a bug in lazyindex
1721 1712 junk = None
1722 1713
1723 1714 # A changeset always belongs to itself, so the changenode lookup
1724 1715 # function for a changenode is identity.
1725 1716 def identity(x):
1726 1717 return x
1727 1718
1728 1719 # If we determine that a particular file or manifest node must be a
1729 1720 # node that the recipient of the changegroup will already have, we can
1730 1721 # also assume the recipient will have all the parents. This function
1731 1722 # prunes them from the set of missing nodes.
1732 1723 def prune_parents(revlog, hasset, msngset):
1733 1724 for r in revlog.ancestors(*[revlog.rev(n) for n in hasset]):
1734 1725 msngset.pop(revlog.node(r), None)
1735 1726
1736 1727 # Use the information collected in collect_manifests_and_files to say
1737 1728 # which changenode any manifestnode belongs to.
1738 1729 def lookup_manifest_link(mnfstnode):
1739 1730 return msng_mnfst_set[mnfstnode]
1740 1731
1741 1732 # A function generating function that sets up the initial environment
1742 1733 # the inner function.
1743 1734 def filenode_collector(changedfiles):
1744 1735 # This gathers information from each manifestnode included in the
1745 1736 # changegroup about which filenodes the manifest node references
1746 1737 # so we can include those in the changegroup too.
1747 1738 #
1748 1739 # It also remembers which changenode each filenode belongs to. It
1749 1740 # does this by assuming the a filenode belongs to the changenode
1750 1741 # the first manifest that references it belongs to.
1751 1742 def collect_msng_filenodes(mnfstnode):
1752 1743 r = mnfst.rev(mnfstnode)
1753 1744 if r - 1 in mnfst.parentrevs(r):
1754 1745 # If the previous rev is one of the parents,
1755 1746 # we only need to see a diff.
1756 1747 deltamf = mnfst.readdelta(mnfstnode)
1757 1748 # For each line in the delta
1758 1749 for f, fnode in deltamf.iteritems():
1759 1750 f = changedfiles.get(f, None)
1760 1751 # And if the file is in the list of files we care
1761 1752 # about.
1762 1753 if f is not None:
1763 1754 # Get the changenode this manifest belongs to
1764 1755 clnode = msng_mnfst_set[mnfstnode]
1765 1756 # Create the set of filenodes for the file if
1766 1757 # there isn't one already.
1767 1758 ndset = msng_filenode_set.setdefault(f, {})
1768 1759 # And set the filenode's changelog node to the
1769 1760 # manifest's if it hasn't been set already.
1770 1761 ndset.setdefault(fnode, clnode)
1771 1762 else:
1772 1763 # Otherwise we need a full manifest.
1773 1764 m = mnfst.read(mnfstnode)
1774 1765 # For every file in we care about.
1775 1766 for f in changedfiles:
1776 1767 fnode = m.get(f, None)
1777 1768 # If it's in the manifest
1778 1769 if fnode is not None:
1779 1770 # See comments above.
1780 1771 clnode = msng_mnfst_set[mnfstnode]
1781 1772 ndset = msng_filenode_set.setdefault(f, {})
1782 1773 ndset.setdefault(fnode, clnode)
1783 1774 return collect_msng_filenodes
1784 1775
1785 1776 # We have a list of filenodes we think we need for a file, lets remove
1786 1777 # all those we know the recipient must have.
1787 1778 def prune_filenodes(f, filerevlog):
1788 1779 msngset = msng_filenode_set[f]
1789 1780 hasset = set()
1790 1781 # If a 'missing' filenode thinks it belongs to a changenode we
1791 1782 # assume the recipient must have, then the recipient must have
1792 1783 # that filenode.
1793 1784 for n in msngset:
1794 1785 clnode = cl.node(filerevlog.linkrev(filerevlog.rev(n)))
1795 1786 if clnode in has_cl_set:
1796 1787 hasset.add(n)
1797 1788 prune_parents(filerevlog, hasset, msngset)
1798 1789
1799 1790 # A function generator function that sets up the a context for the
1800 1791 # inner function.
1801 1792 def lookup_filenode_link_func(fname):
1802 1793 msngset = msng_filenode_set[fname]
1803 1794 # Lookup the changenode the filenode belongs to.
1804 1795 def lookup_filenode_link(fnode):
1805 1796 return msngset[fnode]
1806 1797 return lookup_filenode_link
1807 1798
1808 1799 # Add the nodes that were explicitly requested.
1809 1800 def add_extra_nodes(name, nodes):
1810 1801 if not extranodes or name not in extranodes:
1811 1802 return
1812 1803
1813 1804 for node, linknode in extranodes[name]:
1814 1805 if node not in nodes:
1815 1806 nodes[node] = linknode
1816 1807
1817 1808 # Now that we have all theses utility functions to help out and
1818 1809 # logically divide up the task, generate the group.
1819 1810 def gengroup():
1820 1811 # The set of changed files starts empty.
1821 1812 changedfiles = {}
1822 1813 collect = changegroup.collector(cl, msng_mnfst_set, changedfiles)
1823 1814
1824 1815 # Create a changenode group generator that will call our functions
1825 1816 # back to lookup the owning changenode and collect information.
1826 1817 group = cl.group(msng_cl_lst, identity, collect)
1827 1818 cnt = 0
1828 1819 for chnk in group:
1829 1820 yield chnk
1830 1821 self.ui.progress(_('bundling changes'), cnt, unit=_('chunks'))
1831 1822 cnt += 1
1832 1823 self.ui.progress(_('bundling changes'), None)
1833 1824
1834 1825
1835 1826 # Figure out which manifest nodes (of the ones we think might be
1836 1827 # part of the changegroup) the recipient must know about and
1837 1828 # remove them from the changegroup.
1838 1829 has_mnfst_set = set()
1839 1830 for n in msng_mnfst_set:
1840 1831 # If a 'missing' manifest thinks it belongs to a changenode
1841 1832 # the recipient is assumed to have, obviously the recipient
1842 1833 # must have that manifest.
1843 1834 linknode = cl.node(mnfst.linkrev(mnfst.rev(n)))
1844 1835 if linknode in has_cl_set:
1845 1836 has_mnfst_set.add(n)
1846 1837 prune_parents(mnfst, has_mnfst_set, msng_mnfst_set)
1847 1838 add_extra_nodes(1, msng_mnfst_set)
1848 1839 msng_mnfst_lst = msng_mnfst_set.keys()
1849 1840 # Sort the manifestnodes by revision number.
1850 1841 msng_mnfst_lst.sort(key=mnfst.rev)
1851 1842 # Create a generator for the manifestnodes that calls our lookup
1852 1843 # and data collection functions back.
1853 1844 group = mnfst.group(msng_mnfst_lst, lookup_manifest_link,
1854 1845 filenode_collector(changedfiles))
1855 1846 cnt = 0
1856 1847 for chnk in group:
1857 1848 yield chnk
1858 1849 self.ui.progress(_('bundling manifests'), cnt, unit=_('chunks'))
1859 1850 cnt += 1
1860 1851 self.ui.progress(_('bundling manifests'), None)
1861 1852
1862 1853 # These are no longer needed, dereference and toss the memory for
1863 1854 # them.
1864 1855 msng_mnfst_lst = None
1865 1856 msng_mnfst_set.clear()
1866 1857
1867 1858 if extranodes:
1868 1859 for fname in extranodes:
1869 1860 if isinstance(fname, int):
1870 1861 continue
1871 1862 msng_filenode_set.setdefault(fname, {})
1872 1863 changedfiles[fname] = 1
1873 1864 # Go through all our files in order sorted by name.
1874 1865 cnt = 0
1875 1866 for fname in sorted(changedfiles):
1876 1867 filerevlog = self.file(fname)
1877 1868 if not len(filerevlog):
1878 1869 raise util.Abort(_("empty or missing revlog for %s") % fname)
1879 1870 # Toss out the filenodes that the recipient isn't really
1880 1871 # missing.
1881 1872 if fname in msng_filenode_set:
1882 1873 prune_filenodes(fname, filerevlog)
1883 1874 add_extra_nodes(fname, msng_filenode_set[fname])
1884 1875 msng_filenode_lst = msng_filenode_set[fname].keys()
1885 1876 else:
1886 1877 msng_filenode_lst = []
1887 1878 # If any filenodes are left, generate the group for them,
1888 1879 # otherwise don't bother.
1889 1880 if len(msng_filenode_lst) > 0:
1890 1881 yield changegroup.chunkheader(len(fname))
1891 1882 yield fname
1892 1883 # Sort the filenodes by their revision #
1893 1884 msng_filenode_lst.sort(key=filerevlog.rev)
1894 1885 # Create a group generator and only pass in a changenode
1895 1886 # lookup function as we need to collect no information
1896 1887 # from filenodes.
1897 1888 group = filerevlog.group(msng_filenode_lst,
1898 1889 lookup_filenode_link_func(fname))
1899 1890 for chnk in group:
1900 1891 self.ui.progress(
1901 1892 _('bundling files'), cnt, item=fname, unit=_('chunks'))
1902 1893 cnt += 1
1903 1894 yield chnk
1904 1895 if fname in msng_filenode_set:
1905 1896 # Don't need this anymore, toss it to free memory.
1906 1897 del msng_filenode_set[fname]
1907 1898 # Signal that no more groups are left.
1908 1899 yield changegroup.closechunk()
1909 1900 self.ui.progress(_('bundling files'), None)
1910 1901
1911 1902 if msng_cl_lst:
1912 1903 self.hook('outgoing', node=hex(msng_cl_lst[0]), source=source)
1913 1904
1914 1905 return util.chunkbuffer(gengroup())
1915 1906
1916 1907 def changegroup(self, basenodes, source):
1917 1908 # to avoid a race we use changegroupsubset() (issue1320)
1918 1909 return self.changegroupsubset(basenodes, self.heads(), source)
1919 1910
1920 1911 def _changegroup(self, nodes, source):
1921 1912 """Compute the changegroup of all nodes that we have that a recipient
1922 1913 doesn't. Return a chunkbuffer object whose read() method will return
1923 1914 successive changegroup chunks.
1924 1915
1925 1916 This is much easier than the previous function as we can assume that
1926 1917 the recipient has any changenode we aren't sending them.
1927 1918
1928 1919 nodes is the set of nodes to send"""
1929 1920
1930 1921 self.hook('preoutgoing', throw=True, source=source)
1931 1922
1932 1923 cl = self.changelog
1933 1924 revset = set([cl.rev(n) for n in nodes])
1934 1925 self.changegroupinfo(nodes, source)
1935 1926
1936 1927 def identity(x):
1937 1928 return x
1938 1929
1939 1930 def gennodelst(log):
1940 1931 for r in log:
1941 1932 if log.linkrev(r) in revset:
1942 1933 yield log.node(r)
1943 1934
1944 1935 def lookuprevlink_func(revlog):
1945 1936 def lookuprevlink(n):
1946 1937 return cl.node(revlog.linkrev(revlog.rev(n)))
1947 1938 return lookuprevlink
1948 1939
1949 1940 def gengroup():
1950 1941 '''yield a sequence of changegroup chunks (strings)'''
1951 1942 # construct a list of all changed files
1952 1943 changedfiles = {}
1953 1944 mmfs = {}
1954 1945 collect = changegroup.collector(cl, mmfs, changedfiles)
1955 1946
1956 1947 cnt = 0
1957 1948 for chnk in cl.group(nodes, identity, collect):
1958 1949 self.ui.progress(_('bundling changes'), cnt, unit=_('chunks'))
1959 1950 cnt += 1
1960 1951 yield chnk
1961 1952 self.ui.progress(_('bundling changes'), None)
1962 1953
1963 1954 mnfst = self.manifest
1964 1955 nodeiter = gennodelst(mnfst)
1965 1956 cnt = 0
1966 1957 for chnk in mnfst.group(nodeiter, lookuprevlink_func(mnfst)):
1967 1958 self.ui.progress(_('bundling manifests'), cnt, unit=_('chunks'))
1968 1959 cnt += 1
1969 1960 yield chnk
1970 1961 self.ui.progress(_('bundling manifests'), None)
1971 1962
1972 1963 cnt = 0
1973 1964 for fname in sorted(changedfiles):
1974 1965 filerevlog = self.file(fname)
1975 1966 if not len(filerevlog):
1976 1967 raise util.Abort(_("empty or missing revlog for %s") % fname)
1977 1968 nodeiter = gennodelst(filerevlog)
1978 1969 nodeiter = list(nodeiter)
1979 1970 if nodeiter:
1980 1971 yield changegroup.chunkheader(len(fname))
1981 1972 yield fname
1982 1973 lookup = lookuprevlink_func(filerevlog)
1983 1974 for chnk in filerevlog.group(nodeiter, lookup):
1984 1975 self.ui.progress(
1985 1976 _('bundling files'), cnt, item=fname, unit=_('chunks'))
1986 1977 cnt += 1
1987 1978 yield chnk
1988 1979 self.ui.progress(_('bundling files'), None)
1989 1980
1990 1981 yield changegroup.closechunk()
1991 1982
1992 1983 if nodes:
1993 1984 self.hook('outgoing', node=hex(nodes[0]), source=source)
1994 1985
1995 1986 return util.chunkbuffer(gengroup())
1996 1987
1997 1988 def addchangegroup(self, source, srctype, url, emptyok=False):
1998 1989 """add changegroup to repo.
1999 1990
2000 1991 return values:
2001 1992 - nothing changed or no source: 0
2002 1993 - more heads than before: 1+added heads (2..n)
2003 1994 - less heads than before: -1-removed heads (-2..-n)
2004 1995 - number of heads stays the same: 1
2005 1996 """
2006 1997 def csmap(x):
2007 1998 self.ui.debug("add changeset %s\n" % short(x))
2008 1999 return len(cl)
2009 2000
2010 2001 def revmap(x):
2011 2002 return cl.rev(x)
2012 2003
2013 2004 if not source:
2014 2005 return 0
2015 2006
2016 2007 self.hook('prechangegroup', throw=True, source=srctype, url=url)
2017 2008
2018 2009 changesets = files = revisions = 0
2019 2010
2020 2011 # write changelog data to temp files so concurrent readers will not see
2021 2012 # inconsistent view
2022 2013 cl = self.changelog
2023 2014 cl.delayupdate()
2024 2015 oldheads = len(cl.heads())
2025 2016
2026 2017 tr = self.transaction()
2027 2018 try:
2028 2019 trp = weakref.proxy(tr)
2029 2020 # pull off the changeset group
2030 2021 self.ui.status(_("adding changesets\n"))
2031 2022 clstart = len(cl)
2032 2023 class prog(object):
2033 2024 step = _('changesets')
2034 2025 count = 1
2035 2026 ui = self.ui
2036 2027 def __call__(self):
2037 2028 self.ui.progress(self.step, self.count, unit=_('chunks'))
2038 2029 self.count += 1
2039 2030 pr = prog()
2040 2031 chunkiter = changegroup.chunkiter(source, progress=pr)
2041 2032 if cl.addgroup(chunkiter, csmap, trp) is None and not emptyok:
2042 2033 raise util.Abort(_("received changelog group is empty"))
2043 2034 clend = len(cl)
2044 2035 changesets = clend - clstart
2045 2036 self.ui.progress(_('changesets'), None)
2046 2037
2047 2038 # pull off the manifest group
2048 2039 self.ui.status(_("adding manifests\n"))
2049 2040 pr.step = _('manifests')
2050 2041 pr.count = 1
2051 2042 chunkiter = changegroup.chunkiter(source, progress=pr)
2052 2043 # no need to check for empty manifest group here:
2053 2044 # if the result of the merge of 1 and 2 is the same in 3 and 4,
2054 2045 # no new manifest will be created and the manifest group will
2055 2046 # be empty during the pull
2056 2047 self.manifest.addgroup(chunkiter, revmap, trp)
2057 2048 self.ui.progress(_('manifests'), None)
2058 2049
2059 2050 needfiles = {}
2060 2051 if self.ui.configbool('server', 'validate', default=False):
2061 2052 # validate incoming csets have their manifests
2062 2053 for cset in xrange(clstart, clend):
2063 2054 mfest = self.changelog.read(self.changelog.node(cset))[0]
2064 2055 mfest = self.manifest.readdelta(mfest)
2065 2056 # store file nodes we must see
2066 2057 for f, n in mfest.iteritems():
2067 2058 needfiles.setdefault(f, set()).add(n)
2068 2059
2069 2060 # process the files
2070 2061 self.ui.status(_("adding file changes\n"))
2071 2062 pr.step = 'files'
2072 2063 pr.count = 1
2073 2064 while 1:
2074 2065 f = changegroup.getchunk(source)
2075 2066 if not f:
2076 2067 break
2077 2068 self.ui.debug("adding %s revisions\n" % f)
2078 2069 fl = self.file(f)
2079 2070 o = len(fl)
2080 2071 chunkiter = changegroup.chunkiter(source, progress=pr)
2081 2072 if fl.addgroup(chunkiter, revmap, trp) is None:
2082 2073 raise util.Abort(_("received file revlog group is empty"))
2083 2074 revisions += len(fl) - o
2084 2075 files += 1
2085 2076 if f in needfiles:
2086 2077 needs = needfiles[f]
2087 2078 for new in xrange(o, len(fl)):
2088 2079 n = fl.node(new)
2089 2080 if n in needs:
2090 2081 needs.remove(n)
2091 2082 if not needs:
2092 2083 del needfiles[f]
2093 2084 self.ui.progress(_('files'), None)
2094 2085
2095 2086 for f, needs in needfiles.iteritems():
2096 2087 fl = self.file(f)
2097 2088 for n in needs:
2098 2089 try:
2099 2090 fl.rev(n)
2100 2091 except error.LookupError:
2101 2092 raise util.Abort(
2102 2093 _('missing file data for %s:%s - run hg verify') %
2103 2094 (f, hex(n)))
2104 2095
2105 2096 newheads = len(cl.heads())
2106 2097 heads = ""
2107 2098 if oldheads and newheads != oldheads:
2108 2099 heads = _(" (%+d heads)") % (newheads - oldheads)
2109 2100
2110 2101 self.ui.status(_("added %d changesets"
2111 2102 " with %d changes to %d files%s\n")
2112 2103 % (changesets, revisions, files, heads))
2113 2104
2114 2105 if changesets > 0:
2115 2106 p = lambda: cl.writepending() and self.root or ""
2116 2107 self.hook('pretxnchangegroup', throw=True,
2117 2108 node=hex(cl.node(clstart)), source=srctype,
2118 2109 url=url, pending=p)
2119 2110
2120 2111 # make changelog see real files again
2121 2112 cl.finalize(trp)
2122 2113
2123 2114 tr.close()
2124 2115 finally:
2125 2116 del tr
2126 2117
2127 2118 if changesets > 0:
2128 2119 # forcefully update the on-disk branch cache
2129 2120 self.ui.debug("updating the branch cache\n")
2130 2121 self.branchtags()
2131 2122 self.hook("changegroup", node=hex(cl.node(clstart)),
2132 2123 source=srctype, url=url)
2133 2124
2134 2125 for i in xrange(clstart, clend):
2135 2126 self.hook("incoming", node=hex(cl.node(i)),
2136 2127 source=srctype, url=url)
2137 2128
2138 2129 # never return 0 here:
2139 2130 if newheads < oldheads:
2140 2131 return newheads - oldheads - 1
2141 2132 else:
2142 2133 return newheads - oldheads + 1
2143 2134
2144 2135
2145 2136 def stream_in(self, remote):
2146 2137 fp = remote.stream_out()
2147 2138 l = fp.readline()
2148 2139 try:
2149 2140 resp = int(l)
2150 2141 except ValueError:
2151 2142 raise error.ResponseError(
2152 2143 _('Unexpected response from remote server:'), l)
2153 2144 if resp == 1:
2154 2145 raise util.Abort(_('operation forbidden by server'))
2155 2146 elif resp == 2:
2156 2147 raise util.Abort(_('locking the remote repository failed'))
2157 2148 elif resp != 0:
2158 2149 raise util.Abort(_('the server sent an unknown error code'))
2159 2150 self.ui.status(_('streaming all changes\n'))
2160 2151 l = fp.readline()
2161 2152 try:
2162 2153 total_files, total_bytes = map(int, l.split(' ', 1))
2163 2154 except (ValueError, TypeError):
2164 2155 raise error.ResponseError(
2165 2156 _('Unexpected response from remote server:'), l)
2166 2157 self.ui.status(_('%d files to transfer, %s of data\n') %
2167 2158 (total_files, util.bytecount(total_bytes)))
2168 2159 start = time.time()
2169 2160 for i in xrange(total_files):
2170 2161 # XXX doesn't support '\n' or '\r' in filenames
2171 2162 l = fp.readline()
2172 2163 try:
2173 2164 name, size = l.split('\0', 1)
2174 2165 size = int(size)
2175 2166 except (ValueError, TypeError):
2176 2167 raise error.ResponseError(
2177 2168 _('Unexpected response from remote server:'), l)
2178 2169 self.ui.debug('adding %s (%s)\n' % (name, util.bytecount(size)))
2179 2170 # for backwards compat, name was partially encoded
2180 2171 ofp = self.sopener(store.decodedir(name), 'w')
2181 2172 for chunk in util.filechunkiter(fp, limit=size):
2182 2173 ofp.write(chunk)
2183 2174 ofp.close()
2184 2175 elapsed = time.time() - start
2185 2176 if elapsed <= 0:
2186 2177 elapsed = 0.001
2187 2178 self.ui.status(_('transferred %s in %.1f seconds (%s/sec)\n') %
2188 2179 (util.bytecount(total_bytes), elapsed,
2189 2180 util.bytecount(total_bytes / elapsed)))
2190 2181 self.invalidate()
2191 2182 return len(self.heads()) + 1
2192 2183
2193 2184 def clone(self, remote, heads=[], stream=False):
2194 2185 '''clone remote repository.
2195 2186
2196 2187 keyword arguments:
2197 2188 heads: list of revs to clone (forces use of pull)
2198 2189 stream: use streaming clone if possible'''
2199 2190
2200 2191 # now, all clients that can request uncompressed clones can
2201 2192 # read repo formats supported by all servers that can serve
2202 2193 # them.
2203 2194
2204 2195 # if revlog format changes, client will have to check version
2205 2196 # and format flags on "stream" capability, and use
2206 2197 # uncompressed only if compatible.
2207 2198
2208 2199 if stream and not heads and remote.capable('stream'):
2209 2200 return self.stream_in(remote)
2210 2201 return self.pull(remote, heads)
2211 2202
2212 2203 # used to avoid circular references so destructors work
2213 2204 def aftertrans(files):
2214 2205 renamefiles = [tuple(t) for t in files]
2215 2206 def a():
2216 2207 for src, dest in renamefiles:
2217 2208 util.rename(src, dest)
2218 2209 return a
2219 2210
2220 2211 def instance(ui, path, create):
2221 2212 return localrepository(ui, util.drop_scheme('file', path), create)
2222 2213
2223 2214 def islocal(path):
2224 2215 return True
@@ -1,169 +1,197
1 1 #!/bin/sh
2 2
3 3 mkdir a
4 4 cd a
5 5 hg init
6 6 echo foo > t1
7 7 hg add t1
8 8 hg commit -m "1" -d "1000000 0"
9 9
10 10 cd ..
11 11 hg clone a b
12 12
13 13 cd a
14 14 echo foo > t2
15 15 hg add t2
16 16 hg commit -m "2" -d "1000000 0"
17 17
18 18 cd ../b
19 19 echo foo > t3
20 20 hg add t3
21 21 hg commit -m "3" -d "1000000 0"
22 22
23 23 hg push ../a
24 24 hg pull ../a
25 25 hg push ../a
26 26 hg merge
27 27 hg commit -m "4" -d "1000000 0"
28 28 hg push ../a
29 29 cd ..
30 30
31 31 hg init c
32 32 cd c
33 33 for i in 0 1 2; do
34 34 echo $i >> foo
35 35 hg ci -Am $i -d "1000000 0"
36 36 done
37 37 cd ..
38 38
39 39 hg clone c d
40 40 cd d
41 41 for i in 0 1; do
42 42 hg co -C $i
43 43 echo d-$i >> foo
44 44 hg ci -m d-$i -d "1000000 0"
45 45 done
46 46
47 47 HGMERGE=true hg merge 3
48 48 hg ci -m c-d -d "1000000 0"
49 49
50 50 hg push ../c; echo $?
51 51 hg push -r 2 ../c; echo $?
52 52 hg push -r 3 ../c; echo $?
53 53 hg push -r 3 -r 4 ../c; echo $?
54 54 hg push -f -r 3 -r 4 ../c; echo $?
55 55 hg push -r 5 ../c; echo $?
56 56
57 57 # issue 450
58 58 hg init ../e
59 59 hg push -r 0 ../e ; echo $?
60 60 hg push -r 1 ../e ; echo $?
61 61
62 62 cd ..
63 63
64 64 # issue 736
65 65 echo % issue 736
66 66 hg init f
67 67 cd f
68 68 hg -q branch a
69 69 echo 0 > foo
70 70 hg -q ci -d "1000000 0" -Am 0
71 71 echo 1 > foo
72 72 hg -q ci -d "1000000 0" -m 1
73 73 hg -q up 0
74 74 echo 2 > foo
75 75 hg -q ci -d "1000000 0" -m 2
76 76 hg -q up 0
77 77 hg -q branch b
78 78 echo 3 > foo
79 79 hg -q ci -d "1000000 0" -m 3
80 80 cd ..
81 81
82 82 hg -q clone f g
83 83 cd g
84 84
85 85 echo % push on existing branch and new branch
86 86 hg -q up 1
87 87 echo 4 > foo
88 88 hg -q ci -d "1000000 0" -m 4
89 89 hg -q up 0
90 90 echo 5 > foo
91 91 hg -q branch c
92 92 hg -q ci -d "1000000 0" -m 5
93 93 hg push ../f; echo $?
94 94 hg push -r 4 -r 5 ../f; echo $?
95 95
96 96 echo % multiple new branches
97 97 hg -q branch d
98 98 echo 6 > foo
99 99 hg -q ci -d "1000000 0" -m 6
100 100 hg push ../f; echo $?
101 101 hg push -r 4 -r 6 ../f; echo $?
102 102 cd ../g
103 103
104 104 echo % fail on multiple head push
105 105 hg -q up 1
106 106 echo 7 > foo
107 107 hg -q ci -d "1000000 0" -m 7
108 108 hg push -r 4 -r 7 ../f; echo $?
109 109
110 110 echo % push replacement head on existing branches
111 111 hg -q up 3
112 112 echo 8 > foo
113 113 hg -q ci -d "1000000 0" -m 8
114 114 hg push -r 7 -r 8 ../f; echo $?
115 115
116 116 echo % merge of branch a to other branch b followed by unrelated push on branch a
117 117 hg -q up 7
118 118 HGMERGE=true hg -q merge 8
119 119 hg -q ci -d "1000000 0" -m 9
120 120 hg -q up 8
121 121 echo 10 > foo
122 122 hg -q ci -d "1000000 0" -m 10
123 123 hg push -r 9 ../f; echo $?
124 124 hg push -r 10 ../f; echo $?
125 125
126 126 echo % cheating the counting algorithm
127 127 hg -q up 9
128 128 HGMERGE=true hg -q merge 2
129 129 hg -q ci -d "1000000 0" -m 11
130 130 hg -q up 1
131 131 echo 12 > foo
132 132 hg -q ci -d "1000000 0" -m 12
133 133 hg push -r 11 -r 12 ../f; echo $?
134 134
135 135 echo % checking prepush logic does not allow silently pushing multiple new heads
136 136 cd ..
137 137 hg init h
138 138 echo init > h/init
139 139 hg -R h ci -Am init
140 140 echo a > h/a
141 141 hg -R h ci -Am a
142 142 hg clone h i
143 143 hg -R h up 0
144 144 echo b > h/b
145 145 hg -R h ci -Am b
146 146 hg -R i up 0
147 147 echo c > i/c
148 148 hg -R i ci -Am c
149 149 hg -R i push h
150 150 echo
151 151
152 152 echo % check prepush logic with merged branches
153 153 hg init j
154 154 hg -R j branch a
155 155 echo init > j/foo
156 156 hg -R j ci -Am init
157 157 hg clone j k
158 158 echo a1 > j/foo
159 159 hg -R j ci -m a1
160 160 hg -R k branch b
161 161 echo b > k/foo
162 162 hg -R k ci -m b
163 163 hg -R k up 0
164 164 hg -R k merge b
165 165 hg -R k ci -m merge
166 166 hg -R k push -r a j
167 167 echo
168 168
169 echo % prepush -r should not allow you to sneak in new heads
170 hg init l
171 cd l
172 echo a >> foo
173 hg -q add foo
174 hg -q branch a
175 hg -q ci -d '0 0' -ma
176 hg -q up null
177 echo a >> foo
178 hg -q add foo
179 hg -q branch b
180 hg -q ci -d '0 0' -mb
181 cd ..
182 hg -q clone l m -u a
183 cd m
184 hg -q merge b
185 hg -q ci -d '0 0' -mmb
186 hg -q up 0
187 echo a >> foo
188 hg -q ci -ma2
189 hg -q up 2
190 echo a >> foo
191 hg -q branch -f b
192 hg -q ci -d '0 0' -mb2
193 hg -q merge 3
194 hg -q ci -d '0 0' -mma
195 hg push ../l -b b
196
169 197 exit 0
@@ -1,172 +1,177
1 1 updating to branch default
2 2 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
3 3 pushing to ../a
4 4 searching for changes
5 5 abort: push creates new remote heads on branch 'default'!
6 6 (you should pull and merge or use push -f to force)
7 7 pulling from ../a
8 8 searching for changes
9 9 adding changesets
10 10 adding manifests
11 11 adding file changes
12 12 added 1 changesets with 1 changes to 1 files (+1 heads)
13 13 (run 'hg heads' to see heads, 'hg merge' to merge)
14 14 pushing to ../a
15 15 searching for changes
16 16 abort: push creates new remote heads on branch 'default'!
17 17 (did you forget to merge? use push -f to force)
18 18 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
19 19 (branch merge, don't forget to commit)
20 20 pushing to ../a
21 21 searching for changes
22 22 adding changesets
23 23 adding manifests
24 24 adding file changes
25 25 added 2 changesets with 1 changes to 1 files
26 26 adding foo
27 27 updating to branch default
28 28 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
29 29 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
30 30 created new head
31 31 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
32 32 created new head
33 33 merging foo
34 34 0 files updated, 1 files merged, 0 files removed, 0 files unresolved
35 35 (branch merge, don't forget to commit)
36 36 pushing to ../c
37 37 searching for changes
38 38 abort: push creates new remote heads on branch 'default'!
39 39 (did you forget to merge? use push -f to force)
40 40 1
41 41 pushing to ../c
42 42 searching for changes
43 43 no changes found
44 44 0
45 45 pushing to ../c
46 46 searching for changes
47 47 abort: push creates new remote heads on branch 'default'!
48 48 (you should pull and merge or use push -f to force)
49 49 1
50 50 pushing to ../c
51 51 searching for changes
52 52 abort: push creates new remote heads on branch 'default'!
53 53 (did you forget to merge? use push -f to force)
54 54 1
55 55 pushing to ../c
56 56 searching for changes
57 57 adding changesets
58 58 adding manifests
59 59 adding file changes
60 60 added 2 changesets with 2 changes to 1 files (+2 heads)
61 61 0
62 62 pushing to ../c
63 63 searching for changes
64 64 adding changesets
65 65 adding manifests
66 66 adding file changes
67 67 added 1 changesets with 1 changes to 1 files (-1 heads)
68 68 0
69 69 pushing to ../e
70 70 searching for changes
71 71 adding changesets
72 72 adding manifests
73 73 adding file changes
74 74 added 1 changesets with 1 changes to 1 files
75 75 0
76 76 pushing to ../e
77 77 searching for changes
78 78 adding changesets
79 79 adding manifests
80 80 adding file changes
81 81 added 1 changesets with 1 changes to 1 files
82 82 0
83 83 % issue 736
84 84 % push on existing branch and new branch
85 85 pushing to ../f
86 86 searching for changes
87 87 abort: push creates new remote branches: c!
88 88 (use 'hg push -f' to force)
89 89 1
90 90 pushing to ../f
91 91 searching for changes
92 92 abort: push creates new remote branches: c!
93 93 (use 'hg push -f' to force)
94 94 1
95 95 % multiple new branches
96 96 pushing to ../f
97 97 searching for changes
98 98 abort: push creates new remote branches: c, d!
99 99 (use 'hg push -f' to force)
100 100 1
101 101 pushing to ../f
102 102 searching for changes
103 abort: push creates new remote branches: d!
103 abort: push creates new remote branches: c, d!
104 104 (use 'hg push -f' to force)
105 105 1
106 106 % fail on multiple head push
107 107 pushing to ../f
108 108 searching for changes
109 109 abort: push creates new remote heads on branch 'a'!
110 110 (you should pull and merge or use push -f to force)
111 111 1
112 112 % push replacement head on existing branches
113 113 pushing to ../f
114 114 searching for changes
115 115 adding changesets
116 116 adding manifests
117 117 adding file changes
118 118 added 2 changesets with 2 changes to 1 files
119 119 0
120 120 % merge of branch a to other branch b followed by unrelated push on branch a
121 121 pushing to ../f
122 122 searching for changes
123 123 adding changesets
124 124 adding manifests
125 125 adding file changes
126 126 added 1 changesets with 1 changes to 1 files (-1 heads)
127 127 0
128 128 pushing to ../f
129 129 searching for changes
130 130 adding changesets
131 131 adding manifests
132 132 adding file changes
133 133 added 1 changesets with 1 changes to 1 files (+1 heads)
134 134 0
135 135 % cheating the counting algorithm
136 136 pushing to ../f
137 137 searching for changes
138 138 adding changesets
139 139 adding manifests
140 140 adding file changes
141 141 added 2 changesets with 2 changes to 1 files
142 142 0
143 143 % checking prepush logic does not allow silently pushing multiple new heads
144 144 adding init
145 145 adding a
146 146 updating to branch default
147 147 2 files updated, 0 files merged, 0 files removed, 0 files unresolved
148 148 0 files updated, 0 files merged, 1 files removed, 0 files unresolved
149 149 adding b
150 150 created new head
151 151 0 files updated, 0 files merged, 1 files removed, 0 files unresolved
152 152 adding c
153 153 created new head
154 154 pushing to h
155 155 searching for changes
156 156 abort: push creates new remote heads on branch 'default'!
157 157 (you should pull and merge or use push -f to force)
158 158
159 159 % check prepush logic with merged branches
160 160 marked working directory as branch a
161 161 adding foo
162 162 updating to branch a
163 163 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
164 164 marked working directory as branch b
165 165 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
166 166 1 files updated, 0 files merged, 0 files removed, 0 files unresolved
167 167 (branch merge, don't forget to commit)
168 168 pushing to j
169 169 searching for changes
170 abort: push creates new remote branches: b!
171 (use 'hg push -f' to force)
172
173 % prepush -r should not allow you to sneak in new heads
174 pushing to ../l
175 searching for changes
170 176 abort: push creates new remote heads on branch 'a'!
171 (you should pull and merge or use push -f to force)
172
177 (did you forget to merge? use push -f to force)
General Comments 0
You need to be logged in to leave comments. Login now