… | |
… | |
113 | reasons. If performance is not essential you are encouraged to use the |
113 | reasons. If performance is not essential you are encouraged to use the |
114 | C<Coro::current> function instead. |
114 | C<Coro::current> function instead. |
115 | |
115 | |
116 | =cut |
116 | =cut |
117 | |
117 | |
|
|
118 | $main->{desc} = "[main::]"; |
|
|
119 | |
118 | # maybe some other module used Coro::Specific before... |
120 | # maybe some other module used Coro::Specific before... |
119 | $main->{specific} = $current->{specific} |
121 | $main->{specific} = $current->{specific} |
120 | if $current; |
122 | if $current; |
121 | |
123 | |
122 | _set_current $main; |
124 | _set_current $main; |
… | |
… | |
153 | # call all destruction callbacks |
155 | # call all destruction callbacks |
154 | $_->(@{$self->{status}}) |
156 | $_->(@{$self->{status}}) |
155 | for @{(delete $self->{destroy_cb}) || []}; |
157 | for @{(delete $self->{destroy_cb}) || []}; |
156 | } |
158 | } |
157 | |
159 | |
|
|
160 | sub _do_trace { |
|
|
161 | $current->{_trace_cb}->(); |
|
|
162 | } |
|
|
163 | |
158 | # this coroutine is necessary because a coroutine |
164 | # this coroutine is necessary because a coroutine |
159 | # cannot destroy itself. |
165 | # cannot destroy itself. |
160 | my @destroy; |
166 | my @destroy; |
161 | my $manager; |
167 | my $manager; |
162 | |
168 | |
163 | $manager = new Coro sub { |
169 | $manager = new Coro sub { |
164 | $current->desc ("[coro manager]"); |
|
|
165 | |
|
|
166 | while () { |
170 | while () { |
167 | (shift @destroy)->_cancel |
171 | (shift @destroy)->_cancel |
168 | while @destroy; |
172 | while @destroy; |
169 | |
173 | |
170 | &schedule; |
174 | &schedule; |
171 | } |
175 | } |
172 | }; |
176 | }; |
173 | |
177 | $manager->desc ("[coro manager]"); |
174 | $manager->prio (PRIO_MAX); |
178 | $manager->prio (PRIO_MAX); |
175 | |
179 | |
176 | # static methods. not really. |
180 | # static methods. not really. |
177 | |
181 | |
178 | =back |
182 | =back |
… | |
… | |
224 | The pool size is limited to 8 idle coroutines (this can be adjusted by |
228 | The pool size is limited to 8 idle coroutines (this can be adjusted by |
225 | changing $Coro::POOL_SIZE), and there can be as many non-idle coros as |
229 | changing $Coro::POOL_SIZE), and there can be as many non-idle coros as |
226 | required. |
230 | required. |
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. |
234 | { terminate }> once per second or so to slowly replenish the pool. In |
|
|
235 | addition to that, when the stacks used by a handler grows larger than 16kb |
|
|
236 | (adjustable with $Coro::POOL_RSS) it will also exit. |
231 | |
237 | |
232 | =cut |
238 | =cut |
233 | |
239 | |
234 | our $POOL_SIZE = 8; |
240 | our $POOL_SIZE = 8; |
|
|
241 | our $POOL_RSS = 16 * 1024; |
235 | our @pool; |
242 | our @async_pool; |
236 | |
243 | |
237 | sub pool_handler { |
244 | sub pool_handler { |
|
|
245 | my $cb; |
|
|
246 | |
238 | while () { |
247 | while () { |
239 | $current->{desc} = "[async_pool]"; |
|
|
240 | |
|
|
241 | eval { |
248 | eval { |
242 | my ($cb, @arg) = @{ delete $current->{_invoke} or return }; |
249 | while () { |
243 | $cb->(@arg); |
250 | _pool_1 $cb; |
|
|
251 | &$cb; |
|
|
252 | _pool_2 $cb; |
|
|
253 | &schedule; |
|
|
254 | } |
244 | }; |
255 | }; |
|
|
256 | |
|
|
257 | last if $@ eq "\3terminate\2\n"; |
245 | warn $@ if $@; |
258 | warn $@ if $@; |
246 | |
|
|
247 | last if @pool >= $POOL_SIZE; |
|
|
248 | |
|
|
249 | push @pool, $current; |
|
|
250 | $current->{desc} = "[async_pool idle]"; |
|
|
251 | $current->save (Coro::State::SAVE_DEF); |
|
|
252 | $current->prio (0); |
|
|
253 | schedule; |
|
|
254 | } |
259 | } |
255 | } |
260 | } |
256 | |
261 | |
257 | sub async_pool(&@) { |
262 | sub async_pool(&@) { |
258 | # this is also inlined into the unlock_scheduler |
263 | # this is also inlined into the unlock_scheduler |
259 | my $coro = (pop @pool) || new Coro \&pool_handler;; |
264 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
260 | |
265 | |
261 | $coro->{_invoke} = [@_]; |
266 | $coro->{_invoke} = [@_]; |
262 | $coro->ready; |
267 | $coro->ready; |
263 | |
268 | |
264 | $coro |
269 | $coro |
… | |
… | |
530 | |
535 | |
531 | # we create a special coro because we want to cede, |
536 | # we create a special coro because we want to cede, |
532 | # to reduce pressure on the coro pool (because most callbacks |
537 | # to reduce pressure on the coro pool (because most callbacks |
533 | # return immediately and can be reused) and because we cannot cede |
538 | # return immediately and can be reused) and because we cannot cede |
534 | # inside an event callback. |
539 | # inside an event callback. |
535 | our $unblock_scheduler = async { |
540 | our $unblock_scheduler = new Coro sub { |
536 | $current->desc ("[unblock_sub scheduler]"); |
|
|
537 | while () { |
541 | while () { |
538 | while (my $cb = pop @unblock_queue) { |
542 | while (my $cb = pop @unblock_queue) { |
539 | # this is an inlined copy of async_pool |
543 | # this is an inlined copy of async_pool |
540 | my $coro = (pop @pool or new Coro \&pool_handler); |
544 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
541 | |
545 | |
542 | $coro->{_invoke} = $cb; |
546 | $coro->{_invoke} = $cb; |
543 | $coro->ready; |
547 | $coro->ready; |
544 | 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 |
545 | } |
549 | } |
546 | schedule; # sleep well |
550 | schedule; # sleep well |
547 | } |
551 | } |
548 | }; |
552 | }; |
|
|
553 | $unblock_scheduler->desc ("[unblock_sub scheduler]"); |
549 | |
554 | |
550 | sub unblock_sub(&) { |
555 | sub unblock_sub(&) { |
551 | my $cb = shift; |
556 | my $cb = shift; |
552 | |
557 | |
553 | sub { |
558 | sub { |