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.13 by root, Mon Jul 23 22:09:39 2001 UTC vs.
Revision 1.113 by root, Thu Nov 30 20:54:24 2006 UTC

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

Diff Legend

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