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.5 by root, Tue Jul 17 02:55:29 2001 UTC vs.
Revision 1.248 by root, Mon Sep 29 12:40:50 2008 UTC

1#include "libcoro/coro.c"
2
3#define PERL_NO_GET_CONTEXT
4#define PERL_EXT
5
1#include "EXTERN.h" 6#include "EXTERN.h"
2#include "perl.h" 7#include "perl.h"
3#include "XSUB.h" 8#include "XSUB.h"
9#include "perliol.h"
4 10
5#if 0 11#include "patchlevel.h"
6# define CHK(x) (void *)0 12
13#include <stdio.h>
14#include <errno.h>
15#include <assert.h>
16
17#ifdef WIN32
18# undef setjmp
19# undef longjmp
20# undef _exit
21# define setjmp _setjmp // deep magic, don't ask
7#else 22#else
8# define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) 23# include <inttypes.h> /* most portable stdint.h */
24#endif
25
26#ifdef HAVE_MMAP
27# include <unistd.h>
28# include <sys/mman.h>
29# ifndef MAP_ANONYMOUS
30# ifdef MAP_ANON
31# define MAP_ANONYMOUS MAP_ANON
32# else
33# undef HAVE_MMAP
34# endif
9#endif 35# endif
36# include <limits.h>
37# ifndef PAGESIZE
38# define PAGESIZE pagesize
39# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
40static long pagesize;
41# else
42# define BOOT_PAGESIZE (void)0
43# endif
44#else
45# define PAGESIZE 0
46# define BOOT_PAGESIZE (void)0
47#endif
10 48
49#if CORO_USE_VALGRIND
50# include <valgrind/valgrind.h>
51# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
52#else
53# define REGISTER_STACK(cctx,start,end)
54#endif
55
56/* the maximum number of idle cctx that will be pooled */
57#define MAX_IDLE_CCTX 8
58
59#define PERL_VERSION_ATLEAST(a,b,c) \
60 (PERL_REVISION > (a) \
61 || (PERL_REVISION == (a) \
62 && (PERL_VERSION > (b) \
63 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
64
65#if !PERL_VERSION_ATLEAST (5,6,0)
66# ifndef PL_ppaddr
67# define PL_ppaddr ppaddr
68# endif
69# ifndef call_sv
70# define call_sv perl_call_sv
71# endif
72# ifndef get_sv
73# define get_sv perl_get_sv
74# endif
75# ifndef get_cv
76# define get_cv perl_get_cv
77# endif
78# ifndef IS_PADGV
79# define IS_PADGV(v) 0
80# endif
81# ifndef IS_PADCONST
82# define IS_PADCONST(v) 0
83# endif
84#endif
85
86/* 5.8.8 */
87#ifndef GV_NOTQUAL
88# define GV_NOTQUAL 0
89#endif
90#ifndef newSV
91# define newSV(l) NEWSV(0,l)
92#endif
93
94/* 5.11 */
95#ifndef CxHASARGS
96# define CxHASARGS(cx) (cx)->blk_sub.hasargs
97#endif
98
99/* 5.8.7 */
100#ifndef SvRV_set
101# define SvRV_set(s,v) SvRV(s) = (v)
102#endif
103
104#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
105# undef CORO_STACKGUARD
106#endif
107
108#ifndef CORO_STACKGUARD
109# define CORO_STACKGUARD 0
110#endif
111
112/* prefer perl internal functions over our own? */
113#ifndef CORO_PREFER_PERL_FUNCTIONS
114# define CORO_PREFER_PERL_FUNCTIONS 0
115#endif
116
117/* The next macros try to return the current stack pointer, in an as
118 * portable way as possible. */
119#define dSTACKLEVEL volatile char stacklevel
120#define STACKLEVEL ((void *)&stacklevel)
121
122#define IN_DESTRUCT (PL_main_cv == Nullcv)
123
124#if __GNUC__ >= 3
125# define attribute(x) __attribute__(x)
126# define BARRIER __asm__ __volatile__ ("" : : : "memory")
127# define expect(expr,value) __builtin_expect ((expr),(value))
128#else
129# define attribute(x)
130# define BARRIER
131# define expect(expr,value) (expr)
132#endif
133
134#define expect_false(expr) expect ((expr) != 0, 0)
135#define expect_true(expr) expect ((expr) != 0, 1)
136
137#define NOINLINE attribute ((noinline))
138
139#include "CoroAPI.h"
140
141#ifdef USE_ITHREADS
142static perl_mutex coro_mutex;
143# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
144# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
145#else
146# define LOCK (void)0
147# define UNLOCK (void)0
148#endif
149
150/* helper storage struct for Coro::AIO */
151struct io_state
152{
153 int errorno;
154 I32 laststype;
155 int laststatval;
156 Stat_t statcache;
157};
158
159static double (*nvtime)(); /* so why doesn't it take void? */
160
161static size_t coro_stacksize = CORO_STACKSIZE;
162static struct CoroAPI coroapi;
163static AV *main_mainstack; /* used to differentiate between $main and others */
164static JMPENV *main_top_env;
165static HV *coro_state_stash, *coro_stash;
166static volatile SV *coro_mortal; /* will be freed after next transfer */
167
168static GV *irsgv; /* $/ */
169static GV *stdoutgv; /* *STDOUT */
170static SV *rv_diehook;
171static SV *rv_warnhook;
172static HV *hv_sig; /* %SIG */
173
174/* async_pool helper stuff */
175static SV *sv_pool_rss;
176static SV *sv_pool_size;
177static AV *av_async_pool;
178
179/* Coro::AnyEvent */
180static SV *sv_activity;
181
182static struct coro_cctx *cctx_first;
183static int cctx_count, cctx_idle;
184
185enum {
186 CC_MAPPED = 0x01,
187 CC_NOREUSE = 0x02, /* throw this away after tracing */
188 CC_TRACE = 0x04,
189 CC_TRACE_SUB = 0x08, /* trace sub calls */
190 CC_TRACE_LINE = 0x10, /* trace each statement */
191 CC_TRACE_ALL = CC_TRACE_SUB | CC_TRACE_LINE,
192};
193
194/* this is a structure representing a c-level coroutine */
195typedef struct coro_cctx {
196 struct coro_cctx *next;
197
198 /* the stack */
199 void *sptr;
200 size_t ssize;
201
202 /* cpu state */
203 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
204 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
205 JMPENV *top_env;
206 coro_context cctx;
207
208#if CORO_USE_VALGRIND
209 int valgrind_id;
210#endif
211 unsigned char flags;
212} coro_cctx;
213
214enum {
215 CF_RUNNING = 0x0001, /* coroutine is running */
216 CF_READY = 0x0002, /* coroutine is ready */
217 CF_NEW = 0x0004, /* has never been switched to */
218 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
219};
220
221/* the structure where most of the perl state is stored, overlaid on the cxstack */
222typedef struct {
223 SV *defsv;
224 AV *defav;
225 SV *errsv;
226 SV *irsgv;
227#define VAR(name,type) type name;
228# include "state.h"
229#undef VAR
230} perl_slots;
231
232#define SLOT_COUNT ((sizeof (perl_slots) + sizeof (PERL_CONTEXT) - 1) / sizeof (PERL_CONTEXT))
233
234/* this is a structure representing a perl-level coroutine */
11struct coro { 235struct coro {
12 U8 dowarn; 236 /* the c coroutine allocated to this perl coroutine, if any */
13 AV *defav; 237 coro_cctx *cctx;
14 238
15 PERL_SI *curstackinfo; 239 /* process data */
16 AV *curstack;
17 AV *mainstack; 240 AV *mainstack;
18 SV **stack_sp; 241 perl_slots *slot; /* basically the saved sp */
19 OP *op;
20 SV **curpad;
21 SV **stack_base;
22 SV **stack_max;
23 SV **tmps_stack;
24 I32 tmps_floor;
25 I32 tmps_ix;
26 I32 tmps_max;
27 I32 *markstack;
28 I32 *markstack_ptr;
29 I32 *markstack_max;
30 I32 *scopestack;
31 I32 scopestack_ix;
32 I32 scopestack_max;
33 ANY *savestack;
34 I32 savestack_ix;
35 I32 savestack_max;
36 OP **retstack;
37 I32 retstack_ix;
38 I32 retstack_max;
39 COP *curcop;
40 242
41 AV *args; 243 AV *args; /* data associated with this coroutine (initial args) */
244 int refcnt; /* coroutines are refcounted, yes */
245 int flags; /* CF_ flags */
246 HV *hv; /* the perl hash associated with this coro, if any */
247
248 /* statistics */
249 int usecount; /* number of transfers to this coro */
250
251 /* coro process data */
252 int prio;
253 SV *throw; /* exception to be thrown */
254
255 /* async_pool */
256 SV *saved_deffh;
257
258 /* linked list */
259 struct coro *next, *prev;
42}; 260};
43 261
44typedef struct coro *Coro__State; 262typedef struct coro *Coro__State;
45typedef struct coro *Coro__State_or_hashref; 263typedef struct coro *Coro__State_or_hashref;
46 264
47static HV *padlist_cache; 265/** Coro ********************************************************************/
48 266
49/* mostly copied from op.c:cv_clone2 */ 267#define PRIO_MAX 3
50STATIC AV * 268#define PRIO_HIGH 1
51clone_padlist (AV *protopadlist) 269#define PRIO_NORMAL 0
270#define PRIO_LOW -1
271#define PRIO_IDLE -3
272#define PRIO_MIN -4
273
274/* for Coro.pm */
275static SV *coro_current;
276static SV *coro_readyhook;
277static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
278static int coro_nready;
279static struct coro *coro_first;
280
281/** lowlevel stuff **********************************************************/
282
283static SV *
284coro_get_sv (pTHX_ const char *name, int create)
52{ 285{
53 AV *av; 286#if PERL_VERSION_ATLEAST (5,10,0)
54 I32 ix; 287 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
55 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); 288 get_sv (name, create);
56 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); 289#endif
57 SV **pname = AvARRAY (protopad_name); 290 return get_sv (name, create);
58 SV **ppad = AvARRAY (protopad); 291}
59 I32 fname = AvFILLp (protopad_name); 292
60 I32 fpad = AvFILLp (protopad); 293static AV *
294coro_get_av (pTHX_ const char *name, int create)
295{
296#if PERL_VERSION_ATLEAST (5,10,0)
297 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
298 get_av (name, create);
299#endif
300 return get_av (name, create);
301}
302
303static HV *
304coro_get_hv (pTHX_ const char *name, int create)
305{
306#if PERL_VERSION_ATLEAST (5,10,0)
307 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
308 get_hv (name, create);
309#endif
310 return get_hv (name, create);
311}
312
313static AV *
314coro_clone_padlist (pTHX_ CV *cv)
315{
316 AV *padlist = CvPADLIST (cv);
61 AV *newpadlist, *newpad_name, *newpad; 317 AV *newpadlist, *newpad;
62 SV **npad;
63
64 newpad_name = newAV ();
65 for (ix = fname; ix >= 0; ix--)
66 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
67
68 newpad = newAV ();
69 av_fill (newpad, AvFILLp (protopad));
70 npad = AvARRAY (newpad);
71 318
72 newpadlist = newAV (); 319 newpadlist = newAV ();
73 AvREAL_off (newpadlist); 320 AvREAL_off (newpadlist);
74 av_store (newpadlist, 0, (SV *) newpad_name); 321#if PERL_VERSION_ATLEAST (5,10,0)
322 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
323#else
324 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
325#endif
326 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
327 --AvFILLp (padlist);
328
329 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
75 av_store (newpadlist, 1, (SV *) newpad); 330 av_store (newpadlist, 1, (SV *)newpad);
76 331
77 av = newAV (); /* will be @_ */ 332 return newpadlist;
78 av_extend (av, 0); 333}
79 av_store (newpad, 0, (SV *) av);
80 AvFLAGS (av) = AVf_REIFY;
81 334
82 for (ix = fpad; ix > 0; ix--) 335static void
336free_padlist (pTHX_ AV *padlist)
337{
338 /* may be during global destruction */
339 if (SvREFCNT (padlist))
83 { 340 {
84 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 341 I32 i = AvFILLp (padlist);
85 if (namesv && namesv != &PL_sv_undef) 342 while (i >= 0)
86 { 343 {
87 char *name = SvPVX (namesv); /* XXX */ 344 SV **svp = av_fetch (padlist, i--, FALSE);
88 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 345 if (svp)
89 { /* lexical from outside? */
90 npad[ix] = SvREFCNT_inc (ppad[ix]);
91 } 346 {
92 else
93 { /* our own lexical */
94 SV *sv; 347 SV *sv;
95 if (*name == '&') 348 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
96 sv = SvREFCNT_inc (ppad[ix]); 349 SvREFCNT_dec (sv);
97 else if (*name == '@') 350
98 sv = (SV *) newAV (); 351 SvREFCNT_dec (*svp);
99 else if (*name == '%')
100 sv = (SV *) newHV ();
101 else
102 sv = NEWSV (0, 0);
103 if (!SvPADBUSY (sv))
104 SvPADMY_on (sv);
105 npad[ix] = sv;
106 } 352 }
107 } 353 }
108 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
109 {
110 npad[ix] = SvREFCNT_inc (ppad[ix]);
111 }
112 else
113 {
114 SV *sv = NEWSV (0, 0);
115 SvPADTMP_on (sv);
116 npad[ix] = sv;
117 }
118 }
119 354
120#if 0 /* NONOTUNDERSTOOD */
121 /* Now that vars are all in place, clone nested closures. */
122
123 for (ix = fpad; ix > 0; ix--) {
124 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
125 if (namesv
126 && namesv != &PL_sv_undef
127 && !(SvFLAGS(namesv) & SVf_FAKE)
128 && *SvPVX(namesv) == '&'
129 && CvCLONE(ppad[ix]))
130 {
131 CV *kid = cv_clone((CV*)ppad[ix]);
132 SvREFCNT_dec(ppad[ix]);
133 CvCLONE_on(kid);
134 SvPADMY_on(kid);
135 npad[ix] = (SV*)kid;
136 }
137 }
138#endif
139
140 return newpadlist;
141}
142
143STATIC AV *
144free_padlist (AV *padlist)
145{
146 /* may be during global destruction */
147 if (SvREFCNT(padlist))
148 {
149 I32 i = AvFILLp(padlist);
150 while (i >= 0)
151 {
152 SV **svp = av_fetch(padlist, i--, FALSE);
153 SV *sv = svp ? *svp : Nullsv;
154 if (sv)
155 SvREFCNT_dec(sv);
156 }
157
158 SvREFCNT_dec((SV*)padlist); 355 SvREFCNT_dec ((SV*)padlist);
356 }
357}
358
359static int
360coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
361{
362 AV *padlist;
363 AV *av = (AV *)mg->mg_obj;
364
365 /* casting is fun. */
366 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
367 free_padlist (aTHX_ padlist);
368
369 SvREFCNT_dec (av); /* sv_magicext increased the refcount */
370
371 return 0;
372}
373
374#define CORO_MAGIC_type_cv PERL_MAGIC_ext
375#define CORO_MAGIC_type_state PERL_MAGIC_ext
376
377static MGVTBL coro_cv_vtbl = {
378 0, 0, 0, 0,
379 coro_cv_free
380};
381
382#define CORO_MAGIC(sv,type) \
383 SvMAGIC (sv) \
384 ? SvMAGIC (sv)->mg_type == type \
385 ? SvMAGIC (sv) \
386 : mg_find (sv, type) \
387 : 0
388
389#define CORO_MAGIC_cv(cv) CORO_MAGIC (((SV *)(cv)), CORO_MAGIC_type_cv)
390#define CORO_MAGIC_state(sv) CORO_MAGIC (((SV *)(sv)), CORO_MAGIC_type_state)
391
392static struct coro *
393SvSTATE_ (pTHX_ SV *coro)
394{
395 HV *stash;
396 MAGIC *mg;
397
398 if (SvROK (coro))
399 coro = SvRV (coro);
400
401 if (expect_false (SvTYPE (coro) != SVt_PVHV))
402 croak ("Coro::State object required");
403
404 stash = SvSTASH (coro);
405 if (expect_false (stash != coro_stash && stash != coro_state_stash))
406 {
407 /* very slow, but rare, check */
408 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
409 croak ("Coro::State object required");
410 }
411
412 mg = CORO_MAGIC_state (coro);
413 return (struct coro *)mg->mg_ptr;
414}
415
416#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
417
418/* the next two functions merely cache the padlists */
419static void
420get_padlist (pTHX_ CV *cv)
421{
422 MAGIC *mg = CORO_MAGIC_cv (cv);
423 AV *av;
424
425 if (expect_true (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0))
426 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
427 else
428 {
429#if CORO_PREFER_PERL_FUNCTIONS
430 /* this is probably cleaner? but also slower! */
431 /* in practise, it seems to be less stable */
432 CV *cp = Perl_cv_clone (cv);
433 CvPADLIST (cv) = CvPADLIST (cp);
434 CvPADLIST (cp) = 0;
435 SvREFCNT_dec (cp);
436#else
437 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
438#endif
439 }
440}
441
442static void
443put_padlist (pTHX_ CV *cv)
444{
445 MAGIC *mg = CORO_MAGIC_cv (cv);
446 AV *av;
447
448 if (expect_false (!mg))
449 mg = sv_magicext ((SV *)cv, (SV *)newAV (), CORO_MAGIC_type_cv, &coro_cv_vtbl, 0, 0);
450
451 av = (AV *)mg->mg_obj;
452
453 if (expect_false (AvFILLp (av) >= AvMAX (av)))
454 av_extend (av, AvMAX (av) + 1);
455
456 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
457}
458
459/** load & save, init *******************************************************/
460
461static void
462load_perl (pTHX_ Coro__State c)
463{
464 perl_slots *slot = c->slot;
465 c->slot = 0;
466
467 PL_mainstack = c->mainstack;
468
469 GvSV (PL_defgv) = slot->defsv;
470 GvAV (PL_defgv) = slot->defav;
471 GvSV (PL_errgv) = slot->errsv;
472 GvSV (irsgv) = slot->irsgv;
473
474 #define VAR(name,type) PL_ ## name = slot->name;
475 # include "state.h"
476 #undef VAR
477
478 {
479 dSP;
480
481 CV *cv;
482
483 /* now do the ugly restore mess */
484 while (expect_true (cv = (CV *)POPs))
485 {
486 put_padlist (aTHX_ cv); /* mark this padlist as available */
487 CvDEPTH (cv) = PTR2IV (POPs);
488 CvPADLIST (cv) = (AV *)POPs;
489 }
490
491 PUTBACK;
159 } 492 }
160} 493}
161 494
162/* the next tow functions merely cache the padlists */
163STATIC void
164get_padlist (CV *cv)
165{
166 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
167
168 if (he && AvFILLp ((AV *)*he) >= 0)
169 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
170 else
171 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
172}
173
174STATIC void
175put_padlist (CV *cv)
176{
177 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
178
179 if (SvTYPE (*he) != SVt_PVAV)
180 {
181 SvREFCNT_dec (*he);
182 *he = (SV *)newAV ();
183 }
184
185 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
186}
187
188static void 495static void
189SAVE(pTHX_ Coro__State c) 496save_perl (pTHX_ Coro__State c)
190{ 497{
191 { 498 {
192 dSP; 499 dSP;
193 I32 cxix = cxstack_ix; 500 I32 cxix = cxstack_ix;
501 PERL_CONTEXT *ccstk = cxstack;
194 PERL_SI *top_si = PL_curstackinfo; 502 PERL_SI *top_si = PL_curstackinfo;
195 PERL_CONTEXT *ccstk = cxstack;
196 503
197 /* 504 /*
198 * the worst thing you can imagine happens first - we have to save 505 * the worst thing you can imagine happens first - we have to save
199 * (and reinitialize) all cv's in the whole callchain :( 506 * (and reinitialize) all cv's in the whole callchain :(
200 */ 507 */
201 508
202 PUSHs (Nullsv); 509 XPUSHs (Nullsv);
203 /* this loop was inspired by pp_caller */ 510 /* this loop was inspired by pp_caller */
204 for (;;) 511 for (;;)
205 { 512 {
206 while (cxix >= 0) 513 while (expect_true (cxix >= 0))
207 { 514 {
208 PERL_CONTEXT *cx = &ccstk[cxix--]; 515 PERL_CONTEXT *cx = &ccstk[cxix--];
209 516
210 if (CxTYPE(cx) == CXt_SUB) 517 if (expect_true (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT))
211 { 518 {
212 CV *cv = cx->blk_sub.cv; 519 CV *cv = cx->blk_sub.cv;
520
213 if (CvDEPTH(cv)) 521 if (expect_true (CvDEPTH (cv)))
214 { 522 {
215#ifdef USE_THREADS
216 XPUSHs ((SV *)CvOWNER(cv));
217#endif
218 EXTEND (SP, 3); 523 EXTEND (SP, 3);
219 PUSHs ((SV *)CvDEPTH(cv));
220 PUSHs ((SV *)CvPADLIST(cv)); 524 PUSHs ((SV *)CvPADLIST (cv));
525 PUSHs (INT2PTR (SV *, (IV)CvDEPTH (cv)));
221 PUSHs ((SV *)cv); 526 PUSHs ((SV *)cv);
222 527
223 get_padlist (cv);
224
225 CvDEPTH(cv) = 0; 528 CvDEPTH (cv) = 0;
226#ifdef USE_THREADS 529 get_padlist (aTHX_ cv);
227 CvOWNER(cv) = 0;
228 error must unlock this cv etc.. etc...
229 if you are here wondering about this error message then
230 the reason is that it will not work as advertised yet
231#endif
232 } 530 }
233 } 531 }
234 else if (CxTYPE(cx) == CXt_FORMAT) 532 }
533
534 if (expect_true (top_si->si_type == PERLSI_MAIN))
535 break;
536
537 top_si = top_si->si_prev;
538 ccstk = top_si->si_cxstack;
539 cxix = top_si->si_cxix;
540 }
541
542 PUTBACK;
543 }
544
545 /* allocate some space on the context stack for our purposes */
546 /* we manually unroll here, as usually 2 slots is enough */
547 if (SLOT_COUNT >= 1) CXINC;
548 if (SLOT_COUNT >= 2) CXINC;
549 if (SLOT_COUNT >= 3) CXINC;
550 {
551 int i;
552 for (i = 3; i < SLOT_COUNT; ++i)
553 CXINC;
554 }
555 cxstack_ix -= SLOT_COUNT; /* undo allocation */
556
557 c->mainstack = PL_mainstack;
558
559 {
560 perl_slots *slot = c->slot = (perl_slots *)(cxstack + cxstack_ix + 1);
561
562 slot->defav = GvAV (PL_defgv);
563 slot->defsv = DEFSV;
564 slot->errsv = ERRSV;
565 slot->irsgv = GvSV (irsgv);
566
567 #define VAR(name,type) slot->name = PL_ ## name;
568 # include "state.h"
569 #undef VAR
570 }
571}
572
573/*
574 * allocate various perl stacks. This is an exact copy
575 * of perl.c:init_stacks, except that it uses less memory
576 * on the (sometimes correct) assumption that coroutines do
577 * not usually need a lot of stackspace.
578 */
579#if CORO_PREFER_PERL_FUNCTIONS
580# define coro_init_stacks init_stacks
581#else
582static void
583coro_init_stacks (pTHX)
584{
585 PL_curstackinfo = new_stackinfo(32, 8);
586 PL_curstackinfo->si_type = PERLSI_MAIN;
587 PL_curstack = PL_curstackinfo->si_stack;
588 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
589
590 PL_stack_base = AvARRAY(PL_curstack);
591 PL_stack_sp = PL_stack_base;
592 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
593
594 New(50,PL_tmps_stack,32,SV*);
595 PL_tmps_floor = -1;
596 PL_tmps_ix = -1;
597 PL_tmps_max = 32;
598
599 New(54,PL_markstack,16,I32);
600 PL_markstack_ptr = PL_markstack;
601 PL_markstack_max = PL_markstack + 16;
602
603#ifdef SET_MARK_OFFSET
604 SET_MARK_OFFSET;
605#endif
606
607 New(54,PL_scopestack,8,I32);
608 PL_scopestack_ix = 0;
609 PL_scopestack_max = 8;
610
611 New(54,PL_savestack,24,ANY);
612 PL_savestack_ix = 0;
613 PL_savestack_max = 24;
614
615#if !PERL_VERSION_ATLEAST (5,10,0)
616 New(54,PL_retstack,4,OP*);
617 PL_retstack_ix = 0;
618 PL_retstack_max = 4;
619#endif
620}
621#endif
622
623/*
624 * destroy the stacks, the callchain etc...
625 */
626static void
627coro_destroy_stacks (pTHX)
628{
629 while (PL_curstackinfo->si_next)
630 PL_curstackinfo = PL_curstackinfo->si_next;
631
632 while (PL_curstackinfo)
633 {
634 PERL_SI *p = PL_curstackinfo->si_prev;
635
636 if (!IN_DESTRUCT)
637 SvREFCNT_dec (PL_curstackinfo->si_stack);
638
639 Safefree (PL_curstackinfo->si_cxstack);
640 Safefree (PL_curstackinfo);
641 PL_curstackinfo = p;
642 }
643
644 Safefree (PL_tmps_stack);
645 Safefree (PL_markstack);
646 Safefree (PL_scopestack);
647 Safefree (PL_savestack);
648#if !PERL_VERSION_ATLEAST (5,10,0)
649 Safefree (PL_retstack);
650#endif
651}
652
653static size_t
654coro_rss (pTHX_ struct coro *coro)
655{
656 size_t rss = sizeof (*coro);
657
658 if (coro->mainstack)
659 {
660 perl_slots tmp_slot;
661 perl_slots *slot;
662
663 if (coro->flags & CF_RUNNING)
664 {
665 slot = &tmp_slot;
666
667 #define VAR(name,type) slot->name = PL_ ## name;
668 # include "state.h"
669 #undef VAR
670 }
671 else
672 slot = coro->slot;
673
674 if (slot)
675 {
676 rss += sizeof (slot->curstackinfo);
677 rss += (slot->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
678 rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvMAX (slot->curstack)) * sizeof (SV *);
679 rss += slot->tmps_max * sizeof (SV *);
680 rss += (slot->markstack_max - slot->markstack_ptr) * sizeof (I32);
681 rss += slot->scopestack_max * sizeof (I32);
682 rss += slot->savestack_max * sizeof (ANY);
683
684#if !PERL_VERSION_ATLEAST (5,10,0)
685 rss += slot->retstack_max * sizeof (OP *);
686#endif
687 }
688 }
689
690 return rss;
691}
692
693/** coroutine stack handling ************************************************/
694
695static int (*orig_sigelem_get) (pTHX_ SV *sv, MAGIC *mg);
696static int (*orig_sigelem_set) (pTHX_ SV *sv, MAGIC *mg);
697static int (*orig_sigelem_clr) (pTHX_ SV *sv, MAGIC *mg);
698
699/* apparently < 5.8.8 */
700#ifndef MgPV_nolen_const
701#define MgPV_nolen_const(mg) (((((int)(mg)->mg_len)) == HEf_SVKEY) ? \
702 SvPV_nolen((SV*)((mg)->mg_ptr)) : \
703 (const char*)(mg)->mg_ptr)
704#endif
705
706/*
707 * This overrides the default magic get method of %SIG elements.
708 * The original one doesn't provide for reading back of PL_diehook/PL_warnhook
709 * and instead of tryign to save and restore the hash elements, we just provide
710 * readback here.
711 * We only do this when the hook is != 0, as they are often set to 0 temporarily,
712 * not expecting this to actually change the hook. This is a potential problem
713 * when a schedule happens then, but we ignore this.
714 */
715static int
716coro_sigelem_get (pTHX_ SV *sv, MAGIC *mg)
717{
718 const char *s = MgPV_nolen_const (mg);
719
720 if (*s == '_')
721 {
722 SV **svp = 0;
723
724 if (strEQ (s, "__DIE__" )) svp = &PL_diehook;
725 if (strEQ (s, "__WARN__")) svp = &PL_warnhook;
726
727 if (svp)
728 {
729 sv_setsv (sv, *svp ? *svp : &PL_sv_undef);
730 return 0;
731 }
732 }
733
734 return orig_sigelem_get ? orig_sigelem_get (aTHX_ sv, mg) : 0;
735}
736
737static int
738coro_sigelem_clr (pTHX_ SV *sv, MAGIC *mg)
739{
740 const char *s = MgPV_nolen_const (mg);
741
742 if (*s == '_')
743 {
744 SV **svp = 0;
745
746 if (strEQ (s, "__DIE__" )) svp = &PL_diehook;
747 if (strEQ (s, "__WARN__")) svp = &PL_warnhook;
748
749 if (svp)
750 {
751 SV *old = *svp;
752 *svp = 0;
753 SvREFCNT_dec (old);
754 return 0;
755 }
756 }
757
758 return orig_sigelem_clr ? orig_sigelem_clr (aTHX_ sv, mg) : 0;
759}
760
761static int
762coro_sigelem_set (pTHX_ SV *sv, MAGIC *mg)
763{
764 const char *s = MgPV_nolen_const (mg);
765
766 if (*s == '_')
767 {
768 SV **svp = 0;
769
770 if (strEQ (s, "__DIE__" )) svp = &PL_diehook;
771 if (strEQ (s, "__WARN__")) svp = &PL_warnhook;
772
773 if (svp)
774 {
775 SV *old = *svp;
776 *svp = newSVsv (sv);
777 SvREFCNT_dec (old);
778 return 0;
779 }
780 }
781
782 return orig_sigelem_set ? orig_sigelem_set (aTHX_ sv, mg) : 0;
783}
784
785static void
786coro_setup (pTHX_ struct coro *coro)
787{
788 /*
789 * emulate part of the perl startup here.
790 */
791 coro_init_stacks (aTHX);
792
793 PL_runops = RUNOPS_DEFAULT;
794 PL_curcop = &PL_compiling;
795 PL_in_eval = EVAL_NULL;
796 PL_comppad = 0;
797 PL_curpm = 0;
798 PL_curpad = 0;
799 PL_localizing = 0;
800 PL_dirty = 0;
801 PL_restartop = 0;
802#if PERL_VERSION_ATLEAST (5,10,0)
803 PL_parser = 0;
804#endif
805
806 /* recreate the die/warn hooks */
807 PL_diehook = 0; SvSetMagicSV (*hv_fetch (hv_sig, "__DIE__" , sizeof ("__DIE__" ) - 1, 1), rv_diehook );
808 PL_warnhook = 0; SvSetMagicSV (*hv_fetch (hv_sig, "__WARN__", sizeof ("__WARN__") - 1, 1), rv_warnhook);
809
810 GvSV (PL_defgv) = newSV (0);
811 GvAV (PL_defgv) = coro->args; coro->args = 0;
812 GvSV (PL_errgv) = newSV (0);
813 GvSV (irsgv) = newSVpvn ("\n", 1); sv_magic (GvSV (irsgv), (SV *)irsgv, PERL_MAGIC_sv, "/", 0);
814 PL_rs = newSVsv (GvSV (irsgv));
815 PL_defoutgv = (GV *)SvREFCNT_inc (stdoutgv);
816
817 {
818 dSP;
819 LOGOP myop;
820
821 Zero (&myop, 1, LOGOP);
822 myop.op_next = Nullop;
823 myop.op_flags = OPf_WANT_VOID;
824
825 PUSHMARK (SP);
826 XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv))));
827 PUTBACK;
828 PL_op = (OP *)&myop;
829 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
830 SPAGAIN;
831 }
832
833 /* this newly created coroutine might be run on an existing cctx which most
834 * likely was suspended in set_stacklevel, called from entersub.
835 * set_stacklevl doesn't do anything on return, but entersub does LEAVE,
836 * so we ENTER here for symmetry
837 */
838 ENTER;
839}
840
841static void
842coro_destroy (pTHX_ struct coro *coro)
843{
844 if (!IN_DESTRUCT)
845 {
846 /* restore all saved variables and stuff */
847 LEAVE_SCOPE (0);
848 assert (PL_tmps_floor == -1);
849
850 /* free all temporaries */
851 FREETMPS;
852 assert (PL_tmps_ix == -1);
853
854 /* unwind all extra stacks */
855 POPSTACK_TO (PL_mainstack);
856
857 /* unwind main stack */
858 dounwind (-1);
859 }
860
861 SvREFCNT_dec (GvSV (PL_defgv));
862 SvREFCNT_dec (GvAV (PL_defgv));
863 SvREFCNT_dec (GvSV (PL_errgv));
864 SvREFCNT_dec (PL_defoutgv);
865 SvREFCNT_dec (PL_rs);
866 SvREFCNT_dec (GvSV (irsgv));
867
868 SvREFCNT_dec (PL_diehook);
869 SvREFCNT_dec (PL_warnhook);
870
871 SvREFCNT_dec (coro->saved_deffh);
872 SvREFCNT_dec (coro->throw);
873
874 coro_destroy_stacks (aTHX);
875}
876
877static void
878free_coro_mortal (pTHX)
879{
880 if (expect_true (coro_mortal))
881 {
882 SvREFCNT_dec (coro_mortal);
883 coro_mortal = 0;
884 }
885}
886
887static int
888runops_trace (pTHX)
889{
890 COP *oldcop = 0;
891 int oldcxix = -2;
892 struct coro *coro = SvSTATE (coro_current); /* trace cctx is tied to specific coro */
893 coro_cctx *cctx = coro->cctx;
894
895 while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX)))
896 {
897 PERL_ASYNC_CHECK ();
898
899 if (cctx->flags & CC_TRACE_ALL)
900 {
901 if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB)
902 {
903 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
904 SV **bot, **top;
905 AV *av = newAV (); /* return values */
906 SV **cb;
907 dSP;
908
909 GV *gv = CvGV (cx->blk_sub.cv);
910 SV *fullname = sv_2mortal (newSV (0));
911 if (isGV (gv))
912 gv_efullname3 (fullname, gv, 0);
913
914 bot = PL_stack_base + cx->blk_oldsp + 1;
915 top = cx->blk_gimme == G_ARRAY ? SP + 1
916 : cx->blk_gimme == G_SCALAR ? bot + 1
917 : bot;
918
919 av_extend (av, top - bot);
920 while (bot < top)
921 av_push (av, SvREFCNT_inc (*bot++));
922
923 PL_runops = RUNOPS_DEFAULT;
924 ENTER;
925 SAVETMPS;
926 EXTEND (SP, 3);
927 PUSHMARK (SP);
928 PUSHs (&PL_sv_no);
929 PUSHs (fullname);
930 PUSHs (sv_2mortal (newRV_noinc ((SV *)av)));
931 PUTBACK;
932 cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0);
933 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
934 SPAGAIN;
935 FREETMPS;
936 LEAVE;
937 PL_runops = runops_trace;
938 }
939
940 if (oldcop != PL_curcop)
941 {
942 oldcop = PL_curcop;
943
944 if (PL_curcop != &PL_compiling)
945 {
946 SV **cb;
947
948 if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB)
949 {
950 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
951
952 if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix)
953 {
954 runops_proc_t old_runops = PL_runops;
955 dSP;
956 GV *gv = CvGV (cx->blk_sub.cv);
957 SV *fullname = sv_2mortal (newSV (0));
958
959 if (isGV (gv))
960 gv_efullname3 (fullname, gv, 0);
961
962 PL_runops = RUNOPS_DEFAULT;
963 ENTER;
964 SAVETMPS;
965 EXTEND (SP, 3);
966 PUSHMARK (SP);
967 PUSHs (&PL_sv_yes);
968 PUSHs (fullname);
969 PUSHs (CxHASARGS (cx) ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef);
970 PUTBACK;
971 cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0);
972 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
973 SPAGAIN;
974 FREETMPS;
975 LEAVE;
976 PL_runops = runops_trace;
977 }
978
979 oldcxix = cxstack_ix;
980 }
981
982 if (cctx->flags & CC_TRACE_LINE)
983 {
984 dSP;
985
986 PL_runops = RUNOPS_DEFAULT;
987 ENTER;
988 SAVETMPS;
989 EXTEND (SP, 3);
990 PL_runops = RUNOPS_DEFAULT;
991 PUSHMARK (SP);
992 PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0)));
993 PUSHs (sv_2mortal (newSViv (CopLINE (oldcop))));
994 PUTBACK;
995 cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_line_cb", sizeof ("_trace_line_cb") - 1, 0);
996 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
997 SPAGAIN;
998 FREETMPS;
999 LEAVE;
1000 PL_runops = runops_trace;
1001 }
1002 }
1003 }
1004 }
1005 }
1006
1007 TAINT_NOT;
1008 return 0;
1009}
1010
1011/* inject a fake call to Coro::State::_cctx_init into the execution */
1012/* _cctx_init should be careful, as it could be called at almost any time */
1013/* during execution of a perl program */
1014static void NOINLINE
1015cctx_prepare (pTHX_ coro_cctx *cctx)
1016{
1017 dSP;
1018 LOGOP myop;
1019
1020 PL_top_env = &PL_start_env;
1021
1022 if (cctx->flags & CC_TRACE)
1023 PL_runops = runops_trace;
1024
1025 Zero (&myop, 1, LOGOP);
1026 myop.op_next = PL_op;
1027 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
1028
1029 PUSHMARK (SP);
1030 EXTEND (SP, 2);
1031 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
1032 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
1033 PUTBACK;
1034 PL_op = (OP *)&myop;
1035 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
1036 SPAGAIN;
1037}
1038
1039/*
1040 * this is a _very_ stripped down perl interpreter ;)
1041 */
1042static void
1043cctx_run (void *arg)
1044{
1045 dTHX;
1046
1047 /* cctx_run is the alternative tail of transfer(), so unlock here. */
1048 UNLOCK;
1049
1050 /* we now skip the entersub that lead to transfer() */
1051 PL_op = PL_op->op_next;
1052
1053 /* inject a fake subroutine call to cctx_init */
1054 cctx_prepare (aTHX_ (coro_cctx *)arg);
1055
1056 /* somebody or something will hit me for both perl_run and PL_restartop */
1057 PL_restartop = PL_op;
1058 perl_run (PL_curinterp);
1059
1060 /*
1061 * If perl-run returns we assume exit() was being called or the coro
1062 * fell off the end, which seems to be the only valid (non-bug)
1063 * reason for perl_run to return. We try to exit by jumping to the
1064 * bootstrap-time "top" top_env, as we cannot restore the "main"
1065 * coroutine as Coro has no such concept
1066 */
1067 PL_top_env = main_top_env;
1068 JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
1069}
1070
1071static coro_cctx *
1072cctx_new ()
1073{
1074 coro_cctx *cctx;
1075 void *stack_start;
1076 size_t stack_size;
1077
1078 ++cctx_count;
1079
1080 Newz (0, cctx, 1, coro_cctx);
1081
1082#if HAVE_MMAP
1083 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
1084 /* mmap supposedly does allocate-on-write for us */
1085 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
1086
1087 if (cctx->sptr != (void *)-1)
1088 {
1089# if CORO_STACKGUARD
1090 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
1091# endif
1092 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
1093 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
1094 cctx->flags |= CC_MAPPED;
1095 }
1096 else
1097#endif
1098 {
1099 cctx->ssize = coro_stacksize * (long)sizeof (long);
1100 New (0, cctx->sptr, coro_stacksize, long);
1101
1102 if (!cctx->sptr)
1103 {
1104 perror ("FATAL: unable to allocate stack for coroutine");
1105 _exit (EXIT_FAILURE);
1106 }
1107
1108 stack_start = cctx->sptr;
1109 stack_size = cctx->ssize;
1110 }
1111
1112 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
1113 coro_create (&cctx->cctx, cctx_run, (void *)cctx, stack_start, stack_size);
1114
1115 return cctx;
1116}
1117
1118static void
1119cctx_destroy (coro_cctx *cctx)
1120{
1121 if (!cctx)
1122 return;
1123
1124 --cctx_count;
1125
1126#if CORO_USE_VALGRIND
1127 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
1128#endif
1129
1130#if HAVE_MMAP
1131 if (cctx->flags & CC_MAPPED)
1132 munmap (cctx->sptr, cctx->ssize);
1133 else
1134#endif
1135 Safefree (cctx->sptr);
1136
1137 Safefree (cctx);
1138}
1139
1140/* wether this cctx should be destructed */
1141#define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize || ((cctx)->flags & CC_NOREUSE))
1142
1143static coro_cctx *
1144cctx_get (pTHX)
1145{
1146 while (expect_true (cctx_first))
1147 {
1148 coro_cctx *cctx = cctx_first;
1149 cctx_first = cctx->next;
1150 --cctx_idle;
1151
1152 if (expect_true (!CCTX_EXPIRED (cctx)))
1153 return cctx;
1154
1155 cctx_destroy (cctx);
1156 }
1157
1158 return cctx_new ();
1159}
1160
1161static void
1162cctx_put (coro_cctx *cctx)
1163{
1164 /* free another cctx if overlimit */
1165 if (expect_false (cctx_idle >= MAX_IDLE_CCTX))
1166 {
1167 coro_cctx *first = cctx_first;
1168 cctx_first = first->next;
1169 --cctx_idle;
1170
1171 cctx_destroy (first);
1172 }
1173
1174 ++cctx_idle;
1175 cctx->next = cctx_first;
1176 cctx_first = cctx;
1177}
1178
1179/** coroutine switching *****************************************************/
1180
1181static void
1182transfer_check (pTHX_ struct coro *prev, struct coro *next)
1183{
1184 if (expect_true (prev != next))
1185 {
1186 if (expect_false (!(prev->flags & (CF_RUNNING | CF_NEW))))
1187 croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states");
1188
1189 if (expect_false (next->flags & CF_RUNNING))
1190 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
1191
1192 if (expect_false (next->flags & CF_DESTROYED))
1193 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
1194
1195#if !PERL_VERSION_ATLEAST (5,10,0)
1196 if (expect_false (PL_lex_state != LEX_NOTPARSING))
1197 croak ("Coro::State::transfer called while parsing, but this is not supported in your perl version");
1198#endif
1199 }
1200}
1201
1202/* always use the TRANSFER macro */
1203static void NOINLINE
1204transfer (pTHX_ struct coro *prev, struct coro *next, int force_cctx)
1205{
1206 dSTACKLEVEL;
1207 static volatile int has_throw;
1208
1209 /* sometimes transfer is only called to set idle_sp */
1210 if (expect_false (!next))
1211 {
1212 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
1213 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
1214 }
1215 else if (expect_true (prev != next))
1216 {
1217 coro_cctx *prev__cctx;
1218
1219 if (expect_false (prev->flags & CF_NEW))
1220 {
1221 /* create a new empty context */
1222 Newz (0, prev->cctx, 1, coro_cctx);
1223 prev->flags &= ~CF_NEW;
1224 prev->flags |= CF_RUNNING;
1225 }
1226
1227 prev->flags &= ~CF_RUNNING;
1228 next->flags |= CF_RUNNING;
1229
1230 LOCK;
1231
1232 /* first get rid of the old state */
1233 save_perl (aTHX_ prev);
1234
1235 if (expect_false (next->flags & CF_NEW))
1236 {
1237 /* need to start coroutine */
1238 next->flags &= ~CF_NEW;
1239 /* setup coroutine call */
1240 coro_setup (aTHX_ next);
1241 }
1242 else
1243 load_perl (aTHX_ next);
1244
1245 prev__cctx = prev->cctx;
1246
1247 /* possibly "free" the cctx */
1248 if (expect_true (
1249 prev__cctx->idle_sp == STACKLEVEL
1250 && !(prev__cctx->flags & CC_TRACE)
1251 && !force_cctx
1252 ))
1253 {
1254 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
1255 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
1256
1257 prev->cctx = 0;
1258
1259 /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */
1260 /* without this the next cctx_get might destroy the prev__cctx while still in use */
1261 if (expect_false (CCTX_EXPIRED (prev__cctx)))
1262 if (!next->cctx)
1263 next->cctx = cctx_get (aTHX);
1264
1265 cctx_put (prev__cctx);
1266 }
1267
1268 ++next->usecount;
1269
1270 if (expect_true (!next->cctx))
1271 next->cctx = cctx_get (aTHX);
1272
1273 has_throw = !!next->throw;
1274
1275 if (expect_false (prev__cctx != next->cctx))
1276 {
1277 prev__cctx->top_env = PL_top_env;
1278 PL_top_env = next->cctx->top_env;
1279 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
1280 }
1281
1282 free_coro_mortal (aTHX);
1283 UNLOCK;
1284
1285 if (expect_false (has_throw))
1286 {
1287 struct coro *coro = SvSTATE (coro_current);
1288
1289 if (coro->throw)
1290 {
1291 SV *exception = coro->throw;
1292 coro->throw = 0;
1293 sv_setsv (ERRSV, exception);
1294 croak (0);
1295 }
1296 }
1297 }
1298}
1299
1300struct transfer_args
1301{
1302 struct coro *prev, *next;
1303};
1304
1305#define TRANSFER(ta, force_cctx) transfer (aTHX_ (ta).prev, (ta).next, (force_cctx))
1306#define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next)
1307
1308/** high level stuff ********************************************************/
1309
1310static int
1311coro_state_destroy (pTHX_ struct coro *coro)
1312{
1313 if (coro->flags & CF_DESTROYED)
1314 return 0;
1315
1316 coro->flags |= CF_DESTROYED;
1317
1318 if (coro->flags & CF_READY)
1319 {
1320 /* reduce nready, as destroying a ready coro effectively unreadies it */
1321 /* alternative: look through all ready queues and remove the coro */
1322 LOCK;
1323 --coro_nready;
1324 UNLOCK;
1325 }
1326 else
1327 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
1328
1329 if (coro->mainstack && coro->mainstack != main_mainstack)
1330 {
1331 struct coro temp;
1332
1333 if (coro->flags & CF_RUNNING)
1334 croak ("FATAL: tried to destroy currently running coroutine");
1335
1336 save_perl (aTHX_ &temp);
1337 load_perl (aTHX_ coro);
1338
1339 coro_destroy (aTHX_ coro);
1340
1341 load_perl (aTHX_ &temp);
1342
1343 coro->slot = 0;
1344 }
1345
1346 cctx_destroy (coro->cctx);
1347 SvREFCNT_dec (coro->args);
1348
1349 if (coro->next) coro->next->prev = coro->prev;
1350 if (coro->prev) coro->prev->next = coro->next;
1351 if (coro == coro_first) coro_first = coro->next;
1352
1353 return 1;
1354}
1355
1356static int
1357coro_state_free (pTHX_ SV *sv, MAGIC *mg)
1358{
1359 struct coro *coro = (struct coro *)mg->mg_ptr;
1360 mg->mg_ptr = 0;
1361
1362 coro->hv = 0;
1363
1364 if (--coro->refcnt < 0)
1365 {
1366 coro_state_destroy (aTHX_ coro);
1367 Safefree (coro);
1368 }
1369
1370 return 0;
1371}
1372
1373static int
1374coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
1375{
1376 struct coro *coro = (struct coro *)mg->mg_ptr;
1377
1378 ++coro->refcnt;
1379
1380 return 0;
1381}
1382
1383static MGVTBL coro_state_vtbl = {
1384 0, 0, 0, 0,
1385 coro_state_free,
1386 0,
1387#ifdef MGf_DUP
1388 coro_state_dup,
1389#else
1390# define MGf_DUP 0
1391#endif
1392};
1393
1394static void
1395prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
1396{
1397 ta->prev = SvSTATE (prev_sv);
1398 ta->next = SvSTATE (next_sv);
1399 TRANSFER_CHECK (*ta);
1400}
1401
1402static void
1403api_transfer (SV *prev_sv, SV *next_sv)
1404{
1405 dTHX;
1406 struct transfer_args ta;
1407
1408 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
1409 TRANSFER (ta, 1);
1410}
1411
1412/** Coro ********************************************************************/
1413
1414static void
1415coro_enq (pTHX_ SV *coro_sv)
1416{
1417 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
1418}
1419
1420static SV *
1421coro_deq (pTHX)
1422{
1423 int prio;
1424
1425 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= 0; )
1426 if (AvFILLp (coro_ready [prio]) >= 0)
1427 return av_shift (coro_ready [prio]);
1428
1429 return 0;
1430}
1431
1432static int
1433api_ready (SV *coro_sv)
1434{
1435 dTHX;
1436 struct coro *coro;
1437 SV *sv_hook;
1438 void (*xs_hook)(void);
1439
1440 if (SvROK (coro_sv))
1441 coro_sv = SvRV (coro_sv);
1442
1443 coro = SvSTATE (coro_sv);
1444
1445 if (coro->flags & CF_READY)
1446 return 0;
1447
1448 coro->flags |= CF_READY;
1449
1450 LOCK;
1451
1452 sv_hook = coro_nready ? 0 : coro_readyhook;
1453 xs_hook = coro_nready ? 0 : coroapi.readyhook;
1454
1455 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1456 ++coro_nready;
1457
1458 UNLOCK;
1459
1460 if (sv_hook)
1461 {
1462 dSP;
1463
1464 ENTER;
1465 SAVETMPS;
1466
1467 PUSHMARK (SP);
1468 PUTBACK;
1469 call_sv (sv_hook, G_DISCARD);
1470 SPAGAIN;
1471
1472 FREETMPS;
1473 LEAVE;
1474 }
1475
1476 if (xs_hook)
1477 xs_hook ();
1478
1479 return 1;
1480}
1481
1482static int
1483api_is_ready (SV *coro_sv)
1484{
1485 dTHX;
1486 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1487}
1488
1489static void
1490prepare_schedule (pTHX_ struct transfer_args *ta)
1491{
1492 SV *prev_sv, *next_sv;
1493
1494 for (;;)
1495 {
1496 LOCK;
1497 next_sv = coro_deq (aTHX);
1498
1499 /* nothing to schedule: call the idle handler */
1500 if (expect_false (!next_sv))
1501 {
1502 dSP;
1503 UNLOCK;
1504
1505 ENTER;
1506 SAVETMPS;
1507
1508 PUSHMARK (SP);
1509 PUTBACK;
1510 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1511 SPAGAIN;
1512
1513 FREETMPS;
1514 LEAVE;
1515 continue;
1516 }
1517
1518 ta->next = SvSTATE (next_sv);
1519
1520 /* cannot transfer to destroyed coros, skip and look for next */
1521 if (expect_false (ta->next->flags & CF_DESTROYED))
1522 {
1523 UNLOCK;
1524 SvREFCNT_dec (next_sv);
1525 /* coro_nready is already taken care of by destroy */
1526 continue;
1527 }
1528
1529 --coro_nready;
1530 UNLOCK;
1531 break;
1532 }
1533
1534 /* free this only after the transfer */
1535 prev_sv = SvRV (coro_current);
1536 ta->prev = SvSTATE (prev_sv);
1537 TRANSFER_CHECK (*ta);
1538 assert (ta->next->flags & CF_READY);
1539 ta->next->flags &= ~CF_READY;
1540 SvRV_set (coro_current, next_sv);
1541
1542 LOCK;
1543 free_coro_mortal (aTHX);
1544 coro_mortal = prev_sv;
1545 UNLOCK;
1546}
1547
1548static void
1549prepare_cede (pTHX_ struct transfer_args *ta)
1550{
1551 api_ready (coro_current);
1552 prepare_schedule (aTHX_ ta);
1553}
1554
1555static int
1556prepare_cede_notself (pTHX_ struct transfer_args *ta)
1557{
1558 if (coro_nready)
1559 {
1560 SV *prev = SvRV (coro_current);
1561 prepare_schedule (aTHX_ ta);
1562 api_ready (prev);
1563 return 1;
1564 }
1565 else
1566 return 0;
1567}
1568
1569static void
1570api_schedule (void)
1571{
1572 dTHX;
1573 struct transfer_args ta;
1574
1575 prepare_schedule (aTHX_ &ta);
1576 TRANSFER (ta, 1);
1577}
1578
1579static int
1580api_cede (void)
1581{
1582 dTHX;
1583 struct transfer_args ta;
1584
1585 prepare_cede (aTHX_ &ta);
1586
1587 if (expect_true (ta.prev != ta.next))
1588 {
1589 TRANSFER (ta, 1);
1590 return 1;
1591 }
1592 else
1593 return 0;
1594}
1595
1596static int
1597api_cede_notself (void)
1598{
1599 dTHX;
1600 struct transfer_args ta;
1601
1602 if (prepare_cede_notself (aTHX_ &ta))
1603 {
1604 TRANSFER (ta, 1);
1605 return 1;
1606 }
1607 else
1608 return 0;
1609}
1610
1611static void
1612api_trace (SV *coro_sv, int flags)
1613{
1614 dTHX;
1615 struct coro *coro = SvSTATE (coro_sv);
1616
1617 if (flags & CC_TRACE)
1618 {
1619 if (!coro->cctx)
1620 coro->cctx = cctx_new ();
1621 else if (!(coro->cctx->flags & CC_TRACE))
1622 croak ("cannot enable tracing on coroutine with custom stack");
1623
1624 coro->cctx->flags |= CC_NOREUSE | (flags & (CC_TRACE | CC_TRACE_ALL));
1625 }
1626 else if (coro->cctx && coro->cctx->flags & CC_TRACE)
1627 {
1628 coro->cctx->flags &= ~(CC_TRACE | CC_TRACE_ALL);
1629
1630 if (coro->flags & CF_RUNNING)
1631 PL_runops = RUNOPS_DEFAULT;
1632 else
1633 coro->slot->runops = RUNOPS_DEFAULT;
1634 }
1635}
1636
1637static int
1638coro_gensub_free (pTHX_ SV *sv, MAGIC *mg)
1639{
1640 AV *padlist;
1641 AV *av = (AV *)mg->mg_obj;
1642
1643 abort ();
1644
1645 return 0;
1646}
1647
1648static MGVTBL coro_gensub_vtbl = {
1649 0, 0, 0, 0,
1650 coro_gensub_free
1651};
1652
1653/*****************************************************************************/
1654/* PerlIO::cede */
1655
1656typedef struct
1657{
1658 PerlIOBuf base;
1659 NV next, every;
1660} PerlIOCede;
1661
1662static IV
1663PerlIOCede_pushed (pTHX_ PerlIO *f, const char *mode, SV *arg, PerlIO_funcs *tab)
1664{
1665 PerlIOCede *self = PerlIOSelf (f, PerlIOCede);
1666
1667 self->every = SvCUR (arg) ? SvNV (arg) : 0.01;
1668 self->next = nvtime () + self->every;
1669
1670 return PerlIOBuf_pushed (aTHX_ f, mode, Nullsv, tab);
1671}
1672
1673static SV *
1674PerlIOCede_getarg (pTHX_ PerlIO *f, CLONE_PARAMS *param, int flags)
1675{
1676 PerlIOCede *self = PerlIOSelf (f, PerlIOCede);
1677
1678 return newSVnv (self->every);
1679}
1680
1681static IV
1682PerlIOCede_flush (pTHX_ PerlIO *f)
1683{
1684 PerlIOCede *self = PerlIOSelf (f, PerlIOCede);
1685 double now = nvtime ();
1686
1687 if (now >= self->next)
1688 {
1689 api_cede ();
1690 self->next = now + self->every;
1691 }
1692
1693 return PerlIOBuf_flush (aTHX_ f);
1694}
1695
1696static PerlIO_funcs PerlIO_cede =
1697{
1698 sizeof(PerlIO_funcs),
1699 "cede",
1700 sizeof(PerlIOCede),
1701 PERLIO_K_DESTRUCT | PERLIO_K_RAW,
1702 PerlIOCede_pushed,
1703 PerlIOBuf_popped,
1704 PerlIOBuf_open,
1705 PerlIOBase_binmode,
1706 PerlIOCede_getarg,
1707 PerlIOBase_fileno,
1708 PerlIOBuf_dup,
1709 PerlIOBuf_read,
1710 PerlIOBuf_unread,
1711 PerlIOBuf_write,
1712 PerlIOBuf_seek,
1713 PerlIOBuf_tell,
1714 PerlIOBuf_close,
1715 PerlIOCede_flush,
1716 PerlIOBuf_fill,
1717 PerlIOBase_eof,
1718 PerlIOBase_error,
1719 PerlIOBase_clearerr,
1720 PerlIOBase_setlinebuf,
1721 PerlIOBuf_get_base,
1722 PerlIOBuf_bufsiz,
1723 PerlIOBuf_get_ptr,
1724 PerlIOBuf_get_cnt,
1725 PerlIOBuf_set_ptrcnt,
1726};
1727
1728
1729MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_
1730
1731PROTOTYPES: DISABLE
1732
1733BOOT:
1734{
1735#ifdef USE_ITHREADS
1736 MUTEX_INIT (&coro_mutex);
1737#endif
1738 BOOT_PAGESIZE;
1739
1740 irsgv = gv_fetchpv ("/" , GV_ADD|GV_NOTQUAL, SVt_PV);
1741 stdoutgv = gv_fetchpv ("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVIO);
1742
1743 orig_sigelem_get = PL_vtbl_sigelem.svt_get; PL_vtbl_sigelem.svt_get = coro_sigelem_get;
1744 orig_sigelem_set = PL_vtbl_sigelem.svt_set; PL_vtbl_sigelem.svt_set = coro_sigelem_set;
1745 orig_sigelem_clr = PL_vtbl_sigelem.svt_clear; PL_vtbl_sigelem.svt_clear = coro_sigelem_clr;
1746
1747 hv_sig = coro_get_hv (aTHX_ "SIG", TRUE);
1748 rv_diehook = newRV_inc ((SV *)gv_fetchpv ("Coro::State::diehook" , 0, SVt_PVCV));
1749 rv_warnhook = newRV_inc ((SV *)gv_fetchpv ("Coro::State::warnhook", 0, SVt_PVCV));
1750
1751 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
1752
1753 newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE));
1754 newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB));
1755 newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE));
1756 newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL));
1757
1758 main_mainstack = PL_mainstack;
1759 main_top_env = PL_top_env;
1760
1761 while (main_top_env->je_prev)
1762 main_top_env = main_top_env->je_prev;
1763
1764 coroapi.ver = CORO_API_VERSION;
1765 coroapi.rev = CORO_API_REVISION;
1766 coroapi.transfer = api_transfer;
1767
1768 {
1769 SV **svp = hv_fetch (PL_modglobal, "Time::NVtime", 12, 0);
1770
1771 if (!svp) croak ("Time::HiRes is required");
1772 if (!SvIOK (*svp)) croak ("Time::NVtime isn't a function pointer");
1773
1774 nvtime = INT2PTR (double (*)(), SvIV (*svp));
1775 }
1776
1777 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1778}
1779
1780SV *
1781new (char *klass, ...)
1782 CODE:
1783{
1784 struct coro *coro;
1785 MAGIC *mg;
1786 HV *hv;
1787 int i;
1788
1789 Newz (0, coro, 1, struct coro);
1790 coro->args = newAV ();
1791 coro->flags = CF_NEW;
1792
1793 if (coro_first) coro_first->prev = coro;
1794 coro->next = coro_first;
1795 coro_first = coro;
1796
1797 coro->hv = hv = newHV ();
1798 mg = sv_magicext ((SV *)hv, 0, CORO_MAGIC_type_state, &coro_state_vtbl, (char *)coro, 0);
1799 mg->mg_flags |= MGf_DUP;
1800 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1801
1802 av_extend (coro->args, items - 1);
1803 for (i = 1; i < items; i++)
1804 av_push (coro->args, newSVsv (ST (i)));
1805}
1806 OUTPUT:
1807 RETVAL
1808
1809# these not obviously related functions are all rolled into the same xs
1810# function to increase chances that they all will call transfer with the same
1811# stack offset
1812void
1813_set_stacklevel (...)
1814 ALIAS:
1815 Coro::State::transfer = 1
1816 Coro::schedule = 2
1817 Coro::cede = 3
1818 Coro::cede_notself = 4
1819 CODE:
1820{
1821 struct transfer_args ta;
1822
1823 PUTBACK;
1824 switch (ix)
1825 {
1826 case 0:
1827 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1828 ta.next = 0;
1829 break;
1830
1831 case 1:
1832 if (items != 2)
1833 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1834
1835 prepare_transfer (aTHX_ &ta, ST (0), ST (1));
1836 break;
1837
1838 case 2:
1839 prepare_schedule (aTHX_ &ta);
1840 break;
1841
1842 case 3:
1843 prepare_cede (aTHX_ &ta);
1844 break;
1845
1846 case 4:
1847 if (!prepare_cede_notself (aTHX_ &ta))
1848 XSRETURN_EMPTY;
1849
1850 break;
1851 }
1852 SPAGAIN;
1853
1854 BARRIER;
1855 PUTBACK;
1856 TRANSFER (ta, 0);
1857 SPAGAIN; /* might be the sp of a different coroutine now */
1858 /* be extra careful not to ever do anything after TRANSFER */
1859}
1860
1861bool
1862_destroy (SV *coro_sv)
1863 CODE:
1864 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1865 OUTPUT:
1866 RETVAL
1867
1868void
1869_exit (int code)
1870 PROTOTYPE: $
1871 CODE:
1872 _exit (code);
1873
1874int
1875cctx_stacksize (int new_stacksize = 0)
1876 CODE:
1877 RETVAL = coro_stacksize;
1878 if (new_stacksize)
1879 coro_stacksize = new_stacksize;
1880 OUTPUT:
1881 RETVAL
1882
1883int
1884cctx_count ()
1885 CODE:
1886 RETVAL = cctx_count;
1887 OUTPUT:
1888 RETVAL
1889
1890int
1891cctx_idle ()
1892 CODE:
1893 RETVAL = cctx_idle;
1894 OUTPUT:
1895 RETVAL
1896
1897void
1898list ()
1899 PPCODE:
1900{
1901 struct coro *coro;
1902 for (coro = coro_first; coro; coro = coro->next)
1903 if (coro->hv)
1904 XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
1905}
1906
1907void
1908call (Coro::State coro, SV *coderef)
1909 ALIAS:
1910 eval = 1
1911 CODE:
1912{
1913 if (coro->mainstack && ((coro->flags & CF_RUNNING) || coro->slot))
1914 {
1915 struct coro temp;
1916
1917 if (!(coro->flags & CF_RUNNING))
235 { 1918 {
236 /* I never used formats, so how should I know how these are implemented? */ 1919 PUTBACK;
237 /* my bold guess is as a simple, plain sub... */ 1920 save_perl (aTHX_ &temp);
238 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 1921 load_perl (aTHX_ coro);
1922 }
1923
1924 {
1925 dSP;
1926 ENTER;
1927 SAVETMPS;
1928 PUTBACK;
1929 PUSHSTACK;
1930 PUSHMARK (SP);
1931
1932 if (ix)
1933 eval_sv (coderef, 0);
1934 else
1935 call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
1936
1937 POPSTACK;
1938 SPAGAIN;
1939 FREETMPS;
1940 LEAVE;
1941 PUTBACK;
1942 }
1943
1944 if (!(coro->flags & CF_RUNNING))
1945 {
1946 save_perl (aTHX_ coro);
1947 load_perl (aTHX_ &temp);
1948 SPAGAIN;
239 } 1949 }
240 } 1950 }
241
242 if (top_si->si_type == PERLSI_MAIN)
243 break;
244
245 top_si = top_si->si_prev;
246 ccstk = top_si->si_cxstack;
247 cxix = top_si->si_cxix;
248 }
249
250 PUTBACK;
251 }
252
253 c->dowarn = PL_dowarn;
254 c->defav = GvAV (PL_defgv);
255 c->curstackinfo = PL_curstackinfo;
256 c->curstack = PL_curstack;
257 c->mainstack = PL_mainstack;
258 c->stack_sp = PL_stack_sp;
259 c->op = PL_op;
260 c->curpad = PL_curpad;
261 c->stack_base = PL_stack_base;
262 c->stack_max = PL_stack_max;
263 c->tmps_stack = PL_tmps_stack;
264 c->tmps_floor = PL_tmps_floor;
265 c->tmps_ix = PL_tmps_ix;
266 c->tmps_max = PL_tmps_max;
267 c->markstack = PL_markstack;
268 c->markstack_ptr = PL_markstack_ptr;
269 c->markstack_max = PL_markstack_max;
270 c->scopestack = PL_scopestack;
271 c->scopestack_ix = PL_scopestack_ix;
272 c->scopestack_max = PL_scopestack_max;
273 c->savestack = PL_savestack;
274 c->savestack_ix = PL_savestack_ix;
275 c->savestack_max = PL_savestack_max;
276 c->retstack = PL_retstack;
277 c->retstack_ix = PL_retstack_ix;
278 c->retstack_max = PL_retstack_max;
279 c->curcop = PL_curcop;
280} 1951}
281 1952
282static void 1953SV *
283LOAD(pTHX_ Coro__State c) 1954is_ready (Coro::State coro)
284{ 1955 PROTOTYPE: $
285 PL_dowarn = c->dowarn; 1956 ALIAS:
286 GvAV (PL_defgv) = c->defav; 1957 is_ready = CF_READY
287 PL_curstackinfo = c->curstackinfo; 1958 is_running = CF_RUNNING
288 PL_curstack = c->curstack; 1959 is_new = CF_NEW
289 PL_mainstack = c->mainstack; 1960 is_destroyed = CF_DESTROYED
290 PL_stack_sp = c->stack_sp; 1961 CODE:
291 PL_op = c->op; 1962 RETVAL = boolSV (coro->flags & ix);
292 PL_curpad = c->curpad; 1963 OUTPUT:
293 PL_stack_base = c->stack_base; 1964 RETVAL
294 PL_stack_max = c->stack_max;
295 PL_tmps_stack = c->tmps_stack;
296 PL_tmps_floor = c->tmps_floor;
297 PL_tmps_ix = c->tmps_ix;
298 PL_tmps_max = c->tmps_max;
299 PL_markstack = c->markstack;
300 PL_markstack_ptr = c->markstack_ptr;
301 PL_markstack_max = c->markstack_max;
302 PL_scopestack = c->scopestack;
303 PL_scopestack_ix = c->scopestack_ix;
304 PL_scopestack_max = c->scopestack_max;
305 PL_savestack = c->savestack;
306 PL_savestack_ix = c->savestack_ix;
307 PL_savestack_max = c->savestack_max;
308 PL_retstack = c->retstack;
309 PL_retstack_ix = c->retstack_ix;
310 PL_retstack_max = c->retstack_max;
311 PL_curcop = c->curcop;
312 1965
1966void
1967api_trace (SV *coro, int flags = CC_TRACE | CC_TRACE_SUB)
1968
1969SV *
1970has_cctx (Coro::State coro)
1971 PROTOTYPE: $
1972 CODE:
1973 RETVAL = boolSV (!!coro->cctx);
1974 OUTPUT:
1975 RETVAL
1976
1977int
1978is_traced (Coro::State coro)
1979 PROTOTYPE: $
1980 CODE:
1981 RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL;
1982 OUTPUT:
1983 RETVAL
1984
1985IV
1986rss (Coro::State coro)
1987 PROTOTYPE: $
1988 ALIAS:
1989 usecount = 1
1990 CODE:
1991 switch (ix)
313 { 1992 {
314 dSP; 1993 case 0: RETVAL = coro_rss (aTHX_ coro); break;
315 CV *cv; 1994 case 1: RETVAL = coro->usecount; break;
316
317 /* now do the ugly restore mess */
318 while ((cv = (CV *)POPs))
319 {
320 AV *padlist = (AV *)POPs;
321
322 put_padlist (cv);
323 CvPADLIST(cv) = padlist;
324 CvDEPTH(cv) = (I32)POPs;
325
326#ifdef USE_THREADS
327 CvOWNER(cv) = (struct perl_thread *)POPs;
328 error does not work either
329#endif
330 } 1995 }
1996 OUTPUT:
1997 RETVAL
331 1998
332 PUTBACK; 1999void
333 } 2000force_cctx ()
334} 2001 CODE:
2002 struct coro *coro = SvSTATE (coro_current);
2003 coro->cctx->idle_sp = 0;
335 2004
336/* this is an EXACT copy of S_nuke_stacks in perl.c, which is unfortunately static */ 2005void
337STATIC void 2006throw (Coro::State self, SV *throw = &PL_sv_undef)
338destroy_stacks(pTHX) 2007 PROTOTYPE: $;$
339{ 2008 CODE:
340 /* die does this while calling POPSTACK, but I just don't see why. */ 2009 SvREFCNT_dec (self->throw);
341 dounwind(-1); 2010 self->throw = SvOK (throw) ? newSVsv (throw) : 0;
342 2011
343 /* is this ugly, I ask? */ 2012void
344 while (PL_scopestack_ix) 2013swap_defsv (Coro::State self)
345 LEAVE; 2014 PROTOTYPE: $
2015 ALIAS:
2016 swap_defav = 1
2017 CODE:
2018 if (!self->slot)
2019 croak ("cannot swap state with coroutine that has no saved state");
2020 else
2021 {
2022 SV **src = ix ? (SV **)&GvAV (PL_defgv) : &GvSV (PL_defgv);
2023 SV **dst = ix ? (SV **)&self->slot->defav : (SV **)&self->slot->defsv;
346 2024
347 while (PL_curstackinfo->si_next) 2025 SV *tmp = *src; *src = *dst; *dst = tmp;
348 PL_curstackinfo = PL_curstackinfo->si_next; 2026 }
349 2027
350 while (PL_curstackinfo)
351 {
352 PERL_SI *p = PL_curstackinfo->si_prev;
353
354 SvREFCNT_dec(PL_curstackinfo->si_stack);
355 Safefree(PL_curstackinfo->si_cxstack);
356 Safefree(PL_curstackinfo);
357 PL_curstackinfo = p;
358 }
359
360 if (PL_scopestack_ix != 0)
361 Perl_warner(aTHX_ WARN_INTERNAL,
362 "Unbalanced scopes: %ld more ENTERs than LEAVEs\n",
363 (long)PL_scopestack_ix);
364 if (PL_savestack_ix != 0)
365 Perl_warner(aTHX_ WARN_INTERNAL,
366 "Unbalanced saves: %ld more saves than restores\n",
367 (long)PL_savestack_ix);
368 if (PL_tmps_floor != -1)
369 Perl_warner(aTHX_ WARN_INTERNAL,"Unbalanced tmps: %ld more allocs than frees\n",
370 (long)PL_tmps_floor + 1);
371 /*
372 */
373 Safefree(PL_tmps_stack);
374 Safefree(PL_markstack);
375 Safefree(PL_scopestack);
376 Safefree(PL_savestack);
377 Safefree(PL_retstack);
378}
379
380#define SUB_INIT "Coro::State::_newcoro"
381
382MODULE = Coro::State PACKAGE = Coro::State 2028MODULE = Coro::State PACKAGE = Coro
383
384PROTOTYPES: ENABLE
385 2029
386BOOT: 2030BOOT:
387 if (!padlist_cache) 2031{
388 padlist_cache = newHV (); 2032 int i;
389 2033
390Coro::State 2034 av_async_pool = coro_get_av (aTHX_ "Coro::async_pool", TRUE);
391_newprocess(args) 2035 sv_pool_rss = coro_get_sv (aTHX_ "Coro::POOL_RSS" , TRUE);
392 SV * args 2036 sv_pool_size = coro_get_sv (aTHX_ "Coro::POOL_SIZE" , TRUE);
2037
2038 coro_current = coro_get_sv (aTHX_ "Coro::current", FALSE);
2039 SvREADONLY_on (coro_current);
2040
2041 coro_stash = gv_stashpv ("Coro", TRUE);
2042
2043 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
2044 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
2045 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
2046 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
2047 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
2048 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
2049
2050 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
2051 coro_ready[i] = newAV ();
2052
2053 {
2054 SV *sv = perl_get_sv ("Coro::API", TRUE);
2055 perl_get_sv ("Coro::API", TRUE); /* silence 5.10 warning */
2056
2057 coroapi.schedule = api_schedule;
2058 coroapi.cede = api_cede;
2059 coroapi.cede_notself = api_cede_notself;
2060 coroapi.ready = api_ready;
2061 coroapi.is_ready = api_is_ready;
2062 coroapi.nready = &coro_nready;
2063 coroapi.current = coro_current;
2064
2065 GCoroAPI = &coroapi;
2066 sv_setiv (sv, (IV)&coroapi);
2067 SvREADONLY_on (sv);
2068 }
2069}
2070
2071void
2072_set_current (SV *current)
393 PROTOTYPE: $ 2073 PROTOTYPE: $
2074 CODE:
2075 SvREFCNT_dec (SvRV (coro_current));
2076 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
2077
2078void
2079_set_readyhook (SV *hook)
2080 PROTOTYPE: $
394 CODE: 2081 CODE:
395 Coro__State coro;
396
397 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
398 croak ("Coro::State::newprocess expects an arrayref");
399 2082 LOCK;
400 New (0, coro, 1, struct coro); 2083 SvREFCNT_dec (coro_readyhook);
2084 coro_readyhook = SvOK (hook) ? newSVsv (hook) : 0;
2085 UNLOCK;
401 2086
402 coro->mainstack = 0; /* actual work is done inside transfer */ 2087int
403 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 2088prio (Coro::State coro, int newprio = 0)
404 2089 ALIAS:
2090 nice = 1
2091 CODE:
2092{
405 RETVAL = coro; 2093 RETVAL = coro->prio;
406 OUTPUT: 2094
2095 if (items > 1)
2096 {
2097 if (ix)
2098 newprio = coro->prio - newprio;
2099
2100 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
2101 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
2102
2103 coro->prio = newprio;
2104 }
2105}
2106 OUTPUT:
407 RETVAL 2107 RETVAL
408 2108
2109SV *
2110ready (SV *self)
2111 PROTOTYPE: $
2112 CODE:
2113 RETVAL = boolSV (api_ready (self));
2114 OUTPUT:
2115 RETVAL
2116
2117int
2118nready (...)
2119 PROTOTYPE:
2120 CODE:
2121 RETVAL = coro_nready;
2122 OUTPUT:
2123 RETVAL
2124
2125# for async_pool speedup
409void 2126void
410transfer(prev,next) 2127_pool_1 (SV *cb)
411 Coro::State_or_hashref prev 2128 CODE:
412 Coro::State_or_hashref next 2129{
2130 struct coro *coro = SvSTATE (coro_current);
2131 HV *hv = (HV *)SvRV (coro_current);
2132 AV *defav = GvAV (PL_defgv);
2133 SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0);
2134 AV *invoke_av;
2135 int i, len;
2136
2137 if (!invoke)
2138 {
2139 SV *old = PL_diehook;
2140 PL_diehook = 0;
2141 SvREFCNT_dec (old);
2142 croak ("\3async_pool terminate\2\n");
2143 }
2144
2145 SvREFCNT_dec (coro->saved_deffh);
2146 coro->saved_deffh = SvREFCNT_inc ((SV *)PL_defoutgv);
2147
2148 hv_store (hv, "desc", sizeof ("desc") - 1,
2149 newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0);
2150
2151 invoke_av = (AV *)SvRV (invoke);
2152 len = av_len (invoke_av);
2153
2154 sv_setsv (cb, AvARRAY (invoke_av)[0]);
2155
2156 if (len > 0)
2157 {
2158 av_fill (defav, len - 1);
2159 for (i = 0; i < len; ++i)
2160 av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1]));
2161 }
2162
2163 SvREFCNT_dec (invoke);
2164}
2165
2166void
2167_pool_2 (SV *cb)
2168 CODE:
2169{
2170 struct coro *coro = SvSTATE (coro_current);
2171
2172 sv_setsv (cb, &PL_sv_undef);
2173
2174 SvREFCNT_dec ((SV *)PL_defoutgv); PL_defoutgv = (GV *)coro->saved_deffh;
2175 coro->saved_deffh = 0;
2176
2177 if (coro_rss (aTHX_ coro) > SvIV (sv_pool_rss)
2178 || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size))
2179 {
2180 SV *old = PL_diehook;
2181 PL_diehook = 0;
2182 SvREFCNT_dec (old);
2183 croak ("\3async_pool terminate\2\n");
2184 }
2185
2186 av_clear (GvAV (PL_defgv));
2187 hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1,
2188 newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0);
2189
2190 coro->prio = 0;
2191
2192 if (coro->cctx && (coro->cctx->flags & CC_TRACE))
2193 api_trace (coro_current, 0);
2194
2195 av_push (av_async_pool, newSVsv (coro_current));
2196}
2197
2198#if 0
2199
2200void
2201_generator_call (...)
2202 PROTOTYPE: @
2203 PPCODE:
2204 fprintf (stderr, "call %p\n", CvXSUBANY(cv).any_ptr);
2205 xxxx
2206 abort ();
2207
2208SV *
2209gensub (SV *sub, ...)
2210 PROTOTYPE: &;@
413 CODE: 2211 CODE:
2212{
2213 struct coro *coro;
2214 MAGIC *mg;
2215 CV *xcv;
2216 CV *ncv = (CV *)newSV_type (SVt_PVCV);
2217 int i;
414 2218
415 if (prev != next) 2219 CvGV (ncv) = CvGV (cv);
2220 CvFILE (ncv) = CvFILE (cv);
2221
2222 Newz (0, coro, 1, struct coro);
2223 coro->args = newAV ();
2224 coro->flags = CF_NEW;
2225
2226 av_extend (coro->args, items - 1);
2227 for (i = 1; i < items; i++)
2228 av_push (coro->args, newSVsv (ST (i)));
2229
2230 CvISXSUB_on (ncv);
2231 CvXSUBANY (ncv).any_ptr = (void *)coro;
2232
2233 xcv = GvCV (gv_fetchpv ("Coro::_generator_call", 0, SVt_PVCV));
2234
2235 CvXSUB (ncv) = CvXSUB (xcv);
2236 CvANON_on (ncv);
2237
2238 mg = sv_magicext ((SV *)ncv, 0, CORO_MAGIC_type_state, &coro_gensub_vtbl, (char *)coro, 0);
2239 RETVAL = newRV_noinc ((SV *)ncv);
2240}
2241 OUTPUT:
2242 RETVAL
2243
2244#endif
2245
2246
2247MODULE = Coro::State PACKAGE = Coro::AIO
2248
2249SV *
2250_get_state ()
2251 CODE:
2252{
2253 struct io_state *data;
2254
2255 RETVAL = newSV (sizeof (struct io_state));
2256 data = (struct io_state *)SvPVX (RETVAL);
2257 SvCUR_set (RETVAL, sizeof (struct io_state));
2258 SvPOK_only (RETVAL);
2259
2260 data->errorno = errno;
2261 data->laststype = PL_laststype;
2262 data->laststatval = PL_laststatval;
2263 data->statcache = PL_statcache;
2264}
2265 OUTPUT:
2266 RETVAL
2267
2268void
2269_set_state (char *data_)
2270 PROTOTYPE: $
2271 CODE:
2272{
2273 struct io_state *data = (void *)data_;
2274
2275 errno = data->errorno;
2276 PL_laststype = data->laststype;
2277 PL_laststatval = data->laststatval;
2278 PL_statcache = data->statcache;
2279}
2280
2281
2282MODULE = Coro::State PACKAGE = Coro::AnyEvent
2283
2284BOOT:
2285 sv_activity = coro_get_sv (aTHX_ "Coro::AnyEvent::ACTIVITY", TRUE);
2286
2287SV *
2288_schedule (...)
2289 PROTOTYPE: @
2290 CODE:
2291{
2292 static int incede;
2293
2294 api_cede_notself ();
2295
2296 ++incede;
2297 while (coro_nready >= incede && api_cede ())
2298 ;
2299
2300 sv_setsv (sv_activity, &PL_sv_undef);
2301 if (coro_nready >= incede)
416 { 2302 {
2303 PUSHMARK (SP);
417 PUTBACK; 2304 PUTBACK;
418 SAVE (aTHX_ prev); 2305 call_pv ("Coro::AnyEvent::_activity", G_DISCARD | G_EVAL);
419
420 /*
421 * this could be done in newprocess which would lead to
422 * extremely elegant and fast (just PUTBACK/SAVE/LOAD/SPAGAIN)
423 * code here, but lazy allocation of stacks has also
424 * some virtues and the overhead of the if() is nil.
425 */
426 if (next->mainstack)
427 {
428 LOAD (aTHX_ next);
429 next->mainstack = 0; /* unnecessary but much cleaner */
430 SPAGAIN;
431 }
432 else
433 {
434 /*
435 * emulate part of the perl startup here.
436 */
437 UNOP myop;
438
439 init_stacks (); /* from perl.c */
440 PL_op = (OP *)&myop;
441 /*PL_curcop = 0;*/
442 GvAV (PL_defgv) = (AV *)SvREFCNT_inc ((SV *)next->args);
443
444 SPAGAIN;
445 Zero(&myop, 1, UNOP);
446 myop.op_next = Nullop;
447 myop.op_flags = OPf_WANT_VOID;
448
449 PUSHMARK(SP);
450 XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
451 PUTBACK;
452 /*
453 * the next line is slightly wrong, as PL_op->op_next
454 * is actually being executed so we skip the first op.
455 * that doesn't matter, though, since it is only
456 * pp_nextstate and we never return...
457 */
458 PL_op = Perl_pp_entersub(aTHX);
459 SPAGAIN;
460
461 ENTER;
462 }
463 }
464
465void
466DESTROY(coro)
467 Coro::State coro
468 CODE:
469
470 if (coro->mainstack)
471 {
472 struct coro temp;
473
474 PUTBACK;
475 SAVE(aTHX_ (&temp));
476 LOAD(aTHX_ coro);
477
478 destroy_stacks ();
479 SvREFCNT_dec ((SV *)GvAV (PL_defgv));
480
481 LOAD((&temp));
482 SPAGAIN; 2306 SPAGAIN;
483 } 2307 }
484 2308
485 SvREFCNT_dec (coro->args); 2309 --incede;
486 Safefree (coro); 2310}
487 2311
488 2312
2313MODULE = Coro::State PACKAGE = PerlIO::cede
2314
2315BOOT:
2316 PerlIO_define_layer (aTHX_ &PerlIO_cede);

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines