/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: Robert Collins
  • Date: 2007-04-19 02:27:44 UTC
  • mto: This revision was merged to the branch mainline in revision 2426.
  • Revision ID: robertc@robertcollins.net-20070419022744-pfdqz42kp1wizh43
``make docs`` now creates a man page at ``man1/bzr.1`` fixing bug 107388.
(Robert Collins)

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
# Copyright (C) 2006-2011 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
import bisect
19
20
import os
 
21
import time
20
22
 
21
23
from bzrlib import (
22
24
    dirstate,
23
25
    errors,
24
 
    inventory,
25
 
    memorytree,
26
26
    osutils,
27
 
    revision as _mod_revision,
28
 
    tests,
29
27
    )
30
 
from bzrlib.tests import test_osutils
31
 
from bzrlib.tests.scenarios import load_tests_apply_scenarios
 
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
 
load_tests = load_tests_apply_scenarios
48
 
 
49
 
 
50
 
class TestCaseWithDirState(tests.TestCaseWithTransport):
 
50
class TestCaseWithDirState(TestCaseWithTransport):
51
51
    """Helper functions for creating DirState objects with various content."""
52
52
 
53
 
    scenarios = test_osutils.dir_reader_scenarios()
54
 
 
55
 
    # Set by load_tests
56
 
    _dir_reader_class = None
57
 
    _native_to_unicode = None # Not used yet
58
 
 
59
 
    def setUp(self):
60
 
        tests.TestCaseWithTransport.setUp(self)
61
 
 
62
 
        self.overrideAttr(osutils,
63
 
                          '_selected_dir_reader', self._dir_reader_class())
64
 
 
65
53
    def create_empty_dirstate(self):
66
54
        """Return a locked but empty dirstate"""
67
55
        state = dirstate.DirState.initialize('dirstate')
175
163
        """
176
164
        # The state should already be write locked, since we just had to do
177
165
        # some operation to get here.
178
 
        self.assertTrue(state._lock_token is not None)
 
166
        assert state._lock_token is not None
179
167
        try:
180
168
            self.assertEqual(expected_result[0],  state.get_parent_ids())
181
169
            # there should be no ghosts in this tree.
185
173
            state.save()
186
174
        finally:
187
175
            state.unlock()
188
 
        del state
 
176
        del state # Callers should unlock
189
177
        state = dirstate.DirState.on_file('dirstate')
190
178
        state.lock_read()
191
179
        try:
201
189
              c
202
190
              d/
203
191
                e
204
 
            b-c
205
192
            f
206
193
        """
207
194
        tree = self.make_branch_and_tree('tree')
208
 
        paths = ['a', 'b/', 'b/c', 'b/d/', 'b/d/e', 'b-c', 'f']
209
 
        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']
210
197
        self.build_tree(['tree/' + p for p in paths])
211
198
        tree.set_root_id('TREE_ROOT')
212
199
        tree.add([p.rstrip('/') for p in paths], file_ids)
213
200
        tree.commit('initial', rev_id='rev-1')
214
201
        revision_id = 'rev-1'
215
202
        # a_packed_stat = dirstate.pack_stat(os.stat('tree/a'))
216
 
        t = self.get_transport('tree')
 
203
        t = self.get_transport().clone('tree')
217
204
        a_text = t.get_bytes('a')
218
205
        a_sha = osutils.sha_string(a_text)
219
206
        a_len = len(a_text)
227
214
        e_text = t.get_bytes('b/d/e')
228
215
        e_sha = osutils.sha_string(e_text)
229
216
        e_len = len(e_text)
230
 
        b_c_text = t.get_bytes('b-c')
231
 
        b_c_sha = osutils.sha_string(b_c_text)
232
 
        b_c_len = len(b_c_text)
233
217
        # f_packed_stat = dirstate.pack_stat(os.stat('tree/f'))
234
218
        f_text = t.get_bytes('f')
235
219
        f_sha = osutils.sha_string(f_text)
260
244
                      ('f', '', 0, False, null_stat),
261
245
                      ('f', e_sha, e_len, False, revision_id),
262
246
                     ]),
263
 
            'b-c':(('', 'b-c', 'b-c-id'), [
264
 
                      ('f', '', 0, False, null_stat),
265
 
                      ('f', b_c_sha, b_c_len, False, revision_id),
266
 
                     ]),
267
247
            'f':(('', 'f', 'f-id'), [
268
248
                  ('f', '', 0, False, null_stat),
269
249
                  ('f', f_sha, f_len, False, revision_id),
296
276
        tree, state, expected = self.create_basic_dirstate()
297
277
        # Now we will just remove and add every file so we get an extra entry
298
278
        # per entry. Unversion in reverse order so we handle subdirs
299
 
        tree.unversion(['f-id', 'b-c-id', 'e-id', 'd-id', 'c-id', 'b-id', 'a-id'])
300
 
        tree.add(['a', 'b', 'b/c', 'b/d', 'b/d/e', 'b-c', 'f'],
301
 
                 ['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'])
302
282
 
303
283
        # Update the expected dictionary.
304
 
        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']:
305
285
            orig = expected[path]
306
286
            path2 = path + '2'
307
287
            # This record was deleted in the current tree
364
344
            state.lock_read()
365
345
        return tree, state, expected
366
346
 
367
 
 
368
347
class TestTreeToDirState(TestCaseWithDirState):
369
348
 
370
349
    def test_empty_to_dirstate(self):
372
351
        # There are no files on disk and no parents
373
352
        tree = self.make_branch_and_tree('tree')
374
353
        expected_result = ([], [
375
 
            (('', '', tree.get_root_id()), # common details
 
354
            (('', '', tree.path2id('')), # common details
376
355
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
377
356
             ])])
378
357
        state = dirstate.DirState.from_tree(tree, 'dirstate')
385
364
        rev_id = tree.commit('first post').encode('utf8')
386
365
        root_stat_pack = dirstate.pack_stat(os.stat(tree.basedir))
387
366
        expected_result = ([rev_id], [
388
 
            (('', '', tree.get_root_id()), # common details
 
367
            (('', '', tree.path2id('')), # common details
389
368
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
390
369
              ('d', '', 0, False, rev_id), # first parent details
391
370
             ])])
405
384
        rev_id2 = tree2.commit('second post', allow_pointless=True)
406
385
        tree.merge_from_branch(tree2.branch)
407
386
        expected_result = ([rev_id, rev_id2], [
408
 
            (('', '', tree.get_root_id()), # common details
 
387
            (('', '', tree.path2id('')), # common details
409
388
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
410
389
              ('d', '', 0, False, rev_id), # first parent details
411
 
              ('d', '', 0, False, rev_id), # second parent details
 
390
              ('d', '', 0, False, rev_id2), # second parent details
412
391
             ])])
413
392
        state = dirstate.DirState.from_tree(tree, 'dirstate')
414
393
        self.check_state_with_reopen(expected_result, state)
424
403
        tree = self.make_branch_and_tree('tree')
425
404
        self.build_tree(['tree/unknown'])
426
405
        expected_result = ([], [
427
 
            (('', '', tree.get_root_id()), # common details
 
406
            (('', '', tree.path2id('')), # common details
428
407
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
429
408
             ])])
430
409
        state = dirstate.DirState.from_tree(tree, 'dirstate')
433
412
    def get_tree_with_a_file(self):
434
413
        tree = self.make_branch_and_tree('tree')
435
414
        self.build_tree(['tree/a file'])
436
 
        tree.add('a file', 'a-file-id')
 
415
        tree.add('a file', 'a file id')
437
416
        return tree
438
417
 
439
418
    def test_non_empty_no_parents_to_dirstate(self):
441
420
        # There are files on disk and no parents
442
421
        tree = self.get_tree_with_a_file()
443
422
        expected_result = ([], [
444
 
            (('', '', tree.get_root_id()), # common details
 
423
            (('', '', tree.path2id('')), # common details
445
424
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
446
425
             ]),
447
 
            (('', 'a file', 'a-file-id'), # common
 
426
            (('', 'a file', 'a file id'), # common
448
427
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
449
428
             ]),
450
429
            ])
459
438
        # and length:
460
439
        self.build_tree_contents([('tree/a file', 'new content\n')])
461
440
        expected_result = ([rev_id], [
462
 
            (('', '', tree.get_root_id()), # common details
 
441
            (('', '', tree.path2id('')), # common details
463
442
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
464
443
              ('d', '', 0, False, rev_id), # first parent details
465
444
             ]),
466
 
            (('', 'a file', 'a-file-id'), # common
 
445
            (('', 'a file', 'a file id'), # common
467
446
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
468
447
              ('f', 'c3ed76e4bfd45ff1763ca206055bca8e9fc28aa8', 24, False,
469
448
               rev_id), # first parent
486
465
        # and length again, giving us three distinct values:
487
466
        self.build_tree_contents([('tree/a file', 'new content\n')])
488
467
        expected_result = ([rev_id, rev_id2], [
489
 
            (('', '', tree.get_root_id()), # common details
 
468
            (('', '', tree.path2id('')), # common details
490
469
             [('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
491
470
              ('d', '', 0, False, rev_id), # first parent details
492
 
              ('d', '', 0, False, rev_id), # second parent details
 
471
              ('d', '', 0, False, rev_id2), # second parent details
493
472
             ]),
494
 
            (('', 'a file', 'a-file-id'), # common
 
473
            (('', 'a file', 'a file id'), # common
495
474
             [('f', '', 0, False, dirstate.DirState.NULLSTAT), # current
496
475
              ('f', 'c3ed76e4bfd45ff1763ca206055bca8e9fc28aa8', 24, False,
497
476
               rev_id), # first parent
527
506
 
528
507
class TestDirStateOnFile(TestCaseWithDirState):
529
508
 
530
 
    def create_updated_dirstate(self):
531
 
        self.build_tree(['a-file'])
532
 
        tree = self.make_branch_and_tree('.')
533
 
        tree.add(['a-file'], ['a-id'])
534
 
        tree.commit('add a-file')
535
 
        # Save and unlock the state, re-open it in readonly mode
536
 
        state = dirstate.DirState.from_tree(tree, 'dirstate')
537
 
        state.save()
538
 
        state.unlock()
539
 
        state = dirstate.DirState.on_file('dirstate')
540
 
        state.lock_read()
541
 
        return state
542
 
 
543
509
    def test_construct_with_path(self):
544
510
        tree = self.make_branch_and_tree('tree')
545
511
        state = dirstate.DirState.from_tree(tree, 'dirstate.from_tree')
551
517
        # get a state object
552
518
        # no parents, default tree content
553
519
        expected_result = ([], [
554
 
            (('', '', tree.get_root_id()), # common details
 
520
            (('', '', tree.path2id('')), # common details
555
521
             # current tree details, but new from_tree skips statting, it
556
522
             # uses set_state_from_inventory, and thus depends on the
557
523
             # inventory state.
574
540
            state.unlock()
575
541
 
576
542
    def test_can_save_in_read_lock(self):
577
 
        state = self.create_updated_dirstate()
 
543
        self.build_tree(['a-file'])
 
544
        state = dirstate.DirState.initialize('dirstate')
 
545
        try:
 
546
            # No stat and no sha1 sum.
 
547
            state.add('a-file', 'a-file-id', 'file', None, '')
 
548
            state.save()
 
549
        finally:
 
550
            state.unlock()
 
551
 
 
552
        # Now open in readonly mode
 
553
        state = dirstate.DirState.on_file('dirstate')
 
554
        state.lock_read()
578
555
        try:
579
556
            entry = state._get_entry(0, path_utf8='a-file')
580
 
            # The current size should be 0 (default)
581
 
            self.assertEqual(0, entry[1][0][2])
 
557
            # The current sha1 sum should be empty
 
558
            self.assertEqual('', entry[1][0][1])
582
559
            # We should have a real entry.
583
560
            self.assertNotEqual((None, None), entry)
584
 
            # Set the cutoff-time into the future, so things look cacheable
585
 
            state._sha_cutoff_time()
586
 
            state._cutoff_time += 10.0
587
 
            st = os.lstat('a-file')
588
 
            sha1sum = dirstate.update_entry(state, entry, 'a-file', st)
589
 
            # We updated the current sha1sum because the file is cacheable
 
561
            sha1sum = state.update_entry(entry, 'a-file', os.lstat('a-file'))
 
562
            # We should have gotten a real sha1
590
563
            self.assertEqual('ecc5374e9ed82ad3ea3b4d452ea995a5fd3e70e3',
591
564
                             sha1sum)
592
565
 
593
566
            # The dirblock has been updated
594
 
            self.assertEqual(st.st_size, entry[1][0][2])
 
567
            self.assertEqual(sha1sum, entry[1][0][1])
595
568
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
596
569
                             state._dirblock_state)
597
570
 
607
580
        state.lock_read()
608
581
        try:
609
582
            entry = state._get_entry(0, path_utf8='a-file')
610
 
            self.assertEqual(st.st_size, entry[1][0][2])
 
583
            self.assertEqual(sha1sum, entry[1][0][1])
611
584
        finally:
612
585
            state.unlock()
613
586
 
614
587
    def test_save_fails_quietly_if_locked(self):
615
588
        """If dirstate is locked, save will fail without complaining."""
616
 
        state = self.create_updated_dirstate()
 
589
        self.build_tree(['a-file'])
 
590
        state = dirstate.DirState.initialize('dirstate')
 
591
        try:
 
592
            # No stat and no sha1 sum.
 
593
            state.add('a-file', 'a-file-id', 'file', None, '')
 
594
            state.save()
 
595
        finally:
 
596
            state.unlock()
 
597
 
 
598
        state = dirstate.DirState.on_file('dirstate')
 
599
        state.lock_read()
617
600
        try:
618
601
            entry = state._get_entry(0, path_utf8='a-file')
619
 
            # No cached sha1 yet.
620
 
            self.assertEqual('', entry[1][0][1])
621
 
            # Set the cutoff-time into the future, so things look cacheable
622
 
            state._sha_cutoff_time()
623
 
            state._cutoff_time += 10.0
624
 
            st = os.lstat('a-file')
625
 
            sha1sum = dirstate.update_entry(state, entry, 'a-file', st)
 
602
            sha1sum = state.update_entry(entry, 'a-file', os.lstat('a-file'))
 
603
            # We should have gotten a real sha1
626
604
            self.assertEqual('ecc5374e9ed82ad3ea3b4d452ea995a5fd3e70e3',
627
605
                             sha1sum)
628
606
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
647
625
                state2.unlock()
648
626
        finally:
649
627
            state.unlock()
650
 
 
 
628
        
651
629
        # The file on disk should not be modified.
652
630
        state = dirstate.DirState.on_file('dirstate')
653
631
        state.lock_read()
657
635
        finally:
658
636
            state.unlock()
659
637
 
660
 
    def test_save_refuses_if_changes_aborted(self):
661
 
        self.build_tree(['a-file', 'a-dir/'])
662
 
        state = dirstate.DirState.initialize('dirstate')
663
 
        try:
664
 
            # No stat and no sha1 sum.
665
 
            state.add('a-file', 'a-file-id', 'file', None, '')
666
 
            state.save()
667
 
        finally:
668
 
            state.unlock()
669
 
 
670
 
        # The dirstate should include TREE_ROOT and 'a-file' and nothing else
671
 
        expected_blocks = [
672
 
            ('', [(('', '', 'TREE_ROOT'),
673
 
                   [('d', '', 0, False, dirstate.DirState.NULLSTAT)])]),
674
 
            ('', [(('', 'a-file', 'a-file-id'),
675
 
                   [('f', '', 0, False, dirstate.DirState.NULLSTAT)])]),
676
 
        ]
677
 
 
678
 
        state = dirstate.DirState.on_file('dirstate')
679
 
        state.lock_write()
680
 
        try:
681
 
            state._read_dirblocks_if_needed()
682
 
            self.assertEqual(expected_blocks, state._dirblocks)
683
 
 
684
 
            # Now modify the state, but mark it as inconsistent
685
 
            state.add('a-dir', 'a-dir-id', 'directory', None, '')
686
 
            state._changes_aborted = True
687
 
            state.save()
688
 
        finally:
689
 
            state.unlock()
690
 
 
691
 
        state = dirstate.DirState.on_file('dirstate')
692
 
        state.lock_read()
693
 
        try:
694
 
            state._read_dirblocks_if_needed()
695
 
            self.assertEqual(expected_blocks, state._dirblocks)
696
 
        finally:
697
 
            state.unlock()
698
 
 
699
638
 
700
639
class TestDirStateInitialize(TestCaseWithDirState):
701
640
 
709
648
        try:
710
649
            self.assertIsInstance(state, dirstate.DirState)
711
650
            lines = state.get_lines()
712
 
        finally:
 
651
            self.assertFileEqual(''.join(state.get_lines()),
 
652
                'dirstate')
 
653
            self.check_state_with_reopen(expected_result, state)
 
654
        except:
713
655
            state.unlock()
714
 
        # On win32 you can't read from a locked file, even within the same
715
 
        # process. So we have to unlock and release before we check the file
716
 
        # contents.
717
 
        self.assertFileEqual(''.join(lines), 'dirstate')
718
 
        state.lock_read() # check_state_with_reopen will unlock
719
 
        self.check_state_with_reopen(expected_result, state)
 
656
            raise
720
657
 
721
658
 
722
659
class TestDirStateManipulations(TestCaseWithDirState):
723
660
 
724
 
    def make_minimal_tree(self):
725
 
        tree1 = self.make_branch_and_memory_tree('tree1')
726
 
        tree1.lock_write()
727
 
        self.addCleanup(tree1.unlock)
728
 
        tree1.add('')
729
 
        revid1 = tree1.commit('foo')
730
 
        return tree1, revid1
731
 
 
732
 
    def test_update_minimal_updates_id_index(self):
733
 
        state = self.create_dirstate_with_root_and_subdir()
734
 
        self.addCleanup(state.unlock)
735
 
        id_index = state._get_id_index()
736
 
        self.assertEqual(['a-root-value', 'subdir-id'], sorted(id_index))
737
 
        state.add('file-name', 'file-id', 'file', None, '')
738
 
        self.assertEqual(['a-root-value', 'file-id', 'subdir-id'],
739
 
                         sorted(id_index))
740
 
        state.update_minimal(('', 'new-name', 'file-id'), 'f',
741
 
                             path_utf8='new-name')
742
 
        self.assertEqual(['a-root-value', 'file-id', 'subdir-id'],
743
 
                         sorted(id_index))
744
 
        self.assertEqual([('', 'new-name', 'file-id')],
745
 
                         sorted(id_index['file-id']))
746
 
        state._validate()
747
 
 
748
661
    def test_set_state_from_inventory_no_content_no_parents(self):
749
662
        # setting the current inventory is a slow but important api to support.
750
 
        tree1, revid1 = self.make_minimal_tree()
751
 
        inv = tree1.inventory
752
 
        root_id = inv.path2id('')
 
663
        tree1 = self.make_branch_and_memory_tree('tree1')
 
664
        tree1.lock_write()
 
665
        try:
 
666
            tree1.add('')
 
667
            revid1 = tree1.commit('foo').encode('utf8')
 
668
            root_id = tree1.inventory.root.file_id
 
669
            inv = tree1.inventory
 
670
        finally:
 
671
            tree1.unlock()
753
672
        expected_result = [], [
754
673
            (('', '', root_id), [
755
674
             ('d', '', 0, False, dirstate.DirState.NULLSTAT)])]
767
686
            # This will unlock it
768
687
            self.check_state_with_reopen(expected_result, state)
769
688
 
770
 
    def test_set_state_from_scratch_no_parents(self):
771
 
        tree1, revid1 = self.make_minimal_tree()
772
 
        inv = tree1.inventory
773
 
        root_id = inv.path2id('')
774
 
        expected_result = [], [
775
 
            (('', '', root_id), [
776
 
             ('d', '', 0, False, dirstate.DirState.NULLSTAT)])]
777
 
        state = dirstate.DirState.initialize('dirstate')
778
 
        try:
779
 
            state.set_state_from_scratch(inv, [], [])
780
 
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
781
 
                             state._header_state)
782
 
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
783
 
                             state._dirblock_state)
784
 
        except:
785
 
            state.unlock()
786
 
            raise
787
 
        else:
788
 
            # This will unlock it
789
 
            self.check_state_with_reopen(expected_result, state)
790
 
 
791
 
    def test_set_state_from_scratch_identical_parent(self):
792
 
        tree1, revid1 = self.make_minimal_tree()
793
 
        inv = tree1.inventory
794
 
        root_id = inv.path2id('')
795
 
        rev_tree1 = tree1.branch.repository.revision_tree(revid1)
796
 
        d_entry = ('d', '', 0, False, dirstate.DirState.NULLSTAT)
797
 
        parent_entry = ('d', '', 0, False, revid1)
798
 
        expected_result = [revid1], [
799
 
            (('', '', root_id), [d_entry, parent_entry])]
800
 
        state = dirstate.DirState.initialize('dirstate')
801
 
        try:
802
 
            state.set_state_from_scratch(inv, [(revid1, rev_tree1)], [])
803
 
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
804
 
                             state._header_state)
805
 
            self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
806
 
                             state._dirblock_state)
807
 
        except:
808
 
            state.unlock()
809
 
            raise
810
 
        else:
811
 
            # This will unlock it
812
 
            self.check_state_with_reopen(expected_result, state)
813
 
 
814
 
    def test_set_state_from_inventory_preserves_hashcache(self):
815
 
        # https://bugs.launchpad.net/bzr/+bug/146176
816
 
        # set_state_from_inventory should preserve the stat and hash value for
817
 
        # workingtree files that are not changed by the inventory.
818
 
 
819
 
        tree = self.make_branch_and_tree('.')
820
 
        # depends on the default format using dirstate...
821
 
        tree.lock_write()
822
 
        try:
823
 
            # make a dirstate with some valid hashcache data
824
 
            # file on disk, but that's not needed for this test
825
 
            foo_contents = 'contents of foo'
826
 
            self.build_tree_contents([('foo', foo_contents)])
827
 
            tree.add('foo', 'foo-id')
828
 
 
829
 
            foo_stat = os.stat('foo')
830
 
            foo_packed = dirstate.pack_stat(foo_stat)
831
 
            foo_sha = osutils.sha_string(foo_contents)
832
 
            foo_size = len(foo_contents)
833
 
 
834
 
            # should not be cached yet, because the file's too fresh
835
 
            self.assertEqual(
836
 
                (('', 'foo', 'foo-id',),
837
 
                 [('f', '', 0, False, dirstate.DirState.NULLSTAT)]),
838
 
                tree._dirstate._get_entry(0, 'foo-id'))
839
 
            # poke in some hashcache information - it wouldn't normally be
840
 
            # stored because it's too fresh
841
 
            tree._dirstate.update_minimal(
842
 
                ('', 'foo', 'foo-id'),
843
 
                'f', False, foo_sha, foo_packed, foo_size, 'foo')
844
 
            # now should be cached
845
 
            self.assertEqual(
846
 
                (('', 'foo', 'foo-id',),
847
 
                 [('f', foo_sha, foo_size, False, foo_packed)]),
848
 
                tree._dirstate._get_entry(0, 'foo-id'))
849
 
 
850
 
            # extract the inventory, and add something to it
851
 
            inv = tree._get_inventory()
852
 
            # should see the file we poked in...
853
 
            self.assertTrue(inv.has_id('foo-id'))
854
 
            self.assertTrue(inv.has_filename('foo'))
855
 
            inv.add_path('bar', 'file', 'bar-id')
856
 
            tree._dirstate._validate()
857
 
            # this used to cause it to lose its hashcache
858
 
            tree._dirstate.set_state_from_inventory(inv)
859
 
            tree._dirstate._validate()
860
 
        finally:
861
 
            tree.unlock()
862
 
 
863
 
        tree.lock_read()
864
 
        try:
865
 
            # now check that the state still has the original hashcache value
866
 
            state = tree._dirstate
867
 
            state._validate()
868
 
            foo_tuple = state._get_entry(0, path_utf8='foo')
869
 
            self.assertEqual(
870
 
                (('', 'foo', 'foo-id',),
871
 
                 [('f', foo_sha, len(foo_contents), False,
872
 
                   dirstate.pack_stat(foo_stat))]),
873
 
                foo_tuple)
874
 
        finally:
875
 
            tree.unlock()
876
 
 
877
 
    def test_set_state_from_inventory_mixed_paths(self):
878
 
        tree1 = self.make_branch_and_tree('tree1')
879
 
        self.build_tree(['tree1/a/', 'tree1/a/b/', 'tree1/a-b/',
880
 
                         'tree1/a/b/foo', 'tree1/a-b/bar'])
881
 
        tree1.lock_write()
882
 
        try:
883
 
            tree1.add(['a', 'a/b', 'a-b', 'a/b/foo', 'a-b/bar'],
884
 
                      ['a-id', 'b-id', 'a-b-id', 'foo-id', 'bar-id'])
885
 
            tree1.commit('rev1', rev_id='rev1')
886
 
            root_id = tree1.get_root_id()
887
 
            inv = tree1.inventory
888
 
        finally:
889
 
            tree1.unlock()
890
 
        expected_result1 = [('', '', root_id, 'd'),
891
 
                            ('', 'a', 'a-id', 'd'),
892
 
                            ('', 'a-b', 'a-b-id', 'd'),
893
 
                            ('a', 'b', 'b-id', 'd'),
894
 
                            ('a/b', 'foo', 'foo-id', 'f'),
895
 
                            ('a-b', 'bar', 'bar-id', 'f'),
896
 
                           ]
897
 
        expected_result2 = [('', '', root_id, 'd'),
898
 
                            ('', 'a', 'a-id', 'd'),
899
 
                            ('', 'a-b', 'a-b-id', 'd'),
900
 
                            ('a-b', 'bar', 'bar-id', 'f'),
901
 
                           ]
902
 
        state = dirstate.DirState.initialize('dirstate')
903
 
        try:
904
 
            state.set_state_from_inventory(inv)
905
 
            values = []
906
 
            for entry in state._iter_entries():
907
 
                values.append(entry[0] + entry[1][0][:1])
908
 
            self.assertEqual(expected_result1, values)
909
 
            del inv['b-id']
910
 
            state.set_state_from_inventory(inv)
911
 
            values = []
912
 
            for entry in state._iter_entries():
913
 
                values.append(entry[0] + entry[1][0][:1])
914
 
            self.assertEqual(expected_result2, values)
915
 
        finally:
916
 
            state.unlock()
917
 
 
918
689
    def test_set_path_id_no_parents(self):
919
690
        """The id of a path can be changed trivally with no parents."""
920
691
        state = dirstate.DirState.initialize('dirstate')
921
692
        try:
922
693
            # check precondition to be sure the state does change appropriately.
923
 
            root_entry = (('', '', 'TREE_ROOT'), [('d', '', 0, False, 'x'*32)])
924
 
            self.assertEqual([root_entry], list(state._iter_entries()))
925
 
            self.assertEqual(root_entry, state._get_entry(0, path_utf8=''))
926
 
            self.assertEqual(root_entry,
927
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
928
 
            self.assertEqual((None, None),
929
 
                             state._get_entry(0, fileid_utf8='second-root-id'))
930
 
            state.set_path_id('', 'second-root-id')
931
 
            new_root_entry = (('', '', 'second-root-id'),
932
 
                              [('d', '', 0, False, 'x'*32)])
933
 
            expected_rows = [new_root_entry]
 
694
            self.assertEqual(
 
695
                [(('', '', 'TREE_ROOT'), [('d', '', 0, False,
 
696
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])],
 
697
                list(state._iter_entries()))
 
698
            state.set_path_id('', 'foobarbaz')
 
699
            expected_rows = [
 
700
                (('', '', 'foobarbaz'), [('d', '', 0, False,
 
701
                   'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])]
934
702
            self.assertEqual(expected_rows, list(state._iter_entries()))
935
 
            self.assertEqual(new_root_entry, state._get_entry(0, path_utf8=''))
936
 
            self.assertEqual(new_root_entry, 
937
 
                             state._get_entry(0, fileid_utf8='second-root-id'))
938
 
            self.assertEqual((None, None),
939
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
940
703
            # should work across save too
941
704
            state.save()
942
705
        finally:
960
723
        state._validate()
961
724
        try:
962
725
            state.set_parent_trees([('parent-revid', rt)], ghosts=[])
963
 
            root_entry = (('', '', 'TREE_ROOT'),
964
 
                          [('d', '', 0, False, 'x'*32),
965
 
                           ('d', '', 0, False, 'parent-revid')])
966
 
            self.assertEqual(root_entry, state._get_entry(0, path_utf8=''))
967
 
            self.assertEqual(root_entry,
968
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
969
 
            self.assertEqual((None, None),
970
 
                             state._get_entry(0, fileid_utf8='Asecond-root-id'))
971
 
            state.set_path_id('', 'Asecond-root-id')
 
726
            state.set_path_id('', 'foobarbaz')
972
727
            state._validate()
973
728
            # now see that it is what we expected
974
 
            old_root_entry = (('', '', 'TREE_ROOT'),
975
 
                              [('a', '', 0, False, ''),
976
 
                               ('d', '', 0, False, 'parent-revid')])
977
 
            new_root_entry = (('', '', 'Asecond-root-id'),
978
 
                              [('d', '', 0, False, ''),
979
 
                               ('a', '', 0, False, '')])
980
 
            expected_rows = [new_root_entry, old_root_entry]
 
729
            expected_rows = [
 
730
                (('', '', 'TREE_ROOT'),
 
731
                    [('a', '', 0, False, ''),
 
732
                     ('d', '', 0, False, 'parent-revid'),
 
733
                     ]),
 
734
                (('', '', 'foobarbaz'),
 
735
                    [('d', '', 0, False, ''),
 
736
                     ('a', '', 0, False, ''),
 
737
                     ]),
 
738
                ]
981
739
            state._validate()
982
740
            self.assertEqual(expected_rows, list(state._iter_entries()))
983
 
            self.assertEqual(new_root_entry, state._get_entry(0, path_utf8=''))
984
 
            self.assertEqual(old_root_entry, state._get_entry(1, path_utf8=''))
985
 
            self.assertEqual((None, None),
986
 
                             state._get_entry(0, fileid_utf8='TREE_ROOT'))
987
 
            self.assertEqual(old_root_entry,
988
 
                             state._get_entry(1, fileid_utf8='TREE_ROOT'))
989
 
            self.assertEqual(new_root_entry,
990
 
                             state._get_entry(0, fileid_utf8='Asecond-root-id'))
991
 
            self.assertEqual((None, None),
992
 
                             state._get_entry(1, fileid_utf8='Asecond-root-id'))
993
741
            # should work across save too
994
742
            state.save()
995
743
        finally:
1011
759
        finally:
1012
760
            state.unlock()
1013
761
 
 
762
 
1014
763
    def test_set_parent_trees_no_content(self):
1015
764
        # set_parent_trees is a slow but important api to support.
1016
765
        tree1 = self.make_branch_and_memory_tree('tree1')
1021
770
        finally:
1022
771
            tree1.unlock()
1023
772
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
1024
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
773
        tree2 = MemoryTree.create_on_branch(branch2)
1025
774
        tree2.lock_write()
1026
775
        try:
1027
776
            revid2 = tree2.commit('foo')
1028
 
            root_id = tree2.get_root_id()
 
777
            root_id = tree2.inventory.root.file_id
1029
778
        finally:
1030
779
            tree2.unlock()
1031
780
        state = dirstate.DirState.initialize('dirstate')
1059
808
            state.set_parent_trees(
1060
809
                ((revid1, tree1.branch.repository.revision_tree(revid1)),
1061
810
                 (revid2, tree2.branch.repository.revision_tree(revid2)),
1062
 
                 ('ghost-rev', tree2.branch.repository.revision_tree(
1063
 
                                   _mod_revision.NULL_REVISION))),
 
811
                 ('ghost-rev', tree2.branch.repository.revision_tree(None))),
1064
812
                ['ghost-rev'])
1065
813
            self.assertEqual([revid1, revid2, 'ghost-rev'],
1066
814
                             state.get_parent_ids())
1070
818
                [(('', '', root_id), [
1071
819
                  ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1072
820
                  ('d', '', 0, False, revid1),
1073
 
                  ('d', '', 0, False, revid1)
 
821
                  ('d', '', 0, False, revid2)
1074
822
                  ])],
1075
823
                list(state._iter_entries()))
1076
824
        finally:
1091
839
        finally:
1092
840
            tree1.unlock()
1093
841
        branch2 = tree1.branch.bzrdir.clone('tree2').open_branch()
1094
 
        tree2 = memorytree.MemoryTree.create_on_branch(branch2)
 
842
        tree2 = MemoryTree.create_on_branch(branch2)
1095
843
        tree2.lock_write()
1096
844
        try:
1097
845
            tree2.put_file_bytes_non_atomic('file-id', 'new file-content')
1098
846
            revid2 = tree2.commit('foo')
1099
 
            root_id = tree2.get_root_id()
 
847
            root_id = tree2.inventory.root.file_id
1100
848
        finally:
1101
849
            tree2.unlock()
1102
850
        # check the layout in memory
1104
852
            (('', '', root_id), [
1105
853
             ('d', '', 0, False, dirstate.DirState.NULLSTAT),
1106
854
             ('d', '', 0, False, revid1.encode('utf8')),
1107
 
             ('d', '', 0, False, revid1.encode('utf8'))
 
855
             ('d', '', 0, False, revid2.encode('utf8'))
1108
856
             ]),
1109
857
            (('', 'a file', 'file-id'), [
1110
858
             ('a', '', 0, False, ''),
1142
890
            (('', '', 'TREE_ROOT'), [
1143
891
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1144
892
             ]),
1145
 
            (('', 'a file', 'a-file-id'), [
 
893
            (('', 'a file', 'a file id'), [
1146
894
             ('f', '1'*20, 19, False, dirstate.pack_stat(stat)), # current tree
1147
895
             ]),
1148
896
            ]
1149
897
        try:
1150
 
            state.add('a file', 'a-file-id', 'file', stat, '1'*20)
 
898
            state.add('a file', 'a file id', 'file', stat, '1'*20)
1151
899
            # having added it, it should be in the output of iter_entries.
1152
900
            self.assertEqual(expected_entries, list(state._iter_entries()))
1153
901
            # saving and reloading should not affect this.
1156
904
            state.unlock()
1157
905
        state = dirstate.DirState.on_file('dirstate')
1158
906
        state.lock_read()
1159
 
        self.addCleanup(state.unlock)
1160
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
907
        try:
 
908
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
909
        finally:
 
910
            state.unlock()
1161
911
 
1162
912
    def test_add_path_to_unversioned_directory(self):
1163
913
        """Adding a path to an unversioned directory should error.
1168
918
        """
1169
919
        self.build_tree(['unversioned/', 'unversioned/a file'])
1170
920
        state = dirstate.DirState.initialize('dirstate')
1171
 
        self.addCleanup(state.unlock)
1172
 
        self.assertRaises(errors.NotVersionedError, state.add,
1173
 
                          'unversioned/a file', 'a-file-id', 'file', None, None)
 
921
        try:
 
922
            self.assertRaises(errors.NotVersionedError, state.add,
 
923
                'unversioned/a file', 'a file id', 'file', None, None)
 
924
        finally:
 
925
            state.unlock()
1174
926
 
1175
927
    def test_add_directory_to_root_no_parents_all_data(self):
1176
928
        # The most trivial addition of a dir is when there are no parents and
1196
948
            state.unlock()
1197
949
        state = dirstate.DirState.on_file('dirstate')
1198
950
        state.lock_read()
1199
 
        self.addCleanup(state.unlock)
1200
951
        state._validate()
1201
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
952
        try:
 
953
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
954
        finally:
 
955
            state.unlock()
1202
956
 
1203
 
    def _test_add_symlink_to_root_no_parents_all_data(self, link_name, target):
 
957
    def test_add_symlink_to_root_no_parents_all_data(self):
1204
958
        # The most trivial addition of a symlink when there are no parents and
1205
959
        # its in the root and all data about the file is supplied
1206
960
        # bzr doesn't support fake symlinks on windows, yet.
1207
 
        self.requireFeature(tests.SymlinkFeature)
1208
 
        os.symlink(target, link_name)
1209
 
        stat = os.lstat(link_name)
 
961
        if not has_symlinks():
 
962
            raise TestSkipped("No symlink support")
 
963
        os.symlink('target', 'a link')
 
964
        stat = os.lstat('a link')
1210
965
        expected_entries = [
1211
966
            (('', '', 'TREE_ROOT'), [
1212
967
             ('d', '', 0, False, dirstate.DirState.NULLSTAT), # current tree
1213
968
             ]),
1214
 
            (('', link_name.encode('UTF-8'), 'a link id'), [
1215
 
             ('l', target.encode('UTF-8'), stat[6],
1216
 
              False, dirstate.pack_stat(stat)), # current tree
 
969
            (('', 'a link', 'a link id'), [
 
970
             ('l', 'target', 6, False, dirstate.pack_stat(stat)), # current tree
1217
971
             ]),
1218
972
            ]
1219
973
        state = dirstate.DirState.initialize('dirstate')
1220
974
        try:
1221
 
            state.add(link_name, 'a link id', 'symlink', stat,
1222
 
                      target.encode('UTF-8'))
 
975
            state.add('a link', 'a link id', 'symlink', stat, 'target')
1223
976
            # having added it, it should be in the output of iter_entries.
1224
977
            self.assertEqual(expected_entries, list(state._iter_entries()))
1225
978
            # saving and reloading should not affect this.
1228
981
            state.unlock()
1229
982
        state = dirstate.DirState.on_file('dirstate')
1230
983
        state.lock_read()
1231
 
        self.addCleanup(state.unlock)
1232
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
1233
 
 
1234
 
    def test_add_symlink_to_root_no_parents_all_data(self):
1235
 
        self._test_add_symlink_to_root_no_parents_all_data('a link', 'target')
1236
 
 
1237
 
    def test_add_symlink_unicode_to_root_no_parents_all_data(self):
1238
 
        self.requireFeature(tests.UnicodeFilenameFeature)
1239
 
        self._test_add_symlink_to_root_no_parents_all_data(
1240
 
            u'\N{Euro Sign}link', u'targ\N{Euro Sign}et')
 
984
        try:
 
985
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
986
        finally:
 
987
            state.unlock()
1241
988
 
1242
989
    def test_add_directory_and_child_no_parents_all_data(self):
1243
990
        # after adding a directory, we should be able to add children to it.
1251
998
            (('', 'a dir', 'a dir id'), [
1252
999
             ('d', '', 0, False, dirstate.pack_stat(dirstat)), # current tree
1253
1000
             ]),
1254
 
            (('a dir', 'a file', 'a-file-id'), [
 
1001
            (('a dir', 'a file', 'a file id'), [
1255
1002
             ('f', '1'*20, 25, False,
1256
1003
              dirstate.pack_stat(filestat)), # current tree details
1257
1004
             ]),
1259
1006
        state = dirstate.DirState.initialize('dirstate')
1260
1007
        try:
1261
1008
            state.add('a dir', 'a dir id', 'directory', dirstat, None)
1262
 
            state.add('a dir/a file', 'a-file-id', 'file', filestat, '1'*20)
 
1009
            state.add('a dir/a file', 'a file id', 'file', filestat, '1'*20)
1263
1010
            # added it, it should be in the output of iter_entries.
1264
1011
            self.assertEqual(expected_entries, list(state._iter_entries()))
1265
1012
            # saving and reloading should not affect this.
1268
1015
            state.unlock()
1269
1016
        state = dirstate.DirState.on_file('dirstate')
1270
1017
        state.lock_read()
1271
 
        self.addCleanup(state.unlock)
1272
 
        self.assertEqual(expected_entries, list(state._iter_entries()))
 
1018
        try:
 
1019
            self.assertEqual(expected_entries, list(state._iter_entries()))
 
1020
        finally:
 
1021
            state.unlock()
1273
1022
 
1274
1023
    def test_add_tree_reference(self):
1275
1024
        # make a dirstate and add a tree reference
1289
1038
            state.unlock()
1290
1039
        # now check we can read it back
1291
1040
        state.lock_read()
1292
 
        self.addCleanup(state.unlock)
1293
1041
        state._validate()
1294
 
        entry2 = state._get_entry(0, 'subdir-id', 'subdir')
1295
 
        self.assertEqual(entry, entry2)
1296
 
        self.assertEqual(entry, expected_entry)
1297
 
        # and lookup by id should work too
1298
 
        entry2 = state._get_entry(0, fileid_utf8='subdir-id')
1299
 
        self.assertEqual(entry, expected_entry)
 
1042
        try:
 
1043
            entry2 = state._get_entry(0, 'subdir-id', 'subdir')
 
1044
            self.assertEqual(entry, entry2)
 
1045
            self.assertEqual(entry, expected_entry)
 
1046
            # and lookup by id should work too
 
1047
            entry2 = state._get_entry(0, fileid_utf8='subdir-id')
 
1048
            self.assertEqual(entry, expected_entry)
 
1049
        finally:
 
1050
            state.unlock()
1300
1051
 
1301
1052
    def test_add_forbidden_names(self):
1302
1053
        state = dirstate.DirState.initialize('dirstate')
1306
1057
        self.assertRaises(errors.BzrError,
1307
1058
            state.add, '..', 'ass-id', 'directory', None, None)
1308
1059
 
1309
 
    def test_set_state_with_rename_b_a_bug_395556(self):
1310
 
        # bug 395556 uncovered a bug where the dirstate ends up with a false
1311
 
        # relocation record - in a tree with no parents there should be no
1312
 
        # absent or relocated records. This then leads to further corruption
1313
 
        # when a commit occurs, as the incorrect relocation gathers an
1314
 
        # incorrect absent in tree 1, and future changes go to pot.
1315
 
        tree1 = self.make_branch_and_tree('tree1')
1316
 
        self.build_tree(['tree1/b'])
1317
 
        tree1.lock_write()
1318
 
        try:
1319
 
            tree1.add(['b'], ['b-id'])
1320
 
            root_id = tree1.get_root_id()
1321
 
            inv = tree1.inventory
1322
 
            state = dirstate.DirState.initialize('dirstate')
1323
 
            try:
1324
 
                # Set the initial state with 'b'
1325
 
                state.set_state_from_inventory(inv)
1326
 
                inv.rename('b-id', root_id, 'a')
1327
 
                # Set the new state with 'a', which currently corrupts.
1328
 
                state.set_state_from_inventory(inv)
1329
 
                expected_result1 = [('', '', root_id, 'd'),
1330
 
                                    ('', 'a', 'b-id', 'f'),
1331
 
                                   ]
1332
 
                values = []
1333
 
                for entry in state._iter_entries():
1334
 
                    values.append(entry[0] + entry[1][0][:1])
1335
 
                self.assertEqual(expected_result1, values)
1336
 
            finally:
1337
 
                state.unlock()
1338
 
        finally:
1339
 
            tree1.unlock()
1340
 
 
1341
1060
 
1342
1061
class TestGetLines(TestCaseWithDirState):
1343
1062
 
1556
1275
            state.unlock()
1557
1276
 
1558
1277
 
1559
 
class TestIterChildEntries(TestCaseWithDirState):
1560
 
 
1561
 
    def create_dirstate_with_two_trees(self):
1562
 
        """This dirstate contains multiple files and directories.
1563
 
 
1564
 
         /        a-root-value
1565
 
         a/       a-dir
1566
 
         b/       b-dir
1567
 
         c        c-file
1568
 
         d        d-file
1569
 
         a/e/     e-dir
1570
 
         a/f      f-file
1571
 
         b/g      g-file
1572
 
         b/h\xc3\xa5  h-\xc3\xa5-file  #This is u'\xe5' encoded into utf-8
1573
 
 
1574
 
        Notice that a/e is an empty directory.
1575
 
 
1576
 
        There is one parent tree, which has the same shape with the following variations:
1577
 
        b/g in the parent is gone.
1578
 
        b/h in the parent has a different id
1579
 
        b/i is new in the parent
1580
 
        c is renamed to b/j in the parent
1581
 
 
1582
 
        :return: The dirstate, still write-locked.
1583
 
        """
1584
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
1585
 
        null_sha = 'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx'
1586
 
        NULL_PARENT_DETAILS = dirstate.DirState.NULL_PARENT_DETAILS
1587
 
        root_entry = ('', '', 'a-root-value'), [
1588
 
            ('d', '', 0, False, packed_stat),
1589
 
            ('d', '', 0, False, 'parent-revid'),
1590
 
            ]
1591
 
        a_entry = ('', 'a', 'a-dir'), [
1592
 
            ('d', '', 0, False, packed_stat),
1593
 
            ('d', '', 0, False, 'parent-revid'),
1594
 
            ]
1595
 
        b_entry = ('', 'b', 'b-dir'), [
1596
 
            ('d', '', 0, False, packed_stat),
1597
 
            ('d', '', 0, False, 'parent-revid'),
1598
 
            ]
1599
 
        c_entry = ('', 'c', 'c-file'), [
1600
 
            ('f', null_sha, 10, False, packed_stat),
1601
 
            ('r', 'b/j', 0, False, ''),
1602
 
            ]
1603
 
        d_entry = ('', 'd', 'd-file'), [
1604
 
            ('f', null_sha, 20, False, packed_stat),
1605
 
            ('f', 'd', 20, False, 'parent-revid'),
1606
 
            ]
1607
 
        e_entry = ('a', 'e', 'e-dir'), [
1608
 
            ('d', '', 0, False, packed_stat),
1609
 
            ('d', '', 0, False, 'parent-revid'),
1610
 
            ]
1611
 
        f_entry = ('a', 'f', 'f-file'), [
1612
 
            ('f', null_sha, 30, False, packed_stat),
1613
 
            ('f', 'f', 20, False, 'parent-revid'),
1614
 
            ]
1615
 
        g_entry = ('b', 'g', 'g-file'), [
1616
 
            ('f', null_sha, 30, False, packed_stat),
1617
 
            NULL_PARENT_DETAILS,
1618
 
            ]
1619
 
        h_entry1 = ('b', 'h\xc3\xa5', 'h-\xc3\xa5-file1'), [
1620
 
            ('f', null_sha, 40, False, packed_stat),
1621
 
            NULL_PARENT_DETAILS,
1622
 
            ]
1623
 
        h_entry2 = ('b', 'h\xc3\xa5', 'h-\xc3\xa5-file2'), [
1624
 
            NULL_PARENT_DETAILS,
1625
 
            ('f', 'h', 20, False, 'parent-revid'),
1626
 
            ]
1627
 
        i_entry = ('b', 'i', 'i-file'), [
1628
 
            NULL_PARENT_DETAILS,
1629
 
            ('f', 'h', 20, False, 'parent-revid'),
1630
 
            ]
1631
 
        j_entry = ('b', 'j', 'c-file'), [
1632
 
            ('r', 'c', 0, False, ''),
1633
 
            ('f', 'j', 20, False, 'parent-revid'),
1634
 
            ]
1635
 
        dirblocks = []
1636
 
        dirblocks.append(('', [root_entry]))
1637
 
        dirblocks.append(('', [a_entry, b_entry, c_entry, d_entry]))
1638
 
        dirblocks.append(('a', [e_entry, f_entry]))
1639
 
        dirblocks.append(('b', [g_entry, h_entry1, h_entry2, i_entry, j_entry]))
1640
 
        state = dirstate.DirState.initialize('dirstate')
1641
 
        state._validate()
1642
 
        try:
1643
 
            state._set_data(['parent'], dirblocks)
1644
 
        except:
1645
 
            state.unlock()
1646
 
            raise
1647
 
        return state, dirblocks
1648
 
 
1649
 
    def test_iter_children_b(self):
1650
 
        state, dirblocks = self.create_dirstate_with_two_trees()
1651
 
        self.addCleanup(state.unlock)
1652
 
        expected_result = []
1653
 
        expected_result.append(dirblocks[3][1][2]) # h2
1654
 
        expected_result.append(dirblocks[3][1][3]) # i
1655
 
        expected_result.append(dirblocks[3][1][4]) # j
1656
 
        self.assertEqual(expected_result,
1657
 
            list(state._iter_child_entries(1, 'b')))
1658
 
 
1659
 
    def test_iter_child_root(self):
1660
 
        state, dirblocks = self.create_dirstate_with_two_trees()
1661
 
        self.addCleanup(state.unlock)
1662
 
        expected_result = []
1663
 
        expected_result.append(dirblocks[1][1][0]) # a
1664
 
        expected_result.append(dirblocks[1][1][1]) # b
1665
 
        expected_result.append(dirblocks[1][1][3]) # d
1666
 
        expected_result.append(dirblocks[2][1][0]) # e
1667
 
        expected_result.append(dirblocks[2][1][1]) # f
1668
 
        expected_result.append(dirblocks[3][1][2]) # h2
1669
 
        expected_result.append(dirblocks[3][1][3]) # i
1670
 
        expected_result.append(dirblocks[3][1][4]) # j
1671
 
        self.assertEqual(expected_result,
1672
 
            list(state._iter_child_entries(1, '')))
1673
 
 
1674
 
 
1675
 
class TestDirstateSortOrder(tests.TestCaseWithTransport):
 
1278
class TestDirstateSortOrder(TestCaseWithTransport):
1676
1279
    """Test that DirState adds entries in the right order."""
1677
1280
 
1678
1281
    def test_add_sorting(self):
1727
1330
 
1728
1331
        # *really* cheesy way to just get an empty tree
1729
1332
        repo = self.make_repository('repo')
1730
 
        empty_tree = repo.revision_tree(_mod_revision.NULL_REVISION)
 
1333
        empty_tree = repo.revision_tree(None)
1731
1334
        state.set_parent_trees([('null:', empty_tree)], [])
1732
1335
 
1733
1336
        dirblock_names = [d[0] for d in state._dirblocks]
1737
1340
class InstrumentedDirState(dirstate.DirState):
1738
1341
    """An DirState with instrumented sha1 functionality."""
1739
1342
 
1740
 
    def __init__(self, path, sha1_provider):
1741
 
        super(InstrumentedDirState, self).__init__(path, sha1_provider)
 
1343
    def __init__(self, path):
 
1344
        super(InstrumentedDirState, self).__init__(path)
1742
1345
        self._time_offset = 0
1743
1346
        self._log = []
1744
 
        # member is dynamically set in DirState.__init__ to turn on trace
1745
 
        self._sha1_provider = sha1_provider
1746
 
        self._sha1_file = self._sha1_file_and_log
1747
1347
 
1748
1348
    def _sha_cutoff_time(self):
1749
1349
        timestamp = super(InstrumentedDirState, self)._sha_cutoff_time()
1750
1350
        self._cutoff_time = timestamp + self._time_offset
1751
1351
 
1752
 
    def _sha1_file_and_log(self, abspath):
 
1352
    def _sha1_file(self, abspath, entry):
1753
1353
        self._log.append(('sha1', abspath))
1754
 
        return self._sha1_provider.sha1(abspath)
 
1354
        return super(InstrumentedDirState, self)._sha1_file(abspath, entry)
1755
1355
 
1756
1356
    def _read_link(self, abspath, old_link):
1757
1357
        self._log.append(('read_link', abspath, old_link))
1788
1388
        self.st_ino = ino
1789
1389
        self.st_mode = mode
1790
1390
 
1791
 
    @staticmethod
1792
 
    def from_stat(st):
1793
 
        return _FakeStat(st.st_size, st.st_mtime, st.st_ctime, st.st_dev,
1794
 
            st.st_ino, st.st_mode)
1795
 
 
1796
 
 
1797
 
class TestPackStat(tests.TestCaseWithTransport):
 
1391
 
 
1392
class TestUpdateEntry(TestCaseWithDirState):
 
1393
    """Test the DirState.update_entry functions"""
 
1394
 
 
1395
    def get_state_with_a(self):
 
1396
        """Create a DirState tracking a single object named 'a'"""
 
1397
        state = InstrumentedDirState.initialize('dirstate')
 
1398
        self.addCleanup(state.unlock)
 
1399
        state.add('a', 'a-id', 'file', None, '')
 
1400
        entry = state._get_entry(0, path_utf8='a')
 
1401
        return state, entry
 
1402
 
 
1403
    def test_update_entry(self):
 
1404
        state, entry = self.get_state_with_a()
 
1405
        self.build_tree(['a'])
 
1406
        # Add one where we don't provide the stat or sha already
 
1407
        self.assertEqual(('', 'a', 'a-id'), entry[0])
 
1408
        self.assertEqual([('f', '', 0, False, dirstate.DirState.NULLSTAT)],
 
1409
                         entry[1])
 
1410
        # Flush the buffers to disk
 
1411
        state.save()
 
1412
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1413
                         state._dirblock_state)
 
1414
 
 
1415
        stat_value = os.lstat('a')
 
1416
        packed_stat = dirstate.pack_stat(stat_value)
 
1417
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1418
                                          stat_value=stat_value)
 
1419
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1420
                         link_or_sha1)
 
1421
 
 
1422
        # The dirblock entry should be updated with the new info
 
1423
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1424
                         entry[1])
 
1425
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1426
                         state._dirblock_state)
 
1427
        mode = stat_value.st_mode
 
1428
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False)], state._log)
 
1429
 
 
1430
        state.save()
 
1431
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1432
                         state._dirblock_state)
 
1433
 
 
1434
        # If we do it again right away, we don't know if the file has changed
 
1435
        # so we will re-read the file. Roll the clock back so the file is
 
1436
        # guaranteed to look too new.
 
1437
        state.adjust_time(-10)
 
1438
 
 
1439
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1440
                                          stat_value=stat_value)
 
1441
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1442
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1443
                         ], state._log)
 
1444
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1445
                         link_or_sha1)
 
1446
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1447
                         state._dirblock_state)
 
1448
        state.save()
 
1449
 
 
1450
        # However, if we move the clock forward so the file is considered
 
1451
        # "stable", it should just returned the cached value.
 
1452
        state.adjust_time(20)
 
1453
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1454
                                          stat_value=stat_value)
 
1455
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1456
                         link_or_sha1)
 
1457
        self.assertEqual([('sha1', 'a'), ('is_exec', mode, False),
 
1458
                          ('sha1', 'a'), ('is_exec', mode, False),
 
1459
                         ], state._log)
 
1460
 
 
1461
    def test_update_entry_no_stat_value(self):
 
1462
        """Passing the stat_value is optional."""
 
1463
        state, entry = self.get_state_with_a()
 
1464
        state.adjust_time(-10) # Make sure the file looks new
 
1465
        self.build_tree(['a'])
 
1466
        # Add one where we don't provide the stat or sha already
 
1467
        link_or_sha1 = state.update_entry(entry, abspath='a')
 
1468
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1469
                         link_or_sha1)
 
1470
        stat_value = os.lstat('a')
 
1471
        self.assertEqual([('lstat', 'a'), ('sha1', 'a'),
 
1472
                          ('is_exec', stat_value.st_mode, False),
 
1473
                         ], state._log)
 
1474
 
 
1475
    def test_update_entry_symlink(self):
 
1476
        """Update entry should read symlinks."""
 
1477
        if not osutils.has_symlinks():
 
1478
            # PlatformDeficiency / TestSkipped
 
1479
            raise TestSkipped("No symlink support")
 
1480
        state, entry = self.get_state_with_a()
 
1481
        state.save()
 
1482
        self.assertEqual(dirstate.DirState.IN_MEMORY_UNMODIFIED,
 
1483
                         state._dirblock_state)
 
1484
        os.symlink('target', 'a')
 
1485
 
 
1486
        state.adjust_time(-10) # Make the symlink look new
 
1487
        stat_value = os.lstat('a')
 
1488
        packed_stat = dirstate.pack_stat(stat_value)
 
1489
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1490
                                          stat_value=stat_value)
 
1491
        self.assertEqual('target', link_or_sha1)
 
1492
        self.assertEqual([('read_link', 'a', '')], state._log)
 
1493
        # Dirblock is updated
 
1494
        self.assertEqual([('l', link_or_sha1, 6, False, packed_stat)],
 
1495
                         entry[1])
 
1496
        self.assertEqual(dirstate.DirState.IN_MEMORY_MODIFIED,
 
1497
                         state._dirblock_state)
 
1498
 
 
1499
        # Because the stat_value looks new, we should re-read the target
 
1500
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1501
                                          stat_value=stat_value)
 
1502
        self.assertEqual('target', link_or_sha1)
 
1503
        self.assertEqual([('read_link', 'a', ''),
 
1504
                          ('read_link', 'a', 'target'),
 
1505
                         ], state._log)
 
1506
        state.adjust_time(+20) # Skip into the future, all files look old
 
1507
        link_or_sha1 = state.update_entry(entry, abspath='a',
 
1508
                                          stat_value=stat_value)
 
1509
        self.assertEqual('target', link_or_sha1)
 
1510
        # There should not be a new read_link call.
 
1511
        # (this is a weak assertion, because read_link is fairly inexpensive,
 
1512
        # versus the number of symlinks that we would have)
 
1513
        self.assertEqual([('read_link', 'a', ''),
 
1514
                          ('read_link', 'a', 'target'),
 
1515
                         ], state._log)
 
1516
 
 
1517
    def test_update_entry_dir(self):
 
1518
        state, entry = self.get_state_with_a()
 
1519
        self.build_tree(['a/'])
 
1520
        self.assertIs(None, state.update_entry(entry, 'a'))
 
1521
 
 
1522
    def create_and_test_file(self, state, entry):
 
1523
        """Create a file at 'a' and verify the state finds it.
 
1524
 
 
1525
        The state should already be versioning *something* at 'a'. This makes
 
1526
        sure that state.update_entry recognizes it as a file.
 
1527
        """
 
1528
        self.build_tree(['a'])
 
1529
        stat_value = os.lstat('a')
 
1530
        packed_stat = dirstate.pack_stat(stat_value)
 
1531
 
 
1532
        link_or_sha1 = state.update_entry(entry, abspath='a')
 
1533
        self.assertEqual('b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6',
 
1534
                         link_or_sha1)
 
1535
        self.assertEqual([('f', link_or_sha1, 14, False, packed_stat)],
 
1536
                         entry[1])
 
1537
        return packed_stat
 
1538
 
 
1539
    def create_and_test_dir(self, state, entry):
 
1540
        """Create a directory at 'a' and verify the state finds it.
 
1541
 
 
1542
        The state should already be versioning *something* at 'a'. This makes
 
1543
        sure that state.update_entry recognizes it as a directory.
 
1544
        """
 
1545
        self.build_tree(['a/'])
 
1546
        stat_value = os.lstat('a')
 
1547
        packed_stat = dirstate.pack_stat(stat_value)
 
1548
 
 
1549
        link_or_sha1 = state.update_entry(entry, abspath='a')
 
1550
        self.assertIs(None, link_or_sha1)
 
1551
        self.assertEqual([('d', '', 0, False, packed_stat)], entry[1])
 
1552
 
 
1553
        return packed_stat
 
1554
 
 
1555
    def create_and_test_symlink(self, state, entry):
 
1556
        """Create a symlink at 'a' and verify the state finds it.
 
1557
 
 
1558
        The state should already be versioning *something* at 'a'. This makes
 
1559
        sure that state.update_entry recognizes it as a symlink.
 
1560
 
 
1561
        This should not be called if this platform does not have symlink
 
1562
        support.
 
1563
        """
 
1564
        # caller should care about skipping test on platforms without symlinks
 
1565
        os.symlink('path/to/foo', 'a')
 
1566
 
 
1567
        stat_value = os.lstat('a')
 
1568
        packed_stat = dirstate.pack_stat(stat_value)
 
1569
 
 
1570
        link_or_sha1 = state.update_entry(entry, abspath='a')
 
1571
        self.assertEqual('path/to/foo', link_or_sha1)
 
1572
        self.assertEqual([('l', 'path/to/foo', 11, False, packed_stat)],
 
1573
                         entry[1])
 
1574
        return packed_stat
 
1575
 
 
1576
    def test_update_missing_file(self):
 
1577
        state, entry = self.get_state_with_a()
 
1578
        packed_stat = self.create_and_test_file(state, entry)
 
1579
        # Now if we delete the file, update_entry should recover and
 
1580
        # return None.
 
1581
        os.remove('a')
 
1582
        self.assertIs(None, state.update_entry(entry, abspath='a'))
 
1583
        # And the record shouldn't be changed.
 
1584
        digest = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1585
        self.assertEqual([('f', digest, 14, False, packed_stat)],
 
1586
                         entry[1])
 
1587
 
 
1588
    def test_update_missing_dir(self):
 
1589
        state, entry = self.get_state_with_a()
 
1590
        packed_stat = self.create_and_test_dir(state, entry)
 
1591
        # Now if we delete the directory, update_entry should recover and
 
1592
        # return None.
 
1593
        os.rmdir('a')
 
1594
        self.assertIs(None, state.update_entry(entry, abspath='a'))
 
1595
        self.assertEqual([('d', '', 0, False, packed_stat)], entry[1])
 
1596
 
 
1597
    def test_update_missing_symlink(self):
 
1598
        if not osutils.has_symlinks():
 
1599
            # PlatformDeficiency / TestSkipped
 
1600
            raise TestSkipped("No symlink support")
 
1601
        state, entry = self.get_state_with_a()
 
1602
        packed_stat = self.create_and_test_symlink(state, entry)
 
1603
        os.remove('a')
 
1604
        self.assertIs(None, state.update_entry(entry, abspath='a'))
 
1605
        # And the record shouldn't be changed.
 
1606
        self.assertEqual([('l', 'path/to/foo', 11, False, packed_stat)],
 
1607
                         entry[1])
 
1608
 
 
1609
    def test_update_file_to_dir(self):
 
1610
        """If a file changes to a directory we return None for the sha.
 
1611
        We also update the inventory record.
 
1612
        """
 
1613
        state, entry = self.get_state_with_a()
 
1614
        self.create_and_test_file(state, entry)
 
1615
        os.remove('a')
 
1616
        self.create_and_test_dir(state, entry)
 
1617
 
 
1618
    def test_update_file_to_symlink(self):
 
1619
        """File becomes a symlink"""
 
1620
        if not osutils.has_symlinks():
 
1621
            # PlatformDeficiency / TestSkipped
 
1622
            raise TestSkipped("No symlink support")
 
1623
        state, entry = self.get_state_with_a()
 
1624
        self.create_and_test_file(state, entry)
 
1625
        os.remove('a')
 
1626
        self.create_and_test_symlink(state, entry)
 
1627
 
 
1628
    def test_update_dir_to_file(self):
 
1629
        """Directory becoming a file updates the entry."""
 
1630
        state, entry = self.get_state_with_a()
 
1631
        self.create_and_test_dir(state, entry)
 
1632
        os.rmdir('a')
 
1633
        self.create_and_test_file(state, entry)
 
1634
 
 
1635
    def test_update_dir_to_symlink(self):
 
1636
        """Directory becomes a symlink"""
 
1637
        if not osutils.has_symlinks():
 
1638
            # PlatformDeficiency / TestSkipped
 
1639
            raise TestSkipped("No symlink support")
 
1640
        state, entry = self.get_state_with_a()
 
1641
        self.create_and_test_dir(state, entry)
 
1642
        os.rmdir('a')
 
1643
        self.create_and_test_symlink(state, entry)
 
1644
 
 
1645
    def test_update_symlink_to_file(self):
 
1646
        """Symlink becomes a file"""
 
1647
        if not has_symlinks():
 
1648
            raise TestSkipped("No symlink support")
 
1649
        state, entry = self.get_state_with_a()
 
1650
        self.create_and_test_symlink(state, entry)
 
1651
        os.remove('a')
 
1652
        self.create_and_test_file(state, entry)
 
1653
 
 
1654
    def test_update_symlink_to_dir(self):
 
1655
        """Symlink becomes a directory"""
 
1656
        if not has_symlinks():
 
1657
            raise TestSkipped("No symlink support")
 
1658
        state, entry = self.get_state_with_a()
 
1659
        self.create_and_test_symlink(state, entry)
 
1660
        os.remove('a')
 
1661
        self.create_and_test_dir(state, entry)
 
1662
 
 
1663
    def test__is_executable_win32(self):
 
1664
        state, entry = self.get_state_with_a()
 
1665
        self.build_tree(['a'])
 
1666
 
 
1667
        # Make sure we are using the win32 implementation of _is_executable
 
1668
        state._is_executable = state._is_executable_win32
 
1669
 
 
1670
        # The file on disk is not executable, but we are marking it as though
 
1671
        # it is. With _is_executable_win32 we ignore what is on disk.
 
1672
        entry[1][0] = ('f', '', 0, True, dirstate.DirState.NULLSTAT)
 
1673
 
 
1674
        stat_value = os.lstat('a')
 
1675
        packed_stat = dirstate.pack_stat(stat_value)
 
1676
 
 
1677
        state.adjust_time(-10) # Make sure everything is new
 
1678
        # Make sure it wants to kkkkkkkk
 
1679
        state.update_entry(entry, abspath='a', stat_value=stat_value)
 
1680
 
 
1681
        # The row is updated, but the executable bit stays set.
 
1682
        digest = 'b50e5406bb5e153ebbeb20268fcf37c87e1ecfb6'
 
1683
        self.assertEqual([('f', digest, 14, True, packed_stat)], entry[1])
 
1684
 
 
1685
 
 
1686
class TestPackStat(TestCaseWithTransport):
1798
1687
 
1799
1688
    def assertPackStat(self, expected, stat_value):
1800
1689
        """Check the packed and serialized form of a stat value."""
1849
1738
class TestBisect(TestCaseWithDirState):
1850
1739
    """Test the ability to bisect into the disk format."""
1851
1740
 
 
1741
 
1852
1742
    def assertBisect(self, expected_map, map_keys, state, paths):
1853
1743
        """Assert that bisecting for paths returns the right result.
1854
1744
 
1859
1749
                      (dir, name) tuples, and sorted according to how _bisect
1860
1750
                      requires.
1861
1751
        """
1862
 
        result = state._bisect(paths)
 
1752
        dir_names = sorted(osutils.split(p) for p in paths)
 
1753
        result = state._bisect(dir_names)
1863
1754
        # For now, results are just returned in whatever order we read them.
1864
1755
        # We could sort by (dir, name, file_id) or something like that, but in
1865
1756
        # the end it would still be fairly arbitrary, and we don't want the
1866
1757
        # extra overhead if we can avoid it. So sort everything to make sure
1867
1758
        # equality is true
1868
 
        self.assertEqual(len(map_keys), len(paths))
 
1759
        assert len(map_keys) == len(dir_names)
1869
1760
        expected = {}
1870
 
        for path, keys in zip(paths, map_keys):
 
1761
        for dir_name, keys in zip(dir_names, map_keys):
1871
1762
            if keys is None:
1872
1763
                # This should not be present in the output
1873
1764
                continue
1874
 
            expected[path] = sorted(expected_map[k] for k in keys)
 
1765
            expected[dir_name] = sorted(expected_map[k] for k in keys)
1875
1766
 
1876
 
        # The returned values are just arranged randomly based on when they
1877
 
        # were read, for testing, make sure it is properly sorted.
1878
 
        for path in result:
1879
 
            result[path].sort()
 
1767
        for dir_name in result:
 
1768
            result[dir_name].sort()
1880
1769
 
1881
1770
        self.assertEqual(expected, result)
1882
1771
 
1890
1779
        :param paths: A list of directories
1891
1780
        """
1892
1781
        result = state._bisect_dirblocks(paths)
1893
 
        self.assertEqual(len(map_keys), len(paths))
 
1782
        assert len(map_keys) == len(paths)
 
1783
 
1894
1784
        expected = {}
1895
1785
        for path, keys in zip(paths, map_keys):
1896
1786
            if keys is None:
1918
1808
            dir_name_id, trees_info = entry
1919
1809
            expected[dir_name_id] = trees_info
1920
1810
 
1921
 
        result = state._bisect_recursive(paths)
 
1811
        dir_names = sorted(osutils.split(p) for p in paths)
 
1812
        result = state._bisect_recursive(dir_names)
1922
1813
 
1923
1814
        self.assertEqual(expected, result)
1924
1815
 
1933
1824
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1934
1825
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1935
1826
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1936
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1937
1827
        self.assertBisect(expected, [['f']], state, ['f'])
1938
1828
 
1939
1829
    def test_bisect_multi(self):
1942
1832
        # Bisect should be capable of finding multiple entries at the same time
1943
1833
        self.assertBisect(expected, [['a'], ['b'], ['f']],
1944
1834
                          state, ['a', 'b', 'f'])
 
1835
        # ('', 'f') sorts before the others
1945
1836
        self.assertBisect(expected, [['f'], ['b/d'], ['b/d/e']],
1946
 
                          state, ['f', 'b/d', 'b/d/e'])
1947
 
        self.assertBisect(expected, [['b'], ['b-c'], ['b/c']],
1948
 
                          state, ['b', 'b-c', 'b/c'])
 
1837
                          state, ['b/d', 'b/d/e', 'f'])
1949
1838
 
1950
1839
    def test_bisect_one_page(self):
1951
1840
        """Test bisect when there is only 1 page to read"""
1957
1846
        self.assertBisect(expected,[['b/c']], state, ['b/c'])
1958
1847
        self.assertBisect(expected,[['b/d']], state, ['b/d'])
1959
1848
        self.assertBisect(expected,[['b/d/e']], state, ['b/d/e'])
1960
 
        self.assertBisect(expected,[['b-c']], state, ['b-c'])
1961
1849
        self.assertBisect(expected,[['f']], state, ['f'])
1962
1850
        self.assertBisect(expected,[['a'], ['b'], ['f']],
1963
1851
                          state, ['a', 'b', 'f'])
1964
 
        self.assertBisect(expected, [['b/d'], ['b/d/e'], ['f']],
 
1852
        # ('', 'f') sorts before the others
 
1853
        self.assertBisect(expected, [['f'], ['b/d'], ['b/d/e']],
1965
1854
                          state, ['b/d', 'b/d/e', 'f'])
1966
 
        self.assertBisect(expected, [['b'], ['b/c'], ['b-c']],
1967
 
                          state, ['b', 'b/c', 'b-c'])
1968
1855
 
1969
1856
    def test_bisect_duplicate_paths(self):
1970
1857
        """When bisecting for a path, handle multiple entries."""
1978
1865
        self.assertBisect(expected, [['b/d', 'b/d2']], state, ['b/d'])
1979
1866
        self.assertBisect(expected, [['b/d/e', 'b/d/e2']],
1980
1867
                          state, ['b/d/e'])
1981
 
        self.assertBisect(expected, [['b-c', 'b-c2']], state, ['b-c'])
1982
1868
        self.assertBisect(expected, [['f', 'f2']], state, ['f'])
1983
1869
 
1984
1870
    def test_bisect_page_size_too_small(self):
1991
1877
        self.assertBisect(expected, [['b/c']], state, ['b/c'])
1992
1878
        self.assertBisect(expected, [['b/d']], state, ['b/d'])
1993
1879
        self.assertBisect(expected, [['b/d/e']], state, ['b/d/e'])
1994
 
        self.assertBisect(expected, [['b-c']], state, ['b-c'])
1995
1880
        self.assertBisect(expected, [['f']], state, ['f'])
1996
1881
 
1997
1882
    def test_bisect_missing(self):
2000
1885
        self.assertBisect(expected, [None], state, ['foo'])
2001
1886
        self.assertBisect(expected, [None], state, ['b/foo'])
2002
1887
        self.assertBisect(expected, [None], state, ['bar/foo'])
2003
 
        self.assertBisect(expected, [None], state, ['b-c/foo'])
2004
1888
 
2005
1889
        self.assertBisect(expected, [['a'], None, ['b/d']],
2006
1890
                          state, ['a', 'foo', 'b/d'])
2022
1906
    def test_bisect_dirblocks(self):
2023
1907
        tree, state, expected = self.create_duplicated_dirstate()
2024
1908
        self.assertBisectDirBlocks(expected,
2025
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2']],
2026
 
            state, [''])
 
1909
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2']], state, [''])
2027
1910
        self.assertBisectDirBlocks(expected,
2028
1911
            [['b/c', 'b/c2', 'b/d', 'b/d2']], state, ['b'])
2029
1912
        self.assertBisectDirBlocks(expected,
2030
1913
            [['b/d/e', 'b/d/e2']], state, ['b/d'])
2031
1914
        self.assertBisectDirBlocks(expected,
2032
 
            [['', 'a', 'a2', 'b', 'b2', 'b-c', 'b-c2', 'f', 'f2'],
 
1915
            [['', 'a', 'a2', 'b', 'b2', 'f', 'f2'],
2033
1916
             ['b/c', 'b/c2', 'b/d', 'b/d2'],
2034
1917
             ['b/d/e', 'b/d/e2'],
2035
1918
            ], state, ['', 'b', 'b/d'])
2050
1933
        self.assertBisectRecursive(expected, ['a'], state, ['a'])
2051
1934
        self.assertBisectRecursive(expected, ['b/c'], state, ['b/c'])
2052
1935
        self.assertBisectRecursive(expected, ['b/d/e'], state, ['b/d/e'])
2053
 
        self.assertBisectRecursive(expected, ['b-c'], state, ['b-c'])
2054
1936
        self.assertBisectRecursive(expected, ['b/d', 'b/d/e'],
2055
1937
                                   state, ['b/d'])
2056
1938
        self.assertBisectRecursive(expected, ['b', 'b/c', 'b/d', 'b/d/e'],
2057
1939
                                   state, ['b'])
2058
 
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'b-c', 'f', 'b/c',
 
1940
        self.assertBisectRecursive(expected, ['', 'a', 'b', 'f', 'b/c',
2059
1941
                                              'b/d', 'b/d/e'],
2060
1942
                                   state, [''])
2061
1943
 
2085
1967
                                   state, ['b'])
2086
1968
 
2087
1969
 
 
1970
class TestBisectDirblock(TestCase):
 
1971
    """Test that bisect_dirblock() returns the expected values.
 
1972
 
 
1973
    bisect_dirblock is intended to work like bisect.bisect_left() except it
 
1974
    knows it is working on dirblocks and that dirblocks are sorted by ('path',
 
1975
    'to', 'foo') chunks rather than by raw 'path/to/foo'.
 
1976
    """
 
1977
 
 
1978
    def assertBisect(self, dirblocks, split_dirblocks, path, *args, **kwargs):
 
1979
        """Assert that bisect_split works like bisect_left on the split paths.
 
1980
 
 
1981
        :param dirblocks: A list of (path, [info]) pairs.
 
1982
        :param split_dirblocks: A list of ((split, path), [info]) pairs.
 
1983
        :param path: The path we are indexing.
 
1984
 
 
1985
        All other arguments will be passed along.
 
1986
        """
 
1987
        bisect_split_idx = dirstate.bisect_dirblock(dirblocks, path,
 
1988
                                                 *args, **kwargs)
 
1989
        split_dirblock = (path.split('/'), [])
 
1990
        bisect_left_idx = bisect.bisect_left(split_dirblocks, split_dirblock,
 
1991
                                             *args)
 
1992
        self.assertEqual(bisect_left_idx, bisect_split_idx,
 
1993
                         'bisect_split disagreed. %s != %s'
 
1994
                         ' for key %s'
 
1995
                         % (bisect_left_idx, bisect_split_idx, path)
 
1996
                         )
 
1997
 
 
1998
    def paths_to_dirblocks(self, paths):
 
1999
        """Convert a list of paths into dirblock form.
 
2000
 
 
2001
        Also, ensure that the paths are in proper sorted order.
 
2002
        """
 
2003
        dirblocks = [(path, []) for path in paths]
 
2004
        split_dirblocks = [(path.split('/'), []) for path in paths]
 
2005
        self.assertEqual(sorted(split_dirblocks), split_dirblocks)
 
2006
        return dirblocks, split_dirblocks
 
2007
 
 
2008
    def test_simple(self):
 
2009
        """In the simple case it works just like bisect_left"""
 
2010
        paths = ['', 'a', 'b', 'c', 'd']
 
2011
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2012
        for path in paths:
 
2013
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2014
        self.assertBisect(dirblocks, split_dirblocks, '_')
 
2015
        self.assertBisect(dirblocks, split_dirblocks, 'aa')
 
2016
        self.assertBisect(dirblocks, split_dirblocks, 'bb')
 
2017
        self.assertBisect(dirblocks, split_dirblocks, 'cc')
 
2018
        self.assertBisect(dirblocks, split_dirblocks, 'dd')
 
2019
        self.assertBisect(dirblocks, split_dirblocks, 'a/a')
 
2020
        self.assertBisect(dirblocks, split_dirblocks, 'b/b')
 
2021
        self.assertBisect(dirblocks, split_dirblocks, 'c/c')
 
2022
        self.assertBisect(dirblocks, split_dirblocks, 'd/d')
 
2023
 
 
2024
    def test_involved(self):
 
2025
        """This is where bisect_left diverges slightly."""
 
2026
        paths = ['', 'a',
 
2027
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2028
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2029
                 'a-a', 'a-z',
 
2030
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2031
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2032
                 'z-a', 'z-z',
 
2033
                ]
 
2034
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2035
        for path in paths:
 
2036
            self.assertBisect(dirblocks, split_dirblocks, path)
 
2037
 
 
2038
    def test_involved_cached(self):
 
2039
        """This is where bisect_left diverges slightly."""
 
2040
        paths = ['', 'a',
 
2041
                 'a/a', 'a/a/a', 'a/a/z', 'a/a-a', 'a/a-z',
 
2042
                 'a/z', 'a/z/a', 'a/z/z', 'a/z-a', 'a/z-z',
 
2043
                 'a-a', 'a-z',
 
2044
                 'z', 'z/a/a', 'z/a/z', 'z/a-a', 'z/a-z',
 
2045
                 'z/z', 'z/z/a', 'z/z/z', 'z/z-a', 'z/z-z',
 
2046
                 'z-a', 'z-z',
 
2047
                ]
 
2048
        cache = {}
 
2049
        dirblocks, split_dirblocks = self.paths_to_dirblocks(paths)
 
2050
        for path in paths:
 
2051
            self.assertBisect(dirblocks, split_dirblocks, path, cache=cache)
 
2052
 
 
2053
 
2088
2054
class TestDirstateValidation(TestCaseWithDirState):
2089
2055
 
2090
2056
    def test_validate_correct_dirstate(self):
2140
2106
            state._validate)
2141
2107
        self.assertContainsRe(str(e),
2142
2108
            'file a-id is absent in row')
2143
 
 
2144
 
 
2145
 
class TestDirstateTreeReference(TestCaseWithDirState):
2146
 
 
2147
 
    def test_reference_revision_is_none(self):
2148
 
        tree = self.make_branch_and_tree('tree', format='dirstate-with-subtree')
2149
 
        subtree = self.make_branch_and_tree('tree/subtree',
2150
 
                            format='dirstate-with-subtree')
2151
 
        subtree.set_root_id('subtree')
2152
 
        tree.add_reference(subtree)
2153
 
        tree.add('subtree')
2154
 
        state = dirstate.DirState.from_tree(tree, 'dirstate')
2155
 
        key = ('', 'subtree', 'subtree')
2156
 
        expected = ('', [(key,
2157
 
            [('t', '', 0, False, 'xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx')])])
2158
 
 
2159
 
        try:
2160
 
            self.assertEqual(expected, state._find_block(key))
2161
 
        finally:
2162
 
            state.unlock()
2163
 
 
2164
 
 
2165
 
class TestDiscardMergeParents(TestCaseWithDirState):
2166
 
 
2167
 
    def test_discard_no_parents(self):
2168
 
        # This should be a no-op
2169
 
        state = self.create_empty_dirstate()
2170
 
        self.addCleanup(state.unlock)
2171
 
        state._discard_merge_parents()
2172
 
        state._validate()
2173
 
 
2174
 
    def test_discard_one_parent(self):
2175
 
        # No-op
2176
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
2177
 
        root_entry_direntry = ('', '', 'a-root-value'), [
2178
 
            ('d', '', 0, False, packed_stat),
2179
 
            ('d', '', 0, False, packed_stat),
2180
 
            ]
2181
 
        dirblocks = []
2182
 
        dirblocks.append(('', [root_entry_direntry]))
2183
 
        dirblocks.append(('', []))
2184
 
 
2185
 
        state = self.create_empty_dirstate()
2186
 
        self.addCleanup(state.unlock)
2187
 
        state._set_data(['parent-id'], dirblocks[:])
2188
 
        state._validate()
2189
 
 
2190
 
        state._discard_merge_parents()
2191
 
        state._validate()
2192
 
        self.assertEqual(dirblocks, state._dirblocks)
2193
 
 
2194
 
    def test_discard_simple(self):
2195
 
        # No-op
2196
 
        packed_stat = 'AAAAREUHaIpFB2iKAAADAQAtkqUAAIGk'
2197
 
        root_entry_direntry = ('', '', 'a-root-value'), [
2198
 
            ('d', '', 0, False, packed_stat),
2199
 
            ('d', '', 0, False, packed_stat),
2200
 
            ('d', '', 0, False, packed_stat),
2201
 
            ]
2202
 
        expected_root_entry_direntry = ('', '', 'a-root-value'), [
2203
 
            ('d', '', 0, False, packed_stat),
2204
 
            ('d', '', 0, False, packed_stat),
2205
 
            ]
2206
 
        dirblocks = []
2207
 
        dirblocks.append(('', [root_entry_direntry]))
2208
 
        dirblocks.append(('', []))
2209
 
 
2210
 
        state = self.create_empty_dirstate()
2211
 
        self.addCleanup(state.unlock)
2212
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2213
 
        state._validate()
2214
 
 
2215
 
        # This should strip of the extra column
2216
 
        state._discard_merge_parents()
2217
 
        state._validate()
2218
 
        expected_dirblocks = [('', [expected_root_entry_direntry]), ('', [])]
2219
 
        self.assertEqual(expected_dirblocks, state._dirblocks)
2220
 
 
2221
 
    def test_discard_absent(self):
2222
 
        """If entries are only in a merge, discard should remove the entries"""
2223
 
        null_stat = dirstate.DirState.NULLSTAT
2224
 
        present_dir = ('d', '', 0, False, null_stat)
2225
 
        present_file = ('f', '', 0, False, null_stat)
2226
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2227
 
        root_key = ('', '', 'a-root-value')
2228
 
        file_in_root_key = ('', 'file-in-root', 'a-file-id')
2229
 
        file_in_merged_key = ('', 'file-in-merged', 'b-file-id')
2230
 
        dirblocks = [('', [(root_key, [present_dir, present_dir, present_dir])]),
2231
 
                     ('', [(file_in_merged_key,
2232
 
                            [absent, absent, present_file]),
2233
 
                           (file_in_root_key,
2234
 
                            [present_file, present_file, present_file]),
2235
 
                          ]),
2236
 
                    ]
2237
 
 
2238
 
        state = self.create_empty_dirstate()
2239
 
        self.addCleanup(state.unlock)
2240
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2241
 
        state._validate()
2242
 
 
2243
 
        exp_dirblocks = [('', [(root_key, [present_dir, present_dir])]),
2244
 
                         ('', [(file_in_root_key,
2245
 
                                [present_file, present_file]),
2246
 
                              ]),
2247
 
                        ]
2248
 
        state._discard_merge_parents()
2249
 
        state._validate()
2250
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2251
 
 
2252
 
    def test_discard_renamed(self):
2253
 
        null_stat = dirstate.DirState.NULLSTAT
2254
 
        present_dir = ('d', '', 0, False, null_stat)
2255
 
        present_file = ('f', '', 0, False, null_stat)
2256
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2257
 
        root_key = ('', '', 'a-root-value')
2258
 
        file_in_root_key = ('', 'file-in-root', 'a-file-id')
2259
 
        # Renamed relative to parent
2260
 
        file_rename_s_key = ('', 'file-s', 'b-file-id')
2261
 
        file_rename_t_key = ('', 'file-t', 'b-file-id')
2262
 
        # And one that is renamed between the parents, but absent in this
2263
 
        key_in_1 = ('', 'file-in-1', 'c-file-id')
2264
 
        key_in_2 = ('', 'file-in-2', 'c-file-id')
2265
 
 
2266
 
        dirblocks = [
2267
 
            ('', [(root_key, [present_dir, present_dir, present_dir])]),
2268
 
            ('', [(key_in_1,
2269
 
                   [absent, present_file, ('r', 'file-in-2', 'c-file-id')]),
2270
 
                  (key_in_2,
2271
 
                   [absent, ('r', 'file-in-1', 'c-file-id'), present_file]),
2272
 
                  (file_in_root_key,
2273
 
                   [present_file, present_file, present_file]),
2274
 
                  (file_rename_s_key,
2275
 
                   [('r', 'file-t', 'b-file-id'), absent, present_file]),
2276
 
                  (file_rename_t_key,
2277
 
                   [present_file, absent, ('r', 'file-s', 'b-file-id')]),
2278
 
                 ]),
2279
 
        ]
2280
 
        exp_dirblocks = [
2281
 
            ('', [(root_key, [present_dir, present_dir])]),
2282
 
            ('', [(key_in_1, [absent, present_file]),
2283
 
                  (file_in_root_key, [present_file, present_file]),
2284
 
                  (file_rename_t_key, [present_file, absent]),
2285
 
                 ]),
2286
 
        ]
2287
 
        state = self.create_empty_dirstate()
2288
 
        self.addCleanup(state.unlock)
2289
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2290
 
        state._validate()
2291
 
 
2292
 
        state._discard_merge_parents()
2293
 
        state._validate()
2294
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2295
 
 
2296
 
    def test_discard_all_subdir(self):
2297
 
        null_stat = dirstate.DirState.NULLSTAT
2298
 
        present_dir = ('d', '', 0, False, null_stat)
2299
 
        present_file = ('f', '', 0, False, null_stat)
2300
 
        absent = dirstate.DirState.NULL_PARENT_DETAILS
2301
 
        root_key = ('', '', 'a-root-value')
2302
 
        subdir_key = ('', 'sub', 'dir-id')
2303
 
        child1_key = ('sub', 'child1', 'child1-id')
2304
 
        child2_key = ('sub', 'child2', 'child2-id')
2305
 
        child3_key = ('sub', 'child3', 'child3-id')
2306
 
 
2307
 
        dirblocks = [
2308
 
            ('', [(root_key, [present_dir, present_dir, present_dir])]),
2309
 
            ('', [(subdir_key, [present_dir, present_dir, present_dir])]),
2310
 
            ('sub', [(child1_key, [absent, absent, present_file]),
2311
 
                     (child2_key, [absent, absent, present_file]),
2312
 
                     (child3_key, [absent, absent, present_file]),
2313
 
                    ]),
2314
 
        ]
2315
 
        exp_dirblocks = [
2316
 
            ('', [(root_key, [present_dir, present_dir])]),
2317
 
            ('', [(subdir_key, [present_dir, present_dir])]),
2318
 
            ('sub', []),
2319
 
        ]
2320
 
        state = self.create_empty_dirstate()
2321
 
        self.addCleanup(state.unlock)
2322
 
        state._set_data(['parent-id', 'merged-id'], dirblocks[:])
2323
 
        state._validate()
2324
 
 
2325
 
        state._discard_merge_parents()
2326
 
        state._validate()
2327
 
        self.assertEqual(exp_dirblocks, state._dirblocks)
2328
 
 
2329
 
 
2330
 
class Test_InvEntryToDetails(tests.TestCase):
2331
 
 
2332
 
    def assertDetails(self, expected, inv_entry):
2333
 
        details = dirstate.DirState._inv_entry_to_details(inv_entry)
2334
 
        self.assertEqual(expected, details)
2335
 
        # details should always allow join() and always be a plain str when
2336
 
        # finished
2337
 
        (minikind, fingerprint, size, executable, tree_data) = details
2338
 
        self.assertIsInstance(minikind, str)
2339
 
        self.assertIsInstance(fingerprint, str)
2340
 
        self.assertIsInstance(tree_data, str)
2341
 
 
2342
 
    def test_unicode_symlink(self):
2343
 
        inv_entry = inventory.InventoryLink('link-file-id',
2344
 
                                            u'nam\N{Euro Sign}e',
2345
 
                                            'link-parent-id')
2346
 
        inv_entry.revision = 'link-revision-id'
2347
 
        target = u'link-targ\N{Euro Sign}t'
2348
 
        inv_entry.symlink_target = target
2349
 
        self.assertDetails(('l', target.encode('UTF-8'), 0, False,
2350
 
                            'link-revision-id'), inv_entry)
2351
 
 
2352
 
 
2353
 
class TestSHA1Provider(tests.TestCaseInTempDir):
2354
 
 
2355
 
    def test_sha1provider_is_an_interface(self):
2356
 
        p = dirstate.SHA1Provider()
2357
 
        self.assertRaises(NotImplementedError, p.sha1, "foo")
2358
 
        self.assertRaises(NotImplementedError, p.stat_and_sha1, "foo")
2359
 
 
2360
 
    def test_defaultsha1provider_sha1(self):
2361
 
        text = 'test\r\nwith\nall\rpossible line endings\r\n'
2362
 
        self.build_tree_contents([('foo', text)])
2363
 
        expected_sha = osutils.sha_string(text)
2364
 
        p = dirstate.DefaultSHA1Provider()
2365
 
        self.assertEqual(expected_sha, p.sha1('foo'))
2366
 
 
2367
 
    def test_defaultsha1provider_stat_and_sha1(self):
2368
 
        text = 'test\r\nwith\nall\rpossible line endings\r\n'
2369
 
        self.build_tree_contents([('foo', text)])
2370
 
        expected_sha = osutils.sha_string(text)
2371
 
        p = dirstate.DefaultSHA1Provider()
2372
 
        statvalue, sha1 = p.stat_and_sha1('foo')
2373
 
        self.assertTrue(len(statvalue) >= 10)
2374
 
        self.assertEqual(len(text), statvalue.st_size)
2375
 
        self.assertEqual(expected_sha, sha1)