2 # The User/Sysop Filter module
4 # The way this works is that the filter routine is actually
5 # a predefined function that returns 0 if it is OK and 1 if it
6 # is not when presented with a list of things.
8 # This set of routines provide a means of maintaining the filter
9 # scripts which are compiled in when an entity connects.
11 # Copyright (c) 1999 Dirk Koopman G1TLH
15 # The NEW INSTRUCTIONS
17 # use the commands accept/spot|ann|wwv|wcy and reject/spot|ann|wwv|wcy
18 # also show/filter spot|ann|wwv|wcy
20 # The filters live in a directory tree of their own in $main::root/filter
22 # Each type of filter (e.g. spot, wwv) live in a tree of their own so you
23 # can have different filters for different things for the same callsign.
36 use vars qw ($filterbasefn $in);
38 $filterbasefn = "$main::root/filter";
41 # initial filter system
49 my ($class, $sort, $call, $flag) = @_;
50 $flag = ($flag) ? "in_" : "";
51 return bless {sort => $sort, name => "$flag$call.pl" }, $class;
54 # standard filename generator
57 my ($sort, $call, $flag) = @_;
60 $flag = ($flag) ? "in_" : "";
62 my $fn = "$filterbasefn/$sort/$flag$call.pl";
67 $fn = "$filterbasefn/$sort/$flag$call.pl";
69 $fn = undef unless -e $fn;
73 # this reads in a filter statement and returns it as a list
75 # The filter is stored in straight perl so that it can be parsed and read
76 # in with a 'do' statement. The 'do' statement reads the filter into
77 # @in which is a list of references
84 my $ref = $self->{$fname};
87 if ($ref->{$ar} && exists $ref->{$ar}->{asc}) {
88 $ref->{$ar}->{code} = eval "sub { my \$r=shift; return $ref->{$ar}->{asc}; }" ;
90 my $sort = $ref->{sort};
91 my $name = $ref->{name};
92 dbg('err', "Error compiling $ar $sort $name: $@");
93 Log('err', "Error compiling $ar $sort $name: $@");
102 my ($sort, $call, $flag) = @_;
106 if ($fn = getfn($sort, $call, $flag)) {
108 my $s = readfilestr($fn);
110 dbg('conn', "$@") if $@;
112 $newin = new('Filter::Old', $sort, $call, $flag);
113 $newin->{filter} = $in;
117 foreach $key ($newin->getfilkeys) {
118 $newin->compile($key, 'reject');
119 $newin->compile($key, 'accept');
132 foreach $key (grep {/^filter/ } keys %$self) {
133 push @out, $self->{$key};
141 return grep {/^filter/ } keys %$self;
145 # This routine accepts a composite filter with a reject rule and then an accept rule.
147 # The filter returns 0 if an entry is matched by any reject rule and also if any
148 # accept rule fails otherwise it returns 1
150 # Either set of rules may be missing meaning an implicit 'opposite' ie if it
151 # a reject then ok else if an accept then not ok.
153 # you can set a default with either an accept/xxxx all or reject/xxxx all
155 # Unlike the old system, this is kept as a hash of hashes so that you can
156 # easily change them by program.
158 # You can have 10 filter lines (0->9), they are tried in order until
161 # There is a parser that takes a Filter::Cmd object which describes all the possible
162 # things you can filter on and then converts that to a bit of perl which is compiled
163 # and stored as a function.
165 # The result of this is that in theory you can put together an arbritrarily complex
166 # expression involving the things you can filter on including 'and' 'or' 'not' and
171 # accept/spots hf and by_zone 14,15,16 and not by pa,on
173 # accept/spots freq 0/30000 and by_zone 4,5
175 # accept/spots 2 vhf and (by_zone 14,15,16 or call_dxcc 61)
177 # no filter no implies filter 1
179 # The field nos are the same as for the 'Old' filters
190 my @keys = sort $self->getfilkeys;
192 my $r = @keys > 0 ? 0 : 1;
193 foreach $key (@keys) {
194 $filter = $self->{$key};
195 if ($filter->{reject} && exists $filter->{reject}->{code}) {
196 if (&{$filter->{reject}->{code}}(\@_)) {
203 if ($filter->{accept} && exists $filter->{accept}->{code}) {
204 if (&{$filter->{accept}->{code}}(\@_)) {
213 # hops are done differently
216 while (($comp, $ref) = each %{$self->{hops}}) {
217 my ($field, $h) = @$ref;
218 if ($_[$field] =~ m{$comp}) {
227 # this writes out the filter in a form suitable to be read in by 'read_in'
228 # It expects a list of references to filter lines
232 my $sort = $self->{sort};
233 my $name = $self->{name};
234 my $dir = "$filterbasefn/$sort";
235 my $fn = "$dir/$name";
237 mkdir $dir, 0775 unless -e $dir;
238 rename $fn, "$fn.o" if -e $fn;
239 my $fh = new IO::File ">$fn";
241 my $dd = new Data::Dumper([ $self ]);
244 $dd->Quotekeys($] < 5.005 ? 1 : 0);
245 $fh->print($dd->Dumpxs);
248 rename "$fn.o", $fn if -e "$fn.o";
257 my $name = shift || $self->{name};
258 my $sort = shift || $self->{sort};
259 my $flag = shift || "";
263 push @out, join(' ', $name , ':', $sort, $flag);
266 foreach $key (sort $self->getfilkeys) {
267 my $filter = $self->{$key};
268 if (exists $filter->{reject} && exists $filter->{reject}->{user}) {
269 push @out, ' ' . join(' ', $key, 'reject', $filter->{reject}->{user});
271 if (exists $filter->{accept} && exists $filter->{accept}->{user}) {
272 push @out, ' ' . join(' ', $key, 'accept', $filter->{accept}->{user});
282 my $name = uc $self->{name};
283 my $sort = $self->{sort};
284 my ($in) = $name =~ s/^IN_//;
287 my $dxchan = DXChannel->get($name);
290 my $n = "$in$sort" . "filter";
291 $dxchan->$n($remove ? undef : $self);
297 my ($sort, $call, $flag, $fno) = @_;
300 my $fn = getfn($sort, $call, $flag);
301 my $filter = read_in($sort, $call, $flag);
305 foreach $key ($filter->getfilkeys) {
306 delete $filter->{$key};
308 } elsif (exists $filter->{"filter$fno"}) {
309 delete $filter->{"filter$fno"};
313 if ($filter->{hops} || $filter->getfilkeys) {
332 # the general purpose command processor
333 # this is called as a subroutine not as a method
336 my ($self, $dxchan, $sort, $line) = @_;
344 # check the line for non legal characters
345 return ('ill', $dxchan->msg('e19')) if $line =~ /[^\s\w,_\-\*\/\(\)]/;
347 # add some spaces for ease of parsing
348 $line =~ s/([\(\)])/ $1 /g;
351 my @f = split /\s+/, $line;
357 if (@f && $dxchan->priv >= 8 && ((is_callsign(uc $f[0]) && DXUser->get(uc $f[0])) || $f[0] =~ /(?:node|user)_default/)) {
359 if ($f[0] eq 'input') {
364 $call = $dxchan->call;
367 if (@f && $f[0] =~ /^\d$/) {
371 $filter = Filter::read_in($sort, $call, $flag);
372 $filter = Filter->new($sort, $call, $flag) unless $filter;
378 # do the rest of the filter tokens
395 } elsif ($tok eq ')') {
401 } elsif ($tok eq 'all') {
405 } elsif ($tok eq 'or') {
406 $conj = ' || ' if $conj ne ' || ';
408 } elsif ($tok eq 'and') {
409 $conj = ' && ' if $conj ne ' && ';
411 } elsif ($tok eq 'not' || $tok eq '!') {
417 my @val = split /,/, $val;
427 $user .= "$tok $val";
431 foreach $fref (@$self) {
433 if ($fref->[0] eq $tok) {
437 push @nval, split(',', &{$fref->[4]}($dxchan, $_));
441 if ($fref->[1] eq 'a') {
445 push @t, "\$r->[$fref->[2]]=~/$_/i";
447 $s .= "(" . join(' || ', @t) . ")";
448 } elsif ($fref->[1] eq 'c') {
452 push @t, "\$r->[$fref->[2]]=~/^\U$_/";
454 $s .= "(" . join(' || ', @t) . ")";
455 } elsif ($fref->[1] eq 'n') {
458 return ('num', $dxchan->msg('e21', $_)) unless /^\d+$/;
459 push @t, "\$r->[$fref->[2]]==$_";
461 $s .= "(" . join(' || ', @t) . ")";
462 } elsif ($fref->[1] eq 'r') {
465 return ('range', $dxchan->msg('e23', $_)) unless /^(\d+)\/(\d+)$/;
466 push @t, "(\$r->[$fref->[2]]>=$1 && \$r->[$fref->[2]]<=$2)";
468 $s .= "(" . join(' || ', @t) . ")";
470 confess("invalid letter $fref->[1]");
476 return ('unknown', $dxchan->msg('e20', $tok)) unless $found;
478 return ('no', $dxchan->msg('filter2', $tok));
484 # tidy up the user string
485 $user =~ s/\&\&/ and /g;
486 $user =~ s/\|\|/ or /g;
487 $user =~ s/\!/ not /g;
490 return (0, $filter, $fno, $user, "$s");
493 # a filter accept/reject command
496 my ($self, $dxchan, $sort, $type, $line) = @_;
498 return $dxchan->msg('filter5') unless $line;
500 my ($r, $filter, $fno, $user, $s) = $self->parse($dxchan, $sort, $line);
501 return (1,$filter) if $r;
503 my $fn = "filter$fno";
505 $filter->{$fn} = {} unless exists $filter->{$fn};
506 $filter->{$fn}->{$type} = {} unless exists $filter->{$fn}->{$type};
508 $filter->{$fn}->{$type}->{user} = $user;
509 $filter->{$fn}->{$type}->{asc} = $s;
510 $r = $filter->compile($fn, $type);
518 return (0, $filter, $fno);
530 # the OLD instructions!
532 # Each filter file has the same structure:-
536 # [ action, fieldno, fieldsort, comparison, action data ],
540 # The action is usually 1 or 0 but could be any numeric value
542 # The fieldno is the field no in the list of fields that is presented
545 # The fieldsort is the type of field that we are dealing with which
546 # currently can be 'a', 'n', 'r' or 'd'. 'a' is alphanumeric, 'n' is
547 # numeric, 'r' is ranges of pairs of numeric values and 'd' is default.
549 # Filter::it basically goes thru the list of comparisons from top to
550 # bottom and when one matches it will return the action and the action data as a list.
552 # are the element nos of the list that is presented to Filter::it. Element
553 # 0 is the first field of the list.
557 # takes the reference to the filter (the first argument) and applies
558 # it to the subsequent arguments and returns the action specified.
563 my $filter = $self->{filter}; # this is now a bless ref of course but so what
565 my ($action, $field, $fieldsort, $comp, $actiondata);
568 # default action is 1
571 return ($action, $actiondata) if !$filter;
573 for $ref (@{$filter}) {
574 ($action, $field, $fieldsort, $comp, $actiondata) = @{$ref};
575 if ($fieldsort eq 'n') {
576 my $val = $_[$field];
577 return ($action, $actiondata) if grep $_ == $val, @{$comp};
578 } elsif ($fieldsort eq 'r') {
579 my $val = $_[$field];
581 my @range = @{$comp};
582 for ($i = 0; $i < @range; $i += 2) {
583 return ($action, $actiondata) if $val >= $range[$i] && $val <= $range[$i+1];
585 } elsif ($fieldsort eq 'a') {
586 return ($action, $actiondata) if $_[$field] =~ m{$comp};
588 return ($action, $actiondata); # the default action
598 my $flag = shift || "";
599 return "$call: Old Style Filter $flag $sort";