1
# (C) 2005 Canonical Ltd
1
# Copyright (C) 2005, 2006, 2007 Canonical Ltd
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
5
5
# the Free Software Foundation; either version 2 of the License, or
6
6
# (at your option) any later version.
8
8
# This program is distributed in the hope that it will be useful,
9
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
11
# GNU General Public License for more details.
13
13
# You should have received a copy of the GNU General Public License
14
14
# along with this program; if not, write to the Free Software
15
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19
def show_status(branch, show_unchanged=False,
24
"""Display single-line status for non-ignored working files.
27
If true, show unmodified files too.
30
If set, only show the status of files in this list.
33
If set, write to this file (default stdout.)
25
revision as _mod_revision,
27
from bzrlib.diff import _raise_if_nonexistent
28
import bzrlib.errors as errors
29
from bzrlib.osutils import is_inside_any
30
from bzrlib.symbol_versioning import (deprecated_function,
32
from bzrlib.trace import warning
34
# TODO: when showing single-line logs, truncate to the width of the terminal
35
# if known, but only if really going to the terminal (not into a file)
38
def show_tree_status(wt, show_unchanged=None,
46
"""Display summary of changes.
48
By default this compares the working tree to a previous revision.
49
If the revision argument is given, summarizes changes between the
50
working tree and another, or between two revisions.
52
The result is written out as Unicode and to_file should be able
55
If showing the status of a working tree, extra information is included
56
about unknown files, conflicts, and pending merges.
58
:param show_unchanged: Deprecated parameter. If set, includes unchanged
60
:param specific_files: If set, a list of filenames whose status should be
61
shown. It is an error to give a filename that is not in the working
62
tree, or in the working inventory or in the basis inventory.
63
:param show_ids: If set, includes each file's id.
64
:param to_file: If set, write to this file (default stdout.)
65
:param show_pending: If set, write pending merges.
66
:param revision: If None, compare latest revision with working tree
67
If not None, it must be a RevisionSpec list.
68
If one revision, compare with working tree.
69
If two revisions, show status between first and second.
70
:param short: If True, gives short SVN-style status lines.
71
:param versioned: If True, only shows versioned files.
36
from bzrlib.delta import compare_trees
73
if show_unchanged is not None:
74
warn("show_tree_status with show_unchanged has been deprecated "
75
"since bzrlib 0.9", DeprecationWarning, stacklevel=2)
39
78
to_file = sys.stdout
44
old = branch.basis_tree()
45
new = branch.working_tree()
47
delta = compare_trees(old, new, want_unchanged=show_unchanged,
48
specific_files=specific_files)
52
show_unchanged=show_unchanged)
54
unknowns = new.unknowns()
57
# FIXME: Should also match if the unknown file is within a
58
# specified directory.
60
if path not in specific_files:
63
print >>to_file, 'unknown:'
65
print >>to_file, ' ', path
66
if show_pending and len(branch.pending_merges()) > 0:
67
print >>to_file, 'pending merges:'
68
for merge in branch.pending_merges():
69
print >> to_file, ' ', merge
82
new_is_working_tree = True
84
if wt.last_revision() != wt.branch.last_revision():
85
warning("working tree is out of date, run 'bzr update'")
87
old = new.basis_tree()
88
elif len(revision) > 0:
90
old = revision[0].as_tree(wt.branch)
91
except errors.NoSuchRevision, e:
92
raise errors.BzrCommandError(str(e))
93
if (len(revision) > 1) and (revision[1].spec is not None):
95
new = revision[1].as_tree(wt.branch)
96
new_is_working_tree = False
97
except errors.NoSuchRevision, e:
98
raise errors.BzrCommandError(str(e))
104
_raise_if_nonexistent(specific_files, old, new)
105
want_unversioned = not versioned
107
changes = new.iter_changes(old, show_unchanged, specific_files,
108
require_versioned=False, want_unversioned=want_unversioned)
109
reporter = _mod_delta._ChangeReporter(output_file=to_file,
110
unversioned_filter=new.is_ignored)
111
_mod_delta.report_changes(changes, reporter)
113
delta = new.changes_from(old, want_unchanged=show_unchanged,
114
specific_files=specific_files,
115
want_unversioned=want_unversioned)
116
# filter out unknown files. We may want a tree method for
118
delta.unversioned = [unversioned for unversioned in
119
delta.unversioned if not new.is_ignored(unversioned[0])]
122
show_unchanged=show_unchanged,
124
# show the new conflicts only for now. XXX: get them from the
126
conflicts = new.conflicts()
127
if specific_files is not None:
128
conflicts = conflicts.select_conflicts(new, specific_files,
129
ignore_misses=True, recurse=True)[1]
130
if len(conflicts) > 0 and not short:
131
to_file.write("conflicts:\n")
132
for conflict in conflicts:
137
to_file.write("%s %s\n" % (prefix, conflict))
138
if (new_is_working_tree and show_pending):
139
show_pending_merges(new, to_file, short)
147
def _get_sorted_revisions(tip_revision, revision_ids, parent_map):
148
"""Get an iterator which will return the revisions in merge sorted order.
150
This will build up a list of all nodes, such that only nodes in the list
151
are referenced. It then uses MergeSorter to return them in 'merge-sorted'
154
:param revision_ids: A set of revision_ids
155
:param parent_map: The parent information for each node. Revisions which
156
are considered ghosts should not be present in the map.
157
:return: iterator from MergeSorter.iter_topo_order()
159
# MergeSorter requires that all nodes be present in the graph, so get rid
160
# of any references pointing outside of this graph.
162
for revision_id in revision_ids:
163
if revision_id not in parent_map: # ghost
164
parent_graph[revision_id] = []
166
# Only include parents which are in this sub-graph
167
parent_graph[revision_id] = [p for p in parent_map[revision_id]
168
if p in revision_ids]
169
sorter = tsort.MergeSorter(parent_graph, tip_revision)
170
return sorter.iter_topo_order()
173
def show_pending_merges(new, to_file, short=False):
174
"""Write out a display of pending merges in a working tree."""
175
parents = new.get_parent_ids()
179
# we need one extra space for terminals that wrap on last char
180
term_width = osutils.terminal_width() - 1
188
pending = parents[1:]
190
last_revision = parents[0]
192
to_file.write('pending merges:\n')
193
graph = branch.repository.get_graph()
194
other_revisions = [last_revision]
195
log_formatter = log.LineLogFormatter(to_file)
196
for merge in pending:
198
rev = branch.repository.get_revisions([merge])[0]
199
except errors.NoSuchRevision:
200
# If we are missing a revision, just print out the revision id
201
to_file.write(first_prefix + '(ghost) ' + merge + '\n')
202
other_revisions.append(merge)
205
# Log the merge, as it gets a slightly different formatting
206
log_message = log_formatter.log_string(None, rev,
207
term_width - len(first_prefix))
208
to_file.write(first_prefix + log_message + '\n')
209
# Find all of the revisions in the merge source, which are not in the
210
# last committed revision.
211
merge_extra = graph.find_unique_ancestors(merge, other_revisions)
212
other_revisions.append(merge)
213
merge_extra.discard(_mod_revision.NULL_REVISION)
215
# Get a handle to all of the revisions we will need
217
revisions = dict((rev.revision_id, rev) for rev in
218
branch.repository.get_revisions(merge_extra))
219
except errors.NoSuchRevision:
220
# One of the sub nodes is a ghost, check each one
222
for revision_id in merge_extra:
224
rev = branch.repository.get_revisions([revision_id])[0]
225
except errors.NoSuchRevision:
226
revisions[revision_id] = None
228
revisions[revision_id] = rev
230
# Display the revisions brought in by this merge.
231
rev_id_iterator = _get_sorted_revisions(merge, merge_extra,
232
branch.repository.get_parent_map(merge_extra))
233
# Skip the first node
234
num, first, depth, eom = rev_id_iterator.next()
236
raise AssertionError('Somehow we misunderstood how'
237
' iter_topo_order works %s != %s' % (first, merge))
238
for num, sub_merge, depth, eom in rev_id_iterator:
239
rev = revisions[sub_merge]
241
to_file.write(sub_prefix + '(ghost) ' + sub_merge + '\n')
243
log_message = log_formatter.log_string(None,
244
revisions[sub_merge],
245
term_width - len(sub_prefix))
246
to_file.write(sub_prefix + log_message + '\n')