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.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs.
Revision 1.87 by root, Fri Nov 24 13:40:36 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#include "patchlevel.h" 9#include "patchlevel.h"
6 10
7#if PATCHLEVEL < 6 11#if PERL_VERSION < 6
8# ifndef PL_ppaddr 12# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr 13# define PL_ppaddr ppaddr
10# endif 14# endif
11# ifndef call_sv 15# ifndef call_sv
12# define call_sv perl_call_sv 16# define call_sv perl_call_sv
23# ifndef IS_PADCONST 27# ifndef IS_PADCONST
24# define IS_PADCONST(v) 0 28# define IS_PADCONST(v) 0
25# endif 29# endif
26#endif 30#endif
27 31
28#include "libcoro/coro.c"
29
30#include <signal.h> 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
31 41
32#ifdef HAVE_MMAP 42#ifdef HAVE_MMAP
33# include <unistd.h> 43# include <unistd.h>
34# include <sys/mman.h> 44# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS 45# ifndef MAP_ANONYMOUS
37# define MAP_ANONYMOUS MAP_ANON 47# define MAP_ANONYMOUS MAP_ANON
38# else 48# else
39# undef HAVE_MMAP 49# undef HAVE_MMAP
40# endif 50# endif
41# 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
42#endif 60#endif
43 61
44#define SUB_INIT "Coro::State::initialize" 62#define SUB_INIT "Coro::State::initialize"
45#define UCORO_STATE "_coro_state" 63#define UCORO_STATE "_coro_state"
46 64
55 73
56#include "CoroAPI.h" 74#include "CoroAPI.h"
57 75
58#ifdef USE_ITHREADS 76#ifdef USE_ITHREADS
59static perl_mutex coro_mutex; 77static perl_mutex coro_mutex;
60# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) 78# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
61# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) 79# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
62#else 80#else
63# define LOCK 0 81# define LOCK (void)0
64# define UNLOCK 0 82# define UNLOCK (void)0
65#endif 83#endif
66 84
67static struct CoroAPI coroapi; 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 */
68 91
69/* this is actually not only the c stack but also c registers etc... */ 92/* this is actually not only the c stack but also c registers etc... */
70typedef struct { 93typedef struct {
71 int refcnt; /* pointer reference counter */ 94 int refcnt; /* pointer reference counter */
72 int usecnt; /* shared by how many coroutines */ 95 int usecnt; /* shared by how many coroutines */
77 void *sptr; 100 void *sptr;
78 long ssize; /* positive == mmap, otherwise malloc */ 101 long ssize; /* positive == mmap, otherwise malloc */
79} coro_stack; 102} coro_stack;
80 103
81struct coro { 104struct coro {
82 /* the top-level JMPENV for each coroutine, needed to catch dies. */
83 JMPENV start_env;
84
85 /* the optional C context */ 105 /* the optional C context */
86 coro_stack *stack; 106 coro_stack *stack;
87 void *cursp; 107 void *cursp;
88 int gencnt; 108 int gencnt;
89 109
102 AV *mainstack; 122 AV *mainstack;
103 SV **stack_sp; 123 SV **stack_sp;
104 OP *op; 124 OP *op;
105 SV **curpad; 125 SV **curpad;
106 AV *comppad; 126 AV *comppad;
127 CV *compcv;
107 SV **stack_base; 128 SV **stack_base;
108 SV **stack_max; 129 SV **stack_max;
109 SV **tmps_stack; 130 SV **tmps_stack;
110 I32 tmps_floor; 131 I32 tmps_floor;
111 I32 tmps_ix; 132 I32 tmps_ix;
120 I32 savestack_ix; 141 I32 savestack_ix;
121 I32 savestack_max; 142 I32 savestack_max;
122 OP **retstack; 143 OP **retstack;
123 I32 retstack_ix; 144 I32 retstack_ix;
124 I32 retstack_max; 145 I32 retstack_max;
146 PMOP *curpm;
125 COP *curcop; 147 COP *curcop;
126 JMPENV *top_env; 148 JMPENV *top_env;
127 149
150 /* coro process data */
151 int prio;
152
128 /* data associated with this coroutine (initial args) */ 153 /* data associated with this coroutine (initial args) */
129 AV *args; 154 AV *args;
155 int refcnt;
130}; 156};
131 157
132typedef struct coro *Coro__State; 158typedef struct coro *Coro__State;
133typedef struct coro *Coro__State_or_hashref; 159typedef struct coro *Coro__State_or_hashref;
134 160
135static AV *main_mainstack; /* used to differentiate between $main and others */ 161static AV *
136static HV *coro_state_stash; 162coro_clone_padlist (pTHX_ CV *cv)
137static SV *ucoro_state_sv;
138static U32 ucoro_state_hash;
139static SV *coro_mortal; /* will be freed after next transfer */
140
141/* mostly copied from op.c:cv_clone2 */
142STATIC AV *
143clone_padlist (AV *protopadlist)
144{ 163{
145 AV *av; 164 AV *padlist = CvPADLIST (cv);
146 I32 ix;
147 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
148 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
149 SV **pname = AvARRAY (protopad_name);
150 SV **ppad = AvARRAY (protopad);
151 I32 fname = AvFILLp (protopad_name);
152 I32 fpad = AvFILLp (protopad);
153 AV *newpadlist, *newpad_name, *newpad; 165 AV *newpadlist, *newpad;
154 SV **npad;
155
156 newpad_name = newAV ();
157 for (ix = fname; ix >= 0; ix--)
158 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
159
160 newpad = newAV ();
161 av_fill (newpad, AvFILLp (protopad));
162 npad = AvARRAY (newpad);
163 166
164 newpadlist = newAV (); 167 newpadlist = newAV ();
165 AvREAL_off (newpadlist); 168 AvREAL_off (newpadlist);
166 av_store (newpadlist, 0, (SV *) newpad_name); 169#if PERL_VERSION < 9
170 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
171#else
172 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
173#endif
174 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
175 --AvFILLp (padlist);
176
177 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
167 av_store (newpadlist, 1, (SV *) newpad); 178 av_store (newpadlist, 1, (SV *)newpad);
168
169 av = newAV (); /* will be @_ */
170 av_extend (av, 0);
171 av_store (newpad, 0, (SV *) av);
172 AvFLAGS (av) = AVf_REIFY;
173
174 for (ix = fpad; ix > 0; ix--)
175 {
176 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
177
178 if (namesv && namesv != &PL_sv_undef)
179 {
180 char *name = SvPVX (namesv); /* XXX */
181
182 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
183 { /* lexical from outside? */
184 npad[ix] = SvREFCNT_inc (ppad[ix]);
185 }
186 else
187 { /* our own lexical */
188 SV *sv;
189 if (*name == '&')
190 sv = SvREFCNT_inc (ppad[ix]);
191 else if (*name == '@')
192 sv = (SV *) newAV ();
193 else if (*name == '%')
194 sv = (SV *) newHV ();
195 else
196 sv = NEWSV (0, 0);
197
198#ifdef SvPADBUSY
199 if (!SvPADBUSY (sv))
200#endif
201 SvPADMY_on (sv);
202
203 npad[ix] = sv;
204 }
205 }
206 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
207 {
208 npad[ix] = SvREFCNT_inc (ppad[ix]);
209 }
210 else
211 {
212 SV *sv = NEWSV (0, 0);
213 SvPADTMP_on (sv);
214 npad[ix] = sv;
215 }
216 }
217
218#if 0 /* return -ENOTUNDERSTOOD */
219 /* Now that vars are all in place, clone nested closures. */
220
221 for (ix = fpad; ix > 0; ix--) {
222 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
223 if (namesv
224 && namesv != &PL_sv_undef
225 && !(SvFLAGS(namesv) & SVf_FAKE)
226 && *SvPVX(namesv) == '&'
227 && CvCLONE(ppad[ix]))
228 {
229 CV *kid = cv_clone((CV*)ppad[ix]);
230 SvREFCNT_dec(ppad[ix]);
231 CvCLONE_on(kid);
232 SvPADMY_on(kid);
233 npad[ix] = (SV*)kid;
234 }
235 }
236#endif
237 179
238 return newpadlist; 180 return newpadlist;
239} 181}
240 182
241STATIC void 183static void
242free_padlist (AV *padlist) 184free_padlist (pTHX_ AV *padlist)
243{ 185{
244 /* may be during global destruction */ 186 /* may be during global destruction */
245 if (SvREFCNT (padlist)) 187 if (SvREFCNT (padlist))
246 { 188 {
247 I32 i = AvFILLp (padlist); 189 I32 i = AvFILLp (padlist);
260 202
261 SvREFCNT_dec ((SV*)padlist); 203 SvREFCNT_dec ((SV*)padlist);
262 } 204 }
263} 205}
264 206
265STATIC int 207static int
266coro_cv_free (pTHX_ SV *sv, MAGIC *mg) 208coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
267{ 209{
268 AV *padlist; 210 AV *padlist;
269 AV *av = (AV *)mg->mg_obj; 211 AV *av = (AV *)mg->mg_obj;
270 212
271 /* casting is fun. */ 213 /* casting is fun. */
272 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 214 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
273 free_padlist (padlist); 215 free_padlist (aTHX_ padlist);
216
217 SvREFCNT_dec (av);
218
219 return 0;
274} 220}
275 221
276#define PERL_MAGIC_coro PERL_MAGIC_ext 222#define PERL_MAGIC_coro PERL_MAGIC_ext
277 223
278static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 224static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
279 225
280/* the next two functions merely cache the padlists */ 226/* the next two functions merely cache the padlists */
281STATIC void 227static void
282get_padlist (CV *cv) 228get_padlist (pTHX_ CV *cv)
283{ 229{
284 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 230 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
285 231
286 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 232 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
287 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 233 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
288 else 234 else
235 {
236#if 0
237 /* this should work - but it doesn't :( */
238 CV *cp = Perl_cv_clone (aTHX_ cv);
239 CvPADLIST (cv) = CvPADLIST (cp);
240 CvPADLIST (cp) = 0;
241 SvREFCNT_dec (cp);
242#else
289 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 243 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
244#endif
245 }
290} 246}
291 247
292STATIC void 248static void
293put_padlist (CV *cv) 249put_padlist (pTHX_ CV *cv)
294{ 250{
295 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 251 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
296 252
297 if (!mg) 253 if (!mg)
298 { 254 {
324 PL_mainstack = c->mainstack; 280 PL_mainstack = c->mainstack;
325 PL_stack_sp = c->stack_sp; 281 PL_stack_sp = c->stack_sp;
326 PL_op = c->op; 282 PL_op = c->op;
327 PL_curpad = c->curpad; 283 PL_curpad = c->curpad;
328 PL_comppad = c->comppad; 284 PL_comppad = c->comppad;
285 PL_compcv = c->compcv;
329 PL_stack_base = c->stack_base; 286 PL_stack_base = c->stack_base;
330 PL_stack_max = c->stack_max; 287 PL_stack_max = c->stack_max;
331 PL_tmps_stack = c->tmps_stack; 288 PL_tmps_stack = c->tmps_stack;
332 PL_tmps_floor = c->tmps_floor; 289 PL_tmps_floor = c->tmps_floor;
333 PL_tmps_ix = c->tmps_ix; 290 PL_tmps_ix = c->tmps_ix;
339 PL_scopestack_ix = c->scopestack_ix; 296 PL_scopestack_ix = c->scopestack_ix;
340 PL_scopestack_max = c->scopestack_max; 297 PL_scopestack_max = c->scopestack_max;
341 PL_savestack = c->savestack; 298 PL_savestack = c->savestack;
342 PL_savestack_ix = c->savestack_ix; 299 PL_savestack_ix = c->savestack_ix;
343 PL_savestack_max = c->savestack_max; 300 PL_savestack_max = c->savestack_max;
301#if PERL_VERSION < 9
344 PL_retstack = c->retstack; 302 PL_retstack = c->retstack;
345 PL_retstack_ix = c->retstack_ix; 303 PL_retstack_ix = c->retstack_ix;
346 PL_retstack_max = c->retstack_max; 304 PL_retstack_max = c->retstack_max;
305#endif
306 PL_curpm = c->curpm;
347 PL_curcop = c->curcop; 307 PL_curcop = c->curcop;
348 PL_top_env = c->top_env; 308 PL_top_env = c->top_env;
349 309
350 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 310 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
351 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 311 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
360 { 320 {
361 AV *padlist = (AV *)POPs; 321 AV *padlist = (AV *)POPs;
362 322
363 if (padlist) 323 if (padlist)
364 { 324 {
365 put_padlist (cv); /* mark this padlist as available */ 325 put_padlist (aTHX_ cv); /* mark this padlist as available */
366 CvPADLIST(cv) = padlist; 326 CvPADLIST(cv) = padlist;
367 } 327 }
368 328
369 ++CvDEPTH(cv); 329 ++CvDEPTH(cv);
370 } 330 }
410 } 370 }
411 371
412 PUSHs ((SV *)CvPADLIST(cv)); 372 PUSHs ((SV *)CvPADLIST(cv));
413 PUSHs ((SV *)cv); 373 PUSHs ((SV *)cv);
414 374
415 get_padlist (cv); /* this is a monster */ 375 get_padlist (aTHX_ cv);
416 } 376 }
417 } 377 }
418#ifdef CXt_FORMAT 378#ifdef CXt_FORMAT
419 else if (CxTYPE(cx) == CXt_FORMAT) 379 else if (CxTYPE(cx) == CXt_FORMAT)
420 { 380 {
448 c->mainstack = PL_mainstack; 408 c->mainstack = PL_mainstack;
449 c->stack_sp = PL_stack_sp; 409 c->stack_sp = PL_stack_sp;
450 c->op = PL_op; 410 c->op = PL_op;
451 c->curpad = PL_curpad; 411 c->curpad = PL_curpad;
452 c->comppad = PL_comppad; 412 c->comppad = PL_comppad;
413 c->compcv = PL_compcv;
453 c->stack_base = PL_stack_base; 414 c->stack_base = PL_stack_base;
454 c->stack_max = PL_stack_max; 415 c->stack_max = PL_stack_max;
455 c->tmps_stack = PL_tmps_stack; 416 c->tmps_stack = PL_tmps_stack;
456 c->tmps_floor = PL_tmps_floor; 417 c->tmps_floor = PL_tmps_floor;
457 c->tmps_ix = PL_tmps_ix; 418 c->tmps_ix = PL_tmps_ix;
463 c->scopestack_ix = PL_scopestack_ix; 424 c->scopestack_ix = PL_scopestack_ix;
464 c->scopestack_max = PL_scopestack_max; 425 c->scopestack_max = PL_scopestack_max;
465 c->savestack = PL_savestack; 426 c->savestack = PL_savestack;
466 c->savestack_ix = PL_savestack_ix; 427 c->savestack_ix = PL_savestack_ix;
467 c->savestack_max = PL_savestack_max; 428 c->savestack_max = PL_savestack_max;
429#if PERL_VERSION < 9
468 c->retstack = PL_retstack; 430 c->retstack = PL_retstack;
469 c->retstack_ix = PL_retstack_ix; 431 c->retstack_ix = PL_retstack_ix;
470 c->retstack_max = PL_retstack_max; 432 c->retstack_max = PL_retstack_max;
433#endif
434 c->curpm = PL_curpm;
471 c->curcop = PL_curcop; 435 c->curcop = PL_curcop;
472 c->top_env = PL_top_env; 436 c->top_env = PL_top_env;
473} 437}
474 438
475/* 439/*
476 * allocate various perl stacks. This is an exact copy 440 * allocate various perl stacks. This is an exact copy
477 * of perl.c:init_stacks, except that it uses less memory 441 * of perl.c:init_stacks, except that it uses less memory
478 * on the (sometimes correct) assumption that coroutines do 442 * on the (sometimes correct) assumption that coroutines do
479 * not usually need a lot of stackspace. 443 * not usually need a lot of stackspace.
480 */ 444 */
481STATIC void 445static void
482coro_init_stacks (pTHX) 446coro_init_stacks (pTHX)
483{ 447{
484 LOCK; 448 LOCK;
485 449
486 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 450 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
511 475
512 New(54,PL_savestack,96,ANY); 476 New(54,PL_savestack,96,ANY);
513 PL_savestack_ix = 0; 477 PL_savestack_ix = 0;
514 PL_savestack_max = 96; 478 PL_savestack_max = 96;
515 479
480#if PERL_VERSION < 9
516 New(54,PL_retstack,8,OP*); 481 New(54,PL_retstack,8,OP*);
517 PL_retstack_ix = 0; 482 PL_retstack_ix = 0;
518 PL_retstack_max = 8; 483 PL_retstack_max = 8;
484#endif
519 485
520 UNLOCK; 486 UNLOCK;
521} 487}
522 488
523/* 489/*
524 * destroy the stacks, the callchain etc... 490 * destroy the stacks, the callchain etc...
525 */ 491 */
526STATIC void 492static void
527destroy_stacks(pTHX) 493destroy_stacks(pTHX)
528{ 494{
529 if (!IN_DESTRUCT) 495 if (!IN_DESTRUCT)
530 { 496 {
531 /* is this ugly, I ask? */ 497 /* is this ugly, I ask? */
532 LEAVE_SCOPE (0); 498 LEAVE_SCOPE (0);
533 499
534 /* sure it is, but more important: is it correct?? :/ */ 500 /* sure it is, but more important: is it correct?? :/ */
535 FREETMPS; 501 FREETMPS;
502
503 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
536 } 504 }
537 505
538 while (PL_curstackinfo->si_next) 506 while (PL_curstackinfo->si_next)
539 PL_curstackinfo = PL_curstackinfo->si_next; 507 PL_curstackinfo = PL_curstackinfo->si_next;
540 508
541 while (PL_curstackinfo) 509 while (PL_curstackinfo)
542 { 510 {
543 PERL_SI *p = PL_curstackinfo->si_prev; 511 PERL_SI *p = PL_curstackinfo->si_prev;
544 512
545 { 513 { /*D*//*remove*/
546 dSP; 514 dSP;
547 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
548 PUTBACK; /* possibly superfluous */ 516 PUTBACK; /* possibly superfluous */
549 } 517 }
550 518
551 if (!IN_DESTRUCT) 519 if (!IN_DESTRUCT)
552 { 520 {
553 dounwind(-1); 521 dounwind (-1);/*D*//*remove*/
554 SvREFCNT_dec(PL_curstackinfo->si_stack); 522 SvREFCNT_dec (PL_curstackinfo->si_stack);
555 } 523 }
556 524
557 Safefree(PL_curstackinfo->si_cxstack); 525 Safefree (PL_curstackinfo->si_cxstack);
558 Safefree(PL_curstackinfo); 526 Safefree (PL_curstackinfo);
559 PL_curstackinfo = p; 527 PL_curstackinfo = p;
560 } 528 }
561 529
562 Safefree(PL_tmps_stack); 530 Safefree (PL_tmps_stack);
563 Safefree(PL_markstack); 531 Safefree (PL_markstack);
564 Safefree(PL_scopestack); 532 Safefree (PL_scopestack);
565 Safefree(PL_savestack); 533 Safefree (PL_savestack);
534#if PERL_VERSION < 9
566 Safefree(PL_retstack); 535 Safefree (PL_retstack);
536#endif
567} 537}
568 538
569static void 539static void
570allocate_stack (Coro__State ctx, int alloc) 540allocate_stack (Coro__State ctx, int alloc)
571{ 541{
578 stack->gencnt = ctx->gencnt = 0; 548 stack->gencnt = ctx->gencnt = 0;
579 549
580 if (alloc) 550 if (alloc)
581 { 551 {
582#if HAVE_MMAP 552#if HAVE_MMAP
583 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ 553 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */
584 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); 554 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
585 if (stack->sptr == (void *)-1) 555 if (stack->sptr != (void *)-1)
586#endif
587 { 556 {
588 /*FIXME*//*D*//* reasonable stack size! */ 557# if STACKGUARD
558 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
559# endif
560 }
561 else
562#endif
563 {
589 stack->ssize = - (8192 * sizeof (long)); 564 stack->ssize = - (STACKSIZE * (long)sizeof (long));
590 New (0, stack->sptr, 8192, long); 565 New (0, stack->sptr, STACKSIZE, long);
591 } 566 }
592 } 567 }
593 else 568 else
594 stack->sptr = 0; 569 stack->sptr = 0;
595 570
625setup_coro (void *arg) 600setup_coro (void *arg)
626{ 601{
627 /* 602 /*
628 * emulate part of the perl startup here. 603 * emulate part of the perl startup here.
629 */ 604 */
605 dTHX;
630 dSP; 606 dSP;
631 Coro__State ctx = (Coro__State)arg; 607 Coro__State ctx = (Coro__State)arg;
632 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); 608 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
633 609
634 coro_init_stacks (aTHX); 610 coro_init_stacks (aTHX);
654 } 630 }
655 else 631 else
656 { 632 {
657 UNOP myop; 633 UNOP myop;
658 634
659 PL_op = (OP *)&myop;
660
661 Zero(&myop, 1, UNOP); 635 Zero(&myop, 1, UNOP);
662 myop.op_next = Nullop; 636 myop.op_next = Nullop;
663 myop.op_flags = OPf_WANT_VOID; 637 myop.op_flags = OPf_WANT_VOID;
638
639 PL_op = (OP *)&myop;
664 640
665 PUSHMARK(SP); 641 PUSHMARK(SP);
666 XPUSHs (sub_init); 642 XPUSHs (sub_init);
667 /* 643 /*
668 * the next line is slightly wrong, as PL_op->op_next 644 * the next line is slightly wrong, as PL_op->op_next
683continue_coro (void *arg) 659continue_coro (void *arg)
684{ 660{
685 /* 661 /*
686 * this is a _very_ stripped down perl interpreter ;) 662 * this is a _very_ stripped down perl interpreter ;)
687 */ 663 */
664 dTHX;
688 Coro__State ctx = (Coro__State)arg; 665 Coro__State ctx = (Coro__State)arg;
689 JMPENV coro_start_env;
690 666
691 PL_top_env = &ctx->start_env; 667 PL_top_env = &PL_start_env;
692 668
693 ctx->cursp = 0; 669 ctx->cursp = 0;
694 PL_op = PL_op->op_next; 670 PL_op = PL_op->op_next;
695 CALLRUNOPS(aTHX); 671 CALLRUNOPS(aTHX);
696 672
697 abort (); 673 abort ();
698} 674}
699 675
700STATIC void 676/* never call directly, always through the coro_state_transfer global variable */
677static void
701transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 678transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
702{ 679{
703 dSTACKLEVEL; 680 dSTACKLEVEL;
704 681
705 if (prev != next) 682 if (prev != next)
706 { 683 {
684 /* has this coro been created yet? */
707 if (next->mainstack) 685 if (next->mainstack)
708 { 686 {
709 LOCK; 687 LOCK;
710 SAVE (prev, flags); 688 SAVE (prev, flags);
711 LOAD (next); 689 LOAD (next);
750 { 728 {
751 LOCK; 729 LOCK;
752 SAVE (prev, -1); /* first get rid of the old state */ 730 SAVE (prev, -1); /* first get rid of the old state */
753 UNLOCK; 731 UNLOCK;
754 732
733 /* create the coroutine for the first time */
755 if (flags & TRANSFER_SAVE_CCTXT) 734 if (flags & TRANSFER_SAVE_CCTXT)
756 { 735 {
757 if (!prev->stack) 736 if (!prev->stack)
758 allocate_stack (prev, 0); 737 allocate_stack (prev, 0);
759 738
739 /* the new coroutine starts with start_env again */
740 PL_top_env = &PL_start_env;
741
760 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 742 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
761 { 743 {
762 PL_top_env = &next->start_env;
763
764 setup_coro (next); 744 setup_coro (next);
765 next->cursp = stacklevel; 745 next->cursp = stacklevel;
766 746
767 prev->stack->refcnt++; 747 prev->stack->refcnt++;
768 prev->stack->usecnt++; 748 prev->stack->usecnt++;
796 coro_mortal = 0; 776 coro_mortal = 0;
797 } 777 }
798 UNLOCK; 778 UNLOCK;
799} 779}
800 780
781/* use this function pointer to call the above function */
782/* this is done to increase chances of the compiler not inlining the call */
783void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl;
784
801#define SV_CORO(sv,func) \ 785#define SV_CORO(sv,func) \
802 do { \ 786 do { \
803 if (SvROK (sv)) \ 787 if (SvROK (sv)) \
804 sv = SvRV (sv); \ 788 sv = SvRV (sv); \
805 \ 789 \
806 if (SvTYPE (sv) == SVt_PVHV) \ 790 if (SvTYPE (sv) == SVt_PVHV && SvSTASH (sv) != coro_state_stash) \
807 { \ 791 { \
808 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ 792 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
809 \ 793 \
810 if (!he) \ 794 if (!he) \
811 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ 795 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
817 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ 801 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
818 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ 802 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
819 \ 803 \
820 } while(0) 804 } while(0)
821 805
822#define SvSTATE(sv) (struct coro *)SvIV (sv) 806static void
807coro_state_destroy (struct coro *coro)
808{
809 if (coro->refcnt--)
810 return;
823 811
812 if (coro->mainstack && coro->mainstack != main_mainstack)
813 {
814 struct coro temp;
815
816 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
817 LOAD (aTHX_ coro);
818
819 destroy_stacks (aTHX);
820
821 LOAD ((&temp)); /* this will get rid of defsv etc.. */
822
823 coro->mainstack = 0;
824 }
825
826 deallocate_stack (coro);
827 SvREFCNT_dec (coro->args);
828 Safefree (coro);
829}
830
824static void 831static int
832coro_state_clear (SV *sv, MAGIC *mg)
833{
834 struct coro *coro = (struct coro *)mg->mg_ptr;
835 mg->mg_ptr = 0;
836
837 coro_state_destroy (coro);
838
839 return 0;
840}
841
842static int
843coro_state_dup (MAGIC *mg, CLONE_PARAMS *params)
844{
845 struct coro *coro = (struct coro *)mg->mg_ptr;
846
847 ++coro->refcnt;
848
849 return 0;
850}
851
852static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
853
854static struct coro *
855SvSTATE (SV *coro)
856{
857 MAGIC *mg = SvMAGIC (SvROK (coro) ? SvRV (coro) : coro);
858 assert (mg->mg_type == PERL_MAGIC_ext);
859 return (struct coro *)mg->mg_ptr;
860}
861
862static void
825api_transfer(pTHX_ SV *prev, SV *next, int flags) 863api_transfer (pTHX_ SV *prev, SV *next, int flags)
826{ 864{
827 SV_CORO (prev, "Coro::transfer"); 865 SV_CORO (prev, "Coro::transfer");
828 SV_CORO (next, "Coro::transfer"); 866 SV_CORO (next, "Coro::transfer");
829 867
830 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 868 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
831} 869}
832 870
833/** Coro ********************************************************************/ 871/** Coro ********************************************************************/
834 872
835#define PRIO_MAX 3 873#define PRIO_MAX 3
839#define PRIO_IDLE -3 877#define PRIO_IDLE -3
840#define PRIO_MIN -4 878#define PRIO_MIN -4
841 879
842/* for Coro.pm */ 880/* for Coro.pm */
843static GV *coro_current, *coro_idle; 881static GV *coro_current, *coro_idle;
844static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 882static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
845static int coro_nready; 883static int coro_nready;
846 884
847static void 885static void
848coro_enq (SV *sv) 886coro_enq (pTHX_ SV *sv)
849{ 887{
888 int prio;
889
850 if (SvTYPE (sv) == SVt_PVHV) 890 if (SvTYPE (sv) != SVt_PVHV)
851 {
852 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
853 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
854
855 prio = prio > PRIO_MAX ? PRIO_MAX
856 : prio < PRIO_MIN ? PRIO_MIN
857 : prio;
858
859 av_push (coro_ready [prio - PRIO_MIN], sv);
860 coro_nready++;
861
862 return;
863 }
864
865 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 891 croak ("Coro::ready tried to enqueue something that is not a coroutine");
892
893 {
894 SV *coro = sv;
895 SV_CORO (coro, "omg");
896 prio = SvSTATE (coro)->prio;
897 }
898
899 av_push (coro_ready [prio - PRIO_MIN], sv);
900 coro_nready++;
866} 901}
867 902
868static SV * 903static SV *
869coro_deq (int min_prio) 904coro_deq (pTHX_ int min_prio)
870{ 905{
871 int prio = PRIO_MAX - PRIO_MIN; 906 int prio = PRIO_MAX - PRIO_MIN;
872 907
873 min_prio -= PRIO_MIN; 908 min_prio -= PRIO_MIN;
874 if (min_prio < 0) 909 if (min_prio < 0)
875 min_prio = 0; 910 min_prio = 0;
876 911
877 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 912 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
878 if (av_len (coro_ready[prio]) >= 0) 913 if (AvFILLp (coro_ready [prio]) >= 0)
879 { 914 {
880 coro_nready--; 915 coro_nready--;
881 return av_shift (coro_ready[prio]); 916 return av_shift (coro_ready [prio]);
882 } 917 }
883 918
884 return 0; 919 return 0;
885} 920}
886 921
887static void 922static void
888api_ready (SV *coro) 923api_ready (SV *coro)
889{ 924{
925 dTHX;
926
890 if (SvROK (coro)) 927 if (SvROK (coro))
891 coro = SvRV (coro); 928 coro = SvRV (coro);
892 929
893 LOCK; 930 LOCK;
894 coro_enq (SvREFCNT_inc (coro)); 931 coro_enq (aTHX_ SvREFCNT_inc (coro));
895 UNLOCK; 932 UNLOCK;
896} 933}
897 934
898static void 935static void
899api_schedule (void) 936api_schedule (void)
900{ 937{
938 dTHX;
939
901 SV *prev, *next; 940 SV *prev, *next;
902 941
903 LOCK; 942 LOCK;
904 943
905 prev = SvRV (GvSV (coro_current)); 944 prev = SvRV (GvSV (coro_current));
906 next = coro_deq (PRIO_MIN); 945 next = coro_deq (aTHX_ PRIO_MIN);
907 946
908 if (!next) 947 if (!next)
909 next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); 948 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
910 949
911 /* free this only after the transfer */ 950 /* free this only after the transfer */
916 955
917 SV_CORO (next, "Coro::schedule"); 956 SV_CORO (next, "Coro::schedule");
918 957
919 UNLOCK; 958 UNLOCK;
920 959
921 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), 960 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
922 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 961 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
923} 962}
924 963
925static void 964static void
926api_cede (void) 965api_cede (void)
927{ 966{
967 dTHX;
968
928 LOCK; 969 LOCK;
929 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 970 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
930 UNLOCK; 971 UNLOCK;
931 972
932 api_schedule (); 973 api_schedule ();
933} 974}
934 975
935MODULE = Coro::State PACKAGE = Coro::State 976MODULE = Coro::State PACKAGE = Coro::State
936 977
937PROTOTYPES: ENABLE 978PROTOTYPES: DISABLE
938 979
939BOOT: 980BOOT:
940{ /* {} necessary for stoopid perl-5.6.x */ 981{ /* {} necessary for stoopid perl-5.6.x */
941#ifdef USE_ITHREADS 982#ifdef USE_ITHREADS
942 MUTEX_INIT (&coro_mutex); 983 MUTEX_INIT (&coro_mutex);
943#endif 984#endif
985 BOOT_PAGESIZE;
944 986
945 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 987 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
946 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 988 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
947 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 989 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
948 990
953 995
954 main_mainstack = PL_mainstack; 996 main_mainstack = PL_mainstack;
955 997
956 coroapi.ver = CORO_API_VERSION; 998 coroapi.ver = CORO_API_VERSION;
957 coroapi.transfer = api_transfer; 999 coroapi.transfer = api_transfer;
958}
959 1000
960Coro::State 1001 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
961_newprocess(args) 1002}
962 SV * args 1003
963 PROTOTYPE: $ 1004SV *
1005new (char *klass, ...)
964 CODE: 1006 CODE:
965 Coro__State coro; 1007{
1008 struct coro *coro;
1009 HV *hv;
1010 int i;
966 1011
967 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
968 croak ("Coro::State::_newprocess expects an arrayref");
969
970 Newz (0, coro, 1, struct coro); 1012 Newz (0, coro, 1, struct coro);
1013 coro->args = newAV ();
971 1014
972 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1015 for (i = 1; i < items; i++)
1016 av_push (coro->args, newSVsv (ST (i)));
1017
973 coro->mainstack = 0; /* actual work is done inside transfer */ 1018 /*coro->mainstack = 0; *//*actual work is done inside transfer */
974 coro->stack = 0; 1019 /*coro->stack = 0;*/
975 1020
976 /* same as JMPENV_BOOTSTRAP */ 1021 hv = newHV ();
977 /* we might be able to recycle start_env, but safe is safe */ 1022 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
978 //Zero(&coro->start_env, 1, JMPENV); 1023 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
979 coro->start_env.je_ret = -1; 1024}
980 coro->start_env.je_mustcatch = TRUE;
981
982 RETVAL = coro;
983 OUTPUT: 1025 OUTPUT:
984 RETVAL 1026 RETVAL
985 1027
986void 1028void
987transfer(prev, next, flags) 1029transfer(prev, next, flags)
988 SV *prev 1030 SV *prev
989 SV *next 1031 SV *next
990 int flags 1032 int flags
991 PROTOTYPE: @
992 CODE: 1033 CODE:
993 PUTBACK; 1034 PUTBACK;
994 SV_CORO (next, "Coro::transfer"); 1035 SV_CORO (next, "Coro::transfer");
995 SV_CORO (prev, "Coro::transfer"); 1036 SV_CORO (prev, "Coro::transfer");
996 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1037 coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
997 SPAGAIN; 1038 SPAGAIN;
998 1039
1040int
1041prio (Coro::State coro, int newprio = 0)
1042 ALIAS:
1043 nice = 1
1044 CODE:
1045{
1046 RETVAL = coro->prio;
1047
1048 if (items > 1)
1049 {
1050 if (ix)
1051 newprio += coro->prio;
1052
1053 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1054 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1055
1056 coro->prio = newprio;
1057 }
1058}
1059
999void 1060void
1000DESTROY(coro) 1061_clone_state_from (SV *dst, SV *src)
1001 Coro::State coro 1062 CODE:
1002 CODE: 1063{
1064 struct coro *coro_src = SvSTATE (src);
1003 1065
1004 if (coro->mainstack && coro->mainstack != main_mainstack) 1066 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1005 {
1006 struct coro temp;
1007 1067
1008 PUTBACK; 1068 ++coro_src->refcnt;
1009 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1069 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1010 LOAD(aTHX_ coro); 1070}
1011 SPAGAIN;
1012
1013 destroy_stacks (aTHX);
1014
1015 LOAD((&temp)); /* this will get rid of defsv etc.. */
1016 SPAGAIN;
1017
1018 coro->mainstack = 0;
1019 }
1020
1021 deallocate_stack (coro);
1022 SvREFCNT_dec (coro->args);
1023 Safefree (coro);
1024 1071
1025void 1072void
1026_exit(code) 1073_exit (code)
1027 int code 1074 int code
1028 PROTOTYPE: $ 1075 PROTOTYPE: $
1029 CODE: 1076 CODE:
1030 _exit (code); 1077 _exit (code);
1031 1078
1032MODULE = Coro::State PACKAGE = Coro::Cont 1079MODULE = Coro::State PACKAGE = Coro::Cont
1033 1080
1034# this is slightly dirty (should expose a c-level api)
1035
1036void 1081void
1037yield(...) 1082yield (...)
1038 PROTOTYPE: @ 1083 PROTOTYPE: @
1039 CODE: 1084 CODE:
1040 static SV *returnstk; 1085 SV *yieldstack;
1041 SV *sv; 1086 SV *sv;
1042 AV *defav = GvAV (PL_defgv); 1087 AV *defav = GvAV (PL_defgv);
1043 struct coro *prev, *next; 1088 struct coro *prev, *next;
1044 1089
1045 if (!returnstk) 1090 yieldstack = *hv_fetch (
1046 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); 1091 (HV *)SvRV (GvSV (coro_current)),
1092 "yieldstack", sizeof ("yieldstack") - 1,
1093 0
1094 );
1047 1095
1048 /* set up @_ -- ugly */ 1096 /* set up @_ -- ugly */
1049 av_clear (defav); 1097 av_clear (defav);
1050 av_fill (defav, items - 1); 1098 av_fill (defav, items - 1);
1051 while (items--) 1099 while (items--)
1052 av_store (defav, items, SvREFCNT_inc (ST(items))); 1100 av_store (defav, items, SvREFCNT_inc (ST(items)));
1053 1101
1054 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1055 sv = av_pop ((AV *)SvRV (returnstk)); 1102 sv = av_pop ((AV *)SvRV (yieldstack));
1056 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1103 prev = SvSTATE ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1057 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1104 next = SvSTATE ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1058 SvREFCNT_dec (sv); 1105 SvREFCNT_dec (sv);
1059 1106
1060 transfer(aTHX_ prev, next, 0); 1107 coro_state_transfer (aTHX_ prev, next, 0);
1061 1108
1062MODULE = Coro::State PACKAGE = Coro 1109MODULE = Coro::State PACKAGE = Coro
1063
1064# this is slightly dirty (should expose a c-level api)
1065 1110
1066BOOT: 1111BOOT:
1067{ 1112{
1068 int i; 1113 int i;
1069 HV *stash = gv_stashpv ("Coro", TRUE); 1114 HV *stash = gv_stashpv ("Coro", TRUE);
1089 coroapi.ready = api_ready; 1134 coroapi.ready = api_ready;
1090 coroapi.nready = &coro_nready; 1135 coroapi.nready = &coro_nready;
1091 coroapi.current = coro_current; 1136 coroapi.current = coro_current;
1092 1137
1093 GCoroAPI = &coroapi; 1138 GCoroAPI = &coroapi;
1094 sv_setiv(sv, (IV)&coroapi); 1139 sv_setiv (sv, (IV)&coroapi);
1095 SvREADONLY_on(sv); 1140 SvREADONLY_on (sv);
1096 } 1141 }
1097} 1142}
1098 1143
1099#if !PERL_MICRO 1144#if !PERL_MICRO
1100 1145
1101void 1146void
1102ready(self) 1147ready (self)
1103 SV * self 1148 SV * self
1104 PROTOTYPE: $ 1149 PROTOTYPE: $
1105 CODE: 1150 CODE:
1106 api_ready (self); 1151 api_ready (self);
1107 1152
1108#endif 1153#endif
1109 1154
1110int 1155int
1111nready(...) 1156nready (...)
1112 PROTOTYPE: 1157 PROTOTYPE:
1113 CODE: 1158 CODE:
1114 RETVAL = coro_nready; 1159 RETVAL = coro_nready;
1115 OUTPUT: 1160 OUTPUT:
1116 RETVAL 1161 RETVAL
1117 1162
1118void 1163void
1119schedule(...) 1164schedule (...)
1120 PROTOTYPE: 1165 PROTOTYPE:
1121 CODE: 1166 CODE:
1122 api_schedule (); 1167 api_schedule ();
1123 1168
1124void 1169void
1125cede(...) 1170cede (...)
1126 PROTOTYPE: 1171 PROTOTYPE:
1127 CODE: 1172 CODE:
1128 api_cede (); 1173 api_cede ();
1129 1174
1175# and these are hacks
1176SV *
1177_aio_get_state ()
1178 CODE:
1179{
1180 struct {
1181 int errorno;
1182 int laststype;
1183 int laststatval;
1184 Stat_t statcache;
1185 } data;
1186
1187 data.errorno = errno;
1188 data.laststype = PL_laststype;
1189 data.laststatval = PL_laststatval;
1190 data.statcache = PL_statcache;
1191
1192 RETVAL = newSVpvn ((char *)&data, sizeof data);
1193}
1194 OUTPUT:
1195 RETVAL
1196
1197void
1198_aio_set_state (char *data_)
1199 PROTOTYPE: $
1200 CODE:
1201{
1202 struct {
1203 int errorno;
1204 int laststype;
1205 int laststatval;
1206 Stat_t statcache;
1207 } *data = (void *)data_;
1208
1209 errno = data->errorno;
1210 PL_laststype = data->laststype;
1211 PL_laststatval = data->laststatval;
1212 PL_statcache = data->statcache;
1213}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines