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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.15 by root, Wed Jul 25 04:14:38 2001 UTC vs.
Revision 1.83 by root, Mon Nov 20 22:32:44 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines