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

Diff Legend

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