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 |
||
17 |
from bzrlib.selftest import InTempDir |
|
18 |
||
19 |
||
20 |
||
21 |
def sha1(t): |
|
22 |
import sha |
|
23 |
return sha.new(t).hexdigest() |
|
24 |
||
25 |
||
26 |
def pause(): |
|
27 |
import time |
|
28 |
# allow it to stabilize
|
|
29 |
start = int(time.time()) |
|
30 |
while int(time.time()) == start: |
|
31 |
time.sleep(0.2) |
|
32 |
||
33 |
||
34 |
||
859
by Martin Pool
- add HashCache.write and a simple test for it |
35 |
class TestHashCache(InTempDir): |
865
by Martin Pool
- cleaner 'modified 'command |
36 |
"""Functional tests for hashcache"""
|
846
by Martin Pool
- start adding refactored/simplified hash cache |
37 |
def runTest(self): |
38 |
from bzrlib.hashcache import HashCache |
|
39 |
import os |
|
40 |
import time |
|
41 |
||
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. |
42 |
# make a dummy bzr directory just to hold the cache
|
43 |
os.mkdir('.bzr') |
|
846
by Martin Pool
- start adding refactored/simplified hash cache |
44 |
hc = HashCache('.') |
45 |
||
46 |
file('foo', 'wb').write('hello') |
|
47 |
os.mkdir('subdir') |
|
48 |
pause() |
|
49 |
||
50 |
self.assertEquals(hc.get_sha1('foo'), |
|
51 |
'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d') |
|
52 |
self.assertEquals(hc.miss_count, 1) |
|
53 |
self.assertEquals(hc.hit_count, 0) |
|
54 |
||
55 |
# check we hit without re-reading
|
|
56 |
self.assertEquals(hc.get_sha1('foo'), |
|
57 |
'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d') |
|
58 |
self.assertEquals(hc.miss_count, 1) |
|
59 |
self.assertEquals(hc.hit_count, 1) |
|
60 |
||
61 |
# check again without re-reading
|
|
62 |
self.assertEquals(hc.get_sha1('foo'), |
|
63 |
'aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d') |
|
64 |
self.assertEquals(hc.miss_count, 1) |
|
65 |
self.assertEquals(hc.hit_count, 2) |
|
66 |
||
67 |
# write new file and make sure it is seen
|
|
68 |
file('foo', 'wb').write('goodbye') |
|
69 |
pause() |
|
70 |
self.assertEquals(hc.get_sha1('foo'), |
|
71 |
'3c8ec4874488f6090a157b014ce3397ca8e06d4f') |
|
72 |
self.assertEquals(hc.miss_count, 2) |
|
73 |
||
74 |
# quickly write new file of same size and make sure it is seen
|
|
75 |
# this may rely on detection of timestamps that are too close
|
|
76 |
# together to be safe
|
|
77 |
file('foo', 'wb').write('g00dbye') |
|
78 |
self.assertEquals(hc.get_sha1('foo'), |
|
79 |
sha1('g00dbye')) |
|
863
by Martin Pool
- more hashcache tests |
80 |
|
81 |
file('foo2', 'wb').write('other file') |
|
82 |
self.assertEquals(hc.get_sha1('foo2'), sha1('other file')) |
|
83 |
||
84 |
os.remove('foo2') |
|
85 |
self.assertEquals(hc.get_sha1('foo2'), None) |
|
86 |
||
87 |
file('foo2', 'wb').write('new content') |
|
88 |
self.assertEquals(hc.get_sha1('foo2'), sha1('new content')) |
|
846
by Martin Pool
- start adding refactored/simplified hash cache |
89 |
|
90 |
self.assertEquals(hc.get_sha1('subdir'), None) |
|
848
by Martin Pool
doc |
91 |
|
863
by Martin Pool
- more hashcache tests |
92 |
# it's likely neither are cached at the moment because they
|
93 |
# changed recently, but we can't be sure
|
|
861
by Martin Pool
- more hash-cache tests |
94 |
pause() |
95 |
||
863
by Martin Pool
- more hashcache tests |
96 |
# should now be safe to cache it if we reread them
|
97 |
self.assertEquals(hc.get_sha1('foo'), sha1('g00dbye')) |
|
861
by Martin Pool
- more hash-cache tests |
98 |
self.assertEquals(len(hc._cache), 1) |
863
by Martin Pool
- more hashcache tests |
99 |
self.assertEquals(hc.get_sha1('foo2'), sha1('new content')) |
100 |
self.assertEquals(len(hc._cache), 2) |
|
861
by Martin Pool
- more hash-cache tests |
101 |
|
102 |
# write out, read back in and check that we don't need to
|
|
103 |
# 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. |
104 |
hc.write() |
861
by Martin Pool
- more hash-cache tests |
105 |
del hc |
106 |
||
107 |
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. |
108 |
hc.read() |
862
by Martin Pool
- code to re-read hashcache from file |
109 |
|
863
by Martin Pool
- more hashcache tests |
110 |
self.assertEquals(len(hc._cache), 2) |
862
by Martin Pool
- code to re-read hashcache from file |
111 |
self.assertEquals(hc.get_sha1('foo'), sha1('g00dbye')) |
112 |
self.assertEquals(hc.hit_count, 1) |
|
113 |
self.assertEquals(hc.miss_count, 0) |
|
863
by Martin Pool
- more hashcache tests |
114 |
self.assertEquals(hc.get_sha1('foo2'), sha1('new content')) |
115 |
||
861
by Martin Pool
- more hash-cache tests |
116 |
|
117 |
||
118 |
||
119 |