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.67 by root, Mon Dec 12 20:07:44 2005 UTC vs.
Revision 1.210 by root, Wed Oct 10 03:24:40 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines