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

Diff Legend

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