1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
|
# Copyright (c) 2010-2012 Zmanda, Inc. All Rights Reserved.
# Copyright (c) 2013-2016 Carbonite, Inc. All Rights Reserved.
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with this program; if not, write to the Free Software Foundation, Inc.,
# 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
# Contact information: Carbonite Inc., 756 N Pastoria Ave
# Sunnyvale, CA 94085, or: http://www.zmanda.com
package Amanda::Taper::Scan::lexical;
=head1 NAME
Amanda::Taper::Scan::lexical
=head1 SYNOPSIS
This package implements the "lexical" taperscan algorithm. See
C<amanda-taperscan(7)>.
=cut
use strict;
use warnings;
use base qw( Amanda::ScanInventory Amanda::Taper::Scan );
use Amanda::Tapelist;
use Carp;
use POSIX ();
use Data::Dumper;
use vars qw( @ISA );
use base qw(Exporter);
our @EXPORT_OK = qw($DEFAULT_CHANGER);
use Amanda::Paths;
use Amanda::Util qw( match_labelstr );
use Amanda::Device qw( :constants );
use Amanda::Debug qw( debug );
use Amanda::Changer;
use Amanda::MainLoop;
use Amanda::Interactivity;
use Amanda::Taper::Scan::traditional;
our $DEFAULT_CHANGER = {};
sub new {
my $class = shift;
my %params = @_;
my $chg = $params{'changer'};
if (!defined $chg) {
$chg = Amanda::Changer->new();
$params{'changer'} = $chg;
}
if (!$chg->have_inventory()) {
return Amanda::Taper::Scan::traditional->new(%params);
}
my $self = Amanda::ScanInventory->new(%params);
$self->{'handled-error'} = {};
return bless ($self, $class);
}
sub last_use_label_from_pool {
my $self = shift;
my $tles = $self->{'tapelist'}->{tles};
my $pool = $self->{'tapepool'};
for my $tle ( @{$tles} ) {
# skip if not set up
next if ( !$tle || !$tle->{'datestamp'});
# skip if not in specific pool
next if ( exists $tle->{'pool'} && $tle->{'pool'} && $tle->{'pool'} ne $pool );
return $tle->{'label'};
}
return undef;
}
sub last_use_label_from_pool {
my $self = shift;
my $tles = $self->{'tapelist'}->{tles};
my $count = @{$tles};
for (my $i = 0; $i < $count ; $i++) {
my $tle = $tles->[$i];
if ($tle->{'datestamp'} != '0' &&
(!defined $tle->{'pool'} ||
$tle->{'pool'} eq $self->{'tapepool'})) {
return $tle->{'label'};
}
}
return undef;
}
sub analyze {
my $self = shift;
my $inventory = shift;
my $seen = shift;
my $res = shift;
my @reusable_before;
my @reusable_after;
my @new_volume_before;
my @new_volume_after;
my @new_labeled_before;
my @new_labeled_after;
my @unknown;
my @error;
my $last_label = $self->last_use_label_from_pool();
for my $i (0..(scalar(@$inventory)-1)) {
my $sl = $inventory->[$i];
next if $seen->{$sl->{slot}};
if (!defined $sl->{'state'} ||
$sl->{'state'} == Amanda::Changer::SLOT_UNKNOWN) {
push @unknown, $sl
} elsif ($sl->{'state'} == Amanda::Changer::SLOT_EMPTY) {
} elsif (defined $sl->{'label'} &&
$sl->{device_status} == $DEVICE_STATUS_SUCCESS) {
if ($self->is_reusable_volume(label => $sl->{'label'})) {
if ($last_label && $sl->{'label'} gt $last_label) {
push @reusable_after, $sl;
} else {
push @reusable_before, $sl;
}
} else {
my $vol_tle = $self->{'tapelist'}->lookup_tapelabel($sl->{'label'});
if ($vol_tle) {
if ($self->volume_is_new_labelled($vol_tle, $sl)) {
if ($last_label && $sl->{'label'} gt $last_label) {
push @new_labeled_after, $sl;
} else {
push @new_labeled_before, $sl;
}
}
} elsif ($self->volume_is_labelable($sl)) {
$sl->{'label'} = $self->{'chg'}->make_new_tape_label(
barcode => $sl->{'barcode'},
slot => $sl->{'slot'},
meta => $sl->{'meta'});
if ($last_label && $sl->{'label'} gt $last_label) {
push @new_volume_after, $sl;
} else {
push @new_volume_before, $sl;
}
}
}
} elsif ($self->volume_is_labelable($sl)) {
$sl->{'label'} = $self->{'chg'}->make_new_tape_label(
barcode => $sl->{'barcode'},
slot => $sl->{'slot'},
meta => $sl->{'meta'});
if ($last_label && $sl->{'label'} gt $last_label) {
push @new_volume_after, $sl;
} else {
push @new_volume_before, $sl;
}
} elsif (!defined($sl->{device_status}) && !defined($sl->{label})) {
push @unknown, $sl;
} elsif (defined($sl->{device_status}) and
($sl->{'device_status'} & $DEVICE_STATUS_DEVICE_ERROR or
$sl->{'device_status'} & $DEVICE_STATUS_VOLUME_ERROR) and
not exists $self->{'handled-error'}->{$sl->{'device_error'}} and
not exists $self->{'new_error'}->{$sl->{'device_error'}}) {
push @error, $sl;
} else {
}
}
@reusable_before = sort { $a->{'label'} cmp $b->{'label'} } @reusable_before;
@reusable_after = sort { $a->{'label'} cmp $b->{'label'} } @reusable_after;
@new_labeled_before = sort { $a->{'label'} cmp $b->{'label'} } @new_labeled_before;
@new_labeled_after = sort { $a->{'label'} cmp $b->{'label'} } @new_labeled_after;
@new_volume_before = sort { $a->{'label'} cmp $b->{'label'} } @new_volume_before;
@new_volume_after = sort { $a->{'label'} cmp $b->{'label'} } @new_volume_after;
my @result;
my @soon_before;
my @soon_after;
my @order_before;
my @order_after;
my @last_before;
my @last_after;
my $use;
if (@new_labeled_after && $self->{'scan_conf'}->{'new_labeled'} eq 'soon') {
push @soon_after, @new_labeled_after;
}
if (@new_labeled_before && $self->{'scan_conf'}->{'new_labeled'} eq 'soon') {
push @soon_before, @new_labeled_before;
}
if (@new_volume_after && $self->{'scan_conf'}->{'new_volume'} eq 'soon') {
push @soon_after, @new_volume_after;
}
if (@new_volume_before && $self->{'scan_conf'}->{'new_volume'} eq 'soon') {
push @soon_before, @new_volume_before;
}
@soon_before = sort { $a->{'label'} cmp $b->{'label'} } @soon_before;
@soon_after = sort { $a->{'label'} cmp $b->{'label'} } @soon_after;
if (@new_labeled_before && $self->{'scan_conf'}->{'new_labeled'} eq 'order') {
push @order_before, @new_labeled_before;
}
if (@new_labeled_after && $self->{'scan_conf'}->{'new_labeled'} eq 'order') {
push @order_after, @new_labeled_after;
}
if (@new_volume_before && $self->{'scan_conf'}->{'new_volume'} eq 'order') {
push @order_before, @new_volume_before;
}
if (@new_volume_after && $self->{'scan_conf'}->{'new_volume'} eq 'order') {
push @order_after, @new_volume_after;
}
if (@reusable_after) {
push @order_after, @reusable_after;
}
if (@reusable_before) {
push @order_before, @reusable_before;
}
@order_before = sort { $a->{'label'} cmp $b->{'label'} } @order_before;
@order_after = sort { $a->{'label'} cmp $b->{'label'} } @order_after;
if (@new_labeled_after && $self->{'scan_conf'}->{'new_labeled'} eq 'last') {
push @last_after, @new_labeled_after;
}
if (@new_labeled_before && $self->{'scan_conf'}->{'new_labeled'} eq 'last') {
push @last_before, @new_labeled_before;
}
if (@new_volume_after && $self->{'scan_conf'}->{'new_volume'} eq 'last') {
push @last_after, @new_volume_after;
}
if (@new_volume_before && $self->{'scan_conf'}->{'new_volume'} eq 'last') {
push @last_before, @new_volume_before;
}
@last_before = sort { $a->{'label'} cmp $b->{'label'} } @last_before;
@last_after = sort { $a->{'label'} cmp $b->{'label'} } @last_after;
push @result, @soon_after, @soon_before, @order_after, @order_before, @last_after, @last_before, @unknown, @error;
return \@result;
}
1;
|