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