1 | #include "libcoro/coro.c" |
1 | #include "libcoro/coro.c" |
|
|
2 | |
|
|
3 | #define PERL_NO_GET_CONTEXT |
2 | |
4 | |
3 | #include "EXTERN.h" |
5 | #include "EXTERN.h" |
4 | #include "perl.h" |
6 | #include "perl.h" |
5 | #include "XSUB.h" |
7 | #include "XSUB.h" |
6 | |
8 | |
7 | #include "patchlevel.h" |
9 | #include "patchlevel.h" |
8 | |
10 | |
|
|
11 | #include <stdio.h> |
|
|
12 | #include <errno.h> |
|
|
13 | #include <assert.h> |
|
|
14 | |
|
|
15 | #ifdef HAVE_MMAP |
|
|
16 | # include <unistd.h> |
|
|
17 | # include <sys/mman.h> |
|
|
18 | # ifndef MAP_ANONYMOUS |
|
|
19 | # ifdef MAP_ANON |
|
|
20 | # define MAP_ANONYMOUS MAP_ANON |
|
|
21 | # else |
|
|
22 | # undef HAVE_MMAP |
|
|
23 | # endif |
|
|
24 | # endif |
|
|
25 | # include <limits.h> |
|
|
26 | # ifndef PAGESIZE |
|
|
27 | # define PAGESIZE pagesize |
|
|
28 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
29 | static long pagesize; |
|
|
30 | # else |
|
|
31 | # define BOOT_PAGESIZE (void)0 |
|
|
32 | # endif |
|
|
33 | #else |
|
|
34 | # define PAGESIZE 0 |
|
|
35 | # define BOOT_PAGESIZE (void)0 |
|
|
36 | #endif |
|
|
37 | |
9 | #if USE_VALGRIND |
38 | #if CORO_USE_VALGRIND |
10 | # include <valgrind/valgrind.h> |
39 | # include <valgrind/valgrind.h> |
|
|
40 | # define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end)) |
|
|
41 | #else |
|
|
42 | # define REGISTER_STACK(cctx,start,end) |
11 | #endif |
43 | #endif |
|
|
44 | |
|
|
45 | /* the maximum number of idle cctx that will be pooled */ |
|
|
46 | #define MAX_IDLE_CCTX 8 |
12 | |
47 | |
13 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
48 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
14 | (PERL_REVISION > (a) \ |
49 | (PERL_REVISION > (a) \ |
15 | || (PERL_REVISION == (a) \ |
50 | || (PERL_REVISION == (a) \ |
16 | && (PERL_VERSION > (b) \ |
51 | && (PERL_VERSION > (b) \ |
… | |
… | |
35 | # ifndef IS_PADCONST |
70 | # ifndef IS_PADCONST |
36 | # define IS_PADCONST(v) 0 |
71 | # define IS_PADCONST(v) 0 |
37 | # endif |
72 | # endif |
38 | #endif |
73 | #endif |
39 | |
74 | |
40 | #include <stdio.h> |
75 | /* 5.8.7 */ |
41 | #include <errno.h> |
76 | #ifndef SvRV_set |
|
|
77 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
78 | #endif |
42 | |
79 | |
43 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
80 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
44 | # undef STACKGUARD |
81 | # undef CORO_STACKGUARD |
45 | #endif |
|
|
46 | |
|
|
47 | #ifndef STACKGUARD |
|
|
48 | # define STACKGUARD 0 |
|
|
49 | #endif |
|
|
50 | |
|
|
51 | #ifdef HAVE_MMAP |
|
|
52 | # include <unistd.h> |
|
|
53 | # include <sys/mman.h> |
|
|
54 | # ifndef MAP_ANONYMOUS |
|
|
55 | # ifdef MAP_ANON |
|
|
56 | # define MAP_ANONYMOUS MAP_ANON |
|
|
57 | # else |
|
|
58 | # undef HAVE_MMAP |
|
|
59 | # endif |
|
|
60 | # endif |
82 | #endif |
61 | # include <limits.h> |
83 | |
62 | # ifndef PAGESIZE |
84 | #ifndef CORO_STACKGUARD |
63 | # define PAGESIZE pagesize |
85 | # define CORO_STACKGUARD 0 |
64 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
65 | static long pagesize; |
|
|
66 | # else |
|
|
67 | # define BOOT_PAGESIZE |
|
|
68 | # endif |
86 | #endif |
69 | #endif |
|
|
70 | |
87 | |
71 | /* The next macro should declare a variable stacklevel that contains and approximation |
88 | /* prefer perl internal functions over our own? */ |
72 | * to the current C stack pointer. Its property is that it changes with each call |
89 | #ifndef CORO_PREFER_PERL_FUNCTIONS |
73 | * and should be unique. */ |
90 | # define CORO_PREFER_PERL_FUNCTIONS 0 |
|
|
91 | #endif |
|
|
92 | |
|
|
93 | /* The next macros try to return the current stack pointer, in an as |
|
|
94 | * portable way as possible. */ |
74 | #define dSTACKLEVEL int stacklevel |
95 | #define dSTACKLEVEL volatile char stacklevel |
75 | #define STACKLEVEL ((void *)&stacklevel) |
96 | #define STACKLEVEL ((void *)&stacklevel) |
76 | |
97 | |
77 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
98 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
78 | |
99 | |
79 | #if __GNUC__ >= 3 |
100 | #if __GNUC__ >= 3 |
80 | # define attribute(x) __attribute__(x) |
101 | # define attribute(x) __attribute__(x) |
|
|
102 | # define BARRIER __asm__ __volatile__ ("" : : : "memory") |
81 | #else |
103 | #else |
82 | # define attribute(x) |
104 | # define attribute(x) |
|
|
105 | # define BARRIER |
83 | #endif |
106 | #endif |
84 | |
107 | |
85 | #define NOINLINE attribute ((noinline)) |
108 | #define NOINLINE attribute ((noinline)) |
86 | |
109 | |
87 | #include "CoroAPI.h" |
110 | #include "CoroAPI.h" |
88 | |
|
|
89 | #define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */ |
|
|
90 | |
111 | |
91 | #ifdef USE_ITHREADS |
112 | #ifdef USE_ITHREADS |
92 | static perl_mutex coro_mutex; |
113 | static perl_mutex coro_mutex; |
93 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
114 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
94 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
115 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
95 | #else |
116 | #else |
96 | # define LOCK (void)0 |
117 | # define LOCK (void)0 |
97 | # define UNLOCK (void)0 |
118 | # define UNLOCK (void)0 |
98 | #endif |
119 | #endif |
99 | |
120 | |
|
|
121 | /* helper storage struct for Coro::AIO */ |
|
|
122 | struct io_state |
|
|
123 | { |
|
|
124 | int errorno; |
|
|
125 | I32 laststype; |
|
|
126 | int laststatval; |
|
|
127 | Stat_t statcache; |
|
|
128 | }; |
|
|
129 | |
|
|
130 | static size_t coro_stacksize = CORO_STACKSIZE; |
100 | static struct CoroAPI coroapi; |
131 | static struct CoroAPI coroapi; |
101 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
132 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
133 | static JMPENV *main_top_env; |
102 | static HV *coro_state_stash, *coro_stash; |
134 | static HV *coro_state_stash, *coro_stash; |
103 | static SV *coro_mortal; /* will be freed after next transfer */ |
135 | static SV *coro_mortal; /* will be freed after next transfer */ |
104 | |
136 | |
|
|
137 | /* async_pool helper stuff */ |
|
|
138 | static SV *sv_pool_rss; |
|
|
139 | static SV *sv_pool_size; |
|
|
140 | static AV *av_async_pool; |
|
|
141 | |
|
|
142 | static struct coro_cctx *cctx_first; |
|
|
143 | static int cctx_count, cctx_idle; |
|
|
144 | |
105 | /* this is a structure representing a c-level coroutine */ |
145 | /* this is a structure representing a c-level coroutine */ |
106 | typedef struct coro_stack { |
146 | typedef struct coro_cctx { |
107 | struct coro_stack *next; |
147 | struct coro_cctx *next; |
108 | |
148 | |
109 | /* the stack */ |
149 | /* the stack */ |
110 | void *sptr; |
150 | void *sptr; |
111 | long ssize; /* positive == mmap, otherwise malloc */ |
151 | size_t ssize; |
112 | |
152 | |
113 | /* cpu state */ |
153 | /* cpu state */ |
114 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
154 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
155 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
115 | JMPENV *top_env; |
156 | JMPENV *top_env; |
116 | coro_context cctx; |
157 | coro_context cctx; |
117 | |
158 | |
118 | #if USE_VALGRIND |
159 | #if CORO_USE_VALGRIND |
119 | int valgrind_id; |
160 | int valgrind_id; |
120 | #endif |
161 | #endif |
121 | } coro_stack; |
162 | char inuse, mapped; |
|
|
163 | } coro_cctx; |
|
|
164 | |
|
|
165 | enum { |
|
|
166 | CF_RUNNING = 0x0001, /* coroutine is running */ |
|
|
167 | CF_READY = 0x0002, /* coroutine is ready */ |
|
|
168 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
169 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
|
|
170 | }; |
122 | |
171 | |
123 | /* this is a structure representing a perl-level coroutine */ |
172 | /* this is a structure representing a perl-level coroutine */ |
124 | struct coro { |
173 | struct coro { |
125 | /* the c coroutine allocated to this perl coroutine, if any */ |
174 | /* the c coroutine allocated to this perl coroutine, if any */ |
126 | coro_stack *stack; |
175 | coro_cctx *cctx; |
127 | |
176 | |
128 | /* data associated with this coroutine (initial args) */ |
177 | /* data associated with this coroutine (initial args) */ |
129 | AV *args; |
178 | AV *args; |
130 | int refcnt; |
179 | int refcnt; |
|
|
180 | int save; /* CORO_SAVE flags */ |
|
|
181 | int flags; /* CF_ flags */ |
131 | |
182 | |
132 | /* optionally saved, might be zero */ |
183 | /* optionally saved, might be zero */ |
133 | AV *defav; |
184 | AV *defav; /* @_ */ |
134 | SV *defsv; |
185 | SV *defsv; /* $_ */ |
135 | SV *errsv; |
186 | SV *errsv; /* $@ */ |
|
|
187 | GV *deffh; /* default filehandle */ |
|
|
188 | SV *irssv; /* $/ */ |
|
|
189 | SV *irssv_sv; /* real $/ cache */ |
136 | |
190 | |
137 | /* saved global state not related to stacks */ |
191 | #define VAR(name,type) type name; |
138 | U8 dowarn; |
192 | # include "state.h" |
139 | I32 in_eval; |
193 | #undef VAR |
140 | |
|
|
141 | /* the stacks and related info (callchain etc..) */ |
|
|
142 | PERL_SI *curstackinfo; |
|
|
143 | AV *curstack; |
|
|
144 | AV *mainstack; |
|
|
145 | SV **stack_sp; |
|
|
146 | OP *op; |
|
|
147 | SV **curpad; |
|
|
148 | AV *comppad; |
|
|
149 | CV *compcv; |
|
|
150 | SV **stack_base; |
|
|
151 | SV **stack_max; |
|
|
152 | SV **tmps_stack; |
|
|
153 | I32 tmps_floor; |
|
|
154 | I32 tmps_ix; |
|
|
155 | I32 tmps_max; |
|
|
156 | I32 *markstack; |
|
|
157 | I32 *markstack_ptr; |
|
|
158 | I32 *markstack_max; |
|
|
159 | I32 *scopestack; |
|
|
160 | I32 scopestack_ix; |
|
|
161 | I32 scopestack_max; |
|
|
162 | ANY *savestack; |
|
|
163 | I32 savestack_ix; |
|
|
164 | I32 savestack_max; |
|
|
165 | OP **retstack; |
|
|
166 | I32 retstack_ix; |
|
|
167 | I32 retstack_max; |
|
|
168 | PMOP *curpm; |
|
|
169 | COP *curcop; |
|
|
170 | |
194 | |
171 | /* coro process data */ |
195 | /* coro process data */ |
172 | int prio; |
196 | int prio; |
|
|
197 | |
|
|
198 | /* linked list */ |
|
|
199 | struct coro *next, *prev; |
|
|
200 | HV *hv; /* the perl hash associated with this coro, if any */ |
173 | }; |
201 | }; |
174 | |
202 | |
175 | typedef struct coro *Coro__State; |
203 | typedef struct coro *Coro__State; |
176 | typedef struct coro *Coro__State_or_hashref; |
204 | typedef struct coro *Coro__State_or_hashref; |
177 | |
205 | |
|
|
206 | /** Coro ********************************************************************/ |
|
|
207 | |
|
|
208 | #define PRIO_MAX 3 |
|
|
209 | #define PRIO_HIGH 1 |
|
|
210 | #define PRIO_NORMAL 0 |
|
|
211 | #define PRIO_LOW -1 |
|
|
212 | #define PRIO_IDLE -3 |
|
|
213 | #define PRIO_MIN -4 |
|
|
214 | |
|
|
215 | /* for Coro.pm */ |
|
|
216 | static SV *coro_current; |
|
|
217 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
218 | static int coro_nready; |
|
|
219 | static struct coro *coro_first; |
|
|
220 | |
|
|
221 | /** lowlevel stuff **********************************************************/ |
|
|
222 | |
178 | static AV * |
223 | static AV * |
179 | coro_clone_padlist (CV *cv) |
224 | coro_clone_padlist (pTHX_ CV *cv) |
180 | { |
225 | { |
181 | AV *padlist = CvPADLIST (cv); |
226 | AV *padlist = CvPADLIST (cv); |
182 | AV *newpadlist, *newpad; |
227 | AV *newpadlist, *newpad; |
183 | |
228 | |
184 | newpadlist = newAV (); |
229 | newpadlist = newAV (); |
… | |
… | |
196 | |
241 | |
197 | return newpadlist; |
242 | return newpadlist; |
198 | } |
243 | } |
199 | |
244 | |
200 | static void |
245 | static void |
201 | free_padlist (AV *padlist) |
246 | free_padlist (pTHX_ AV *padlist) |
202 | { |
247 | { |
203 | /* may be during global destruction */ |
248 | /* may be during global destruction */ |
204 | if (SvREFCNT (padlist)) |
249 | if (SvREFCNT (padlist)) |
205 | { |
250 | { |
206 | I32 i = AvFILLp (padlist); |
251 | I32 i = AvFILLp (padlist); |
… | |
… | |
227 | AV *padlist; |
272 | AV *padlist; |
228 | AV *av = (AV *)mg->mg_obj; |
273 | AV *av = (AV *)mg->mg_obj; |
229 | |
274 | |
230 | /* casting is fun. */ |
275 | /* casting is fun. */ |
231 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
276 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
232 | free_padlist (padlist); |
277 | free_padlist (aTHX_ padlist); |
233 | |
278 | |
234 | SvREFCNT_dec (av); |
279 | SvREFCNT_dec (av); |
235 | |
280 | |
236 | return 0; |
281 | return 0; |
237 | } |
282 | } |
238 | |
283 | |
239 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
284 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
240 | |
285 | |
241 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
286 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
242 | |
287 | |
|
|
288 | #define CORO_MAGIC(cv) \ |
|
|
289 | SvMAGIC (cv) \ |
|
|
290 | ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \ |
|
|
291 | ? SvMAGIC (cv) \ |
|
|
292 | : mg_find ((SV *)cv, PERL_MAGIC_coro) \ |
|
|
293 | : 0 |
|
|
294 | |
243 | /* the next two functions merely cache the padlists */ |
295 | /* the next two functions merely cache the padlists */ |
244 | static void |
296 | static void |
245 | get_padlist (CV *cv) |
297 | get_padlist (pTHX_ CV *cv) |
246 | { |
298 | { |
247 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
299 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
300 | AV *av; |
248 | |
301 | |
249 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
302 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
250 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
303 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
251 | else |
304 | else |
252 | { |
305 | { |
253 | #if 0 |
306 | #if CORO_PREFER_PERL_FUNCTIONS |
254 | /* this is probably cleaner, but also slower? */ |
307 | /* this is probably cleaner, but also slower? */ |
255 | CV *cp = Perl_cv_clone (cv); |
308 | CV *cp = Perl_cv_clone (cv); |
256 | CvPADLIST (cv) = CvPADLIST (cp); |
309 | CvPADLIST (cv) = CvPADLIST (cp); |
257 | CvPADLIST (cp) = 0; |
310 | CvPADLIST (cp) = 0; |
258 | SvREFCNT_dec (cp); |
311 | SvREFCNT_dec (cp); |
259 | #else |
312 | #else |
260 | CvPADLIST (cv) = coro_clone_padlist (cv); |
313 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
261 | #endif |
314 | #endif |
262 | } |
315 | } |
263 | } |
316 | } |
264 | |
317 | |
265 | static void |
318 | static void |
266 | put_padlist (CV *cv) |
319 | put_padlist (pTHX_ CV *cv) |
267 | { |
320 | { |
268 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
321 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
322 | AV *av; |
269 | |
323 | |
270 | if (!mg) |
324 | if (!mg) |
271 | { |
325 | { |
272 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
326 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
273 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
327 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
274 | mg->mg_virtual = &vtbl_coro; |
328 | mg->mg_virtual = &vtbl_coro; |
275 | mg->mg_obj = (SV *)newAV (); |
329 | mg->mg_obj = (SV *)newAV (); |
276 | } |
330 | } |
277 | |
331 | |
278 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
332 | av = (AV *)mg->mg_obj; |
|
|
333 | |
|
|
334 | if (AvFILLp (av) >= AvMAX (av)) |
|
|
335 | av_extend (av, AvMAX (av) + 1); |
|
|
336 | |
|
|
337 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
279 | } |
338 | } |
|
|
339 | |
|
|
340 | /** load & save, init *******************************************************/ |
280 | |
341 | |
281 | #define SB do { |
342 | #define SB do { |
282 | #define SE } while (0) |
343 | #define SE } while (0) |
283 | |
344 | |
284 | #define LOAD(state) load_state((state)); |
|
|
285 | #define SAVE(state,flags) save_state((state),(flags)); |
|
|
286 | |
|
|
287 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
345 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
288 | |
346 | |
289 | static void |
347 | static void |
290 | load_state(Coro__State c) |
348 | load_perl (pTHX_ Coro__State c) |
291 | { |
349 | { |
292 | PL_dowarn = c->dowarn; |
350 | #define VAR(name,type) PL_ ## name = c->name; |
293 | PL_in_eval = c->in_eval; |
351 | # include "state.h" |
294 | |
352 | #undef VAR |
295 | PL_curstackinfo = c->curstackinfo; |
|
|
296 | PL_curstack = c->curstack; |
|
|
297 | PL_mainstack = c->mainstack; |
|
|
298 | PL_stack_sp = c->stack_sp; |
|
|
299 | PL_op = c->op; |
|
|
300 | PL_curpad = c->curpad; |
|
|
301 | PL_comppad = c->comppad; |
|
|
302 | PL_compcv = c->compcv; |
|
|
303 | PL_stack_base = c->stack_base; |
|
|
304 | PL_stack_max = c->stack_max; |
|
|
305 | PL_tmps_stack = c->tmps_stack; |
|
|
306 | PL_tmps_floor = c->tmps_floor; |
|
|
307 | PL_tmps_ix = c->tmps_ix; |
|
|
308 | PL_tmps_max = c->tmps_max; |
|
|
309 | PL_markstack = c->markstack; |
|
|
310 | PL_markstack_ptr = c->markstack_ptr; |
|
|
311 | PL_markstack_max = c->markstack_max; |
|
|
312 | PL_scopestack = c->scopestack; |
|
|
313 | PL_scopestack_ix = c->scopestack_ix; |
|
|
314 | PL_scopestack_max = c->scopestack_max; |
|
|
315 | PL_savestack = c->savestack; |
|
|
316 | PL_savestack_ix = c->savestack_ix; |
|
|
317 | PL_savestack_max = c->savestack_max; |
|
|
318 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
319 | PL_retstack = c->retstack; |
|
|
320 | PL_retstack_ix = c->retstack_ix; |
|
|
321 | PL_retstack_max = c->retstack_max; |
|
|
322 | #endif |
|
|
323 | PL_curpm = c->curpm; |
|
|
324 | PL_curcop = c->curcop; |
|
|
325 | |
353 | |
326 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
354 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
327 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
355 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
328 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
356 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
|
|
357 | if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh); |
|
|
358 | |
|
|
359 | if (c->irssv) |
|
|
360 | { |
|
|
361 | if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv)) |
|
|
362 | { |
|
|
363 | SvREFCNT_dec (c->irssv); |
|
|
364 | c->irssv = 0; |
|
|
365 | } |
|
|
366 | else |
|
|
367 | { |
|
|
368 | REPLACE_SV (PL_rs, c->irssv); |
|
|
369 | if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0); |
|
|
370 | sv_setsv (c->irssv_sv, PL_rs); |
|
|
371 | } |
|
|
372 | } |
329 | |
373 | |
330 | { |
374 | { |
331 | dSP; |
375 | dSP; |
332 | CV *cv; |
376 | CV *cv; |
333 | |
377 | |
334 | /* now do the ugly restore mess */ |
378 | /* now do the ugly restore mess */ |
335 | while ((cv = (CV *)POPs)) |
379 | while ((cv = (CV *)POPs)) |
336 | { |
380 | { |
337 | AV *padlist = (AV *)POPs; |
|
|
338 | |
|
|
339 | if (padlist) |
|
|
340 | { |
|
|
341 | put_padlist (cv); /* mark this padlist as available */ |
381 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
342 | CvPADLIST(cv) = padlist; |
382 | CvDEPTH (cv) = PTR2IV (POPs); |
343 | } |
383 | CvPADLIST (cv) = (AV *)POPs; |
344 | |
|
|
345 | ++CvDEPTH(cv); |
|
|
346 | } |
384 | } |
347 | |
385 | |
348 | PUTBACK; |
386 | PUTBACK; |
349 | } |
387 | } |
350 | } |
388 | } |
351 | |
389 | |
352 | static void |
390 | static void |
353 | save_state(Coro__State c, int flags) |
391 | save_perl (pTHX_ Coro__State c) |
354 | { |
392 | { |
355 | { |
393 | { |
356 | dSP; |
394 | dSP; |
357 | I32 cxix = cxstack_ix; |
395 | I32 cxix = cxstack_ix; |
358 | PERL_CONTEXT *ccstk = cxstack; |
396 | PERL_CONTEXT *ccstk = cxstack; |
… | |
… | |
361 | /* |
399 | /* |
362 | * the worst thing you can imagine happens first - we have to save |
400 | * the worst thing you can imagine happens first - we have to save |
363 | * (and reinitialize) all cv's in the whole callchain :( |
401 | * (and reinitialize) all cv's in the whole callchain :( |
364 | */ |
402 | */ |
365 | |
403 | |
366 | PUSHs (Nullsv); |
404 | XPUSHs (Nullsv); |
367 | /* this loop was inspired by pp_caller */ |
405 | /* this loop was inspired by pp_caller */ |
368 | for (;;) |
406 | for (;;) |
369 | { |
407 | { |
370 | while (cxix >= 0) |
408 | while (cxix >= 0) |
371 | { |
409 | { |
372 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
410 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
373 | |
411 | |
374 | if (CxTYPE(cx) == CXt_SUB) |
412 | if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT) |
375 | { |
413 | { |
376 | CV *cv = cx->blk_sub.cv; |
414 | CV *cv = cx->blk_sub.cv; |
|
|
415 | |
377 | if (CvDEPTH(cv)) |
416 | if (CvDEPTH (cv)) |
378 | { |
417 | { |
379 | EXTEND (SP, CvDEPTH(cv)*2); |
418 | EXTEND (SP, 3); |
380 | |
|
|
381 | while (--CvDEPTH(cv)) |
|
|
382 | { |
|
|
383 | /* this tells the restore code to increment CvDEPTH */ |
|
|
384 | PUSHs (Nullsv); |
|
|
385 | PUSHs ((SV *)cv); |
|
|
386 | } |
|
|
387 | |
|
|
388 | PUSHs ((SV *)CvPADLIST(cv)); |
419 | PUSHs ((SV *)CvPADLIST (cv)); |
|
|
420 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
389 | PUSHs ((SV *)cv); |
421 | PUSHs ((SV *)cv); |
390 | |
422 | |
|
|
423 | CvDEPTH (cv) = 0; |
391 | get_padlist (cv); |
424 | get_padlist (aTHX_ cv); |
392 | } |
425 | } |
393 | } |
426 | } |
394 | #ifdef CXt_FORMAT |
|
|
395 | else if (CxTYPE(cx) == CXt_FORMAT) |
|
|
396 | { |
|
|
397 | /* I never used formats, so how should I know how these are implemented? */ |
|
|
398 | /* my bold guess is as a simple, plain sub... */ |
|
|
399 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
|
|
400 | } |
|
|
401 | #endif |
|
|
402 | } |
427 | } |
403 | |
428 | |
404 | if (top_si->si_type == PERLSI_MAIN) |
429 | if (top_si->si_type == PERLSI_MAIN) |
405 | break; |
430 | break; |
406 | |
431 | |
407 | top_si = top_si->si_prev; |
432 | top_si = top_si->si_prev; |
408 | ccstk = top_si->si_cxstack; |
433 | ccstk = top_si->si_cxstack; |
409 | cxix = top_si->si_cxix; |
434 | cxix = top_si->si_cxix; |
410 | } |
435 | } |
411 | |
436 | |
412 | PUTBACK; |
437 | PUTBACK; |
413 | } |
438 | } |
414 | |
439 | |
415 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
440 | c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
416 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
441 | c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
417 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
442 | c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
|
|
443 | c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0; |
|
|
444 | c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0; |
418 | |
445 | |
419 | c->dowarn = PL_dowarn; |
446 | #define VAR(name,type)c->name = PL_ ## name; |
420 | c->in_eval = PL_in_eval; |
447 | # include "state.h" |
421 | |
448 | #undef VAR |
422 | c->curstackinfo = PL_curstackinfo; |
|
|
423 | c->curstack = PL_curstack; |
|
|
424 | c->mainstack = PL_mainstack; |
|
|
425 | c->stack_sp = PL_stack_sp; |
|
|
426 | c->op = PL_op; |
|
|
427 | c->curpad = PL_curpad; |
|
|
428 | c->comppad = PL_comppad; |
|
|
429 | c->compcv = PL_compcv; |
|
|
430 | c->stack_base = PL_stack_base; |
|
|
431 | c->stack_max = PL_stack_max; |
|
|
432 | c->tmps_stack = PL_tmps_stack; |
|
|
433 | c->tmps_floor = PL_tmps_floor; |
|
|
434 | c->tmps_ix = PL_tmps_ix; |
|
|
435 | c->tmps_max = PL_tmps_max; |
|
|
436 | c->markstack = PL_markstack; |
|
|
437 | c->markstack_ptr = PL_markstack_ptr; |
|
|
438 | c->markstack_max = PL_markstack_max; |
|
|
439 | c->scopestack = PL_scopestack; |
|
|
440 | c->scopestack_ix = PL_scopestack_ix; |
|
|
441 | c->scopestack_max = PL_scopestack_max; |
|
|
442 | c->savestack = PL_savestack; |
|
|
443 | c->savestack_ix = PL_savestack_ix; |
|
|
444 | c->savestack_max = PL_savestack_max; |
|
|
445 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
446 | c->retstack = PL_retstack; |
|
|
447 | c->retstack_ix = PL_retstack_ix; |
|
|
448 | c->retstack_max = PL_retstack_max; |
|
|
449 | #endif |
|
|
450 | c->curpm = PL_curpm; |
|
|
451 | c->curcop = PL_curcop; |
|
|
452 | } |
449 | } |
453 | |
450 | |
454 | /* |
451 | /* |
455 | * allocate various perl stacks. This is an exact copy |
452 | * allocate various perl stacks. This is an exact copy |
456 | * of perl.c:init_stacks, except that it uses less memory |
453 | * of perl.c:init_stacks, except that it uses less memory |
457 | * on the (sometimes correct) assumption that coroutines do |
454 | * on the (sometimes correct) assumption that coroutines do |
458 | * not usually need a lot of stackspace. |
455 | * not usually need a lot of stackspace. |
459 | */ |
456 | */ |
|
|
457 | #if CORO_PREFER_PERL_FUNCTIONS |
|
|
458 | # define coro_init_stacks init_stacks |
|
|
459 | #else |
460 | static void |
460 | static void |
461 | coro_init_stacks () |
461 | coro_init_stacks (pTHX) |
462 | { |
462 | { |
463 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
463 | PL_curstackinfo = new_stackinfo(64, 6); |
464 | PL_curstackinfo->si_type = PERLSI_MAIN; |
464 | PL_curstackinfo->si_type = PERLSI_MAIN; |
465 | PL_curstack = PL_curstackinfo->si_stack; |
465 | PL_curstack = PL_curstackinfo->si_stack; |
466 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
466 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
467 | |
467 | |
468 | PL_stack_base = AvARRAY(PL_curstack); |
468 | PL_stack_base = AvARRAY(PL_curstack); |
469 | PL_stack_sp = PL_stack_base; |
469 | PL_stack_sp = PL_stack_base; |
470 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
470 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
471 | |
471 | |
472 | New(50,PL_tmps_stack,96,SV*); |
472 | New(50,PL_tmps_stack,64,SV*); |
473 | PL_tmps_floor = -1; |
473 | PL_tmps_floor = -1; |
474 | PL_tmps_ix = -1; |
474 | PL_tmps_ix = -1; |
475 | PL_tmps_max = 96; |
475 | PL_tmps_max = 64; |
476 | |
476 | |
477 | New(54,PL_markstack,16,I32); |
477 | New(54,PL_markstack,16,I32); |
478 | PL_markstack_ptr = PL_markstack; |
478 | PL_markstack_ptr = PL_markstack; |
479 | PL_markstack_max = PL_markstack + 16; |
479 | PL_markstack_max = PL_markstack + 16; |
480 | |
480 | |
… | |
… | |
484 | |
484 | |
485 | New(54,PL_scopestack,16,I32); |
485 | New(54,PL_scopestack,16,I32); |
486 | PL_scopestack_ix = 0; |
486 | PL_scopestack_ix = 0; |
487 | PL_scopestack_max = 16; |
487 | PL_scopestack_max = 16; |
488 | |
488 | |
489 | New(54,PL_savestack,96,ANY); |
489 | New(54,PL_savestack,64,ANY); |
490 | PL_savestack_ix = 0; |
490 | PL_savestack_ix = 0; |
491 | PL_savestack_max = 96; |
491 | PL_savestack_max = 64; |
492 | |
492 | |
493 | #if !PERL_VERSION_ATLEAST (5,9,0) |
493 | #if !PERL_VERSION_ATLEAST (5,9,0) |
494 | New(54,PL_retstack,8,OP*); |
494 | New(54,PL_retstack,4,OP*); |
495 | PL_retstack_ix = 0; |
495 | PL_retstack_ix = 0; |
496 | PL_retstack_max = 8; |
496 | PL_retstack_max = 4; |
497 | #endif |
497 | #endif |
498 | } |
498 | } |
|
|
499 | #endif |
499 | |
500 | |
500 | /* |
501 | /* |
501 | * destroy the stacks, the callchain etc... |
502 | * destroy the stacks, the callchain etc... |
502 | */ |
503 | */ |
503 | static void |
504 | static void |
504 | coro_destroy_stacks() |
505 | coro_destroy_stacks (pTHX) |
505 | { |
506 | { |
506 | if (!IN_DESTRUCT) |
507 | if (!IN_DESTRUCT) |
507 | { |
508 | { |
508 | /* is this ugly, I ask? */ |
509 | /* restore all saved variables and stuff */ |
509 | LEAVE_SCOPE (0); |
510 | LEAVE_SCOPE (0); |
|
|
511 | assert (PL_tmps_floor == -1); |
510 | |
512 | |
511 | /* sure it is, but more important: is it correct?? :/ */ |
513 | /* free all temporaries */ |
512 | FREETMPS; |
514 | FREETMPS; |
|
|
515 | assert (PL_tmps_ix == -1); |
513 | |
516 | |
|
|
517 | /* unwind all extra stacks */ |
514 | /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ |
518 | POPSTACK_TO (PL_mainstack); |
|
|
519 | |
|
|
520 | /* unwind main stack */ |
|
|
521 | dounwind (-1); |
515 | } |
522 | } |
516 | |
523 | |
517 | while (PL_curstackinfo->si_next) |
524 | while (PL_curstackinfo->si_next) |
518 | PL_curstackinfo = PL_curstackinfo->si_next; |
525 | PL_curstackinfo = PL_curstackinfo->si_next; |
519 | |
526 | |
520 | while (PL_curstackinfo) |
527 | while (PL_curstackinfo) |
521 | { |
528 | { |
522 | PERL_SI *p = PL_curstackinfo->si_prev; |
529 | PERL_SI *p = PL_curstackinfo->si_prev; |
523 | |
530 | |
524 | { /*D*//*remove*/ |
|
|
525 | dSP; |
|
|
526 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
|
|
527 | PUTBACK; /* possibly superfluous */ |
|
|
528 | } |
|
|
529 | |
|
|
530 | if (!IN_DESTRUCT) |
531 | if (!IN_DESTRUCT) |
531 | { |
|
|
532 | dounwind (-1);/*D*//*remove*/ |
|
|
533 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
532 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
534 | } |
|
|
535 | |
533 | |
536 | Safefree (PL_curstackinfo->si_cxstack); |
534 | Safefree (PL_curstackinfo->si_cxstack); |
537 | Safefree (PL_curstackinfo); |
535 | Safefree (PL_curstackinfo); |
538 | PL_curstackinfo = p; |
536 | PL_curstackinfo = p; |
539 | } |
537 | } |
… | |
… | |
545 | #if !PERL_VERSION_ATLEAST (5,9,0) |
543 | #if !PERL_VERSION_ATLEAST (5,9,0) |
546 | Safefree (PL_retstack); |
544 | Safefree (PL_retstack); |
547 | #endif |
545 | #endif |
548 | } |
546 | } |
549 | |
547 | |
|
|
548 | static size_t |
|
|
549 | coro_rss (struct coro *coro) |
|
|
550 | { |
|
|
551 | size_t rss = sizeof (coro); |
|
|
552 | |
|
|
553 | if (coro->mainstack) |
|
|
554 | { |
|
|
555 | if (coro->flags & CF_RUNNING) |
|
|
556 | { |
|
|
557 | #define VAR(name,type)coro->name = PL_ ## name; |
|
|
558 | # include "state.h" |
|
|
559 | #undef VAR |
|
|
560 | } |
|
|
561 | |
|
|
562 | rss += sizeof (coro->curstackinfo); |
|
|
563 | rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *); |
|
|
564 | rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT); |
|
|
565 | rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *); |
|
|
566 | rss += coro->tmps_max * sizeof (SV *); |
|
|
567 | rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32); |
|
|
568 | rss += coro->scopestack_max * sizeof (I32); |
|
|
569 | rss += coro->savestack_max * sizeof (ANY); |
|
|
570 | |
|
|
571 | #if !PERL_VERSION_ATLEAST (5,9,0) |
|
|
572 | rss += coro->retstack_max * sizeof (OP *); |
|
|
573 | #endif |
|
|
574 | } |
|
|
575 | |
|
|
576 | return rss; |
|
|
577 | } |
|
|
578 | |
|
|
579 | /** coroutine stack handling ************************************************/ |
|
|
580 | |
550 | static void |
581 | static void |
551 | setup_coro (struct coro *coro) |
582 | setup_coro (pTHX_ struct coro *coro) |
552 | { |
583 | { |
553 | /* |
584 | /* |
554 | * emulate part of the perl startup here. |
585 | * emulate part of the perl startup here. |
555 | */ |
586 | */ |
556 | |
|
|
557 | coro_init_stacks (); |
587 | coro_init_stacks (aTHX); |
558 | |
588 | |
|
|
589 | PL_curcop = &PL_compiling; |
|
|
590 | PL_in_eval = EVAL_NULL; |
559 | PL_curcop = 0; |
591 | PL_comppad = 0; |
560 | PL_in_eval = 0; |
|
|
561 | PL_curpm = 0; |
592 | PL_curpm = 0; |
|
|
593 | PL_localizing = 0; |
|
|
594 | PL_dirty = 0; |
|
|
595 | PL_restartop = 0; |
562 | |
596 | |
563 | { |
597 | { |
564 | dSP; |
598 | dSP; |
565 | LOGOP myop; |
599 | LOGOP myop; |
566 | |
600 | |
567 | /* I have no idea why this is needed, but it is */ |
|
|
568 | PUSHMARK (SP); |
|
|
569 | |
|
|
570 | SvREFCNT_dec (GvAV (PL_defgv)); |
601 | SvREFCNT_dec (GvAV (PL_defgv)); |
571 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
602 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
572 | |
603 | |
573 | Zero (&myop, 1, LOGOP); |
604 | Zero (&myop, 1, LOGOP); |
574 | myop.op_next = Nullop; |
605 | myop.op_next = Nullop; |
575 | myop.op_flags = OPf_WANT_VOID; |
606 | myop.op_flags = OPf_WANT_VOID; |
576 | |
607 | |
|
|
608 | PUSHMARK (SP); |
|
|
609 | XPUSHs (av_shift (GvAV (PL_defgv))); |
|
|
610 | PUTBACK; |
577 | PL_op = (OP *)&myop; |
611 | PL_op = (OP *)&myop; |
578 | |
|
|
579 | PUSHMARK (SP); |
|
|
580 | XPUSHs ((SV *)get_cv ("Coro::State::coro_init", FALSE)); |
|
|
581 | PUTBACK; |
|
|
582 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
612 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
583 | SPAGAIN; |
613 | SPAGAIN; |
584 | |
|
|
585 | ENTER; /* necessary e.g. for dounwind */ |
|
|
586 | } |
614 | } |
587 | } |
|
|
588 | |
615 | |
|
|
616 | ENTER; /* necessary e.g. for dounwind */ |
|
|
617 | } |
|
|
618 | |
589 | static void |
619 | static void |
590 | free_coro_mortal () |
620 | free_coro_mortal (pTHX) |
591 | { |
621 | { |
592 | if (coro_mortal) |
622 | if (coro_mortal) |
593 | { |
623 | { |
594 | SvREFCNT_dec (coro_mortal); |
624 | SvREFCNT_dec (coro_mortal); |
595 | coro_mortal = 0; |
625 | coro_mortal = 0; |
596 | } |
626 | } |
597 | } |
627 | } |
598 | |
628 | |
|
|
629 | /* inject a fake call to Coro::State::_cctx_init into the execution */ |
|
|
630 | /* _cctx_init should be careful, as it could be called at almost any time */ |
|
|
631 | /* during execution of a perl program */ |
599 | static void NOINLINE |
632 | static void NOINLINE |
600 | prepare_cctx (coro_stack *cctx) |
633 | prepare_cctx (pTHX_ coro_cctx *cctx) |
601 | { |
634 | { |
602 | dSP; |
635 | dSP; |
603 | LOGOP myop; |
636 | LOGOP myop; |
604 | |
637 | |
605 | Zero (&myop, 1, LOGOP); |
638 | Zero (&myop, 1, LOGOP); |
606 | myop.op_next = PL_op; |
639 | myop.op_next = PL_op; |
607 | myop.op_flags = OPf_WANT_VOID; |
640 | myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
608 | |
|
|
609 | sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV (cctx)); |
|
|
610 | |
641 | |
611 | PUSHMARK (SP); |
642 | PUSHMARK (SP); |
|
|
643 | EXTEND (SP, 2); |
|
|
644 | PUSHs (sv_2mortal (newSViv (PTR2IV (cctx)))); |
612 | XPUSHs ((SV *)get_cv ("Coro::State::cctx_init", FALSE)); |
645 | PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
613 | PUTBACK; |
646 | PUTBACK; |
|
|
647 | PL_op = (OP *)&myop; |
614 | PL_restartop = PL_ppaddr[OP_ENTERSUB](aTHX); |
648 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
615 | SPAGAIN; |
649 | SPAGAIN; |
616 | } |
650 | } |
617 | |
651 | |
|
|
652 | /* |
|
|
653 | * this is a _very_ stripped down perl interpreter ;) |
|
|
654 | */ |
618 | static void |
655 | static void |
619 | coro_run (void *arg) |
656 | coro_run (void *arg) |
620 | { |
657 | { |
|
|
658 | dTHX; |
|
|
659 | |
621 | /* coro_run is the alternative epilogue of transfer() */ |
660 | /* coro_run is the alternative tail of transfer(), so unlock here. */ |
622 | UNLOCK; |
661 | UNLOCK; |
623 | |
662 | |
|
|
663 | PL_top_env = &PL_start_env; |
|
|
664 | |
|
|
665 | /* inject a fake subroutine call to cctx_init */ |
|
|
666 | prepare_cctx (aTHX_ (coro_cctx *)arg); |
|
|
667 | |
|
|
668 | /* somebody or something will hit me for both perl_run and PL_restartop */ |
|
|
669 | PL_restartop = PL_op; |
|
|
670 | perl_run (PL_curinterp); |
|
|
671 | |
624 | /* |
672 | /* |
625 | * this is a _very_ stripped down perl interpreter ;) |
673 | * If perl-run returns we assume exit() was being called or the coro |
|
|
674 | * fell off the end, which seems to be the only valid (non-bug) |
|
|
675 | * reason for perl_run to return. We try to exit by jumping to the |
|
|
676 | * bootstrap-time "top" top_env, as we cannot restore the "main" |
|
|
677 | * coroutine as Coro has no such concept |
626 | */ |
678 | */ |
627 | PL_top_env = &PL_start_env; |
679 | PL_top_env = main_top_env; |
628 | /* inject call to cctx_init */ |
680 | JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */ |
629 | prepare_cctx ((coro_stack *)arg); |
|
|
630 | |
|
|
631 | /* somebody will hit me for both perl_run and PL_restartop */ |
|
|
632 | perl_run (PL_curinterp); |
|
|
633 | |
|
|
634 | fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr); |
|
|
635 | abort (); |
|
|
636 | } |
681 | } |
637 | |
682 | |
638 | static coro_stack * |
683 | static coro_cctx * |
639 | stack_new () |
684 | cctx_new () |
640 | { |
685 | { |
641 | coro_stack *stack; |
686 | coro_cctx *cctx; |
|
|
687 | void *stack_start; |
|
|
688 | size_t stack_size; |
642 | |
689 | |
|
|
690 | ++cctx_count; |
|
|
691 | |
643 | New (0, stack, 1, coro_stack); |
692 | Newz (0, cctx, 1, coro_cctx); |
644 | |
693 | |
645 | #if HAVE_MMAP |
694 | #if HAVE_MMAP |
646 | |
695 | |
647 | stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; |
696 | cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE; |
648 | /* mmap suppsedly does allocate-on-write for us */ |
697 | /* mmap supposedly does allocate-on-write for us */ |
649 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
698 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
650 | |
699 | |
651 | if (stack->sptr == (void *)-1) |
700 | if (cctx->sptr != (void *)-1) |
652 | { |
|
|
653 | perror ("FATAL: unable to mmap stack for coroutine"); |
|
|
654 | _exit (EXIT_FAILURE); |
|
|
655 | } |
701 | { |
656 | |
|
|
657 | # if STACKGUARD |
702 | # if CORO_STACKGUARD |
658 | mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
703 | mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE); |
659 | # endif |
704 | # endif |
660 | |
705 | stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr; |
661 | #else |
706 | stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE; |
662 | |
707 | cctx->mapped = 1; |
663 | stack->ssize = STACKSIZE * (long)sizeof (long); |
|
|
664 | New (0, stack->sptr, STACKSIZE, long); |
|
|
665 | |
|
|
666 | if (!stack->sptr) |
|
|
667 | { |
708 | } |
|
|
709 | else |
|
|
710 | #endif |
|
|
711 | { |
|
|
712 | cctx->ssize = coro_stacksize * (long)sizeof (long); |
|
|
713 | New (0, cctx->sptr, coro_stacksize, long); |
|
|
714 | |
|
|
715 | if (!cctx->sptr) |
|
|
716 | { |
668 | perror (stderr, "FATAL: unable to malloc stack for coroutine"); |
717 | perror ("FATAL: unable to allocate stack for coroutine"); |
669 | _exit (EXIT_FAILURE); |
718 | _exit (EXIT_FAILURE); |
670 | } |
719 | } |
671 | |
720 | |
672 | #endif |
721 | stack_start = cctx->sptr; |
|
|
722 | stack_size = cctx->ssize; |
|
|
723 | } |
673 | |
724 | |
674 | #if USE_VALGRIND |
725 | REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size); |
675 | stack->valgrind_id = VALGRIND_STACK_REGISTER ( |
|
|
676 | STACKGUARD * PAGESIZE + (char *)stack->sptr, |
|
|
677 | stack->ssize + (char *)stack->sptr |
|
|
678 | ); |
|
|
679 | #endif |
|
|
680 | |
|
|
681 | coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize); |
726 | coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size); |
682 | |
727 | |
683 | return stack; |
728 | return cctx; |
684 | } |
729 | } |
685 | |
730 | |
686 | static void |
731 | static void |
687 | stack_free (coro_stack *stack) |
732 | cctx_destroy (coro_cctx *cctx) |
688 | { |
733 | { |
689 | if (!stack) |
734 | if (!cctx) |
690 | return; |
735 | return; |
691 | |
736 | |
|
|
737 | --cctx_count; |
|
|
738 | |
692 | #if USE_VALGRIND |
739 | #if CORO_USE_VALGRIND |
693 | VALGRIND_STACK_DEREGISTER (stack->valgrind_id); |
740 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
694 | #endif |
741 | #endif |
695 | |
742 | |
696 | #if HAVE_MMAP |
743 | #if HAVE_MMAP |
|
|
744 | if (cctx->mapped) |
697 | munmap (stack->sptr, stack->ssize); |
745 | munmap (cctx->sptr, cctx->ssize); |
698 | #else |
746 | else |
|
|
747 | #endif |
699 | Safefree (stack->sptr); |
748 | Safefree (cctx->sptr); |
700 | #endif |
|
|
701 | |
749 | |
702 | Safefree (stack); |
750 | Safefree (cctx); |
703 | } |
751 | } |
704 | |
752 | |
705 | static coro_stack *stack_first; |
|
|
706 | static int cctx_count, cctx_idle; |
|
|
707 | |
|
|
708 | static coro_stack * |
753 | static coro_cctx * |
709 | stack_get () |
754 | cctx_get (pTHX) |
710 | { |
755 | { |
711 | coro_stack *stack; |
756 | while (cctx_first) |
712 | |
|
|
713 | if (stack_first) |
|
|
714 | { |
757 | { |
|
|
758 | coro_cctx *cctx = cctx_first; |
|
|
759 | cctx_first = cctx->next; |
715 | --cctx_idle; |
760 | --cctx_idle; |
716 | stack = stack_first; |
761 | |
717 | stack_first = stack->next; |
762 | if (cctx->ssize >= coro_stacksize) |
|
|
763 | return cctx; |
|
|
764 | |
|
|
765 | cctx_destroy (cctx); |
718 | } |
766 | } |
719 | else |
767 | |
720 | { |
|
|
721 | ++cctx_count; |
|
|
722 | stack = stack_new (); |
|
|
723 | PL_op = PL_op->op_next; |
768 | PL_op = PL_op->op_next; |
|
|
769 | return cctx_new (); |
|
|
770 | } |
|
|
771 | |
|
|
772 | static void |
|
|
773 | cctx_put (coro_cctx *cctx) |
|
|
774 | { |
|
|
775 | /* free another cctx if overlimit */ |
|
|
776 | if (cctx_idle >= MAX_IDLE_CCTX) |
|
|
777 | { |
|
|
778 | coro_cctx *first = cctx_first; |
|
|
779 | cctx_first = first->next; |
|
|
780 | --cctx_idle; |
|
|
781 | |
|
|
782 | assert (!first->inuse); |
|
|
783 | cctx_destroy (first); |
724 | } |
784 | } |
725 | |
785 | |
726 | return stack; |
|
|
727 | } |
|
|
728 | |
|
|
729 | static void |
|
|
730 | stack_put (coro_stack *stack) |
|
|
731 | { |
|
|
732 | ++cctx_idle; |
786 | ++cctx_idle; |
733 | stack->next = stack_first; |
787 | cctx->next = cctx_first; |
734 | stack_first = stack; |
788 | cctx_first = cctx; |
735 | } |
789 | } |
|
|
790 | |
|
|
791 | /** coroutine switching *****************************************************/ |
736 | |
792 | |
737 | /* never call directly, always through the coro_state_transfer global variable */ |
793 | /* never call directly, always through the coro_state_transfer global variable */ |
738 | static void NOINLINE |
794 | static void NOINLINE |
739 | transfer (struct coro *prev, struct coro *next, int flags) |
795 | transfer (pTHX_ struct coro *prev, struct coro *next) |
740 | { |
796 | { |
741 | dSTACKLEVEL; |
797 | dSTACKLEVEL; |
742 | |
798 | |
743 | /* sometimes transfer is only called to set idle_sp */ |
799 | /* sometimes transfer is only called to set idle_sp */ |
744 | if (flags == TRANSFER_SET_STACKLEVEL) |
800 | if (!next) |
|
|
801 | { |
745 | ((coro_stack *)prev)->idle_sp = STACKLEVEL; |
802 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
|
|
803 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
|
|
804 | } |
746 | else if (prev != next) |
805 | else if (prev != next) |
747 | { |
806 | { |
748 | coro_stack *prev__stack; |
807 | coro_cctx *prev__cctx; |
|
|
808 | |
|
|
809 | if (prev->flags & CF_NEW) |
|
|
810 | { |
|
|
811 | /* create a new empty context */ |
|
|
812 | Newz (0, prev->cctx, 1, coro_cctx); |
|
|
813 | prev->cctx->inuse = 1; |
|
|
814 | prev->flags &= ~CF_NEW; |
|
|
815 | prev->flags |= CF_RUNNING; |
|
|
816 | } |
|
|
817 | |
|
|
818 | /*TODO: must not croak here */ |
|
|
819 | if (!prev->flags & CF_RUNNING) |
|
|
820 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
|
|
821 | |
|
|
822 | if (next->flags & CF_RUNNING) |
|
|
823 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
824 | |
|
|
825 | if (next->flags & CF_DESTROYED) |
|
|
826 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
|
|
827 | |
|
|
828 | prev->flags &= ~CF_RUNNING; |
|
|
829 | next->flags |= CF_RUNNING; |
749 | |
830 | |
750 | LOCK; |
831 | LOCK; |
751 | |
832 | |
752 | if (next->mainstack) |
833 | if (next->flags & CF_NEW) |
753 | { |
834 | { |
754 | /* coroutine already started */ |
835 | /* need to start coroutine */ |
755 | SAVE (prev, flags); |
836 | next->flags &= ~CF_NEW; |
756 | LOAD (next); |
837 | /* first get rid of the old state */ |
|
|
838 | save_perl (aTHX_ prev); |
|
|
839 | /* setup coroutine call */ |
|
|
840 | setup_coro (aTHX_ next); |
|
|
841 | /* need a new stack */ |
|
|
842 | assert (!next->cctx); |
757 | } |
843 | } |
758 | else |
844 | else |
759 | { |
845 | { |
760 | /* need to start coroutine */ |
846 | /* coroutine already started */ |
761 | /* first get rid of the old state */ |
847 | save_perl (aTHX_ prev); |
762 | SAVE (prev, -1); |
848 | load_perl (aTHX_ next); |
763 | /* setup coroutine call */ |
|
|
764 | setup_coro (next); |
|
|
765 | /* need a stack */ |
|
|
766 | next->stack = 0; |
|
|
767 | } |
849 | } |
768 | |
850 | |
769 | if (!prev->stack) |
|
|
770 | /* create a new empty context */ |
|
|
771 | Newz (0, prev->stack, 1, coro_stack); |
|
|
772 | |
|
|
773 | prev__stack = prev->stack; |
851 | prev__cctx = prev->cctx; |
774 | |
852 | |
775 | /* possibly "free" the stack */ |
853 | /* possibly "free" the cctx */ |
776 | if (prev__stack->idle_sp == STACKLEVEL) |
854 | if (prev__cctx->idle_sp == STACKLEVEL) |
777 | { |
855 | { |
778 | stack_put (prev__stack); |
856 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
|
|
857 | assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
|
|
858 | |
779 | prev->stack = 0; |
859 | prev->cctx = 0; |
|
|
860 | |
|
|
861 | cctx_put (prev__cctx); |
|
|
862 | prev__cctx->inuse = 0; |
780 | } |
863 | } |
781 | |
864 | |
782 | if (!next->stack) |
865 | if (!next->cctx) |
783 | next->stack = stack_get (); |
|
|
784 | |
|
|
785 | if (prev__stack != next->stack) |
|
|
786 | { |
866 | { |
787 | prev__stack->top_env = PL_top_env; |
867 | next->cctx = cctx_get (aTHX); |
788 | PL_top_env = next->stack->top_env; |
868 | assert (!next->cctx->inuse); |
789 | coro_transfer (&prev__stack->cctx, &next->stack->cctx); |
869 | next->cctx->inuse = 1; |
790 | } |
870 | } |
791 | |
871 | |
|
|
872 | if (prev__cctx != next->cctx) |
|
|
873 | { |
|
|
874 | prev__cctx->top_env = PL_top_env; |
|
|
875 | PL_top_env = next->cctx->top_env; |
|
|
876 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
877 | } |
|
|
878 | |
792 | free_coro_mortal (); |
879 | free_coro_mortal (aTHX); |
793 | |
|
|
794 | UNLOCK; |
880 | UNLOCK; |
795 | } |
881 | } |
796 | } |
882 | } |
797 | |
883 | |
798 | struct transfer_args |
884 | struct transfer_args |
799 | { |
885 | { |
800 | struct coro *prev, *next; |
886 | struct coro *prev, *next; |
801 | int flags; |
|
|
802 | }; |
887 | }; |
803 | |
888 | |
804 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags) |
889 | #define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next) |
805 | |
890 | |
|
|
891 | /** high level stuff ********************************************************/ |
|
|
892 | |
806 | static void |
893 | static int |
807 | coro_state_destroy (struct coro *coro) |
894 | coro_state_destroy (pTHX_ struct coro *coro) |
808 | { |
895 | { |
809 | if (coro->refcnt--) |
896 | if (coro->flags & CF_DESTROYED) |
810 | return; |
897 | return 0; |
|
|
898 | |
|
|
899 | coro->flags |= CF_DESTROYED; |
|
|
900 | |
|
|
901 | if (coro->flags & CF_READY) |
|
|
902 | { |
|
|
903 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
904 | /* alternative: look through all ready queues and remove the coro */ |
|
|
905 | LOCK; |
|
|
906 | --coro_nready; |
|
|
907 | UNLOCK; |
|
|
908 | } |
|
|
909 | else |
|
|
910 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
811 | |
911 | |
812 | if (coro->mainstack && coro->mainstack != main_mainstack) |
912 | if (coro->mainstack && coro->mainstack != main_mainstack) |
813 | { |
913 | { |
814 | struct coro temp; |
914 | struct coro temp; |
815 | |
915 | |
816 | SAVE ((&temp), TRANSFER_SAVE_ALL); |
916 | assert (!(coro->flags & CF_RUNNING)); |
817 | LOAD (coro); |
|
|
818 | |
917 | |
|
|
918 | Zero (&temp, 1, struct coro); |
|
|
919 | temp.save = CORO_SAVE_ALL; |
|
|
920 | |
|
|
921 | if (coro->flags & CF_RUNNING) |
|
|
922 | croak ("FATAL: tried to destroy currently running coroutine"); |
|
|
923 | |
|
|
924 | save_perl (aTHX_ &temp); |
|
|
925 | load_perl (aTHX_ coro); |
|
|
926 | |
819 | coro_destroy_stacks (); |
927 | coro_destroy_stacks (aTHX); |
820 | |
928 | |
821 | LOAD ((&temp)); /* this will get rid of defsv etc.. */ |
929 | load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */ |
822 | |
930 | |
823 | coro->mainstack = 0; |
931 | coro->mainstack = 0; |
824 | } |
932 | } |
825 | |
933 | |
826 | stack_free (coro->stack); |
934 | cctx_destroy (coro->cctx); |
827 | SvREFCNT_dec (coro->args); |
935 | SvREFCNT_dec (coro->args); |
828 | Safefree (coro); |
936 | |
|
|
937 | if (coro->next) coro->next->prev = coro->prev; |
|
|
938 | if (coro->prev) coro->prev->next = coro->next; |
|
|
939 | if (coro == coro_first) coro_first = coro->next; |
|
|
940 | |
|
|
941 | return 1; |
829 | } |
942 | } |
830 | |
943 | |
831 | static int |
944 | static int |
832 | coro_state_clear (pTHX_ SV *sv, MAGIC *mg) |
945 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
833 | { |
946 | { |
834 | struct coro *coro = (struct coro *)mg->mg_ptr; |
947 | struct coro *coro = (struct coro *)mg->mg_ptr; |
835 | mg->mg_ptr = 0; |
948 | mg->mg_ptr = 0; |
836 | |
949 | |
|
|
950 | coro->hv = 0; |
|
|
951 | |
|
|
952 | if (--coro->refcnt < 0) |
|
|
953 | { |
837 | coro_state_destroy (coro); |
954 | coro_state_destroy (aTHX_ coro); |
|
|
955 | Safefree (coro); |
|
|
956 | } |
838 | |
957 | |
839 | return 0; |
958 | return 0; |
840 | } |
959 | } |
841 | |
960 | |
842 | static int |
961 | static int |
… | |
… | |
849 | return 0; |
968 | return 0; |
850 | } |
969 | } |
851 | |
970 | |
852 | static MGVTBL coro_state_vtbl = { |
971 | static MGVTBL coro_state_vtbl = { |
853 | 0, 0, 0, 0, |
972 | 0, 0, 0, 0, |
854 | coro_state_clear, |
973 | coro_state_free, |
855 | 0, |
974 | 0, |
856 | #ifdef MGf_DUP |
975 | #ifdef MGf_DUP |
857 | coro_state_dup, |
976 | coro_state_dup, |
858 | #else |
977 | #else |
859 | # define MGf_DUP 0 |
978 | # define MGf_DUP 0 |
860 | #endif |
979 | #endif |
861 | }; |
980 | }; |
862 | |
981 | |
863 | static struct coro * |
982 | static struct coro * |
864 | SvSTATE (SV *coro) |
983 | SvSTATE_ (pTHX_ SV *coro) |
865 | { |
984 | { |
866 | HV *stash; |
985 | HV *stash; |
867 | MAGIC *mg; |
986 | MAGIC *mg; |
868 | |
987 | |
869 | if (SvROK (coro)) |
988 | if (SvROK (coro)) |
… | |
… | |
875 | /* very slow, but rare, check */ |
994 | /* very slow, but rare, check */ |
876 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
995 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
877 | croak ("Coro::State object required"); |
996 | croak ("Coro::State object required"); |
878 | } |
997 | } |
879 | |
998 | |
880 | mg = SvMAGIC (coro); |
999 | mg = CORO_MAGIC (coro); |
881 | assert (mg->mg_type == PERL_MAGIC_ext); |
|
|
882 | return (struct coro *)mg->mg_ptr; |
1000 | return (struct coro *)mg->mg_ptr; |
883 | } |
1001 | } |
884 | |
1002 | |
|
|
1003 | #define SvSTATE(sv) SvSTATE_ (aTHX_ (sv)) |
|
|
1004 | |
885 | static void |
1005 | static void |
886 | prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags) |
1006 | prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv) |
887 | { |
1007 | { |
888 | ta->prev = SvSTATE (prev); |
1008 | ta->prev = SvSTATE (prev_sv); |
889 | ta->next = SvSTATE (next); |
1009 | ta->next = SvSTATE (next_sv); |
890 | ta->flags = flags; |
|
|
891 | } |
1010 | } |
892 | |
1011 | |
893 | static void |
1012 | static void |
894 | api_transfer (SV *prev, SV *next, int flags) |
1013 | api_transfer (SV *prev_sv, SV *next_sv) |
895 | { |
1014 | { |
896 | dTHX; |
1015 | dTHX; |
897 | struct transfer_args ta; |
1016 | struct transfer_args ta; |
898 | |
1017 | |
899 | prepare_transfer (&ta, prev, next, flags); |
1018 | prepare_transfer (aTHX_ &ta, prev_sv, next_sv); |
900 | TRANSFER (ta); |
1019 | TRANSFER (ta); |
901 | } |
1020 | } |
902 | |
1021 | |
|
|
1022 | static int |
|
|
1023 | api_save (SV *coro_sv, int new_save) |
|
|
1024 | { |
|
|
1025 | dTHX; |
|
|
1026 | struct coro *coro = SvSTATE (coro_sv); |
|
|
1027 | int old_save = coro->save; |
|
|
1028 | |
|
|
1029 | if (new_save >= 0) |
|
|
1030 | coro->save = new_save; |
|
|
1031 | |
|
|
1032 | return old_save; |
|
|
1033 | } |
|
|
1034 | |
903 | /** Coro ********************************************************************/ |
1035 | /** Coro ********************************************************************/ |
904 | |
1036 | |
905 | #define PRIO_MAX 3 |
|
|
906 | #define PRIO_HIGH 1 |
|
|
907 | #define PRIO_NORMAL 0 |
|
|
908 | #define PRIO_LOW -1 |
|
|
909 | #define PRIO_IDLE -3 |
|
|
910 | #define PRIO_MIN -4 |
|
|
911 | |
|
|
912 | /* for Coro.pm */ |
|
|
913 | static GV *coro_current, *coro_idle; |
|
|
914 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
915 | static int coro_nready; |
|
|
916 | |
|
|
917 | static void |
1037 | static void |
918 | coro_enq (SV *sv) |
1038 | coro_enq (pTHX_ SV *coro_sv) |
919 | { |
1039 | { |
920 | int prio; |
|
|
921 | |
|
|
922 | if (SvTYPE (sv) != SVt_PVHV) |
|
|
923 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
924 | |
|
|
925 | prio = SvSTATE (sv)->prio; |
|
|
926 | |
|
|
927 | av_push (coro_ready [prio - PRIO_MIN], sv); |
1040 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
928 | coro_nready++; |
|
|
929 | } |
1041 | } |
930 | |
1042 | |
931 | static SV * |
1043 | static SV * |
932 | coro_deq (int min_prio) |
1044 | coro_deq (pTHX_ int min_prio) |
933 | { |
1045 | { |
934 | int prio = PRIO_MAX - PRIO_MIN; |
1046 | int prio = PRIO_MAX - PRIO_MIN; |
935 | |
1047 | |
936 | min_prio -= PRIO_MIN; |
1048 | min_prio -= PRIO_MIN; |
937 | if (min_prio < 0) |
1049 | if (min_prio < 0) |
938 | min_prio = 0; |
1050 | min_prio = 0; |
939 | |
1051 | |
940 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
1052 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
941 | if (AvFILLp (coro_ready [prio]) >= 0) |
1053 | if (AvFILLp (coro_ready [prio]) >= 0) |
942 | { |
|
|
943 | coro_nready--; |
|
|
944 | return av_shift (coro_ready [prio]); |
1054 | return av_shift (coro_ready [prio]); |
945 | } |
|
|
946 | |
1055 | |
947 | return 0; |
1056 | return 0; |
948 | } |
1057 | } |
949 | |
1058 | |
950 | static void |
1059 | static int |
951 | api_ready (SV *coro) |
1060 | api_ready (SV *coro_sv) |
952 | { |
1061 | { |
953 | dTHX; |
1062 | dTHX; |
|
|
1063 | struct coro *coro; |
954 | |
1064 | |
955 | if (SvROK (coro)) |
1065 | if (SvROK (coro_sv)) |
956 | coro = SvRV (coro); |
1066 | coro_sv = SvRV (coro_sv); |
|
|
1067 | |
|
|
1068 | coro = SvSTATE (coro_sv); |
|
|
1069 | |
|
|
1070 | if (coro->flags & CF_READY) |
|
|
1071 | return 0; |
|
|
1072 | |
|
|
1073 | coro->flags |= CF_READY; |
957 | |
1074 | |
958 | LOCK; |
1075 | LOCK; |
959 | coro_enq (SvREFCNT_inc (coro)); |
1076 | coro_enq (aTHX_ SvREFCNT_inc (coro_sv)); |
|
|
1077 | ++coro_nready; |
960 | UNLOCK; |
1078 | UNLOCK; |
961 | } |
|
|
962 | |
1079 | |
|
|
1080 | return 1; |
|
|
1081 | } |
|
|
1082 | |
963 | static void |
1083 | static int |
|
|
1084 | api_is_ready (SV *coro_sv) |
|
|
1085 | { |
|
|
1086 | dTHX; |
|
|
1087 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
|
|
1088 | } |
|
|
1089 | |
|
|
1090 | static void |
964 | prepare_schedule (struct transfer_args *ta) |
1091 | prepare_schedule (pTHX_ struct transfer_args *ta) |
965 | { |
1092 | { |
966 | SV *current, *prev, *next; |
1093 | SV *prev_sv, *next_sv; |
967 | |
|
|
968 | current = GvSV (coro_current); |
|
|
969 | |
1094 | |
970 | for (;;) |
1095 | for (;;) |
971 | { |
1096 | { |
972 | LOCK; |
1097 | LOCK; |
973 | next = coro_deq (PRIO_MIN); |
1098 | next_sv = coro_deq (aTHX_ PRIO_MIN); |
|
|
1099 | |
|
|
1100 | /* nothing to schedule: call the idle handler */ |
|
|
1101 | if (!next_sv) |
|
|
1102 | { |
|
|
1103 | dSP; |
|
|
1104 | UNLOCK; |
|
|
1105 | |
|
|
1106 | ENTER; |
|
|
1107 | SAVETMPS; |
|
|
1108 | |
|
|
1109 | PUSHMARK (SP); |
|
|
1110 | PUTBACK; |
|
|
1111 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1112 | |
|
|
1113 | FREETMPS; |
|
|
1114 | LEAVE; |
|
|
1115 | continue; |
|
|
1116 | } |
|
|
1117 | |
|
|
1118 | ta->next = SvSTATE (next_sv); |
|
|
1119 | |
|
|
1120 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1121 | if (ta->next->flags & CF_DESTROYED) |
|
|
1122 | { |
|
|
1123 | UNLOCK; |
|
|
1124 | SvREFCNT_dec (next_sv); |
|
|
1125 | /* coro_nready is already taken care of by destroy */ |
|
|
1126 | continue; |
|
|
1127 | } |
|
|
1128 | |
|
|
1129 | --coro_nready; |
974 | UNLOCK; |
1130 | UNLOCK; |
975 | |
|
|
976 | if (next) |
|
|
977 | break; |
1131 | break; |
978 | |
|
|
979 | { |
|
|
980 | dSP; |
|
|
981 | |
|
|
982 | ENTER; |
|
|
983 | SAVETMPS; |
|
|
984 | |
|
|
985 | PUSHMARK (SP); |
|
|
986 | PUTBACK; |
|
|
987 | call_sv (GvSV (coro_idle), G_DISCARD); |
|
|
988 | |
|
|
989 | FREETMPS; |
|
|
990 | LEAVE; |
|
|
991 | } |
1132 | } |
992 | } |
|
|
993 | |
|
|
994 | prev = SvRV (current); |
|
|
995 | SvRV (current) = next; |
|
|
996 | |
1133 | |
997 | /* free this only after the transfer */ |
1134 | /* free this only after the transfer */ |
|
|
1135 | prev_sv = SvRV (coro_current); |
|
|
1136 | SvRV_set (coro_current, next_sv); |
|
|
1137 | ta->prev = SvSTATE (prev_sv); |
|
|
1138 | |
|
|
1139 | assert (ta->next->flags & CF_READY); |
|
|
1140 | ta->next->flags &= ~CF_READY; |
|
|
1141 | |
998 | LOCK; |
1142 | LOCK; |
999 | free_coro_mortal (); |
1143 | free_coro_mortal (aTHX); |
|
|
1144 | coro_mortal = prev_sv; |
1000 | UNLOCK; |
1145 | UNLOCK; |
1001 | coro_mortal = prev; |
|
|
1002 | |
|
|
1003 | ta->prev = SvSTATE (prev); |
|
|
1004 | ta->next = SvSTATE (next); |
|
|
1005 | ta->flags = TRANSFER_SAVE_ALL; |
|
|
1006 | } |
1146 | } |
1007 | |
1147 | |
1008 | static void |
1148 | static void |
1009 | prepare_cede (struct transfer_args *ta) |
1149 | prepare_cede (pTHX_ struct transfer_args *ta) |
1010 | { |
1150 | { |
1011 | LOCK; |
1151 | api_ready (coro_current); |
1012 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
1013 | UNLOCK; |
|
|
1014 | |
|
|
1015 | prepare_schedule (ta); |
1152 | prepare_schedule (aTHX_ ta); |
|
|
1153 | } |
|
|
1154 | |
|
|
1155 | static int |
|
|
1156 | prepare_cede_notself (pTHX_ struct transfer_args *ta) |
|
|
1157 | { |
|
|
1158 | if (coro_nready) |
|
|
1159 | { |
|
|
1160 | SV *prev = SvRV (coro_current); |
|
|
1161 | prepare_schedule (aTHX_ ta); |
|
|
1162 | api_ready (prev); |
|
|
1163 | return 1; |
|
|
1164 | } |
|
|
1165 | else |
|
|
1166 | return 0; |
1016 | } |
1167 | } |
1017 | |
1168 | |
1018 | static void |
1169 | static void |
1019 | api_schedule (void) |
1170 | api_schedule (void) |
1020 | { |
1171 | { |
1021 | dTHX; |
1172 | dTHX; |
1022 | struct transfer_args ta; |
1173 | struct transfer_args ta; |
1023 | |
1174 | |
1024 | prepare_schedule (&ta); |
1175 | prepare_schedule (aTHX_ &ta); |
1025 | TRANSFER (ta); |
1176 | TRANSFER (ta); |
1026 | } |
1177 | } |
1027 | |
1178 | |
1028 | static void |
1179 | static int |
1029 | api_cede (void) |
1180 | api_cede (void) |
1030 | { |
1181 | { |
1031 | dTHX; |
1182 | dTHX; |
1032 | struct transfer_args ta; |
1183 | struct transfer_args ta; |
1033 | |
1184 | |
1034 | prepare_cede (&ta); |
1185 | prepare_cede (aTHX_ &ta); |
|
|
1186 | |
|
|
1187 | if (ta.prev != ta.next) |
|
|
1188 | { |
1035 | TRANSFER (ta); |
1189 | TRANSFER (ta); |
|
|
1190 | return 1; |
|
|
1191 | } |
|
|
1192 | else |
|
|
1193 | return 0; |
|
|
1194 | } |
|
|
1195 | |
|
|
1196 | static int |
|
|
1197 | api_cede_notself (void) |
|
|
1198 | { |
|
|
1199 | dTHX; |
|
|
1200 | struct transfer_args ta; |
|
|
1201 | |
|
|
1202 | if (prepare_cede_notself (aTHX_ &ta)) |
|
|
1203 | { |
|
|
1204 | TRANSFER (ta); |
|
|
1205 | return 1; |
|
|
1206 | } |
|
|
1207 | else |
|
|
1208 | return 0; |
1036 | } |
1209 | } |
1037 | |
1210 | |
1038 | MODULE = Coro::State PACKAGE = Coro::State |
1211 | MODULE = Coro::State PACKAGE = Coro::State |
1039 | |
1212 | |
1040 | PROTOTYPES: DISABLE |
1213 | PROTOTYPES: DISABLE |
… | |
… | |
1046 | #endif |
1219 | #endif |
1047 | BOOT_PAGESIZE; |
1220 | BOOT_PAGESIZE; |
1048 | |
1221 | |
1049 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
1222 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
1050 | |
1223 | |
1051 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
1224 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV)); |
1052 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
1225 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV)); |
1053 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
1226 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV)); |
|
|
1227 | newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV)); |
|
|
1228 | newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH)); |
|
|
1229 | newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF)); |
|
|
1230 | newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL)); |
1054 | |
1231 | |
1055 | main_mainstack = PL_mainstack; |
1232 | main_mainstack = PL_mainstack; |
|
|
1233 | main_top_env = PL_top_env; |
|
|
1234 | |
|
|
1235 | while (main_top_env->je_prev) |
|
|
1236 | main_top_env = main_top_env->je_prev; |
1056 | |
1237 | |
1057 | coroapi.ver = CORO_API_VERSION; |
1238 | coroapi.ver = CORO_API_VERSION; |
1058 | coroapi.transfer = api_transfer; |
1239 | coroapi.transfer = api_transfer; |
1059 | |
1240 | |
1060 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
1241 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
… | |
… | |
1068 | HV *hv; |
1249 | HV *hv; |
1069 | int i; |
1250 | int i; |
1070 | |
1251 | |
1071 | Newz (0, coro, 1, struct coro); |
1252 | Newz (0, coro, 1, struct coro); |
1072 | coro->args = newAV (); |
1253 | coro->args = newAV (); |
|
|
1254 | coro->save = CORO_SAVE_DEF; |
|
|
1255 | coro->flags = CF_NEW; |
1073 | |
1256 | |
|
|
1257 | if (coro_first) coro_first->prev = coro; |
|
|
1258 | coro->next = coro_first; |
|
|
1259 | coro_first = coro; |
|
|
1260 | |
1074 | hv = newHV (); |
1261 | coro->hv = hv = newHV (); |
1075 | sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
1262 | sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
1076 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
1263 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
1077 | |
1264 | |
1078 | for (i = 1; i < items; i++) |
1265 | for (i = 1; i < items; i++) |
1079 | av_push (coro->args, newSVsv (ST (i))); |
1266 | av_push (coro->args, newSVsv (ST (i))); |
1080 | |
|
|
1081 | /*coro->mainstack = 0; *//*actual work is done inside transfer */ |
|
|
1082 | /*coro->stack = 0;*/ |
|
|
1083 | } |
1267 | } |
1084 | OUTPUT: |
1268 | OUTPUT: |
|
|
1269 | RETVAL |
|
|
1270 | |
|
|
1271 | int |
|
|
1272 | save (SV *coro, int new_save = -1) |
|
|
1273 | CODE: |
|
|
1274 | RETVAL = api_save (coro, new_save); |
|
|
1275 | OUTPUT: |
|
|
1276 | RETVAL |
|
|
1277 | |
|
|
1278 | int |
|
|
1279 | save_also (SV *coro_sv, int save_also) |
|
|
1280 | CODE: |
|
|
1281 | { |
|
|
1282 | struct coro *coro = SvSTATE (coro_sv); |
|
|
1283 | RETVAL = coro->save; |
|
|
1284 | coro->save |= save_also; |
|
|
1285 | } |
|
|
1286 | OUTPUT: |
1085 | RETVAL |
1287 | RETVAL |
1086 | |
1288 | |
1087 | void |
1289 | void |
1088 | _set_stacklevel (...) |
1290 | _set_stacklevel (...) |
1089 | ALIAS: |
1291 | ALIAS: |
1090 | Coro::State::transfer = 1 |
1292 | Coro::State::transfer = 1 |
1091 | Coro::schedule = 2 |
1293 | Coro::schedule = 2 |
1092 | Coro::cede = 3 |
1294 | Coro::cede = 3 |
1093 | Coro::Cont::yield = 4 |
1295 | Coro::cede_notself = 4 |
1094 | CODE: |
1296 | CODE: |
1095 | { |
1297 | { |
1096 | struct transfer_args ta; |
1298 | struct transfer_args ta; |
1097 | |
1299 | |
1098 | switch (ix) |
1300 | switch (ix) |
1099 | { |
1301 | { |
1100 | case 0: |
1302 | case 0: |
1101 | ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0))); |
1303 | ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
1102 | ta.next = 0; |
1304 | ta.next = 0; |
1103 | ta.flags = TRANSFER_SET_STACKLEVEL; |
|
|
1104 | break; |
1305 | break; |
1105 | |
1306 | |
1106 | case 1: |
1307 | case 1: |
1107 | if (items != 3) |
1308 | if (items != 2) |
1108 | croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items); |
1309 | croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items); |
1109 | |
1310 | |
1110 | prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2))); |
1311 | prepare_transfer (aTHX_ &ta, ST (0), ST (1)); |
1111 | break; |
1312 | break; |
1112 | |
1313 | |
1113 | case 2: |
1314 | case 2: |
1114 | prepare_schedule (&ta); |
1315 | prepare_schedule (aTHX_ &ta); |
1115 | break; |
1316 | break; |
1116 | |
1317 | |
1117 | case 3: |
1318 | case 3: |
1118 | prepare_cede (&ta); |
1319 | prepare_cede (aTHX_ &ta); |
1119 | break; |
1320 | break; |
1120 | |
1321 | |
1121 | case 4: |
1322 | case 4: |
1122 | { |
1323 | if (!prepare_cede_notself (aTHX_ &ta)) |
1123 | SV *yieldstack; |
1324 | XSRETURN_EMPTY; |
1124 | SV *sv; |
|
|
1125 | AV *defav = GvAV (PL_defgv); |
|
|
1126 | |
1325 | |
1127 | yieldstack = *hv_fetch ( |
|
|
1128 | (HV *)SvRV (GvSV (coro_current)), |
|
|
1129 | "yieldstack", sizeof ("yieldstack") - 1, |
|
|
1130 | 0 |
|
|
1131 | ); |
|
|
1132 | |
|
|
1133 | /* set up @_ -- ugly */ |
|
|
1134 | av_clear (defav); |
|
|
1135 | av_fill (defav, items - 1); |
|
|
1136 | while (items--) |
|
|
1137 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
|
|
1138 | |
|
|
1139 | sv = av_pop ((AV *)SvRV (yieldstack)); |
|
|
1140 | ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0)); |
|
|
1141 | ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0)); |
|
|
1142 | ta.flags = 0; |
|
|
1143 | SvREFCNT_dec (sv); |
|
|
1144 | } |
|
|
1145 | break; |
1326 | break; |
1146 | |
|
|
1147 | } |
1327 | } |
1148 | |
1328 | |
|
|
1329 | BARRIER; |
1149 | TRANSFER (ta); |
1330 | TRANSFER (ta); |
1150 | } |
|
|
1151 | |
1331 | |
1152 | void |
1332 | if (GIMME_V != G_VOID && ta.next != ta.prev) |
1153 | _clone_state_from (SV *dst, SV *src) |
1333 | XSRETURN_YES; |
|
|
1334 | } |
|
|
1335 | |
|
|
1336 | bool |
|
|
1337 | _destroy (SV *coro_sv) |
1154 | CODE: |
1338 | CODE: |
1155 | { |
1339 | RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv)); |
1156 | struct coro *coro_src = SvSTATE (src); |
1340 | OUTPUT: |
1157 | |
1341 | RETVAL |
1158 | sv_unmagic (SvRV (dst), PERL_MAGIC_ext); |
|
|
1159 | |
|
|
1160 | ++coro_src->refcnt; |
|
|
1161 | sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP; |
|
|
1162 | } |
|
|
1163 | |
1342 | |
1164 | void |
1343 | void |
1165 | _exit (code) |
1344 | _exit (code) |
1166 | int code |
1345 | int code |
1167 | PROTOTYPE: $ |
1346 | PROTOTYPE: $ |
1168 | CODE: |
1347 | CODE: |
1169 | _exit (code); |
1348 | _exit (code); |
1170 | |
1349 | |
|
|
1350 | int |
|
|
1351 | cctx_stacksize (int new_stacksize = 0) |
|
|
1352 | CODE: |
|
|
1353 | RETVAL = coro_stacksize; |
|
|
1354 | if (new_stacksize) |
|
|
1355 | coro_stacksize = new_stacksize; |
|
|
1356 | OUTPUT: |
|
|
1357 | RETVAL |
|
|
1358 | |
|
|
1359 | int |
|
|
1360 | cctx_count () |
|
|
1361 | CODE: |
|
|
1362 | RETVAL = cctx_count; |
|
|
1363 | OUTPUT: |
|
|
1364 | RETVAL |
|
|
1365 | |
|
|
1366 | int |
|
|
1367 | cctx_idle () |
|
|
1368 | CODE: |
|
|
1369 | RETVAL = cctx_idle; |
|
|
1370 | OUTPUT: |
|
|
1371 | RETVAL |
|
|
1372 | |
|
|
1373 | void |
|
|
1374 | list () |
|
|
1375 | PPCODE: |
|
|
1376 | { |
|
|
1377 | struct coro *coro; |
|
|
1378 | for (coro = coro_first; coro; coro = coro->next) |
|
|
1379 | if (coro->hv) |
|
|
1380 | XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv))); |
|
|
1381 | } |
|
|
1382 | |
|
|
1383 | void |
|
|
1384 | _eval (Coro::State coro, SV *coderef) |
|
|
1385 | CODE: |
|
|
1386 | { |
|
|
1387 | if (coro->mainstack) |
|
|
1388 | { |
|
|
1389 | struct coro temp; |
|
|
1390 | Zero (&temp, 1, struct coro); |
|
|
1391 | temp.save = CORO_SAVE_ALL; |
|
|
1392 | |
|
|
1393 | if (!(coro->flags & CF_RUNNING)) |
|
|
1394 | { |
|
|
1395 | save_perl (aTHX_ &temp); |
|
|
1396 | load_perl (aTHX_ coro); |
|
|
1397 | } |
|
|
1398 | |
|
|
1399 | { |
|
|
1400 | dSP; |
|
|
1401 | ENTER; |
|
|
1402 | SAVETMPS; |
|
|
1403 | PUSHMARK (SP); |
|
|
1404 | PUTBACK; |
|
|
1405 | call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
|
|
1406 | SPAGAIN; |
|
|
1407 | FREETMPS; |
|
|
1408 | LEAVE; |
|
|
1409 | PUTBACK; |
|
|
1410 | } |
|
|
1411 | |
|
|
1412 | if (!(coro->flags & CF_RUNNING)) |
|
|
1413 | { |
|
|
1414 | save_perl (aTHX_ coro); |
|
|
1415 | load_perl (aTHX_ &temp); |
|
|
1416 | } |
|
|
1417 | } |
|
|
1418 | } |
|
|
1419 | |
|
|
1420 | SV * |
|
|
1421 | is_ready (Coro::State coro) |
|
|
1422 | PROTOTYPE: $ |
|
|
1423 | ALIAS: |
|
|
1424 | is_ready = CF_READY |
|
|
1425 | is_running = CF_RUNNING |
|
|
1426 | is_new = CF_NEW |
|
|
1427 | is_destroyed = CF_DESTROYED |
|
|
1428 | CODE: |
|
|
1429 | RETVAL = boolSV (coro->flags & ix); |
|
|
1430 | OUTPUT: |
|
|
1431 | RETVAL |
|
|
1432 | |
|
|
1433 | SV * |
|
|
1434 | has_stack (Coro::State coro) |
|
|
1435 | PROTOTYPE: $ |
|
|
1436 | CODE: |
|
|
1437 | RETVAL = boolSV (!!coro->cctx); |
|
|
1438 | OUTPUT: |
|
|
1439 | RETVAL |
|
|
1440 | |
|
|
1441 | IV |
|
|
1442 | rss (Coro::State coro) |
|
|
1443 | PROTOTYPE: $ |
|
|
1444 | CODE: |
|
|
1445 | RETVAL = coro_rss (coro); |
|
|
1446 | OUTPUT: |
|
|
1447 | RETVAL |
|
|
1448 | |
|
|
1449 | |
1171 | MODULE = Coro::State PACKAGE = Coro |
1450 | MODULE = Coro::State PACKAGE = Coro |
1172 | |
1451 | |
1173 | BOOT: |
1452 | BOOT: |
1174 | { |
1453 | { |
1175 | int i; |
1454 | int i; |
|
|
1455 | |
|
|
1456 | sv_pool_rss = get_sv ("Coro::POOL_RSS" , TRUE); |
|
|
1457 | sv_pool_size = get_sv ("Coro::POOL_SIZE" , TRUE); |
|
|
1458 | av_async_pool = get_av ("Coro::async_pool", TRUE); |
|
|
1459 | |
|
|
1460 | coro_current = get_sv ("Coro::current", FALSE); |
|
|
1461 | SvREADONLY_on (coro_current); |
1176 | |
1462 | |
1177 | coro_stash = gv_stashpv ("Coro", TRUE); |
1463 | coro_stash = gv_stashpv ("Coro", TRUE); |
1178 | |
1464 | |
1179 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1465 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1180 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1466 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1181 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1467 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1182 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1468 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1183 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1469 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1184 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1470 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1185 | |
1471 | |
1186 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1187 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1188 | |
|
|
1189 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1472 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1190 | coro_ready[i] = newAV (); |
1473 | coro_ready[i] = newAV (); |
1191 | |
1474 | |
1192 | { |
1475 | { |
1193 | SV *sv = perl_get_sv("Coro::API", 1); |
1476 | SV *sv = perl_get_sv("Coro::API", 1); |
1194 | |
1477 | |
1195 | coroapi.schedule = api_schedule; |
1478 | coroapi.schedule = api_schedule; |
|
|
1479 | coroapi.save = api_save; |
1196 | coroapi.cede = api_cede; |
1480 | coroapi.cede = api_cede; |
|
|
1481 | coroapi.cede_notself = api_cede_notself; |
1197 | coroapi.ready = api_ready; |
1482 | coroapi.ready = api_ready; |
|
|
1483 | coroapi.is_ready = api_is_ready; |
1198 | coroapi.nready = &coro_nready; |
1484 | coroapi.nready = &coro_nready; |
1199 | coroapi.current = coro_current; |
1485 | coroapi.current = coro_current; |
1200 | |
1486 | |
1201 | GCoroAPI = &coroapi; |
1487 | GCoroAPI = &coroapi; |
1202 | sv_setiv (sv, (IV)&coroapi); |
1488 | sv_setiv (sv, (IV)&coroapi); |
1203 | SvREADONLY_on (sv); |
1489 | SvREADONLY_on (sv); |
1204 | } |
1490 | } |
1205 | } |
1491 | } |
|
|
1492 | |
|
|
1493 | void |
|
|
1494 | _set_current (SV *current) |
|
|
1495 | PROTOTYPE: $ |
|
|
1496 | CODE: |
|
|
1497 | SvREFCNT_dec (SvRV (coro_current)); |
|
|
1498 | SvRV_set (coro_current, SvREFCNT_inc (SvRV (current))); |
1206 | |
1499 | |
1207 | int |
1500 | int |
1208 | prio (Coro::State coro, int newprio = 0) |
1501 | prio (Coro::State coro, int newprio = 0) |
1209 | ALIAS: |
1502 | ALIAS: |
1210 | nice = 1 |
1503 | nice = 1 |
… | |
… | |
1213 | RETVAL = coro->prio; |
1506 | RETVAL = coro->prio; |
1214 | |
1507 | |
1215 | if (items > 1) |
1508 | if (items > 1) |
1216 | { |
1509 | { |
1217 | if (ix) |
1510 | if (ix) |
1218 | newprio += coro->prio; |
1511 | newprio = coro->prio - newprio; |
1219 | |
1512 | |
1220 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1513 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1221 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1514 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1222 | |
1515 | |
1223 | coro->prio = newprio; |
1516 | coro->prio = newprio; |
1224 | } |
1517 | } |
1225 | } |
1518 | } |
|
|
1519 | OUTPUT: |
|
|
1520 | RETVAL |
1226 | |
1521 | |
1227 | void |
1522 | SV * |
1228 | ready (SV *self) |
1523 | ready (SV *self) |
1229 | PROTOTYPE: $ |
1524 | PROTOTYPE: $ |
1230 | CODE: |
1525 | CODE: |
1231 | api_ready (self); |
1526 | RETVAL = boolSV (api_ready (self)); |
|
|
1527 | OUTPUT: |
|
|
1528 | RETVAL |
1232 | |
1529 | |
1233 | int |
1530 | int |
1234 | nready (...) |
1531 | nready (...) |
1235 | PROTOTYPE: |
1532 | PROTOTYPE: |
1236 | CODE: |
1533 | CODE: |
1237 | RETVAL = coro_nready; |
1534 | RETVAL = coro_nready; |
1238 | OUTPUT: |
1535 | OUTPUT: |
1239 | RETVAL |
1536 | RETVAL |
1240 | |
1537 | |
|
|
1538 | # for async_pool speedup |
|
|
1539 | void |
|
|
1540 | _pool_1 (SV *cb) |
|
|
1541 | CODE: |
|
|
1542 | { |
|
|
1543 | int i, len; |
|
|
1544 | HV *hv = (HV *)SvRV (coro_current); |
|
|
1545 | AV *defav = GvAV (PL_defgv); |
|
|
1546 | SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0); |
|
|
1547 | AV *invoke_av; |
|
|
1548 | |
|
|
1549 | if (!invoke) |
|
|
1550 | croak ("\3terminate\2\n"); |
|
|
1551 | |
|
|
1552 | hv_store (hv, "desc", sizeof ("desc") - 1, |
|
|
1553 | newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0); |
|
|
1554 | |
|
|
1555 | invoke_av = (AV *)SvRV (invoke); |
|
|
1556 | len = av_len (invoke_av); |
|
|
1557 | |
|
|
1558 | sv_setsv (cb, AvARRAY (invoke_av)[0]); |
|
|
1559 | |
|
|
1560 | if (len > 0) |
|
|
1561 | { |
|
|
1562 | av_fill (defav, len - 1); |
|
|
1563 | for (i = 0; i < len; ++i) |
|
|
1564 | av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1])); |
|
|
1565 | } |
|
|
1566 | |
|
|
1567 | SvREFCNT_dec (invoke); |
|
|
1568 | } |
|
|
1569 | |
|
|
1570 | void |
|
|
1571 | _pool_2 (SV *cb) |
|
|
1572 | CODE: |
|
|
1573 | { |
|
|
1574 | struct coro *coro = SvSTATE (coro_current); |
|
|
1575 | |
|
|
1576 | sv_setsv (cb, &PL_sv_undef); |
|
|
1577 | |
|
|
1578 | if (coro_rss (coro) > SvIV (sv_pool_rss) |
|
|
1579 | || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size)) |
|
|
1580 | croak ("\3terminate\2\n"); |
|
|
1581 | |
|
|
1582 | av_clear (GvAV (PL_defgv)); |
|
|
1583 | hv_store (SvRV (coro_current), "desc", sizeof ("desc") - 1, |
|
|
1584 | newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0); |
|
|
1585 | coro->save = CORO_SAVE_DEF; |
|
|
1586 | coro->prio = 0; |
|
|
1587 | av_push (av_async_pool, newSVsv (coro_current)); |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | |
1241 | MODULE = Coro::State PACKAGE = Coro::AIO |
1591 | MODULE = Coro::State PACKAGE = Coro::AIO |
1242 | |
1592 | |
1243 | SV * |
1593 | SV * |
1244 | _get_state () |
1594 | _get_state () |
1245 | CODE: |
1595 | CODE: |
1246 | { |
1596 | { |
1247 | struct { |
1597 | struct io_state *data; |
1248 | int errorno; |
|
|
1249 | int laststype; |
|
|
1250 | int laststatval; |
|
|
1251 | Stat_t statcache; |
|
|
1252 | } data; |
|
|
1253 | |
1598 | |
|
|
1599 | RETVAL = newSV (sizeof (struct io_state)); |
|
|
1600 | data = (struct io_state *)SvPVX (RETVAL); |
|
|
1601 | SvCUR_set (RETVAL, sizeof (struct io_state)); |
|
|
1602 | SvPOK_only (RETVAL); |
|
|
1603 | |
1254 | data.errorno = errno; |
1604 | data->errorno = errno; |
1255 | data.laststype = PL_laststype; |
1605 | data->laststype = PL_laststype; |
1256 | data.laststatval = PL_laststatval; |
1606 | data->laststatval = PL_laststatval; |
1257 | data.statcache = PL_statcache; |
1607 | data->statcache = PL_statcache; |
1258 | |
|
|
1259 | RETVAL = newSVpvn ((char *)&data, sizeof data); |
|
|
1260 | } |
1608 | } |
1261 | OUTPUT: |
1609 | OUTPUT: |
1262 | RETVAL |
1610 | RETVAL |
1263 | |
1611 | |
1264 | void |
1612 | void |
1265 | _set_state (char *data_) |
1613 | _set_state (char *data_) |
1266 | PROTOTYPE: $ |
1614 | PROTOTYPE: $ |
1267 | CODE: |
1615 | CODE: |
1268 | { |
1616 | { |
1269 | struct { |
1617 | struct io_state *data = (void *)data_; |
1270 | int errorno; |
|
|
1271 | int laststype; |
|
|
1272 | int laststatval; |
|
|
1273 | Stat_t statcache; |
|
|
1274 | } *data = (void *)data_; |
|
|
1275 | |
1618 | |
1276 | errno = data->errorno; |
1619 | errno = data->errorno; |
1277 | PL_laststype = data->laststype; |
1620 | PL_laststype = data->laststype; |
1278 | PL_laststatval = data->laststatval; |
1621 | PL_laststatval = data->laststatval; |
1279 | PL_statcache = data->statcache; |
1622 | PL_statcache = data->statcache; |
1280 | } |
1623 | } |
|
|
1624 | |