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.21 by root, Sat Aug 11 19:59:19 2001 UTC vs.
Revision 1.117 by root, Fri Dec 1 19:41:06 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines