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.
23
revision as _mod_revision,
25
from .branch import Branch
26
from .errors import BoundBranchOutOfDate
29
def remove_tags(branch, graph, old_tip, parents):
30
"""Remove tags on revisions between old_tip and new_tip.
32
:param branch: Branch to remove tags from
33
:param graph: Graph object for branch repository
34
:param old_tip: Old branch tip
35
:param parents: New parents
36
:return: Names of the removed tags
38
reverse_tags = branch.tags.get_reverse_tag_dict()
39
ancestors = graph.find_unique_ancestors(old_tip, parents)
41
for revid, tags in reverse_tags.items():
42
if revid not in ancestors:
45
branch.tags.delete_tag(tag)
46
removed_tags.append(tag)
50
def uncommit(branch, dry_run=False, verbose=False, revno=None, tree=None,
51
local=False, keep_tags=False):
3
Remove the last revision from the history of the current branch.
9
def test_remove(filename):
10
if os.path.exists(filename):
13
print '* file does not exist: %r' % filename
16
def uncommit(branch, remove_files=False,
17
dry_run=False, verbose=False, revno=None):
52
18
"""Remove the last revision from the supplied branch.
54
:param dry_run: Don't actually change anything
55
:param verbose: Print each step as you do it
56
:param revno: Remove back to this revision
57
:param local: If this branch is bound, only remove the revisions from the
58
local branch. If this branch is not bound, it is an error to pass
60
:param keep_tags: Whether to keep tags pointing at the removed revisions
20
:param remove_files: If True, remove files from the stores
22
:param force: Don't ask any questions
67
unlockable.append(tree)
70
unlockable.append(branch)
74
pending_merges = tree.get_parent_ids()[1:]
78
if branch.get_bound_location() is None:
79
raise errors.LocalRequiresBoundBranch()
81
master = branch.get_master_branch()
82
if master is not None:
84
unlockable.append(master)
85
old_revno, old_tip = branch.last_revision_info()
86
if master is not None and old_tip != master.last_revision():
87
raise BoundBranchOutOfDate(branch, master)
93
new_revision_id = old_tip
94
graph = branch.repository.get_graph()
95
for rev_id in graph.iter_lefthand_ancestry(old_tip):
96
if cur_revno == new_revno:
97
new_revision_id = rev_id
100
print('Removing revno %d: %s' % (cur_revno, rev_id))
102
parents = graph.get_parent_map([rev_id]).get(rev_id, None)
105
# When we finish popping off the pending merges, we want
106
# them to stay in the order that they used to be.
107
# but we pop from the end, so reverse the order, and
108
# then get the order right at the end
109
pending_merges.extend(reversed(parents[1:]))
111
# We ran off the end of revisions, which means we should be trying
112
# to get to NULL_REVISION
113
new_revision_id = _mod_revision.NULL_REVISION
116
if master is not None:
117
master.set_last_revision_info(new_revno, new_revision_id)
118
branch.set_last_revision_info(new_revno, new_revision_id)
125
for hook in Branch.hooks['post_uncommit']:
126
hook_new_tip = new_revision_id
127
if hook_new_tip == _mod_revision.NULL_REVISION:
129
hook(hook_local, hook_master, old_revno, old_tip, new_revno,
131
if not _mod_revision.is_null(new_revision_id):
132
parents = [new_revision_id]
136
parents.extend(reversed(pending_merges))
137
tree.set_parent_ids(parents)
138
if branch.supports_tags() and not keep_tags:
139
remove_tags(branch, graph, old_tip, parents)
141
for item in reversed(unlockable):
24
from bzrlib.atomicfile import AtomicFile
25
rh = branch.revision_history()
30
new_rev_history = AtomicFile(branch.controlfilename('revision-history'))
31
for r in range(revno-1, len(rh)):
34
print 'Removing revno %d: %s' % (len(rh)+1, rev_id)
35
rev = branch.get_revision(rev_id)
36
inv = branch.get_revision_inventory(rev_id)
38
for p in rev.parent_ids:
39
inv_prev.append(branch.get_revision_inventory(p))
42
# Figure out what text-store entries are new
44
# In the future, when we have text_version instead of
45
# text_id, we can just check to see if the text_version
46
# equals the current revision id.
49
if not hasattr(ie, 'text_id'):
51
for other_inv in inv_prev:
52
if file_id in other_inv:
53
other_ie = other_inv[file_id]
54
if other_ie.text_id == ie.text_id:
57
# None of the previous ancestors used
59
files_to_remove.append(branch.controlfilename(['text-store',
61
rev_file = branch.controlfilename(['revision-store',
63
files_to_remove.append(rev_file)
64
inv_file = branch.controlfilename(['inventory-store',
65
rev.inventory_id + '.gz'])
66
files_to_remove.append(inv_file)
68
if verbose and files_to_remove:
69
print 'Removing files:'
70
for f in files_to_remove:
71
print '\t%s' % branch.relpath(f)
73
new_rev_history.write('\n'.join(rh))
75
# Committing before we start removing files, because
76
# once we have removed at least one, all the rest are invalid.
78
new_rev_history.commit()
80
# Actually start removing files
81
for f in files_to_remove:
85
new_rev_history.abort()