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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines