/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 brzlib/tests/test_hashcache.py

  • Committer: Jelmer Vernooij
  • Date: 2017-05-21 12:41:27 UTC
  • mto: This revision was merged to the branch mainline in revision 6623.
  • Revision ID: jelmer@jelmer.uk-20170521124127-iv8etg0vwymyai6y
s/bzr/brz/ in apport config.

Show diffs side-by-side

added added

removed removed

Lines of Context:
brzlib/tests/test_hashcache.py
18
18
import stat
19
19
import time
20
20
 
21
 
from .. import osutils
22
 
from ..errors import BzrError
23
 
from ..hashcache import HashCache
24
 
from . import (
 
21
from brzlib import osutils
 
22
from brzlib.errors import BzrError
 
23
from brzlib.hashcache import HashCache
 
24
from brzlib.tests import (
25
25
    TestCaseInTempDir,
26
26
    )
27
 
from .features import (
 
27
from brzlib.tests.features import (
28
28
    OsFifoFeature,
29
29
    )
30
30
 
42
42
    def make_hashcache(self):
43
43
        # make a dummy bzr directory just to hold the cache
44
44
        os.mkdir('.bzr')
45
 
        hc = HashCache(u'.', '.bzr/stat-cache')
 
45
        hc = HashCache('.', '.bzr/stat-cache')
46
46
        return hc
47
47
 
48
48
    def reopen_hashcache(self):
49
 
        hc = HashCache(u'.', '.bzr/stat-cache')
 
49
        hc = HashCache('.', '.bzr/stat-cache')
50
50
        hc.read()
51
51
        return hc
52
52
 
53
53
    def test_hashcache_initial_miss(self):
54
54
        """Get correct hash from an empty hashcache"""
55
55
        hc = self.make_hashcache()
56
 
        self.build_tree_contents([('foo', b'hello')])
 
56
        self.build_tree_contents([('foo', 'hello')])
57
57
        self.assertEqual(hc.get_sha1('foo'),
58
 
                         b'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d')
 
58
                          'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d')
59
59
        self.assertEqual(hc.miss_count, 1)
60
60
        self.assertEqual(hc.hit_count, 0)
61
61
 
62
62
    def test_hashcache_new_file(self):
63
63
        hc = self.make_hashcache()
64
 
        self.build_tree_contents([('foo', b'goodbye')])
 
64
        self.build_tree_contents([('foo', 'goodbye')])
65
65
        # now read without pausing; it may not be possible to cache it as its
66
66
        # so new
67
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'goodbye'))
 
67
        self.assertEqual(hc.get_sha1('foo'), sha1('goodbye'))
68
68
 
69
69
    def test_hashcache_nonexistent_file(self):
70
70
        hc = self.make_hashcache()
72
72
 
73
73
    def test_hashcache_replaced_file(self):
74
74
        hc = self.make_hashcache()
75
 
        self.build_tree_contents([('foo', b'goodbye')])
76
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'goodbye'))
 
75
        self.build_tree_contents([('foo', 'goodbye')])
 
76
        self.assertEqual(hc.get_sha1('foo'), sha1('goodbye'))
77
77
        os.remove('foo')
78
78
        self.assertEqual(hc.get_sha1('foo'), None)
79
 
        self.build_tree_contents([('foo', b'new content')])
80
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'new content'))
 
79
        self.build_tree_contents([('foo', 'new content')])
 
80
        self.assertEqual(hc.get_sha1('foo'), sha1('new content'))
81
81
 
82
82
    def test_hashcache_not_file(self):
83
83
        hc = self.make_hashcache()
86
86
 
87
87
    def test_hashcache_load(self):
88
88
        hc = self.make_hashcache()
89
 
        self.build_tree_contents([('foo', b'contents')])
 
89
        self.build_tree_contents([('foo', 'contents')])
90
90
        pause()
91
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'contents'))
 
91
        self.assertEqual(hc.get_sha1('foo'), sha1('contents'))
92
92
        hc.write()
93
93
        hc = self.reopen_hashcache()
94
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'contents'))
 
94
        self.assertEqual(hc.get_sha1('foo'), sha1('contents'))
95
95
        self.assertEqual(hc.hit_count, 1)
96
96
 
97
97
    def test_hammer_hashcache(self):
98
98
        hc = self.make_hashcache()
99
 
        for i in range(10000):
100
 
            with open('foo', 'wb') as f:
101
 
                last_content = b'%08x' % i
 
99
        for i in xrange(10000):
 
100
            self.log('start writing at %s', time.time())
 
101
            f = file('foo', 'w')
 
102
            try:
 
103
                last_content = '%08x' % i
102
104
                f.write(last_content)
 
105
            finally:
 
106
                f.close()
103
107
            last_sha1 = sha1(last_content)
104
108
            self.log("iteration %d: %r -> %r",
105
109
                     i, last_content, last_sha1)
126
130
    This lets us examine how old or new files would be handled, without
127
131
    actually having to wait for time to pass.
128
132
    """
129
 
 
130
133
    def __init__(self):
131
134
        # set root and cache file name to none to make sure we won't touch the
132
135
        # real filesystem
133
 
        HashCache.__init__(self, u'.', 'hashcache')
 
136
        HashCache.__init__(self, '.', 'hashcache')
134
137
        self._files = {}
135
138
        # simulated clock running forward as operations happen
136
139
        self._clock = 0
144
147
        return (len(entry[0]),
145
148
                entry[1], entry[1],
146
149
                10, 20,
147
 
                stat.S_IFREG | 0o600)
 
150
                stat.S_IFREG | 0600)
148
151
 
149
152
    def _really_sha1_file(self, abspath, filters):
150
153
        if abspath in self._files:
169
172
    def test_hashcache_miss_new_file(self):
170
173
        """A new file gives the right sha1 but misses"""
171
174
        hc = self.make_hashcache()
172
 
        hc.put_file('foo', b'hello')
173
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'hello'))
 
175
        hc.put_file('foo', 'hello')
 
176
        self.assertEqual(hc.get_sha1('foo'), sha1('hello'))
174
177
        self.assertEqual(hc.miss_count, 1)
175
178
        self.assertEqual(hc.hit_count, 0)
176
179
        # if we try again it's still too new;
177
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'hello'))
 
180
        self.assertEqual(hc.get_sha1('foo'), sha1('hello'))
178
181
        self.assertEqual(hc.miss_count, 2)
179
182
        self.assertEqual(hc.hit_count, 0)
180
183
 
181
184
    def test_hashcache_old_file(self):
182
185
        """An old file gives the right sha1 and hits"""
183
186
        hc = self.make_hashcache()
184
 
        hc.put_file('foo', b'hello')
 
187
        hc.put_file('foo', 'hello')
185
188
        hc.pretend_to_sleep(20)
186
189
        # file is new; should get the correct hash but miss
187
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'hello'))
 
190
        self.assertEqual(hc.get_sha1('foo'), sha1('hello'))
188
191
        self.assertEqual(hc.miss_count, 1)
189
192
        self.assertEqual(hc.hit_count, 0)
190
193
        # and can now be hit
191
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'hello'))
 
194
        self.assertEqual(hc.get_sha1('foo'), sha1('hello'))
192
195
        self.assertEqual(hc.miss_count, 1)
193
196
        self.assertEqual(hc.hit_count, 1)
194
197
        hc.pretend_to_sleep(3)
195
198
        # and again
196
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'hello'))
 
199
        self.assertEqual(hc.get_sha1('foo'), sha1('hello'))
197
200
        self.assertEqual(hc.miss_count, 1)
198
201
        self.assertEqual(hc.hit_count, 2)
199
202
 
200
203
    def test_hashcache_invalidates(self):
201
204
        hc = self.make_hashcache()
202
 
        hc.put_file('foo', b'hello')
 
205
        hc.put_file('foo', 'hello')
203
206
        hc.pretend_to_sleep(20)
204
207
        hc.get_sha1('foo')
205
 
        hc.put_file('foo', b'h1llo')
206
 
        self.assertEqual(hc.get_sha1('foo'), sha1(b'h1llo'))
 
208
        hc.put_file('foo', 'h1llo')
 
209
        self.assertEqual(hc.get_sha1('foo'), sha1('h1llo'))
207
210
        self.assertEqual(hc.miss_count, 2)
208
211
        self.assertEqual(hc.hit_count, 0)