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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines