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.20 by root, Fri Aug 3 12:51:56 2001 UTC vs.
Revision 1.157 by root, Fri Sep 21 02:01:13 2007 UTC

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

Diff Legend

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