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

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines