ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines