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.56 by pcg, Thu Apr 1 02:41:05 2004 UTC vs.
Revision 1.116 by root, Fri Dec 1 14:01:43 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines