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.17 by root, Wed Jul 25 14:01:46 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
58static coro_stack main_stack = { 1, 0, 0 }; 129 /* cpu state */
130 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
131 JMPENV *top_env;
132 coro_context cctx;
59 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 */
60struct coro { 148struct coro {
61 /* the optional C context */ 149 /* the c coroutine allocated to this perl coroutine, if any */
62 coro_stack *stack; 150 coro_cctx *cctx;
63 void *cursp;
64 int gencnt;
65
66 /* optionally saved, might be zero */
67 AV *defav;
68 SV *defsv;
69 SV *errsv;
70
71 /* saved global state not related to stacks */
72 U8 dowarn;
73
74 /* the stacks and related info (callchain etc..) */
75 PERL_SI *curstackinfo;
76 AV *curstack;
77 AV *mainstack;
78 SV **stack_sp;
79 OP *op;
80 SV **curpad;
81 SV **stack_base;
82 SV **stack_max;
83 SV **tmps_stack;
84 I32 tmps_floor;
85 I32 tmps_ix;
86 I32 tmps_max;
87 I32 *markstack;
88 I32 *markstack_ptr;
89 I32 *markstack_max;
90 I32 *scopestack;
91 I32 scopestack_ix;
92 I32 scopestack_max;
93 ANY *savestack;
94 I32 savestack_ix;
95 I32 savestack_max;
96 OP **retstack;
97 I32 retstack_ix;
98 I32 retstack_max;
99 COP *curcop;
100 JMPENV start_env;
101 JMPENV *top_env;
102 151
103 /* data associated with this coroutine (initial args) */ 152 /* data associated with this coroutine (initial args) */
104 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;
105}; 171};
106 172
107typedef struct coro *Coro__State; 173typedef struct coro *Coro__State;
108typedef struct coro *Coro__State_or_hashref; 174typedef struct coro *Coro__State_or_hashref;
109 175
110static AV *main_mainstack; /* used to differentiate between $main and others */ 176static AV *
111static HV *coro_state_stash; 177coro_clone_padlist (CV *cv)
112static SV *ucoro_state_sv;
113static U32 ucoro_state_hash;
114static HV *padlist_cache;
115
116/* mostly copied from op.c:cv_clone2 */
117STATIC AV *
118clone_padlist (AV *protopadlist)
119{ 178{
120 AV *av; 179 AV *padlist = CvPADLIST (cv);
121 I32 ix;
122 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
123 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
124 SV **pname = AvARRAY (protopad_name);
125 SV **ppad = AvARRAY (protopad);
126 I32 fname = AvFILLp (protopad_name);
127 I32 fpad = AvFILLp (protopad);
128 AV *newpadlist, *newpad_name, *newpad; 180 AV *newpadlist, *newpad;
129 SV **npad;
130
131 newpad_name = newAV ();
132 for (ix = fname; ix >= 0; ix--)
133 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
134
135 newpad = newAV ();
136 av_fill (newpad, AvFILLp (protopad));
137 npad = AvARRAY (newpad);
138 181
139 newpadlist = newAV (); 182 newpadlist = newAV ();
140 AvREAL_off (newpadlist); 183 AvREAL_off (newpadlist);
141 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)));
142 av_store (newpadlist, 1, (SV *) newpad); 193 av_store (newpadlist, 1, (SV *)newpad);
143 194
144 av = newAV (); /* will be @_ */ 195 return newpadlist;
145 av_extend (av, 0); 196}
146 av_store (newpad, 0, (SV *) av);
147 AvFLAGS (av) = AVf_REIFY;
148 197
149 for (ix = fpad; ix > 0; ix--) 198static void
199free_padlist (AV *padlist)
200{
201 /* may be during global destruction */
202 if (SvREFCNT (padlist))
150 { 203 {
151 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 204 I32 i = AvFILLp (padlist);
152 if (namesv && namesv != &PL_sv_undef) 205 while (i >= 0)
153 { 206 {
154 char *name = SvPVX (namesv); /* XXX */ 207 SV **svp = av_fetch (padlist, i--, FALSE);
155 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 208 if (svp)
156 { /* lexical from outside? */
157 npad[ix] = SvREFCNT_inc (ppad[ix]);
158 } 209 {
159 else
160 { /* our own lexical */
161 SV *sv; 210 SV *sv;
162 if (*name == '&') 211 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
163 sv = SvREFCNT_inc (ppad[ix]); 212 SvREFCNT_dec (sv);
164 else if (*name == '@') 213
165 sv = (SV *) newAV (); 214 SvREFCNT_dec (*svp);
166 else if (*name == '%')
167 sv = (SV *) newHV ();
168 else
169 sv = NEWSV (0, 0);
170 if (!SvPADBUSY (sv))
171 SvPADMY_on (sv);
172 npad[ix] = sv;
173 } 215 }
174 } 216 }
175 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 217
176 { 218 SvREFCNT_dec ((SV*)padlist);
177 npad[ix] = SvREFCNT_inc (ppad[ix]);
178 }
179 else
180 {
181 SV *sv = NEWSV (0, 0);
182 SvPADTMP_on (sv);
183 npad[ix] = sv;
184 }
185 } 219 }
220}
186 221
187#if 0 /* return -ENOTUNDERSTOOD */ 222static int
188 /* 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;
189 227
190 for (ix = fpad; ix > 0; ix--) { 228 /* casting is fun. */
191 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 229 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
192 if (namesv 230 free_padlist (padlist);
193 && namesv != &PL_sv_undef 231
194 && !(SvFLAGS(namesv) & SVf_FAKE) 232 SvREFCNT_dec (av);
195 && *SvPVX(namesv) == '&' 233
196 && CvCLONE(ppad[ix])) 234 return 0;
197 { 235}
198 CV *kid = cv_clone((CV*)ppad[ix]); 236
199 SvREFCNT_dec(ppad[ix]); 237#define PERL_MAGIC_coro PERL_MAGIC_ext
200 CvCLONE_on(kid); 238
201 SvPADMY_on(kid); 239static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
202 npad[ix] = (SV*)kid; 240
203 } 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 ();
204 } 283 }
205#endif
206 284
207 return newpadlist; 285 av = (AV *)mg->mg_obj;
208}
209 286
210#ifdef MAY_FLUSH 287 if (AvFILLp (av) >= AvMAX (av))
211STATIC AV * 288 av_extend (av, AvMAX (av) + 1);
212free_padlist (AV *padlist)
213{
214 /* may be during global destruction */
215 if (SvREFCNT(padlist))
216 {
217 I32 i = AvFILLp(padlist);
218 while (i >= 0)
219 {
220 SV **svp = av_fetch(padlist, i--, FALSE);
221 SV *sv = svp ? *svp : Nullsv;
222 if (sv)
223 SvREFCNT_dec(sv);
224 }
225 289
226 SvREFCNT_dec((SV*)padlist); 290 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
227 }
228} 291}
229#endif
230
231/* the next two functions merely cache the padlists */
232STATIC void
233get_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
236
237 if (he && AvFILLp ((AV *)*he) >= 0)
238 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
239 else
240 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
241}
242
243STATIC void
244put_padlist (CV *cv)
245{
246 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
247
248 if (SvTYPE (*he) != SVt_PVAV)
249 {
250 SvREFCNT_dec (*he);
251 *he = (SV *)newAV ();
252 }
253
254 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
255}
256
257#ifdef MAY_FLUSH
258STATIC void
259flush_padlist_cache ()
260{
261 HV *hv = padlist_cache;
262 padlist_cache = newHV ();
263
264 if (hv_iterinit (hv))
265 {
266 HE *he;
267 AV *padlist;
268
269 while (!!(he = hv_iternext (hv)))
270 {
271 AV *av = (AV *)HeVAL(he);
272
273 /* casting is fun. */
274 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
275 free_padlist (padlist);
276 }
277 }
278
279 SvREFCNT_dec (hv);
280}
281#endif
282 292
283#define SB do { 293#define SB do {
284#define SE } while (0) 294#define SE } while (0)
285 295
286#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
287#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
288
289#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
290 297
291static void 298static void
292load_state(pTHX_ Coro__State c) 299load_perl (Coro__State c)
293{ 300{
294 PL_dowarn = c->dowarn; 301#define VAR(name,type) PL_ ## name = c->name;
295 302# include "state.h"
296 PL_curstackinfo = c->curstackinfo; 303#undef VAR
297 PL_curstack = c->curstack;
298 PL_mainstack = c->mainstack;
299 PL_stack_sp = c->stack_sp;
300 PL_op = c->op;
301 PL_curpad = c->curpad;
302 PL_stack_base = c->stack_base;
303 PL_stack_max = c->stack_max;
304 PL_tmps_stack = c->tmps_stack;
305 PL_tmps_floor = c->tmps_floor;
306 PL_tmps_ix = c->tmps_ix;
307 PL_tmps_max = c->tmps_max;
308 PL_markstack = c->markstack;
309 PL_markstack_ptr = c->markstack_ptr;
310 PL_markstack_max = c->markstack_max;
311 PL_scopestack = c->scopestack;
312 PL_scopestack_ix = c->scopestack_ix;
313 PL_scopestack_max = c->scopestack_max;
314 PL_savestack = c->savestack;
315 PL_savestack_ix = c->savestack_ix;
316 PL_savestack_max = c->savestack_max;
317 PL_retstack = c->retstack;
318 PL_retstack_ix = c->retstack_ix;
319 PL_retstack_max = c->retstack_max;
320 PL_curcop = c->curcop;
321 PL_start_env = c->start_env;
322 PL_top_env = c->top_env;
323 304
324 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 305 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
325 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 306 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
326 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 }
327 319
328 { 320 {
329 dSP; 321 dSP;
330 CV *cv; 322 CV *cv;
331 323
332 /* now do the ugly restore mess */ 324 /* now do the ugly restore mess */
333 while ((cv = (CV *)POPs)) 325 while ((cv = (CV *)POPs))
334 { 326 {
335 AV *padlist = (AV *)POPs;
336
337 if (padlist)
338 {
339 put_padlist (cv); /* mark this padlist as available */ 327 put_padlist (cv); /* mark this padlist as available */
340 CvPADLIST(cv) = padlist; 328 CvDEPTH (cv) = PTR2IV (POPs);
341#ifdef USE_THREADS 329 CvPADLIST (cv) = (AV *)POPs;
342 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
343#endif
344 }
345
346 ++CvDEPTH(cv);
347 } 330 }
348 331
349 PUTBACK; 332 PUTBACK;
350 } 333 }
351} 334}
352 335
353static void 336static void
354save_state(pTHX_ Coro__State c, int flags) 337save_perl (Coro__State c)
355{ 338{
356 { 339 {
357 dSP; 340 dSP;
358 I32 cxix = cxstack_ix; 341 I32 cxix = cxstack_ix;
359 PERL_CONTEXT *ccstk = cxstack; 342 PERL_CONTEXT *ccstk = cxstack;
366 349
367 PUSHs (Nullsv); 350 PUSHs (Nullsv);
368 /* this loop was inspired by pp_caller */ 351 /* this loop was inspired by pp_caller */
369 for (;;) 352 for (;;)
370 { 353 {
371 do 354 while (cxix >= 0)
372 { 355 {
373 PERL_CONTEXT *cx = &ccstk[cxix--]; 356 PERL_CONTEXT *cx = &ccstk[cxix--];
374 357
375 if (CxTYPE(cx) == CXt_SUB) 358 if (CxTYPE (cx) == CXt_SUB)
376 { 359 {
377 CV *cv = cx->blk_sub.cv; 360 CV *cv = cx->blk_sub.cv;
361
378 if (CvDEPTH(cv)) 362 if (CvDEPTH (cv))
379 { 363 {
380#ifdef USE_THREADS
381 /*XPUSHs ((SV *)CvOWNER(cv));*/
382 /*CvOWNER(cv) = 0;*/
383 /*error must unlock this cv etc.. etc...*/
384#endif
385 EXTEND (SP, CvDEPTH(cv)*2); 364 EXTEND (SP, 3);
386 365
387 while (--CvDEPTH(cv))
388 {
389 /* this tells the restore code to increment CvDEPTH */
390 PUSHs (Nullsv);
391 PUSHs ((SV *)cv);
392 }
393
394 PUSHs ((SV *)CvPADLIST(cv)); 366 PUSHs ((SV *)CvPADLIST (cv));
367 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
395 PUSHs ((SV *)cv); 368 PUSHs ((SV *)cv);
396 369
370 CvDEPTH (cv) = 0;
397 get_padlist (cv); /* this is a monster */ 371 get_padlist (cv);
398 } 372 }
399 } 373 }
374#ifdef CXt_FORMAT
400 else if (CxTYPE(cx) == CXt_FORMAT) 375 else if (CxTYPE (cx) == CXt_FORMAT)
401 { 376 {
402 /* 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? */
403 /* my bold guess is as a simple, plain sub... */ 378 /* my bold guess is as a simple, plain sub... */
404 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");
405 } 380 }
381#endif
406 } 382 }
407 while (cxix >= 0);
408 383
409 if (top_si->si_type == PERLSI_MAIN) 384 if (top_si->si_type == PERLSI_MAIN)
410 break; 385 break;
411 386
412 top_si = top_si->si_prev; 387 top_si = top_si->si_prev;
415 } 390 }
416 391
417 PUTBACK; 392 PUTBACK;
418 } 393 }
419 394
420 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;
421 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 396 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
422 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;
423 399
424 /* I have not the slightest idea of why av_reify is necessary */ 400#define VAR(name,type)c->name = PL_ ## name;
425 /* but if it's missing the defav contents magically get replaced sometimes */ 401# include "state.h"
426 if (c->defav) 402#undef VAR
427 av_reify (c->defav);
428
429 c->dowarn = PL_dowarn;
430
431 c->curstackinfo = PL_curstackinfo;
432 c->curstack = PL_curstack;
433 c->mainstack = PL_mainstack;
434 c->stack_sp = PL_stack_sp;
435 c->op = PL_op;
436 c->curpad = PL_curpad;
437 c->stack_base = PL_stack_base;
438 c->stack_max = PL_stack_max;
439 c->tmps_stack = PL_tmps_stack;
440 c->tmps_floor = PL_tmps_floor;
441 c->tmps_ix = PL_tmps_ix;
442 c->tmps_max = PL_tmps_max;
443 c->markstack = PL_markstack;
444 c->markstack_ptr = PL_markstack_ptr;
445 c->markstack_max = PL_markstack_max;
446 c->scopestack = PL_scopestack;
447 c->scopestack_ix = PL_scopestack_ix;
448 c->scopestack_max = PL_scopestack_max;
449 c->savestack = PL_savestack;
450 c->savestack_ix = PL_savestack_ix;
451 c->savestack_max = PL_savestack_max;
452 c->retstack = PL_retstack;
453 c->retstack_ix = PL_retstack_ix;
454 c->retstack_max = PL_retstack_max;
455 c->curcop = PL_curcop;
456 c->start_env = PL_start_env;
457 c->top_env = PL_top_env;
458} 403}
459 404
460/* 405/*
461 * allocate various perl stacks. This is an exact copy 406 * allocate various perl stacks. This is an exact copy
462 * of perl.c:init_stacks, except that it uses less memory 407 * of perl.c:init_stacks, except that it uses less memory
463 * on the assumption that coroutines do not usually need 408 * on the (sometimes correct) assumption that coroutines do
464 * a lot of stackspace. 409 * not usually need a lot of stackspace.
465 */ 410 */
466STATIC void 411static void
467coro_init_stacks (pTHX) 412coro_init_stacks ()
468{ 413{
469 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 414 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
470 PL_curstackinfo->si_type = PERLSI_MAIN; 415 PL_curstackinfo->si_type = PERLSI_MAIN;
471 PL_curstack = PL_curstackinfo->si_stack; 416 PL_curstack = PL_curstackinfo->si_stack;
472 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 417 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
473 418
474 PL_stack_base = AvARRAY(PL_curstack); 419 PL_stack_base = AvARRAY(PL_curstack);
475 PL_stack_sp = PL_stack_base; 420 PL_stack_sp = PL_stack_base;
476 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 421 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
477 422
478 New(50,PL_tmps_stack,96,SV*); 423 New(50,PL_tmps_stack,128,SV*);
479 PL_tmps_floor = -1; 424 PL_tmps_floor = -1;
480 PL_tmps_ix = -1; 425 PL_tmps_ix = -1;
481 PL_tmps_max = 96; 426 PL_tmps_max = 128;
482 427
483 New(54,PL_markstack,16,I32); 428 New(54,PL_markstack,32,I32);
484 PL_markstack_ptr = PL_markstack; 429 PL_markstack_ptr = PL_markstack;
485 PL_markstack_max = PL_markstack + 16; 430 PL_markstack_max = PL_markstack + 32;
486 431
432#ifdef SET_MARK_OFFSET
487 SET_MARK_OFFSET; 433 SET_MARK_OFFSET;
434#endif
488 435
489 New(54,PL_scopestack,16,I32); 436 New(54,PL_scopestack,32,I32);
490 PL_scopestack_ix = 0; 437 PL_scopestack_ix = 0;
491 PL_scopestack_max = 16; 438 PL_scopestack_max = 32;
492 439
493 New(54,PL_savestack,96,ANY); 440 New(54,PL_savestack,64,ANY);
494 PL_savestack_ix = 0; 441 PL_savestack_ix = 0;
495 PL_savestack_max = 96; 442 PL_savestack_max = 64;
496 443
444#if !PERL_VERSION_ATLEAST (5,9,0)
497 New(54,PL_retstack,8,OP*); 445 New(54,PL_retstack,16,OP*);
498 PL_retstack_ix = 0; 446 PL_retstack_ix = 0;
499 PL_retstack_max = 8; 447 PL_retstack_max = 16;
448#endif
500} 449}
501 450
502/* 451/*
503 * destroy the stacks, the callchain etc... 452 * destroy the stacks, the callchain etc...
504 * still there is a memleak of 128 bytes...
505 */ 453 */
506STATIC void 454static void
507destroy_stacks(pTHX) 455coro_destroy_stacks ()
508{ 456{
457 if (!IN_DESTRUCT)
458 {
509 /* is this ugly, I ask? */ 459 /* is this ugly, I ask? */
510 while (PL_scopestack_ix) 460 LEAVE_SCOPE (0);
511 LEAVE;
512 461
513 /* sure it is, but more important: is it correct?? :/ */ 462 /* sure it is, but more important: is it correct?? :/ */
514 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
515 FREETMPS; 463 FREETMPS;
464
465 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
466 }
516 467
517 while (PL_curstackinfo->si_next) 468 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next; 469 PL_curstackinfo = PL_curstackinfo->si_next;
519 470
520 while (PL_curstackinfo) 471 while (PL_curstackinfo)
521 { 472 {
522 PERL_SI *p = PL_curstackinfo->si_prev; 473 PERL_SI *p = PL_curstackinfo->si_prev;
523 474
524 { 475 { /*D*//*remove*/
525 dSP; 476 dSP;
526 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 477 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
527 PUTBACK; /* possibly superfluous */ 478 PUTBACK; /* possibly superfluous */
528 } 479 }
529 480
530 dounwind(-1); 481 if (!IN_DESTRUCT)
531 482 {
483 dounwind (-1);/*D*//*remove*/
532 SvREFCNT_dec(PL_curstackinfo->si_stack); 484 SvREFCNT_dec (PL_curstackinfo->si_stack);
485 }
486
533 Safefree(PL_curstackinfo->si_cxstack); 487 Safefree (PL_curstackinfo->si_cxstack);
534 Safefree(PL_curstackinfo); 488 Safefree (PL_curstackinfo);
535 PL_curstackinfo = p; 489 PL_curstackinfo = p;
536 } 490 }
537 491
538 Safefree(PL_tmps_stack); 492 Safefree (PL_tmps_stack);
539 Safefree(PL_markstack); 493 Safefree (PL_markstack);
540 Safefree(PL_scopestack); 494 Safefree (PL_scopestack);
541 Safefree(PL_savestack); 495 Safefree (PL_savestack);
496#if !PERL_VERSION_ATLEAST (5,9,0)
542 Safefree(PL_retstack); 497 Safefree (PL_retstack);
543}
544
545static void
546allocate_stack (Coro__State ctx, int alloc)
547{
548 coro_stack *stack;
549
550 New (0, stack, 1, coro_stack);
551
552 stack->refcnt = 1;
553 stack->usecnt = 1;
554 stack->gencnt = ctx->gencnt = 0;
555 if (alloc)
556 {
557#ifdef HAVE_MMAP
558 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
559 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
560 if (stack->sptr == (void *)-1)
561#endif 498#endif
562 {
563 /*FIXME*//*D*//* reasonable stack size! */
564 stack->ssize = -4096 * sizeof (long);
565 New (0, stack->sptr, 4096, long);
566 }
567 }
568 else
569 stack->sptr = 0;
570
571 ctx->stack = stack;
572} 499}
573 500
574static void 501static void
575deallocate_stack (Coro__State ctx) 502setup_coro (struct coro *coro)
576{
577 coro_stack *stack = ctx->stack;
578
579 ctx->stack = 0;
580
581 if (stack)
582 {
583 if (!--stack->refcnt)
584 {
585#ifdef HAVE_MMAP
586 if (stack->ssize > 0 && stack->sptr)
587 munmap (stack->sptr, stack->ssize);
588 else
589#else
590 Safefree (stack->sptr);
591#endif
592 Safefree (stack);
593 }
594 else if (ctx->gencnt == stack->gencnt)
595 --stack->usecnt;
596 }
597}
598
599static void
600setup_coro (void *arg)
601{ 503{
602 /* 504 /*
603 * emulate part of the perl startup here. 505 * emulate part of the perl startup here.
604 */ 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{
605 dSP; 553 dSP;
606 Coro__State ctx = (Coro__State)arg; 554 LOGOP myop;
607 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
608 555
609 coro_init_stacks (aTHX); 556 Zero (&myop, 1, LOGOP);
610 JMPENV_BOOTSTRAP; 557 myop.op_next = PL_op;
558 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
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);
611 SPAGAIN; 567 SPAGAIN;
612
613 /*PL_curcop = 0;*/
614 SvREFCNT_dec (GvAV (PL_defgv));
615 GvAV (PL_defgv) = ctx->args;
616
617 if (ctx->stack)
618 {
619 ctx->cursp = 0;
620
621 PUSHMARK(SP);
622 PUTBACK;
623 (void) call_sv (sub_init, G_VOID|G_NOARGS);
624 croak ("FATAL: CCTXT coroutine returned!");
625 }
626 else
627 {
628 UNOP myop;
629
630 PL_op = (OP *)&myop;
631
632 Zero(&myop, 1, UNOP);
633 myop.op_next = Nullop;
634 myop.op_flags = OPf_WANT_VOID;
635
636 PUSHMARK(SP);
637 XPUSHs (sub_init);
638 /*
639 * the next line is slightly wrong, as PL_op->op_next
640 * is actually being executed so we skip the first op.
641 * that doesn't matter, though, since it is only
642 * pp_nextstate and we never return...
643 * ah yes, and I don't care anyways ;)
644 */
645 PUTBACK;
646 PL_op = pp_entersub();
647 SPAGAIN;
648
649 ENTER; /* necessary e.g. for dounwind */
650 }
651} 568}
652 569
653static void 570static void
654continue_coro (void *arg) 571coro_run (void *arg)
655{ 572{
573 /* coro_run is the alternative tail of transfer(), so unlock here. */
574 UNLOCK;
575
656 /* 576 /*
657 * this is a _very_ stripped down perl interpreter ;) 577 * this is a _very_ stripped down perl interpreter ;)
658 */ 578 */
659 Coro__State ctx = (Coro__State)arg; 579 PL_top_env = &PL_start_env;
660 580
661 ctx->cursp = 0; 581 /* inject call to cctx_init */
662 PL_op = PL_op->op_next; 582 prepare_cctx ((coro_cctx *)arg);
663 CALLRUNOPS(aTHX); 583
664 /*NORETURN*/ 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);
665 abort (); 589 abort ();
666} 590}
667 591
668STATIC 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
669transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 704transfer (struct coro *prev, struct coro *next)
670{ 705{
671 dSP;
672 dSTACKLEVEL; 706 dSTACKLEVEL;
673 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 }
674 if (prev != next) 714 else if (prev != next)
675 { 715 {
676 if (next->mainstack) 716 coro_cctx *prev__cctx;
717
718 if (prev->flags & CF_NEW)
677 { 719 {
678 SAVE (prev, flags); 720 /* create a new empty context */
679 LOAD (next); 721 Newz (0, prev->cctx, 1, coro_cctx);
680 722 prev->cctx->inuse = 1;
681 /* mark this state as in-use */ 723 prev->flags &= ~CF_NEW;
682 next->mainstack = 0; 724 prev->flags |= CF_RUNNING;
683 next->tmps_ix = -2;
684
685 /* stacklevel changed? if yes, grab the stack for us! */
686 if (flags & TRANSFER_SAVE_CCTXT)
687 {
688 if (!prev->stack)
689 allocate_stack (prev, 0);
690 else if (prev->cursp != stacklevel
691 && prev->stack->usecnt > 1)
692 {
693 prev->gencnt = ++prev->stack->gencnt;
694 prev->stack->usecnt = 1;
695 }
696
697 /* has our stack been invalidated? */
698 if (next->stack && next->stack->gencnt != next->gencnt)
699 {
700 deallocate_stack (next);
701 allocate_stack (next, 1);
702 coro_create (&(next->stack->cctx),
703 continue_coro, (void *)next,
704 next->stack->sptr, labs (next->stack->ssize));
705 }
706
707 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
708 }
709
710 } 725 }
711 else if (next->tmps_ix == -2) 726
712 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 }
713 else 750 else
714 { 751 {
715 SAVE (prev, -1); /* first get rid of the old state */ 752 /* coroutine already started */
716 753 save_perl (prev);
717 if (flags & TRANSFER_SAVE_CCTXT) 754 load_perl (next);
718 {
719 if (!prev->stack)
720 allocate_stack (prev, 0);
721
722 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
723 {
724 setup_coro (next);
725
726 prev->stack->refcnt++;
727 prev->stack->usecnt++;
728 next->stack = prev->stack;
729 next->gencnt = prev->gencnt;
730 }
731 else
732 {
733 allocate_stack (next, 1);
734 coro_create (&(next->stack->cctx),
735 setup_coro, (void *)next,
736 next->stack->sptr, labs (next->stack->ssize));
737 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
738 }
739 }
740 else
741 setup_coro (next);
742 } 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;
743 } 788 }
789}
744 790
745 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);
746} 1055}
747 1056
748MODULE = Coro::State PACKAGE = Coro::State 1057MODULE = Coro::State PACKAGE = Coro::State
749 1058
750PROTOTYPES: ENABLE 1059PROTOTYPES: DISABLE
751 1060
752BOOT: 1061BOOT:
753{ /* {} necessary for stoopid perl-5.6.x */ 1062{
754 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1063#ifdef USE_ITHREADS
755 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1064 MUTEX_INIT (&coro_mutex);
1065#endif
1066 BOOT_PAGESIZE;
1067
756 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1068 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
757 1069
758 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1070 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
759 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1071 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
760 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));
761 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1074 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
762
763 if (!padlist_cache)
764 padlist_cache = newHV ();
765 1075
766 main_mainstack = PL_mainstack; 1076 main_mainstack = PL_mainstack;
767}
768 1077
769Coro::State 1078 coroapi.ver = CORO_API_VERSION;
770_newprocess(args) 1079 coroapi.transfer = api_transfer;
771 SV * args 1080
772 PROTOTYPE: $ 1081 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1082}
1083
1084SV *
1085new (char *klass, ...)
773 CODE: 1086 CODE:
774 Coro__State coro; 1087{
1088 struct coro *coro;
1089 HV *hv;
1090 int i;
775 1091
776 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
777 croak ("Coro::State::_newprocess expects an arrayref");
778
779 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;
780 1096
781 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1097 hv = newHV ();
782 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;
783 coro->stack = 0; 1099 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
784 1100
785 RETVAL = coro; 1101 for (i = 1; i < items; i++)
1102 av_push (coro->args, newSVsv (ST (i)));
1103}
786 OUTPUT: 1104 OUTPUT:
787 RETVAL 1105 RETVAL
788 1106
1107int
1108save (SV *coro, int new_save = -1)
1109 CODE:
1110 RETVAL = api_save (coro, new_save);
1111 OUTPUT:
1112 RETVAL
1113
789void 1114void
790transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 1115_set_stacklevel (...)
791 Coro::State_or_hashref prev 1116 ALIAS:
792 Coro::State_or_hashref next 1117 Coro::State::transfer = 1
793 int flags 1118 Coro::schedule = 2
794 PROTOTYPE: @ 1119 Coro::cede = 3
795 CODE: 1120 CODE:
796 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}
797 1149
798void 1150void
799DESTROY(coro) 1151_clone_state_from (SV *dst, SV *src)
800 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
801 CODE: 1232 CODE:
1233{
1234 RETVAL = coro->prio;
802 1235
803 if (coro->mainstack && coro->mainstack != main_mainstack) 1236 if (items > 1)
804 { 1237 {
805 struct coro temp; 1238 if (ix)
1239 newprio += coro->prio;
806 1240
807 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1241 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
808 LOAD(aTHX_ coro); 1242 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
809 1243
810 destroy_stacks (aTHX); 1244 coro->prio = newprio;
811
812 LOAD((&temp)); /* this will get rid of defsv etc.. */
813
814 coro->mainstack = 0;
815 } 1245 }
1246}
816 1247
817 deallocate_stack (coro); 1248SV *
1249ready (SV *self)
1250 PROTOTYPE: $
1251 CODE:
1252 RETVAL = boolSV (api_ready (self));
1253 OUTPUT:
1254 RETVAL
818 1255
819 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
820 1292
821void 1293void
822flush() 1294_set_state (char *data_)
1295 PROTOTYPE: $
823 CODE: 1296 CODE:
824#ifdef MAY_FLUSH 1297{
825 flush_padlist_cache (); 1298 struct io_state *data = (void *)data_;
826#endif
827 1299
828MODULE = 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}
829 1305
830# this is slightly dirty
831
832void
833yield(...)
834 PROTOTYPE: @
835 CODE:
836 static SV *returnstk;
837 SV *sv;
838 AV *defav = GvAV (PL_defgv);
839 struct coro *prev, *next;
840
841 if (!returnstk)
842 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
843
844 /* set up @_ -- ugly */
845 av_clear (defav);
846 av_fill (defav, items - 1);
847 while (items--)
848 av_store (defav, items, SvREFCNT_inc (ST(items)));
849
850 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
851 sv = av_pop ((AV *)SvRV (returnstk));
852 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
853 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
854 SvREFCNT_dec (sv);
855
856 transfer(aTHX_ prev, next, 0);
857

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines