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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines