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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines