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

Diff Legend

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