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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines