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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines