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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines