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.61 by root, Tue Aug 10 01:56:30 2004 UTC vs.
Revision 1.97 by root, Sun Nov 26 21:21:14 2006 UTC

1#define PERL_NO_GET_CONTEXT 1#define PERL_NO_GET_CONTEXT
2
3#include "libcoro/coro.c"
2 4
3#include "EXTERN.h" 5#include "EXTERN.h"
4#include "perl.h" 6#include "perl.h"
5#include "XSUB.h" 7#include "XSUB.h"
6 8
7#include "patchlevel.h" 9#include "patchlevel.h"
8 10
9#if PATCHLEVEL < 6 11#if PERL_VERSION < 6
10# ifndef PL_ppaddr 12# ifndef PL_ppaddr
11# define PL_ppaddr ppaddr 13# define PL_ppaddr ppaddr
12# endif 14# endif
13# ifndef call_sv 15# ifndef call_sv
14# define call_sv perl_call_sv 16# define call_sv perl_call_sv
25# ifndef IS_PADCONST 27# ifndef IS_PADCONST
26# define IS_PADCONST(v) 0 28# define IS_PADCONST(v) 0
27# endif 29# endif
28#endif 30#endif
29 31
30#include "libcoro/coro.c"
31
32#include <signal.h> 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
33 42
34#ifdef HAVE_MMAP 43#ifdef HAVE_MMAP
35# include <unistd.h> 44# include <unistd.h>
36# include <sys/mman.h> 45# include <sys/mman.h>
37# ifndef MAP_ANONYMOUS 46# ifndef MAP_ANONYMOUS
39# define MAP_ANONYMOUS MAP_ANON 48# define MAP_ANONYMOUS MAP_ANON
40# else 49# else
41# undef HAVE_MMAP 50# undef HAVE_MMAP
42# endif 51# endif
43# endif 52# endif
53# include <limits.h>
54# ifndef PAGESIZE
55# define PAGESIZE pagesize
56# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
57static long pagesize;
58# else
59# define BOOT_PAGESIZE
44#endif 60# endif
45 61#endif
46#define SUB_INIT "Coro::State::initialize"
47#define UCORO_STATE "_coro_state"
48 62
49/* The next macro should declare a variable stacklevel that contains and approximation 63/* The next macro should declare a variable stacklevel that contains and approximation
50 * to the current C stack pointer. Its property is that it changes with each call 64 * to the current C stack pointer. Its property is that it changes with each call
51 * and should be unique. */ 65 * and should be unique. */
66#define dSTACKLEVEL int stacklevel
52#define dSTACKLEVEL void *stacklevel = &stacklevel 67#define STACKLEVEL ((void *)&stacklevel)
53 68
54#define IN_DESTRUCT (PL_main_cv == Nullcv) 69#define IN_DESTRUCT (PL_main_cv == Nullcv)
55 70
56#define labs(l) ((l) >= 0 ? (l) : -(l))
57
58#include "CoroAPI.h" 71#include "CoroAPI.h"
72
73#define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */
59 74
60#ifdef USE_ITHREADS 75#ifdef USE_ITHREADS
61static perl_mutex coro_mutex; 76static perl_mutex coro_mutex;
62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) 77# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) 78# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64#else 79#else
65# define LOCK 0 80# define LOCK (void)0
66# define UNLOCK 0 81# define UNLOCK (void)0
67#endif 82#endif
68 83
69static struct CoroAPI coroapi; 84static struct CoroAPI coroapi;
70static AV *main_mainstack; /* used to differentiate between $main and others */ 85static AV *main_mainstack; /* used to differentiate between $main and others */
71static HV *coro_state_stash; 86static HV *coro_state_stash, *coro_stash;
72static SV *ucoro_state_sv;
73static U32 ucoro_state_hash;
74static SV *coro_mortal; /* will be freed after next transfer */ 87static SV *coro_mortal; /* will be freed after next transfer */
75 88
76/* this is actually not only the c stack but also c registers etc... */ 89/* this is a structure representing a c-level coroutine */
77typedef struct { 90typedef struct coro_stack {
78 int refcnt; /* pointer reference counter */ 91 struct coro_stack *next;
79 int usecnt; /* shared by how many coroutines */
80 int gencnt; /* generation counter */
81 92
82 coro_context cctx; 93 /* the stack */
83
84 void *sptr; 94 void *sptr;
85 long ssize; /* positive == mmap, otherwise malloc */ 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;
86} coro_stack; 101} coro_stack;
87 102
103/* this is a structure representing a perl-level coroutine */
88struct coro { 104struct coro {
89 /* the top-level JMPENV for each coroutine, needed to catch dies. */ 105 /* the c coroutine allocated to this perl coroutine, if any */
90 JMPENV start_env;
91
92 /* the optional C context */
93 coro_stack *stack; 106 coro_stack *stack;
94 void *cursp; 107
108 /* data associated with this coroutine (initial args) */
109 AV *args;
95 int gencnt; 110 int refcnt;
96 111
97 /* optionally saved, might be zero */ 112 /* optionally saved, might be zero */
98 AV *defav; 113 AV *defav;
99 SV *defsv; 114 SV *defsv;
100 SV *errsv; 115 SV *errsv;
109 AV *mainstack; 124 AV *mainstack;
110 SV **stack_sp; 125 SV **stack_sp;
111 OP *op; 126 OP *op;
112 SV **curpad; 127 SV **curpad;
113 AV *comppad; 128 AV *comppad;
129 CV *compcv;
114 SV **stack_base; 130 SV **stack_base;
115 SV **stack_max; 131 SV **stack_max;
116 SV **tmps_stack; 132 SV **tmps_stack;
117 I32 tmps_floor; 133 I32 tmps_floor;
118 I32 tmps_ix; 134 I32 tmps_ix;
127 I32 savestack_ix; 143 I32 savestack_ix;
128 I32 savestack_max; 144 I32 savestack_max;
129 OP **retstack; 145 OP **retstack;
130 I32 retstack_ix; 146 I32 retstack_ix;
131 I32 retstack_max; 147 I32 retstack_max;
148 PMOP *curpm;
132 COP *curcop; 149 COP *curcop;
133 JMPENV *top_env;
134 150
135 /* data associated with this coroutine (initial args) */ 151 /* coro process data */
136 AV *args; 152 int prio;
137}; 153};
138 154
139typedef struct coro *Coro__State; 155typedef struct coro *Coro__State;
140typedef struct coro *Coro__State_or_hashref; 156typedef struct coro *Coro__State_or_hashref;
141 157
142/* mostly copied from op.c:cv_clone2 */ 158static AV *
143STATIC AV * 159coro_clone_padlist (pTHX_ CV *cv)
144clone_padlist (pTHX_ AV *protopadlist)
145{ 160{
146 AV *av; 161 AV *padlist = CvPADLIST (cv);
147 I32 ix;
148 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
149 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
150 SV **pname = AvARRAY (protopad_name);
151 SV **ppad = AvARRAY (protopad);
152 I32 fname = AvFILLp (protopad_name);
153 I32 fpad = AvFILLp (protopad);
154 AV *newpadlist, *newpad_name, *newpad; 162 AV *newpadlist, *newpad;
155 SV **npad;
156
157 newpad_name = newAV ();
158 for (ix = fname; ix >= 0; ix--)
159 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
160
161 newpad = newAV ();
162 av_fill (newpad, AvFILLp (protopad));
163 npad = AvARRAY (newpad);
164 163
165 newpadlist = newAV (); 164 newpadlist = newAV ();
166 AvREAL_off (newpadlist); 165 AvREAL_off (newpadlist);
167 av_store (newpadlist, 0, (SV *) newpad_name); 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)));
168 av_store (newpadlist, 1, (SV *) newpad); 175 av_store (newpadlist, 1, (SV *)newpad);
169
170 av = newAV (); /* will be @_ */
171 av_extend (av, 0);
172 av_store (newpad, 0, (SV *) av);
173 AvFLAGS (av) = AVf_REIFY;
174
175 for (ix = fpad; ix > 0; ix--)
176 {
177 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
178
179 if (namesv && namesv != &PL_sv_undef)
180 {
181 char *name = SvPVX (namesv); /* XXX */
182
183 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
184 { /* lexical from outside? */
185 npad[ix] = SvREFCNT_inc (ppad[ix]);
186 }
187 else
188 { /* our own lexical */
189 SV *sv;
190 if (*name == '&')
191 sv = SvREFCNT_inc (ppad[ix]);
192 else if (*name == '@')
193 sv = (SV *) newAV ();
194 else if (*name == '%')
195 sv = (SV *) newHV ();
196 else
197 sv = NEWSV (0, 0);
198
199#ifdef SvPADBUSY
200 if (!SvPADBUSY (sv))
201#endif
202 SvPADMY_on (sv);
203
204 npad[ix] = sv;
205 }
206 }
207 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
208 {
209 npad[ix] = SvREFCNT_inc (ppad[ix]);
210 }
211 else
212 {
213 SV *sv = NEWSV (0, 0);
214 SvPADTMP_on (sv);
215 npad[ix] = sv;
216 }
217 }
218
219#if 0 /* return -ENOTUNDERSTOOD */
220 /* Now that vars are all in place, clone nested closures. */
221
222 for (ix = fpad; ix > 0; ix--) {
223 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
224 if (namesv
225 && namesv != &PL_sv_undef
226 && !(SvFLAGS(namesv) & SVf_FAKE)
227 && *SvPVX(namesv) == '&'
228 && CvCLONE(ppad[ix]))
229 {
230 CV *kid = cv_clone((CV*)ppad[ix]);
231 SvREFCNT_dec(ppad[ix]);
232 CvCLONE_on(kid);
233 SvPADMY_on(kid);
234 npad[ix] = (SV*)kid;
235 }
236 }
237#endif
238 176
239 return newpadlist; 177 return newpadlist;
240} 178}
241 179
242STATIC void 180static void
243free_padlist (pTHX_ AV *padlist) 181free_padlist (pTHX_ AV *padlist)
244{ 182{
245 /* may be during global destruction */ 183 /* may be during global destruction */
246 if (SvREFCNT (padlist)) 184 if (SvREFCNT (padlist))
247 { 185 {
261 199
262 SvREFCNT_dec ((SV*)padlist); 200 SvREFCNT_dec ((SV*)padlist);
263 } 201 }
264} 202}
265 203
266STATIC int 204static int
267coro_cv_free (pTHX_ SV *sv, MAGIC *mg) 205coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
268{ 206{
269 AV *padlist; 207 AV *padlist;
270 AV *av = (AV *)mg->mg_obj; 208 AV *av = (AV *)mg->mg_obj;
271 209
272 /* casting is fun. */ 210 /* casting is fun. */
273 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 211 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
274 free_padlist (aTHX_ padlist); 212 free_padlist (aTHX_ padlist);
275 213
276 SvREFCNT_dec (av); 214 SvREFCNT_dec (av);
215
216 return 0;
277} 217}
278 218
279#define PERL_MAGIC_coro PERL_MAGIC_ext 219#define PERL_MAGIC_coro PERL_MAGIC_ext
280 220
281static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 221static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
282 222
283/* the next two functions merely cache the padlists */ 223/* the next two functions merely cache the padlists */
284STATIC void 224static void
285get_padlist (pTHX_ CV *cv) 225get_padlist (pTHX_ CV *cv)
286{ 226{
287 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 227 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
288 228
289 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 229 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
290 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 230 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
291 else 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
292 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); 240 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
241#endif
242 }
293} 243}
294 244
295STATIC void 245static void
296put_padlist (pTHX_ CV *cv) 246put_padlist (pTHX_ CV *cv)
297{ 247{
298 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 248 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
299 249
300 if (!mg) 250 if (!mg)
327 PL_mainstack = c->mainstack; 277 PL_mainstack = c->mainstack;
328 PL_stack_sp = c->stack_sp; 278 PL_stack_sp = c->stack_sp;
329 PL_op = c->op; 279 PL_op = c->op;
330 PL_curpad = c->curpad; 280 PL_curpad = c->curpad;
331 PL_comppad = c->comppad; 281 PL_comppad = c->comppad;
282 PL_compcv = c->compcv;
332 PL_stack_base = c->stack_base; 283 PL_stack_base = c->stack_base;
333 PL_stack_max = c->stack_max; 284 PL_stack_max = c->stack_max;
334 PL_tmps_stack = c->tmps_stack; 285 PL_tmps_stack = c->tmps_stack;
335 PL_tmps_floor = c->tmps_floor; 286 PL_tmps_floor = c->tmps_floor;
336 PL_tmps_ix = c->tmps_ix; 287 PL_tmps_ix = c->tmps_ix;
342 PL_scopestack_ix = c->scopestack_ix; 293 PL_scopestack_ix = c->scopestack_ix;
343 PL_scopestack_max = c->scopestack_max; 294 PL_scopestack_max = c->scopestack_max;
344 PL_savestack = c->savestack; 295 PL_savestack = c->savestack;
345 PL_savestack_ix = c->savestack_ix; 296 PL_savestack_ix = c->savestack_ix;
346 PL_savestack_max = c->savestack_max; 297 PL_savestack_max = c->savestack_max;
298#if PERL_VERSION < 9
347 PL_retstack = c->retstack; 299 PL_retstack = c->retstack;
348 PL_retstack_ix = c->retstack_ix; 300 PL_retstack_ix = c->retstack_ix;
349 PL_retstack_max = c->retstack_max; 301 PL_retstack_max = c->retstack_max;
302#endif
303 PL_curpm = c->curpm;
350 PL_curcop = c->curcop; 304 PL_curcop = c->curcop;
351 PL_top_env = c->top_env;
352 305
353 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 306 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
354 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 307 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
355 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 308 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
356 309
413 } 366 }
414 367
415 PUSHs ((SV *)CvPADLIST(cv)); 368 PUSHs ((SV *)CvPADLIST(cv));
416 PUSHs ((SV *)cv); 369 PUSHs ((SV *)cv);
417 370
418 get_padlist (aTHX_ cv); /* this is a monster */ 371 get_padlist (aTHX_ cv);
419 } 372 }
420 } 373 }
421#ifdef CXt_FORMAT 374#ifdef CXt_FORMAT
422 else if (CxTYPE(cx) == CXt_FORMAT) 375 else if (CxTYPE(cx) == CXt_FORMAT)
423 { 376 {
451 c->mainstack = PL_mainstack; 404 c->mainstack = PL_mainstack;
452 c->stack_sp = PL_stack_sp; 405 c->stack_sp = PL_stack_sp;
453 c->op = PL_op; 406 c->op = PL_op;
454 c->curpad = PL_curpad; 407 c->curpad = PL_curpad;
455 c->comppad = PL_comppad; 408 c->comppad = PL_comppad;
409 c->compcv = PL_compcv;
456 c->stack_base = PL_stack_base; 410 c->stack_base = PL_stack_base;
457 c->stack_max = PL_stack_max; 411 c->stack_max = PL_stack_max;
458 c->tmps_stack = PL_tmps_stack; 412 c->tmps_stack = PL_tmps_stack;
459 c->tmps_floor = PL_tmps_floor; 413 c->tmps_floor = PL_tmps_floor;
460 c->tmps_ix = PL_tmps_ix; 414 c->tmps_ix = PL_tmps_ix;
466 c->scopestack_ix = PL_scopestack_ix; 420 c->scopestack_ix = PL_scopestack_ix;
467 c->scopestack_max = PL_scopestack_max; 421 c->scopestack_max = PL_scopestack_max;
468 c->savestack = PL_savestack; 422 c->savestack = PL_savestack;
469 c->savestack_ix = PL_savestack_ix; 423 c->savestack_ix = PL_savestack_ix;
470 c->savestack_max = PL_savestack_max; 424 c->savestack_max = PL_savestack_max;
425#if PERL_VERSION < 9
471 c->retstack = PL_retstack; 426 c->retstack = PL_retstack;
472 c->retstack_ix = PL_retstack_ix; 427 c->retstack_ix = PL_retstack_ix;
473 c->retstack_max = PL_retstack_max; 428 c->retstack_max = PL_retstack_max;
429#endif
430 c->curpm = PL_curpm;
474 c->curcop = PL_curcop; 431 c->curcop = PL_curcop;
475 c->top_env = PL_top_env;
476} 432}
477 433
478/* 434/*
479 * allocate various perl stacks. This is an exact copy 435 * allocate various perl stacks. This is an exact copy
480 * of perl.c:init_stacks, except that it uses less memory 436 * of perl.c:init_stacks, except that it uses less memory
481 * on the (sometimes correct) assumption that coroutines do 437 * on the (sometimes correct) assumption that coroutines do
482 * not usually need a lot of stackspace. 438 * not usually need a lot of stackspace.
483 */ 439 */
484STATIC void 440static void
485coro_init_stacks (pTHX) 441coro_init_stacks (pTHX)
486{ 442{
487 LOCK; 443 LOCK;
488 444
489 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 445 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
514 470
515 New(54,PL_savestack,96,ANY); 471 New(54,PL_savestack,96,ANY);
516 PL_savestack_ix = 0; 472 PL_savestack_ix = 0;
517 PL_savestack_max = 96; 473 PL_savestack_max = 96;
518 474
475#if PERL_VERSION < 9
519 New(54,PL_retstack,8,OP*); 476 New(54,PL_retstack,8,OP*);
520 PL_retstack_ix = 0; 477 PL_retstack_ix = 0;
521 PL_retstack_max = 8; 478 PL_retstack_max = 8;
479#endif
522 480
523 UNLOCK; 481 UNLOCK;
524} 482}
525 483
526/* 484/*
527 * destroy the stacks, the callchain etc... 485 * destroy the stacks, the callchain etc...
528 */ 486 */
529STATIC void 487static void
530destroy_stacks(pTHX) 488destroy_stacks(pTHX)
531{ 489{
532 if (!IN_DESTRUCT) 490 if (!IN_DESTRUCT)
533 { 491 {
534 /* is this ugly, I ask? */ 492 /* is this ugly, I ask? */
566 524
567 Safefree (PL_tmps_stack); 525 Safefree (PL_tmps_stack);
568 Safefree (PL_markstack); 526 Safefree (PL_markstack);
569 Safefree (PL_scopestack); 527 Safefree (PL_scopestack);
570 Safefree (PL_savestack); 528 Safefree (PL_savestack);
529#if PERL_VERSION < 9
571 Safefree (PL_retstack); 530 Safefree (PL_retstack);
572}
573
574static void
575allocate_stack (Coro__State ctx, int alloc)
576{
577 coro_stack *stack;
578
579 New (0, stack, 1, coro_stack);
580
581 stack->refcnt = 1;
582 stack->usecnt = 1;
583 stack->gencnt = ctx->gencnt = 0;
584
585 if (alloc)
586 {
587#if HAVE_MMAP
588 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
589 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
590 if (stack->sptr == (void *)-1)
591#endif 531#endif
592 {
593 /*FIXME*//*D*//* reasonable stack size! */
594 stack->ssize = - (8192 * sizeof (long));
595 New (0, stack->sptr, 8192, long);
596 }
597 }
598 else
599 stack->sptr = 0;
600
601 ctx->stack = stack;
602} 532}
603 533
604static void 534static void
605deallocate_stack (Coro__State ctx) 535setup_coro (struct coro *coro)
606{
607 coro_stack *stack = ctx->stack;
608
609 ctx->stack = 0;
610
611 if (stack)
612 {
613 if (!--stack->refcnt)
614 {
615#ifdef HAVE_MMAP
616 if (stack->ssize > 0 && stack->sptr)
617 munmap (stack->sptr, stack->ssize);
618 else
619#endif
620 Safefree (stack->sptr);
621
622 Safefree (stack);
623 }
624 else if (ctx->gencnt == stack->gencnt)
625 --stack->usecnt;
626 }
627}
628
629static void
630setup_coro (void *arg)
631{ 536{
632 /* 537 /*
633 * emulate part of the perl startup here. 538 * emulate part of the perl startup here.
634 */ 539 */
635 dTHX; 540 dTHX;
636 dSP; 541 dSP;
637 Coro__State ctx = (Coro__State)arg; 542 UNOP myop;
638 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); 543 SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
639 544
640 coro_init_stacks (aTHX); 545 coro_init_stacks (aTHX);
641 /*PL_curcop = 0;*/ 546 /*PL_curcop = 0;*/
642 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 547 /*PL_in_eval = PL_in_eval;*/ /* inherit */
643 SvREFCNT_dec (GvAV (PL_defgv)); 548 SvREFCNT_dec (GvAV (PL_defgv));
644 GvAV (PL_defgv) = ctx->args; ctx->args = 0; 549 GvAV (PL_defgv) = coro->args; coro->args = 0;
645 550
646 SPAGAIN; 551 SPAGAIN;
647 552
648 if (ctx->stack) 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
568static void
569free_coro_mortal ()
570{
571 if (coro_mortal)
649 { 572 {
650 ctx->cursp = 0; 573 dTHX;
651 574
652 PUSHMARK(SP); 575 SvREFCNT_dec (coro_mortal);
653 PUTBACK; 576 coro_mortal = 0;
654 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
655
656 if (SvTRUE (ERRSV))
657 croak (NULL);
658 else
659 croak ("FATAL: CCTXT coroutine returned!");
660 } 577 }
661 else
662 {
663 UNOP myop;
664
665 PL_op = (OP *)&myop;
666
667 Zero(&myop, 1, UNOP);
668 myop.op_next = Nullop;
669 myop.op_flags = OPf_WANT_VOID;
670
671 PUSHMARK(SP);
672 XPUSHs (sub_init);
673 /*
674 * the next line is slightly wrong, as PL_op->op_next
675 * is actually being executed so we skip the first op.
676 * that doesn't matter, though, since it is only
677 * pp_nextstate and we never return...
678 * ah yes, and I don't care anyways ;)
679 */
680 PUTBACK;
681 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
682 SPAGAIN;
683
684 ENTER; /* necessary e.g. for dounwind */
685 }
686} 578}
687 579
688static void 580static void
689continue_coro (void *arg) 581coro_run (void *arg)
690{ 582{
691 /* 583 /*
692 * this is a _very_ stripped down perl interpreter ;) 584 * this is a _very_ stripped down perl interpreter ;)
693 */ 585 */
694 dTHX; 586 dTHX;
695 Coro__State ctx = (Coro__State)arg; 587 int ret;
696 JMPENV coro_start_env;
697 588
589 UNLOCK;
590
698 PL_top_env = &ctx->start_env; 591 PL_top_env = &PL_start_env;
699 592
700 ctx->cursp = 0; 593 sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV ((coro_stack *)arg));
701 PL_op = PL_op->op_next; 594 sv_setiv (get_sv ("Coro::State::cctx_restartop", FALSE), PTR2IV (PL_op));
702 CALLRUNOPS(aTHX);
703 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);
704 abort (); 604 abort ();
705} 605}
706 606
707STATIC void 607static coro_stack *
608stack_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
648static void
649stack_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
663static coro_stack *stack_first;
664
665static coro_stack *
666stack_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
684static void
685stack_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 */
692static void
708transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 693transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
709{ 694{
710 dSTACKLEVEL; 695 dSTACKLEVEL;
711 696
697 /* sometimes transfer is only called to set idle_sp */
698 if (flags == TRANSFER_SET_STACKLEVEL)
699 ((coro_stack *)prev)->idle_sp = STACKLEVEL;
712 if (prev != next) 700 else if (prev != next)
713 { 701 {
702 coro_stack *prev__stack;
703
704 LOCK;
705
714 if (next->mainstack) 706 if (next->mainstack)
715 { 707 {
716 LOCK; 708 /* coroutine already started */
717 SAVE (prev, flags); 709 SAVE (prev, flags);
718 LOAD (next); 710 LOAD (next);
719 UNLOCK;
720
721 /* mark this state as in-use */
722 next->mainstack = 0;
723 next->tmps_ix = -2;
724
725 /* stacklevel changed? if yes, grab the stack for us! */
726 if (flags & TRANSFER_SAVE_CCTXT)
727 {
728 if (!prev->stack)
729 allocate_stack (prev, 0);
730 else if (prev->cursp != stacklevel
731 && prev->stack->usecnt > 1)
732 {
733 prev->gencnt = ++prev->stack->gencnt;
734 prev->stack->usecnt = 1;
735 }
736
737 /* has our stack been invalidated? */
738 if (next->stack && next->stack->gencnt != next->gencnt)
739 {
740 deallocate_stack (next);
741 allocate_stack (next, 1);
742 coro_create (&(next->stack->cctx),
743 continue_coro, (void *)next,
744 next->stack->sptr, labs (next->stack->ssize));
745 }
746
747 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
748 prev->cursp = stacklevel;
749 /* don't add any code here */
750 }
751 else
752 next->cursp = stacklevel;
753 } 711 }
754 else if (next->tmps_ix == -2)
755 croak ("tried to transfer to running coroutine");
756 else 712 else
757 { 713 {
758 LOCK; 714 /* need to start coroutine */
759 SAVE (prev, -1); /* first get rid of the old state */ 715 /* first get rid of the old state */
760 UNLOCK; 716 SAVE (prev, -1);
761 717 /* setup coroutine call */
762 if (flags & TRANSFER_SAVE_CCTXT)
763 {
764 if (!prev->stack)
765 allocate_stack (prev, 0);
766
767 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
768 {
769 PL_top_env = &next->start_env;
770
771 setup_coro (next);
772 next->cursp = stacklevel;
773
774 prev->stack->refcnt++;
775 prev->stack->usecnt++;
776 next->stack = prev->stack;
777 next->gencnt = prev->gencnt;
778 }
779 else
780 {
781 assert (!next->stack);
782 allocate_stack (next, 1);
783 coro_create (&(next->stack->cctx),
784 setup_coro, (void *)next,
785 next->stack->sptr, labs (next->stack->ssize));
786 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
787 prev->cursp = stacklevel;
788 /* don't add any code here */
789 }
790 }
791 else
792 {
793 setup_coro (next); 718 setup_coro (next);
794 next->cursp = stacklevel; 719 /* need a stack */
795 } 720 next->stack = 0;
796 } 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;
797 } 749 }
750}
798 751
799 LOCK; 752/* use this function pointer to call the above function */
800 if (coro_mortal) 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 */
755void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl;
756
757struct 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
765static void
766coro_state_destroy (struct coro *coro)
767{
768 if (coro->refcnt--)
769 return;
770
771 if (coro->mainstack && coro->mainstack != main_mainstack)
801 { 772 {
802 SvREFCNT_dec (coro_mortal); 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
803 coro_mortal = 0; 782 coro->mainstack = 0;
804 } 783 }
805 UNLOCK;
806}
807 784
808#define SV_CORO(sv,func) \ 785 stack_free (coro->stack);
809 do { \ 786 SvREFCNT_dec (coro->args);
810 if (SvROK (sv)) \ 787 Safefree (coro);
811 sv = SvRV (sv); \ 788}
812 \
813 if (SvTYPE (sv) == SVt_PVHV) \
814 { \
815 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
816 \
817 if (!he) \
818 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
819 \
820 (sv) = SvRV (HeVAL(he)); \
821 } \
822 \
823 /* must also be changed inside Coro::Cont::yield */ \
824 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
825 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
826 \
827 } while(0)
828 789
829#define SvSTATE(sv) (struct coro *)SvIV (sv)
830
831static void 790static int
791coro_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
801static int
802coro_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
811static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
812
813static struct coro *
814SvSTATE (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
835static void
836prepare_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
843static void
832api_transfer(pTHX_ SV *prev, SV *next, int flags) 844api_transfer (SV *prev, SV *next, int flags)
833{ 845{
834 SV_CORO (prev, "Coro::transfer"); 846 dTHX;
835 SV_CORO (next, "Coro::transfer"); 847 struct transfer_args ta;
836 848
837 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 849 prepare_transfer (aTHX_ &ta, prev, next, flags);
850 TRANSFER (ta);
838} 851}
839 852
840/** Coro ********************************************************************/ 853/** Coro ********************************************************************/
841 854
842#define PRIO_MAX 3 855#define PRIO_MAX 3
846#define PRIO_IDLE -3 859#define PRIO_IDLE -3
847#define PRIO_MIN -4 860#define PRIO_MIN -4
848 861
849/* for Coro.pm */ 862/* for Coro.pm */
850static GV *coro_current, *coro_idle; 863static GV *coro_current, *coro_idle;
851static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 864static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
852static int coro_nready; 865static int coro_nready;
853 866
854static void 867static void
855coro_enq (pTHX_ SV *sv) 868coro_enq (pTHX_ SV *sv)
856{ 869{
870 int prio;
871
857 if (SvTYPE (sv) == SVt_PVHV) 872 if (SvTYPE (sv) != SVt_PVHV)
858 {
859 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
860 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
861
862 prio = prio > PRIO_MAX ? PRIO_MAX
863 : prio < PRIO_MIN ? PRIO_MIN
864 : prio;
865
866 av_push (coro_ready [prio - PRIO_MIN], sv);
867 coro_nready++;
868
869 return;
870 }
871
872 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 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++;
873} 879}
874 880
875static SV * 881static SV *
876coro_deq (pTHX_ int min_prio) 882coro_deq (pTHX_ int min_prio)
877{ 883{
880 min_prio -= PRIO_MIN; 886 min_prio -= PRIO_MIN;
881 if (min_prio < 0) 887 if (min_prio < 0)
882 min_prio = 0; 888 min_prio = 0;
883 889
884 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 890 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
885 if (av_len (coro_ready[prio]) >= 0) 891 if (AvFILLp (coro_ready [prio]) >= 0)
886 { 892 {
887 coro_nready--; 893 coro_nready--;
888 return av_shift (coro_ready[prio]); 894 return av_shift (coro_ready [prio]);
889 } 895 }
890 896
891 return 0; 897 return 0;
892} 898}
893 899
903 coro_enq (aTHX_ SvREFCNT_inc (coro)); 909 coro_enq (aTHX_ SvREFCNT_inc (coro));
904 UNLOCK; 910 UNLOCK;
905} 911}
906 912
907static void 913static void
908api_schedule (void) 914prepare_schedule (aTHX_ struct transfer_args *ta)
909{ 915{
910 dTHX;
911
912 SV *prev, *next; 916 SV *current, *prev, *next;
913 917
914 LOCK; 918 LOCK;
915 919
916 prev = SvRV (GvSV (coro_current)); 920 current = GvSV (coro_current);
921
922 for (;;)
923 {
924 LOCK;
925
917 next = coro_deq (aTHX_ PRIO_MIN); 926 next = coro_deq (aTHX_ PRIO_MIN);
918 927
919 if (!next) 928 if (next)
920 next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); 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;
921 950
922 /* free this only after the transfer */ 951 /* free this only after the transfer */
952 free_coro_mortal ();
923 coro_mortal = prev; 953 coro_mortal = prev;
924 SV_CORO (prev, "Coro::schedule");
925 954
926 SvRV (GvSV (coro_current)) = next; 955 ta->prev = SvSTATE (prev);
927 956 ta->next = SvSTATE (next);
928 SV_CORO (next, "Coro::schedule"); 957 ta->flags = TRANSFER_SAVE_ALL;
929 958
930 UNLOCK; 959 UNLOCK;
931
932 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
933 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
934} 960}
935 961
936static void 962static void
937api_cede (void) 963prepare_cede (aTHX_ struct transfer_args *ta)
938{ 964{
939 dTHX;
940
941 LOCK; 965 LOCK;
942 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current)))); 966 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
943 UNLOCK; 967 UNLOCK;
944 968
969 prepare_schedule (ta);
970}
971
972static void
945 api_schedule (); 973api_schedule (void)
974{
975 dTHX;
976 struct transfer_args ta;
977
978 prepare_schedule (&ta);
979 TRANSFER (ta);
980}
981
982static void
983api_cede (void)
984{
985 dTHX;
986 struct transfer_args ta;
987
988 prepare_cede (&ta);
989 TRANSFER (ta);
946} 990}
947 991
948MODULE = Coro::State PACKAGE = Coro::State 992MODULE = Coro::State PACKAGE = Coro::State
949 993
950PROTOTYPES: ENABLE 994PROTOTYPES: DISABLE
951 995
952BOOT: 996BOOT:
953{ /* {} necessary for stoopid perl-5.6.x */ 997{
954#ifdef USE_ITHREADS 998#ifdef USE_ITHREADS
955 MUTEX_INIT (&coro_mutex); 999 MUTEX_INIT (&coro_mutex);
956#endif 1000#endif
1001 BOOT_PAGESIZE;
957 1002
958 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
959 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
960 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1003 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
961 1004
962 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1005 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
963 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1006 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
964 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1007 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
965 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
966 1008
967 main_mainstack = PL_mainstack; 1009 main_mainstack = PL_mainstack;
968 1010
969 coroapi.ver = CORO_API_VERSION; 1011 coroapi.ver = CORO_API_VERSION;
970 coroapi.transfer = api_transfer; 1012 coroapi.transfer = api_transfer;
971}
972 1013
973Coro::State 1014 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
974_newprocess(args) 1015}
975 SV * args 1016
976 PROTOTYPE: $ 1017SV *
1018new (char *klass, ...)
977 CODE: 1019 CODE:
978 Coro__State coro; 1020{
1021 struct coro *coro;
1022 HV *hv;
1023 int i;
979 1024
980 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
981 croak ("Coro::State::_newprocess expects an arrayref");
982
983 Newz (0, coro, 1, struct coro); 1025 Newz (0, coro, 1, struct coro);
1026 coro->args = newAV ();
984 1027
985 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 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
986 /*coro->mainstack = 0; *//*actual work is done inside transfer */ 1035 /*coro->mainstack = 0; *//*actual work is done inside transfer */
987 /*coro->stack = 0;*/ 1036 /*coro->stack = 0;*/
988 1037}
989 /* same as JMPENV_BOOTSTRAP */
990 /* we might be able to recycle start_env, but safe is safe */
991 /*Zero(&coro->start_env, 1, JMPENV);*/
992 coro->start_env.je_ret = -1;
993 coro->start_env.je_mustcatch = TRUE;
994
995 RETVAL = coro;
996 OUTPUT: 1038 OUTPUT:
997 RETVAL 1039 RETVAL
998 1040
999void 1041void
1000transfer(prev, next, flags) 1042_set_stacklevel (...)
1001 SV *prev 1043 ALIAS:
1002 SV *next 1044 Coro::State::transfer = 1
1003 int flags 1045 Coro::schedule = 2
1004 PROTOTYPE: @ 1046 Coro::cede = 3
1047 Coro::Cont::yield = 4
1005 CODE: 1048 CODE:
1006 PUTBACK; 1049{
1007 SV_CORO (next, "Coro::transfer"); 1050 struct transfer_args ta;
1008 SV_CORO (prev, "Coro::transfer"); 1051
1009 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1052 switch (ix)
1010 SPAGAIN; 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}
1011 1105
1012void 1106void
1013DESTROY(coro) 1107_clone_state_from (SV *dst, SV *src)
1014 Coro::State coro 1108 CODE:
1015 CODE: 1109{
1110 struct coro *coro_src = SvSTATE (src);
1016 1111
1017 if (coro->mainstack && coro->mainstack != main_mainstack) 1112 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1018 {
1019 struct coro temp;
1020 1113
1021 PUTBACK; 1114 ++coro_src->refcnt;
1022 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL); 1115 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1023 LOAD (aTHX_ coro); 1116}
1024 SPAGAIN;
1025
1026 destroy_stacks (aTHX);
1027
1028 LOAD ((&temp)); /* this will get rid of defsv etc.. */
1029 SPAGAIN;
1030
1031 coro->mainstack = 0;
1032 }
1033
1034 deallocate_stack (coro);
1035 SvREFCNT_dec (coro->args);
1036 Safefree (coro);
1037 1117
1038void 1118void
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
1124void
1039_exit(code) 1125_exit (code)
1040 int code 1126 int code
1041 PROTOTYPE: $ 1127 PROTOTYPE: $
1042 CODE: 1128 CODE:
1043 _exit (code); 1129 _exit (code);
1044 1130
1045MODULE = Coro::State PACKAGE = Coro::Cont
1046
1047# this is slightly dirty (should expose a c-level api)
1048
1049void
1050yield(...)
1051 PROTOTYPE: @
1052 CODE:
1053 static SV *returnstk;
1054 SV *sv;
1055 AV *defav = GvAV (PL_defgv);
1056 struct coro *prev, *next;
1057
1058 if (!returnstk)
1059 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1060
1061 /* set up @_ -- ugly */
1062 av_clear (defav);
1063 av_fill (defav, items - 1);
1064 while (items--)
1065 av_store (defav, items, SvREFCNT_inc (ST(items)));
1066
1067 SvGETMAGIC (returnstk); /* isn't documentation wrong for mg_get? */
1068 sv = av_pop ((AV *)SvRV (returnstk));
1069 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1070 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1071 SvREFCNT_dec (sv);
1072
1073 transfer (aTHX_ prev, next, 0);
1074
1075MODULE = Coro::State PACKAGE = Coro 1131MODULE = Coro::State PACKAGE = Coro
1076 1132
1077# this is slightly dirty (should expose a c-level api)
1078
1079BOOT: 1133BOOT:
1080{ 1134{
1081 int i; 1135 int i;
1136
1082 HV *stash = gv_stashpv ("Coro", TRUE); 1137 coro_stash = gv_stashpv ("Coro", TRUE);
1083 1138
1084 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1139 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1085 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1140 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1086 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1141 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1087 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1142 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1088 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1143 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1089 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1144 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1090 1145
1091 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1146 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1092 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1147 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1093 1148
1094 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1149 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1102 coroapi.ready = api_ready; 1157 coroapi.ready = api_ready;
1103 coroapi.nready = &coro_nready; 1158 coroapi.nready = &coro_nready;
1104 coroapi.current = coro_current; 1159 coroapi.current = coro_current;
1105 1160
1106 GCoroAPI = &coroapi; 1161 GCoroAPI = &coroapi;
1107 sv_setiv(sv, (IV)&coroapi); 1162 sv_setiv (sv, (IV)&coroapi);
1108 SvREADONLY_on(sv); 1163 SvREADONLY_on (sv);
1109 } 1164 }
1110} 1165}
1111 1166
1112#if !PERL_MICRO 1167int
1168prio (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}
1113 1186
1114void 1187void
1115ready(self) 1188ready (SV *self)
1116 SV * self
1117 PROTOTYPE: $ 1189 PROTOTYPE: $
1118 CODE: 1190 CODE:
1119 api_ready (self); 1191 api_ready (self);
1120 1192
1121#endif
1122
1123int 1193int
1124nready(...) 1194nready (...)
1125 PROTOTYPE: 1195 PROTOTYPE:
1126 CODE: 1196 CODE:
1127 RETVAL = coro_nready; 1197 RETVAL = coro_nready;
1128 OUTPUT: 1198 OUTPUT:
1129 RETVAL 1199 RETVAL
1130 1200
1201MODULE = Coro::State PACKAGE = Coro::AIO
1202
1203SV *
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
1131void 1224void
1132schedule(...) 1225_set_state (char *data_)
1133 PROTOTYPE: 1226 PROTOTYPE: $
1134 CODE: 1227 CODE:
1135 api_schedule (); 1228{
1229 struct {
1230 int errorno;
1231 int laststype;
1232 int laststatval;
1233 Stat_t statcache;
1234 } *data = (void *)data_;
1136 1235
1137void 1236 errno = data->errorno;
1138cede(...) 1237 PL_laststype = data->laststype;
1139 PROTOTYPE: 1238 PL_laststatval = data->laststatval;
1140 CODE: 1239 PL_statcache = data->statcache;
1141 api_cede (); 1240}
1142

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines