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.25 by root, Wed Aug 15 03:24:07 2001 UTC vs.
Revision 1.81 by root, Fri Nov 3 00:56:03 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 */
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 delcare 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 */
66 AV *curstack; 121 AV *curstack;
67 AV *mainstack; 122 AV *mainstack;
68 SV **stack_sp; 123 SV **stack_sp;
69 OP *op; 124 OP *op;
70 SV **curpad; 125 SV **curpad;
126 AV *comppad;
127 CV *compcv;
71 SV **stack_base; 128 SV **stack_base;
72 SV **stack_max; 129 SV **stack_max;
73 SV **tmps_stack; 130 SV **tmps_stack;
74 I32 tmps_floor; 131 I32 tmps_floor;
75 I32 tmps_ix; 132 I32 tmps_ix;
84 I32 savestack_ix; 141 I32 savestack_ix;
85 I32 savestack_max; 142 I32 savestack_max;
86 OP **retstack; 143 OP **retstack;
87 I32 retstack_ix; 144 I32 retstack_ix;
88 I32 retstack_max; 145 I32 retstack_max;
146 PMOP *curpm;
89 COP *curcop; 147 COP *curcop;
90 JMPENV *top_env; 148 JMPENV *top_env;
91 149
92 /* data associated with this coroutine (initial args) */ 150 /* data associated with this coroutine (initial args) */
93 AV *args; 151 AV *args;
94}; 152};
95 153
96typedef struct coro *Coro__State; 154typedef struct coro *Coro__State;
97typedef struct coro *Coro__State_or_hashref; 155typedef struct coro *Coro__State_or_hashref;
98 156
99static AV *main_mainstack; /* used to differentiate between $main and others */ 157static AV *
100static HV *coro_state_stash; 158coro_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{ 159{
109 AV *av; 160 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; 161 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 162
128 newpadlist = newAV (); 163 newpadlist = newAV ();
129 AvREAL_off (newpadlist); 164 AvREAL_off (newpadlist);
130 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)));
131 av_store (newpadlist, 1, (SV *) newpad); 174 av_store (newpadlist, 1, (SV *)newpad);
132 175
133 av = newAV (); /* will be @_ */ 176 return newpadlist;
134 av_extend (av, 0); 177}
135 av_store (newpad, 0, (SV *) av);
136 AvFLAGS (av) = AVf_REIFY;
137 178
138 for (ix = fpad; ix > 0; ix--) 179static void
180free_padlist (pTHX_ AV *padlist)
181{
182 /* may be during global destruction */
183 if (SvREFCNT (padlist))
139 { 184 {
140 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 185 I32 i = AvFILLp (padlist);
141 if (namesv && namesv != &PL_sv_undef) 186 while (i >= 0)
142 { 187 {
143 char *name = SvPVX (namesv); /* XXX */ 188 SV **svp = av_fetch (padlist, i--, FALSE);
144 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 189 if (svp)
145 { /* lexical from outside? */
146 npad[ix] = SvREFCNT_inc (ppad[ix]);
147 } 190 {
148 else
149 { /* our own lexical */
150 SV *sv; 191 SV *sv;
151 if (*name == '&') 192 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
152 sv = SvREFCNT_inc (ppad[ix]); 193 SvREFCNT_dec (sv);
153 else if (*name == '@') 194
154 sv = (SV *) newAV (); 195 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 } 196 }
163 } 197 }
164 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 198
165 { 199 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 } 200 }
201}
175 202
176#if 0 /* return -ENOTUNDERSTOOD */ 203static int
177 /* 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;
178 208
179 for (ix = fpad; ix > 0; ix--) { 209 /* casting is fun. */
180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 210 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
181 if (namesv 211 free_padlist (aTHX_ padlist);
182 && namesv != &PL_sv_undef 212
183 && !(SvFLAGS(namesv) & SVf_FAKE) 213 SvREFCNT_dec (av);
184 && *SvPVX(namesv) == '&' 214
185 && CvCLONE(ppad[ix])) 215 return 0;
186 { 216}
187 CV *kid = cv_clone((CV*)ppad[ix]); 217
188 SvREFCNT_dec(ppad[ix]); 218#define PERL_MAGIC_coro PERL_MAGIC_ext
189 CvCLONE_on(kid); 219
190 SvPADMY_on(kid); 220static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
191 npad[ix] = (SV*)kid; 221
192 } 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 ();
193 } 255 }
194#endif
195 256
196 return newpadlist;
197}
198
199#ifdef MAY_FLUSH
200STATIC AV *
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)); 257 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
244} 258}
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 259
272#define SB do { 260#define SB do {
273#define SE } while (0) 261#define SE } while (0)
274 262
275#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 263#define LOAD(state) load_state(aTHX_ (state));
276#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 264#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
277 265
278#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
279 267
280static void 268static void
281load_state(pTHX_ Coro__State c) 269load_state(pTHX_ Coro__State c)
282{ 270{
283 PL_dowarn = c->dowarn; 271 PL_dowarn = c->dowarn;
287 PL_curstack = c->curstack; 275 PL_curstack = c->curstack;
288 PL_mainstack = c->mainstack; 276 PL_mainstack = c->mainstack;
289 PL_stack_sp = c->stack_sp; 277 PL_stack_sp = c->stack_sp;
290 PL_op = c->op; 278 PL_op = c->op;
291 PL_curpad = c->curpad; 279 PL_curpad = c->curpad;
280 PL_comppad = c->comppad;
281 PL_compcv = c->compcv;
292 PL_stack_base = c->stack_base; 282 PL_stack_base = c->stack_base;
293 PL_stack_max = c->stack_max; 283 PL_stack_max = c->stack_max;
294 PL_tmps_stack = c->tmps_stack; 284 PL_tmps_stack = c->tmps_stack;
295 PL_tmps_floor = c->tmps_floor; 285 PL_tmps_floor = c->tmps_floor;
296 PL_tmps_ix = c->tmps_ix; 286 PL_tmps_ix = c->tmps_ix;
302 PL_scopestack_ix = c->scopestack_ix; 292 PL_scopestack_ix = c->scopestack_ix;
303 PL_scopestack_max = c->scopestack_max; 293 PL_scopestack_max = c->scopestack_max;
304 PL_savestack = c->savestack; 294 PL_savestack = c->savestack;
305 PL_savestack_ix = c->savestack_ix; 295 PL_savestack_ix = c->savestack_ix;
306 PL_savestack_max = c->savestack_max; 296 PL_savestack_max = c->savestack_max;
297#if PERL_VERSION < 9
307 PL_retstack = c->retstack; 298 PL_retstack = c->retstack;
308 PL_retstack_ix = c->retstack_ix; 299 PL_retstack_ix = c->retstack_ix;
309 PL_retstack_max = c->retstack_max; 300 PL_retstack_max = c->retstack_max;
301#endif
302 PL_curpm = c->curpm;
310 PL_curcop = c->curcop; 303 PL_curcop = c->curcop;
311 PL_top_env = c->top_env; 304 PL_top_env = c->top_env;
312 305
313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 306 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 307 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
323 { 316 {
324 AV *padlist = (AV *)POPs; 317 AV *padlist = (AV *)POPs;
325 318
326 if (padlist) 319 if (padlist)
327 { 320 {
328 put_padlist (cv); /* mark this padlist as available */ 321 put_padlist (aTHX_ cv); /* mark this padlist as available */
329 CvPADLIST(cv) = padlist; 322 CvPADLIST(cv) = padlist;
330#ifdef USE_THREADS
331 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332#endif
333 } 323 }
334 324
335 ++CvDEPTH(cv); 325 ++CvDEPTH(cv);
336 } 326 }
337 327
355 345
356 PUSHs (Nullsv); 346 PUSHs (Nullsv);
357 /* this loop was inspired by pp_caller */ 347 /* this loop was inspired by pp_caller */
358 for (;;) 348 for (;;)
359 { 349 {
360 do 350 while (cxix >= 0)
361 { 351 {
362 PERL_CONTEXT *cx = &ccstk[cxix--]; 352 PERL_CONTEXT *cx = &ccstk[cxix--];
363 353
364 if (CxTYPE(cx) == CXt_SUB) 354 if (CxTYPE(cx) == CXt_SUB)
365 { 355 {
366 CV *cv = cx->blk_sub.cv; 356 CV *cv = cx->blk_sub.cv;
367 if (CvDEPTH(cv)) 357 if (CvDEPTH(cv))
368 { 358 {
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); 359 EXTEND (SP, CvDEPTH(cv)*2);
375 360
376 while (--CvDEPTH(cv)) 361 while (--CvDEPTH(cv))
377 { 362 {
378 /* this tells the restore code to increment CvDEPTH */ 363 /* this tells the restore code to increment CvDEPTH */
381 } 366 }
382 367
383 PUSHs ((SV *)CvPADLIST(cv)); 368 PUSHs ((SV *)CvPADLIST(cv));
384 PUSHs ((SV *)cv); 369 PUSHs ((SV *)cv);
385 370
386 get_padlist (cv); /* this is a monster */ 371 get_padlist (aTHX_ cv);
387 } 372 }
388 } 373 }
374#ifdef CXt_FORMAT
389 else if (CxTYPE(cx) == CXt_FORMAT) 375 else if (CxTYPE(cx) == CXt_FORMAT)
390 { 376 {
391 /* 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? */
392 /* my bold guess is as a simple, plain sub... */ 378 /* my bold guess is as a simple, plain sub... */
393 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");
394 } 380 }
381#endif
395 } 382 }
396 while (cxix >= 0);
397 383
398 if (top_si->si_type == PERLSI_MAIN) 384 if (top_si->si_type == PERLSI_MAIN)
399 break; 385 break;
400 386
401 top_si = top_si->si_prev; 387 top_si = top_si->si_prev;
407 } 393 }
408 394
409 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 395 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 396 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 397 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
412
413 /* I have not the slightest idea of why av_reify is necessary */
414 /* but if it's missing the defav contents magically get replaced sometimes */
415 if (c->defav)
416 av_reify (c->defav);
417 398
418 c->dowarn = PL_dowarn; 399 c->dowarn = PL_dowarn;
419 c->in_eval = PL_in_eval; 400 c->in_eval = PL_in_eval;
420 401
421 c->curstackinfo = PL_curstackinfo; 402 c->curstackinfo = PL_curstackinfo;
422 c->curstack = PL_curstack; 403 c->curstack = PL_curstack;
423 c->mainstack = PL_mainstack; 404 c->mainstack = PL_mainstack;
424 c->stack_sp = PL_stack_sp; 405 c->stack_sp = PL_stack_sp;
425 c->op = PL_op; 406 c->op = PL_op;
426 c->curpad = PL_curpad; 407 c->curpad = PL_curpad;
408 c->comppad = PL_comppad;
409 c->compcv = PL_compcv;
427 c->stack_base = PL_stack_base; 410 c->stack_base = PL_stack_base;
428 c->stack_max = PL_stack_max; 411 c->stack_max = PL_stack_max;
429 c->tmps_stack = PL_tmps_stack; 412 c->tmps_stack = PL_tmps_stack;
430 c->tmps_floor = PL_tmps_floor; 413 c->tmps_floor = PL_tmps_floor;
431 c->tmps_ix = PL_tmps_ix; 414 c->tmps_ix = PL_tmps_ix;
437 c->scopestack_ix = PL_scopestack_ix; 420 c->scopestack_ix = PL_scopestack_ix;
438 c->scopestack_max = PL_scopestack_max; 421 c->scopestack_max = PL_scopestack_max;
439 c->savestack = PL_savestack; 422 c->savestack = PL_savestack;
440 c->savestack_ix = PL_savestack_ix; 423 c->savestack_ix = PL_savestack_ix;
441 c->savestack_max = PL_savestack_max; 424 c->savestack_max = PL_savestack_max;
425#if PERL_VERSION < 9
442 c->retstack = PL_retstack; 426 c->retstack = PL_retstack;
443 c->retstack_ix = PL_retstack_ix; 427 c->retstack_ix = PL_retstack_ix;
444 c->retstack_max = PL_retstack_max; 428 c->retstack_max = PL_retstack_max;
429#endif
430 c->curpm = PL_curpm;
445 c->curcop = PL_curcop; 431 c->curcop = PL_curcop;
446 c->top_env = PL_top_env; 432 c->top_env = PL_top_env;
447} 433}
448 434
449/* 435/*
450 * allocate various perl stacks. This is an exact copy 436 * allocate various perl stacks. This is an exact copy
451 * of perl.c:init_stacks, except that it uses less memory 437 * of perl.c:init_stacks, except that it uses less memory
452 * on the assumption that coroutines do not usually need 438 * on the (sometimes correct) assumption that coroutines do
453 * a lot of stackspace. 439 * not usually need a lot of stackspace.
454 */ 440 */
455STATIC void 441static void
456coro_init_stacks (pTHX) 442coro_init_stacks (pTHX)
457{ 443{
444 LOCK;
445
458 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 446 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
459 PL_curstackinfo->si_type = PERLSI_MAIN; 447 PL_curstackinfo->si_type = PERLSI_MAIN;
460 PL_curstack = PL_curstackinfo->si_stack; 448 PL_curstack = PL_curstackinfo->si_stack;
461 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 449 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462 450
471 459
472 New(54,PL_markstack,16,I32); 460 New(54,PL_markstack,16,I32);
473 PL_markstack_ptr = PL_markstack; 461 PL_markstack_ptr = PL_markstack;
474 PL_markstack_max = PL_markstack + 16; 462 PL_markstack_max = PL_markstack + 16;
475 463
464#ifdef SET_MARK_OFFSET
476 SET_MARK_OFFSET; 465 SET_MARK_OFFSET;
466#endif
477 467
478 New(54,PL_scopestack,16,I32); 468 New(54,PL_scopestack,16,I32);
479 PL_scopestack_ix = 0; 469 PL_scopestack_ix = 0;
480 PL_scopestack_max = 16; 470 PL_scopestack_max = 16;
481 471
482 New(54,PL_savestack,96,ANY); 472 New(54,PL_savestack,96,ANY);
483 PL_savestack_ix = 0; 473 PL_savestack_ix = 0;
484 PL_savestack_max = 96; 474 PL_savestack_max = 96;
485 475
476#if PERL_VERSION < 9
486 New(54,PL_retstack,8,OP*); 477 New(54,PL_retstack,8,OP*);
487 PL_retstack_ix = 0; 478 PL_retstack_ix = 0;
488 PL_retstack_max = 8; 479 PL_retstack_max = 8;
480#endif
481
482 UNLOCK;
489} 483}
490 484
491/* 485/*
492 * destroy the stacks, the callchain etc... 486 * destroy the stacks, the callchain etc...
493 * still there is a memleak of 128 bytes...
494 */ 487 */
495STATIC void 488static void
496destroy_stacks(pTHX) 489destroy_stacks(pTHX)
497{ 490{
491 if (!IN_DESTRUCT)
492 {
498 /* is this ugly, I ask? */ 493 /* is this ugly, I ask? */
499 while (PL_scopestack_ix) 494 LEAVE_SCOPE (0);
500 LEAVE;
501 495
502 /* sure it is, but more important: is it correct?? :/ */ 496 /* sure it is, but more important: is it correct?? :/ */
503 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504 FREETMPS; 497 FREETMPS;
498
499 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
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 (PL_main_cv != Nullcv) /* don't during destruction. hack? */ 515 if (!IN_DESTRUCT)
520 dounwind(-1); 516 {
521 517 dounwind (-1);/*D*//*remove*/
522 SvREFCNT_dec(PL_curstackinfo->si_stack); 518 SvREFCNT_dec (PL_curstackinfo->si_stack);
519 }
520
523 Safefree(PL_curstackinfo->si_cxstack); 521 Safefree (PL_curstackinfo->si_cxstack);
524 Safefree(PL_curstackinfo); 522 Safefree (PL_curstackinfo);
525 PL_curstackinfo = p; 523 PL_curstackinfo = p;
526 } 524 }
527 525
528 Safefree(PL_tmps_stack); 526 Safefree (PL_tmps_stack);
529 Safefree(PL_markstack); 527 Safefree (PL_markstack);
530 Safefree(PL_scopestack); 528 Safefree (PL_scopestack);
531 Safefree(PL_savestack); 529 Safefree (PL_savestack);
530#if PERL_VERSION < 9
532 Safefree(PL_retstack); 531 Safefree (PL_retstack);
532#endif
533} 533}
534 534
535static void 535static void
536allocate_stack (Coro__State ctx, int alloc) 536allocate_stack (Coro__State ctx, int alloc)
537{ 537{
540 New (0, stack, 1, coro_stack); 540 New (0, stack, 1, coro_stack);
541 541
542 stack->refcnt = 1; 542 stack->refcnt = 1;
543 stack->usecnt = 1; 543 stack->usecnt = 1;
544 stack->gencnt = ctx->gencnt = 0; 544 stack->gencnt = ctx->gencnt = 0;
545
545 if (alloc) 546 if (alloc)
546 { 547 {
547#ifdef HAVE_MMAP 548#if HAVE_MMAP
548 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 */
549 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); 550 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
550 if (stack->sptr == (void *)-1) 551 if (stack->sptr != (void *)-1)
551#endif
552 { 552 {
553 /*FIXME*//*D*//* reasonable stack size! */ 553# if STACKGUARD
554 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
555# endif
556 }
557 else
558#endif
559 {
554 stack->ssize = -4096 * sizeof (long); 560 stack->ssize = - (STACKSIZE * (long)sizeof (long));
555 New (0, stack->sptr, 4096, long); 561 New (0, stack->sptr, STACKSIZE, long);
556 } 562 }
557 } 563 }
558 else 564 else
559 stack->sptr = 0; 565 stack->sptr = 0;
560 566
574 { 580 {
575#ifdef HAVE_MMAP 581#ifdef HAVE_MMAP
576 if (stack->ssize > 0 && stack->sptr) 582 if (stack->ssize > 0 && stack->sptr)
577 munmap (stack->sptr, stack->ssize); 583 munmap (stack->sptr, stack->ssize);
578 else 584 else
579#else 585#endif
580 Safefree (stack->sptr); 586 Safefree (stack->sptr);
581#endif 587
582 Safefree (stack); 588 Safefree (stack);
583 } 589 }
584 else if (ctx->gencnt == stack->gencnt) 590 else if (ctx->gencnt == stack->gencnt)
585 --stack->usecnt; 591 --stack->usecnt;
586 } 592 }
590setup_coro (void *arg) 596setup_coro (void *arg)
591{ 597{
592 /* 598 /*
593 * emulate part of the perl startup here. 599 * emulate part of the perl startup here.
594 */ 600 */
601 dTHX;
595 dSP; 602 dSP;
596 Coro__State ctx = (Coro__State)arg; 603 Coro__State ctx = (Coro__State)arg;
597 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 604 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
598 605
599 coro_init_stacks (aTHX); 606 coro_init_stacks (aTHX);
600 /*PL_curcop = 0;*/ 607 /*PL_curcop = 0;*/
601 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 608 /*PL_in_eval = PL_in_eval;*/ /* inherit */
602 SvREFCNT_dec (GvAV (PL_defgv)); 609 SvREFCNT_dec (GvAV (PL_defgv));
603 GvAV (PL_defgv) = ctx->args; 610 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
604 611
605 SPAGAIN; 612 SPAGAIN;
606 613
607 if (ctx->stack) 614 if (ctx->stack)
608 { 615 {
619 } 626 }
620 else 627 else
621 { 628 {
622 UNOP myop; 629 UNOP myop;
623 630
624 PL_op = (OP *)&myop;
625
626 Zero(&myop, 1, UNOP); 631 Zero(&myop, 1, UNOP);
627 myop.op_next = Nullop; 632 myop.op_next = Nullop;
628 myop.op_flags = OPf_WANT_VOID; 633 myop.op_flags = OPf_WANT_VOID;
634
635 PL_op = (OP *)&myop;
629 636
630 PUSHMARK(SP); 637 PUSHMARK(SP);
631 XPUSHs (sub_init); 638 XPUSHs (sub_init);
632 /* 639 /*
633 * the next line is slightly wrong, as PL_op->op_next 640 * the next line is slightly wrong, as PL_op->op_next
635 * that doesn't matter, though, since it is only 642 * that doesn't matter, though, since it is only
636 * pp_nextstate and we never return... 643 * pp_nextstate and we never return...
637 * ah yes, and I don't care anyways ;) 644 * ah yes, and I don't care anyways ;)
638 */ 645 */
639 PUTBACK; 646 PUTBACK;
640 PL_op = pp_entersub(); 647 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
641 SPAGAIN; 648 SPAGAIN;
642 649
643 ENTER; /* necessary e.g. for dounwind */ 650 ENTER; /* necessary e.g. for dounwind */
644 } 651 }
645} 652}
648continue_coro (void *arg) 655continue_coro (void *arg)
649{ 656{
650 /* 657 /*
651 * this is a _very_ stripped down perl interpreter ;) 658 * this is a _very_ stripped down perl interpreter ;)
652 */ 659 */
660 dTHX;
653 Coro__State ctx = (Coro__State)arg; 661 Coro__State ctx = (Coro__State)arg;
654 662
655 /*FIXME*//* must set up top_env here */ 663 PL_top_env = &PL_start_env;
664
656 ctx->cursp = 0; 665 ctx->cursp = 0;
657 PL_op = PL_op->op_next; 666 PL_op = PL_op->op_next;
658 CALLRUNOPS(aTHX); 667 CALLRUNOPS(aTHX);
659 668
660 abort (); 669 abort ();
661} 670}
662 671
663STATIC void 672static void
664transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 673transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
665{ 674{
666 dSP;
667 dSTACKLEVEL; 675 dSTACKLEVEL;
668 676
669 if (prev != next) 677 if (prev != next)
670 { 678 {
679 /* has this coro been created yet? */
671 if (next->mainstack) 680 if (next->mainstack)
672 { 681 {
682 LOCK;
673 SAVE (prev, flags); 683 SAVE (prev, flags);
674 LOAD (next); 684 LOAD (next);
685 UNLOCK;
675 686
676 /* mark this state as in-use */ 687 /* mark this state as in-use */
677 next->mainstack = 0; 688 next->mainstack = 0;
678 next->tmps_ix = -2; 689 next->tmps_ix = -2;
679 690
698 continue_coro, (void *)next, 709 continue_coro, (void *)next,
699 next->stack->sptr, labs (next->stack->ssize)); 710 next->stack->sptr, labs (next->stack->ssize));
700 } 711 }
701 712
702 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 713 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
714 prev->cursp = stacklevel;
715 /* don't add any code here */
703 } 716 }
704 717 else
718 next->cursp = stacklevel;
705 } 719 }
706 else if (next->tmps_ix == -2) 720 else if (next->tmps_ix == -2)
707 croak ("tried to transfer to running coroutine"); 721 croak ("tried to transfer to running coroutine");
708 else 722 else
709 { 723 {
724 LOCK;
710 SAVE (prev, -1); /* first get rid of the old state */ 725 SAVE (prev, -1); /* first get rid of the old state */
726 UNLOCK;
711 727
728 /* create the coroutine for the first time */
712 if (flags & TRANSFER_SAVE_CCTXT) 729 if (flags & TRANSFER_SAVE_CCTXT)
713 { 730 {
714 if (!prev->stack) 731 if (!prev->stack)
715 allocate_stack (prev, 0); 732 allocate_stack (prev, 0);
716 733
734 /* the new coroutine starts with start_env again */
735 PL_top_env = &PL_start_env;
736
717 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 737 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
718 { 738 {
719 setup_coro (next); 739 setup_coro (next);
740 next->cursp = stacklevel;
720 741
721 prev->stack->refcnt++; 742 prev->stack->refcnt++;
722 prev->stack->usecnt++; 743 prev->stack->usecnt++;
723 next->stack = prev->stack; 744 next->stack = prev->stack;
724 next->gencnt = prev->gencnt; 745 next->gencnt = prev->gencnt;
725 } 746 }
726 else 747 else
727 { 748 {
749 assert (!next->stack);
728 allocate_stack (next, 1); 750 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx), 751 coro_create (&(next->stack->cctx),
730 setup_coro, (void *)next, 752 setup_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize)); 753 next->stack->sptr, labs (next->stack->ssize));
732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 754 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
755 prev->cursp = stacklevel;
756 /* don't add any code here */
733 } 757 }
734 } 758 }
735 else 759 else
760 {
736 setup_coro (next); 761 setup_coro (next);
762 next->cursp = stacklevel;
763 }
737 } 764 }
738 } 765 }
739 766
740 next->cursp = stacklevel; 767 LOCK;
741} 768 if (coro_mortal)
742
743static struct coro *
744sv_to_coro (SV *arg, const char *funcname, const char *varname)
745{
746 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
747 { 769 {
748 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); 770 SvREFCNT_dec (coro_mortal);
749 771 coro_mortal = 0;
750 if (!he)
751 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
752
753 arg = HeVAL(he);
754 } 772 }
755 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 \
756 /* must also be changed inside Coro::Cont::yield */ 791 /* must also be changed inside Coro::Cont::yield */ \
757 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash) 792 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
758 return (struct coro *) SvIV((SV*)SvRV(arg));
759 else
760 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); \
761} 794 \
795 } while(0)
796
797#define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv))
762 798
763static void 799static void
764api_transfer(pTHX_ SV *prev, SV *next, int flags) 800api_transfer(pTHX_ SV *prev, SV *next, int flags)
765{ 801{
766 transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"), 802 SV_CORO (prev, "Coro::transfer");
767 sv_to_coro (next, "Coro::transfer", "next"), 803 SV_CORO (next, "Coro::transfer");
768 flags); 804
805 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
769} 806}
770 807
771/** Coro ********************************************************************/ 808/** Coro ********************************************************************/
772 809
773#define PRIO_MAX 3 810#define PRIO_MAX 3
781static GV *coro_current, *coro_idle; 818static GV *coro_current, *coro_idle;
782static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 819static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
783static int coro_nready; 820static int coro_nready;
784 821
785static void 822static void
786coro_enq (SV *sv) 823coro_enq (pTHX_ SV *sv)
787{ 824{
788 if (SvROK (sv)) 825 SV **xprio;
789 { 826 int prio;
790 SV *hv = SvRV (sv); 827
791 if (SvTYPE (hv) == SVt_PVHV) 828 if (SvTYPE (sv) != SVt_PVHV)
792 {
793 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
794 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
795
796 prio = prio > PRIO_MAX ? PRIO_MAX
797 : prio < PRIO_MIN ? PRIO_MIN
798 : prio;
799
800 av_push (coro_ready [prio - PRIO_MIN], sv);
801 coro_nready++;
802
803 return;
804 }
805 }
806
807 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++;
808} 840}
809 841
810static SV * 842static SV *
811coro_deq (int min_prio) 843coro_deq (pTHX_ int min_prio)
812{ 844{
813 int prio = PRIO_MAX - PRIO_MIN; 845 int prio = PRIO_MAX - PRIO_MIN;
814 846
815 min_prio -= PRIO_MIN; 847 min_prio -= PRIO_MIN;
816 if (min_prio < 0) 848 if (min_prio < 0)
827} 859}
828 860
829static void 861static void
830api_ready (SV *coro) 862api_ready (SV *coro)
831{ 863{
864 dTHX;
865
866 if (SvROK (coro))
867 coro = SvRV (coro);
868
869 LOCK;
832 coro_enq (SvREFCNT_inc (coro)); 870 coro_enq (aTHX_ SvREFCNT_inc (coro));
871 UNLOCK;
833} 872}
834 873
835static void 874static void
836api_schedule (int cede) 875api_schedule (void)
837{ 876{
877 dTHX;
878
838 SV *prev, *next; 879 SV *prev, *next;
839 880
881 LOCK;
882
840 prev = GvSV (coro_current); 883 prev = SvRV (GvSV (coro_current));
841
842 if (cede)
843 coro_enq (SvREFCNT_inc (prev));
844
845 next = coro_deq (PRIO_MIN); 884 next = coro_deq (aTHX_ PRIO_MIN);
846 885
847 if (!next) 886 if (!next)
848 next = SvREFCNT_inc (GvSV (coro_idle)); 887 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
849 888
850 GvSV (coro_current) = SvREFCNT_inc (next); 889 /* free this only after the transfer */
851 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), 890 coro_mortal = prev;
852 sv_to_coro (next, "Coro::schedule", "next coroutine"), 891 SV_CORO (prev, "Coro::schedule");
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),
853 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 900 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
854 SvREFCNT_dec (next); 901}
855 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 ();
856} 913}
857 914
858MODULE = Coro::State PACKAGE = Coro::State 915MODULE = Coro::State PACKAGE = Coro::State
859 916
860PROTOTYPES: ENABLE 917PROTOTYPES: ENABLE
861 918
862BOOT: 919BOOT:
863{ /* {} 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
864 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 926 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
865 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 927 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
866 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 928 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
867 929
868 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 930 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
869 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 931 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
870 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 932 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
871 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 933 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
872 934
873 if (!padlist_cache)
874 padlist_cache = newHV ();
875
876 main_mainstack = PL_mainstack; 935 main_mainstack = PL_mainstack;
877 936
878 {
879 SV *sv = perl_get_sv("Coro::API", 1);
880
881 coroapi.ver = CORO_API_VERSION - 1; 937 coroapi.ver = CORO_API_VERSION;
882 coroapi.transfer = api_transfer; 938 coroapi.transfer = api_transfer;
883 coroapi.schedule = api_schedule;
884 coroapi.ready = api_ready;
885 coroapi.nready = &coro_nready;
886
887 GCoroAPI = &coroapi;
888 sv_setiv(sv, (IV)&coroapi);
889 SvREADONLY_on(sv);
890 }
891} 939}
892 940
893Coro::State 941Coro::State
894_newprocess(args) 942_newprocess(args)
895 SV * args 943 SV * args
898 Coro__State coro; 946 Coro__State coro;
899 947
900 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 948 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
901 croak ("Coro::State::_newprocess expects an arrayref"); 949 croak ("Coro::State::_newprocess expects an arrayref");
902 950
903 New (0, coro, 1, struct coro); 951 Newz (0, coro, 1, struct coro);
904 952
905 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 953 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
906 coro->mainstack = 0; /* actual work is done inside transfer */ 954 /*coro->mainstack = 0; *//*actual work is done inside transfer */
907 coro->stack = 0; 955 /*coro->stack = 0;*/
908 956
909 RETVAL = coro; 957 RETVAL = coro;
910 OUTPUT: 958 OUTPUT:
911 RETVAL 959 RETVAL
912 960
913void 961void
914transfer(prev, next, flags) 962transfer(prev, next, flags)
915 Coro::State_or_hashref prev 963 SV *prev
916 Coro::State_or_hashref next 964 SV *next
917 int flags 965 int flags
918 PROTOTYPE: @ 966 PROTOTYPE: @
919 CODE: 967 CODE:
920 PUTBACK; 968 PUTBACK;
969 SV_CORO (next, "Coro::transfer");
970 SV_CORO (prev, "Coro::transfer");
921 transfer (aTHX_ prev, next, flags); 971 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
922 SPAGAIN; 972 SPAGAIN;
923 973
924void 974void
925DESTROY(coro) 975DESTROY(coro)
926 Coro::State coro 976 Coro::State coro
928 978
929 if (coro->mainstack && coro->mainstack != main_mainstack) 979 if (coro->mainstack && coro->mainstack != main_mainstack)
930 { 980 {
931 struct coro temp; 981 struct coro temp;
932 982
983 PUTBACK;
933 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 984 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
934 LOAD(aTHX_ coro); 985 LOAD (aTHX_ coro);
986 SPAGAIN;
935 987
936 destroy_stacks (aTHX); 988 destroy_stacks (aTHX);
937 989
938 LOAD((&temp)); /* this will get rid of defsv etc.. */ 990 LOAD ((&temp)); /* this will get rid of defsv etc.. */
991 SPAGAIN;
939 992
940 coro->mainstack = 0; 993 coro->mainstack = 0;
941 } 994 }
942 995
943 deallocate_stack (coro); 996 deallocate_stack (coro);
944 997 SvREFCNT_dec (coro->args);
945 Safefree (coro); 998 Safefree (coro);
946
947void
948flush()
949 CODE:
950#ifdef MAY_FLUSH
951 flush_padlist_cache ();
952#endif
953 999
954void 1000void
955_exit(code) 1001_exit(code)
956 int code 1002 int code
957 PROTOTYPE: $ 1003 PROTOTYPE: $
958 CODE: 1004 CODE:
959#if defined(__GLIBC__) || _POSIX_C_SOURCE
960 _exit (code); 1005 _exit (code);
961#else
962 signal (SIGTERM, SIG_DFL);
963 raise (SIGTERM);
964 exit (code);
965#endif
966 1006
967MODULE = Coro::State PACKAGE = Coro::Cont 1007MODULE = Coro::State PACKAGE = Coro::Cont
968
969# this is slightly dirty (should expose a c-level api)
970 1008
971void 1009void
972yield(...) 1010yield(...)
973 PROTOTYPE: @ 1011 PROTOTYPE: @
974 CODE: 1012 CODE:
975 static SV *returnstk; 1013 SV *yieldstack;
976 SV *sv; 1014 SV *sv;
977 AV *defav = GvAV (PL_defgv); 1015 AV *defav = GvAV (PL_defgv);
978 struct coro *prev, *next; 1016 struct coro *prev, *next;
979 1017
980 if (!returnstk) 1018 yieldstack = *hv_fetch (
981 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1019 (HV *)SvRV (GvSV (coro_current)),
1020 "yieldstack", sizeof ("yieldstack") - 1,
1021 0
1022 );
982 1023
983 /* set up @_ -- ugly */ 1024 /* set up @_ -- ugly */
984 av_clear (defav); 1025 av_clear (defav);
985 av_fill (defav, items - 1); 1026 av_fill (defav, items - 1);
986 while (items--) 1027 while (items--)
987 av_store (defav, items, SvREFCNT_inc (ST(items))); 1028 av_store (defav, items, SvREFCNT_inc (ST(items)));
988 1029
989 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
990 sv = av_pop ((AV *)SvRV (returnstk)); 1030 sv = av_pop ((AV *)SvRV (yieldstack));
991 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))));
992 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))));
993 SvREFCNT_dec (sv); 1033 SvREFCNT_dec (sv);
994 1034
995 transfer(aTHX_ prev, next, 0); 1035 transfer (aTHX_ prev, next, 0);
996 1036
997MODULE = Coro::State PACKAGE = Coro 1037MODULE = Coro::State PACKAGE = Coro
998
999# this is slightly dirty (should expose a c-level api)
1000 1038
1001BOOT: 1039BOOT:
1002{ 1040{
1003 int i; 1041 int i;
1004 HV *stash = gv_stashpv ("Coro", TRUE); 1042 HV *stash = gv_stashpv ("Coro", TRUE);
1013 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1051 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1014 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1052 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1015 1053
1016 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1054 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1017 coro_ready[i] = newAV (); 1055 coro_ready[i] = newAV ();
1056
1057 {
1058 SV *sv = perl_get_sv("Coro::API", 1);
1059
1060 coroapi.schedule = api_schedule;
1061 coroapi.cede = api_cede;
1062 coroapi.ready = api_ready;
1063 coroapi.nready = &coro_nready;
1064 coroapi.current = coro_current;
1065
1066 GCoroAPI = &coroapi;
1067 sv_setiv (sv, (IV)&coroapi);
1068 SvREADONLY_on (sv);
1069 }
1018} 1070}
1071
1072#if !PERL_MICRO
1019 1073
1020void 1074void
1021ready(self) 1075ready(self)
1022 SV * self 1076 SV * self
1077 PROTOTYPE: $
1023 CODE: 1078 CODE:
1024 api_ready (self); 1079 api_ready (self);
1080
1081#endif
1025 1082
1026int 1083int
1027nready(...) 1084nready(...)
1028 PROTOTYPE: 1085 PROTOTYPE:
1029 CODE: 1086 CODE:
1032 RETVAL 1089 RETVAL
1033 1090
1034void 1091void
1035schedule(...) 1092schedule(...)
1036 PROTOTYPE: 1093 PROTOTYPE:
1037 ALIAS:
1038 cede = 1
1039 CODE: 1094 CODE:
1040 api_schedule (ix); 1095 api_schedule ();
1041 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