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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines