… | |
… | |
155 | # call all destruction callbacks |
155 | # call all destruction callbacks |
156 | $_->(@{$self->{status}}) |
156 | $_->(@{$self->{status}}) |
157 | for @{(delete $self->{destroy_cb}) || []}; |
157 | for @{(delete $self->{destroy_cb}) || []}; |
158 | } |
158 | } |
159 | |
159 | |
|
|
160 | sub _do_trace { |
|
|
161 | $current->{_trace_cb}->(); |
|
|
162 | } |
|
|
163 | |
160 | # this coroutine is necessary because a coroutine |
164 | # this coroutine is necessary because a coroutine |
161 | # cannot destroy itself. |
165 | # cannot destroy itself. |
162 | my @destroy; |
166 | my @destroy; |
163 | my $manager; |
167 | my $manager; |
164 | |
168 | |
… | |
… | |
227 | |
231 | |
228 | If you are concerned about pooled coroutines growing a lot because a |
232 | If you are concerned about pooled coroutines growing a lot because a |
229 | single C<async_pool> used a lot of stackspace you can e.g. C<async_pool |
233 | single C<async_pool> used a lot of stackspace you can e.g. C<async_pool |
230 | { terminate }> once per second or so to slowly replenish the pool. In |
234 | { terminate }> once per second or so to slowly replenish the pool. In |
231 | addition to that, when the stacks used by a handler grows larger than 16kb |
235 | addition to that, when the stacks used by a handler grows larger than 16kb |
232 | (adjustable with $Coro::MAX_POOL_RSS) it will also exit. |
236 | (adjustable with $Coro::POOL_RSS) it will also exit. |
233 | |
237 | |
234 | =cut |
238 | =cut |
235 | |
239 | |
236 | our $POOL_SIZE = 8; |
240 | our $POOL_SIZE = 8; |
237 | our $MAX_POOL_RSS = 16 * 1024; |
241 | our $POOL_RSS = 16 * 1024; |
238 | our @pool; |
242 | our @async_pool; |
239 | |
243 | |
240 | sub pool_handler { |
244 | sub pool_handler { |
|
|
245 | my $cb; |
|
|
246 | |
241 | while () { |
247 | while () { |
242 | $current->{desc} = "[async_pool]"; |
|
|
243 | |
|
|
244 | eval { |
248 | eval { |
245 | my ($cb, @arg) = @{ delete $current->{_invoke} or return }; |
249 | while () { |
246 | $cb->(@arg); |
250 | _pool_1 $cb; |
|
|
251 | &$cb; |
|
|
252 | _pool_2 $cb; |
|
|
253 | &schedule; |
|
|
254 | } |
247 | }; |
255 | }; |
|
|
256 | |
|
|
257 | last if $@ eq "\3terminate\2\n"; |
248 | warn $@ if $@; |
258 | warn $@ if $@; |
249 | |
|
|
250 | last if @pool >= $POOL_SIZE || $current->rss >= $MAX_POOL_RSS; |
|
|
251 | |
|
|
252 | push @pool, $current; |
|
|
253 | $current->{desc} = "[async_pool idle]"; |
|
|
254 | $current->save (Coro::State::SAVE_DEF); |
|
|
255 | $current->prio (0); |
|
|
256 | schedule; |
|
|
257 | } |
259 | } |
258 | } |
260 | } |
259 | |
261 | |
260 | sub async_pool(&@) { |
262 | sub async_pool(&@) { |
261 | # this is also inlined into the unlock_scheduler |
263 | # this is also inlined into the unlock_scheduler |
262 | my $coro = (pop @pool) || new Coro \&pool_handler;; |
264 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
263 | |
265 | |
264 | $coro->{_invoke} = [@_]; |
266 | $coro->{_invoke} = [@_]; |
265 | $coro->ready; |
267 | $coro->ready; |
266 | |
268 | |
267 | $coro |
269 | $coro |
… | |
… | |
537 | # inside an event callback. |
539 | # inside an event callback. |
538 | our $unblock_scheduler = new Coro sub { |
540 | our $unblock_scheduler = new Coro sub { |
539 | while () { |
541 | while () { |
540 | while (my $cb = pop @unblock_queue) { |
542 | while (my $cb = pop @unblock_queue) { |
541 | # this is an inlined copy of async_pool |
543 | # this is an inlined copy of async_pool |
542 | my $coro = (pop @pool or new Coro \&pool_handler); |
544 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
543 | |
545 | |
544 | $coro->{_invoke} = $cb; |
546 | $coro->{_invoke} = $cb; |
545 | $coro->ready; |
547 | $coro->ready; |
546 | cede; # for short-lived callbacks, this reduces pressure on the coro pool |
548 | cede; # for short-lived callbacks, this reduces pressure on the coro pool |
547 | } |
549 | } |