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.15 by root, Wed Jul 25 04:14:38 2001 UTC vs.
Revision 1.160 by root, Sat Sep 22 22:39:15 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 "libcoro/coro.c" 9#include "patchlevel.h"
10
11#include <stdio.h>
12#include <errno.h>
13#include <assert.h>
6 14
7#ifdef HAVE_MMAP 15#ifdef HAVE_MMAP
8# include <unistd.h> 16# include <unistd.h>
9# include <sys/mman.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
10#endif 24# endif
11 25# include <limits.h>
12#define MAY_FLUSH /* increases codesize */ 26# ifndef PAGESIZE
13 27# define PAGESIZE pagesize
14/* perl-related */ 28# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
15#define TRANSFER_SAVE_DEFAV 0x00000001 29static long pagesize;
16#define TRANSFER_SAVE_DEFSV 0x00000002 30# else
17#define TRANSFER_SAVE_ERRSV 0x00000004 31# define BOOT_PAGESIZE (void)0
18/* c-related */ 32# endif
19#define TRANSFER_SAVE_CCTXT 0x00000008
20#ifdef CORO_LAZY_STACK
21# define TRANSFER_LAZY_STACK 0x00000010
22#else 33#else
23# define TRANSFER_LAZY_STACK 0x00000000 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)
55# ifndef PL_ppaddr
56# define PL_ppaddr ppaddr
24#endif 57# endif
58# ifndef call_sv
59# define call_sv perl_call_sv
60# endif
61# ifndef get_sv
62# define get_sv perl_get_sv
63# endif
64# ifndef get_cv
65# define get_cv perl_get_cv
66# endif
67# ifndef IS_PADGV
68# define IS_PADGV(v) 0
69# endif
70# ifndef IS_PADCONST
71# define IS_PADCONST(v) 0
72# endif
73#endif
25 74
26#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \ 75/* 5.8.7 */
27 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT) 76#ifndef SvRV_set
77# define SvRV_set(s,v) SvRV(s) = (v)
78#endif
28 79
29#define SUB_INIT "Coro::State::initialize" 80#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
30#define UCORO_STATE "_coro_state" 81# undef CORO_STACKGUARD
82#endif
31 83
32/* The next macro should delcare a variable stacklevel that contains and approximation 84#ifndef CORO_STACKGUARD
33 * to the current C stack pointer. It's property is that it changes with each call 85# define CORO_STACKGUARD 0
34 * and should be unique. */ 86#endif
87
88/* prefer perl internal functions over our own? */
89#ifndef CORO_PREFER_PERL_FUNCTIONS
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
35#define dSTACKLEVEL void *stacklevel = &stacklevel 96#define STACKLEVEL ((void *)&stacklevel)
36 97
37#define labs(l) ((l) >= 0 ? (l) : -(l)) 98#define IN_DESTRUCT (PL_main_cv == Nullcv)
38 99
39/* this is actually not only the c stack but also c registers etc... */ 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))
109
110#include "CoroAPI.h"
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;
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 */
136
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 */
40typedef struct { 146typedef struct coro_cctx {
41 int refcnt; /* pointer reference counter */ 147 struct coro_cctx *next;
42 int usecnt; /* shared by how many coroutines */
43 int gencnt; /* generation counter */
44 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;
45 coro_context cctx; 157 coro_context cctx;
46 158
47 void *sptr; 159#if CORO_USE_VALGRIND
48 long ssize; /* positive == mmap, otherwise malloc */ 160 int valgrind_id;
49} coro_stack; 161#endif
162 char inuse, mapped;
163} coro_cctx;
50 164
51static coro_stack main_stack = { 1, 0, 0 }; 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};
52 171
172/* this is a structure representing a perl-level coroutine */
53struct coro { 173struct coro {
54 /* the optional C context */ 174 /* the c coroutine allocated to this perl coroutine, if any */
55 coro_stack *stack; 175 coro_cctx *cctx;
56 void *cursp;
57 int gencnt;
58
59 /* optionally saved, might be zero */
60 AV *defav;
61 SV *defsv;
62 SV *errsv;
63
64 /* saved global state not related to stacks */
65 U8 dowarn;
66
67 /* the stacks and related info (callchain etc..) */
68 PERL_SI *curstackinfo;
69 AV *curstack;
70 AV *mainstack;
71 SV **stack_sp;
72 OP *op;
73 SV **curpad;
74 SV **stack_base;
75 SV **stack_max;
76 SV **tmps_stack;
77 I32 tmps_floor;
78 I32 tmps_ix;
79 I32 tmps_max;
80 I32 *markstack;
81 I32 *markstack_ptr;
82 I32 *markstack_max;
83 I32 *scopestack;
84 I32 scopestack_ix;
85 I32 scopestack_max;
86 ANY *savestack;
87 I32 savestack_ix;
88 I32 savestack_max;
89 OP **retstack;
90 I32 retstack_ix;
91 I32 retstack_max;
92 COP *curcop;
93 JMPENV start_env;
94 JMPENV *top_env;
95 176
96 /* data associated with this coroutine (initial args) */ 177 /* data associated with this coroutine (initial args) */
97 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 */
98}; 201};
99 202
100typedef struct coro *Coro__State; 203typedef struct coro *Coro__State;
101typedef struct coro *Coro__State_or_hashref; 204typedef struct coro *Coro__State_or_hashref;
102 205
103static AV *main_mainstack; /* used to differentiate between $main and others */ 206/** Coro ********************************************************************/
104static HV *coro_state_stash;
105static SV *ucoro_state_sv;
106static U32 ucoro_state_hash;
107static HV *padlist_cache;
108 207
109/* mostly copied from op.c:cv_clone2 */ 208#define PRIO_MAX 3
110STATIC AV * 209#define PRIO_HIGH 1
111clone_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)
112{ 225{
113 AV *av; 226 AV *padlist = CvPADLIST (cv);
114 I32 ix;
115 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
116 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
117 SV **pname = AvARRAY (protopad_name);
118 SV **ppad = AvARRAY (protopad);
119 I32 fname = AvFILLp (protopad_name);
120 I32 fpad = AvFILLp (protopad);
121 AV *newpadlist, *newpad_name, *newpad; 227 AV *newpadlist, *newpad;
122 SV **npad;
123
124 newpad_name = newAV ();
125 for (ix = fname; ix >= 0; ix--)
126 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
127
128 newpad = newAV ();
129 av_fill (newpad, AvFILLp (protopad));
130 npad = AvARRAY (newpad);
131 228
132 newpadlist = newAV (); 229 newpadlist = newAV ();
133 AvREAL_off (newpadlist); 230 AvREAL_off (newpadlist);
134 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)));
135 av_store (newpadlist, 1, (SV *) newpad); 240 av_store (newpadlist, 1, (SV *)newpad);
136 241
137 av = newAV (); /* will be @_ */ 242 return newpadlist;
138 av_extend (av, 0); 243}
139 av_store (newpad, 0, (SV *) av);
140 AvFLAGS (av) = AVf_REIFY;
141 244
142 for (ix = fpad; ix > 0; ix--) 245static void
246free_padlist (pTHX_ AV *padlist)
247{
248 /* may be during global destruction */
249 if (SvREFCNT (padlist))
143 { 250 {
144 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 251 I32 i = AvFILLp (padlist);
145 if (namesv && namesv != &PL_sv_undef) 252 while (i >= 0)
146 { 253 {
147 char *name = SvPVX (namesv); /* XXX */ 254 SV **svp = av_fetch (padlist, i--, FALSE);
148 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 255 if (svp)
149 { /* lexical from outside? */
150 npad[ix] = SvREFCNT_inc (ppad[ix]);
151 } 256 {
152 else
153 { /* our own lexical */
154 SV *sv; 257 SV *sv;
155 if (*name == '&') 258 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
156 sv = SvREFCNT_inc (ppad[ix]); 259 SvREFCNT_dec (sv);
157 else if (*name == '@') 260
158 sv = (SV *) newAV (); 261 SvREFCNT_dec (*svp);
159 else if (*name == '%')
160 sv = (SV *) newHV ();
161 else
162 sv = NEWSV (0, 0);
163 if (!SvPADBUSY (sv))
164 SvPADMY_on (sv);
165 npad[ix] = sv;
166 } 262 }
167 } 263 }
168 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))
169 { 362 {
170 npad[ix] = SvREFCNT_inc (ppad[ix]); 363 SvREFCNT_dec (c->irssv);
364 c->irssv = 0;
171 } 365 }
172 else 366 else
173 { 367 {
174 SV *sv = NEWSV (0, 0); 368 REPLACE_SV (PL_rs, c->irssv);
175 SvPADTMP_on (sv); 369 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
176 npad[ix] = sv; 370 sv_setsv (c->irssv_sv, PL_rs);
177 } 371 }
178 } 372 }
179
180#if 0 /* return -ENOTUNDERSTOOD */
181 /* Now that vars are all in place, clone nested closures. */
182
183 for (ix = fpad; ix > 0; ix--) {
184 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
185 if (namesv
186 && namesv != &PL_sv_undef
187 && !(SvFLAGS(namesv) & SVf_FAKE)
188 && *SvPVX(namesv) == '&'
189 && CvCLONE(ppad[ix]))
190 {
191 CV *kid = cv_clone((CV*)ppad[ix]);
192 SvREFCNT_dec(ppad[ix]);
193 CvCLONE_on(kid);
194 SvPADMY_on(kid);
195 npad[ix] = (SV*)kid;
196 }
197 }
198#endif
199
200 return newpadlist;
201}
202
203#ifdef MAY_FLUSH
204STATIC AV *
205free_padlist (AV *padlist)
206{
207 /* may be during global destruction */
208 if (SvREFCNT(padlist))
209 {
210 I32 i = AvFILLp(padlist);
211 while (i >= 0)
212 {
213 SV **svp = av_fetch(padlist, i--, FALSE);
214 SV *sv = svp ? *svp : Nullsv;
215 if (sv)
216 SvREFCNT_dec(sv);
217 }
218
219 SvREFCNT_dec((SV*)padlist);
220 }
221}
222#endif
223
224/* the next two functions merely cache the padlists */
225STATIC void
226get_padlist (CV *cv)
227{
228 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
229
230 if (he && AvFILLp ((AV *)*he) >= 0)
231 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
232 else
233 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
234}
235
236STATIC void
237put_padlist (CV *cv)
238{
239 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
240
241 if (SvTYPE (*he) != SVt_PVAV)
242 {
243 SvREFCNT_dec (*he);
244 *he = (SV *)newAV ();
245 }
246
247 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
248}
249
250#ifdef MAY_FLUSH
251STATIC void
252flush_padlist_cache ()
253{
254 HV *hv = padlist_cache;
255 padlist_cache = newHV ();
256
257 if (hv_iterinit (hv))
258 {
259 HE *he;
260 AV *padlist;
261
262 while (!!(he = hv_iternext (hv)))
263 {
264 AV *av = (AV *)HeVAL(he);
265
266 /* casting is fun. */
267 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
268 free_padlist (padlist);
269 }
270 }
271
272 SvREFCNT_dec (hv);
273}
274#endif
275
276#define SB do {
277#define SE } while (0)
278
279#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
280#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
281
282#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
283
284static void
285load_state(pTHX_ Coro__State c)
286{
287 PL_dowarn = c->dowarn;
288
289 PL_curstackinfo = c->curstackinfo;
290 PL_curstack = c->curstack;
291 PL_mainstack = c->mainstack;
292 PL_stack_sp = c->stack_sp;
293 PL_op = c->op;
294 PL_curpad = c->curpad;
295 PL_stack_base = c->stack_base;
296 PL_stack_max = c->stack_max;
297 PL_tmps_stack = c->tmps_stack;
298 PL_tmps_floor = c->tmps_floor;
299 PL_tmps_ix = c->tmps_ix;
300 PL_tmps_max = c->tmps_max;
301 PL_markstack = c->markstack;
302 PL_markstack_ptr = c->markstack_ptr;
303 PL_markstack_max = c->markstack_max;
304 PL_scopestack = c->scopestack;
305 PL_scopestack_ix = c->scopestack_ix;
306 PL_scopestack_max = c->scopestack_max;
307 PL_savestack = c->savestack;
308 PL_savestack_ix = c->savestack_ix;
309 PL_savestack_max = c->savestack_max;
310 PL_retstack = c->retstack;
311 PL_retstack_ix = c->retstack_ix;
312 PL_retstack_max = c->retstack_max;
313 PL_curcop = c->curcop;
314 PL_start_env = c->start_env;
315 PL_top_env = c->top_env;
316
317 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
318 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
319 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
320 373
321 { 374 {
322 dSP; 375 dSP;
323 CV *cv; 376 CV *cv;
324 377
325 /* now do the ugly restore mess */ 378 /* now do the ugly restore mess */
326 while ((cv = (CV *)POPs)) 379 while ((cv = (CV *)POPs))
327 { 380 {
328 AV *padlist = (AV *)POPs;
329
330 if (padlist)
331 {
332 put_padlist (cv); /* mark this padlist as available */ 381 put_padlist (aTHX_ cv); /* mark this padlist as available */
333 CvPADLIST(cv) = padlist; 382 CvDEPTH (cv) = PTR2IV (POPs);
334#ifdef USE_THREADS 383 CvPADLIST (cv) = (AV *)POPs;
335 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
336#endif
337 }
338
339 ++CvDEPTH(cv);
340 } 384 }
341 385
342 PUTBACK; 386 PUTBACK;
343 } 387 }
344} 388}
345 389
346static void 390static void
347save_state(pTHX_ Coro__State c, int flags) 391save_perl (pTHX_ Coro__State c)
348{ 392{
349 { 393 {
350 dSP; 394 dSP;
351 I32 cxix = cxstack_ix; 395 I32 cxix = cxstack_ix;
352 PERL_CONTEXT *ccstk = cxstack; 396 PERL_CONTEXT *ccstk = cxstack;
… …
355 /* 399 /*
356 * 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
357 * (and reinitialize) all cv's in the whole callchain :( 401 * (and reinitialize) all cv's in the whole callchain :(
358 */ 402 */
359 403
360 PUSHs (Nullsv); 404 XPUSHs (Nullsv);
361 /* this loop was inspired by pp_caller */ 405 /* this loop was inspired by pp_caller */
362 for (;;) 406 for (;;)
363 { 407 {
364 do 408 while (cxix >= 0)
365 { 409 {
366 PERL_CONTEXT *cx = &ccstk[cxix--]; 410 PERL_CONTEXT *cx = &ccstk[cxix--];
367 411
368 if (CxTYPE(cx) == CXt_SUB) 412 if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)
369 { 413 {
370 CV *cv = cx->blk_sub.cv; 414 CV *cv = cx->blk_sub.cv;
415
371 if (CvDEPTH(cv)) 416 if (CvDEPTH (cv))
372 { 417 {
373#ifdef USE_THREADS
374 /*XPUSHs ((SV *)CvOWNER(cv));*/
375 /*CvOWNER(cv) = 0;*/
376 /*error must unlock this cv etc.. etc...*/
377#endif
378 EXTEND (SP, CvDEPTH(cv)*2); 418 EXTEND (SP, 3);
379
380 while (--CvDEPTH(cv))
381 {
382 /* this tells the restore code to increment CvDEPTH */
383 PUSHs (Nullsv);
384 PUSHs ((SV *)cv);
385 }
386
387 PUSHs ((SV *)CvPADLIST(cv)); 419 PUSHs ((SV *)CvPADLIST (cv));
420 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
388 PUSHs ((SV *)cv); 421 PUSHs ((SV *)cv);
389 422
390 get_padlist (cv); /* this is a monster */ 423 CvDEPTH (cv) = 0;
424 get_padlist (aTHX_ cv);
391 } 425 }
392 } 426 }
393 else if (CxTYPE(cx) == CXt_FORMAT)
394 {
395 /* I never used formats, so how should I know how these are implemented? */
396 /* my bold guess is as a simple, plain sub... */
397 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
398 }
399 } 427 }
400 while (cxix >= 0);
401 428
402 if (top_si->si_type == PERLSI_MAIN) 429 if (top_si->si_type == PERLSI_MAIN)
403 break; 430 break;
404 431
405 top_si = top_si->si_prev; 432 top_si = top_si->si_prev;
406 ccstk = top_si->si_cxstack; 433 ccstk = top_si->si_cxstack;
407 cxix = top_si->si_cxix; 434 cxix = top_si->si_cxix;
408 } 435 }
409 436
410 PUTBACK; 437 PUTBACK;
411 } 438 }
412 439
413 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;
414 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 441 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
415 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;
416 445
417 /* I have not the slightest idea of why av_reify is necessary */ 446#define VAR(name,type)c->name = PL_ ## name;
418 /* but if it's missing the defav contents magically get replaced sometimes */ 447# include "state.h"
419 if (c->defav) 448#undef VAR
420 av_reify (c->defav);
421
422 c->dowarn = PL_dowarn;
423
424 c->curstackinfo = PL_curstackinfo;
425 c->curstack = PL_curstack;
426 c->mainstack = PL_mainstack;
427 c->stack_sp = PL_stack_sp;
428 c->op = PL_op;
429 c->curpad = PL_curpad;
430 c->stack_base = PL_stack_base;
431 c->stack_max = PL_stack_max;
432 c->tmps_stack = PL_tmps_stack;
433 c->tmps_floor = PL_tmps_floor;
434 c->tmps_ix = PL_tmps_ix;
435 c->tmps_max = PL_tmps_max;
436 c->markstack = PL_markstack;
437 c->markstack_ptr = PL_markstack_ptr;
438 c->markstack_max = PL_markstack_max;
439 c->scopestack = PL_scopestack;
440 c->scopestack_ix = PL_scopestack_ix;
441 c->scopestack_max = PL_scopestack_max;
442 c->savestack = PL_savestack;
443 c->savestack_ix = PL_savestack_ix;
444 c->savestack_max = PL_savestack_max;
445 c->retstack = PL_retstack;
446 c->retstack_ix = PL_retstack_ix;
447 c->retstack_max = PL_retstack_max;
448 c->curcop = PL_curcop;
449 c->start_env = PL_start_env;
450 c->top_env = PL_top_env;
451} 449}
452 450
453/* 451/*
454 * allocate various perl stacks. This is an exact copy 452 * allocate various perl stacks. This is an exact copy
455 * of perl.c:init_stacks, except that it uses less memory 453 * of perl.c:init_stacks, except that it uses less memory
456 * on the assumption that coroutines do not usually need 454 * on the (sometimes correct) assumption that coroutines do
457 * a lot of stackspace. 455 * not usually need a lot of stackspace.
458 */ 456 */
459STATIC void 457#if CORO_PREFER_PERL_FUNCTIONS
458# define coro_init_stacks init_stacks
459#else
460static void
460coro_init_stacks (pTHX) 461coro_init_stacks (pTHX)
461{ 462{
462 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 463 PL_curstackinfo = new_stackinfo(64, 6);
463 PL_curstackinfo->si_type = PERLSI_MAIN; 464 PL_curstackinfo->si_type = PERLSI_MAIN;
464 PL_curstack = PL_curstackinfo->si_stack; 465 PL_curstack = PL_curstackinfo->si_stack;
465 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 466 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
466 467
467 PL_stack_base = AvARRAY(PL_curstack); 468 PL_stack_base = AvARRAY(PL_curstack);
468 PL_stack_sp = PL_stack_base; 469 PL_stack_sp = PL_stack_base;
469 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 470 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
470 471
471 New(50,PL_tmps_stack,96,SV*); 472 New(50,PL_tmps_stack,64,SV*);
472 PL_tmps_floor = -1; 473 PL_tmps_floor = -1;
473 PL_tmps_ix = -1; 474 PL_tmps_ix = -1;
474 PL_tmps_max = 96; 475 PL_tmps_max = 64;
475 476
476 New(54,PL_markstack,16,I32); 477 New(54,PL_markstack,16,I32);
477 PL_markstack_ptr = PL_markstack; 478 PL_markstack_ptr = PL_markstack;
478 PL_markstack_max = PL_markstack + 16; 479 PL_markstack_max = PL_markstack + 16;
479 480
481#ifdef SET_MARK_OFFSET
480 SET_MARK_OFFSET; 482 SET_MARK_OFFSET;
483#endif
481 484
482 New(54,PL_scopestack,16,I32); 485 New(54,PL_scopestack,16,I32);
483 PL_scopestack_ix = 0; 486 PL_scopestack_ix = 0;
484 PL_scopestack_max = 16; 487 PL_scopestack_max = 16;
485 488
486 New(54,PL_savestack,96,ANY); 489 New(54,PL_savestack,64,ANY);
487 PL_savestack_ix = 0; 490 PL_savestack_ix = 0;
488 PL_savestack_max = 96; 491 PL_savestack_max = 64;
489 492
493#if !PERL_VERSION_ATLEAST (5,9,0)
490 New(54,PL_retstack,8,OP*); 494 New(54,PL_retstack,4,OP*);
491 PL_retstack_ix = 0; 495 PL_retstack_ix = 0;
492 PL_retstack_max = 8; 496 PL_retstack_max = 4;
497#endif
493} 498}
499#endif
494 500
495/* 501/*
496 * destroy the stacks, the callchain etc... 502 * destroy the stacks, the callchain etc...
497 * still there is a memleak of 128 bytes...
498 */ 503 */
499STATIC void 504static void
500destroy_stacks(pTHX) 505coro_destroy_stacks (pTHX)
501{ 506{
502 /* is this ugly, I ask? */ 507 if (!IN_DESTRUCT)
503 while (PL_scopestack_ix) 508 {
504 LEAVE; 509 /* restore all saved variables and stuff */
510 LEAVE_SCOPE (0);
511 assert (PL_tmps_floor == -1);
505 512
506 /* sure it is, but more important: is it correct?? :/ */ 513 /* free all temporaries */
507 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
508 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);
522 }
509 523
510 while (PL_curstackinfo->si_next) 524 while (PL_curstackinfo->si_next)
511 PL_curstackinfo = PL_curstackinfo->si_next; 525 PL_curstackinfo = PL_curstackinfo->si_next;
512 526
513 while (PL_curstackinfo) 527 while (PL_curstackinfo)
514 { 528 {
515 PERL_SI *p = PL_curstackinfo->si_prev; 529 PERL_SI *p = PL_curstackinfo->si_prev;
516 530
517 { 531 if (!IN_DESTRUCT)
518 dSP;
519 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
520 PUTBACK; /* possibly superfluous */
521 }
522
523 dounwind(-1);
524
525 SvREFCNT_dec(PL_curstackinfo->si_stack); 532 SvREFCNT_dec (PL_curstackinfo->si_stack);
533
526 Safefree(PL_curstackinfo->si_cxstack); 534 Safefree (PL_curstackinfo->si_cxstack);
527 Safefree(PL_curstackinfo); 535 Safefree (PL_curstackinfo);
528 PL_curstackinfo = p; 536 PL_curstackinfo = p;
529 } 537 }
530 538
531 Safefree(PL_tmps_stack); 539 Safefree (PL_tmps_stack);
532 Safefree(PL_markstack); 540 Safefree (PL_markstack);
533 Safefree(PL_scopestack); 541 Safefree (PL_scopestack);
534 Safefree(PL_savestack); 542 Safefree (PL_savestack);
543#if !PERL_VERSION_ATLEAST (5,9,0)
535 Safefree(PL_retstack); 544 Safefree (PL_retstack);
536}
537
538static void
539allocate_stack (Coro__State ctx, int alloc)
540{
541 coro_stack *stack;
542
543 New (0, stack, 1, coro_stack);
544
545 stack->refcnt = 1;
546 stack->usecnt = 1;
547 stack->gencnt = ctx->gencnt = 0;
548 if (alloc)
549 {
550#ifdef HAVE_MMAP
551 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */
552 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
553 if (stack->sptr == (void *)-1)
554#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)
555 { 556 {
556 /*FIXME*//*D*//* reasonable stack size! */ 557 #define VAR(name,type)coro->name = PL_ ## name;
557 stack->ssize = -4096 * sizeof (long); 558 # include "state.h"
558 New (0, stack->sptr, 4096, long); 559 #undef VAR
559 } 560 }
560 }
561 else
562 stack->sptr = 0;
563 561
564 ctx->stack = stack; 562 rss += sizeof (coro->curstackinfo);
565} 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);
566 570
567static void 571#if !PERL_VERSION_ATLEAST (5,9,0)
568deallocate_stack (Coro__State ctx) 572 rss += coro->retstack_max * sizeof (OP *);
569{ 573#endif
570 coro_stack *stack = ctx->stack;
571
572 ctx->stack = 0;
573
574 if (stack)
575 { 574 }
576 if (!--stack->refcnt)
577 {
578#ifdef HAVE_MMAP
579 if (stack->ssize > 0 && stack->sptr)
580 munmap (stack->sptr, stack->ssize);
581 else
582#else
583 Safefree (stack->sptr);
584#endif
585 Safefree (stack);
586 }
587 else if (ctx->gencnt == stack->gencnt)
588 --stack->usecnt;
589 }
590}
591 575
576 return rss;
577}
578
579/** coroutine stack handling ************************************************/
580
592static void 581static void
593setup_coro (void *arg) 582setup_coro (pTHX_ struct coro *coro)
594{ 583{
595 /* 584 /*
596 * emulate part of the perl startup here. 585 * emulate part of the perl startup here.
597 */ 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{
598 dSP; 635 dSP;
599 Coro__State ctx = (Coro__State)arg; 636 LOGOP myop;
600 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
601 637
602 coro_init_stacks (aTHX); 638 Zero (&myop, 1, LOGOP);
603 JMPENV_BOOTSTRAP; 639 myop.op_next = PL_op;
640 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
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);
604 SPAGAIN; 649 SPAGAIN;
650}
605 651
606 /*PL_curcop = 0;*/ 652/*
607 SvREFCNT_dec (GvAV (PL_defgv)); 653 * this is a _very_ stripped down perl interpreter ;)
608 GvAV (PL_defgv) = ctx->args; 654 */
655static void
656coro_run (void *arg)
657{
658 dTHX;
609 659
610 if (ctx->stack) 660 /* coro_run is the alternative tail of transfer(), so unlock here. */
611 { 661 UNLOCK;
612 ctx->cursp = 0;
613 662
614 PUSHMARK(SP); 663 PL_top_env = &PL_start_env;
615 PUTBACK; 664
616 (void) call_sv (sub_init, G_VOID|G_NOARGS); 665 /* inject a fake subroutine call to cctx_init */
617 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;
618 } 708 }
619 else 709 else
620 { 710#endif
621 UNOP myop;
622
623 PL_op = (OP *)&myop;
624
625 Zero(&myop, 1, UNOP);
626 myop.op_next = Nullop;
627 myop.op_flags = OPf_WANT_VOID;
628
629 PUSHMARK(SP);
630 XPUSHs (sub_init);
631 /*
632 * the next line is slightly wrong, as PL_op->op_next
633 * is actually being executed so we skip the first op.
634 * that doesn't matter, though, since it is only
635 * pp_nextstate and we never return...
636 * ah yes, and I don't care anyways ;)
637 */
638 PUTBACK;
639 PL_op = pp_entersub();
640 SPAGAIN;
641
642 ENTER; /* necessary e.g. for dounwind */
643 } 711 {
644} 712 cctx->ssize = coro_stacksize * (long)sizeof (long);
713 New (0, cctx->sptr, coro_stacksize, long);
645 714
646static void 715 if (!cctx->sptr)
647continue_coro (void *arg) 716 {
648{ 717 perror ("FATAL: unable to allocate stack for coroutine");
649 /* 718 _exit (EXIT_FAILURE);
650 * this is a _very_ stripped down perl interpreter ;) 719 }
651 */
652 Coro__State ctx = (Coro__State)arg;
653 720
654 ctx->cursp = 0; 721 stack_start = cctx->sptr;
722 stack_size = cctx->ssize;
723 }
724
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
655 PL_op = PL_op->op_next; 768 PL_op = PL_op->op_next;
656 CALLRUNOPS(aTHX); 769 return cctx_new ();
657 /*NORETURN*/
658 abort ();
659} 770}
660 771
661STATIC 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
662transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 795transfer (pTHX_ struct coro *prev, struct coro *next)
663{ 796{
664 dSP;
665 dSTACKLEVEL; 797 dSTACKLEVEL;
666 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 }
667 if (prev != next) 805 else if (prev != next)
668 { 806 {
669 if (next->mainstack) 807 coro_cctx *prev__cctx;
808
809 if (prev->flags & CF_NEW)
670 { 810 {
671 SAVE (prev, flags); 811 /* create a new empty context */
672 LOAD (next); 812 Newz (0, prev->cctx, 1, coro_cctx);
673 813 prev->cctx->inuse = 1;
674 /* mark this state as in-use */ 814 prev->flags &= ~CF_NEW;
675 next->mainstack = 0; 815 prev->flags |= CF_RUNNING;
676 next->tmps_ix = -2;
677
678 /* stacklevel changed? if yes, grab the stack for us! */
679 if (flags & TRANSFER_SAVE_CCTXT)
680 {
681 if (!prev->stack)
682 allocate_stack (prev, 0);
683 else if (prev->cursp != stacklevel
684 && prev->stack->usecnt > 1)
685 {
686 prev->gencnt = ++prev->stack->gencnt;
687 prev->stack->usecnt = 1;
688 }
689
690 /* has our stack been invalidated? */
691 if (next->stack && next->stack->gencnt != next->gencnt)
692 {
693 deallocate_stack (next);
694 allocate_stack (next, 1);
695 coro_create (&(next->stack->cctx),
696 continue_coro, (void *)next,
697 next->stack->sptr, labs (next->stack->ssize));
698 }
699
700 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
701 }
702
703 } 816 }
704 else if (next->tmps_ix == -2) 817
705 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 }
706 else 844 else
707 { 845 {
708 SAVE (prev, -1); /* first get rid of the old state */ 846 /* coroutine already started */
847 save_perl (aTHX_ prev);
848 load_perl (aTHX_ next);
849 }
709 850
710 if (flags & TRANSFER_SAVE_CCTXT) 851 prev__cctx = prev->cctx;
852
853 /* possibly "free" the cctx */
854 if (prev__cctx->idle_sp == STACKLEVEL)
855 {
856 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
857 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
858
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;
881 }
882}
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)
902 {
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 */
911
912 if (coro->mainstack && coro->mainstack != main_mainstack)
913 {
914 struct coro temp;
915
916 assert (!(coro->flags & CF_RUNNING));
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
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
1013api_transfer (SV *prev_sv, SV *next_sv)
1014{
1015 dTHX;
1016 struct transfer_args ta;
1017
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;
1033}
1034
1035/** Coro ********************************************************************/
1036
1037static void
1038coro_enq (pTHX_ SV *coro_sv)
1039{
1040 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
1041}
1042
1043static SV *
1044coro_deq (pTHX_ int min_prio)
1045{
1046 int prio = PRIO_MAX - PRIO_MIN;
1047
1048 min_prio -= PRIO_MIN;
1049 if (min_prio < 0)
1050 min_prio = 0;
1051
1052 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
1053 if (AvFILLp (coro_ready [prio]) >= 0)
1054 return av_shift (coro_ready [prio]);
1055
1056 return 0;
1057}
1058
1059static int
1060api_ready (SV *coro_sv)
1061{
1062 dTHX;
1063 struct coro *coro;
1064
1065 if (SvROK (coro_sv))
1066 coro_sv = SvRV (coro_sv);
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;
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;
1167}
1168
1169static void
1170api_schedule (void)
1171{
1172 dTHX;
1173 struct transfer_args ta;
1174
1175 prepare_schedule (aTHX_ &ta);
1176 TRANSFER (ta);
1177}
1178
1179static int
1180api_cede (void)
1181{
1182 dTHX;
1183 struct transfer_args ta;
1184
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;
1209}
1210
1211MODULE = Coro::State PACKAGE = Coro::State
1212
1213PROTOTYPES: DISABLE
1214
1215BOOT:
1216{
1217#ifdef USE_ITHREADS
1218 MUTEX_INIT (&coro_mutex);
1219#endif
1220 BOOT_PAGESIZE;
1221
1222 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
1223
1224 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
1225 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
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));
1229 newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
1230 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
1231
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;
1237
1238 coroapi.ver = CORO_API_VERSION;
1239 coroapi.transfer = api_transfer;
1240
1241 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1242}
1243
1244SV *
1245new (char *klass, ...)
1246 CODE:
1247{
1248 struct coro *coro;
1249 HV *hv;
1250 int i;
1251
1252 Newz (0, coro, 1, struct coro);
1253 coro->args = newAV ();
1254 coro->save = CORO_SAVE_DEF;
1255 coro->flags = CF_NEW;
1256
1257 if (coro_first) coro_first->prev = coro;
1258 coro->next = coro_first;
1259 coro_first = coro;
1260
1261 coro->hv = hv = newHV ();
1262 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1263 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1264
1265 for (i = 1; i < items; i++)
1266 av_push (coro->args, newSVsv (ST (i)));
1267}
1268 OUTPUT:
1269 RETVAL
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
1289void
1290_set_stacklevel (...)
1291 ALIAS:
1292 Coro::State::transfer = 1
1293 Coro::schedule = 2
1294 Coro::cede = 3
1295 Coro::cede_notself = 4
1296 CODE:
1297{
1298 struct transfer_args ta;
1299
1300 switch (ix)
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
1342
1343void
1344_exit (code)
1345 int code
1346 PROTOTYPE: $
1347 CODE:
1348 _exit (code);
1349
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
1358
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
1372
1373void
1374list ()
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
711 { 1399 {
712 if (!prev->stack)
713 allocate_stack (prev, 0);
714
715 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
716 { 1400 dSP;
717 setup_coro (next);
718
719 prev->stack->refcnt++;
720 prev->stack->usecnt++;
721 next->stack = prev->stack;
722 next->gencnt = prev->gencnt;
723 } 1401 ENTER;
724 else 1402 SAVETMPS;
1403 PUSHMARK (SP);
1404 PUTBACK;
1405 call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
1406 SPAGAIN;
1407 FREETMPS;
725 { 1408 LEAVE;
726 allocate_stack (next, 1); 1409 PUTBACK;
727 coro_create (&(next->stack->cctx),
728 setup_coro, (void *)next,
729 next->stack->sptr, labs (next->stack->ssize));
730 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
731 }
732 } 1410 }
733 else 1411
734 setup_coro (next); 1412 if (!(coro->flags & CF_RUNNING))
1413 {
1414 save_perl (aTHX_ coro);
1415 load_perl (aTHX_ &temp);
1416 }
735 } 1417 }
736 }
737
738 next->cursp = stacklevel;
739} 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
740 1432
741MODULE = Coro::State PACKAGE = Coro::State 1433IV
742 1434rss (Coro::State coro)
743PROTOTYPES: ENABLE
744
745BOOT:
746{ /* {} necessary for stoopid perl-5.6.x */
747 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
748 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
749 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
750
751 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
752 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
753 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
754 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
755
756 if (!padlist_cache)
757 padlist_cache = newHV ();
758
759 main_mainstack = PL_mainstack;
760}
761
762Coro::State
763_newprocess(args)
764 SV * args
765 PROTOTYPE: $ 1435 PROTOTYPE: $
766 CODE: 1436 CODE:
767 Coro__State coro;
768
769 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
770 croak ("Coro::State::_newprocess expects an arrayref");
771
772 New (0, coro, 1, struct coro);
773
774 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
775 coro->mainstack = 0; /* actual work is done inside transfer */
776 coro->stack = 0;
777
778 RETVAL = coro; 1437 RETVAL = coro_rss (coro);
779 OUTPUT: 1438 OUTPUT:
780 RETVAL 1439 RETVAL
781 1440
1441
1442MODULE = Coro::State PACKAGE = Coro
1443
1444BOOT:
1445{
1446 int i;
1447
1448 sv_pool_rss = get_sv ("Coro::POOL_RSS" , TRUE);
1449 sv_pool_size = get_sv ("Coro::POOL_SIZE" , TRUE);
1450 av_async_pool = get_av ("Coro::async_pool", TRUE);
1451
1452 coro_current = get_sv ("Coro::current", FALSE);
1453 SvREADONLY_on (coro_current);
1454
1455 coro_stash = gv_stashpv ("Coro", TRUE);
1456
1457 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1458 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1459 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1460 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1461 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1462 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1463
1464 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1465 coro_ready[i] = newAV ();
1466
1467 {
1468 SV *sv = perl_get_sv("Coro::API", 1);
1469
1470 coroapi.schedule = api_schedule;
1471 coroapi.save = api_save;
1472 coroapi.cede = api_cede;
1473 coroapi.cede_notself = api_cede_notself;
1474 coroapi.ready = api_ready;
1475 coroapi.is_ready = api_is_ready;
1476 coroapi.nready = &coro_nready;
1477 coroapi.current = coro_current;
1478
1479 GCoroAPI = &coroapi;
1480 sv_setiv (sv, (IV)&coroapi);
1481 SvREADONLY_on (sv);
1482 }
1483}
1484
782void 1485void
783transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 1486_set_current (SV *current)
784 Coro::State_or_hashref prev
785 Coro::State_or_hashref next
786 int flags
787 PROTOTYPE: @ 1487 PROTOTYPE: $
1488 CODE:
1489 SvREFCNT_dec (SvRV (coro_current));
1490 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1491
1492int
1493prio (Coro::State coro, int newprio = 0)
1494 ALIAS:
1495 nice = 1
788 CODE: 1496 CODE:
789 transfer (aTHX_ prev, next, flags); 1497{
1498 RETVAL = coro->prio;
1499
1500 if (items > 1)
1501 {
1502 if (ix)
1503 newprio = coro->prio - newprio;
1504
1505 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1506 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1507
1508 coro->prio = newprio;
1509 }
1510}
1511 OUTPUT:
1512 RETVAL
1513
1514SV *
1515ready (SV *self)
1516 PROTOTYPE: $
1517 CODE:
1518 RETVAL = boolSV (api_ready (self));
1519 OUTPUT:
1520 RETVAL
1521
1522int
1523nready (...)
1524 PROTOTYPE:
1525 CODE:
1526 RETVAL = coro_nready;
1527 OUTPUT:
1528 RETVAL
1529
1530# for async_pool speedup
1531SV *
1532_pool_1 (...)
1533 CODE:
1534{
1535 int i, len;
1536 HV *hv = (HV *)SvRV (coro_current);
1537 AV *defav = GvAV (PL_defgv);
1538 SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0);
1539 AV *invoke_av;
1540
1541 if (!invoke)
1542 XSRETURN_EMPTY;
1543
1544 hv_store (hv, "desc", sizeof ("desc") - 1,
1545 newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0);
1546
1547 invoke_av = (AV *)SvRV (invoke);
1548 len = av_len (invoke_av);
1549
1550 RETVAL = SvREFCNT_inc (AvARRAY (invoke_av)[0]);
1551
1552 if (len > 0)
1553 {
1554 av_clear (defav);
1555 av_extend (defav, len);
1556 for (i = 0; i < len; ++i)
1557 av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1]));
1558 }
1559
1560 SvREFCNT_dec (invoke);
1561}
1562 OUTPUT:
1563 RETVAL
790 1564
791void 1565void
792DESTROY(coro) 1566_pool_2 (...)
793 Coro::State coro 1567 CODE:
794 CODE: 1568{
1569 struct coro *coro = SvSTATE (coro_current);
795 1570
796 if (coro->mainstack && coro->mainstack != main_mainstack) 1571 if (coro_rss (coro) > SvIV (sv_pool_rss)
797 { 1572 || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size))
798 struct coro temp; 1573 XSRETURN_YES;
799 1574
800 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1575 av_clear (GvAV (PL_defgv));
801 LOAD(aTHX_ coro); 1576 hv_store (SvRV (coro_current), "desc", sizeof ("desc") - 1,
1577 newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0);
1578 coro->save = CORO_SAVE_DEF;
1579 coro->prio = 0;
1580 av_push (av_async_pool, newSVsv (coro_current));
802 1581
803 destroy_stacks (aTHX); 1582 XSRETURN_NO;
1583}
804 1584
805 LOAD((&temp)); /* this will get rid of defsv etc.. */
806 1585
807 coro->mainstack = 0; 1586MODULE = Coro::State PACKAGE = Coro::AIO
808 }
809 1587
810 deallocate_stack (coro); 1588SV *
1589_get_state ()
1590 CODE:
1591{
1592 struct io_state *data;
811 1593
812 Safefree (coro); 1594 RETVAL = newSV (sizeof (struct io_state));
1595 data = (struct io_state *)SvPVX (RETVAL);
1596 SvCUR_set (RETVAL, sizeof (struct io_state));
1597 SvPOK_only (RETVAL);
1598
1599 data->errorno = errno;
1600 data->laststype = PL_laststype;
1601 data->laststatval = PL_laststatval;
1602 data->statcache = PL_statcache;
1603}
1604 OUTPUT:
1605 RETVAL
813 1606
814void 1607void
815flush() 1608_set_state (char *data_)
1609 PROTOTYPE: $
816 CODE: 1610 CODE:
817#ifdef MAY_FLUSH 1611{
818 flush_padlist_cache (); 1612 struct io_state *data = (void *)data_;
819#endif
820 1613
821MODULE = Coro::State PACKAGE = Coro::Cont 1614 errno = data->errorno;
1615 PL_laststype = data->laststype;
1616 PL_laststatval = data->laststatval;
1617 PL_statcache = data->statcache;
1618}
822 1619
823# this is slightly dirty
824
825void
826yield(...)
827 PROTOTYPE: @
828 CODE:
829 static SV *returnstk;
830 SV *sv;
831 AV *defav = GvAV (PL_defgv);
832 struct coro *prev, *next;
833
834 if (!returnstk)
835 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
836
837 /* set up @_ -- ugly */
838 av_clear (defav);
839 av_fill (defav, items - 1);
840 while (items--)
841 av_store (defav, items, SvREFCNT_inc (ST(items)));
842
843 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
844 sv = av_pop ((AV *)SvRV (returnstk));
845 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
846 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
847 SvREFCNT_dec (sv);
848
849 transfer(aTHX_ prev, next, 0);
850

Diff Legend

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