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.30 by root, Sat Aug 25 22:19:05 2001 UTC vs.
Revision 1.112 by root, Thu Nov 30 20:52:52 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{
434 if (!IN_DESTRUCT)
435 {
492 /* is this ugly, I ask? */ 436 /* is this ugly, I ask? */
493 while (PL_scopestack_ix) 437 LEAVE_SCOPE (0);
494 LEAVE;
495 438
496 /* sure it is, but more important: is it correct?? :/ */ 439 /* sure it is, but more important: is it correct?? :/ */
497 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
498 FREETMPS; 440 FREETMPS;
441
442 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
443 }
499 444
500 while (PL_curstackinfo->si_next) 445 while (PL_curstackinfo->si_next)
501 PL_curstackinfo = PL_curstackinfo->si_next; 446 PL_curstackinfo = PL_curstackinfo->si_next;
502 447
503 while (PL_curstackinfo) 448 while (PL_curstackinfo)
504 { 449 {
505 PERL_SI *p = PL_curstackinfo->si_prev; 450 PERL_SI *p = PL_curstackinfo->si_prev;
506 451
507 { 452 { /*D*//*remove*/
508 dSP; 453 dSP;
509 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 454 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
510 PUTBACK; /* possibly superfluous */ 455 PUTBACK; /* possibly superfluous */
511 } 456 }
512 457
513 if (PL_main_cv != Nullcv) /* don't during destruction. hack? */ 458 if (!IN_DESTRUCT)
514 dounwind(-1); 459 {
515 460 dounwind (-1);/*D*//*remove*/
516 SvREFCNT_dec(PL_curstackinfo->si_stack); 461 SvREFCNT_dec (PL_curstackinfo->si_stack);
462 }
463
517 Safefree(PL_curstackinfo->si_cxstack); 464 Safefree (PL_curstackinfo->si_cxstack);
518 Safefree(PL_curstackinfo); 465 Safefree (PL_curstackinfo);
519 PL_curstackinfo = p; 466 PL_curstackinfo = p;
520 } 467 }
521 468
522 Safefree(PL_tmps_stack); 469 Safefree (PL_tmps_stack);
523 Safefree(PL_markstack); 470 Safefree (PL_markstack);
524 Safefree(PL_scopestack); 471 Safefree (PL_scopestack);
525 Safefree(PL_savestack); 472 Safefree (PL_savestack);
473#if !PERL_VERSION_ATLEAST (5,9,0)
526 Safefree(PL_retstack); 474 Safefree (PL_retstack);
527}
528
529static void
530allocate_stack (Coro__State ctx, int alloc)
531{
532 coro_stack *stack;
533
534 New (0, stack, 1, coro_stack);
535
536 stack->refcnt = 1;
537 stack->usecnt = 1;
538 stack->gencnt = ctx->gencnt = 0;
539 if (alloc)
540 {
541#ifdef HAVE_MMAP
542 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
543 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
544 if (stack->sptr == (void *)-1)
545#endif 475#endif
546 {
547 /*FIXME*//*D*//* reasonable stack size! */
548 stack->ssize = -4096 * sizeof (long);
549 New (0, stack->sptr, 4096, long);
550 }
551 }
552 else
553 stack->sptr = 0;
554
555 ctx->stack = stack;
556} 476}
557 477
558static void 478static void
559deallocate_stack (Coro__State ctx) 479setup_coro (struct coro *coro)
560{
561 coro_stack *stack = ctx->stack;
562
563 ctx->stack = 0;
564
565 if (stack)
566 {
567 if (!--stack->refcnt)
568 {
569#ifdef HAVE_MMAP
570 if (stack->ssize > 0 && stack->sptr)
571 munmap (stack->sptr, stack->ssize);
572 else
573#else
574 Safefree (stack->sptr);
575#endif
576 Safefree (stack);
577 }
578 else if (ctx->gencnt == stack->gencnt)
579 --stack->usecnt;
580 }
581}
582
583static void
584setup_coro (void *arg)
585{ 480{
586 /* 481 /*
587 * emulate part of the perl startup here. 482 * emulate part of the perl startup here.
588 */ 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{
589 dSP; 530 dSP;
590 Coro__State ctx = (Coro__State)arg; 531 LOGOP myop;
591 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
592 532
593 coro_init_stacks (aTHX); 533 Zero (&myop, 1, LOGOP);
594 /*PL_curcop = 0;*/ 534 myop.op_next = PL_op;
595 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 535 myop.op_flags = OPf_WANT_VOID;
596 SvREFCNT_dec (GvAV (PL_defgv));
597 GvAV (PL_defgv) = ctx->args;
598 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);
599 SPAGAIN; 543 SPAGAIN;
600
601 if (ctx->stack)
602 {
603 ctx->cursp = 0;
604
605 PUSHMARK(SP);
606 PUTBACK;
607 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
608
609 if (SvTRUE (ERRSV))
610 croak (NULL);
611 else
612 croak ("FATAL: CCTXT coroutine returned!");
613 }
614 else
615 {
616 UNOP myop;
617
618 PL_op = (OP *)&myop;
619
620 Zero(&myop, 1, UNOP);
621 myop.op_next = Nullop;
622 myop.op_flags = OPf_WANT_VOID;
623
624 PUSHMARK(SP);
625 XPUSHs (sub_init);
626 /*
627 * the next line is slightly wrong, as PL_op->op_next
628 * is actually being executed so we skip the first op.
629 * that doesn't matter, though, since it is only
630 * pp_nextstate and we never return...
631 * ah yes, and I don't care anyways ;)
632 */
633 PUTBACK;
634 PL_op = pp_entersub();
635 SPAGAIN;
636
637 ENTER; /* necessary e.g. for dounwind */
638 }
639} 544}
640 545
641static void 546static void
642continue_coro (void *arg) 547coro_run (void *arg)
643{ 548{
549 /* coro_run is the alternative epilogue of transfer() */
550 UNLOCK;
551
644 /* 552 /*
645 * this is a _very_ stripped down perl interpreter ;) 553 * this is a _very_ stripped down perl interpreter ;)
646 */ 554 */
647 Coro__State ctx = (Coro__State)arg; 555 PL_top_env = &PL_start_env;
648 556
649 /*FIXME*//* must set up top_env here */ 557 /* inject call to cctx_init */
650 ctx->cursp = 0; 558 prepare_cctx ((coro_cctx *)arg);
651 PL_op = PL_op->op_next;
652 CALLRUNOPS(aTHX);
653 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);
654 abort (); 564 abort ();
655} 565}
656 566
657STATIC 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
658transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 668transfer (struct coro *prev, struct coro *next, int flags)
659{ 669{
660 dSTACKLEVEL; 670 dSTACKLEVEL;
661 static struct coro *xnext;
662 671
672 /* sometimes transfer is only called to set idle_sp */
673 if (flags == TRANSFER_SET_STACKLEVEL)
674 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
663 if (prev != next) 675 else if (prev != next)
664 { 676 {
665 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 if (!prev->flags & CF_RUNNING)
688 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
689
690 if (next->flags & CF_RUNNING)
691 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
692
693 prev->flags &= ~CF_RUNNING;
694 next->flags |= CF_RUNNING;
695
696 LOCK;
666 697
667 if (next->mainstack) 698 if (next->mainstack)
668 { 699 {
700 /* coroutine already started */
669 SAVE (prev, flags); 701 SAVE (prev, flags);
670 LOAD (next); 702 LOAD (next);
671
672 /* mark this state as in-use */
673 next->mainstack = 0;
674 next->tmps_ix = -2;
675
676 /* stacklevel changed? if yes, grab the stack for us! */
677 if (flags & TRANSFER_SAVE_CCTXT)
678 {
679 if (!prev->stack)
680 allocate_stack (prev, 0);
681 else if (prev->cursp != stacklevel
682 && prev->stack->usecnt > 1)
683 {
684 prev->gencnt = ++prev->stack->gencnt;
685 prev->stack->usecnt = 1;
686 }
687
688 /* has our stack been invalidated? */
689 if (next->stack && next->stack->gencnt != next->gencnt)
690 {
691 deallocate_stack (next);
692 allocate_stack (next, 1);
693 coro_create (&(next->stack->cctx),
694 continue_coro, (void *)next,
695 next->stack->sptr, labs (next->stack->ssize));
696 }
697
698 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
699 /* don't add any code here */
700 }
701
702 } 703 }
703 else if (next->tmps_ix == -2)
704 croak ("tried to transfer to running coroutine");
705 else 704 else
706 { 705 {
706 /* need to start coroutine */
707 SAVE (prev, -1); /* first get rid of the old state */ 707 /* first get rid of the old state */
708 708 SAVE (prev, -1);
709 if (flags & TRANSFER_SAVE_CCTXT) 709 /* setup coroutine call */
710 {
711 if (!prev->stack)
712 allocate_stack (prev, 0);
713
714 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
715 {
716 setup_coro (next);
717
718 prev->stack->refcnt++;
719 prev->stack->usecnt++;
720 next->stack = prev->stack;
721 next->gencnt = prev->gencnt;
722 }
723 else
724 {
725 allocate_stack (next, 1);
726 coro_create (&(next->stack->cctx),
727 setup_coro, (void *)next,
728 next->stack->sptr, labs (next->stack->ssize));
729 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
730 /* don't add any code here */
731 }
732 }
733 else
734 setup_coro (next); 710 setup_coro (next);
711 /* need a new stack */
712 assert (!next->stack);
735 } 713 }
714
715 prev__cctx = prev->cctx;
716
717 /* possibly "free" the cctx */
718 if (prev__cctx->idle_sp == STACKLEVEL)
719 {
720 assert (PL_top_env == prev__cctx->top_env);
721
722 cctx_put (prev__cctx);
723 prev->cctx = 0;
724 }
725
726 if (!next->cctx)
727 next->cctx = cctx_get ();
728
729 if (prev__cctx != next->cctx)
730 {
731 assert ( prev__cctx->inuse);
732 assert (!next->cctx->inuse);
733
734 prev__cctx->inuse = 0;
735 next->cctx->inuse = 1;
736
737 prev__cctx->top_env = PL_top_env;
738 PL_top_env = next->cctx->top_env;
739 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
740 }
741
742 free_coro_mortal ();
743
744 UNLOCK;
736 } 745 }
737
738 /*
739 * xnext is now either prev or next, depending on wether
740 * we switched the c stack or not. that's why i use a global
741 * variable, that should become thread-specific at one point.
742 */
743 xnext->cursp = stacklevel;
744} 746}
747
748struct transfer_args
749{
750 struct coro *prev, *next;
751 int flags;
752};
753
754#define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags)
755
756static void
757coro_state_destroy (struct coro *coro)
758{
759 if (coro->refcnt--)
760 return;
761
762 if (coro->flags & CF_RUNNING)
763 croak ("FATAL: tried to destroy currently running coroutine");
764
765 if (coro->mainstack && coro->mainstack != main_mainstack)
766 {
767 struct coro temp;
768
769 SAVE ((&temp), TRANSFER_SAVE_ALL);
770 LOAD (coro);
771
772 coro_destroy_stacks ();
773
774 LOAD ((&temp)); /* this will get rid of defsv etc.. */
775
776 coro->mainstack = 0;
777 }
778
779 cctx_free (coro->cctx);
780 SvREFCNT_dec (coro->args);
781 Safefree (coro);
782}
783
784static int
785coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
786{
787 struct coro *coro = (struct coro *)mg->mg_ptr;
788 mg->mg_ptr = 0;
789
790 coro_state_destroy (coro);
791
792 return 0;
793}
794
795static int
796coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
797{
798 struct coro *coro = (struct coro *)mg->mg_ptr;
799
800 ++coro->refcnt;
801
802 return 0;
803}
804
805static MGVTBL coro_state_vtbl = {
806 0, 0, 0, 0,
807 coro_state_clear,
808 0,
809#ifdef MGf_DUP
810 coro_state_dup,
811#else
812# define MGf_DUP 0
813#endif
814};
745 815
746static struct coro * 816static struct coro *
747sv_to_coro (SV *arg, const char *funcname, const char *varname) 817SvSTATE (SV *coro)
748{ 818{
749 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV) 819 HV *stash;
820 MAGIC *mg;
821
822 if (SvROK (coro))
823 coro = SvRV (coro);
824
825 stash = SvSTASH (coro);
826 if (stash != coro_stash && stash != coro_state_stash)
750 { 827 {
751 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); 828 /* very slow, but rare, check */
752 829 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
753 if (!he) 830 croak ("Coro::State object required");
754 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
755
756 arg = HeVAL(he);
757 } 831 }
758
759 /* must also be changed inside Coro::Cont::yield */
760 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
761 return (struct coro *) SvIV((SV*)SvRV(arg));
762 832
763 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); 833 mg = SvMAGIC (coro);
764 /*NORETURN*/ 834 assert (mg->mg_type == PERL_MAGIC_ext);
835 return (struct coro *)mg->mg_ptr;
765} 836}
766 837
767static void 838static void
839prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags)
840{
841 ta->prev = SvSTATE (prev);
842 ta->next = SvSTATE (next);
843 ta->flags = flags;
844}
845
846static void
768api_transfer(pTHX_ SV *prev, SV *next, int flags) 847api_transfer (SV *prev, SV *next, int flags)
769{ 848{
770 transfer(aTHX_ 849 dTHX;
771 sv_to_coro (prev, "Coro::transfer", "prev"), 850 struct transfer_args ta;
772 sv_to_coro (next, "Coro::transfer", "next"), 851
773 flags); 852 prepare_transfer (&ta, prev, next, flags);
853 TRANSFER (ta);
774} 854}
775 855
776/** Coro ********************************************************************/ 856/** Coro ********************************************************************/
777 857
778#define PRIO_MAX 3 858#define PRIO_MAX 3
… …
782#define PRIO_IDLE -3 862#define PRIO_IDLE -3
783#define PRIO_MIN -4 863#define PRIO_MIN -4
784 864
785/* for Coro.pm */ 865/* for Coro.pm */
786static GV *coro_current, *coro_idle; 866static GV *coro_current, *coro_idle;
787static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 867static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
788static int coro_nready; 868static int coro_nready;
789 869
790static void 870static void
791coro_enq (SV *sv) 871coro_enq (SV *coro_sv)
792{ 872{
793 if (SvROK (sv)) 873 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
794 {
795 SV *hv = SvRV (sv);
796 if (SvTYPE (hv) == SVt_PVHV)
797 {
798 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
799 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
800
801 prio = prio > PRIO_MAX ? PRIO_MAX
802 : prio < PRIO_MIN ? PRIO_MIN
803 : prio;
804
805 av_push (coro_ready [prio - PRIO_MIN], sv);
806 coro_nready++; 874 coro_nready++;
807
808 return;
809 }
810 }
811
812 croak ("Coro::ready tried to enqueue something that is not a coroutine");
813} 875}
814 876
815static SV * 877static SV *
816coro_deq (int min_prio) 878coro_deq (int min_prio)
817{ 879{
… …
820 min_prio -= PRIO_MIN; 882 min_prio -= PRIO_MIN;
821 if (min_prio < 0) 883 if (min_prio < 0)
822 min_prio = 0; 884 min_prio = 0;
823 885
824 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 886 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
825 if (av_len (coro_ready[prio]) >= 0) 887 if (AvFILLp (coro_ready [prio]) >= 0)
826 { 888 {
827 coro_nready--; 889 coro_nready--;
828 return av_shift (coro_ready[prio]); 890 return av_shift (coro_ready [prio]);
829 } 891 }
830 892
831 return 0; 893 return 0;
832} 894}
833 895
834static void 896static int
835api_ready (SV *coro) 897api_ready (SV *coro_sv)
836{ 898{
899 struct coro *coro;
900
901 if (SvROK (coro_sv))
902 coro_sv = SvRV (coro_sv);
903
904 coro = SvSTATE (coro_sv);
905
906 if (coro->flags & CF_READY)
907 return 0;
908
909 if (coro->flags & CF_RUNNING)
910 croak ("Coro::ready called on currently running coroutine");
911
912 coro->flags |= CF_READY;
913
914 LOCK;
837 coro_enq (SvREFCNT_inc (coro)); 915 coro_enq (SvREFCNT_inc (coro_sv));
838} 916 UNLOCK;
839 917
918 return 1;
919}
920
840static void 921static int
841api_schedule (int cede) 922api_is_ready (SV *coro_sv)
842{ 923{
924 return !!SvSTATE (coro_sv)->flags & CF_READY;
925}
926
927static void
928prepare_schedule (struct transfer_args *ta)
929{
843 SV *prev, *next; 930 SV *current, *prev, *next;
844 931
845 prev = GvSV (coro_current); 932 current = GvSV (coro_current);
846 933
847 if (cede) 934 for (;;)
848 coro_enq (SvREFCNT_inc (prev)); 935 {
849 936 LOCK;
850 next = coro_deq (PRIO_MIN); 937 next = coro_deq (PRIO_MIN);
938 UNLOCK;
851 939
852 if (!next) 940 if (next)
853 next = SvREFCNT_inc (GvSV (coro_idle)); 941 break;
854 942
855 GvSV (coro_current) = SvREFCNT_inc (next); 943 {
856 transfer (aTHX_ 944 dSP;
857 sv_to_coro (prev, "Coro::schedule", "current coroutine"), 945
858 sv_to_coro (next, "Coro::schedule", "next coroutine"), 946 ENTER;
859 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 947 SAVETMPS;
860 SvREFCNT_dec (next); 948
861 SvREFCNT_dec (prev); 949 PUSHMARK (SP);
950 PUTBACK;
951 call_sv (GvSV (coro_idle), G_DISCARD);
952
953 FREETMPS;
954 LEAVE;
955 }
956 }
957
958 prev = SvRV (current);
959 SvRV (current) = next;
960
961 /* free this only after the transfer */
962 LOCK;
963 free_coro_mortal ();
964 UNLOCK;
965 coro_mortal = prev;
966
967 ta->prev = SvSTATE (prev);
968 ta->next = SvSTATE (next);
969 ta->flags = TRANSFER_SAVE_ALL;
970
971 ta->next->flags &= ~CF_READY;
972}
973
974static void
975prepare_cede (struct transfer_args *ta)
976{
977 api_ready (GvSV (coro_current));
978
979 prepare_schedule (ta);
980}
981
982static void
983api_schedule (void)
984{
985 dTHX;
986 struct transfer_args ta;
987
988 prepare_schedule (&ta);
989 TRANSFER (ta);
990}
991
992static void
993api_cede (void)
994{
995 dTHX;
996 struct transfer_args ta;
997
998 prepare_cede (&ta);
999 TRANSFER (ta);
862} 1000}
863 1001
864MODULE = Coro::State PACKAGE = Coro::State 1002MODULE = Coro::State PACKAGE = Coro::State
865 1003
866PROTOTYPES: ENABLE 1004PROTOTYPES: DISABLE
867 1005
868BOOT: 1006BOOT:
869{ /* {} necessary for stoopid perl-5.6.x */ 1007{
870 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1008#ifdef USE_ITHREADS
871 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1009 MUTEX_INIT (&coro_mutex);
1010#endif
1011 BOOT_PAGESIZE;
1012
872 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1013 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
873 1014
874 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1015 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
875 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1016 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
876 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1017 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
877 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
878
879 if (!padlist_cache)
880 padlist_cache = newHV ();
881 1018
882 main_mainstack = PL_mainstack; 1019 main_mainstack = PL_mainstack;
883 1020
884 coroapi.ver = CORO_API_VERSION; 1021 coroapi.ver = CORO_API_VERSION;
885 coroapi.transfer = api_transfer; 1022 coroapi.transfer = api_transfer;
886}
887 1023
888Coro::State 1024 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
889_newprocess(args) 1025}
890 SV * args 1026
891 PROTOTYPE: $ 1027SV *
1028new (char *klass, ...)
892 CODE: 1029 CODE:
893 Coro__State coro; 1030{
1031 struct coro *coro;
1032 HV *hv;
1033 int i;
894 1034
895 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
896 croak ("Coro::State::_newprocess expects an arrayref");
897
898 New (0, coro, 1, struct coro); 1035 Newz (0, coro, 1, struct coro);
1036 coro->args = newAV ();
899 1037
900 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1038 hv = newHV ();
901 coro->mainstack = 0; /* actual work is done inside transfer */ 1039 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
902 coro->stack = 0; 1040 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
903 1041
904 RETVAL = coro; 1042 for (i = 1; i < items; i++)
1043 av_push (coro->args, newSVsv (ST (i)));
1044}
905 OUTPUT: 1045 OUTPUT:
906 RETVAL 1046 RETVAL
907 1047
908void 1048void
909transfer(prev, next, flags) 1049_set_stacklevel (...)
910 Coro::State_or_hashref prev 1050 ALIAS:
911 Coro::State_or_hashref next 1051 Coro::State::transfer = 1
912 int flags 1052 Coro::schedule = 2
913 PROTOTYPE: @ 1053 Coro::cede = 3
1054 Coro::Cont::yield = 4
914 CODE: 1055 CODE:
915 PUTBACK; 1056{
916 transfer (aTHX_ prev, next, flags); 1057 struct transfer_args ta;
917 SPAGAIN; 1058
1059 switch (ix)
1060 {
1061 case 0:
1062 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1063 ta.next = 0;
1064 ta.flags = TRANSFER_SET_STACKLEVEL;
1065 break;
1066
1067 case 1:
1068 if (items != 3)
1069 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1070
1071 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1072 break;
1073
1074 case 2:
1075 prepare_schedule (&ta);
1076 break;
1077
1078 case 3:
1079 prepare_cede (&ta);
1080 break;
1081
1082 case 4:
1083 {
1084 SV *yieldstack;
1085 SV *sv;
1086 AV *defav = GvAV (PL_defgv);
1087
1088 yieldstack = *hv_fetch (
1089 (HV *)SvRV (GvSV (coro_current)),
1090 "yieldstack", sizeof ("yieldstack") - 1,
1091 0
1092 );
1093
1094 /* set up @_ -- ugly */
1095 av_clear (defav);
1096 av_fill (defav, items - 1);
1097 while (items--)
1098 av_store (defav, items, SvREFCNT_inc (ST(items)));
1099
1100 sv = av_pop ((AV *)SvRV (yieldstack));
1101 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1102 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1103 ta.flags = 0;
1104 SvREFCNT_dec (sv);
1105 }
1106 break;
1107
1108 }
1109
1110 TRANSFER (ta);
1111}
918 1112
919void 1113void
920DESTROY(coro) 1114_clone_state_from (SV *dst, SV *src)
921 Coro::State coro 1115 CODE:
922 CODE: 1116{
1117 struct coro *coro_src = SvSTATE (src);
923 1118
924 if (coro->mainstack && coro->mainstack != main_mainstack) 1119 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
925 {
926 struct coro temp;
927 1120
928 PUTBACK; 1121 ++coro_src->refcnt;
929 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1122 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
930 LOAD(aTHX_ coro); 1123}
931 SPAGAIN;
932
933 destroy_stacks (aTHX);
934
935 LOAD((&temp)); /* this will get rid of defsv etc.. */
936 SPAGAIN;
937
938 coro->mainstack = 0;
939 }
940
941 deallocate_stack (coro);
942
943 Safefree (coro);
944 1124
945void 1125void
946flush()
947 CODE:
948#ifdef MAY_FLUSH
949 flush_padlist_cache ();
950#endif
951
952void
953_exit(code) 1126_exit (code)
954 int code 1127 int code
955 PROTOTYPE: $ 1128 PROTOTYPE: $
956 CODE: 1129 CODE:
957#if defined(__GLIBC__) || _POSIX_C_SOURCE
958 _exit (code); 1130 _exit (code);
959#else
960 signal (SIGTERM, SIG_DFL);
961 raise (SIGTERM);
962 exit (code);
963#endif
964 1131
965MODULE = Coro::State PACKAGE = Coro::Cont 1132int
1133cctx_count ()
1134 CODE:
1135 RETVAL = cctx_count;
1136 OUTPUT:
1137 RETVAL
966 1138
967# this is slightly dirty (should expose a c-level api) 1139int
968 1140cctx_idle ()
969void 1141 CODE:
970yield(...) 1142 RETVAL = cctx_idle;
971 PROTOTYPE: @ 1143 OUTPUT:
972 CODE: 1144 RETVAL
973 static SV *returnstk;
974 SV *sv;
975 AV *defav = GvAV (PL_defgv);
976 struct coro *prev, *next;
977
978 if (!returnstk)
979 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
980
981 /* set up @_ -- ugly */
982 av_clear (defav);
983 av_fill (defav, items - 1);
984 while (items--)
985 av_store (defav, items, SvREFCNT_inc (ST(items)));
986
987 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
988 sv = av_pop ((AV *)SvRV (returnstk));
989 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
990 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
991 SvREFCNT_dec (sv);
992
993 transfer(aTHX_ prev, next, 0);
994 1145
995MODULE = Coro::State PACKAGE = Coro 1146MODULE = Coro::State PACKAGE = Coro
996 1147
997# this is slightly dirty (should expose a c-level api)
998
999BOOT: 1148BOOT:
1000{ 1149{
1001 int i; 1150 int i;
1151
1002 HV *stash = gv_stashpv ("Coro", TRUE); 1152 coro_stash = gv_stashpv ("Coro", TRUE);
1003 1153
1004 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1154 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1005 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1155 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1006 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1156 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1007 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1157 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1008 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1158 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1009 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1159 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1010 1160
1011 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1161 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1012 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1162 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1013 1163
1014 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1164 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
… …
1016 1166
1017 { 1167 {
1018 SV *sv = perl_get_sv("Coro::API", 1); 1168 SV *sv = perl_get_sv("Coro::API", 1);
1019 1169
1020 coroapi.schedule = api_schedule; 1170 coroapi.schedule = api_schedule;
1171 coroapi.cede = api_cede;
1021 coroapi.ready = api_ready; 1172 coroapi.ready = api_ready;
1173 coroapi.is_ready = api_is_ready;
1022 coroapi.nready = &coro_nready; 1174 coroapi.nready = &coro_nready;
1023 coroapi.current = coro_current; 1175 coroapi.current = coro_current;
1024 1176
1025 GCoroAPI = &coroapi; 1177 GCoroAPI = &coroapi;
1026 sv_setiv(sv, (IV)&coroapi); 1178 sv_setiv (sv, (IV)&coroapi);
1027 SvREADONLY_on(sv); 1179 SvREADONLY_on (sv);
1028 } 1180 }
1029} 1181}
1030 1182
1031void 1183int
1184prio (Coro::State coro, int newprio = 0)
1185 ALIAS:
1186 nice = 1
1187 CODE:
1188{
1189 RETVAL = coro->prio;
1190
1191 if (items > 1)
1192 {
1193 if (ix)
1194 newprio += coro->prio;
1195
1196 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1197 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1198
1199 coro->prio = newprio;
1200 }
1201}
1202
1203SV *
1032ready(self) 1204ready (SV *self)
1033 SV * self 1205 PROTOTYPE: $
1034 CODE: 1206 CODE:
1035 api_ready (self); 1207 RETVAL = boolSV (api_ready (self));
1208 OUTPUT:
1209 RETVAL
1210
1211SV *
1212is_ready (SV *self)
1213 PROTOTYPE: $
1214 CODE:
1215 RETVAL = boolSV (api_is_ready (self));
1216 OUTPUT:
1217 RETVAL
1036 1218
1037int 1219int
1038nready(...) 1220nready (...)
1039 PROTOTYPE: 1221 PROTOTYPE:
1040 CODE: 1222 CODE:
1041 RETVAL = coro_nready; 1223 RETVAL = coro_nready;
1042 OUTPUT: 1224 OUTPUT:
1043 RETVAL 1225 RETVAL
1044 1226
1227MODULE = Coro::State PACKAGE = Coro::AIO
1228
1229SV *
1230_get_state ()
1231 CODE:
1232{
1233 struct {
1234 int errorno;
1235 int laststype;
1236 int laststatval;
1237 Stat_t statcache;
1238 } data;
1239
1240 data.errorno = errno;
1241 data.laststype = PL_laststype;
1242 data.laststatval = PL_laststatval;
1243 data.statcache = PL_statcache;
1244
1245 RETVAL = newSVpvn ((char *)&data, sizeof data);
1246}
1247 OUTPUT:
1248 RETVAL
1249
1045void 1250void
1046schedule(...) 1251_set_state (char *data_)
1047 PROTOTYPE: 1252 PROTOTYPE: $
1048 ALIAS:
1049 cede = 1
1050 CODE: 1253 CODE:
1051 api_schedule (ix); 1254{
1255 struct {
1256 int errorno;
1257 int laststype;
1258 int laststatval;
1259 Stat_t statcache;
1260 } *data = (void *)data_;
1052 1261
1262 errno = data->errorno;
1263 PL_laststype = data->laststype;
1264 PL_laststatval = data->laststatval;
1265 PL_statcache = data->statcache;
1266}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines