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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines