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.65 by root, Mon Dec 5 23:50:48 2005 UTC vs.
Revision 1.150 by root, Wed Jun 13 21:04:48 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines