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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines