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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines