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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines