1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
|
# -*- coding: iso-8859-1 -*-
#
# Copyright (C) 2005 Edgewall Software
# Copyright (C) 2005-2006 Christian Boos <cboos@neuf.fr>
# Copyright (C) 2005 Johan Rydberg <jrydberg@gnu.org>
# Copyright (C) 2006 Yann Hodique <hodique@lifl.fr>
# Copyright (C) 2006 Lukas Lalinsky <lalinsky@gmail.com>
# Copyright (C) 2006 Marien Zwart <marienz@gentoo.org>
# Copyright (C) 2006, 2007 Panoramic Feedback <abentley@panoramicfeedback.com>
# Copyright (C) 2006,2008,2009 Jelmer Vernooij <jelmer@samba.org>
# Copyright (C) 2009 Martin von Gagern <Martin.vGagern@gmx.net>
# All rights reserved.
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
# This software may be used and distributed according to the terms
# of the GNU General Public License, incorporated herein by reference.
"""Bazaar backend for trac's versioncontrol."""
import datetime
import StringIO
from itertools import izip
import time
import urllib
import re
import fnmatch
import trac
from trac import versioncontrol, core, config, mimeview, wiki
from trac.web.chrome import Chrome
from trac.util.html import html, Markup
trac_version = (int(trac.__version__[0]), int(trac.__version__[2:4]))
if trac_version >= (0,11):
from trac.util.datefmt import utc
# Check trac version. trac 0.11 uses datetime objects for
# timestamp information.
def trac_timestamp(timestamp):
return datetime.datetime.fromtimestamp(timestamp, utc)
from trac.versioncontrol.web_ui.browser import IPropertyRenderer
else:
def trac_timestamp(timestamp):
return timestamp
class IPropertyRenderer(core.Interface):
pass
from bzrlib import (
branch as bzrlib_branch,
bzrdir,
errors,
inventory,
osutils,
revision,
transport,
)
import bzrlib.api
from bzrlib.revision import (
CURRENT_REVISION,
NULL_REVISION,
)
config_section = 'tracbzr'
class BzrConnector(core.Component):
"""The necessary glue between our set of bzr branches and trac."""
core.implements(versioncontrol.IRepositoryConnector)
def __init__(self):
if hasattr(self.env, 'systeminfo'):
bzr_version = '%i.%i.%i' % bzrlib.api.get_current_api_version(None)
self.env.systeminfo.append(('Bazaar', bzr_version))
def get_supported_types(self):
"""Support for `repository_type = bzr`"""
yield ('bzr', 8)
def get_repository(self, repos_type, repos_dir, authname):
"""Return a `BzrRepository`"""
assert repos_type == 'bzr'
return BzrRepository(repos_dir, self)
class BzrWikiMacros(core.Component):
"""Component for macros related to bzr."""
core.implements(wiki.IWikiMacroProvider)
def get_macros(self):
yield 'Branches'
def get_macro_description(self, name):
assert name == 'Branches'
return 'Render a list of available branches.'
def render_macro(self, req, name, content):
assert name == 'Branches'
if trac_version >= (0,11):
chrome = Chrome(self.env)
dateinfo = chrome.populate_data(req, {})['dateinfo']
else:
def dateinfo(timestamp):
from trac.util.datefmt import format_datetime, pretty_timedelta
date = format_datetime(timestamp)
age = pretty_timedelta(timestamp)
return html.SPAN(age, title=date)
repo = self.env.get_repository(req.authname)
if not isinstance(repo, BzrRepository):
raise core.TracError('Configured repository is not a bzr repository')
try:
branches = repo.get_branches()
rows = []
for loc, target in branches:
revid = target.last_revision()
revno = target.revision_id_to_revno(revid)
rev = repo.string_rev(target, revid)
revision = target.repository.get_revision(revid)
timestamp = revision.timestamp
timestamp = dateinfo(timestamp)
rows.append(html.TR([html.TD(x, class_=c) for c, x in [
('name', html.A(loc, class_='dir',
href=req.href.browser(loc))),
('nick', target.nick),
('rev', html.A('[%d]'%revno, href=req.href.changeset(rev))),
('age', timestamp),
('change', revision.message),
]]))
return html.TABLE(class_='listing')(
html.THEAD(html.TR([html.TH(x) for x in [
'Path', 'Nick', 'Revision', 'Age', 'Last Change'
]])),
html.TBODY(rows))
finally:
repo.close()
class BzrPropertyRenderer(core.Component):
"""Renderer for bzr-specific properties."""
core.implements(IPropertyRenderer)
def match_property(self, name, mode):
if name == 'parents' and mode == 'revprop':
return 4
return 0
def render_property(self, name, mode, context, props):
if name == 'parents' and mode == 'revprop':
path = None
if context.resource.realm == 'changeset':
try:
path = context.req.args.get('new_path')
except KeyError:
pass
if path is not None:
path = path.strip('/')
if path == '':
path = None
content = html.TABLE(class_='wiki parents')(
html.THEAD(html.TR([html.TH(h) for h in
['Rev', 'Tree', 'Chgset']])),
html.TBODY([
html.TR(
html.TD(p.split(',')[-1]),
html.TD(html.A('@%s' % p,
href=context.href.browser(path, rev=p))),
html.TD(html.A('[%s]' % p,
href=context.href.changeset(p, path))))
for p in props[name].split('\n')]))
return content
class LockedBranches(object):
"""Keep track of locks and ensure they get unlocked one day.
This deals with the fact that Trac doesn't always call the repository
close method, and that a __del__ method in the repository itself causes
trouble as described in https://bugs.launchpad.net/trac-bzr/+bug/484324"""
def __init__(self):
self._locked_branches = []
def __del__(self):
# XXX Eeeeeww. Unfortunately for us trac does not actually call the
# close method of BzrRepository. So we do this. Quite silly, since
# bzr does the same thing (printing a warning...)
self.unlock()
def append(self, branch):
branch.lock_read()
self._locked_branches.append(branch)
def unlock(self):
for branch in self._locked_branches:
branch.unlock()
self._locked_branches = []
class BzrRepository(versioncontrol.Repository):
"""Present a bzr branch as a trac repository."""
primary_branches = config.ListOption(
config_section, 'primary_branches', ',trunk', keep_empty = True,
doc = """Ordered list of primary branches.
These will be listed first in the Branches macro. When viewing
the timeline, each changeset will be associated with the first
primary branch that contains it. The value is a comma
separated list of globs, as used by the fnmatch module. An
empty list element can be used to denote the branch at the
root of the repository.
Defaults to ',trunk'.""")
def __init__(self, location, component):
versioncontrol.Repository.__init__(self, location, None, component.log)
self.component = component
self.config = component.config
self.root_transport = transport.get_transport(location)
self._tree_cache = {}
self._locked_branches = LockedBranches()
self._branch_cache = {}
self._history = None
self._previous = None
self._revision_cache = {}
def __repr__(self):
return '%s(%r)' % (self.__class__.__name__, self.root_transport.base)
def branch_path(self, branch):
"""Determine the relative path to a branch from the root"""
repo_path = self.root_transport.base
branch_path = branch.bzrdir.root_transport.base
if branch_path.startswith(repo_path):
return branch_path[len(repo_path):].rstrip('/')
else:
repo_path = osutils.normalizepath(repo_path)
branch_path = osutils.normalizepath(branch_path)
return osutils.relpath(repo_path, branch_path)
def string_rev(self, branch, revid):
"""Create a trac rev string.
branch is None or a bzr branch.
"""
if branch is None:
return self._escape_revid(revid)
relpath = self.branch_path(branch)
try:
return self._string_rev_revno(relpath, branch.revision_id_to_revno(revid))
except errors.NoSuchRevision:
dotted = self.dotted_revno(branch, revid)
if dotted is not None:
return self._string_rev_revno(relpath, dotted)
else:
return self._string_rev_revid(relpath, revid)
@staticmethod
def _escape_revid(revid):
return urllib.quote(revid, ':')
@staticmethod
def _unescape_revid(revid):
return urllib.unquote(revid)
@staticmethod
def _escape_branch(relpath):
if '%' in relpath or ',' in relpath:
relpath = urllib.quote(relpath, '')
else:
relpath = relpath.replace('/', ',')
return relpath
@staticmethod
def _unescape_branch(relpath):
if '%' in relpath:
relpath = urllib.unquote(relpath)
else:
relpath = relpath.replace(',', '/')
return relpath
@classmethod
def _string_rev_revid(cls, relpath, revid):
branch_name = cls._escape_branch(relpath)
revid = cls._escape_revid(revid)
if branch_name:
return '%s,%s' % (branch_name, revid)
else:
return '%s' % revid
@classmethod
def _string_rev_revno(cls, relpath, revno):
branch_name = cls._escape_branch(relpath)
if branch_name:
return '%s,%s' % (branch_name, revno)
else:
return str(revno)
def _parse_rev(self, rev):
"""Translate a trac rev string into a (branch, revid) tuple.
branch is None or a bzr branch object.
Supported syntax:
- "123" is revno 123 in the default branch.
- "revid" is a revid in the default branch.
- "spork,123" is revno 123 in the spork branch.
- "spork,revid" is a revid in the spork branch.
(currently revid is assumed to be in the branch ancestry!)
- "spork," is latest revision in the spork branch.
- "spork,1.2.3" is either revno or revid 1.2.3 in the spork branch.
- "foo,bar,123" is revno 123 in the foo/bar branch.
Branch paths have / replaced by , and existing , escaped by doubling.
Revids are urlencoded.
"""
# Make sure our rev is a string
rev=str(rev)
# split branch,revid; no branch denotes branch at root of repository
split = rev.split(',')
if len(split) == 1:
rev_branch = ''
rev_rev = rev
elif len(split) >= 2:
rev_branch = self._unescape_branch(','.join(split[:-1]))
rev_rev = split[-1]
else:
raise versioncontrol.NoSuchChangeset(rev)
# unquote revision part, and treat special cases of current: and null:
rev_rev = self._unescape_revid(rev_rev)
if len(split) == 1 and rev_rev in (CURRENT_REVISION, NULL_REVISION):
return None, rev_rev
try:
branch = self.get_branch(rev_branch)
except errors.NotBranchError:
raise versioncontrol.NoSuchChangeset(rev)
if rev_rev == '' or rev_rev == CURRENT_REVISION:
revid = branch.last_revision()
elif rev_rev.isdigit():
try:
revid = branch.get_rev_id(int(rev_rev))
except errors.NoSuchRevision:
raise versioncontrol.NoSuchChangeset(rev)
else:
dotted = rev_rev.split('.')
for segment in dotted:
if not segment.isdigit():
revid = rev_rev
break
else:
cache = self.get_branch_cache(branch)
revid = cache.revid_from_dotted(rev_rev)
if revid is None:
self.log.warn('%r is no dotted revno, will interpret as revid.', rev_rev)
revid = rev_rev
return branch, revid
# Trac api methods.
def close(self):
"""Release our branches. Trac does not *have* to call this!"""
self._locked_branches.unlock()
def get_branch(self, location):
if location in self._branch_cache:
return self._branch_cache[location].branch
trans = self.root_transport
for piece in location.split('/'):
if piece:
trans = trans.clone(piece)
target_bzrdir = bzrdir.BzrDir.open_from_transport(trans)
branch = target_bzrdir.open_branch()
self._locked_branches.append(branch)
self._branch_cache[location] = BranchCache(self, branch)
return branch
def get_containing_branch(self, location):
branch, relpath = containing_branch(self.root_transport, location)
real_location = location[:-len(relpath)].rstrip('/')
if real_location not in self._branch_cache:
self._branch_cache[real_location] = BranchCache(self, branch)
self._locked_branches.append(branch)
# return the cached version, possibly throwing away the one we just
# retrieved.
return self._branch_cache[real_location].branch, relpath
def get_branches(self):
"""Get an ordered list of all branches in the repository.
Returns a list of (relpath, branch) pairs. Branches will be
locked for reading. Branches inside other branches will not be
listed."""
primary = self.primary_branches + ['*']
branches = []
for loc, branch in self._get_branches():
for index, pattern in enumerate(primary):
if fnmatch.fnmatch(loc, pattern):
branches.append((index, loc, branch))
break
branches.sort()
for index, loc, branch in branches:
self._locked_branches.append(branch)
return [(loc, branch) for index, loc, branch in branches]
def _get_branches(self, trans=None, loc=()):
"""Find branches under a listable transport.
Does not descend into control directories or branch directories.
(branches inside other branches will not be listed)
"""
if trans is None:
trans = self.root_transport
try:
children = trans.list_dir('.')
if '.bzr' in children:
children.remove('.bzr')
try:
target_bzrdir = bzrdir.BzrDir.open_from_transport(trans)
yield '/'.join(loc), target_bzrdir.open_branch()
except errors.NotBranchError:
pass
else:
return
for child in children:
for child_loc, child_branch in self._get_branches(
trans.clone(child), loc + (child,)):
yield child_loc, child_branch
except errors.NoSuchFile, e:
return
def get_changeset(self, rev):
"""Retrieve a Changeset."""
branch, revid = self._parse_rev(rev)
try:
return BzrChangeset(self, branch, revid, self.log)
except errors.NoSuchRevision, e:
raise versioncontrol.NoSuchChangeset(rev)
def get_changesets(self, start, stop):
"""Retrieve all changesets in a cetain time span."""
seen = set()
rhss = [] # right hand side revids, one iterable for each branch
inrange = []
branches = self.get_branches()
def walk(cache, revid):
rhs = [] # all right hand side revids we encounter
while revid not in seen:
seen.add(revid)
revision = cache.get_revision(revid)
time = trac_timestamp(revision.timestamp)
if time < start:
break
if time < stop:
chgset = BzrChangeset(self, branch, revid, self.log)
inrange.append((time, revid, chgset))
parents = revision.parent_ids
if not parents:
break
if len(parents) > 1:
rhs.extend(parents[1:])
revid = parents[0]
return rhs
for relpath, branch in branches:
cache = self.get_branch_cache(branch)
revid = branch.last_revision()
rhs = walk(cache, revid)
rhss.append(rhs)
for (relpath, branch), rhs in zip(branches, rhss):
cache = self.get_branch_cache(branch)
while rhs:
revid = rhs.pop()
new_rhs = walk(cache, revid)
if new_rhs:
rhs.extend(new_rhs)
inrange.sort()
return [chgset for time, revid, chgset in inrange]
def has_node(self, path, rev=None):
"""Return a boolean indicating if the node is present in a rev."""
try:
self.get_node(path, rev)
except versioncontrol.NoSuchNode:
return False
else:
return True
def get_node(self, path, rev=None):
"""Return a Node object or raise NoSuchNode or NoSuchChangeset."""
path = self.normalize_path(path)
if rev is None:
rev = self._escape_revid(CURRENT_REVISION)
revbranch, revid = self._parse_rev(rev)
try:
branch, relpath = self.get_containing_branch(path)
except errors.NotBranchError:
if not self.root_transport.has(path):
raise versioncontrol.NoSuchNode(path, rev)
return UnversionedDirNode(self, revbranch, revid, path)
if revbranch is None:
revbranch = branch
try:
if revid == CURRENT_REVISION:
tree = revbranch.basis_tree()
else:
tree = revbranch.repository.revision_tree(revid)
except (errors.NoSuchRevision, errors.RevisionNotPresent):
raise versioncontrol.NoSuchChangeset(rev)
file_id = tree.inventory.path2id(relpath)
if file_id is None:
raise versioncontrol.NoSuchNode(path, rev)
entry = tree.inventory[file_id]
klass = NODE_MAP[entry.kind]
return klass(self, branch, tree, entry, path)
def get_oldest_rev(self):
if self._history is None:
self._history = self._repo_history()
if self._history:
return self.string_rev(self._history[0][1], self._history[0][0])
else:
return self.string_rev(None, NULL_REVISION)
def get_youngest_rev(self):
# XXX: Find a better solution
# The youngest revision may not be present in all branches, so if we
# use current, then it maps out correctly.
return self.string_rev(None, CURRENT_REVISION)
def _repo_history(self):
revisions = {}
repos = {}
branches = {}
seen = set()
for loc, branch in self._get_branches():
repo_base = branch.repository.bzrdir.transport.base
repos[repo_base] = branch.repository
for revision_id in reversed(branch.revision_history()):
if revision_id in seen:
break
revisions.setdefault(repo_base, []).append(revision_id)
branches[revision_id] = branch
seen.add(revision_id)
revision_set = set()
for repo_base, revision_ids in revisions.iteritems():
revision_set.update(repos[repo_base].get_revisions(revision_ids))
revisions = sorted(revision_set, key=lambda x: x.timestamp)
return [(r.revision_id, branches[r.revision_id]) for r in revisions]
def previous_rev(self, rev, path=''):
if path:
prev = self.get_node(path, rev).get_previous()
if prev is None:
return None
return prev[1]
branch, revid = self._parse_rev(rev)
if revid in (NULL_REVISION, CURRENT_REVISION) or branch is None:
return None
ancestry = iter(branch.repository.iter_reverse_revision_history(revid))
ancestry.next()
try:
return self.string_rev(branch, ancestry.next())
except StopIteration:
return self.string_rev(branch, NULL_REVISION)
def next_rev(self, rev, path=''):
# TODO path is ignored.
branch, revid = self._parse_rev(rev)
if revid == CURRENT_REVISION:
return None
if revid == NULL_REVISION:
if branch is None:
return CURRENT_REVISION
revno = 0
if branch is None:
return None
try:
revno = branch.revision_id_to_revno(revid)
except errors.NoSuchRevision:
return None # non-mainline branches don't have a future (yet).
try:
next_revid = branch.get_rev_id(revno + 1)
except errors.NoSuchRevision:
return None # this was the last revision on that branch
return self.string_rev(branch, next_revid)
def rev_older_than(self, rev1, rev2):
if rev1 == rev2:
return False
branch1, rrev1 = self._parse_rev(rev1)
branch2, rrev2 = self._parse_rev(rev2)
if rrev1 == rrev2:
return False
both = frozenset([rrev1, rrev2])
if NULL_REVISION in both:
return NULL_REVISION == rrev1
if CURRENT_REVISION in both:
return CURRENT_REVISION == rrev2
if branch1.repository.has_revisions(both) == both:
heads = branch1.repository.get_graph().heads(both)
elif branch2.repository.has_revisions(both) == both:
heads = branch2.repository.get_graph().heads(both)
else:
heads = both
if len(s) == 1:
return rrev2 in heads
# Bah, unrelated revisions. Fall back to comparing timestamps.
return (branch1.repository.get_revision(rrev1).timestamp <
branch2.repository.get_revision(rrev2).timestamp)
# XXX what is get_youngest_rev_in_cache doing in here
def get_path_history(self, path, rev=None, limit=None):
"""Shortcut for Node's get_history."""
# XXX I think the intention for this one is probably different:
# it should track the state of this filesystem location across time.
# That is, it should keep tracking the same path as stuff is moved
# on to / away from that path.
# No need to normalize/unquote, get_node is a trac api method
# so it takes quoted values.
return self.get_node(path, rev).get_history(limit)
def normalize_path(self, path):
"""Remove leading and trailing '/'"""
# Also turns None into '', just in case.
return path and path.strip('/') or ''
def normalize_rev(self, rev):
"""Turn a user-specified rev into a "normalized" rev.
This turns None into a rev, and may convert a revid-based rev into
a revno-based one.
"""
if rev is None:
branch = None
revid = CURRENT_REVISION
else:
branch, revid = self._parse_rev(rev)
if branch is not None:
repository = branch.repository
else:
repository = None
return self.string_rev(branch, revid)
def short_rev(self, rev):
"""Attempt to shorten a rev.
This returns the last 6 characters of the dotted revno.
The result of this method is used above the line number
columns in the diff/changeset viewer. There is *very* little
room there. Tricks like using the branch nick simply do not fit.
Those 6 chars seem to fit, at least if two of them are dots,
and should be enough to clearly identify almost any two
revisions named in a changeset.
"""
branch, revid = self._parse_rev(rev)
if branch is None:
return revid
dotted = self.dotted_revno(branch, revid)
if dotted is None:
return '????'
return dotted[-6:]
def get_changes(self, old_path, old_rev, new_path, new_rev,
ignore_ancestry=1):
"""yields (old_node, new_node, kind, change) tuples."""
# ignore_ancestry is ignored, don't know what it's for.
if old_path != new_path:
raise core.TracError(
'Currently the bzr plugin does not support this between '
'different directories. Sorry.')
old_branch, old_revid = self._parse_rev(old_rev)
new_branch, new_revid = self._parse_rev(new_rev)
old_tree = old_branch.repository.revision_tree(old_revid)
new_tree = new_branch.repository.revision_tree(new_revid)
prefix = self.branch_path(new_branch)
subdir = new_path[len(prefix)+1:]
delta = new_tree.changes_from(old_tree, specific_files=[subdir])
for path, file_id, kind in delta.added:
path = osutils.pathjoin(prefix, path)
entry = new_tree.inventory[file_id]
node = NODE_MAP[kind](self, new_branch, new_tree, entry, path)
yield None, node, node.kind, versioncontrol.Changeset.ADD
for path, file_id, kind in delta.removed:
path = osutils.pathjoin(prefix, path)
entry = old_tree.inventory[file_id]
node = NODE_MAP[kind](self, old_branch, old_tree, entry, path)
yield node, None, node.kind, versioncontrol.Changeset.DELETE
for oldpath, newpath, file_id, kind, textmod, metamod in delta.renamed:
oldpath = osutils.pathjoin(prefix, oldpath)
newpath = osutils.pathjoin(prefix, newpath)
oldnode = NODE_MAP[kind](self, old_branch, old_tree,
old_tree.inventory[file_id], oldpath)
newnode = NODE_MAP[kind](self, new_branch, new_tree,
new_tree.inventory[file_id], newpath)
if oldnode.kind != newnode.kind:
raise core.TracError(
'%s changed kinds, I do not know how to handle that' % (
newpath,))
yield oldnode, newnode, oldnode.kind, versioncontrol.Changeset.MOVE
for path, file_id, kind, textmod, metamod in delta.modified:
# Bzr won't report a changed path as a rename but trac wants that.
path = osutils.pathjoin(prefix, path)
oldpath = osutils.pathjoin(prefix, old_tree.id2path(file_id))
oldnode = NODE_MAP[kind](self, old_branch, old_tree,
old_tree.inventory[file_id], oldpath)
newnode = NODE_MAP[kind](self, new_branch, new_tree,
new_tree.inventory[file_id], path)
if oldnode.kind != newnode.kind:
raise core.TracError(
'%s changed kinds, I do not know how to handle that' % (
newpath,))
if oldpath != path:
action = versioncontrol.Changeset.MOVE
else:
action = versioncontrol.Changeset.EDIT
yield oldnode, newnode, oldnode.kind, action
def dotted_revno(self, branch, revid):
return self.get_branch_cache(branch).dotted_revno(revid)
def get_branch_cache(self, branch):
branch_key = branch.bzrdir.root_transport.base
if branch_key not in self._branch_cache:
self._branch_cache[branch_key] = BranchCache(self, branch)
return self._branch_cache[branch_key]
def sync(self, rev_callback=None):
"""Dummy to satisfy interface requirements"""
# XXX should we be dumping in-mem caches? Seems unlikely.
pass
class BzrNode(versioncontrol.Node):
pass
class UnversionedDirNode(BzrNode):
def __init__(self, bzr_repo, branch, revid, path):
rev_string = BzrRepository._escape_revid(CURRENT_REVISION)
BzrNode.__init__(self, path, rev_string, versioncontrol.Node.DIRECTORY)
self.transport = bzr_repo.root_transport.clone(path)
self.bzr_repo = bzr_repo
self.branch = branch
self.revid = revid
self.path = path
def __repr__(self):
return 'UnversionedDirNode(path=%r)' % self.path
def get_properties(self):
return {}
def get_entries(self):
result = []
for name in self.transport.list_dir(''):
if name == '.bzr':
continue
stat_mode = self.transport.stat(name).st_mode
kind = osutils.file_kind_from_stat_mode(stat_mode)
if not kind == 'directory':
continue
child_path = osutils.pathjoin(self.path, name)
try:
branch = self.bzr_repo.get_branch(child_path)
except errors.NotBranchError:
result.append(UnversionedDirNode(self.bzr_repo, self.branch,
self.revid, child_path))
else:
tree = branch.basis_tree()
if tree.inventory.root:
node = BzrDirNode(self.bzr_repo, branch, tree,
tree.inventory.root, child_path)
else:
node = UnversionedDirNode(self.bzr_repo, self.branch,
self.revid, child_path)
result.append(node)
return result
def get_content_length(self):
return 0
def get_content(self):
return StringIO.StringIO('')
def get_content_type(self):
return 'application/octet-stream'
def get_history(self, limit=None):
if self.branch is not None:
bpath = self.bzr_repo.branch_path(self.branch)
if self.path == '' or bpath.startswith(self.path + '/'):
repo = self.branch.repository
ancestry = repo.iter_reverse_revision_history(self.revid)
ancestry = iter(ancestry)
for rev_id in ancestry:
yield (self.path,
self.bzr_repo.string_rev(self.branch, rev_id),
versioncontrol.Changeset.EDIT)
yield (self.path,
self.bzr_repo.string_rev(self.branch, NULL_REVISION),
versioncontrol.Changeset.ADD)
return
yield (self.path, BzrRepository._escape_revid(CURRENT_REVISION), 'add')
return
class BzrVersionedNode(BzrNode):
_diff_map = {
'modified': versioncontrol.Changeset.EDIT,
'unchanged': versioncontrol.Changeset.EDIT,
'added': versioncontrol.Changeset.ADD,
inventory.InventoryEntry.RENAMED: versioncontrol.Changeset.MOVE,
inventory.InventoryEntry.MODIFIED_AND_RENAMED:
versioncontrol.Changeset.MOVE
}
def __init__(self, bzr_repo, branch, revisiontree, entry, path):
"""Initialize. path has to be a normalized path."""
rev_string = bzr_repo.string_rev(branch, entry.revision)
BzrNode.__init__(self, path, rev_string, self.kind)
self.bzr_repo = bzr_repo
self.log = bzr_repo.log
self.repo = branch.repository
self.branch = branch
self.tree = revisiontree
self.entry = entry
# XXX I am not sure if this makes any sense but it does make
# the links in the changeset viewer work.
self.created_rev = self.rev
self.created_path = self.path
self.root_path = path[:-len(self.tree.id2path(self.entry.file_id))]
def get_properties(self):
# Must at least return an empty dict here (base class version raises).
result = {}
if self.entry.executable:
result['executable'] = 'True'
return result
def get_history(self, limit=None):
"""Backward history.
yields (path, rev, chg) tuples.
path is the path to this entry, rev is the revid string.
chg is a Changeset.ACTION thing.
First thing should be for the current revision.
This is special because it checks for changes recursively,
not just to this directory. bzr only treats the dir as changed
if it is renamed, not if its contents changed. Trac needs
this recursive behaviour.
limit is an int cap on how many entries to return.
"""
current_entry = self.entry
file_id = current_entry.file_id
count = 0
# We need the rev we were created with, not the rev the entry
# specifies (our contents may have changed between that rev
# and our own current rev).
current_revid = self.get_content_revision()
if current_revid == CURRENT_REVISION:
current_revid = self.branch.last_revision()
# Aways use a linear view of our ancestry.
repo = self.branch.repository
ancestry = repo.iter_reverse_revision_history(current_revid)
ancestry = iter(ancestry)
# ancestry now iterates from current_revid down to revno 1
# Optimize the special case that this is the root of the
# branch. In this case, all revisions from the ancestry apply
# to us, and we can simply return them without further checks.
if self.entry.parent_id is None:
for rev_id in ancestry:
yield (self.path,
self.bzr_repo.string_rev(self.branch, rev_id),
versioncontrol.Changeset.EDIT)
yield (self.path,
self.bzr_repo.string_rev(self.branch, NULL_REVISION),
versioncontrol.Changeset.ADD)
return
# Load a bunch of trees in one go. We do not know how many we
# need: we may end up skipping some trees because they do not
# change us.
chunksize = limit or 100
chunk = []
ancestry.next() # drop current_revno, we already know about that
current_tree = self.tree
current_path = current_tree.id2path(file_id)
path_prefix = self.path[:-len(current_path)]
while True:
chunk[:] = []
try:
for i in range(chunksize):
chunk.append(ancestry.next())
except StopIteration:
if not chunk:
yield (path_prefix+current_path,
self.bzr_repo.string_rev(self.branch,
current_revid),
versioncontrol.Changeset.ADD)
return
cache = self.bzr_repo.get_branch_cache(self.branch)
for previous_revid, previous_tree in izip(
chunk, cache.revision_trees(chunk)):
if file_id in previous_tree.inventory:
previous_entry = previous_tree.inventory[file_id]
else:
previous_entry = None
delta = current_tree.changes_from(
previous_tree, specific_files=[current_path])
if not delta.has_changed():
current_entry = previous_entry
current_path = previous_tree.inventory.id2path(file_id)
current_revid = previous_revid
current_tree = previous_tree
continue
diff = current_entry.describe_change(previous_entry,
current_entry)
if diff == 'added':
yield (path_prefix+current_path,
self.bzr_repo.string_rev(self.branch,
current_revid),
versioncontrol.Changeset.ADD)
# There is no history before this point, we're done.
return
elif diff == 'modified' or diff == 'unchanged':
# We want the entry anyway.
yield (path_prefix+current_path,
self.bzr_repo.string_rev(self.branch,
current_revid),
versioncontrol.Changeset.EDIT)
elif diff in (current_entry.RENAMED,
current_entry.MODIFIED_AND_RENAMED):
yield (path_prefix+current_path,
self.bzr_repo.string_rev(self.branch,
current_revid),
versioncontrol.Changeset.MOVE)
else:
raise Exception('unknown describe_change %r' % (diff,))
count += 1
if limit is not None and count >= limit:
return
current_entry = previous_entry
current_path = previous_tree.inventory.id2path(file_id)
current_revid = previous_revid
current_tree = previous_tree
def get_content_revision(self):
"""For non-directory nodes, the content was last changed here."""
return self.entry.revision
def get_last_modified(self):
return self.tree.get_file_mtime(self.entry.file_id)
class BzrDirNode(BzrVersionedNode):
isdir = True
isfile = False
kind = versioncontrol.Node.DIRECTORY
def __init__(self, bzr_repo, branch, revisiontree, entry, path,
revcache=None):
BzrVersionedNode.__init__(self, bzr_repo, branch, revisiontree, entry,
path)
if revcache is None:
revcache = _FileToRevisionCache(bzr_repo, branch, revisiontree, entry)
self.revcache = revcache
self.rev = self.bzr_repo.string_rev(self.branch,
self.get_content_revision())
def get_content_revision(self):
"""Determine the most recent change to the directory or its children."""
if self.entry.parent_id is None:
return self.tree.get_revision_id()
return self.revcache[self.entry]
def __repr__(self):
return 'BzrDirNode(path=%r, relpath=%r)' % (self.path, self.entry.name)
@classmethod
def _get_cache(cls, cache, ancestry, entry, ancestry_idx=None):
"""Populate a file_id <-> revision_id mapping.
This mapping is different from InventoryEntry.revision, but only for
directories. In this scheme, directories are considered modified
if their contents are modified.
The revision ids are not guaranteed to be in the mainline revision
history.
cache: The cache to populate
ancestry: A topologically-sorted list of revisions, with more recent
revisions having lower indexes.
entry: The InventoryEntry to start at
ancestry_idx: A mapping of revision_id <-> ancestry index.
"""
if ancestry_idx is None:
ancestry_idx = dict((r, n) for n, r in enumerate(ancestry))
# best ~= most recent revision to modify a child of this directory
best = ancestry_idx[entry.revision]
for child in entry.children.itervalues():
if child.kind == 'directory':
index = cls._get_cache(cache, ancestry, child, ancestry_idx)
cache[child.file_id] = ancestry[index]
else:
index = ancestry_idx[child.revision]
best = min(best, index)
return best
def get_content(self):
"""Return a file-like (read(length)) for a file, None for a dir."""
return None
def get_entries(self):
"""Yield child Nodes if a dir, return None if a file."""
for name, entry in self.entry.children.iteritems():
childpath = '/'.join((self.path, name))
klass = NODE_MAP[entry.kind]
if klass is BzrDirNode:
yield klass(self.bzr_repo, self.branch, self.tree, entry,
childpath, self.revcache)
else:
yield klass(self.bzr_repo, self.branch, self.tree, entry,
childpath)
def get_content_length(self):
return None
def get_content_type(self):
return None
class BzrFileNode(BzrVersionedNode):
isfile = True
isdir = False
kind = versioncontrol.Node.FILE
def __repr__(self):
return 'BzrFileNode(path=%r)' % self.path
def get_content(self):
"""Return a file-like (read(length)) for a file, None for a dir."""
return self.tree.get_file(self.entry.file_id)
def get_entries(self):
return None
def get_content_length(self):
return self.entry.text_size
def get_content_type(self):
return mimeview.get_mimetype(self.name)
def get_annotations(self):
annotation = self.tree.annotate_iter(self.entry.file_id)
return [self.bzr_repo.string_rev(self.branch, revid)
for revid, line in annotation]
class BzrSymlinkNode(BzrVersionedNode):
"""Kinda like a file only not really. Empty, properties only."""
isfile = True
isdir = False
kind = versioncontrol.Node.FILE
def __repr__(self):
return 'BzrSymlinkNode(path=%r)' % self.path
def get_content(self):
return StringIO.StringIO('')
def get_entries(self):
return None
def get_content_length(self):
return 0
def get_content_type(self):
return 'text/plain'
def get_properties(self):
return {'destination': self.entry.symlink_target}
NODE_MAP = {
'directory': BzrDirNode,
'file': BzrFileNode,
'symlink': BzrSymlinkNode,
}
class BzrChangeset(versioncontrol.Changeset):
def __init__(self, bzr_repo, branch, revid, log):
"""Initialize from a bzr repo, an unquoted revid and a logger."""
assert isinstance(revid, str), "revid is %r" % type(revid)
self.log = log
self.bzr_repo = bzr_repo
self.branch = branch
if revid == CURRENT_REVISION and branch is not None:
revid = branch.revision_history()
if revid in (CURRENT_REVISION, NULL_REVISION):
self.revision = revision.Revision(revid, committer='',
message='', timezone='')
revidstr = bzr_repo.string_rev(branch, revid)
versioncontrol.Changeset.__init__(self, revidstr,
'', '', trac_timestamp(time.time()))
return
if branch is None:
assert isinstance(revid, str)
raise errors.NoSuchRevision(None, revid)
self.revision = bzr_repo.get_branch_cache(branch).get_revision(revid)
authors = ";".join(self.revision.get_apparent_authors())
versioncontrol.Changeset.__init__(self,
bzr_repo.string_rev(
branch, revid),
self.revision.message,
authors,
trac_timestamp(self.revision.timestamp))
def __repr__(self):
return 'BzrChangeset(%r)' % (self.revision.revision_id)
def get_properties(self):
"""Return an iterator of (name, value, is wikitext, html class)."""
if trac_version >= (0,11):
result = {}
def add_text(name, value):
result[name] = value
def add_parents(parents):
result['parents'] = '\n'.join(parents)
else:
result = []
def add_text(name, value):
result.append((name, value, False, ''))
def add_parents(parents):
for name, link in [('parent trees', ' * source:@%s'),
('changesets', ' * [changeset:%s]')]:
wikitext = '\n'.join(link % parent for parent in parents)
result.append((name, wikitext, True, ''))
add_text('revision id', self.revision.revision_id)
for name, value in self.revision.properties.iteritems():
add_text(name, value)
if len(self.revision.parent_ids) > 1:
add_parents([self.bzr_repo.string_rev(self.branch, parent)
for parent in self.revision.parent_ids])
return result
def get_changes(self):
"""Yield changes.
Return tuples are (path, kind, change, base_path, base_rev).
change is self.ADD/COPY/DELETE/EDIT/MOVE.
kind is Node.FILE or Node.DIRECTORY.
base_path and base_rev are the location and revision of the file
before "ours".
"""
if self.revision.revision_id in (CURRENT_REVISION, NULL_REVISION):
return
branchpath = osutils.relpath(
osutils.normalizepath(self.bzr_repo.root_transport.base),
osutils.normalizepath(self.branch.bzrdir.root_transport.base))
for path, kind, change, base_path, base_rev in self._get_changes():
if path is not None:
path = osutils.pathjoin(branchpath, path)
if base_path is not None:
base_path = osutils.pathjoin(branchpath, base_path)
yield (path, kind, change, base_path, base_rev)
def _get_changes(self):
if self.revision.revision_id in (CURRENT_REVISION, NULL_REVISION):
return
this = self.branch.repository.revision_tree(self.revision.revision_id)
parents = self.revision.parent_ids
if parents:
parent_revid = parents[0]
else:
parent_revid = None
other = self.branch.repository.revision_tree(parent_revid)
delta = this.changes_from(other)
kindmap = {'directory': versioncontrol.Node.DIRECTORY,
'file': versioncontrol.Node.FILE,
'symlink': versioncontrol.Node.FILE, # gotta do *something*
}
# We have to make sure our base_path/base_rev combination
# exists (get_node succeeds). If we use
# other.inventory[file_id].revision as base_rev we cannot use
# what bzr hands us or what's in other.inventory as base_path
# since the parent node may have been renamed between what we
# return as base_rev and the revision the "other" inventory
# corresponds to (parent_revid).
# So we can either return other.id2path(file_id) and parent_revid
# or use entry.revision and pull up the inventory for that revision
# to get the path. Currently the code does the former,
# remember to update the paths if it turns out returning the other
# revision works better.
for path, file_id, kind in delta.added:
# afaict base_{path,rev} *should* be ignored for this one.
yield path, kindmap[kind], self.ADD, None, None
for path, file_id, kind in delta.removed:
yield (path, kindmap[kind], self.DELETE, path,
self.bzr_repo.string_rev(self.branch, parent_revid))
for oldpath, newpath, file_id, kind, textmod, metamod in delta.renamed:
yield (newpath, kindmap[kind], self.MOVE, other.id2path(file_id),
self.bzr_repo.string_rev(self.branch, parent_revid))
for path, file_id, kind, textmod, metamod in delta.modified:
# "path" may not be accurate for base_path: the directory
# it is in may have been renamed. So pull the right path from
# the old inventory.
yield (path, kindmap[kind], self.EDIT, other.id2path(file_id),
self.bzr_repo.string_rev(self.branch, parent_revid))
def containing_branch(transport, path):
child_transport = transport.clone(path)
my_bzrdir, relpath = \
bzrdir.BzrDir.open_containing_from_transport(child_transport)
return my_bzrdir.open_branch(), relpath
class BranchCache(object):
def __init__(self, bzr_repo, branch):
self.bzr_repo = bzr_repo
self.branch = branch
self._revno_revid = None
def dotted_revno(self, revid):
try:
revno = self.branch.revision_id_to_dotted_revno(revid)
dotted = '.'.join([str(s) for s in revno])
return dotted
except errors.NoSuchRevision:
return None
def revid_from_dotted(self, dotted_revno):
try:
revno = tuple([int(s) for s in dotted_revno.split('.')])
revid = self.branch.dotted_revno_to_revision_id(revno)
return revid
except errors.NoSuchRevision:
return None
def revision_tree(self, revision_id):
if revision_id not in self.bzr_repo._tree_cache:
self.bzr_repo._tree_cache[revision_id] = \
self.branch.repository.revision_tree(revision_id)
if revision_id == NULL_REVISION:
self.bzr_repo._tree_cache[None] = \
self.bzr_repo._tree_cache[NULL_REVISION]
return self.bzr_repo._tree_cache[revision_id]
def revision_trees(self, revision_ids):
if None in revision_ids or NULL_REVISION in revision_ids:
self.revision_tree(NULL_REVISION)
missing = [r for r in revision_ids if r not in
self.bzr_repo._tree_cache]
if len(missing) > 0:
trees = self.branch.repository.revision_trees(missing)
for tree in trees:
self.bzr_repo._tree_cache[tree.get_revision_id()] = tree
return [self.bzr_repo._tree_cache[r] for r in revision_ids]
def cache_revisions(self, revision_ids):
if self.bzr_repo.log:
self.bzr_repo.log.debug('caching %d revisions' % len(revision_ids))
missing = [r for r in revision_ids if r not in
self.bzr_repo._revision_cache]
revisions = self.branch.repository.get_revisions(missing)
self.bzr_repo._revision_cache.update(dict((r.revision_id, r) for r in
revisions))
if self.bzr_repo.log:
self.bzr_repo.log.debug('done caching %d revisions' %
len(revision_ids))
def get_revision(self, revision_id):
try:
return self.bzr_repo._revision_cache[revision_id]
except KeyError:
self.cache_revisions([revision_id])
return self.bzr_repo._revision_cache[revision_id]
class _FileToRevisionCache(object):
"""Map from file_id to revision_id.
This is used to determine the last modification to a directory.
"""
def __init__(self, bzr_repo, branch, revisiontree, root):
self.bzr_repo = bzr_repo
self.branch = branch
self.revisiontree = revisiontree
self.root = root
self.revcache = None
def __getitem__(self, entry):
"""Lazily fill cache only when needed."""
if self.revcache is None:
revid = self.revisiontree.get_revision_id()
ancestry = self.branch.repository.get_ancestry(revid)
ancestry.reverse()
ancestry_idx = dict((r, n) for n, r in enumerate(ancestry))
self.revcache = {}
best = self._fill_cache(ancestry, ancestry_idx, self.root)
return self.revcache[entry.file_id]
def _fill_cache(self, ancestry, ancestry_idx, entry):
"""Populate a file_id <-> revision_id mapping.
This mapping is different from InventoryEntry.revision, but only for
directories. In this scheme, directories are considered modified
if their contents are modified.
The revision ids are not guaranteed to be in the mainline revision
history.
ancestry: A topologically-sorted list of revisions, with more recent
revisions having lower indexes.
ancestry_idx: A mapping of revision_id <-> ancestry index.
entry: The InventoryEntry to start at
"""
# best ~= most recent revision to modify a child of this directory
best = ancestry_idx[entry.revision]
for child in entry.children.itervalues():
if child.kind == 'directory':
index = self._fill_cache(ancestry, ancestry_idx, child)
else:
index = ancestry_idx[child.revision]
best = min(best, index)
self.revcache[entry.file_id] = ancestry[best]
return best
|