Commit | Line | Data |
7c250e57 |
1 | #!./perl -w |
a0d0e21e |
2 | |
3 | BEGIN { |
610ab055 |
4 | @INC = '../lib' if -d '../lib' ; |
a0d0e21e |
5 | require Config; import Config; |
6 | if ($Config{'extensions'} !~ /\bDB_File\b/) { |
7 | print "1..0\n"; |
8 | exit 0; |
9 | } |
10 | } |
11 | |
12 | use DB_File; |
13 | use Fcntl; |
14 | |
a6ed719b |
15 | print "1..62\n"; |
f6b705ef |
16 | |
17 | sub ok |
18 | { |
19 | my $no = shift ; |
20 | my $result = shift ; |
21 | |
22 | print "not " unless $result ; |
23 | print "ok $no\n" ; |
24 | } |
a0d0e21e |
25 | |
55d68b4a |
26 | $Dfile = "dbhash.tmp"; |
a0d0e21e |
27 | unlink $Dfile; |
28 | |
29 | umask(0); |
30 | |
31 | # Check the interface to HASHINFO |
32 | |
f6b705ef |
33 | my $dbh = new DB_File::HASHINFO ; |
34 | |
3fe9a6f1 |
35 | ok(1, ! defined $dbh->{bsize}) ; |
36 | ok(2, ! defined $dbh->{ffactor}) ; |
37 | ok(3, ! defined $dbh->{nelem}) ; |
38 | ok(4, ! defined $dbh->{cachesize}) ; |
39 | ok(5, ! defined $dbh->{hash}) ; |
40 | ok(6, ! defined $dbh->{lorder}) ; |
a0d0e21e |
41 | |
42 | $dbh->{bsize} = 3000 ; |
f6b705ef |
43 | ok(7, $dbh->{bsize} == 3000 ); |
a0d0e21e |
44 | |
45 | $dbh->{ffactor} = 9000 ; |
f6b705ef |
46 | ok(8, $dbh->{ffactor} == 9000 ); |
47 | |
a0d0e21e |
48 | $dbh->{nelem} = 400 ; |
f6b705ef |
49 | ok(9, $dbh->{nelem} == 400 ); |
a0d0e21e |
50 | |
51 | $dbh->{cachesize} = 65 ; |
f6b705ef |
52 | ok(10, $dbh->{cachesize} == 65 ); |
a0d0e21e |
53 | |
54 | $dbh->{hash} = "abc" ; |
f6b705ef |
55 | ok(11, $dbh->{hash} eq "abc" ); |
a0d0e21e |
56 | |
57 | $dbh->{lorder} = 1234 ; |
f6b705ef |
58 | ok(12, $dbh->{lorder} == 1234 ); |
a0d0e21e |
59 | |
60 | # Check that an invalid entry is caught both for store & fetch |
61 | eval '$dbh->{fred} = 1234' ; |
f6b705ef |
62 | ok(13, $@ =~ /^DB_File::HASHINFO::STORE - Unknown element 'fred' at/ ); |
610ab055 |
63 | eval 'my $q = $dbh->{fred}' ; |
f6b705ef |
64 | ok(14, $@ =~ /^DB_File::HASHINFO::FETCH - Unknown element 'fred' at/ ); |
a0d0e21e |
65 | |
610ab055 |
66 | |
a0d0e21e |
67 | # Now check the interface to HASH |
68 | |
f6b705ef |
69 | ok(15, $X = tie(%h, 'DB_File',$Dfile, O_RDWR|O_CREAT, 0640, $DB_HASH ) ); |
a0d0e21e |
70 | |
71 | ($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime, |
72 | $blksize,$blocks) = stat($Dfile); |
a9fd575d |
73 | ok(16, ($mode & 0777) == ($^O eq 'os2' ? 0666 : 0640) || $^O eq 'amigaos' || $^O eq 'MSWin32'); |
a0d0e21e |
74 | |
75 | while (($key,$value) = each(%h)) { |
76 | $i++; |
77 | } |
f6b705ef |
78 | ok(17, !$i ); |
a0d0e21e |
79 | |
80 | $h{'goner1'} = 'snork'; |
81 | |
82 | $h{'abc'} = 'ABC'; |
f6b705ef |
83 | ok(18, $h{'abc'} eq 'ABC' ); |
84 | ok(19, !defined $h{'jimmy'} ); |
85 | ok(20, !exists $h{'jimmy'} ); |
86 | ok(21, exists $h{'abc'} ); |
a0d0e21e |
87 | |
88 | $h{'def'} = 'DEF'; |
89 | $h{'jkl','mno'} = "JKL\034MNO"; |
90 | $h{'a',2,3,4,5} = join("\034",'A',2,3,4,5); |
91 | $h{'a'} = 'A'; |
92 | |
93 | #$h{'b'} = 'B'; |
94 | $X->STORE('b', 'B') ; |
95 | |
96 | $h{'c'} = 'C'; |
97 | |
98 | #$h{'d'} = 'D'; |
99 | $X->put('d', 'D') ; |
100 | |
101 | $h{'e'} = 'E'; |
102 | $h{'f'} = 'F'; |
103 | $h{'g'} = 'X'; |
104 | $h{'h'} = 'H'; |
105 | $h{'i'} = 'I'; |
106 | |
107 | $h{'goner2'} = 'snork'; |
108 | delete $h{'goner2'}; |
109 | |
110 | |
111 | # IMPORTANT - $X must be undefined before the untie otherwise the |
112 | # underlying DB close routine will not get called. |
113 | undef $X ; |
114 | untie(%h); |
115 | |
116 | |
117 | # tie to the same file again, do not supply a type - should default to HASH |
f6b705ef |
118 | ok(22, $X = tie(%h,'DB_File',$Dfile, O_RDWR, 0640) ); |
a0d0e21e |
119 | |
120 | # Modify an entry from the previous tie |
121 | $h{'g'} = 'G'; |
122 | |
123 | $h{'j'} = 'J'; |
124 | $h{'k'} = 'K'; |
125 | $h{'l'} = 'L'; |
126 | $h{'m'} = 'M'; |
127 | $h{'n'} = 'N'; |
128 | $h{'o'} = 'O'; |
129 | $h{'p'} = 'P'; |
130 | $h{'q'} = 'Q'; |
131 | $h{'r'} = 'R'; |
132 | $h{'s'} = 'S'; |
133 | $h{'t'} = 'T'; |
134 | $h{'u'} = 'U'; |
135 | $h{'v'} = 'V'; |
136 | $h{'w'} = 'W'; |
137 | $h{'x'} = 'X'; |
138 | $h{'y'} = 'Y'; |
139 | $h{'z'} = 'Z'; |
140 | |
141 | $h{'goner3'} = 'snork'; |
142 | |
143 | delete $h{'goner1'}; |
144 | $X->DELETE('goner3'); |
145 | |
146 | @keys = keys(%h); |
147 | @values = values(%h); |
148 | |
f6b705ef |
149 | ok(23, $#keys == 29 && $#values == 29) ; |
a0d0e21e |
150 | |
f6b705ef |
151 | $i = 0 ; |
55d68b4a |
152 | while (($key,$value) = each(%h)) { |
2f52a358 |
153 | if ($key eq $keys[$i] && $value eq $values[$i] && $key eq lc($value)) { |
a0d0e21e |
154 | $key =~ y/a-z/A-Z/; |
155 | $i++ if $key eq $value; |
156 | } |
157 | } |
158 | |
f6b705ef |
159 | ok(24, $i == 30) ; |
a0d0e21e |
160 | |
55d68b4a |
161 | @keys = ('blurfl', keys(%h), 'dyick'); |
f6b705ef |
162 | ok(25, $#keys == 31) ; |
a0d0e21e |
163 | |
164 | $h{'foo'} = ''; |
f6b705ef |
165 | ok(26, $h{'foo'} eq '' ); |
a0d0e21e |
166 | |
a9fd575d |
167 | #$h{''} = 'bar'; |
168 | #ok(27, $h{''} eq 'bar' ); |
169 | ok(27,1) ; |
a0d0e21e |
170 | |
171 | # check cache overflow and numeric keys and contents |
172 | $ok = 1; |
173 | for ($i = 1; $i < 200; $i++) { $h{$i + 0} = $i + 0; } |
174 | for ($i = 1; $i < 200; $i++) { $ok = 0 unless $h{$i} == $i; } |
f6b705ef |
175 | ok(28, $ok ); |
a0d0e21e |
176 | |
177 | ($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,$mtime,$ctime, |
178 | $blksize,$blocks) = stat($Dfile); |
f6b705ef |
179 | ok(29, $size > 0 ); |
a0d0e21e |
180 | |
181 | @h{0..200} = 200..400; |
182 | @foo = @h{0..200}; |
f6b705ef |
183 | ok(30, join(':',200..400) eq join(':',@foo) ); |
a0d0e21e |
184 | |
185 | |
186 | # Now check all the non-tie specific stuff |
187 | |
188 | # Check NOOVERWRITE will make put fail when attempting to overwrite |
189 | # an existing record. |
190 | |
191 | $status = $X->put( 'x', 'newvalue', R_NOOVERWRITE) ; |
f6b705ef |
192 | ok(31, $status == 1 ); |
a0d0e21e |
193 | |
194 | # check that the value of the key 'x' has not been changed by the |
195 | # previous test |
f6b705ef |
196 | ok(32, $h{'x'} eq 'X' ); |
a0d0e21e |
197 | |
198 | # standard put |
199 | $status = $X->put('key', 'value') ; |
f6b705ef |
200 | ok(33, $status == 0 ); |
a0d0e21e |
201 | |
202 | #check that previous put can be retrieved |
f6b705ef |
203 | $value = 0 ; |
a0d0e21e |
204 | $status = $X->get('key', $value) ; |
f6b705ef |
205 | ok(34, $status == 0 ); |
206 | ok(35, $value eq 'value' ); |
a0d0e21e |
207 | |
208 | # Attempting to delete an existing key should work |
209 | |
210 | $status = $X->del('q') ; |
f6b705ef |
211 | ok(36, $status == 0 ); |
a0d0e21e |
212 | |
213 | # Make sure that the key deleted, cannot be retrieved |
f6b705ef |
214 | $^W = 0 ; |
215 | ok(37, $h{'q'} eq undef ); |
216 | $^W = 1 ; |
a0d0e21e |
217 | |
218 | # Attempting to delete a non-existant key should fail |
219 | |
220 | $status = $X->del('joe') ; |
f6b705ef |
221 | ok(38, $status == 1 ); |
a0d0e21e |
222 | |
223 | # Check the get interface |
224 | |
225 | # First a non-existing key |
226 | $status = $X->get('aaaa', $value) ; |
f6b705ef |
227 | ok(39, $status == 1 ); |
a0d0e21e |
228 | |
229 | # Next an existing key |
230 | $status = $X->get('a', $value) ; |
f6b705ef |
231 | ok(40, $status == 0 ); |
232 | ok(41, $value eq 'A' ); |
a0d0e21e |
233 | |
234 | # seq |
235 | # ### |
236 | |
237 | # ditto, but use put to replace the key/value pair. |
238 | |
239 | # use seq to walk backwards through a file - check that this reversed is |
240 | |
241 | # check seq FIRST/LAST |
242 | |
243 | # sync |
244 | # #### |
245 | |
246 | $status = $X->sync ; |
f6b705ef |
247 | ok(42, $status == 0 ); |
a0d0e21e |
248 | |
249 | |
250 | # fd |
251 | # ## |
252 | |
253 | $status = $X->fd ; |
f6b705ef |
254 | ok(43, $status != 0 ); |
a0d0e21e |
255 | |
256 | undef $X ; |
257 | untie %h ; |
258 | |
259 | unlink $Dfile; |
260 | |
f6b705ef |
261 | # clear |
262 | # ##### |
263 | |
264 | ok(44, tie(%h, 'DB_File', $Dfile, O_RDWR|O_CREAT, 0640, $DB_HASH ) ); |
265 | foreach (1 .. 10) |
266 | { $h{$_} = $_ * 100 } |
267 | |
268 | # check that there are 10 elements in the hash |
269 | $i = 0 ; |
270 | while (($key,$value) = each(%h)) { |
271 | $i++; |
272 | } |
273 | ok(45, $i == 10); |
274 | |
275 | # now clear the hash |
276 | %h = () ; |
277 | |
278 | # check it is empty |
279 | $i = 0 ; |
280 | while (($key,$value) = each(%h)) { |
281 | $i++; |
282 | } |
283 | ok(46, $i == 0); |
284 | |
285 | untie %h ; |
286 | unlink $Dfile ; |
287 | |
288 | |
a0d0e21e |
289 | # Now try an in memory file |
f6b705ef |
290 | ok(47, $X = tie(%h, 'DB_File',undef, O_RDWR|O_CREAT, 0640, $DB_HASH ) ); |
a0d0e21e |
291 | |
292 | # fd with an in memory file should return fail |
293 | $status = $X->fd ; |
f6b705ef |
294 | ok(48, $status == -1 ); |
a0d0e21e |
295 | |
a0d0e21e |
296 | undef $X ; |
610ab055 |
297 | untie %h ; |
298 | |
299 | { |
300 | # check ability to override the default hashing |
301 | my %x ; |
302 | my $filename = "xyz" ; |
303 | my $hi = new DB_File::HASHINFO ; |
304 | $::count = 0 ; |
305 | $hi->{hash} = sub { ++$::count ; length $_[0] } ; |
306 | ok(49, tie %x, 'DB_File', $filename, O_RDWR|O_CREAT, 0640, $hi ) ; |
307 | $h{"abc"} = 123 ; |
308 | ok(50, $h{"abc"} == 123) ; |
309 | untie %x ; |
310 | unlink $filename ; |
311 | ok(51, $::count >0) ; |
312 | } |
a0d0e21e |
313 | |
05475680 |
314 | { |
315 | # check that attempting to tie an array to a DB_HASH will fail |
316 | |
317 | my $filename = "xyz" ; |
318 | my @x ; |
319 | eval { tie @x, 'DB_File', $filename, O_RDWR|O_CREAT, 0640, $DB_HASH ; } ; |
320 | ok(52, $@ =~ /^DB_File can only tie an associative array to a DB_HASH database/) ; |
321 | unlink $filename ; |
322 | } |
323 | |
a6ed719b |
324 | { |
325 | # sub-class test |
326 | |
327 | package Another ; |
328 | |
329 | use strict ; |
330 | |
331 | open(FILE, ">SubDB.pm") or die "Cannot open SubDB.pm: $!\n" ; |
332 | print FILE <<'EOM' ; |
333 | |
334 | package SubDB ; |
335 | |
336 | use strict ; |
337 | use vars qw( @ISA @EXPORT) ; |
338 | |
339 | require Exporter ; |
340 | use DB_File; |
341 | @ISA=qw(DB_File); |
342 | @EXPORT = @DB_File::EXPORT ; |
343 | |
344 | sub STORE { |
345 | my $self = shift ; |
346 | my $key = shift ; |
347 | my $value = shift ; |
348 | $self->SUPER::STORE($key, $value * 2) ; |
349 | } |
350 | |
351 | sub FETCH { |
352 | my $self = shift ; |
353 | my $key = shift ; |
354 | $self->SUPER::FETCH($key) - 1 ; |
355 | } |
356 | |
357 | sub put { |
358 | my $self = shift ; |
359 | my $key = shift ; |
360 | my $value = shift ; |
361 | $self->SUPER::put($key, $value * 3) ; |
362 | } |
363 | |
364 | sub get { |
365 | my $self = shift ; |
366 | $self->SUPER::get($_[0], $_[1]) ; |
367 | $_[1] -= 2 ; |
368 | } |
369 | |
370 | sub A_new_method |
371 | { |
372 | my $self = shift ; |
373 | my $key = shift ; |
374 | my $value = $self->FETCH($key) ; |
375 | return "[[$value]]" ; |
376 | } |
377 | |
378 | 1 ; |
379 | EOM |
380 | |
381 | close FILE ; |
382 | |
a9fd575d |
383 | BEGIN { push @INC, '.'; } |
a6ed719b |
384 | eval 'use SubDB ; '; |
385 | main::ok(53, $@ eq "") ; |
386 | my %h ; |
387 | my $X ; |
388 | eval ' |
389 | $X = tie(%h, "SubDB","dbhash.tmp", O_RDWR|O_CREAT, 0640, $DB_HASH ); |
390 | ' ; |
391 | |
392 | main::ok(54, $@ eq "") ; |
393 | |
394 | my $ret = eval '$h{"fred"} = 3 ; return $h{"fred"} ' ; |
395 | main::ok(55, $@ eq "") ; |
396 | main::ok(56, $ret == 5) ; |
397 | |
398 | my $value = 0; |
399 | $ret = eval '$X->put("joe", 4) ; $X->get("joe", $value) ; return $value' ; |
400 | main::ok(57, $@ eq "") ; |
401 | main::ok(58, $ret == 10) ; |
402 | |
403 | $ret = eval ' R_NEXT eq main::R_NEXT ' ; |
404 | main::ok(59, $@ eq "" ) ; |
405 | main::ok(60, $ret == 1) ; |
406 | |
407 | $ret = eval '$X->A_new_method("joe") ' ; |
408 | main::ok(61, $@ eq "") ; |
409 | main::ok(62, $ret eq "[[11]]") ; |
410 | |
fac76ed7 |
411 | undef $X; |
412 | untie(%h); |
a6ed719b |
413 | unlink "SubDB.pm", "dbhash.tmp" ; |
414 | |
415 | } |
a0d0e21e |
416 | exit ; |