##// END OF EJS Templates
changegroup: prune subdirectory dirlogs too...
Martin von Zweigbergk -
r28230:0c2a088f default
parent child Browse files
Show More
@@ -1,1156 +1,1157 b''
1 1 # changegroup.py - Mercurial changegroup manipulation functions
2 2 #
3 3 # Copyright 2006 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 __future__ import absolute_import
9 9
10 10 import os
11 11 import struct
12 12 import tempfile
13 13 import weakref
14 14
15 15 from .i18n import _
16 16 from .node import (
17 17 hex,
18 18 nullid,
19 19 nullrev,
20 20 short,
21 21 )
22 22
23 23 from . import (
24 24 branchmap,
25 25 dagutil,
26 26 discovery,
27 27 error,
28 28 mdiff,
29 29 phases,
30 30 util,
31 31 )
32 32
33 33 _CHANGEGROUPV1_DELTA_HEADER = "20s20s20s20s"
34 34 _CHANGEGROUPV2_DELTA_HEADER = "20s20s20s20s20s"
35 35 _CHANGEGROUPV3_DELTA_HEADER = ">20s20s20s20s20sH"
36 36
37 37 def readexactly(stream, n):
38 38 '''read n bytes from stream.read and abort if less was available'''
39 39 s = stream.read(n)
40 40 if len(s) < n:
41 41 raise error.Abort(_("stream ended unexpectedly"
42 42 " (got %d bytes, expected %d)")
43 43 % (len(s), n))
44 44 return s
45 45
46 46 def getchunk(stream):
47 47 """return the next chunk from stream as a string"""
48 48 d = readexactly(stream, 4)
49 49 l = struct.unpack(">l", d)[0]
50 50 if l <= 4:
51 51 if l:
52 52 raise error.Abort(_("invalid chunk length %d") % l)
53 53 return ""
54 54 return readexactly(stream, l - 4)
55 55
56 56 def chunkheader(length):
57 57 """return a changegroup chunk header (string)"""
58 58 return struct.pack(">l", length + 4)
59 59
60 60 def closechunk():
61 61 """return a changegroup chunk header (string) for a zero-length chunk"""
62 62 return struct.pack(">l", 0)
63 63
64 64 def combineresults(results):
65 65 """logic to combine 0 or more addchangegroup results into one"""
66 66 changedheads = 0
67 67 result = 1
68 68 for ret in results:
69 69 # If any changegroup result is 0, return 0
70 70 if ret == 0:
71 71 result = 0
72 72 break
73 73 if ret < -1:
74 74 changedheads += ret + 1
75 75 elif ret > 1:
76 76 changedheads += ret - 1
77 77 if changedheads > 0:
78 78 result = 1 + changedheads
79 79 elif changedheads < 0:
80 80 result = -1 + changedheads
81 81 return result
82 82
83 83 bundletypes = {
84 84 "": ("", None), # only when using unbundle on ssh and old http servers
85 85 # since the unification ssh accepts a header but there
86 86 # is no capability signaling it.
87 87 "HG20": (), # special-cased below
88 88 "HG10UN": ("HG10UN", None),
89 89 "HG10BZ": ("HG10", 'BZ'),
90 90 "HG10GZ": ("HG10GZ", 'GZ'),
91 91 }
92 92
93 93 # hgweb uses this list to communicate its preferred type
94 94 bundlepriority = ['HG10GZ', 'HG10BZ', 'HG10UN']
95 95
96 96 def writechunks(ui, chunks, filename, vfs=None):
97 97 """Write chunks to a file and return its filename.
98 98
99 99 The stream is assumed to be a bundle file.
100 100 Existing files will not be overwritten.
101 101 If no filename is specified, a temporary file is created.
102 102 """
103 103 fh = None
104 104 cleanup = None
105 105 try:
106 106 if filename:
107 107 if vfs:
108 108 fh = vfs.open(filename, "wb")
109 109 else:
110 110 fh = open(filename, "wb")
111 111 else:
112 112 fd, filename = tempfile.mkstemp(prefix="hg-bundle-", suffix=".hg")
113 113 fh = os.fdopen(fd, "wb")
114 114 cleanup = filename
115 115 for c in chunks:
116 116 fh.write(c)
117 117 cleanup = None
118 118 return filename
119 119 finally:
120 120 if fh is not None:
121 121 fh.close()
122 122 if cleanup is not None:
123 123 if filename and vfs:
124 124 vfs.unlink(cleanup)
125 125 else:
126 126 os.unlink(cleanup)
127 127
128 128 def writebundle(ui, cg, filename, bundletype, vfs=None, compression=None):
129 129 """Write a bundle file and return its filename.
130 130
131 131 Existing files will not be overwritten.
132 132 If no filename is specified, a temporary file is created.
133 133 bz2 compression can be turned off.
134 134 The bundle file will be deleted in case of errors.
135 135 """
136 136
137 137 if bundletype == "HG20":
138 138 from . import bundle2
139 139 bundle = bundle2.bundle20(ui)
140 140 bundle.setcompression(compression)
141 141 part = bundle.newpart('changegroup', data=cg.getchunks())
142 142 part.addparam('version', cg.version)
143 143 chunkiter = bundle.getchunks()
144 144 else:
145 145 # compression argument is only for the bundle2 case
146 146 assert compression is None
147 147 if cg.version != '01':
148 148 raise error.Abort(_('old bundle types only supports v1 '
149 149 'changegroups'))
150 150 header, comp = bundletypes[bundletype]
151 151 if comp not in util.compressors:
152 152 raise error.Abort(_('unknown stream compression type: %s')
153 153 % comp)
154 154 z = util.compressors[comp]()
155 155 subchunkiter = cg.getchunks()
156 156 def chunkiter():
157 157 yield header
158 158 for chunk in subchunkiter:
159 159 yield z.compress(chunk)
160 160 yield z.flush()
161 161 chunkiter = chunkiter()
162 162
163 163 # parse the changegroup data, otherwise we will block
164 164 # in case of sshrepo because we don't know the end of the stream
165 165
166 166 # an empty chunkgroup is the end of the changegroup
167 167 # a changegroup has at least 2 chunkgroups (changelog and manifest).
168 168 # after that, an empty chunkgroup is the end of the changegroup
169 169 return writechunks(ui, chunkiter, filename, vfs=vfs)
170 170
171 171 class cg1unpacker(object):
172 172 """Unpacker for cg1 changegroup streams.
173 173
174 174 A changegroup unpacker handles the framing of the revision data in
175 175 the wire format. Most consumers will want to use the apply()
176 176 method to add the changes from the changegroup to a repository.
177 177
178 178 If you're forwarding a changegroup unmodified to another consumer,
179 179 use getchunks(), which returns an iterator of changegroup
180 180 chunks. This is mostly useful for cases where you need to know the
181 181 data stream has ended by observing the end of the changegroup.
182 182
183 183 deltachunk() is useful only if you're applying delta data. Most
184 184 consumers should prefer apply() instead.
185 185
186 186 A few other public methods exist. Those are used only for
187 187 bundlerepo and some debug commands - their use is discouraged.
188 188 """
189 189 deltaheader = _CHANGEGROUPV1_DELTA_HEADER
190 190 deltaheadersize = struct.calcsize(deltaheader)
191 191 version = '01'
192 192 _grouplistcount = 1 # One list of files after the manifests
193 193
194 194 def __init__(self, fh, alg):
195 195 if alg == 'UN':
196 196 alg = None # get more modern without breaking too much
197 197 if not alg in util.decompressors:
198 198 raise error.Abort(_('unknown stream compression type: %s')
199 199 % alg)
200 200 if alg == 'BZ':
201 201 alg = '_truncatedBZ'
202 202 self._stream = util.decompressors[alg](fh)
203 203 self._type = alg
204 204 self.callback = None
205 205
206 206 # These methods (compressed, read, seek, tell) all appear to only
207 207 # be used by bundlerepo, but it's a little hard to tell.
208 208 def compressed(self):
209 209 return self._type is not None
210 210 def read(self, l):
211 211 return self._stream.read(l)
212 212 def seek(self, pos):
213 213 return self._stream.seek(pos)
214 214 def tell(self):
215 215 return self._stream.tell()
216 216 def close(self):
217 217 return self._stream.close()
218 218
219 219 def _chunklength(self):
220 220 d = readexactly(self._stream, 4)
221 221 l = struct.unpack(">l", d)[0]
222 222 if l <= 4:
223 223 if l:
224 224 raise error.Abort(_("invalid chunk length %d") % l)
225 225 return 0
226 226 if self.callback:
227 227 self.callback()
228 228 return l - 4
229 229
230 230 def changelogheader(self):
231 231 """v10 does not have a changelog header chunk"""
232 232 return {}
233 233
234 234 def manifestheader(self):
235 235 """v10 does not have a manifest header chunk"""
236 236 return {}
237 237
238 238 def filelogheader(self):
239 239 """return the header of the filelogs chunk, v10 only has the filename"""
240 240 l = self._chunklength()
241 241 if not l:
242 242 return {}
243 243 fname = readexactly(self._stream, l)
244 244 return {'filename': fname}
245 245
246 246 def _deltaheader(self, headertuple, prevnode):
247 247 node, p1, p2, cs = headertuple
248 248 if prevnode is None:
249 249 deltabase = p1
250 250 else:
251 251 deltabase = prevnode
252 252 flags = 0
253 253 return node, p1, p2, deltabase, cs, flags
254 254
255 255 def deltachunk(self, prevnode):
256 256 l = self._chunklength()
257 257 if not l:
258 258 return {}
259 259 headerdata = readexactly(self._stream, self.deltaheadersize)
260 260 header = struct.unpack(self.deltaheader, headerdata)
261 261 delta = readexactly(self._stream, l - self.deltaheadersize)
262 262 node, p1, p2, deltabase, cs, flags = self._deltaheader(header, prevnode)
263 263 return {'node': node, 'p1': p1, 'p2': p2, 'cs': cs,
264 264 'deltabase': deltabase, 'delta': delta, 'flags': flags}
265 265
266 266 def getchunks(self):
267 267 """returns all the chunks contains in the bundle
268 268
269 269 Used when you need to forward the binary stream to a file or another
270 270 network API. To do so, it parse the changegroup data, otherwise it will
271 271 block in case of sshrepo because it don't know the end of the stream.
272 272 """
273 273 # an empty chunkgroup is the end of the changegroup
274 274 # a changegroup has at least 2 chunkgroups (changelog and manifest).
275 275 # after that, changegroup versions 1 and 2 have a series of groups
276 276 # with one group per file. changegroup 3 has a series of directory
277 277 # manifests before the files.
278 278 count = 0
279 279 emptycount = 0
280 280 while emptycount < self._grouplistcount:
281 281 empty = True
282 282 count += 1
283 283 while True:
284 284 chunk = getchunk(self)
285 285 if not chunk:
286 286 if empty and count > 2:
287 287 emptycount += 1
288 288 break
289 289 empty = False
290 290 yield chunkheader(len(chunk))
291 291 pos = 0
292 292 while pos < len(chunk):
293 293 next = pos + 2**20
294 294 yield chunk[pos:next]
295 295 pos = next
296 296 yield closechunk()
297 297
298 298 def _unpackmanifests(self, repo, revmap, trp, prog, numchanges):
299 299 # We know that we'll never have more manifests than we had
300 300 # changesets.
301 301 self.callback = prog(_('manifests'), numchanges)
302 302 # no need to check for empty manifest group here:
303 303 # if the result of the merge of 1 and 2 is the same in 3 and 4,
304 304 # no new manifest will be created and the manifest group will
305 305 # be empty during the pull
306 306 self.manifestheader()
307 307 repo.manifest.addgroup(self, revmap, trp)
308 308 repo.ui.progress(_('manifests'), None)
309 309
310 310 def apply(self, repo, srctype, url, emptyok=False,
311 311 targetphase=phases.draft, expectedtotal=None):
312 312 """Add the changegroup returned by source.read() to this repo.
313 313 srctype is a string like 'push', 'pull', or 'unbundle'. url is
314 314 the URL of the repo where this changegroup is coming from.
315 315
316 316 Return an integer summarizing the change to this repo:
317 317 - nothing changed or no source: 0
318 318 - more heads than before: 1+added heads (2..n)
319 319 - fewer heads than before: -1-removed heads (-2..-n)
320 320 - number of heads stays the same: 1
321 321 """
322 322 repo = repo.unfiltered()
323 323 def csmap(x):
324 324 repo.ui.debug("add changeset %s\n" % short(x))
325 325 return len(cl)
326 326
327 327 def revmap(x):
328 328 return cl.rev(x)
329 329
330 330 changesets = files = revisions = 0
331 331
332 332 try:
333 333 with repo.transaction("\n".join([srctype,
334 334 util.hidepassword(url)])) as tr:
335 335 # The transaction could have been created before and already
336 336 # carries source information. In this case we use the top
337 337 # level data. We overwrite the argument because we need to use
338 338 # the top level value (if they exist) in this function.
339 339 srctype = tr.hookargs.setdefault('source', srctype)
340 340 url = tr.hookargs.setdefault('url', url)
341 341 repo.hook('prechangegroup', throw=True, **tr.hookargs)
342 342
343 343 # write changelog data to temp files so concurrent readers
344 344 # will not see an inconsistent view
345 345 cl = repo.changelog
346 346 cl.delayupdate(tr)
347 347 oldheads = cl.heads()
348 348
349 349 trp = weakref.proxy(tr)
350 350 # pull off the changeset group
351 351 repo.ui.status(_("adding changesets\n"))
352 352 clstart = len(cl)
353 353 class prog(object):
354 354 def __init__(self, step, total):
355 355 self._step = step
356 356 self._total = total
357 357 self._count = 1
358 358 def __call__(self):
359 359 repo.ui.progress(self._step, self._count,
360 360 unit=_('chunks'), total=self._total)
361 361 self._count += 1
362 362 self.callback = prog(_('changesets'), expectedtotal)
363 363
364 364 efiles = set()
365 365 def onchangelog(cl, node):
366 366 efiles.update(cl.read(node)[3])
367 367
368 368 self.changelogheader()
369 369 srccontent = cl.addgroup(self, csmap, trp,
370 370 addrevisioncb=onchangelog)
371 371 efiles = len(efiles)
372 372
373 373 if not (srccontent or emptyok):
374 374 raise error.Abort(_("received changelog group is empty"))
375 375 clend = len(cl)
376 376 changesets = clend - clstart
377 377 repo.ui.progress(_('changesets'), None)
378 378
379 379 # pull off the manifest group
380 380 repo.ui.status(_("adding manifests\n"))
381 381 self._unpackmanifests(repo, revmap, trp, prog, changesets)
382 382
383 383 needfiles = {}
384 384 if repo.ui.configbool('server', 'validate', default=False):
385 385 # validate incoming csets have their manifests
386 386 for cset in xrange(clstart, clend):
387 387 mfnode = repo.changelog.read(
388 388 repo.changelog.node(cset))[0]
389 389 mfest = repo.manifest.readdelta(mfnode)
390 390 # store file nodes we must see
391 391 for f, n in mfest.iteritems():
392 392 needfiles.setdefault(f, set()).add(n)
393 393
394 394 # process the files
395 395 repo.ui.status(_("adding file changes\n"))
396 396 self.callback = None
397 397 pr = prog(_('files'), efiles)
398 398 newrevs, newfiles = _addchangegroupfiles(
399 399 repo, self, revmap, trp, pr, needfiles)
400 400 revisions += newrevs
401 401 files += newfiles
402 402
403 403 dh = 0
404 404 if oldheads:
405 405 heads = cl.heads()
406 406 dh = len(heads) - len(oldheads)
407 407 for h in heads:
408 408 if h not in oldheads and repo[h].closesbranch():
409 409 dh -= 1
410 410 htext = ""
411 411 if dh:
412 412 htext = _(" (%+d heads)") % dh
413 413
414 414 repo.ui.status(_("added %d changesets"
415 415 " with %d changes to %d files%s\n")
416 416 % (changesets, revisions, files, htext))
417 417 repo.invalidatevolatilesets()
418 418
419 419 if changesets > 0:
420 420 if 'node' not in tr.hookargs:
421 421 tr.hookargs['node'] = hex(cl.node(clstart))
422 422 tr.hookargs['node_last'] = hex(cl.node(clend - 1))
423 423 hookargs = dict(tr.hookargs)
424 424 else:
425 425 hookargs = dict(tr.hookargs)
426 426 hookargs['node'] = hex(cl.node(clstart))
427 427 hookargs['node_last'] = hex(cl.node(clend - 1))
428 428 repo.hook('pretxnchangegroup', throw=True, **hookargs)
429 429
430 430 added = [cl.node(r) for r in xrange(clstart, clend)]
431 431 publishing = repo.publishing()
432 432 if srctype in ('push', 'serve'):
433 433 # Old servers can not push the boundary themselves.
434 434 # New servers won't push the boundary if changeset already
435 435 # exists locally as secret
436 436 #
437 437 # We should not use added here but the list of all change in
438 438 # the bundle
439 439 if publishing:
440 440 phases.advanceboundary(repo, tr, phases.public,
441 441 srccontent)
442 442 else:
443 443 # Those changesets have been pushed from the
444 444 # outside, their phases are going to be pushed
445 445 # alongside. Therefor `targetphase` is
446 446 # ignored.
447 447 phases.advanceboundary(repo, tr, phases.draft,
448 448 srccontent)
449 449 phases.retractboundary(repo, tr, phases.draft, added)
450 450 elif srctype != 'strip':
451 451 # publishing only alter behavior during push
452 452 #
453 453 # strip should not touch boundary at all
454 454 phases.retractboundary(repo, tr, targetphase, added)
455 455
456 456 if changesets > 0:
457 457 if srctype != 'strip':
458 458 # During strip, branchcache is invalid but
459 459 # coming call to `destroyed` will repair it.
460 460 # In other case we can safely update cache on
461 461 # disk.
462 462 branchmap.updatecache(repo.filtered('served'))
463 463
464 464 def runhooks():
465 465 # These hooks run when the lock releases, not when the
466 466 # transaction closes. So it's possible for the changelog
467 467 # to have changed since we last saw it.
468 468 if clstart >= len(repo):
469 469 return
470 470
471 471 # forcefully update the on-disk branch cache
472 472 repo.ui.debug("updating the branch cache\n")
473 473 repo.hook("changegroup", **hookargs)
474 474
475 475 for n in added:
476 476 args = hookargs.copy()
477 477 args['node'] = hex(n)
478 478 del args['node_last']
479 479 repo.hook("incoming", **args)
480 480
481 481 newheads = [h for h in repo.heads()
482 482 if h not in oldheads]
483 483 repo.ui.log("incoming",
484 484 "%s incoming changes - new heads: %s\n",
485 485 len(added),
486 486 ', '.join([hex(c[:6]) for c in newheads]))
487 487
488 488 tr.addpostclose('changegroup-runhooks-%020i' % clstart,
489 489 lambda tr: repo._afterlock(runhooks))
490 490 finally:
491 491 repo.ui.flush()
492 492 # never return 0 here:
493 493 if dh < 0:
494 494 return dh - 1
495 495 else:
496 496 return dh + 1
497 497
498 498 class cg2unpacker(cg1unpacker):
499 499 """Unpacker for cg2 streams.
500 500
501 501 cg2 streams add support for generaldelta, so the delta header
502 502 format is slightly different. All other features about the data
503 503 remain the same.
504 504 """
505 505 deltaheader = _CHANGEGROUPV2_DELTA_HEADER
506 506 deltaheadersize = struct.calcsize(deltaheader)
507 507 version = '02'
508 508
509 509 def _deltaheader(self, headertuple, prevnode):
510 510 node, p1, p2, deltabase, cs = headertuple
511 511 flags = 0
512 512 return node, p1, p2, deltabase, cs, flags
513 513
514 514 class cg3unpacker(cg2unpacker):
515 515 """Unpacker for cg3 streams.
516 516
517 517 cg3 streams add support for exchanging treemanifests and revlog
518 518 flags. It adds the revlog flags to the delta header and an empty chunk
519 519 separating manifests and files.
520 520 """
521 521 deltaheader = _CHANGEGROUPV3_DELTA_HEADER
522 522 deltaheadersize = struct.calcsize(deltaheader)
523 523 version = '03'
524 524 _grouplistcount = 2 # One list of manifests and one list of files
525 525
526 526 def _deltaheader(self, headertuple, prevnode):
527 527 node, p1, p2, deltabase, cs, flags = headertuple
528 528 return node, p1, p2, deltabase, cs, flags
529 529
530 530 def _unpackmanifests(self, repo, revmap, trp, prog, numchanges):
531 531 super(cg3unpacker, self)._unpackmanifests(repo, revmap, trp, prog,
532 532 numchanges)
533 533 while True:
534 534 chunkdata = self.filelogheader()
535 535 if not chunkdata:
536 536 break
537 537 # If we get here, there are directory manifests in the changegroup
538 538 d = chunkdata["filename"]
539 539 repo.ui.debug("adding %s revisions\n" % d)
540 540 dirlog = repo.manifest.dirlog(d)
541 541 if not dirlog.addgroup(self, revmap, trp):
542 542 raise error.Abort(_("received dir revlog group is empty"))
543 543
544 544 class headerlessfixup(object):
545 545 def __init__(self, fh, h):
546 546 self._h = h
547 547 self._fh = fh
548 548 def read(self, n):
549 549 if self._h:
550 550 d, self._h = self._h[:n], self._h[n:]
551 551 if len(d) < n:
552 552 d += readexactly(self._fh, n - len(d))
553 553 return d
554 554 return readexactly(self._fh, n)
555 555
556 556 def _moddirs(files):
557 557 """Given a set of modified files, find the list of modified directories.
558 558
559 559 This returns a list of (path to changed dir, changed dir) tuples,
560 560 as that's what the one client needs anyway.
561 561
562 562 >>> _moddirs(['a/b/c.py', 'a/b/c.txt', 'a/d/e/f/g.txt', 'i.txt', ])
563 563 [('/', 'a/'), ('a/', 'b/'), ('a/', 'd/'), ('a/d/', 'e/'), ('a/d/e/', 'f/')]
564 564
565 565 """
566 566 alldirs = set()
567 567 for f in files:
568 568 path = f.split('/')[:-1]
569 569 for i in xrange(len(path) - 1, -1, -1):
570 570 dn = '/'.join(path[:i])
571 571 current = dn + '/', path[i] + '/'
572 572 if current in alldirs:
573 573 break
574 574 alldirs.add(current)
575 575 return sorted(alldirs)
576 576
577 577 class cg1packer(object):
578 578 deltaheader = _CHANGEGROUPV1_DELTA_HEADER
579 579 version = '01'
580 580 def __init__(self, repo, bundlecaps=None):
581 581 """Given a source repo, construct a bundler.
582 582
583 583 bundlecaps is optional and can be used to specify the set of
584 584 capabilities which can be used to build the bundle.
585 585 """
586 586 # Set of capabilities we can use to build the bundle.
587 587 if bundlecaps is None:
588 588 bundlecaps = set()
589 589 self._bundlecaps = bundlecaps
590 590 # experimental config: bundle.reorder
591 591 reorder = repo.ui.config('bundle', 'reorder', 'auto')
592 592 if reorder == 'auto':
593 593 reorder = None
594 594 else:
595 595 reorder = util.parsebool(reorder)
596 596 self._repo = repo
597 597 self._reorder = reorder
598 598 self._progress = repo.ui.progress
599 599 if self._repo.ui.verbose and not self._repo.ui.debugflag:
600 600 self._verbosenote = self._repo.ui.note
601 601 else:
602 602 self._verbosenote = lambda s: None
603 603
604 604 def close(self):
605 605 return closechunk()
606 606
607 607 def fileheader(self, fname):
608 608 return chunkheader(len(fname)) + fname
609 609
610 610 def group(self, nodelist, revlog, lookup, units=None):
611 611 """Calculate a delta group, yielding a sequence of changegroup chunks
612 612 (strings).
613 613
614 614 Given a list of changeset revs, return a set of deltas and
615 615 metadata corresponding to nodes. The first delta is
616 616 first parent(nodelist[0]) -> nodelist[0], the receiver is
617 617 guaranteed to have this parent as it has all history before
618 618 these changesets. In the case firstparent is nullrev the
619 619 changegroup starts with a full revision.
620 620
621 621 If units is not None, progress detail will be generated, units specifies
622 622 the type of revlog that is touched (changelog, manifest, etc.).
623 623 """
624 624 # if we don't have any revisions touched by these changesets, bail
625 625 if len(nodelist) == 0:
626 626 yield self.close()
627 627 return
628 628
629 629 # for generaldelta revlogs, we linearize the revs; this will both be
630 630 # much quicker and generate a much smaller bundle
631 631 if (revlog._generaldelta and self._reorder is None) or self._reorder:
632 632 dag = dagutil.revlogdag(revlog)
633 633 revs = set(revlog.rev(n) for n in nodelist)
634 634 revs = dag.linearize(revs)
635 635 else:
636 636 revs = sorted([revlog.rev(n) for n in nodelist])
637 637
638 638 # add the parent of the first rev
639 639 p = revlog.parentrevs(revs[0])[0]
640 640 revs.insert(0, p)
641 641
642 642 # build deltas
643 643 total = len(revs) - 1
644 644 msgbundling = _('bundling')
645 645 for r in xrange(len(revs) - 1):
646 646 if units is not None:
647 647 self._progress(msgbundling, r + 1, unit=units, total=total)
648 648 prev, curr = revs[r], revs[r + 1]
649 649 linknode = lookup(revlog.node(curr))
650 650 for c in self.revchunk(revlog, curr, prev, linknode):
651 651 yield c
652 652
653 653 if units is not None:
654 654 self._progress(msgbundling, None)
655 655 yield self.close()
656 656
657 657 # filter any nodes that claim to be part of the known set
658 658 def prune(self, revlog, missing, commonrevs):
659 659 rr, rl = revlog.rev, revlog.linkrev
660 660 return [n for n in missing if rl(rr(n)) not in commonrevs]
661 661
662 662 def _packmanifests(self, dir, mfnodes, lookuplinknode):
663 663 """Pack flat manifests into a changegroup stream."""
664 664 assert not dir
665 665 for chunk in self.group(mfnodes, self._repo.manifest,
666 666 lookuplinknode, units=_('manifests')):
667 667 yield chunk
668 668
669 669 def _manifestsdone(self):
670 670 return ''
671 671
672 672 def generate(self, commonrevs, clnodes, fastpathlinkrev, source):
673 673 '''yield a sequence of changegroup chunks (strings)'''
674 674 repo = self._repo
675 675 cl = repo.changelog
676 676
677 677 clrevorder = {}
678 678 mfs = {} # needed manifests
679 679 fnodes = {} # needed file nodes
680 680 # maps manifest node id -> set(changed files)
681 681 mfchangedfiles = {}
682 682
683 683 # Callback for the changelog, used to collect changed files and manifest
684 684 # nodes.
685 685 # Returns the linkrev node (identity in the changelog case).
686 686 def lookupcl(x):
687 687 c = cl.read(x)
688 688 clrevorder[x] = len(clrevorder)
689 689 n = c[0]
690 690 # record the first changeset introducing this manifest version
691 691 mfs.setdefault(n, x)
692 692 # Record a complete list of potentially-changed files in
693 693 # this manifest.
694 694 mfchangedfiles.setdefault(n, set()).update(c[3])
695 695 return x
696 696
697 697 self._verbosenote(_('uncompressed size of bundle content:\n'))
698 698 size = 0
699 699 for chunk in self.group(clnodes, cl, lookupcl, units=_('changesets')):
700 700 size += len(chunk)
701 701 yield chunk
702 702 self._verbosenote(_('%8.i (changelog)\n') % size)
703 703
704 704 # We need to make sure that the linkrev in the changegroup refers to
705 705 # the first changeset that introduced the manifest or file revision.
706 706 # The fastpath is usually safer than the slowpath, because the filelogs
707 707 # are walked in revlog order.
708 708 #
709 709 # When taking the slowpath with reorder=None and the manifest revlog
710 710 # uses generaldelta, the manifest may be walked in the "wrong" order.
711 711 # Without 'clrevorder', we would get an incorrect linkrev (see fix in
712 712 # cc0ff93d0c0c).
713 713 #
714 714 # When taking the fastpath, we are only vulnerable to reordering
715 715 # of the changelog itself. The changelog never uses generaldelta, so
716 716 # it is only reordered when reorder=True. To handle this case, we
717 717 # simply take the slowpath, which already has the 'clrevorder' logic.
718 718 # This was also fixed in cc0ff93d0c0c.
719 719 fastpathlinkrev = fastpathlinkrev and not self._reorder
720 720 # Treemanifests don't work correctly with fastpathlinkrev
721 721 # either, because we don't discover which directory nodes to
722 722 # send along with files. This could probably be fixed.
723 723 fastpathlinkrev = fastpathlinkrev and (
724 724 'treemanifest' not in repo.requirements)
725 725
726 726 for chunk in self.generatemanifests(commonrevs, clrevorder,
727 727 fastpathlinkrev, mfs, mfchangedfiles, fnodes):
728 728 yield chunk
729 729 mfs.clear()
730 730 clrevs = set(cl.rev(x) for x in clnodes)
731 731
732 732 if not fastpathlinkrev:
733 733 def linknodes(unused, fname):
734 734 return fnodes.get(fname, {})
735 735 else:
736 736 cln = cl.node
737 737 def linknodes(filerevlog, fname):
738 738 llr = filerevlog.linkrev
739 739 fln = filerevlog.node
740 740 revs = ((r, llr(r)) for r in filerevlog)
741 741 return dict((fln(r), cln(lr)) for r, lr in revs if lr in clrevs)
742 742
743 743 changedfiles = set()
744 744 for x in mfchangedfiles.itervalues():
745 745 changedfiles.update(x)
746 746 for chunk in self.generatefiles(changedfiles, linknodes, commonrevs,
747 747 source):
748 748 yield chunk
749 749
750 750 yield self.close()
751 751
752 752 if clnodes:
753 753 repo.hook('outgoing', node=hex(clnodes[0]), source=source)
754 754
755 755 def generatemanifests(self, commonrevs, clrevorder, fastpathlinkrev, mfs,
756 756 mfchangedfiles, fnodes):
757 757 repo = self._repo
758 758 ml = repo.manifest
759 759 tmfnodes = {}
760 760
761 761 # Callback for the manifest, used to collect linkrevs for filelog
762 762 # revisions.
763 763 # Returns the linkrev node (collected in lookupcl).
764 764 if fastpathlinkrev:
765 765 lookupmflinknode = mfs.__getitem__
766 766 else:
767 767 def lookupmflinknode(x):
768 768 """Callback for looking up the linknode for manifests.
769 769
770 770 Returns the linkrev node for the specified manifest.
771 771
772 772 SIDE EFFECT:
773 773
774 774 1) fclnodes gets populated with the list of relevant
775 775 file nodes if we're not using fastpathlinkrev
776 776 2) When treemanifests are in use, collects treemanifest nodes
777 777 to send
778 778
779 779 Note that this means manifests must be completely sent to
780 780 the client before you can trust the list of files and
781 781 treemanifests to send.
782 782 """
783 783 clnode = mfs[x]
784 784 # We no longer actually care about reading deltas of
785 785 # the manifest here, because we already know the list
786 786 # of changed files, so for treemanifests (which
787 787 # lazily-load anyway to *generate* a readdelta) we can
788 788 # just load them with read() and then we'll actually
789 789 # be able to correctly load node IDs from the
790 790 # submanifest entries.
791 791 if 'treemanifest' in repo.requirements:
792 792 mdata = ml.read(x)
793 793 else:
794 794 mdata = ml.readfast(x)
795 795 for f in mfchangedfiles[x]:
796 796 try:
797 797 n = mdata[f]
798 798 except KeyError:
799 799 continue
800 800 # record the first changeset introducing this filelog
801 801 # version
802 802 fclnodes = fnodes.setdefault(f, {})
803 803 fclnode = fclnodes.setdefault(n, clnode)
804 804 if clrevorder[clnode] < clrevorder[fclnode]:
805 805 fclnodes[n] = clnode
806 806 # gather list of changed treemanifest nodes
807 807 if 'treemanifest' in repo.requirements:
808 808 submfs = {'/': mdata}
809 809 for dn, bn in _moddirs(mfchangedfiles[x]):
810 810 try:
811 811 submf = submfs[dn]
812 812 submf = submf._dirs[bn]
813 813 except KeyError:
814 814 continue # deleted directory, so nothing to send
815 815 submfs[submf.dir()] = submf
816 816 tmfclnodes = tmfnodes.setdefault(submf.dir(), {})
817 817 tmfclnode = tmfclnodes.setdefault(submf._node, clnode)
818 818 if clrevorder[clnode] < clrevorder[tmfclnode]:
819 819 tmfclnodes[n] = clnode
820 820 return clnode
821 821
822 822 mfnodes = self.prune(ml, mfs, commonrevs)
823 823 size = 0
824 824 for x in self._packmanifests('', mfnodes, lookupmflinknode):
825 825 size += len(x)
826 826 yield x
827 827 for dir, nodes in tmfnodes.iteritems():
828 for x in self._packmanifests(dir, nodes, nodes.get):
828 prunednodes = self.prune(ml.dirlog(dir), nodes, commonrevs)
829 for x in self._packmanifests(dir, prunednodes, nodes.get):
829 830 size += len(x)
830 831 yield x
831 832 self._verbosenote(_('%8.i (manifests)\n') % size)
832 833 yield self._manifestsdone()
833 834
834 835 # The 'source' parameter is useful for extensions
835 836 def generatefiles(self, changedfiles, linknodes, commonrevs, source):
836 837 repo = self._repo
837 838 progress = self._progress
838 839 msgbundling = _('bundling')
839 840
840 841 total = len(changedfiles)
841 842 # for progress output
842 843 msgfiles = _('files')
843 844 for i, fname in enumerate(sorted(changedfiles)):
844 845 filerevlog = repo.file(fname)
845 846 if not filerevlog:
846 847 raise error.Abort(_("empty or missing revlog for %s") % fname)
847 848
848 849 linkrevnodes = linknodes(filerevlog, fname)
849 850 # Lookup for filenodes, we collected the linkrev nodes above in the
850 851 # fastpath case and with lookupmf in the slowpath case.
851 852 def lookupfilelog(x):
852 853 return linkrevnodes[x]
853 854
854 855 filenodes = self.prune(filerevlog, linkrevnodes, commonrevs)
855 856 if filenodes:
856 857 progress(msgbundling, i + 1, item=fname, unit=msgfiles,
857 858 total=total)
858 859 h = self.fileheader(fname)
859 860 size = len(h)
860 861 yield h
861 862 for chunk in self.group(filenodes, filerevlog, lookupfilelog):
862 863 size += len(chunk)
863 864 yield chunk
864 865 self._verbosenote(_('%8.i %s\n') % (size, fname))
865 866 progress(msgbundling, None)
866 867
867 868 def deltaparent(self, revlog, rev, p1, p2, prev):
868 869 return prev
869 870
870 871 def revchunk(self, revlog, rev, prev, linknode):
871 872 node = revlog.node(rev)
872 873 p1, p2 = revlog.parentrevs(rev)
873 874 base = self.deltaparent(revlog, rev, p1, p2, prev)
874 875
875 876 prefix = ''
876 877 if revlog.iscensored(base) or revlog.iscensored(rev):
877 878 try:
878 879 delta = revlog.revision(node)
879 880 except error.CensoredNodeError as e:
880 881 delta = e.tombstone
881 882 if base == nullrev:
882 883 prefix = mdiff.trivialdiffheader(len(delta))
883 884 else:
884 885 baselen = revlog.rawsize(base)
885 886 prefix = mdiff.replacediffheader(baselen, len(delta))
886 887 elif base == nullrev:
887 888 delta = revlog.revision(node)
888 889 prefix = mdiff.trivialdiffheader(len(delta))
889 890 else:
890 891 delta = revlog.revdiff(base, rev)
891 892 p1n, p2n = revlog.parents(node)
892 893 basenode = revlog.node(base)
893 894 flags = revlog.flags(rev)
894 895 meta = self.builddeltaheader(node, p1n, p2n, basenode, linknode, flags)
895 896 meta += prefix
896 897 l = len(meta) + len(delta)
897 898 yield chunkheader(l)
898 899 yield meta
899 900 yield delta
900 901 def builddeltaheader(self, node, p1n, p2n, basenode, linknode, flags):
901 902 # do nothing with basenode, it is implicitly the previous one in HG10
902 903 # do nothing with flags, it is implicitly 0 for cg1 and cg2
903 904 return struct.pack(self.deltaheader, node, p1n, p2n, linknode)
904 905
905 906 class cg2packer(cg1packer):
906 907 version = '02'
907 908 deltaheader = _CHANGEGROUPV2_DELTA_HEADER
908 909
909 910 def __init__(self, repo, bundlecaps=None):
910 911 super(cg2packer, self).__init__(repo, bundlecaps)
911 912 if self._reorder is None:
912 913 # Since generaldelta is directly supported by cg2, reordering
913 914 # generally doesn't help, so we disable it by default (treating
914 915 # bundle.reorder=auto just like bundle.reorder=False).
915 916 self._reorder = False
916 917
917 918 def deltaparent(self, revlog, rev, p1, p2, prev):
918 919 dp = revlog.deltaparent(rev)
919 920 # avoid storing full revisions; pick prev in those cases
920 921 # also pick prev when we can't be sure remote has dp
921 922 if dp == nullrev or (dp != p1 and dp != p2 and dp != prev):
922 923 return prev
923 924 return dp
924 925
925 926 def builddeltaheader(self, node, p1n, p2n, basenode, linknode, flags):
926 927 # Do nothing with flags, it is implicitly 0 in cg1 and cg2
927 928 return struct.pack(self.deltaheader, node, p1n, p2n, basenode, linknode)
928 929
929 930 class cg3packer(cg2packer):
930 931 version = '03'
931 932 deltaheader = _CHANGEGROUPV3_DELTA_HEADER
932 933
933 934 def _packmanifests(self, dir, mfnodes, lookuplinknode):
934 935 if dir:
935 936 yield self.fileheader(dir)
936 937 for chunk in self.group(mfnodes, self._repo.manifest.dirlog(dir),
937 938 lookuplinknode, units=_('manifests')):
938 939 yield chunk
939 940
940 941 def _manifestsdone(self):
941 942 return self.close()
942 943
943 944 def builddeltaheader(self, node, p1n, p2n, basenode, linknode, flags):
944 945 return struct.pack(
945 946 self.deltaheader, node, p1n, p2n, basenode, linknode, flags)
946 947
947 948 _packermap = {'01': (cg1packer, cg1unpacker),
948 949 # cg2 adds support for exchanging generaldelta
949 950 '02': (cg2packer, cg2unpacker),
950 951 # cg3 adds support for exchanging revlog flags and treemanifests
951 952 '03': (cg3packer, cg3unpacker),
952 953 }
953 954
954 955 def allsupportedversions(ui):
955 956 versions = set(_packermap.keys())
956 957 versions.discard('03')
957 958 if (ui.configbool('experimental', 'changegroup3') or
958 959 ui.configbool('experimental', 'treemanifest')):
959 960 versions.add('03')
960 961 return versions
961 962
962 963 # Changegroup versions that can be applied to the repo
963 964 def supportedincomingversions(repo):
964 965 versions = allsupportedversions(repo.ui)
965 966 if 'treemanifest' in repo.requirements:
966 967 versions.add('03')
967 968 return versions
968 969
969 970 # Changegroup versions that can be created from the repo
970 971 def supportedoutgoingversions(repo):
971 972 versions = allsupportedversions(repo.ui)
972 973 if 'treemanifest' in repo.requirements:
973 974 # Versions 01 and 02 support only flat manifests and it's just too
974 975 # expensive to convert between the flat manifest and tree manifest on
975 976 # the fly. Since tree manifests are hashed differently, all of history
976 977 # would have to be converted. Instead, we simply don't even pretend to
977 978 # support versions 01 and 02.
978 979 versions.discard('01')
979 980 versions.discard('02')
980 981 versions.add('03')
981 982 return versions
982 983
983 984 def safeversion(repo):
984 985 # Finds the smallest version that it's safe to assume clients of the repo
985 986 # will support. For example, all hg versions that support generaldelta also
986 987 # support changegroup 02.
987 988 versions = supportedoutgoingversions(repo)
988 989 if 'generaldelta' in repo.requirements:
989 990 versions.discard('01')
990 991 assert versions
991 992 return min(versions)
992 993
993 994 def getbundler(version, repo, bundlecaps=None):
994 995 assert version in supportedoutgoingversions(repo)
995 996 return _packermap[version][0](repo, bundlecaps)
996 997
997 998 def getunbundler(version, fh, alg):
998 999 return _packermap[version][1](fh, alg)
999 1000
1000 1001 def _changegroupinfo(repo, nodes, source):
1001 1002 if repo.ui.verbose or source == 'bundle':
1002 1003 repo.ui.status(_("%d changesets found\n") % len(nodes))
1003 1004 if repo.ui.debugflag:
1004 1005 repo.ui.debug("list of changesets:\n")
1005 1006 for node in nodes:
1006 1007 repo.ui.debug("%s\n" % hex(node))
1007 1008
1008 1009 def getsubsetraw(repo, outgoing, bundler, source, fastpath=False):
1009 1010 repo = repo.unfiltered()
1010 1011 commonrevs = outgoing.common
1011 1012 csets = outgoing.missing
1012 1013 heads = outgoing.missingheads
1013 1014 # We go through the fast path if we get told to, or if all (unfiltered
1014 1015 # heads have been requested (since we then know there all linkrevs will
1015 1016 # be pulled by the client).
1016 1017 heads.sort()
1017 1018 fastpathlinkrev = fastpath or (
1018 1019 repo.filtername is None and heads == sorted(repo.heads()))
1019 1020
1020 1021 repo.hook('preoutgoing', throw=True, source=source)
1021 1022 _changegroupinfo(repo, csets, source)
1022 1023 return bundler.generate(commonrevs, csets, fastpathlinkrev, source)
1023 1024
1024 1025 def getsubset(repo, outgoing, bundler, source, fastpath=False):
1025 1026 gengroup = getsubsetraw(repo, outgoing, bundler, source, fastpath)
1026 1027 return getunbundler(bundler.version, util.chunkbuffer(gengroup), None)
1027 1028
1028 1029 def changegroupsubset(repo, roots, heads, source, version='01'):
1029 1030 """Compute a changegroup consisting of all the nodes that are
1030 1031 descendants of any of the roots and ancestors of any of the heads.
1031 1032 Return a chunkbuffer object whose read() method will return
1032 1033 successive changegroup chunks.
1033 1034
1034 1035 It is fairly complex as determining which filenodes and which
1035 1036 manifest nodes need to be included for the changeset to be complete
1036 1037 is non-trivial.
1037 1038
1038 1039 Another wrinkle is doing the reverse, figuring out which changeset in
1039 1040 the changegroup a particular filenode or manifestnode belongs to.
1040 1041 """
1041 1042 cl = repo.changelog
1042 1043 if not roots:
1043 1044 roots = [nullid]
1044 1045 discbases = []
1045 1046 for n in roots:
1046 1047 discbases.extend([p for p in cl.parents(n) if p != nullid])
1047 1048 # TODO: remove call to nodesbetween.
1048 1049 csets, roots, heads = cl.nodesbetween(roots, heads)
1049 1050 included = set(csets)
1050 1051 discbases = [n for n in discbases if n not in included]
1051 1052 outgoing = discovery.outgoing(cl, discbases, heads)
1052 1053 bundler = getbundler(version, repo)
1053 1054 return getsubset(repo, outgoing, bundler, source)
1054 1055
1055 1056 def getlocalchangegroupraw(repo, source, outgoing, bundlecaps=None,
1056 1057 version='01'):
1057 1058 """Like getbundle, but taking a discovery.outgoing as an argument.
1058 1059
1059 1060 This is only implemented for local repos and reuses potentially
1060 1061 precomputed sets in outgoing. Returns a raw changegroup generator."""
1061 1062 if not outgoing.missing:
1062 1063 return None
1063 1064 bundler = getbundler(version, repo, bundlecaps)
1064 1065 return getsubsetraw(repo, outgoing, bundler, source)
1065 1066
1066 1067 def getlocalchangegroup(repo, source, outgoing, bundlecaps=None,
1067 1068 version='01'):
1068 1069 """Like getbundle, but taking a discovery.outgoing as an argument.
1069 1070
1070 1071 This is only implemented for local repos and reuses potentially
1071 1072 precomputed sets in outgoing."""
1072 1073 if not outgoing.missing:
1073 1074 return None
1074 1075 bundler = getbundler(version, repo, bundlecaps)
1075 1076 return getsubset(repo, outgoing, bundler, source)
1076 1077
1077 1078 def computeoutgoing(repo, heads, common):
1078 1079 """Computes which revs are outgoing given a set of common
1079 1080 and a set of heads.
1080 1081
1081 1082 This is a separate function so extensions can have access to
1082 1083 the logic.
1083 1084
1084 1085 Returns a discovery.outgoing object.
1085 1086 """
1086 1087 cl = repo.changelog
1087 1088 if common:
1088 1089 hasnode = cl.hasnode
1089 1090 common = [n for n in common if hasnode(n)]
1090 1091 else:
1091 1092 common = [nullid]
1092 1093 if not heads:
1093 1094 heads = cl.heads()
1094 1095 return discovery.outgoing(cl, common, heads)
1095 1096
1096 1097 def getchangegroup(repo, source, heads=None, common=None, bundlecaps=None,
1097 1098 version='01'):
1098 1099 """Like changegroupsubset, but returns the set difference between the
1099 1100 ancestors of heads and the ancestors common.
1100 1101
1101 1102 If heads is None, use the local heads. If common is None, use [nullid].
1102 1103
1103 1104 The nodes in common might not all be known locally due to the way the
1104 1105 current discovery protocol works.
1105 1106 """
1106 1107 outgoing = computeoutgoing(repo, heads, common)
1107 1108 return getlocalchangegroup(repo, source, outgoing, bundlecaps=bundlecaps,
1108 1109 version=version)
1109 1110
1110 1111 def changegroup(repo, basenodes, source):
1111 1112 # to avoid a race we use changegroupsubset() (issue1320)
1112 1113 return changegroupsubset(repo, basenodes, repo.heads(), source)
1113 1114
1114 1115 def _addchangegroupfiles(repo, source, revmap, trp, pr, needfiles):
1115 1116 revisions = 0
1116 1117 files = 0
1117 1118 while True:
1118 1119 chunkdata = source.filelogheader()
1119 1120 if not chunkdata:
1120 1121 break
1121 1122 f = chunkdata["filename"]
1122 1123 repo.ui.debug("adding %s revisions\n" % f)
1123 1124 pr()
1124 1125 fl = repo.file(f)
1125 1126 o = len(fl)
1126 1127 try:
1127 1128 if not fl.addgroup(source, revmap, trp):
1128 1129 raise error.Abort(_("received file revlog group is empty"))
1129 1130 except error.CensoredBaseError as e:
1130 1131 raise error.Abort(_("received delta base is censored: %s") % e)
1131 1132 revisions += len(fl) - o
1132 1133 files += 1
1133 1134 if f in needfiles:
1134 1135 needs = needfiles[f]
1135 1136 for new in xrange(o, len(fl)):
1136 1137 n = fl.node(new)
1137 1138 if n in needs:
1138 1139 needs.remove(n)
1139 1140 else:
1140 1141 raise error.Abort(
1141 1142 _("received spurious file revlog entry"))
1142 1143 if not needs:
1143 1144 del needfiles[f]
1144 1145 repo.ui.progress(_('files'), None)
1145 1146
1146 1147 for f, needs in needfiles.iteritems():
1147 1148 fl = repo.file(f)
1148 1149 for n in needs:
1149 1150 try:
1150 1151 fl.rev(n)
1151 1152 except error.LookupError:
1152 1153 raise error.Abort(
1153 1154 _('missing file data for %s:%s - run hg verify') %
1154 1155 (f, hex(n)))
1155 1156
1156 1157 return revisions, files
General Comments 0
You need to be logged in to leave comments. Login now