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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines