~bzr-pqm/bzr/bzr.dev

846 by Martin Pool
- start adding refactored/simplified hash cache
1
# (C) 2005 Canonical Ltd
2
3
# This program is free software; you can redistribute it and/or modify
4
# it under the terms of the GNU General Public License as published by
5
# the Free Software Foundation; either version 2 of the License, or
6
# (at your option) any later version.
7
8
# This program is distributed in the hope that it will be useful,
9
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11
# GNU General Public License for more details.
12
13
# You should have received a copy of the GNU General Public License
14
# along with this program; if not, write to the Free Software
15
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
16
1185.1.40 by Robert Collins
Merge what applied of Alexander Belchenko's win32 patch.
17
import os
18
import time
1141 by Martin Pool
- rename FunctionalTest to TestCaseInTempDir
19
from bzrlib.selftest import TestCaseInTempDir
846 by Martin Pool
- start adding refactored/simplified hash cache
20
21
22
23
def sha1(t):
24
    import sha
25
    return sha.new(t).hexdigest()
26
27
28
def pause():
1185.1.40 by Robert Collins
Merge what applied of Alexander Belchenko's win32 patch.
29
    if os.name == 'nt':
30
        time.sleep(3)
31
        return
846 by Martin Pool
- start adding refactored/simplified hash cache
32
    # allow it to stabilize
33
    start = int(time.time())
34
    while int(time.time()) == start:
35
        time.sleep(0.2)
36
    
37
1141 by Martin Pool
- rename FunctionalTest to TestCaseInTempDir
38
class TestHashCache(TestCaseInTempDir):
1102 by Martin Pool
- merge test refactoring from robertc
39
40
    def test_hashcache(self):
41
        """Functional tests for hashcache"""
846 by Martin Pool
- start adding refactored/simplified hash cache
42
        from bzrlib.hashcache import HashCache
43
        import os
44
866 by Martin Pool
- use new path-based hashcache for WorkingTree- squash mtime/ctime to whole seconds- update and if necessary write out hashcache when WorkingTree object is created.
45
        # make a dummy bzr directory just to hold the cache
46
        os.mkdir('.bzr')
846 by Martin Pool
- start adding refactored/simplified hash cache
47
        hc = HashCache('.')
48
49
        file('foo', 'wb').write('hello')
50
        os.mkdir('subdir')
51
        pause()
52
53
        self.assertEquals(hc.get_sha1('foo'),
54
                          'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d')
55
        self.assertEquals(hc.miss_count, 1)
56
        self.assertEquals(hc.hit_count, 0)
57
58
        # check we hit without re-reading
59
        self.assertEquals(hc.get_sha1('foo'),
60
                          'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d')
61
        self.assertEquals(hc.miss_count, 1)
62
        self.assertEquals(hc.hit_count, 1)
63
64
        # check again without re-reading
65
        self.assertEquals(hc.get_sha1('foo'),
66
                          'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d')
67
        self.assertEquals(hc.miss_count, 1)
68
        self.assertEquals(hc.hit_count, 2)
69
70
        # write new file and make sure it is seen
71
        file('foo', 'wb').write('goodbye')
72
        pause()
73
        self.assertEquals(hc.get_sha1('foo'),
74
                          '3c8ec4874488f6090a157b014ce3397ca8e06d4f')
75
        self.assertEquals(hc.miss_count, 2)
76
77
        # quickly write new file of same size and make sure it is seen
78
        # this may rely on detection of timestamps that are too close
79
        # together to be safe
80
        file('foo', 'wb').write('g00dbye')
81
        self.assertEquals(hc.get_sha1('foo'),
82
                          sha1('g00dbye'))
863 by Martin Pool
- more hashcache tests
83
84
        file('foo2', 'wb').write('other file')
85
        self.assertEquals(hc.get_sha1('foo2'), sha1('other file'))
86
87
        os.remove('foo2')
88
        self.assertEquals(hc.get_sha1('foo2'), None)
89
90
        file('foo2', 'wb').write('new content')
91
        self.assertEquals(hc.get_sha1('foo2'), sha1('new content'))
846 by Martin Pool
- start adding refactored/simplified hash cache
92
93
        self.assertEquals(hc.get_sha1('subdir'), None)
848 by Martin Pool
doc
94
863 by Martin Pool
- more hashcache tests
95
        # it's likely neither are cached at the moment because they 
96
        # changed recently, but we can't be sure
861 by Martin Pool
- more hash-cache tests
97
        pause()
98
863 by Martin Pool
- more hashcache tests
99
        # should now be safe to cache it if we reread them
100
        self.assertEquals(hc.get_sha1('foo'), sha1('g00dbye'))
861 by Martin Pool
- more hash-cache tests
101
        self.assertEquals(len(hc._cache), 1)
863 by Martin Pool
- more hashcache tests
102
        self.assertEquals(hc.get_sha1('foo2'), sha1('new content'))
103
        self.assertEquals(len(hc._cache), 2)
861 by Martin Pool
- more hash-cache tests
104
105
        # write out, read back in and check that we don't need to
106
        # re-read any files
866 by Martin Pool
- use new path-based hashcache for WorkingTree- squash mtime/ctime to whole seconds- update and if necessary write out hashcache when WorkingTree object is created.
107
        hc.write()
861 by Martin Pool
- more hash-cache tests
108
        del hc
109
110
        hc = HashCache('.')
866 by Martin Pool
- use new path-based hashcache for WorkingTree- squash mtime/ctime to whole seconds- update and if necessary write out hashcache when WorkingTree object is created.
111
        hc.read()
862 by Martin Pool
- code to re-read hashcache from file
112
863 by Martin Pool
- more hashcache tests
113
        self.assertEquals(len(hc._cache), 2)
862 by Martin Pool
- code to re-read hashcache from file
114
        self.assertEquals(hc.get_sha1('foo'), sha1('g00dbye'))
115
        self.assertEquals(hc.hit_count, 1)
116
        self.assertEquals(hc.miss_count, 0)
863 by Martin Pool
- more hashcache tests
117
        self.assertEquals(hc.get_sha1('foo2'), sha1('new content'))