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.16 by root, Wed Jul 25 04:26:55 2001 UTC vs.
Revision 1.112 by root, Thu Nov 30 20:52:52 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>
10# ifndef MAP_ANON
11# ifdef MAP_ANONYMOUS 54# ifndef MAP_ANONYMOUS
12# define MAP_ANON MAP_ANONYMOUS 55# ifdef MAP_ANON
56# define MAP_ANONYMOUS MAP_ANON
13# else 57# else
14# undef HAVE_MMAP 58# undef HAVE_MMAP
15# endif 59# endif
16# endif 60# endif
61# include <limits.h>
62# ifndef PAGESIZE
63# define PAGESIZE pagesize
64# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
65static long pagesize;
66# else
67# define BOOT_PAGESIZE (void)0
17#endif 68# 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 69#else
30# define TRANSFER_LAZY_STACK 0x00000000 70# define PAGESIZE 0
71# define BOOT_PAGESIZE (void)0
31#endif 72#endif
32 73
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 74/* 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 75 * to the current C stack pointer. Its property is that it changes with each call
41 * and should be unique. */ 76 * and should be unique. */
77#define dSTACKLEVEL int stacklevel
42#define dSTACKLEVEL void *stacklevel = &stacklevel 78#define STACKLEVEL ((void *)&stacklevel)
43 79
44#define labs(l) ((l) >= 0 ? (l) : -(l)) 80#define IN_DESTRUCT (PL_main_cv == Nullcv)
45 81
46/* 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 */
47typedef struct { 112typedef struct coro_cctx {
48 int refcnt; /* pointer reference counter */ 113 struct coro_cctx *next;
49 int usecnt; /* shared by how many coroutines */
50 int gencnt; /* generation counter */
51 114
52 coro_context cctx; 115 /* the stack */
53
54 void *sptr; 116 void *sptr;
55 long ssize; /* positive == mmap, otherwise malloc */ 117 long ssize; /* positive == mmap, otherwise malloc */
56} coro_stack;
57 118
58static 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;
59 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 */
60struct coro { 137struct coro {
61 /* the optional C context */ 138 /* the c coroutine allocated to this perl coroutine, if any */
62 coro_stack *stack; 139 coro_cctx *cctx;
63 void *cursp; 140
141 /* data associated with this coroutine (initial args) */
142 AV *args;
64 int gencnt; 143 int refcnt;
144 int flags;
65 145
66 /* optionally saved, might be zero */ 146 /* optionally saved, might be zero */
67 AV *defav; 147 AV *defav;
68 SV *defsv; 148 SV *defsv;
69 SV *errsv; 149 SV *errsv;
70 150
71 /* saved global state not related to stacks */ 151#define VAR(name,type) type name;
72 U8 dowarn; 152# include "state.h"
153#undef VAR
73 154
74 /* the stacks and related info (callchain etc..) */ 155 /* coro process data */
75 PERL_SI *curstackinfo; 156 int prio;
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
103 /* data associated with this coroutine (initial args) */
104 AV *args;
105}; 157};
106 158
107typedef struct coro *Coro__State; 159typedef struct coro *Coro__State;
108typedef struct coro *Coro__State_or_hashref; 160typedef struct coro *Coro__State_or_hashref;
109 161
110static AV *main_mainstack; /* used to differentiate between $main and others */ 162static AV *
111static HV *coro_state_stash; 163coro_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{ 164{
120 AV *av; 165 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; 166 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 167
139 newpadlist = newAV (); 168 newpadlist = newAV ();
140 AvREAL_off (newpadlist); 169 AvREAL_off (newpadlist);
141 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)));
142 av_store (newpadlist, 1, (SV *) newpad); 179 av_store (newpadlist, 1, (SV *)newpad);
143 180
144 av = newAV (); /* will be @_ */ 181 return newpadlist;
145 av_extend (av, 0); 182}
146 av_store (newpad, 0, (SV *) av);
147 AvFLAGS (av) = AVf_REIFY;
148 183
149 for (ix = fpad; ix > 0; ix--) 184static void
185free_padlist (AV *padlist)
186{
187 /* may be during global destruction */
188 if (SvREFCNT (padlist))
150 { 189 {
151 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 190 I32 i = AvFILLp (padlist);
152 if (namesv && namesv != &PL_sv_undef) 191 while (i >= 0)
153 { 192 {
154 char *name = SvPVX (namesv); /* XXX */ 193 SV **svp = av_fetch (padlist, i--, FALSE);
155 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 194 if (svp)
156 { /* lexical from outside? */
157 npad[ix] = SvREFCNT_inc (ppad[ix]);
158 } 195 {
159 else
160 { /* our own lexical */
161 SV *sv; 196 SV *sv;
162 if (*name == '&') 197 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
163 sv = SvREFCNT_inc (ppad[ix]); 198 SvREFCNT_dec (sv);
164 else if (*name == '@') 199
165 sv = (SV *) newAV (); 200 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 } 201 }
174 } 202 }
175 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 203
176 { 204 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 } 205 }
206}
186 207
187#if 0 /* return -ENOTUNDERSTOOD */ 208static int
188 /* 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;
189 213
190 for (ix = fpad; ix > 0; ix--) { 214 /* casting is fun. */
191 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 215 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
192 if (namesv 216 free_padlist (padlist);
193 && namesv != &PL_sv_undef 217
194 && !(SvFLAGS(namesv) & SVf_FAKE) 218 SvREFCNT_dec (av);
195 && *SvPVX(namesv) == '&' 219
196 && CvCLONE(ppad[ix])) 220 return 0;
197 { 221}
198 CV *kid = cv_clone((CV*)ppad[ix]); 222
199 SvREFCNT_dec(ppad[ix]); 223#define PERL_MAGIC_coro PERL_MAGIC_ext
200 CvCLONE_on(kid); 224
201 SvPADMY_on(kid); 225static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
202 npad[ix] = (SV*)kid; 226
203 } 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 ();
204 } 269 }
205#endif
206 270
207 return newpadlist; 271 av = (AV *)mg->mg_obj;
208}
209 272
210#ifdef MAY_FLUSH 273 if (AvFILLp (av) >= AvMAX (av))
211STATIC AV * 274 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 275
226 SvREFCNT_dec((SV*)padlist); 276 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
227 }
228} 277}
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 278
283#define SB do { 279#define SB do {
284#define SE } while (0) 280#define SE } while (0)
285 281
286#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 282#define LOAD(state) load_state((state));
287#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 283#define SAVE(state,flags) save_state((state),(flags));
288 284
289#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
290 286
291static void 287static void
292load_state(pTHX_ Coro__State c) 288load_state(Coro__State c)
293{ 289{
294 PL_dowarn = c->dowarn; 290#define VAR(name,type) PL_ ## name = c->name;
295 291# include "state.h"
296 PL_curstackinfo = c->curstackinfo; 292#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 293
324 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 294 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
325 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 295 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
326 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 296 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
327 297
… …
330 CV *cv; 300 CV *cv;
331 301
332 /* now do the ugly restore mess */ 302 /* now do the ugly restore mess */
333 while ((cv = (CV *)POPs)) 303 while ((cv = (CV *)POPs))
334 { 304 {
335 AV *padlist = (AV *)POPs;
336
337 if (padlist)
338 {
339 put_padlist (cv); /* mark this padlist as available */ 305 put_padlist (cv); /* mark this padlist as available */
340 CvPADLIST(cv) = padlist; 306 CvDEPTH (cv) = PTR2IV (POPs);
341#ifdef USE_THREADS 307 CvPADLIST (cv) = (AV *)POPs;
342 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
343#endif
344 }
345
346 ++CvDEPTH(cv);
347 } 308 }
348 309
349 PUTBACK; 310 PUTBACK;
350 } 311 }
351} 312}
352 313
353static void 314static void
354save_state(pTHX_ Coro__State c, int flags) 315save_state(Coro__State c, int flags)
355{ 316{
356 { 317 {
357 dSP; 318 dSP;
358 I32 cxix = cxstack_ix; 319 I32 cxix = cxstack_ix;
359 PERL_CONTEXT *ccstk = cxstack; 320 PERL_CONTEXT *ccstk = cxstack;
… …
366 327
367 PUSHs (Nullsv); 328 PUSHs (Nullsv);
368 /* this loop was inspired by pp_caller */ 329 /* this loop was inspired by pp_caller */
369 for (;;) 330 for (;;)
370 { 331 {
371 do 332 while (cxix >= 0)
372 { 333 {
373 PERL_CONTEXT *cx = &ccstk[cxix--]; 334 PERL_CONTEXT *cx = &ccstk[cxix--];
374 335
375 if (CxTYPE(cx) == CXt_SUB) 336 if (CxTYPE(cx) == CXt_SUB)
376 { 337 {
377 CV *cv = cx->blk_sub.cv; 338 CV *cv = cx->blk_sub.cv;
339
378 if (CvDEPTH(cv)) 340 if (CvDEPTH (cv))
379 { 341 {
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); 342 EXTEND (SP, 3);
386
387 while (--CvDEPTH(cv))
388 {
389 /* this tells the restore code to increment CvDEPTH */
390 PUSHs (Nullsv);
391 PUSHs ((SV *)cv);
392 }
393 343
394 PUSHs ((SV *)CvPADLIST(cv)); 344 PUSHs ((SV *)CvPADLIST(cv));
345 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
395 PUSHs ((SV *)cv); 346 PUSHs ((SV *)cv);
396 347
348 CvDEPTH (cv) = 0;
397 get_padlist (cv); /* this is a monster */ 349 get_padlist (cv);
398 } 350 }
399 } 351 }
352#ifdef CXt_FORMAT
400 else if (CxTYPE(cx) == CXt_FORMAT) 353 else if (CxTYPE(cx) == CXt_FORMAT)
401 { 354 {
402 /* 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? */
403 /* my bold guess is as a simple, plain sub... */ 356 /* my bold guess is as a simple, plain sub... */
404 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");
405 } 358 }
359#endif
406 } 360 }
407 while (cxix >= 0);
408 361
409 if (top_si->si_type == PERLSI_MAIN) 362 if (top_si->si_type == PERLSI_MAIN)
410 break; 363 break;
411 364
412 top_si = top_si->si_prev; 365 top_si = top_si->si_prev;
… …
419 372
420 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;
421 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 374 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
422 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 375 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
423 376
424 /* I have not the slightest idea of why av_reify is necessary */ 377#define VAR(name,type)c->name = PL_ ## name;
425 /* but if it's missing the defav contents magically get replaced sometimes */ 378# include "state.h"
426 if (c->defav) 379#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} 380}
459 381
460/* 382/*
461 * allocate various perl stacks. This is an exact copy 383 * allocate various perl stacks. This is an exact copy
462 * of perl.c:init_stacks, except that it uses less memory 384 * of perl.c:init_stacks, except that it uses less memory
463 * on the assumption that coroutines do not usually need 385 * on the (sometimes correct) assumption that coroutines do
464 * a lot of stackspace. 386 * not usually need a lot of stackspace.
465 */ 387 */
466STATIC void 388static void
467coro_init_stacks (pTHX) 389coro_init_stacks ()
468{ 390{
469 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 391 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
470 PL_curstackinfo->si_type = PERLSI_MAIN; 392 PL_curstackinfo->si_type = PERLSI_MAIN;
471 PL_curstack = PL_curstackinfo->si_stack; 393 PL_curstack = PL_curstackinfo->si_stack;
472 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 394 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
… …
482 404
483 New(54,PL_markstack,16,I32); 405 New(54,PL_markstack,16,I32);
484 PL_markstack_ptr = PL_markstack; 406 PL_markstack_ptr = PL_markstack;
485 PL_markstack_max = PL_markstack + 16; 407 PL_markstack_max = PL_markstack + 16;
486 408
409#ifdef SET_MARK_OFFSET
487 SET_MARK_OFFSET; 410 SET_MARK_OFFSET;
411#endif
488 412
489 New(54,PL_scopestack,16,I32); 413 New(54,PL_scopestack,16,I32);
490 PL_scopestack_ix = 0; 414 PL_scopestack_ix = 0;
491 PL_scopestack_max = 16; 415 PL_scopestack_max = 16;
492 416
493 New(54,PL_savestack,96,ANY); 417 New(54,PL_savestack,96,ANY);
494 PL_savestack_ix = 0; 418 PL_savestack_ix = 0;
495 PL_savestack_max = 96; 419 PL_savestack_max = 96;
496 420
421#if !PERL_VERSION_ATLEAST (5,9,0)
497 New(54,PL_retstack,8,OP*); 422 New(54,PL_retstack,8,OP*);
498 PL_retstack_ix = 0; 423 PL_retstack_ix = 0;
499 PL_retstack_max = 8; 424 PL_retstack_max = 8;
425#endif
500} 426}
501 427
502/* 428/*
503 * destroy the stacks, the callchain etc... 429 * destroy the stacks, the callchain etc...
504 * still there is a memleak of 128 bytes...
505 */ 430 */
506STATIC void 431static void
507destroy_stacks(pTHX) 432coro_destroy_stacks ()
508{ 433{
434 if (!IN_DESTRUCT)
435 {
509 /* is this ugly, I ask? */ 436 /* is this ugly, I ask? */
510 while (PL_scopestack_ix) 437 LEAVE_SCOPE (0);
511 LEAVE;
512 438
513 /* sure it is, but more important: is it correct?? :/ */ 439 /* 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; 440 FREETMPS;
441
442 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
443 }
516 444
517 while (PL_curstackinfo->si_next) 445 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next; 446 PL_curstackinfo = PL_curstackinfo->si_next;
519 447
520 while (PL_curstackinfo) 448 while (PL_curstackinfo)
521 { 449 {
522 PERL_SI *p = PL_curstackinfo->si_prev; 450 PERL_SI *p = PL_curstackinfo->si_prev;
523 451
524 { 452 { /*D*//*remove*/
525 dSP; 453 dSP;
526 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 454 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
527 PUTBACK; /* possibly superfluous */ 455 PUTBACK; /* possibly superfluous */
528 } 456 }
529 457
530 dounwind(-1); 458 if (!IN_DESTRUCT)
531 459 {
460 dounwind (-1);/*D*//*remove*/
532 SvREFCNT_dec(PL_curstackinfo->si_stack); 461 SvREFCNT_dec (PL_curstackinfo->si_stack);
462 }
463
533 Safefree(PL_curstackinfo->si_cxstack); 464 Safefree (PL_curstackinfo->si_cxstack);
534 Safefree(PL_curstackinfo); 465 Safefree (PL_curstackinfo);
535 PL_curstackinfo = p; 466 PL_curstackinfo = p;
536 } 467 }
537 468
538 Safefree(PL_tmps_stack); 469 Safefree (PL_tmps_stack);
539 Safefree(PL_markstack); 470 Safefree (PL_markstack);
540 Safefree(PL_scopestack); 471 Safefree (PL_scopestack);
541 Safefree(PL_savestack); 472 Safefree (PL_savestack);
473#if !PERL_VERSION_ATLEAST (5,9,0)
542 Safefree(PL_retstack); 474 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 */
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 475#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} 476}
573 477
574static void 478static void
575deallocate_stack (Coro__State ctx) 479setup_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{ 480{
602 /* 481 /*
603 * emulate part of the perl startup here. 482 * emulate part of the perl startup here.
604 */ 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{
605 dSP; 530 dSP;
606 Coro__State ctx = (Coro__State)arg; 531 LOGOP myop;
607 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
608 532
609 coro_init_stacks (aTHX); 533 Zero (&myop, 1, LOGOP);
610 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);
611 SPAGAIN; 543 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} 544}
652 545
653static void 546static void
654continue_coro (void *arg) 547coro_run (void *arg)
655{ 548{
549 /* coro_run is the alternative epilogue of transfer() */
550 UNLOCK;
551
656 /* 552 /*
657 * this is a _very_ stripped down perl interpreter ;) 553 * this is a _very_ stripped down perl interpreter ;)
658 */ 554 */
659 Coro__State ctx = (Coro__State)arg; 555 PL_top_env = &PL_start_env;
660 556
661 ctx->cursp = 0; 557 /* inject call to cctx_init */
662 PL_op = PL_op->op_next; 558 prepare_cctx ((coro_cctx *)arg);
663 CALLRUNOPS(aTHX); 559
664 /*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);
665 abort (); 564 abort ();
666} 565}
667 566
668STATIC 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
669transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 668transfer (struct coro *prev, struct coro *next, int flags)
670{ 669{
671 dSP;
672 dSTACKLEVEL; 670 dSTACKLEVEL;
673 671
672 /* sometimes transfer is only called to set idle_sp */
673 if (flags == TRANSFER_SET_STACKLEVEL)
674 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
674 if (prev != next) 675 else if (prev != next)
675 { 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
676 if (next->mainstack) 698 if (next->mainstack)
677 { 699 {
700 /* coroutine already started */
678 SAVE (prev, flags); 701 SAVE (prev, flags);
679 LOAD (next); 702 LOAD (next);
680
681 /* mark this state as in-use */
682 next->mainstack = 0;
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 } 703 }
711 else if (next->tmps_ix == -2)
712 croak ("tried to transfer to running coroutine");
713 else 704 else
714 { 705 {
706 /* need to start coroutine */
715 SAVE (prev, -1); /* first get rid of the old state */ 707 /* first get rid of the old state */
716 708 SAVE (prev, -1);
717 if (flags & TRANSFER_SAVE_CCTXT) 709 /* setup coroutine call */
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); 710 setup_coro (next);
711 /* need a new stack */
712 assert (!next->stack);
742 } 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
726 if (!next->cctx)
727 next->cctx = cctx_get ();
728
729 if (prev__cctx != next->cctx)
730 {
731 assert ( prev__cctx->inuse);
732 assert (!next->cctx->inuse);
733
734 prev__cctx->inuse = 0;
735 next->cctx->inuse = 1;
736
737 prev__cctx->top_env = PL_top_env;
738 PL_top_env = next->cctx->top_env;
739 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
740 }
741
742 free_coro_mortal ();
743
744 UNLOCK;
743 } 745 }
746}
744 747
745 next->cursp = stacklevel; 748struct transfer_args
749{
750 struct coro *prev, *next;
751 int flags;
752};
753
754#define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags)
755
756static void
757coro_state_destroy (struct coro *coro)
758{
759 if (coro->refcnt--)
760 return;
761
762 if (coro->flags & CF_RUNNING)
763 croak ("FATAL: tried to destroy currently running coroutine");
764
765 if (coro->mainstack && coro->mainstack != main_mainstack)
766 {
767 struct coro temp;
768
769 SAVE ((&temp), TRANSFER_SAVE_ALL);
770 LOAD (coro);
771
772 coro_destroy_stacks ();
773
774 LOAD ((&temp)); /* this will get rid of defsv etc.. */
775
776 coro->mainstack = 0;
777 }
778
779 cctx_free (coro->cctx);
780 SvREFCNT_dec (coro->args);
781 Safefree (coro);
782}
783
784static int
785coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
786{
787 struct coro *coro = (struct coro *)mg->mg_ptr;
788 mg->mg_ptr = 0;
789
790 coro_state_destroy (coro);
791
792 return 0;
793}
794
795static int
796coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
797{
798 struct coro *coro = (struct coro *)mg->mg_ptr;
799
800 ++coro->refcnt;
801
802 return 0;
803}
804
805static MGVTBL coro_state_vtbl = {
806 0, 0, 0, 0,
807 coro_state_clear,
808 0,
809#ifdef MGf_DUP
810 coro_state_dup,
811#else
812# define MGf_DUP 0
813#endif
814};
815
816static struct coro *
817SvSTATE (SV *coro)
818{
819 HV *stash;
820 MAGIC *mg;
821
822 if (SvROK (coro))
823 coro = SvRV (coro);
824
825 stash = SvSTASH (coro);
826 if (stash != coro_stash && stash != coro_state_stash)
827 {
828 /* very slow, but rare, check */
829 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
830 croak ("Coro::State object required");
831 }
832
833 mg = SvMAGIC (coro);
834 assert (mg->mg_type == PERL_MAGIC_ext);
835 return (struct coro *)mg->mg_ptr;
836}
837
838static void
839prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags)
840{
841 ta->prev = SvSTATE (prev);
842 ta->next = SvSTATE (next);
843 ta->flags = flags;
844}
845
846static void
847api_transfer (SV *prev, SV *next, int flags)
848{
849 dTHX;
850 struct transfer_args ta;
851
852 prepare_transfer (&ta, prev, next, flags);
853 TRANSFER (ta);
854}
855
856/** Coro ********************************************************************/
857
858#define PRIO_MAX 3
859#define PRIO_HIGH 1
860#define PRIO_NORMAL 0
861#define PRIO_LOW -1
862#define PRIO_IDLE -3
863#define PRIO_MIN -4
864
865/* for Coro.pm */
866static GV *coro_current, *coro_idle;
867static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
868static int coro_nready;
869
870static void
871coro_enq (SV *coro_sv)
872{
873 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
874 coro_nready++;
875}
876
877static SV *
878coro_deq (int min_prio)
879{
880 int prio = PRIO_MAX - PRIO_MIN;
881
882 min_prio -= PRIO_MIN;
883 if (min_prio < 0)
884 min_prio = 0;
885
886 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
887 if (AvFILLp (coro_ready [prio]) >= 0)
888 {
889 coro_nready--;
890 return av_shift (coro_ready [prio]);
891 }
892
893 return 0;
894}
895
896static int
897api_ready (SV *coro_sv)
898{
899 struct coro *coro;
900
901 if (SvROK (coro_sv))
902 coro_sv = SvRV (coro_sv);
903
904 coro = SvSTATE (coro_sv);
905
906 if (coro->flags & CF_READY)
907 return 0;
908
909 if (coro->flags & CF_RUNNING)
910 croak ("Coro::ready called on currently running coroutine");
911
912 coro->flags |= CF_READY;
913
914 LOCK;
915 coro_enq (SvREFCNT_inc (coro_sv));
916 UNLOCK;
917
918 return 1;
919}
920
921static int
922api_is_ready (SV *coro_sv)
923{
924 return !!SvSTATE (coro_sv)->flags & CF_READY;
925}
926
927static void
928prepare_schedule (struct transfer_args *ta)
929{
930 SV *current, *prev, *next;
931
932 current = GvSV (coro_current);
933
934 for (;;)
935 {
936 LOCK;
937 next = coro_deq (PRIO_MIN);
938 UNLOCK;
939
940 if (next)
941 break;
942
943 {
944 dSP;
945
946 ENTER;
947 SAVETMPS;
948
949 PUSHMARK (SP);
950 PUTBACK;
951 call_sv (GvSV (coro_idle), G_DISCARD);
952
953 FREETMPS;
954 LEAVE;
955 }
956 }
957
958 prev = SvRV (current);
959 SvRV (current) = next;
960
961 /* free this only after the transfer */
962 LOCK;
963 free_coro_mortal ();
964 UNLOCK;
965 coro_mortal = prev;
966
967 ta->prev = SvSTATE (prev);
968 ta->next = SvSTATE (next);
969 ta->flags = TRANSFER_SAVE_ALL;
970
971 ta->next->flags &= ~CF_READY;
972}
973
974static void
975prepare_cede (struct transfer_args *ta)
976{
977 api_ready (GvSV (coro_current));
978
979 prepare_schedule (ta);
980}
981
982static void
983api_schedule (void)
984{
985 dTHX;
986 struct transfer_args ta;
987
988 prepare_schedule (&ta);
989 TRANSFER (ta);
990}
991
992static void
993api_cede (void)
994{
995 dTHX;
996 struct transfer_args ta;
997
998 prepare_cede (&ta);
999 TRANSFER (ta);
746} 1000}
747 1001
748MODULE = Coro::State PACKAGE = Coro::State 1002MODULE = Coro::State PACKAGE = Coro::State
749 1003
750PROTOTYPES: ENABLE 1004PROTOTYPES: DISABLE
751 1005
752BOOT: 1006BOOT:
753{ /* {} necessary for stoopid perl-5.6.x */ 1007{
754 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1008#ifdef USE_ITHREADS
755 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1009 MUTEX_INIT (&coro_mutex);
1010#endif
1011 BOOT_PAGESIZE;
1012
756 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1013 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
757 1014
758 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1015 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
759 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1016 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
760 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1017 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
761 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
762
763 if (!padlist_cache)
764 padlist_cache = newHV ();
765 1018
766 main_mainstack = PL_mainstack; 1019 main_mainstack = PL_mainstack;
767}
768 1020
769Coro::State 1021 coroapi.ver = CORO_API_VERSION;
770_newprocess(args) 1022 coroapi.transfer = api_transfer;
771 SV * args 1023
772 PROTOTYPE: $ 1024 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1025}
1026
1027SV *
1028new (char *klass, ...)
773 CODE: 1029 CODE:
774 Coro__State coro; 1030{
1031 struct coro *coro;
1032 HV *hv;
1033 int i;
775 1034
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); 1035 Newz (0, coro, 1, struct coro);
1036 coro->args = newAV ();
780 1037
781 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1038 hv = newHV ();
782 coro->mainstack = 0; /* actual work is done inside transfer */ 1039 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
783 coro->stack = 0; 1040 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
784 1041
785 RETVAL = coro; 1042 for (i = 1; i < items; i++)
1043 av_push (coro->args, newSVsv (ST (i)));
1044}
786 OUTPUT: 1045 OUTPUT:
787 RETVAL 1046 RETVAL
788 1047
789void 1048void
790transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 1049_set_stacklevel (...)
791 Coro::State_or_hashref prev 1050 ALIAS:
792 Coro::State_or_hashref next 1051 Coro::State::transfer = 1
793 int flags 1052 Coro::schedule = 2
794 PROTOTYPE: @ 1053 Coro::cede = 3
1054 Coro::Cont::yield = 4
795 CODE: 1055 CODE:
796 transfer (aTHX_ prev, next, flags); 1056{
1057 struct transfer_args ta;
1058
1059 switch (ix)
1060 {
1061 case 0:
1062 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1063 ta.next = 0;
1064 ta.flags = TRANSFER_SET_STACKLEVEL;
1065 break;
1066
1067 case 1:
1068 if (items != 3)
1069 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1070
1071 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1072 break;
1073
1074 case 2:
1075 prepare_schedule (&ta);
1076 break;
1077
1078 case 3:
1079 prepare_cede (&ta);
1080 break;
1081
1082 case 4:
1083 {
1084 SV *yieldstack;
1085 SV *sv;
1086 AV *defav = GvAV (PL_defgv);
1087
1088 yieldstack = *hv_fetch (
1089 (HV *)SvRV (GvSV (coro_current)),
1090 "yieldstack", sizeof ("yieldstack") - 1,
1091 0
1092 );
1093
1094 /* set up @_ -- ugly */
1095 av_clear (defav);
1096 av_fill (defav, items - 1);
1097 while (items--)
1098 av_store (defav, items, SvREFCNT_inc (ST(items)));
1099
1100 sv = av_pop ((AV *)SvRV (yieldstack));
1101 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1102 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1103 ta.flags = 0;
1104 SvREFCNT_dec (sv);
1105 }
1106 break;
1107
1108 }
1109
1110 TRANSFER (ta);
1111}
797 1112
798void 1113void
799DESTROY(coro) 1114_clone_state_from (SV *dst, SV *src)
800 Coro::State coro 1115 CODE:
1116{
1117 struct coro *coro_src = SvSTATE (src);
1118
1119 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1120
1121 ++coro_src->refcnt;
1122 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1123}
1124
1125void
1126_exit (code)
1127 int code
1128 PROTOTYPE: $
1129 CODE:
1130 _exit (code);
1131
1132int
1133cctx_count ()
1134 CODE:
1135 RETVAL = cctx_count;
1136 OUTPUT:
1137 RETVAL
1138
1139int
1140cctx_idle ()
1141 CODE:
1142 RETVAL = cctx_idle;
1143 OUTPUT:
1144 RETVAL
1145
1146MODULE = Coro::State PACKAGE = Coro
1147
1148BOOT:
1149{
1150 int i;
1151
1152 coro_stash = gv_stashpv ("Coro", TRUE);
1153
1154 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1155 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1156 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1157 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1158 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1159 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1160
1161 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1162 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1163
1164 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1165 coro_ready[i] = newAV ();
1166
1167 {
1168 SV *sv = perl_get_sv("Coro::API", 1);
1169
1170 coroapi.schedule = api_schedule;
1171 coroapi.cede = api_cede;
1172 coroapi.ready = api_ready;
1173 coroapi.is_ready = api_is_ready;
1174 coroapi.nready = &coro_nready;
1175 coroapi.current = coro_current;
1176
1177 GCoroAPI = &coroapi;
1178 sv_setiv (sv, (IV)&coroapi);
1179 SvREADONLY_on (sv);
1180 }
1181}
1182
1183int
1184prio (Coro::State coro, int newprio = 0)
1185 ALIAS:
1186 nice = 1
801 CODE: 1187 CODE:
1188{
1189 RETVAL = coro->prio;
802 1190
803 if (coro->mainstack && coro->mainstack != main_mainstack) 1191 if (items > 1)
804 { 1192 {
805 struct coro temp; 1193 if (ix)
1194 newprio += coro->prio;
806 1195
807 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1196 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
808 LOAD(aTHX_ coro); 1197 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
809 1198
810 destroy_stacks (aTHX); 1199 coro->prio = newprio;
811
812 LOAD((&temp)); /* this will get rid of defsv etc.. */
813
814 coro->mainstack = 0;
815 } 1200 }
1201}
816 1202
817 deallocate_stack (coro); 1203SV *
1204ready (SV *self)
1205 PROTOTYPE: $
1206 CODE:
1207 RETVAL = boolSV (api_ready (self));
1208 OUTPUT:
1209 RETVAL
818 1210
819 Safefree (coro); 1211SV *
1212is_ready (SV *self)
1213 PROTOTYPE: $
1214 CODE:
1215 RETVAL = boolSV (api_is_ready (self));
1216 OUTPUT:
1217 RETVAL
1218
1219int
1220nready (...)
1221 PROTOTYPE:
1222 CODE:
1223 RETVAL = coro_nready;
1224 OUTPUT:
1225 RETVAL
1226
1227MODULE = Coro::State PACKAGE = Coro::AIO
1228
1229SV *
1230_get_state ()
1231 CODE:
1232{
1233 struct {
1234 int errorno;
1235 int laststype;
1236 int laststatval;
1237 Stat_t statcache;
1238 } data;
1239
1240 data.errorno = errno;
1241 data.laststype = PL_laststype;
1242 data.laststatval = PL_laststatval;
1243 data.statcache = PL_statcache;
1244
1245 RETVAL = newSVpvn ((char *)&data, sizeof data);
1246}
1247 OUTPUT:
1248 RETVAL
820 1249
821void 1250void
822flush() 1251_set_state (char *data_)
1252 PROTOTYPE: $
823 CODE: 1253 CODE:
824#ifdef MAY_FLUSH 1254{
825 flush_padlist_cache (); 1255 struct {
826#endif 1256 int errorno;
1257 int laststype;
1258 int laststatval;
1259 Stat_t statcache;
1260 } *data = (void *)data_;
827 1261
828MODULE = Coro::State PACKAGE = Coro::Cont 1262 errno = data->errorno;
829 1263 PL_laststype = data->laststype;
830# this is slightly dirty 1264 PL_laststatval = data->laststatval;
831 1265 PL_statcache = data->statcache;
832void 1266}
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