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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines