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