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