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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines