Show More
@@ -196,6 +196,7 b' def manifestmerge(repo, wctx, p2, pa, br' | |||||
196 | overwrite = force and not branchmerge |
|
196 | overwrite = force and not branchmerge | |
197 | actions, copy, movewithdir = [], {}, {} |
|
197 | actions, copy, movewithdir = [], {}, {} | |
198 |
|
198 | |||
|
199 | followcopies = False | |||
199 | if overwrite: |
|
200 | if overwrite: | |
200 | pa = wctx |
|
201 | pa = wctx | |
201 | elif pa == p2: # backwards |
|
202 | elif pa == p2: # backwards | |
@@ -203,6 +204,13 b' def manifestmerge(repo, wctx, p2, pa, br' | |||||
203 | elif not branchmerge and not wctx.dirty(missing=True): |
|
204 | elif not branchmerge and not wctx.dirty(missing=True): | |
204 | pass |
|
205 | pass | |
205 | elif pa and repo.ui.configbool("merge", "followcopies", True): |
|
206 | elif pa and repo.ui.configbool("merge", "followcopies", True): | |
|
207 | followcopies = True | |||
|
208 | ||||
|
209 | # manifests fetched in order are going to be faster, so prime the caches | |||
|
210 | [x.manifest() for x in | |||
|
211 | sorted(wctx.parents() + [p2, pa], key=lambda x: x.rev())] | |||
|
212 | ||||
|
213 | if followcopies: | |||
206 | ret = copies.mergecopies(repo, wctx, p2, pa) |
|
214 | ret = copies.mergecopies(repo, wctx, p2, pa) | |
207 | copy, movewithdir, diverge, renamedelete = ret |
|
215 | copy, movewithdir, diverge, renamedelete = ret | |
208 | for of, fl in diverge.iteritems(): |
|
216 | for of, fl in diverge.iteritems(): |
General Comments 0
You need to be logged in to leave comments.
Login now