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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines