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