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

Diff Legend

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