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