ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.24 by root, Tue Aug 14 14:56:22 2001 UTC vs.
Revision 1.109 by root, Mon Nov 27 18:45:29 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines