return Route::Node::get($call) || Route::User::get($call);
}
+sub findroutes
+{
+ my $call = shift;
+ my $level = shift || 0;
+ my $seen = shift || {};
+ my @out;
+
+ dbg("findroutes: $call level: $level calls: " . join(',', @_)) if isdbg('routec');
+
+ # recursion detector
+ return () if $seen->{$call};
+ if (my $dxchan = DXChannel::get($call)) {
+ $seen->{$call}++;
+ push @out, $level ? [$level, $dxchan] : $dxchan;
+ return @out;
+ }
+ $seen->{$call}++;
+
+ # deal with more nodes
+ my $nref = Route::get($call);
+ foreach my $ncall (@{$nref->{parent}}) {
+ unless ($seen->{$ncall}) {
+ dbg("recursing from $call -> $ncall") if isdbg('routec');
+ my @rout = findroutes($ncall, $level+1, $seen);
+ push @out, @rout;
+ }
+ }
+
+ return $level == 0 ? map {$_->[1]} sort {$a->[0] <=> $b->[0]} @out : @out;
+}
+
# find all the possible dxchannels which this object might be on
sub alldxchan
{
my $self = shift;
- my @dxchan;
-# dbg("Trying node $self->{call}") if isdbg('routech');
-
- my $dxchan = DXChannel::get($self->{call});
- push @dxchan, $dxchan if $dxchan;
-
- # it isn't, build up a list of dxchannels and possible ping times
- # for all the candidates.
- unless (@dxchan) {
- foreach my $p (@{$self->{parent}}) {
-# dbg("Trying parent $p") if isdbg('routech');
- next if $p eq $main::mycall; # the root
- my $dxchan = DXChannel::get($p);
- if ($dxchan) {
- push @dxchan, $dxchan unless grep $dxchan == $_, @dxchan;
- } else {
- next if grep $p eq $_, @_;
- my $ref = Route::Node::get($p);
-# dbg("Next node $p " . ($ref ? 'Found' : 'NOT Found') if isdbg('routech') );
- push @dxchan, $ref->alldxchan($self->{call}, @_) if $ref;
- }
- }
- }
-# dbg('routech', "Got dxchan: " . join(',', (map{ $_->call } @dxchan)) );
+ my @dxchan = findroutes($self->{call});
return @dxchan;
}
return undef unless @dxchan;
# determine the minimum ping channel
- my $minping = 99999999;
- foreach my $dxc (@dxchan) {
- my $p = $dxc->pingave;
- if (defined $p && $p < $minping) {
- $minping = $p;
- $dxchan = $dxc;
- }
- }
- $dxchan = shift @dxchan unless $dxchan;
- return $dxchan;
+# my $minping = 99999999;
+# foreach my $dxc (@dxchan) {
+# my $p = $dxc->pingave;
+# if (defined $p && $p < $minping) {
+# $minping = $p;
+# $dxchan = $dxc;
+# }
+# }
+# $dxchan = shift @dxchan unless $dxchan;
+
+ # dxchannels are now returned in order of "closeness"
+ return $dxchan[0];
}