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

Diff Legend

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