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.68 by root, Mon Dec 12 20:28:30 2005 UTC vs.
Revision 1.115 by root, Fri Dec 1 13:36:08 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines