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