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.13 by root, Mon Jul 23 22:09:39 2001 UTC vs.
Revision 1.108 by root, Mon Nov 27 18:15:47 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines