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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines