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.145 by root, Mon Mar 12 21:40:14 2007 UTC

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