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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines