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.24 by root, Tue Aug 14 14:56:22 2001 UTC vs.
Revision 1.107 by root, Mon Nov 27 02:15:51 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines