| 1 | package transferqueue; |
1 | package transferqueue; |
|
|
2 | |
|
|
3 | my @reserve = ( |
|
|
4 | [ 1_000_000, 1], |
|
|
5 | [ 10_000_000, 1], |
|
|
6 | ); |
| 2 | |
7 | |
| 3 | sub new { |
8 | sub new { |
| 4 | my $class = shift; |
9 | my $class = shift; |
| 5 | bless { |
10 | bless { |
| 6 | slots => $_[0], |
11 | slots => $_[0], |
| … | |
… | |
| 12 | sub start_transfer { |
17 | sub start_transfer { |
| 13 | my $self = shift; |
18 | my $self = shift; |
| 14 | my $size = $_[0]; |
19 | my $size = $_[0]; |
| 15 | |
20 | |
| 16 | my $transfer = bless { |
21 | my $transfer = bless { |
| 17 | queue => $self, |
22 | queue => $self, |
| 18 | time => $::NOW, |
23 | time => $::NOW, |
| 19 | size => $size, |
24 | size => $size, |
| 20 | coro => $Coro::current, |
25 | coro => $Coro::current, |
|
|
26 | started => 0, |
| 21 | }, transfer::; |
27 | }, transfer::; |
| 22 | |
28 | |
| 23 | push @{$self->{wait}}, $transfer; |
29 | push @{$self->{wait}}, $transfer; |
| 24 | Scalar::Util::weaken($self->{wait}[-1]); |
|
|
| 25 | |
30 | |
| 26 | $self->wake_next; |
31 | $self->wake_next; |
| 27 | |
32 | |
| 28 | $trans; |
33 | $transfer; |
| 29 | } |
|
|
| 30 | |
|
|
| 31 | sub wake_next { |
|
|
| 32 | my $self = shift; |
|
|
| 33 | |
|
|
| 34 | $self->sort; |
|
|
| 35 | |
|
|
| 36 | while($self->{slots} && @{$self->{wait}}) { |
|
|
| 37 | my $transfer = shift @{$self->{wait}}; |
|
|
| 38 | if ($transfer) { |
|
|
| 39 | $self->{lastspb} = $transfer->{spb}; |
|
|
| 40 | $self->{avgspb} ||= $transfer->{spb}; |
|
|
| 41 | $self->{avgspb} = $self->{avgspb} * 0.95 + $transfer->{spb} * 0.05; |
|
|
| 42 | $transfer->wake; |
|
|
| 43 | last; |
|
|
| 44 | } |
|
|
| 45 | } |
|
|
| 46 | } |
34 | } |
| 47 | |
35 | |
| 48 | sub sort { |
36 | sub sort { |
| 49 | my @queue = grep $_, @{$_[0]{wait}}; |
37 | my @queue = grep $_, @{$_[0]{wait}}; |
| 50 | |
38 | |
| 51 | $_->{spb} = ($::NOW-$_->{time}) / ($_->{size} || 1) for @queue; |
39 | $_->{spb} = ($::NOW-$_->{time}) / ($_->{size} || 1) for @queue; |
| 52 | |
40 | |
| 53 | $_[0]{wait} = [sort { $b->{spb} <=> $a->{spb} } @queue]; |
41 | $_[0]{wait} = [sort { $b->{spb} <=> $a->{spb} } @queue]; |
|
|
42 | |
|
|
43 | Scalar::Util::weaken $_ for @{$_[0]{wait}}; |
|
|
44 | } |
|
|
45 | |
|
|
46 | sub wake_next { |
|
|
47 | my $self = shift; |
|
|
48 | |
|
|
49 | $self->sort; |
|
|
50 | |
|
|
51 | while (@{$self->{wait}}) { |
|
|
52 | my $size = $self->{wait}[0]{size}; |
|
|
53 | my $min = 0; |
|
|
54 | for (@reserve) { |
|
|
55 | last if $size <= $_->[0]; |
|
|
56 | $min += $_->[1]; |
|
|
57 | } |
|
|
58 | last unless $self->{slots} > $min; |
|
|
59 | my $transfer = shift @{$self->{wait}}; |
|
|
60 | $self->{lastspb} = $transfer->{spb}; |
|
|
61 | $self->{avgspb} ||= $transfer->{spb}; |
|
|
62 | $self->{avgspb} = $self->{avgspb} * 0.95 + $transfer->{spb} * 0.05; |
|
|
63 | $self->{started}++; |
|
|
64 | $transfer->wake; |
|
|
65 | last; |
|
|
66 | } |
| 54 | } |
67 | } |
| 55 | |
68 | |
| 56 | sub waiters { |
69 | sub waiters { |
| 57 | $_[0]->sort; |
70 | $_[0]->sort; |
| 58 | @{$_[0]{wait}}; |
71 | @{$_[0]{wait}}; |
