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.14 by root, Mon Jul 23 23:48:05 2001 UTC vs.
Revision 1.142 by root, Tue Feb 13 19:21:29 2007 UTC

1#include "libcoro/coro.c"
2
1#include "EXTERN.h" 3#include "EXTERN.h"
2#include "perl.h" 4#include "perl.h"
3#include "XSUB.h" 5#include "XSUB.h"
4 6
5#include "libcoro/coro.c" 7#include "patchlevel.h"
8
9#include <stdio.h>
10#include <errno.h>
11#include <assert.h>
6 12
7#ifdef HAVE_MMAP 13#ifdef HAVE_MMAP
8# include <unistd.h> 14# include <unistd.h>
9# include <sys/mman.h> 15# include <sys/mman.h>
16# ifndef MAP_ANONYMOUS
17# ifdef MAP_ANON
18# define MAP_ANONYMOUS MAP_ANON
19# else
20# undef HAVE_MMAP
21# endif
10#endif 22# endif
23# include <limits.h>
24# ifndef PAGESIZE
25# define PAGESIZE pagesize
26# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
27static long pagesize;
28# else
29# define BOOT_PAGESIZE (void)0
30# endif
31#else
32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
11 35
12#define MAY_FLUSH /* increases codesize */ 36#if USE_VALGRIND
37# include <valgrind/valgrind.h>
38# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
39#else
40# define REGISTER_STACK(cctx,start,end)
41#endif
13 42
14#define TRANSFER_SAVE_DEFAV 0x00000001 43/* the maximum number of idle cctx that will be pooled */
15#define TRANSFER_SAVE_DEFSV 0x00000002 44#define MAX_IDLE_CCTX 8
16#define TRANSFER_SAVE_ERRSV 0x00000004
17#define TRANSFER_SAVE_CCTXT 0x00000008
18 45
19#define TRANSFER_SAVE_ALL -1 46#define PERL_VERSION_ATLEAST(a,b,c) \
47 (PERL_REVISION > (a) \
48 || (PERL_REVISION == (a) \
49 && (PERL_VERSION > (b) \
50 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
20 51
21#define SUB_INIT "Coro::State::initialize" 52#if !PERL_VERSION_ATLEAST (5,6,0)
22#define UCORO_STATE "_coro_state" 53# ifndef PL_ppaddr
54# define PL_ppaddr ppaddr
55# endif
56# ifndef call_sv
57# define call_sv perl_call_sv
58# endif
59# ifndef get_sv
60# define get_sv perl_get_sv
61# endif
62# ifndef get_cv
63# define get_cv perl_get_cv
64# endif
65# ifndef IS_PADGV
66# define IS_PADGV(v) 0
67# endif
68# ifndef IS_PADCONST
69# define IS_PADCONST(v) 0
70# endif
71#endif
23 72
73/* 5.8.7 */
74#ifndef SvRV_set
75# define SvRV_set(s,v) SvRV(s) = (v)
76#endif
77
78#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
79# undef STACKGUARD
80#endif
81
82#ifndef STACKGUARD
83# define STACKGUARD 0
84#endif
85
86/* prefer perl internal functions over our own? */
87#ifndef PREFER_PERL_FUNCTIONS
88# define PREFER_PERL_FUNCTIONS 0
89#endif
90
91/* The next macro should declare a variable stacklevel that contains and approximation
92 * to the current C stack pointer. Its property is that it changes with each call
93 * and should be unique. */
94#define dSTACKLEVEL int stacklevel
95#define STACKLEVEL ((void *)&stacklevel)
96
97#define IN_DESTRUCT (PL_main_cv == Nullcv)
98
99#if __GNUC__ >= 3
100# define attribute(x) __attribute__(x)
101# define BARRIER __asm__ __volatile__ ("" : : : "memory")
102#else
103# define attribute(x)
104# define BARRIER
105#endif
106
107#define NOINLINE attribute ((noinline))
108
109#include "CoroAPI.h"
110
111#ifdef USE_ITHREADS
112static perl_mutex coro_mutex;
113# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
114# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
115#else
116# define LOCK (void)0
117# define UNLOCK (void)0
118#endif
119
120/* helper storage struct for Coro::AIO */
121struct io_state
122{
123 int errorno;
124 I32 laststype;
125 int laststatval;
126 Stat_t statcache;
127};
128
129static struct CoroAPI coroapi;
130static AV *main_mainstack; /* used to differentiate between $main and others */
131static HV *coro_state_stash, *coro_stash;
132static SV *coro_mortal; /* will be freed after next transfer */
133
134static struct coro_cctx *cctx_first;
135static int cctx_count, cctx_idle;
136
137/* this is a structure representing a c-level coroutine */
138typedef struct coro_cctx {
139 struct coro_cctx *next;
140
141 /* the stack */
142 void *sptr;
143 ssize_t ssize; /* positive == mmap, otherwise malloc */
144
145 /* cpu state */
146 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
147 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
148 JMPENV *top_env;
149 coro_context cctx;
150
151 int inuse;
152
153#if USE_VALGRIND
154 int valgrind_id;
155#endif
156} coro_cctx;
157
158enum {
159 CF_RUNNING = 0x0001, /* coroutine is running */
160 CF_READY = 0x0002, /* coroutine is ready */
161 CF_NEW = 0x0004, /* has never been switched to */
162 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
163};
164
165/* this is a structure representing a perl-level coroutine */
24struct coro { 166struct coro {
25 /* the optional C context */ 167 /* the c coroutine allocated to this perl coroutine, if any */
26 coro_context cctx; 168 coro_cctx *cctx;
27 void *sptr;
28 long ssize;
29
30 /* optionally saved, might be zero */
31 AV *defav;
32 SV *defsv;
33 SV *errsv;
34
35 /* saved global state not related to stacks */
36 U8 dowarn;
37
38 /* the stacks and related info (callchain etc..) */
39 PERL_SI *curstackinfo;
40 AV *curstack;
41 AV *mainstack;
42 SV **stack_sp;
43 OP *op;
44 SV **curpad;
45 SV **stack_base;
46 SV **stack_max;
47 SV **tmps_stack;
48 I32 tmps_floor;
49 I32 tmps_ix;
50 I32 tmps_max;
51 I32 *markstack;
52 I32 *markstack_ptr;
53 I32 *markstack_max;
54 I32 *scopestack;
55 I32 scopestack_ix;
56 I32 scopestack_max;
57 ANY *savestack;
58 I32 savestack_ix;
59 I32 savestack_max;
60 OP **retstack;
61 I32 retstack_ix;
62 I32 retstack_max;
63 COP *curcop;
64 JMPENV start_env;
65 JMPENV *top_env;
66 169
67 /* data associated with this coroutine (initial args) */ 170 /* data associated with this coroutine (initial args) */
68 AV *args; 171 AV *args;
172 int refcnt;
173 int save; /* CORO_SAVE flags */
174 int flags; /* CF_ flags */
175
176 /* optionally saved, might be zero */
177 AV *defav; /* @_ */
178 SV *defsv; /* $_ */
179 SV *errsv; /* $@ */
180 SV *irssv; /* $/ */
181 SV *irssv_sv; /* real $/ cache */
182
183#define VAR(name,type) type name;
184# include "state.h"
185#undef VAR
186
187 /* coro process data */
188 int prio;
69}; 189};
70 190
71typedef struct coro *Coro__State; 191typedef struct coro *Coro__State;
72typedef struct coro *Coro__State_or_hashref; 192typedef struct coro *Coro__State_or_hashref;
73 193
74static AV *main_mainstack; /* used to differentiate between $main and others */ 194/** Coro ********************************************************************/
75static HV *coro_state_stash;
76static SV *ucoro_state_sv;
77static U32 ucoro_state_hash;
78static HV *padlist_cache;
79 195
80/* mostly copied from op.c:cv_clone2 */ 196#define PRIO_MAX 3
81STATIC AV * 197#define PRIO_HIGH 1
82clone_padlist (AV *protopadlist) 198#define PRIO_NORMAL 0
199#define PRIO_LOW -1
200#define PRIO_IDLE -3
201#define PRIO_MIN -4
202
203/* for Coro.pm */
204static SV *coro_current;
205static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
206static int coro_nready;
207
208/** lowlevel stuff **********************************************************/
209
210static AV *
211coro_clone_padlist (CV *cv)
83{ 212{
84 AV *av; 213 AV *padlist = CvPADLIST (cv);
85 I32 ix;
86 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
87 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
88 SV **pname = AvARRAY (protopad_name);
89 SV **ppad = AvARRAY (protopad);
90 I32 fname = AvFILLp (protopad_name);
91 I32 fpad = AvFILLp (protopad);
92 AV *newpadlist, *newpad_name, *newpad; 214 AV *newpadlist, *newpad;
93 SV **npad;
94
95 newpad_name = newAV ();
96 for (ix = fname; ix >= 0; ix--)
97 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
98
99 newpad = newAV ();
100 av_fill (newpad, AvFILLp (protopad));
101 npad = AvARRAY (newpad);
102 215
103 newpadlist = newAV (); 216 newpadlist = newAV ();
104 AvREAL_off (newpadlist); 217 AvREAL_off (newpadlist);
105 av_store (newpadlist, 0, (SV *) newpad_name); 218#if PERL_VERSION_ATLEAST (5,9,0)
219 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
220#else
221 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
222#endif
223 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
224 --AvFILLp (padlist);
225
226 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
106 av_store (newpadlist, 1, (SV *) newpad); 227 av_store (newpadlist, 1, (SV *)newpad);
107 228
108 av = newAV (); /* will be @_ */ 229 return newpadlist;
109 av_extend (av, 0); 230}
110 av_store (newpad, 0, (SV *) av);
111 AvFLAGS (av) = AVf_REIFY;
112 231
113 for (ix = fpad; ix > 0; ix--) 232static void
233free_padlist (AV *padlist)
234{
235 /* may be during global destruction */
236 if (SvREFCNT (padlist))
114 { 237 {
115 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 238 I32 i = AvFILLp (padlist);
116 if (namesv && namesv != &PL_sv_undef) 239 while (i >= 0)
117 { 240 {
118 char *name = SvPVX (namesv); /* XXX */ 241 SV **svp = av_fetch (padlist, i--, FALSE);
119 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 242 if (svp)
120 { /* lexical from outside? */
121 npad[ix] = SvREFCNT_inc (ppad[ix]);
122 } 243 {
123 else
124 { /* our own lexical */
125 SV *sv; 244 SV *sv;
126 if (*name == '&') 245 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
127 sv = SvREFCNT_inc (ppad[ix]); 246 SvREFCNT_dec (sv);
128 else if (*name == '@') 247
129 sv = (SV *) newAV (); 248 SvREFCNT_dec (*svp);
130 else if (*name == '%')
131 sv = (SV *) newHV ();
132 else
133 sv = NEWSV (0, 0);
134 if (!SvPADBUSY (sv))
135 SvPADMY_on (sv);
136 npad[ix] = sv;
137 } 249 }
138 } 250 }
139 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
140 {
141 npad[ix] = SvREFCNT_inc (ppad[ix]);
142 }
143 else
144 {
145 SV *sv = NEWSV (0, 0);
146 SvPADTMP_on (sv);
147 npad[ix] = sv;
148 }
149 }
150 251
151#if 0 /* return -ENOTUNDERSTOOD */
152 /* Now that vars are all in place, clone nested closures. */
153
154 for (ix = fpad; ix > 0; ix--) {
155 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
156 if (namesv
157 && namesv != &PL_sv_undef
158 && !(SvFLAGS(namesv) & SVf_FAKE)
159 && *SvPVX(namesv) == '&'
160 && CvCLONE(ppad[ix]))
161 {
162 CV *kid = cv_clone((CV*)ppad[ix]);
163 SvREFCNT_dec(ppad[ix]);
164 CvCLONE_on(kid);
165 SvPADMY_on(kid);
166 npad[ix] = (SV*)kid;
167 }
168 }
169#endif
170
171 return newpadlist;
172}
173
174#ifdef MAY_FLUSH
175STATIC AV *
176free_padlist (AV *padlist)
177{
178 /* may be during global destruction */
179 if (SvREFCNT(padlist))
180 {
181 I32 i = AvFILLp(padlist);
182 while (i >= 0)
183 {
184 SV **svp = av_fetch(padlist, i--, FALSE);
185 SV *sv = svp ? *svp : Nullsv;
186 if (sv)
187 SvREFCNT_dec(sv);
188 }
189
190 SvREFCNT_dec((SV*)padlist); 252 SvREFCNT_dec ((SV*)padlist);
191 } 253 }
192} 254}
193#endif 255
256static int
257coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
258{
259 AV *padlist;
260 AV *av = (AV *)mg->mg_obj;
261
262 /* casting is fun. */
263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264 free_padlist (padlist);
265
266 SvREFCNT_dec (av);
267
268 return 0;
269}
270
271#define PERL_MAGIC_coro PERL_MAGIC_ext
272
273static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
274
275#define CORO_MAGIC(cv) \
276 SvMAGIC (cv) \
277 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
278 ? SvMAGIC (cv) \
279 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
280 : 0
194 281
195/* the next two functions merely cache the padlists */ 282/* the next two functions merely cache the padlists */
196STATIC void 283static void
197get_padlist (CV *cv) 284get_padlist (CV *cv)
198{ 285{
199 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 286 MAGIC *mg = CORO_MAGIC (cv);
287 AV *av;
200 288
201 if (he && AvFILLp ((AV *)*he) >= 0) 289 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
202 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 290 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
203 else 291 else
292 {
293#if PREFER_PERL_FUNCTIONS
294 /* this is probably cleaner, but also slower? */
295 CV *cp = Perl_cv_clone (cv);
296 CvPADLIST (cv) = CvPADLIST (cp);
297 CvPADLIST (cp) = 0;
298 SvREFCNT_dec (cp);
299#else
204 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 300 CvPADLIST (cv) = coro_clone_padlist (cv);
301#endif
302 }
205} 303}
206 304
207STATIC void 305static void
208put_padlist (CV *cv) 306put_padlist (CV *cv)
209{ 307{
210 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 308 MAGIC *mg = CORO_MAGIC (cv);
309 AV *av;
211 310
212 if (SvTYPE (*he) != SVt_PVAV) 311 if (!mg)
213 {
214 SvREFCNT_dec (*he);
215 *he = (SV *)newAV ();
216 } 312 {
217 313 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
218 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 314 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
219} 315 mg->mg_virtual = &vtbl_coro;
220 316 mg->mg_obj = (SV *)newAV ();
221#ifdef MAY_FLUSH
222STATIC void
223flush_padlist_cache ()
224{
225 HV *hv = padlist_cache;
226 padlist_cache = newHV ();
227
228 if (hv_iterinit (hv))
229 { 317 }
230 HE *he;
231 AV *padlist;
232 318
233 while (!!(he = hv_iternext (hv))) 319 av = (AV *)mg->mg_obj;
234 {
235 AV *av = (AV *)HeVAL(he);
236 320
237 /* casting is fun. */ 321 if (AvFILLp (av) >= AvMAX (av))
238 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 322 av_extend (av, AvMAX (av) + 1);
239 free_padlist (padlist);
240 }
241 }
242 323
243 SvREFCNT_dec (hv); 324 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
244} 325}
245#endif 326
327/** load & save, init *******************************************************/
246 328
247#define SB do { 329#define SB do {
248#define SE } while (0) 330#define SE } while (0)
249 331
250#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
251#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
252
253#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 332#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
254 333
255static void 334static void
256load_state(pTHX_ Coro__State c) 335load_perl (Coro__State c)
257{ 336{
258 PL_dowarn = c->dowarn; 337#define VAR(name,type) PL_ ## name = c->name;
259 338# include "state.h"
260 PL_curstackinfo = c->curstackinfo; 339#undef VAR
261 PL_curstack = c->curstack;
262 PL_mainstack = c->mainstack;
263 PL_stack_sp = c->stack_sp;
264 PL_op = c->op;
265 PL_curpad = c->curpad;
266 PL_stack_base = c->stack_base;
267 PL_stack_max = c->stack_max;
268 PL_tmps_stack = c->tmps_stack;
269 PL_tmps_floor = c->tmps_floor;
270 PL_tmps_ix = c->tmps_ix;
271 PL_tmps_max = c->tmps_max;
272 PL_markstack = c->markstack;
273 PL_markstack_ptr = c->markstack_ptr;
274 PL_markstack_max = c->markstack_max;
275 PL_scopestack = c->scopestack;
276 PL_scopestack_ix = c->scopestack_ix;
277 PL_scopestack_max = c->scopestack_max;
278 PL_savestack = c->savestack;
279 PL_savestack_ix = c->savestack_ix;
280 PL_savestack_max = c->savestack_max;
281 PL_retstack = c->retstack;
282 PL_retstack_ix = c->retstack_ix;
283 PL_retstack_max = c->retstack_max;
284 PL_curcop = c->curcop;
285 PL_start_env = c->start_env;
286 PL_top_env = c->top_env;
287 340
288 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 341 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
289 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 342 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
290 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 343 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
344 if (c->irssv)
345 {
346 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
347 SvREFCNT_dec (c->irssv);
348 else
349 {
350 REPLACE_SV (PL_rs, c->irssv);
351 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
352 sv_setsv (c->irssv_sv, PL_rs);
353 }
354 }
291 355
292 { 356 {
293 dSP; 357 dSP;
294 CV *cv; 358 CV *cv;
295 359
296 /* now do the ugly restore mess */ 360 /* now do the ugly restore mess */
297 while ((cv = (CV *)POPs)) 361 while ((cv = (CV *)POPs))
298 { 362 {
299 AV *padlist = (AV *)POPs;
300
301 if (padlist)
302 {
303 put_padlist (cv); /* mark this padlist as available */ 363 put_padlist (cv); /* mark this padlist as available */
304 CvPADLIST(cv) = padlist; 364 CvDEPTH (cv) = PTR2IV (POPs);
305#ifdef USE_THREADS 365 CvPADLIST (cv) = (AV *)POPs;
306 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
307#endif
308 }
309
310 ++CvDEPTH(cv);
311 } 366 }
312 367
313 PUTBACK; 368 PUTBACK;
314 } 369 }
370 assert (!PL_comppad || AvARRAY (PL_comppad));//D
315} 371}
316 372
317static void 373static void
318save_state(pTHX_ Coro__State c, int flags) 374save_perl (Coro__State c)
319{ 375{
376 assert (!PL_comppad || AvARRAY (PL_comppad));//D
320 { 377 {
321 dSP; 378 dSP;
322 I32 cxix = cxstack_ix; 379 I32 cxix = cxstack_ix;
323 PERL_CONTEXT *ccstk = cxstack; 380 PERL_CONTEXT *ccstk = cxstack;
324 PERL_SI *top_si = PL_curstackinfo; 381 PERL_SI *top_si = PL_curstackinfo;
… …
326 /* 383 /*
327 * the worst thing you can imagine happens first - we have to save 384 * the worst thing you can imagine happens first - we have to save
328 * (and reinitialize) all cv's in the whole callchain :( 385 * (and reinitialize) all cv's in the whole callchain :(
329 */ 386 */
330 387
388 EXTEND (SP, 3 + 1);
331 PUSHs (Nullsv); 389 PUSHs (Nullsv);
332 /* this loop was inspired by pp_caller */ 390 /* this loop was inspired by pp_caller */
333 for (;;) 391 for (;;)
334 { 392 {
335 do 393 while (cxix >= 0)
336 { 394 {
337 PERL_CONTEXT *cx = &ccstk[cxix--]; 395 PERL_CONTEXT *cx = &ccstk[cxix--];
338 396
339 if (CxTYPE(cx) == CXt_SUB) 397 if (CxTYPE (cx) == CXt_SUB)
340 { 398 {
341 CV *cv = cx->blk_sub.cv; 399 CV *cv = cx->blk_sub.cv;
400
342 if (CvDEPTH(cv)) 401 if (CvDEPTH (cv))
343 { 402 {
344#ifdef USE_THREADS
345 /*XPUSHs ((SV *)CvOWNER(cv));*/
346 /*CvOWNER(cv) = 0;*/
347 /*error must unlock this cv etc.. etc...*/
348#endif
349 EXTEND (SP, CvDEPTH(cv)*2); 403 EXTEND (SP, 3);
350
351 while (--CvDEPTH(cv))
352 {
353 /* this tells the restore code to increment CvDEPTH */
354 PUSHs (Nullsv);
355 PUSHs ((SV *)cv);
356 }
357
358 PUSHs ((SV *)CvPADLIST(cv)); 404 PUSHs ((SV *)CvPADLIST (cv));
405 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
359 PUSHs ((SV *)cv); 406 PUSHs ((SV *)cv);
360 407
408 CvDEPTH (cv) = 0;
361 get_padlist (cv); /* this is a monster */ 409 get_padlist (cv);
362 } 410 }
363 } 411 }
364 else if (CxTYPE(cx) == CXt_FORMAT)
365 {
366 /* I never used formats, so how should I know how these are implemented? */
367 /* my bold guess is as a simple, plain sub... */
368 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
369 }
370 } 412 }
371 while (cxix >= 0);
372 413
373 if (top_si->si_type == PERLSI_MAIN) 414 if (top_si->si_type == PERLSI_MAIN)
374 break; 415 break;
375 416
376 top_si = top_si->si_prev; 417 top_si = top_si->si_prev;
… …
379 } 420 }
380 421
381 PUTBACK; 422 PUTBACK;
382 } 423 }
383 424
384 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 425 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
385 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 426 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
386 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 427 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
428 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
387 429
388 /* I have not the slightest idea of why av_reify is necessary */ 430#define VAR(name,type)c->name = PL_ ## name;
389 /* but if it's missing the defav contents magically get replaced sometimes */ 431# include "state.h"
390 if (c->defav) 432#undef VAR
391 av_reify (c->defav);
392
393 c->dowarn = PL_dowarn;
394
395 c->curstackinfo = PL_curstackinfo;
396 c->curstack = PL_curstack;
397 c->mainstack = PL_mainstack;
398 c->stack_sp = PL_stack_sp;
399 c->op = PL_op;
400 c->curpad = PL_curpad;
401 c->stack_base = PL_stack_base;
402 c->stack_max = PL_stack_max;
403 c->tmps_stack = PL_tmps_stack;
404 c->tmps_floor = PL_tmps_floor;
405 c->tmps_ix = PL_tmps_ix;
406 c->tmps_max = PL_tmps_max;
407 c->markstack = PL_markstack;
408 c->markstack_ptr = PL_markstack_ptr;
409 c->markstack_max = PL_markstack_max;
410 c->scopestack = PL_scopestack;
411 c->scopestack_ix = PL_scopestack_ix;
412 c->scopestack_max = PL_scopestack_max;
413 c->savestack = PL_savestack;
414 c->savestack_ix = PL_savestack_ix;
415 c->savestack_max = PL_savestack_max;
416 c->retstack = PL_retstack;
417 c->retstack_ix = PL_retstack_ix;
418 c->retstack_max = PL_retstack_max;
419 c->curcop = PL_curcop;
420 c->start_env = PL_start_env;
421 c->top_env = PL_top_env;
422} 433}
423 434
424/* 435/*
425 * allocate various perl stacks. This is an exact copy 436 * allocate various perl stacks. This is an exact copy
426 * of perl.c:init_stacks, except that it uses less memory 437 * of perl.c:init_stacks, except that it uses less memory
427 * on the assumption that coroutines do not usually need 438 * on the (sometimes correct) assumption that coroutines do
428 * a lot of stackspace. 439 * not usually need a lot of stackspace.
429 */ 440 */
430STATIC void 441#if PREFER_PERL_FUNCTIONS
442# define coro_init_stacks init_stacks
443#else
444static void
431coro_init_stacks (pTHX) 445coro_init_stacks ()
432{ 446{
433 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 447 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
434 PL_curstackinfo->si_type = PERLSI_MAIN; 448 PL_curstackinfo->si_type = PERLSI_MAIN;
435 PL_curstack = PL_curstackinfo->si_stack; 449 PL_curstack = PL_curstackinfo->si_stack;
436 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 450 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
437 451
438 PL_stack_base = AvARRAY(PL_curstack); 452 PL_stack_base = AvARRAY(PL_curstack);
439 PL_stack_sp = PL_stack_base; 453 PL_stack_sp = PL_stack_base;
440 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 454 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
441 455
442 New(50,PL_tmps_stack,64,SV*); 456 New(50,PL_tmps_stack,128,SV*);
443 PL_tmps_floor = -1; 457 PL_tmps_floor = -1;
444 PL_tmps_ix = -1; 458 PL_tmps_ix = -1;
445 PL_tmps_max = 64; 459 PL_tmps_max = 128;
446 460
447 New(54,PL_markstack,12,I32); 461 New(54,PL_markstack,32,I32);
448 PL_markstack_ptr = PL_markstack; 462 PL_markstack_ptr = PL_markstack;
449 PL_markstack_max = PL_markstack + 12; 463 PL_markstack_max = PL_markstack + 32;
450 464
465#ifdef SET_MARK_OFFSET
451 SET_MARK_OFFSET; 466 SET_MARK_OFFSET;
467#endif
452 468
453 New(54,PL_scopestack,12,I32); 469 New(54,PL_scopestack,32,I32);
454 PL_scopestack_ix = 0; 470 PL_scopestack_ix = 0;
455 PL_scopestack_max = 12; 471 PL_scopestack_max = 32;
456 472
457 New(54,PL_savestack,64,ANY); 473 New(54,PL_savestack,64,ANY);
458 PL_savestack_ix = 0; 474 PL_savestack_ix = 0;
459 PL_savestack_max = 64; 475 PL_savestack_max = 64;
460 476
477#if !PERL_VERSION_ATLEAST (5,9,0)
461 New(54,PL_retstack,8,OP*); 478 New(54,PL_retstack,16,OP*);
462 PL_retstack_ix = 0; 479 PL_retstack_ix = 0;
463 PL_retstack_max = 8; 480 PL_retstack_max = 16;
481#endif
464} 482}
483#endif
465 484
466/* 485/*
467 * destroy the stacks, the callchain etc... 486 * destroy the stacks, the callchain etc...
468 * still there is a memleak of 128 bytes...
469 */ 487 */
470STATIC void 488static void
471destroy_stacks(pTHX) 489coro_destroy_stacks ()
472{ 490{
473 /* is this ugly, I ask? */ 491 if (!IN_DESTRUCT)
474 while (PL_scopestack_ix) 492 {
475 LEAVE; 493 /* restore all saved variables and stuff */
494 LEAVE_SCOPE (0);
495 assert (PL_tmps_floor == -1);
476 496
477 /* sure it is, but more important: is it correct?? :/ */ 497 /* free all temporaries */
478 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
479 FREETMPS; 498 FREETMPS;
499 assert (PL_tmps_ix == -1);
500
501 /* unwind all extra stacks */
502 POPSTACK_TO (PL_mainstack);
503
504 /* unwind main stack */
505 dounwind (-1);
506 }
480 507
481 while (PL_curstackinfo->si_next) 508 while (PL_curstackinfo->si_next)
482 PL_curstackinfo = PL_curstackinfo->si_next; 509 PL_curstackinfo = PL_curstackinfo->si_next;
483 510
484 while (PL_curstackinfo) 511 while (PL_curstackinfo)
485 { 512 {
486 PERL_SI *p = PL_curstackinfo->si_prev; 513 PERL_SI *p = PL_curstackinfo->si_prev;
487 514
488 { 515 if (!IN_DESTRUCT)
489 dSP;
490 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
491 PUTBACK; /* possibly superfluous */
492 }
493
494 dounwind(-1);
495
496 SvREFCNT_dec(PL_curstackinfo->si_stack); 516 SvREFCNT_dec (PL_curstackinfo->si_stack);
517
497 Safefree(PL_curstackinfo->si_cxstack); 518 Safefree (PL_curstackinfo->si_cxstack);
498 Safefree(PL_curstackinfo); 519 Safefree (PL_curstackinfo);
499 PL_curstackinfo = p; 520 PL_curstackinfo = p;
500 } 521 }
501 522
502 Safefree(PL_tmps_stack); 523 Safefree (PL_tmps_stack);
503 Safefree(PL_markstack); 524 Safefree (PL_markstack);
504 Safefree(PL_scopestack); 525 Safefree (PL_scopestack);
505 Safefree(PL_savestack); 526 Safefree (PL_savestack);
527#if !PERL_VERSION_ATLEAST (5,9,0)
506 Safefree(PL_retstack); 528 Safefree (PL_retstack);
507}
508
509static void
510allocate_stack (Coro__State ctx)
511{
512#ifdef HAVE_MMAP
513 ctx->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */
514 ctx->sptr = mmap (0, ctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
515 if (ctx->sptr == (void *)-1)
516#endif 529#endif
517 {
518 /*FIXME*//*D*//* reasonable stack size! */
519 ctx->ssize = 4096 * sizeof (long);
520 New (0, ctx->sptr, 4096, long);
521 }
522} 530}
523 531
524static void 532/** coroutine stack handling ************************************************/
525deallocate_stack (Coro__State ctx)
526{
527#ifdef HAVE_MMAP
528 munmap (ctx->sptr, ctx->ssize);
529#else
530 Safefree (ctx->sptr);
531#endif
532}
533 533
534/* might go away together with optional SAVE_CCTXT */
535static void 534static void
536setup_coro (void *arg) 535setup_coro (struct coro *coro)
537{ 536{
538 /* 537 /*
539 * emulate part of the perl startup here. 538 * emulate part of the perl startup here.
540 */ 539 */
540
541 coro_init_stacks ();
542
543 PL_curcop = &PL_compiling;
544 PL_in_eval = EVAL_NULL;
545 PL_comppad = 0;
546 PL_curpm = 0;
547 PL_localizing = 0;
548 PL_dirty = 0;
549 PL_restartop = 0;
550
551 {
552 dSP;
553 LOGOP myop;
554
555 SvREFCNT_dec (GvAV (PL_defgv));
556 GvAV (PL_defgv) = coro->args; coro->args = 0;
557
558 Zero (&myop, 1, LOGOP);
559 myop.op_next = Nullop;
560 myop.op_flags = OPf_WANT_VOID;
561
562 PUSHMARK (SP);
563 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
564 PUTBACK;
565 PL_op = (OP *)&myop;
566 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
567 SPAGAIN;
568 }
569
570 ENTER; /* necessary e.g. for dounwind */
571}
572
573static void
574free_coro_mortal ()
575{
576 if (coro_mortal)
577 {
578 SvREFCNT_dec (coro_mortal);
579 coro_mortal = 0;
580 }
581}
582
583/* inject a fake call to Coro::State::_cctx_init into the execution */
584static void NOINLINE
585prepare_cctx (coro_cctx *cctx)
586{
541 dSP; 587 dSP;
542 Coro__State ctx = (Coro__State)arg; 588 LOGOP myop;
543 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
544 589
545 coro_init_stacks (aTHX); 590 Zero (&myop, 1, LOGOP);
546 JMPENV_BOOTSTRAP; 591 myop.op_next = PL_op;
592 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
593
594 PUSHMARK (SP);
595 EXTEND (SP, 2);
596 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
597 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
598 PUTBACK;
599 PL_op = (OP *)&myop;
600 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
547 SPAGAIN; 601 SPAGAIN;
602}
548 603
549 /*PL_curcop = 0;*/ 604static void
550 SvREFCNT_dec (GvAV (PL_defgv)); 605coro_run (void *arg)
551 GvAV (PL_defgv) = ctx->args; 606{
607 /* coro_run is the alternative tail of transfer(), so unlock here. */
608 UNLOCK;
552 609
553 if (ctx->sptr) 610 /*
611 * this is a _very_ stripped down perl interpreter ;)
612 */
613 PL_top_env = &PL_start_env;
614
615 /* inject call to cctx_init */
616 prepare_cctx ((coro_cctx *)arg);
617
618 /* somebody will hit me for both perl_run and PL_restartop */
619 PL_restartop = PL_op;
620 perl_run (PL_curinterp);
621
622 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
623 abort ();
624}
625
626static coro_cctx *
627cctx_new ()
628{
629 coro_cctx *cctx;
630
631 ++cctx_count;
632
633 Newz (0, cctx, 1, coro_cctx);
634
635#if HAVE_MMAP
636
637 cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
638 /* mmap supposedly does allocate-on-write for us */
639 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
640
641 if (cctx->sptr != (void *)-1)
554 { 642 {
555 PUSHMARK(SP); 643# if STACKGUARD
556 PUTBACK; 644 mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
557 (void) call_sv (sub_init, G_VOID|G_NOARGS); 645# endif
558 croak ("FATAL: CCTXT coroutine returned!"); 646 REGISTER_STACK (
647 cctx,
648 STACKGUARD * PAGESIZE + (char *)cctx->sptr,
649 cctx->ssize + (char *)cctx->sptr
650 );
651
652 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);
559 } 653 }
560 else 654 else
561 { 655#endif
562 UNOP myop;
563
564 PL_op = (OP *)&myop;
565
566 Zero(&myop, 1, UNOP);
567 myop.op_next = Nullop;
568 myop.op_flags = OPf_WANT_VOID;
569
570 PUSHMARK(SP);
571 XPUSHs (sub_init);
572 /*
573 * the next line is slightly wrong, as PL_op->op_next
574 * is actually being executed so we skip the first op.
575 * that doesn't matter, though, since it is only
576 * pp_nextstate and we never return...
577 * ah yes, and I don't care anyways ;)
578 */
579 PUTBACK;
580 PL_op = pp_entersub();
581 SPAGAIN;
582
583 ENTER; /* necessary e.g. for dounwind */
584 } 656 {
585} 657 cctx->ssize = -STACKSIZE * (long)sizeof (long);
658 New (0, cctx->sptr, STACKSIZE, long);
586 659
587STATIC void 660 if (!cctx->sptr)
588transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
589{
590 dSP;
591
592 if (prev != next)
593 {
594 /*
595 * this could be done in newprocess which would lead to
596 * extremely elegant and fast (basically just SAVE/LOAD)
597 * code here, but lazy allocation of stacks has also
598 * some virtues and the overhead of the if() is nil.
599 */
600 if (next->mainstack)
601 { 661 {
602 SAVE (prev, flags); 662 perror ("FATAL: unable to allocate stack for coroutine");
603 LOAD (next); 663 _exit (EXIT_FAILURE);
604
605 /* mark this state as in-use */
606 next->mainstack = 0;
607 next->tmps_ix = -2;
608
609 if (flags & TRANSFER_SAVE_CCTXT)
610 {
611 if (!next->ssize)
612 croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize);
613
614 if (!prev->ssize)
615 prev->ssize = 1; /* mark cctx as valid ;) */
616
617 coro_transfer (&(prev->cctx), &(next->cctx));
618 }
619
620 } 664 }
621 else if (next->tmps_ix == -2) 665
622 croak ("tried to transfer to running coroutine"); 666 REGISTER_STACK (
667 cctx,
668 (char *)cctx->sptr,
669 (char *)cctx->sptr - cctx->ssize
670 );
671
672 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, -cctx->ssize);
673 }
674
675 return cctx;
676}
677
678static void
679cctx_destroy (coro_cctx *cctx)
680{
681 if (!cctx)
682 return;
683
684 --cctx_count;
685
686#if USE_VALGRIND
687 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
688#endif
689
690#if HAVE_MMAP
691 if (cctx->ssize > 0)
692 munmap (cctx->sptr, cctx->ssize);
693 else
694#endif
695 Safefree (cctx->sptr);
696
697 Safefree (cctx);
698}
699
700static coro_cctx *
701cctx_get ()
702{
703 coro_cctx *cctx;
704
705 if (cctx_first)
706 {
707 cctx = cctx_first;
708 cctx_first = cctx->next;
709 --cctx_idle;
710 }
711 else
712 {
713 cctx = cctx_new ();
714 PL_op = PL_op->op_next;
715 }
716
717 return cctx;
718}
719
720static void
721cctx_put (coro_cctx *cctx)
722{
723 /* free another cctx if overlimit */
724 if (cctx_idle >= MAX_IDLE_CCTX)
725 {
726 coro_cctx *first = cctx_first;
727 cctx_first = first->next;
728 --cctx_idle;
729
730 assert (!first->inuse);
731 cctx_destroy (first);
732 }
733
734 ++cctx_idle;
735 cctx->next = cctx_first;
736 cctx_first = cctx;
737}
738
739/** coroutine switching *****************************************************/
740
741/* never call directly, always through the coro_state_transfer global variable */
742static void NOINLINE
743transfer (struct coro *prev, struct coro *next)
744{
745 dSTACKLEVEL;
746
747 /* sometimes transfer is only called to set idle_sp */
748 if (!next)
749 {
750 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
751 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
752 }
753 else if (prev != next)
754 {
755 coro_cctx *prev__cctx;
756
757 if (prev->flags & CF_NEW)
758 {
759 /* create a new empty context */
760 Newz (0, prev->cctx, 1, coro_cctx);
761 prev->cctx->inuse = 1;
762 prev->flags &= ~CF_NEW;
763 prev->flags |= CF_RUNNING;
764 }
765
766 /*TODO: must not croak here */
767 if (!prev->flags & CF_RUNNING)
768 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
769
770 if (next->flags & CF_RUNNING)
771 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
772
773 if (next->flags & CF_DESTROYED)
774 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
775
776 prev->flags &= ~CF_RUNNING;
777 next->flags |= CF_RUNNING;
778
779 LOCK;
780
781 if (next->flags & CF_NEW)
782 {
783 /* need to start coroutine */
784 next->flags &= ~CF_NEW;
785 /* first get rid of the old state */
786 save_perl (prev);
787 /* setup coroutine call */
788 setup_coro (next);
789 /* need a new stack */
790 assert (!next->cctx);
791 }
623 else 792 else
624 { 793 {
625 SAVE (prev, -1); /* first get rid of the old state */ 794 /* coroutine already started */
626 795 save_perl (prev);
627 if (flags & TRANSFER_SAVE_CCTXT) 796 load_perl (next);
628 {
629 if (!next->ssize)
630 {
631 allocate_stack (next);
632 coro_create (&(next->cctx),
633 setup_coro, (void *)next,
634 next->sptr, next->ssize);
635 }
636
637 if (!prev->ssize)
638 prev->ssize = 1; /* mark cctx as valid ;) */
639
640 coro_transfer (&(prev->cctx), &(next->cctx));
641 }
642 else
643 setup_coro (next);
644 } 797 }
798
799 prev__cctx = prev->cctx;
800
801 /* possibly "free" the cctx */
802 if (prev__cctx->idle_sp == STACKLEVEL)
803 {
804 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
805 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
806
807 prev->cctx = 0;
808
809 cctx_put (prev__cctx);
810 prev__cctx->inuse = 0;
811 }
812
813 if (!next->cctx)
814 {
815 next->cctx = cctx_get ();
816 assert (!next->cctx->inuse);
817 next->cctx->inuse = 1;
818 }
819
820 if (prev__cctx != next->cctx)
821 {
822 prev__cctx->top_env = PL_top_env;
823 PL_top_env = next->cctx->top_env;
824 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
825 }
826
827 free_coro_mortal ();
828 UNLOCK;
829 }
830}
831
832struct transfer_args
833{
834 struct coro *prev, *next;
835};
836
837#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
838
839/** high level stuff ********************************************************/
840
841static int
842coro_state_destroy (struct coro *coro)
843{
844 if (coro->flags & CF_DESTROYED)
845 return 0;
846
847 coro->flags |= CF_DESTROYED;
848
849 if (coro->flags & CF_READY)
645 } 850 {
851 /* reduce nready, as destroying a ready coro effectively unreadies it */
852 /* alternative: look through all ready queues and remove the coro */
853 LOCK;
854 --coro_nready;
855 UNLOCK;
856 }
857 else
858 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
859
860 if (coro->mainstack && coro->mainstack != main_mainstack)
861 {
862 struct coro temp;
863
864 assert (!(coro->flags & CF_RUNNING));
865
866 Zero (&temp, 1, struct coro);
867 temp.save = CORO_SAVE_ALL;
868
869 if (coro->flags & CF_RUNNING)
870 croak ("FATAL: tried to destroy currently running coroutine");
871
872 save_perl (&temp);
873 load_perl (coro);
874
875 coro_destroy_stacks ();
876
877 load_perl (&temp); /* this will get rid of defsv etc.. */
878
879 coro->mainstack = 0;
880 }
881
882 cctx_destroy (coro->cctx);
883 SvREFCNT_dec (coro->args);
884
885 return 1;
886}
887
888static int
889coro_state_free (pTHX_ SV *sv, MAGIC *mg)
890{
891 struct coro *coro = (struct coro *)mg->mg_ptr;
892 mg->mg_ptr = 0;
893
894 if (--coro->refcnt < 0)
895 {
896 coro_state_destroy (coro);
897 Safefree (coro);
898 }
899
900 return 0;
901}
902
903static int
904coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
905{
906 struct coro *coro = (struct coro *)mg->mg_ptr;
907
908 ++coro->refcnt;
909
910 return 0;
911}
912
913static MGVTBL coro_state_vtbl = {
914 0, 0, 0, 0,
915 coro_state_free,
916 0,
917#ifdef MGf_DUP
918 coro_state_dup,
919#else
920# define MGf_DUP 0
921#endif
922};
923
924static struct coro *
925SvSTATE (SV *coro)
926{
927 HV *stash;
928 MAGIC *mg;
929
930 if (SvROK (coro))
931 coro = SvRV (coro);
932
933 stash = SvSTASH (coro);
934 if (stash != coro_stash && stash != coro_state_stash)
935 {
936 /* very slow, but rare, check */
937 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
938 croak ("Coro::State object required");
939 }
940
941 mg = SvMAGIC (coro);
942 assert (mg->mg_type == PERL_MAGIC_ext);
943 return (struct coro *)mg->mg_ptr;
944}
945
946static void
947prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
948{
949 ta->prev = SvSTATE (prev_sv);
950 ta->next = SvSTATE (next_sv);
951}
952
953static void
954api_transfer (SV *prev_sv, SV *next_sv)
955{
956 struct transfer_args ta;
957
958 prepare_transfer (&ta, prev_sv, next_sv);
959 TRANSFER (ta);
960}
961
962static int
963api_save (SV *coro_sv, int new_save)
964{
965 struct coro *coro = SvSTATE (coro_sv);
966 int old_save = coro->save;
967
968 if (new_save >= 0)
969 coro->save = new_save;
970
971 return old_save;
972}
973
974/** Coro ********************************************************************/
975
976static void
977coro_enq (SV *coro_sv)
978{
979 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
980}
981
982static SV *
983coro_deq (int min_prio)
984{
985 int prio = PRIO_MAX - PRIO_MIN;
986
987 min_prio -= PRIO_MIN;
988 if (min_prio < 0)
989 min_prio = 0;
990
991 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
992 if (AvFILLp (coro_ready [prio]) >= 0)
993 return av_shift (coro_ready [prio]);
994
995 return 0;
996}
997
998static int
999api_ready (SV *coro_sv)
1000{
1001 struct coro *coro;
1002
1003 if (SvROK (coro_sv))
1004 coro_sv = SvRV (coro_sv);
1005
1006 coro = SvSTATE (coro_sv);
1007
1008 if (coro->flags & CF_READY)
1009 return 0;
1010
1011 coro->flags |= CF_READY;
1012
1013 LOCK;
1014 coro_enq (SvREFCNT_inc (coro_sv));
1015 ++coro_nready;
1016 UNLOCK;
1017
1018 return 1;
1019}
1020
1021static int
1022api_is_ready (SV *coro_sv)
1023{
1024 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1025}
1026
1027static void
1028prepare_schedule (struct transfer_args *ta)
1029{
1030 SV *prev_sv, *next_sv;
1031
1032 for (;;)
1033 {
1034 LOCK;
1035 next_sv = coro_deq (PRIO_MIN);
1036
1037 /* nothing to schedule: call the idle handler */
1038 if (!next_sv)
1039 {
1040 dSP;
1041 UNLOCK;
1042
1043 ENTER;
1044 SAVETMPS;
1045
1046 PUSHMARK (SP);
1047 PUTBACK;
1048 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1049
1050 FREETMPS;
1051 LEAVE;
1052 continue;
1053 }
1054
1055 ta->next = SvSTATE (next_sv);
1056
1057 /* cannot transfer to destroyed coros, skip and look for next */
1058 if (ta->next->flags & CF_DESTROYED)
1059 {
1060 UNLOCK;
1061 SvREFCNT_dec (next_sv);
1062 /* coro_nready is already taken care of by destroy */
1063 continue;
1064 }
1065
1066 --coro_nready;
1067 UNLOCK;
1068 break;
1069 }
1070
1071 /* free this only after the transfer */
1072 prev_sv = SvRV (coro_current);
1073 SvRV_set (coro_current, next_sv);
1074 ta->prev = SvSTATE (prev_sv);
1075
1076 assert (ta->next->flags & CF_READY);
1077 ta->next->flags &= ~CF_READY;
1078
1079 LOCK;
1080 free_coro_mortal ();
1081 coro_mortal = prev_sv;
1082 UNLOCK;
1083}
1084
1085static void
1086prepare_cede (struct transfer_args *ta)
1087{
1088 api_ready (coro_current);
1089 prepare_schedule (ta);
1090}
1091
1092static int
1093prepare_cede_notself (struct transfer_args *ta)
1094{
1095 if (coro_nready)
1096 {
1097 SV *prev = SvRV (coro_current);
1098 prepare_schedule (ta);
1099 api_ready (prev);
1100 return 1;
1101 }
1102 else
1103 return 0;
1104}
1105
1106static void
1107api_schedule (void)
1108{
1109 struct transfer_args ta;
1110
1111 prepare_schedule (&ta);
1112 TRANSFER (ta);
1113}
1114
1115static int
1116api_cede (void)
1117{
1118 struct transfer_args ta;
1119
1120 prepare_cede (&ta);
1121
1122 if (ta.prev != ta.next)
1123 {
1124 TRANSFER (ta);
1125 return 1;
1126 }
1127 else
1128 return 0;
1129}
1130
1131static int
1132api_cede_notself (void)
1133{
1134 struct transfer_args ta;
1135
1136 if (prepare_cede_notself (&ta))
1137 {
1138 TRANSFER (ta);
1139 return 1;
1140 }
1141 else
1142 return 0;
646} 1143}
647 1144
648MODULE = Coro::State PACKAGE = Coro::State 1145MODULE = Coro::State PACKAGE = Coro::State
649 1146
650PROTOTYPES: ENABLE 1147PROTOTYPES: DISABLE
651 1148
652BOOT: 1149BOOT:
653{ /* {} necessary for stoopid perl-5.6.x */ 1150{
654 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1151#ifdef USE_ITHREADS
655 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1152 MUTEX_INIT (&coro_mutex);
1153#endif
1154 BOOT_PAGESIZE;
1155
656 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1156 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
657 1157
658 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1158 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
659 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1159 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
660 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1160 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1161 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
661 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1162 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
662
663 if (!padlist_cache)
664 padlist_cache = newHV ();
665 1163
666 main_mainstack = PL_mainstack; 1164 main_mainstack = PL_mainstack;
667}
668 1165
669Coro::State 1166 coroapi.ver = CORO_API_VERSION;
670_newprocess(args) 1167 coroapi.transfer = api_transfer;
671 SV * args 1168
672 PROTOTYPE: $ 1169 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1170}
1171
1172SV *
1173new (char *klass, ...)
673 CODE: 1174 CODE:
674 Coro__State coro; 1175{
1176 struct coro *coro;
1177 HV *hv;
1178 int i;
675 1179
676 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
677 croak ("Coro::State::_newprocess expects an arrayref");
678
679 New (0, coro, 1, struct coro); 1180 Newz (0, coro, 1, struct coro);
1181 coro->args = newAV ();
1182 coro->save = CORO_SAVE_ALL;
1183 coro->flags = CF_NEW;
680 1184
681 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1185 hv = newHV ();
682 coro->mainstack = 0; /* actual work is done inside transfer */ 1186 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
683 coro->sptr = 0; 1187 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
684 coro->ssize = 0;
685 1188
686 RETVAL = coro; 1189 for (i = 1; i < items; i++)
1190 av_push (coro->args, newSVsv (ST (i)));
1191}
687 OUTPUT: 1192 OUTPUT:
688 RETVAL 1193 RETVAL
689 1194
1195int
1196save (SV *coro, int new_save = -1)
1197 CODE:
1198 RETVAL = api_save (coro, new_save);
1199 OUTPUT:
1200 RETVAL
1201
690void 1202void
691transfer(prev, next, flags = TRANSFER_SAVE_ALL) 1203_set_stacklevel (...)
692 Coro::State_or_hashref prev 1204 ALIAS:
693 Coro::State_or_hashref next 1205 Coro::State::transfer = 1
694 int flags 1206 Coro::schedule = 2
695 PROTOTYPE: @ 1207 Coro::cede = 3
1208 Coro::cede_notself = 4
696 CODE: 1209 CODE:
697 transfer (aTHX_ prev, next, flags); 1210{
1211 struct transfer_args ta;
1212
1213 switch (ix)
1214 {
1215 case 0:
1216 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1217 ta.next = 0;
1218 break;
1219
1220 case 1:
1221 if (items != 2)
1222 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1223
1224 prepare_transfer (&ta, ST (0), ST (1));
1225 break;
1226
1227 case 2:
1228 prepare_schedule (&ta);
1229 break;
1230
1231 case 3:
1232 prepare_cede (&ta);
1233 break;
1234
1235 case 4:
1236 if (!prepare_cede_notself (&ta))
1237 XSRETURN_EMPTY;
1238
1239 break;
1240 }
1241
1242 BARRIER;
1243 TRANSFER (ta);
1244
1245 if (GIMME_V != G_VOID && ta.next != ta.prev)
1246 XSRETURN_YES;
1247}
1248
1249bool
1250_destroy (SV *coro_sv)
1251 CODE:
1252 RETVAL = coro_state_destroy (SvSTATE (coro_sv));
1253 OUTPUT:
1254 RETVAL
698 1255
699void 1256void
700DESTROY(coro) 1257_exit (code)
701 Coro::State coro 1258 int code
1259 PROTOTYPE: $
1260 CODE:
1261 _exit (code);
1262
1263int
1264cctx_count ()
1265 CODE:
1266 RETVAL = cctx_count;
1267 OUTPUT:
1268 RETVAL
1269
1270int
1271cctx_idle ()
1272 CODE:
1273 RETVAL = cctx_idle;
1274 OUTPUT:
1275 RETVAL
1276
1277MODULE = Coro::State PACKAGE = Coro
1278
1279BOOT:
1280{
1281 int i;
1282
1283 coro_stash = gv_stashpv ("Coro", TRUE);
1284
1285 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1286 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1287 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1288 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1289 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1290 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1291
1292 coro_current = get_sv ("Coro::current", FALSE);
1293 SvREADONLY_on (coro_current);
1294
1295 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1296 coro_ready[i] = newAV ();
1297
1298 {
1299 SV *sv = perl_get_sv("Coro::API", 1);
1300
1301 coroapi.schedule = api_schedule;
1302 coroapi.save = api_save;
1303 coroapi.cede = api_cede;
1304 coroapi.cede_notself = api_cede_notself;
1305 coroapi.ready = api_ready;
1306 coroapi.is_ready = api_is_ready;
1307 coroapi.nready = &coro_nready;
1308 coroapi.current = coro_current;
1309
1310 GCoroAPI = &coroapi;
1311 sv_setiv (sv, (IV)&coroapi);
1312 SvREADONLY_on (sv);
1313 }
1314}
1315
1316void
1317_set_current (SV *current)
1318 PROTOTYPE: $
1319 CODE:
1320 SvREFCNT_dec (SvRV (coro_current));
1321 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1322
1323int
1324prio (Coro::State coro, int newprio = 0)
1325 ALIAS:
1326 nice = 1
702 CODE: 1327 CODE:
1328{
1329 RETVAL = coro->prio;
703 1330
704 if (coro->mainstack && coro->mainstack != main_mainstack) 1331 if (items > 1)
705 { 1332 {
706 struct coro temp; 1333 if (ix)
1334 newprio = coro->prio - newprio;
707 1335
708 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1336 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
709 LOAD(aTHX_ coro); 1337 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
710 1338
711 destroy_stacks (aTHX); 1339 coro->prio = newprio;
712
713 LOAD((&temp)); /* this will get rid of defsv etc.. */
714
715 coro->mainstack = 0;
716 } 1340 }
1341}
1342 OUTPUT:
1343 RETVAL
717 1344
718 if (coro->sptr) 1345SV *
719 { 1346ready (SV *self)
720 deallocate_stack (coro); 1347 PROTOTYPE: $
721 coro->sptr = 0; 1348 CODE:
722 } 1349 RETVAL = boolSV (api_ready (self));
1350 OUTPUT:
1351 RETVAL
723 1352
724 Safefree (coro); 1353SV *
1354is_ready (SV *self)
1355 PROTOTYPE: $
1356 CODE:
1357 RETVAL = boolSV (api_is_ready (self));
1358 OUTPUT:
1359 RETVAL
1360
1361int
1362nready (...)
1363 PROTOTYPE:
1364 CODE:
1365 RETVAL = coro_nready;
1366 OUTPUT:
1367 RETVAL
1368
1369MODULE = Coro::State PACKAGE = Coro::AIO
1370
1371SV *
1372_get_state ()
1373 CODE:
1374{
1375 struct io_state *data;
1376
1377 RETVAL = newSV (sizeof (struct io_state));
1378 data = (struct io_state *)SvPVX (RETVAL);
1379 SvCUR_set (RETVAL, sizeof (struct io_state));
1380 SvPOK_only (RETVAL);
1381
1382 data->errorno = errno;
1383 data->laststype = PL_laststype;
1384 data->laststatval = PL_laststatval;
1385 data->statcache = PL_statcache;
1386}
1387 OUTPUT:
1388 RETVAL
725 1389
726void 1390void
727flush() 1391_set_state (char *data_)
1392 PROTOTYPE: $
728 CODE: 1393 CODE:
729#ifdef MAY_FLUSH 1394{
730 flush_padlist_cache (); 1395 struct io_state *data = (void *)data_;
731#endif
732 1396
733MODULE = Coro::State PACKAGE = Coro::Cont 1397 errno = data->errorno;
1398 PL_laststype = data->laststype;
1399 PL_laststatval = data->laststatval;
1400 PL_statcache = data->statcache;
1401}
734 1402
735# this is slightly dirty
736
737void
738yield(...)
739 PROTOTYPE: @
740 CODE:
741 static SV *returnstk;
742 SV *sv;
743 AV *defav = GvAV (PL_defgv);
744 struct coro *prev, *next;
745
746 if (!returnstk)
747 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
748
749 /* set up @_ -- ugly */
750 av_clear (defav);
751 av_fill (defav, items - 1);
752 while (items--)
753 av_store (defav, items, SvREFCNT_inc (ST(items)));
754
755 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
756 sv = av_pop ((AV *)SvRV (returnstk));
757 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
758 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
759 SvREFCNT_dec (sv);
760
761 transfer(aTHX_ prev, next, 0);
762

Diff Legend

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