my $s;
vfill $s, 0, 100, 1; # Fill with 100 bits 1 starting at 0.
my $s;
vfill $s, 0, 100, 1; # Fill with 100 bits 1 starting at 0.
- (undef, my $s, my $l, my $x) = @_;
- croak "Invalid argument" unless _alldef @_;
+ my ($s, $l, $x) = @_[1 .. 3];
vec($_[0], $_, 1) = $x for $s .. $SIZE * $t - 1;
vec($_[0], $_, $SIZE) = $x for $t .. $u - 1;
vec($_[0], $_, 1) = $x for $SIZE * $u .. $s + $l - 1;
vec($_[0], $_, 1) = $x for $s .. $SIZE * $t - 1;
vec($_[0], $_, $SIZE) = $x for $t .. $u - 1;
vec($_[0], $_, 1) = $x for $SIZE * $u .. $s + $l - 1;
sub vcopy_pp ($$$$$) {
my ($fs, $ts, $l) = @_[1, 3, 4];
sub vcopy_pp ($$$$$) {
my ($fs, $ts, $l) = @_[1, 3, 4];
vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for $fs .. $fs + $l - 1;
} else { # There's a risk of overwriting if $_[0] and $_[2] are the same SV.
vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for reverse $fs .. $fs + $l - 1;
vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for $fs .. $fs + $l - 1;
} else { # There's a risk of overwriting if $_[0] and $_[2] are the same SV.
vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for reverse $fs .. $fs + $l - 1;
sub vshift ($$$$;$) {
my ($start, $length, $bits, $insert) = @_[1 .. 4];
sub vshift ($$$$;$) {
my ($start, $length, $bits, $insert) = @_[1 .. 4];
sub vrot ($$$$) {
my ($start, $length, $bits) = @_[1 .. 3];
return unless $length and $bits;
sub vrot ($$$$) {
my ($start, $length, $bits) = @_[1 .. 3];
return unless $length and $bits;
sub veq_pp ($$$$$) {
my ($s1, $s2, $l) = @_[1, 3, 4];
sub veq_pp ($$$$$) {
my ($s1, $s2, $l) = @_[1, 3, 4];
my $i = 0;
while ($i < $l) {
return 0 if vec($_[0], $s1 + $i, 1) != vec($_[2], $s2 + $i, 1);
my $i = 0;
while ($i < $l) {
return 0 if vec($_[0], $s1 + $i, 1) != vec($_[2], $s2 + $i, 1);
- 'funcs' => [ qw/vfill vcopy vshift vrot veq/ ],
- 'consts' => [ qw/SVU_PP SVU_SIZE/ ]
+ 'funcs' => [ qw<vfill vcopy vshift vrot veq> ],
+ 'consts' => [ qw<SVU_PP SVU_SIZE> ]
-Copyright 2008 Vincent Pit, all rights reserved.
+Copyright 2008,2009,2010,2011,2012 Vincent Pit, all rights reserved.