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

Diff Legend

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