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.48 by pcg, Sat Nov 15 03:53:37 2003 UTC vs.
Revision 1.99 by root, Sun Nov 26 23:53:20 2006 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines