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

Diff Legend

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