1
# Copyright (C) 2008, 2009 Canonical Ltd
1
# Copyright (C) 2008, 2009, 2010 Canonical Ltd
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
57
from bzrlib.static_tuple import StaticTuple
57
60
# If each line is 50 bytes, and you have 255 internal pages, with 255-way fan
58
61
# out, it takes 3.1MB to cache the layer.
59
62
_PAGE_CACHE_SIZE = 4*1024*1024
60
# We are caching bytes so len(value) is perfectly accurate
61
_page_cache = lru_cache.LRUSizeCache(_PAGE_CACHE_SIZE)
63
# Per thread caches for 2 reasons:
64
# - in the server we may be serving very different content, so we get less
66
# - we avoid locking on every cache lookup.
67
_thread_caches = threading.local()
69
_thread_caches.page_cache = None
72
"""Get the per-thread page cache.
74
We need a function to do this because in a new thread the _thread_caches
75
threading.local object does not have the cache initialized yet.
77
page_cache = getattr(_thread_caches, 'page_cache', None)
78
if page_cache is None:
79
# We are caching bytes so len(value) is perfectly accurate
80
page_cache = lru_cache.LRUSizeCache(_PAGE_CACHE_SIZE)
81
_thread_caches.page_cache = page_cache
66
89
# If a ChildNode falls below this many bytes, we check for a remap
67
90
_INTERESTING_NEW_SIZE = 50
68
91
# If a ChildNode shrinks by more than this amount, we check for a remap
69
92
_INTERESTING_SHRINKAGE_LIMIT = 20
70
# If we delete more than this many nodes applying a delta, we check for a remap
71
_INTERESTING_DELETES_LIMIT = 5
74
95
def _search_key_plain(key):
83
104
class CHKMap(object):
84
105
"""A persistent map from string to string backed by a CHK store."""
107
__slots__ = ('_store', '_root_node', '_search_key_func')
86
109
def __init__(self, store, root_key, search_key_func=None):
87
110
"""Create a CHKMap object.
110
133
into the map; if old_key is not None, then the old mapping
111
134
of old_key is removed.
114
137
# Check preconditions first.
115
new_items = set([key for (old, key, value) in delta if key is not None
138
as_st = StaticTuple.from_sequence
139
new_items = set([as_st(key) for (old, key, value) in delta
140
if key is not None and old is None])
117
141
existing_new = list(self.iteritems(key_filter=new_items))
119
143
raise errors.InconsistentDeltaDelta(delta,
122
146
for old, new, value in delta:
123
147
if old is not None and old != new:
124
148
self.unmap(old, check_remap=False)
126
150
for old, new, value in delta:
127
151
if new is not None:
128
152
self.map(new, value)
129
if delete_count > _INTERESTING_DELETES_LIMIT:
130
trace.mutter("checking remap as %d deletions", delete_count)
131
154
self._check_remap()
132
155
return self._save()
134
157
def _ensure_root(self):
135
158
"""Ensure that the root node is an object not a key."""
136
if type(self._root_node) is tuple:
159
if type(self._root_node) is StaticTuple:
137
160
# Demand-load the root
138
161
self._root_node = self._get_node(self._root_node)
147
170
:param node: A tuple key or node object.
148
171
:return: A node object.
150
if type(node) is tuple:
173
if type(node) is StaticTuple:
151
174
bytes = self._read_bytes(node)
152
175
return _deserialise(bytes, node,
153
176
search_key_func=self._search_key_func)
157
180
def _read_bytes(self, key):
159
return _page_cache[key]
182
return _get_cache()[key]
161
184
stream = self._store.get_record_stream([key], 'unordered', True)
162
185
bytes = stream.next().get_bytes_as('fulltext')
163
_page_cache[key] = bytes
186
_get_cache()[key] = bytes
166
189
def _dump_tree(self, include_keys=False):
194
217
for key, value in sorted(node._items.iteritems()):
195
218
# Don't use prefix nor indent here to line up when used in
196
219
# tests in conjunction with assertEqualDiff
197
result.append(' %r %r' % (key, value))
220
result.append(' %r %r' % (tuple(key), value))
218
241
root_key = klass._create_directly(store, initial_value,
219
242
maximum_size=maximum_size, key_width=key_width,
220
243
search_key_func=search_key_func)
244
if type(root_key) is not StaticTuple:
245
raise AssertionError('we got a %s instead of a StaticTuple'
238
264
node = LeafNode(search_key_func=search_key_func)
239
265
node.set_maximum_size(maximum_size)
240
266
node._key_width = key_width
241
node._items = dict(initial_value)
267
as_st = StaticTuple.from_sequence
268
node._items = dict([(as_st(key), val) for key, val
269
in initial_value.iteritems()])
242
270
node._raw_size = sum([node._key_value_len(key, value)
243
for key,value in initial_value.iteritems()])
271
for key,value in node._items.iteritems()])
244
272
node._len = len(node._items)
245
273
node._compute_search_prefix()
246
274
node._compute_serialised_prefix()
482
510
def iteritems(self, key_filter=None):
483
511
"""Iterate over the entire CHKMap's contents."""
484
512
self._ensure_root()
513
if key_filter is not None:
514
as_st = StaticTuple.from_sequence
515
key_filter = [as_st(key) for key in key_filter]
485
516
return self._root_node.iteritems(self._store, key_filter=key_filter)
488
519
"""Return the key for this map."""
489
if type(self._root_node) is tuple:
520
if type(self._root_node) is StaticTuple:
490
521
return self._root_node
492
523
return self._root_node._key
501
532
:param key: A key to map.
502
533
:param value: The value to assign to key.
535
key = StaticTuple.from_sequence(key)
504
536
# Need a root object.
505
537
self._ensure_root()
506
538
prefix, node_details = self._root_node.map(self._store, key, value)
517
549
def _node_key(self, node):
518
550
"""Get the key for a node whether it's a tuple or node."""
519
551
if type(node) is tuple:
552
node = StaticTuple.from_sequence(node)
553
if type(node) is StaticTuple:
524
558
def unmap(self, key, check_remap=True):
525
559
"""remove key from the map."""
560
key = StaticTuple.from_sequence(key)
526
561
self._ensure_root()
527
562
if type(self._root_node) is InternalNode:
528
563
unmapped = self._root_node.unmap(self._store, key,
535
570
"""Check if nodes can be collapsed."""
536
571
self._ensure_root()
537
572
if type(self._root_node) is InternalNode:
538
self._root_node._check_remap(self._store)
573
self._root_node = self._root_node._check_remap(self._store)
541
576
"""Save the map completely.
543
578
:return: The key of the root node.
545
if type(self._root_node) is tuple:
580
if type(self._root_node) is StaticTuple:
547
582
return self._root_node
548
583
keys = list(self._root_node.serialise(self._store))
556
591
adding the header bytes, and without prefix compression.
594
__slots__ = ('_key', '_len', '_maximum_size', '_key_width',
595
'_raw_size', '_items', '_search_prefix', '_search_key_func'
559
598
def __init__(self, key_width=1):
560
599
"""Create a node.
650
689
the key/value pairs.
692
__slots__ = ('_common_serialised_prefix',)
653
694
def __init__(self, search_key_func=None):
654
695
Node.__init__(self)
655
696
# All of the keys in this leaf node share this common prefix
656
697
self._common_serialised_prefix = None
657
self._serialise_key = '\x00'.join
658
698
if search_key_func is None:
659
699
self._search_key_func = _search_key_plain
698
738
:param bytes: The bytes of the node.
699
739
:param key: The key that the serialised node has.
741
key = static_tuple.expect_static_tuple(key)
701
742
return _deserialise_leaf_node(bytes, key,
702
743
search_key_func=search_key_func)
843
884
raise AssertionError('%r must be known' % self._search_prefix)
844
885
return self._search_prefix, [("", self)]
887
_serialise_key = '\x00'.join
846
889
def serialise(self, store):
847
890
"""Serialise the LeafNode to store.
873
916
lines.append(serialized[prefix_len:])
874
917
lines.extend(value_lines)
875
918
sha1, _, _ = store.add_lines((None,), (), lines)
876
self._key = ("sha1:" + sha1,)
919
self._key = StaticTuple("sha1:" + sha1,).intern()
877
920
bytes = ''.join(lines)
878
921
if len(bytes) != self._current_size():
879
922
raise AssertionError('Invalid _current_size')
880
_page_cache.add(self._key, bytes)
923
_get_cache().add(self._key, bytes)
881
924
return [self._key]
947
990
LeafNode or InternalNode.
993
__slots__ = ('_node_width',)
950
995
def __init__(self, prefix='', search_key_func=None):
951
996
Node.__init__(self)
952
997
# The size of an internalnode with default values and no children.
994
1039
:param key: The key that the serialised node has.
995
1040
:return: An InternalNode instance.
1042
key = static_tuple.expect_static_tuple(key)
997
1043
return _deserialise_internal_node(bytes, key,
998
1044
search_key_func=search_key_func)
1024
1070
# for whatever we are missing
1025
1071
shortcut = True
1026
1072
for prefix, node in self._items.iteritems():
1027
if node.__class__ is tuple:
1073
if node.__class__ is StaticTuple:
1028
1074
keys[node] = (prefix, None)
1030
1076
yield node, None
1059
1105
# A given key can only match 1 child node, if it isn't
1060
1106
# there, then we can just return nothing
1062
if node.__class__ is tuple:
1108
if node.__class__ is StaticTuple:
1063
1109
keys[node] = (search_prefix, [key])
1065
1111
# This is loaded, and the only thing that can match,
1092
1138
# We can ignore this one
1094
1140
node_key_filter = prefix_to_keys[search_prefix]
1095
if node.__class__ is tuple:
1141
if node.__class__ is StaticTuple:
1096
1142
keys[node] = (search_prefix, node_key_filter)
1098
1144
yield node, node_key_filter
1107
1153
if sub_prefix in length_filter:
1108
1154
node_key_filter.extend(prefix_to_keys[sub_prefix])
1109
1155
if node_key_filter: # this key matched something, yield it
1110
if node.__class__ is tuple:
1156
if node.__class__ is StaticTuple:
1111
1157
keys[node] = (prefix, node_key_filter)
1113
1159
yield node, node_key_filter
1147
1193
prefix, node_key_filter = keys[record.key]
1148
1194
node_and_filters.append((node, node_key_filter))
1149
1195
self._items[prefix] = node
1150
_page_cache.add(record.key, bytes)
1196
_get_cache().add(record.key, bytes)
1151
1197
for info in node_and_filters:
1262
1308
lines.append('%s\n' % (self._search_prefix,))
1263
1309
prefix_len = len(self._search_prefix)
1264
1310
for prefix, node in sorted(self._items.items()):
1265
if type(node) is tuple:
1311
if type(node) is StaticTuple:
1268
1314
key = node._key[0]
1272
1318
% (serialised, self._search_prefix))
1273
1319
lines.append(serialised[prefix_len:])
1274
1320
sha1, _, _ = store.add_lines((None,), (), lines)
1275
self._key = ("sha1:" + sha1,)
1276
_page_cache.add(self._key, ''.join(lines))
1321
self._key = StaticTuple("sha1:" + sha1,).intern()
1322
_get_cache().add(self._key, ''.join(lines))
1277
1323
yield self._key
1279
1325
def _search_key(self, key):
1428
1474
def __init__(self, store, new_root_keys, old_root_keys,
1429
1475
search_key_func, pb=None):
1476
# TODO: Should we add a StaticTuple barrier here? It would be nice to
1477
# force callers to use StaticTuple, because there will often be
1478
# lots of keys passed in here. And even if we cast it locally,
1479
# that just meanst that we will have *both* a StaticTuple and a
1480
# tuple() in memory, referring to the same object. (so a net
1481
# increase in memory, not a decrease.)
1430
1482
self._store = store
1431
1483
self._new_root_keys = new_root_keys
1432
1484
self._old_root_keys = old_root_keys
1434
1486
# All uninteresting chks that we have seen. By the time they are added
1435
1487
# here, they should be either fully ignored, or queued up for
1489
# TODO: This might grow to a large size if there are lots of merge
1490
# parents, etc. However, it probably doesn't scale to O(history)
1491
# like _processed_new_refs does.
1437
1492
self._all_old_chks = set(self._old_root_keys)
1438
1493
# All items that we have seen from the old_root_keys
1439
1494
self._all_old_items = set()
1440
1495
# These are interesting items which were either read, or already in the
1441
1496
# interesting queue (so we don't need to walk them again)
1497
# TODO: processed_new_refs becomes O(all_chks), consider switching to
1442
1499
self._processed_new_refs = set()
1443
1500
self._search_key_func = search_key_func
1451
1508
self._state = None
1453
1510
def _read_nodes_from_store(self, keys):
1454
# We chose not to use _page_cache, because we think in terms of records
1455
# to be yielded. Also, we expect to touch each page only 1 time during
1456
# this code. (We may want to evaluate saving the raw bytes into the
1457
# page cache, which would allow a working tree update after the fetch
1458
# to not have to read the bytes again.)
1511
# We chose not to use _get_cache(), because we think in
1512
# terms of records to be yielded. Also, we expect to touch each page
1513
# only 1 time during this code. (We may want to evaluate saving the
1514
# raw bytes into the page cache, which would allow a working tree
1515
# update after the fetch to not have to read the bytes again.)
1516
as_st = StaticTuple.from_sequence
1459
1517
stream = self._store.get_record_stream(keys, 'unordered', True)
1460
1518
for record in stream:
1461
1519
if self._pb is not None:
1468
1526
if type(node) is InternalNode:
1469
1527
# Note we don't have to do node.refs() because we know that
1470
1528
# there are no children that have been pushed into this node
1529
# Note: Using as_st() here seemed to save 1.2MB, which would
1530
# indicate that we keep 100k prefix_refs around while
1531
# processing. They *should* be shorter lived than that...
1532
# It does cost us ~10s of processing time
1533
#prefix_refs = [as_st(item) for item in node._items.iteritems()]
1471
1534
prefix_refs = node._items.items()
1474
1537
prefix_refs = []
1538
# Note: We don't use a StaticTuple here. Profiling showed a
1539
# minor memory improvement (0.8MB out of 335MB peak 0.2%)
1540
# But a significant slowdown (15s / 145s, or 10%)
1475
1541
items = node._items.items()
1476
1542
yield record, node, prefix_refs, items
1485
1551
if p_r[1] not in all_old_chks]
1486
1552
new_refs = [p_r[1] for p_r in prefix_refs]
1487
1553
all_old_chks.update(new_refs)
1554
# TODO: This might be a good time to turn items into StaticTuple
1555
# instances and possibly intern them. However, this does not
1556
# impact 'initial branch' performance, so I'm not worrying
1488
1558
self._all_old_items.update(items)
1489
1559
# Queue up the uninteresting references
1490
1560
# Don't actually put them in the 'to-read' queue until we have
1543
1613
# current design allows for this, as callers will do the work
1544
1614
# to make the results unique. We might profile whether we
1545
1615
# gain anything by ensuring unique return values for items
1616
# TODO: This might be a good time to cast to StaticTuple, as
1617
# self._new_item_queue will hold the contents of multiple
1618
# records for an extended lifetime
1546
1619
new_items = [item for item in items
1547
1620
if item not in self._all_old_items]
1548
1621
self._new_item_queue.extend(new_items)
1574
1647
yield None, new_items
1575
1648
refs = refs.difference(all_old_chks)
1649
processed_new_refs.update(refs)
1651
# TODO: Using a SimpleSet for self._processed_new_refs and
1652
# saved as much as 10MB of peak memory. However, it requires
1653
# implementing a non-pyrex version.
1577
1654
next_refs = set()
1578
1655
next_refs_update = next_refs.update
1579
1656
# Inlining _read_nodes_from_store improves 'bzr branch bzr.dev'
1580
1657
# from 1m54s to 1m51s. Consider it.
1581
1658
for record, _, p_refs, items in self._read_nodes_from_store(refs):
1582
items = [item for item in items
1583
if item not in all_old_items]
1660
# using the 'if' check saves about 145s => 141s, when
1661
# streaming initial branch of Launchpad data.
1662
items = [item for item in items
1663
if item not in all_old_items]
1584
1664
yield record, items
1585
1665
next_refs_update([p_r[1] for p_r in p_refs])
1667
# set1.difference(set/dict) walks all of set1, and checks if it
1668
# exists in 'other'.
1669
# set1.difference(iterable) walks all of iterable, and does a
1670
# 'difference_update' on a clone of set1. Pick wisely based on the
1671
# expected sizes of objects.
1672
# in our case it is expected that 'new_refs' will always be quite
1586
1674
next_refs = next_refs.difference(all_old_chks)
1587
1675
next_refs = next_refs.difference(processed_new_refs)
1588
1676
processed_new_refs.update(next_refs)
1595
1683
self._old_queue = []
1596
1684
all_old_chks = self._all_old_chks
1597
1685
for record, _, prefix_refs, items in self._read_nodes_from_store(refs):
1686
# TODO: Use StaticTuple here?
1598
1687
self._all_old_items.update(items)
1599
1688
refs = [r for _,r in prefix_refs if r not in all_old_chks]
1600
1689
self._old_queue.extend(refs)
1637
1726
from bzrlib._chk_map_pyx import (
1638
1728
_search_key_16,
1639
1729
_search_key_255,
1640
1730
_deserialise_leaf_node,
1641
1731
_deserialise_internal_node,
1733
except ImportError, e:
1734
osutils.failed_to_load_extension(e)
1644
1735
from bzrlib._chk_map_py import (
1645
1737
_search_key_16,
1646
1738
_search_key_255,
1647
1739
_deserialise_leaf_node,
1650
1742
search_key_registry.register('hash-16-way', _search_key_16)
1651
1743
search_key_registry.register('hash-255-way', _search_key_255)
1746
def _check_key(key):
1747
"""Helper function to assert that a key is properly formatted.
1749
This generally shouldn't be used in production code, but it can be helpful
1752
if type(key) is not StaticTuple:
1753
raise TypeError('key %r is not StaticTuple but %s' % (key, type(key)))
1755
raise ValueError('key %r should have length 1, not %d' % (key, len(key),))
1756
if type(key[0]) is not str:
1757
raise TypeError('key %r should hold a str, not %r'
1758
% (key, type(key[0])))
1759
if not key[0].startswith('sha1:'):
1760
raise ValueError('key %r should point to a sha1:' % (key,))
added
removed
bzrlib/chk_map.py
