| 1 | package transferqueue; |
1 | package transferqueue; |
| 2 | |
2 | |
| 3 | sub new { |
3 | sub new { |
| 4 | my $class = shift; |
4 | my $class = shift; |
| 5 | bless { |
5 | bless { |
| 6 | conns => $_[0], |
6 | slots => $_[0], |
|
|
7 | lastspb => 0, |
|
|
8 | avgspb => 0, |
| 7 | }, $class; |
9 | }, $class; |
| 8 | } |
10 | } |
| 9 | |
11 | |
| 10 | sub start_transfer { |
12 | sub start_transfer { |
| 11 | my $self = shift; |
13 | my $self = shift; |
|
|
14 | my $size = $_[0]; |
| 12 | |
15 | |
| 13 | my $trans = bless [ $self ], transfer::; |
16 | my $transfer = bless { |
| 14 | Scalar::Util::weaken($trans->[0]); |
17 | queue => $self, |
|
|
18 | time => $::NOW, |
|
|
19 | size => $size, |
|
|
20 | coro => $Coro::current, |
|
|
21 | }, transfer::; |
| 15 | |
22 | |
| 16 | push @{$self->{wait}}, $trans; |
23 | push @{$self->{wait}}, $transfer; |
| 17 | Scalar::Util::weaken($self->{wait}[-1]); |
24 | Scalar::Util::weaken($self->{wait}[-1]); |
| 18 | |
25 | |
| 19 | if (--$self->{conns} >= 0) { |
|
|
| 20 | $self->wake_next; |
26 | $self->wake_next; |
| 21 | } |
|
|
| 22 | |
27 | |
| 23 | $trans; |
28 | $trans; |
| 24 | } |
29 | } |
| 25 | |
30 | |
| 26 | sub wake_next { |
31 | sub wake_next { |
| 27 | my $self = shift; |
32 | my $self = shift; |
| 28 | |
33 | |
| 29 | if ($self->{conns} >= 0) { |
34 | $self->sort; |
| 30 | while(@{$self->{wait}}) { |
35 | |
|
|
36 | while($self->{slots} && @{$self->{wait}}) { |
| 31 | my $transfer = shift @{$self->{wait}}; |
37 | my $transfer = shift @{$self->{wait}}; |
| 32 | if ($transfer) { |
38 | if ($transfer) { |
|
|
39 | $self->{lastspb} = $transfer->{spb}; |
|
|
40 | $self->{avgspb} ||= $transfer->{spb}; |
|
|
41 | $self->{avgspb} = $self->{avgspb} * 0.95 + $transfer->{spb} * 0.05; |
| 33 | $transfer->wake; |
42 | $transfer->wake; |
| 34 | last; |
43 | last; |
| 35 | } |
|
|
| 36 | } |
44 | } |
| 37 | } |
45 | } |
| 38 | } |
46 | } |
| 39 | |
47 | |
|
|
48 | sub sort { |
|
|
49 | my @queue = grep $_, @{$_[0]{wait}}; |
|
|
50 | |
|
|
51 | $_->{spb} = ($::NOW-$_->{time}) / ($_->{size} || 1) for @queue; |
|
|
52 | |
|
|
53 | $_[0]{wait} = [sort { $b->{spb} <=> $a->{spb} } @queue]; |
|
|
54 | } |
|
|
55 | |
| 40 | sub waiters { |
56 | sub waiters { |
| 41 | map $_->[1], @{$_[0]{wait}}; |
57 | $_[0]->sort; |
|
|
58 | @{$_[0]{wait}}; |
| 42 | } |
59 | } |
| 43 | |
60 | |
| 44 | package transfer; |
61 | package transfer; |
| 45 | |
62 | |
| 46 | use Coro::Timer (); |
63 | use Coro::Timer (); |
| 47 | |
64 | |
|
|
65 | sub wake { |
|
|
66 | my $self = shift; |
|
|
67 | |
|
|
68 | $self->{alloc} = 1; |
|
|
69 | $self->{queue}{slots}--; |
|
|
70 | $self->{wake} and $self->{wake}->ready; |
|
|
71 | } |
|
|
72 | |
| 48 | sub try { |
73 | sub try { |
| 49 | my $self = shift; |
74 | my $self = shift; |
| 50 | my $timeout = Coro::Timer::timeout $_[0]; |
|
|
| 51 | |
75 | |
| 52 | unless ($self->[2]) { |
76 | $self->{alloc} || do { |
| 53 | local $self->[1] = $Coro::current; |
77 | my $timeout = Coro::Timer::timeout $_[0]; |
|
|
78 | local $self->{wake} = $self->{coro}; |
|
|
79 | |
| 54 | Coro::schedule; |
80 | Coro::schedule; |
|
|
81 | |
|
|
82 | $self->{alloc}; |
| 55 | } |
83 | } |
| 56 | |
|
|
| 57 | return $self->[2]; |
|
|
| 58 | } |
|
|
| 59 | |
|
|
| 60 | sub wake { |
|
|
| 61 | my $self = shift; |
|
|
| 62 | $self->[2] = 1; |
|
|
| 63 | ref $self->[1] and $self->[1]->ready; |
|
|
| 64 | } |
84 | } |
| 65 | |
85 | |
| 66 | sub DESTROY { |
86 | sub DESTROY { |
| 67 | my $self = shift; |
87 | my $self = shift; |
| 68 | $self->[0]{conns}++; |
88 | |
|
|
89 | if ($self->{alloc}) { |
|
|
90 | $self->{queue}{slots}++; |
| 69 | $self->[0]->wake_next; |
91 | $self->{queue}->wake_next; |
|
|
92 | } |
| 70 | } |
93 | } |
| 71 | |
94 | |
| 72 | package conn; |
95 | package conn; |
| 73 | |
96 | |
| 74 | our %blockuri; |
97 | our %blockuri; |
