3 # Copyright 2006 Ian Jackson <ijackson@chiark.greenend.org.uk>
5 # This script and its documentation (if any) are free software; you
6 # can redistribute it and/or modify them under the terms of the GNU
7 # General Public License as published by the Free Software Foundation;
8 # either version 3, or (at your option) any later version.
10 # chiark-named-conf and its manpage are distributed in the hope that
11 # it will be useful, but WITHOUT ANY WARRANTY; without even the
12 # implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
13 # PURPOSE. See the GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License along
16 # with this program; if not, consult the Free Software Foundation's
17 # website at www.fsf.org, or the GNU Project website at www.gnu.org.
23 expire-iso8601 [<options>] <number>x<interval> [<number>x<interval> ...]
25 -u<unitlen> <interval> is measured in units of <unitlen> seconds
26 (default is 86400, so <interval> is in days)
27 -s<slop> allow kept items to be <slop> seconds shorter apart than
28 specified; default is 10% of <unitlen>
29 -n do not really delete
30 -r recursive removal (rm -r)
32 /home/ian/junk/expire-iso8601 14x1 4x7
33 uses units of 86400s (1 day) with a slop of 8640
34 it keeps 14 daily items
35 (that is 14 items, dated no less than 86400-8640 apart)
37 (that is 4 items, dated no less than 7*86400-8640 apart)
38 the 14 daily and 7 weekly items may be the same, or not
39 There is no need to sort the list of <number>x<interval> pairs.
44 16 catastrophic failure
48 use DateTime::Format::RFC3339;
58 print STDERR "bad usage: $_[0]\n$usage" or die $!;
63 my $parser = DateTime::Format::RFC3339->new;
65 foreach my $f (<[0-9]*>) {
66 if ($f !~ m/^ \d\d\d\d - \d\d - \d\d
67 (?: T \d\d \: \d\d (?: \: \d\d )?
68 (?: [-+] \d{1,2} \:? \d\d )? )? /x) {
69 print STDERR "ignoring $f\n";
71 $!=0; $?=0; my $t = `date -d '$&' +%s`;
72 die "date(!) failed on $&: $? $!" if $! || $?;
74 push @files, { F => $f, T => $t, U => [] };
80 print STDERR "none at all yet!\n";
84 # newest first, which means biggest T
85 @files = sort { $b->{T} <=> $a->{T} || $b->{F} cmp $a->{F} } @files;
86 my $newest_t = $files[0]{T};
87 $_->{A} = ($newest_t - $_->{T}) / $unit foreach @files;
93 my $n = $int->{Number};
94 my $d = $int->{Interval};
95 my $spec = $int->{Spec};
96 my $start_age = ($n+1) * $d;
99 # find $i, the youngest which is at least $number x $interval
101 last if $files[$i]{A} > $start_age;
103 print STDERR "insufficient for $spec\n";
109 push @{ $files[$i]{U} }, $spec;
111 # find $j, the closest to $i which is at least $d-slop younger
117 my $dt = $files[$i]{A} - $files[$j]{A};
118 last if $dt >= $d - $slop;
128 next unless @{$_->{U}};
129 print "keep $_->{F} for @{$_->{U}}\n";
133 print "remove $_->{F}\n";
135 my $r= system 'rm', ($recurse ? ('-r') : ()), "--", $_->{F};
136 die "run rm: $!\n" unless defined($r) && $r >= 0;
142 while (@ARGV && $ARGV[0] =~ m/^-/) {
144 last if $_ eq '-' || $_ eq '--';
147 if (s/^-n/-/) { $rm=0; }
148 elsif (s/-r/-/) { $recurse=1; }
149 elsif (s/-u(\d+)$//) { $unit=$1; }
150 elsif (s/-s(\d+)$//) { $slop=$1; }
151 else { badusage "unknown short option $_" }
153 } elsif (m/^--help$/) {
154 print $usage or die $!;
157 badusage "unknown long option $_"
161 badusage "too few arguments" unless @ARGV;
163 $slop //= $unit * 0.1;
166 m/^(\d+)x(\d+)$/ or badusage "bad <number>x<interval> $_";
167 push @intervals, { Spec => $&, N => $1, I => $2 };
172 foreach (@intervals) { flag $_ }