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.18 by root, Thu Jul 26 03:46:15 2001 UTC vs.
Revision 1.193 by root, Fri Oct 5 23:38:40 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines