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