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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines