ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.65 by root, Mon Dec 5 23:50:48 2005 UTC vs.
Revision 1.195 by root, Sat Oct 6 00:35:41 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines