/brz/remove-bazaar

To get this branch, use:
bzr branch http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_dirstate.py

  • Committer: Ian Clatworthy
  • Date: 2007-06-06 06:11:58 UTC
  • mto: This revision was merged to the branch mainline in revision 2513.
  • Revision ID: ian.clatworthy@internode.on.net-20070606061158-zbwatmjd2m1p474g
remove implicit read locks for kind() and is_executable() in wt4

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
# Copyright (C) 2006-2010 Canonical Ltd
 
1
# Copyright (C) 2006, 2007 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
12
12
#
13
13
# You should have received a copy of the GNU General Public License
14
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
 
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
16
16
 
17
17
"""Tests of the dirstate functionality being built for WorkingTreeFormat4."""
18
18
 
19
19
import bisect
20
20
import os
 
21
import time
21
22
 
22
23
from bzrlib import (
23
24
    dirstate,
24
25
    errors,
25
 
    inventory,
26
 
    memorytree,
27
26
    osutils,
28
 
    revision as _mod_revision,
29
 
    tests,
30
27
    )
31
 
from bzrlib.tests import test_osutils
 
28
from bzrlib.memorytree import MemoryTree
 
29
from bzrlib.osutils import has_symlinks
 
30
from bzrlib.tests import (
 
31
        TestCase,
 
32
        TestCaseWithTransport,
 
33
        TestSkipped,
 
34
        )
32
35
 
33
36
 
34
37
# TODO:
44
47
# set_path_id  setting id when state is in memory modified
45
48
 
46
49
 
47
 
def load_tests(basic_tests, module, loader):
48
 
    suite = loader.suiteClass()
49
 
    dir_reader_tests, remaining_tests = tests.split_suite_by_condition(
50
 
        basic_tests, tests.condition_isinstance(TestCaseWithDirState))
51
 
    tests.multiply_tests(dir_reader_tests,
52
 
                         test_osutils.dir_reader_scenarios(), suite)
53
 
    suite.addTest(remaining_tests)
54
 
    return suite
55
 
 
56
 
 
57
 
class TestCaseWithDirState(tests.TestCaseWithTransport):
 
50
class TestCaseWithDirState(TestCaseWithTransport):
58
51
    """Helper functions for creating DirState objects with various content."""
59
52
 
60
 
    # Set by load_tests
61
 
    _dir_reader_class = None
62
 
    _native_to_unicode = None # Not used yet
63
 
 
64
 
    def setUp(self):
65
 
        tests.TestCaseWithTransport.setUp(self)
66
 
 
67
 
        self.overrideAttr(osutils,
68
 
                          '_selected_dir_reader', self._dir_reader_class())
69
 
 
70
53
    def create_empty_dirstate(self):
71
54
        """Return a locked but empty dirstate"""
72
55
        state = dirstate.DirState.initialize('dirstate')
180
163
        """
181
164
        # The state should already be write locked, since we just had to do
182
165
        # some operation to get here.
183
 
        self.assertTrue(state._lock_token is not None)
 
166
        assert state._lock_token is not None
184
167
        try:
185
168
            self.assertEqual(expected_result[0],  state.get_parent_ids())
186
169
            # there should be no ghosts in this tree.
206
189
              c
207
190
              d/
208
191
                e
209
 
            b-c
210
192
            f
211
193
        """
212
194
        tree = self.make_branch_and_tree('tree')
213
 
        paths = ['a', 'b/', 'b/c', 'b/d/', 'b/d/e', 'b-c', 'f']
214
 
        file_ids = ['a-id', 'b-id', 'c-id', 'd-id', 'e-id', 'b-c-id', 'f-id']
 
195
        paths = ['a', 'b/', 'b/c', 'b/d/', 'b/d/e', 'f']
 
196
        file_ids = ['a-id', 'b-id', 'c-id', 'd-id', 'e-id', 'f-id']
215
197
        self.build_tree(['tree/' + p for p in paths])
216
198
        tree.set_root_id('TREE_ROOT')
217
199
        tree.add([p.rstrip('/') for p in paths], file_ids)
218
200
        tree.commit('initial', rev_id='rev-1')
219
201
        revision_id = 'rev-1'
220
202
        # a_packed_stat = dirstate.pack_stat(os.stat('tree/a'))
221
 
        t = self.get_transport('tree')
 
203
        t = self.get_transport().clone('tree')
222
204
        a_text = t.get_bytes('a')
223
205
        a_sha = osutils.sha_string(a_text)
224
206
        a_len = len(a_text)
232
214
        e_text = t.get_bytes('b/d/e')
233
215
        e_sha = osutils.sha_string(e_text)
234
216
        e_len = len(e_text)
235
 
        b_c_text = t.get_bytes('b-c')
236
 
        b_c_sha = osutils.sha_string(b_c_text)
237
 
        b_c_len = len(b_c_text)
238
217
        # f_packed_stat = dirstate.pack_stat(os.stat('tree/f'))
239
218
        f_text = t.get_bytes('f')
240
219
        f_sha = osutils.sha_string(f_text)
265
244
                      ('f', '', 0, False, null_stat),
266
245
                      ('f', e_sha, e_len, False, revision_id),
267
246
                     ]),
268
 
            'b-c':(('', 'b-c', 'b-c-id'), [
269
 
                      ('f', '', 0, False, null_stat),
270
 
                      ('f', b_c_sha, b_c_len, False, revision_id),
271
 
                     ]),
272
247
            'f':(('', 'f', 'f-id'), [
273
248
                  ('f', '', 0, False, null_stat),
274
249
                  ('f', f_sha, f_len, False, revision_id),
301
276
        tree, state, expected = self.create_basic_dirstate()
302
277
        # Now we will just remove and add every file so we get an extra entry
303
278
        # per entry. Unversion in reverse order so we handle subdirs
304
 
        tree.unversion(['f-id', 'b-c-id', 'e-id', 'd-id', 'c-id', 'b-id', 'a-id'])
305
 
        tree.add(['a', 'b', 'b/c', 'b/d', 'b/d/e', 'b-c', 'f'],
306
 
                 ['a-id2', 'b-id2', 'c-id2', 'd-id2', 'e-id2', 'b-c-id2', 'f-id2'])
 
279
        tree.unversion(['f-id', 'e-id', 'd-id', 'c-id', 'b-id', 'a-id'])
 
280
        tree.add(['a', 'b', 'b/c', 'b/d', 'b/d/e', 'f'],
 
281
                 ['a-id2', 'b-id2', 'c-id2', 'd-id2', 'e-id2', 'f-id2'])
307
282
 
308
283
        # Update the expected dictionary.
309
 
        for path in ['a', 'b', 'b/c', 'b/d', 'b/d/e', 'b-c', 'f']:
 
284
        for path in ['a', 'b', 'b/c', 'b/d', 'b/d/e', 'f']:
310
285
            orig = expected[path]
311
286
            path2 = path + '2'
312
287
            # This record was deleted in the current tree
369
344
            state.lock_read()
370
345
        return tree, state, expected
371
346
 
372
 
 
373
347
class TestTreeToDirState(TestCaseWithDirState):
374
348
 
375
349
    def test_empty_to_dirstate(self):
377
351
        # There are no files on disk and no parents
378
352
        tree = self.make_branch_and_tree('tree')
379
353
        expected_result = ([], [
380
 
            (('', '', tree.get_root_id()), # common details
 
354
            (('', '', tree.path2id('')), # common details
381
355
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
382
356
             ])])
383
357
        state = dirstate.DirState.from_tree(tree, 'dirstate')
390
364
        rev_id = tree.commit('first post').encode('utf8')
391
365
        root_stat_pack = dirstate.pack_stat(os.stat(tree.basedir))
392
366
        expected_result = ([rev_id], [
393
 
            (('', '', tree.get_root_id()), # common details
 
367
            (('', '', tree.path2id('')), # common details
394
368
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
395
369
              ('d', '', 0, False, rev_id), # first parent details
396
370
             ])])
410
384
        rev_id2 = tree2.commit('second post', allow_pointless=True)
411
385
        tree.merge_from_branch(tree2.branch)
412
386
        expected_result = ([rev_id, rev_id2], [
413
 
            (('', '', tree.get_root_id()), # common details
 
387
            (('', '', tree.path2id('')), # common details
414
388
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
415
389
              ('d', '', 0, False, rev_id), # first parent details
416
 
              ('d', '', 0, False, rev_id), # second parent details
 
390
              ('d', '', 0, False, rev_id2), # second parent details
417
391
             ])])
418
392
        state = dirstate.DirState.from_tree(tree, 'dirstate')
419
393
        self.check_state_with_reopen(expected_result, state)
429
403
        tree = self.make_branch_and_tree('tree')
430
404
        self.build_tree(['tree/unknown'])
431
405
        expected_result = ([], [
432
 
            (('', '', tree.get_root_id()), # common details
 
406
            (('', '', tree.path2id('')), # common details
433
407
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
434
408
             ])])
435
409
        state = dirstate.DirState.from_tree(tree, 'dirstate')
438
412
    def get_tree_with_a_file(self):
439
413
        tree = self.make_branch_and_tree('tree')
440
414
        self.build_tree(['tree/a file'])
441
 
        tree.add('a file', 'a-file-id')
 
415
        tree.add('a file', 'a file id')
442
416
        return tree
443
417
 
444
418
    def test_non_empty_no_parents_to_dirstate(self):
446
420
        # There are files on disk and no parents
447
421
        tree = self.get_tree_with_a_file()
448
422
        expected_result = ([], [
449
 
            (('', '', tree.get_root_id()), # common details
 
423
            (('', '', tree.path2id('')), # common details
450
424
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
451
425
             ]),
452
 
            (('', 'a file', 'a-file-id'), # common
 
426
            (('', 'a file', 'a file id'), # common
453
427
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
454
428
             ]),
455
429
            ])
464
438
        # and length:
465
439
        self.build_tree_contents([('tree/a file', 'new content\n')])
466
440
        expected_result = ([rev_id], [
467
 
            (('', '', tree.get_root_id()), # common details
 
441
            (('', '', tree.path2id('')), # common details
468
442
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
469
443
              ('d', '', 0, False, rev_id), # first parent details
470
444
             ]),
471
 
            (('', 'a file', 'a-file-id'), # common
 
445
            (('', 'a file', 'a file id'), # common
472
446
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
473
447
              ('f', 'c3ed76e4bfd45ff1763ca206055bca8e9fc28aa8', 24, False,
474
448
               rev_id), # first parent
491
465
        # and length again, giving us three distinct values:
492
466
        self.build_tree_contents([('tree/a file', 'new content\n')])
493
467
        expected_result = ([rev_id, rev_id2], [
494
 
            (('', '', tree.get_root_id()), # common details
 
468
            (('', '', tree.path2id('')), # common details
495
469
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
496
470
              ('d', '', 0, False, rev_id), # first parent details
497
 
              ('d', '', 0, False, rev_id), # second parent details
 
471
              ('d', '', 0, False, rev_id2), # second parent details
498
472
             ]),
499
 
            (('', 'a file', 'a-file-id'), # common
 
473
            (('', 'a file', 'a file id'), # common
500
474
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
501
475
              ('f', 'c3ed76e4bfd45ff1763ca206055bca8e9fc28aa8', 24, False,
502
476
               rev_id), # first parent
543
517
        # get a state object
544
518
        # no parents, default tree content
545
519
        expected_result = ([], [
546
 
            (('', '', tree.get_root_id()), # common details
 
520
            (('', '', tree.path2id('')), # common details
547
521
             # current tree details, but new from_tree skips statting, it
548
522
             # uses set_state_from_inventory, and thus depends on the
549
523
             # inventory state.
580
554
        state.lock_read()
581
555
        try:
582
556
            entry = state._get_entry(0, path_utf8='a-file')
583
 
            # The current size should be 0 (default)
584
 
            self.assertEqual(0, entry[1][0][2])
 
557
            # The current sha1 sum should be empty
 
558
            self.assertEqual('', entry[1][0][1])
585
559
            # We should have a real entry.
586
560
            self.assertNotEqual((None, None), entry)
587
561
            # Make sure everything is old enough
588
562
            state._sha_cutoff_time()
589
563
            state._cutoff_time += 10
590
 
            # Change the file length
591
 
            self.build_tree_contents([('a-file', 'shorter')])
592
 
            sha1sum = dirstate.update_entry(state, entry, 'a-file',
593
 
                os.lstat('a-file'))
594
 
            # new file, no cached sha:
595
 
            self.assertEqual(None, sha1sum)
 
564
            sha1sum = state.update_entry(entry, 'a-file', os.lstat('a-file'))
 
565
            # We should have gotten a real sha1
 
566
            self.assertEqual('ecc5374e9ed82ad3ea3b4d452ea995a5fd3e70e3',
 
567
                             sha1sum)
596
568
 
597
569
            # The dirblock has been updated
598
 
            self.assertEqual(7, entry[1][0][2])
 
570
            self.assertEqual(sha1sum, entry[1][0][1])
599
571
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
600
572
                             state._dirblock_state)
601
573
 
611
583
        state.lock_read()
612
584
        try:
613
585
            entry = state._get_entry(0, path_utf8='a-file')
614
 
            self.assertEqual(7, entry[1][0][2])
 
586
            self.assertEqual(sha1sum, entry[1][0][1])
615
587
        finally:
616
588
            state.unlock()
617
589
 
630
602
        state.lock_read()
631
603
        try:
632
604
            entry = state._get_entry(0, path_utf8='a-file')
633
 
            sha1sum = dirstate.update_entry(state, entry, 'a-file',
634
 
                os.lstat('a-file'))
635
 
            # No sha - too new
636
 
            self.assertEqual(None, sha1sum)
 
605
            sha1sum = state.update_entry(entry, 'a-file', os.lstat('a-file'))
 
606
            # We should have gotten a real sha1
 
607
            self.assertEqual('ecc5374e9ed82ad3ea3b4d452ea995a5fd3e70e3',
 
608
                             sha1sum)
637
609
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
638
610
                             state._dirblock_state)
639
611
 
656
628
                state2.unlock()
657
629
        finally:
658
630
            state.unlock()
659
 
 
 
631
        
660
632
        # The file on disk should not be modified.
661
633
        state = dirstate.DirState.on_file('dirstate')
662
634
        state.lock_read()
666
638
        finally:
667
639
            state.unlock()
668
640
 
669
 
    def test_save_refuses_if_changes_aborted(self):
670
 
        self.build_tree(['a-file', 'a-dir/'])
671
 
        state = dirstate.DirState.initialize('dirstate')
672
 
        try:
673
 
            # No stat and no sha1 sum.
674
 
            state.add('a-file', 'a-file-id', 'file', None, '')
675
 
            state.save()
676
 
        finally:
677
 
            state.unlock()
678
 
 
679
 
        # The dirstate should include TREE_ROOT and 'a-file' and nothing else
680
 
        expected_blocks = [
681
 
            ('', [(('', '', 'TREE_ROOT'),
682
 
                   [('d', '', 0, False, dirstate.DirState.NULLSTAT)])]),
683
 
            ('', [(('', 'a-file', 'a-file-id'),
684
 
                   [('f', '', 0, False, dirstate.DirState.NULLSTAT)])]),
685
 
        ]
686
 
 
687
 
        state = dirstate.DirState.on_file('dirstate')
688
 
        state.lock_write()
689
 
        try:
690
 
            state._read_dirblocks_if_needed()
691
 
            self.assertEqual(expected_blocks, state._dirblocks)
692
 
 
693
 
            # Now modify the state, but mark it as inconsistent
694
 
            state.add('a-dir', 'a-dir-id', 'directory', None, '')
695
 
            state._changes_aborted = True
696
 
            state.save()
697
 
        finally:
698
 
            state.unlock()
699
 
 
700
 
        state = dirstate.DirState.on_file('dirstate')
701
 
        state.lock_read()
702
 
        try:
703
 
            state._read_dirblocks_if_needed()
704
 
            self.assertEqual(expected_blocks, state._dirblocks)
705
 
        finally:
706
 
            state.unlock()
707
 
 
708
641
 
709
642
class TestDirStateInitialize(TestCaseWithDirState):
710
643
 
737
670
        try:
738
671
            tree1.add('')
739
672
            revid1 = tree1.commit('foo').encode('utf8')
740
 
            root_id = tree1.get_root_id()
 
673
            root_id = tree1.inventory.root.file_id
741
674
            inv = tree1.inventory
742
675
        finally:
743
676
            tree1.unlock()
758
691
            # This will unlock it
759
692
            self.check_state_with_reopen(expected_result, state)
760
693
 
761
 
    def test_set_state_from_inventory_preserves_hashcache(self):
762
 
        # https://bugs.launchpad.net/bzr/+bug/146176
763
 
        # set_state_from_inventory should preserve the stat and hash value for
764
 
        # workingtree files that are not changed by the inventory.
765
 
 
766
 
        tree = self.make_branch_and_tree('.')
767
 
        # depends on the default format using dirstate...
768
 
        tree.lock_write()
769
 
        try:
770
 
            # make a dirstate with some valid hashcache data
771
 
            # file on disk, but that's not needed for this test
772
 
            foo_contents = 'contents of foo'
773
 
            self.build_tree_contents([('foo', foo_contents)])
774
 
            tree.add('foo', 'foo-id')
775
 
 
776
 
            foo_stat = os.stat('foo')
777
 
            foo_packed = dirstate.pack_stat(foo_stat)
778
 
            foo_sha = osutils.sha_string(foo_contents)
779
 
            foo_size = len(foo_contents)
780
 
 
781
 
            # should not be cached yet, because the file's too fresh
782
 
            self.assertEqual(
783
 
                (('', 'foo', 'foo-id',),
784
 
                 [('f', '', 0, False, dirstate.DirState.NULLSTAT)]),
785
 
                tree._dirstate._get_entry(0, 'foo-id'))
786
 
            # poke in some hashcache information - it wouldn't normally be
787
 
            # stored because it's too fresh
788
 
            tree._dirstate.update_minimal(
789
 
                ('', 'foo', 'foo-id'),
790
 
                'f', False, foo_sha, foo_packed, foo_size, 'foo')
791
 
            # now should be cached
792
 
            self.assertEqual(
793
 
                (('', 'foo', 'foo-id',),
794
 
                 [('f', foo_sha, foo_size, False, foo_packed)]),
795
 
                tree._dirstate._get_entry(0, 'foo-id'))
796
 
 
797
 
            # extract the inventory, and add something to it
798
 
            inv = tree._get_inventory()
799
 
            # should see the file we poked in...
800
 
            self.assertTrue(inv.has_id('foo-id'))
801
 
            self.assertTrue(inv.has_filename('foo'))
802
 
            inv.add_path('bar', 'file', 'bar-id')
803
 
            tree._dirstate._validate()
804
 
            # this used to cause it to lose its hashcache
805
 
            tree._dirstate.set_state_from_inventory(inv)
806
 
            tree._dirstate._validate()
807
 
        finally:
808
 
            tree.unlock()
809
 
 
810
 
        tree.lock_read()
811
 
        try:
812
 
            # now check that the state still has the original hashcache value
813
 
            state = tree._dirstate
814
 
            state._validate()
815
 
            foo_tuple = state._get_entry(0, path_utf8='foo')
816
 
            self.assertEqual(
817
 
                (('', 'foo', 'foo-id',),
818
 
                 [('f', foo_sha, len(foo_contents), False,
819
 
                   dirstate.pack_stat(foo_stat))]),
820
 
                foo_tuple)
821
 
        finally:
822
 
            tree.unlock()
823
 
 
824
 
    def test_set_state_from_inventory_mixed_paths(self):
825
 
        tree1 = self.make_branch_and_tree('tree1')
826
 
        self.build_tree(['tree1/a/', 'tree1/a/b/', 'tree1/a-b/',
827
 
                         'tree1/a/b/foo', 'tree1/a-b/bar'])
828
 
        tree1.lock_write()
829
 
        try:
830
 
            tree1.add(['a', 'a/b', 'a-b', 'a/b/foo', 'a-b/bar'],
831
 
                      ['a-id', 'b-id', 'a-b-id', 'foo-id', 'bar-id'])
832
 
            tree1.commit('rev1', rev_id='rev1')
833
 
            root_id = tree1.get_root_id()
834
 
            inv = tree1.inventory
835
 
        finally:
836
 
            tree1.unlock()
837
 
        expected_result1 = [('', '', root_id, 'd'),
838
 
                            ('', 'a', 'a-id', 'd'),
839
 
                            ('', 'a-b', 'a-b-id', 'd'),
840
 
                            ('a', 'b', 'b-id', 'd'),
841
 
                            ('a/b', 'foo', 'foo-id', 'f'),
842
 
                            ('a-b', 'bar', 'bar-id', 'f'),
843
 
                           ]
844
 
        expected_result2 = [('', '', root_id, 'd'),
845
 
                            ('', 'a', 'a-id', 'd'),
846
 
                            ('', 'a-b', 'a-b-id', 'd'),
847
 
                            ('a-b', 'bar', 'bar-id', 'f'),
848
 
                           ]
849
 
        state = dirstate.DirState.initialize('dirstate')
850
 
        try:
851
 
            state.set_state_from_inventory(inv)
852
 
            values = []
853
 
            for entry in state._iter_entries():
854
 
                values.append(entry[0] + entry[1][0][:1])
855
 
            self.assertEqual(expected_result1, values)
856
 
            del inv['b-id']
857
 
            state.set_state_from_inventory(inv)
858
 
            values = []
859
 
            for entry in state._iter_entries():
860
 
                values.append(entry[0] + entry[1][0][:1])
861
 
            self.assertEqual(expected_result2, values)
862
 
        finally:
863
 
            state.unlock()
864
 
 
865
694
    def test_set_path_id_no_parents(self):
866
695
        """The id of a path can be changed trivally with no parents."""
867
696
        state = dirstate.DirState.initialize('dirstate')
868
697
        try:
869
698
            # check precondition to be sure the state does change appropriately.
870
 
            root_entry = (('', '', 'TREE_ROOT'), [('d', '', 0, False, 'x'*32)])
871
 
            self.assertEqual([root_entry], list(state._iter_entries()))
872
 
            self.assertEqual(root_entry, state._get_entry(0, path_utf8=''))
873
 
            self.assertEqual(root_entry,
874
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
875
 
            self.assertEqual((None, None),
876
 
                             state._get_entry(0, fileid_utf8='second-root-id'))
877
 
            state.set_path_id('', 'second-root-id')
878
 
            new_root_entry = (('', '', 'second-root-id'),
879
 
                              [('d', '', 0, False, 'x'*32)])
880
 
            expected_rows = [new_root_entry]
 
699
            self.assertEqual(
 
700
                [(('', '', 'TREE_ROOT'), [('d', '', 0, False,
 
701
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])],
 
702
                list(state._iter_entries()))
 
703
            state.set_path_id('', 'foobarbaz')
 
704
            expected_rows = [
 
705
                (('', '', 'foobarbaz'), [('d', '', 0, False,
 
706
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])]
881
707
            self.assertEqual(expected_rows, list(state._iter_entries()))
882
 
            self.assertEqual(new_root_entry, state._get_entry(0, path_utf8=''))
883
 
            self.assertEqual(new_root_entry, 
884
 
                             state._get_entry(0, fileid_utf8='second-root-id'))
885
 
            self.assertEqual((None, None),
886
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
887
708
            # should work across save too
888
709
            state.save()
889
710
        finally:
907
728
        state._validate()
908
729
        try:
909
730
            state.set_parent_trees([('parent-revid', rt)], ghosts=[])
910
 
            root_entry = (('', '', 'TREE_ROOT'),
911
 
                          [('d', '', 0, False, 'x'*32),
912
 
                           ('d', '', 0, False, 'parent-revid')])
913
 
            self.assertEqual(root_entry, state._get_entry(0, path_utf8=''))
914
 
            self.assertEqual(root_entry,
915
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
916
 
            self.assertEqual((None, None),
917
 
                             state._get_entry(0, fileid_utf8='Asecond-root-id'))
918
 
            state.set_path_id('', 'Asecond-root-id')
 
731
            state.set_path_id('', 'foobarbaz')
919
732
            state._validate()
920
733
            # now see that it is what we expected
921
 
            old_root_entry = (('', '', 'TREE_ROOT'),
922
 
                              [('a', '', 0, False, ''),
923
 
                               ('d', '', 0, False, 'parent-revid')])
924
 
            new_root_entry = (('', '', 'Asecond-root-id'),
925
 
                              [('d', '', 0, False, ''),
926
 
                               ('a', '', 0, False, '')])
927
 
            expected_rows = [new_root_entry, old_root_entry]
 
734
            expected_rows = [
 
735
                (('', '', 'TREE_ROOT'),
 
736
                    [('a', '', 0, False, ''),
 
737
                     ('d', '', 0, False, 'parent-revid'),
 
738
                     ]),
 
739
                (('', '', 'foobarbaz'),
 
740
                    [('d', '', 0, False, ''),
 
741
                     ('a', '', 0, False, ''),
 
742
                     ]),
 
743
                ]
928
744
            state._validate()
929
745
            self.assertEqual(expected_rows, list(state._iter_entries()))
930
 
            self.assertEqual(new_root_entry, state._get_entry(0, path_utf8=''))
931
 
            self.assertEqual(old_root_entry, state._get_entry(1, path_utf8=''))
932
 
            self.assertEqual((None, None),
933
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
934
 
            self.assertEqual(old_root_entry,
935
 
                             state._get_entry(1, fileid_utf8='TREE_ROOT'))
936
 
            self.assertEqual(new_root_entry,
937
 
                             state._get_entry(0, fileid_utf8='Asecond-root-id'))
938
 
            self.assertEqual((None, None),
939
 
                             state._get_entry(1, fileid_utf8='Asecond-root-id'))
940
746
            # should work across save too
941
747
            state.save()
942
748
        finally:
958
764
        finally:
959
765
            state.unlock()
960
766
 
 
767
 
961
768
    def test_set_parent_trees_no_content(self):
962
769
        # set_parent_trees is a slow but important api to support.
963
770
        tree1 = self.make_branch_and_memory_tree('tree1')
968
775
        finally:
969
776
            tree1.unlock()
970
777
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
971
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
778
        tree2 = MemoryTree.create_on_branch(branch2)
972
779
        tree2.lock_write()
973
780
        try:
974
781
            revid2 = tree2.commit('foo')
975
 
            root_id = tree2.get_root_id()
 
782
            root_id = tree2.inventory.root.file_id
976
783
        finally:
977
784
            tree2.unlock()
978
785
        state = dirstate.DirState.initialize('dirstate')
1006
813
            state.set_parent_trees(
1007
814
                ((revid1, tree1.branch.repository.revision_tree(revid1)),
1008
815
                 (revid2, tree2.branch.repository.revision_tree(revid2)),
1009
 
                 ('ghost-rev', tree2.branch.repository.revision_tree(
1010
 
                                   _mod_revision.NULL_REVISION))),
 
816
                 ('ghost-rev', tree2.branch.repository.revision_tree(None))),
1011
817
                ['ghost-rev'])
1012
818
            self.assertEqual([revid1, revid2, 'ghost-rev'],
1013
819
                             state.get_parent_ids())
1017
823
                [(('', '', root_id), [
1018
824
                  ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1019
825
                  ('d', '', 0, False, revid1),
1020
 
                  ('d', '', 0, False, revid1)
 
826
                  ('d', '', 0, False, revid2)
1021
827
                  ])],
1022
828
                list(state._iter_entries()))
1023
829
        finally:
1038
844
        finally:
1039
845
            tree1.unlock()
1040
846
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
1041
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
847
        tree2 = MemoryTree.create_on_branch(branch2)
1042
848
        tree2.lock_write()
1043
849
        try:
1044
850
            tree2.put_file_bytes_non_atomic('file-id', 'new file-content')
1045
851
            revid2 = tree2.commit('foo')
1046
 
            root_id = tree2.get_root_id()
 
852
            root_id = tree2.inventory.root.file_id
1047
853
        finally:
1048
854
            tree2.unlock()
1049
855
        # check the layout in memory
1051
857
            (('', '', root_id), [
1052
858
             ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1053
859
             ('d', '', 0, False, revid1.encode('utf8')),
1054
 
             ('d', '', 0, False, revid1.encode('utf8'))
 
860
             ('d', '', 0, False, revid2.encode('utf8'))
1055
861
             ]),
1056
862
            (('', 'a file', 'file-id'), [
1057
863
             ('a', '', 0, False, ''),
1089
895
            (('', '', 'TREE_ROOT'), [
1090
896
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1091
897
             ]),
1092
 
            (('', 'a file', 'a-file-id'), [
 
898
            (('', 'a file', 'a file id'), [
1093
899
             ('f', '1'*20, 19, False, dirstate.pack_stat(stat)), # current tree
1094
900
             ]),
1095
901
            ]
1096
902
        try:
1097
 
            state.add('a file', 'a-file-id', 'file', stat, '1'*20)
 
903
            state.add('a file', 'a file id', 'file', stat, '1'*20)
1098
904
            # having added it, it should be in the output of iter_entries.
1099
905
            self.assertEqual(expected_entries, list(state._iter_entries()))
1100
906
            # saving and reloading should not affect this.
1103
909
            state.unlock()
1104
910
        state = dirstate.DirState.on_file('dirstate')
1105
911
        state.lock_read()
1106
 
        self.addCleanup(state.unlock)
1107
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
912
        try:
 
913
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
914
        finally:
 
915
            state.unlock()
1108
916
 
1109
917
    def test_add_path_to_unversioned_directory(self):
1110
918
        """Adding a path to an unversioned directory should error.
1115
923
        """
1116
924
        self.build_tree(['unversioned/', 'unversioned/a file'])
1117
925
        state = dirstate.DirState.initialize('dirstate')
1118
 
        self.addCleanup(state.unlock)
1119
 
        self.assertRaises(errors.NotVersionedError, state.add,
1120
 
                          'unversioned/a file', 'a-file-id', 'file', None, None)
 
926
        try:
 
927
            self.assertRaises(errors.NotVersionedError, state.add,
 
928
                'unversioned/a file', 'a file id', 'file', None, None)
 
929
        finally:
 
930
            state.unlock()
1121
931
 
1122
932
    def test_add_directory_to_root_no_parents_all_data(self):
1123
933
        # The most trivial addition of a dir is when there are no parents and
1143
953
            state.unlock()
1144
954
        state = dirstate.DirState.on_file('dirstate')
1145
955
        state.lock_read()
1146
 
        self.addCleanup(state.unlock)
1147
956
        state._validate()
1148
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
957
        try:
 
958
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
959
        finally:
 
960
            state.unlock()
1149
961
 
1150
 
    def _test_add_symlink_to_root_no_parents_all_data(self, link_name, target):
 
962
    def test_add_symlink_to_root_no_parents_all_data(self):
1151
963
        # The most trivial addition of a symlink when there are no parents and
1152
964
        # its in the root and all data about the file is supplied
1153
965
        # bzr doesn't support fake symlinks on windows, yet.
1154
 
        self.requireFeature(tests.SymlinkFeature)
1155
 
        os.symlink(target, link_name)
1156
 
        stat = os.lstat(link_name)
 
966
        if not has_symlinks():
 
967
            raise TestSkipped("No symlink support")
 
968
        os.symlink('target', 'a link')
 
969
        stat = os.lstat('a link')
1157
970
        expected_entries = [
1158
971
            (('', '', 'TREE_ROOT'), [
1159
972
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1160
973
             ]),
1161
 
            (('', link_name.encode('UTF-8'), 'a link id'), [
1162
 
             ('l', target.encode('UTF-8'), stat[6],
1163
 
              False, dirstate.pack_stat(stat)), # current tree
 
974
            (('', 'a link', 'a link id'), [
 
975
             ('l', 'target', 6, False, dirstate.pack_stat(stat)), # current tree
1164
976
             ]),
1165
977
            ]
1166
978
        state = dirstate.DirState.initialize('dirstate')
1167
979
        try:
1168
 
            state.add(link_name, 'a link id', 'symlink', stat,
1169
 
                      target.encode('UTF-8'))
 
980
            state.add('a link', 'a link id', 'symlink', stat, 'target')
1170
981
            # having added it, it should be in the output of iter_entries.
1171
982
            self.assertEqual(expected_entries, list(state._iter_entries()))
1172
983
            # saving and reloading should not affect this.
1175
986
            state.unlock()
1176
987
        state = dirstate.DirState.on_file('dirstate')
1177
988
        state.lock_read()
1178
 
        self.addCleanup(state.unlock)
1179
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
1180
 
 
1181
 
    def test_add_symlink_to_root_no_parents_all_data(self):
1182
 
        self._test_add_symlink_to_root_no_parents_all_data('a link', 'target')
1183
 
 
1184
 
    def test_add_symlink_unicode_to_root_no_parents_all_data(self):
1185
 
        self.requireFeature(tests.UnicodeFilenameFeature)
1186
 
        self._test_add_symlink_to_root_no_parents_all_data(
1187
 
            u'\N{Euro Sign}link', u'targ\N{Euro Sign}et')
 
989
        try:
 
990
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
991
        finally:
 
992
            state.unlock()
1188
993
 
1189
994
    def test_add_directory_and_child_no_parents_all_data(self):
1190
995
        # after adding a directory, we should be able to add children to it.
1198
1003
            (('', 'a dir', 'a dir id'), [
1199
1004
             ('d', '', 0, False, dirstate.pack_stat(dirstat)), # current tree
1200
1005
             ]),
1201
 
            (('a dir', 'a file', 'a-file-id'), [
 
1006
            (('a dir', 'a file', 'a file id'), [
1202
1007
             ('f', '1'*20, 25, False,
1203
1008
              dirstate.pack_stat(filestat)), # current tree details
1204
1009
             ]),
1206
1011
        state = dirstate.DirState.initialize('dirstate')
1207
1012
        try:
1208
1013
            state.add('a dir', 'a dir id', 'directory', dirstat, None)
1209
 
            state.add('a dir/a file', 'a-file-id', 'file', filestat, '1'*20)
 
1014
            state.add('a dir/a file', 'a file id', 'file', filestat, '1'*20)
1210
1015
            # added it, it should be in the output of iter_entries.
1211
1016
            self.assertEqual(expected_entries, list(state._iter_entries()))
1212
1017
            # saving and reloading should not affect this.
1215
1020
            state.unlock()
1216
1021
        state = dirstate.DirState.on_file('dirstate')
1217
1022
        state.lock_read()
1218
 
        self.addCleanup(state.unlock)
1219
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
1023
        try:
 
1024
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
1025
        finally:
 
1026
            state.unlock()
1220
1027
 
1221
1028
    def test_add_tree_reference(self):
1222
1029
        # make a dirstate and add a tree reference
1236
1043
            state.unlock()
1237
1044
        # now check we can read it back
1238
1045
        state.lock_read()
1239
 
        self.addCleanup(state.unlock)
1240
1046
        state._validate()
1241
 
        entry2 = state._get_entry(0, 'subdir-id', 'subdir')
1242
 
        self.assertEqual(entry, entry2)
1243
 
        self.assertEqual(entry, expected_entry)
1244
 
        # and lookup by id should work too
1245
 
        entry2 = state._get_entry(0, fileid_utf8='subdir-id')
1246
 
        self.assertEqual(entry, expected_entry)
 
1047
        try:
 
1048
            entry2 = state._get_entry(0, 'subdir-id', 'subdir')
 
1049
            self.assertEqual(entry, entry2)
 
1050
            self.assertEqual(entry, expected_entry)
 
1051
            # and lookup by id should work too
 
1052
            entry2 = state._get_entry(0, fileid_utf8='subdir-id')
 
1053
            self.assertEqual(entry, expected_entry)
 
1054
        finally:
 
1055
            state.unlock()
1247
1056
 
1248
1057
    def test_add_forbidden_names(self):
1249
1058
        state = dirstate.DirState.initialize('dirstate')
1253
1062
        self.assertRaises(errors.BzrError,
1254
1063
            state.add, '..', 'ass-id', 'directory', None, None)
1255
1064
 
1256
 
    def test_set_state_with_rename_b_a_bug_395556(self):
1257
 
        # bug 395556 uncovered a bug where the dirstate ends up with a false
1258
 
        # relocation record - in a tree with no parents there should be no
1259
 
        # absent or relocated records. This then leads to further corruption
1260
 
        # when a commit occurs, as the incorrect relocation gathers an
1261
 
        # incorrect absent in tree 1, and future changes go to pot.
1262
 
        tree1 = self.make_branch_and_tree('tree1')
1263
 
        self.build_tree(['tree1/b'])
1264
 
        tree1.lock_write()
1265
 
        try:
1266
 
            tree1.add(['b'], ['b-id'])
1267
 
            root_id = tree1.get_root_id()
1268
 
            inv = tree1.inventory
1269
 
            state = dirstate.DirState.initialize('dirstate')
1270
 
            try:
1271
 
                # Set the initial state with 'b'
1272
 
                state.set_state_from_inventory(inv)
1273
 
                inv.rename('b-id', root_id, 'a')
1274
 
                # Set the new state with 'a', which currently corrupts.
1275
 
                state.set_state_from_inventory(inv)
1276
 
                expected_result1 = [('', '', root_id, 'd'),
1277
 
                                    ('', 'a', 'b-id', 'f'),
1278
 
                                   ]
1279
 
                values = []
1280
 
                for entry in state._iter_entries():
1281
 
                    values.append(entry[0] + entry[1][0][:1])
1282
 
                self.assertEqual(expected_result1, values)
1283
 
            finally:
1284
 
                state.unlock()
1285
 
        finally:
1286
 
            tree1.unlock()
1287
 
 
1288
1065
 
1289
1066
class TestGetLines(TestCaseWithDirState):
1290
1067
 
1503
1280
            state.unlock()
1504
1281
 
1505
1282
 
1506
 
class TestIterChildEntries(TestCaseWithDirState):
1507
 
 
1508
 
    def create_dirstate_with_two_trees(self):
1509
 
        """This dirstate contains multiple files and directories.
1510
 
 
1511
 
         /        a-root-value
1512
 
         a/       a-dir
1513
 
         b/       b-dir
1514
 
         c        c-file
1515
 
         d        d-file
1516
 
         a/e/     e-dir
1517
 
         a/f      f-file
1518
 
         b/g      g-file
1519
 
         b/h\xc3\xa5  h-\xc3\xa5-file  #This is u'\xe5' encoded into utf-8
1520
 
 
1521
 
        Notice that a/e is an empty directory.
1522
 
 
1523
 
        There is one parent tree, which has the same shape with the following variations:
1524
 
        b/g in the parent is gone.
1525
 
        b/h in the parent has a different id
1526
 
        b/i is new in the parent
1527
 
        c is renamed to b/j in the parent
1528
 
 
1529
 
        :return: The dirstate, still write-locked.
1530
 
        """
1531
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
1532
 
        null_sha = 'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx'
1533
 
        NULL_PARENT_DETAILS = dirstate.DirState.NULL_PARENT_DETAILS
1534
 
        root_entry = ('', '', 'a-root-value'), [
1535
 
            ('d', '', 0, False, packed_stat),
1536
 
            ('d', '', 0, False, 'parent-revid'),
1537
 
            ]
1538
 
        a_entry = ('', 'a', 'a-dir'), [
1539
 
            ('d', '', 0, False, packed_stat),
1540
 
            ('d', '', 0, False, 'parent-revid'),
1541
 
            ]
1542
 
        b_entry = ('', 'b', 'b-dir'), [
1543
 
            ('d', '', 0, False, packed_stat),
1544
 
            ('d', '', 0, False, 'parent-revid'),
1545
 
            ]
1546
 
        c_entry = ('', 'c', 'c-file'), [
1547
 
            ('f', null_sha, 10, False, packed_stat),
1548
 
            ('r', 'b/j', 0, False, ''),
1549
 
            ]
1550
 
        d_entry = ('', 'd', 'd-file'), [
1551
 
            ('f', null_sha, 20, False, packed_stat),
1552
 
            ('f', 'd', 20, False, 'parent-revid'),
1553
 
            ]
1554
 
        e_entry = ('a', 'e', 'e-dir'), [
1555
 
            ('d', '', 0, False, packed_stat),
1556
 
            ('d', '', 0, False, 'parent-revid'),
1557
 
            ]
1558
 
        f_entry = ('a', 'f', 'f-file'), [
1559
 
            ('f', null_sha, 30, False, packed_stat),
1560
 
            ('f', 'f', 20, False, 'parent-revid'),
1561
 
            ]
1562
 
        g_entry = ('b', 'g', 'g-file'), [
1563
 
            ('f', null_sha, 30, False, packed_stat),
1564
 
            NULL_PARENT_DETAILS,
1565
 
            ]
1566
 
        h_entry1 = ('b', 'h\xc3\xa5', 'h-\xc3\xa5-file1'), [
1567
 
            ('f', null_sha, 40, False, packed_stat),
1568
 
            NULL_PARENT_DETAILS,
1569
 
            ]
1570
 
        h_entry2 = ('b', 'h\xc3\xa5', 'h-\xc3\xa5-file2'), [
1571
 
            NULL_PARENT_DETAILS,
1572
 
            ('f', 'h', 20, False, 'parent-revid'),
1573
 
            ]
1574
 
        i_entry = ('b', 'i', 'i-file'), [
1575
 
            NULL_PARENT_DETAILS,
1576
 
            ('f', 'h', 20, False, 'parent-revid'),
1577
 
            ]
1578
 
        j_entry = ('b', 'j', 'c-file'), [
1579
 
            ('r', 'c', 0, False, ''),
1580
 
            ('f', 'j', 20, False, 'parent-revid'),
1581
 
            ]
1582
 
        dirblocks = []
1583
 
        dirblocks.append(('', [root_entry]))
1584
 
        dirblocks.append(('', [a_entry, b_entry, c_entry, d_entry]))
1585
 
        dirblocks.append(('a', [e_entry, f_entry]))
1586
 
        dirblocks.append(('b', [g_entry, h_entry1, h_entry2, i_entry, j_entry]))
1587
 
        state = dirstate.DirState.initialize('dirstate')
1588
 
        state._validate()
1589
 
        try:
1590
 
            state._set_data(['parent'], dirblocks)
1591
 
        except:
1592
 
            state.unlock()
1593
 
            raise
1594
 
        return state, dirblocks
1595
 
 
1596
 
    def test_iter_children_b(self):
1597
 
        state, dirblocks = self.create_dirstate_with_two_trees()
1598
 
        self.addCleanup(state.unlock)
1599
 
        expected_result = []
1600
 
        expected_result.append(dirblocks[3][1][2]) # h2
1601
 
        expected_result.append(dirblocks[3][1][3]) # i
1602
 
        expected_result.append(dirblocks[3][1][4]) # j
1603
 
        self.assertEqual(expected_result,
1604
 
            list(state._iter_child_entries(1, 'b')))
1605
 
 
1606
 
    def test_iter_child_root(self):
1607
 
        state, dirblocks = self.create_dirstate_with_two_trees()
1608
 
        self.addCleanup(state.unlock)
1609
 
        expected_result = []
1610
 
        expected_result.append(dirblocks[1][1][0]) # a
1611
 
        expected_result.append(dirblocks[1][1][1]) # b
1612
 
        expected_result.append(dirblocks[1][1][3]) # d
1613
 
        expected_result.append(dirblocks[2][1][0]) # e
1614
 
        expected_result.append(dirblocks[2][1][1]) # f
1615
 
        expected_result.append(dirblocks[3][1][2]) # h2
1616
 
        expected_result.append(dirblocks[3][1][3]) # i
1617
 
        expected_result.append(dirblocks[3][1][4]) # j
1618
 
        self.assertEqual(expected_result,
1619
 
            list(state._iter_child_entries(1, '')))
1620
 
 
1621
 
 
1622
 
class TestDirstateSortOrder(tests.TestCaseWithTransport):
 
1283
class TestDirstateSortOrder(TestCaseWithTransport):
1623
1284
    """Test that DirState adds entries in the right order."""
1624
1285
 
1625
1286
    def test_add_sorting(self):
1674
1335
 
1675
1336
        # *really* cheesy way to just get an empty tree
1676
1337
        repo = self.make_repository('repo')
1677
 
        empty_tree = repo.revision_tree(_mod_revision.NULL_REVISION)
 
1338
        empty_tree = repo.revision_tree(None)
1678
1339
        state.set_parent_trees([('null:', empty_tree)], [])
1679
1340
 
1680
1341
        dirblock_names = [d[0] for d in state._dirblocks]
1684
1345
class InstrumentedDirState(dirstate.DirState):
1685
1346
    """An DirState with instrumented sha1 functionality."""
1686
1347
 
1687
 
    def __init__(self, path, sha1_provider):
1688
 
        super(InstrumentedDirState, self).__init__(path, sha1_provider)
 
1348
    def __init__(self, path):
 
1349
        super(InstrumentedDirState, self).__init__(path)
1689
1350
        self._time_offset = 0
1690
1351
        self._log = []
1691
 
        # member is dynamically set in DirState.__init__ to turn on trace
1692
 
        self._sha1_provider = sha1_provider
1693
 
        self._sha1_file = self._sha1_file_and_log
1694
1352
 
1695
1353
    def _sha_cutoff_time(self):
1696
1354
        timestamp = super(InstrumentedDirState, self)._sha_cutoff_time()
1697
1355
        self._cutoff_time = timestamp + self._time_offset
1698
1356
 
1699
 
    def _sha1_file_and_log(self, abspath):
 
1357
    def _sha1_file(self, abspath, entry):
1700
1358
        self._log.append(('sha1', abspath))
1701
 
        return self._sha1_provider.sha1(abspath)
 
1359
        return super(InstrumentedDirState, self)._sha1_file(abspath, entry)
1702
1360
 
1703
1361
    def _read_link(self, abspath, old_link):
1704
1362
        self._log.append(('read_link', abspath, old_link))
1735
1393
        self.st_ino = ino
1736
1394
        self.st_mode = mode
1737
1395
 
1738
 
    @staticmethod
1739
 
    def from_stat(st):
1740
 
        return _FakeStat(st.st_size, st.st_mtime, st.st_ctime, st.st_dev,
1741
 
            st.st_ino, st.st_mode)
1742
 
 
1743
 
 
1744
 
class TestPackStat(tests.TestCaseWithTransport):
 
1396
 
 
1397
class TestUpdateEntry(TestCaseWithDirState):
 
1398
    """Test the DirState.update_entry functions"""
 
1399
 
 
1400
    def get_state_with_a(self):
 
1401
        """Create a DirState tracking a single object named 'a'"""
 
1402
        state = InstrumentedDirState.initialize('dirstate')
 
1403
        self.addCleanup(state.unlock)
 
1404
        state.add('a', 'a-id', 'file', None, '')
 
1405
        entry = state._get_entry(0, path_utf8='a')
 
1406
        return state, entry
 
1407
 
 
1408
    def test_update_entry(self):
 
1409
        state, entry = self.get_state_with_a()
 
1410
        self.build_tree(['a'])
 
1411
        # Add one where we don't provide the stat or sha already
 
1412
        self.assertEqual(('', 'a', 'a-id'), entry[0])
 
1413
        self.assertEqual([('f', '', 0, False, dirstate.DirState.NULLSTAT)],
 
1414
                         entry[1])
 
1415
        # Flush the buffers to disk
 
1416
        state.save()
 
1417
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1418
                         state._dirblock_state)
 
1419
 
 
1420
        stat_value = os.lstat('a')
 
1421
        packed_stat = dirstate.pack_stat(stat_value)
 
1422
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1423
                                          stat_value=stat_value)
 
1424
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1425
                         link_or_sha1)
 
1426
 
 
1427
        # The dirblock entry should not cache the file's sha1
 
1428
        self.assertEqual([('f', '', 14, False, dirstate.DirState.NULLSTAT)],
 
1429
                         entry[1])
 
1430
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1431
                         state._dirblock_state)
 
1432
        mode = stat_value.st_mode
 
1433
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False)], state._log)
 
1434
 
 
1435
        state.save()
 
1436
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1437
                         state._dirblock_state)
 
1438
 
 
1439
        # If we do it again right away, we don't know if the file has changed
 
1440
        # so we will re-read the file. Roll the clock back so the file is
 
1441
        # guaranteed to look too new.
 
1442
        state.adjust_time(-10)
 
1443
 
 
1444
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1445
                                          stat_value=stat_value)
 
1446
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1447
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1448
                         ], state._log)
 
1449
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1450
                         link_or_sha1)
 
1451
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1452
                         state._dirblock_state)
 
1453
        self.assertEqual([('f', '', 14, False, dirstate.DirState.NULLSTAT)],
 
1454
                         entry[1])
 
1455
        state.save()
 
1456
 
 
1457
        # However, if we move the clock forward so the file is considered
 
1458
        # "stable", it should just cache the value.
 
1459
        state.adjust_time(+20)
 
1460
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1461
                                          stat_value=stat_value)
 
1462
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1463
                         link_or_sha1)
 
1464
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1465
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1466
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1467
                         ], state._log)
 
1468
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1469
                         entry[1])
 
1470
 
 
1471
        # Subsequent calls will just return the cached value
 
1472
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1473
                                          stat_value=stat_value)
 
1474
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1475
                         link_or_sha1)
 
1476
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1477
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1478
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1479
                         ], state._log)
 
1480
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1481
                         entry[1])
 
1482
 
 
1483
    def test_update_entry_symlink(self):
 
1484
        """Update entry should read symlinks."""
 
1485
        if not osutils.has_symlinks():
 
1486
            # PlatformDeficiency / TestSkipped
 
1487
            raise TestSkipped("No symlink support")
 
1488
        state, entry = self.get_state_with_a()
 
1489
        state.save()
 
1490
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1491
                         state._dirblock_state)
 
1492
        os.symlink('target', 'a')
 
1493
 
 
1494
        state.adjust_time(-10) # Make the symlink look new
 
1495
        stat_value = os.lstat('a')
 
1496
        packed_stat = dirstate.pack_stat(stat_value)
 
1497
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1498
                                          stat_value=stat_value)
 
1499
        self.assertEqual('target', link_or_sha1)
 
1500
        self.assertEqual([('read_link', 'a', '')], state._log)
 
1501
        # Dirblock is not updated (the link is too new)
 
1502
        self.assertEqual([('l', '', 6, False, dirstate.DirState.NULLSTAT)],
 
1503
                         entry[1])
 
1504
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1505
                         state._dirblock_state)
 
1506
 
 
1507
        # Because the stat_value looks new, we should re-read the target
 
1508
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1509
                                          stat_value=stat_value)
 
1510
        self.assertEqual('target', link_or_sha1)
 
1511
        self.assertEqual([('read_link', 'a', ''),
 
1512
                          ('read_link', 'a', ''),
 
1513
                         ], state._log)
 
1514
        self.assertEqual([('l', '', 6, False, dirstate.DirState.NULLSTAT)],
 
1515
                         entry[1])
 
1516
        state.adjust_time(+20) # Skip into the future, all files look old
 
1517
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1518
                                          stat_value=stat_value)
 
1519
        self.assertEqual('target', link_or_sha1)
 
1520
        # We need to re-read the link because only now can we cache it
 
1521
        self.assertEqual([('read_link', 'a', ''),
 
1522
                          ('read_link', 'a', ''),
 
1523
                          ('read_link', 'a', ''),
 
1524
                         ], state._log)
 
1525
        self.assertEqual([('l', 'target', 6, False, packed_stat)],
 
1526
                         entry[1])
 
1527
 
 
1528
        # Another call won't re-read the link
 
1529
        self.assertEqual([('read_link', 'a', ''),
 
1530
                          ('read_link', 'a', ''),
 
1531
                          ('read_link', 'a', ''),
 
1532
                         ], state._log)
 
1533
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1534
                                          stat_value=stat_value)
 
1535
        self.assertEqual('target', link_or_sha1)
 
1536
        self.assertEqual([('l', 'target', 6, False, packed_stat)],
 
1537
                         entry[1])
 
1538
 
 
1539
    def do_update_entry(self, state, entry, abspath):
 
1540
        stat_value = os.lstat(abspath)
 
1541
        return state.update_entry(entry, abspath, stat_value)
 
1542
 
 
1543
    def test_update_entry_dir(self):
 
1544
        state, entry = self.get_state_with_a()
 
1545
        self.build_tree(['a/'])
 
1546
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1547
 
 
1548
    def test_update_entry_dir_unchanged(self):
 
1549
        state, entry = self.get_state_with_a()
 
1550
        self.build_tree(['a/'])
 
1551
        state.adjust_time(+20)
 
1552
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1553
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1554
                         state._dirblock_state)
 
1555
        state.save()
 
1556
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1557
                         state._dirblock_state)
 
1558
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1559
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1560
                         state._dirblock_state)
 
1561
 
 
1562
    def test_update_entry_file_unchanged(self):
 
1563
        state, entry = self.get_state_with_a()
 
1564
        self.build_tree(['a'])
 
1565
        sha1sum = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1566
        state.adjust_time(+20)
 
1567
        self.assertEqual(sha1sum, self.do_update_entry(state, entry, 'a'))
 
1568
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1569
                         state._dirblock_state)
 
1570
        state.save()
 
1571
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1572
                         state._dirblock_state)
 
1573
        self.assertEqual(sha1sum, self.do_update_entry(state, entry, 'a'))
 
1574
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1575
                         state._dirblock_state)
 
1576
 
 
1577
    def create_and_test_file(self, state, entry):
 
1578
        """Create a file at 'a' and verify the state finds it.
 
1579
 
 
1580
        The state should already be versioning *something* at 'a'. This makes
 
1581
        sure that state.update_entry recognizes it as a file.
 
1582
        """
 
1583
        self.build_tree(['a'])
 
1584
        stat_value = os.lstat('a')
 
1585
        packed_stat = dirstate.pack_stat(stat_value)
 
1586
 
 
1587
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1588
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1589
                         link_or_sha1)
 
1590
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1591
                         entry[1])
 
1592
        return packed_stat
 
1593
 
 
1594
    def create_and_test_dir(self, state, entry):
 
1595
        """Create a directory at 'a' and verify the state finds it.
 
1596
 
 
1597
        The state should already be versioning *something* at 'a'. This makes
 
1598
        sure that state.update_entry recognizes it as a directory.
 
1599
        """
 
1600
        self.build_tree(['a/'])
 
1601
        stat_value = os.lstat('a')
 
1602
        packed_stat = dirstate.pack_stat(stat_value)
 
1603
 
 
1604
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1605
        self.assertIs(None, link_or_sha1)
 
1606
        self.assertEqual([('d', '', 0, False, packed_stat)], entry[1])
 
1607
 
 
1608
        return packed_stat
 
1609
 
 
1610
    def create_and_test_symlink(self, state, entry):
 
1611
        """Create a symlink at 'a' and verify the state finds it.
 
1612
 
 
1613
        The state should already be versioning *something* at 'a'. This makes
 
1614
        sure that state.update_entry recognizes it as a symlink.
 
1615
 
 
1616
        This should not be called if this platform does not have symlink
 
1617
        support.
 
1618
        """
 
1619
        # caller should care about skipping test on platforms without symlinks
 
1620
        os.symlink('path/to/foo', 'a')
 
1621
 
 
1622
        stat_value = os.lstat('a')
 
1623
        packed_stat = dirstate.pack_stat(stat_value)
 
1624
 
 
1625
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1626
        self.assertEqual('path/to/foo', link_or_sha1)
 
1627
        self.assertEqual([('l', 'path/to/foo', 11, False, packed_stat)],
 
1628
                         entry[1])
 
1629
        return packed_stat
 
1630
 
 
1631
    def test_update_file_to_dir(self):
 
1632
        """If a file changes to a directory we return None for the sha.
 
1633
        We also update the inventory record.
 
1634
        """
 
1635
        state, entry = self.get_state_with_a()
 
1636
        # The file sha1 won't be cached unless the file is old
 
1637
        state.adjust_time(+10)
 
1638
        self.create_and_test_file(state, entry)
 
1639
        os.remove('a')
 
1640
        self.create_and_test_dir(state, entry)
 
1641
 
 
1642
    def test_update_file_to_symlink(self):
 
1643
        """File becomes a symlink"""
 
1644
        if not osutils.has_symlinks():
 
1645
            # PlatformDeficiency / TestSkipped
 
1646
            raise TestSkipped("No symlink support")
 
1647
        state, entry = self.get_state_with_a()
 
1648
        # The file sha1 won't be cached unless the file is old
 
1649
        state.adjust_time(+10)
 
1650
        self.create_and_test_file(state, entry)
 
1651
        os.remove('a')
 
1652
        self.create_and_test_symlink(state, entry)
 
1653
 
 
1654
    def test_update_dir_to_file(self):
 
1655
        """Directory becoming a file updates the entry."""
 
1656
        state, entry = self.get_state_with_a()
 
1657
        # The file sha1 won't be cached unless the file is old
 
1658
        state.adjust_time(+10)
 
1659
        self.create_and_test_dir(state, entry)
 
1660
        os.rmdir('a')
 
1661
        self.create_and_test_file(state, entry)
 
1662
 
 
1663
    def test_update_dir_to_symlink(self):
 
1664
        """Directory becomes a symlink"""
 
1665
        if not osutils.has_symlinks():
 
1666
            # PlatformDeficiency / TestSkipped
 
1667
            raise TestSkipped("No symlink support")
 
1668
        state, entry = self.get_state_with_a()
 
1669
        # The symlink target won't be cached if it isn't old
 
1670
        state.adjust_time(+10)
 
1671
        self.create_and_test_dir(state, entry)
 
1672
        os.rmdir('a')
 
1673
        self.create_and_test_symlink(state, entry)
 
1674
 
 
1675
    def test_update_symlink_to_file(self):
 
1676
        """Symlink becomes a file"""
 
1677
        if not has_symlinks():
 
1678
            raise TestSkipped("No symlink support")
 
1679
        state, entry = self.get_state_with_a()
 
1680
        # The symlink and file info won't be cached unless old
 
1681
        state.adjust_time(+10)
 
1682
        self.create_and_test_symlink(state, entry)
 
1683
        os.remove('a')
 
1684
        self.create_and_test_file(state, entry)
 
1685
 
 
1686
    def test_update_symlink_to_dir(self):
 
1687
        """Symlink becomes a directory"""
 
1688
        if not has_symlinks():
 
1689
            raise TestSkipped("No symlink support")
 
1690
        state, entry = self.get_state_with_a()
 
1691
        # The symlink target won't be cached if it isn't old
 
1692
        state.adjust_time(+10)
 
1693
        self.create_and_test_symlink(state, entry)
 
1694
        os.remove('a')
 
1695
        self.create_and_test_dir(state, entry)
 
1696
 
 
1697
    def test__is_executable_win32(self):
 
1698
        state, entry = self.get_state_with_a()
 
1699
        self.build_tree(['a'])
 
1700
 
 
1701
        # Make sure we are using the win32 implementation of _is_executable
 
1702
        state._is_executable = state._is_executable_win32
 
1703
 
 
1704
        # The file on disk is not executable, but we are marking it as though
 
1705
        # it is. With _is_executable_win32 we ignore what is on disk.
 
1706
        entry[1][0] = ('f', '', 0, True, dirstate.DirState.NULLSTAT)
 
1707
 
 
1708
        stat_value = os.lstat('a')
 
1709
        packed_stat = dirstate.pack_stat(stat_value)
 
1710
 
 
1711
        state.adjust_time(-10) # Make sure everything is new
 
1712
        state.update_entry(entry, abspath='a', stat_value=stat_value)
 
1713
 
 
1714
        # The row is updated, but the executable bit stays set.
 
1715
        self.assertEqual([('f', '', 14, True, dirstate.DirState.NULLSTAT)],
 
1716
                         entry[1])
 
1717
 
 
1718
        # Make the disk object look old enough to cache
 
1719
        state.adjust_time(+20)
 
1720
        digest = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1721
        state.update_entry(entry, abspath='a', stat_value=stat_value)
 
1722
        self.assertEqual([('f', digest, 14, True, packed_stat)], entry[1])
 
1723
 
 
1724
 
 
1725
class TestPackStat(TestCaseWithTransport):
1745
1726
 
1746
1727
    def assertPackStat(self, expected, stat_value):
1747
1728
        """Check the packed and serialized form of a stat value."""
1796
1777
class TestBisect(TestCaseWithDirState):
1797
1778
    """Test the ability to bisect into the disk format."""
1798
1779
 
 
1780
 
1799
1781
    def assertBisect(self, expected_map, map_keys, state, paths):
1800
1782
        """Assert that bisecting for paths returns the right result.
1801
1783
 
1806
1788
                      (dir, name) tuples, and sorted according to how _bisect
1807
1789
                      requires.
1808
1790
        """
1809
 
        result = state._bisect(paths)
 
1791
        dir_names = sorted(osutils.split(p) for p in paths)
 
1792
        result = state._bisect(dir_names)
1810
1793
        # For now, results are just returned in whatever order we read them.
1811
1794
        # We could sort by (dir, name, file_id) or something like that, but in
1812
1795
        # the end it would still be fairly arbitrary, and we don't want the
1813
1796
        # extra overhead if we can avoid it. So sort everything to make sure
1814
1797
        # equality is true
1815
 
        self.assertEqual(len(map_keys), len(paths))
 
1798
        assert len(map_keys) == len(dir_names)
1816
1799
        expected = {}
1817
 
        for path, keys in zip(paths, map_keys):
 
1800
        for dir_name, keys in zip(dir_names, map_keys):
1818
1801
            if keys is None:
1819
1802
                # This should not be present in the output
1820
1803
                continue
1821
 
            expected[path] = sorted(expected_map[k] for k in keys)
 
1804
            expected[dir_name] = sorted(expected_map[k] for k in keys)
1822
1805
 
1823
 
        # The returned values are just arranged randomly based on when they
1824
 
        # were read, for testing, make sure it is properly sorted.
1825
 
        for path in result:
1826
 
            result[path].sort()
 
1806
        for dir_name in result:
 
1807
            result[dir_name].sort()
1827
1808
 
1828
1809
        self.assertEqual(expected, result)
1829
1810
 
1837
1818
        :param paths: A list of directories
1838
1819
        """
1839
1820
        result = state._bisect_dirblocks(paths)
1840
 
        self.assertEqual(len(map_keys), len(paths))
 
1821
        assert len(map_keys) == len(paths)
 
1822
 
1841
1823
        expected = {}
1842
1824
        for path, keys in zip(paths, map_keys):
1843
1825
            if keys is None:
1865
1847
            dir_name_id, trees_info = entry
1866
1848
            expected[dir_name_id] = trees_info
1867
1849
 
1868
 
        result = state._bisect_recursive(paths)
 
1850
        dir_names = sorted(osutils.split(p) for p in paths)
 
1851
        result = state._bisect_recursive(dir_names)
1869
1852
 
1870
1853
        self.assertEqual(expected, result)
1871
1854
 
1880
1863
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1881
1864
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1882
1865
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1883
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1884
1866
        self.assertBisect(expected, [['f']], state, ['f'])
1885
1867
 
1886
1868
    def test_bisect_multi(self):
1889
1871
        # Bisect should be capable of finding multiple entries at the same time
1890
1872
        self.assertBisect(expected, [['a'], ['b'], ['f']],
1891
1873
                          state, ['a', 'b', 'f'])
 
1874
        # ('', 'f') sorts before the others
1892
1875
        self.assertBisect(expected, [['f'], ['b/d'], ['b/d/e']],
1893
 
                          state, ['f', 'b/d', 'b/d/e'])
1894
 
        self.assertBisect(expected, [['b'], ['b-c'], ['b/c']],
1895
 
                          state, ['b', 'b-c', 'b/c'])
 
1876
                          state, ['b/d', 'b/d/e', 'f'])
1896
1877
 
1897
1878
    def test_bisect_one_page(self):
1898
1879
        """Test bisect when there is only 1 page to read"""
1904
1885
        self.assertBisect(expected,[['b/c']], state, ['b/c'])
1905
1886
        self.assertBisect(expected,[['b/d']], state, ['b/d'])
1906
1887
        self.assertBisect(expected,[['b/d/e']], state, ['b/d/e'])
1907
 
        self.assertBisect(expected,[['b-c']], state, ['b-c'])
1908
1888
        self.assertBisect(expected,[['f']], state, ['f'])
1909
1889
        self.assertBisect(expected,[['a'], ['b'], ['f']],
1910
1890
                          state, ['a', 'b', 'f'])
1911
 
        self.assertBisect(expected, [['b/d'], ['b/d/e'], ['f']],
 
1891
        # ('', 'f') sorts before the others
 
1892
        self.assertBisect(expected, [['f'], ['b/d'], ['b/d/e']],
1912
1893
                          state, ['b/d', 'b/d/e', 'f'])
1913
 
        self.assertBisect(expected, [['b'], ['b/c'], ['b-c']],
1914
 
                          state, ['b', 'b/c', 'b-c'])
1915
1894
 
1916
1895
    def test_bisect_duplicate_paths(self):
1917
1896
        """When bisecting for a path, handle multiple entries."""
1925
1904
        self.assertBisect(expected, [['b/d', 'b/d2']], state, ['b/d'])
1926
1905
        self.assertBisect(expected, [['b/d/e', 'b/d/e2']],
1927
1906
                          state, ['b/d/e'])
1928
 
        self.assertBisect(expected, [['b-c', 'b-c2']], state, ['b-c'])
1929
1907
        self.assertBisect(expected, [['f', 'f2']], state, ['f'])
1930
1908
 
1931
1909
    def test_bisect_page_size_too_small(self):
1938
1916
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1939
1917
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1940
1918
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1941
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1942
1919
        self.assertBisect(expected, [['f']], state, ['f'])
1943
1920
 
1944
1921
    def test_bisect_missing(self):
1947
1924
        self.assertBisect(expected, [None], state, ['foo'])
1948
1925
        self.assertBisect(expected, [None], state, ['b/foo'])
1949
1926
        self.assertBisect(expected, [None], state, ['bar/foo'])
1950
 
        self.assertBisect(expected, [None], state, ['b-c/foo'])
1951
1927
 
1952
1928
        self.assertBisect(expected, [['a'], None, ['b/d']],
1953
1929
                          state, ['a', 'foo', 'b/d'])
1969
1945
    def test_bisect_dirblocks(self):
1970
1946
        tree, state, expected = self.create_duplicated_dirstate()
1971
1947
        self.assertBisectDirBlocks(expected,
1972
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2']],
1973
 
            state, [''])
 
1948
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2']], state, [''])
1974
1949
        self.assertBisectDirBlocks(expected,
1975
1950
            [['b/c', 'b/c2', 'b/d', 'b/d2']], state, ['b'])
1976
1951
        self.assertBisectDirBlocks(expected,
1977
1952
            [['b/d/e', 'b/d/e2']], state, ['b/d'])
1978
1953
        self.assertBisectDirBlocks(expected,
1979
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2'],
 
1954
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2'],
1980
1955
             ['b/c', 'b/c2', 'b/d', 'b/d2'],
1981
1956
             ['b/d/e', 'b/d/e2'],
1982
1957
            ], state, ['', 'b', 'b/d'])
1997
1972
        self.assertBisectRecursive(expected, ['a'], state, ['a'])
1998
1973
        self.assertBisectRecursive(expected, ['b/c'], state, ['b/c'])
1999
1974
        self.assertBisectRecursive(expected, ['b/d/e'], state, ['b/d/e'])
2000
 
        self.assertBisectRecursive(expected, ['b-c'], state, ['b-c'])
2001
1975
        self.assertBisectRecursive(expected, ['b/d', 'b/d/e'],
2002
1976
                                   state, ['b/d'])
2003
1977
        self.assertBisectRecursive(expected, ['b', 'b/c', 'b/d', 'b/d/e'],
2004
1978
                                   state, ['b'])
2005
 
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'b-c', 'f', 'b/c',
 
1979
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'f', 'b/c',
2006
1980
                                              'b/d', 'b/d/e'],
2007
1981
                                   state, [''])
2008
1982
 
2032
2006
                                   state, ['b'])
2033
2007
 
2034
2008
 
 
2009
class TestBisectDirblock(TestCase):
 
2010
    """Test that bisect_dirblock() returns the expected values.
 
2011
 
 
2012
    bisect_dirblock is intended to work like bisect.bisect_left() except it
 
2013
    knows it is working on dirblocks and that dirblocks are sorted by ('path',
 
2014
    'to', 'foo') chunks rather than by raw 'path/to/foo'.
 
2015
    """
 
2016
 
 
2017
    def assertBisect(self, dirblocks, split_dirblocks, path, *args, **kwargs):
 
2018
        """Assert that bisect_split works like bisect_left on the split paths.
 
2019
 
 
2020
        :param dirblocks: A list of (path, [info]) pairs.
 
2021
        :param split_dirblocks: A list of ((split, path), [info]) pairs.
 
2022
        :param path: The path we are indexing.
 
2023
 
 
2024
        All other arguments will be passed along.
 
2025
        """
 
2026
        bisect_split_idx = dirstate.bisect_dirblock(dirblocks, path,
 
2027
                                                 *args, **kwargs)
 
2028
        split_dirblock = (path.split('/'), [])
 
2029
        bisect_left_idx = bisect.bisect_left(split_dirblocks, split_dirblock,
 
2030
                                             *args)
 
2031
        self.assertEqual(bisect_left_idx, bisect_split_idx,
 
2032
                         'bisect_split disagreed. %s != %s'
 
2033
                         ' for key %s'
 
2034
                         % (bisect_left_idx, bisect_split_idx, path)
 
2035
                         )
 
2036
 
 
2037
    def paths_to_dirblocks(self, paths):
 
2038
        """Convert a list of paths into dirblock form.
 
2039
 
 
2040
        Also, ensure that the paths are in proper sorted order.
 
2041
        """
 
2042
        dirblocks = [(path, []) for path in paths]
 
2043
        split_dirblocks = [(path.split('/'), []) for path in paths]
 
2044
        self.assertEqual(sorted(split_dirblocks), split_dirblocks)
 
2045
        return dirblocks, split_dirblocks
 
2046
 
 
2047
    def test_simple(self):
 
2048
        """In the simple case it works just like bisect_left"""
 
2049
        paths = ['', 'a', 'b', 'c', 'd']
 
2050
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2051
        for path in paths:
 
2052
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2053
        self.assertBisect(dirblocks, split_dirblocks, '_')
 
2054
        self.assertBisect(dirblocks, split_dirblocks, 'aa')
 
2055
        self.assertBisect(dirblocks, split_dirblocks, 'bb')
 
2056
        self.assertBisect(dirblocks, split_dirblocks, 'cc')
 
2057
        self.assertBisect(dirblocks, split_dirblocks, 'dd')
 
2058
        self.assertBisect(dirblocks, split_dirblocks, 'a/a')
 
2059
        self.assertBisect(dirblocks, split_dirblocks, 'b/b')
 
2060
        self.assertBisect(dirblocks, split_dirblocks, 'c/c')
 
2061
        self.assertBisect(dirblocks, split_dirblocks, 'd/d')
 
2062
 
 
2063
    def test_involved(self):
 
2064
        """This is where bisect_left diverges slightly."""
 
2065
        paths = ['', 'a',
 
2066
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2067
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2068
                 'a-a', 'a-z',
 
2069
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2070
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2071
                 'z-a', 'z-z',
 
2072
                ]
 
2073
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2074
        for path in paths:
 
2075
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2076
 
 
2077
    def test_involved_cached(self):
 
2078
        """This is where bisect_left diverges slightly."""
 
2079
        paths = ['', 'a',
 
2080
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2081
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2082
                 'a-a', 'a-z',
 
2083
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2084
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2085
                 'z-a', 'z-z',
 
2086
                ]
 
2087
        cache = {}
 
2088
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2089
        for path in paths:
 
2090
            self.assertBisect(dirblocks, split_dirblocks, path, cache=cache)
 
2091
 
 
2092
 
2035
2093
class TestDirstateValidation(TestCaseWithDirState):
2036
2094
 
2037
2095
    def test_validate_correct_dirstate(self):
2087
2145
            state._validate)
2088
2146
        self.assertContainsRe(str(e),
2089
2147
            'file a-id is absent in row')
2090
 
 
2091
 
 
2092
 
class TestDirstateTreeReference(TestCaseWithDirState):
2093
 
 
2094
 
    def test_reference_revision_is_none(self):
2095
 
        tree = self.make_branch_and_tree('tree', format='dirstate-with-subtree')
2096
 
        subtree = self.make_branch_and_tree('tree/subtree',
2097
 
                            format='dirstate-with-subtree')
2098
 
        subtree.set_root_id('subtree')
2099
 
        tree.add_reference(subtree)
2100
 
        tree.add('subtree')
2101
 
        state = dirstate.DirState.from_tree(tree, 'dirstate')
2102
 
        key = ('', 'subtree', 'subtree')
2103
 
        expected = ('', [(key,
2104
 
            [('t', '', 0, False, 'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])])
2105
 
 
2106
 
        try:
2107
 
            self.assertEqual(expected, state._find_block(key))
2108
 
        finally:
2109
 
            state.unlock()
2110
 
 
2111
 
 
2112
 
class TestDiscardMergeParents(TestCaseWithDirState):
2113
 
 
2114
 
    def test_discard_no_parents(self):
2115
 
        # This should be a no-op
2116
 
        state = self.create_empty_dirstate()
2117
 
        self.addCleanup(state.unlock)
2118
 
        state._discard_merge_parents()
2119
 
        state._validate()
2120
 
 
2121
 
    def test_discard_one_parent(self):
2122
 
        # No-op
2123
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
2124
 
        root_entry_direntry = ('', '', 'a-root-value'), [
2125
 
            ('d', '', 0, False, packed_stat),
2126
 
            ('d', '', 0, False, packed_stat),
2127
 
            ]
2128
 
        dirblocks = []
2129
 
        dirblocks.append(('', [root_entry_direntry]))
2130
 
        dirblocks.append(('', []))
2131
 
 
2132
 
        state = self.create_empty_dirstate()
2133
 
        self.addCleanup(state.unlock)
2134
 
        state._set_data(['parent-id'], dirblocks[:])
2135
 
        state._validate()
2136
 
 
2137
 
        state._discard_merge_parents()
2138
 
        state._validate()
2139
 
        self.assertEqual(dirblocks, state._dirblocks)
2140
 
 
2141
 
    def test_discard_simple(self):
2142
 
        # No-op
2143
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
2144
 
        root_entry_direntry = ('', '', 'a-root-value'), [
2145
 
            ('d', '', 0, False, packed_stat),
2146
 
            ('d', '', 0, False, packed_stat),
2147
 
            ('d', '', 0, False, packed_stat),
2148
 
            ]
2149
 
        expected_root_entry_direntry = ('', '', 'a-root-value'), [
2150
 
            ('d', '', 0, False, packed_stat),
2151
 
            ('d', '', 0, False, packed_stat),
2152
 
            ]
2153
 
        dirblocks = []
2154
 
        dirblocks.append(('', [root_entry_direntry]))
2155
 
        dirblocks.append(('', []))
2156
 
 
2157
 
        state = self.create_empty_dirstate()
2158
 
        self.addCleanup(state.unlock)
2159
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2160
 
        state._validate()
2161
 
 
2162
 
        # This should strip of the extra column
2163
 
        state._discard_merge_parents()
2164
 
        state._validate()
2165
 
        expected_dirblocks = [('', [expected_root_entry_direntry]), ('', [])]
2166
 
        self.assertEqual(expected_dirblocks, state._dirblocks)
2167
 
 
2168
 
    def test_discard_absent(self):
2169
 
        """If entries are only in a merge, discard should remove the entries"""
2170
 
        null_stat = dirstate.DirState.NULLSTAT
2171
 
        present_dir = ('d', '', 0, False, null_stat)
2172
 
        present_file = ('f', '', 0, False, null_stat)
2173
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2174
 
        root_key = ('', '', 'a-root-value')
2175
 
        file_in_root_key = ('', 'file-in-root', 'a-file-id')
2176
 
        file_in_merged_key = ('', 'file-in-merged', 'b-file-id')
2177
 
        dirblocks = [('', [(root_key, [present_dir, present_dir, present_dir])]),
2178
 
                     ('', [(file_in_merged_key,
2179
 
                            [absent, absent, present_file]),
2180
 
                           (file_in_root_key,
2181
 
                            [present_file, present_file, present_file]),
2182
 
                          ]),
2183
 
                    ]
2184
 
 
2185
 
        state = self.create_empty_dirstate()
2186
 
        self.addCleanup(state.unlock)
2187
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2188
 
        state._validate()
2189
 
 
2190
 
        exp_dirblocks = [('', [(root_key, [present_dir, present_dir])]),
2191
 
                         ('', [(file_in_root_key,
2192
 
                                [present_file, present_file]),
2193
 
                              ]),
2194
 
                        ]
2195
 
        state._discard_merge_parents()
2196
 
        state._validate()
2197
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2198
 
 
2199
 
    def test_discard_renamed(self):
2200
 
        null_stat = dirstate.DirState.NULLSTAT
2201
 
        present_dir = ('d', '', 0, False, null_stat)
2202
 
        present_file = ('f', '', 0, False, null_stat)
2203
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2204
 
        root_key = ('', '', 'a-root-value')
2205
 
        file_in_root_key = ('', 'file-in-root', 'a-file-id')
2206
 
        # Renamed relative to parent
2207
 
        file_rename_s_key = ('', 'file-s', 'b-file-id')
2208
 
        file_rename_t_key = ('', 'file-t', 'b-file-id')
2209
 
        # And one that is renamed between the parents, but absent in this
2210
 
        key_in_1 = ('', 'file-in-1', 'c-file-id')
2211
 
        key_in_2 = ('', 'file-in-2', 'c-file-id')
2212
 
 
2213
 
        dirblocks = [
2214
 
            ('', [(root_key, [present_dir, present_dir, present_dir])]),
2215
 
            ('', [(key_in_1,
2216
 
                   [absent, present_file, ('r', 'file-in-2', 'c-file-id')]),
2217
 
                  (key_in_2,
2218
 
                   [absent, ('r', 'file-in-1', 'c-file-id'), present_file]),
2219
 
                  (file_in_root_key,
2220
 
                   [present_file, present_file, present_file]),
2221
 
                  (file_rename_s_key,
2222
 
                   [('r', 'file-t', 'b-file-id'), absent, present_file]),
2223
 
                  (file_rename_t_key,
2224
 
                   [present_file, absent, ('r', 'file-s', 'b-file-id')]),
2225
 
                 ]),
2226
 
        ]
2227
 
        exp_dirblocks = [
2228
 
            ('', [(root_key, [present_dir, present_dir])]),
2229
 
            ('', [(key_in_1, [absent, present_file]),
2230
 
                  (file_in_root_key, [present_file, present_file]),
2231
 
                  (file_rename_t_key, [present_file, absent]),
2232
 
                 ]),
2233
 
        ]
2234
 
        state = self.create_empty_dirstate()
2235
 
        self.addCleanup(state.unlock)
2236
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2237
 
        state._validate()
2238
 
 
2239
 
        state._discard_merge_parents()
2240
 
        state._validate()
2241
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2242
 
 
2243
 
    def test_discard_all_subdir(self):
2244
 
        null_stat = dirstate.DirState.NULLSTAT
2245
 
        present_dir = ('d', '', 0, False, null_stat)
2246
 
        present_file = ('f', '', 0, False, null_stat)
2247
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2248
 
        root_key = ('', '', 'a-root-value')
2249
 
        subdir_key = ('', 'sub', 'dir-id')
2250
 
        child1_key = ('sub', 'child1', 'child1-id')
2251
 
        child2_key = ('sub', 'child2', 'child2-id')
2252
 
        child3_key = ('sub', 'child3', 'child3-id')
2253
 
 
2254
 
        dirblocks = [
2255
 
            ('', [(root_key, [present_dir, present_dir, present_dir])]),
2256
 
            ('', [(subdir_key, [present_dir, present_dir, present_dir])]),
2257
 
            ('sub', [(child1_key, [absent, absent, present_file]),
2258
 
                     (child2_key, [absent, absent, present_file]),
2259
 
                     (child3_key, [absent, absent, present_file]),
2260
 
                    ]),
2261
 
        ]
2262
 
        exp_dirblocks = [
2263
 
            ('', [(root_key, [present_dir, present_dir])]),
2264
 
            ('', [(subdir_key, [present_dir, present_dir])]),
2265
 
            ('sub', []),
2266
 
        ]
2267
 
        state = self.create_empty_dirstate()
2268
 
        self.addCleanup(state.unlock)
2269
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2270
 
        state._validate()
2271
 
 
2272
 
        state._discard_merge_parents()
2273
 
        state._validate()
2274
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2275
 
 
2276
 
 
2277
 
class Test_InvEntryToDetails(tests.TestCase):
2278
 
 
2279
 
    def assertDetails(self, expected, inv_entry):
2280
 
        details = dirstate.DirState._inv_entry_to_details(inv_entry)
2281
 
        self.assertEqual(expected, details)
2282
 
        # details should always allow join() and always be a plain str when
2283
 
        # finished
2284
 
        (minikind, fingerprint, size, executable, tree_data) = details
2285
 
        self.assertIsInstance(minikind, str)
2286
 
        self.assertIsInstance(fingerprint, str)
2287
 
        self.assertIsInstance(tree_data, str)
2288
 
 
2289
 
    def test_unicode_symlink(self):
2290
 
        inv_entry = inventory.InventoryLink('link-file-id',
2291
 
                                            u'nam\N{Euro Sign}e',
2292
 
                                            'link-parent-id')
2293
 
        inv_entry.revision = 'link-revision-id'
2294
 
        target = u'link-targ\N{Euro Sign}t'
2295
 
        inv_entry.symlink_target = target
2296
 
        self.assertDetails(('l', target.encode('UTF-8'), 0, False,
2297
 
                            'link-revision-id'), inv_entry)
2298
 
 
2299
 
 
2300
 
class TestSHA1Provider(tests.TestCaseInTempDir):
2301
 
 
2302
 
    def test_sha1provider_is_an_interface(self):
2303
 
        p = dirstate.SHA1Provider()
2304
 
        self.assertRaises(NotImplementedError, p.sha1, "foo")
2305
 
        self.assertRaises(NotImplementedError, p.stat_and_sha1, "foo")
2306
 
 
2307
 
    def test_defaultsha1provider_sha1(self):
2308
 
        text = 'test\r\nwith\nall\rpossible line endings\r\n'
2309
 
        self.build_tree_contents([('foo', text)])
2310
 
        expected_sha = osutils.sha_string(text)
2311
 
        p = dirstate.DefaultSHA1Provider()
2312
 
        self.assertEqual(expected_sha, p.sha1('foo'))
2313
 
 
2314
 
    def test_defaultsha1provider_stat_and_sha1(self):
2315
 
        text = 'test\r\nwith\nall\rpossible line endings\r\n'
2316
 
        self.build_tree_contents([('foo', text)])
2317
 
        expected_sha = osutils.sha_string(text)
2318
 
        p = dirstate.DefaultSHA1Provider()
2319
 
        statvalue, sha1 = p.stat_and_sha1('foo')
2320
 
        self.assertTrue(len(statvalue) >= 10)
2321
 
        self.assertEqual(len(text), statvalue.st_size)
2322
 
        self.assertEqual(expected_sha, sha1)