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

Diff Legend

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