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