Commit | Line | Data |
a20d9a3f |
1 | package DBM::Deep::Engine; |
2 | |
3 | use strict; |
4 | |
5 | use Fcntl qw( :DEFAULT :flock :seek ); |
6 | |
8db25060 |
7 | ## |
8 | # Setup file and tag signatures. These should never change. |
9 | ## |
10 | sub SIG_FILE () { 'DPDB' } |
11 | sub SIG_INTERNAL () { 'i' } |
12 | sub SIG_HASH () { 'H' } |
13 | sub SIG_ARRAY () { 'A' } |
8db25060 |
14 | sub SIG_NULL () { 'N' } |
15 | sub SIG_DATA () { 'D' } |
16 | sub SIG_INDEX () { 'I' } |
17 | sub SIG_BLIST () { 'B' } |
7b1e1aa1 |
18 | sub SIG_FREE () { 'F' } |
8db25060 |
19 | sub SIG_SIZE () { 1 } |
20 | |
612969fb |
21 | sub precalc_sizes { |
beac1dff |
22 | ## |
23 | # Precalculate index, bucket and bucket list sizes |
24 | ## |
251dfd0e |
25 | my $self = shift; |
1bf65be7 |
26 | |
251dfd0e |
27 | $self->{index_size} = (2**8) * $self->{long_size}; |
6ed2f3df |
28 | $self->{bucket_size} = $self->{hash_size} + $self->{long_size} * 2; |
251dfd0e |
29 | $self->{bucket_list_size} = $self->{max_buckets} * $self->{bucket_size}; |
1bf65be7 |
30 | |
251dfd0e |
31 | return 1; |
1bf65be7 |
32 | } |
33 | |
34 | sub set_pack { |
beac1dff |
35 | ## |
36 | # Set pack/unpack modes (see file header for more) |
37 | ## |
251dfd0e |
38 | my $self = shift; |
1bf65be7 |
39 | my ($long_s, $long_p, $data_s, $data_p) = @_; |
40 | |
81d16922 |
41 | ## |
75be6413 |
42 | # Set to 4 and 'N' for 32-bit offset tags (default). Theoretical limit of 4 |
43 | # GB per file. |
beac1dff |
44 | # (Perl must be compiled with largefile support for files > 2 GB) |
81d16922 |
45 | # |
46 | # Set to 8 and 'Q' for 64-bit offsets. Theoretical limit of 16 XB per file. |
beac1dff |
47 | # (Perl must be compiled with largefile and 64-bit long support) |
81d16922 |
48 | ## |
251dfd0e |
49 | $self->{long_size} = $long_s ? $long_s : 4; |
50 | $self->{long_pack} = $long_p ? $long_p : 'N'; |
1bf65be7 |
51 | |
81d16922 |
52 | ## |
75be6413 |
53 | # Set to 4 and 'N' for 32-bit data length prefixes. Limit of 4 GB for each |
d5d7c51d |
54 | # key/value. Upgrading this is possible (see above) but probably not |
55 | # necessary. If you need more than 4 GB for a single key or value, this |
56 | # module is really not for you :-) |
81d16922 |
57 | ## |
251dfd0e |
58 | $self->{data_size} = $data_s ? $data_s : 4; |
59 | $self->{data_pack} = $data_p ? $data_p : 'N'; |
1bf65be7 |
60 | |
beac1dff |
61 | return $self->precalc_sizes(); |
1bf65be7 |
62 | } |
63 | |
64 | sub set_digest { |
beac1dff |
65 | ## |
66 | # Set key digest function (default is MD5) |
67 | ## |
251dfd0e |
68 | my $self = shift; |
1bf65be7 |
69 | my ($digest_func, $hash_size) = @_; |
70 | |
d0b74c17 |
71 | $self->{digest} = $digest_func ? $digest_func : \&Digest::MD5::md5; |
251dfd0e |
72 | $self->{hash_size} = $hash_size ? $hash_size : 16; |
612969fb |
73 | |
beac1dff |
74 | return $self->precalc_sizes(); |
612969fb |
75 | } |
76 | |
77 | sub new { |
78 | my $class = shift; |
79 | my ($args) = @_; |
80 | |
81 | my $self = bless { |
82 | long_size => 4, |
83 | long_pack => 'N', |
84 | data_size => 4, |
85 | data_pack => 'N', |
251dfd0e |
86 | |
612969fb |
87 | digest => \&Digest::MD5::md5, |
88 | hash_size => 16, |
251dfd0e |
89 | |
81d16922 |
90 | ## |
d5d7c51d |
91 | # Maximum number of buckets per list before another level of indexing is |
92 | # done. |
93 | # Increase this value for slightly greater speed, but larger database |
94 | # files. DO NOT decrease this value below 16, due to risk of recursive |
95 | # reindex overrun. |
81d16922 |
96 | ## |
612969fb |
97 | max_buckets => 16, |
98 | }, $class; |
99 | |
251dfd0e |
100 | $self->precalc_sizes; |
612969fb |
101 | |
102 | return $self; |
1bf65be7 |
103 | } |
104 | |
70b55428 |
105 | sub setup_fh { |
106 | my $self = shift; |
107 | my ($obj) = @_; |
108 | |
109 | $self->open( $obj ) if !defined $obj->_fh; |
110 | |
6fde4ed2 |
111 | my $fh = $obj->_fh; |
112 | flock $fh, LOCK_EX; |
118ba343 |
113 | |
6fde4ed2 |
114 | unless ( $obj->{base_offset} ) { |
118ba343 |
115 | seek($fh, 0 + $obj->_root->{file_offset}, SEEK_SET); |
116 | my $signature; |
117 | my $bytes_read = read( $fh, $signature, length(SIG_FILE)); |
118 | |
119 | ## |
120 | # File is empty -- write signature and master index |
121 | ## |
122 | if (!$bytes_read) { |
c9ec091a |
123 | my $loc = $self->_request_space( $obj, length( SIG_FILE ) ); |
124 | seek($fh, $loc + $obj->_root->{file_offset}, SEEK_SET); |
118ba343 |
125 | print( $fh SIG_FILE); |
126 | |
c9ec091a |
127 | $obj->{base_offset} = $self->_request_space( |
16d1ad9b |
128 | $obj, $self->tag_size( $self->{index_size} ), |
c9ec091a |
129 | ); |
118ba343 |
130 | |
9e4f83a0 |
131 | $self->write_tag( |
c9ec091a |
132 | $obj, $obj->_base_offset, $obj->_type, |
f37c15ab |
133 | chr(0)x$self->{index_size}, |
118ba343 |
134 | ); |
135 | |
136 | # Flush the filehandle |
137 | my $old_fh = select $fh; |
138 | my $old_af = $|; $| = 1; $| = $old_af; |
139 | select $old_fh; |
140 | } |
141 | else { |
142 | $obj->{base_offset} = $bytes_read; |
143 | |
144 | ## |
145 | # Check signature was valid |
146 | ## |
147 | unless ($signature eq SIG_FILE) { |
148 | $self->close_fh( $obj ); |
149 | $obj->_throw_error("Signature not found -- file is not a Deep DB"); |
150 | } |
151 | |
152 | ## |
153 | # Get our type from master index signature |
154 | ## |
155 | my $tag = $self->load_tag($obj, $obj->_base_offset) |
156 | or $obj->_throw_error("Corrupted file, no master index record"); |
157 | |
158 | unless ($obj->{type} eq $tag->{signature}) { |
159 | $obj->_throw_error("File type mismatch"); |
160 | } |
161 | } |
118ba343 |
162 | } |
e06824f8 |
163 | |
673464d9 |
164 | #XXX We have to make sure we don't mess up when autoflush isn't turned on |
70b55428 |
165 | unless ( $obj->_root->{inode} ) { |
166 | my @stats = stat($obj->_fh); |
167 | $obj->_root->{inode} = $stats[1]; |
168 | $obj->_root->{end} = $stats[7]; |
169 | } |
170 | |
6fde4ed2 |
171 | flock $fh, LOCK_UN; |
172 | |
70b55428 |
173 | return 1; |
174 | } |
175 | |
a20d9a3f |
176 | sub open { |
20f7b20c |
177 | ## |
178 | # Open a fh to the database, create if nonexistent. |
179 | # Make sure file signature matches DBM::Deep spec. |
180 | ## |
a20d9a3f |
181 | my $self = shift; |
70b55428 |
182 | my ($obj) = @_; |
a20d9a3f |
183 | |
673464d9 |
184 | # Theoretically, adding O_BINARY should remove the need for the binmode |
185 | # Of course, testing it is going to be ... interesting. |
186 | my $flags = O_RDWR | O_CREAT | O_BINARY; |
a20d9a3f |
187 | |
673464d9 |
188 | my $fh; |
d5d7c51d |
189 | my $filename = $obj->_root->{file}; |
190 | sysopen( $fh, $filename, $flags ) |
191 | or $obj->_throw_error("Cannot sysopen file '$filename': $!"); |
673464d9 |
192 | $obj->_root->{fh} = $fh; |
a20d9a3f |
193 | |
194 | #XXX Can we remove this by using the right sysopen() flags? |
195 | # Maybe ... q.v. above |
196 | binmode $fh; # for win32 |
197 | |
cd59cad8 |
198 | if ($obj->_root->{autoflush}) { |
a20d9a3f |
199 | my $old = select $fh; |
200 | $|=1; |
201 | select $old; |
202 | } |
20f7b20c |
203 | |
a20d9a3f |
204 | return 1; |
205 | } |
206 | |
3d1b8be9 |
207 | sub close_fh { |
cd59cad8 |
208 | my $self = shift; |
a21f2d90 |
209 | my ($obj) = @_; |
cd59cad8 |
210 | |
211 | if ( my $fh = $obj->_root->{fh} ) { |
212 | close $fh; |
213 | } |
214 | $obj->_root->{fh} = undef; |
215 | |
216 | return 1; |
217 | } |
218 | |
16d1ad9b |
219 | sub tag_size { |
220 | my $self = shift; |
221 | my ($size) = @_; |
222 | return SIG_SIZE + $self->{data_size} + $size; |
223 | } |
224 | |
9e4f83a0 |
225 | sub write_tag { |
20f7b20c |
226 | ## |
227 | # Given offset, signature and content, create tag and write to disk |
228 | ## |
d4b1166e |
229 | my $self = shift; |
20f7b20c |
230 | my ($obj, $offset, $sig, $content) = @_; |
f37c15ab |
231 | my $size = length( $content ); |
20f7b20c |
232 | |
d4b1166e |
233 | my $fh = $obj->_fh; |
234 | |
f37c15ab |
235 | if ( defined $offset ) { |
236 | seek($fh, $offset + $obj->_root->{file_offset}, SEEK_SET); |
237 | } |
238 | |
251dfd0e |
239 | print( $fh $sig . pack($self->{data_pack}, $size) . $content ); |
20f7b20c |
240 | |
f37c15ab |
241 | return unless defined $offset; |
242 | |
20f7b20c |
243 | return { |
244 | signature => $sig, |
245 | size => $size, |
8db25060 |
246 | offset => $offset + SIG_SIZE + $self->{data_size}, |
20f7b20c |
247 | content => $content |
248 | }; |
d4b1166e |
249 | } |
250 | |
251 | sub load_tag { |
20f7b20c |
252 | ## |
253 | # Given offset, load single tag and return signature, size and data |
254 | ## |
d4b1166e |
255 | my $self = shift; |
20f7b20c |
256 | my ($obj, $offset) = @_; |
257 | |
e06824f8 |
258 | # print join(':',map{$_||''}caller(1)), $/; |
259 | |
d4b1166e |
260 | my $fh = $obj->_fh; |
261 | |
20f7b20c |
262 | seek($fh, $offset + $obj->_root->{file_offset}, SEEK_SET); |
e5fc7e69 |
263 | |
75be6413 |
264 | #XXX I'm not sure this check will work if autoflush isn't enabled ... |
e5fc7e69 |
265 | return if eof $fh; |
20f7b20c |
266 | |
d4b1166e |
267 | my $b; |
8db25060 |
268 | read( $fh, $b, SIG_SIZE + $self->{data_size} ); |
251dfd0e |
269 | my ($sig, $size) = unpack( "A $self->{data_pack}", $b ); |
20f7b20c |
270 | |
271 | my $buffer; |
272 | read( $fh, $buffer, $size); |
273 | |
274 | return { |
275 | signature => $sig, |
276 | size => $size, |
8db25060 |
277 | offset => $offset + SIG_SIZE + $self->{data_size}, |
20f7b20c |
278 | content => $buffer |
279 | }; |
d4b1166e |
280 | } |
281 | |
29b01632 |
282 | sub _length_needed { |
283 | my $self = shift; |
f37c15ab |
284 | my ($obj, $value, $key) = @_; |
29b01632 |
285 | |
286 | my $is_dbm_deep = eval { |
287 | local $SIG{'__DIE__'}; |
288 | $value->isa( 'DBM::Deep' ); |
289 | }; |
290 | |
f37c15ab |
291 | my $len = SIG_SIZE + $self->{data_size} |
292 | + $self->{data_size} + length( $key ); |
29b01632 |
293 | |
f37c15ab |
294 | if ( $is_dbm_deep && $value->_root eq $obj->_root ) { |
295 | return $len + $self->{long_size}; |
29b01632 |
296 | } |
297 | |
298 | my $r = Scalar::Util::reftype( $value ) || ''; |
9a187d8c |
299 | if ( $obj->_root->{autobless} ) { |
300 | # This is for the bit saying whether or not this thing is blessed. |
301 | $len += 1; |
302 | } |
303 | |
29b01632 |
304 | unless ( $r eq 'HASH' || $r eq 'ARRAY' ) { |
f37c15ab |
305 | if ( defined $value ) { |
306 | $len += length( $value ); |
307 | } |
308 | return $len; |
29b01632 |
309 | } |
310 | |
f37c15ab |
311 | $len += $self->{index_size}; |
29b01632 |
312 | |
313 | # if autobless is enabled, must also take into consideration |
f37c15ab |
314 | # the class name as it is stored after the key. |
29b01632 |
315 | if ( $obj->_root->{autobless} ) { |
316 | my $value_class = Scalar::Util::blessed($value); |
f37c15ab |
317 | if ( defined $value_class && !$is_dbm_deep ) { |
318 | $len += $self->{data_size} + length($value_class); |
29b01632 |
319 | } |
320 | } |
321 | |
f37c15ab |
322 | return $len; |
29b01632 |
323 | } |
324 | |
20f7b20c |
325 | sub add_bucket { |
326 | ## |
327 | # Adds one key/value pair to bucket list, given offset, MD5 digest of key, |
328 | # plain (undigested) key and value. |
329 | ## |
d4b1166e |
330 | my $self = shift; |
20f7b20c |
331 | my ($obj, $tag, $md5, $plain_key, $value) = @_; |
75be6413 |
332 | |
eea0d863 |
333 | # This verifies that only supported values will be stored. |
334 | { |
335 | my $r = Scalar::Util::reftype( $value ); |
336 | last if !defined $r; |
337 | |
338 | last if $r eq 'HASH'; |
339 | last if $r eq 'ARRAY'; |
340 | |
341 | $obj->_throw_error( |
342 | "Storage of variables of type '$r' is not supported." |
343 | ); |
344 | } |
345 | |
20f7b20c |
346 | my $location = 0; |
347 | my $result = 2; |
348 | |
349 | my $root = $obj->_root; |
f37c15ab |
350 | my $fh = $obj->_fh; |
20f7b20c |
351 | |
f37c15ab |
352 | my $actual_length = $self->_length_needed( $obj, $value, $plain_key ); |
20f7b20c |
353 | |
9a187d8c |
354 | my ($subloc, $offset, $size) = $self->_find_in_buckets( $tag, $md5 ); |
75be6413 |
355 | |
f9c33187 |
356 | # $self->_release_space( $obj, $size, $subloc ); |
386bab6c |
357 | # Updating a known md5 |
f9c33187 |
358 | #XXX This needs updating to use _release_space |
386bab6c |
359 | if ( $subloc ) { |
360 | $result = 1; |
20f7b20c |
361 | |
386bab6c |
362 | if ($actual_length <= $size) { |
363 | $location = $subloc; |
20f7b20c |
364 | } |
75be6413 |
365 | else { |
f37c15ab |
366 | $location = $self->_request_space( $obj, $actual_length ); |
386bab6c |
367 | seek( |
368 | $fh, |
9a187d8c |
369 | $tag->{offset} + $offset |
370 | + $self->{hash_size} + $root->{file_offset}, |
386bab6c |
371 | SEEK_SET, |
372 | ); |
9a187d8c |
373 | print( $fh pack($self->{long_pack}, $location ) ); |
374 | print( $fh pack($self->{long_pack}, $actual_length ) ); |
75be6413 |
375 | } |
75be6413 |
376 | } |
386bab6c |
377 | # Adding a new md5 |
378 | elsif ( defined $offset ) { |
f37c15ab |
379 | $location = $self->_request_space( $obj, $actual_length ); |
386bab6c |
380 | |
381 | seek( $fh, $tag->{offset} + $offset + $root->{file_offset}, SEEK_SET ); |
9a187d8c |
382 | print( $fh $md5 . pack($self->{long_pack}, $location ) ); |
383 | print( $fh pack($self->{long_pack}, $actual_length ) ); |
386bab6c |
384 | } |
385 | # If bucket didn't fit into list, split into a new index level |
f9c33187 |
386 | # split_index() will do the _request_space() call |
386bab6c |
387 | else { |
f9c33187 |
388 | $location = $self->split_index( $obj, $md5, $tag ); |
386bab6c |
389 | } |
20f7b20c |
390 | |
d5d7c51d |
391 | $self->write_value( $obj, $location, $plain_key, $value ); |
392 | |
393 | return $result; |
394 | } |
395 | |
396 | sub write_value { |
397 | my $self = shift; |
398 | my ($obj, $location, $key, $value) = @_; |
399 | |
400 | my $fh = $obj->_fh; |
401 | my $root = $obj->_root; |
402 | |
403 | my $is_dbm_deep = eval { |
404 | local $SIG{'__DIE__'}; |
405 | $value->isa( 'DBM::Deep' ); |
406 | }; |
407 | |
f9c33187 |
408 | my $is_internal_ref = $is_dbm_deep && ($value->_root eq $root); |
d5d7c51d |
409 | |
410 | seek($fh, $location + $root->{file_offset}, SEEK_SET); |
411 | |
20f7b20c |
412 | ## |
d5d7c51d |
413 | # Write signature based on content type, set content length and write |
414 | # actual value. |
20f7b20c |
415 | ## |
d5d7c51d |
416 | my $r = Scalar::Util::reftype($value) || ''; |
f9c33187 |
417 | if ( $is_internal_ref ) { |
9e4f83a0 |
418 | $self->write_tag( $obj, undef, SIG_INTERNAL,pack($self->{long_pack}, $value->_base_offset) ); |
f37c15ab |
419 | } |
420 | elsif ($r eq 'HASH') { |
019ab3a1 |
421 | if ( tied( %{$value} ) ) { |
422 | $obj->_throw_error( "Cannot store something that is tied" ); |
423 | } |
9e4f83a0 |
424 | $self->write_tag( $obj, undef, SIG_HASH, chr(0)x$self->{index_size} ); |
f37c15ab |
425 | } |
426 | elsif ($r eq 'ARRAY') { |
019ab3a1 |
427 | if ( tied( @{$value} ) ) { |
428 | $obj->_throw_error( "Cannot store something that is tied" ); |
429 | } |
9e4f83a0 |
430 | $self->write_tag( $obj, undef, SIG_ARRAY, chr(0)x$self->{index_size} ); |
f37c15ab |
431 | } |
432 | elsif (!defined($value)) { |
9e4f83a0 |
433 | $self->write_tag( $obj, undef, SIG_NULL, '' ); |
d5d7c51d |
434 | } |
435 | else { |
9e4f83a0 |
436 | $self->write_tag( $obj, undef, SIG_DATA, $value ); |
d5d7c51d |
437 | } |
20f7b20c |
438 | |
d5d7c51d |
439 | ## |
440 | # Plain key is stored AFTER value, as keys are typically fetched less often. |
441 | ## |
442 | print( $fh pack($self->{data_pack}, length($key)) . $key ); |
20f7b20c |
443 | |
9a187d8c |
444 | # Internal references don't care about autobless |
f9c33187 |
445 | return 1 if $is_internal_ref; |
9a187d8c |
446 | |
d5d7c51d |
447 | ## |
448 | # If value is blessed, preserve class name |
449 | ## |
450 | if ( $root->{autobless} ) { |
451 | my $value_class = Scalar::Util::blessed($value); |
f37c15ab |
452 | if ( defined $value_class && !$is_dbm_deep ) { |
d5d7c51d |
453 | print( $fh chr(1) ); |
454 | print( $fh pack($self->{data_pack}, length($value_class)) . $value_class ); |
20f7b20c |
455 | } |
d5d7c51d |
456 | else { |
457 | print( $fh chr(0) ); |
20f7b20c |
458 | } |
d5d7c51d |
459 | } |
20f7b20c |
460 | |
d5d7c51d |
461 | ## |
d5d7c51d |
462 | # If content is a hash or array, create new child DBM::Deep object and |
463 | # pass each key or element to it. |
464 | ## |
f9c33187 |
465 | if ( !$is_internal_ref ) { |
d5d7c51d |
466 | if ($r eq 'HASH') { |
467 | my $branch = DBM::Deep->new( |
468 | type => DBM::Deep->TYPE_HASH, |
469 | base_offset => $location, |
470 | root => $root, |
471 | ); |
472 | foreach my $key (keys %{$value}) { |
473 | $branch->STORE( $key, $value->{$key} ); |
20f7b20c |
474 | } |
d5d7c51d |
475 | } |
476 | elsif ($r eq 'ARRAY') { |
477 | my $branch = DBM::Deep->new( |
478 | type => DBM::Deep->TYPE_ARRAY, |
479 | base_offset => $location, |
480 | root => $root, |
481 | ); |
482 | my $index = 0; |
483 | foreach my $element (@{$value}) { |
484 | $branch->STORE( $index, $element ); |
485 | $index++; |
20f7b20c |
486 | } |
487 | } |
20f7b20c |
488 | } |
d4b1166e |
489 | |
d5d7c51d |
490 | return 1; |
d4b1166e |
491 | } |
492 | |
75be6413 |
493 | sub split_index { |
494 | my $self = shift; |
495 | my ($obj, $md5, $tag) = @_; |
496 | |
497 | my $fh = $obj->_fh; |
498 | my $root = $obj->_root; |
16d1ad9b |
499 | |
500 | my $loc = $self->_request_space( |
501 | $obj, $self->tag_size( $self->{index_size} ), |
502 | ); |
503 | |
7b1e1aa1 |
504 | seek($fh, $tag->{ref_loc} + $root->{file_offset}, SEEK_SET); |
16d1ad9b |
505 | print( $fh pack($self->{long_pack}, $loc) ); |
75be6413 |
506 | |
9e4f83a0 |
507 | my $index_tag = $self->write_tag( |
16d1ad9b |
508 | $obj, $loc, SIG_INDEX, |
f37c15ab |
509 | chr(0)x$self->{index_size}, |
75be6413 |
510 | ); |
511 | |
f9c33187 |
512 | my $newtag_loc = $self->_request_space( |
513 | $obj, $self->tag_size( $self->{bucket_list_size} ), |
514 | ); |
75be6413 |
515 | |
7b1e1aa1 |
516 | my $keys = $tag->{content} |
f9c33187 |
517 | . $md5 . pack($self->{long_pack}, $newtag_loc) |
518 | . pack($self->{long_pack}, 0); |
75be6413 |
519 | |
f9c33187 |
520 | my @newloc = (); |
75be6413 |
521 | BUCKET: |
522 | for (my $i = 0; $i <= $self->{max_buckets}; $i++) { |
9a187d8c |
523 | my ($key, $old_subloc, $size) = $self->_get_key_subloc( $keys, $i ); |
75be6413 |
524 | |
f9c33187 |
525 | die "[INTERNAL ERROR]: No key in split_index()\n" unless $key; |
526 | die "[INTERNAL ERROR]: No subloc in split_index()\n" unless $old_subloc; |
75be6413 |
527 | |
75be6413 |
528 | my $num = ord(substr($key, $tag->{ch} + 1, 1)); |
529 | |
f9c33187 |
530 | if ($newloc[$num]) { |
531 | seek($fh, $newloc[$num] + $root->{file_offset}, SEEK_SET); |
75be6413 |
532 | my $subkeys; |
533 | read( $fh, $subkeys, $self->{bucket_list_size}); |
534 | |
f9c33187 |
535 | # This is looking for the first empty spot |
7b1e1aa1 |
536 | my ($subloc, $offset, $size) = $self->_find_in_buckets( |
f9c33187 |
537 | { content => $subkeys }, '', |
7b1e1aa1 |
538 | ); |
75be6413 |
539 | |
f9c33187 |
540 | seek($fh, $newloc[$num] + $offset + $root->{file_offset}, SEEK_SET); |
541 | print( $fh $key . pack($self->{long_pack}, $old_subloc) ); |
7b1e1aa1 |
542 | |
543 | next; |
75be6413 |
544 | } |
75be6413 |
545 | |
7b1e1aa1 |
546 | seek($fh, $index_tag->{offset} + ($num * $self->{long_size}) + $root->{file_offset}, SEEK_SET); |
2603d86e |
547 | |
7b1e1aa1 |
548 | my $loc = $self->_request_space( |
549 | $obj, $self->tag_size( $self->{bucket_list_size} ), |
550 | ); |
2603d86e |
551 | |
7b1e1aa1 |
552 | print( $fh pack($self->{long_pack}, $loc) ); |
75be6413 |
553 | |
7b1e1aa1 |
554 | my $blist_tag = $self->write_tag( |
555 | $obj, $loc, SIG_BLIST, |
556 | chr(0)x$self->{bucket_list_size}, |
557 | ); |
558 | |
559 | seek($fh, $blist_tag->{offset} + $root->{file_offset}, SEEK_SET); |
f9c33187 |
560 | print( $fh $key . pack($self->{long_pack}, $old_subloc) ); |
7b1e1aa1 |
561 | |
f9c33187 |
562 | $newloc[$num] = $blist_tag->{offset}; |
7b1e1aa1 |
563 | } |
564 | |
565 | $self->_release_space( |
f9c33187 |
566 | $obj, $self->tag_size( $self->{bucket_list_size} ), |
7b1e1aa1 |
567 | $tag->{offset} - SIG_SIZE - $self->{data_size}, |
568 | ); |
75be6413 |
569 | |
f9c33187 |
570 | return $newtag_loc; |
75be6413 |
571 | } |
572 | |
8db25060 |
573 | sub read_from_loc { |
574 | my $self = shift; |
575 | my ($obj, $subloc) = @_; |
576 | |
577 | my $fh = $obj->_fh; |
578 | |
579 | ## |
580 | # Found match -- seek to offset and read signature |
581 | ## |
582 | my $signature; |
583 | seek($fh, $subloc + $obj->_root->{file_offset}, SEEK_SET); |
584 | read( $fh, $signature, SIG_SIZE); |
585 | |
586 | ## |
587 | # If value is a hash or array, return new DBM::Deep object with correct offset |
588 | ## |
589 | if (($signature eq SIG_HASH) || ($signature eq SIG_ARRAY)) { |
590 | my $obj = DBM::Deep->new( |
591 | type => $signature, |
592 | base_offset => $subloc, |
593 | root => $obj->_root, |
594 | ); |
595 | |
596 | if ($obj->_root->{autobless}) { |
597 | ## |
598 | # Skip over value and plain key to see if object needs |
599 | # to be re-blessed |
600 | ## |
601 | seek($fh, $self->{data_size} + $self->{index_size}, SEEK_CUR); |
602 | |
603 | my $size; |
604 | read( $fh, $size, $self->{data_size}); $size = unpack($self->{data_pack}, $size); |
605 | if ($size) { seek($fh, $size, SEEK_CUR); } |
606 | |
607 | my $bless_bit; |
608 | read( $fh, $bless_bit, 1); |
609 | if (ord($bless_bit)) { |
610 | ## |
611 | # Yes, object needs to be re-blessed |
612 | ## |
613 | my $class_name; |
614 | read( $fh, $size, $self->{data_size}); $size = unpack($self->{data_pack}, $size); |
615 | if ($size) { read( $fh, $class_name, $size); } |
616 | if ($class_name) { $obj = bless( $obj, $class_name ); } |
617 | } |
618 | } |
619 | |
620 | return $obj; |
621 | } |
622 | elsif ( $signature eq SIG_INTERNAL ) { |
623 | my $size; |
624 | read( $fh, $size, $self->{data_size}); |
625 | $size = unpack($self->{data_pack}, $size); |
626 | |
627 | if ( $size ) { |
628 | my $new_loc; |
629 | read( $fh, $new_loc, $size ); |
630 | $new_loc = unpack( $self->{long_pack}, $new_loc ); |
631 | |
632 | return $self->read_from_loc( $obj, $new_loc ); |
633 | } |
634 | else { |
635 | return; |
636 | } |
637 | } |
638 | ## |
639 | # Otherwise return actual value |
640 | ## |
641 | elsif ($signature eq SIG_DATA) { |
642 | my $size; |
643 | read( $fh, $size, $self->{data_size}); |
644 | $size = unpack($self->{data_pack}, $size); |
645 | |
646 | my $value = ''; |
647 | if ($size) { read( $fh, $value, $size); } |
648 | return $value; |
649 | } |
650 | |
651 | ## |
652 | # Key exists, but content is null |
653 | ## |
654 | return; |
655 | } |
656 | |
9020ee8c |
657 | sub get_bucket_value { |
beac1dff |
658 | ## |
659 | # Fetch single value given tag and MD5 digested key. |
660 | ## |
661 | my $self = shift; |
662 | my ($obj, $tag, $md5) = @_; |
9020ee8c |
663 | |
9a187d8c |
664 | my ($subloc, $offset, $size) = $self->_find_in_buckets( $tag, $md5 ); |
386bab6c |
665 | if ( $subloc ) { |
8db25060 |
666 | return $self->read_from_loc( $obj, $subloc ); |
386bab6c |
667 | } |
beac1dff |
668 | return; |
9020ee8c |
669 | } |
ab0e4957 |
670 | |
671 | sub delete_bucket { |
beac1dff |
672 | ## |
673 | # Delete single key/value pair given tag and MD5 digested key. |
674 | ## |
675 | my $self = shift; |
676 | my ($obj, $tag, $md5) = @_; |
ab0e4957 |
677 | |
9a187d8c |
678 | my ($subloc, $offset, $size) = $self->_find_in_buckets( $tag, $md5 ); |
f9c33187 |
679 | #XXX This needs _release_space() |
386bab6c |
680 | if ( $subloc ) { |
681 | my $fh = $obj->_fh; |
682 | seek($fh, $tag->{offset} + $offset + $obj->_root->{file_offset}, SEEK_SET); |
683 | print( $fh substr($tag->{content}, $offset + $self->{bucket_size} ) ); |
251dfd0e |
684 | print( $fh chr(0) x $self->{bucket_size} ); |
d0b74c17 |
685 | |
ab0e4957 |
686 | return 1; |
386bab6c |
687 | } |
beac1dff |
688 | return; |
ab0e4957 |
689 | } |
690 | |
912d50b1 |
691 | sub bucket_exists { |
beac1dff |
692 | ## |
693 | # Check existence of single key given tag and MD5 digested key. |
694 | ## |
695 | my $self = shift; |
696 | my ($obj, $tag, $md5) = @_; |
912d50b1 |
697 | |
9a187d8c |
698 | my ($subloc, $offset, $size) = $self->_find_in_buckets( $tag, $md5 ); |
d5d7c51d |
699 | return $subloc && 1; |
912d50b1 |
700 | } |
701 | |
6736c116 |
702 | sub find_bucket_list { |
beac1dff |
703 | ## |
704 | # Locate offset for bucket list, given digested key |
705 | ## |
706 | my $self = shift; |
d0b74c17 |
707 | my ($obj, $md5, $args) = @_; |
708 | $args = {} unless $args; |
709 | |
beac1dff |
710 | ## |
711 | # Locate offset for bucket list using digest index system |
712 | ## |
e5fc7e69 |
713 | my $tag = $self->load_tag($obj, $obj->_base_offset) |
d5d7c51d |
714 | or $obj->_throw_error( "INTERNAL ERROR - Cannot find tag" ); |
d0b74c17 |
715 | |
e5fc7e69 |
716 | my $ch = 0; |
8db25060 |
717 | while ($tag->{signature} ne SIG_BLIST) { |
d0b74c17 |
718 | my $num = ord substr($md5, $ch, 1); |
719 | |
720 | my $ref_loc = $tag->{offset} + ($num * $self->{long_size}); |
721 | $tag = $self->index_lookup( $obj, $tag, $num ); |
722 | |
723 | if (!$tag) { |
29b01632 |
724 | return if !$args->{create}; |
d0b74c17 |
725 | |
16d1ad9b |
726 | my $loc = $self->_request_space( |
727 | $obj, $self->tag_size( $self->{bucket_list_size} ), |
728 | ); |
729 | |
7b1e1aa1 |
730 | my $fh = $obj->_fh; |
731 | seek($fh, $ref_loc + $obj->_root->{file_offset}, SEEK_SET); |
16d1ad9b |
732 | print( $fh pack($self->{long_pack}, $loc) ); |
d0b74c17 |
733 | |
9e4f83a0 |
734 | $tag = $self->write_tag( |
16d1ad9b |
735 | $obj, $loc, SIG_BLIST, |
f37c15ab |
736 | chr(0)x$self->{bucket_list_size}, |
d5d7c51d |
737 | ); |
738 | |
739 | $tag->{ref_loc} = $ref_loc; |
740 | $tag->{ch} = $ch; |
741 | |
742 | last; |
d0b74c17 |
743 | } |
744 | |
16d1ad9b |
745 | $tag->{ch} = $ch++; |
d0b74c17 |
746 | $tag->{ref_loc} = $ref_loc; |
beac1dff |
747 | } |
d0b74c17 |
748 | |
beac1dff |
749 | return $tag; |
6736c116 |
750 | } |
751 | |
d0b74c17 |
752 | sub index_lookup { |
753 | ## |
754 | # Given index tag, lookup single entry in index and return . |
755 | ## |
756 | my $self = shift; |
757 | my ($obj, $tag, $index) = @_; |
758 | |
759 | my $location = unpack( |
760 | $self->{long_pack}, |
761 | substr( |
762 | $tag->{content}, |
763 | $index * $self->{long_size}, |
764 | $self->{long_size}, |
765 | ), |
766 | ); |
767 | |
768 | if (!$location) { return; } |
769 | |
770 | return $self->load_tag( $obj, $location ); |
771 | } |
772 | |
6736c116 |
773 | sub traverse_index { |
beac1dff |
774 | ## |
775 | # Scan index and recursively step into deeper levels, looking for next key. |
776 | ## |
6736c116 |
777 | my $self = shift; |
778 | my ($obj, $offset, $ch, $force_return_next) = @_; |
d0b74c17 |
779 | |
beac1dff |
780 | my $tag = $self->load_tag($obj, $offset ); |
6736c116 |
781 | |
782 | my $fh = $obj->_fh; |
d0b74c17 |
783 | |
8db25060 |
784 | if ($tag->{signature} ne SIG_BLIST) { |
beac1dff |
785 | my $content = $tag->{content}; |
e5fc7e69 |
786 | my $start = $obj->{return_next} ? 0 : ord(substr($obj->{prev_md5}, $ch, 1)); |
d0b74c17 |
787 | |
d5d7c51d |
788 | for (my $idx = $start; $idx < (2**8); $idx++) { |
e5fc7e69 |
789 | my $subloc = unpack( |
790 | $self->{long_pack}, |
e06824f8 |
791 | substr( |
792 | $content, |
793 | $idx * $self->{long_size}, |
794 | $self->{long_size}, |
795 | ), |
e5fc7e69 |
796 | ); |
797 | |
beac1dff |
798 | if ($subloc) { |
e5fc7e69 |
799 | my $result = $self->traverse_index( |
800 | $obj, $subloc, $ch + 1, $force_return_next, |
801 | ); |
802 | |
beac1dff |
803 | if (defined($result)) { return $result; } |
804 | } |
805 | } # index loop |
d0b74c17 |
806 | |
beac1dff |
807 | $obj->{return_next} = 1; |
808 | } # tag is an index |
d0b74c17 |
809 | |
e5fc7e69 |
810 | else { |
beac1dff |
811 | my $keys = $tag->{content}; |
812 | if ($force_return_next) { $obj->{return_next} = 1; } |
d0b74c17 |
813 | |
beac1dff |
814 | ## |
815 | # Iterate through buckets, looking for a key match |
816 | ## |
8db25060 |
817 | for (my $i = 0; $i < $self->{max_buckets}; $i++) { |
9cec1360 |
818 | my ($key, $subloc) = $self->_get_key_subloc( $keys, $i ); |
d0b74c17 |
819 | |
8db25060 |
820 | # End of bucket list -- return to outer loop |
beac1dff |
821 | if (!$subloc) { |
beac1dff |
822 | $obj->{return_next} = 1; |
823 | last; |
824 | } |
8db25060 |
825 | # Located previous key -- return next one found |
beac1dff |
826 | elsif ($key eq $obj->{prev_md5}) { |
beac1dff |
827 | $obj->{return_next} = 1; |
828 | next; |
829 | } |
8db25060 |
830 | # Seek to bucket location and skip over signature |
beac1dff |
831 | elsif ($obj->{return_next}) { |
8db25060 |
832 | seek($fh, $subloc + $obj->_root->{file_offset}, SEEK_SET); |
d0b74c17 |
833 | |
beac1dff |
834 | # Skip over value to get to plain key |
8db25060 |
835 | my $sig; |
836 | read( $fh, $sig, SIG_SIZE ); |
837 | |
beac1dff |
838 | my $size; |
e5fc7e69 |
839 | read( $fh, $size, $self->{data_size}); |
840 | $size = unpack($self->{data_pack}, $size); |
beac1dff |
841 | if ($size) { seek($fh, $size, SEEK_CUR); } |
d0b74c17 |
842 | |
beac1dff |
843 | # Read in plain key and return as scalar |
beac1dff |
844 | my $plain_key; |
e5fc7e69 |
845 | read( $fh, $size, $self->{data_size}); |
846 | $size = unpack($self->{data_pack}, $size); |
beac1dff |
847 | if ($size) { read( $fh, $plain_key, $size); } |
d0b74c17 |
848 | |
beac1dff |
849 | return $plain_key; |
850 | } |
8db25060 |
851 | } |
d0b74c17 |
852 | |
beac1dff |
853 | $obj->{return_next} = 1; |
854 | } # tag is a bucket list |
d0b74c17 |
855 | |
beac1dff |
856 | return; |
6736c116 |
857 | } |
858 | |
859 | sub get_next_key { |
beac1dff |
860 | ## |
861 | # Locate next key, given digested previous one |
862 | ## |
6736c116 |
863 | my $self = shift; |
864 | my ($obj) = @_; |
d0b74c17 |
865 | |
beac1dff |
866 | $obj->{prev_md5} = $_[1] ? $_[1] : undef; |
867 | $obj->{return_next} = 0; |
d0b74c17 |
868 | |
beac1dff |
869 | ## |
870 | # If the previous key was not specifed, start at the top and |
871 | # return the first one found. |
872 | ## |
873 | if (!$obj->{prev_md5}) { |
874 | $obj->{prev_md5} = chr(0) x $self->{hash_size}; |
875 | $obj->{return_next} = 1; |
876 | } |
d0b74c17 |
877 | |
beac1dff |
878 | return $self->traverse_index( $obj, $obj->_base_offset, 0 ); |
6736c116 |
879 | } |
880 | |
75be6413 |
881 | # Utilities |
882 | |
9cec1360 |
883 | sub _get_key_subloc { |
75be6413 |
884 | my $self = shift; |
885 | my ($keys, $idx) = @_; |
886 | |
6ed2f3df |
887 | my ($key, $subloc, $size) = unpack( |
888 | "a$self->{hash_size} $self->{long_pack} $self->{long_pack}", |
75be6413 |
889 | substr( |
890 | $keys, |
9cec1360 |
891 | ($idx * $self->{bucket_size}), |
892 | $self->{bucket_size}, |
75be6413 |
893 | ), |
894 | ); |
895 | |
6ed2f3df |
896 | return ($key, $subloc, $size); |
75be6413 |
897 | } |
898 | |
d608b06e |
899 | sub _find_in_buckets { |
900 | my $self = shift; |
901 | my ($tag, $md5) = @_; |
902 | |
903 | BUCKET: |
904 | for ( my $i = 0; $i < $self->{max_buckets}; $i++ ) { |
9a187d8c |
905 | my ($key, $subloc, $size) = $self->_get_key_subloc( |
906 | $tag->{content}, $i, |
907 | ); |
d608b06e |
908 | |
9a187d8c |
909 | return ($subloc, $i * $self->{bucket_size}, $size) unless $subloc; |
d608b06e |
910 | |
911 | next BUCKET if $key ne $md5; |
912 | |
9a187d8c |
913 | return ($subloc, $i * $self->{bucket_size}, $size); |
d608b06e |
914 | } |
915 | |
916 | return; |
917 | } |
918 | |
7b1e1aa1 |
919 | #sub _print_at { |
920 | # my $self = shift; |
921 | # my ($obj, $spot, $data) = @_; |
922 | # |
923 | # my $fh = $obj->_fh; |
924 | # seek( $fh, $spot, SEEK_SET ); |
925 | # print( $fh $data ); |
926 | # |
927 | # return; |
928 | #} |
929 | |
994ccd8e |
930 | sub _request_space { |
931 | my $self = shift; |
932 | my ($obj, $size) = @_; |
933 | |
934 | my $loc = $obj->_root->{end}; |
c9ec091a |
935 | $obj->_root->{end} += $size; |
994ccd8e |
936 | |
937 | return $loc; |
938 | } |
939 | |
940 | sub _release_space { |
941 | my $self = shift; |
942 | my ($obj, $size, $loc) = @_; |
943 | |
7b1e1aa1 |
944 | my $next_loc = 0; |
945 | |
946 | my $fh = $obj->_fh; |
947 | seek( $fh, $loc + $obj->_root->{file_offset}, SEEK_SET ); |
948 | print( $fh SIG_FREE |
949 | . pack($self->{long_pack}, $size ) |
950 | . pack($self->{long_pack}, $next_loc ) |
951 | ); |
952 | |
994ccd8e |
953 | return; |
954 | } |
955 | |
a20d9a3f |
956 | 1; |
957 | __END__ |
d5d7c51d |
958 | |
959 | # This will be added in later, after more refactoring is done. This is an early |
960 | # attempt at refactoring on the physical level instead of the virtual level. |
961 | sub _read_at { |
962 | my $self = shift; |
963 | my ($obj, $spot, $amount, $unpack) = @_; |
964 | |
965 | my $fh = $obj->_fh; |
966 | seek( $fh, $spot + $obj->_root->{file_offset}, SEEK_SET ); |
967 | |
968 | my $buffer; |
969 | my $bytes_read = read( $fh, $buffer, $amount ); |
970 | |
971 | if ( $unpack ) { |
972 | $buffer = unpack( $unpack, $buffer ); |
973 | } |
974 | |
975 | if ( wantarray ) { |
976 | return ($buffer, $bytes_read); |
977 | } |
978 | else { |
979 | return $buffer; |
980 | } |
981 | } |