1
# Copyright (C) 2008, 2009 Canonical Ltd
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
# GNU General Public License for more details.
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17
"""Persistent maps from tuple_of_strings->string using CHK stores.
19
Overview and current status:
21
The CHKMap class implements a dict from tuple_of_strings->string by using a trie
22
with internal nodes of 8-bit fan out; The key tuples are mapped to strings by
23
joining them by \x00, and \x00 padding shorter keys out to the length of the
24
longest key. Leaf nodes are packed as densely as possible, and internal nodes
25
are all an additional 8-bits wide leading to a sparse upper tree.
27
Updates to a CHKMap are done preferentially via the apply_delta method, to
28
allow optimisation of the update operation; but individual map/unmap calls are
29
possible and supported. Individual changes via map/unmap are buffered in memory
30
until the _save method is called to force serialisation of the tree.
31
apply_delta records its changes immediately by performing an implicit _save.
36
Densely packed upper nodes.
42
from bzrlib import lazy_import
43
lazy_import.lazy_import(globals(), """
55
from bzrlib.static_tuple import StaticTuple
58
# If each line is 50 bytes, and you have 255 internal pages, with 255-way fan
59
# out, it takes 3.1MB to cache the layer.
60
_PAGE_CACHE_SIZE = 4*1024*1024
61
# We are caching bytes so len(value) is perfectly accurate
62
_page_cache = lru_cache.LRUSizeCache(_PAGE_CACHE_SIZE)
67
# If a ChildNode falls below this many bytes, we check for a remap
68
_INTERESTING_NEW_SIZE = 50
69
# If a ChildNode shrinks by more than this amount, we check for a remap
70
_INTERESTING_SHRINKAGE_LIMIT = 20
71
# If we delete more than this many nodes applying a delta, we check for a remap
72
_INTERESTING_DELETES_LIMIT = 5
75
def _search_key_plain(key):
76
"""Map the key tuple into a search string that just uses the key bytes."""
77
return '\x00'.join(key)
80
search_key_registry = registry.Registry()
81
search_key_registry.register('plain', _search_key_plain)
85
"""A persistent map from string to string backed by a CHK store."""
87
__slots__ = ('_store', '_root_node', '_search_key_func')
89
def __init__(self, store, root_key, search_key_func=None):
90
"""Create a CHKMap object.
92
:param store: The store the CHKMap is stored in.
93
:param root_key: The root key of the map. None to create an empty
95
:param search_key_func: A function mapping a key => bytes. These bytes
96
are then used by the internal nodes to split up leaf nodes into
100
if search_key_func is None:
101
search_key_func = _search_key_plain
102
self._search_key_func = search_key_func
104
self._root_node = LeafNode(search_key_func=search_key_func)
106
self._root_node = self._node_key(root_key)
108
def apply_delta(self, delta):
109
"""Apply a delta to the map.
111
:param delta: An iterable of old_key, new_key, new_value tuples.
112
If new_key is not None, then new_key->new_value is inserted
113
into the map; if old_key is not None, then the old mapping
114
of old_key is removed.
117
# Check preconditions first.
118
as_st = StaticTuple.from_sequence
119
new_items = set([as_st(key) for (old, key, value) in delta
120
if key is not None and old is None])
121
existing_new = list(self.iteritems(key_filter=new_items))
123
raise errors.InconsistentDeltaDelta(delta,
124
"New items are already in the map %r." % existing_new)
126
for old, new, value in delta:
127
if old is not None and old != new:
128
self.unmap(old, check_remap=False)
130
for old, new, value in delta:
133
if delete_count > _INTERESTING_DELETES_LIMIT:
134
trace.mutter("checking remap as %d deletions", delete_count)
138
def _ensure_root(self):
139
"""Ensure that the root node is an object not a key."""
140
if type(self._root_node) is StaticTuple:
141
# Demand-load the root
142
self._root_node = self._get_node(self._root_node)
144
def _get_node(self, node):
147
Note that this does not update the _items dict in objects containing a
148
reference to this node. As such it does not prevent subsequent IO being
151
:param node: A tuple key or node object.
152
:return: A node object.
154
if type(node) is StaticTuple:
155
bytes = self._read_bytes(node)
156
return _deserialise(bytes, node,
157
search_key_func=self._search_key_func)
161
def _read_bytes(self, key):
163
return _page_cache[key]
165
stream = self._store.get_record_stream([key], 'unordered', True)
166
bytes = stream.next().get_bytes_as('fulltext')
167
_page_cache[key] = bytes
170
def _dump_tree(self, include_keys=False):
171
"""Return the tree in a string representation."""
173
res = self._dump_tree_node(self._root_node, prefix='', indent='',
174
include_keys=include_keys)
175
res.append('') # Give a trailing '\n'
176
return '\n'.join(res)
178
def _dump_tree_node(self, node, prefix, indent, include_keys=True):
179
"""For this node and all children, generate a string representation."""
184
node_key = node.key()
185
if node_key is not None:
186
key_str = ' %s' % (node_key[0],)
189
result.append('%s%r %s%s' % (indent, prefix, node.__class__.__name__,
191
if type(node) is InternalNode:
192
# Trigger all child nodes to get loaded
193
list(node._iter_nodes(self._store))
194
for prefix, sub in sorted(node._items.iteritems()):
195
result.extend(self._dump_tree_node(sub, prefix, indent + ' ',
196
include_keys=include_keys))
198
for key, value in sorted(node._items.iteritems()):
199
# Don't use prefix nor indent here to line up when used in
200
# tests in conjunction with assertEqualDiff
201
result.append(' %r %r' % (tuple(key), value))
205
def from_dict(klass, store, initial_value, maximum_size=0, key_width=1,
206
search_key_func=None):
207
"""Create a CHKMap in store with initial_value as the content.
209
:param store: The store to record initial_value in, a VersionedFiles
210
object with 1-tuple keys supporting CHK key generation.
211
:param initial_value: A dict to store in store. Its keys and values
213
:param maximum_size: The maximum_size rule to apply to nodes. This
214
determines the size at which no new data is added to a single node.
215
:param key_width: The number of elements in each key_tuple being stored
217
:param search_key_func: A function mapping a key => bytes. These bytes
218
are then used by the internal nodes to split up leaf nodes into
220
:return: The root chk of the resulting CHKMap.
222
root_key = klass._create_directly(store, initial_value,
223
maximum_size=maximum_size, key_width=key_width,
224
search_key_func=search_key_func)
225
if type(root_key) is not StaticTuple:
226
raise AssertionError('we got a %s instead of a StaticTuple'
231
def _create_via_map(klass, store, initial_value, maximum_size=0,
232
key_width=1, search_key_func=None):
233
result = klass(store, None, search_key_func=search_key_func)
234
result._root_node.set_maximum_size(maximum_size)
235
result._root_node._key_width = key_width
237
for key, value in initial_value.items():
238
delta.append((None, key, value))
239
root_key = result.apply_delta(delta)
243
def _create_directly(klass, store, initial_value, maximum_size=0,
244
key_width=1, search_key_func=None):
245
node = LeafNode(search_key_func=search_key_func)
246
node.set_maximum_size(maximum_size)
247
node._key_width = key_width
248
as_st = StaticTuple.from_sequence
249
node._items = dict([(as_st(key), val) for key, val
250
in initial_value.iteritems()])
251
node._raw_size = sum([node._key_value_len(key, value)
252
for key,value in node._items.iteritems()])
253
node._len = len(node._items)
254
node._compute_search_prefix()
255
node._compute_serialised_prefix()
258
and node._current_size() > maximum_size):
259
prefix, node_details = node._split(store)
260
if len(node_details) == 1:
261
raise AssertionError('Failed to split using node._split')
262
node = InternalNode(prefix, search_key_func=search_key_func)
263
node.set_maximum_size(maximum_size)
264
node._key_width = key_width
265
for split, subnode in node_details:
266
node.add_node(split, subnode)
267
keys = list(node.serialise(store))
270
def iter_changes(self, basis):
271
"""Iterate over the changes between basis and self.
273
:return: An iterator of tuples: (key, old_value, new_value). Old_value
274
is None for keys only in self; new_value is None for keys only in
278
# Read both trees in lexographic, highest-first order.
279
# Any identical nodes we skip
280
# Any unique prefixes we output immediately.
281
# values in a leaf node are treated as single-value nodes in the tree
282
# which allows them to be not-special-cased. We know to output them
283
# because their value is a string, not a key(tuple) or node.
285
# corner cases to beware of when considering this function:
286
# *) common references are at different heights.
287
# consider two trees:
288
# {'a': LeafNode={'aaa':'foo', 'aab':'bar'}, 'b': LeafNode={'b'}}
289
# {'a': InternalNode={'aa':LeafNode={'aaa':'foo', 'aab':'bar'},
290
# 'ab':LeafNode={'ab':'bar'}}
291
# 'b': LeafNode={'b'}}
292
# the node with aaa/aab will only be encountered in the second tree
293
# after reading the 'a' subtree, but it is encountered in the first
294
# tree immediately. Variations on this may have read internal nodes
295
# like this. we want to cut the entire pending subtree when we
296
# realise we have a common node. For this we use a list of keys -
297
# the path to a node - and check the entire path is clean as we
299
if self._node_key(self._root_node) == self._node_key(basis._root_node):
303
excluded_keys = set()
304
self_node = self._root_node
305
basis_node = basis._root_node
306
# A heap, each element is prefix, node(tuple/NodeObject/string),
307
# key_path (a list of tuples, tail-sharing down the tree.)
310
def process_node(node, path, a_map, pending):
311
# take a node and expand it
312
node = a_map._get_node(node)
313
if type(node) == LeafNode:
314
path = (node._key, path)
315
for key, value in node._items.items():
316
# For a LeafNode, the key is a serialized_key, rather than
317
# a search_key, but the heap is using search_keys
318
search_key = node._search_key_func(key)
319
heapq.heappush(pending, (search_key, key, value, path))
321
# type(node) == InternalNode
322
path = (node._key, path)
323
for prefix, child in node._items.items():
324
heapq.heappush(pending, (prefix, None, child, path))
325
def process_common_internal_nodes(self_node, basis_node):
326
self_items = set(self_node._items.items())
327
basis_items = set(basis_node._items.items())
328
path = (self_node._key, None)
329
for prefix, child in self_items - basis_items:
330
heapq.heappush(self_pending, (prefix, None, child, path))
331
path = (basis_node._key, None)
332
for prefix, child in basis_items - self_items:
333
heapq.heappush(basis_pending, (prefix, None, child, path))
334
def process_common_leaf_nodes(self_node, basis_node):
335
self_items = set(self_node._items.items())
336
basis_items = set(basis_node._items.items())
337
path = (self_node._key, None)
338
for key, value in self_items - basis_items:
339
prefix = self._search_key_func(key)
340
heapq.heappush(self_pending, (prefix, key, value, path))
341
path = (basis_node._key, None)
342
for key, value in basis_items - self_items:
343
prefix = basis._search_key_func(key)
344
heapq.heappush(basis_pending, (prefix, key, value, path))
345
def process_common_prefix_nodes(self_node, self_path,
346
basis_node, basis_path):
347
# Would it be more efficient if we could request both at the same
349
self_node = self._get_node(self_node)
350
basis_node = basis._get_node(basis_node)
351
if (type(self_node) == InternalNode
352
and type(basis_node) == InternalNode):
353
# Matching internal nodes
354
process_common_internal_nodes(self_node, basis_node)
355
elif (type(self_node) == LeafNode
356
and type(basis_node) == LeafNode):
357
process_common_leaf_nodes(self_node, basis_node)
359
process_node(self_node, self_path, self, self_pending)
360
process_node(basis_node, basis_path, basis, basis_pending)
361
process_common_prefix_nodes(self_node, None, basis_node, None)
364
excluded_keys = set()
365
def check_excluded(key_path):
366
# Note that this is N^2, it depends on us trimming trees
367
# aggressively to not become slow.
368
# A better implementation would probably have a reverse map
369
# back to the children of a node, and jump straight to it when
370
# a common node is detected, the proceed to remove the already
371
# pending children. bzrlib.graph has a searcher module with a
373
while key_path is not None:
374
key, key_path = key_path
375
if key in excluded_keys:
380
while self_pending or basis_pending:
383
# self is exhausted: output remainder of basis
384
for prefix, key, node, path in basis_pending:
385
if check_excluded(path):
387
node = basis._get_node(node)
390
yield (key, node, None)
392
# subtree - fastpath the entire thing.
393
for key, value in node.iteritems(basis._store):
394
yield (key, value, None)
396
elif not basis_pending:
397
# basis is exhausted: output remainder of self.
398
for prefix, key, node, path in self_pending:
399
if check_excluded(path):
401
node = self._get_node(node)
404
yield (key, None, node)
406
# subtree - fastpath the entire thing.
407
for key, value in node.iteritems(self._store):
408
yield (key, None, value)
411
# XXX: future optimisation - yield the smaller items
412
# immediately rather than pushing everything on/off the
413
# heaps. Applies to both internal nodes and leafnodes.
414
if self_pending[0][0] < basis_pending[0][0]:
416
prefix, key, node, path = heapq.heappop(self_pending)
417
if check_excluded(path):
421
yield (key, None, node)
423
process_node(node, path, self, self_pending)
425
elif self_pending[0][0] > basis_pending[0][0]:
427
prefix, key, node, path = heapq.heappop(basis_pending)
428
if check_excluded(path):
432
yield (key, node, None)
434
process_node(node, path, basis, basis_pending)
437
# common prefix: possibly expand both
438
if self_pending[0][1] is None:
443
if basis_pending[0][1] is None:
448
if not read_self and not read_basis:
449
# compare a common value
450
self_details = heapq.heappop(self_pending)
451
basis_details = heapq.heappop(basis_pending)
452
if self_details[2] != basis_details[2]:
453
yield (self_details[1],
454
basis_details[2], self_details[2])
456
# At least one side wasn't a simple value
457
if (self._node_key(self_pending[0][2]) ==
458
self._node_key(basis_pending[0][2])):
459
# Identical pointers, skip (and don't bother adding to
460
# excluded, it won't turn up again.
461
heapq.heappop(self_pending)
462
heapq.heappop(basis_pending)
464
# Now we need to expand this node before we can continue
465
if read_self and read_basis:
466
# Both sides start with the same prefix, so process
468
self_prefix, _, self_node, self_path = heapq.heappop(
470
basis_prefix, _, basis_node, basis_path = heapq.heappop(
472
if self_prefix != basis_prefix:
473
raise AssertionError(
474
'%r != %r' % (self_prefix, basis_prefix))
475
process_common_prefix_nodes(
476
self_node, self_path,
477
basis_node, basis_path)
480
prefix, key, node, path = heapq.heappop(self_pending)
481
if check_excluded(path):
483
process_node(node, path, self, self_pending)
485
prefix, key, node, path = heapq.heappop(basis_pending)
486
if check_excluded(path):
488
process_node(node, path, basis, basis_pending)
491
def iteritems(self, key_filter=None):
492
"""Iterate over the entire CHKMap's contents."""
494
if key_filter is not None:
495
as_st = StaticTuple.from_sequence
496
key_filter = [as_st(key) for key in key_filter]
497
return self._root_node.iteritems(self._store, key_filter=key_filter)
500
"""Return the key for this map."""
501
if type(self._root_node) is StaticTuple:
502
return self._root_node
504
return self._root_node._key
508
return len(self._root_node)
510
def map(self, key, value):
511
"""Map a key tuple to value.
513
:param key: A key to map.
514
:param value: The value to assign to key.
516
key = StaticTuple.from_sequence(key)
517
# Need a root object.
519
prefix, node_details = self._root_node.map(self._store, key, value)
520
if len(node_details) == 1:
521
self._root_node = node_details[0][1]
523
self._root_node = InternalNode(prefix,
524
search_key_func=self._search_key_func)
525
self._root_node.set_maximum_size(node_details[0][1].maximum_size)
526
self._root_node._key_width = node_details[0][1]._key_width
527
for split, node in node_details:
528
self._root_node.add_node(split, node)
530
def _node_key(self, node):
531
"""Get the key for a node whether it's a tuple or node."""
532
if type(node) is tuple:
533
node = StaticTuple.from_sequence(node)
534
if type(node) is StaticTuple:
539
def unmap(self, key, check_remap=True):
540
"""remove key from the map."""
541
key = StaticTuple.from_sequence(key)
543
if type(self._root_node) is InternalNode:
544
unmapped = self._root_node.unmap(self._store, key,
545
check_remap=check_remap)
547
unmapped = self._root_node.unmap(self._store, key)
548
self._root_node = unmapped
550
def _check_remap(self):
551
"""Check if nodes can be collapsed."""
553
if type(self._root_node) is InternalNode:
554
self._root_node._check_remap(self._store)
557
"""Save the map completely.
559
:return: The key of the root node.
561
if type(self._root_node) is StaticTuple:
563
return self._root_node
564
keys = list(self._root_node.serialise(self._store))
569
"""Base class defining the protocol for CHK Map nodes.
571
:ivar _raw_size: The total size of the serialized key:value data, before
572
adding the header bytes, and without prefix compression.
575
__slots__ = ('_key', '_len', '_maximum_size', '_key_width',
576
'_raw_size', '_items', '_search_prefix', '_search_key_func'
579
def __init__(self, key_width=1):
582
:param key_width: The width of keys for this node.
585
# Current number of elements
587
self._maximum_size = 0
588
self._key_width = key_width
589
# current size in bytes
591
# The pointers/values this node has - meaning defined by child classes.
593
# The common search prefix
594
self._search_prefix = None
597
items_str = str(sorted(self._items))
598
if len(items_str) > 20:
599
items_str = items_str[:16] + '...]'
600
return '%s(key:%s len:%s size:%s max:%s prefix:%s items:%s)' % (
601
self.__class__.__name__, self._key, self._len, self._raw_size,
602
self._maximum_size, self._search_prefix, items_str)
611
def maximum_size(self):
612
"""What is the upper limit for adding references to a node."""
613
return self._maximum_size
615
def set_maximum_size(self, new_size):
616
"""Set the size threshold for nodes.
618
:param new_size: The size at which no data is added to a node. 0 for
621
self._maximum_size = new_size
624
def common_prefix(cls, prefix, key):
625
"""Given 2 strings, return the longest prefix common to both.
627
:param prefix: This has been the common prefix for other keys, so it is
628
more likely to be the common prefix in this case as well.
629
:param key: Another string to compare to
631
if key.startswith(prefix):
634
# Is there a better way to do this?
635
for pos, (left, right) in enumerate(zip(prefix, key)):
639
common = prefix[:pos+1]
643
def common_prefix_for_keys(cls, keys):
644
"""Given a list of keys, find their common prefix.
646
:param keys: An iterable of strings.
647
:return: The longest common prefix of all keys.
651
if common_prefix is None:
654
common_prefix = cls.common_prefix(common_prefix, key)
655
if not common_prefix:
656
# if common_prefix is the empty string, then we know it won't
662
# Singleton indicating we have not computed _search_prefix yet
665
class LeafNode(Node):
666
"""A node containing actual key:value pairs.
668
:ivar _items: A dict of key->value items. The key is in tuple form.
669
:ivar _size: The number of bytes that would be used by serializing all of
673
__slots__ = ('_common_serialised_prefix', '_serialise_key')
675
def __init__(self, search_key_func=None):
677
# All of the keys in this leaf node share this common prefix
678
self._common_serialised_prefix = None
679
self._serialise_key = '\x00'.join
680
if search_key_func is None:
681
self._search_key_func = _search_key_plain
683
self._search_key_func = search_key_func
686
items_str = str(sorted(self._items))
687
if len(items_str) > 20:
688
items_str = items_str[:16] + '...]'
690
'%s(key:%s len:%s size:%s max:%s prefix:%s keywidth:%s items:%s)' \
691
% (self.__class__.__name__, self._key, self._len, self._raw_size,
692
self._maximum_size, self._search_prefix, self._key_width, items_str)
694
def _current_size(self):
695
"""Answer the current serialised size of this node.
697
This differs from self._raw_size in that it includes the bytes used for
700
if self._common_serialised_prefix is None:
704
# We will store a single string with the common prefix
705
# And then that common prefix will not be stored in any of the
707
prefix_len = len(self._common_serialised_prefix)
708
bytes_for_items = (self._raw_size - (prefix_len * self._len))
709
return (9 # 'chkleaf:\n'
710
+ len(str(self._maximum_size)) + 1
711
+ len(str(self._key_width)) + 1
712
+ len(str(self._len)) + 1
717
def deserialise(klass, bytes, key, search_key_func=None):
718
"""Deserialise bytes, with key key, into a LeafNode.
720
:param bytes: The bytes of the node.
721
:param key: The key that the serialised node has.
723
return _deserialise_leaf_node(bytes, key,
724
search_key_func=search_key_func)
726
def iteritems(self, store, key_filter=None):
727
"""Iterate over items in the node.
729
:param key_filter: A filter to apply to the node. It should be a
730
list/set/dict or similar repeatedly iterable container.
732
if key_filter is not None:
733
# Adjust the filter - short elements go to a prefix filter. All
734
# other items are looked up directly.
735
# XXX: perhaps defaultdict? Profiling<rinse and repeat>
737
for key in key_filter:
738
if len(key) == self._key_width:
739
# This filter is meant to match exactly one key, yield it
742
yield key, self._items[key]
744
# This key is not present in this map, continue
747
# Short items, we need to match based on a prefix
748
length_filter = filters.setdefault(len(key), set())
749
length_filter.add(key)
751
filters = filters.items()
752
for item in self._items.iteritems():
753
for length, length_filter in filters:
754
if item[0][:length] in length_filter:
758
for item in self._items.iteritems():
761
def _key_value_len(self, key, value):
762
# TODO: Should probably be done without actually joining the key, but
763
# then that can be done via the C extension
764
return (len(self._serialise_key(key)) + 1
765
+ len(str(value.count('\n'))) + 1
768
def _search_key(self, key):
769
return self._search_key_func(key)
771
def _map_no_split(self, key, value):
772
"""Map a key to a value.
774
This assumes either the key does not already exist, or you have already
775
removed its size and length from self.
777
:return: True if adding this node should cause us to split.
779
self._items[key] = value
780
self._raw_size += self._key_value_len(key, value)
782
serialised_key = self._serialise_key(key)
783
if self._common_serialised_prefix is None:
784
self._common_serialised_prefix = serialised_key
786
self._common_serialised_prefix = self.common_prefix(
787
self._common_serialised_prefix, serialised_key)
788
search_key = self._search_key(key)
789
if self._search_prefix is _unknown:
790
self._compute_search_prefix()
791
if self._search_prefix is None:
792
self._search_prefix = search_key
794
self._search_prefix = self.common_prefix(
795
self._search_prefix, search_key)
797
and self._maximum_size
798
and self._current_size() > self._maximum_size):
799
# Check to see if all of the search_keys for this node are
800
# identical. We allow the node to grow under that circumstance
801
# (we could track this as common state, but it is infrequent)
802
if (search_key != self._search_prefix
803
or not self._are_search_keys_identical()):
807
def _split(self, store):
808
"""We have overflowed.
810
Split this node into multiple LeafNodes, return it up the stack so that
811
the next layer creates a new InternalNode and references the new nodes.
813
:return: (common_serialised_prefix, [(node_serialised_prefix, node)])
815
if self._search_prefix is _unknown:
816
raise AssertionError('Search prefix must be known')
817
common_prefix = self._search_prefix
818
split_at = len(common_prefix) + 1
820
for key, value in self._items.iteritems():
821
search_key = self._search_key(key)
822
prefix = search_key[:split_at]
823
# TODO: Generally only 1 key can be exactly the right length,
824
# which means we can only have 1 key in the node pointed
825
# at by the 'prefix\0' key. We might want to consider
826
# folding it into the containing InternalNode rather than
827
# having a fixed length-1 node.
828
# Note this is probably not true for hash keys, as they
829
# may get a '\00' node anywhere, but won't have keys of
831
if len(prefix) < split_at:
832
prefix += '\x00'*(split_at - len(prefix))
833
if prefix not in result:
834
node = LeafNode(search_key_func=self._search_key_func)
835
node.set_maximum_size(self._maximum_size)
836
node._key_width = self._key_width
837
result[prefix] = node
839
node = result[prefix]
840
sub_prefix, node_details = node.map(store, key, value)
841
if len(node_details) > 1:
842
if prefix != sub_prefix:
843
# This node has been split and is now found via a different
846
new_node = InternalNode(sub_prefix,
847
search_key_func=self._search_key_func)
848
new_node.set_maximum_size(self._maximum_size)
849
new_node._key_width = self._key_width
850
for split, node in node_details:
851
new_node.add_node(split, node)
852
result[prefix] = new_node
853
return common_prefix, result.items()
855
def map(self, store, key, value):
856
"""Map key to value."""
857
if key in self._items:
858
self._raw_size -= self._key_value_len(key, self._items[key])
861
if self._map_no_split(key, value):
862
return self._split(store)
864
if self._search_prefix is _unknown:
865
raise AssertionError('%r must be known' % self._search_prefix)
866
return self._search_prefix, [("", self)]
868
def serialise(self, store):
869
"""Serialise the LeafNode to store.
871
:param store: A VersionedFiles honouring the CHK extensions.
872
:return: An iterable of the keys inserted by this operation.
874
lines = ["chkleaf:\n"]
875
lines.append("%d\n" % self._maximum_size)
876
lines.append("%d\n" % self._key_width)
877
lines.append("%d\n" % self._len)
878
if self._common_serialised_prefix is None:
880
if len(self._items) != 0:
881
raise AssertionError('If _common_serialised_prefix is None'
882
' we should have no items')
884
lines.append('%s\n' % (self._common_serialised_prefix,))
885
prefix_len = len(self._common_serialised_prefix)
886
for key, value in sorted(self._items.items()):
887
# Always add a final newline
888
value_lines = osutils.chunks_to_lines([value + '\n'])
889
serialized = "%s\x00%s\n" % (self._serialise_key(key),
891
if not serialized.startswith(self._common_serialised_prefix):
892
raise AssertionError('We thought the common prefix was %r'
893
' but entry %r does not have it in common'
894
% (self._common_serialised_prefix, serialized))
895
lines.append(serialized[prefix_len:])
896
lines.extend(value_lines)
897
sha1, _, _ = store.add_lines((None,), (), lines)
898
self._key = StaticTuple("sha1:" + sha1,).intern()
899
bytes = ''.join(lines)
900
if len(bytes) != self._current_size():
901
raise AssertionError('Invalid _current_size')
902
_page_cache.add(self._key, bytes)
906
"""Return the references to other CHK's held by this node."""
909
def _compute_search_prefix(self):
910
"""Determine the common search prefix for all keys in this node.
912
:return: A bytestring of the longest search key prefix that is
913
unique within this node.
915
search_keys = [self._search_key_func(key) for key in self._items]
916
self._search_prefix = self.common_prefix_for_keys(search_keys)
917
return self._search_prefix
919
def _are_search_keys_identical(self):
920
"""Check to see if the search keys for all entries are the same.
922
When using a hash as the search_key it is possible for non-identical
923
keys to collide. If that happens enough, we may try overflow a
924
LeafNode, but as all are collisions, we must not split.
926
common_search_key = None
927
for key in self._items:
928
search_key = self._search_key(key)
929
if common_search_key is None:
930
common_search_key = search_key
931
elif search_key != common_search_key:
935
def _compute_serialised_prefix(self):
936
"""Determine the common prefix for serialised keys in this node.
938
:return: A bytestring of the longest serialised key prefix that is
939
unique within this node.
941
serialised_keys = [self._serialise_key(key) for key in self._items]
942
self._common_serialised_prefix = self.common_prefix_for_keys(
944
return self._common_serialised_prefix
946
def unmap(self, store, key):
947
"""Unmap key from the node."""
949
self._raw_size -= self._key_value_len(key, self._items[key])
951
trace.mutter("key %s not found in %r", key, self._items)
956
# Recompute from scratch
957
self._compute_search_prefix()
958
self._compute_serialised_prefix()
962
class InternalNode(Node):
963
"""A node that contains references to other nodes.
965
An InternalNode is responsible for mapping search key prefixes to child
968
:ivar _items: serialised_key => node dictionary. node may be a tuple,
969
LeafNode or InternalNode.
972
__slots__ = ('_node_width',)
974
def __init__(self, prefix='', search_key_func=None):
976
# The size of an internalnode with default values and no children.
977
# How many octets key prefixes within this node are.
979
self._search_prefix = prefix
980
if search_key_func is None:
981
self._search_key_func = _search_key_plain
983
self._search_key_func = search_key_func
985
def add_node(self, prefix, node):
986
"""Add a child node with prefix prefix, and node node.
988
:param prefix: The search key prefix for node.
989
:param node: The node being added.
991
if self._search_prefix is None:
992
raise AssertionError("_search_prefix should not be None")
993
if not prefix.startswith(self._search_prefix):
994
raise AssertionError("prefixes mismatch: %s must start with %s"
995
% (prefix,self._search_prefix))
996
if len(prefix) != len(self._search_prefix) + 1:
997
raise AssertionError("prefix wrong length: len(%s) is not %d" %
998
(prefix, len(self._search_prefix) + 1))
999
self._len += len(node)
1000
if not len(self._items):
1001
self._node_width = len(prefix)
1002
if self._node_width != len(self._search_prefix) + 1:
1003
raise AssertionError("node width mismatch: %d is not %d" %
1004
(self._node_width, len(self._search_prefix) + 1))
1005
self._items[prefix] = node
1008
def _current_size(self):
1009
"""Answer the current serialised size of this node."""
1010
return (self._raw_size + len(str(self._len)) + len(str(self._key_width)) +
1011
len(str(self._maximum_size)))
1014
def deserialise(klass, bytes, key, search_key_func=None):
1015
"""Deserialise bytes to an InternalNode, with key key.
1017
:param bytes: The bytes of the node.
1018
:param key: The key that the serialised node has.
1019
:return: An InternalNode instance.
1021
if type(key) is not StaticTuple:
1022
raise AssertionError('deserialise should be called with a'
1023
' StaticTuple not %s' % (type(key),))
1024
return _deserialise_internal_node(bytes, key,
1025
search_key_func=search_key_func)
1027
def iteritems(self, store, key_filter=None):
1028
for node, node_filter in self._iter_nodes(store, key_filter=key_filter):
1029
for item in node.iteritems(store, key_filter=node_filter):
1032
def _iter_nodes(self, store, key_filter=None, batch_size=None):
1033
"""Iterate over node objects which match key_filter.
1035
:param store: A store to use for accessing content.
1036
:param key_filter: A key filter to filter nodes. Only nodes that might
1037
contain a key in key_filter will be returned.
1038
:param batch_size: If not None, then we will return the nodes that had
1039
to be read using get_record_stream in batches, rather than reading
1041
:return: An iterable of nodes. This function does not have to be fully
1042
consumed. (There will be no pending I/O when items are being returned.)
1044
# Map from chk key ('sha1:...',) to (prefix, key_filter)
1045
# prefix is the key in self._items to use, key_filter is the key_filter
1046
# entries that would match this node
1049
if key_filter is None:
1050
# yielding all nodes, yield whatever we have, and queue up a read
1051
# for whatever we are missing
1053
for prefix, node in self._items.iteritems():
1054
if node.__class__ is StaticTuple:
1055
keys[node] = (prefix, None)
1058
elif len(key_filter) == 1:
1059
# Technically, this path could also be handled by the first check
1060
# in 'self._node_width' in length_filters. However, we can handle
1061
# this case without spending any time building up the
1062
# prefix_to_keys, etc state.
1064
# This is a bit ugly, but TIMEIT showed it to be by far the fastest
1065
# 0.626us list(key_filter)[0]
1066
# is a func() for list(), 2 mallocs, and a getitem
1067
# 0.489us [k for k in key_filter][0]
1068
# still has the mallocs, avoids the func() call
1069
# 0.350us iter(key_filter).next()
1070
# has a func() call, and mallocs an iterator
1071
# 0.125us for key in key_filter: pass
1072
# no func() overhead, might malloc an iterator
1073
# 0.105us for key in key_filter: break
1074
# no func() overhead, might malloc an iterator, probably
1075
# avoids checking an 'else' clause as part of the for
1076
for key in key_filter:
1078
search_prefix = self._search_prefix_filter(key)
1079
if len(search_prefix) == self._node_width:
1080
# This item will match exactly, so just do a dict lookup, and
1081
# see what we can return
1084
node = self._items[search_prefix]
1086
# A given key can only match 1 child node, if it isn't
1087
# there, then we can just return nothing
1089
if node.__class__ is StaticTuple:
1090
keys[node] = (search_prefix, [key])
1092
# This is loaded, and the only thing that can match,
1097
# First, convert all keys into a list of search prefixes
1098
# Aggregate common prefixes, and track the keys they come from
1101
for key in key_filter:
1102
search_prefix = self._search_prefix_filter(key)
1103
length_filter = length_filters.setdefault(
1104
len(search_prefix), set())
1105
length_filter.add(search_prefix)
1106
prefix_to_keys.setdefault(search_prefix, []).append(key)
1108
if (self._node_width in length_filters
1109
and len(length_filters) == 1):
1110
# all of the search prefixes match exactly _node_width. This
1111
# means that everything is an exact match, and we can do a
1112
# lookup into self._items, rather than iterating over the items
1114
search_prefixes = length_filters[self._node_width]
1115
for search_prefix in search_prefixes:
1117
node = self._items[search_prefix]
1119
# We can ignore this one
1121
node_key_filter = prefix_to_keys[search_prefix]
1122
if node.__class__ is StaticTuple:
1123
keys[node] = (search_prefix, node_key_filter)
1125
yield node, node_key_filter
1127
# The slow way. We walk every item in self._items, and check to
1128
# see if there are any matches
1129
length_filters = length_filters.items()
1130
for prefix, node in self._items.iteritems():
1131
node_key_filter = []
1132
for length, length_filter in length_filters:
1133
sub_prefix = prefix[:length]
1134
if sub_prefix in length_filter:
1135
node_key_filter.extend(prefix_to_keys[sub_prefix])
1136
if node_key_filter: # this key matched something, yield it
1137
if node.__class__ is StaticTuple:
1138
keys[node] = (prefix, node_key_filter)
1140
yield node, node_key_filter
1142
# Look in the page cache for some more bytes
1146
bytes = _page_cache[key]
1150
node = _deserialise(bytes, key,
1151
search_key_func=self._search_key_func)
1152
prefix, node_key_filter = keys[key]
1153
self._items[prefix] = node
1155
yield node, node_key_filter
1156
for key in found_keys:
1159
# demand load some pages.
1160
if batch_size is None:
1161
# Read all the keys in
1162
batch_size = len(keys)
1163
key_order = list(keys)
1164
for batch_start in range(0, len(key_order), batch_size):
1165
batch = key_order[batch_start:batch_start + batch_size]
1166
# We have to fully consume the stream so there is no pending
1167
# I/O, so we buffer the nodes for now.
1168
stream = store.get_record_stream(batch, 'unordered', True)
1169
node_and_filters = []
1170
for record in stream:
1171
bytes = record.get_bytes_as('fulltext')
1172
node = _deserialise(bytes, record.key,
1173
search_key_func=self._search_key_func)
1174
prefix, node_key_filter = keys[record.key]
1175
node_and_filters.append((node, node_key_filter))
1176
self._items[prefix] = node
1177
_page_cache.add(record.key, bytes)
1178
for info in node_and_filters:
1181
def map(self, store, key, value):
1182
"""Map key to value."""
1183
if not len(self._items):
1184
raise AssertionError("can't map in an empty InternalNode.")
1185
search_key = self._search_key(key)
1186
if self._node_width != len(self._search_prefix) + 1:
1187
raise AssertionError("node width mismatch: %d is not %d" %
1188
(self._node_width, len(self._search_prefix) + 1))
1189
if not search_key.startswith(self._search_prefix):
1190
# This key doesn't fit in this index, so we need to split at the
1191
# point where it would fit, insert self into that internal node,
1192
# and then map this key into that node.
1193
new_prefix = self.common_prefix(self._search_prefix,
1195
new_parent = InternalNode(new_prefix,
1196
search_key_func=self._search_key_func)
1197
new_parent.set_maximum_size(self._maximum_size)
1198
new_parent._key_width = self._key_width
1199
new_parent.add_node(self._search_prefix[:len(new_prefix)+1],
1201
return new_parent.map(store, key, value)
1202
children = [node for node, _
1203
in self._iter_nodes(store, key_filter=[key])]
1208
child = self._new_child(search_key, LeafNode)
1209
old_len = len(child)
1210
if type(child) is LeafNode:
1211
old_size = child._current_size()
1214
prefix, node_details = child.map(store, key, value)
1215
if len(node_details) == 1:
1216
# child may have shrunk, or might be a new node
1217
child = node_details[0][1]
1218
self._len = self._len - old_len + len(child)
1219
self._items[search_key] = child
1222
if type(child) is LeafNode:
1223
if old_size is None:
1224
# The old node was an InternalNode which means it has now
1225
# collapsed, so we need to check if it will chain to a
1226
# collapse at this level.
1227
trace.mutter("checking remap as InternalNode -> LeafNode")
1228
new_node = self._check_remap(store)
1230
# If the LeafNode has shrunk in size, we may want to run
1231
# a remap check. Checking for a remap is expensive though
1232
# and the frequency of a successful remap is very low.
1233
# Shrinkage by small amounts is common, so we only do the
1234
# remap check if the new_size is low or the shrinkage
1235
# amount is over a configurable limit.
1236
new_size = child._current_size()
1237
shrinkage = old_size - new_size
1238
if (shrinkage > 0 and new_size < _INTERESTING_NEW_SIZE
1239
or shrinkage > _INTERESTING_SHRINKAGE_LIMIT):
1241
"checking remap as size shrunk by %d to be %d",
1242
shrinkage, new_size)
1243
new_node = self._check_remap(store)
1244
if new_node._search_prefix is None:
1245
raise AssertionError("_search_prefix should not be None")
1246
return new_node._search_prefix, [('', new_node)]
1247
# child has overflown - create a new intermediate node.
1248
# XXX: This is where we might want to try and expand our depth
1249
# to refer to more bytes of every child (which would give us
1250
# multiple pointers to child nodes, but less intermediate nodes)
1251
child = self._new_child(search_key, InternalNode)
1252
child._search_prefix = prefix
1253
for split, node in node_details:
1254
child.add_node(split, node)
1255
self._len = self._len - old_len + len(child)
1257
return self._search_prefix, [("", self)]
1259
def _new_child(self, search_key, klass):
1260
"""Create a new child node of type klass."""
1262
child.set_maximum_size(self._maximum_size)
1263
child._key_width = self._key_width
1264
child._search_key_func = self._search_key_func
1265
self._items[search_key] = child
1268
def serialise(self, store):
1269
"""Serialise the node to store.
1271
:param store: A VersionedFiles honouring the CHK extensions.
1272
:return: An iterable of the keys inserted by this operation.
1274
for node in self._items.itervalues():
1275
if type(node) is StaticTuple:
1276
# Never deserialised.
1278
if node._key is not None:
1281
for key in node.serialise(store):
1283
lines = ["chknode:\n"]
1284
lines.append("%d\n" % self._maximum_size)
1285
lines.append("%d\n" % self._key_width)
1286
lines.append("%d\n" % self._len)
1287
if self._search_prefix is None:
1288
raise AssertionError("_search_prefix should not be None")
1289
lines.append('%s\n' % (self._search_prefix,))
1290
prefix_len = len(self._search_prefix)
1291
for prefix, node in sorted(self._items.items()):
1292
if type(node) is StaticTuple:
1296
serialised = "%s\x00%s\n" % (prefix, key)
1297
if not serialised.startswith(self._search_prefix):
1298
raise AssertionError("prefixes mismatch: %s must start with %s"
1299
% (serialised, self._search_prefix))
1300
lines.append(serialised[prefix_len:])
1301
sha1, _, _ = store.add_lines((None,), (), lines)
1302
self._key = StaticTuple("sha1:" + sha1,).intern()
1303
_page_cache.add(self._key, ''.join(lines))
1306
def _search_key(self, key):
1307
"""Return the serialised key for key in this node."""
1308
# search keys are fixed width. All will be self._node_width wide, so we
1310
return (self._search_key_func(key) + '\x00'*self._node_width)[:self._node_width]
1312
def _search_prefix_filter(self, key):
1313
"""Serialise key for use as a prefix filter in iteritems."""
1314
return self._search_key_func(key)[:self._node_width]
1316
def _split(self, offset):
1317
"""Split this node into smaller nodes starting at offset.
1319
:param offset: The offset to start the new child nodes at.
1320
:return: An iterable of (prefix, node) tuples. prefix is a byte
1321
prefix for reaching node.
1323
if offset >= self._node_width:
1324
for node in self._items.values():
1325
for result in node._split(offset):
1328
for key, node in self._items.items():
1332
"""Return the references to other CHK's held by this node."""
1333
if self._key is None:
1334
raise AssertionError("unserialised nodes have no refs.")
1336
for value in self._items.itervalues():
1337
if type(value) is StaticTuple:
1340
refs.append(value.key())
1343
def _compute_search_prefix(self, extra_key=None):
1344
"""Return the unique key prefix for this node.
1346
:return: A bytestring of the longest search key prefix that is
1347
unique within this node.
1349
self._search_prefix = self.common_prefix_for_keys(self._items)
1350
return self._search_prefix
1352
def unmap(self, store, key, check_remap=True):
1353
"""Remove key from this node and it's children."""
1354
if not len(self._items):
1355
raise AssertionError("can't unmap in an empty InternalNode.")
1356
children = [node for node, _
1357
in self._iter_nodes(store, key_filter=[key])]
1363
unmapped = child.unmap(store, key)
1365
search_key = self._search_key(key)
1366
if len(unmapped) == 0:
1367
# All child nodes are gone, remove the child:
1368
del self._items[search_key]
1371
# Stash the returned node
1372
self._items[search_key] = unmapped
1373
if len(self._items) == 1:
1374
# this node is no longer needed:
1375
return self._items.values()[0]
1376
if type(unmapped) is InternalNode:
1379
return self._check_remap(store)
1383
def _check_remap(self, store):
1384
"""Check if all keys contained by children fit in a single LeafNode.
1386
:param store: A store to use for reading more nodes
1387
:return: Either self, or a new LeafNode which should replace self.
1389
# Logic for how we determine when we need to rebuild
1390
# 1) Implicitly unmap() is removing a key which means that the child
1391
# nodes are going to be shrinking by some extent.
1392
# 2) If all children are LeafNodes, it is possible that they could be
1393
# combined into a single LeafNode, which can then completely replace
1394
# this internal node with a single LeafNode
1395
# 3) If *one* child is an InternalNode, we assume it has already done
1396
# all the work to determine that its children cannot collapse, and
1397
# we can then assume that those nodes *plus* the current nodes don't
1398
# have a chance of collapsing either.
1399
# So a very cheap check is to just say if 'unmapped' is an
1400
# InternalNode, we don't have to check further.
1402
# TODO: Another alternative is to check the total size of all known
1403
# LeafNodes. If there is some formula we can use to determine the
1404
# final size without actually having to read in any more
1405
# children, it would be nice to have. However, we have to be
1406
# careful with stuff like nodes that pull out the common prefix
1407
# of each key, as adding a new key can change the common prefix
1408
# and cause size changes greater than the length of one key.
1409
# So for now, we just add everything to a new Leaf until it
1410
# splits, as we know that will give the right answer
1411
new_leaf = LeafNode(search_key_func=self._search_key_func)
1412
new_leaf.set_maximum_size(self._maximum_size)
1413
new_leaf._key_width = self._key_width
1414
# A batch_size of 16 was chosen because:
1415
# a) In testing, a 4k page held 14 times. So if we have more than 16
1416
# leaf nodes we are unlikely to hold them in a single new leaf
1417
# node. This still allows for 1 round trip
1418
# b) With 16-way fan out, we can still do a single round trip
1419
# c) With 255-way fan out, we don't want to read all 255 and destroy
1420
# the page cache, just to determine that we really don't need it.
1421
for node, _ in self._iter_nodes(store, batch_size=16):
1422
if type(node) is InternalNode:
1423
# Without looking at any leaf nodes, we are sure
1425
for key, value in node._items.iteritems():
1426
if new_leaf._map_no_split(key, value):
1428
trace.mutter("remap generated a new LeafNode")
1432
def _deserialise(bytes, key, search_key_func):
1433
"""Helper for repositorydetails - convert bytes to a node."""
1434
if bytes.startswith("chkleaf:\n"):
1435
node = LeafNode.deserialise(bytes, key, search_key_func=search_key_func)
1436
elif bytes.startswith("chknode:\n"):
1437
node = InternalNode.deserialise(bytes, key,
1438
search_key_func=search_key_func)
1440
raise AssertionError("Unknown node type.")
1444
class CHKMapDifference(object):
1445
"""Iterate the stored pages and key,value pairs for (new - old).
1447
This class provides a generator over the stored CHK pages and the
1448
(key, value) pairs that are in any of the new maps and not in any of the
1451
Note that it may yield chk pages that are common (especially root nodes),
1452
but it won't yield (key,value) pairs that are common.
1455
def __init__(self, store, new_root_keys, old_root_keys,
1456
search_key_func, pb=None):
1457
# TODO: Should we add a StaticTuple barrier here? It would be nice to
1458
# force callers to use StaticTuple, because there will often be
1459
# lots of keys passed in here. And even if we cast it locally,
1460
# that just meanst that we will have *both* a StaticTuple and a
1461
# tuple() in memory, referring to the same object. (so a net
1462
# increase in memory, not a decrease.)
1464
self._new_root_keys = new_root_keys
1465
self._old_root_keys = old_root_keys
1467
# All uninteresting chks that we have seen. By the time they are added
1468
# here, they should be either fully ignored, or queued up for
1470
self._all_old_chks = set(self._old_root_keys)
1471
# All items that we have seen from the old_root_keys
1472
self._all_old_items = set()
1473
# These are interesting items which were either read, or already in the
1474
# interesting queue (so we don't need to walk them again)
1475
self._processed_new_refs = set()
1476
self._search_key_func = search_key_func
1478
# The uninteresting and interesting nodes to be searched
1479
self._old_queue = []
1480
self._new_queue = []
1481
# Holds the (key, value) items found when processing the root nodes,
1482
# waiting for the uninteresting nodes to be walked
1483
self._new_item_queue = []
1486
def _read_nodes_from_store(self, keys):
1487
# We chose not to use _page_cache, because we think in terms of records
1488
# to be yielded. Also, we expect to touch each page only 1 time during
1489
# this code. (We may want to evaluate saving the raw bytes into the
1490
# page cache, which would allow a working tree update after the fetch
1491
# to not have to read the bytes again.)
1492
stream = self._store.get_record_stream(keys, 'unordered', True)
1493
for record in stream:
1494
if self._pb is not None:
1496
if record.storage_kind == 'absent':
1497
raise errors.NoSuchRevision(self._store, record.key)
1498
bytes = record.get_bytes_as('fulltext')
1499
node = _deserialise(bytes, record.key,
1500
search_key_func=self._search_key_func)
1501
if type(node) is InternalNode:
1502
# Note we don't have to do node.refs() because we know that
1503
# there are no children that have been pushed into this node
1504
# TODO: Turn these into StaticTuple, and possibly intern them.
1505
# The sha1 pointer (in this case the value), should
1506
# already be a static tuple, and properly interned. So
1507
# i'm not sure if there is a big win on top of that
1508
prefix_refs = node._items.items()
1512
# TODO: Turn these into StaticTuple, and possibly intern them.
1513
# This points (ST(file_id), value), which in reality
1514
# should be pretty common, because of all the leaf nodes
1515
# that share most of the entries. Note, though, that we
1516
# didn't find a benefit to interning the value, so there
1517
# may not be an actual benefit to interning this tuple.
1518
# The file_key should already be interned. If it isn't we
1519
# need to look into it.
1520
items = node._items.items()
1521
yield record, node, prefix_refs, items
1523
def _read_old_roots(self):
1524
old_chks_to_enqueue = []
1525
all_old_chks = self._all_old_chks
1526
for record, node, prefix_refs, items in \
1527
self._read_nodes_from_store(self._old_root_keys):
1528
# Uninteresting node
1529
prefix_refs = [p_r for p_r in prefix_refs
1530
if p_r[1] not in all_old_chks]
1531
new_refs = [p_r[1] for p_r in prefix_refs]
1532
all_old_chks.update(new_refs)
1533
self._all_old_items.update(items)
1534
# Queue up the uninteresting references
1535
# Don't actually put them in the 'to-read' queue until we have
1536
# finished checking the interesting references
1537
old_chks_to_enqueue.extend(prefix_refs)
1538
return old_chks_to_enqueue
1540
def _enqueue_old(self, new_prefixes, old_chks_to_enqueue):
1541
# At this point, we have read all the uninteresting and interesting
1542
# items, so we can queue up the uninteresting stuff, knowing that we've
1543
# handled the interesting ones
1544
for prefix, ref in old_chks_to_enqueue:
1545
not_interesting = True
1546
for i in xrange(len(prefix), 0, -1):
1547
if prefix[:i] in new_prefixes:
1548
not_interesting = False
1551
# This prefix is not part of the remaining 'interesting set'
1553
self._old_queue.append(ref)
1555
def _read_all_roots(self):
1556
"""Read the root pages.
1558
This is structured as a generator, so that the root records can be
1559
yielded up to whoever needs them without any buffering.
1561
# This is the bootstrap phase
1562
if not self._old_root_keys:
1563
# With no old_root_keys we can just shortcut and be ready
1564
# for _flush_new_queue
1565
self._new_queue = list(self._new_root_keys)
1567
old_chks_to_enqueue = self._read_old_roots()
1568
# filter out any root keys that are already known to be uninteresting
1569
new_keys = set(self._new_root_keys).difference(self._all_old_chks)
1570
# These are prefixes that are present in new_keys that we are
1572
new_prefixes = set()
1573
# We are about to yield all of these, so we don't want them getting
1574
# added a second time
1575
processed_new_refs = self._processed_new_refs
1576
processed_new_refs.update(new_keys)
1577
for record, node, prefix_refs, items in \
1578
self._read_nodes_from_store(new_keys):
1579
# At this level, we now know all the uninteresting references
1580
# So we filter and queue up whatever is remaining
1581
prefix_refs = [p_r for p_r in prefix_refs
1582
if p_r[1] not in self._all_old_chks
1583
and p_r[1] not in processed_new_refs]
1584
refs = [p_r[1] for p_r in prefix_refs]
1585
new_prefixes.update([p_r[0] for p_r in prefix_refs])
1586
self._new_queue.extend(refs)
1587
# TODO: We can potentially get multiple items here, however the
1588
# current design allows for this, as callers will do the work
1589
# to make the results unique. We might profile whether we
1590
# gain anything by ensuring unique return values for items
1591
new_items = [item for item in items
1592
if item not in self._all_old_items]
1593
self._new_item_queue.extend(new_items)
1594
new_prefixes.update([self._search_key_func(item[0])
1595
for item in new_items])
1596
processed_new_refs.update(refs)
1598
# For new_prefixes we have the full length prefixes queued up.
1599
# However, we also need possible prefixes. (If we have a known ref to
1600
# 'ab', then we also need to include 'a'.) So expand the
1601
# new_prefixes to include all shorter prefixes
1602
for prefix in list(new_prefixes):
1603
new_prefixes.update([prefix[:i] for i in xrange(1, len(prefix))])
1604
self._enqueue_old(new_prefixes, old_chks_to_enqueue)
1606
def _flush_new_queue(self):
1607
# No need to maintain the heap invariant anymore, just pull things out
1609
refs = set(self._new_queue)
1610
self._new_queue = []
1611
# First pass, flush all interesting items and convert to using direct refs
1612
all_old_chks = self._all_old_chks
1613
processed_new_refs = self._processed_new_refs
1614
all_old_items = self._all_old_items
1615
new_items = [item for item in self._new_item_queue
1616
if item not in all_old_items]
1617
self._new_item_queue = []
1619
yield None, new_items
1620
refs = refs.difference(all_old_chks)
1623
next_refs_update = next_refs.update
1624
# Inlining _read_nodes_from_store improves 'bzr branch bzr.dev'
1625
# from 1m54s to 1m51s. Consider it.
1626
for record, _, p_refs, items in self._read_nodes_from_store(refs):
1627
items = [item for item in items
1628
if item not in all_old_items]
1630
next_refs_update([p_r[1] for p_r in p_refs])
1631
next_refs = next_refs.difference(all_old_chks)
1632
next_refs = next_refs.difference(processed_new_refs)
1633
processed_new_refs.update(next_refs)
1636
def _process_next_old(self):
1637
# Since we don't filter uninteresting any further than during
1638
# _read_all_roots, process the whole queue in a single pass.
1639
refs = self._old_queue
1640
self._old_queue = []
1641
all_old_chks = self._all_old_chks
1642
for record, _, prefix_refs, items in self._read_nodes_from_store(refs):
1643
self._all_old_items.update(items)
1644
refs = [r for _,r in prefix_refs if r not in all_old_chks]
1645
self._old_queue.extend(refs)
1646
all_old_chks.update(refs)
1648
def _process_queues(self):
1649
while self._old_queue:
1650
self._process_next_old()
1651
return self._flush_new_queue()
1654
for record in self._read_all_roots():
1656
for record, items in self._process_queues():
1660
def iter_interesting_nodes(store, interesting_root_keys,
1661
uninteresting_root_keys, pb=None):
1662
"""Given root keys, find interesting nodes.
1664
Evaluate nodes referenced by interesting_root_keys. Ones that are also
1665
referenced from uninteresting_root_keys are not considered interesting.
1667
:param interesting_root_keys: keys which should be part of the
1668
"interesting" nodes (which will be yielded)
1669
:param uninteresting_root_keys: keys which should be filtered out of the
1672
(interesting record, {interesting key:values})
1674
iterator = CHKMapDifference(store, interesting_root_keys,
1675
uninteresting_root_keys,
1676
search_key_func=store._search_key_func,
1678
return iterator.process()
1682
from bzrlib._chk_map_pyx import (
1685
_deserialise_leaf_node,
1686
_deserialise_internal_node,
1688
except ImportError, e:
1689
osutils.failed_to_load_extension(e)
1690
from bzrlib._chk_map_py import (
1693
_deserialise_leaf_node,
1694
_deserialise_internal_node,
1696
search_key_registry.register('hash-16-way', _search_key_16)
1697
search_key_registry.register('hash-255-way', _search_key_255)
1700
def _check_key(key):
1701
"""Helper function to assert that a key is properly formatted.
1703
This generally shouldn't be used in production code, but it can be helpful
1706
if type(key) is not StaticTuple:
1707
raise TypeError('key %r is not StaticTuple but %s' % (key, type(key)))
1709
raise ValueError('key %r should have length 1, not %d' % (key, len(key),))
1710
if type(key[0]) is not str:
1711
raise TypeError('key %r should hold a str, not %r'
1712
% (key, type(key[0])))
1713
if not key[0].startswith('sha1:'):
1714
raise ValueError('key %r should point to a sha1:' % (key,))
added
removed
bzrlib/chk_map.py
