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

Diff Legend

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