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.60 by root, Mon Aug 9 02:41:27 2004 UTC vs.
Revision 1.99 by root, Sun Nov 26 23:53:20 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines