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.71 by root, Wed Jan 25 21:43:58 2006 UTC vs.
Revision 1.151 by root, Wed Sep 19 21:39:15 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines