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.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.124 by root, Tue Dec 5 12:50:04 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines