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.47 by pcg, Sat Nov 15 03:53:10 2003 UTC vs.
Revision 1.145 by root, Mon Mar 12 21:40:14 2007 UTC

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

Diff Legend

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