← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_btree_index.py

  • Committer: John Arbash Meinel
  • Date: 2010-01-13 16:23:07 UTC
  • mto: (4634.119.7 2.0)
  • mto: This revision was merged to the branch mainline in revision 4959.
  • Revision ID: john@arbash-meinel.com-20100113162307-0bs82td16gzih827
Update the MANIFEST.in file.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_btree_index.py
1
 
# Copyright (C) 2008, 2009, 2010 Canonical Ltd
 
1
# Copyright (C) 2008, 2009 Canonical Ltd
2
2
#
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
43
43
        condition_isinstance(TestBTreeNodes))
44
44
    import bzrlib._btree_serializer_py as py_module
45
45
    scenarios = [('python', {'parse_btree': py_module})]
46
 
    if compiled_btreeparser_feature.available():
47
 
        scenarios.append(('C', {'parse_btree':
48
 
                                compiled_btreeparser_feature.module}))
 
46
    if CompiledBtreeParserFeature.available():
 
47
        # Is there a way to do this that gets missing feature failures rather
 
48
        # than no indication to the user?
 
49
        import bzrlib._btree_serializer_pyx as c_module
 
50
        scenarios.append(('C', {'parse_btree': c_module}))
49
51
    return multiply_tests(node_tests, scenarios, others)
50
52
 
51
53
 
52
 
compiled_btreeparser_feature = tests.ModuleAvailableFeature(
53
 
                                'bzrlib._btree_serializer_pyx')
 
54
class _CompiledBtreeParserFeature(tests.Feature):
 
55
    def _probe(self):
 
56
        try:
 
57
            import bzrlib._btree_serializer_pyx
 
58
        except ImportError:
 
59
            return False
 
60
        return True
 
61
 
 
62
    def feature_name(self):
 
63
        return 'bzrlib._btree_serializer_pyx'
 
64
 
 
65
CompiledBtreeParserFeature = _CompiledBtreeParserFeature()
54
66
 
55
67
 
56
68
class BTreeTestCase(TestCaseWithTransport):
59
71
 
60
72
    def setUp(self):
61
73
        TestCaseWithTransport.setUp(self)
62
 
        self.overrideAttr(btree_index, '_RESERVED_HEADER_BYTES', 100)
 
74
        self._original_header = btree_index._RESERVED_HEADER_BYTES
 
75
        def restore():
 
76
            btree_index._RESERVED_HEADER_BYTES = self._original_header
 
77
        self.addCleanup(restore)
 
78
        btree_index._RESERVED_HEADER_BYTES = 100
63
79
 
64
80
    def make_nodes(self, count, key_elements, reference_lists):
65
81
        """Generate count*key_elements sample nodes."""
99
115
 
100
116
    def shrink_page_size(self):
101
117
        """Shrink the default page size so that less fits in a page."""
102
 
        self.overrideAttr(btree_index, '_PAGE_SIZE')
 
118
        old_page_size = btree_index._PAGE_SIZE
 
119
        def cleanup():
 
120
            btree_index._PAGE_SIZE = old_page_size
 
121
        self.addCleanup(cleanup)
103
122
        btree_index._PAGE_SIZE = 2048
104
123
 
105
124
 
106
125
class TestBTreeBuilder(BTreeTestCase):
107
126
 
108
 
    def test_clear_cache(self):
109
 
        builder = btree_index.BTreeBuilder(reference_lists=0, key_elements=1)
110
 
        # This is a no-op, but we need the api to be consistent with other
111
 
        # BTreeGraphIndex apis.
112
 
        builder.clear_cache()
113
 
 
114
127
    def test_empty_1_0(self):
115
128
        builder = btree_index.BTreeBuilder(key_elements=1, reference_lists=0)
116
129
        # NamedTemporaryFile dies on builder.finish().read(). weird.
142
155
        temp_file = builder.finish()
143
156
        content = temp_file.read()
144
157
        del temp_file
145
 
        self.assertEqual(131, len(content))
 
158
        self.assertEqual(158, len(content))
146
159
        self.assertEqual(
147
160
            "B+Tree Graph Index 2\nnode_ref_lists=0\nkey_elements=1\nlen=5\n"
148
161
            "row_lengths=1\n",
166
179
        temp_file = builder.finish()
167
180
        content = temp_file.read()
168
181
        del temp_file
169
 
        self.assertEqual(238, len(content))
 
182
        self.assertEqual(264, len(content))
170
183
        self.assertEqual(
171
184
            "B+Tree Graph Index 2\nnode_ref_lists=2\nkey_elements=2\nlen=10\n"
172
185
            "row_lengths=1\n",
232
245
        temp_file = builder.finish()
233
246
        content = temp_file.read()
234
247
        del temp_file
235
 
        self.assertEqual(155, len(content))
 
248
        self.assertEqual(181, len(content))
236
249
        self.assertEqual(
237
250
            "B+Tree Graph Index 2\nnode_ref_lists=0\nkey_elements=1\nlen=10\n"
238
251
            "row_lengths=1\n",
340
353
        # Test the parts of the index that take up memory are doing so
341
354
        # predictably.
342
355
        self.assertEqual(1, len(builder._nodes))
 
356
        self.assertEqual(1, len(builder._keys))
343
357
        self.assertIs(None, builder._nodes_by_key)
344
358
        builder.add_node(*nodes[1])
345
359
        self.assertEqual(0, len(builder._nodes))
 
360
        self.assertEqual(0, len(builder._keys))
346
361
        self.assertIs(None, builder._nodes_by_key)
347
362
        self.assertEqual(1, len(builder._backing_indices))
348
363
        self.assertEqual(2, builder._backing_indices[0].key_count())
349
364
        # now back to memory
350
365
        builder.add_node(*nodes[2])
351
366
        self.assertEqual(1, len(builder._nodes))
 
367
        self.assertEqual(1, len(builder._keys))
352
368
        self.assertIs(None, builder._nodes_by_key)
353
369
        # And spills to a second backing index combing all
354
370
        builder.add_node(*nodes[3])
355
371
        self.assertEqual(0, len(builder._nodes))
 
372
        self.assertEqual(0, len(builder._keys))
356
373
        self.assertIs(None, builder._nodes_by_key)
357
374
        self.assertEqual(2, len(builder._backing_indices))
358
375
        self.assertEqual(None, builder._backing_indices[0])
361
378
        builder.add_node(*nodes[4])
362
379
        builder.add_node(*nodes[5])
363
380
        self.assertEqual(0, len(builder._nodes))
 
381
        self.assertEqual(0, len(builder._keys))
364
382
        self.assertIs(None, builder._nodes_by_key)
365
383
        self.assertEqual(2, len(builder._backing_indices))
366
384
        self.assertEqual(2, builder._backing_indices[0].key_count())
424
442
        # Test the parts of the index that take up memory are doing so
425
443
        # predictably.
426
444
        self.assertEqual(1, len(builder._nodes))
 
445
        self.assertEqual(1, len(builder._keys))
427
446
        self.assertIs(None, builder._nodes_by_key)
428
447
        builder.add_node(*nodes[1])
429
448
        self.assertEqual(0, len(builder._nodes))
 
449
        self.assertEqual(0, len(builder._keys))
430
450
        self.assertIs(None, builder._nodes_by_key)
431
451
        self.assertEqual(1, len(builder._backing_indices))
432
452
        self.assertEqual(2, builder._backing_indices[0].key_count())
433
453
        # now back to memory
434
454
        builder.add_node(*nodes[2])
435
455
        self.assertEqual(1, len(builder._nodes))
 
456
        self.assertEqual(1, len(builder._keys))
436
457
        self.assertIs(None, builder._nodes_by_key)
437
458
        # And spills to a second backing index but doesn't combine
438
459
        builder.add_node(*nodes[3])
439
460
        self.assertEqual(0, len(builder._nodes))
 
461
        self.assertEqual(0, len(builder._keys))
440
462
        self.assertIs(None, builder._nodes_by_key)
441
463
        self.assertEqual(2, len(builder._backing_indices))
442
464
        for backing_index in builder._backing_indices:
445
467
        builder.add_node(*nodes[4])
446
468
        builder.add_node(*nodes[5])
447
469
        self.assertEqual(0, len(builder._nodes))
 
470
        self.assertEqual(0, len(builder._keys))
448
471
        self.assertIs(None, builder._nodes_by_key)
449
472
        self.assertEqual(3, len(builder._backing_indices))
450
473
        for backing_index in builder._backing_indices:
509
532
        builder.add_node(*nodes[0])
510
533
        # Test the parts of the index that take up memory are doing so
511
534
        # predictably.
 
535
        self.assertEqual(1, len(builder._keys))
512
536
        self.assertEqual(1, len(builder._nodes))
513
537
        self.assertIs(None, builder._nodes_by_key)
514
538
        builder.add_node(*nodes[1])
 
539
        self.assertEqual(0, len(builder._keys))
515
540
        self.assertEqual(0, len(builder._nodes))
516
541
        self.assertIs(None, builder._nodes_by_key)
517
542
        self.assertEqual(1, len(builder._backing_indices))
520
545
        old = dict(builder._get_nodes_by_key()) #Build up the nodes by key dict
521
546
        builder.add_node(*nodes[2])
522
547
        self.assertEqual(1, len(builder._nodes))
 
548
        self.assertEqual(1, len(builder._keys))
523
549
        self.assertIsNot(None, builder._nodes_by_key)
524
550
        self.assertNotEqual({}, builder._nodes_by_key)
525
551
        # We should have a new entry
527
553
        # And spills to a second backing index combing all
528
554
        builder.add_node(*nodes[3])
529
555
        self.assertEqual(0, len(builder._nodes))
 
556
        self.assertEqual(0, len(builder._keys))
530
557
        self.assertIs(None, builder._nodes_by_key)
531
558
        self.assertEqual(2, len(builder._backing_indices))
532
559
        self.assertEqual(None, builder._backing_indices[0])
535
562
        builder.add_node(*nodes[4])
536
563
        builder.add_node(*nodes[5])
537
564
        self.assertEqual(0, len(builder._nodes))
 
565
        self.assertEqual(0, len(builder._keys))
538
566
        self.assertIs(None, builder._nodes_by_key)
539
567
        self.assertEqual(2, len(builder._backing_indices))
540
568
        self.assertEqual(2, builder._backing_indices[0].key_count())
611
639
        size = trans.put_file('index', stream)
612
640
        return btree_index.BTreeGraphIndex(trans, 'index', size)
613
641
 
614
 
    def make_index_with_offset(self, ref_lists=1, key_elements=1, nodes=[],
615
 
                               offset=0):
616
 
        builder = btree_index.BTreeBuilder(key_elements=key_elements,
617
 
                                           reference_lists=ref_lists)
618
 
        builder.add_nodes(nodes)
619
 
        transport = self.get_transport('')
620
 
        # NamedTemporaryFile dies on builder.finish().read(). weird.
621
 
        temp_file = builder.finish()
622
 
        content = temp_file.read()
623
 
        del temp_file
624
 
        size = len(content)
625
 
        transport.put_bytes('index', (' '*offset)+content)
626
 
        return btree_index.BTreeGraphIndex(transport, 'index', size=size,
627
 
                                           offset=offset)
628
 
 
629
 
    def test_clear_cache(self):
630
 
        nodes = self.make_nodes(160, 2, 2)
631
 
        index = self.make_index(ref_lists=2, key_elements=2, nodes=nodes)
632
 
        self.assertEqual(1, len(list(index.iter_entries([nodes[30][0]]))))
633
 
        self.assertEqual([1, 4], index._row_lengths)
634
 
        self.assertIsNot(None, index._root_node)
635
 
        internal_node_pre_clear = index._internal_node_cache.keys()
636
 
        self.assertTrue(len(index._leaf_node_cache) > 0)
637
 
        index.clear_cache()
638
 
        # We don't touch _root_node or _internal_node_cache, both should be
639
 
        # small, and can save a round trip or two
640
 
        self.assertIsNot(None, index._root_node)
641
 
        # NOTE: We don't want to affect the _internal_node_cache, as we expect
642
 
        #       it will be small, and if we ever do touch this index again, it
643
 
        #       will save round-trips.  This assertion isn't very strong,
644
 
        #       becuase without a 3-level index, we don't have any internal
645
 
        #       nodes cached.
646
 
        self.assertEqual(internal_node_pre_clear,
647
 
                         index._internal_node_cache.keys())
648
 
        self.assertEqual(0, len(index._leaf_node_cache))
649
 
 
650
642
    def test_trivial_constructor(self):
651
643
        transport = get_transport('trace+' + self.get_url(''))
652
644
        index = btree_index.BTreeGraphIndex(transport, 'index', None)
699
691
        # The entire index should have been read, as it is one page long.
700
692
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
701
693
            transport._activity)
702
 
        self.assertEqual(1173, size)
703
 
 
704
 
    def test_with_offset_no_size(self):
705
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
706
 
                                            offset=1234,
707
 
                                            nodes=self.make_nodes(200, 1, 1))
708
 
        index._size = None # throw away the size info
709
 
        self.assertEqual(200, index.key_count())
710
 
 
711
 
    def test_with_small_offset(self):
712
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
713
 
                                            offset=1234,
714
 
                                            nodes=self.make_nodes(200, 1, 1))
715
 
        self.assertEqual(200, index.key_count())
716
 
 
717
 
    def test_with_large_offset(self):
718
 
        index = self.make_index_with_offset(key_elements=1, ref_lists=1,
719
 
                                            offset=123456,
720
 
                                            nodes=self.make_nodes(200, 1, 1))
721
 
        self.assertEqual(200, index.key_count())
 
694
        self.assertEqual(1199, size)
722
695
 
723
696
    def test__read_nodes_no_size_one_page_reads_once(self):
724
697
        self.make_index(nodes=[(('key',), 'value', ())])
772
745
        # The entire index should have been read linearly.
773
746
        self.assertEqual([('readv', 'index', [(0, size)], False, None)],
774
747
            transport._activity)
775
 
        self.assertEqual(1488, size)
 
748
        self.assertEqual(1514, size)
776
749
 
777
750
    def test_validate_two_pages(self):
778
751
        builder = btree_index.BTreeBuilder(key_elements=2, reference_lists=2)
1184
1157
 
1185
1158
class TestBTreeNodes(BTreeTestCase):
1186
1159
 
 
1160
    def restore_parser(self):
 
1161
        btree_index._btree_serializer = self.saved_parser
 
1162
 
1187
1163
    def setUp(self):
1188
1164
        BTreeTestCase.setUp(self)
1189
 
        self.overrideAttr(btree_index, '_btree_serializer', self.parse_btree)
 
1165
        self.saved_parser = btree_index._btree_serializer
 
1166
        self.addCleanup(self.restore_parser)
 
1167
        btree_index._btree_serializer = self.parse_btree
1190
1168
 
1191
1169
    def test_LeafNode_1_0(self):
1192
1170
        node_bytes = ("type=leaf\n"
1303
1281
    def test_exists(self):
1304
1282
        # This is just to let the user know if they don't have the feature
1305
1283
        # available
1306
 
        self.requireFeature(compiled_btreeparser_feature)
 
1284
        self.requireFeature(CompiledBtreeParserFeature)
1307
1285
 
1308
1286
 
1309
1287
class TestMultiBisectRight(tests.TestCase):