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

Diff Legend

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