ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines