|
|
1 | #define PERL_NO_GET_CONTEXT |
|
|
2 | |
1 | #include "EXTERN.h" |
3 | #include "EXTERN.h" |
2 | #include "perl.h" |
4 | #include "perl.h" |
3 | #include "XSUB.h" |
5 | #include "XSUB.h" |
4 | |
6 | |
|
|
7 | #include "patchlevel.h" |
|
|
8 | |
|
|
9 | #if PATCHLEVEL < 6 |
|
|
10 | # ifndef PL_ppaddr |
|
|
11 | # define PL_ppaddr ppaddr |
|
|
12 | # endif |
|
|
13 | # ifndef call_sv |
|
|
14 | # define call_sv perl_call_sv |
|
|
15 | # endif |
|
|
16 | # ifndef get_sv |
|
|
17 | # define get_sv perl_get_sv |
|
|
18 | # endif |
|
|
19 | # ifndef get_cv |
|
|
20 | # define get_cv perl_get_cv |
|
|
21 | # endif |
|
|
22 | # ifndef IS_PADGV |
|
|
23 | # define IS_PADGV(v) 0 |
|
|
24 | # endif |
|
|
25 | # ifndef IS_PADCONST |
|
|
26 | # define IS_PADCONST(v) 0 |
|
|
27 | # endif |
|
|
28 | #endif |
|
|
29 | |
5 | #include "libcoro/coro.c" |
30 | #include "libcoro/coro.c" |
|
|
31 | |
|
|
32 | #include <signal.h> |
6 | |
33 | |
7 | #ifdef HAVE_MMAP |
34 | #ifdef HAVE_MMAP |
8 | # include <unistd.h> |
35 | # include <unistd.h> |
9 | # include <sys/mman.h> |
36 | # include <sys/mman.h> |
10 | # ifndef MAP_ANON |
|
|
11 | # ifdef MAP_ANONYMOUS |
37 | # ifndef MAP_ANONYMOUS |
12 | # define MAP_ANON MAP_ANONYMOUS |
38 | # ifdef MAP_ANON |
|
|
39 | # define MAP_ANONYMOUS MAP_ANON |
13 | # else |
40 | # else |
14 | # undef HAVE_MMAP |
41 | # undef HAVE_MMAP |
15 | # endif |
42 | # endif |
16 | # endif |
43 | # endif |
17 | #endif |
44 | #endif |
18 | |
45 | |
19 | #define MAY_FLUSH /* increases codesize */ |
|
|
20 | |
|
|
21 | /* perl-related */ |
|
|
22 | #define TRANSFER_SAVE_DEFAV 0x00000001 |
|
|
23 | #define TRANSFER_SAVE_DEFSV 0x00000002 |
|
|
24 | #define TRANSFER_SAVE_ERRSV 0x00000004 |
|
|
25 | /* c-related */ |
|
|
26 | #define TRANSFER_SAVE_CCTXT 0x00000008 |
|
|
27 | #ifdef CORO_LAZY_STACK |
|
|
28 | # define TRANSFER_LAZY_STACK 0x00000010 |
|
|
29 | #else |
|
|
30 | # define TRANSFER_LAZY_STACK 0x00000000 |
|
|
31 | #endif |
|
|
32 | |
|
|
33 | #define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \ |
|
|
34 | |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT) |
|
|
35 | |
|
|
36 | #define SUB_INIT "Coro::State::initialize" |
46 | #define SUB_INIT "Coro::State::initialize" |
37 | #define UCORO_STATE "_coro_state" |
47 | #define UCORO_STATE "_coro_state" |
38 | |
48 | |
39 | /* The next macro should delcare a variable stacklevel that contains and approximation |
49 | /* The next macro should declare a variable stacklevel that contains and approximation |
40 | * to the current C stack pointer. It's property is that it changes with each call |
50 | * to the current C stack pointer. Its property is that it changes with each call |
41 | * and should be unique. */ |
51 | * and should be unique. */ |
42 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
52 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
43 | |
53 | |
|
|
54 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
55 | |
44 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
56 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
|
|
57 | |
|
|
58 | #include "CoroAPI.h" |
|
|
59 | |
|
|
60 | #ifdef USE_ITHREADS |
|
|
61 | static perl_mutex coro_mutex; |
|
|
62 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
63 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
64 | #else |
|
|
65 | # define LOCK 0 |
|
|
66 | # define UNLOCK 0 |
|
|
67 | #endif |
|
|
68 | |
|
|
69 | static struct CoroAPI coroapi; |
|
|
70 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
71 | static HV *coro_state_stash; |
|
|
72 | static SV *ucoro_state_sv; |
|
|
73 | static U32 ucoro_state_hash; |
|
|
74 | static __thread SV *coro_mortal; /* will be freed after next transfer */ |
45 | |
75 | |
46 | /* this is actually not only the c stack but also c registers etc... */ |
76 | /* this is actually not only the c stack but also c registers etc... */ |
47 | typedef struct { |
77 | typedef struct { |
48 | int refcnt; /* pointer reference counter */ |
78 | int refcnt; /* pointer reference counter */ |
49 | int usecnt; /* shared by how many coroutines */ |
79 | int usecnt; /* shared by how many coroutines */ |
… | |
… | |
53 | |
83 | |
54 | void *sptr; |
84 | void *sptr; |
55 | long ssize; /* positive == mmap, otherwise malloc */ |
85 | long ssize; /* positive == mmap, otherwise malloc */ |
56 | } coro_stack; |
86 | } coro_stack; |
57 | |
87 | |
58 | static coro_stack main_stack = { 1, 0, 0 }; |
|
|
59 | |
|
|
60 | struct coro { |
88 | struct coro { |
|
|
89 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
90 | JMPENV start_env; |
|
|
91 | |
61 | /* the optional C context */ |
92 | /* the optional C context */ |
62 | coro_stack *stack; |
93 | coro_stack *stack; |
63 | void *cursp; |
94 | void *cursp; |
64 | int gencnt; |
95 | int gencnt; |
65 | |
96 | |
… | |
… | |
68 | SV *defsv; |
99 | SV *defsv; |
69 | SV *errsv; |
100 | SV *errsv; |
70 | |
101 | |
71 | /* saved global state not related to stacks */ |
102 | /* saved global state not related to stacks */ |
72 | U8 dowarn; |
103 | U8 dowarn; |
|
|
104 | I32 in_eval; |
73 | |
105 | |
74 | /* the stacks and related info (callchain etc..) */ |
106 | /* the stacks and related info (callchain etc..) */ |
75 | PERL_SI *curstackinfo; |
107 | PERL_SI *curstackinfo; |
76 | AV *curstack; |
108 | AV *curstack; |
77 | AV *mainstack; |
109 | AV *mainstack; |
78 | SV **stack_sp; |
110 | SV **stack_sp; |
79 | OP *op; |
111 | OP *op; |
80 | SV **curpad; |
112 | SV **curpad; |
|
|
113 | AV *comppad; |
81 | SV **stack_base; |
114 | SV **stack_base; |
82 | SV **stack_max; |
115 | SV **stack_max; |
83 | SV **tmps_stack; |
116 | SV **tmps_stack; |
84 | I32 tmps_floor; |
117 | I32 tmps_floor; |
85 | I32 tmps_ix; |
118 | I32 tmps_ix; |
… | |
… | |
95 | I32 savestack_max; |
128 | I32 savestack_max; |
96 | OP **retstack; |
129 | OP **retstack; |
97 | I32 retstack_ix; |
130 | I32 retstack_ix; |
98 | I32 retstack_max; |
131 | I32 retstack_max; |
99 | COP *curcop; |
132 | COP *curcop; |
100 | JMPENV start_env; |
|
|
101 | JMPENV *top_env; |
133 | JMPENV *top_env; |
102 | |
134 | |
103 | /* data associated with this coroutine (initial args) */ |
135 | /* data associated with this coroutine (initial args) */ |
104 | AV *args; |
136 | AV *args; |
105 | }; |
137 | }; |
106 | |
138 | |
107 | typedef struct coro *Coro__State; |
139 | typedef struct coro *Coro__State; |
108 | typedef struct coro *Coro__State_or_hashref; |
140 | typedef struct coro *Coro__State_or_hashref; |
109 | |
141 | |
110 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
111 | static HV *coro_state_stash; |
|
|
112 | static SV *ucoro_state_sv; |
|
|
113 | static U32 ucoro_state_hash; |
|
|
114 | static HV *padlist_cache; |
|
|
115 | |
|
|
116 | /* mostly copied from op.c:cv_clone2 */ |
142 | /* mostly copied from op.c:cv_clone2 */ |
117 | STATIC AV * |
143 | STATIC AV * |
118 | clone_padlist (AV *protopadlist) |
144 | clone_padlist (pTHX_ AV *protopadlist) |
119 | { |
145 | { |
120 | AV *av; |
146 | AV *av; |
121 | I32 ix; |
147 | I32 ix; |
122 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
148 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
123 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
149 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
… | |
… | |
147 | AvFLAGS (av) = AVf_REIFY; |
173 | AvFLAGS (av) = AVf_REIFY; |
148 | |
174 | |
149 | for (ix = fpad; ix > 0; ix--) |
175 | for (ix = fpad; ix > 0; ix--) |
150 | { |
176 | { |
151 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
177 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
178 | |
152 | if (namesv && namesv != &PL_sv_undef) |
179 | if (namesv && namesv != &PL_sv_undef) |
153 | { |
180 | { |
154 | char *name = SvPVX (namesv); /* XXX */ |
181 | char *name = SvPVX (namesv); /* XXX */ |
|
|
182 | |
155 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
183 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
156 | { /* lexical from outside? */ |
184 | { /* lexical from outside? */ |
157 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
185 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
158 | } |
186 | } |
159 | else |
187 | else |
… | |
… | |
165 | sv = (SV *) newAV (); |
193 | sv = (SV *) newAV (); |
166 | else if (*name == '%') |
194 | else if (*name == '%') |
167 | sv = (SV *) newHV (); |
195 | sv = (SV *) newHV (); |
168 | else |
196 | else |
169 | sv = NEWSV (0, 0); |
197 | sv = NEWSV (0, 0); |
|
|
198 | |
|
|
199 | #ifdef SvPADBUSY |
170 | if (!SvPADBUSY (sv)) |
200 | if (!SvPADBUSY (sv)) |
|
|
201 | #endif |
171 | SvPADMY_on (sv); |
202 | SvPADMY_on (sv); |
|
|
203 | |
172 | npad[ix] = sv; |
204 | npad[ix] = sv; |
173 | } |
205 | } |
174 | } |
206 | } |
175 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
207 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
176 | { |
208 | { |
… | |
… | |
205 | #endif |
237 | #endif |
206 | |
238 | |
207 | return newpadlist; |
239 | return newpadlist; |
208 | } |
240 | } |
209 | |
241 | |
210 | #ifdef MAY_FLUSH |
242 | STATIC void |
211 | STATIC AV * |
|
|
212 | free_padlist (AV *padlist) |
243 | free_padlist (pTHX_ AV *padlist) |
213 | { |
244 | { |
214 | /* may be during global destruction */ |
245 | /* may be during global destruction */ |
215 | if (SvREFCNT(padlist)) |
246 | if (SvREFCNT (padlist)) |
216 | { |
247 | { |
217 | I32 i = AvFILLp(padlist); |
248 | I32 i = AvFILLp (padlist); |
218 | while (i >= 0) |
249 | while (i >= 0) |
219 | { |
250 | { |
220 | SV **svp = av_fetch(padlist, i--, FALSE); |
251 | SV **svp = av_fetch (padlist, i--, FALSE); |
221 | SV *sv = svp ? *svp : Nullsv; |
|
|
222 | if (sv) |
252 | if (svp) |
|
|
253 | { |
|
|
254 | SV *sv; |
|
|
255 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
223 | SvREFCNT_dec(sv); |
256 | SvREFCNT_dec (sv); |
|
|
257 | |
|
|
258 | SvREFCNT_dec (*svp); |
|
|
259 | } |
224 | } |
260 | } |
225 | |
261 | |
226 | SvREFCNT_dec((SV*)padlist); |
262 | SvREFCNT_dec ((SV*)padlist); |
227 | } |
263 | } |
228 | } |
264 | } |
229 | #endif |
265 | |
|
|
266 | STATIC int |
|
|
267 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
268 | { |
|
|
269 | AV *padlist; |
|
|
270 | AV *av = (AV *)mg->mg_obj; |
|
|
271 | |
|
|
272 | /* casting is fun. */ |
|
|
273 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
274 | free_padlist (aTHX_ padlist); |
|
|
275 | } |
|
|
276 | |
|
|
277 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
|
|
278 | |
|
|
279 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
230 | |
280 | |
231 | /* the next two functions merely cache the padlists */ |
281 | /* the next two functions merely cache the padlists */ |
232 | STATIC void |
282 | STATIC void |
233 | get_padlist (CV *cv) |
283 | get_padlist (pTHX_ CV *cv) |
234 | { |
284 | { |
235 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
285 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
236 | |
286 | |
237 | if (he && AvFILLp ((AV *)*he) >= 0) |
287 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
238 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
288 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
239 | else |
289 | else |
240 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
290 | CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); |
241 | } |
291 | } |
242 | |
292 | |
243 | STATIC void |
293 | STATIC void |
244 | put_padlist (CV *cv) |
294 | put_padlist (pTHX_ CV *cv) |
245 | { |
295 | { |
246 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
296 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
247 | |
297 | |
248 | if (SvTYPE (*he) != SVt_PVAV) |
298 | if (!mg) |
249 | { |
299 | { |
250 | SvREFCNT_dec (*he); |
300 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
301 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
302 | mg->mg_virtual = &vtbl_coro; |
251 | *he = (SV *)newAV (); |
303 | mg->mg_obj = (SV *)newAV (); |
252 | } |
304 | } |
253 | |
305 | |
254 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
306 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
255 | } |
307 | } |
256 | |
|
|
257 | #ifdef MAY_FLUSH |
|
|
258 | STATIC void |
|
|
259 | flush_padlist_cache () |
|
|
260 | { |
|
|
261 | HV *hv = padlist_cache; |
|
|
262 | padlist_cache = newHV (); |
|
|
263 | |
|
|
264 | if (hv_iterinit (hv)) |
|
|
265 | { |
|
|
266 | HE *he; |
|
|
267 | AV *padlist; |
|
|
268 | |
|
|
269 | while (!!(he = hv_iternext (hv))) |
|
|
270 | { |
|
|
271 | AV *av = (AV *)HeVAL(he); |
|
|
272 | |
|
|
273 | /* casting is fun. */ |
|
|
274 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
275 | free_padlist (padlist); |
|
|
276 | } |
|
|
277 | } |
|
|
278 | |
|
|
279 | SvREFCNT_dec (hv); |
|
|
280 | } |
|
|
281 | #endif |
|
|
282 | |
308 | |
283 | #define SB do { |
309 | #define SB do { |
284 | #define SE } while (0) |
310 | #define SE } while (0) |
285 | |
311 | |
286 | #define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE |
312 | #define LOAD(state) load_state(aTHX_ (state)); |
287 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE |
313 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
288 | |
314 | |
289 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
315 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
290 | |
316 | |
291 | static void |
317 | static void |
292 | load_state(pTHX_ Coro__State c) |
318 | load_state(pTHX_ Coro__State c) |
293 | { |
319 | { |
294 | PL_dowarn = c->dowarn; |
320 | PL_dowarn = c->dowarn; |
|
|
321 | PL_in_eval = c->in_eval; |
295 | |
322 | |
296 | PL_curstackinfo = c->curstackinfo; |
323 | PL_curstackinfo = c->curstackinfo; |
297 | PL_curstack = c->curstack; |
324 | PL_curstack = c->curstack; |
298 | PL_mainstack = c->mainstack; |
325 | PL_mainstack = c->mainstack; |
299 | PL_stack_sp = c->stack_sp; |
326 | PL_stack_sp = c->stack_sp; |
300 | PL_op = c->op; |
327 | PL_op = c->op; |
301 | PL_curpad = c->curpad; |
328 | PL_curpad = c->curpad; |
|
|
329 | PL_comppad = c->comppad; |
302 | PL_stack_base = c->stack_base; |
330 | PL_stack_base = c->stack_base; |
303 | PL_stack_max = c->stack_max; |
331 | PL_stack_max = c->stack_max; |
304 | PL_tmps_stack = c->tmps_stack; |
332 | PL_tmps_stack = c->tmps_stack; |
305 | PL_tmps_floor = c->tmps_floor; |
333 | PL_tmps_floor = c->tmps_floor; |
306 | PL_tmps_ix = c->tmps_ix; |
334 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
316 | PL_savestack_max = c->savestack_max; |
344 | PL_savestack_max = c->savestack_max; |
317 | PL_retstack = c->retstack; |
345 | PL_retstack = c->retstack; |
318 | PL_retstack_ix = c->retstack_ix; |
346 | PL_retstack_ix = c->retstack_ix; |
319 | PL_retstack_max = c->retstack_max; |
347 | PL_retstack_max = c->retstack_max; |
320 | PL_curcop = c->curcop; |
348 | PL_curcop = c->curcop; |
321 | PL_start_env = c->start_env; |
|
|
322 | PL_top_env = c->top_env; |
349 | PL_top_env = c->top_env; |
323 | |
350 | |
324 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
351 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
325 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
352 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
326 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
353 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
… | |
… | |
334 | { |
361 | { |
335 | AV *padlist = (AV *)POPs; |
362 | AV *padlist = (AV *)POPs; |
336 | |
363 | |
337 | if (padlist) |
364 | if (padlist) |
338 | { |
365 | { |
339 | put_padlist (cv); /* mark this padlist as available */ |
366 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
340 | CvPADLIST(cv) = padlist; |
367 | CvPADLIST(cv) = padlist; |
341 | #ifdef USE_THREADS |
|
|
342 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
343 | #endif |
|
|
344 | } |
368 | } |
345 | |
369 | |
346 | ++CvDEPTH(cv); |
370 | ++CvDEPTH(cv); |
347 | } |
371 | } |
348 | |
372 | |
… | |
… | |
366 | |
390 | |
367 | PUSHs (Nullsv); |
391 | PUSHs (Nullsv); |
368 | /* this loop was inspired by pp_caller */ |
392 | /* this loop was inspired by pp_caller */ |
369 | for (;;) |
393 | for (;;) |
370 | { |
394 | { |
371 | do |
395 | while (cxix >= 0) |
372 | { |
396 | { |
373 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
397 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
374 | |
398 | |
375 | if (CxTYPE(cx) == CXt_SUB) |
399 | if (CxTYPE(cx) == CXt_SUB) |
376 | { |
400 | { |
377 | CV *cv = cx->blk_sub.cv; |
401 | CV *cv = cx->blk_sub.cv; |
378 | if (CvDEPTH(cv)) |
402 | if (CvDEPTH(cv)) |
379 | { |
403 | { |
380 | #ifdef USE_THREADS |
|
|
381 | /*XPUSHs ((SV *)CvOWNER(cv));*/ |
|
|
382 | /*CvOWNER(cv) = 0;*/ |
|
|
383 | /*error must unlock this cv etc.. etc...*/ |
|
|
384 | #endif |
|
|
385 | EXTEND (SP, CvDEPTH(cv)*2); |
404 | EXTEND (SP, CvDEPTH(cv)*2); |
386 | |
405 | |
387 | while (--CvDEPTH(cv)) |
406 | while (--CvDEPTH(cv)) |
388 | { |
407 | { |
389 | /* this tells the restore code to increment CvDEPTH */ |
408 | /* this tells the restore code to increment CvDEPTH */ |
… | |
… | |
392 | } |
411 | } |
393 | |
412 | |
394 | PUSHs ((SV *)CvPADLIST(cv)); |
413 | PUSHs ((SV *)CvPADLIST(cv)); |
395 | PUSHs ((SV *)cv); |
414 | PUSHs ((SV *)cv); |
396 | |
415 | |
397 | get_padlist (cv); /* this is a monster */ |
416 | get_padlist (aTHX_ cv); /* this is a monster */ |
398 | } |
417 | } |
399 | } |
418 | } |
|
|
419 | #ifdef CXt_FORMAT |
400 | else if (CxTYPE(cx) == CXt_FORMAT) |
420 | else if (CxTYPE(cx) == CXt_FORMAT) |
401 | { |
421 | { |
402 | /* I never used formats, so how should I know how these are implemented? */ |
422 | /* I never used formats, so how should I know how these are implemented? */ |
403 | /* my bold guess is as a simple, plain sub... */ |
423 | /* my bold guess is as a simple, plain sub... */ |
404 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
424 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
405 | } |
425 | } |
|
|
426 | #endif |
406 | } |
427 | } |
407 | while (cxix >= 0); |
|
|
408 | |
428 | |
409 | if (top_si->si_type == PERLSI_MAIN) |
429 | if (top_si->si_type == PERLSI_MAIN) |
410 | break; |
430 | break; |
411 | |
431 | |
412 | top_si = top_si->si_prev; |
432 | top_si = top_si->si_prev; |
… | |
… | |
419 | |
439 | |
420 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
440 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
421 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
441 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
422 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
442 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
423 | |
443 | |
424 | /* I have not the slightest idea of why av_reify is necessary */ |
|
|
425 | /* but if it's missing the defav contents magically get replaced sometimes */ |
|
|
426 | if (c->defav) |
|
|
427 | av_reify (c->defav); |
|
|
428 | |
|
|
429 | c->dowarn = PL_dowarn; |
444 | c->dowarn = PL_dowarn; |
|
|
445 | c->in_eval = PL_in_eval; |
430 | |
446 | |
431 | c->curstackinfo = PL_curstackinfo; |
447 | c->curstackinfo = PL_curstackinfo; |
432 | c->curstack = PL_curstack; |
448 | c->curstack = PL_curstack; |
433 | c->mainstack = PL_mainstack; |
449 | c->mainstack = PL_mainstack; |
434 | c->stack_sp = PL_stack_sp; |
450 | c->stack_sp = PL_stack_sp; |
435 | c->op = PL_op; |
451 | c->op = PL_op; |
436 | c->curpad = PL_curpad; |
452 | c->curpad = PL_curpad; |
|
|
453 | c->comppad = PL_comppad; |
437 | c->stack_base = PL_stack_base; |
454 | c->stack_base = PL_stack_base; |
438 | c->stack_max = PL_stack_max; |
455 | c->stack_max = PL_stack_max; |
439 | c->tmps_stack = PL_tmps_stack; |
456 | c->tmps_stack = PL_tmps_stack; |
440 | c->tmps_floor = PL_tmps_floor; |
457 | c->tmps_floor = PL_tmps_floor; |
441 | c->tmps_ix = PL_tmps_ix; |
458 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
451 | c->savestack_max = PL_savestack_max; |
468 | c->savestack_max = PL_savestack_max; |
452 | c->retstack = PL_retstack; |
469 | c->retstack = PL_retstack; |
453 | c->retstack_ix = PL_retstack_ix; |
470 | c->retstack_ix = PL_retstack_ix; |
454 | c->retstack_max = PL_retstack_max; |
471 | c->retstack_max = PL_retstack_max; |
455 | c->curcop = PL_curcop; |
472 | c->curcop = PL_curcop; |
456 | c->start_env = PL_start_env; |
|
|
457 | c->top_env = PL_top_env; |
473 | c->top_env = PL_top_env; |
458 | } |
474 | } |
459 | |
475 | |
460 | /* |
476 | /* |
461 | * allocate various perl stacks. This is an exact copy |
477 | * allocate various perl stacks. This is an exact copy |
462 | * of perl.c:init_stacks, except that it uses less memory |
478 | * of perl.c:init_stacks, except that it uses less memory |
463 | * on the assumption that coroutines do not usually need |
479 | * on the (sometimes correct) assumption that coroutines do |
464 | * a lot of stackspace. |
480 | * not usually need a lot of stackspace. |
465 | */ |
481 | */ |
466 | STATIC void |
482 | STATIC void |
467 | coro_init_stacks (pTHX) |
483 | coro_init_stacks (pTHX) |
468 | { |
484 | { |
|
|
485 | LOCK; |
|
|
486 | |
469 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
487 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
470 | PL_curstackinfo->si_type = PERLSI_MAIN; |
488 | PL_curstackinfo->si_type = PERLSI_MAIN; |
471 | PL_curstack = PL_curstackinfo->si_stack; |
489 | PL_curstack = PL_curstackinfo->si_stack; |
472 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
490 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
473 | |
491 | |
… | |
… | |
482 | |
500 | |
483 | New(54,PL_markstack,16,I32); |
501 | New(54,PL_markstack,16,I32); |
484 | PL_markstack_ptr = PL_markstack; |
502 | PL_markstack_ptr = PL_markstack; |
485 | PL_markstack_max = PL_markstack + 16; |
503 | PL_markstack_max = PL_markstack + 16; |
486 | |
504 | |
|
|
505 | #ifdef SET_MARK_OFFSET |
487 | SET_MARK_OFFSET; |
506 | SET_MARK_OFFSET; |
|
|
507 | #endif |
488 | |
508 | |
489 | New(54,PL_scopestack,16,I32); |
509 | New(54,PL_scopestack,16,I32); |
490 | PL_scopestack_ix = 0; |
510 | PL_scopestack_ix = 0; |
491 | PL_scopestack_max = 16; |
511 | PL_scopestack_max = 16; |
492 | |
512 | |
… | |
… | |
495 | PL_savestack_max = 96; |
515 | PL_savestack_max = 96; |
496 | |
516 | |
497 | New(54,PL_retstack,8,OP*); |
517 | New(54,PL_retstack,8,OP*); |
498 | PL_retstack_ix = 0; |
518 | PL_retstack_ix = 0; |
499 | PL_retstack_max = 8; |
519 | PL_retstack_max = 8; |
|
|
520 | |
|
|
521 | UNLOCK; |
500 | } |
522 | } |
501 | |
523 | |
502 | /* |
524 | /* |
503 | * destroy the stacks, the callchain etc... |
525 | * destroy the stacks, the callchain etc... |
504 | * still there is a memleak of 128 bytes... |
|
|
505 | */ |
526 | */ |
506 | STATIC void |
527 | STATIC void |
507 | destroy_stacks(pTHX) |
528 | destroy_stacks(pTHX) |
508 | { |
529 | { |
|
|
530 | if (!IN_DESTRUCT) |
|
|
531 | { |
509 | /* is this ugly, I ask? */ |
532 | /* is this ugly, I ask? */ |
510 | while (PL_scopestack_ix) |
533 | LEAVE_SCOPE (0); |
511 | LEAVE; |
|
|
512 | |
534 | |
513 | /* sure it is, but more important: is it correct?? :/ */ |
535 | /* sure it is, but more important: is it correct?? :/ */ |
514 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
515 | FREETMPS; |
536 | FREETMPS; |
|
|
537 | } |
516 | |
538 | |
517 | while (PL_curstackinfo->si_next) |
539 | while (PL_curstackinfo->si_next) |
518 | PL_curstackinfo = PL_curstackinfo->si_next; |
540 | PL_curstackinfo = PL_curstackinfo->si_next; |
519 | |
541 | |
520 | while (PL_curstackinfo) |
542 | while (PL_curstackinfo) |
… | |
… | |
525 | dSP; |
547 | dSP; |
526 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
548 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
527 | PUTBACK; /* possibly superfluous */ |
549 | PUTBACK; /* possibly superfluous */ |
528 | } |
550 | } |
529 | |
551 | |
|
|
552 | if (!IN_DESTRUCT) |
|
|
553 | { |
530 | dounwind(-1); |
554 | dounwind(-1); |
531 | |
|
|
532 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
555 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
|
|
556 | } |
|
|
557 | |
533 | Safefree(PL_curstackinfo->si_cxstack); |
558 | Safefree(PL_curstackinfo->si_cxstack); |
534 | Safefree(PL_curstackinfo); |
559 | Safefree(PL_curstackinfo); |
535 | PL_curstackinfo = p; |
560 | PL_curstackinfo = p; |
536 | } |
561 | } |
537 | |
562 | |
… | |
… | |
550 | New (0, stack, 1, coro_stack); |
575 | New (0, stack, 1, coro_stack); |
551 | |
576 | |
552 | stack->refcnt = 1; |
577 | stack->refcnt = 1; |
553 | stack->usecnt = 1; |
578 | stack->usecnt = 1; |
554 | stack->gencnt = ctx->gencnt = 0; |
579 | stack->gencnt = ctx->gencnt = 0; |
|
|
580 | |
555 | if (alloc) |
581 | if (alloc) |
556 | { |
582 | { |
557 | #ifdef HAVE_MMAP |
583 | #if HAVE_MMAP |
558 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
584 | stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ |
559 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); |
585 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
560 | if (stack->sptr == (void *)-1) |
586 | if (stack->sptr == (void *)-1) |
561 | #endif |
587 | #endif |
562 | { |
588 | { |
563 | /*FIXME*//*D*//* reasonable stack size! */ |
589 | /*FIXME*//*D*//* reasonable stack size! */ |
564 | stack->ssize = -4096 * sizeof (long); |
590 | stack->ssize = - (8192 * sizeof (long)); |
565 | New (0, stack->sptr, 4096, long); |
591 | New (0, stack->sptr, 8192, long); |
566 | } |
592 | } |
567 | } |
593 | } |
568 | else |
594 | else |
569 | stack->sptr = 0; |
595 | stack->sptr = 0; |
570 | |
596 | |
… | |
… | |
584 | { |
610 | { |
585 | #ifdef HAVE_MMAP |
611 | #ifdef HAVE_MMAP |
586 | if (stack->ssize > 0 && stack->sptr) |
612 | if (stack->ssize > 0 && stack->sptr) |
587 | munmap (stack->sptr, stack->ssize); |
613 | munmap (stack->sptr, stack->ssize); |
588 | else |
614 | else |
589 | #else |
615 | #endif |
590 | Safefree (stack->sptr); |
616 | Safefree (stack->sptr); |
591 | #endif |
617 | |
592 | Safefree (stack); |
618 | Safefree (stack); |
593 | } |
619 | } |
594 | else if (ctx->gencnt == stack->gencnt) |
620 | else if (ctx->gencnt == stack->gencnt) |
595 | --stack->usecnt; |
621 | --stack->usecnt; |
596 | } |
622 | } |
… | |
… | |
600 | setup_coro (void *arg) |
626 | setup_coro (void *arg) |
601 | { |
627 | { |
602 | /* |
628 | /* |
603 | * emulate part of the perl startup here. |
629 | * emulate part of the perl startup here. |
604 | */ |
630 | */ |
|
|
631 | dTHX; |
605 | dSP; |
632 | dSP; |
606 | Coro__State ctx = (Coro__State)arg; |
633 | Coro__State ctx = (Coro__State)arg; |
607 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
634 | SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); |
608 | |
635 | |
609 | coro_init_stacks (aTHX); |
636 | coro_init_stacks (aTHX); |
610 | JMPENV_BOOTSTRAP; |
637 | /*PL_curcop = 0;*/ |
|
|
638 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
|
|
639 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
640 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
|
|
641 | |
611 | SPAGAIN; |
642 | SPAGAIN; |
612 | |
|
|
613 | /*PL_curcop = 0;*/ |
|
|
614 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
615 | GvAV (PL_defgv) = ctx->args; |
|
|
616 | |
643 | |
617 | if (ctx->stack) |
644 | if (ctx->stack) |
618 | { |
645 | { |
619 | ctx->cursp = 0; |
646 | ctx->cursp = 0; |
620 | |
647 | |
621 | PUSHMARK(SP); |
648 | PUSHMARK(SP); |
622 | PUTBACK; |
649 | PUTBACK; |
623 | (void) call_sv (sub_init, G_VOID|G_NOARGS); |
650 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
651 | |
|
|
652 | if (SvTRUE (ERRSV)) |
|
|
653 | croak (NULL); |
|
|
654 | else |
624 | croak ("FATAL: CCTXT coroutine returned!"); |
655 | croak ("FATAL: CCTXT coroutine returned!"); |
625 | } |
656 | } |
626 | else |
657 | else |
627 | { |
658 | { |
628 | UNOP myop; |
659 | UNOP myop; |
629 | |
660 | |
… | |
… | |
641 | * that doesn't matter, though, since it is only |
672 | * that doesn't matter, though, since it is only |
642 | * pp_nextstate and we never return... |
673 | * pp_nextstate and we never return... |
643 | * ah yes, and I don't care anyways ;) |
674 | * ah yes, and I don't care anyways ;) |
644 | */ |
675 | */ |
645 | PUTBACK; |
676 | PUTBACK; |
646 | PL_op = pp_entersub(); |
677 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
647 | SPAGAIN; |
678 | SPAGAIN; |
648 | |
679 | |
649 | ENTER; /* necessary e.g. for dounwind */ |
680 | ENTER; /* necessary e.g. for dounwind */ |
650 | } |
681 | } |
651 | } |
682 | } |
… | |
… | |
654 | continue_coro (void *arg) |
685 | continue_coro (void *arg) |
655 | { |
686 | { |
656 | /* |
687 | /* |
657 | * this is a _very_ stripped down perl interpreter ;) |
688 | * this is a _very_ stripped down perl interpreter ;) |
658 | */ |
689 | */ |
|
|
690 | dTHX; |
659 | Coro__State ctx = (Coro__State)arg; |
691 | Coro__State ctx = (Coro__State)arg; |
|
|
692 | JMPENV coro_start_env; |
|
|
693 | |
|
|
694 | PL_top_env = &ctx->start_env; |
660 | |
695 | |
661 | ctx->cursp = 0; |
696 | ctx->cursp = 0; |
662 | PL_op = PL_op->op_next; |
697 | PL_op = PL_op->op_next; |
663 | CALLRUNOPS(aTHX); |
698 | CALLRUNOPS(aTHX); |
664 | /*NORETURN*/ |
699 | |
665 | abort (); |
700 | abort (); |
666 | } |
701 | } |
667 | |
702 | |
668 | STATIC void |
703 | STATIC void |
669 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
704 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
670 | { |
705 | { |
671 | dSP; |
|
|
672 | dSTACKLEVEL; |
706 | dSTACKLEVEL; |
673 | |
707 | |
674 | if (prev != next) |
708 | if (prev != next) |
675 | { |
709 | { |
676 | if (next->mainstack) |
710 | if (next->mainstack) |
677 | { |
711 | { |
|
|
712 | LOCK; |
678 | SAVE (prev, flags); |
713 | SAVE (prev, flags); |
679 | LOAD (next); |
714 | LOAD (next); |
|
|
715 | UNLOCK; |
680 | |
716 | |
681 | /* mark this state as in-use */ |
717 | /* mark this state as in-use */ |
682 | next->mainstack = 0; |
718 | next->mainstack = 0; |
683 | next->tmps_ix = -2; |
719 | next->tmps_ix = -2; |
684 | |
720 | |
… | |
… | |
703 | continue_coro, (void *)next, |
739 | continue_coro, (void *)next, |
704 | next->stack->sptr, labs (next->stack->ssize)); |
740 | next->stack->sptr, labs (next->stack->ssize)); |
705 | } |
741 | } |
706 | |
742 | |
707 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
743 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
744 | prev->cursp = stacklevel; |
|
|
745 | /* don't add any code here */ |
708 | } |
746 | } |
709 | |
747 | else |
|
|
748 | next->cursp = stacklevel; |
710 | } |
749 | } |
711 | else if (next->tmps_ix == -2) |
750 | else if (next->tmps_ix == -2) |
712 | croak ("tried to transfer to running coroutine"); |
751 | croak ("tried to transfer to running coroutine"); |
713 | else |
752 | else |
714 | { |
753 | { |
|
|
754 | LOCK; |
715 | SAVE (prev, -1); /* first get rid of the old state */ |
755 | SAVE (prev, -1); /* first get rid of the old state */ |
|
|
756 | UNLOCK; |
716 | |
757 | |
717 | if (flags & TRANSFER_SAVE_CCTXT) |
758 | if (flags & TRANSFER_SAVE_CCTXT) |
718 | { |
759 | { |
719 | if (!prev->stack) |
760 | if (!prev->stack) |
720 | allocate_stack (prev, 0); |
761 | allocate_stack (prev, 0); |
721 | |
762 | |
722 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
763 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
723 | { |
764 | { |
|
|
765 | PL_top_env = &next->start_env; |
|
|
766 | |
724 | setup_coro (next); |
767 | setup_coro (next); |
|
|
768 | next->cursp = stacklevel; |
725 | |
769 | |
726 | prev->stack->refcnt++; |
770 | prev->stack->refcnt++; |
727 | prev->stack->usecnt++; |
771 | prev->stack->usecnt++; |
728 | next->stack = prev->stack; |
772 | next->stack = prev->stack; |
729 | next->gencnt = prev->gencnt; |
773 | next->gencnt = prev->gencnt; |
730 | } |
774 | } |
731 | else |
775 | else |
732 | { |
776 | { |
|
|
777 | assert (!next->stack); |
733 | allocate_stack (next, 1); |
778 | allocate_stack (next, 1); |
734 | coro_create (&(next->stack->cctx), |
779 | coro_create (&(next->stack->cctx), |
735 | setup_coro, (void *)next, |
780 | setup_coro, (void *)next, |
736 | next->stack->sptr, labs (next->stack->ssize)); |
781 | next->stack->sptr, labs (next->stack->ssize)); |
737 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
782 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
783 | prev->cursp = stacklevel; |
|
|
784 | /* don't add any code here */ |
738 | } |
785 | } |
739 | } |
786 | } |
740 | else |
787 | else |
|
|
788 | { |
741 | setup_coro (next); |
789 | setup_coro (next); |
|
|
790 | next->cursp = stacklevel; |
|
|
791 | } |
742 | } |
792 | } |
743 | } |
793 | } |
744 | |
794 | |
745 | next->cursp = stacklevel; |
795 | LOCK; |
|
|
796 | if (coro_mortal) |
|
|
797 | { |
|
|
798 | SvREFCNT_dec (coro_mortal); |
|
|
799 | coro_mortal = 0; |
|
|
800 | } |
|
|
801 | UNLOCK; |
|
|
802 | } |
|
|
803 | |
|
|
804 | #define SV_CORO(sv,func) \ |
|
|
805 | do { \ |
|
|
806 | if (SvROK (sv)) \ |
|
|
807 | sv = SvRV (sv); \ |
|
|
808 | \ |
|
|
809 | if (SvTYPE (sv) == SVt_PVHV) \ |
|
|
810 | { \ |
|
|
811 | HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
812 | \ |
|
|
813 | if (!he) \ |
|
|
814 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
815 | \ |
|
|
816 | (sv) = SvRV (HeVAL(he)); \ |
|
|
817 | } \ |
|
|
818 | \ |
|
|
819 | /* must also be changed inside Coro::Cont::yield */ \ |
|
|
820 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
|
|
821 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
|
|
822 | \ |
|
|
823 | } while(0) |
|
|
824 | |
|
|
825 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
826 | |
|
|
827 | static void |
|
|
828 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
829 | { |
|
|
830 | SV_CORO (prev, "Coro::transfer"); |
|
|
831 | SV_CORO (next, "Coro::transfer"); |
|
|
832 | |
|
|
833 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
|
|
834 | } |
|
|
835 | |
|
|
836 | /** Coro ********************************************************************/ |
|
|
837 | |
|
|
838 | #define PRIO_MAX 3 |
|
|
839 | #define PRIO_HIGH 1 |
|
|
840 | #define PRIO_NORMAL 0 |
|
|
841 | #define PRIO_LOW -1 |
|
|
842 | #define PRIO_IDLE -3 |
|
|
843 | #define PRIO_MIN -4 |
|
|
844 | |
|
|
845 | /* for Coro.pm */ |
|
|
846 | static GV *coro_current, *coro_idle; |
|
|
847 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
848 | static int coro_nready; |
|
|
849 | |
|
|
850 | static void |
|
|
851 | coro_enq (pTHX_ SV *sv) |
|
|
852 | { |
|
|
853 | if (SvTYPE (sv) == SVt_PVHV) |
|
|
854 | { |
|
|
855 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
856 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
857 | |
|
|
858 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
859 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
860 | : prio; |
|
|
861 | |
|
|
862 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
863 | coro_nready++; |
|
|
864 | |
|
|
865 | return; |
|
|
866 | } |
|
|
867 | |
|
|
868 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
869 | } |
|
|
870 | |
|
|
871 | static SV * |
|
|
872 | coro_deq (pTHX_ int min_prio) |
|
|
873 | { |
|
|
874 | int prio = PRIO_MAX - PRIO_MIN; |
|
|
875 | |
|
|
876 | min_prio -= PRIO_MIN; |
|
|
877 | if (min_prio < 0) |
|
|
878 | min_prio = 0; |
|
|
879 | |
|
|
880 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
|
|
881 | if (av_len (coro_ready[prio]) >= 0) |
|
|
882 | { |
|
|
883 | coro_nready--; |
|
|
884 | return av_shift (coro_ready[prio]); |
|
|
885 | } |
|
|
886 | |
|
|
887 | return 0; |
|
|
888 | } |
|
|
889 | |
|
|
890 | static void |
|
|
891 | api_ready (SV *coro) |
|
|
892 | { |
|
|
893 | dTHX; |
|
|
894 | |
|
|
895 | if (SvROK (coro)) |
|
|
896 | coro = SvRV (coro); |
|
|
897 | |
|
|
898 | LOCK; |
|
|
899 | coro_enq (aTHX_ SvREFCNT_inc (coro)); |
|
|
900 | UNLOCK; |
|
|
901 | } |
|
|
902 | |
|
|
903 | static void |
|
|
904 | api_schedule (void) |
|
|
905 | { |
|
|
906 | dTHX; |
|
|
907 | |
|
|
908 | SV *prev, *next; |
|
|
909 | |
|
|
910 | LOCK; |
|
|
911 | |
|
|
912 | prev = SvRV (GvSV (coro_current)); |
|
|
913 | next = coro_deq (aTHX_ PRIO_MIN); |
|
|
914 | |
|
|
915 | if (!next) |
|
|
916 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
|
|
917 | |
|
|
918 | /* free this only after the transfer */ |
|
|
919 | coro_mortal = prev; |
|
|
920 | SV_CORO (prev, "Coro::schedule"); |
|
|
921 | |
|
|
922 | SvRV (GvSV (coro_current)) = next; |
|
|
923 | |
|
|
924 | SV_CORO (next, "Coro::schedule"); |
|
|
925 | |
|
|
926 | UNLOCK; |
|
|
927 | |
|
|
928 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
|
|
929 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
930 | } |
|
|
931 | |
|
|
932 | static void |
|
|
933 | api_cede (void) |
|
|
934 | { |
|
|
935 | dTHX; |
|
|
936 | |
|
|
937 | LOCK; |
|
|
938 | coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
939 | UNLOCK; |
|
|
940 | |
|
|
941 | api_schedule (); |
746 | } |
942 | } |
747 | |
943 | |
748 | MODULE = Coro::State PACKAGE = Coro::State |
944 | MODULE = Coro::State PACKAGE = Coro::State |
749 | |
945 | |
750 | PROTOTYPES: ENABLE |
946 | PROTOTYPES: ENABLE |
751 | |
947 | |
752 | BOOT: |
948 | BOOT: |
753 | { /* {} necessary for stoopid perl-5.6.x */ |
949 | { /* {} necessary for stoopid perl-5.6.x */ |
|
|
950 | #ifdef USE_ITHREADS |
|
|
951 | MUTEX_INIT (&coro_mutex); |
|
|
952 | #endif |
|
|
953 | |
754 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
954 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
755 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
955 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
756 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
956 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
757 | |
957 | |
758 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
958 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
759 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
959 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
760 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
960 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
761 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
961 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
762 | |
962 | |
763 | if (!padlist_cache) |
|
|
764 | padlist_cache = newHV (); |
|
|
765 | |
|
|
766 | main_mainstack = PL_mainstack; |
963 | main_mainstack = PL_mainstack; |
|
|
964 | |
|
|
965 | coroapi.ver = CORO_API_VERSION; |
|
|
966 | coroapi.transfer = api_transfer; |
767 | } |
967 | } |
768 | |
968 | |
769 | Coro::State |
969 | Coro::State |
770 | _newprocess(args) |
970 | _newprocess(args) |
771 | SV * args |
971 | SV * args |
… | |
… | |
774 | Coro__State coro; |
974 | Coro__State coro; |
775 | |
975 | |
776 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
976 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
777 | croak ("Coro::State::_newprocess expects an arrayref"); |
977 | croak ("Coro::State::_newprocess expects an arrayref"); |
778 | |
978 | |
779 | New (0, coro, 1, struct coro); |
979 | Newz (0, coro, 1, struct coro); |
780 | |
980 | |
781 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
981 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
782 | coro->mainstack = 0; /* actual work is done inside transfer */ |
982 | coro->mainstack = 0; /* actual work is done inside transfer */ |
783 | coro->stack = 0; |
983 | coro->stack = 0; |
784 | |
984 | |
|
|
985 | /* same as JMPENV_BOOTSTRAP */ |
|
|
986 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
987 | //Zero(&coro->start_env, 1, JMPENV); |
|
|
988 | coro->start_env.je_ret = -1; |
|
|
989 | coro->start_env.je_mustcatch = TRUE; |
|
|
990 | |
785 | RETVAL = coro; |
991 | RETVAL = coro; |
786 | OUTPUT: |
992 | OUTPUT: |
787 | RETVAL |
993 | RETVAL |
788 | |
994 | |
789 | void |
995 | void |
790 | transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) |
996 | transfer(prev, next, flags) |
791 | Coro::State_or_hashref prev |
997 | SV *prev |
792 | Coro::State_or_hashref next |
998 | SV *next |
793 | int flags |
999 | int flags |
794 | PROTOTYPE: @ |
1000 | PROTOTYPE: @ |
795 | CODE: |
1001 | CODE: |
|
|
1002 | PUTBACK; |
|
|
1003 | SV_CORO (next, "Coro::transfer"); |
|
|
1004 | SV_CORO (prev, "Coro::transfer"); |
796 | transfer (aTHX_ prev, next, flags); |
1005 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
|
|
1006 | SPAGAIN; |
797 | |
1007 | |
798 | void |
1008 | void |
799 | DESTROY(coro) |
1009 | DESTROY(coro) |
800 | Coro::State coro |
1010 | Coro::State coro |
801 | CODE: |
1011 | CODE: |
802 | |
1012 | |
803 | if (coro->mainstack && coro->mainstack != main_mainstack) |
1013 | if (coro->mainstack && coro->mainstack != main_mainstack) |
804 | { |
1014 | { |
805 | struct coro temp; |
1015 | struct coro temp; |
806 | |
1016 | |
|
|
1017 | PUTBACK; |
807 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
1018 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
808 | LOAD(aTHX_ coro); |
1019 | LOAD(aTHX_ coro); |
|
|
1020 | SPAGAIN; |
809 | |
1021 | |
810 | destroy_stacks (aTHX); |
1022 | destroy_stacks (aTHX); |
811 | |
1023 | |
812 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
1024 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
1025 | SPAGAIN; |
813 | |
1026 | |
814 | coro->mainstack = 0; |
1027 | coro->mainstack = 0; |
815 | } |
1028 | } |
816 | |
1029 | |
817 | deallocate_stack (coro); |
1030 | deallocate_stack (coro); |
818 | |
1031 | SvREFCNT_dec (coro->args); |
819 | Safefree (coro); |
1032 | Safefree (coro); |
820 | |
1033 | |
821 | void |
1034 | void |
822 | flush() |
1035 | _exit(code) |
|
|
1036 | int code |
|
|
1037 | PROTOTYPE: $ |
823 | CODE: |
1038 | CODE: |
824 | #ifdef MAY_FLUSH |
1039 | _exit (code); |
825 | flush_padlist_cache (); |
|
|
826 | #endif |
|
|
827 | |
1040 | |
828 | MODULE = Coro::State PACKAGE = Coro::Cont |
1041 | MODULE = Coro::State PACKAGE = Coro::Cont |
829 | |
1042 | |
830 | # this is slightly dirty |
1043 | # this is slightly dirty (should expose a c-level api) |
831 | |
1044 | |
832 | void |
1045 | void |
833 | yield(...) |
1046 | yield(...) |
834 | PROTOTYPE: @ |
1047 | PROTOTYPE: @ |
835 | CODE: |
1048 | CODE: |
… | |
… | |
837 | SV *sv; |
1050 | SV *sv; |
838 | AV *defav = GvAV (PL_defgv); |
1051 | AV *defav = GvAV (PL_defgv); |
839 | struct coro *prev, *next; |
1052 | struct coro *prev, *next; |
840 | |
1053 | |
841 | if (!returnstk) |
1054 | if (!returnstk) |
842 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1055 | returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); |
843 | |
1056 | |
844 | /* set up @_ -- ugly */ |
1057 | /* set up @_ -- ugly */ |
845 | av_clear (defav); |
1058 | av_clear (defav); |
846 | av_fill (defav, items - 1); |
1059 | av_fill (defav, items - 1); |
847 | while (items--) |
1060 | while (items--) |
… | |
… | |
853 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1066 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
854 | SvREFCNT_dec (sv); |
1067 | SvREFCNT_dec (sv); |
855 | |
1068 | |
856 | transfer(aTHX_ prev, next, 0); |
1069 | transfer(aTHX_ prev, next, 0); |
857 | |
1070 | |
|
|
1071 | MODULE = Coro::State PACKAGE = Coro |
|
|
1072 | |
|
|
1073 | # this is slightly dirty (should expose a c-level api) |
|
|
1074 | |
|
|
1075 | BOOT: |
|
|
1076 | { |
|
|
1077 | int i; |
|
|
1078 | HV *stash = gv_stashpv ("Coro", TRUE); |
|
|
1079 | |
|
|
1080 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
|
|
1081 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
|
|
1082 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
|
|
1083 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
|
|
1084 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
|
|
1085 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
|
|
1086 | |
|
|
1087 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1088 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1089 | |
|
|
1090 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
|
|
1091 | coro_ready[i] = newAV (); |
|
|
1092 | |
|
|
1093 | { |
|
|
1094 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1095 | |
|
|
1096 | coroapi.schedule = api_schedule; |
|
|
1097 | coroapi.cede = api_cede; |
|
|
1098 | coroapi.ready = api_ready; |
|
|
1099 | coroapi.nready = &coro_nready; |
|
|
1100 | coroapi.current = coro_current; |
|
|
1101 | |
|
|
1102 | GCoroAPI = &coroapi; |
|
|
1103 | sv_setiv(sv, (IV)&coroapi); |
|
|
1104 | SvREADONLY_on(sv); |
|
|
1105 | } |
|
|
1106 | } |
|
|
1107 | |
|
|
1108 | #if !PERL_MICRO |
|
|
1109 | |
|
|
1110 | void |
|
|
1111 | ready(self) |
|
|
1112 | SV * self |
|
|
1113 | PROTOTYPE: $ |
|
|
1114 | CODE: |
|
|
1115 | api_ready (self); |
|
|
1116 | |
|
|
1117 | #endif |
|
|
1118 | |
|
|
1119 | int |
|
|
1120 | nready(...) |
|
|
1121 | PROTOTYPE: |
|
|
1122 | CODE: |
|
|
1123 | RETVAL = coro_nready; |
|
|
1124 | OUTPUT: |
|
|
1125 | RETVAL |
|
|
1126 | |
|
|
1127 | void |
|
|
1128 | schedule(...) |
|
|
1129 | PROTOTYPE: |
|
|
1130 | CODE: |
|
|
1131 | api_schedule (); |
|
|
1132 | |
|
|
1133 | void |
|
|
1134 | cede(...) |
|
|
1135 | PROTOTYPE: |
|
|
1136 | CODE: |
|
|
1137 | api_cede (); |
|
|
1138 | |