Show More
@@ -320,19 +320,25 b' def _derivefilesfrommanifests(repo, mani' | |||
|
320 | 320 | ml = repo.manifestlog |
|
321 | 321 | fnodes = collections.defaultdict(dict) |
|
322 | 322 | |
|
323 | for manifestnode in manifestnodes: | |
|
324 | m = ml.get(b'', manifestnode) | |
|
323 | progress = repo.ui.makeprogress( | |
|
324 | _('scanning manifests'), total=len(manifestnodes)) | |
|
325 | ||
|
326 | with progress: | |
|
327 | for manifestnode in manifestnodes: | |
|
328 | m = ml.get(b'', manifestnode) | |
|
325 | 329 | |
|
326 | # TODO this will pull in unwanted nodes because it takes the storage | |
|
327 |
# delta into consideration. What we really want is something that |
|
|
328 |
# the delta between the manifest's parents. And ideally we |
|
|
329 |
# ignore file nodes that are known locally. For now, ignore |
|
|
330 |
# these limitations. This will result in incremental fetches |
|
|
331 | # data we already have. So this is far from ideal. | |
|
332 | md = m.readfast() | |
|
330 | # TODO this will pull in unwanted nodes because it takes the storage | |
|
331 | # delta into consideration. What we really want is something that | |
|
332 | # takes the delta between the manifest's parents. And ideally we | |
|
333 | # would ignore file nodes that are known locally. For now, ignore | |
|
334 | # both these limitations. This will result in incremental fetches | |
|
335 | # requesting data we already have. So this is far from ideal. | |
|
336 | md = m.readfast() | |
|
333 | 337 | |
|
334 | for path, fnode in md.items(): | |
|
335 | fnodes[path].setdefault(fnode, manifestnode) | |
|
338 | for path, fnode in md.items(): | |
|
339 | fnodes[path].setdefault(fnode, manifestnode) | |
|
340 | ||
|
341 | progress.increment() | |
|
336 | 342 | |
|
337 | 343 | return fnodes |
|
338 | 344 |
General Comments 0
You need to be logged in to leave comments.
Login now