1
# Copyright (C) 2006 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
"""Remove the last revision from the history of the current branch."""
19
# TODO: make the guts of this methods on tree, branch.
3
Remove the last revision from the history of the current branch.
25
revision as _mod_revision,
27
from bzrlib.branch import Branch
28
8
from bzrlib.errors import BoundBranchOutOfDate
31
def uncommit(branch, dry_run=False, verbose=False, revno=None, tree=None,
10
def test_remove(filename):
11
if os.path.exists(filename):
14
print '* file does not exist: %r' % filename
17
def uncommit(branch, dry_run=False, verbose=False, revno=None, tree=None):
33
18
"""Remove the last revision from the supplied branch.
35
20
:param dry_run: Don't actually change anything
36
21
:param verbose: Print each step as you do it
37
22
:param revno: Remove back to this revision
38
:param local: If this branch is bound, only remove the revisions from the
39
local branch. If this branch is not bound, it is an error to pass
24
from bzrlib.atomicfile import AtomicFile
44
27
if tree is not None:
46
29
unlockable.append(tree)
48
31
branch.lock_write()
49
32
unlockable.append(branch)
53
pending_merges = tree.get_parent_ids()[1:]
57
if branch.get_bound_location() is None:
58
raise errors.LocalRequiresBoundBranch()
60
master = branch.get_master_branch()
61
if master is not None:
63
unlockable.append(master)
64
old_revno, old_tip = branch.last_revision_info()
65
if master is not None and old_tip != master.last_revision():
34
master = branch.get_master_branch()
35
if master is not None:
37
unlockable.append(master)
38
rh = branch.revision_history()
39
if master is not None and rh[-1] != master.last_revision():
66
40
raise BoundBranchOutOfDate(branch, master)
71
revid_iterator = branch.repository.iter_reverse_revision_history(
74
new_revision_id = old_tip
75
graph = branch.repository.get_graph()
76
for rev_id in revid_iterator:
77
if cur_revno == new_revno:
78
new_revision_id = rev_id
45
for r in range(revno-1, len(rh)):
81
print 'Removing revno %d: %s' % (cur_revno, rev_id)
83
parents = graph.get_parent_map([rev_id]).get(rev_id, None)
86
# When we finish popping off the pending merges, we want
87
# them to stay in the order that they used to be.
88
# but we pop from the end, so reverse the order, and
89
# then get the order right at the end
90
pending_merges.extend(reversed(parents[1:]))
92
# We ran off the end of revisions, which means we should be trying
93
# to get to NULL_REVISION
94
new_revision_id = _mod_revision.NULL_REVISION
48
print 'Removing revno %d: %s' % (len(rh)+1, rev_id)
51
# Committing before we start removing files, because
52
# once we have removed at least one, all the rest are invalid.
97
54
if master is not None:
98
master.set_last_revision_info(new_revno, new_revision_id)
99
branch.set_last_revision_info(new_revno, new_revision_id)
106
for hook in Branch.hooks['post_uncommit']:
107
hook_new_tip = new_revision_id
108
if hook_new_tip == _mod_revision.NULL_REVISION:
110
hook(hook_local, hook_master, old_revno, old_tip, new_revno,
55
master.set_revision_history(rh)
56
branch.set_revision_history(rh)
112
57
if tree is not None:
113
if not _mod_revision.is_null(new_revision_id):
114
parents = [new_revision_id]
117
parents.extend(reversed(pending_merges))
118
tree.set_parent_ids(parents)
58
tree.set_last_revision(branch.last_revision())
120
60
for item in reversed(unlockable):