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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines