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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines