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.67 by root, Mon Dec 12 20:07:44 2005 UTC vs.
Revision 1.103 by root, Mon Nov 27 01:33:30 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines