ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.2 by root, Sun Jul 15 02:35:52 2001 UTC vs.
Revision 1.91 by root, Sat Nov 25 01:14:11 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines