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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines