1N/A#!/usr/bin/perl
1N/A#
1N/A# Unit tests of _mtwrite function
1N/A#
1N/A# _mtwrite($self, $d1, $s1, $l1, $d2, $s2, $l2, ...)
1N/A#
1N/A# 'm' here is for 'multiple'. This writes data $d1 at position $s1
1N/A# over a block of space $l1, moving subsequent data up or down as necessary.
1N/A
1N/Amy $file = "tf$$.txt";
1N/A$| = 1;
1N/A
1N/Aprint "1..2252\n";
1N/A
1N/Amy $N = 1;
1N/Amy $oldfile;
1N/Ause Tie::File;
1N/Aprint "ok $N\n"; $N++;
1N/A
1N/A$: = Tie::File::_default_recsep();
1N/A
1N/A# Only these are used for the triple-region tests
1N/A@BASE_TRIES = (
1N/A [10, 20, 30],
1N/A [10, 30, 20],
1N/A [100, 30, 20],
1N/A [100, 20, 30],
1N/A [100, 40, 20],
1N/A [100, 20, 40],
1N/A [200, 20, 30],
1N/A [200, 30, 20],
1N/A [200, 20, 60],
1N/A [200, 60, 20],
1N/A );
1N/A
1N/A@TRIES = @BASE_TRIES;
1N/A
1N/A$FLEN = 40970; # Use files of this length
1N/A$oldfile = mkrand($FLEN);
1N/Aprint "# MOF tests\n";
1N/A# These were generated by 'gentests.pl' to cover all possible cases
1N/A# (I hope)
1N/A# Legend:
1N/A# x: data is entirely contained within one block
1N/A# x>: data runs from the middle to the end of the block
1N/A# <x: data runs from the start to the middle of the block
1N/A# <x>: data occupies precisely one block
1N/A# x><x: data overlaps one block boundary
1N/A# <x><x: data runs from the start of one block into the middle of the next
1N/A# x><x>: data runs from the middle of one block to the end of the next
1N/A# <x><x>: data occupies two blocks exactly
1N/A# <x><x><x>: data occupies three blocks exactly
1N/A# 0: data is null
1N/A#
1N/A# For each possible alignment of the old and new data, we investigate
1N/A# up to three situations: old data is shorter, old and new data are the
1N/A# same length, and new data is shorter.
1N/A#
1N/A# try($pos, $old, $new) means to run a test where the area being
1N/A# written into starts at position $pos, the area being written into
1N/A# has length $old, and and the new data has length $new.
1N/Atry( 8605, 2394, 2394); # old=x , new=x ; old = new
1N/Atry( 9768, 1361, 664); # old=x , new=x ; old > new
1N/Atry( 9955, 6429, 6429); # old=x> , new=x ; old = new
1N/Atry(10550, 5834, 4123); # old=x> , new=x ; old > new
1N/Atry(14580, 6158, 851); # old=x><x , new=x ; old > new
1N/Atry(13442, 11134, 1572); # old=x><x> , new=x ; old > new
1N/Atry( 8192, 514, 514); # old=<x , new=<x ; old = new
1N/Atry( 8192, 2196, 858); # old=<x , new=<x ; old > new
1N/Atry( 8192, 8192, 8192); # old=<x> , new=<x ; old = new
1N/Atry( 8192, 8192, 1290); # old=<x> , new=<x ; old > new
1N/Atry( 8192, 10575, 6644); # old=<x><x , new=<x ; old > new
1N/Atry( 8192, 16384, 5616); # old=<x><x> , new=<x ; old > new
1N/Atry( 8192, 24576, 6253); # old=<x><x><x>, new=<x ; old > new
1N/Atry( 9965, 6419, 6419); # old=x> , new=x> ; old = new
1N/Atry(16059, 6102, 325); # old=x><x , new=x> ; old > new
1N/Atry( 9503, 15073, 6881); # old=x><x> , new=x> ; old > new
1N/Atry(16316, 1605, 1605); # old=x><x , new=x><x ; old = new
1N/Atry(16093, 4074, 993); # old=x><x , new=x><x ; old > new
1N/Atry(14739, 9837, 9837); # old=x><x> , new=x><x ; old = new
1N/Atry(14071, 10505, 7344); # old=x><x> , new=x><x ; old > new
1N/Atry( 8192, 8192, 8192); # old=<x> , new=<x> ; old = new
1N/Atry( 8192, 14817, 8192); # old=<x><x , new=<x> ; old > new
1N/Atry( 8192, 16384, 8192); # old=<x><x> , new=<x> ; old > new
1N/Atry( 8192, 24576, 8192); # old=<x><x><x>, new=<x> ; old > new
1N/Atry( 8192, 9001, 9001); # old=<x><x , new=<x><x ; old = new
1N/Atry( 8192, 11760, 10274); # old=<x><x , new=<x><x ; old > new
1N/Atry( 8192, 16384, 10781); # old=<x><x> , new=<x><x ; old > new
1N/Atry( 8192, 24576, 9284); # old=<x><x><x>, new=<x><x ; old > new
1N/Atry(14761, 9815, 9815); # old=x><x> , new=x><x> ; old = new
1N/Atry( 8192, 16384, 16384); # old=<x><x> , new=<x><x> ; old = new
1N/Atry( 8192, 24576, 16384); # old=<x><x><x>, new=<x><x> ; old > new
1N/Atry( 8192, 24576, 24576); # old=<x><x><x>, new=<x><x><x>; old = new
1N/Atry( 8771, 776, 0); # old=x , new=0 ; old > new
1N/Atry( 8192, 2813, 0); # old=<x , new=0 ; old > new
1N/Atry(13945, 2439, 0); # old=x> , new=0 ; old > new
1N/Atry(14493, 6090, 0); # old=x><x , new=0 ; old > new
1N/Atry( 8192, 8192, 0); # old=<x> , new=0 ; old > new
1N/Atry( 8192, 10030, 0); # old=<x><x , new=0 ; old > new
1N/Atry(14983, 9593, 0); # old=x><x> , new=0 ; old > new
1N/Atry( 8192, 16384, 0); # old=<x><x> , new=0 ; old > new
1N/Atry( 8192, 24576, 0); # old=<x><x><x>, new=0 ; old > new
1N/Atry(10489, 0, 0); # old=0 , new=0 ; old = new
1N/A
1N/Aprint "# SOF tests\n";
1N/A# These tests all take place at the start of the file
1N/Atry( 0, 4868, 4868); # old=<x , new=<x ; old = new
1N/Atry( 0, 147, 118); # old=<x , new=<x ; old > new
1N/Atry( 0, 8192, 8192); # old=<x> , new=<x ; old = new
1N/Atry( 0, 8192, 4574); # old=<x> , new=<x ; old > new
1N/Atry( 0, 11891, 1917); # old=<x><x , new=<x ; old > new
1N/Atry( 0, 16384, 5155); # old=<x><x> , new=<x ; old > new
1N/Atry( 0, 24576, 2953); # old=<x><x><x>, new=<x ; old > new
1N/Atry( 0, 8192, 8192); # old=<x> , new=<x> ; old = new
1N/Atry( 0, 11083, 8192); # old=<x><x , new=<x> ; old > new
1N/Atry( 0, 16384, 8192); # old=<x><x> , new=<x> ; old > new
1N/Atry( 0, 24576, 8192); # old=<x><x><x>, new=<x> ; old > new
1N/Atry( 0, 14126, 14126); # old=<x><x , new=<x><x ; old = new
1N/Atry( 0, 12002, 9034); # old=<x><x , new=<x><x ; old > new
1N/Atry( 0, 16384, 13258); # old=<x><x> , new=<x><x ; old > new
1N/Atry( 0, 24576, 14367); # old=<x><x><x>, new=<x><x ; old > new
1N/Atry( 0, 16384, 16384); # old=<x><x> , new=<x><x> ; old = new
1N/Atry( 0, 24576, 16384); # old=<x><x><x>, new=<x><x> ; old > new
1N/Atry( 0, 24576, 24576); # old=<x><x><x>, new=<x><x><x>; old = new
1N/Atry( 0, 6530, 0); # old=<x , new=0 ; old > new
1N/Atry( 0, 8192, 0); # old=<x> , new=0 ; old > new
1N/Atry( 0, 14707, 0); # old=<x><x , new=0 ; old > new
1N/Atry( 0, 16384, 0); # old=<x><x> , new=0 ; old > new
1N/Atry( 0, 24576, 0); # old=<x><x><x>, new=0 ; old > new
1N/Atry( 0, 0, 0); # old=0 , new=0 ; old = new
1N/A
1N/Aprint "# EOF tests 1\n";
1N/A# These tests all take place at the end of the file
1N/A$FLEN = 40960; # Force the file to be exactly 40960 bytes long
1N/A$oldfile = mkrand($FLEN);
1N/Atry(32768, 8192, 8192); # old=<x> , new=<x ; old = new
1N/Atry(32768, 8192, 4026); # old=<x> , new=<x ; old > new
1N/Atry(24576, 16384, 1917); # old=<x><x> , new=<x ; old > new
1N/Atry(16384, 24576, 3818); # old=<x><x><x>, new=<x ; old > new
1N/Atry(32768, 8192, 8192); # old=<x> , new=<x> ; old = new
1N/Atry(24576, 16384, 8192); # old=<x><x> , new=<x> ; old > new
1N/Atry(16384, 24576, 8192); # old=<x><x><x>, new=<x> ; old > new
1N/Atry(24576, 16384, 12221); # old=<x><x> , new=<x><x ; old > new
1N/Atry(16384, 24576, 15030); # old=<x><x><x>, new=<x><x ; old > new
1N/Atry(24576, 16384, 16384); # old=<x><x> , new=<x><x> ; old = new
1N/Atry(16384, 24576, 16384); # old=<x><x><x>, new=<x><x> ; old > new
1N/Atry(16384, 24576, 24576); # old=<x><x><x>, new=<x><x><x>; old = new
1N/Atry(35973, 4987, 0); # old=x> , new=0 ; old > new
1N/Atry(32768, 8192, 0); # old=<x> , new=0 ; old > new
1N/Atry(29932, 11028, 0); # old=x><x> , new=0 ; old > new
1N/Atry(24576, 16384, 0); # old=<x><x> , new=0 ; old > new
1N/Atry(16384, 24576, 0); # old=<x><x><x>, new=0 ; old > new
1N/Atry(40960, 0, 0); # old=0 , new=0 ; old = new
1N/A
1N/Aprint "# EOF tests 2\n";
1N/A# These tests all take place at the end of the file
1N/A$FLEN = 42000; # Force the file to be exactly 42000 bytes long
1N/A$oldfile = mkrand($FLEN);
1N/Atry(41683, 317, 317); # old=x , new=x ; old = new
1N/Atry(41225, 775, 405); # old=x , new=x ; old > new
1N/Atry(35709, 6291, 284); # old=x><x , new=x ; old > new
1N/Atry(40960, 1040, 1040); # old=<x , new=<x ; old = new
1N/Atry(40960, 1040, 378); # old=<x , new=<x ; old > new
1N/Atry(32768, 9232, 5604); # old=<x><x , new=<x ; old > new
1N/Atry(39994, 2006, 966); # old=x><x , new=x> ; old > new
1N/Atry(36725, 5275, 5275); # old=x><x , new=x><x ; old = new
1N/Atry(37990, 4010, 3199); # old=x><x , new=x><x ; old > new
1N/Atry(32768, 9232, 8192); # old=<x><x , new=<x> ; old > new
1N/Atry(32768, 9232, 9232); # old=<x><x , new=<x><x ; old = new
1N/Atry(32768, 9232, 8795); # old=<x><x , new=<x><x ; old > new
1N/Atry(41500, 500, 0); # old=x , new=0 ; old > new
1N/Atry(40960, 1040, 0); # old=<x , new=0 ; old > new
1N/Atry(35272, 6728, 0); # old=x><x , new=0 ; old > new
1N/Atry(32768, 9232, 0); # old=<x><x , new=0 ; old > new
1N/Atry(42000, 0, 0); # old=0 , new=0 ; old = new
1N/A
1N/A# Now the REAL tests
1N/A# Make sure mtwrite can properly write sequences of several intervals
1N/A# The intervals tested above were accumulated into @TRIES.
1N/A# try_all_doubles() tries every possible sensible pair of those intervals.
1N/A# try_all_triples() tries every possible sensible group of
1N/A# tree intervals from the more restrictive set @BASE_TRIES.
1N/A$FLEN = 40970;
1N/A$oldfile = mkrand($FLEN);
1N/Atry_all_doubles();
1N/Atry_all_triples();
1N/A
1N/Asub mkrand {
1N/A my $len = shift;
1N/A srand $len;
1N/A my @c = ('a' .. 'z', 'A' .. 'Z', 0..9, $:);
1N/A my $d = "";
1N/A $d .= $c[rand @c] until length($d) >= $len;
1N/A substr($d, $len) = ""; # chop it off to the proper length
1N/A $d;
1N/A}
1N/A
1N/Asub try {
1N/A push @TRIES, [@_] if @_ == 3;
1N/A
1N/A open F, "> $file" or die "Couldn't open file $file: $!";
1N/A binmode F;
1N/A print F $oldfile;
1N/A close F;
1N/A die "wrong length!" unless -s $file == $FLEN;
1N/A
1N/A my @mt_args;
1N/A my $expected = $oldfile;
1N/A { my @a = @_;
1N/A my $c = "a";
1N/A while (@a) {
1N/A my ($s, $len, $newlen) = splice @a, -3;
1N/A my $newdata = $c++ x $newlen;
1N/A substr($expected, $s, $len, $newdata);
1N/A unshift @mt_args, $newdata, $s, $len;
1N/A }
1N/A }
1N/A
1N/A my $o = tie my @lines, 'Tie::File', $file or die $!;
1N/A my $actual_return = $o->_mtwrite(@mt_args);
1N/A undef $o; untie @lines;
1N/A
1N/A open F, "< $file" or die "Couldn't open file $file: $!";
1N/A binmode F;
1N/A my $actual;
1N/A { local $/;
1N/A $actual = <F>;
1N/A }
1N/A close F;
1N/A
1N/A my ($alen, $xlen) = (length $actual, length $expected);
1N/A unless ($alen == $xlen) {
1N/A print "# try(@_) expected file length $xlen, actual $alen!\n";
1N/A }
1N/A print $actual eq $expected ? "ok $N\n" : "not ok $N\n";
1N/A $N++;
1N/A
1N/A# if (! defined $actual_return && ! defined $expected_return) {
1N/A# print "ok $N\n";
1N/A# } elsif (! defined $actual_return || ! defined $expected_return) {
1N/A# print "not ok $N\n";
1N/A# } else {
1N/A# print $actual_return eq $expected_return ? "ok $N\n" : "not ok $N\n";
1N/A# }
1N/A# $N++;
1N/A}
1N/A
1N/Asub try_all_doubles {
1N/A print "# Trying double regions.\n";
1N/A for my $a (@TRIES) {
1N/A next if $a->[0] + $a->[1] >= $FLEN;
1N/A next if $a->[0] + $a->[2] >= $FLEN;
1N/A for my $b (@TRIES) {
1N/A next if $b->[0] + $b->[1] >= $FLEN;
1N/A next if $b->[0] + $b->[2] >= $FLEN;
1N/A
1N/A next if $b->[0] < $a->[0] + $a->[1]; # Overlapping regions
1N/A try(@$a, @$b);
1N/A }
1N/A }
1N/A}
1N/A
1N/Asub try_all_triples {
1N/A print "# Trying triple regions.\n";
1N/A for my $a (@BASE_TRIES) {
1N/A next if $a->[0] + $a->[1] >= $FLEN;
1N/A next if $a->[0] + $a->[2] >= $FLEN;
1N/A for my $b (@BASE_TRIES) {
1N/A next if $b->[0] + $b->[1] >= $FLEN;
1N/A next if $b->[0] + $b->[2] >= $FLEN;
1N/A
1N/A next if $b->[0] < $a->[0] + $a->[1]; # Overlapping regions
1N/A
1N/A for my $c (@BASE_TRIES) {
1N/A next if $c->[0] + $c->[1] >= $FLEN;
1N/A next if $c->[0] + $c->[2] >= $FLEN;
1N/A
1N/A next if $c->[0] < $b->[0] + $b->[1]; # Overlapping regions
1N/A try(@$a, @$b, @$c);
1N/A }
1N/A }
1N/A }
1N/A}
1N/A
1N/Asub ctrlfix {
1N/A for (@_) {
1N/A s/\n/\\n/g;
1N/A s/\r/\\r/g;
1N/A }
1N/A}
1N/A
1N/AEND {
1N/A 1 while unlink $file;
1N/A}
1N/A