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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines