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.46 by pcg, Wed Nov 5 20:02:46 2003 UTC vs.
Revision 1.77 by root, Tue Oct 31 23:55:33 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>
31 33
32#ifdef HAVE_MMAP 34#ifdef HAVE_MMAP
33# include <unistd.h> 35# include <unistd.h>
34# include <sys/mman.h> 36# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS 37# ifndef MAP_ANONYMOUS
… …
39# undef HAVE_MMAP 41# undef HAVE_MMAP
40# endif 42# endif
41# endif 43# endif
42#endif 44#endif
43 45
44#define MAY_FLUSH /* increases codesize and is rarely used */
45
46#define SUB_INIT "Coro::State::initialize" 46#define SUB_INIT "Coro::State::initialize"
47#define UCORO_STATE "_coro_state" 47#define UCORO_STATE "_coro_state"
48 48
49/* The next macro should declare a variable stacklevel that contains and approximation 49/* The next macro should declare a variable stacklevel that contains and approximation
50 * to the current C stack pointer. Its property is that it changes with each call 50 * to the current C stack pointer. Its property is that it changes with each call
… …
55 55
56#define labs(l) ((l) >= 0 ? (l) : -(l)) 56#define labs(l) ((l) >= 0 ? (l) : -(l))
57 57
58#include "CoroAPI.h" 58#include "CoroAPI.h"
59 59
60#ifdef USE_ITHREADS
61static perl_mutex coro_mutex;
62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64#else
65# define LOCK (void)0
66# define UNLOCK (void)0
67#endif
68
60static struct CoroAPI coroapi; 69static struct CoroAPI coroapi;
70static AV *main_mainstack; /* used to differentiate between $main and others */
71static HV *coro_state_stash;
72static SV *ucoro_state_sv;
73static U32 ucoro_state_hash;
74static SV *coro_mortal; /* will be freed after next transfer */
61 75
62/* this is actually not only the c stack but also c registers etc... */ 76/* this is actually not only the c stack but also c registers etc... */
63typedef struct { 77typedef struct {
64 int refcnt; /* pointer reference counter */ 78 int refcnt; /* pointer reference counter */
65 int usecnt; /* shared by how many coroutines */ 79 int usecnt; /* shared by how many coroutines */
… …
95 AV *mainstack; 109 AV *mainstack;
96 SV **stack_sp; 110 SV **stack_sp;
97 OP *op; 111 OP *op;
98 SV **curpad; 112 SV **curpad;
99 AV *comppad; 113 AV *comppad;
114 CV *compcv;
100 SV **stack_base; 115 SV **stack_base;
101 SV **stack_max; 116 SV **stack_max;
102 SV **tmps_stack; 117 SV **tmps_stack;
103 I32 tmps_floor; 118 I32 tmps_floor;
104 I32 tmps_ix; 119 I32 tmps_ix;
… …
113 I32 savestack_ix; 128 I32 savestack_ix;
114 I32 savestack_max; 129 I32 savestack_max;
115 OP **retstack; 130 OP **retstack;
116 I32 retstack_ix; 131 I32 retstack_ix;
117 I32 retstack_max; 132 I32 retstack_max;
133 PMOP *curpm;
118 COP *curcop; 134 COP *curcop;
119 JMPENV *top_env; 135 JMPENV *top_env;
120 136
121 /* data associated with this coroutine (initial args) */ 137 /* data associated with this coroutine (initial args) */
122 AV *args; 138 AV *args;
123}; 139};
124 140
125typedef struct coro *Coro__State; 141typedef struct coro *Coro__State;
126typedef struct coro *Coro__State_or_hashref; 142typedef struct coro *Coro__State_or_hashref;
127 143
128static AV *main_mainstack; /* used to differentiate between $main and others */ 144static AV *
129static HV *coro_state_stash; 145coro_clone_padlist (pTHX_ CV *cv)
130static SV *ucoro_state_sv;
131static U32 ucoro_state_hash;
132static HV *padlist_cache;
133static SV *coro_mortal; /* will be freed after next transfer */
134
135/* mostly copied from op.c:cv_clone2 */
136STATIC AV *
137clone_padlist (AV *protopadlist)
138{ 146{
139 AV *av; 147 AV *padlist = CvPADLIST (cv);
140 I32 ix;
141 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
142 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
143 SV **pname = AvARRAY (protopad_name);
144 SV **ppad = AvARRAY (protopad);
145 I32 fname = AvFILLp (protopad_name);
146 I32 fpad = AvFILLp (protopad);
147 AV *newpadlist, *newpad_name, *newpad; 148 AV *newpadlist, *newpad;
148 SV **npad;
149
150 newpad_name = newAV ();
151 for (ix = fname; ix >= 0; ix--)
152 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
153
154 newpad = newAV ();
155 av_fill (newpad, AvFILLp (protopad));
156 npad = AvARRAY (newpad);
157 149
158 newpadlist = newAV (); 150 newpadlist = newAV ();
159 AvREAL_off (newpadlist); 151 AvREAL_off (newpadlist);
160 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)));
161 av_store (newpadlist, 1, (SV *) newpad); 157 av_store (newpadlist, 1, (SV *)newpad);
162 158
163 av = newAV (); /* will be @_ */ 159 return newpadlist;
164 av_extend (av, 0); 160}
165 av_store (newpad, 0, (SV *) av);
166 AvFLAGS (av) = AVf_REIFY;
167 161
168 for (ix = fpad; ix > 0; ix--) 162static void
163free_padlist (pTHX_ AV *padlist)
164{
165 /* may be during global destruction */
166 if (SvREFCNT (padlist))
169 { 167 {
170 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 168 I32 i = AvFILLp (padlist);
171 if (namesv && namesv != &PL_sv_undef) 169 while (i >= 0)
172 { 170 {
173 char *name = SvPVX (namesv); /* XXX */ 171 SV **svp = av_fetch (padlist, i--, FALSE);
174 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 172 if (svp)
175 { /* lexical from outside? */
176 npad[ix] = SvREFCNT_inc (ppad[ix]);
177 } 173 {
178 else
179 { /* our own lexical */
180 SV *sv; 174 SV *sv;
181 if (*name == '&') 175 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
182 sv = SvREFCNT_inc (ppad[ix]); 176 SvREFCNT_dec (sv);
183 else if (*name == '@') 177
184 sv = (SV *) newAV (); 178 SvREFCNT_dec (*svp);
185 else if (*name == '%')
186 sv = (SV *) newHV ();
187 else
188 sv = NEWSV (0, 0);
189 if (!SvPADBUSY (sv))
190 SvPADMY_on (sv);
191 npad[ix] = sv;
192 } 179 }
193 } 180 }
194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 181
195 { 182 SvREFCNT_dec ((SV*)padlist);
196 npad[ix] = SvREFCNT_inc (ppad[ix]);
197 }
198 else
199 {
200 SV *sv = NEWSV (0, 0);
201 SvPADTMP_on (sv);
202 npad[ix] = sv;
203 }
204 } 183 }
184}
205 185
206#if 0 /* return -ENOTUNDERSTOOD */ 186static int
207 /* Now that vars are all in place, clone nested closures. */ 187coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
188{
189 AV *padlist;
190 AV *av = (AV *)mg->mg_obj;
208 191
209 for (ix = fpad; ix > 0; ix--) { 192 /* casting is fun. */
210 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 193 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
211 if (namesv 194 free_padlist (aTHX_ padlist);
212 && namesv != &PL_sv_undef 195
213 && !(SvFLAGS(namesv) & SVf_FAKE) 196 SvREFCNT_dec (av);
214 && *SvPVX(namesv) == '&' 197
215 && CvCLONE(ppad[ix])) 198 return 0;
216 { 199}
217 CV *kid = cv_clone((CV*)ppad[ix]); 200
218 SvREFCNT_dec(ppad[ix]); 201#define PERL_MAGIC_coro PERL_MAGIC_ext
219 CvCLONE_on(kid); 202
220 SvPADMY_on(kid); 203static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
221 npad[ix] = (SV*)kid; 204
222 } 205/* the next two functions merely cache the padlists */
206static void
207get_padlist (pTHX_ CV *cv)
208{
209 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
210
211 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
212 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
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
222 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
223#endif
224 }
225}
226
227static void
228put_padlist (pTHX_ CV *cv)
229{
230 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
231
232 if (!mg)
233 {
234 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
235 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
236 mg->mg_virtual = &vtbl_coro;
237 mg->mg_obj = (SV *)newAV ();
223 } 238 }
224#endif
225 239
226 return newpadlist;
227}
228
229#ifdef MAY_FLUSH
230STATIC void
231free_padlist (AV *padlist)
232{
233 /* may be during global destruction */
234 if (SvREFCNT(padlist))
235 {
236 I32 i = AvFILLp(padlist);
237 while (i >= 0)
238 {
239 SV **svp = av_fetch(padlist, i--, FALSE);
240 SV *sv = svp ? *svp : Nullsv;
241 if (sv)
242 SvREFCNT_dec(sv);
243 }
244
245 SvREFCNT_dec((SV*)padlist);
246 }
247}
248#endif
249
250/* the next two functions merely cache the padlists */
251STATIC void
252get_padlist (CV *cv)
253{
254 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
255
256 if (he && AvFILLp ((AV *)*he) >= 0)
257 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
258 else
259 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
260}
261
262STATIC void
263put_padlist (CV *cv)
264{
265 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
266
267 if (SvTYPE (*he) != SVt_PVAV)
268 {
269 SvREFCNT_dec (*he);
270 *he = (SV *)newAV ();
271 }
272
273 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 240 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
274} 241}
275
276#ifdef MAY_FLUSH
277STATIC void
278flush_padlist_cache ()
279{
280 HV *hv = padlist_cache;
281 padlist_cache = newHV ();
282
283 if (hv_iterinit (hv))
284 {
285 HE *he;
286 AV *padlist;
287
288 while (!!(he = hv_iternext (hv)))
289 {
290 AV *av = (AV *)HeVAL(he);
291
292 /* casting is fun. */
293 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
294 free_padlist (padlist);
295 }
296 }
297
298 SvREFCNT_dec (hv);
299}
300#endif
301 242
302#define SB do { 243#define SB do {
303#define SE } while (0) 244#define SE } while (0)
304 245
305#define LOAD(state) load_state(aTHX_ (state)); 246#define LOAD(state) load_state(aTHX_ (state));
306#define SAVE(state,flags) save_state(aTHX_ (state),(flags)); 247#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
307 248
308#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 249#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
309 250
310static void 251static void
311load_state(pTHX_ Coro__State c) 252load_state(pTHX_ Coro__State c)
312{ 253{
313 PL_dowarn = c->dowarn; 254 PL_dowarn = c->dowarn;
… …
318 PL_mainstack = c->mainstack; 259 PL_mainstack = c->mainstack;
319 PL_stack_sp = c->stack_sp; 260 PL_stack_sp = c->stack_sp;
320 PL_op = c->op; 261 PL_op = c->op;
321 PL_curpad = c->curpad; 262 PL_curpad = c->curpad;
322 PL_comppad = c->comppad; 263 PL_comppad = c->comppad;
264 PL_compcv = c->compcv;
323 PL_stack_base = c->stack_base; 265 PL_stack_base = c->stack_base;
324 PL_stack_max = c->stack_max; 266 PL_stack_max = c->stack_max;
325 PL_tmps_stack = c->tmps_stack; 267 PL_tmps_stack = c->tmps_stack;
326 PL_tmps_floor = c->tmps_floor; 268 PL_tmps_floor = c->tmps_floor;
327 PL_tmps_ix = c->tmps_ix; 269 PL_tmps_ix = c->tmps_ix;
… …
333 PL_scopestack_ix = c->scopestack_ix; 275 PL_scopestack_ix = c->scopestack_ix;
334 PL_scopestack_max = c->scopestack_max; 276 PL_scopestack_max = c->scopestack_max;
335 PL_savestack = c->savestack; 277 PL_savestack = c->savestack;
336 PL_savestack_ix = c->savestack_ix; 278 PL_savestack_ix = c->savestack_ix;
337 PL_savestack_max = c->savestack_max; 279 PL_savestack_max = c->savestack_max;
280#if PERL_VERSION < 9
338 PL_retstack = c->retstack; 281 PL_retstack = c->retstack;
339 PL_retstack_ix = c->retstack_ix; 282 PL_retstack_ix = c->retstack_ix;
340 PL_retstack_max = c->retstack_max; 283 PL_retstack_max = c->retstack_max;
284#endif
285 PL_curpm = c->curpm;
341 PL_curcop = c->curcop; 286 PL_curcop = c->curcop;
342 PL_top_env = c->top_env; 287 PL_top_env = c->top_env;
343 288
344 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 289 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
345 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 290 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
… …
354 { 299 {
355 AV *padlist = (AV *)POPs; 300 AV *padlist = (AV *)POPs;
356 301
357 if (padlist) 302 if (padlist)
358 { 303 {
359 put_padlist (cv); /* mark this padlist as available */ 304 put_padlist (aTHX_ cv); /* mark this padlist as available */
360 CvPADLIST(cv) = padlist; 305 CvPADLIST(cv) = padlist;
361#ifdef USE_THREADS
362 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
363#endif
364 } 306 }
365 307
366 ++CvDEPTH(cv); 308 ++CvDEPTH(cv);
367 } 309 }
368 310
… …
395 if (CxTYPE(cx) == CXt_SUB) 337 if (CxTYPE(cx) == CXt_SUB)
396 { 338 {
397 CV *cv = cx->blk_sub.cv; 339 CV *cv = cx->blk_sub.cv;
398 if (CvDEPTH(cv)) 340 if (CvDEPTH(cv))
399 { 341 {
400#ifdef USE_THREADS
401 /*XPUSHs ((SV *)CvOWNER(cv));*/
402 /*CvOWNER(cv) = 0;*/
403 /*error must unlock this cv etc.. etc...*/
404#endif
405 EXTEND (SP, CvDEPTH(cv)*2); 342 EXTEND (SP, CvDEPTH(cv)*2);
406 343
407 while (--CvDEPTH(cv)) 344 while (--CvDEPTH(cv))
408 { 345 {
409 /* this tells the restore code to increment CvDEPTH */ 346 /* this tells the restore code to increment CvDEPTH */
… …
412 } 349 }
413 350
414 PUSHs ((SV *)CvPADLIST(cv)); 351 PUSHs ((SV *)CvPADLIST(cv));
415 PUSHs ((SV *)cv); 352 PUSHs ((SV *)cv);
416 353
417 get_padlist (cv); /* this is a monster */ 354 get_padlist (aTHX_ cv);
418 } 355 }
419 } 356 }
420#ifdef CXt_FORMAT 357#ifdef CXt_FORMAT
421 else if (CxTYPE(cx) == CXt_FORMAT) 358 else if (CxTYPE(cx) == CXt_FORMAT)
422 { 359 {
… …
450 c->mainstack = PL_mainstack; 387 c->mainstack = PL_mainstack;
451 c->stack_sp = PL_stack_sp; 388 c->stack_sp = PL_stack_sp;
452 c->op = PL_op; 389 c->op = PL_op;
453 c->curpad = PL_curpad; 390 c->curpad = PL_curpad;
454 c->comppad = PL_comppad; 391 c->comppad = PL_comppad;
392 c->compcv = PL_compcv;
455 c->stack_base = PL_stack_base; 393 c->stack_base = PL_stack_base;
456 c->stack_max = PL_stack_max; 394 c->stack_max = PL_stack_max;
457 c->tmps_stack = PL_tmps_stack; 395 c->tmps_stack = PL_tmps_stack;
458 c->tmps_floor = PL_tmps_floor; 396 c->tmps_floor = PL_tmps_floor;
459 c->tmps_ix = PL_tmps_ix; 397 c->tmps_ix = PL_tmps_ix;
… …
465 c->scopestack_ix = PL_scopestack_ix; 403 c->scopestack_ix = PL_scopestack_ix;
466 c->scopestack_max = PL_scopestack_max; 404 c->scopestack_max = PL_scopestack_max;
467 c->savestack = PL_savestack; 405 c->savestack = PL_savestack;
468 c->savestack_ix = PL_savestack_ix; 406 c->savestack_ix = PL_savestack_ix;
469 c->savestack_max = PL_savestack_max; 407 c->savestack_max = PL_savestack_max;
408#if PERL_VERSION < 9
470 c->retstack = PL_retstack; 409 c->retstack = PL_retstack;
471 c->retstack_ix = PL_retstack_ix; 410 c->retstack_ix = PL_retstack_ix;
472 c->retstack_max = PL_retstack_max; 411 c->retstack_max = PL_retstack_max;
412#endif
413 c->curpm = PL_curpm;
473 c->curcop = PL_curcop; 414 c->curcop = PL_curcop;
474 c->top_env = PL_top_env; 415 c->top_env = PL_top_env;
475} 416}
476 417
477/* 418/*
478 * allocate various perl stacks. This is an exact copy 419 * allocate various perl stacks. This is an exact copy
479 * of perl.c:init_stacks, except that it uses less memory 420 * of perl.c:init_stacks, except that it uses less memory
480 * on the assumption that coroutines do not usually need 421 * on the (sometimes correct) assumption that coroutines do
481 * a lot of stackspace. 422 * not usually need a lot of stackspace.
482 */ 423 */
483STATIC void 424static void
484coro_init_stacks (pTHX) 425coro_init_stacks (pTHX)
485{ 426{
427 LOCK;
428
486 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 429 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
487 PL_curstackinfo->si_type = PERLSI_MAIN; 430 PL_curstackinfo->si_type = PERLSI_MAIN;
488 PL_curstack = PL_curstackinfo->si_stack; 431 PL_curstack = PL_curstackinfo->si_stack;
489 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 432 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
490 433
… …
511 454
512 New(54,PL_savestack,96,ANY); 455 New(54,PL_savestack,96,ANY);
513 PL_savestack_ix = 0; 456 PL_savestack_ix = 0;
514 PL_savestack_max = 96; 457 PL_savestack_max = 96;
515 458
459#if PERL_VERSION < 9
516 New(54,PL_retstack,8,OP*); 460 New(54,PL_retstack,8,OP*);
517 PL_retstack_ix = 0; 461 PL_retstack_ix = 0;
518 PL_retstack_max = 8; 462 PL_retstack_max = 8;
463#endif
464
465 UNLOCK;
519} 466}
520 467
521/* 468/*
522 * destroy the stacks, the callchain etc... 469 * destroy the stacks, the callchain etc...
523 * still there is a memleak of 128 bytes...
524 */ 470 */
525STATIC void 471static void
526destroy_stacks(pTHX) 472destroy_stacks(pTHX)
527{ 473{
528 if (!IN_DESTRUCT) 474 if (!IN_DESTRUCT)
529 { 475 {
530 /* is this ugly, I ask? */ 476 /* is this ugly, I ask? */
531 while (PL_scopestack_ix) 477 LEAVE_SCOPE (0);
532 LEAVE;
533 478
534 /* sure it is, but more important: is it correct?? :/ */ 479 /* sure it is, but more important: is it correct?? :/ */
535 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
536 FREETMPS; 480 FREETMPS;
481
482 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
537 } 483 }
538 484
539 while (PL_curstackinfo->si_next) 485 while (PL_curstackinfo->si_next)
540 PL_curstackinfo = PL_curstackinfo->si_next; 486 PL_curstackinfo = PL_curstackinfo->si_next;
541 487
542 while (PL_curstackinfo) 488 while (PL_curstackinfo)
543 { 489 {
544 PERL_SI *p = PL_curstackinfo->si_prev; 490 PERL_SI *p = PL_curstackinfo->si_prev;
545 491
546 { 492 { /*D*//*remove*/
547 dSP; 493 dSP;
548 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 494 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
549 PUTBACK; /* possibly superfluous */ 495 PUTBACK; /* possibly superfluous */
550 } 496 }
551 497
552 if (!IN_DESTRUCT) 498 if (!IN_DESTRUCT)
553 { 499 {
554 dounwind(-1); 500 dounwind (-1);/*D*//*remove*/
555 SvREFCNT_dec(PL_curstackinfo->si_stack); 501 SvREFCNT_dec (PL_curstackinfo->si_stack);
556 } 502 }
557 503
558 Safefree(PL_curstackinfo->si_cxstack); 504 Safefree (PL_curstackinfo->si_cxstack);
559 Safefree(PL_curstackinfo); 505 Safefree (PL_curstackinfo);
560 PL_curstackinfo = p; 506 PL_curstackinfo = p;
561 } 507 }
562 508
563 Safefree(PL_tmps_stack); 509 Safefree (PL_tmps_stack);
564 Safefree(PL_markstack); 510 Safefree (PL_markstack);
565 Safefree(PL_scopestack); 511 Safefree (PL_scopestack);
566 Safefree(PL_savestack); 512 Safefree (PL_savestack);
513#if PERL_VERSION < 9
567 Safefree(PL_retstack); 514 Safefree (PL_retstack);
515#endif
568} 516}
569 517
570static void 518static void
571allocate_stack (Coro__State ctx, int alloc) 519allocate_stack (Coro__State ctx, int alloc)
572{ 520{
… …
575 New (0, stack, 1, coro_stack); 523 New (0, stack, 1, coro_stack);
576 524
577 stack->refcnt = 1; 525 stack->refcnt = 1;
578 stack->usecnt = 1; 526 stack->usecnt = 1;
579 stack->gencnt = ctx->gencnt = 0; 527 stack->gencnt = ctx->gencnt = 0;
528
580 if (alloc) 529 if (alloc)
581 { 530 {
582#if HAVE_MMAP 531#if HAVE_MMAP
583 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ 532 stack->ssize = STACKSIZE * sizeof (long); /* 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); 533 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
585 if (stack->sptr == (void *)-1) 534 if (stack->sptr == (void *)-1)
586#endif 535#endif
587 { 536 {
588 /*FIXME*//*D*//* reasonable stack size! */
589 stack->ssize = -4096 * sizeof (long); 537 stack->ssize = - (STACKSIZE * (long)sizeof (long));
590 New (0, stack->sptr, 4096, long); 538 New (0, stack->sptr, STACKSIZE, long);
591 } 539 }
592 } 540 }
593 else 541 else
594 stack->sptr = 0; 542 stack->sptr = 0;
595 543
… …
609 { 557 {
610#ifdef HAVE_MMAP 558#ifdef HAVE_MMAP
611 if (stack->ssize > 0 && stack->sptr) 559 if (stack->ssize > 0 && stack->sptr)
612 munmap (stack->sptr, stack->ssize); 560 munmap (stack->sptr, stack->ssize);
613 else 561 else
614#else 562#endif
615 Safefree (stack->sptr); 563 Safefree (stack->sptr);
616#endif 564
617 Safefree (stack); 565 Safefree (stack);
618 } 566 }
619 else if (ctx->gencnt == stack->gencnt) 567 else if (ctx->gencnt == stack->gencnt)
620 --stack->usecnt; 568 --stack->usecnt;
621 } 569 }
… …
625setup_coro (void *arg) 573setup_coro (void *arg)
626{ 574{
627 /* 575 /*
628 * emulate part of the perl startup here. 576 * emulate part of the perl startup here.
629 */ 577 */
578 dTHX;
630 dSP; 579 dSP;
631 Coro__State ctx = (Coro__State)arg; 580 Coro__State ctx = (Coro__State)arg;
632 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 581 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
633 582
634 coro_init_stacks (aTHX); 583 coro_init_stacks (aTHX);
635 /*PL_curcop = 0;*/ 584 /*PL_curcop = 0;*/
636 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 585 /*PL_in_eval = PL_in_eval;*/ /* inherit */
637 SvREFCNT_dec (GvAV (PL_defgv)); 586 SvREFCNT_dec (GvAV (PL_defgv));
638 GvAV (PL_defgv) = ctx->args; 587 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
639 588
640 SPAGAIN; 589 SPAGAIN;
641 590
642 if (ctx->stack) 591 if (ctx->stack)
643 { 592 {
… …
683continue_coro (void *arg) 632continue_coro (void *arg)
684{ 633{
685 /* 634 /*
686 * this is a _very_ stripped down perl interpreter ;) 635 * this is a _very_ stripped down perl interpreter ;)
687 */ 636 */
637 dTHX;
688 Coro__State ctx = (Coro__State)arg; 638 Coro__State ctx = (Coro__State)arg;
689 JMPENV coro_start_env;
690 639
691 PL_top_env = &ctx->start_env; 640 PL_top_env = &ctx->start_env;
692 641
693 ctx->cursp = 0; 642 ctx->cursp = 0;
694 PL_op = PL_op->op_next; 643 PL_op = PL_op->op_next;
695 CALLRUNOPS(aTHX); 644 CALLRUNOPS(aTHX);
696 645
697 abort (); 646 abort ();
698} 647}
699 648
700STATIC void 649static void
701transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 650transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
702{ 651{
703 dSTACKLEVEL; 652 dSTACKLEVEL;
704 static struct coro *xnext;
705 653
706 if (prev != next) 654 if (prev != next)
707 { 655 {
708 xnext = next;
709
710 if (next->mainstack) 656 if (next->mainstack)
711 { 657 {
658 LOCK;
712 SAVE (prev, flags); 659 SAVE (prev, flags);
713 LOAD (next); 660 LOAD (next);
661 UNLOCK;
714 662
715 /* mark this state as in-use */ 663 /* mark this state as in-use */
716 next->mainstack = 0; 664 next->mainstack = 0;
717 next->tmps_ix = -2; 665 next->tmps_ix = -2;
718 666
… …
737 continue_coro, (void *)next, 685 continue_coro, (void *)next,
738 next->stack->sptr, labs (next->stack->ssize)); 686 next->stack->sptr, labs (next->stack->ssize));
739 } 687 }
740 688
741 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 689 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
690 prev->cursp = stacklevel;
742 /* don't add any code here */ 691 /* don't add any code here */
743 } 692 }
744 693 else
694 next->cursp = stacklevel;
745 } 695 }
746 else if (next->tmps_ix == -2) 696 else if (next->tmps_ix == -2)
747 croak ("tried to transfer to running coroutine"); 697 croak ("tried to transfer to running coroutine");
748 else 698 else
749 { 699 {
700 LOCK;
750 SAVE (prev, -1); /* first get rid of the old state */ 701 SAVE (prev, -1); /* first get rid of the old state */
702 UNLOCK;
751 703
752 if (flags & TRANSFER_SAVE_CCTXT) 704 if (flags & TRANSFER_SAVE_CCTXT)
753 { 705 {
754 if (!prev->stack) 706 if (!prev->stack)
755 allocate_stack (prev, 0); 707 allocate_stack (prev, 0);
… …
757 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 709 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
758 { 710 {
759 PL_top_env = &next->start_env; 711 PL_top_env = &next->start_env;
760 712
761 setup_coro (next); 713 setup_coro (next);
714 next->cursp = stacklevel;
762 715
763 prev->stack->refcnt++; 716 prev->stack->refcnt++;
764 prev->stack->usecnt++; 717 prev->stack->usecnt++;
765 next->stack = prev->stack; 718 next->stack = prev->stack;
766 next->gencnt = prev->gencnt; 719 next->gencnt = prev->gencnt;
767 } 720 }
768 else 721 else
769 { 722 {
723 assert (!next->stack);
770 allocate_stack (next, 1); 724 allocate_stack (next, 1);
771 coro_create (&(next->stack->cctx), 725 coro_create (&(next->stack->cctx),
772 setup_coro, (void *)next, 726 setup_coro, (void *)next,
773 next->stack->sptr, labs (next->stack->ssize)); 727 next->stack->sptr, labs (next->stack->ssize));
774 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 728 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
729 prev->cursp = stacklevel;
775 /* don't add any code here */ 730 /* don't add any code here */
776 } 731 }
777 } 732 }
778 else 733 else
734 {
779 setup_coro (next); 735 setup_coro (next);
736 next->cursp = stacklevel;
737 }
780 } 738 }
781
782 /*
783 * xnext is now either prev or next, depending on wether
784 * we switched the c stack or not. that's why I use a global
785 * variable, that should become thread-specific at one point.
786 */
787 xnext->cursp = stacklevel;
788 } 739 }
789 740
741 LOCK;
790 if (coro_mortal) 742 if (coro_mortal)
791 { 743 {
792 SvREFCNT_dec (coro_mortal); 744 SvREFCNT_dec (coro_mortal);
793 coro_mortal = 0; 745 coro_mortal = 0;
794 } 746 }
747 UNLOCK;
795} 748}
796 749
797#define SV_CORO(sv,func) \ 750#define SV_CORO(sv,func) \
798 do { \ 751 do { \
799 if (SvROK (sv)) \ 752 if (SvROK (sv)) \
800 sv = SvRV (sv); \ 753 sv = SvRV (sv); \
801 \ 754 \
802 if (SvTYPE(sv) == SVt_PVHV) \ 755 if (SvTYPE (sv) == SVt_PVHV) \
803 { \ 756 { \
804 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ 757 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
805 \ 758 \
806 if (!he) \ 759 if (!he) \
807 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ 760 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
808 \ 761 \
809 (sv) = SvRV (HeVAL(he)); \ 762 (sv) = SvRV (HeVAL(he)); \
810 } \ 763 } \
811 \ 764 \
812 /* must also be changed inside Coro::Cont::yield */ \ 765 /* must also be changed inside Coro::Cont::yield */ \
813 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \ 766 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
814 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); \
815 \ 768 \
816 } while(0) 769 } while(0)
817 770
818#define SvSTATE(sv) (struct coro *)SvIV (sv) 771#define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv))
819 772
820static void 773static void
821api_transfer(pTHX_ SV *prev, SV *next, int flags) 774api_transfer(pTHX_ SV *prev, SV *next, int flags)
822{ 775{
823 SV_CORO (prev, "Coro::transfer"); 776 SV_CORO (prev, "Coro::transfer");
824 SV_CORO (next, "Coro::transfer"); 777 SV_CORO (next, "Coro::transfer");
825 778
826 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 779 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
827} 780}
828 781
829/** Coro ********************************************************************/ 782/** Coro ********************************************************************/
830 783
831#define PRIO_MAX 3 784#define PRIO_MAX 3
… …
839static GV *coro_current, *coro_idle; 792static GV *coro_current, *coro_idle;
840static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 793static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
841static int coro_nready; 794static int coro_nready;
842 795
843static void 796static void
844coro_enq (SV *sv) 797coro_enq (pTHX_ SV *sv)
845{ 798{
799 SV **xprio;
800 int prio;
801
846 if (SvTYPE (sv) == SVt_PVHV) 802 if (SvTYPE (sv) != SVt_PVHV)
847 {
848 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
849 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
850
851 prio = prio > PRIO_MAX ? PRIO_MAX
852 : prio < PRIO_MIN ? PRIO_MIN
853 : prio;
854
855 av_push (coro_ready [prio - PRIO_MIN], sv);
856 coro_nready++;
857
858 return;
859 }
860
861 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++;
862} 814}
863 815
864static SV * 816static SV *
865coro_deq (int min_prio) 817coro_deq (pTHX_ int min_prio)
866{ 818{
867 int prio = PRIO_MAX - PRIO_MIN; 819 int prio = PRIO_MAX - PRIO_MIN;
868 820
869 min_prio -= PRIO_MIN; 821 min_prio -= PRIO_MIN;
870 if (min_prio < 0) 822 if (min_prio < 0)
… …
881} 833}
882 834
883static void 835static void
884api_ready (SV *coro) 836api_ready (SV *coro)
885{ 837{
838 dTHX;
839
886 if (SvROK (coro)) 840 if (SvROK (coro))
887 coro = SvRV (coro); 841 coro = SvRV (coro);
888 842
843 LOCK;
889 coro_enq (SvREFCNT_inc (coro)); 844 coro_enq (aTHX_ SvREFCNT_inc (coro));
845 UNLOCK;
890} 846}
891 847
892static void 848static void
893api_schedule (void) 849api_schedule (void)
894{ 850{
851 dTHX;
852
895 SV *prev, *next; 853 SV *prev, *next;
896 854
855 LOCK;
856
897 prev = SvRV (GvSV (coro_current)); 857 prev = SvRV (GvSV (coro_current));
898 next = coro_deq (PRIO_MIN); 858 next = coro_deq (aTHX_ PRIO_MIN);
899 859
900 if (!next) 860 if (!next)
901 next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); 861 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
902 862
903 /* free this only after the transfer */ 863 /* free this only after the transfer */
… …
906 866
907 SvRV (GvSV (coro_current)) = next; 867 SvRV (GvSV (coro_current)) = next;
908 868
909 SV_CORO (next, "Coro::schedule"); 869 SV_CORO (next, "Coro::schedule");
910 870
871 UNLOCK;
872
911 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), 873 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
912 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 874 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
913} 875}
914 876
915static void 877static void
916api_cede (void) 878api_cede (void)
917{ 879{
880 dTHX;
881
882 LOCK;
918 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 883 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
884 UNLOCK;
919 885
920 api_schedule (); 886 api_schedule ();
921} 887}
922 888
923MODULE = Coro::State PACKAGE = Coro::State 889MODULE = Coro::State PACKAGE = Coro::State
924 890
925PROTOTYPES: ENABLE 891PROTOTYPES: ENABLE
926 892
927BOOT: 893BOOT:
928{ /* {} necessary for stoopid perl-5.6.x */ 894{ /* {} necessary for stoopid perl-5.6.x */
895#ifdef USE_ITHREADS
896 MUTEX_INIT (&coro_mutex);
897#endif
898
929 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 899 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
930 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 900 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
931 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 901 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
932 902
933 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 903 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
934 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 904 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
935 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 905 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
936 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 906 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
937
938 if (!padlist_cache)
939 padlist_cache = newHV ();
940 907
941 main_mainstack = PL_mainstack; 908 main_mainstack = PL_mainstack;
942 909
943 coroapi.ver = CORO_API_VERSION; 910 coroapi.ver = CORO_API_VERSION;
944 coroapi.transfer = api_transfer; 911 coroapi.transfer = api_transfer;
… …
952 Coro__State coro; 919 Coro__State coro;
953 920
954 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 921 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
955 croak ("Coro::State::_newprocess expects an arrayref"); 922 croak ("Coro::State::_newprocess expects an arrayref");
956 923
957 New (0, coro, 1, struct coro); 924 Newz (0, coro, 1, struct coro);
958 925
959 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 926 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
960 coro->mainstack = 0; /* actual work is done inside transfer */ 927 /*coro->mainstack = 0; *//*actual work is done inside transfer */
961 coro->stack = 0; 928 /*coro->stack = 0;*/
962 929
963 /* same as JMPENV_BOOTSTRAP */ 930 /* same as JMPENV_BOOTSTRAP */
964 /* we might be able to recycle start_env, but safe is safe */ 931 /* we might be able to recycle start_env, but safe is safe */
965 Zero(&coro->start_env, 1, JMPENV); 932 /*Zero(&coro->start_env, 1, JMPENV);*/
966 coro->start_env.je_ret = -1; 933 coro->start_env.je_ret = -1;
967 coro->start_env.je_mustcatch = TRUE; 934 coro->start_env.je_mustcatch = TRUE;
968 935
969 RETVAL = coro; 936 RETVAL = coro;
970 OUTPUT: 937 OUTPUT:
… …
991 if (coro->mainstack && coro->mainstack != main_mainstack) 958 if (coro->mainstack && coro->mainstack != main_mainstack)
992 { 959 {
993 struct coro temp; 960 struct coro temp;
994 961
995 PUTBACK; 962 PUTBACK;
996 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 963 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
997 LOAD(aTHX_ coro); 964 LOAD (aTHX_ coro);
998 SPAGAIN; 965 SPAGAIN;
999 966
1000 destroy_stacks (aTHX); 967 destroy_stacks (aTHX);
1001 968
1002 LOAD((&temp)); /* this will get rid of defsv etc.. */ 969 LOAD ((&temp)); /* this will get rid of defsv etc.. */
1003 SPAGAIN; 970 SPAGAIN;
1004 971
1005 coro->mainstack = 0; 972 coro->mainstack = 0;
1006 } 973 }
1007 974
1008 deallocate_stack (coro); 975 deallocate_stack (coro);
1009 976 SvREFCNT_dec (coro->args);
1010 Safefree (coro); 977 Safefree (coro);
1011
1012void
1013flush()
1014 CODE:
1015#ifdef MAY_FLUSH
1016 flush_padlist_cache ();
1017#endif
1018 978
1019void 979void
1020_exit(code) 980_exit(code)
1021 int code 981 int code
1022 PROTOTYPE: $ 982 PROTOTYPE: $
1023 CODE: 983 CODE:
1024#if defined(__GLIBC__) || _POSIX_C_SOURCE
1025 _exit (code); 984 _exit (code);
1026#else
1027 signal (SIGTERM, SIG_DFL);
1028 raise (SIGTERM);
1029 exit (code);
1030#endif
1031 985
1032MODULE = Coro::State PACKAGE = Coro::Cont 986MODULE = Coro::State PACKAGE = Coro::Cont
1033 987
1034# this is slightly dirty (should expose a c-level api) 988# this is slightly dirty (should expose a c-level api)
1035 989
1036void 990void
1037yield(...) 991yield(...)
1038 PROTOTYPE: @ 992 PROTOTYPE: @
1039 CODE: 993 CODE:
1040 static SV *returnstk; 994 SV *yieldstack;
1041 SV *sv; 995 SV *sv;
1042 AV *defav = GvAV (PL_defgv); 996 AV *defav = GvAV (PL_defgv);
1043 struct coro *prev, *next; 997 struct coro *prev, *next;
1044 998
1045 if (!returnstk) 999 yieldstack = *hv_fetch (
1046 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); 1000 (HV *)SvRV (GvSV (coro_current)),
1001 "yieldstack", sizeof ("yieldstack") - 1,
1002 0
1003 );
1047 1004
1048 /* set up @_ -- ugly */ 1005 /* set up @_ -- ugly */
1049 av_clear (defav); 1006 av_clear (defav);
1050 av_fill (defav, items - 1); 1007 av_fill (defav, items - 1);
1051 while (items--) 1008 while (items--)
1052 av_store (defav, items, SvREFCNT_inc (ST(items))); 1009 av_store (defav, items, SvREFCNT_inc (ST(items)));
1053 1010
1054 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1055 sv = av_pop ((AV *)SvRV (returnstk)); 1011 sv = av_pop ((AV *)SvRV (yieldstack));
1056 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))));
1057 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))));
1058 SvREFCNT_dec (sv); 1014 SvREFCNT_dec (sv);
1059 1015
1060 transfer(aTHX_ prev, next, 0); 1016 transfer (aTHX_ prev, next, 0);
1061 1017
1062MODULE = Coro::State PACKAGE = Coro 1018MODULE = Coro::State PACKAGE = Coro
1063 1019
1064# this is slightly dirty (should expose a c-level api) 1020# this is slightly dirty (should expose a c-level api)
1065 1021
… …
1094 sv_setiv(sv, (IV)&coroapi); 1050 sv_setiv(sv, (IV)&coroapi);
1095 SvREADONLY_on(sv); 1051 SvREADONLY_on(sv);
1096 } 1052 }
1097} 1053}
1098 1054
1055#if !PERL_MICRO
1056
1099void 1057void
1100ready(self) 1058ready(self)
1101 SV * self 1059 SV * self
1102 PROTOTYPE: $ 1060 PROTOTYPE: $
1103 CODE: 1061 CODE:
1104 api_ready (self); 1062 api_ready (self);
1063
1064#endif
1105 1065
1106int 1066int
1107nready(...) 1067nready(...)
1108 PROTOTYPE: 1068 PROTOTYPE:
1109 CODE: 1069 CODE:
… …
1121cede(...) 1081cede(...)
1122 PROTOTYPE: 1082 PROTOTYPE:
1123 CODE: 1083 CODE:
1124 api_cede (); 1084 api_cede ();
1125 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