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

Diff Legend

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