1189
987
if not self.get_parent_map([key]):
1190
988
raise RevisionNotPresent(key, self)
1191
989
return cached_version
1192
generator = _VFContentMapGenerator(self, [key])
1193
return generator._get_content(key)
1195
def get_known_graph_ancestry(self, keys):
1196
"""Get a KnownGraph instance with the ancestry of keys."""
1197
parent_map, missing_keys = self._index.find_ancestry(keys)
1198
for fallback in self._fallback_vfs:
990
text_map, contents_map = self._get_content_maps([key])
991
return contents_map[key]
993
def _get_content_maps(self, keys, nonlocal_keys=None):
994
"""Produce maps of text and KnitContents
996
:param keys: The keys to produce content maps for.
997
:param nonlocal_keys: An iterable of keys(possibly intersecting keys)
998
which are known to not be in this knit, but rather in one of the
1000
:return: (text_map, content_map) where text_map contains the texts for
1001
the requested versions and content_map contains the KnitContents.
1003
# FUTURE: This function could be improved for the 'extract many' case
1004
# by tracking each component and only doing the copy when the number of
1005
# children than need to apply delta's to it is > 1 or it is part of the
1008
multiple_versions = len(keys) != 1
1009
record_map = self._get_record_map(keys, allow_missing=True)
1014
if nonlocal_keys is None:
1015
nonlocal_keys = set()
1017
nonlocal_keys = frozenset(nonlocal_keys)
1018
missing_keys = set(nonlocal_keys)
1019
for source in self._fallback_vfs:
1199
1020
if not missing_keys:
1201
(f_parent_map, f_missing_keys) = fallback._index.find_ancestry(
1203
parent_map.update(f_parent_map)
1204
missing_keys = f_missing_keys
1205
kg = _mod_graph.KnownGraph(parent_map)
1022
for record in source.get_record_stream(missing_keys,
1024
if record.storage_kind == 'absent':
1026
missing_keys.remove(record.key)
1027
lines = osutils.chunks_to_lines(record.get_bytes_as('chunked'))
1028
text_map[record.key] = lines
1029
content_map[record.key] = PlainKnitContent(lines, record.key)
1030
if record.key in keys:
1031
final_content[record.key] = content_map[record.key]
1033
if key in nonlocal_keys:
1038
while cursor is not None:
1040
record, record_details, digest, next = record_map[cursor]
1042
raise RevisionNotPresent(cursor, self)
1043
components.append((cursor, record, record_details, digest))
1045
if cursor in content_map:
1046
# no need to plan further back
1047
components.append((cursor, None, None, None))
1051
for (component_id, record, record_details,
1052
digest) in reversed(components):
1053
if component_id in content_map:
1054
content = content_map[component_id]
1056
content, delta = self._factory.parse_record(key[-1],
1057
record, record_details, content,
1058
copy_base_content=multiple_versions)
1059
if multiple_versions:
1060
content_map[component_id] = content
1062
final_content[key] = content
1064
# digest here is the digest from the last applied component.
1065
text = content.text()
1066
actual_sha = sha_strings(text)
1067
if actual_sha != digest:
1068
raise SHA1KnitCorrupt(self, actual_sha, digest, key, text)
1069
text_map[key] = text
1070
return text_map, final_content
1208
1072
def get_parent_map(self, keys):
1209
1073
"""Get a map of the graph parents of keys.
2025
class _ContentMapGenerator(object):
2026
"""Generate texts or expose raw deltas for a set of texts."""
2028
def __init__(self, ordering='unordered'):
2029
self._ordering = ordering
2031
def _get_content(self, key):
2032
"""Get the content object for key."""
2033
# Note that _get_content is only called when the _ContentMapGenerator
2034
# has been constructed with just one key requested for reconstruction.
2035
if key in self.nonlocal_keys:
2036
record = self.get_record_stream().next()
2037
# Create a content object on the fly
2038
lines = osutils.chunks_to_lines(record.get_bytes_as('chunked'))
2039
return PlainKnitContent(lines, record.key)
2041
# local keys we can ask for directly
2042
return self._get_one_work(key)
2044
def get_record_stream(self):
2045
"""Get a record stream for the keys requested during __init__."""
2046
for record in self._work():
2050
"""Produce maps of text and KnitContents as dicts.
2052
:return: (text_map, content_map) where text_map contains the texts for
2053
the requested versions and content_map contains the KnitContents.
2055
# NB: By definition we never need to read remote sources unless texts
2056
# are requested from them: we don't delta across stores - and we
2057
# explicitly do not want to to prevent data loss situations.
2058
if self.global_map is None:
2059
self.global_map = self.vf.get_parent_map(self.keys)
2060
nonlocal_keys = self.nonlocal_keys
2062
missing_keys = set(nonlocal_keys)
2063
# Read from remote versioned file instances and provide to our caller.
2064
for source in self.vf._fallback_vfs:
2065
if not missing_keys:
2067
# Loop over fallback repositories asking them for texts - ignore
2068
# any missing from a particular fallback.
2069
for record in source.get_record_stream(missing_keys,
2070
self._ordering, True):
2071
if record.storage_kind == 'absent':
2072
# Not in thie particular stream, may be in one of the
2073
# other fallback vfs objects.
2075
missing_keys.remove(record.key)
2078
if self._raw_record_map is None:
2079
raise AssertionError('_raw_record_map should have been filled')
2081
for key in self.keys:
2082
if key in self.nonlocal_keys:
2084
yield LazyKnitContentFactory(key, self.global_map[key], self, first)
2087
def _get_one_work(self, requested_key):
2088
# Now, if we have calculated everything already, just return the
2090
if requested_key in self._contents_map:
2091
return self._contents_map[requested_key]
2092
# To simplify things, parse everything at once - code that wants one text
2093
# probably wants them all.
2094
# FUTURE: This function could be improved for the 'extract many' case
2095
# by tracking each component and only doing the copy when the number of
2096
# children than need to apply delta's to it is > 1 or it is part of the
2098
multiple_versions = len(self.keys) != 1
2099
if self._record_map is None:
2100
self._record_map = self.vf._raw_map_to_record_map(
2101
self._raw_record_map)
2102
record_map = self._record_map
2103
# raw_record_map is key:
2104
# Have read and parsed records at this point.
2105
for key in self.keys:
2106
if key in self.nonlocal_keys:
2111
while cursor is not None:
2113
record, record_details, digest, next = record_map[cursor]
2115
raise RevisionNotPresent(cursor, self)
2116
components.append((cursor, record, record_details, digest))
2118
if cursor in self._contents_map:
2119
# no need to plan further back
2120
components.append((cursor, None, None, None))
2124
for (component_id, record, record_details,
2125
digest) in reversed(components):
2126
if component_id in self._contents_map:
2127
content = self._contents_map[component_id]
2129
content, delta = self._factory.parse_record(key[-1],
2130
record, record_details, content,
2131
copy_base_content=multiple_versions)
2132
if multiple_versions:
2133
self._contents_map[component_id] = content
2135
# digest here is the digest from the last applied component.
2136
text = content.text()
2137
actual_sha = sha_strings(text)
2138
if actual_sha != digest:
2139
raise SHA1KnitCorrupt(self, actual_sha, digest, key, text)
2140
if multiple_versions:
2141
return self._contents_map[requested_key]
2145
def _wire_bytes(self):
2146
"""Get the bytes to put on the wire for 'key'.
2148
The first collection of bytes asked for returns the serialised
2149
raw_record_map and the additional details (key, parent) for key.
2150
Subsequent calls return just the additional details (key, parent).
2151
The wire storage_kind given for the first key is 'knit-delta-closure',
2152
For subsequent keys it is 'knit-delta-closure-ref'.
2154
:param key: A key from the content generator.
2155
:return: Bytes to put on the wire.
2158
# kind marker for dispatch on the far side,
2159
lines.append('knit-delta-closure')
2161
if self.vf._factory.annotated:
2162
lines.append('annotated')
2165
# then the list of keys
2166
lines.append('\t'.join(['\x00'.join(key) for key in self.keys
2167
if key not in self.nonlocal_keys]))
2168
# then the _raw_record_map in serialised form:
2170
# for each item in the map:
2172
# 1 line with parents if the key is to be yielded (None: for None, '' for ())
2173
# one line with method
2174
# one line with noeol
2175
# one line with next ('' for None)
2176
# one line with byte count of the record bytes
2178
for key, (record_bytes, (method, noeol), next) in \
2179
self._raw_record_map.iteritems():
2180
key_bytes = '\x00'.join(key)
2181
parents = self.global_map.get(key, None)
2183
parent_bytes = 'None:'
2185
parent_bytes = '\t'.join('\x00'.join(key) for key in parents)
2186
method_bytes = method
2192
next_bytes = '\x00'.join(next)
2195
map_byte_list.append('%s\n%s\n%s\n%s\n%s\n%d\n%s' % (
2196
key_bytes, parent_bytes, method_bytes, noeol_bytes, next_bytes,
2197
len(record_bytes), record_bytes))
2198
map_bytes = ''.join(map_byte_list)
2199
lines.append(map_bytes)
2200
bytes = '\n'.join(lines)
2204
class _VFContentMapGenerator(_ContentMapGenerator):
2205
"""Content map generator reading from a VersionedFiles object."""
2207
def __init__(self, versioned_files, keys, nonlocal_keys=None,
2208
global_map=None, raw_record_map=None, ordering='unordered'):
2209
"""Create a _ContentMapGenerator.
2211
:param versioned_files: The versioned files that the texts are being
2213
:param keys: The keys to produce content maps for.
2214
:param nonlocal_keys: An iterable of keys(possibly intersecting keys)
2215
which are known to not be in this knit, but rather in one of the
2217
:param global_map: The result of get_parent_map(keys) (or a supermap).
2218
This is required if get_record_stream() is to be used.
2219
:param raw_record_map: A unparsed raw record map to use for answering
2222
_ContentMapGenerator.__init__(self, ordering=ordering)
2223
# The vf to source data from
2224
self.vf = versioned_files
2226
self.keys = list(keys)
2227
# Keys known to be in fallback vfs objects
2228
if nonlocal_keys is None:
2229
self.nonlocal_keys = set()
2231
self.nonlocal_keys = frozenset(nonlocal_keys)
2232
# Parents data for keys to be returned in get_record_stream
2233
self.global_map = global_map
2234
# The chunked lists for self.keys in text form
2236
# A cache of KnitContent objects used in extracting texts.
2237
self._contents_map = {}
2238
# All the knit records needed to assemble the requested keys as full
2240
self._record_map = None
2241
if raw_record_map is None:
2242
self._raw_record_map = self.vf._get_record_map_unparsed(keys,
2245
self._raw_record_map = raw_record_map
2246
# the factory for parsing records
2247
self._factory = self.vf._factory
2250
class _NetworkContentMapGenerator(_ContentMapGenerator):
2251
"""Content map generator sourced from a network stream."""
2253
def __init__(self, bytes, line_end):
2254
"""Construct a _NetworkContentMapGenerator from a bytes block."""
2256
self.global_map = {}
2257
self._raw_record_map = {}
2258
self._contents_map = {}
2259
self._record_map = None
2260
self.nonlocal_keys = []
2261
# Get access to record parsing facilities
2262
self.vf = KnitVersionedFiles(None, None)
2265
line_end = bytes.find('\n', start)
2266
line = bytes[start:line_end]
2267
start = line_end + 1
2268
if line == 'annotated':
2269
self._factory = KnitAnnotateFactory()
2271
self._factory = KnitPlainFactory()
2272
# list of keys to emit in get_record_stream
2273
line_end = bytes.find('\n', start)
2274
line = bytes[start:line_end]
2275
start = line_end + 1
2277
tuple(segment.split('\x00')) for segment in line.split('\t')
2279
# now a loop until the end. XXX: It would be nice if this was just a
2280
# bunch of the same records as get_record_stream(..., False) gives, but
2281
# there is a decent sized gap stopping that at the moment.
2285
line_end = bytes.find('\n', start)
2286
key = tuple(bytes[start:line_end].split('\x00'))
2287
start = line_end + 1
2288
# 1 line with parents (None: for None, '' for ())
2289
line_end = bytes.find('\n', start)
2290
line = bytes[start:line_end]
2295
[tuple(segment.split('\x00')) for segment in line.split('\t')
2297
self.global_map[key] = parents
2298
start = line_end + 1
2299
# one line with method
2300
line_end = bytes.find('\n', start)
2301
line = bytes[start:line_end]
2303
start = line_end + 1
2304
# one line with noeol
2305
line_end = bytes.find('\n', start)
2306
line = bytes[start:line_end]
2308
start = line_end + 1
2309
# one line with next ('' for None)
2310
line_end = bytes.find('\n', start)
2311
line = bytes[start:line_end]
2315
next = tuple(bytes[start:line_end].split('\x00'))
2316
start = line_end + 1
2317
# one line with byte count of the record bytes
2318
line_end = bytes.find('\n', start)
2319
line = bytes[start:line_end]
2321
start = line_end + 1
2323
record_bytes = bytes[start:start+count]
2324
start = start + count
2326
self._raw_record_map[key] = (record_bytes, (method, noeol), next)
2328
def get_record_stream(self):
2329
"""Get a record stream for for keys requested by the bytestream."""
2331
for key in self.keys:
2332
yield LazyKnitContentFactory(key, self.global_map[key], self, first)
2335
def _wire_bytes(self):
2339
1770
class _KndxIndex(object):
2340
1771
"""Manages knit index files
3431
2659
annotator = _KnitAnnotator(knit)
3432
return iter(annotator.annotate_flat(revision_id))
3435
class _KnitAnnotator(annotate.Annotator):
2660
return iter(annotator.annotate(revision_id))
2663
class _KnitAnnotator(object):
3436
2664
"""Build up the annotations for a text."""
3438
def __init__(self, vf):
3439
annotate.Annotator.__init__(self, vf)
3441
# TODO: handle Nodes which cannot be extracted
3442
# self._ghosts = set()
3444
# Map from (key, parent_key) => matching_blocks, should be 'use once'
3445
self._matching_blocks = {}
3447
# KnitContent objects
3448
self._content_objects = {}
3449
# The number of children that depend on this fulltext content object
3450
self._num_compression_children = {}
3451
# Delta records that need their compression parent before they can be
3453
self._pending_deltas = {}
3454
# Fulltext records that are waiting for their parents fulltexts before
3455
# they can be yielded for annotation
3456
self._pending_annotation = {}
2666
def __init__(self, knit):
2669
# Content objects, differs from fulltexts because of how final newlines
2670
# are treated by knits. the content objects here will always have a
2672
self._fulltext_contents = {}
2674
# Annotated lines of specific revisions
2675
self._annotated_lines = {}
2677
# Track the raw data for nodes that we could not process yet.
2678
# This maps the revision_id of the base to a list of children that will
2679
# annotated from it.
2680
self._pending_children = {}
2682
# Nodes which cannot be extracted
2683
self._ghosts = set()
2685
# Track how many children this node has, so we know if we need to keep
2687
self._annotate_children = {}
2688
self._compression_children = {}
3458
2690
self._all_build_details = {}
2691
# The children => parent revision_id graph
2692
self._revision_id_graph = {}
2694
self._heads_provider = None
2696
self._nodes_to_keep_annotations = set()
2697
self._generations_until_keep = 100
2699
def set_generations_until_keep(self, value):
2700
"""Set the number of generations before caching a node.
2702
Setting this to -1 will cache every merge node, setting this higher
2703
will cache fewer nodes.
2705
self._generations_until_keep = value
2707
def _add_fulltext_content(self, revision_id, content_obj):
2708
self._fulltext_contents[revision_id] = content_obj
2709
# TODO: jam 20080305 It might be good to check the sha1digest here
2710
return content_obj.text()
2712
def _check_parents(self, child, nodes_to_annotate):
2713
"""Check if all parents have been processed.
2715
:param child: A tuple of (rev_id, parents, raw_content)
2716
:param nodes_to_annotate: If child is ready, add it to
2717
nodes_to_annotate, otherwise put it back in self._pending_children
2719
for parent_id in child[1]:
2720
if (parent_id not in self._annotated_lines):
2721
# This parent is present, but another parent is missing
2722
self._pending_children.setdefault(parent_id,
2726
# This one is ready to be processed
2727
nodes_to_annotate.append(child)
2729
def _add_annotation(self, revision_id, fulltext, parent_ids,
2730
left_matching_blocks=None):
2731
"""Add an annotation entry.
2733
All parents should already have been annotated.
2734
:return: A list of children that now have their parents satisfied.
2736
a = self._annotated_lines
2737
annotated_parent_lines = [a[p] for p in parent_ids]
2738
annotated_lines = list(annotate.reannotate(annotated_parent_lines,
2739
fulltext, revision_id, left_matching_blocks,
2740
heads_provider=self._get_heads_provider()))
2741
self._annotated_lines[revision_id] = annotated_lines
2742
for p in parent_ids:
2743
ann_children = self._annotate_children[p]
2744
ann_children.remove(revision_id)
2745
if (not ann_children
2746
and p not in self._nodes_to_keep_annotations):
2747
del self._annotated_lines[p]
2748
del self._all_build_details[p]
2749
if p in self._fulltext_contents:
2750
del self._fulltext_contents[p]
2751
# Now that we've added this one, see if there are any pending
2752
# deltas to be done, certainly this parent is finished
2753
nodes_to_annotate = []
2754
for child in self._pending_children.pop(revision_id, []):
2755
self._check_parents(child, nodes_to_annotate)
2756
return nodes_to_annotate
3460
2758
def _get_build_graph(self, key):
3461
2759
"""Get the graphs for building texts and annotations.
3468
2766
:return: A list of (key, index_memo) records, suitable for
3469
passing to read_records_iter to start reading in the raw data from
2767
passing to read_records_iter to start reading in the raw data fro/
2770
if key in self._annotated_lines:
3472
2773
pending = set([key])
3475
self._num_needed_children[key] = 1
3477
2778
# get all pending nodes
3478
2780
this_iteration = pending
3479
build_details = self._vf._index.get_build_details(this_iteration)
2781
build_details = self._knit._index.get_build_details(this_iteration)
3480
2782
self._all_build_details.update(build_details)
3481
# new_nodes = self._vf._index._get_entries(this_iteration)
2783
# new_nodes = self._knit._index._get_entries(this_iteration)
3482
2784
pending = set()
3483
2785
for key, details in build_details.iteritems():
3484
(index_memo, compression_parent, parent_keys,
2786
(index_memo, compression_parent, parents,
3485
2787
record_details) = details
3486
self._parent_map[key] = parent_keys
3487
self._heads_provider = None
2788
self._revision_id_graph[key] = parents
3488
2789
records.append((key, index_memo))
3489
2790
# Do we actually need to check _annotated_lines?
3490
pending.update([p for p in parent_keys
3491
if p not in self._all_build_details])
3493
for parent_key in parent_keys:
3494
if parent_key in self._num_needed_children:
3495
self._num_needed_children[parent_key] += 1
3497
self._num_needed_children[parent_key] = 1
2791
pending.update(p for p in parents
2792
if p not in self._all_build_details)
3498
2793
if compression_parent:
3499
if compression_parent in self._num_compression_children:
3500
self._num_compression_children[compression_parent] += 1
3502
self._num_compression_children[compression_parent] = 1
2794
self._compression_children.setdefault(compression_parent,
2797
for parent in parents:
2798
self._annotate_children.setdefault(parent,
2800
num_gens = generation - kept_generation
2801
if ((num_gens >= self._generations_until_keep)
2802
and len(parents) > 1):
2803
kept_generation = generation
2804
self._nodes_to_keep_annotations.add(key)
3504
2806
missing_versions = this_iteration.difference(build_details.keys())
3505
if missing_versions:
3506
for key in missing_versions:
3507
if key in self._parent_map and key in self._text_cache:
3508
# We already have this text ready, we just need to
3509
# yield it later so we get it annotated
3511
parent_keys = self._parent_map[key]
3512
for parent_key in parent_keys:
3513
if parent_key in self._num_needed_children:
3514
self._num_needed_children[parent_key] += 1
3516
self._num_needed_children[parent_key] = 1
3517
pending.update([p for p in parent_keys
3518
if p not in self._all_build_details])
3520
raise errors.RevisionNotPresent(key, self._vf)
2807
self._ghosts.update(missing_versions)
2808
for missing_version in missing_versions:
2809
# add a key, no parents
2810
self._revision_id_graph[missing_version] = ()
2811
pending.discard(missing_version) # don't look for it
2812
if self._ghosts.intersection(self._compression_children):
2814
"We cannot have nodes which have a ghost compression parent:\n"
2816
"compression children: %r"
2817
% (self._ghosts, self._compression_children))
2818
# Cleanout anything that depends on a ghost so that we don't wait for
2819
# the ghost to show up
2820
for node in self._ghosts:
2821
if node in self._annotate_children:
2822
# We won't be building this node
2823
del self._annotate_children[node]
3521
2824
# Generally we will want to read the records in reverse order, because
3522
2825
# we find the parent nodes after the children
3523
2826
records.reverse()
3524
return records, ann_keys
3526
def _get_needed_texts(self, key, pb=None):
3527
# if True or len(self._vf._fallback_vfs) > 0:
3528
if len(self._vf._fallback_vfs) > 0:
3529
# If we have fallbacks, go to the generic path
3530
for v in annotate.Annotator._get_needed_texts(self, key, pb=pb):
3535
records, ann_keys = self._get_build_graph(key)
3536
for idx, (sub_key, text, num_lines) in enumerate(
3537
self._extract_texts(records)):
3539
pb.update('annotating', idx, len(records))
3540
yield sub_key, text, num_lines
3541
for sub_key in ann_keys:
3542
text = self._text_cache[sub_key]
3543
num_lines = len(text) # bad assumption
3544
yield sub_key, text, num_lines
3546
except errors.RetryWithNewPacks, e:
3547
self._vf._access.reload_or_raise(e)
3548
# The cached build_details are no longer valid
3549
self._all_build_details.clear()
3551
def _cache_delta_blocks(self, key, compression_parent, delta, lines):
3552
parent_lines = self._text_cache[compression_parent]
3553
blocks = list(KnitContent.get_line_delta_blocks(delta, parent_lines, lines))
3554
self._matching_blocks[(key, compression_parent)] = blocks
3556
def _expand_record(self, key, parent_keys, compression_parent, record,
3559
if compression_parent:
3560
if compression_parent not in self._content_objects:
3561
# Waiting for the parent
3562
self._pending_deltas.setdefault(compression_parent, []).append(
3563
(key, parent_keys, record, record_details))
3565
# We have the basis parent, so expand the delta
3566
num = self._num_compression_children[compression_parent]
3569
base_content = self._content_objects.pop(compression_parent)
3570
self._num_compression_children.pop(compression_parent)
3572
self._num_compression_children[compression_parent] = num
3573
base_content = self._content_objects[compression_parent]
3574
# It is tempting to want to copy_base_content=False for the last
3575
# child object. However, whenever noeol=False,
3576
# self._text_cache[parent_key] is content._lines. So mutating it
3577
# gives very bad results.
3578
# The alternative is to copy the lines into text cache, but then we
3579
# are copying anyway, so just do it here.
3580
content, delta = self._vf._factory.parse_record(
3581
key, record, record_details, base_content,
3582
copy_base_content=True)
3585
content, _ = self._vf._factory.parse_record(
3586
key, record, record_details, None)
3587
if self._num_compression_children.get(key, 0) > 0:
3588
self._content_objects[key] = content
3589
lines = content.text()
3590
self._text_cache[key] = lines
3591
if delta is not None:
3592
self._cache_delta_blocks(key, compression_parent, delta, lines)
3595
def _get_parent_annotations_and_matches(self, key, text, parent_key):
3596
"""Get the list of annotations for the parent, and the matching lines.
3598
:param text: The opaque value given by _get_needed_texts
3599
:param parent_key: The key for the parent text
3600
:return: (parent_annotations, matching_blocks)
3601
parent_annotations is a list as long as the number of lines in
3603
matching_blocks is a list of (parent_idx, text_idx, len) tuples
3604
indicating which lines match between the two texts
3606
block_key = (key, parent_key)
3607
if block_key in self._matching_blocks:
3608
blocks = self._matching_blocks.pop(block_key)
3609
parent_annotations = self._annotations_cache[parent_key]
3610
return parent_annotations, blocks
3611
return annotate.Annotator._get_parent_annotations_and_matches(self,
3612
key, text, parent_key)
3614
def _process_pending(self, key):
3615
"""The content for 'key' was just processed.
3617
Determine if there is any more pending work to be processed.
3620
if key in self._pending_deltas:
3621
compression_parent = key
3622
children = self._pending_deltas.pop(key)
3623
for child_key, parent_keys, record, record_details in children:
3624
lines = self._expand_record(child_key, parent_keys,
3626
record, record_details)
3627
if self._check_ready_for_annotations(child_key, parent_keys):
3628
to_return.append(child_key)
3629
# Also check any children that are waiting for this parent to be
3631
if key in self._pending_annotation:
3632
children = self._pending_annotation.pop(key)
3633
to_return.extend([c for c, p_keys in children
3634
if self._check_ready_for_annotations(c, p_keys)])
3637
def _check_ready_for_annotations(self, key, parent_keys):
3638
"""return true if this text is ready to be yielded.
3640
Otherwise, this will return False, and queue the text into
3641
self._pending_annotation
3643
for parent_key in parent_keys:
3644
if parent_key not in self._annotations_cache:
3645
# still waiting on at least one parent text, so queue it up
3646
# Note that if there are multiple parents, we need to wait
3648
self._pending_annotation.setdefault(parent_key,
3649
[]).append((key, parent_keys))
3653
def _extract_texts(self, records):
3654
"""Extract the various texts needed based on records"""
2829
def _annotate_records(self, records):
2830
"""Build the annotations for the listed records."""
3655
2831
# We iterate in the order read, rather than a strict order requested
3656
2832
# However, process what we can, and put off to the side things that
3657
2833
# still need parents, cleaning them up when those parents are
3660
# 1) As 'records' are read, see if we can expand these records into
3661
# Content objects (and thus lines)
3662
# 2) If a given line-delta is waiting on its compression parent, it
3663
# gets queued up into self._pending_deltas, otherwise we expand
3664
# it, and put it into self._text_cache and self._content_objects
3665
# 3) If we expanded the text, we will then check to see if all
3666
# parents have also been processed. If so, this text gets yielded,
3667
# else this record gets set aside into pending_annotation
3668
# 4) Further, if we expanded the text in (2), we will then check to
3669
# see if there are any children in self._pending_deltas waiting to
3670
# also be processed. If so, we go back to (2) for those
3671
# 5) Further again, if we yielded the text, we can then check if that
3672
# 'unlocks' any of the texts in pending_annotations, which should
3673
# then get yielded as well
3674
# Note that both steps 4 and 5 are 'recursive' in that unlocking one
3675
# compression child could unlock yet another, and yielding a fulltext
3676
# will also 'unlock' the children that are waiting on that annotation.
3677
# (Though also, unlocking 1 parent's fulltext, does not unlock a child
3678
# if other parents are also waiting.)
3679
# We want to yield content before expanding child content objects, so
3680
# that we know when we can re-use the content lines, and the annotation
3681
# code can know when it can stop caching fulltexts, as well.
3683
# Children that are missing their compression parent
3685
for (key, record, digest) in self._vf._read_records_iter(records):
3687
details = self._all_build_details[key]
3688
(_, compression_parent, parent_keys, record_details) = details
3689
lines = self._expand_record(key, parent_keys, compression_parent,
3690
record, record_details)
3692
# Pending delta should be queued up
2835
for (rev_id, record,
2836
digest) in self._knit._read_records_iter(records):
2837
if rev_id in self._annotated_lines:
3694
# At this point, we may be able to yield this content, if all
3695
# parents are also finished
3696
yield_this_text = self._check_ready_for_annotations(key,
3699
# All parents present
3700
yield key, lines, len(lines)
3701
to_process = self._process_pending(key)
3703
this_process = to_process
3705
for key in this_process:
3706
lines = self._text_cache[key]
3707
yield key, lines, len(lines)
3708
to_process.extend(self._process_pending(key))
2839
parent_ids = self._revision_id_graph[rev_id]
2840
parent_ids = [p for p in parent_ids if p not in self._ghosts]
2841
details = self._all_build_details[rev_id]
2842
(index_memo, compression_parent, parents,
2843
record_details) = details
2844
nodes_to_annotate = []
2845
# TODO: Remove the punning between compression parents, and
2846
# parent_ids, we should be able to do this without assuming
2848
if len(parent_ids) == 0:
2849
# There are no parents for this node, so just add it
2850
# TODO: This probably needs to be decoupled
2851
fulltext_content, delta = self._knit._factory.parse_record(
2852
rev_id, record, record_details, None)
2853
fulltext = self._add_fulltext_content(rev_id, fulltext_content)
2854
nodes_to_annotate.extend(self._add_annotation(rev_id, fulltext,
2855
parent_ids, left_matching_blocks=None))
2857
child = (rev_id, parent_ids, record)
2858
# Check if all the parents are present
2859
self._check_parents(child, nodes_to_annotate)
2860
while nodes_to_annotate:
2861
# Should we use a queue here instead of a stack?
2862
(rev_id, parent_ids, record) = nodes_to_annotate.pop()
2863
(index_memo, compression_parent, parents,
2864
record_details) = self._all_build_details[rev_id]
2866
if compression_parent is not None:
2867
comp_children = self._compression_children[compression_parent]
2868
if rev_id not in comp_children:
2869
raise AssertionError("%r not in compression children %r"
2870
% (rev_id, comp_children))
2871
# If there is only 1 child, it is safe to reuse this
2873
reuse_content = (len(comp_children) == 1
2874
and compression_parent not in
2875
self._nodes_to_keep_annotations)
2877
# Remove it from the cache since it will be changing
2878
parent_fulltext_content = self._fulltext_contents.pop(compression_parent)
2879
# Make sure to copy the fulltext since it might be
2881
parent_fulltext = list(parent_fulltext_content.text())
2883
parent_fulltext_content = self._fulltext_contents[compression_parent]
2884
parent_fulltext = parent_fulltext_content.text()
2885
comp_children.remove(rev_id)
2886
fulltext_content, delta = self._knit._factory.parse_record(
2887
rev_id, record, record_details,
2888
parent_fulltext_content,
2889
copy_base_content=(not reuse_content))
2890
fulltext = self._add_fulltext_content(rev_id,
2892
if compression_parent == parent_ids[0]:
2893
# the compression_parent is the left parent, so we can
2895
blocks = KnitContent.get_line_delta_blocks(delta,
2896
parent_fulltext, fulltext)
2898
fulltext_content = self._knit._factory.parse_fulltext(
2900
fulltext = self._add_fulltext_content(rev_id,
2902
nodes_to_annotate.extend(
2903
self._add_annotation(rev_id, fulltext, parent_ids,
2904
left_matching_blocks=blocks))
2906
def _get_heads_provider(self):
2907
"""Create a heads provider for resolving ancestry issues."""
2908
if self._heads_provider is not None:
2909
return self._heads_provider
2910
parent_provider = _mod_graph.DictParentsProvider(
2911
self._revision_id_graph)
2912
graph_obj = _mod_graph.Graph(parent_provider)
2913
head_cache = _mod_graph.FrozenHeadsCache(graph_obj)
2914
self._heads_provider = head_cache
2917
def annotate(self, key):
2918
"""Return the annotated fulltext at the given key.
2920
:param key: The key to annotate.
2922
if len(self._knit._fallback_vfs) > 0:
2923
# stacked knits can't use the fast path at present.
2924
return self._simple_annotate(key)
2927
records = self._get_build_graph(key)
2928
if key in self._ghosts:
2929
raise errors.RevisionNotPresent(key, self._knit)
2930
self._annotate_records(records)
2931
return self._annotated_lines[key]
2932
except errors.RetryWithNewPacks, e:
2933
self._knit._access.reload_or_raise(e)
2934
# The cached build_details are no longer valid
2935
self._all_build_details.clear()
2937
def _simple_annotate(self, key):
2938
"""Return annotated fulltext, rediffing from the full texts.
2940
This is slow but makes no assumptions about the repository
2941
being able to produce line deltas.
2943
# TODO: this code generates a parent maps of present ancestors; it
2944
# could be split out into a separate method, and probably should use
2945
# iter_ancestry instead. -- mbp and robertc 20080704
2946
graph = _mod_graph.Graph(self._knit)
2947
head_cache = _mod_graph.FrozenHeadsCache(graph)
2948
search = graph._make_breadth_first_searcher([key])
2952
present, ghosts = search.next_with_ghosts()
2953
except StopIteration:
2955
keys.update(present)
2956
parent_map = self._knit.get_parent_map(keys)
2958
reannotate = annotate.reannotate
2959
for record in self._knit.get_record_stream(keys, 'topological', True):
2961
fulltext = osutils.chunks_to_lines(record.get_bytes_as('chunked'))
2962
parents = parent_map[key]
2963
if parents is not None:
2964
parent_lines = [parent_cache[parent] for parent in parent_map[key]]
2967
parent_cache[key] = list(
2968
reannotate(parent_lines, fulltext, key, None, head_cache))
2970
return parent_cache[key]
2972
raise errors.RevisionNotPresent(key, self._knit)
3711
from bzrlib._knit_load_data_pyx import _load_data_c as _load_data
3712
except ImportError, e:
3713
osutils.failed_to_load_extension(e)
2976
from bzrlib._knit_load_data_c import _load_data_c as _load_data
3714
2978
from bzrlib._knit_load_data_py import _load_data_py as _load_data
added
removed
bzrlib/knit.py
