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.33 by root, Sun Aug 26 21:44:20 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
20 69#else
21#define MAY_FLUSH /* increases codesize and is rarely used */ 70# define PAGESIZE 0
22 71# define BOOT_PAGESIZE (void)0
23#define SUB_INIT "Coro::State::initialize" 72#endif
24#define UCORO_STATE "_coro_state"
25 73
26/* The next macro should declare 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 void 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) load_state(aTHX_ (state)); 282#define LOAD(state) load_state((state));
276#define SAVE(state,flags) save_state(aTHX_ (state),(flags)); 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;
… …
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 361
397 if (top_si->si_type == PERLSI_MAIN) 362 if (top_si->si_type == PERLSI_MAIN)
398 break; 363 break;
399 364
… …
407 372
408 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;
409 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 374 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
410 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 375 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
411 376
412 c->dowarn = PL_dowarn; 377#define VAR(name,type)c->name = PL_ ## name;
413 c->in_eval = PL_in_eval; 378# include "state.h"
414 379#undef VAR
415 c->curstackinfo = PL_curstackinfo;
416 c->curstack = PL_curstack;
417 c->mainstack = PL_mainstack;
418 c->stack_sp = PL_stack_sp;
419 c->op = PL_op;
420 c->curpad = PL_curpad;
421 c->stack_base = PL_stack_base;
422 c->stack_max = PL_stack_max;
423 c->tmps_stack = PL_tmps_stack;
424 c->tmps_floor = PL_tmps_floor;
425 c->tmps_ix = PL_tmps_ix;
426 c->tmps_max = PL_tmps_max;
427 c->markstack = PL_markstack;
428 c->markstack_ptr = PL_markstack_ptr;
429 c->markstack_max = PL_markstack_max;
430 c->scopestack = PL_scopestack;
431 c->scopestack_ix = PL_scopestack_ix;
432 c->scopestack_max = PL_scopestack_max;
433 c->savestack = PL_savestack;
434 c->savestack_ix = PL_savestack_ix;
435 c->savestack_max = PL_savestack_max;
436 c->retstack = PL_retstack;
437 c->retstack_ix = PL_retstack_ix;
438 c->retstack_max = PL_retstack_max;
439 c->curcop = PL_curcop;
440 c->top_env = PL_top_env;
441} 380}
442 381
443/* 382/*
444 * allocate various perl stacks. This is an exact copy 383 * allocate various perl stacks. This is an exact copy
445 * of perl.c:init_stacks, except that it uses less memory 384 * of perl.c:init_stacks, except that it uses less memory
446 * on the assumption that coroutines do not usually need 385 * on the (sometimes correct) assumption that coroutines do
447 * a lot of stackspace. 386 * not usually need a lot of stackspace.
448 */ 387 */
449STATIC void 388static void
450coro_init_stacks (pTHX) 389coro_init_stacks ()
451{ 390{
452 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 391 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
453 PL_curstackinfo->si_type = PERLSI_MAIN; 392 PL_curstackinfo->si_type = PERLSI_MAIN;
454 PL_curstack = PL_curstackinfo->si_stack; 393 PL_curstack = PL_curstackinfo->si_stack;
455 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 394 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
… …
465 404
466 New(54,PL_markstack,16,I32); 405 New(54,PL_markstack,16,I32);
467 PL_markstack_ptr = PL_markstack; 406 PL_markstack_ptr = PL_markstack;
468 PL_markstack_max = PL_markstack + 16; 407 PL_markstack_max = PL_markstack + 16;
469 408
409#ifdef SET_MARK_OFFSET
470 SET_MARK_OFFSET; 410 SET_MARK_OFFSET;
411#endif
471 412
472 New(54,PL_scopestack,16,I32); 413 New(54,PL_scopestack,16,I32);
473 PL_scopestack_ix = 0; 414 PL_scopestack_ix = 0;
474 PL_scopestack_max = 16; 415 PL_scopestack_max = 16;
475 416
476 New(54,PL_savestack,96,ANY); 417 New(54,PL_savestack,96,ANY);
477 PL_savestack_ix = 0; 418 PL_savestack_ix = 0;
478 PL_savestack_max = 96; 419 PL_savestack_max = 96;
479 420
421#if !PERL_VERSION_ATLEAST (5,9,0)
480 New(54,PL_retstack,8,OP*); 422 New(54,PL_retstack,8,OP*);
481 PL_retstack_ix = 0; 423 PL_retstack_ix = 0;
482 PL_retstack_max = 8; 424 PL_retstack_max = 8;
425#endif
483} 426}
484 427
485/* 428/*
486 * destroy the stacks, the callchain etc... 429 * destroy the stacks, the callchain etc...
487 * still there is a memleak of 128 bytes...
488 */ 430 */
489STATIC void 431static void
490destroy_stacks(pTHX) 432coro_destroy_stacks ()
491{ 433{
492 int destruct = PL_main_cv != Nullcv; 434 if (!IN_DESTRUCT)
493
494 if (destruct)
495 { 435 {
496 /* is this ugly, I ask? */ 436 /* is this ugly, I ask? */
497 while (PL_scopestack_ix) 437 LEAVE_SCOPE (0);
498 LEAVE;
499 438
500 /* sure it is, but more important: is it correct?? :/ */ 439 /* sure it is, but more important: is it correct?? :/ */
501 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
502 FREETMPS; 440 FREETMPS;
441
442 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
503 } 443 }
504 444
505 while (PL_curstackinfo->si_next) 445 while (PL_curstackinfo->si_next)
506 PL_curstackinfo = PL_curstackinfo->si_next; 446 PL_curstackinfo = PL_curstackinfo->si_next;
507 447
508 while (PL_curstackinfo) 448 while (PL_curstackinfo)
509 { 449 {
510 PERL_SI *p = PL_curstackinfo->si_prev; 450 PERL_SI *p = PL_curstackinfo->si_prev;
511 451
512 { 452 { /*D*//*remove*/
513 dSP; 453 dSP;
514 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 454 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
515 PUTBACK; /* possibly superfluous */ 455 PUTBACK; /* possibly superfluous */
516 } 456 }
517 457
518 if (destruct) 458 if (!IN_DESTRUCT)
519 { 459 {
520 dounwind(-1); 460 dounwind (-1);/*D*//*remove*/
521 SvREFCNT_dec(PL_curstackinfo->si_stack); 461 SvREFCNT_dec (PL_curstackinfo->si_stack);
522 } 462 }
523 463
524 Safefree(PL_curstackinfo->si_cxstack); 464 Safefree (PL_curstackinfo->si_cxstack);
525 Safefree(PL_curstackinfo); 465 Safefree (PL_curstackinfo);
526 PL_curstackinfo = p; 466 PL_curstackinfo = p;
527 } 467 }
528 468
529 Safefree(PL_tmps_stack); 469 Safefree (PL_tmps_stack);
530 Safefree(PL_markstack); 470 Safefree (PL_markstack);
531 Safefree(PL_scopestack); 471 Safefree (PL_scopestack);
532 Safefree(PL_savestack); 472 Safefree (PL_savestack);
473#if !PERL_VERSION_ATLEAST (5,9,0)
533 Safefree(PL_retstack); 474 Safefree (PL_retstack);
534}
535
536static void
537allocate_stack (Coro__State ctx, int alloc)
538{
539 coro_stack *stack;
540
541 New (0, stack, 1, coro_stack);
542
543 stack->refcnt = 1;
544 stack->usecnt = 1;
545 stack->gencnt = ctx->gencnt = 0;
546 if (alloc)
547 {
548#ifdef HAVE_MMAP
549 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
550 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
551 if (stack->sptr == (void *)-1)
552#endif 475#endif
553 {
554 /*FIXME*//*D*//* reasonable stack size! */
555 stack->ssize = -4096 * sizeof (long);
556 New (0, stack->sptr, 4096, long);
557 }
558 }
559 else
560 stack->sptr = 0;
561
562 ctx->stack = stack;
563} 476}
564 477
565static void 478static void
566deallocate_stack (Coro__State ctx) 479setup_coro (struct coro *coro)
567{
568 coro_stack *stack = ctx->stack;
569
570 ctx->stack = 0;
571
572 if (stack)
573 {
574 if (!--stack->refcnt)
575 {
576#ifdef HAVE_MMAP
577 if (stack->ssize > 0 && stack->sptr)
578 munmap (stack->sptr, stack->ssize);
579 else
580#else
581 Safefree (stack->sptr);
582#endif
583 Safefree (stack);
584 }
585 else if (ctx->gencnt == stack->gencnt)
586 --stack->usecnt;
587 }
588}
589
590static void
591setup_coro (void *arg)
592{ 480{
593 /* 481 /*
594 * emulate part of the perl startup here. 482 * emulate part of the perl startup here.
595 */ 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{
596 dSP; 530 dSP;
597 Coro__State ctx = (Coro__State)arg; 531 LOGOP myop;
598 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
599 532
600 coro_init_stacks (aTHX); 533 Zero (&myop, 1, LOGOP);
601 /*PL_curcop = 0;*/ 534 myop.op_next = PL_op;
602 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 535 myop.op_flags = OPf_WANT_VOID;
603 SvREFCNT_dec (GvAV (PL_defgv));
604 GvAV (PL_defgv) = ctx->args;
605 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);
606 SPAGAIN; 543 SPAGAIN;
607
608 if (ctx->stack)
609 {
610 ctx->cursp = 0;
611
612 PUSHMARK(SP);
613 PUTBACK;
614 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
615
616 if (SvTRUE (ERRSV))
617 croak (NULL);
618 else
619 croak ("FATAL: CCTXT coroutine returned!");
620 }
621 else
622 {
623 UNOP myop;
624
625 PL_op = (OP *)&myop;
626
627 Zero(&myop, 1, UNOP);
628 myop.op_next = Nullop;
629 myop.op_flags = OPf_WANT_VOID;
630
631 PUSHMARK(SP);
632 XPUSHs (sub_init);
633 /*
634 * the next line is slightly wrong, as PL_op->op_next
635 * is actually being executed so we skip the first op.
636 * that doesn't matter, though, since it is only
637 * pp_nextstate and we never return...
638 * ah yes, and I don't care anyways ;)
639 */
640 PUTBACK;
641 PL_op = pp_entersub();
642 SPAGAIN;
643
644 ENTER; /* necessary e.g. for dounwind */
645 }
646} 544}
647 545
648static void 546static void
649continue_coro (void *arg) 547coro_run (void *arg)
650{ 548{
549 /* coro_run is the alternative epilogue of transfer() */
550 UNLOCK;
551
651 /* 552 /*
652 * this is a _very_ stripped down perl interpreter ;) 553 * this is a _very_ stripped down perl interpreter ;)
653 */ 554 */
654 Coro__State ctx = (Coro__State)arg;
655 JMPENV coro_start_env;
656
657 /* same as JMPENV_BOOTSTRAP */
658 Zero(&coro_start_env, 1, JMPENV);
659 coro_start_env.je_ret = -1;
660 coro_start_env.je_mustcatch = TRUE;
661 PL_top_env = &coro_start_env; 555 PL_top_env = &PL_start_env;
662 556
663 ctx->cursp = 0; 557 /* inject call to cctx_init */
664 PL_op = PL_op->op_next; 558 prepare_cctx ((coro_cctx *)arg);
665 CALLRUNOPS(aTHX);
666 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);
667 abort (); 564 abort ();
668} 565}
669 566
670STATIC 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
671transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 668transfer (struct coro *prev, struct coro *next, int flags)
672{ 669{
673 dSTACKLEVEL; 670 dSTACKLEVEL;
674 static struct coro *xnext;
675 671
672 /* sometimes transfer is only called to set idle_sp */
673 if (flags == TRANSFER_SET_STACKLEVEL)
674 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
676 if (prev != next) 675 else if (prev != next)
677 { 676 {
678 xnext = next; 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;
679 694
680 if (next->mainstack) 695 if (next->mainstack)
681 { 696 {
697 /* coroutine already started */
682 SAVE (prev, flags); 698 SAVE (prev, flags);
683 LOAD (next); 699 LOAD (next);
684
685 /* mark this state as in-use */
686 next->mainstack = 0;
687 next->tmps_ix = -2;
688
689 /* stacklevel changed? if yes, grab the stack for us! */
690 if (flags & TRANSFER_SAVE_CCTXT)
691 {
692 if (!prev->stack)
693 allocate_stack (prev, 0);
694 else if (prev->cursp != stacklevel
695 && prev->stack->usecnt > 1)
696 {
697 prev->gencnt = ++prev->stack->gencnt;
698 prev->stack->usecnt = 1;
699 }
700
701 /* has our stack been invalidated? */
702 if (next->stack && next->stack->gencnt != next->gencnt)
703 {
704 deallocate_stack (next);
705 allocate_stack (next, 1);
706 coro_create (&(next->stack->cctx),
707 continue_coro, (void *)next,
708 next->stack->sptr, labs (next->stack->ssize));
709 }
710
711 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
712 /* don't add any code here */
713 }
714
715 } 700 }
716 else if (next->tmps_ix == -2)
717 croak ("tried to transfer to running coroutine");
718 else 701 else
719 { 702 {
703 /* need to start coroutine */
720 SAVE (prev, -1); /* first get rid of the old state */ 704 /* first get rid of the old state */
721 705 SAVE (prev, -1);
722 if (flags & TRANSFER_SAVE_CCTXT) 706 /* setup coroutine call */
723 {
724 if (!prev->stack)
725 allocate_stack (prev, 0);
726
727 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
728 {
729 setup_coro (next);
730
731 prev->stack->refcnt++;
732 prev->stack->usecnt++;
733 next->stack = prev->stack;
734 next->gencnt = prev->gencnt;
735 }
736 else
737 {
738 allocate_stack (next, 1);
739 coro_create (&(next->stack->cctx),
740 setup_coro, (void *)next,
741 next->stack->sptr, labs (next->stack->ssize));
742 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
743 /* don't add any code here */
744 }
745 }
746 else
747 setup_coro (next); 707 setup_coro (next);
708 /* need a stack */
709 assert (!next->stack);
710 next->cctx = 0;
748 } 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;
749 } 742 }
750
751 /*
752 * xnext is now either prev or next, depending on wether
753 * we switched the c stack or not. that's why i use a global
754 * variable, that should become thread-specific at one point.
755 */
756 xnext->cursp = stacklevel;
757} 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};
758 809
759static struct coro * 810static struct coro *
760sv_to_coro (SV *arg, const char *funcname, const char *varname) 811SvSTATE (SV *coro)
761{ 812{
762 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)
763 { 821 {
764 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); 822 /* very slow, but rare, check */
765 823 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
766 if (!he) 824 croak ("Coro::State object required");
767 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
768
769 arg = HeVAL(he);
770 } 825 }
771
772 /* must also be changed inside Coro::Cont::yield */
773 if (SvROK(arg) && SvOBJECT(SvRV(arg))
774 && SvSTASH(SvRV(arg)) == coro_state_stash)
775 return (struct coro *) SvIV((SV*)SvRV(arg));
776 826
777 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); 827 mg = SvMAGIC (coro);
778 /*NORETURN*/ 828 assert (mg->mg_type == PERL_MAGIC_ext);
829 return (struct coro *)mg->mg_ptr;
779} 830}
780 831
781static 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
782api_transfer(pTHX_ SV *prev, SV *next, int flags) 841api_transfer (SV *prev, SV *next, int flags)
783{ 842{
784 transfer(aTHX_ 843 dTHX;
785 sv_to_coro (prev, "Coro::transfer", "prev"), 844 struct transfer_args ta;
786 sv_to_coro (next, "Coro::transfer", "next"), 845
787 flags); 846 prepare_transfer (&ta, prev, next, flags);
847 TRANSFER (ta);
788} 848}
789 849
790/** Coro ********************************************************************/ 850/** Coro ********************************************************************/
791 851
792#define PRIO_MAX 3 852#define PRIO_MAX 3
… …
796#define PRIO_IDLE -3 856#define PRIO_IDLE -3
797#define PRIO_MIN -4 857#define PRIO_MIN -4
798 858
799/* for Coro.pm */ 859/* for Coro.pm */
800static GV *coro_current, *coro_idle; 860static GV *coro_current, *coro_idle;
801static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 861static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
802static int coro_nready; 862static int coro_nready;
803 863
804static void 864static void
805coro_enq (SV *sv) 865coro_enq (SV *sv)
806{ 866{
807 if (SvROK (sv)) 867 int prio;
808 { 868
809 SV *hv = SvRV (sv);
810 if (SvTYPE (hv) == SVt_PVHV) 869 if (SvTYPE (sv) != SVt_PVHV)
811 {
812 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
813 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
814
815 prio = prio > PRIO_MAX ? PRIO_MAX
816 : prio < PRIO_MIN ? PRIO_MIN
817 : prio;
818
819 av_push (coro_ready [prio - PRIO_MIN], sv);
820 coro_nready++;
821
822 return;
823 }
824 }
825
826 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++;
827} 876}
828 877
829static SV * 878static SV *
830coro_deq (int min_prio) 879coro_deq (int min_prio)
831{ 880{
… …
834 min_prio -= PRIO_MIN; 883 min_prio -= PRIO_MIN;
835 if (min_prio < 0) 884 if (min_prio < 0)
836 min_prio = 0; 885 min_prio = 0;
837 886
838 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 887 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
839 if (av_len (coro_ready[prio]) >= 0) 888 if (AvFILLp (coro_ready [prio]) >= 0)
840 { 889 {
841 coro_nready--; 890 coro_nready--;
842 return av_shift (coro_ready[prio]); 891 return av_shift (coro_ready [prio]);
843 } 892 }
844 893
845 return 0; 894 return 0;
846} 895}
847 896
848static void 897static int
849api_ready (SV *coro) 898api_ready (SV *coro_sv)
850{ 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;
851 coro_enq (SvREFCNT_inc (coro)); 912 coro_enq (SvREFCNT_inc (coro_sv));
852} 913 UNLOCK;
853 914
915 return 1;
916}
917
854static void 918static int
855api_schedule (int cede) 919api_is_ready (SV *coro_sv)
856{ 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{
857 SV *prev, *next; 929 SV *current, *prev, *next;
858 930
859 prev = GvSV (coro_current); 931 current = GvSV (coro_current);
860 932
861 if (cede) 933 for (;;)
862 coro_enq (SvREFCNT_inc (prev)); 934 {
863 935 LOCK;
864 next = coro_deq (PRIO_MIN); 936 next = coro_deq (PRIO_MIN);
937 UNLOCK;
865 938
866 if (!next) 939 if (next)
867 next = SvREFCNT_inc (GvSV (coro_idle)); 940 break;
868 941
869 GvSV (coro_current) = SvREFCNT_inc (next); 942 {
870 transfer (aTHX_ 943 dSP;
871 sv_to_coro (prev, "Coro::schedule", "current coroutine"), 944
872 sv_to_coro (next, "Coro::schedule", "next coroutine"), 945 ENTER;
873 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 946 SAVETMPS;
874 SvREFCNT_dec (next); 947
875 SvREFCNT_dec (prev); 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);
876} 999}
877 1000
878MODULE = Coro::State PACKAGE = Coro::State 1001MODULE = Coro::State PACKAGE = Coro::State
879 1002
880PROTOTYPES: ENABLE 1003PROTOTYPES: DISABLE
881 1004
882BOOT: 1005BOOT:
883{ /* {} necessary for stoopid perl-5.6.x */ 1006{
884 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1007#ifdef USE_ITHREADS
885 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1008 MUTEX_INIT (&coro_mutex);
1009#endif
1010 BOOT_PAGESIZE;
1011
886 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1012 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
887 1013
888 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1014 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
889 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1015 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
890 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1016 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
891 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
892
893 if (!padlist_cache)
894 padlist_cache = newHV ();
895 1017
896 main_mainstack = PL_mainstack; 1018 main_mainstack = PL_mainstack;
897 1019
898 coroapi.ver = CORO_API_VERSION; 1020 coroapi.ver = CORO_API_VERSION;
899 coroapi.transfer = api_transfer; 1021 coroapi.transfer = api_transfer;
900}
901 1022
902Coro::State 1023 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
903_newprocess(args) 1024}
904 SV * args 1025
905 PROTOTYPE: $ 1026SV *
1027new (char *klass, ...)
906 CODE: 1028 CODE:
907 Coro__State coro; 1029{
1030 struct coro *coro;
1031 HV *hv;
1032 int i;
908 1033
909 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
910 croak ("Coro::State::_newprocess expects an arrayref");
911
912 New (0, coro, 1, struct coro); 1034 Newz (0, coro, 1, struct coro);
1035 coro->args = newAV ();
913 1036
914 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1037 hv = newHV ();
915 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;
916 coro->stack = 0; 1039 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
917 1040
918 RETVAL = coro; 1041 for (i = 1; i < items; i++)
1042 av_push (coro->args, newSVsv (ST (i)));
1043}
919 OUTPUT: 1044 OUTPUT:
920 RETVAL 1045 RETVAL
921 1046
922void 1047void
923transfer(prev, next, flags) 1048_set_stacklevel (...)
924 Coro::State_or_hashref prev 1049 ALIAS:
925 Coro::State_or_hashref next 1050 Coro::State::transfer = 1
926 int flags 1051 Coro::schedule = 2
927 PROTOTYPE: @ 1052 Coro::cede = 3
1053 Coro::Cont::yield = 4
928 CODE: 1054 CODE:
929 PUTBACK; 1055{
930 transfer (aTHX_ prev, next, flags); 1056 struct transfer_args ta;
931 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}
932 1111
933void 1112void
934DESTROY(coro) 1113_clone_state_from (SV *dst, SV *src)
935 Coro::State coro 1114 CODE:
936 CODE: 1115{
1116 struct coro *coro_src = SvSTATE (src);
937 1117
938 if (coro->mainstack && coro->mainstack != main_mainstack) 1118 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
939 {
940 struct coro temp;
941 1119
942 PUTBACK; 1120 ++coro_src->refcnt;
943 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1121 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
944 LOAD(aTHX_ coro); 1122}
945 SPAGAIN;
946
947 destroy_stacks (aTHX);
948
949 LOAD((&temp)); /* this will get rid of defsv etc.. */
950 SPAGAIN;
951
952 coro->mainstack = 0;
953 }
954
955 deallocate_stack (coro);
956
957 Safefree (coro);
958 1123
959void 1124void
960flush()
961 CODE:
962#ifdef MAY_FLUSH
963 flush_padlist_cache ();
964#endif
965
966void
967_exit(code) 1125_exit (code)
968 int code 1126 int code
969 PROTOTYPE: $ 1127 PROTOTYPE: $
970 CODE: 1128 CODE:
971#if defined(__GLIBC__) || _POSIX_C_SOURCE
972 _exit (code); 1129 _exit (code);
973#else
974 signal (SIGTERM, SIG_DFL);
975 raise (SIGTERM);
976 exit (code);
977#endif
978 1130
979MODULE = Coro::State PACKAGE = Coro::Cont 1131int
1132cctx_count ()
1133 CODE:
1134 RETVAL = cctx_count;
1135 OUTPUT:
1136 RETVAL
980 1137
981# this is slightly dirty (should expose a c-level api) 1138int
982 1139cctx_idle ()
983void 1140 CODE:
984yield(...) 1141 RETVAL = cctx_idle;
985 PROTOTYPE: @ 1142 OUTPUT:
986 CODE: 1143 RETVAL
987 static SV *returnstk;
988 SV *sv;
989 AV *defav = GvAV (PL_defgv);
990 struct coro *prev, *next;
991
992 if (!returnstk)
993 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
994
995 /* set up @_ -- ugly */
996 av_clear (defav);
997 av_fill (defav, items - 1);
998 while (items--)
999 av_store (defav, items, SvREFCNT_inc (ST(items)));
1000
1001 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1002 sv = av_pop ((AV *)SvRV (returnstk));
1003 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1004 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1005 SvREFCNT_dec (sv);
1006
1007 transfer(aTHX_ prev, next, 0);
1008 1144
1009MODULE = Coro::State PACKAGE = Coro 1145MODULE = Coro::State PACKAGE = Coro
1010 1146
1011# this is slightly dirty (should expose a c-level api)
1012
1013BOOT: 1147BOOT:
1014{ 1148{
1015 int i; 1149 int i;
1150
1016 HV *stash = gv_stashpv ("Coro", TRUE); 1151 coro_stash = gv_stashpv ("Coro", TRUE);
1017 1152
1018 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1153 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1019 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1154 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1020 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1155 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1021 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1156 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1022 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1157 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1023 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1158 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1024 1159
1025 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1160 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1026 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1161 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1027 1162
1028 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1163 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
… …
1030 1165
1031 { 1166 {
1032 SV *sv = perl_get_sv("Coro::API", 1); 1167 SV *sv = perl_get_sv("Coro::API", 1);
1033 1168
1034 coroapi.schedule = api_schedule; 1169 coroapi.schedule = api_schedule;
1170 coroapi.cede = api_cede;
1035 coroapi.ready = api_ready; 1171 coroapi.ready = api_ready;
1172 coroapi.is_ready = api_is_ready;
1036 coroapi.nready = &coro_nready; 1173 coroapi.nready = &coro_nready;
1037 coroapi.current = coro_current; 1174 coroapi.current = coro_current;
1038 1175
1039 GCoroAPI = &coroapi; 1176 GCoroAPI = &coroapi;
1040 sv_setiv(sv, (IV)&coroapi); 1177 sv_setiv (sv, (IV)&coroapi);
1041 SvREADONLY_on(sv); 1178 SvREADONLY_on (sv);
1042 } 1179 }
1043} 1180}
1044 1181
1045void 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 *
1046ready(self) 1203ready (SV *self)
1047 SV * self 1204 PROTOTYPE: $
1048 CODE: 1205 CODE:
1049 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
1050 1217
1051int 1218int
1052nready(...) 1219nready (...)
1053 PROTOTYPE: 1220 PROTOTYPE:
1054 CODE: 1221 CODE:
1055 RETVAL = coro_nready; 1222 RETVAL = coro_nready;
1056 OUTPUT: 1223 OUTPUT:
1057 RETVAL 1224 RETVAL
1058 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
1059void 1249void
1060schedule(...) 1250_set_state (char *data_)
1061 PROTOTYPE: 1251 PROTOTYPE: $
1062 ALIAS:
1063 cede = 1
1064 CODE: 1252 CODE:
1065 api_schedule (ix); 1253{
1254 struct {
1255 int errorno;
1256 int laststype;
1257 int laststatval;
1258 Stat_t statcache;
1259 } *data = (void *)data_;
1066 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