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.61 by root, Tue Aug 10 01:56:30 2004 UTC vs.
Revision 1.169 by root, Thu Sep 27 16:25:10 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines