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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines