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

Diff Legend

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