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.51 by pcg, Sun Nov 30 17:03:48 2003 UTC vs.
Revision 1.92 by root, Sun Nov 26 02:16:19 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines