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.49 by pcg, Sun Nov 23 03:34:13 2003 UTC vs.
Revision 1.163 by root, Mon Sep 24 18:30:58 2007 UTC

1#include "libcoro/coro.c"
2
3#define PERL_NO_GET_CONTEXT
4
1#include "EXTERN.h" 5#include "EXTERN.h"
2#include "perl.h" 6#include "perl.h"
3#include "XSUB.h" 7#include "XSUB.h"
4 8
5#include "patchlevel.h" 9#include "patchlevel.h"
6 10
7#if PATCHLEVEL < 6 11#include <stdio.h>
12#include <errno.h>
13#include <assert.h>
14
15#ifdef HAVE_MMAP
16# include <unistd.h>
17# include <sys/mman.h>
18# ifndef MAP_ANONYMOUS
19# ifdef MAP_ANON
20# define MAP_ANONYMOUS MAP_ANON
21# else
22# undef HAVE_MMAP
23# endif
24# endif
25# include <limits.h>
26# ifndef PAGESIZE
27# define PAGESIZE pagesize
28# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
29static long pagesize;
30# else
31# define BOOT_PAGESIZE (void)0
32# endif
33#else
34# define PAGESIZE 0
35# define BOOT_PAGESIZE (void)0
36#endif
37
38#if CORO_USE_VALGRIND
39# include <valgrind/valgrind.h>
40# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
41#else
42# define REGISTER_STACK(cctx,start,end)
43#endif
44
45/* the maximum number of idle cctx that will be pooled */
46#define MAX_IDLE_CCTX 8
47
48#define PERL_VERSION_ATLEAST(a,b,c) \
49 (PERL_REVISION > (a) \
50 || (PERL_REVISION == (a) \
51 && (PERL_VERSION > (b) \
52 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
53
54#if !PERL_VERSION_ATLEAST (5,6,0)
8# ifndef PL_ppaddr 55# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr 56# define PL_ppaddr ppaddr
10# endif 57# endif
11# ifndef call_sv 58# ifndef call_sv
12# define call_sv perl_call_sv 59# define call_sv perl_call_sv
23# ifndef IS_PADCONST 70# ifndef IS_PADCONST
24# define IS_PADCONST(v) 0 71# define IS_PADCONST(v) 0
25# endif 72# endif
26#endif 73#endif
27 74
28#include "libcoro/coro.c" 75/* 5.8.7 */
29 76#ifndef SvRV_set
30#include <signal.h> 77# define SvRV_set(s,v) SvRV(s) = (v)
31
32#ifdef HAVE_MMAP
33# include <unistd.h>
34# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS
36# ifdef MAP_ANON
37# define MAP_ANONYMOUS MAP_ANON
38# else
39# undef HAVE_MMAP
40# endif
41# endif 78#endif
42#endif
43 79
44#define MAY_FLUSH /* increases codesize and is rarely used */ 80#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
81# undef CORO_STACKGUARD
82#endif
45 83
46#define SUB_INIT "Coro::State::initialize" 84#ifndef CORO_STACKGUARD
47#define UCORO_STATE "_coro_state" 85# define CORO_STACKGUARD 0
86#endif
48 87
49/* The next macro should declare a variable stacklevel that contains and approximation 88/* prefer perl internal functions over our own? */
50 * to the current C stack pointer. Its property is that it changes with each call 89#ifndef CORO_PREFER_PERL_FUNCTIONS
51 * and should be unique. */ 90# define CORO_PREFER_PERL_FUNCTIONS 0
91#endif
92
93/* The next macros try to return the current stack pointer, in an as
94 * portable way as possible. */
95#define dSTACKLEVEL volatile char stacklevel
52#define dSTACKLEVEL void *stacklevel = &stacklevel 96#define STACKLEVEL ((void *)&stacklevel)
53 97
54#define IN_DESTRUCT (PL_main_cv == Nullcv) 98#define IN_DESTRUCT (PL_main_cv == Nullcv)
55 99
56#define labs(l) ((l) >= 0 ? (l) : -(l)) 100#if __GNUC__ >= 3
101# define attribute(x) __attribute__(x)
102# define BARRIER __asm__ __volatile__ ("" : : : "memory")
103#else
104# define attribute(x)
105# define BARRIER
106#endif
107
108#define NOINLINE attribute ((noinline))
57 109
58#include "CoroAPI.h" 110#include "CoroAPI.h"
59 111
112#ifdef USE_ITHREADS
113static perl_mutex coro_mutex;
114# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
115# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
116#else
117# define LOCK (void)0
118# define UNLOCK (void)0
119#endif
120
121/* helper storage struct for Coro::AIO */
122struct io_state
123{
124 int errorno;
125 I32 laststype;
126 int laststatval;
127 Stat_t statcache;
128};
129
130static size_t coro_stacksize = CORO_STACKSIZE;
60static struct CoroAPI coroapi; 131static struct CoroAPI coroapi;
132static AV *main_mainstack; /* used to differentiate between $main and others */
133static JMPENV *main_top_env;
134static HV *coro_state_stash, *coro_stash;
135static SV *coro_mortal; /* will be freed after next transfer */
61 136
62/* this is actually not only the c stack but also c registers etc... */ 137/* async_pool helper stuff */
138static SV *sv_pool_rss;
139static SV *sv_pool_size;
140static AV *av_async_pool;
141
142static struct coro_cctx *cctx_first;
143static int cctx_count, cctx_idle;
144
145/* this is a structure representing a c-level coroutine */
63typedef struct { 146typedef struct coro_cctx {
64 int refcnt; /* pointer reference counter */ 147 struct coro_cctx *next;
65 int usecnt; /* shared by how many coroutines */
66 int gencnt; /* generation counter */
67 148
149 /* the stack */
150 void *sptr;
151 size_t ssize;
152
153 /* cpu state */
154 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
155 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
156 JMPENV *top_env;
68 coro_context cctx; 157 coro_context cctx;
69 158
70 void *sptr; 159#if CORO_USE_VALGRIND
71 long ssize; /* positive == mmap, otherwise malloc */ 160 int valgrind_id;
72} coro_stack; 161#endif
162 char inuse, mapped;
163} coro_cctx;
73 164
165enum {
166 CF_RUNNING = 0x0001, /* coroutine is running */
167 CF_READY = 0x0002, /* coroutine is ready */
168 CF_NEW = 0x0004, /* has never been switched to */
169 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
170};
171
172/* this is a structure representing a perl-level coroutine */
74struct coro { 173struct coro {
75 /* the top-level JMPENV for each coroutine, needed to catch dies. */ 174 /* the c coroutine allocated to this perl coroutine, if any */
76 JMPENV start_env; 175 coro_cctx *cctx;
77
78 /* the optional C context */
79 coro_stack *stack;
80 void *cursp;
81 int gencnt;
82
83 /* optionally saved, might be zero */
84 AV *defav;
85 SV *defsv;
86 SV *errsv;
87
88 /* saved global state not related to stacks */
89 U8 dowarn;
90 I32 in_eval;
91
92 /* the stacks and related info (callchain etc..) */
93 PERL_SI *curstackinfo;
94 AV *curstack;
95 AV *mainstack;
96 SV **stack_sp;
97 OP *op;
98 SV **curpad;
99 AV *comppad;
100 SV **stack_base;
101 SV **stack_max;
102 SV **tmps_stack;
103 I32 tmps_floor;
104 I32 tmps_ix;
105 I32 tmps_max;
106 I32 *markstack;
107 I32 *markstack_ptr;
108 I32 *markstack_max;
109 I32 *scopestack;
110 I32 scopestack_ix;
111 I32 scopestack_max;
112 ANY *savestack;
113 I32 savestack_ix;
114 I32 savestack_max;
115 OP **retstack;
116 I32 retstack_ix;
117 I32 retstack_max;
118 COP *curcop;
119 JMPENV *top_env;
120 176
121 /* data associated with this coroutine (initial args) */ 177 /* data associated with this coroutine (initial args) */
122 AV *args; 178 AV *args;
179 int refcnt;
180 int save; /* CORO_SAVE flags */
181 int flags; /* CF_ flags */
182
183 /* optionally saved, might be zero */
184 AV *defav; /* @_ */
185 SV *defsv; /* $_ */
186 SV *errsv; /* $@ */
187 GV *deffh; /* default filehandle */
188 SV *irssv; /* $/ */
189 SV *irssv_sv; /* real $/ cache */
190
191#define VAR(name,type) type name;
192# include "state.h"
193#undef VAR
194
195 /* coro process data */
196 int prio;
197
198 /* linked list */
199 struct coro *next, *prev;
200 HV *hv; /* the perl hash associated with this coro, if any */
123}; 201};
124 202
125typedef struct coro *Coro__State; 203typedef struct coro *Coro__State;
126typedef struct coro *Coro__State_or_hashref; 204typedef struct coro *Coro__State_or_hashref;
127 205
128static AV *main_mainstack; /* used to differentiate between $main and others */ 206/** Coro ********************************************************************/
129static HV *coro_state_stash;
130static SV *ucoro_state_sv;
131static U32 ucoro_state_hash;
132static HV *padlist_cache;
133static SV *coro_mortal; /* will be freed after next transfer */
134 207
135/* mostly copied from op.c:cv_clone2 */ 208#define PRIO_MAX 3
136STATIC AV * 209#define PRIO_HIGH 1
137clone_padlist (AV *protopadlist) 210#define PRIO_NORMAL 0
211#define PRIO_LOW -1
212#define PRIO_IDLE -3
213#define PRIO_MIN -4
214
215/* for Coro.pm */
216static SV *coro_current;
217static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
218static int coro_nready;
219static struct coro *coro_first;
220
221/** lowlevel stuff **********************************************************/
222
223static AV *
224coro_clone_padlist (pTHX_ CV *cv)
138{ 225{
139 AV *av; 226 AV *padlist = CvPADLIST (cv);
140 I32 ix;
141 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
142 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
143 SV **pname = AvARRAY (protopad_name);
144 SV **ppad = AvARRAY (protopad);
145 I32 fname = AvFILLp (protopad_name);
146 I32 fpad = AvFILLp (protopad);
147 AV *newpadlist, *newpad_name, *newpad; 227 AV *newpadlist, *newpad;
148 SV **npad;
149
150 newpad_name = newAV ();
151 for (ix = fname; ix >= 0; ix--)
152 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
153
154 newpad = newAV ();
155 av_fill (newpad, AvFILLp (protopad));
156 npad = AvARRAY (newpad);
157 228
158 newpadlist = newAV (); 229 newpadlist = newAV ();
159 AvREAL_off (newpadlist); 230 AvREAL_off (newpadlist);
160 av_store (newpadlist, 0, (SV *) newpad_name); 231#if PERL_VERSION_ATLEAST (5,9,0)
232 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
233#else
234 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
235#endif
236 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
237 --AvFILLp (padlist);
238
239 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
161 av_store (newpadlist, 1, (SV *) newpad); 240 av_store (newpadlist, 1, (SV *)newpad);
162 241
163 av = newAV (); /* will be @_ */ 242 return newpadlist;
164 av_extend (av, 0); 243}
165 av_store (newpad, 0, (SV *) av);
166 AvFLAGS (av) = AVf_REIFY;
167 244
168 for (ix = fpad; ix > 0; ix--) 245static void
246free_padlist (pTHX_ AV *padlist)
247{
248 /* may be during global destruction */
249 if (SvREFCNT (padlist))
169 { 250 {
170 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 251 I32 i = AvFILLp (padlist);
171 if (namesv && namesv != &PL_sv_undef) 252 while (i >= 0)
172 { 253 {
173 char *name = SvPVX (namesv); /* XXX */ 254 SV **svp = av_fetch (padlist, i--, FALSE);
174 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 255 if (svp)
175 { /* lexical from outside? */
176 npad[ix] = SvREFCNT_inc (ppad[ix]);
177 } 256 {
178 else
179 { /* our own lexical */
180 SV *sv; 257 SV *sv;
181 if (*name == '&') 258 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
182 sv = SvREFCNT_inc (ppad[ix]); 259 SvREFCNT_dec (sv);
183 else if (*name == '@') 260
184 sv = (SV *) newAV (); 261 SvREFCNT_dec (*svp);
185 else if (*name == '%')
186 sv = (SV *) newHV ();
187 else
188 sv = NEWSV (0, 0);
189#ifdef SvPADBUSY
190 if (!SvPADBUSY (sv))
191#endif
192 SvPADMY_on (sv);
193 npad[ix] = sv;
194 } 262 }
195 } 263 }
196 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 264
265 SvREFCNT_dec ((SV*)padlist);
266 }
267}
268
269static int
270coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
271{
272 AV *padlist;
273 AV *av = (AV *)mg->mg_obj;
274
275 /* casting is fun. */
276 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
277 free_padlist (aTHX_ padlist);
278
279 SvREFCNT_dec (av);
280
281 return 0;
282}
283
284#define PERL_MAGIC_coro PERL_MAGIC_ext
285
286static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
287
288#define CORO_MAGIC(cv) \
289 SvMAGIC (cv) \
290 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
291 ? SvMAGIC (cv) \
292 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
293 : 0
294
295/* the next two functions merely cache the padlists */
296static void
297get_padlist (pTHX_ CV *cv)
298{
299 MAGIC *mg = CORO_MAGIC (cv);
300 AV *av;
301
302 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
303 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
304 else
305 {
306#if CORO_PREFER_PERL_FUNCTIONS
307 /* this is probably cleaner, but also slower? */
308 CV *cp = Perl_cv_clone (cv);
309 CvPADLIST (cv) = CvPADLIST (cp);
310 CvPADLIST (cp) = 0;
311 SvREFCNT_dec (cp);
312#else
313 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
314#endif
315 }
316}
317
318static void
319put_padlist (pTHX_ CV *cv)
320{
321 MAGIC *mg = CORO_MAGIC (cv);
322 AV *av;
323
324 if (!mg)
325 {
326 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
327 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
328 mg->mg_virtual = &vtbl_coro;
329 mg->mg_obj = (SV *)newAV ();
330 }
331
332 av = (AV *)mg->mg_obj;
333
334 if (AvFILLp (av) >= AvMAX (av))
335 av_extend (av, AvMAX (av) + 1);
336
337 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
338}
339
340/** load & save, init *******************************************************/
341
342#define SB do {
343#define SE } while (0)
344
345#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
346
347static void
348load_perl (pTHX_ Coro__State c)
349{
350#define VAR(name,type) PL_ ## name = c->name;
351# include "state.h"
352#undef VAR
353
354 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
355 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
356 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
357 if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh);
358
359 if (c->irssv)
360 {
361 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
197 { 362 {
198 npad[ix] = SvREFCNT_inc (ppad[ix]); 363 SvREFCNT_dec (c->irssv);
364 c->irssv = 0;
199 } 365 }
200 else 366 else
201 { 367 {
202 SV *sv = NEWSV (0, 0); 368 REPLACE_SV (PL_rs, c->irssv);
203 SvPADTMP_on (sv); 369 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
204 npad[ix] = sv; 370 sv_setsv (c->irssv_sv, PL_rs);
205 } 371 }
206 } 372 }
207
208#if 0 /* return -ENOTUNDERSTOOD */
209 /* Now that vars are all in place, clone nested closures. */
210
211 for (ix = fpad; ix > 0; ix--) {
212 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
213 if (namesv
214 && namesv != &PL_sv_undef
215 && !(SvFLAGS(namesv) & SVf_FAKE)
216 && *SvPVX(namesv) == '&'
217 && CvCLONE(ppad[ix]))
218 {
219 CV *kid = cv_clone((CV*)ppad[ix]);
220 SvREFCNT_dec(ppad[ix]);
221 CvCLONE_on(kid);
222 SvPADMY_on(kid);
223 npad[ix] = (SV*)kid;
224 }
225 }
226#endif
227
228 return newpadlist;
229}
230
231#ifdef MAY_FLUSH
232STATIC void
233free_padlist (AV *padlist)
234{
235 /* may be during global destruction */
236 if (SvREFCNT(padlist))
237 {
238 I32 i = AvFILLp(padlist);
239 while (i >= 0)
240 {
241 SV **svp = av_fetch(padlist, i--, FALSE);
242 SV *sv = svp ? *svp : Nullsv;
243 if (sv)
244 SvREFCNT_dec(sv);
245 }
246
247 SvREFCNT_dec((SV*)padlist);
248 }
249}
250#endif
251
252/* the next two functions merely cache the padlists */
253STATIC void
254get_padlist (CV *cv)
255{
256 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
257
258 if (he && AvFILLp ((AV *)*he) >= 0)
259 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
260 else
261 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
262}
263
264STATIC void
265put_padlist (CV *cv)
266{
267 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
268
269 if (SvTYPE (*he) != SVt_PVAV)
270 {
271 SvREFCNT_dec (*he);
272 *he = (SV *)newAV ();
273 }
274
275 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
276}
277
278#ifdef MAY_FLUSH
279STATIC void
280flush_padlist_cache ()
281{
282 HV *hv = padlist_cache;
283 padlist_cache = newHV ();
284
285 if (hv_iterinit (hv))
286 {
287 HE *he;
288 AV *padlist;
289
290 while (!!(he = hv_iternext (hv)))
291 {
292 AV *av = (AV *)HeVAL(he);
293
294 /* casting is fun. */
295 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
296 free_padlist (padlist);
297 }
298 }
299
300 SvREFCNT_dec (hv);
301}
302#endif
303
304#define SB do {
305#define SE } while (0)
306
307#define LOAD(state) load_state(aTHX_ (state));
308#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
309
310#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
311
312static void
313load_state(pTHX_ Coro__State c)
314{
315 PL_dowarn = c->dowarn;
316 PL_in_eval = c->in_eval;
317
318 PL_curstackinfo = c->curstackinfo;
319 PL_curstack = c->curstack;
320 PL_mainstack = c->mainstack;
321 PL_stack_sp = c->stack_sp;
322 PL_op = c->op;
323 PL_curpad = c->curpad;
324 PL_comppad = c->comppad;
325 PL_stack_base = c->stack_base;
326 PL_stack_max = c->stack_max;
327 PL_tmps_stack = c->tmps_stack;
328 PL_tmps_floor = c->tmps_floor;
329 PL_tmps_ix = c->tmps_ix;
330 PL_tmps_max = c->tmps_max;
331 PL_markstack = c->markstack;
332 PL_markstack_ptr = c->markstack_ptr;
333 PL_markstack_max = c->markstack_max;
334 PL_scopestack = c->scopestack;
335 PL_scopestack_ix = c->scopestack_ix;
336 PL_scopestack_max = c->scopestack_max;
337 PL_savestack = c->savestack;
338 PL_savestack_ix = c->savestack_ix;
339 PL_savestack_max = c->savestack_max;
340 PL_retstack = c->retstack;
341 PL_retstack_ix = c->retstack_ix;
342 PL_retstack_max = c->retstack_max;
343 PL_curcop = c->curcop;
344 PL_top_env = c->top_env;
345
346 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
347 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
348 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
349 373
350 { 374 {
351 dSP; 375 dSP;
352 CV *cv; 376 CV *cv;
353 377
354 /* now do the ugly restore mess */ 378 /* now do the ugly restore mess */
355 while ((cv = (CV *)POPs)) 379 while ((cv = (CV *)POPs))
356 { 380 {
357 AV *padlist = (AV *)POPs;
358
359 if (padlist)
360 {
361 put_padlist (cv); /* mark this padlist as available */ 381 put_padlist (aTHX_ cv); /* mark this padlist as available */
362 CvPADLIST(cv) = padlist; 382 CvDEPTH (cv) = PTR2IV (POPs);
363#ifdef USE_THREADS 383 CvPADLIST (cv) = (AV *)POPs;
364 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
365#endif
366 }
367
368 ++CvDEPTH(cv);
369 } 384 }
370 385
371 PUTBACK; 386 PUTBACK;
372 } 387 }
373} 388}
374 389
375static void 390static void
376save_state(pTHX_ Coro__State c, int flags) 391save_perl (pTHX_ Coro__State c)
377{ 392{
378 { 393 {
379 dSP; 394 dSP;
380 I32 cxix = cxstack_ix; 395 I32 cxix = cxstack_ix;
381 PERL_CONTEXT *ccstk = cxstack; 396 PERL_CONTEXT *ccstk = cxstack;
384 /* 399 /*
385 * the worst thing you can imagine happens first - we have to save 400 * the worst thing you can imagine happens first - we have to save
386 * (and reinitialize) all cv's in the whole callchain :( 401 * (and reinitialize) all cv's in the whole callchain :(
387 */ 402 */
388 403
389 PUSHs (Nullsv); 404 XPUSHs (Nullsv);
390 /* this loop was inspired by pp_caller */ 405 /* this loop was inspired by pp_caller */
391 for (;;) 406 for (;;)
392 { 407 {
393 while (cxix >= 0) 408 while (cxix >= 0)
394 { 409 {
395 PERL_CONTEXT *cx = &ccstk[cxix--]; 410 PERL_CONTEXT *cx = &ccstk[cxix--];
396 411
397 if (CxTYPE(cx) == CXt_SUB) 412 if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)
398 { 413 {
399 CV *cv = cx->blk_sub.cv; 414 CV *cv = cx->blk_sub.cv;
415
400 if (CvDEPTH(cv)) 416 if (CvDEPTH (cv))
401 { 417 {
402#ifdef USE_THREADS
403 /*XPUSHs ((SV *)CvOWNER(cv));*/
404 /*CvOWNER(cv) = 0;*/
405 /*error must unlock this cv etc.. etc...*/
406#endif
407 EXTEND (SP, CvDEPTH(cv)*2); 418 EXTEND (SP, 3);
408
409 while (--CvDEPTH(cv))
410 {
411 /* this tells the restore code to increment CvDEPTH */
412 PUSHs (Nullsv);
413 PUSHs ((SV *)cv);
414 }
415
416 PUSHs ((SV *)CvPADLIST(cv)); 419 PUSHs ((SV *)CvPADLIST (cv));
420 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
417 PUSHs ((SV *)cv); 421 PUSHs ((SV *)cv);
418 422
419 get_padlist (cv); /* this is a monster */ 423 CvDEPTH (cv) = 0;
424 get_padlist (aTHX_ cv);
420 } 425 }
421 } 426 }
422#ifdef CXt_FORMAT
423 else if (CxTYPE(cx) == CXt_FORMAT)
424 {
425 /* I never used formats, so how should I know how these are implemented? */
426 /* my bold guess is as a simple, plain sub... */
427 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
428 }
429#endif
430 } 427 }
431 428
432 if (top_si->si_type == PERLSI_MAIN) 429 if (top_si->si_type == PERLSI_MAIN)
433 break; 430 break;
434 431
435 top_si = top_si->si_prev; 432 top_si = top_si->si_prev;
436 ccstk = top_si->si_cxstack; 433 ccstk = top_si->si_cxstack;
437 cxix = top_si->si_cxix; 434 cxix = top_si->si_cxix;
438 } 435 }
439 436
440 PUTBACK; 437 PUTBACK;
441 } 438 }
442 439
443 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 440 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
444 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 441 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
445 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 442 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
443 c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0;
444 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
446 445
447 c->dowarn = PL_dowarn; 446#define VAR(name,type)c->name = PL_ ## name;
448 c->in_eval = PL_in_eval; 447# include "state.h"
449 448#undef VAR
450 c->curstackinfo = PL_curstackinfo;
451 c->curstack = PL_curstack;
452 c->mainstack = PL_mainstack;
453 c->stack_sp = PL_stack_sp;
454 c->op = PL_op;
455 c->curpad = PL_curpad;
456 c->comppad = PL_comppad;
457 c->stack_base = PL_stack_base;
458 c->stack_max = PL_stack_max;
459 c->tmps_stack = PL_tmps_stack;
460 c->tmps_floor = PL_tmps_floor;
461 c->tmps_ix = PL_tmps_ix;
462 c->tmps_max = PL_tmps_max;
463 c->markstack = PL_markstack;
464 c->markstack_ptr = PL_markstack_ptr;
465 c->markstack_max = PL_markstack_max;
466 c->scopestack = PL_scopestack;
467 c->scopestack_ix = PL_scopestack_ix;
468 c->scopestack_max = PL_scopestack_max;
469 c->savestack = PL_savestack;
470 c->savestack_ix = PL_savestack_ix;
471 c->savestack_max = PL_savestack_max;
472 c->retstack = PL_retstack;
473 c->retstack_ix = PL_retstack_ix;
474 c->retstack_max = PL_retstack_max;
475 c->curcop = PL_curcop;
476 c->top_env = PL_top_env;
477} 449}
478 450
479/* 451/*
480 * allocate various perl stacks. This is an exact copy 452 * allocate various perl stacks. This is an exact copy
481 * of perl.c:init_stacks, except that it uses less memory 453 * of perl.c:init_stacks, except that it uses less memory
482 * on the assumption that coroutines do not usually need 454 * on the (sometimes correct) assumption that coroutines do
483 * a lot of stackspace. 455 * not usually need a lot of stackspace.
484 */ 456 */
485STATIC void 457#if CORO_PREFER_PERL_FUNCTIONS
458# define coro_init_stacks init_stacks
459#else
460static void
486coro_init_stacks (pTHX) 461coro_init_stacks (pTHX)
487{ 462{
488 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 463 PL_curstackinfo = new_stackinfo(64, 6);
489 PL_curstackinfo->si_type = PERLSI_MAIN; 464 PL_curstackinfo->si_type = PERLSI_MAIN;
490 PL_curstack = PL_curstackinfo->si_stack; 465 PL_curstack = PL_curstackinfo->si_stack;
491 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 466 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
492 467
493 PL_stack_base = AvARRAY(PL_curstack); 468 PL_stack_base = AvARRAY(PL_curstack);
494 PL_stack_sp = PL_stack_base; 469 PL_stack_sp = PL_stack_base;
495 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 470 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
496 471
497 New(50,PL_tmps_stack,96,SV*); 472 New(50,PL_tmps_stack,64,SV*);
498 PL_tmps_floor = -1; 473 PL_tmps_floor = -1;
499 PL_tmps_ix = -1; 474 PL_tmps_ix = -1;
500 PL_tmps_max = 96; 475 PL_tmps_max = 64;
501 476
502 New(54,PL_markstack,16,I32); 477 New(54,PL_markstack,16,I32);
503 PL_markstack_ptr = PL_markstack; 478 PL_markstack_ptr = PL_markstack;
504 PL_markstack_max = PL_markstack + 16; 479 PL_markstack_max = PL_markstack + 16;
505 480
509 484
510 New(54,PL_scopestack,16,I32); 485 New(54,PL_scopestack,16,I32);
511 PL_scopestack_ix = 0; 486 PL_scopestack_ix = 0;
512 PL_scopestack_max = 16; 487 PL_scopestack_max = 16;
513 488
514 New(54,PL_savestack,96,ANY); 489 New(54,PL_savestack,64,ANY);
515 PL_savestack_ix = 0; 490 PL_savestack_ix = 0;
516 PL_savestack_max = 96; 491 PL_savestack_max = 64;
517 492
493#if !PERL_VERSION_ATLEAST (5,9,0)
518 New(54,PL_retstack,8,OP*); 494 New(54,PL_retstack,4,OP*);
519 PL_retstack_ix = 0; 495 PL_retstack_ix = 0;
520 PL_retstack_max = 8; 496 PL_retstack_max = 4;
497#endif
521} 498}
499#endif
522 500
523/* 501/*
524 * destroy the stacks, the callchain etc... 502 * destroy the stacks, the callchain etc...
525 */ 503 */
526STATIC void 504static void
527destroy_stacks(pTHX) 505coro_destroy_stacks (pTHX)
528{ 506{
529 if (!IN_DESTRUCT) 507 if (!IN_DESTRUCT)
530 { 508 {
531 /* is this ugly, I ask? */ 509 /* restore all saved variables and stuff */
532 while (PL_scopestack_ix) 510 LEAVE_SCOPE (0);
533 LEAVE; 511 assert (PL_tmps_floor == -1);
534 512
535 /* sure it is, but more important: is it correct?? :/ */ 513 /* free all temporaries */
536 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
537 FREETMPS; 514 FREETMPS;
515 assert (PL_tmps_ix == -1);
516
517 /* unwind all extra stacks */
518 POPSTACK_TO (PL_mainstack);
519
520 /* unwind main stack */
521 dounwind (-1);
538 } 522 }
539 523
540 while (PL_curstackinfo->si_next) 524 while (PL_curstackinfo->si_next)
541 PL_curstackinfo = PL_curstackinfo->si_next; 525 PL_curstackinfo = PL_curstackinfo->si_next;
542 526
543 while (PL_curstackinfo) 527 while (PL_curstackinfo)
544 { 528 {
545 PERL_SI *p = PL_curstackinfo->si_prev; 529 PERL_SI *p = PL_curstackinfo->si_prev;
546 530
547 {
548 dSP;
549 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
550 PUTBACK; /* possibly superfluous */
551 }
552
553 if (!IN_DESTRUCT) 531 if (!IN_DESTRUCT)
554 {
555 dounwind(-1);
556 SvREFCNT_dec(PL_curstackinfo->si_stack); 532 SvREFCNT_dec (PL_curstackinfo->si_stack);
557 }
558 533
559 Safefree(PL_curstackinfo->si_cxstack); 534 Safefree (PL_curstackinfo->si_cxstack);
560 Safefree(PL_curstackinfo); 535 Safefree (PL_curstackinfo);
561 PL_curstackinfo = p; 536 PL_curstackinfo = p;
562 } 537 }
563 538
564 Safefree(PL_tmps_stack); 539 Safefree (PL_tmps_stack);
565 Safefree(PL_markstack); 540 Safefree (PL_markstack);
566 Safefree(PL_scopestack); 541 Safefree (PL_scopestack);
567 Safefree(PL_savestack); 542 Safefree (PL_savestack);
543#if !PERL_VERSION_ATLEAST (5,9,0)
568 Safefree(PL_retstack); 544 Safefree (PL_retstack);
569}
570
571static void
572allocate_stack (Coro__State ctx, int alloc)
573{
574 coro_stack *stack;
575
576 New (0, stack, 1, coro_stack);
577
578 stack->refcnt = 1;
579 stack->usecnt = 1;
580 stack->gencnt = ctx->gencnt = 0;
581 if (alloc)
582 {
583#if HAVE_MMAP
584 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
585 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
586 if (stack->sptr == (void *)-1)
587#endif 545#endif
546}
547
548static size_t
549coro_rss (struct coro *coro)
550{
551 size_t rss = sizeof (coro);
552
553 if (coro->mainstack)
554 {
555 if (coro->flags & CF_RUNNING)
588 { 556 {
589 /*FIXME*//*D*//* reasonable stack size! */ 557 #define VAR(name,type)coro->name = PL_ ## name;
590 stack->ssize = -4096 * sizeof (long); 558 # include "state.h"
591 New (0, stack->sptr, 4096, long); 559 #undef VAR
592 } 560 }
593 }
594 else
595 stack->sptr = 0;
596 561
597 ctx->stack = stack; 562 rss += sizeof (coro->curstackinfo);
598} 563 rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *);
564 rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
565 rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *);
566 rss += coro->tmps_max * sizeof (SV *);
567 rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32);
568 rss += coro->scopestack_max * sizeof (I32);
569 rss += coro->savestack_max * sizeof (ANY);
599 570
600static void 571#if !PERL_VERSION_ATLEAST (5,9,0)
601deallocate_stack (Coro__State ctx) 572 rss += coro->retstack_max * sizeof (OP *);
602{ 573#endif
603 coro_stack *stack = ctx->stack;
604
605 ctx->stack = 0;
606
607 if (stack)
608 { 574 }
609 if (!--stack->refcnt)
610 {
611#ifdef HAVE_MMAP
612 if (stack->ssize > 0 && stack->sptr)
613 munmap (stack->sptr, stack->ssize);
614 else
615#endif
616 Safefree (stack->sptr);
617 575
618 Safefree (stack); 576 return rss;
619 }
620 else if (ctx->gencnt == stack->gencnt)
621 --stack->usecnt;
622 }
623} 577}
624 578
579/** coroutine stack handling ************************************************/
580
625static void 581static void
626setup_coro (void *arg) 582setup_coro (pTHX_ struct coro *coro)
627{ 583{
628 /* 584 /*
629 * emulate part of the perl startup here. 585 * emulate part of the perl startup here.
630 */ 586 */
587 coro_init_stacks (aTHX);
588
589 PL_curcop = &PL_compiling;
590 PL_in_eval = EVAL_NULL;
591 PL_comppad = 0;
592 PL_curpm = 0;
593 PL_localizing = 0;
594 PL_dirty = 0;
595 PL_restartop = 0;
596
597 {
598 dSP;
599 LOGOP myop;
600
601 SvREFCNT_dec (GvAV (PL_defgv));
602 GvAV (PL_defgv) = coro->args; coro->args = 0;
603
604 Zero (&myop, 1, LOGOP);
605 myop.op_next = Nullop;
606 myop.op_flags = OPf_WANT_VOID;
607
608 PUSHMARK (SP);
609 XPUSHs (av_shift (GvAV (PL_defgv)));
610 PUTBACK;
611 PL_op = (OP *)&myop;
612 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
613 SPAGAIN;
614 }
615
616 ENTER; /* necessary e.g. for dounwind */
617}
618
619static void
620free_coro_mortal (pTHX)
621{
622 if (coro_mortal)
623 {
624 SvREFCNT_dec (coro_mortal);
625 coro_mortal = 0;
626 }
627}
628
629/* inject a fake call to Coro::State::_cctx_init into the execution */
630/* _cctx_init should be careful, as it could be called at almost any time */
631/* during execution of a perl program */
632static void NOINLINE
633prepare_cctx (pTHX_ coro_cctx *cctx)
634{
631 dSP; 635 dSP;
632 Coro__State ctx = (Coro__State)arg; 636 LOGOP myop;
633 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
634 637
635 coro_init_stacks (aTHX); 638 Zero (&myop, 1, LOGOP);
636 /*PL_curcop = 0;*/ 639 myop.op_next = PL_op;
637 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 640 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
638 SvREFCNT_dec (GvAV (PL_defgv));
639 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
640 641
642 PUSHMARK (SP);
643 EXTEND (SP, 2);
644 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
645 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
646 PUTBACK;
647 PL_op = (OP *)&myop;
648 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
641 SPAGAIN; 649 SPAGAIN;
650}
642 651
643 if (ctx->stack) 652/*
644 { 653 * this is a _very_ stripped down perl interpreter ;)
645 ctx->cursp = 0; 654 */
655static void
656coro_run (void *arg)
657{
658 dTHX;
646 659
647 PUSHMARK(SP); 660 /* coro_run is the alternative tail of transfer(), so unlock here. */
648 PUTBACK; 661 UNLOCK;
649 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
650 662
651 if (SvTRUE (ERRSV)) 663 PL_top_env = &PL_start_env;
652 croak (NULL); 664
653 else 665 /* inject a fake subroutine call to cctx_init */
654 croak ("FATAL: CCTXT coroutine returned!"); 666 prepare_cctx (aTHX_ (coro_cctx *)arg);
667
668 /* somebody or something will hit me for both perl_run and PL_restartop */
669 PL_restartop = PL_op;
670 perl_run (PL_curinterp);
671
672 /*
673 * If perl-run returns we assume exit() was being called or the coro
674 * fell off the end, which seems to be the only valid (non-bug)
675 * reason for perl_run to return. We try to exit by jumping to the
676 * bootstrap-time "top" top_env, as we cannot restore the "main"
677 * coroutine as Coro has no such concept
678 */
679 PL_top_env = main_top_env;
680 JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
681}
682
683static coro_cctx *
684cctx_new ()
685{
686 coro_cctx *cctx;
687 void *stack_start;
688 size_t stack_size;
689
690 ++cctx_count;
691
692 Newz (0, cctx, 1, coro_cctx);
693
694#if HAVE_MMAP
695
696 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
697 /* mmap supposedly does allocate-on-write for us */
698 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
699
700 if (cctx->sptr != (void *)-1)
701 {
702# if CORO_STACKGUARD
703 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
704# endif
705 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
706 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
707 cctx->mapped = 1;
655 } 708 }
656 else 709 else
657 { 710#endif
658 UNOP myop;
659
660 PL_op = (OP *)&myop;
661
662 Zero(&myop, 1, UNOP);
663 myop.op_next = Nullop;
664 myop.op_flags = OPf_WANT_VOID;
665
666 PUSHMARK(SP);
667 XPUSHs (sub_init);
668 /*
669 * the next line is slightly wrong, as PL_op->op_next
670 * is actually being executed so we skip the first op.
671 * that doesn't matter, though, since it is only
672 * pp_nextstate and we never return...
673 * ah yes, and I don't care anyways ;)
674 */
675 PUTBACK;
676 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
677 SPAGAIN;
678
679 ENTER; /* necessary e.g. for dounwind */
680 } 711 {
681} 712 cctx->ssize = coro_stacksize * (long)sizeof (long);
713 New (0, cctx->sptr, coro_stacksize, long);
682 714
683static void 715 if (!cctx->sptr)
684continue_coro (void *arg) 716 {
685{ 717 perror ("FATAL: unable to allocate stack for coroutine");
686 /* 718 _exit (EXIT_FAILURE);
687 * this is a _very_ stripped down perl interpreter ;) 719 }
688 */
689 Coro__State ctx = (Coro__State)arg;
690 JMPENV coro_start_env;
691 720
692 PL_top_env = &ctx->start_env; 721 stack_start = cctx->sptr;
722 stack_size = cctx->ssize;
723 }
693 724
694 ctx->cursp = 0; 725 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
726 coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
727
728 return cctx;
729}
730
731static void
732cctx_destroy (coro_cctx *cctx)
733{
734 if (!cctx)
735 return;
736
737 --cctx_count;
738
739#if CORO_USE_VALGRIND
740 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
741#endif
742
743#if HAVE_MMAP
744 if (cctx->mapped)
745 munmap (cctx->sptr, cctx->ssize);
746 else
747#endif
748 Safefree (cctx->sptr);
749
750 Safefree (cctx);
751}
752
753static coro_cctx *
754cctx_get (pTHX)
755{
756 while (cctx_first)
757 {
758 coro_cctx *cctx = cctx_first;
759 cctx_first = cctx->next;
760 --cctx_idle;
761
762 if (cctx->ssize >= coro_stacksize)
763 return cctx;
764
765 cctx_destroy (cctx);
766 }
767
695 PL_op = PL_op->op_next; 768 PL_op = PL_op->op_next;
696 CALLRUNOPS(aTHX); 769 return cctx_new ();
697
698 abort ();
699} 770}
700 771
701STATIC void 772static void
773cctx_put (coro_cctx *cctx)
774{
775 /* free another cctx if overlimit */
776 if (cctx_idle >= MAX_IDLE_CCTX)
777 {
778 coro_cctx *first = cctx_first;
779 cctx_first = first->next;
780 --cctx_idle;
781
782 assert (!first->inuse);
783 cctx_destroy (first);
784 }
785
786 ++cctx_idle;
787 cctx->next = cctx_first;
788 cctx_first = cctx;
789}
790
791/** coroutine switching *****************************************************/
792
793/* never call directly, always through the coro_state_transfer global variable */
794static void NOINLINE
702transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 795transfer (pTHX_ struct coro *prev, struct coro *next)
703{ 796{
704 dSTACKLEVEL; 797 dSTACKLEVEL;
705 static struct coro *xnext;
706 798
799 /* sometimes transfer is only called to set idle_sp */
800 if (!next)
801 {
802 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
803 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
804 }
707 if (prev != next) 805 else if (prev != next)
708 { 806 {
709 xnext = next; 807 coro_cctx *prev__cctx;
710 808
711 if (next->mainstack) 809 if (prev->flags & CF_NEW)
712 { 810 {
713 SAVE (prev, flags); 811 /* create a new empty context */
714 LOAD (next); 812 Newz (0, prev->cctx, 1, coro_cctx);
715 813 prev->cctx->inuse = 1;
716 /* mark this state as in-use */ 814 prev->flags &= ~CF_NEW;
717 next->mainstack = 0; 815 prev->flags |= CF_RUNNING;
718 next->tmps_ix = -2;
719
720 /* stacklevel changed? if yes, grab the stack for us! */
721 if (flags & TRANSFER_SAVE_CCTXT)
722 {
723 if (!prev->stack)
724 allocate_stack (prev, 0);
725 else if (prev->cursp != stacklevel
726 && prev->stack->usecnt > 1)
727 {
728 prev->gencnt = ++prev->stack->gencnt;
729 prev->stack->usecnt = 1;
730 }
731
732 /* has our stack been invalidated? */
733 if (next->stack && next->stack->gencnt != next->gencnt)
734 {
735 deallocate_stack (next);
736 allocate_stack (next, 1);
737 coro_create (&(next->stack->cctx),
738 continue_coro, (void *)next,
739 next->stack->sptr, labs (next->stack->ssize));
740 }
741
742 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
743 /* don't add any code here */
744 }
745
746 } 816 }
747 else if (next->tmps_ix == -2) 817
748 croak ("tried to transfer to running coroutine"); 818 /*TODO: must not croak here */
819 if (!prev->flags & CF_RUNNING)
820 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
821
822 if (next->flags & CF_RUNNING)
823 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
824
825 if (next->flags & CF_DESTROYED)
826 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
827
828 prev->flags &= ~CF_RUNNING;
829 next->flags |= CF_RUNNING;
830
831 LOCK;
832
833 if (next->flags & CF_NEW)
834 {
835 /* need to start coroutine */
836 next->flags &= ~CF_NEW;
837 /* first get rid of the old state */
838 save_perl (aTHX_ prev);
839 /* setup coroutine call */
840 setup_coro (aTHX_ next);
841 /* need a new stack */
842 assert (!next->cctx);
843 }
749 else 844 else
750 { 845 {
751 SAVE (prev, -1); /* first get rid of the old state */ 846 /* coroutine already started */
752 847 save_perl (aTHX_ prev);
753 if (flags & TRANSFER_SAVE_CCTXT) 848 load_perl (aTHX_ next);
754 {
755 if (!prev->stack)
756 allocate_stack (prev, 0);
757
758 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
759 {
760 PL_top_env = &next->start_env;
761
762 setup_coro (next);
763
764 prev->stack->refcnt++;
765 prev->stack->usecnt++;
766 next->stack = prev->stack;
767 next->gencnt = prev->gencnt;
768 }
769 else
770 {
771 assert (!next->stack);
772 allocate_stack (next, 1);
773 coro_create (&(next->stack->cctx),
774 setup_coro, (void *)next,
775 next->stack->sptr, labs (next->stack->ssize));
776 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
777 /* don't add any code here */
778 }
779 }
780 else
781 setup_coro (next);
782 } 849 }
783 850
784 /* 851 prev__cctx = prev->cctx;
785 * xnext is now either prev or next, depending on wether 852
786 * we switched the c stack or not. that's why I use a global 853 /* possibly "free" the cctx */
787 * variable, that should become thread-specific at one point. 854 if (prev__cctx->idle_sp == STACKLEVEL)
788 */ 855 {
789 xnext->cursp = stacklevel; 856 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
790 } 857 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
791 858
792 if (coro_mortal) 859 prev->cctx = 0;
860
861 cctx_put (prev__cctx);
862 prev__cctx->inuse = 0;
863 }
864
865 if (!next->cctx)
866 {
867 next->cctx = cctx_get (aTHX);
868 assert (!next->cctx->inuse);
869 next->cctx->inuse = 1;
870 }
871
872 if (prev__cctx != next->cctx)
873 {
874 prev__cctx->top_env = PL_top_env;
875 PL_top_env = next->cctx->top_env;
876 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
877 }
878
879 free_coro_mortal (aTHX);
880 UNLOCK;
793 { 881 }
794 SvREFCNT_dec (coro_mortal); 882}
795 coro_mortal = 0; 883
884struct transfer_args
885{
886 struct coro *prev, *next;
887};
888
889#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
890
891/** high level stuff ********************************************************/
892
893static int
894coro_state_destroy (pTHX_ struct coro *coro)
895{
896 if (coro->flags & CF_DESTROYED)
897 return 0;
898
899 coro->flags |= CF_DESTROYED;
900
901 if (coro->flags & CF_READY)
796 } 902 {
797} 903 /* reduce nready, as destroying a ready coro effectively unreadies it */
904 /* alternative: look through all ready queues and remove the coro */
905 LOCK;
906 --coro_nready;
907 UNLOCK;
908 }
909 else
910 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
798 911
799#define SV_CORO(sv,func) \ 912 if (coro->mainstack && coro->mainstack != main_mainstack)
800 do { \ 913 {
801 if (SvROK (sv)) \ 914 struct coro temp;
802 sv = SvRV (sv); \
803 \
804 if (SvTYPE(sv) == SVt_PVHV) \
805 { \
806 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
807 \
808 if (!he) \
809 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
810 \
811 (sv) = SvRV (HeVAL(he)); \
812 } \
813 \
814 /* must also be changed inside Coro::Cont::yield */ \
815 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
816 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
817 \
818 } while(0)
819 915
820#define SvSTATE(sv) (struct coro *)SvIV (sv) 916 assert (!(coro->flags & CF_RUNNING));
821 917
918 Zero (&temp, 1, struct coro);
919 temp.save = CORO_SAVE_ALL;
920
921 if (coro->flags & CF_RUNNING)
922 croak ("FATAL: tried to destroy currently running coroutine");
923
924 save_perl (aTHX_ &temp);
925 load_perl (aTHX_ coro);
926
927 coro_destroy_stacks (aTHX);
928
929 load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
930
931 coro->mainstack = 0;
932 }
933
934 cctx_destroy (coro->cctx);
935 SvREFCNT_dec (coro->args);
936
937 if (coro->next) coro->next->prev = coro->prev;
938 if (coro->prev) coro->prev->next = coro->next;
939 if (coro == coro_first) coro_first = coro->next;
940
941 return 1;
942}
943
822static void 944static int
945coro_state_free (pTHX_ SV *sv, MAGIC *mg)
946{
947 struct coro *coro = (struct coro *)mg->mg_ptr;
948 mg->mg_ptr = 0;
949
950 coro->hv = 0;
951
952 if (--coro->refcnt < 0)
953 {
954 coro_state_destroy (aTHX_ coro);
955 Safefree (coro);
956 }
957
958 return 0;
959}
960
961static int
962coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
963{
964 struct coro *coro = (struct coro *)mg->mg_ptr;
965
966 ++coro->refcnt;
967
968 return 0;
969}
970
971static MGVTBL coro_state_vtbl = {
972 0, 0, 0, 0,
973 coro_state_free,
974 0,
975#ifdef MGf_DUP
976 coro_state_dup,
977#else
978# define MGf_DUP 0
979#endif
980};
981
982static struct coro *
983SvSTATE_ (pTHX_ SV *coro)
984{
985 HV *stash;
986 MAGIC *mg;
987
988 if (SvROK (coro))
989 coro = SvRV (coro);
990
991 stash = SvSTASH (coro);
992 if (stash != coro_stash && stash != coro_state_stash)
993 {
994 /* very slow, but rare, check */
995 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
996 croak ("Coro::State object required");
997 }
998
999 mg = CORO_MAGIC (coro);
1000 return (struct coro *)mg->mg_ptr;
1001}
1002
1003#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
1004
1005static void
1006prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
1007{
1008 ta->prev = SvSTATE (prev_sv);
1009 ta->next = SvSTATE (next_sv);
1010}
1011
1012static void
823api_transfer(pTHX_ SV *prev, SV *next, int flags) 1013api_transfer (SV *prev_sv, SV *next_sv)
824{ 1014{
825 SV_CORO (prev, "Coro::transfer"); 1015 dTHX;
826 SV_CORO (next, "Coro::transfer"); 1016 struct transfer_args ta;
827 1017
828 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 1018 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
1019 TRANSFER (ta);
1020}
1021
1022static int
1023api_save (SV *coro_sv, int new_save)
1024{
1025 dTHX;
1026 struct coro *coro = SvSTATE (coro_sv);
1027 int old_save = coro->save;
1028
1029 if (new_save >= 0)
1030 coro->save = new_save;
1031
1032 return old_save;
829} 1033}
830 1034
831/** Coro ********************************************************************/ 1035/** Coro ********************************************************************/
832 1036
833#define PRIO_MAX 3
834#define PRIO_HIGH 1
835#define PRIO_NORMAL 0
836#define PRIO_LOW -1
837#define PRIO_IDLE -3
838#define PRIO_MIN -4
839
840/* for Coro.pm */
841static GV *coro_current, *coro_idle;
842static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
843static int coro_nready;
844
845static void 1037static void
846coro_enq (SV *sv) 1038coro_enq (pTHX_ SV *coro_sv)
847{ 1039{
848 if (SvTYPE (sv) == SVt_PVHV)
849 {
850 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
851 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
852
853 prio = prio > PRIO_MAX ? PRIO_MAX
854 : prio < PRIO_MIN ? PRIO_MIN
855 : prio;
856
857 av_push (coro_ready [prio - PRIO_MIN], sv); 1040 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
858 coro_nready++;
859
860 return;
861 }
862
863 croak ("Coro::ready tried to enqueue something that is not a coroutine");
864} 1041}
865 1042
866static SV * 1043static SV *
867coro_deq (int min_prio) 1044coro_deq (pTHX_ int min_prio)
868{ 1045{
869 int prio = PRIO_MAX - PRIO_MIN; 1046 int prio = PRIO_MAX - PRIO_MIN;
870 1047
871 min_prio -= PRIO_MIN; 1048 min_prio -= PRIO_MIN;
872 if (min_prio < 0) 1049 if (min_prio < 0)
873 min_prio = 0; 1050 min_prio = 0;
874 1051
875 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 1052 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
876 if (av_len (coro_ready[prio]) >= 0) 1053 if (AvFILLp (coro_ready [prio]) >= 0)
877 {
878 coro_nready--;
879 return av_shift (coro_ready[prio]); 1054 return av_shift (coro_ready [prio]);
880 }
881 1055
882 return 0; 1056 return 0;
883} 1057}
884 1058
885static void 1059static int
886api_ready (SV *coro) 1060api_ready (SV *coro_sv)
887{ 1061{
1062 dTHX;
1063 struct coro *coro;
1064
888 if (SvROK (coro)) 1065 if (SvROK (coro_sv))
889 coro = SvRV (coro); 1066 coro_sv = SvRV (coro_sv);
890 1067
1068 coro = SvSTATE (coro_sv);
1069
1070 if (coro->flags & CF_READY)
1071 return 0;
1072
1073 coro->flags |= CF_READY;
1074
1075 LOCK;
891 coro_enq (SvREFCNT_inc (coro)); 1076 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1077 ++coro_nready;
1078 UNLOCK;
1079
1080 return 1;
1081}
1082
1083static int
1084api_is_ready (SV *coro_sv)
1085{
1086 dTHX;
1087 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1088}
1089
1090static void
1091prepare_schedule (pTHX_ struct transfer_args *ta)
1092{
1093 SV *prev_sv, *next_sv;
1094
1095 for (;;)
1096 {
1097 LOCK;
1098 next_sv = coro_deq (aTHX_ PRIO_MIN);
1099
1100 /* nothing to schedule: call the idle handler */
1101 if (!next_sv)
1102 {
1103 dSP;
1104 UNLOCK;
1105
1106 ENTER;
1107 SAVETMPS;
1108
1109 PUSHMARK (SP);
1110 PUTBACK;
1111 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1112
1113 FREETMPS;
1114 LEAVE;
1115 continue;
1116 }
1117
1118 ta->next = SvSTATE (next_sv);
1119
1120 /* cannot transfer to destroyed coros, skip and look for next */
1121 if (ta->next->flags & CF_DESTROYED)
1122 {
1123 UNLOCK;
1124 SvREFCNT_dec (next_sv);
1125 /* coro_nready is already taken care of by destroy */
1126 continue;
1127 }
1128
1129 --coro_nready;
1130 UNLOCK;
1131 break;
1132 }
1133
1134 /* free this only after the transfer */
1135 prev_sv = SvRV (coro_current);
1136 SvRV_set (coro_current, next_sv);
1137 ta->prev = SvSTATE (prev_sv);
1138
1139 assert (ta->next->flags & CF_READY);
1140 ta->next->flags &= ~CF_READY;
1141
1142 LOCK;
1143 free_coro_mortal (aTHX);
1144 coro_mortal = prev_sv;
1145 UNLOCK;
1146}
1147
1148static void
1149prepare_cede (pTHX_ struct transfer_args *ta)
1150{
1151 api_ready (coro_current);
1152 prepare_schedule (aTHX_ ta);
1153}
1154
1155static int
1156prepare_cede_notself (pTHX_ struct transfer_args *ta)
1157{
1158 if (coro_nready)
1159 {
1160 SV *prev = SvRV (coro_current);
1161 prepare_schedule (aTHX_ ta);
1162 api_ready (prev);
1163 return 1;
1164 }
1165 else
1166 return 0;
892} 1167}
893 1168
894static void 1169static void
895api_schedule (void) 1170api_schedule (void)
896{ 1171{
897 SV *prev, *next; 1172 dTHX;
1173 struct transfer_args ta;
898 1174
899 prev = SvRV (GvSV (coro_current)); 1175 prepare_schedule (aTHX_ &ta);
900 next = coro_deq (PRIO_MIN); 1176 TRANSFER (ta);
901
902 if (!next)
903 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
904
905 /* free this only after the transfer */
906 coro_mortal = prev;
907 SV_CORO (prev, "Coro::schedule");
908
909 SvRV (GvSV (coro_current)) = next;
910
911 SV_CORO (next, "Coro::schedule");
912
913 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
914 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
915} 1177}
916 1178
917static void 1179static int
918api_cede (void) 1180api_cede (void)
919{ 1181{
920 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 1182 dTHX;
1183 struct transfer_args ta;
921 1184
922 api_schedule (); 1185 prepare_cede (aTHX_ &ta);
1186
1187 if (ta.prev != ta.next)
1188 {
1189 TRANSFER (ta);
1190 return 1;
1191 }
1192 else
1193 return 0;
1194}
1195
1196static int
1197api_cede_notself (void)
1198{
1199 dTHX;
1200 struct transfer_args ta;
1201
1202 if (prepare_cede_notself (aTHX_ &ta))
1203 {
1204 TRANSFER (ta);
1205 return 1;
1206 }
1207 else
1208 return 0;
923} 1209}
924 1210
925MODULE = Coro::State PACKAGE = Coro::State 1211MODULE = Coro::State PACKAGE = Coro::State
926 1212
927PROTOTYPES: ENABLE 1213PROTOTYPES: DISABLE
928 1214
929BOOT: 1215BOOT:
930{ /* {} necessary for stoopid perl-5.6.x */ 1216{
931 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1217#ifdef USE_ITHREADS
932 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1218 MUTEX_INIT (&coro_mutex);
1219#endif
1220 BOOT_PAGESIZE;
1221
933 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1222 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
934 1223
935 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1224 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
936 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1225 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
937 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1226 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1227 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
1228 newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH));
938 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1229 newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
939 1230 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
940 if (!padlist_cache)
941 padlist_cache = newHV ();
942 1231
943 main_mainstack = PL_mainstack; 1232 main_mainstack = PL_mainstack;
1233 main_top_env = PL_top_env;
1234
1235 while (main_top_env->je_prev)
1236 main_top_env = main_top_env->je_prev;
944 1237
945 coroapi.ver = CORO_API_VERSION; 1238 coroapi.ver = CORO_API_VERSION;
946 coroapi.transfer = api_transfer; 1239 coroapi.transfer = api_transfer;
947}
948 1240
949Coro::State 1241 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
950_newprocess(args) 1242}
951 SV * args 1243
952 PROTOTYPE: $ 1244SV *
1245new (char *klass, ...)
953 CODE: 1246 CODE:
954 Coro__State coro; 1247{
1248 struct coro *coro;
1249 HV *hv;
1250 int i;
955 1251
956 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
957 croak ("Coro::State::_newprocess expects an arrayref");
958
959 Newz (0, coro, 1, struct coro); 1252 Newz (0, coro, 1, struct coro);
1253 coro->args = newAV ();
1254 coro->save = CORO_SAVE_DEF;
1255 coro->flags = CF_NEW;
960 1256
961 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1257 if (coro_first) coro_first->prev = coro;
962 coro->mainstack = 0; /* actual work is done inside transfer */ 1258 coro->next = coro_first;
963 coro->stack = 0; 1259 coro_first = coro;
964 1260
965 /* same as JMPENV_BOOTSTRAP */ 1261 coro->hv = hv = newHV ();
966 /* we might be able to recycle start_env, but safe is safe */ 1262 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
967 //Zero(&coro->start_env, 1, JMPENV); 1263 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
968 coro->start_env.je_ret = -1;
969 coro->start_env.je_mustcatch = TRUE;
970 1264
971 RETVAL = coro; 1265 for (i = 1; i < items; i++)
1266 av_push (coro->args, newSVsv (ST (i)));
1267}
972 OUTPUT: 1268 OUTPUT:
973 RETVAL 1269 RETVAL
974 1270
1271int
1272save (SV *coro, int new_save = -1)
1273 CODE:
1274 RETVAL = api_save (coro, new_save);
1275 OUTPUT:
1276 RETVAL
1277
1278int
1279save_also (SV *coro_sv, int save_also)
1280 CODE:
1281{
1282 struct coro *coro = SvSTATE (coro_sv);
1283 RETVAL = coro->save;
1284 coro->save |= save_also;
1285}
1286 OUTPUT:
1287 RETVAL
1288
975void 1289void
976transfer(prev, next, flags) 1290_set_stacklevel (...)
977 SV *prev 1291 ALIAS:
978 SV *next 1292 Coro::State::transfer = 1
979 int flags 1293 Coro::schedule = 2
980 PROTOTYPE: @ 1294 Coro::cede = 3
1295 Coro::cede_notself = 4
981 CODE: 1296 CODE:
982 PUTBACK; 1297{
983 SV_CORO (next, "Coro::transfer"); 1298 struct transfer_args ta;
984 SV_CORO (prev, "Coro::transfer"); 1299
985 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1300 switch (ix)
986 SPAGAIN; 1301 {
1302 case 0:
1303 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1304 ta.next = 0;
1305 break;
1306
1307 case 1:
1308 if (items != 2)
1309 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1310
1311 prepare_transfer (aTHX_ &ta, ST (0), ST (1));
1312 break;
1313
1314 case 2:
1315 prepare_schedule (aTHX_ &ta);
1316 break;
1317
1318 case 3:
1319 prepare_cede (aTHX_ &ta);
1320 break;
1321
1322 case 4:
1323 if (!prepare_cede_notself (aTHX_ &ta))
1324 XSRETURN_EMPTY;
1325
1326 break;
1327 }
1328
1329 BARRIER;
1330 TRANSFER (ta);
1331
1332 if (GIMME_V != G_VOID && ta.next != ta.prev)
1333 XSRETURN_YES;
1334}
1335
1336bool
1337_destroy (SV *coro_sv)
1338 CODE:
1339 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1340 OUTPUT:
1341 RETVAL
987 1342
988void 1343void
989DESTROY(coro)
990 Coro::State coro
991 CODE:
992
993 if (coro->mainstack && coro->mainstack != main_mainstack)
994 {
995 struct coro temp;
996
997 PUTBACK;
998 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
999 LOAD(aTHX_ coro);
1000 SPAGAIN;
1001
1002 destroy_stacks (aTHX);
1003
1004 LOAD((&temp)); /* this will get rid of defsv etc.. */
1005 SPAGAIN;
1006
1007 coro->mainstack = 0;
1008 }
1009
1010 deallocate_stack (coro);
1011 SvREFCNT_dec (coro->args);
1012 Safefree (coro);
1013
1014void
1015flush()
1016 CODE:
1017#ifdef MAY_FLUSH
1018 flush_padlist_cache ();
1019#endif
1020
1021void
1022_exit(code) 1344_exit (code)
1023 int code 1345 int code
1024 PROTOTYPE: $ 1346 PROTOTYPE: $
1025 CODE: 1347 CODE:
1026#if defined(__GLIBC__) || _POSIX_C_SOURCE
1027 _exit (code); 1348 _exit (code);
1028#else
1029 signal (SIGTERM, SIG_DFL);
1030 raise (SIGTERM);
1031 exit (code);
1032#endif
1033 1349
1034MODULE = Coro::State PACKAGE = Coro::Cont 1350int
1351cctx_stacksize (int new_stacksize = 0)
1352 CODE:
1353 RETVAL = coro_stacksize;
1354 if (new_stacksize)
1355 coro_stacksize = new_stacksize;
1356 OUTPUT:
1357 RETVAL
1035 1358
1036# this is slightly dirty (should expose a c-level api) 1359int
1360cctx_count ()
1361 CODE:
1362 RETVAL = cctx_count;
1363 OUTPUT:
1364 RETVAL
1365
1366int
1367cctx_idle ()
1368 CODE:
1369 RETVAL = cctx_idle;
1370 OUTPUT:
1371 RETVAL
1037 1372
1038void 1373void
1039yield(...) 1374list ()
1040 PROTOTYPE: @ 1375 PPCODE:
1376{
1377 struct coro *coro;
1378 for (coro = coro_first; coro; coro = coro->next)
1379 if (coro->hv)
1380 XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
1381}
1382
1383void
1384_eval (Coro::State coro, SV *coderef)
1385 CODE:
1386{
1387 if (coro->mainstack)
1388 {
1389 struct coro temp;
1390 Zero (&temp, 1, struct coro);
1391 temp.save = CORO_SAVE_ALL;
1392
1393 if (!(coro->flags & CF_RUNNING))
1394 {
1395 save_perl (aTHX_ &temp);
1396 load_perl (aTHX_ coro);
1397 }
1398
1399 {
1400 dSP;
1401 ENTER;
1402 SAVETMPS;
1403 PUSHMARK (SP);
1404 PUTBACK;
1405 call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
1406 SPAGAIN;
1407 FREETMPS;
1408 LEAVE;
1409 PUTBACK;
1410 }
1411
1412 if (!(coro->flags & CF_RUNNING))
1413 {
1414 save_perl (aTHX_ coro);
1415 load_perl (aTHX_ &temp);
1416 }
1417 }
1418}
1419
1420SV *
1421is_ready (Coro::State coro)
1422 PROTOTYPE: $
1423 ALIAS:
1424 is_ready = CF_READY
1425 is_running = CF_RUNNING
1426 is_new = CF_NEW
1427 is_destroyed = CF_DESTROYED
1428 CODE:
1429 RETVAL = boolSV (coro->flags & ix);
1430 OUTPUT:
1431 RETVAL
1432
1433SV *
1434has_stack (Coro::State coro)
1435 PROTOTYPE: $
1436 CODE:
1437 RETVAL = boolSV (!!coro->cctx);
1438 OUTPUT:
1439 RETVAL
1440
1441IV
1442rss (Coro::State coro)
1443 PROTOTYPE: $
1041 CODE: 1444 CODE:
1042 static SV *returnstk; 1445 RETVAL = coro_rss (coro);
1043 SV *sv; 1446 OUTPUT:
1044 AV *defav = GvAV (PL_defgv); 1447 RETVAL
1045 struct coro *prev, *next;
1046 1448
1047 if (!returnstk)
1048 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1049
1050 /* set up @_ -- ugly */
1051 av_clear (defav);
1052 av_fill (defav, items - 1);
1053 while (items--)
1054 av_store (defav, items, SvREFCNT_inc (ST(items)));
1055
1056 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1057 sv = av_pop ((AV *)SvRV (returnstk));
1058 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1059 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1060 SvREFCNT_dec (sv);
1061
1062 transfer(aTHX_ prev, next, 0);
1063 1449
1064MODULE = Coro::State PACKAGE = Coro 1450MODULE = Coro::State PACKAGE = Coro
1065 1451
1066# this is slightly dirty (should expose a c-level api)
1067
1068BOOT: 1452BOOT:
1069{ 1453{
1070 int i; 1454 int i;
1455
1456 sv_pool_rss = get_sv ("Coro::POOL_RSS" , TRUE);
1457 sv_pool_size = get_sv ("Coro::POOL_SIZE" , TRUE);
1458 av_async_pool = get_av ("Coro::async_pool", TRUE);
1459
1460 coro_current = get_sv ("Coro::current", FALSE);
1461 SvREADONLY_on (coro_current);
1462
1071 HV *stash = gv_stashpv ("Coro", TRUE); 1463 coro_stash = gv_stashpv ("Coro", TRUE);
1072 1464
1073 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1465 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1074 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1466 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1075 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1467 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1076 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1468 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1077 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1469 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1078 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1470 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1079
1080 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1081 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1082 1471
1083 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1472 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1084 coro_ready[i] = newAV (); 1473 coro_ready[i] = newAV ();
1085 1474
1086 { 1475 {
1087 SV *sv = perl_get_sv("Coro::API", 1); 1476 SV *sv = perl_get_sv("Coro::API", 1);
1088 1477
1089 coroapi.schedule = api_schedule; 1478 coroapi.schedule = api_schedule;
1479 coroapi.save = api_save;
1090 coroapi.cede = api_cede; 1480 coroapi.cede = api_cede;
1481 coroapi.cede_notself = api_cede_notself;
1091 coroapi.ready = api_ready; 1482 coroapi.ready = api_ready;
1483 coroapi.is_ready = api_is_ready;
1092 coroapi.nready = &coro_nready; 1484 coroapi.nready = &coro_nready;
1093 coroapi.current = coro_current; 1485 coroapi.current = coro_current;
1094 1486
1095 GCoroAPI = &coroapi; 1487 GCoroAPI = &coroapi;
1096 sv_setiv(sv, (IV)&coroapi); 1488 sv_setiv (sv, (IV)&coroapi);
1097 SvREADONLY_on(sv); 1489 SvREADONLY_on (sv);
1098 } 1490 }
1099} 1491}
1100 1492
1101void 1493void
1102ready(self) 1494_set_current (SV *current)
1103 SV * self
1104 PROTOTYPE: $ 1495 PROTOTYPE: $
1105 CODE: 1496 CODE:
1106 api_ready (self); 1497 SvREFCNT_dec (SvRV (coro_current));
1498 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1107 1499
1108int 1500int
1501prio (Coro::State coro, int newprio = 0)
1502 ALIAS:
1503 nice = 1
1504 CODE:
1505{
1506 RETVAL = coro->prio;
1507
1508 if (items > 1)
1509 {
1510 if (ix)
1511 newprio = coro->prio - newprio;
1512
1513 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1514 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1515
1516 coro->prio = newprio;
1517 }
1518}
1519 OUTPUT:
1520 RETVAL
1521
1522SV *
1523ready (SV *self)
1524 PROTOTYPE: $
1525 CODE:
1526 RETVAL = boolSV (api_ready (self));
1527 OUTPUT:
1528 RETVAL
1529
1530int
1109nready(...) 1531nready (...)
1110 PROTOTYPE: 1532 PROTOTYPE:
1111 CODE: 1533 CODE:
1112 RETVAL = coro_nready; 1534 RETVAL = coro_nready;
1113 OUTPUT: 1535 OUTPUT:
1114 RETVAL 1536 RETVAL
1115 1537
1538# for async_pool speedup
1116void 1539void
1117schedule(...) 1540_pool_1 (SV *cb)
1118 PROTOTYPE:
1119 CODE: 1541 CODE:
1120 api_schedule (); 1542{
1543 int i, len;
1544 HV *hv = (HV *)SvRV (coro_current);
1545 AV *defav = GvAV (PL_defgv);
1546 SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0);
1547 AV *invoke_av;
1548
1549 if (!invoke)
1550 croak ("\3terminate\2\n");
1551
1552 hv_store (hv, "desc", sizeof ("desc") - 1,
1553 newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0);
1554
1555 invoke_av = (AV *)SvRV (invoke);
1556 len = av_len (invoke_av);
1557
1558 sv_setsv (cb, AvARRAY (invoke_av)[0]);
1559
1560 if (len > 0)
1561 {
1562 av_fill (defav, len - 1);
1563 for (i = 0; i < len; ++i)
1564 av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1]));
1565 }
1566
1567 SvREFCNT_dec (invoke);
1568}
1121 1569
1122void 1570void
1123cede(...) 1571_pool_2 (SV *cb)
1124 PROTOTYPE:
1125 CODE: 1572 CODE:
1126 api_cede (); 1573{
1574 struct coro *coro = SvSTATE (coro_current);
1127 1575
1576 sv_setsv (cb, &PL_sv_undef);
1577
1578 if (coro_rss (coro) > SvIV (sv_pool_rss)
1579 || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size))
1580 croak ("\3terminate\2\n");
1581
1582 av_clear (GvAV (PL_defgv));
1583 hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1,
1584 newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0);
1585 coro->save = CORO_SAVE_DEF;
1586 coro->prio = 0;
1587 av_push (av_async_pool, newSVsv (coro_current));
1588}
1589
1590
1591MODULE = Coro::State PACKAGE = Coro::AIO
1592
1593SV *
1594_get_state ()
1595 CODE:
1596{
1597 struct io_state *data;
1598
1599 RETVAL = newSV (sizeof (struct io_state));
1600 data = (struct io_state *)SvPVX (RETVAL);
1601 SvCUR_set (RETVAL, sizeof (struct io_state));
1602 SvPOK_only (RETVAL);
1603
1604 data->errorno = errno;
1605 data->laststype = PL_laststype;
1606 data->laststatval = PL_laststatval;
1607 data->statcache = PL_statcache;
1608}
1609 OUTPUT:
1610 RETVAL
1611
1612void
1613_set_state (char *data_)
1614 PROTOTYPE: $
1615 CODE:
1616{
1617 struct io_state *data = (void *)data_;
1618
1619 errno = data->errorno;
1620 PL_laststype = data->laststype;
1621 PL_laststatval = data->laststatval;
1622 PL_statcache = data->statcache;
1623}
1624

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines