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.8 by root, Thu Jul 19 04:13:22 2001 UTC vs.
Revision 1.107 by root, Mon Nov 27 02:15:51 2006 UTC

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

Diff Legend

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