Show More
@@ -1,733 +1,737 b'' | |||||
1 | # rebase.py - rebasing feature for mercurial |
|
1 | # rebase.py - rebasing feature for mercurial | |
2 | # |
|
2 | # | |
3 | # Copyright 2008 Stefano Tortarolo <stefano.tortarolo at gmail dot com> |
|
3 | # Copyright 2008 Stefano Tortarolo <stefano.tortarolo at gmail dot com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | '''command to move sets of revisions to a different ancestor |
|
8 | '''command to move sets of revisions to a different ancestor | |
9 |
|
9 | |||
10 | This extension lets you rebase changesets in an existing Mercurial |
|
10 | This extension lets you rebase changesets in an existing Mercurial | |
11 | repository. |
|
11 | repository. | |
12 |
|
12 | |||
13 | For more information: |
|
13 | For more information: | |
14 | http://mercurial.selenic.com/wiki/RebaseExtension |
|
14 | http://mercurial.selenic.com/wiki/RebaseExtension | |
15 | ''' |
|
15 | ''' | |
16 |
|
16 | |||
17 | from mercurial import hg, util, repair, merge, cmdutil, commands, bookmarks |
|
17 | from mercurial import hg, util, repair, merge, cmdutil, commands, bookmarks | |
18 | from mercurial import extensions, patch, scmutil, phases, obsolete |
|
18 | from mercurial import extensions, patch, scmutil, phases, obsolete | |
19 | from mercurial.commands import templateopts |
|
19 | from mercurial.commands import templateopts | |
20 | from mercurial.node import nullrev |
|
20 | from mercurial.node import nullrev | |
21 | from mercurial.lock import release |
|
21 | from mercurial.lock import release | |
22 | from mercurial.i18n import _ |
|
22 | from mercurial.i18n import _ | |
23 | import os, errno |
|
23 | import os, errno | |
24 |
|
24 | |||
25 | nullmerge = -2 |
|
25 | nullmerge = -2 | |
26 |
|
26 | |||
27 | cmdtable = {} |
|
27 | cmdtable = {} | |
28 | command = cmdutil.command(cmdtable) |
|
28 | command = cmdutil.command(cmdtable) | |
29 | testedwith = 'internal' |
|
29 | testedwith = 'internal' | |
30 |
|
30 | |||
31 | @command('rebase', |
|
31 | @command('rebase', | |
32 | [('s', 'source', '', |
|
32 | [('s', 'source', '', | |
33 | _('rebase from the specified changeset'), _('REV')), |
|
33 | _('rebase from the specified changeset'), _('REV')), | |
34 | ('b', 'base', '', |
|
34 | ('b', 'base', '', | |
35 | _('rebase from the base of the specified changeset ' |
|
35 | _('rebase from the base of the specified changeset ' | |
36 | '(up to greatest common ancestor of base and dest)'), |
|
36 | '(up to greatest common ancestor of base and dest)'), | |
37 | _('REV')), |
|
37 | _('REV')), | |
38 | ('r', 'rev', [], |
|
38 | ('r', 'rev', [], | |
39 | _('rebase these revisions'), |
|
39 | _('rebase these revisions'), | |
40 | _('REV')), |
|
40 | _('REV')), | |
41 | ('d', 'dest', '', |
|
41 | ('d', 'dest', '', | |
42 | _('rebase onto the specified changeset'), _('REV')), |
|
42 | _('rebase onto the specified changeset'), _('REV')), | |
43 | ('', 'collapse', False, _('collapse the rebased changesets')), |
|
43 | ('', 'collapse', False, _('collapse the rebased changesets')), | |
44 | ('m', 'message', '', |
|
44 | ('m', 'message', '', | |
45 | _('use text as collapse commit message'), _('TEXT')), |
|
45 | _('use text as collapse commit message'), _('TEXT')), | |
46 | ('e', 'edit', False, _('invoke editor on commit messages')), |
|
46 | ('e', 'edit', False, _('invoke editor on commit messages')), | |
47 | ('l', 'logfile', '', |
|
47 | ('l', 'logfile', '', | |
48 | _('read collapse commit message from file'), _('FILE')), |
|
48 | _('read collapse commit message from file'), _('FILE')), | |
49 | ('', 'keep', False, _('keep original changesets')), |
|
49 | ('', 'keep', False, _('keep original changesets')), | |
50 | ('', 'keepbranches', False, _('keep original branch names')), |
|
50 | ('', 'keepbranches', False, _('keep original branch names')), | |
51 | ('D', 'detach', False, _('(DEPRECATED)')), |
|
51 | ('D', 'detach', False, _('(DEPRECATED)')), | |
52 | ('t', 'tool', '', _('specify merge tool')), |
|
52 | ('t', 'tool', '', _('specify merge tool')), | |
53 | ('c', 'continue', False, _('continue an interrupted rebase')), |
|
53 | ('c', 'continue', False, _('continue an interrupted rebase')), | |
54 | ('a', 'abort', False, _('abort an interrupted rebase'))] + |
|
54 | ('a', 'abort', False, _('abort an interrupted rebase'))] + | |
55 | templateopts, |
|
55 | templateopts, | |
56 | _('[-s REV | -b REV] [-d REV] [OPTION]')) |
|
56 | _('[-s REV | -b REV] [-d REV] [OPTION]')) | |
57 | def rebase(ui, repo, **opts): |
|
57 | def rebase(ui, repo, **opts): | |
58 | """move changeset (and descendants) to a different branch |
|
58 | """move changeset (and descendants) to a different branch | |
59 |
|
59 | |||
60 | Rebase uses repeated merging to graft changesets from one part of |
|
60 | Rebase uses repeated merging to graft changesets from one part of | |
61 | history (the source) onto another (the destination). This can be |
|
61 | history (the source) onto another (the destination). This can be | |
62 | useful for linearizing *local* changes relative to a master |
|
62 | useful for linearizing *local* changes relative to a master | |
63 | development tree. |
|
63 | development tree. | |
64 |
|
64 | |||
65 | You should not rebase changesets that have already been shared |
|
65 | You should not rebase changesets that have already been shared | |
66 | with others. Doing so will force everybody else to perform the |
|
66 | with others. Doing so will force everybody else to perform the | |
67 | same rebase or they will end up with duplicated changesets after |
|
67 | same rebase or they will end up with duplicated changesets after | |
68 | pulling in your rebased changesets. |
|
68 | pulling in your rebased changesets. | |
69 |
|
69 | |||
70 | If you don't specify a destination changeset (``-d/--dest``), |
|
70 | If you don't specify a destination changeset (``-d/--dest``), | |
71 | rebase uses the tipmost head of the current named branch as the |
|
71 | rebase uses the tipmost head of the current named branch as the | |
72 | destination. (The destination changeset is not modified by |
|
72 | destination. (The destination changeset is not modified by | |
73 | rebasing, but new changesets are added as its descendants.) |
|
73 | rebasing, but new changesets are added as its descendants.) | |
74 |
|
74 | |||
75 | You can specify which changesets to rebase in two ways: as a |
|
75 | You can specify which changesets to rebase in two ways: as a | |
76 | "source" changeset or as a "base" changeset. Both are shorthand |
|
76 | "source" changeset or as a "base" changeset. Both are shorthand | |
77 | for a topologically related set of changesets (the "source |
|
77 | for a topologically related set of changesets (the "source | |
78 | branch"). If you specify source (``-s/--source``), rebase will |
|
78 | branch"). If you specify source (``-s/--source``), rebase will | |
79 | rebase that changeset and all of its descendants onto dest. If you |
|
79 | rebase that changeset and all of its descendants onto dest. If you | |
80 | specify base (``-b/--base``), rebase will select ancestors of base |
|
80 | specify base (``-b/--base``), rebase will select ancestors of base | |
81 | back to but not including the common ancestor with dest. Thus, |
|
81 | back to but not including the common ancestor with dest. Thus, | |
82 | ``-b`` is less precise but more convenient than ``-s``: you can |
|
82 | ``-b`` is less precise but more convenient than ``-s``: you can | |
83 | specify any changeset in the source branch, and rebase will select |
|
83 | specify any changeset in the source branch, and rebase will select | |
84 | the whole branch. If you specify neither ``-s`` nor ``-b``, rebase |
|
84 | the whole branch. If you specify neither ``-s`` nor ``-b``, rebase | |
85 | uses the parent of the working directory as the base. |
|
85 | uses the parent of the working directory as the base. | |
86 |
|
86 | |||
87 | By default, rebase recreates the changesets in the source branch |
|
87 | By default, rebase recreates the changesets in the source branch | |
88 | as descendants of dest and then destroys the originals. Use |
|
88 | as descendants of dest and then destroys the originals. Use | |
89 | ``--keep`` to preserve the original source changesets. Some |
|
89 | ``--keep`` to preserve the original source changesets. Some | |
90 | changesets in the source branch (e.g. merges from the destination |
|
90 | changesets in the source branch (e.g. merges from the destination | |
91 | branch) may be dropped if they no longer contribute any change. |
|
91 | branch) may be dropped if they no longer contribute any change. | |
92 |
|
92 | |||
93 | One result of the rules for selecting the destination changeset |
|
93 | One result of the rules for selecting the destination changeset | |
94 | and source branch is that, unlike ``merge``, rebase will do |
|
94 | and source branch is that, unlike ``merge``, rebase will do | |
95 | nothing if you are at the latest (tipmost) head of a named branch |
|
95 | nothing if you are at the latest (tipmost) head of a named branch | |
96 | with two heads. You need to explicitly specify source and/or |
|
96 | with two heads. You need to explicitly specify source and/or | |
97 | destination (or ``update`` to the other head, if it's the head of |
|
97 | destination (or ``update`` to the other head, if it's the head of | |
98 | the intended source branch). |
|
98 | the intended source branch). | |
99 |
|
99 | |||
100 | If a rebase is interrupted to manually resolve a merge, it can be |
|
100 | If a rebase is interrupted to manually resolve a merge, it can be | |
101 | continued with --continue/-c or aborted with --abort/-a. |
|
101 | continued with --continue/-c or aborted with --abort/-a. | |
102 |
|
102 | |||
103 | Returns 0 on success, 1 if nothing to rebase. |
|
103 | Returns 0 on success, 1 if nothing to rebase. | |
104 | """ |
|
104 | """ | |
105 | originalwd = target = None |
|
105 | originalwd = target = None | |
106 | external = nullrev |
|
106 | external = nullrev | |
107 | state = {} |
|
107 | state = {} | |
108 | skipped = set() |
|
108 | skipped = set() | |
109 | targetancestors = set() |
|
109 | targetancestors = set() | |
110 |
|
110 | |||
111 | editor = None |
|
111 | editor = None | |
112 | if opts.get('edit'): |
|
112 | if opts.get('edit'): | |
113 | editor = cmdutil.commitforceeditor |
|
113 | editor = cmdutil.commitforceeditor | |
114 |
|
114 | |||
115 | lock = wlock = None |
|
115 | lock = wlock = None | |
116 | try: |
|
116 | try: | |
117 | wlock = repo.wlock() |
|
117 | wlock = repo.wlock() | |
118 | lock = repo.lock() |
|
118 | lock = repo.lock() | |
119 |
|
119 | |||
120 | # Validate input and define rebasing points |
|
120 | # Validate input and define rebasing points | |
121 | destf = opts.get('dest', None) |
|
121 | destf = opts.get('dest', None) | |
122 | srcf = opts.get('source', None) |
|
122 | srcf = opts.get('source', None) | |
123 | basef = opts.get('base', None) |
|
123 | basef = opts.get('base', None) | |
124 | revf = opts.get('rev', []) |
|
124 | revf = opts.get('rev', []) | |
125 | contf = opts.get('continue') |
|
125 | contf = opts.get('continue') | |
126 | abortf = opts.get('abort') |
|
126 | abortf = opts.get('abort') | |
127 | collapsef = opts.get('collapse', False) |
|
127 | collapsef = opts.get('collapse', False) | |
128 | collapsemsg = cmdutil.logmessage(ui, opts) |
|
128 | collapsemsg = cmdutil.logmessage(ui, opts) | |
129 | extrafn = opts.get('extrafn') # internal, used by e.g. hgsubversion |
|
129 | extrafn = opts.get('extrafn') # internal, used by e.g. hgsubversion | |
130 | keepf = opts.get('keep', False) |
|
130 | keepf = opts.get('keep', False) | |
131 | keepbranchesf = opts.get('keepbranches', False) |
|
131 | keepbranchesf = opts.get('keepbranches', False) | |
132 | # keepopen is not meant for use on the command line, but by |
|
132 | # keepopen is not meant for use on the command line, but by | |
133 | # other extensions |
|
133 | # other extensions | |
134 | keepopen = opts.get('keepopen', False) |
|
134 | keepopen = opts.get('keepopen', False) | |
135 |
|
135 | |||
136 | if collapsemsg and not collapsef: |
|
136 | if collapsemsg and not collapsef: | |
137 | raise util.Abort( |
|
137 | raise util.Abort( | |
138 | _('message can only be specified with collapse')) |
|
138 | _('message can only be specified with collapse')) | |
139 |
|
139 | |||
140 | if contf or abortf: |
|
140 | if contf or abortf: | |
141 | if contf and abortf: |
|
141 | if contf and abortf: | |
142 | raise util.Abort(_('cannot use both abort and continue')) |
|
142 | raise util.Abort(_('cannot use both abort and continue')) | |
143 | if collapsef: |
|
143 | if collapsef: | |
144 | raise util.Abort( |
|
144 | raise util.Abort( | |
145 | _('cannot use collapse with continue or abort')) |
|
145 | _('cannot use collapse with continue or abort')) | |
146 | if srcf or basef or destf: |
|
146 | if srcf or basef or destf: | |
147 | raise util.Abort( |
|
147 | raise util.Abort( | |
148 | _('abort and continue do not allow specifying revisions')) |
|
148 | _('abort and continue do not allow specifying revisions')) | |
149 | if opts.get('tool', False): |
|
149 | if opts.get('tool', False): | |
150 | ui.warn(_('tool option will be ignored\n')) |
|
150 | ui.warn(_('tool option will be ignored\n')) | |
151 |
|
151 | |||
152 | (originalwd, target, state, skipped, collapsef, keepf, |
|
152 | (originalwd, target, state, skipped, collapsef, keepf, | |
153 | keepbranchesf, external) = restorestatus(repo) |
|
153 | keepbranchesf, external) = restorestatus(repo) | |
154 | if abortf: |
|
154 | if abortf: | |
155 | return abort(repo, originalwd, target, state) |
|
155 | return abort(repo, originalwd, target, state) | |
156 | else: |
|
156 | else: | |
157 | if srcf and basef: |
|
157 | if srcf and basef: | |
158 | raise util.Abort(_('cannot specify both a ' |
|
158 | raise util.Abort(_('cannot specify both a ' | |
159 | 'source and a base')) |
|
159 | 'source and a base')) | |
160 | if revf and basef: |
|
160 | if revf and basef: | |
161 | raise util.Abort(_('cannot specify both a ' |
|
161 | raise util.Abort(_('cannot specify both a ' | |
162 | 'revision and a base')) |
|
162 | 'revision and a base')) | |
163 | if revf and srcf: |
|
163 | if revf and srcf: | |
164 | raise util.Abort(_('cannot specify both a ' |
|
164 | raise util.Abort(_('cannot specify both a ' | |
165 | 'revision and a source')) |
|
165 | 'revision and a source')) | |
166 |
|
166 | |||
167 | cmdutil.bailifchanged(repo) |
|
167 | cmdutil.bailifchanged(repo) | |
168 |
|
168 | |||
169 | if not destf: |
|
169 | if not destf: | |
170 | # Destination defaults to the latest revision in the |
|
170 | # Destination defaults to the latest revision in the | |
171 | # current branch |
|
171 | # current branch | |
172 | branch = repo[None].branch() |
|
172 | branch = repo[None].branch() | |
173 | dest = repo[branch] |
|
173 | dest = repo[branch] | |
174 | else: |
|
174 | else: | |
175 | dest = scmutil.revsingle(repo, destf) |
|
175 | dest = scmutil.revsingle(repo, destf) | |
176 |
|
176 | |||
177 | if revf: |
|
177 | if revf: | |
178 | rebaseset = repo.revs('%lr', revf) |
|
178 | rebaseset = repo.revs('%lr', revf) | |
179 | elif srcf: |
|
179 | elif srcf: | |
180 | src = scmutil.revrange(repo, [srcf]) |
|
180 | src = scmutil.revrange(repo, [srcf]) | |
181 | rebaseset = repo.revs('(%ld)::', src) |
|
181 | rebaseset = repo.revs('(%ld)::', src) | |
182 | else: |
|
182 | else: | |
183 | base = scmutil.revrange(repo, [basef or '.']) |
|
183 | base = scmutil.revrange(repo, [basef or '.']) | |
184 | rebaseset = repo.revs( |
|
184 | rebaseset = repo.revs( | |
185 | '(children(ancestor(%ld, %d)) and ::(%ld))::', |
|
185 | '(children(ancestor(%ld, %d)) and ::(%ld))::', | |
186 | base, dest, base) |
|
186 | base, dest, base) | |
187 | # temporary top level filtering of extinct revisions |
|
187 | # temporary top level filtering of extinct revisions | |
188 | rebaseset = repo.revs('%ld - hidden()', rebaseset) |
|
188 | rebaseset = repo.revs('%ld - hidden()', rebaseset) | |
189 | if rebaseset: |
|
189 | if rebaseset: | |
190 | root = min(rebaseset) |
|
190 | root = min(rebaseset) | |
191 | else: |
|
191 | else: | |
192 | root = None |
|
192 | root = None | |
193 |
|
193 | |||
194 | if not rebaseset: |
|
194 | if not rebaseset: | |
195 | repo.ui.debug('base is ancestor of destination\n') |
|
195 | repo.ui.debug('base is ancestor of destination\n') | |
196 | result = None |
|
196 | result = None | |
197 | elif not keepf and repo.revs('first(children(%ld) - %ld)-hidden()', |
|
197 | elif not keepf and repo.revs('first(children(%ld) - %ld)-hidden()', | |
198 | rebaseset, rebaseset): |
|
198 | rebaseset, rebaseset): | |
199 | raise util.Abort( |
|
199 | raise util.Abort( | |
200 | _("can't remove original changesets with" |
|
200 | _("can't remove original changesets with" | |
201 | " unrebased descendants"), |
|
201 | " unrebased descendants"), | |
202 | hint=_('use --keep to keep original changesets')) |
|
202 | hint=_('use --keep to keep original changesets')) | |
203 | elif not keepf and not repo[root].mutable(): |
|
203 | elif not keepf and not repo[root].mutable(): | |
204 | raise util.Abort(_("can't rebase immutable changeset %s") |
|
204 | raise util.Abort(_("can't rebase immutable changeset %s") | |
205 | % repo[root], |
|
205 | % repo[root], | |
206 | hint=_('see hg help phases for details')) |
|
206 | hint=_('see hg help phases for details')) | |
207 | else: |
|
207 | else: | |
208 | result = buildstate(repo, dest, rebaseset, collapsef) |
|
208 | result = buildstate(repo, dest, rebaseset, collapsef) | |
209 |
|
209 | |||
210 | if not result: |
|
210 | if not result: | |
211 | # Empty state built, nothing to rebase |
|
211 | # Empty state built, nothing to rebase | |
212 | ui.status(_('nothing to rebase\n')) |
|
212 | ui.status(_('nothing to rebase\n')) | |
213 | return 1 |
|
213 | return 1 | |
214 | else: |
|
214 | else: | |
215 | originalwd, target, state = result |
|
215 | originalwd, target, state = result | |
216 | if collapsef: |
|
216 | if collapsef: | |
217 | targetancestors = set(repo.changelog.ancestors([target])) |
|
217 | targetancestors = set(repo.changelog.ancestors([target])) | |
218 | targetancestors.add(target) |
|
218 | targetancestors.add(target) | |
219 | external = checkexternal(repo, state, targetancestors) |
|
219 | external = checkexternal(repo, state, targetancestors) | |
220 |
|
220 | |||
221 | if keepbranchesf: |
|
221 | if keepbranchesf: | |
222 | assert not extrafn, 'cannot use both keepbranches and extrafn' |
|
222 | assert not extrafn, 'cannot use both keepbranches and extrafn' | |
223 | def extrafn(ctx, extra): |
|
223 | def extrafn(ctx, extra): | |
224 | extra['branch'] = ctx.branch() |
|
224 | extra['branch'] = ctx.branch() | |
225 | if collapsef: |
|
225 | if collapsef: | |
226 | branches = set() |
|
226 | branches = set() | |
227 | for rev in state: |
|
227 | for rev in state: | |
228 | branches.add(repo[rev].branch()) |
|
228 | branches.add(repo[rev].branch()) | |
229 | if len(branches) > 1: |
|
229 | if len(branches) > 1: | |
230 | raise util.Abort(_('cannot collapse multiple named ' |
|
230 | raise util.Abort(_('cannot collapse multiple named ' | |
231 | 'branches')) |
|
231 | 'branches')) | |
232 |
|
232 | |||
233 |
|
233 | |||
234 | # Rebase |
|
234 | # Rebase | |
235 | if not targetancestors: |
|
235 | if not targetancestors: | |
236 | targetancestors = set(repo.changelog.ancestors([target])) |
|
236 | targetancestors = set(repo.changelog.ancestors([target])) | |
237 | targetancestors.add(target) |
|
237 | targetancestors.add(target) | |
238 |
|
238 | |||
239 | # Keep track of the current bookmarks in order to reset them later |
|
239 | # Keep track of the current bookmarks in order to reset them later | |
240 | currentbookmarks = repo._bookmarks.copy() |
|
240 | currentbookmarks = repo._bookmarks.copy() | |
241 | activebookmark = repo._bookmarkcurrent |
|
241 | activebookmark = repo._bookmarkcurrent | |
242 | if activebookmark: |
|
242 | if activebookmark: | |
243 | bookmarks.unsetcurrent(repo) |
|
243 | bookmarks.unsetcurrent(repo) | |
244 |
|
244 | |||
245 | sortedstate = sorted(state) |
|
245 | sortedstate = sorted(state) | |
246 | total = len(sortedstate) |
|
246 | total = len(sortedstate) | |
247 | pos = 0 |
|
247 | pos = 0 | |
248 | for rev in sortedstate: |
|
248 | for rev in sortedstate: | |
249 | pos += 1 |
|
249 | pos += 1 | |
250 | if state[rev] == -1: |
|
250 | if state[rev] == -1: | |
251 | ui.progress(_("rebasing"), pos, ("%d:%s" % (rev, repo[rev])), |
|
251 | ui.progress(_("rebasing"), pos, ("%d:%s" % (rev, repo[rev])), | |
252 | _('changesets'), total) |
|
252 | _('changesets'), total) | |
253 | storestatus(repo, originalwd, target, state, collapsef, keepf, |
|
253 | storestatus(repo, originalwd, target, state, collapsef, keepf, | |
254 | keepbranchesf, external) |
|
254 | keepbranchesf, external) | |
255 | p1, p2 = defineparents(repo, rev, target, state, |
|
255 | p1, p2 = defineparents(repo, rev, target, state, | |
256 | targetancestors) |
|
256 | targetancestors) | |
257 | if len(repo.parents()) == 2: |
|
257 | if len(repo.parents()) == 2: | |
258 | repo.ui.debug('resuming interrupted rebase\n') |
|
258 | repo.ui.debug('resuming interrupted rebase\n') | |
259 | else: |
|
259 | else: | |
260 | try: |
|
260 | try: | |
261 | ui.setconfig('ui', 'forcemerge', opts.get('tool', '')) |
|
261 | ui.setconfig('ui', 'forcemerge', opts.get('tool', '')) | |
262 | stats = rebasenode(repo, rev, p1, state, collapsef) |
|
262 | stats = rebasenode(repo, rev, p1, state, collapsef) | |
263 | if stats and stats[3] > 0: |
|
263 | if stats and stats[3] > 0: | |
264 | raise util.Abort(_('unresolved conflicts (see hg ' |
|
264 | raise util.Abort(_('unresolved conflicts (see hg ' | |
265 | 'resolve, then hg rebase --continue)')) |
|
265 | 'resolve, then hg rebase --continue)')) | |
266 | finally: |
|
266 | finally: | |
267 | ui.setconfig('ui', 'forcemerge', '') |
|
267 | ui.setconfig('ui', 'forcemerge', '') | |
268 | cmdutil.duplicatecopies(repo, rev, target) |
|
268 | cmdutil.duplicatecopies(repo, rev, target) | |
269 | if not collapsef: |
|
269 | if not collapsef: | |
270 | newrev = concludenode(repo, rev, p1, p2, extrafn=extrafn, |
|
270 | newrev = concludenode(repo, rev, p1, p2, extrafn=extrafn, | |
271 | editor=editor) |
|
271 | editor=editor) | |
272 | else: |
|
272 | else: | |
273 | # Skip commit if we are collapsing |
|
273 | # Skip commit if we are collapsing | |
274 | repo.setparents(repo[p1].node()) |
|
274 | repo.setparents(repo[p1].node()) | |
275 | newrev = None |
|
275 | newrev = None | |
276 | # Update the state |
|
276 | # Update the state | |
277 | if newrev is not None: |
|
277 | if newrev is not None: | |
278 | state[rev] = repo[newrev].rev() |
|
278 | state[rev] = repo[newrev].rev() | |
279 | else: |
|
279 | else: | |
280 | if not collapsef: |
|
280 | if not collapsef: | |
281 | ui.note(_('no changes, revision %d skipped\n') % rev) |
|
281 | ui.note(_('no changes, revision %d skipped\n') % rev) | |
282 | ui.debug('next revision set to %s\n' % p1) |
|
282 | ui.debug('next revision set to %s\n' % p1) | |
283 | skipped.add(rev) |
|
283 | skipped.add(rev) | |
284 | state[rev] = p1 |
|
284 | state[rev] = p1 | |
285 |
|
285 | |||
286 | ui.progress(_('rebasing'), None) |
|
286 | ui.progress(_('rebasing'), None) | |
287 | ui.note(_('rebase merging completed\n')) |
|
287 | ui.note(_('rebase merging completed\n')) | |
288 |
|
288 | |||
289 | if collapsef and not keepopen: |
|
289 | if collapsef and not keepopen: | |
290 | p1, p2 = defineparents(repo, min(state), target, |
|
290 | p1, p2 = defineparents(repo, min(state), target, | |
291 | state, targetancestors) |
|
291 | state, targetancestors) | |
292 | if collapsemsg: |
|
292 | if collapsemsg: | |
293 | commitmsg = collapsemsg |
|
293 | commitmsg = collapsemsg | |
294 | else: |
|
294 | else: | |
295 | commitmsg = 'Collapsed revision' |
|
295 | commitmsg = 'Collapsed revision' | |
296 | for rebased in state: |
|
296 | for rebased in state: | |
297 | if rebased not in skipped and state[rebased] != nullmerge: |
|
297 | if rebased not in skipped and state[rebased] != nullmerge: | |
298 | commitmsg += '\n* %s' % repo[rebased].description() |
|
298 | commitmsg += '\n* %s' % repo[rebased].description() | |
299 | commitmsg = ui.edit(commitmsg, repo.ui.username()) |
|
299 | commitmsg = ui.edit(commitmsg, repo.ui.username()) | |
300 | newrev = concludenode(repo, rev, p1, external, commitmsg=commitmsg, |
|
300 | newrev = concludenode(repo, rev, p1, external, commitmsg=commitmsg, | |
301 | extrafn=extrafn, editor=editor) |
|
301 | extrafn=extrafn, editor=editor) | |
302 |
|
302 | |||
303 | if 'qtip' in repo.tags(): |
|
303 | if 'qtip' in repo.tags(): | |
304 | updatemq(repo, state, skipped, **opts) |
|
304 | updatemq(repo, state, skipped, **opts) | |
305 |
|
305 | |||
306 | if currentbookmarks: |
|
306 | if currentbookmarks: | |
307 | # Nodeids are needed to reset bookmarks |
|
307 | # Nodeids are needed to reset bookmarks | |
308 | nstate = {} |
|
308 | nstate = {} | |
309 | for k, v in state.iteritems(): |
|
309 | for k, v in state.iteritems(): | |
310 | if v != nullmerge: |
|
310 | if v != nullmerge: | |
311 | nstate[repo[k].node()] = repo[v].node() |
|
311 | nstate[repo[k].node()] = repo[v].node() | |
312 |
|
312 | |||
313 | if not keepf: |
|
313 | if not keepf: | |
314 | collapsedas = None |
|
314 | collapsedas = None | |
315 | if collapsef: |
|
315 | if collapsef: | |
316 | collapsedas = newrev |
|
316 | collapsedas = newrev | |
317 | clearrebased(ui, repo, state, collapsedas) |
|
317 | clearrebased(ui, repo, state, collapsedas) | |
318 |
|
318 | |||
319 | if currentbookmarks: |
|
319 | if currentbookmarks: | |
320 | updatebookmarks(repo, nstate, currentbookmarks, **opts) |
|
320 | updatebookmarks(repo, nstate, currentbookmarks, **opts) | |
321 |
|
321 | |||
322 | clearstatus(repo) |
|
322 | clearstatus(repo) | |
323 | ui.note(_("rebase completed\n")) |
|
323 | ui.note(_("rebase completed\n")) | |
324 | if os.path.exists(repo.sjoin('undo')): |
|
324 | if os.path.exists(repo.sjoin('undo')): | |
325 | util.unlinkpath(repo.sjoin('undo')) |
|
325 | util.unlinkpath(repo.sjoin('undo')) | |
326 | if skipped: |
|
326 | if skipped: | |
327 | ui.note(_("%d revisions have been skipped\n") % len(skipped)) |
|
327 | ui.note(_("%d revisions have been skipped\n") % len(skipped)) | |
328 |
|
328 | |||
329 | if (activebookmark and |
|
329 | if (activebookmark and | |
330 | repo['tip'].node() == repo._bookmarks[activebookmark]): |
|
330 | repo['tip'].node() == repo._bookmarks[activebookmark]): | |
331 | bookmarks.setcurrent(repo, activebookmark) |
|
331 | bookmarks.setcurrent(repo, activebookmark) | |
332 |
|
332 | |||
333 | finally: |
|
333 | finally: | |
334 | release(lock, wlock) |
|
334 | release(lock, wlock) | |
335 |
|
335 | |||
336 | def checkexternal(repo, state, targetancestors): |
|
336 | def checkexternal(repo, state, targetancestors): | |
337 | """Check whether one or more external revisions need to be taken in |
|
337 | """Check whether one or more external revisions need to be taken in | |
338 | consideration. In the latter case, abort. |
|
338 | consideration. In the latter case, abort. | |
339 | """ |
|
339 | """ | |
340 | external = nullrev |
|
340 | external = nullrev | |
341 | source = min(state) |
|
341 | source = min(state) | |
342 | for rev in state: |
|
342 | for rev in state: | |
343 | if rev == source: |
|
343 | if rev == source: | |
344 | continue |
|
344 | continue | |
345 | # Check externals and fail if there are more than one |
|
345 | # Check externals and fail if there are more than one | |
346 | for p in repo[rev].parents(): |
|
346 | for p in repo[rev].parents(): | |
347 | if (p.rev() not in state |
|
347 | if (p.rev() not in state | |
348 | and p.rev() not in targetancestors): |
|
348 | and p.rev() not in targetancestors): | |
349 | if external != nullrev: |
|
349 | if external != nullrev: | |
350 | raise util.Abort(_('unable to collapse, there is more ' |
|
350 | raise util.Abort(_('unable to collapse, there is more ' | |
351 | 'than one external parent')) |
|
351 | 'than one external parent')) | |
352 | external = p.rev() |
|
352 | external = p.rev() | |
353 | return external |
|
353 | return external | |
354 |
|
354 | |||
355 | def concludenode(repo, rev, p1, p2, commitmsg=None, editor=None, extrafn=None): |
|
355 | def concludenode(repo, rev, p1, p2, commitmsg=None, editor=None, extrafn=None): | |
356 | 'Commit the changes and store useful information in extra' |
|
356 | 'Commit the changes and store useful information in extra' | |
357 | try: |
|
357 | try: | |
358 | repo.setparents(repo[p1].node(), repo[p2].node()) |
|
358 | repo.setparents(repo[p1].node(), repo[p2].node()) | |
359 | ctx = repo[rev] |
|
359 | ctx = repo[rev] | |
360 | if commitmsg is None: |
|
360 | if commitmsg is None: | |
361 | commitmsg = ctx.description() |
|
361 | commitmsg = ctx.description() | |
362 | extra = {'rebase_source': ctx.hex()} |
|
362 | extra = {'rebase_source': ctx.hex()} | |
363 | if extrafn: |
|
363 | if extrafn: | |
364 | extrafn(ctx, extra) |
|
364 | extrafn(ctx, extra) | |
365 | # Commit might fail if unresolved files exist |
|
365 | # Commit might fail if unresolved files exist | |
366 | newrev = repo.commit(text=commitmsg, user=ctx.user(), |
|
366 | newrev = repo.commit(text=commitmsg, user=ctx.user(), | |
367 | date=ctx.date(), extra=extra, editor=editor) |
|
367 | date=ctx.date(), extra=extra, editor=editor) | |
368 | repo.dirstate.setbranch(repo[newrev].branch()) |
|
368 | repo.dirstate.setbranch(repo[newrev].branch()) | |
369 | targetphase = max(ctx.phase(), phases.draft) |
|
369 | targetphase = max(ctx.phase(), phases.draft) | |
370 | # retractboundary doesn't overwrite upper phase inherited from parent |
|
370 | # retractboundary doesn't overwrite upper phase inherited from parent | |
371 | newnode = repo[newrev].node() |
|
371 | newnode = repo[newrev].node() | |
372 | if newnode: |
|
372 | if newnode: | |
373 | phases.retractboundary(repo, targetphase, [newnode]) |
|
373 | phases.retractboundary(repo, targetphase, [newnode]) | |
374 | return newrev |
|
374 | return newrev | |
375 | except util.Abort: |
|
375 | except util.Abort: | |
376 | # Invalidate the previous setparents |
|
376 | # Invalidate the previous setparents | |
377 | repo.dirstate.invalidate() |
|
377 | repo.dirstate.invalidate() | |
378 | raise |
|
378 | raise | |
379 |
|
379 | |||
380 | def rebasenode(repo, rev, p1, state, collapse): |
|
380 | def rebasenode(repo, rev, p1, state, collapse): | |
381 | 'Rebase a single revision' |
|
381 | 'Rebase a single revision' | |
382 | # Merge phase |
|
382 | # Merge phase | |
383 | # Update to target and merge it with local |
|
383 | # Update to target and merge it with local | |
384 | if repo['.'].rev() != repo[p1].rev(): |
|
384 | if repo['.'].rev() != repo[p1].rev(): | |
385 | repo.ui.debug(" update to %d:%s\n" % (repo[p1].rev(), repo[p1])) |
|
385 | repo.ui.debug(" update to %d:%s\n" % (repo[p1].rev(), repo[p1])) | |
386 | merge.update(repo, p1, False, True, False) |
|
386 | merge.update(repo, p1, False, True, False) | |
387 | else: |
|
387 | else: | |
388 | repo.ui.debug(" already in target\n") |
|
388 | repo.ui.debug(" already in target\n") | |
389 | repo.dirstate.write() |
|
389 | repo.dirstate.write() | |
390 | repo.ui.debug(" merge against %d:%s\n" % (repo[rev].rev(), repo[rev])) |
|
390 | repo.ui.debug(" merge against %d:%s\n" % (repo[rev].rev(), repo[rev])) | |
391 | base = None |
|
391 | base = None | |
392 | if repo[rev].rev() != repo[min(state)].rev(): |
|
392 | if repo[rev].rev() != repo[min(state)].rev(): | |
393 | base = repo[rev].p1().node() |
|
393 | base = repo[rev].p1().node() | |
394 | # When collapsing in-place, the parent is the common ancestor, we |
|
394 | # When collapsing in-place, the parent is the common ancestor, we | |
395 | # have to allow merging with it. |
|
395 | # have to allow merging with it. | |
396 | return merge.update(repo, rev, True, True, False, base, collapse) |
|
396 | return merge.update(repo, rev, True, True, False, base, collapse) | |
397 |
|
397 | |||
398 | def defineparents(repo, rev, target, state, targetancestors): |
|
398 | def defineparents(repo, rev, target, state, targetancestors): | |
399 | 'Return the new parent relationship of the revision that will be rebased' |
|
399 | 'Return the new parent relationship of the revision that will be rebased' | |
400 | parents = repo[rev].parents() |
|
400 | parents = repo[rev].parents() | |
401 | p1 = p2 = nullrev |
|
401 | p1 = p2 = nullrev | |
402 |
|
402 | |||
403 | P1n = parents[0].rev() |
|
403 | P1n = parents[0].rev() | |
404 | if P1n in targetancestors: |
|
404 | if P1n in targetancestors: | |
405 | p1 = target |
|
405 | p1 = target | |
406 | elif P1n in state: |
|
406 | elif P1n in state: | |
407 | if state[P1n] == nullmerge: |
|
407 | if state[P1n] == nullmerge: | |
408 | p1 = target |
|
408 | p1 = target | |
409 | else: |
|
409 | else: | |
410 | p1 = state[P1n] |
|
410 | p1 = state[P1n] | |
411 | else: # P1n external |
|
411 | else: # P1n external | |
412 | p1 = target |
|
412 | p1 = target | |
413 | p2 = P1n |
|
413 | p2 = P1n | |
414 |
|
414 | |||
415 | if len(parents) == 2 and parents[1].rev() not in targetancestors: |
|
415 | if len(parents) == 2 and parents[1].rev() not in targetancestors: | |
416 | P2n = parents[1].rev() |
|
416 | P2n = parents[1].rev() | |
417 | # interesting second parent |
|
417 | # interesting second parent | |
418 | if P2n in state: |
|
418 | if P2n in state: | |
419 | if p1 == target: # P1n in targetancestors or external |
|
419 | if p1 == target: # P1n in targetancestors or external | |
420 | p1 = state[P2n] |
|
420 | p1 = state[P2n] | |
421 | else: |
|
421 | else: | |
422 | p2 = state[P2n] |
|
422 | p2 = state[P2n] | |
423 | else: # P2n external |
|
423 | else: # P2n external | |
424 | if p2 != nullrev: # P1n external too => rev is a merged revision |
|
424 | if p2 != nullrev: # P1n external too => rev is a merged revision | |
425 | raise util.Abort(_('cannot use revision %d as base, result ' |
|
425 | raise util.Abort(_('cannot use revision %d as base, result ' | |
426 | 'would have 3 parents') % rev) |
|
426 | 'would have 3 parents') % rev) | |
427 | p2 = P2n |
|
427 | p2 = P2n | |
428 | repo.ui.debug(" future parents are %d and %d\n" % |
|
428 | repo.ui.debug(" future parents are %d and %d\n" % | |
429 | (repo[p1].rev(), repo[p2].rev())) |
|
429 | (repo[p1].rev(), repo[p2].rev())) | |
430 | return p1, p2 |
|
430 | return p1, p2 | |
431 |
|
431 | |||
432 | def isagitpatch(repo, patchname): |
|
432 | def isagitpatch(repo, patchname): | |
433 | 'Return true if the given patch is in git format' |
|
433 | 'Return true if the given patch is in git format' | |
434 | mqpatch = os.path.join(repo.mq.path, patchname) |
|
434 | mqpatch = os.path.join(repo.mq.path, patchname) | |
435 | for line in patch.linereader(file(mqpatch, 'rb')): |
|
435 | for line in patch.linereader(file(mqpatch, 'rb')): | |
436 | if line.startswith('diff --git'): |
|
436 | if line.startswith('diff --git'): | |
437 | return True |
|
437 | return True | |
438 | return False |
|
438 | return False | |
439 |
|
439 | |||
440 | def updatemq(repo, state, skipped, **opts): |
|
440 | def updatemq(repo, state, skipped, **opts): | |
441 | 'Update rebased mq patches - finalize and then import them' |
|
441 | 'Update rebased mq patches - finalize and then import them' | |
442 | mqrebase = {} |
|
442 | mqrebase = {} | |
443 | mq = repo.mq |
|
443 | mq = repo.mq | |
444 | original_series = mq.fullseries[:] |
|
444 | original_series = mq.fullseries[:] | |
445 | skippedpatches = set() |
|
445 | skippedpatches = set() | |
446 |
|
446 | |||
447 | for p in mq.applied: |
|
447 | for p in mq.applied: | |
448 | rev = repo[p.node].rev() |
|
448 | rev = repo[p.node].rev() | |
449 | if rev in state: |
|
449 | if rev in state: | |
450 | repo.ui.debug('revision %d is an mq patch (%s), finalize it.\n' % |
|
450 | repo.ui.debug('revision %d is an mq patch (%s), finalize it.\n' % | |
451 | (rev, p.name)) |
|
451 | (rev, p.name)) | |
452 | mqrebase[rev] = (p.name, isagitpatch(repo, p.name)) |
|
452 | mqrebase[rev] = (p.name, isagitpatch(repo, p.name)) | |
453 | else: |
|
453 | else: | |
454 | # Applied but not rebased, not sure this should happen |
|
454 | # Applied but not rebased, not sure this should happen | |
455 | skippedpatches.add(p.name) |
|
455 | skippedpatches.add(p.name) | |
456 |
|
456 | |||
457 | if mqrebase: |
|
457 | if mqrebase: | |
458 | mq.finish(repo, mqrebase.keys()) |
|
458 | mq.finish(repo, mqrebase.keys()) | |
459 |
|
459 | |||
460 | # We must start import from the newest revision |
|
460 | # We must start import from the newest revision | |
461 | for rev in sorted(mqrebase, reverse=True): |
|
461 | for rev in sorted(mqrebase, reverse=True): | |
462 | if rev not in skipped: |
|
462 | if rev not in skipped: | |
463 | name, isgit = mqrebase[rev] |
|
463 | name, isgit = mqrebase[rev] | |
464 | repo.ui.debug('import mq patch %d (%s)\n' % (state[rev], name)) |
|
464 | repo.ui.debug('import mq patch %d (%s)\n' % (state[rev], name)) | |
465 | mq.qimport(repo, (), patchname=name, git=isgit, |
|
465 | mq.qimport(repo, (), patchname=name, git=isgit, | |
466 | rev=[str(state[rev])]) |
|
466 | rev=[str(state[rev])]) | |
467 | else: |
|
467 | else: | |
468 | # Rebased and skipped |
|
468 | # Rebased and skipped | |
469 | skippedpatches.add(mqrebase[rev][0]) |
|
469 | skippedpatches.add(mqrebase[rev][0]) | |
470 |
|
470 | |||
471 | # Patches were either applied and rebased and imported in |
|
471 | # Patches were either applied and rebased and imported in | |
472 | # order, applied and removed or unapplied. Discard the removed |
|
472 | # order, applied and removed or unapplied. Discard the removed | |
473 | # ones while preserving the original series order and guards. |
|
473 | # ones while preserving the original series order and guards. | |
474 | newseries = [s for s in original_series |
|
474 | newseries = [s for s in original_series | |
475 | if mq.guard_re.split(s, 1)[0] not in skippedpatches] |
|
475 | if mq.guard_re.split(s, 1)[0] not in skippedpatches] | |
476 | mq.fullseries[:] = newseries |
|
476 | mq.fullseries[:] = newseries | |
477 | mq.seriesdirty = True |
|
477 | mq.seriesdirty = True | |
478 | mq.savedirty() |
|
478 | mq.savedirty() | |
479 |
|
479 | |||
480 | def updatebookmarks(repo, nstate, originalbookmarks, **opts): |
|
480 | def updatebookmarks(repo, nstate, originalbookmarks, **opts): | |
481 | 'Move bookmarks to their correct changesets' |
|
481 | 'Move bookmarks to their correct changesets' | |
482 | marks = repo._bookmarks |
|
482 | marks = repo._bookmarks | |
483 | for k, v in originalbookmarks.iteritems(): |
|
483 | for k, v in originalbookmarks.iteritems(): | |
484 | if v in nstate: |
|
484 | if v in nstate: | |
485 | if nstate[v] != nullmerge: |
|
485 | if nstate[v] != nullmerge: | |
486 | # update the bookmarks for revs that have moved |
|
486 | # update the bookmarks for revs that have moved | |
487 | marks[k] = nstate[v] |
|
487 | marks[k] = nstate[v] | |
488 |
|
488 | |||
489 | marks.write() |
|
489 | marks.write() | |
490 |
|
490 | |||
491 | def storestatus(repo, originalwd, target, state, collapse, keep, keepbranches, |
|
491 | def storestatus(repo, originalwd, target, state, collapse, keep, keepbranches, | |
492 | external): |
|
492 | external): | |
493 | 'Store the current status to allow recovery' |
|
493 | 'Store the current status to allow recovery' | |
494 | f = repo.opener("rebasestate", "w") |
|
494 | f = repo.opener("rebasestate", "w") | |
495 | f.write(repo[originalwd].hex() + '\n') |
|
495 | f.write(repo[originalwd].hex() + '\n') | |
496 | f.write(repo[target].hex() + '\n') |
|
496 | f.write(repo[target].hex() + '\n') | |
497 | f.write(repo[external].hex() + '\n') |
|
497 | f.write(repo[external].hex() + '\n') | |
498 | f.write('%d\n' % int(collapse)) |
|
498 | f.write('%d\n' % int(collapse)) | |
499 | f.write('%d\n' % int(keep)) |
|
499 | f.write('%d\n' % int(keep)) | |
500 | f.write('%d\n' % int(keepbranches)) |
|
500 | f.write('%d\n' % int(keepbranches)) | |
501 | for d, v in state.iteritems(): |
|
501 | for d, v in state.iteritems(): | |
502 | oldrev = repo[d].hex() |
|
502 | oldrev = repo[d].hex() | |
503 | if v != nullmerge: |
|
503 | if v != nullmerge: | |
504 | newrev = repo[v].hex() |
|
504 | newrev = repo[v].hex() | |
505 | else: |
|
505 | else: | |
506 | newrev = v |
|
506 | newrev = v | |
507 | f.write("%s:%s\n" % (oldrev, newrev)) |
|
507 | f.write("%s:%s\n" % (oldrev, newrev)) | |
508 | f.close() |
|
508 | f.close() | |
509 | repo.ui.debug('rebase status stored\n') |
|
509 | repo.ui.debug('rebase status stored\n') | |
510 |
|
510 | |||
511 | def clearstatus(repo): |
|
511 | def clearstatus(repo): | |
512 | 'Remove the status files' |
|
512 | 'Remove the status files' | |
513 | if os.path.exists(repo.join("rebasestate")): |
|
513 | if os.path.exists(repo.join("rebasestate")): | |
514 | util.unlinkpath(repo.join("rebasestate")) |
|
514 | util.unlinkpath(repo.join("rebasestate")) | |
515 |
|
515 | |||
516 | def restorestatus(repo): |
|
516 | def restorestatus(repo): | |
517 | 'Restore a previously stored status' |
|
517 | 'Restore a previously stored status' | |
518 | try: |
|
518 | try: | |
519 | target = None |
|
519 | target = None | |
520 | collapse = False |
|
520 | collapse = False | |
521 | external = nullrev |
|
521 | external = nullrev | |
522 | state = {} |
|
522 | state = {} | |
523 | f = repo.opener("rebasestate") |
|
523 | f = repo.opener("rebasestate") | |
524 | for i, l in enumerate(f.read().splitlines()): |
|
524 | for i, l in enumerate(f.read().splitlines()): | |
525 | if i == 0: |
|
525 | if i == 0: | |
526 | originalwd = repo[l].rev() |
|
526 | originalwd = repo[l].rev() | |
527 | elif i == 1: |
|
527 | elif i == 1: | |
528 | target = repo[l].rev() |
|
528 | target = repo[l].rev() | |
529 | elif i == 2: |
|
529 | elif i == 2: | |
530 | external = repo[l].rev() |
|
530 | external = repo[l].rev() | |
531 | elif i == 3: |
|
531 | elif i == 3: | |
532 | collapse = bool(int(l)) |
|
532 | collapse = bool(int(l)) | |
533 | elif i == 4: |
|
533 | elif i == 4: | |
534 | keep = bool(int(l)) |
|
534 | keep = bool(int(l)) | |
535 | elif i == 5: |
|
535 | elif i == 5: | |
536 | keepbranches = bool(int(l)) |
|
536 | keepbranches = bool(int(l)) | |
537 | else: |
|
537 | else: | |
538 | oldrev, newrev = l.split(':') |
|
538 | oldrev, newrev = l.split(':') | |
539 | if newrev != str(nullmerge): |
|
539 | if newrev != str(nullmerge): | |
540 | state[repo[oldrev].rev()] = repo[newrev].rev() |
|
540 | state[repo[oldrev].rev()] = repo[newrev].rev() | |
541 | else: |
|
541 | else: | |
542 | state[repo[oldrev].rev()] = int(newrev) |
|
542 | state[repo[oldrev].rev()] = int(newrev) | |
543 | skipped = set() |
|
543 | skipped = set() | |
544 | # recompute the set of skipped revs |
|
544 | # recompute the set of skipped revs | |
545 | if not collapse: |
|
545 | if not collapse: | |
546 | seen = set([target]) |
|
546 | seen = set([target]) | |
547 | for old, new in sorted(state.items()): |
|
547 | for old, new in sorted(state.items()): | |
548 | if new != nullrev and new in seen: |
|
548 | if new != nullrev and new in seen: | |
549 | skipped.add(old) |
|
549 | skipped.add(old) | |
550 | seen.add(new) |
|
550 | seen.add(new) | |
551 | repo.ui.debug('computed skipped revs: %s\n' % skipped) |
|
551 | repo.ui.debug('computed skipped revs: %s\n' % skipped) | |
552 | repo.ui.debug('rebase status resumed\n') |
|
552 | repo.ui.debug('rebase status resumed\n') | |
553 | return (originalwd, target, state, skipped, |
|
553 | return (originalwd, target, state, skipped, | |
554 | collapse, keep, keepbranches, external) |
|
554 | collapse, keep, keepbranches, external) | |
555 | except IOError, err: |
|
555 | except IOError, err: | |
556 | if err.errno != errno.ENOENT: |
|
556 | if err.errno != errno.ENOENT: | |
557 | raise |
|
557 | raise | |
558 | raise util.Abort(_('no rebase in progress')) |
|
558 | raise util.Abort(_('no rebase in progress')) | |
559 |
|
559 | |||
560 | def abort(repo, originalwd, target, state): |
|
560 | def abort(repo, originalwd, target, state): | |
561 | 'Restore the repository to its original state' |
|
561 | 'Restore the repository to its original state' | |
562 | dstates = [s for s in state.values() if s != nullrev] |
|
562 | dstates = [s for s in state.values() if s != nullrev] | |
563 | immutable = [d for d in dstates if not repo[d].mutable()] |
|
563 | immutable = [d for d in dstates if not repo[d].mutable()] | |
564 | if immutable: |
|
564 | if immutable: | |
565 | raise util.Abort(_("can't abort rebase due to immutable changesets %s") |
|
565 | raise util.Abort(_("can't abort rebase due to immutable changesets %s") | |
566 | % ', '.join(str(repo[r]) for r in immutable), |
|
566 | % ', '.join(str(repo[r]) for r in immutable), | |
567 | hint=_('see hg help phases for details')) |
|
567 | hint=_('see hg help phases for details')) | |
568 |
|
568 | |||
569 | descendants = set() |
|
569 | descendants = set() | |
570 | if dstates: |
|
570 | if dstates: | |
571 | descendants = set(repo.changelog.descendants(dstates)) |
|
571 | descendants = set(repo.changelog.descendants(dstates)) | |
572 | if descendants - set(dstates): |
|
572 | if descendants - set(dstates): | |
573 | repo.ui.warn(_("warning: new changesets detected on target branch, " |
|
573 | repo.ui.warn(_("warning: new changesets detected on target branch, " | |
574 | "can't abort\n")) |
|
574 | "can't abort\n")) | |
575 | return -1 |
|
575 | return -1 | |
576 | else: |
|
576 | else: | |
577 | # Strip from the first rebased revision |
|
577 | # Strip from the first rebased revision | |
578 | merge.update(repo, repo[originalwd].rev(), False, True, False) |
|
578 | merge.update(repo, repo[originalwd].rev(), False, True, False) | |
579 | rebased = filter(lambda x: x > -1 and x != target, state.values()) |
|
579 | rebased = filter(lambda x: x > -1 and x != target, state.values()) | |
580 | if rebased: |
|
580 | if rebased: | |
581 | strippoint = min(rebased) |
|
581 | strippoint = min(rebased) | |
582 | # no backup of rebased cset versions needed |
|
582 | # no backup of rebased cset versions needed | |
583 | repair.strip(repo.ui, repo, repo[strippoint].node()) |
|
583 | repair.strip(repo.ui, repo, repo[strippoint].node()) | |
584 | clearstatus(repo) |
|
584 | clearstatus(repo) | |
585 | repo.ui.warn(_('rebase aborted\n')) |
|
585 | repo.ui.warn(_('rebase aborted\n')) | |
586 | return 0 |
|
586 | return 0 | |
587 |
|
587 | |||
588 | def buildstate(repo, dest, rebaseset, collapse): |
|
588 | def buildstate(repo, dest, rebaseset, collapse): | |
589 | '''Define which revisions are going to be rebased and where |
|
589 | '''Define which revisions are going to be rebased and where | |
590 |
|
590 | |||
591 | repo: repo |
|
591 | repo: repo | |
592 | dest: context |
|
592 | dest: context | |
593 | rebaseset: set of rev |
|
593 | rebaseset: set of rev | |
594 | ''' |
|
594 | ''' | |
595 |
|
595 | |||
596 | # This check isn't strictly necessary, since mq detects commits over an |
|
596 | # This check isn't strictly necessary, since mq detects commits over an | |
597 | # applied patch. But it prevents messing up the working directory when |
|
597 | # applied patch. But it prevents messing up the working directory when | |
598 | # a partially completed rebase is blocked by mq. |
|
598 | # a partially completed rebase is blocked by mq. | |
599 | if 'qtip' in repo.tags() and (dest.node() in |
|
599 | if 'qtip' in repo.tags() and (dest.node() in | |
600 | [s.node for s in repo.mq.applied]): |
|
600 | [s.node for s in repo.mq.applied]): | |
601 | raise util.Abort(_('cannot rebase onto an applied mq patch')) |
|
601 | raise util.Abort(_('cannot rebase onto an applied mq patch')) | |
602 |
|
602 | |||
603 | roots = list(repo.set('roots(%ld)', rebaseset)) |
|
603 | roots = list(repo.set('roots(%ld)', rebaseset)) | |
604 | if not roots: |
|
604 | if not roots: | |
605 | raise util.Abort(_('no matching revisions')) |
|
605 | raise util.Abort(_('no matching revisions')) | |
606 | if len(roots) > 1: |
|
606 | if len(roots) > 1: | |
607 | raise util.Abort(_("can't rebase multiple roots")) |
|
607 | raise util.Abort(_("can't rebase multiple roots")) | |
608 | root = roots[0] |
|
608 | root = roots[0] | |
609 |
|
609 | |||
610 | commonbase = root.ancestor(dest) |
|
610 | commonbase = root.ancestor(dest) | |
611 | if commonbase == root: |
|
611 | if commonbase == root: | |
612 | raise util.Abort(_('source is ancestor of destination')) |
|
612 | raise util.Abort(_('source is ancestor of destination')) | |
613 | if commonbase == dest: |
|
613 | if commonbase == dest: | |
614 | samebranch = root.branch() == dest.branch() |
|
614 | samebranch = root.branch() == dest.branch() | |
615 | if not collapse and samebranch and root in dest.children(): |
|
615 | if not collapse and samebranch and root in dest.children(): | |
616 | repo.ui.debug('source is a child of destination\n') |
|
616 | repo.ui.debug('source is a child of destination\n') | |
617 | return None |
|
617 | return None | |
618 |
|
618 | |||
619 | repo.ui.debug('rebase onto %d starting from %d\n' % (dest, root)) |
|
619 | repo.ui.debug('rebase onto %d starting from %d\n' % (dest, root)) | |
620 | state = dict.fromkeys(rebaseset, nullrev) |
|
620 | state = dict.fromkeys(rebaseset, nullrev) | |
621 | # Rebase tries to turn <dest> into a parent of <root> while |
|
621 | # Rebase tries to turn <dest> into a parent of <root> while | |
622 | # preserving the number of parents of rebased changesets: |
|
622 | # preserving the number of parents of rebased changesets: | |
623 | # |
|
623 | # | |
624 | # - A changeset with a single parent will always be rebased as a |
|
624 | # - A changeset with a single parent will always be rebased as a | |
625 | # changeset with a single parent. |
|
625 | # changeset with a single parent. | |
626 | # |
|
626 | # | |
627 | # - A merge will be rebased as merge unless its parents are both |
|
627 | # - A merge will be rebased as merge unless its parents are both | |
628 | # ancestors of <dest> or are themselves in the rebased set and |
|
628 | # ancestors of <dest> or are themselves in the rebased set and | |
629 | # pruned while rebased. |
|
629 | # pruned while rebased. | |
630 | # |
|
630 | # | |
631 | # If one parent of <root> is an ancestor of <dest>, the rebased |
|
631 | # If one parent of <root> is an ancestor of <dest>, the rebased | |
632 | # version of this parent will be <dest>. This is always true with |
|
632 | # version of this parent will be <dest>. This is always true with | |
633 | # --base option. |
|
633 | # --base option. | |
634 | # |
|
634 | # | |
635 | # Otherwise, we need to *replace* the original parents with |
|
635 | # Otherwise, we need to *replace* the original parents with | |
636 | # <dest>. This "detaches" the rebased set from its former location |
|
636 | # <dest>. This "detaches" the rebased set from its former location | |
637 | # and rebases it onto <dest>. Changes introduced by ancestors of |
|
637 | # and rebases it onto <dest>. Changes introduced by ancestors of | |
638 | # <root> not common with <dest> (the detachset, marked as |
|
638 | # <root> not common with <dest> (the detachset, marked as | |
639 | # nullmerge) are "removed" from the rebased changesets. |
|
639 | # nullmerge) are "removed" from the rebased changesets. | |
640 | # |
|
640 | # | |
641 | # - If <root> has a single parent, set it to <dest>. |
|
641 | # - If <root> has a single parent, set it to <dest>. | |
642 | # |
|
642 | # | |
643 | # - If <root> is a merge, we cannot decide which parent to |
|
643 | # - If <root> is a merge, we cannot decide which parent to | |
644 | # replace, the rebase operation is not clearly defined. |
|
644 | # replace, the rebase operation is not clearly defined. | |
645 | # |
|
645 | # | |
646 | # The table below sums up this behavior: |
|
646 | # The table below sums up this behavior: | |
647 | # |
|
647 | # | |
648 | # +--------------------+----------------------+-------------------------+ |
|
648 | # +--------------------+----------------------+-------------------------+ | |
649 | # | | one parent | merge | |
|
649 | # | | one parent | merge | | |
650 | # +--------------------+----------------------+-------------------------+ |
|
650 | # +--------------------+----------------------+-------------------------+ | |
651 | # | parent in ::<dest> | new parent is <dest> | parents in ::<dest> are | |
|
651 | # | parent in ::<dest> | new parent is <dest> | parents in ::<dest> are | | |
652 | # | | | remapped to <dest> | |
|
652 | # | | | remapped to <dest> | | |
653 | # +--------------------+----------------------+-------------------------+ |
|
653 | # +--------------------+----------------------+-------------------------+ | |
654 | # | unrelated source | new parent is <dest> | ambiguous, abort | |
|
654 | # | unrelated source | new parent is <dest> | ambiguous, abort | | |
655 | # +--------------------+----------------------+-------------------------+ |
|
655 | # +--------------------+----------------------+-------------------------+ | |
656 | # |
|
656 | # | |
657 | # The actual abort is handled by `defineparents` |
|
657 | # The actual abort is handled by `defineparents` | |
658 | if len(root.parents()) <= 1: |
|
658 | if len(root.parents()) <= 1: | |
659 | # ancestors of <root> not ancestors of <dest> |
|
659 | # ancestors of <root> not ancestors of <dest> | |
660 | detachset = repo.changelog.findmissingrevs([commonbase.rev()], |
|
660 | detachset = repo.changelog.findmissingrevs([commonbase.rev()], | |
661 | [root.rev()]) |
|
661 | [root.rev()]) | |
662 | state.update(dict.fromkeys(detachset, nullmerge)) |
|
662 | state.update(dict.fromkeys(detachset, nullmerge)) | |
663 | # detachset can have root, and we definitely want to rebase that |
|
663 | # detachset can have root, and we definitely want to rebase that | |
664 | state[root.rev()] = nullrev |
|
664 | state[root.rev()] = nullrev | |
665 | return repo['.'].rev(), dest.rev(), state |
|
665 | return repo['.'].rev(), dest.rev(), state | |
666 |
|
666 | |||
667 | def clearrebased(ui, repo, state, collapsedas=None): |
|
667 | def clearrebased(ui, repo, state, collapsedas=None): | |
668 | """dispose of rebased revision at the end of the rebase |
|
668 | """dispose of rebased revision at the end of the rebase | |
669 |
|
669 | |||
670 | If `collapsedas` is not None, the rebase was a collapse whose result if the |
|
670 | If `collapsedas` is not None, the rebase was a collapse whose result if the | |
671 | `collapsedas` node.""" |
|
671 | `collapsedas` node.""" | |
672 | if obsolete._enabled: |
|
672 | if obsolete._enabled: | |
673 | markers = [] |
|
673 | markers = [] | |
674 | for rev, newrev in sorted(state.items()): |
|
674 | for rev, newrev in sorted(state.items()): | |
675 | if newrev >= 0: |
|
675 | if newrev >= 0: | |
676 | if collapsedas is not None: |
|
676 | if collapsedas is not None: | |
677 | newrev = collapsedas |
|
677 | newrev = collapsedas | |
678 | markers.append((repo[rev], (repo[newrev],))) |
|
678 | markers.append((repo[rev], (repo[newrev],))) | |
679 | if markers: |
|
679 | if markers: | |
680 | obsolete.createmarkers(repo, markers) |
|
680 | obsolete.createmarkers(repo, markers) | |
681 | else: |
|
681 | else: | |
682 | rebased = [rev for rev in state if state[rev] != nullmerge] |
|
682 | rebased = [rev for rev in state if state[rev] != nullmerge] | |
683 | if rebased: |
|
683 | if rebased: | |
684 | if set(repo.changelog.descendants([min(rebased)])) - set(state): |
|
684 | if set(repo.changelog.descendants([min(rebased)])) - set(state): | |
685 | ui.warn(_("warning: new changesets detected " |
|
685 | ui.warn(_("warning: new changesets detected " | |
686 | "on source branch, not stripping\n")) |
|
686 | "on source branch, not stripping\n")) | |
687 | else: |
|
687 | else: | |
688 | # backup the old csets by default |
|
688 | # backup the old csets by default | |
689 | repair.strip(ui, repo, repo[min(rebased)].node(), "all") |
|
689 | repair.strip(ui, repo, repo[min(rebased)].node(), "all") | |
690 |
|
690 | |||
691 |
|
691 | |||
692 | def pullrebase(orig, ui, repo, *args, **opts): |
|
692 | def pullrebase(orig, ui, repo, *args, **opts): | |
693 | 'Call rebase after pull if the latter has been invoked with --rebase' |
|
693 | 'Call rebase after pull if the latter has been invoked with --rebase' | |
694 | if opts.get('rebase'): |
|
694 | if opts.get('rebase'): | |
695 | if opts.get('update'): |
|
695 | if opts.get('update'): | |
696 | del opts['update'] |
|
696 | del opts['update'] | |
697 | ui.debug('--update and --rebase are not compatible, ignoring ' |
|
697 | ui.debug('--update and --rebase are not compatible, ignoring ' | |
698 | 'the update flag\n') |
|
698 | 'the update flag\n') | |
699 |
|
699 | |||
700 | movemarkfrom = repo['.'].node() |
|
700 | movemarkfrom = repo['.'].node() | |
701 | cmdutil.bailifchanged(repo) |
|
701 | cmdutil.bailifchanged(repo) | |
702 | revsprepull = len(repo) |
|
702 | revsprepull = len(repo) | |
703 | origpostincoming = commands.postincoming |
|
703 | origpostincoming = commands.postincoming | |
704 | def _dummy(*args, **kwargs): |
|
704 | def _dummy(*args, **kwargs): | |
705 | pass |
|
705 | pass | |
706 | commands.postincoming = _dummy |
|
706 | commands.postincoming = _dummy | |
707 | try: |
|
707 | try: | |
708 | orig(ui, repo, *args, **opts) |
|
708 | orig(ui, repo, *args, **opts) | |
709 | finally: |
|
709 | finally: | |
710 | commands.postincoming = origpostincoming |
|
710 | commands.postincoming = origpostincoming | |
711 | revspostpull = len(repo) |
|
711 | revspostpull = len(repo) | |
712 | if revspostpull > revsprepull: |
|
712 | if revspostpull > revsprepull: | |
|
713 | # --rev option from pull conflict with rebase own --rev | |||
|
714 | # dropping it | |||
|
715 | if 'rev' in opts: | |||
|
716 | del opts['rev'] | |||
713 | rebase(ui, repo, **opts) |
|
717 | rebase(ui, repo, **opts) | |
714 | branch = repo[None].branch() |
|
718 | branch = repo[None].branch() | |
715 | dest = repo[branch].rev() |
|
719 | dest = repo[branch].rev() | |
716 | if dest != repo['.'].rev(): |
|
720 | if dest != repo['.'].rev(): | |
717 | # there was nothing to rebase we force an update |
|
721 | # there was nothing to rebase we force an update | |
718 | hg.update(repo, dest) |
|
722 | hg.update(repo, dest) | |
719 | if bookmarks.update(repo, [movemarkfrom], repo['.'].node()): |
|
723 | if bookmarks.update(repo, [movemarkfrom], repo['.'].node()): | |
720 | ui.status(_("updating bookmark %s\n") |
|
724 | ui.status(_("updating bookmark %s\n") | |
721 | % repo._bookmarkcurrent) |
|
725 | % repo._bookmarkcurrent) | |
722 | else: |
|
726 | else: | |
723 | if opts.get('tool'): |
|
727 | if opts.get('tool'): | |
724 | raise util.Abort(_('--tool can only be used with --rebase')) |
|
728 | raise util.Abort(_('--tool can only be used with --rebase')) | |
725 | orig(ui, repo, *args, **opts) |
|
729 | orig(ui, repo, *args, **opts) | |
726 |
|
730 | |||
727 | def uisetup(ui): |
|
731 | def uisetup(ui): | |
728 | 'Replace pull with a decorator to provide --rebase option' |
|
732 | 'Replace pull with a decorator to provide --rebase option' | |
729 | entry = extensions.wrapcommand(commands.table, 'pull', pullrebase) |
|
733 | entry = extensions.wrapcommand(commands.table, 'pull', pullrebase) | |
730 | entry[1].append(('', 'rebase', None, |
|
734 | entry[1].append(('', 'rebase', None, | |
731 | _("rebase working directory to branch head"))) |
|
735 | _("rebase working directory to branch head"))) | |
732 | entry[1].append(('t', 'tool', '', |
|
736 | entry[1].append(('t', 'tool', '', | |
733 | _("specify merge tool for rebase"))) |
|
737 | _("specify merge tool for rebase"))) |
@@ -1,116 +1,168 b'' | |||||
1 | $ cat >> $HGRCPATH <<EOF |
|
1 | $ cat >> $HGRCPATH <<EOF | |
2 | > [extensions] |
|
2 | > [extensions] | |
3 | > graphlog= |
|
3 | > graphlog= | |
4 | > rebase= |
|
4 | > rebase= | |
5 | > |
|
5 | > | |
6 | > [alias] |
|
6 | > [alias] | |
7 | > tglog = log -G --template "{rev}: '{desc}' {branches}\n" |
|
7 | > tglog = log -G --template "{rev}: '{desc}' {branches}\n" | |
8 | > EOF |
|
8 | > EOF | |
9 |
|
9 | |||
10 |
|
10 | |||
11 | $ hg init a |
|
11 | $ hg init a | |
12 | $ cd a |
|
12 | $ cd a | |
13 |
|
13 | |||
14 | $ echo C1 > C1 |
|
14 | $ echo C1 > C1 | |
15 | $ hg ci -Am C1 |
|
15 | $ hg ci -Am C1 | |
16 | adding C1 |
|
16 | adding C1 | |
17 |
|
17 | |||
18 | $ echo C2 > C2 |
|
18 | $ echo C2 > C2 | |
19 | $ hg ci -Am C2 |
|
19 | $ hg ci -Am C2 | |
20 | adding C2 |
|
20 | adding C2 | |
21 |
|
21 | |||
22 | $ cd .. |
|
22 | $ cd .. | |
23 |
|
23 | |||
24 | $ hg clone a b |
|
24 | $ hg clone a b | |
25 | updating to branch default |
|
25 | updating to branch default | |
26 | 2 files updated, 0 files merged, 0 files removed, 0 files unresolved |
|
26 | 2 files updated, 0 files merged, 0 files removed, 0 files unresolved | |
27 |
|
27 | |||
28 | $ hg clone a c |
|
28 | $ hg clone a c | |
29 | updating to branch default |
|
29 | updating to branch default | |
30 | 2 files updated, 0 files merged, 0 files removed, 0 files unresolved |
|
30 | 2 files updated, 0 files merged, 0 files removed, 0 files unresolved | |
31 |
|
31 | |||
32 | $ cd b |
|
32 | $ cd b | |
33 |
|
33 | |||
34 | $ echo L1 > L1 |
|
34 | $ echo L1 > L1 | |
35 | $ hg ci -Am L1 |
|
35 | $ hg ci -Am L1 | |
36 | adding L1 |
|
36 | adding L1 | |
37 |
|
37 | |||
38 |
|
38 | |||
39 | $ cd ../a |
|
39 | $ cd ../a | |
40 |
|
40 | |||
41 | $ echo R1 > R1 |
|
41 | $ echo R1 > R1 | |
42 | $ hg ci -Am R1 |
|
42 | $ hg ci -Am R1 | |
43 | adding R1 |
|
43 | adding R1 | |
44 |
|
44 | |||
45 |
|
45 | |||
46 | $ cd ../b |
|
46 | $ cd ../b | |
47 |
|
47 | |||
48 | Now b has one revision to be pulled from a: |
|
48 | Now b has one revision to be pulled from a: | |
49 |
|
49 | |||
50 | $ hg pull --rebase |
|
50 | $ hg pull --rebase | |
51 | pulling from $TESTTMP/a (glob) |
|
51 | pulling from $TESTTMP/a (glob) | |
52 | searching for changes |
|
52 | searching for changes | |
53 | adding changesets |
|
53 | adding changesets | |
54 | adding manifests |
|
54 | adding manifests | |
55 | adding file changes |
|
55 | adding file changes | |
56 | added 1 changesets with 1 changes to 1 files (+1 heads) |
|
56 | added 1 changesets with 1 changes to 1 files (+1 heads) | |
57 | saved backup bundle to $TESTTMP/b/.hg/strip-backup/*-backup.hg (glob) |
|
57 | saved backup bundle to $TESTTMP/b/.hg/strip-backup/*-backup.hg (glob) | |
58 |
|
58 | |||
59 | $ hg tglog |
|
59 | $ hg tglog | |
60 | @ 3: 'L1' |
|
60 | @ 3: 'L1' | |
61 | | |
|
61 | | | |
62 | o 2: 'R1' |
|
62 | o 2: 'R1' | |
63 | | |
|
63 | | | |
64 | o 1: 'C2' |
|
64 | o 1: 'C2' | |
65 | | |
|
65 | | | |
66 | o 0: 'C1' |
|
66 | o 0: 'C1' | |
67 |
|
67 | |||
68 | Re-run: |
|
68 | Re-run: | |
69 |
|
69 | |||
70 | $ hg pull --rebase |
|
70 | $ hg pull --rebase | |
71 | pulling from $TESTTMP/a (glob) |
|
71 | pulling from $TESTTMP/a (glob) | |
72 | searching for changes |
|
72 | searching for changes | |
73 | no changes found |
|
73 | no changes found | |
74 |
|
74 | |||
75 |
|
75 | |||
76 | Invoke pull --rebase and nothing to rebase: |
|
76 | Invoke pull --rebase and nothing to rebase: | |
77 |
|
77 | |||
78 | $ cd ../c |
|
78 | $ cd ../c | |
79 |
|
79 | |||
80 | $ hg book norebase |
|
80 | $ hg book norebase | |
81 | $ hg pull --rebase |
|
81 | $ hg pull --rebase | |
82 | pulling from $TESTTMP/a (glob) |
|
82 | pulling from $TESTTMP/a (glob) | |
83 | searching for changes |
|
83 | searching for changes | |
84 | adding changesets |
|
84 | adding changesets | |
85 | adding manifests |
|
85 | adding manifests | |
86 | adding file changes |
|
86 | adding file changes | |
87 | added 1 changesets with 1 changes to 1 files |
|
87 | added 1 changesets with 1 changes to 1 files | |
88 | nothing to rebase |
|
88 | nothing to rebase | |
89 | 1 files updated, 0 files merged, 0 files removed, 0 files unresolved |
|
89 | 1 files updated, 0 files merged, 0 files removed, 0 files unresolved | |
90 | updating bookmark norebase |
|
90 | updating bookmark norebase | |
91 |
|
91 | |||
92 | $ hg tglog -l 1 |
|
92 | $ hg tglog -l 1 | |
93 | @ 2: 'R1' |
|
93 | @ 2: 'R1' | |
94 | | |
|
94 | | | |
95 |
|
95 | |||
96 | pull --rebase --update should ignore --update: |
|
96 | pull --rebase --update should ignore --update: | |
97 |
|
97 | |||
98 | $ hg pull --rebase --update |
|
98 | $ hg pull --rebase --update | |
99 | pulling from $TESTTMP/a (glob) |
|
99 | pulling from $TESTTMP/a (glob) | |
100 | searching for changes |
|
100 | searching for changes | |
101 | no changes found |
|
101 | no changes found | |
102 |
|
102 | |||
103 | pull --rebase doesn't update if nothing has been pulled: |
|
103 | pull --rebase doesn't update if nothing has been pulled: | |
104 |
|
104 | |||
105 | $ hg up -q 1 |
|
105 | $ hg up -q 1 | |
106 |
|
106 | |||
107 | $ hg pull --rebase |
|
107 | $ hg pull --rebase | |
108 | pulling from $TESTTMP/a (glob) |
|
108 | pulling from $TESTTMP/a (glob) | |
109 | searching for changes |
|
109 | searching for changes | |
110 | no changes found |
|
110 | no changes found | |
111 |
|
111 | |||
112 | $ hg tglog -l 1 |
|
112 | $ hg tglog -l 1 | |
113 | o 2: 'R1' |
|
113 | o 2: 'R1' | |
114 | | |
|
114 | | | |
115 |
|
115 | |||
116 | $ cd .. |
|
116 | $ cd .. | |
|
117 | ||||
|
118 | pull --rebase works when a specific revision is pulled (issue3619) | |||
|
119 | ||||
|
120 | $ cd a | |||
|
121 | $ hg tglog | |||
|
122 | @ 2: 'R1' | |||
|
123 | | | |||
|
124 | o 1: 'C2' | |||
|
125 | | | |||
|
126 | o 0: 'C1' | |||
|
127 | ||||
|
128 | $ echo R2 > R2 | |||
|
129 | $ hg ci -Am R2 | |||
|
130 | adding R2 | |||
|
131 | $ echo R3 > R3 | |||
|
132 | $ hg ci -Am R3 | |||
|
133 | adding R3 | |||
|
134 | $ cd ../c | |||
|
135 | $ hg tglog | |||
|
136 | o 2: 'R1' | |||
|
137 | | | |||
|
138 | @ 1: 'C2' | |||
|
139 | | | |||
|
140 | o 0: 'C1' | |||
|
141 | ||||
|
142 | $ echo L1 > L1 | |||
|
143 | $ hg ci -Am L1 | |||
|
144 | adding L1 | |||
|
145 | created new head | |||
|
146 | $ hg pull --rev tip --rebase | |||
|
147 | pulling from $TESTTMP/a | |||
|
148 | searching for changes | |||
|
149 | adding changesets | |||
|
150 | adding manifests | |||
|
151 | adding file changes | |||
|
152 | added 2 changesets with 2 changes to 2 files | |||
|
153 | saved backup bundle to $TESTTMP/c/.hg/strip-backup/ff8d69a621f9-backup.hg (glob) | |||
|
154 | $ hg tglog | |||
|
155 | @ 5: 'L1' | |||
|
156 | | | |||
|
157 | o 4: 'R3' | |||
|
158 | | | |||
|
159 | o 3: 'R2' | |||
|
160 | | | |||
|
161 | o 2: 'R1' | |||
|
162 | | | |||
|
163 | o 1: 'C2' | |||
|
164 | | | |||
|
165 | o 0: 'C1' | |||
|
166 | ||||
|
167 | ||||
|
168 |
General Comments 0
You need to be logged in to leave comments.
Login now