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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines