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.121 by root, Sat Dec 2 20:40:25 2006 UTC

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