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.133 by root, Thu Jan 4 20:14:19 2007 UTC

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