1 package DBM::Deep::Engine;
5 use Fcntl qw( :DEFAULT :flock :seek );
8 # Setup file and tag signatures. These should never change.
10 sub SIG_FILE () { 'DPDB' }
11 sub SIG_INTERNAL () { 'i' }
12 sub SIG_HASH () { 'H' }
13 sub SIG_ARRAY () { 'A' }
14 sub SIG_NULL () { 'N' }
15 sub SIG_DATA () { 'D' }
16 sub SIG_INDEX () { 'I' }
17 sub SIG_BLIST () { 'B' }
22 # Precalculate index, bucket and bucket list sizes
26 $self->{index_size} = (2**8) * $self->{long_size};
27 $self->{bucket_size} = $self->{hash_size} + $self->{long_size};
28 $self->{bucket_list_size} = $self->{max_buckets} * $self->{bucket_size};
35 # Set pack/unpack modes (see file header for more)
38 my ($long_s, $long_p, $data_s, $data_p) = @_;
41 # Set to 4 and 'N' for 32-bit offset tags (default). Theoretical limit of 4
43 # (Perl must be compiled with largefile support for files > 2 GB)
45 # Set to 8 and 'Q' for 64-bit offsets. Theoretical limit of 16 XB per file.
46 # (Perl must be compiled with largefile and 64-bit long support)
48 $self->{long_size} = $long_s ? $long_s : 4;
49 $self->{long_pack} = $long_p ? $long_p : 'N';
52 # Set to 4 and 'N' for 32-bit data length prefixes. Limit of 4 GB for each
53 # key/value. Upgrading this is possible (see above) but probably not
54 # necessary. If you need more than 4 GB for a single key or value, this
55 # module is really not for you :-)
57 $self->{data_size} = $data_s ? $data_s : 4;
58 $self->{data_pack} = $data_p ? $data_p : 'N';
60 return $self->precalc_sizes();
65 # Set key digest function (default is MD5)
68 my ($digest_func, $hash_size) = @_;
70 $self->{digest} = $digest_func ? $digest_func : \&Digest::MD5::md5;
71 $self->{hash_size} = $hash_size ? $hash_size : 16;
73 return $self->precalc_sizes();
86 digest => \&Digest::MD5::md5,
90 # Maximum number of buckets per list before another level of indexing is
92 # Increase this value for slightly greater speed, but larger database
93 # files. DO NOT decrease this value below 16, due to risk of recursive
108 $self->open( $obj ) if !defined $obj->_fh;
113 unless ( $obj->{base_offset} ) {
114 seek($fh, 0 + $obj->_root->{file_offset}, SEEK_SET);
116 my $bytes_read = read( $fh, $signature, length(SIG_FILE));
119 # File is empty -- write signature and master index
122 my $loc = $self->_request_space( $obj, length( SIG_FILE ) );
123 seek($fh, $loc + $obj->_root->{file_offset}, SEEK_SET);
124 print( $fh SIG_FILE);
126 $obj->{base_offset} = $self->_request_space(
127 $obj, $self->tag_size( $self->{index_size} ),
131 $obj, $obj->_base_offset, $obj->_type,
132 chr(0) x $self->{index_size},
135 # Flush the filehandle
136 my $old_fh = select $fh;
137 my $old_af = $|; $| = 1; $| = $old_af;
141 $obj->{base_offset} = $bytes_read;
144 # Check signature was valid
146 unless ($signature eq SIG_FILE) {
147 $self->close_fh( $obj );
148 $obj->_throw_error("Signature not found -- file is not a Deep DB");
152 # Get our type from master index signature
154 my $tag = $self->load_tag($obj, $obj->_base_offset)
155 or $obj->_throw_error("Corrupted file, no master index record");
157 unless ($obj->{type} eq $tag->{signature}) {
158 $obj->_throw_error("File type mismatch");
163 #XXX We have to make sure we don't mess up when autoflush isn't turned on
164 unless ( $obj->_root->{inode} ) {
165 my @stats = stat($obj->_fh);
166 $obj->_root->{inode} = $stats[1];
167 $obj->_root->{end} = $stats[7];
177 # Open a fh to the database, create if nonexistent.
178 # Make sure file signature matches DBM::Deep spec.
183 # Theoretically, adding O_BINARY should remove the need for the binmode
184 # Of course, testing it is going to be ... interesting.
185 my $flags = O_RDWR | O_CREAT | O_BINARY;
188 my $filename = $obj->_root->{file};
189 sysopen( $fh, $filename, $flags )
190 or $obj->_throw_error("Cannot sysopen file '$filename': $!");
191 $obj->_root->{fh} = $fh;
193 #XXX Can we remove this by using the right sysopen() flags?
194 # Maybe ... q.v. above
195 binmode $fh; # for win32
197 if ($obj->_root->{autoflush}) {
198 my $old = select $fh;
210 if ( my $fh = $obj->_root->{fh} ) {
213 $obj->_root->{fh} = undef;
221 return SIG_SIZE + $self->{data_size} + $size;
226 # Given offset, signature and content, create tag and write to disk
229 my ($obj, $offset, $sig, $content) = @_;
230 my $size = length($content);
234 seek($fh, $offset + $obj->_root->{file_offset}, SEEK_SET);
235 print( $fh $sig . pack($self->{data_pack}, $size) . $content );
237 if ($offset == $obj->_root->{end}) {
238 $obj->_root->{end} += $self->tag_size( $size );
244 offset => $offset + SIG_SIZE + $self->{data_size},
251 # Given offset, load single tag and return signature, size and data
254 my ($obj, $offset) = @_;
256 # print join(':',map{$_||''}caller(1)), $/;
260 seek($fh, $offset + $obj->_root->{file_offset}, SEEK_SET);
262 #XXX I'm not sure this check will work if autoflush isn't enabled ...
266 read( $fh, $b, SIG_SIZE + $self->{data_size} );
267 my ($sig, $size) = unpack( "A $self->{data_pack}", $b );
270 read( $fh, $buffer, $size);
275 offset => $offset + SIG_SIZE + $self->{data_size},
282 my ($obj, $value) = @_;
284 my $is_dbm_deep = eval {
285 local $SIG{'__DIE__'};
286 $value->isa( 'DBM::Deep' );
289 my $internal_ref = $is_dbm_deep && ($value->_root eq $obj->_root);
291 if ( $internal_ref ) {
292 return $self->{long_size};
295 my $r = Scalar::Util::reftype( $value ) || '';
296 unless ( $r eq 'HASH' || $r eq 'ARRAY' ) {
297 return length( $value );
300 my $actual_length = $self->{index_size};
302 # if autobless is enabled, must also take into consideration
303 # the class name, as it is stored along with key/value.
304 if ( $obj->_root->{autobless} ) {
305 my $value_class = Scalar::Util::blessed($value);
306 if ( defined $value_class && !$value->isa('DBM::Deep') ) {
307 $actual_length += length($value_class);
311 return $actual_length;
316 # Adds one key/value pair to bucket list, given offset, MD5 digest of key,
317 # plain (undigested) key and value.
320 my ($obj, $tag, $md5, $plain_key, $value) = @_;
322 # This verifies that only supported values will be stored.
324 my $r = Scalar::Util::reftype( $value );
327 last if $r eq 'HASH';
328 last if $r eq 'ARRAY';
331 "Storage of variables of type '$r' is not supported."
338 my $root = $obj->_root;
342 my ($subloc, $offset) = $self->_find_in_buckets( $tag, $md5 );
344 # Updating a known md5
348 seek($fh, $subloc + SIG_SIZE + $root->{file_offset}, SEEK_SET);
350 read( $fh, $size, $self->{data_size});
351 $size = unpack($self->{data_pack}, $size);
353 my $actual_length = $self->_length_needed( $obj, $value );
355 if ($actual_length <= $size) {
359 $location = $root->{end};
362 $tag->{offset} + $offset + $self->{hash_size} + $root->{file_offset},
365 print( $fh pack($self->{long_pack}, $location) );
369 elsif ( defined $offset ) {
370 $location = $root->{end};
372 seek( $fh, $tag->{offset} + $offset + $root->{file_offset}, SEEK_SET );
373 print( $fh $md5 . pack($self->{long_pack}, $location) );
375 # If bucket didn't fit into list, split into a new index level
377 $self->split_index( $obj, $md5, $tag );
379 $location = $root->{end};
382 $self->write_value( $obj, $location, $plain_key, $value );
389 my ($obj, $location, $key, $value) = @_;
392 my $root = $obj->_root;
394 my $is_dbm_deep = eval {
395 local $SIG{'__DIE__'};
396 $value->isa( 'DBM::Deep' );
399 my $internal_ref = $is_dbm_deep && ($value->_root eq $root);
401 seek($fh, $location + $root->{file_offset}, SEEK_SET);
404 # Write signature based on content type, set content length and write
407 my $r = Scalar::Util::reftype($value) || '';
409 if ( $internal_ref ) {
410 print( $fh SIG_INTERNAL );
411 print( $fh pack($self->{data_pack}, $self->{long_size}) );
412 print( $fh pack($self->{long_pack}, $value->_base_offset) );
413 $content_length = $self->{long_size};
417 print( $fh SIG_HASH );
418 print( $fh pack($self->{data_pack}, $self->{index_size}) . chr(0) x $self->{index_size} );
419 $content_length = $self->{index_size};
421 elsif ($r eq 'ARRAY') {
422 print( $fh SIG_ARRAY );
423 print( $fh pack($self->{data_pack}, $self->{index_size}) . chr(0) x $self->{index_size} );
424 $content_length = $self->{index_size};
426 elsif (!defined($value)) {
427 print( $fh SIG_NULL );
428 print( $fh pack($self->{data_pack}, 0) );
432 print( $fh SIG_DATA );
433 print( $fh pack($self->{data_pack}, length($value)) . $value );
434 $content_length = length($value);
439 # Plain key is stored AFTER value, as keys are typically fetched less often.
441 print( $fh pack($self->{data_pack}, length($key)) . $key );
444 # If value is blessed, preserve class name
446 if ( $root->{autobless} ) {
447 my $value_class = Scalar::Util::blessed($value);
448 if ( defined $value_class && !$value->isa( 'DBM::Deep' ) ) {
450 # Blessed ref -- will restore later
453 print( $fh pack($self->{data_pack}, length($value_class)) . $value_class );
454 $content_length += 1;
455 $content_length += $self->{data_size} + length($value_class);
459 $content_length += 1;
464 # If this is a new content area, advance EOF counter
466 if ($location == $root->{end}) {
467 $root->{end} += SIG_SIZE;
468 $root->{end} += $self->{data_size} + $content_length;
469 $root->{end} += $self->{data_size} + length($key);
473 # If content is a hash or array, create new child DBM::Deep object and
474 # pass each key or element to it.
476 if ( ! $internal_ref ) {
478 my $branch = DBM::Deep->new(
479 type => DBM::Deep->TYPE_HASH,
480 base_offset => $location,
483 foreach my $key (keys %{$value}) {
484 $branch->STORE( $key, $value->{$key} );
487 elsif ($r eq 'ARRAY') {
488 my $branch = DBM::Deep->new(
489 type => DBM::Deep->TYPE_ARRAY,
490 base_offset => $location,
494 foreach my $element (@{$value}) {
495 $branch->STORE( $index, $element );
506 my ($obj, $md5, $tag) = @_;
509 my $root = $obj->_root;
510 my $keys = $tag->{content};
512 seek($fh, $tag->{ref_loc} + $root->{file_offset}, SEEK_SET);
514 my $loc = $self->_request_space(
515 $obj, $self->tag_size( $self->{index_size} ),
518 print( $fh pack($self->{long_pack}, $loc) );
520 my $index_tag = $self->create_tag(
521 $obj, $loc, SIG_INDEX,
522 chr(0) x $self->{index_size},
527 $keys .= $md5 . pack($self->{long_pack}, 0);
530 for (my $i = 0; $i <= $self->{max_buckets}; $i++) {
531 my ($key, $old_subloc) = $self->_get_key_subloc( $keys, $i );
533 next BUCKET unless $key;
535 my $num = ord(substr($key, $tag->{ch} + 1, 1));
537 if ($offsets[$num]) {
538 my $offset = $offsets[$num] + SIG_SIZE + $self->{data_size};
539 seek($fh, $offset + $root->{file_offset}, SEEK_SET);
541 read( $fh, $subkeys, $self->{bucket_list_size});
543 for (my $k=0; $k<$self->{max_buckets}; $k++) {
544 my ($temp, $subloc) = $self->_get_key_subloc( $subkeys, $k );
547 seek($fh, $offset + ($k * $self->{bucket_size}) + $root->{file_offset}, SEEK_SET);
548 print( $fh $key . pack($self->{long_pack}, $old_subloc || $root->{end}) );
554 $offsets[$num] = $root->{end};
555 seek($fh, $index_tag->{offset} + ($num * $self->{long_size}) + $root->{file_offset}, SEEK_SET);
556 print( $fh pack($self->{long_pack}, $root->{end}) );
558 my $blist_tag = $self->create_tag($obj, $root->{end}, SIG_BLIST, chr(0) x $self->{bucket_list_size});
560 seek($fh, $blist_tag->{offset} + $root->{file_offset}, SEEK_SET);
561 print( $fh $key . pack($self->{long_pack}, $old_subloc || $root->{end}) );
570 my ($obj, $subloc) = @_;
575 # Found match -- seek to offset and read signature
578 seek($fh, $subloc + $obj->_root->{file_offset}, SEEK_SET);
579 read( $fh, $signature, SIG_SIZE);
582 # If value is a hash or array, return new DBM::Deep object with correct offset
584 if (($signature eq SIG_HASH) || ($signature eq SIG_ARRAY)) {
585 my $obj = DBM::Deep->new(
587 base_offset => $subloc,
591 if ($obj->_root->{autobless}) {
593 # Skip over value and plain key to see if object needs
596 seek($fh, $self->{data_size} + $self->{index_size}, SEEK_CUR);
599 read( $fh, $size, $self->{data_size}); $size = unpack($self->{data_pack}, $size);
600 if ($size) { seek($fh, $size, SEEK_CUR); }
603 read( $fh, $bless_bit, 1);
604 if (ord($bless_bit)) {
606 # Yes, object needs to be re-blessed
609 read( $fh, $size, $self->{data_size}); $size = unpack($self->{data_pack}, $size);
610 if ($size) { read( $fh, $class_name, $size); }
611 if ($class_name) { $obj = bless( $obj, $class_name ); }
617 elsif ( $signature eq SIG_INTERNAL ) {
619 read( $fh, $size, $self->{data_size});
620 $size = unpack($self->{data_pack}, $size);
624 read( $fh, $new_loc, $size );
625 $new_loc = unpack( $self->{long_pack}, $new_loc );
627 return $self->read_from_loc( $obj, $new_loc );
634 # Otherwise return actual value
636 elsif ($signature eq SIG_DATA) {
638 read( $fh, $size, $self->{data_size});
639 $size = unpack($self->{data_pack}, $size);
642 if ($size) { read( $fh, $value, $size); }
647 # Key exists, but content is null
652 sub get_bucket_value {
654 # Fetch single value given tag and MD5 digested key.
657 my ($obj, $tag, $md5) = @_;
659 my ($subloc, $offset) = $self->_find_in_buckets( $tag, $md5 );
661 return $self->read_from_loc( $obj, $subloc );
668 # Delete single key/value pair given tag and MD5 digested key.
671 my ($obj, $tag, $md5) = @_;
673 my ($subloc, $offset) = $self->_find_in_buckets( $tag, $md5 );
676 seek($fh, $tag->{offset} + $offset + $obj->_root->{file_offset}, SEEK_SET);
677 print( $fh substr($tag->{content}, $offset + $self->{bucket_size} ) );
678 print( $fh chr(0) x $self->{bucket_size} );
687 # Check existence of single key given tag and MD5 digested key.
690 my ($obj, $tag, $md5) = @_;
692 my ($subloc, $offset) = $self->_find_in_buckets( $tag, $md5 );
696 sub find_bucket_list {
698 # Locate offset for bucket list, given digested key
701 my ($obj, $md5, $args) = @_;
702 $args = {} unless $args;
705 # Locate offset for bucket list using digest index system
707 my $tag = $self->load_tag($obj, $obj->_base_offset)
708 or $obj->_throw_error( "INTERNAL ERROR - Cannot find tag" );
711 while ($tag->{signature} ne SIG_BLIST) {
712 my $num = ord substr($md5, $ch, 1);
714 my $ref_loc = $tag->{offset} + ($num * $self->{long_size});
715 $tag = $self->index_lookup( $obj, $tag, $num );
718 return if !$args->{create};
721 seek($fh, $ref_loc + $obj->_root->{file_offset}, SEEK_SET);
723 my $loc = $self->_request_space(
724 $obj, $self->tag_size( $self->{bucket_list_size} ),
727 print( $fh pack($self->{long_pack}, $loc) );
729 $tag = $self->create_tag(
730 $obj, $loc, SIG_BLIST,
731 chr(0) x $self->{bucket_list_size},
734 $tag->{ref_loc} = $ref_loc;
741 $tag->{ref_loc} = $ref_loc;
749 # Given index tag, lookup single entry in index and return .
752 my ($obj, $tag, $index) = @_;
754 my $location = unpack(
758 $index * $self->{long_size},
763 if (!$location) { return; }
765 return $self->load_tag( $obj, $location );
770 # Scan index and recursively step into deeper levels, looking for next key.
773 my ($obj, $offset, $ch, $force_return_next) = @_;
775 my $tag = $self->load_tag($obj, $offset );
779 if ($tag->{signature} ne SIG_BLIST) {
780 my $content = $tag->{content};
781 my $start = $obj->{return_next} ? 0 : ord(substr($obj->{prev_md5}, $ch, 1));
783 for (my $idx = $start; $idx < (2**8); $idx++) {
788 $idx * $self->{long_size},
794 my $result = $self->traverse_index(
795 $obj, $subloc, $ch + 1, $force_return_next,
798 if (defined($result)) { return $result; }
802 $obj->{return_next} = 1;
806 my $keys = $tag->{content};
807 if ($force_return_next) { $obj->{return_next} = 1; }
810 # Iterate through buckets, looking for a key match
812 for (my $i = 0; $i < $self->{max_buckets}; $i++) {
813 my ($key, $subloc) = $self->_get_key_subloc( $keys, $i );
815 # End of bucket list -- return to outer loop
817 $obj->{return_next} = 1;
820 # Located previous key -- return next one found
821 elsif ($key eq $obj->{prev_md5}) {
822 $obj->{return_next} = 1;
825 # Seek to bucket location and skip over signature
826 elsif ($obj->{return_next}) {
827 seek($fh, $subloc + $obj->_root->{file_offset}, SEEK_SET);
829 # Skip over value to get to plain key
831 read( $fh, $sig, SIG_SIZE );
834 read( $fh, $size, $self->{data_size});
835 $size = unpack($self->{data_pack}, $size);
836 if ($size) { seek($fh, $size, SEEK_CUR); }
838 # Read in plain key and return as scalar
840 read( $fh, $size, $self->{data_size});
841 $size = unpack($self->{data_pack}, $size);
842 if ($size) { read( $fh, $plain_key, $size); }
848 $obj->{return_next} = 1;
849 } # tag is a bucket list
856 # Locate next key, given digested previous one
861 $obj->{prev_md5} = $_[1] ? $_[1] : undef;
862 $obj->{return_next} = 0;
865 # If the previous key was not specifed, start at the top and
866 # return the first one found.
868 if (!$obj->{prev_md5}) {
869 $obj->{prev_md5} = chr(0) x $self->{hash_size};
870 $obj->{return_next} = 1;
873 return $self->traverse_index( $obj, $obj->_base_offset, 0 );
878 sub _get_key_subloc {
880 my ($keys, $idx) = @_;
882 my ($key, $subloc) = unpack(
883 "a$self->{hash_size} $self->{long_pack}",
886 ($idx * $self->{bucket_size}),
887 $self->{bucket_size},
891 return ($key, $subloc);
894 sub _find_in_buckets {
896 my ($tag, $md5) = @_;
899 for ( my $i = 0; $i < $self->{max_buckets}; $i++ ) {
900 my ($key, $subloc) = $self->_get_key_subloc( $tag->{content}, $i );
902 return ($subloc, $i * $self->{bucket_size}) unless $subloc;
904 next BUCKET if $key ne $md5;
906 return ($subloc, $i * $self->{bucket_size});
914 my ($obj, $size) = @_;
916 my $loc = $obj->_root->{end};
917 $obj->_root->{end} += $size;
924 my ($obj, $size, $loc) = @_;
932 # This will be added in later, after more refactoring is done. This is an early
933 # attempt at refactoring on the physical level instead of the virtual level.
936 my ($obj, $spot, $amount, $unpack) = @_;
939 seek( $fh, $spot + $obj->_root->{file_offset}, SEEK_SET );
942 my $bytes_read = read( $fh, $buffer, $amount );
945 $buffer = unpack( $unpack, $buffer );
949 return ($buffer, $bytes_read);