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.66 by root, Mon Dec 12 19:43:41 2005 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines