62
60
:param show_ids: If set, includes each file's id.
63
61
:param to_file: If set, write to this file (default stdout.)
64
62
:param show_pending: If set, write pending merges.
65
:param revision: If None, compare latest revision with working tree
66
If not None, it must be a RevisionSpec list.
67
If one revision, compare with working tree.
68
If two revisions, show status between first and second.
63
:param revision: If None the compare latest revision with working tree
64
If not None it must be a RevisionSpec list.
65
If one revision show compared it with working tree.
66
If two revisions show status between first and second.
69
67
:param short: If True, gives short SVN-style status lines.
70
68
:param versioned: If True, only shows versioned files.
72
70
if show_unchanged is not None:
73
warn("show_tree_status with show_unchanged has been deprecated "
71
warn("show_status_trees with show_unchanged has been deprecated "
74
72
"since bzrlib 0.9", DeprecationWarning, stacklevel=2)
76
74
if to_file is None:
146
def _get_sorted_revisions(tip_revision, revision_ids, parent_map):
147
"""Get an iterator which will return the revisions in merge sorted order.
149
This will build up a list of all nodes, such that only nodes in the list
150
are referenced. It then uses MergeSorter to return them in 'merge-sorted'
153
:param revision_ids: A set of revision_ids
154
:param parent_map: The parent information for each node. Revisions which
155
are considered ghosts should not be present in the map.
156
:return: iterator from MergeSorter.iter_topo_order()
158
# MergeSorter requires that all nodes be present in the graph, so get rid
159
# of any references pointing outside of this graph.
161
for revision_id in revision_ids:
162
if revision_id not in parent_map: # ghost
163
parent_graph[revision_id] = []
165
# Only include parents which are in this sub-graph
166
parent_graph[revision_id] = [p for p in parent_map[revision_id]
167
if p in revision_ids]
168
sorter = tsort.MergeSorter(parent_graph, tip_revision)
169
return sorter.iter_topo_order()
172
145
def show_pending_merges(new, to_file, short=False):
173
146
"""Write out a display of pending merges in a working tree."""
174
147
parents = new.get_parent_ids()
175
148
if len(parents) < 2:
178
# we need one extra space for terminals that wrap on last char
179
term_width = osutils.terminal_width() - 1
187
150
pending = parents[1:]
188
151
branch = new.branch
189
152
last_revision = parents[0]
191
154
to_file.write('pending merges:\n')
192
graph = branch.repository.get_graph()
193
other_revisions = [last_revision]
194
log_formatter = log.LineLogFormatter(to_file)
155
if last_revision is not None:
157
ignore = set(branch.repository.get_ancestry(last_revision,
159
except errors.NoSuchRevision:
160
# the last revision is a ghost : assume everything is new
162
ignore = set([None, last_revision])
165
# TODO: this could be improved using merge_sorted - we'd get the same
166
# output rather than one level of indent.
195
167
for merge in pending:
197
rev = branch.repository.get_revisions([merge])[0]
198
except errors.NoSuchRevision:
199
# If we are missing a revision, just print out the revision id
200
to_file.write(first_prefix + '(ghost) ' + merge + '\n')
201
other_revisions.append(merge)
204
# Log the merge, as it gets a slightly different formatting
205
log_message = log_formatter.log_string(None, rev,
206
term_width - len(first_prefix))
207
to_file.write(first_prefix + log_message + '\n')
208
# Find all of the revisions in the merge source, which are not in the
209
# last committed revision.
210
merge_extra = graph.find_unique_ancestors(merge, other_revisions)
211
other_revisions.append(merge)
212
merge_extra.discard(_mod_revision.NULL_REVISION)
214
# Get a handle to all of the revisions we will need
216
revisions = dict((rev.revision_id, rev) for rev in
217
branch.repository.get_revisions(merge_extra))
218
except errors.NoSuchRevision:
219
# One of the sub nodes is a ghost, check each one
221
for revision_id in merge_extra:
223
rev = branch.repository.get_revisions([revision_id])[0]
224
except errors.NoSuchRevision:
225
revisions[revision_id] = None
170
from bzrlib.osutils import terminal_width
171
width = terminal_width() - 1 # we need one extra space to avoid
173
m_revision = branch.repository.get_revision(merge)
178
to_file.write(prefix)
179
to_file.write(line_log(m_revision, width - len(prefix)))
181
inner_merges = branch.repository.get_ancestry(merge)
182
assert inner_merges[0] is None
184
inner_merges.reverse()
185
for mmerge in inner_merges:
188
mm_revision = branch.repository.get_revision(mmerge)
227
revisions[revision_id] = rev
229
# Display the revisions brought in by this merge.
230
rev_id_iterator = _get_sorted_revisions(merge, merge_extra,
231
branch.repository.get_parent_map(merge_extra))
232
# Skip the first node
233
num, first, depth, eom = rev_id_iterator.next()
235
raise AssertionError('Somehow we misunderstood how'
236
' iter_topo_order works %s != %s' % (first, merge))
237
for num, sub_merge, depth, eom in rev_id_iterator:
238
rev = revisions[sub_merge]
240
to_file.write(sub_prefix + '(ghost) ' + sub_merge + '\n')
242
log_message = log_formatter.log_string(None,
243
revisions[sub_merge],
244
term_width - len(sub_prefix))
245
to_file.write(sub_prefix + log_message + '\n')
248
def _raise_if_nonexistent(paths, old_tree, new_tree):
249
"""Complain if paths are not in either inventory or tree.
251
It's OK with the files exist in either tree's inventory, or
252
if they exist in the tree but are not versioned.
254
This can be used by operations such as bzr status that can accept
255
unknown or ignored files.
257
mutter("check paths: %r", paths)
260
s = old_tree.filter_unversioned_files(paths)
261
s = new_tree.filter_unversioned_files(s)
262
s = [path for path in s if not new_tree.has_filename(path)]
264
raise errors.PathsDoNotExist(sorted(s))
193
to_file.write(prefix)
194
to_file.write(line_log(mm_revision, width - len(prefix)))
197
except errors.NoSuchRevision:
202
to_file.write(prefix + ' ' + merge)