1
1
# Copyright (C) 2005 Aaron Bentley
2
# <aaron@aaronbentley.com>
2
# <aaron.bentley@utoronto.ca>
4
4
# This program is free software; you can redistribute it and/or modify
5
5
# it under the terms of the GNU General Public License as published by
56
56
for me, my_parents in ancestors.iteritems():
59
new_ancestors[me] = {}
59
new_ancestors[me] = {}
60
60
for parent in my_parents:
63
63
while can_skip(new_parent, descendants, ancestors):
64
64
if new_parent in exceptions:
69
69
new_parent = list(ancestors[new_parent])[0]
71
71
new_ancestors[me][new_parent] = distance
74
74
def get_rev_info(rev_id, source):
75
75
"""Return the committer, message, and date of a revision."""
79
79
if rev_id == 'null:':
80
return None, 'Null Revision', None, None
80
return None, 'Null Revision', None
82
82
rev = source.get_revision(rev_id)
83
83
except NoSuchRevision:
85
85
committer = '-'.join(rev_id.split('-')[:-2]).strip(' ')
86
86
if committer == '':
87
return None, None, None, None
87
return None, None, None
89
return None, None, None, None
89
return None, None, None
91
91
committer = short_committer(rev.committer)
92
92
if rev.message is not None:
93
93
message = rev.message.split('\n')[0]
94
94
gmtime = time.gmtime(rev.timestamp + (rev.timezone or 0))
95
95
date = time.strftime('%Y/%m/%d', gmtime)
96
nick = rev.properties.get('branch-nick')
97
96
if '@' in committer:
99
98
committer = mail_map[committer]
103
102
committer = committer_alias[committer]
106
return committer, message, nick, date
105
return committer, message, date
108
107
class Grapher(object):
109
108
def __init__(self, branch, other_branch=None):
128
127
self.n_history = branch.revision_history()
129
self.n_revnos = branch.get_revision_id_to_revno_map()
130
self.distances = node_distances(self.descendants, self.ancestors,
128
self.distances = node_distances(self.descendants, self.ancestors,
132
130
if other_branch is not None:
133
131
self.base = select_farthest(self.distances, self.common)
134
self.m_history = other_branch.revision_history()
135
self.m_revnos = other_branch.get_revision_id_to_revno_map()
136
new_graph = getattr(branch.repository, 'get_graph', lambda: None)()
137
if new_graph is None:
141
self.new_base = new_graph.find_unique_lca(revision_a,
143
self.lcas = new_graph.find_lca(revision_a, revision_b)
132
self.m_history = other_branch.revision_history()
148
135
self.m_history = []
152
def _get_revno_str(prefix, revno_map, revision_id):
154
revno = revno_map[revision_id]
157
return '%s%s' % (prefix, '.'.join(str(n) for n in revno))
159
137
def dot_node(self, node, num):
166
144
except ValueError:
168
146
if (n_rev, m_rev) == (None, None):
169
name = self._get_revno_str('r', self.n_revnos, node)
171
name = self._get_revno_str('R', self.m_revnos, node)
175
149
elif n_rev == m_rev:
176
150
name = "rR%d" % n_rev
196
170
assert m_rev is not None
197
171
cluster = "other_history"
198
172
color = "#ff0000"
199
if node in self.lcas:
201
173
if node == self.base:
203
if node == self.new_base:
205
if node == self.new_base:
209
committer, message, nick, date = get_rev_info(node,
210
self.branch.repository)
177
committer, message, date = get_rev_info(node, self.branch.repository)
211
178
if committer is not None:
212
179
label.append(committer)
217
181
if date is not None:
218
182
label.append(date)
226
d_node = Node("n%d" % num, color=color, label="\\n".join(label),
190
d_node = Node("n%d" % num, color=color, label="\\n".join(label),
227
191
rev_id=node, cluster=cluster, message=message,
229
193
d_node.rank = rank
232
196
d_node.node_style.append('dotted')
236
def get_relations(self, collapse=False, max_distance=None):
200
def get_relations(self, collapse=False):
238
202
node_relations = []
241
exceptions = self.lcas.union([self.base, self.new_base])
242
visible_ancestors = compact_ancestors(self.descendants,
205
visible_ancestors = compact_ancestors(self.descendants,
206
self.ancestors, (self.base,))
246
visible_ancestors = {}
247
for revision, parents in self.ancestors.iteritems():
248
visible_ancestors[revision] = dict((p, 0) for p in parents)
249
if max_distance is not None:
250
min_distance = max(self.distances.values()) - max_distance
251
visible_ancestors = dict((n, p) for n, p in
252
visible_ancestors.iteritems() if
253
self.distances[n] >= min_distance)
208
visible_ancestors = self.ancestors
254
209
for node, parents in visible_ancestors.iteritems():
255
210
if node not in dot_nodes:
256
211
dot_nodes[node] = self.dot_node(node, num)
258
for parent, skipped in parents.iteritems():
213
if visible_ancestors is self.ancestors:
214
parent_iter = ((f, 0) for f in parents)
216
parent_iter = (f for f in parents.iteritems())
217
for parent, skipped in parent_iter:
259
218
if parent not in dot_nodes:
260
219
dot_nodes[parent] = self.dot_node(parent, num)
269
228
def write_ancestry_file(branch, filename, collapse=True, antialias=True,
270
merge_branch=None, ranking="forced", max_distance=None):
229
merge_branch=None, ranking="forced"):
271
230
b = Branch.open_containing(branch)[0]
272
231
if merge_branch is not None:
273
232
m = Branch.open_containing(merge_branch)[0]
311
270
raise BzrCommandError("Can't find 'dot'. Please ensure Graphviz"\
312
" is installed correctly.")
271
" is installed correctly, or use --noantialias")
313
272
elif ext == 'dot' and not done:
314
273
my_file = file(filename, 'wb')
315
274
for fragment in output:
319
278
invoke_dot_html(output, filename)
321
280
raise BzrCommandError("Can't find 'dot'. Please ensure Graphviz"\
322
" is installed correctly.")
281
" is installed correctly, or use --noantialias")
324
283
print "Unknown file extension: %s" % ext