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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17
"""Remove the last revision from the history of the current branch."""
19
# TODO: make the guts of this methods on tree, branch.
23
from bzrlib import revision as _mod_revision
24
from bzrlib.branch import Branch
25
from bzrlib.errors import BoundBranchOutOfDate
28
def uncommit(branch, dry_run=False, verbose=False, revno=None, tree=None):
29
"""Remove the last revision from the supplied branch.
31
:param dry_run: Don't actually change anything
32
:param verbose: Print each step as you do it
33
:param revno: Remove back to this revision
39
unlockable.append(tree)
42
unlockable.append(branch)
46
pending_merges = tree.get_parent_ids()[1:]
48
master = branch.get_master_branch()
49
if master is not None:
51
unlockable.append(master)
52
rh = branch.revision_history()
53
if master is not None and rh[-1] != master.last_revision():
54
raise BoundBranchOutOfDate(branch, master)
57
old_revno, old_tip = branch.last_revision_info()
61
for r in range(revno-1, len(rh)):
63
# NB: performance would be better using the revision graph rather
64
# than the whole revision.
65
rev = branch.repository.get_revision(rev_id)
66
# When we finish popping off the pending merges, we want
67
# them to stay in the order that they used to be.
68
# but we pop from the end, so reverse the order, and
69
# then get the order right at the end
70
pending_merges.extend(reversed(rev.parent_ids[1:]))
72
print 'Removing revno %d: %s' % (len(rh)+1, rev_id)
74
# Committing before we start removing files, because
75
# once we have removed at least one, all the rest are invalid.
77
if master is not None:
78
master.set_revision_history(rh)
79
branch.set_revision_history(rh)
80
new_tip = _mod_revision.ensure_null(branch.last_revision())
87
for hook in Branch.hooks['post_uncommit']:
88
hook_new_tip = new_tip
89
if hook_new_tip == _mod_revision.NULL_REVISION:
91
hook(hook_local, hook_master, old_revno, old_tip, new_revno,
94
if not _mod_revision.is_null(new_tip):
98
parents.extend(reversed(pending_merges))
99
tree.set_parent_ids(parents)
101
for item in reversed(unlockable):