~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_dirstate.py

  • Committer: Vincent Ladeuil
  • Date: 2007-06-20 14:25:06 UTC
  • mfrom: (2540 +trunk)
  • mto: This revision was merged to the branch mainline in revision 2646.
  • Revision ID: v.ladeuil+lp@free.fr-20070620142506-txsb1v8538kpsafw
merge bzr.dev @ 2540

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
694
    def test_set_state_from_inventory_mixed_paths(self):
825
695
        tree1 = self.make_branch_and_tree('tree1')
826
696
        self.build_tree(['tree1/a/', 'tree1/a/b/', 'tree1/a-b/',
867
737
        state = dirstate.DirState.initialize('dirstate')
868
738
        try:
869
739
            # 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]
 
740
            self.assertEqual(
 
741
                [(('', '', 'TREE_ROOT'), [('d', '', 0, False,
 
742
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])],
 
743
                list(state._iter_entries()))
 
744
            state.set_path_id('', 'foobarbaz')
 
745
            expected_rows = [
 
746
                (('', '', 'foobarbaz'), [('d', '', 0, False,
 
747
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])]
881
748
            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
749
            # should work across save too
888
750
            state.save()
889
751
        finally:
907
769
        state._validate()
908
770
        try:
909
771
            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')
 
772
            state.set_path_id('', 'foobarbaz')
919
773
            state._validate()
920
774
            # 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]
 
775
            expected_rows = [
 
776
                (('', '', 'TREE_ROOT'),
 
777
                    [('a', '', 0, False, ''),
 
778
                     ('d', '', 0, False, 'parent-revid'),
 
779
                     ]),
 
780
                (('', '', 'foobarbaz'),
 
781
                    [('d', '', 0, False, ''),
 
782
                     ('a', '', 0, False, ''),
 
783
                     ]),
 
784
                ]
928
785
            state._validate()
929
786
            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
787
            # should work across save too
941
788
            state.save()
942
789
        finally:
958
805
        finally:
959
806
            state.unlock()
960
807
 
 
808
 
961
809
    def test_set_parent_trees_no_content(self):
962
810
        # set_parent_trees is a slow but important api to support.
963
811
        tree1 = self.make_branch_and_memory_tree('tree1')
968
816
        finally:
969
817
            tree1.unlock()
970
818
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
971
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
819
        tree2 = MemoryTree.create_on_branch(branch2)
972
820
        tree2.lock_write()
973
821
        try:
974
822
            revid2 = tree2.commit('foo')
975
 
            root_id = tree2.get_root_id()
 
823
            root_id = tree2.inventory.root.file_id
976
824
        finally:
977
825
            tree2.unlock()
978
826
        state = dirstate.DirState.initialize('dirstate')
1006
854
            state.set_parent_trees(
1007
855
                ((revid1, tree1.branch.repository.revision_tree(revid1)),
1008
856
                 (revid2, tree2.branch.repository.revision_tree(revid2)),
1009
 
                 ('ghost-rev', tree2.branch.repository.revision_tree(
1010
 
                                   _mod_revision.NULL_REVISION))),
 
857
                 ('ghost-rev', tree2.branch.repository.revision_tree(None))),
1011
858
                ['ghost-rev'])
1012
859
            self.assertEqual([revid1, revid2, 'ghost-rev'],
1013
860
                             state.get_parent_ids())
1017
864
                [(('', '', root_id), [
1018
865
                  ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1019
866
                  ('d', '', 0, False, revid1),
1020
 
                  ('d', '', 0, False, revid1)
 
867
                  ('d', '', 0, False, revid2)
1021
868
                  ])],
1022
869
                list(state._iter_entries()))
1023
870
        finally:
1038
885
        finally:
1039
886
            tree1.unlock()
1040
887
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
1041
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
888
        tree2 = MemoryTree.create_on_branch(branch2)
1042
889
        tree2.lock_write()
1043
890
        try:
1044
891
            tree2.put_file_bytes_non_atomic('file-id', 'new file-content')
1045
892
            revid2 = tree2.commit('foo')
1046
 
            root_id = tree2.get_root_id()
 
893
            root_id = tree2.inventory.root.file_id
1047
894
        finally:
1048
895
            tree2.unlock()
1049
896
        # check the layout in memory
1051
898
            (('', '', root_id), [
1052
899
             ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1053
900
             ('d', '', 0, False, revid1.encode('utf8')),
1054
 
             ('d', '', 0, False, revid1.encode('utf8'))
 
901
             ('d', '', 0, False, revid2.encode('utf8'))
1055
902
             ]),
1056
903
            (('', 'a file', 'file-id'), [
1057
904
             ('a', '', 0, False, ''),
1089
936
            (('', '', 'TREE_ROOT'), [
1090
937
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1091
938
             ]),
1092
 
            (('', 'a file', 'a-file-id'), [
 
939
            (('', 'a file', 'a file id'), [
1093
940
             ('f', '1'*20, 19, False, dirstate.pack_stat(stat)), # current tree
1094
941
             ]),
1095
942
            ]
1096
943
        try:
1097
 
            state.add('a file', 'a-file-id', 'file', stat, '1'*20)
 
944
            state.add('a file', 'a file id', 'file', stat, '1'*20)
1098
945
            # having added it, it should be in the output of iter_entries.
1099
946
            self.assertEqual(expected_entries, list(state._iter_entries()))
1100
947
            # saving and reloading should not affect this.
1103
950
            state.unlock()
1104
951
        state = dirstate.DirState.on_file('dirstate')
1105
952
        state.lock_read()
1106
 
        self.addCleanup(state.unlock)
1107
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
953
        try:
 
954
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
955
        finally:
 
956
            state.unlock()
1108
957
 
1109
958
    def test_add_path_to_unversioned_directory(self):
1110
959
        """Adding a path to an unversioned directory should error.
1115
964
        """
1116
965
        self.build_tree(['unversioned/', 'unversioned/a file'])
1117
966
        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)
 
967
        try:
 
968
            self.assertRaises(errors.NotVersionedError, state.add,
 
969
                'unversioned/a file', 'a file id', 'file', None, None)
 
970
        finally:
 
971
            state.unlock()
1121
972
 
1122
973
    def test_add_directory_to_root_no_parents_all_data(self):
1123
974
        # The most trivial addition of a dir is when there are no parents and
1143
994
            state.unlock()
1144
995
        state = dirstate.DirState.on_file('dirstate')
1145
996
        state.lock_read()
1146
 
        self.addCleanup(state.unlock)
1147
997
        state._validate()
1148
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
998
        try:
 
999
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
1000
        finally:
 
1001
            state.unlock()
1149
1002
 
1150
 
    def _test_add_symlink_to_root_no_parents_all_data(self, link_name, target):
 
1003
    def test_add_symlink_to_root_no_parents_all_data(self):
1151
1004
        # The most trivial addition of a symlink when there are no parents and
1152
1005
        # its in the root and all data about the file is supplied
1153
1006
        # 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)
 
1007
        if not has_symlinks():
 
1008
            raise TestSkipped("No symlink support")
 
1009
        os.symlink('target', 'a link')
 
1010
        stat = os.lstat('a link')
1157
1011
        expected_entries = [
1158
1012
            (('', '', 'TREE_ROOT'), [
1159
1013
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1160
1014
             ]),
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
 
1015
            (('', 'a link', 'a link id'), [
 
1016
             ('l', 'target', 6, False, dirstate.pack_stat(stat)), # current tree
1164
1017
             ]),
1165
1018
            ]
1166
1019
        state = dirstate.DirState.initialize('dirstate')
1167
1020
        try:
1168
 
            state.add(link_name, 'a link id', 'symlink', stat,
1169
 
                      target.encode('UTF-8'))
 
1021
            state.add('a link', 'a link id', 'symlink', stat, 'target')
1170
1022
            # having added it, it should be in the output of iter_entries.
1171
1023
            self.assertEqual(expected_entries, list(state._iter_entries()))
1172
1024
            # saving and reloading should not affect this.
1175
1027
            state.unlock()
1176
1028
        state = dirstate.DirState.on_file('dirstate')
1177
1029
        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')
 
1030
        try:
 
1031
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
1032
        finally:
 
1033
            state.unlock()
1188
1034
 
1189
1035
    def test_add_directory_and_child_no_parents_all_data(self):
1190
1036
        # after adding a directory, we should be able to add children to it.
1198
1044
            (('', 'a dir', 'a dir id'), [
1199
1045
             ('d', '', 0, False, dirstate.pack_stat(dirstat)), # current tree
1200
1046
             ]),
1201
 
            (('a dir', 'a file', 'a-file-id'), [
 
1047
            (('a dir', 'a file', 'a file id'), [
1202
1048
             ('f', '1'*20, 25, False,
1203
1049
              dirstate.pack_stat(filestat)), # current tree details
1204
1050
             ]),
1206
1052
        state = dirstate.DirState.initialize('dirstate')
1207
1053
        try:
1208
1054
            state.add('a dir', 'a dir id', 'directory', dirstat, None)
1209
 
            state.add('a dir/a file', 'a-file-id', 'file', filestat, '1'*20)
 
1055
            state.add('a dir/a file', 'a file id', 'file', filestat, '1'*20)
1210
1056
            # added it, it should be in the output of iter_entries.
1211
1057
            self.assertEqual(expected_entries, list(state._iter_entries()))
1212
1058
            # saving and reloading should not affect this.
1215
1061
            state.unlock()
1216
1062
        state = dirstate.DirState.on_file('dirstate')
1217
1063
        state.lock_read()
1218
 
        self.addCleanup(state.unlock)
1219
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
1064
        try:
 
1065
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
1066
        finally:
 
1067
            state.unlock()
1220
1068
 
1221
1069
    def test_add_tree_reference(self):
1222
1070
        # make a dirstate and add a tree reference
1236
1084
            state.unlock()
1237
1085
        # now check we can read it back
1238
1086
        state.lock_read()
1239
 
        self.addCleanup(state.unlock)
1240
1087
        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)
 
1088
        try:
 
1089
            entry2 = state._get_entry(0, 'subdir-id', 'subdir')
 
1090
            self.assertEqual(entry, entry2)
 
1091
            self.assertEqual(entry, expected_entry)
 
1092
            # and lookup by id should work too
 
1093
            entry2 = state._get_entry(0, fileid_utf8='subdir-id')
 
1094
            self.assertEqual(entry, expected_entry)
 
1095
        finally:
 
1096
            state.unlock()
1247
1097
 
1248
1098
    def test_add_forbidden_names(self):
1249
1099
        state = dirstate.DirState.initialize('dirstate')
1253
1103
        self.assertRaises(errors.BzrError,
1254
1104
            state.add, '..', 'ass-id', 'directory', None, None)
1255
1105
 
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
1106
 
1289
1107
class TestGetLines(TestCaseWithDirState):
1290
1108
 
1503
1321
            state.unlock()
1504
1322
 
1505
1323
 
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):
 
1324
class TestDirstateSortOrder(TestCaseWithTransport):
1623
1325
    """Test that DirState adds entries in the right order."""
1624
1326
 
1625
1327
    def test_add_sorting(self):
1674
1376
 
1675
1377
        # *really* cheesy way to just get an empty tree
1676
1378
        repo = self.make_repository('repo')
1677
 
        empty_tree = repo.revision_tree(_mod_revision.NULL_REVISION)
 
1379
        empty_tree = repo.revision_tree(None)
1678
1380
        state.set_parent_trees([('null:', empty_tree)], [])
1679
1381
 
1680
1382
        dirblock_names = [d[0] for d in state._dirblocks]
1684
1386
class InstrumentedDirState(dirstate.DirState):
1685
1387
    """An DirState with instrumented sha1 functionality."""
1686
1388
 
1687
 
    def __init__(self, path, sha1_provider):
1688
 
        super(InstrumentedDirState, self).__init__(path, sha1_provider)
 
1389
    def __init__(self, path):
 
1390
        super(InstrumentedDirState, self).__init__(path)
1689
1391
        self._time_offset = 0
1690
1392
        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
1393
 
1695
1394
    def _sha_cutoff_time(self):
1696
1395
        timestamp = super(InstrumentedDirState, self)._sha_cutoff_time()
1697
1396
        self._cutoff_time = timestamp + self._time_offset
1698
1397
 
1699
 
    def _sha1_file_and_log(self, abspath):
 
1398
    def _sha1_file(self, abspath, entry):
1700
1399
        self._log.append(('sha1', abspath))
1701
 
        return self._sha1_provider.sha1(abspath)
 
1400
        return super(InstrumentedDirState, self)._sha1_file(abspath, entry)
1702
1401
 
1703
1402
    def _read_link(self, abspath, old_link):
1704
1403
        self._log.append(('read_link', abspath, old_link))
1735
1434
        self.st_ino = ino
1736
1435
        self.st_mode = mode
1737
1436
 
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):
 
1437
 
 
1438
class TestUpdateEntry(TestCaseWithDirState):
 
1439
    """Test the DirState.update_entry functions"""
 
1440
 
 
1441
    def get_state_with_a(self):
 
1442
        """Create a DirState tracking a single object named 'a'"""
 
1443
        state = InstrumentedDirState.initialize('dirstate')
 
1444
        self.addCleanup(state.unlock)
 
1445
        state.add('a', 'a-id', 'file', None, '')
 
1446
        entry = state._get_entry(0, path_utf8='a')
 
1447
        return state, entry
 
1448
 
 
1449
    def test_update_entry(self):
 
1450
        state, entry = self.get_state_with_a()
 
1451
        self.build_tree(['a'])
 
1452
        # Add one where we don't provide the stat or sha already
 
1453
        self.assertEqual(('', 'a', 'a-id'), entry[0])
 
1454
        self.assertEqual([('f', '', 0, False, dirstate.DirState.NULLSTAT)],
 
1455
                         entry[1])
 
1456
        # Flush the buffers to disk
 
1457
        state.save()
 
1458
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1459
                         state._dirblock_state)
 
1460
 
 
1461
        stat_value = os.lstat('a')
 
1462
        packed_stat = dirstate.pack_stat(stat_value)
 
1463
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1464
                                          stat_value=stat_value)
 
1465
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1466
                         link_or_sha1)
 
1467
 
 
1468
        # The dirblock entry should not cache the file's sha1
 
1469
        self.assertEqual([('f', '', 14, False, dirstate.DirState.NULLSTAT)],
 
1470
                         entry[1])
 
1471
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1472
                         state._dirblock_state)
 
1473
        mode = stat_value.st_mode
 
1474
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False)], state._log)
 
1475
 
 
1476
        state.save()
 
1477
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1478
                         state._dirblock_state)
 
1479
 
 
1480
        # If we do it again right away, we don't know if the file has changed
 
1481
        # so we will re-read the file. Roll the clock back so the file is
 
1482
        # guaranteed to look too new.
 
1483
        state.adjust_time(-10)
 
1484
 
 
1485
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1486
                                          stat_value=stat_value)
 
1487
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1488
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1489
                         ], state._log)
 
1490
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1491
                         link_or_sha1)
 
1492
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1493
                         state._dirblock_state)
 
1494
        self.assertEqual([('f', '', 14, False, dirstate.DirState.NULLSTAT)],
 
1495
                         entry[1])
 
1496
        state.save()
 
1497
 
 
1498
        # However, if we move the clock forward so the file is considered
 
1499
        # "stable", it should just cache the value.
 
1500
        state.adjust_time(+20)
 
1501
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1502
                                          stat_value=stat_value)
 
1503
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1504
                         link_or_sha1)
 
1505
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1506
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1507
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1508
                         ], state._log)
 
1509
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1510
                         entry[1])
 
1511
 
 
1512
        # Subsequent calls will just return the cached value
 
1513
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1514
                                          stat_value=stat_value)
 
1515
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1516
                         link_or_sha1)
 
1517
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1518
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1519
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1520
                         ], state._log)
 
1521
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1522
                         entry[1])
 
1523
 
 
1524
    def test_update_entry_symlink(self):
 
1525
        """Update entry should read symlinks."""
 
1526
        if not osutils.has_symlinks():
 
1527
            # PlatformDeficiency / TestSkipped
 
1528
            raise TestSkipped("No symlink support")
 
1529
        state, entry = self.get_state_with_a()
 
1530
        state.save()
 
1531
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1532
                         state._dirblock_state)
 
1533
        os.symlink('target', 'a')
 
1534
 
 
1535
        state.adjust_time(-10) # Make the symlink look new
 
1536
        stat_value = os.lstat('a')
 
1537
        packed_stat = dirstate.pack_stat(stat_value)
 
1538
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1539
                                          stat_value=stat_value)
 
1540
        self.assertEqual('target', link_or_sha1)
 
1541
        self.assertEqual([('read_link', 'a', '')], state._log)
 
1542
        # Dirblock is not updated (the link is too new)
 
1543
        self.assertEqual([('l', '', 6, False, dirstate.DirState.NULLSTAT)],
 
1544
                         entry[1])
 
1545
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1546
                         state._dirblock_state)
 
1547
 
 
1548
        # Because the stat_value looks new, we should re-read the target
 
1549
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1550
                                          stat_value=stat_value)
 
1551
        self.assertEqual('target', link_or_sha1)
 
1552
        self.assertEqual([('read_link', 'a', ''),
 
1553
                          ('read_link', 'a', ''),
 
1554
                         ], state._log)
 
1555
        self.assertEqual([('l', '', 6, False, dirstate.DirState.NULLSTAT)],
 
1556
                         entry[1])
 
1557
        state.adjust_time(+20) # Skip into the future, all files look old
 
1558
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1559
                                          stat_value=stat_value)
 
1560
        self.assertEqual('target', link_or_sha1)
 
1561
        # We need to re-read the link because only now can we cache it
 
1562
        self.assertEqual([('read_link', 'a', ''),
 
1563
                          ('read_link', 'a', ''),
 
1564
                          ('read_link', 'a', ''),
 
1565
                         ], state._log)
 
1566
        self.assertEqual([('l', 'target', 6, False, packed_stat)],
 
1567
                         entry[1])
 
1568
 
 
1569
        # Another call won't re-read the link
 
1570
        self.assertEqual([('read_link', 'a', ''),
 
1571
                          ('read_link', 'a', ''),
 
1572
                          ('read_link', 'a', ''),
 
1573
                         ], state._log)
 
1574
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1575
                                          stat_value=stat_value)
 
1576
        self.assertEqual('target', link_or_sha1)
 
1577
        self.assertEqual([('l', 'target', 6, False, packed_stat)],
 
1578
                         entry[1])
 
1579
 
 
1580
    def do_update_entry(self, state, entry, abspath):
 
1581
        stat_value = os.lstat(abspath)
 
1582
        return state.update_entry(entry, abspath, stat_value)
 
1583
 
 
1584
    def test_update_entry_dir(self):
 
1585
        state, entry = self.get_state_with_a()
 
1586
        self.build_tree(['a/'])
 
1587
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1588
 
 
1589
    def test_update_entry_dir_unchanged(self):
 
1590
        state, entry = self.get_state_with_a()
 
1591
        self.build_tree(['a/'])
 
1592
        state.adjust_time(+20)
 
1593
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1594
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1595
                         state._dirblock_state)
 
1596
        state.save()
 
1597
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1598
                         state._dirblock_state)
 
1599
        self.assertIs(None, self.do_update_entry(state, entry, 'a'))
 
1600
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1601
                         state._dirblock_state)
 
1602
 
 
1603
    def test_update_entry_file_unchanged(self):
 
1604
        state, entry = self.get_state_with_a()
 
1605
        self.build_tree(['a'])
 
1606
        sha1sum = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1607
        state.adjust_time(+20)
 
1608
        self.assertEqual(sha1sum, self.do_update_entry(state, entry, 'a'))
 
1609
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1610
                         state._dirblock_state)
 
1611
        state.save()
 
1612
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1613
                         state._dirblock_state)
 
1614
        self.assertEqual(sha1sum, self.do_update_entry(state, entry, 'a'))
 
1615
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1616
                         state._dirblock_state)
 
1617
 
 
1618
    def create_and_test_file(self, state, entry):
 
1619
        """Create a file at 'a' and verify the state finds it.
 
1620
 
 
1621
        The state should already be versioning *something* at 'a'. This makes
 
1622
        sure that state.update_entry recognizes it as a file.
 
1623
        """
 
1624
        self.build_tree(['a'])
 
1625
        stat_value = os.lstat('a')
 
1626
        packed_stat = dirstate.pack_stat(stat_value)
 
1627
 
 
1628
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1629
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1630
                         link_or_sha1)
 
1631
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1632
                         entry[1])
 
1633
        return packed_stat
 
1634
 
 
1635
    def create_and_test_dir(self, state, entry):
 
1636
        """Create a directory at 'a' and verify the state finds it.
 
1637
 
 
1638
        The state should already be versioning *something* at 'a'. This makes
 
1639
        sure that state.update_entry recognizes it as a directory.
 
1640
        """
 
1641
        self.build_tree(['a/'])
 
1642
        stat_value = os.lstat('a')
 
1643
        packed_stat = dirstate.pack_stat(stat_value)
 
1644
 
 
1645
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1646
        self.assertIs(None, link_or_sha1)
 
1647
        self.assertEqual([('d', '', 0, False, packed_stat)], entry[1])
 
1648
 
 
1649
        return packed_stat
 
1650
 
 
1651
    def create_and_test_symlink(self, state, entry):
 
1652
        """Create a symlink at 'a' and verify the state finds it.
 
1653
 
 
1654
        The state should already be versioning *something* at 'a'. This makes
 
1655
        sure that state.update_entry recognizes it as a symlink.
 
1656
 
 
1657
        This should not be called if this platform does not have symlink
 
1658
        support.
 
1659
        """
 
1660
        # caller should care about skipping test on platforms without symlinks
 
1661
        os.symlink('path/to/foo', 'a')
 
1662
 
 
1663
        stat_value = os.lstat('a')
 
1664
        packed_stat = dirstate.pack_stat(stat_value)
 
1665
 
 
1666
        link_or_sha1 = self.do_update_entry(state, entry, abspath='a')
 
1667
        self.assertEqual('path/to/foo', link_or_sha1)
 
1668
        self.assertEqual([('l', 'path/to/foo', 11, False, packed_stat)],
 
1669
                         entry[1])
 
1670
        return packed_stat
 
1671
 
 
1672
    def test_update_file_to_dir(self):
 
1673
        """If a file changes to a directory we return None for the sha.
 
1674
        We also update the inventory record.
 
1675
        """
 
1676
        state, entry = self.get_state_with_a()
 
1677
        # The file sha1 won't be cached unless the file is old
 
1678
        state.adjust_time(+10)
 
1679
        self.create_and_test_file(state, entry)
 
1680
        os.remove('a')
 
1681
        self.create_and_test_dir(state, entry)
 
1682
 
 
1683
    def test_update_file_to_symlink(self):
 
1684
        """File becomes a symlink"""
 
1685
        if not osutils.has_symlinks():
 
1686
            # PlatformDeficiency / TestSkipped
 
1687
            raise TestSkipped("No symlink support")
 
1688
        state, entry = self.get_state_with_a()
 
1689
        # The file sha1 won't be cached unless the file is old
 
1690
        state.adjust_time(+10)
 
1691
        self.create_and_test_file(state, entry)
 
1692
        os.remove('a')
 
1693
        self.create_and_test_symlink(state, entry)
 
1694
 
 
1695
    def test_update_dir_to_file(self):
 
1696
        """Directory becoming a file updates the entry."""
 
1697
        state, entry = self.get_state_with_a()
 
1698
        # The file sha1 won't be cached unless the file is old
 
1699
        state.adjust_time(+10)
 
1700
        self.create_and_test_dir(state, entry)
 
1701
        os.rmdir('a')
 
1702
        self.create_and_test_file(state, entry)
 
1703
 
 
1704
    def test_update_dir_to_symlink(self):
 
1705
        """Directory becomes a symlink"""
 
1706
        if not osutils.has_symlinks():
 
1707
            # PlatformDeficiency / TestSkipped
 
1708
            raise TestSkipped("No symlink support")
 
1709
        state, entry = self.get_state_with_a()
 
1710
        # The symlink target won't be cached if it isn't old
 
1711
        state.adjust_time(+10)
 
1712
        self.create_and_test_dir(state, entry)
 
1713
        os.rmdir('a')
 
1714
        self.create_and_test_symlink(state, entry)
 
1715
 
 
1716
    def test_update_symlink_to_file(self):
 
1717
        """Symlink becomes a file"""
 
1718
        if not has_symlinks():
 
1719
            raise TestSkipped("No symlink support")
 
1720
        state, entry = self.get_state_with_a()
 
1721
        # The symlink and file info won't be cached unless old
 
1722
        state.adjust_time(+10)
 
1723
        self.create_and_test_symlink(state, entry)
 
1724
        os.remove('a')
 
1725
        self.create_and_test_file(state, entry)
 
1726
 
 
1727
    def test_update_symlink_to_dir(self):
 
1728
        """Symlink becomes a directory"""
 
1729
        if not has_symlinks():
 
1730
            raise TestSkipped("No symlink support")
 
1731
        state, entry = self.get_state_with_a()
 
1732
        # The symlink target won't be cached if it isn't old
 
1733
        state.adjust_time(+10)
 
1734
        self.create_and_test_symlink(state, entry)
 
1735
        os.remove('a')
 
1736
        self.create_and_test_dir(state, entry)
 
1737
 
 
1738
    def test__is_executable_win32(self):
 
1739
        state, entry = self.get_state_with_a()
 
1740
        self.build_tree(['a'])
 
1741
 
 
1742
        # Make sure we are using the win32 implementation of _is_executable
 
1743
        state._is_executable = state._is_executable_win32
 
1744
 
 
1745
        # The file on disk is not executable, but we are marking it as though
 
1746
        # it is. With _is_executable_win32 we ignore what is on disk.
 
1747
        entry[1][0] = ('f', '', 0, True, dirstate.DirState.NULLSTAT)
 
1748
 
 
1749
        stat_value = os.lstat('a')
 
1750
        packed_stat = dirstate.pack_stat(stat_value)
 
1751
 
 
1752
        state.adjust_time(-10) # Make sure everything is new
 
1753
        state.update_entry(entry, abspath='a', stat_value=stat_value)
 
1754
 
 
1755
        # The row is updated, but the executable bit stays set.
 
1756
        self.assertEqual([('f', '', 14, True, dirstate.DirState.NULLSTAT)],
 
1757
                         entry[1])
 
1758
 
 
1759
        # Make the disk object look old enough to cache
 
1760
        state.adjust_time(+20)
 
1761
        digest = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1762
        state.update_entry(entry, abspath='a', stat_value=stat_value)
 
1763
        self.assertEqual([('f', digest, 14, True, packed_stat)], entry[1])
 
1764
 
 
1765
 
 
1766
class TestPackStat(TestCaseWithTransport):
1745
1767
 
1746
1768
    def assertPackStat(self, expected, stat_value):
1747
1769
        """Check the packed and serialized form of a stat value."""
1796
1818
class TestBisect(TestCaseWithDirState):
1797
1819
    """Test the ability to bisect into the disk format."""
1798
1820
 
 
1821
 
1799
1822
    def assertBisect(self, expected_map, map_keys, state, paths):
1800
1823
        """Assert that bisecting for paths returns the right result.
1801
1824
 
1806
1829
                      (dir, name) tuples, and sorted according to how _bisect
1807
1830
                      requires.
1808
1831
        """
1809
 
        result = state._bisect(paths)
 
1832
        dir_names = sorted(osutils.split(p) for p in paths)
 
1833
        result = state._bisect(dir_names)
1810
1834
        # For now, results are just returned in whatever order we read them.
1811
1835
        # We could sort by (dir, name, file_id) or something like that, but in
1812
1836
        # the end it would still be fairly arbitrary, and we don't want the
1813
1837
        # extra overhead if we can avoid it. So sort everything to make sure
1814
1838
        # equality is true
1815
 
        self.assertEqual(len(map_keys), len(paths))
 
1839
        assert len(map_keys) == len(dir_names)
1816
1840
        expected = {}
1817
 
        for path, keys in zip(paths, map_keys):
 
1841
        for dir_name, keys in zip(dir_names, map_keys):
1818
1842
            if keys is None:
1819
1843
                # This should not be present in the output
1820
1844
                continue
1821
 
            expected[path] = sorted(expected_map[k] for k in keys)
 
1845
            expected[dir_name] = sorted(expected_map[k] for k in keys)
1822
1846
 
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()
 
1847
        for dir_name in result:
 
1848
            result[dir_name].sort()
1827
1849
 
1828
1850
        self.assertEqual(expected, result)
1829
1851
 
1837
1859
        :param paths: A list of directories
1838
1860
        """
1839
1861
        result = state._bisect_dirblocks(paths)
1840
 
        self.assertEqual(len(map_keys), len(paths))
 
1862
        assert len(map_keys) == len(paths)
 
1863
 
1841
1864
        expected = {}
1842
1865
        for path, keys in zip(paths, map_keys):
1843
1866
            if keys is None:
1865
1888
            dir_name_id, trees_info = entry
1866
1889
            expected[dir_name_id] = trees_info
1867
1890
 
1868
 
        result = state._bisect_recursive(paths)
 
1891
        dir_names = sorted(osutils.split(p) for p in paths)
 
1892
        result = state._bisect_recursive(dir_names)
1869
1893
 
1870
1894
        self.assertEqual(expected, result)
1871
1895
 
1880
1904
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1881
1905
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1882
1906
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1883
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1884
1907
        self.assertBisect(expected, [['f']], state, ['f'])
1885
1908
 
1886
1909
    def test_bisect_multi(self):
1889
1912
        # Bisect should be capable of finding multiple entries at the same time
1890
1913
        self.assertBisect(expected, [['a'], ['b'], ['f']],
1891
1914
                          state, ['a', 'b', 'f'])
 
1915
        # ('', 'f') sorts before the others
1892
1916
        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'])
 
1917
                          state, ['b/d', 'b/d/e', 'f'])
1896
1918
 
1897
1919
    def test_bisect_one_page(self):
1898
1920
        """Test bisect when there is only 1 page to read"""
1904
1926
        self.assertBisect(expected,[['b/c']], state, ['b/c'])
1905
1927
        self.assertBisect(expected,[['b/d']], state, ['b/d'])
1906
1928
        self.assertBisect(expected,[['b/d/e']], state, ['b/d/e'])
1907
 
        self.assertBisect(expected,[['b-c']], state, ['b-c'])
1908
1929
        self.assertBisect(expected,[['f']], state, ['f'])
1909
1930
        self.assertBisect(expected,[['a'], ['b'], ['f']],
1910
1931
                          state, ['a', 'b', 'f'])
1911
 
        self.assertBisect(expected, [['b/d'], ['b/d/e'], ['f']],
 
1932
        # ('', 'f') sorts before the others
 
1933
        self.assertBisect(expected, [['f'], ['b/d'], ['b/d/e']],
1912
1934
                          state, ['b/d', 'b/d/e', 'f'])
1913
 
        self.assertBisect(expected, [['b'], ['b/c'], ['b-c']],
1914
 
                          state, ['b', 'b/c', 'b-c'])
1915
1935
 
1916
1936
    def test_bisect_duplicate_paths(self):
1917
1937
        """When bisecting for a path, handle multiple entries."""
1925
1945
        self.assertBisect(expected, [['b/d', 'b/d2']], state, ['b/d'])
1926
1946
        self.assertBisect(expected, [['b/d/e', 'b/d/e2']],
1927
1947
                          state, ['b/d/e'])
1928
 
        self.assertBisect(expected, [['b-c', 'b-c2']], state, ['b-c'])
1929
1948
        self.assertBisect(expected, [['f', 'f2']], state, ['f'])
1930
1949
 
1931
1950
    def test_bisect_page_size_too_small(self):
1938
1957
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1939
1958
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1940
1959
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1941
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1942
1960
        self.assertBisect(expected, [['f']], state, ['f'])
1943
1961
 
1944
1962
    def test_bisect_missing(self):
1947
1965
        self.assertBisect(expected, [None], state, ['foo'])
1948
1966
        self.assertBisect(expected, [None], state, ['b/foo'])
1949
1967
        self.assertBisect(expected, [None], state, ['bar/foo'])
1950
 
        self.assertBisect(expected, [None], state, ['b-c/foo'])
1951
1968
 
1952
1969
        self.assertBisect(expected, [['a'], None, ['b/d']],
1953
1970
                          state, ['a', 'foo', 'b/d'])
1969
1986
    def test_bisect_dirblocks(self):
1970
1987
        tree, state, expected = self.create_duplicated_dirstate()
1971
1988
        self.assertBisectDirBlocks(expected,
1972
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2']],
1973
 
            state, [''])
 
1989
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2']], state, [''])
1974
1990
        self.assertBisectDirBlocks(expected,
1975
1991
            [['b/c', 'b/c2', 'b/d', 'b/d2']], state, ['b'])
1976
1992
        self.assertBisectDirBlocks(expected,
1977
1993
            [['b/d/e', 'b/d/e2']], state, ['b/d'])
1978
1994
        self.assertBisectDirBlocks(expected,
1979
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2'],
 
1995
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2'],
1980
1996
             ['b/c', 'b/c2', 'b/d', 'b/d2'],
1981
1997
             ['b/d/e', 'b/d/e2'],
1982
1998
            ], state, ['', 'b', 'b/d'])
1997
2013
        self.assertBisectRecursive(expected, ['a'], state, ['a'])
1998
2014
        self.assertBisectRecursive(expected, ['b/c'], state, ['b/c'])
1999
2015
        self.assertBisectRecursive(expected, ['b/d/e'], state, ['b/d/e'])
2000
 
        self.assertBisectRecursive(expected, ['b-c'], state, ['b-c'])
2001
2016
        self.assertBisectRecursive(expected, ['b/d', 'b/d/e'],
2002
2017
                                   state, ['b/d'])
2003
2018
        self.assertBisectRecursive(expected, ['b', 'b/c', 'b/d', 'b/d/e'],
2004
2019
                                   state, ['b'])
2005
 
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'b-c', 'f', 'b/c',
 
2020
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'f', 'b/c',
2006
2021
                                              'b/d', 'b/d/e'],
2007
2022
                                   state, [''])
2008
2023
 
2032
2047
                                   state, ['b'])
2033
2048
 
2034
2049
 
 
2050
class TestBisectDirblock(TestCase):
 
2051
    """Test that bisect_dirblock() returns the expected values.
 
2052
 
 
2053
    bisect_dirblock is intended to work like bisect.bisect_left() except it
 
2054
    knows it is working on dirblocks and that dirblocks are sorted by ('path',
 
2055
    'to', 'foo') chunks rather than by raw 'path/to/foo'.
 
2056
    """
 
2057
 
 
2058
    def assertBisect(self, dirblocks, split_dirblocks, path, *args, **kwargs):
 
2059
        """Assert that bisect_split works like bisect_left on the split paths.
 
2060
 
 
2061
        :param dirblocks: A list of (path, [info]) pairs.
 
2062
        :param split_dirblocks: A list of ((split, path), [info]) pairs.
 
2063
        :param path: The path we are indexing.
 
2064
 
 
2065
        All other arguments will be passed along.
 
2066
        """
 
2067
        bisect_split_idx = dirstate.bisect_dirblock(dirblocks, path,
 
2068
                                                 *args, **kwargs)
 
2069
        split_dirblock = (path.split('/'), [])
 
2070
        bisect_left_idx = bisect.bisect_left(split_dirblocks, split_dirblock,
 
2071
                                             *args)
 
2072
        self.assertEqual(bisect_left_idx, bisect_split_idx,
 
2073
                         'bisect_split disagreed. %s != %s'
 
2074
                         ' for key %s'
 
2075
                         % (bisect_left_idx, bisect_split_idx, path)
 
2076
                         )
 
2077
 
 
2078
    def paths_to_dirblocks(self, paths):
 
2079
        """Convert a list of paths into dirblock form.
 
2080
 
 
2081
        Also, ensure that the paths are in proper sorted order.
 
2082
        """
 
2083
        dirblocks = [(path, []) for path in paths]
 
2084
        split_dirblocks = [(path.split('/'), []) for path in paths]
 
2085
        self.assertEqual(sorted(split_dirblocks), split_dirblocks)
 
2086
        return dirblocks, split_dirblocks
 
2087
 
 
2088
    def test_simple(self):
 
2089
        """In the simple case it works just like bisect_left"""
 
2090
        paths = ['', 'a', 'b', 'c', 'd']
 
2091
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2092
        for path in paths:
 
2093
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2094
        self.assertBisect(dirblocks, split_dirblocks, '_')
 
2095
        self.assertBisect(dirblocks, split_dirblocks, 'aa')
 
2096
        self.assertBisect(dirblocks, split_dirblocks, 'bb')
 
2097
        self.assertBisect(dirblocks, split_dirblocks, 'cc')
 
2098
        self.assertBisect(dirblocks, split_dirblocks, 'dd')
 
2099
        self.assertBisect(dirblocks, split_dirblocks, 'a/a')
 
2100
        self.assertBisect(dirblocks, split_dirblocks, 'b/b')
 
2101
        self.assertBisect(dirblocks, split_dirblocks, 'c/c')
 
2102
        self.assertBisect(dirblocks, split_dirblocks, 'd/d')
 
2103
 
 
2104
    def test_involved(self):
 
2105
        """This is where bisect_left diverges slightly."""
 
2106
        paths = ['', 'a',
 
2107
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2108
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2109
                 'a-a', 'a-z',
 
2110
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2111
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2112
                 'z-a', 'z-z',
 
2113
                ]
 
2114
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2115
        for path in paths:
 
2116
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2117
 
 
2118
    def test_involved_cached(self):
 
2119
        """This is where bisect_left diverges slightly."""
 
2120
        paths = ['', 'a',
 
2121
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2122
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2123
                 'a-a', 'a-z',
 
2124
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2125
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2126
                 'z-a', 'z-z',
 
2127
                ]
 
2128
        cache = {}
 
2129
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2130
        for path in paths:
 
2131
            self.assertBisect(dirblocks, split_dirblocks, path, cache=cache)
 
2132
 
 
2133
 
2035
2134
class TestDirstateValidation(TestCaseWithDirState):
2036
2135
 
2037
2136
    def test_validate_correct_dirstate(self):
2087
2186
            state._validate)
2088
2187
        self.assertContainsRe(str(e),
2089
2188
            '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)