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.61 by root, Tue Aug 10 01:56:30 2004 UTC vs.
Revision 1.77 by root, Tue Oct 31 23:55:33 2006 UTC

1#define PERL_NO_GET_CONTEXT 1#define PERL_NO_GET_CONTEXT
2
3#include "libcoro/coro.c"
2 4
3#include "EXTERN.h" 5#include "EXTERN.h"
4#include "perl.h" 6#include "perl.h"
5#include "XSUB.h" 7#include "XSUB.h"
6 8
7#include "patchlevel.h" 9#include "patchlevel.h"
8 10
9#if PATCHLEVEL < 6 11#if PERL_VERSION < 6
10# ifndef PL_ppaddr 12# ifndef PL_ppaddr
11# define PL_ppaddr ppaddr 13# define PL_ppaddr ppaddr
12# endif 14# endif
13# ifndef call_sv 15# ifndef call_sv
14# define call_sv perl_call_sv 16# define call_sv perl_call_sv
… …
25# ifndef IS_PADCONST 27# ifndef IS_PADCONST
26# define IS_PADCONST(v) 0 28# define IS_PADCONST(v) 0
27# endif 29# endif
28#endif 30#endif
29 31
30#include "libcoro/coro.c"
31
32#include <signal.h> 32#include <errno.h>
33 33
34#ifdef HAVE_MMAP 34#ifdef HAVE_MMAP
35# include <unistd.h> 35# include <unistd.h>
36# include <sys/mman.h> 36# include <sys/mman.h>
37# ifndef MAP_ANONYMOUS 37# ifndef MAP_ANONYMOUS
… …
57 57
58#include "CoroAPI.h" 58#include "CoroAPI.h"
59 59
60#ifdef USE_ITHREADS 60#ifdef USE_ITHREADS
61static perl_mutex coro_mutex; 61static perl_mutex coro_mutex;
62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) 62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) 63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64#else 64#else
65# define LOCK 0 65# define LOCK (void)0
66# define UNLOCK 0 66# define UNLOCK (void)0
67#endif 67#endif
68 68
69static struct CoroAPI coroapi; 69static struct CoroAPI coroapi;
70static AV *main_mainstack; /* used to differentiate between $main and others */ 70static AV *main_mainstack; /* used to differentiate between $main and others */
71static HV *coro_state_stash; 71static HV *coro_state_stash;
… …
109 AV *mainstack; 109 AV *mainstack;
110 SV **stack_sp; 110 SV **stack_sp;
111 OP *op; 111 OP *op;
112 SV **curpad; 112 SV **curpad;
113 AV *comppad; 113 AV *comppad;
114 CV *compcv;
114 SV **stack_base; 115 SV **stack_base;
115 SV **stack_max; 116 SV **stack_max;
116 SV **tmps_stack; 117 SV **tmps_stack;
117 I32 tmps_floor; 118 I32 tmps_floor;
118 I32 tmps_ix; 119 I32 tmps_ix;
… …
127 I32 savestack_ix; 128 I32 savestack_ix;
128 I32 savestack_max; 129 I32 savestack_max;
129 OP **retstack; 130 OP **retstack;
130 I32 retstack_ix; 131 I32 retstack_ix;
131 I32 retstack_max; 132 I32 retstack_max;
133 PMOP *curpm;
132 COP *curcop; 134 COP *curcop;
133 JMPENV *top_env; 135 JMPENV *top_env;
134 136
135 /* data associated with this coroutine (initial args) */ 137 /* data associated with this coroutine (initial args) */
136 AV *args; 138 AV *args;
137}; 139};
138 140
139typedef struct coro *Coro__State; 141typedef struct coro *Coro__State;
140typedef struct coro *Coro__State_or_hashref; 142typedef struct coro *Coro__State_or_hashref;
141 143
142/* mostly copied from op.c:cv_clone2 */ 144static AV *
143STATIC AV * 145coro_clone_padlist (pTHX_ CV *cv)
144clone_padlist (pTHX_ AV *protopadlist)
145{ 146{
146 AV *av; 147 AV *padlist = CvPADLIST (cv);
147 I32 ix;
148 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
149 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
150 SV **pname = AvARRAY (protopad_name);
151 SV **ppad = AvARRAY (protopad);
152 I32 fname = AvFILLp (protopad_name);
153 I32 fpad = AvFILLp (protopad);
154 AV *newpadlist, *newpad_name, *newpad; 148 AV *newpadlist, *newpad;
155 SV **npad;
156
157 newpad_name = newAV ();
158 for (ix = fname; ix >= 0; ix--)
159 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
160
161 newpad = newAV ();
162 av_fill (newpad, AvFILLp (protopad));
163 npad = AvARRAY (newpad);
164 149
165 newpadlist = newAV (); 150 newpadlist = newAV ();
166 AvREAL_off (newpadlist); 151 AvREAL_off (newpadlist);
167 av_store (newpadlist, 0, (SV *) newpad_name); 152 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
153 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
154 --AvFILLp (padlist);
155
156 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
168 av_store (newpadlist, 1, (SV *) newpad); 157 av_store (newpadlist, 1, (SV *)newpad);
169
170 av = newAV (); /* will be @_ */
171 av_extend (av, 0);
172 av_store (newpad, 0, (SV *) av);
173 AvFLAGS (av) = AVf_REIFY;
174
175 for (ix = fpad; ix > 0; ix--)
176 {
177 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
178
179 if (namesv && namesv != &PL_sv_undef)
180 {
181 char *name = SvPVX (namesv); /* XXX */
182
183 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
184 { /* lexical from outside? */
185 npad[ix] = SvREFCNT_inc (ppad[ix]);
186 }
187 else
188 { /* our own lexical */
189 SV *sv;
190 if (*name == '&')
191 sv = SvREFCNT_inc (ppad[ix]);
192 else if (*name == '@')
193 sv = (SV *) newAV ();
194 else if (*name == '%')
195 sv = (SV *) newHV ();
196 else
197 sv = NEWSV (0, 0);
198
199#ifdef SvPADBUSY
200 if (!SvPADBUSY (sv))
201#endif
202 SvPADMY_on (sv);
203
204 npad[ix] = sv;
205 }
206 }
207 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
208 {
209 npad[ix] = SvREFCNT_inc (ppad[ix]);
210 }
211 else
212 {
213 SV *sv = NEWSV (0, 0);
214 SvPADTMP_on (sv);
215 npad[ix] = sv;
216 }
217 }
218
219#if 0 /* return -ENOTUNDERSTOOD */
220 /* Now that vars are all in place, clone nested closures. */
221
222 for (ix = fpad; ix > 0; ix--) {
223 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
224 if (namesv
225 && namesv != &PL_sv_undef
226 && !(SvFLAGS(namesv) & SVf_FAKE)
227 && *SvPVX(namesv) == '&'
228 && CvCLONE(ppad[ix]))
229 {
230 CV *kid = cv_clone((CV*)ppad[ix]);
231 SvREFCNT_dec(ppad[ix]);
232 CvCLONE_on(kid);
233 SvPADMY_on(kid);
234 npad[ix] = (SV*)kid;
235 }
236 }
237#endif
238 158
239 return newpadlist; 159 return newpadlist;
240} 160}
241 161
242STATIC void 162static void
243free_padlist (pTHX_ AV *padlist) 163free_padlist (pTHX_ AV *padlist)
244{ 164{
245 /* may be during global destruction */ 165 /* may be during global destruction */
246 if (SvREFCNT (padlist)) 166 if (SvREFCNT (padlist))
247 { 167 {
… …
261 181
262 SvREFCNT_dec ((SV*)padlist); 182 SvREFCNT_dec ((SV*)padlist);
263 } 183 }
264} 184}
265 185
266STATIC int 186static int
267coro_cv_free (pTHX_ SV *sv, MAGIC *mg) 187coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
268{ 188{
269 AV *padlist; 189 AV *padlist;
270 AV *av = (AV *)mg->mg_obj; 190 AV *av = (AV *)mg->mg_obj;
271 191
272 /* casting is fun. */ 192 /* casting is fun. */
273 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 193 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
274 free_padlist (aTHX_ padlist); 194 free_padlist (aTHX_ padlist);
275 195
276 SvREFCNT_dec (av); 196 SvREFCNT_dec (av);
197
198 return 0;
277} 199}
278 200
279#define PERL_MAGIC_coro PERL_MAGIC_ext 201#define PERL_MAGIC_coro PERL_MAGIC_ext
280 202
281static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 203static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
282 204
283/* the next two functions merely cache the padlists */ 205/* the next two functions merely cache the padlists */
284STATIC void 206static void
285get_padlist (pTHX_ CV *cv) 207get_padlist (pTHX_ CV *cv)
286{ 208{
287 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 209 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
288 210
289 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 211 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
290 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 212 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
291 else 213 else
214 {
215#if 0
216 /* this should work - but it doesn't :( */
217 CV *cp = Perl_cv_clone (aTHX_ cv);
218 CvPADLIST (cv) = CvPADLIST (cp);
219 CvPADLIST (cp) = 0;
220 SvREFCNT_dec (cp);
221#else
292 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); 222 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
223#endif
224 }
293} 225}
294 226
295STATIC void 227static void
296put_padlist (pTHX_ CV *cv) 228put_padlist (pTHX_ CV *cv)
297{ 229{
298 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 230 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
299 231
300 if (!mg) 232 if (!mg)
… …
327 PL_mainstack = c->mainstack; 259 PL_mainstack = c->mainstack;
328 PL_stack_sp = c->stack_sp; 260 PL_stack_sp = c->stack_sp;
329 PL_op = c->op; 261 PL_op = c->op;
330 PL_curpad = c->curpad; 262 PL_curpad = c->curpad;
331 PL_comppad = c->comppad; 263 PL_comppad = c->comppad;
264 PL_compcv = c->compcv;
332 PL_stack_base = c->stack_base; 265 PL_stack_base = c->stack_base;
333 PL_stack_max = c->stack_max; 266 PL_stack_max = c->stack_max;
334 PL_tmps_stack = c->tmps_stack; 267 PL_tmps_stack = c->tmps_stack;
335 PL_tmps_floor = c->tmps_floor; 268 PL_tmps_floor = c->tmps_floor;
336 PL_tmps_ix = c->tmps_ix; 269 PL_tmps_ix = c->tmps_ix;
… …
342 PL_scopestack_ix = c->scopestack_ix; 275 PL_scopestack_ix = c->scopestack_ix;
343 PL_scopestack_max = c->scopestack_max; 276 PL_scopestack_max = c->scopestack_max;
344 PL_savestack = c->savestack; 277 PL_savestack = c->savestack;
345 PL_savestack_ix = c->savestack_ix; 278 PL_savestack_ix = c->savestack_ix;
346 PL_savestack_max = c->savestack_max; 279 PL_savestack_max = c->savestack_max;
280#if PERL_VERSION < 9
347 PL_retstack = c->retstack; 281 PL_retstack = c->retstack;
348 PL_retstack_ix = c->retstack_ix; 282 PL_retstack_ix = c->retstack_ix;
349 PL_retstack_max = c->retstack_max; 283 PL_retstack_max = c->retstack_max;
284#endif
285 PL_curpm = c->curpm;
350 PL_curcop = c->curcop; 286 PL_curcop = c->curcop;
351 PL_top_env = c->top_env; 287 PL_top_env = c->top_env;
352 288
353 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 289 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
354 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 290 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
… …
413 } 349 }
414 350
415 PUSHs ((SV *)CvPADLIST(cv)); 351 PUSHs ((SV *)CvPADLIST(cv));
416 PUSHs ((SV *)cv); 352 PUSHs ((SV *)cv);
417 353
418 get_padlist (aTHX_ cv); /* this is a monster */ 354 get_padlist (aTHX_ cv);
419 } 355 }
420 } 356 }
421#ifdef CXt_FORMAT 357#ifdef CXt_FORMAT
422 else if (CxTYPE(cx) == CXt_FORMAT) 358 else if (CxTYPE(cx) == CXt_FORMAT)
423 { 359 {
… …
451 c->mainstack = PL_mainstack; 387 c->mainstack = PL_mainstack;
452 c->stack_sp = PL_stack_sp; 388 c->stack_sp = PL_stack_sp;
453 c->op = PL_op; 389 c->op = PL_op;
454 c->curpad = PL_curpad; 390 c->curpad = PL_curpad;
455 c->comppad = PL_comppad; 391 c->comppad = PL_comppad;
392 c->compcv = PL_compcv;
456 c->stack_base = PL_stack_base; 393 c->stack_base = PL_stack_base;
457 c->stack_max = PL_stack_max; 394 c->stack_max = PL_stack_max;
458 c->tmps_stack = PL_tmps_stack; 395 c->tmps_stack = PL_tmps_stack;
459 c->tmps_floor = PL_tmps_floor; 396 c->tmps_floor = PL_tmps_floor;
460 c->tmps_ix = PL_tmps_ix; 397 c->tmps_ix = PL_tmps_ix;
… …
466 c->scopestack_ix = PL_scopestack_ix; 403 c->scopestack_ix = PL_scopestack_ix;
467 c->scopestack_max = PL_scopestack_max; 404 c->scopestack_max = PL_scopestack_max;
468 c->savestack = PL_savestack; 405 c->savestack = PL_savestack;
469 c->savestack_ix = PL_savestack_ix; 406 c->savestack_ix = PL_savestack_ix;
470 c->savestack_max = PL_savestack_max; 407 c->savestack_max = PL_savestack_max;
408#if PERL_VERSION < 9
471 c->retstack = PL_retstack; 409 c->retstack = PL_retstack;
472 c->retstack_ix = PL_retstack_ix; 410 c->retstack_ix = PL_retstack_ix;
473 c->retstack_max = PL_retstack_max; 411 c->retstack_max = PL_retstack_max;
412#endif
413 c->curpm = PL_curpm;
474 c->curcop = PL_curcop; 414 c->curcop = PL_curcop;
475 c->top_env = PL_top_env; 415 c->top_env = PL_top_env;
476} 416}
477 417
478/* 418/*
479 * allocate various perl stacks. This is an exact copy 419 * allocate various perl stacks. This is an exact copy
480 * of perl.c:init_stacks, except that it uses less memory 420 * of perl.c:init_stacks, except that it uses less memory
481 * on the (sometimes correct) assumption that coroutines do 421 * on the (sometimes correct) assumption that coroutines do
482 * not usually need a lot of stackspace. 422 * not usually need a lot of stackspace.
483 */ 423 */
484STATIC void 424static void
485coro_init_stacks (pTHX) 425coro_init_stacks (pTHX)
486{ 426{
487 LOCK; 427 LOCK;
488 428
489 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 429 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
… …
514 454
515 New(54,PL_savestack,96,ANY); 455 New(54,PL_savestack,96,ANY);
516 PL_savestack_ix = 0; 456 PL_savestack_ix = 0;
517 PL_savestack_max = 96; 457 PL_savestack_max = 96;
518 458
459#if PERL_VERSION < 9
519 New(54,PL_retstack,8,OP*); 460 New(54,PL_retstack,8,OP*);
520 PL_retstack_ix = 0; 461 PL_retstack_ix = 0;
521 PL_retstack_max = 8; 462 PL_retstack_max = 8;
463#endif
522 464
523 UNLOCK; 465 UNLOCK;
524} 466}
525 467
526/* 468/*
527 * destroy the stacks, the callchain etc... 469 * destroy the stacks, the callchain etc...
528 */ 470 */
529STATIC void 471static void
530destroy_stacks(pTHX) 472destroy_stacks(pTHX)
531{ 473{
532 if (!IN_DESTRUCT) 474 if (!IN_DESTRUCT)
533 { 475 {
534 /* is this ugly, I ask? */ 476 /* is this ugly, I ask? */
… …
566 508
567 Safefree (PL_tmps_stack); 509 Safefree (PL_tmps_stack);
568 Safefree (PL_markstack); 510 Safefree (PL_markstack);
569 Safefree (PL_scopestack); 511 Safefree (PL_scopestack);
570 Safefree (PL_savestack); 512 Safefree (PL_savestack);
513#if PERL_VERSION < 9
571 Safefree (PL_retstack); 514 Safefree (PL_retstack);
515#endif
572} 516}
573 517
574static void 518static void
575allocate_stack (Coro__State ctx, int alloc) 519allocate_stack (Coro__State ctx, int alloc)
576{ 520{
… …
583 stack->gencnt = ctx->gencnt = 0; 527 stack->gencnt = ctx->gencnt = 0;
584 528
585 if (alloc) 529 if (alloc)
586 { 530 {
587#if HAVE_MMAP 531#if HAVE_MMAP
588 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ 532 stack->ssize = STACKSIZE * sizeof (long); /* mmap should do allocate-on-write for us */
589 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); 533 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
590 if (stack->sptr == (void *)-1) 534 if (stack->sptr == (void *)-1)
591#endif 535#endif
592 { 536 {
593 /*FIXME*//*D*//* reasonable stack size! */
594 stack->ssize = - (8192 * sizeof (long)); 537 stack->ssize = - (STACKSIZE * (long)sizeof (long));
595 New (0, stack->sptr, 8192, long); 538 New (0, stack->sptr, STACKSIZE, long);
596 } 539 }
597 } 540 }
598 else 541 else
599 stack->sptr = 0; 542 stack->sptr = 0;
600 543
… …
691 /* 634 /*
692 * this is a _very_ stripped down perl interpreter ;) 635 * this is a _very_ stripped down perl interpreter ;)
693 */ 636 */
694 dTHX; 637 dTHX;
695 Coro__State ctx = (Coro__State)arg; 638 Coro__State ctx = (Coro__State)arg;
696 JMPENV coro_start_env;
697 639
698 PL_top_env = &ctx->start_env; 640 PL_top_env = &ctx->start_env;
699 641
700 ctx->cursp = 0; 642 ctx->cursp = 0;
701 PL_op = PL_op->op_next; 643 PL_op = PL_op->op_next;
702 CALLRUNOPS(aTHX); 644 CALLRUNOPS(aTHX);
703 645
704 abort (); 646 abort ();
705} 647}
706 648
707STATIC void 649static void
708transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 650transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
709{ 651{
710 dSTACKLEVEL; 652 dSTACKLEVEL;
711 653
712 if (prev != next) 654 if (prev != next)
… …
824 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ 766 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
825 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ 767 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
826 \ 768 \
827 } while(0) 769 } while(0)
828 770
829#define SvSTATE(sv) (struct coro *)SvIV (sv) 771#define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv))
830 772
831static void 773static void
832api_transfer(pTHX_ SV *prev, SV *next, int flags) 774api_transfer(pTHX_ SV *prev, SV *next, int flags)
833{ 775{
834 SV_CORO (prev, "Coro::transfer"); 776 SV_CORO (prev, "Coro::transfer");
… …
852static int coro_nready; 794static int coro_nready;
853 795
854static void 796static void
855coro_enq (pTHX_ SV *sv) 797coro_enq (pTHX_ SV *sv)
856{ 798{
799 SV **xprio;
800 int prio;
801
857 if (SvTYPE (sv) == SVt_PVHV) 802 if (SvTYPE (sv) != SVt_PVHV)
858 {
859 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
860 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
861
862 prio = prio > PRIO_MAX ? PRIO_MAX
863 : prio < PRIO_MIN ? PRIO_MIN
864 : prio;
865
866 av_push (coro_ready [prio - PRIO_MIN], sv);
867 coro_nready++;
868
869 return;
870 }
871
872 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 803 croak ("Coro::ready tried to enqueue something that is not a coroutine");
804
805 xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
806 prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
807
808 prio = prio > PRIO_MAX ? PRIO_MAX
809 : prio < PRIO_MIN ? PRIO_MIN
810 : prio;
811
812 av_push (coro_ready [prio - PRIO_MIN], sv);
813 coro_nready++;
873} 814}
874 815
875static SV * 816static SV *
876coro_deq (pTHX_ int min_prio) 817coro_deq (pTHX_ int min_prio)
877{ 818{
… …
1048 989
1049void 990void
1050yield(...) 991yield(...)
1051 PROTOTYPE: @ 992 PROTOTYPE: @
1052 CODE: 993 CODE:
1053 static SV *returnstk; 994 SV *yieldstack;
1054 SV *sv; 995 SV *sv;
1055 AV *defav = GvAV (PL_defgv); 996 AV *defav = GvAV (PL_defgv);
1056 struct coro *prev, *next; 997 struct coro *prev, *next;
1057 998
1058 if (!returnstk) 999 yieldstack = *hv_fetch (
1059 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); 1000 (HV *)SvRV (GvSV (coro_current)),
1001 "yieldstack", sizeof ("yieldstack") - 1,
1002 0
1003 );
1060 1004
1061 /* set up @_ -- ugly */ 1005 /* set up @_ -- ugly */
1062 av_clear (defav); 1006 av_clear (defav);
1063 av_fill (defav, items - 1); 1007 av_fill (defav, items - 1);
1064 while (items--) 1008 while (items--)
1065 av_store (defav, items, SvREFCNT_inc (ST(items))); 1009 av_store (defav, items, SvREFCNT_inc (ST(items)));
1066 1010
1067 SvGETMAGIC (returnstk); /* isn't documentation wrong for mg_get? */
1068 sv = av_pop ((AV *)SvRV (returnstk)); 1011 sv = av_pop ((AV *)SvRV (yieldstack));
1069 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1012 prev = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))));
1070 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1013 next = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))));
1071 SvREFCNT_dec (sv); 1014 SvREFCNT_dec (sv);
1072 1015
1073 transfer (aTHX_ prev, next, 0); 1016 transfer (aTHX_ prev, next, 0);
1074 1017
1075MODULE = Coro::State PACKAGE = Coro 1018MODULE = Coro::State PACKAGE = Coro
… …
1138cede(...) 1081cede(...)
1139 PROTOTYPE: 1082 PROTOTYPE:
1140 CODE: 1083 CODE:
1141 api_cede (); 1084 api_cede ();
1142 1085
1086# and these are hacks
1087SV *
1088_aio_get_state ()
1089 CODE:
1090{
1091 struct {
1092 int errorno;
1093 int laststype;
1094 int laststatval;
1095 Stat_t statcache;
1096 } data;
1097
1098 data.errorno = errno;
1099 data.laststype = PL_laststype;
1100 data.laststatval = PL_laststatval;
1101 data.statcache = PL_statcache;
1102
1103 RETVAL = newSVpvn ((char *)&data, sizeof data);
1104}
1105 OUTPUT:
1106 RETVAL
1107
1108void
1109_aio_set_state (char *data_)
1110 PROTOTYPE: $
1111 CODE:
1112{
1113 struct {
1114 int errorno;
1115 int laststype;
1116 int laststatval;
1117 Stat_t statcache;
1118 } *data = (void *)data_;
1119
1120 errno = data->errorno;
1121 PL_laststype = data->laststype;
1122 PL_laststatval = data->laststatval;
1123 PL_statcache = data->statcache;
1124}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines