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.141 by root, Mon Jan 22 18:45:17 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 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 STACKGUARD
80#endif
81
82#ifndef STACKGUARD
83# define STACKGUARD 0
84#endif
85
86/* prefer perl internal functions over our own? */
87#ifndef PREFER_PERL_FUNCTIONS
88# define 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 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 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 }
381} 370}
382 371
383static void 372static void
384save_state(pTHX_ Coro__State c, int flags) 373save_perl (Coro__State c)
385{ 374{
386 { 375 {
387 dSP; 376 dSP;
388 I32 cxix = cxstack_ix; 377 I32 cxix = cxstack_ix;
389 PERL_CONTEXT *ccstk = cxstack; 378 PERL_CONTEXT *ccstk = cxstack;
… …
392 /* 381 /*
393 * the worst thing you can imagine happens first - we have to save 382 * the worst thing you can imagine happens first - we have to save
394 * (and reinitialize) all cv's in the whole callchain :( 383 * (and reinitialize) all cv's in the whole callchain :(
395 */ 384 */
396 385
386 EXTEND (SP, 3 + 1);
397 PUSHs (Nullsv); 387 PUSHs (Nullsv);
398 /* this loop was inspired by pp_caller */ 388 /* this loop was inspired by pp_caller */
399 for (;;) 389 for (;;)
400 { 390 {
401 while (cxix >= 0) 391 while (cxix >= 0)
402 { 392 {
403 PERL_CONTEXT *cx = &ccstk[cxix--]; 393 PERL_CONTEXT *cx = &ccstk[cxix--];
404 394
405 if (CxTYPE(cx) == CXt_SUB) 395 if (CxTYPE (cx) == CXt_SUB)
406 { 396 {
407 CV *cv = cx->blk_sub.cv; 397 CV *cv = cx->blk_sub.cv;
398
408 if (CvDEPTH(cv)) 399 if (CvDEPTH (cv))
409 { 400 {
410 EXTEND (SP, CvDEPTH(cv)*2); 401 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)); 402 PUSHs ((SV *)CvPADLIST (cv));
403 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
420 PUSHs ((SV *)cv); 404 PUSHs ((SV *)cv);
421 405
422 get_padlist (aTHX_ cv); /* this is a monster */ 406 CvDEPTH (cv) = 0;
407 get_padlist (cv);
423 } 408 }
424 } 409 }
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 } 410 }
434 411
435 if (top_si->si_type == PERLSI_MAIN) 412 if (top_si->si_type == PERLSI_MAIN)
436 break; 413 break;
437 414
… …
441 } 418 }
442 419
443 PUTBACK; 420 PUTBACK;
444 } 421 }
445 422
446 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 423 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; 424 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
448 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 425 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
426 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
449 427
450 c->dowarn = PL_dowarn; 428#define VAR(name,type)c->name = PL_ ## name;
451 c->in_eval = PL_in_eval; 429# include "state.h"
452 430#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} 431}
483 432
484/* 433/*
485 * allocate various perl stacks. This is an exact copy 434 * allocate various perl stacks. This is an exact copy
486 * of perl.c:init_stacks, except that it uses less memory 435 * of perl.c:init_stacks, except that it uses less memory
487 * on the (sometimes correct) assumption that coroutines do 436 * on the (sometimes correct) assumption that coroutines do
488 * not usually need a lot of stackspace. 437 * not usually need a lot of stackspace.
489 */ 438 */
490STATIC void 439#if PREFER_PERL_FUNCTIONS
440# define coro_init_stacks init_stacks
441#else
442static void
491coro_init_stacks (pTHX) 443coro_init_stacks ()
492{ 444{
493 LOCK;
494
495 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 445 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
496 PL_curstackinfo->si_type = PERLSI_MAIN; 446 PL_curstackinfo->si_type = PERLSI_MAIN;
497 PL_curstack = PL_curstackinfo->si_stack; 447 PL_curstack = PL_curstackinfo->si_stack;
498 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 448 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
499 449
500 PL_stack_base = AvARRAY(PL_curstack); 450 PL_stack_base = AvARRAY(PL_curstack);
501 PL_stack_sp = PL_stack_base; 451 PL_stack_sp = PL_stack_base;
502 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 452 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
503 453
504 New(50,PL_tmps_stack,96,SV*); 454 New(50,PL_tmps_stack,128,SV*);
505 PL_tmps_floor = -1; 455 PL_tmps_floor = -1;
506 PL_tmps_ix = -1; 456 PL_tmps_ix = -1;
507 PL_tmps_max = 96; 457 PL_tmps_max = 128;
508 458
509 New(54,PL_markstack,16,I32); 459 New(54,PL_markstack,32,I32);
510 PL_markstack_ptr = PL_markstack; 460 PL_markstack_ptr = PL_markstack;
511 PL_markstack_max = PL_markstack + 16; 461 PL_markstack_max = PL_markstack + 32;
512 462
513#ifdef SET_MARK_OFFSET 463#ifdef SET_MARK_OFFSET
514 SET_MARK_OFFSET; 464 SET_MARK_OFFSET;
515#endif 465#endif
516 466
517 New(54,PL_scopestack,16,I32); 467 New(54,PL_scopestack,32,I32);
518 PL_scopestack_ix = 0; 468 PL_scopestack_ix = 0;
519 PL_scopestack_max = 16; 469 PL_scopestack_max = 32;
520 470
521 New(54,PL_savestack,96,ANY); 471 New(54,PL_savestack,64,ANY);
522 PL_savestack_ix = 0; 472 PL_savestack_ix = 0;
523 PL_savestack_max = 96; 473 PL_savestack_max = 64;
524 474
475#if !PERL_VERSION_ATLEAST (5,9,0)
525 New(54,PL_retstack,8,OP*); 476 New(54,PL_retstack,16,OP*);
526 PL_retstack_ix = 0; 477 PL_retstack_ix = 0;
527 PL_retstack_max = 8; 478 PL_retstack_max = 16;
528 479#endif
529 UNLOCK;
530} 480}
481#endif
531 482
532/* 483/*
533 * destroy the stacks, the callchain etc... 484 * destroy the stacks, the callchain etc...
534 */ 485 */
535STATIC void 486static void
536destroy_stacks(pTHX) 487coro_destroy_stacks ()
537{ 488{
538 if (!IN_DESTRUCT) 489 if (!IN_DESTRUCT)
539 { 490 {
540 /* is this ugly, I ask? */ 491 /* restore all saved variables and stuff */
541 LEAVE_SCOPE (0); 492 LEAVE_SCOPE (0);
493 assert (PL_tmps_floor == -1);
542 494
543 /* sure it is, but more important: is it correct?? :/ */ 495 /* free all temporaries */
544 FREETMPS; 496 FREETMPS;
497 assert (PL_tmps_ix == -1);
545 498
499 /* unwind all extra stacks */
546 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ 500 POPSTACK_TO (PL_mainstack);
501
502 /* unwind main stack */
503 dounwind (-1);
547 } 504 }
548 505
549 while (PL_curstackinfo->si_next) 506 while (PL_curstackinfo->si_next)
550 PL_curstackinfo = PL_curstackinfo->si_next; 507 PL_curstackinfo = PL_curstackinfo->si_next;
551 508
552 while (PL_curstackinfo) 509 while (PL_curstackinfo)
553 { 510 {
554 PERL_SI *p = PL_curstackinfo->si_prev; 511 PERL_SI *p = PL_curstackinfo->si_prev;
555 512
556 { /*D*//*remove*/
557 dSP;
558 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
559 PUTBACK; /* possibly superfluous */
560 }
561
562 if (!IN_DESTRUCT) 513 if (!IN_DESTRUCT)
563 {
564 dounwind (-1);/*D*//*remove*/
565 SvREFCNT_dec (PL_curstackinfo->si_stack); 514 SvREFCNT_dec (PL_curstackinfo->si_stack);
566 }
567 515
568 Safefree (PL_curstackinfo->si_cxstack); 516 Safefree (PL_curstackinfo->si_cxstack);
569 Safefree (PL_curstackinfo); 517 Safefree (PL_curstackinfo);
570 PL_curstackinfo = p; 518 PL_curstackinfo = p;
571 } 519 }
572 520
573 Safefree (PL_tmps_stack); 521 Safefree (PL_tmps_stack);
574 Safefree (PL_markstack); 522 Safefree (PL_markstack);
575 Safefree (PL_scopestack); 523 Safefree (PL_scopestack);
576 Safefree (PL_savestack); 524 Safefree (PL_savestack);
525#if !PERL_VERSION_ATLEAST (5,9,0)
577 Safefree (PL_retstack); 526 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 527#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} 528}
609 529
610static void 530/** coroutine stack handling ************************************************/
611deallocate_stack (Coro__State ctx)
612{
613 coro_stack *stack = ctx->stack;
614 531
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 532static void
636setup_coro (void *arg) 533setup_coro (struct coro *coro)
637{ 534{
638 /* 535 /*
639 * emulate part of the perl startup here. 536 * emulate part of the perl startup here.
640 */ 537 */
641 dTHX; 538
539 coro_init_stacks ();
540
541 PL_curcop = &PL_compiling;
542 PL_in_eval = EVAL_NULL;
543 PL_curpm = 0;
544 PL_localizing = 0;
545 PL_dirty = 0;
546 PL_restartop = 0;
547
548 {
549 dSP;
550 LOGOP myop;
551
552 SvREFCNT_dec (GvAV (PL_defgv));
553 GvAV (PL_defgv) = coro->args; coro->args = 0;
554
555 Zero (&myop, 1, LOGOP);
556 myop.op_next = Nullop;
557 myop.op_flags = OPf_WANT_VOID;
558
559 PUSHMARK (SP);
560 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
561 PUTBACK;
562 PL_op = (OP *)&myop;
563 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
564 SPAGAIN;
565 }
566
567 ENTER; /* necessary e.g. for dounwind */
568}
569
570static void
571free_coro_mortal ()
572{
573 if (coro_mortal)
574 {
575 SvREFCNT_dec (coro_mortal);
576 coro_mortal = 0;
577 }
578}
579
580/* inject a fake call to Coro::State::_cctx_init into the execution */
581static void NOINLINE
582prepare_cctx (coro_cctx *cctx)
583{
642 dSP; 584 dSP;
643 Coro__State ctx = (Coro__State)arg; 585 LOGOP myop;
644 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
645 586
646 coro_init_stacks (aTHX); 587 Zero (&myop, 1, LOGOP);
647 /*PL_curcop = 0;*/ 588 myop.op_next = PL_op;
648 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 589 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
649 SvREFCNT_dec (GvAV (PL_defgv));
650 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
651 590
591 PUSHMARK (SP);
592 EXTEND (SP, 2);
593 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
594 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
595 PUTBACK;
596 PL_op = (OP *)&myop;
597 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
652 SPAGAIN; 598 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} 599}
693 600
694static void 601static void
695continue_coro (void *arg) 602coro_run (void *arg)
696{ 603{
604 /* coro_run is the alternative tail of transfer(), so unlock here. */
605 UNLOCK;
606
697 /* 607 /*
698 * this is a _very_ stripped down perl interpreter ;) 608 * this is a _very_ stripped down perl interpreter ;)
699 */ 609 */
700 dTHX;
701 Coro__State ctx = (Coro__State)arg;
702 JMPENV coro_start_env;
703
704 PL_top_env = &ctx->start_env; 610 PL_top_env = &PL_start_env;
705 611
706 ctx->cursp = 0; 612 /* inject call to cctx_init */
707 PL_op = PL_op->op_next; 613 prepare_cctx ((coro_cctx *)arg);
708 CALLRUNOPS(aTHX);
709 614
615 /* somebody will hit me for both perl_run and PL_restartop */
616 PL_restartop = PL_op;
617 perl_run (PL_curinterp);
618
619 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
710 abort (); 620 abort ();
711} 621}
712 622
713STATIC void 623static coro_cctx *
624cctx_new ()
625{
626 coro_cctx *cctx;
627
628 ++cctx_count;
629
630 Newz (0, cctx, 1, coro_cctx);
631
632#if HAVE_MMAP
633
634 cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
635 /* mmap supposedly does allocate-on-write for us */
636 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
637
638 if (cctx->sptr != (void *)-1)
639 {
640# if STACKGUARD
641 mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
642# endif
643 REGISTER_STACK (
644 cctx,
645 STACKGUARD * PAGESIZE + (char *)cctx->sptr,
646 cctx->ssize + (char *)cctx->sptr
647 );
648
649 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);
650 }
651 else
652#endif
653 {
654 cctx->ssize = -STACKSIZE * (long)sizeof (long);
655 New (0, cctx->sptr, STACKSIZE, long);
656
657 if (!cctx->sptr)
658 {
659 perror ("FATAL: unable to allocate stack for coroutine");
660 _exit (EXIT_FAILURE);
661 }
662
663 REGISTER_STACK (
664 cctx,
665 (char *)cctx->sptr,
666 (char *)cctx->sptr - cctx->ssize
667 );
668
669 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, -cctx->ssize);
670 }
671
672 return cctx;
673}
674
675static void
676cctx_destroy (coro_cctx *cctx)
677{
678 if (!cctx)
679 return;
680
681 --cctx_count;
682
683#if USE_VALGRIND
684 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
685#endif
686
687#if HAVE_MMAP
688 if (cctx->ssize > 0)
689 munmap (cctx->sptr, cctx->ssize);
690 else
691#endif
692 Safefree (cctx->sptr);
693
694 Safefree (cctx);
695}
696
697static coro_cctx *
698cctx_get ()
699{
700 coro_cctx *cctx;
701
702 if (cctx_first)
703 {
704 cctx = cctx_first;
705 cctx_first = cctx->next;
706 --cctx_idle;
707 }
708 else
709 {
710 cctx = cctx_new ();
711 PL_op = PL_op->op_next;
712 }
713
714 return cctx;
715}
716
717static void
718cctx_put (coro_cctx *cctx)
719{
720 /* free another cctx if overlimit */
721 if (cctx_idle >= MAX_IDLE_CCTX)
722 {
723 coro_cctx *first = cctx_first;
724 cctx_first = first->next;
725 --cctx_idle;
726
727 assert (!first->inuse);
728 cctx_destroy (first);
729 }
730
731 ++cctx_idle;
732 cctx->next = cctx_first;
733 cctx_first = cctx;
734}
735
736/** coroutine switching *****************************************************/
737
738/* never call directly, always through the coro_state_transfer global variable */
739static void NOINLINE
714transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 740transfer (struct coro *prev, struct coro *next)
715{ 741{
716 dSTACKLEVEL; 742 dSTACKLEVEL;
717 743
744 /* sometimes transfer is only called to set idle_sp */
745 if (!next)
746 {
747 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
748 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
749 }
718 if (prev != next) 750 else if (prev != next)
719 { 751 {
720 if (next->mainstack) 752 coro_cctx *prev__cctx;
753
754 if (prev->flags & CF_NEW)
721 { 755 {
722 LOCK; 756 /* create a new empty context */
723 SAVE (prev, flags); 757 Newz (0, prev->cctx, 1, coro_cctx);
724 LOAD (next); 758 prev->cctx->inuse = 1;
725 UNLOCK; 759 prev->flags &= ~CF_NEW;
726 760 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 } 761 }
760 else if (next->tmps_ix == -2) 762
761 croak ("tried to transfer to running coroutine"); 763 /*TODO: must not croak here */
764 if (!prev->flags & CF_RUNNING)
765 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
766
767 if (next->flags & CF_RUNNING)
768 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
769
770 if (next->flags & CF_DESTROYED)
771 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
772
773 prev->flags &= ~CF_RUNNING;
774 next->flags |= CF_RUNNING;
775
776 LOCK;
777
778 if (next->flags & CF_NEW)
779 {
780 /* need to start coroutine */
781 next->flags &= ~CF_NEW;
782 /* first get rid of the old state */
783 save_perl (prev);
784 /* setup coroutine call */
785 setup_coro (next);
786 /* need a new stack */
787 assert (!next->cctx);
788 }
762 else 789 else
763 { 790 {
764 LOCK; 791 /* coroutine already started */
765 SAVE (prev, -1); /* first get rid of the old state */ 792 save_perl (prev);
766 UNLOCK; 793 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 } 794 }
803 }
804 795
805 LOCK; 796 prev__cctx = prev->cctx;
806 if (coro_mortal) 797
807 { 798 /* possibly "free" the cctx */
808 SvREFCNT_dec (coro_mortal); 799 if (prev__cctx->idle_sp == STACKLEVEL)
800 {
801 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
802 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
803
804 prev->cctx = 0;
805
806 cctx_put (prev__cctx);
807 prev__cctx->inuse = 0;
808 }
809
810 if (!next->cctx)
811 {
812 next->cctx = cctx_get ();
813 assert (!next->cctx->inuse);
814 next->cctx->inuse = 1;
815 }
816
817 if (prev__cctx != next->cctx)
818 {
819 prev__cctx->top_env = PL_top_env;
820 PL_top_env = next->cctx->top_env;
821 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
822 }
823
809 coro_mortal = 0; 824 free_coro_mortal ();
810 }
811 UNLOCK; 825 UNLOCK;
826 }
812} 827}
813 828
814#define SV_CORO(sv,func) \ 829struct transfer_args
815 do { \ 830{
816 if (SvROK (sv)) \ 831 struct coro *prev, *next;
817 sv = SvRV (sv); \ 832};
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 833
835#define SvSTATE(sv) (struct coro *)SvIV (sv) 834#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
836 835
836/** high level stuff ********************************************************/
837
837static void 838static int
839coro_state_destroy (struct coro *coro)
840{
841 if (coro->flags & CF_DESTROYED)
842 return 0;
843
844 coro->flags |= CF_DESTROYED;
845
846 if (coro->flags & CF_READY)
847 {
848 /* reduce nready, as destroying a ready coro effectively unreadies it */
849 /* alternative: look through all ready queues and remove the coro */
850 LOCK;
851 --coro_nready;
852 UNLOCK;
853 }
854 else
855 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
856
857 if (coro->mainstack && coro->mainstack != main_mainstack)
858 {
859 struct coro temp;
860
861 assert (!(coro->flags & CF_RUNNING));
862
863 Zero (&temp, 1, struct coro);
864 temp.save = CORO_SAVE_ALL;
865
866 if (coro->flags & CF_RUNNING)
867 croak ("FATAL: tried to destroy currently running coroutine");
868
869 save_perl (&temp);
870 load_perl (coro);
871
872 coro_destroy_stacks ();
873
874 load_perl (&temp); /* this will get rid of defsv etc.. */
875
876 coro->mainstack = 0;
877 }
878
879 cctx_destroy (coro->cctx);
880 SvREFCNT_dec (coro->args);
881
882 return 1;
883}
884
885static int
886coro_state_free (pTHX_ SV *sv, MAGIC *mg)
887{
888 struct coro *coro = (struct coro *)mg->mg_ptr;
889 mg->mg_ptr = 0;
890
891 if (--coro->refcnt < 0)
892 {
893 coro_state_destroy (coro);
894 Safefree (coro);
895 }
896
897 return 0;
898}
899
900static int
901coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
902{
903 struct coro *coro = (struct coro *)mg->mg_ptr;
904
905 ++coro->refcnt;
906
907 return 0;
908}
909
910static MGVTBL coro_state_vtbl = {
911 0, 0, 0, 0,
912 coro_state_free,
913 0,
914#ifdef MGf_DUP
915 coro_state_dup,
916#else
917# define MGf_DUP 0
918#endif
919};
920
921static struct coro *
922SvSTATE (SV *coro)
923{
924 HV *stash;
925 MAGIC *mg;
926
927 if (SvROK (coro))
928 coro = SvRV (coro);
929
930 stash = SvSTASH (coro);
931 if (stash != coro_stash && stash != coro_state_stash)
932 {
933 /* very slow, but rare, check */
934 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
935 croak ("Coro::State object required");
936 }
937
938 mg = SvMAGIC (coro);
939 assert (mg->mg_type == PERL_MAGIC_ext);
940 return (struct coro *)mg->mg_ptr;
941}
942
943static void
944prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
945{
946 ta->prev = SvSTATE (prev_sv);
947 ta->next = SvSTATE (next_sv);
948}
949
950static void
838api_transfer(pTHX_ SV *prev, SV *next, int flags) 951api_transfer (SV *prev_sv, SV *next_sv)
839{ 952{
840 SV_CORO (prev, "Coro::transfer"); 953 struct transfer_args ta;
841 SV_CORO (next, "Coro::transfer");
842 954
843 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 955 prepare_transfer (&ta, prev_sv, next_sv);
956 TRANSFER (ta);
957}
958
959static int
960api_save (SV *coro_sv, int new_save)
961{
962 struct coro *coro = SvSTATE (coro_sv);
963 int old_save = coro->save;
964
965 if (new_save >= 0)
966 coro->save = new_save;
967
968 return old_save;
844} 969}
845 970
846/** Coro ********************************************************************/ 971/** Coro ********************************************************************/
847 972
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 973static void
861coro_enq (pTHX_ SV *sv) 974coro_enq (SV *coro_sv)
862{ 975{
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); 976 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} 977}
880 978
881static SV * 979static SV *
882coro_deq (pTHX_ int min_prio) 980coro_deq (int min_prio)
883{ 981{
884 int prio = PRIO_MAX - PRIO_MIN; 982 int prio = PRIO_MAX - PRIO_MIN;
885 983
886 min_prio -= PRIO_MIN; 984 min_prio -= PRIO_MIN;
887 if (min_prio < 0) 985 if (min_prio < 0)
888 min_prio = 0; 986 min_prio = 0;
889 987
890 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 988 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
891 if (av_len (coro_ready[prio]) >= 0) 989 if (AvFILLp (coro_ready [prio]) >= 0)
892 {
893 coro_nready--;
894 return av_shift (coro_ready[prio]); 990 return av_shift (coro_ready [prio]);
895 }
896 991
897 return 0; 992 return 0;
898} 993}
899 994
900static void 995static int
901api_ready (SV *coro) 996api_ready (SV *coro_sv)
902{ 997{
903 dTHX; 998 struct coro *coro;
904 999
905 if (SvROK (coro)) 1000 if (SvROK (coro_sv))
906 coro = SvRV (coro); 1001 coro_sv = SvRV (coro_sv);
1002
1003 coro = SvSTATE (coro_sv);
1004
1005 if (coro->flags & CF_READY)
1006 return 0;
1007
1008 coro->flags |= CF_READY;
907 1009
908 LOCK; 1010 LOCK;
909 coro_enq (aTHX_ SvREFCNT_inc (coro)); 1011 coro_enq (SvREFCNT_inc (coro_sv));
1012 ++coro_nready;
910 UNLOCK; 1013 UNLOCK;
1014
1015 return 1;
1016}
1017
1018static int
1019api_is_ready (SV *coro_sv)
1020{
1021 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1022}
1023
1024static void
1025prepare_schedule (struct transfer_args *ta)
1026{
1027 SV *prev_sv, *next_sv;
1028
1029 for (;;)
1030 {
1031 LOCK;
1032 next_sv = coro_deq (PRIO_MIN);
1033
1034 /* nothing to schedule: call the idle handler */
1035 if (!next_sv)
1036 {
1037 dSP;
1038 UNLOCK;
1039
1040 ENTER;
1041 SAVETMPS;
1042
1043 PUSHMARK (SP);
1044 PUTBACK;
1045 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1046
1047 FREETMPS;
1048 LEAVE;
1049 continue;
1050 }
1051
1052 ta->next = SvSTATE (next_sv);
1053
1054 /* cannot transfer to destroyed coros, skip and look for next */
1055 if (ta->next->flags & CF_DESTROYED)
1056 {
1057 UNLOCK;
1058 SvREFCNT_dec (next_sv);
1059 /* coro_nready is already taken care of by destroy */
1060 continue;
1061 }
1062
1063 --coro_nready;
1064 UNLOCK;
1065 break;
1066 }
1067
1068 /* free this only after the transfer */
1069 prev_sv = SvRV (coro_current);
1070 SvRV_set (coro_current, next_sv);
1071 ta->prev = SvSTATE (prev_sv);
1072
1073 assert (ta->next->flags & CF_READY);
1074 ta->next->flags &= ~CF_READY;
1075
1076 LOCK;
1077 free_coro_mortal ();
1078 coro_mortal = prev_sv;
1079 UNLOCK;
1080}
1081
1082static void
1083prepare_cede (struct transfer_args *ta)
1084{
1085 api_ready (coro_current);
1086 prepare_schedule (ta);
1087}
1088
1089static int
1090prepare_cede_notself (struct transfer_args *ta)
1091{
1092 if (coro_nready)
1093 {
1094 SV *prev = SvRV (coro_current);
1095 prepare_schedule (ta);
1096 api_ready (prev);
1097 return 1;
1098 }
1099 else
1100 return 0;
911} 1101}
912 1102
913static void 1103static void
914api_schedule (void) 1104api_schedule (void)
915{ 1105{
916 dTHX; 1106 struct transfer_args ta;
917 1107
918 SV *prev, *next; 1108 prepare_schedule (&ta);
919 1109 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} 1110}
941 1111
942static void 1112static int
943api_cede (void) 1113api_cede (void)
944{ 1114{
945 dTHX; 1115 struct transfer_args ta;
946 1116
947 LOCK; 1117 prepare_cede (&ta);
948 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
949 UNLOCK;
950 1118
951 api_schedule (); 1119 if (ta.prev != ta.next)
1120 {
1121 TRANSFER (ta);
1122 return 1;
1123 }
1124 else
1125 return 0;
1126}
1127
1128static int
1129api_cede_notself (void)
1130{
1131 struct transfer_args ta;
1132
1133 if (prepare_cede_notself (&ta))
1134 {
1135 TRANSFER (ta);
1136 return 1;
1137 }
1138 else
1139 return 0;
952} 1140}
953 1141
954MODULE = Coro::State PACKAGE = Coro::State 1142MODULE = Coro::State PACKAGE = Coro::State
955 1143
956PROTOTYPES: ENABLE 1144PROTOTYPES: DISABLE
957 1145
958BOOT: 1146BOOT:
959{ /* {} necessary for stoopid perl-5.6.x */ 1147{
960#ifdef USE_ITHREADS 1148#ifdef USE_ITHREADS
961 MUTEX_INIT (&coro_mutex); 1149 MUTEX_INIT (&coro_mutex);
962#endif 1150#endif
1151 BOOT_PAGESIZE;
963 1152
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); 1153 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
967 1154
968 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1155 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
969 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1156 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
970 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1157 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1158 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
971 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1159 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
972 1160
973 main_mainstack = PL_mainstack; 1161 main_mainstack = PL_mainstack;
974 1162
975 coroapi.ver = CORO_API_VERSION; 1163 coroapi.ver = CORO_API_VERSION;
976 coroapi.transfer = api_transfer; 1164 coroapi.transfer = api_transfer;
977}
978 1165
979Coro::State 1166 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
980_newprocess(args) 1167}
981 SV * args 1168
982 PROTOTYPE: $ 1169SV *
1170new (char *klass, ...)
983 CODE: 1171 CODE:
984 Coro__State coro; 1172{
1173 struct coro *coro;
1174 HV *hv;
1175 int i;
985 1176
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); 1177 Newz (0, coro, 1, struct coro);
1178 coro->args = newAV ();
1179 coro->save = CORO_SAVE_ALL;
1180 coro->flags = CF_NEW;
990 1181
991 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1182 hv = newHV ();
992 /*coro->mainstack = 0; *//*actual work is done inside transfer */ 1183 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
993 /*coro->stack = 0;*/ 1184 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
994 1185
995 /* same as JMPENV_BOOTSTRAP */ 1186 for (i = 1; i < items; i++)
996 /* we might be able to recycle start_env, but safe is safe */ 1187 av_push (coro->args, newSVsv (ST (i)));
997 /*Zero(&coro->start_env, 1, JMPENV);*/ 1188}
998 coro->start_env.je_ret = -1;
999 coro->start_env.je_mustcatch = TRUE;
1000
1001 RETVAL = coro;
1002 OUTPUT: 1189 OUTPUT:
1003 RETVAL 1190 RETVAL
1004 1191
1192int
1193save (SV *coro, int new_save = -1)
1194 CODE:
1195 RETVAL = api_save (coro, new_save);
1196 OUTPUT:
1197 RETVAL
1198
1005void 1199void
1006transfer(prev, next, flags) 1200_set_stacklevel (...)
1007 SV *prev 1201 ALIAS:
1008 SV *next 1202 Coro::State::transfer = 1
1009 int flags 1203 Coro::schedule = 2
1010 PROTOTYPE: @ 1204 Coro::cede = 3
1205 Coro::cede_notself = 4
1011 CODE: 1206 CODE:
1012 PUTBACK; 1207{
1013 SV_CORO (next, "Coro::transfer"); 1208 struct transfer_args ta;
1014 SV_CORO (prev, "Coro::transfer"); 1209
1015 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1210 switch (ix)
1016 SPAGAIN; 1211 {
1212 case 0:
1213 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1214 ta.next = 0;
1215 break;
1216
1217 case 1:
1218 if (items != 2)
1219 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1220
1221 prepare_transfer (&ta, ST (0), ST (1));
1222 break;
1223
1224 case 2:
1225 prepare_schedule (&ta);
1226 break;
1227
1228 case 3:
1229 prepare_cede (&ta);
1230 break;
1231
1232 case 4:
1233 if (!prepare_cede_notself (&ta))
1234 XSRETURN_EMPTY;
1235
1236 break;
1237 }
1238
1239 BARRIER;
1240 TRANSFER (ta);
1241
1242 if (GIMME_V != G_VOID && ta.next != ta.prev)
1243 XSRETURN_YES;
1244}
1245
1246bool
1247_destroy (SV *coro_sv)
1248 CODE:
1249 RETVAL = coro_state_destroy (SvSTATE (coro_sv));
1250 OUTPUT:
1251 RETVAL
1017 1252
1018void 1253void
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) 1254_exit (code)
1046 int code 1255 int code
1047 PROTOTYPE: $ 1256 PROTOTYPE: $
1048 CODE: 1257 CODE:
1049 _exit (code); 1258 _exit (code);
1050 1259
1051MODULE = Coro::State PACKAGE = Coro::Cont 1260int
1261cctx_count ()
1262 CODE:
1263 RETVAL = cctx_count;
1264 OUTPUT:
1265 RETVAL
1052 1266
1053# this is slightly dirty (should expose a c-level api) 1267int
1054 1268cctx_idle ()
1055void 1269 CODE:
1056yield(...) 1270 RETVAL = cctx_idle;
1057 PROTOTYPE: @ 1271 OUTPUT:
1058 CODE: 1272 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 1273
1083MODULE = Coro::State PACKAGE = Coro 1274MODULE = Coro::State PACKAGE = Coro
1084 1275
1085# this is slightly dirty (should expose a c-level api)
1086
1087BOOT: 1276BOOT:
1088{ 1277{
1089 int i; 1278 int i;
1279
1090 HV *stash = gv_stashpv ("Coro", TRUE); 1280 coro_stash = gv_stashpv ("Coro", TRUE);
1091 1281
1092 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1282 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1093 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1283 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1094 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1284 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1095 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1285 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1096 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1286 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1097 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1287 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1098 1288
1099 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1289 coro_current = get_sv ("Coro::current", FALSE);
1100 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1290 SvREADONLY_on (coro_current);
1101 1291
1102 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1292 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1103 coro_ready[i] = newAV (); 1293 coro_ready[i] = newAV ();
1104 1294
1105 { 1295 {
1106 SV *sv = perl_get_sv("Coro::API", 1); 1296 SV *sv = perl_get_sv("Coro::API", 1);
1107 1297
1108 coroapi.schedule = api_schedule; 1298 coroapi.schedule = api_schedule;
1299 coroapi.save = api_save;
1109 coroapi.cede = api_cede; 1300 coroapi.cede = api_cede;
1301 coroapi.cede_notself = api_cede_notself;
1110 coroapi.ready = api_ready; 1302 coroapi.ready = api_ready;
1303 coroapi.is_ready = api_is_ready;
1111 coroapi.nready = &coro_nready; 1304 coroapi.nready = &coro_nready;
1112 coroapi.current = coro_current; 1305 coroapi.current = coro_current;
1113 1306
1114 GCoroAPI = &coroapi; 1307 GCoroAPI = &coroapi;
1115 sv_setiv(sv, (IV)&coroapi); 1308 sv_setiv (sv, (IV)&coroapi);
1116 SvREADONLY_on(sv); 1309 SvREADONLY_on (sv);
1117 } 1310 }
1118} 1311}
1119 1312
1120#if !PERL_MICRO
1121
1122void 1313void
1123ready(self) 1314_set_current (SV *current)
1124 SV * self
1125 PROTOTYPE: $ 1315 PROTOTYPE: $
1126 CODE: 1316 CODE:
1127 api_ready (self); 1317 SvREFCNT_dec (SvRV (coro_current));
1128 1318 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1129#endif
1130 1319
1131int 1320int
1321prio (Coro::State coro, int newprio = 0)
1322 ALIAS:
1323 nice = 1
1324 CODE:
1325{
1326 RETVAL = coro->prio;
1327
1328 if (items > 1)
1329 {
1330 if (ix)
1331 newprio = coro->prio - newprio;
1332
1333 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1334 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1335
1336 coro->prio = newprio;
1337 }
1338}
1339 OUTPUT:
1340 RETVAL
1341
1342SV *
1343ready (SV *self)
1344 PROTOTYPE: $
1345 CODE:
1346 RETVAL = boolSV (api_ready (self));
1347 OUTPUT:
1348 RETVAL
1349
1350SV *
1351is_ready (SV *self)
1352 PROTOTYPE: $
1353 CODE:
1354 RETVAL = boolSV (api_is_ready (self));
1355 OUTPUT:
1356 RETVAL
1357
1358int
1132nready(...) 1359nready (...)
1133 PROTOTYPE: 1360 PROTOTYPE:
1134 CODE: 1361 CODE:
1135 RETVAL = coro_nready; 1362 RETVAL = coro_nready;
1136 OUTPUT: 1363 OUTPUT:
1137 RETVAL 1364 RETVAL
1138 1365
1366MODULE = Coro::State PACKAGE = Coro::AIO
1367
1368SV *
1369_get_state ()
1370 CODE:
1371{
1372 struct io_state *data;
1373
1374 RETVAL = newSV (sizeof (struct io_state));
1375 data = (struct io_state *)SvPVX (RETVAL);
1376 SvCUR_set (RETVAL, sizeof (struct io_state));
1377 SvPOK_only (RETVAL);
1378
1379 data->errorno = errno;
1380 data->laststype = PL_laststype;
1381 data->laststatval = PL_laststatval;
1382 data->statcache = PL_statcache;
1383}
1384 OUTPUT:
1385 RETVAL
1386
1139void 1387void
1140schedule(...) 1388_set_state (char *data_)
1141 PROTOTYPE: 1389 PROTOTYPE: $
1142 CODE: 1390 CODE:
1143 api_schedule (); 1391{
1392 struct io_state *data = (void *)data_;
1144 1393
1145void 1394 errno = data->errorno;
1146cede(...) 1395 PL_laststype = data->laststype;
1147 PROTOTYPE: 1396 PL_laststatval = data->laststatval;
1148 CODE: 1397 PL_statcache = data->statcache;
1149 api_cede (); 1398}
1150 1399

Diff Legend

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