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.57 by pcg, Thu Apr 22 04:14:49 2004 UTC vs.
Revision 1.163 by root, Mon Sep 24 18:30:58 2007 UTC

1#include "libcoro/coro.c"
2
1#define PERL_NO_GET_CONTEXT 3#define PERL_NO_GET_CONTEXT
2 4
3#include "EXTERN.h" 5#include "EXTERN.h"
4#include "perl.h" 6#include "perl.h"
5#include "XSUB.h" 7#include "XSUB.h"
6 8
7#include "patchlevel.h" 9#include "patchlevel.h"
8 10
9#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)
10# ifndef PL_ppaddr 55# ifndef PL_ppaddr
11# define PL_ppaddr ppaddr 56# define PL_ppaddr ppaddr
12# endif 57# endif
13# ifndef call_sv 58# ifndef call_sv
14# define call_sv perl_call_sv 59# define call_sv perl_call_sv
25# ifndef IS_PADCONST 70# ifndef IS_PADCONST
26# define IS_PADCONST(v) 0 71# define IS_PADCONST(v) 0
27# endif 72# endif
28#endif 73#endif
29 74
30#include "libcoro/coro.c" 75/* 5.8.7 */
31 76#ifndef SvRV_set
32#include <signal.h> 77# define SvRV_set(s,v) SvRV(s) = (v)
33
34#ifdef HAVE_MMAP
35# include <unistd.h>
36# include <sys/mman.h>
37# ifndef MAP_ANONYMOUS
38# ifdef MAP_ANON
39# define MAP_ANONYMOUS MAP_ANON
40# else
41# undef HAVE_MMAP
42# endif
43# endif 78#endif
44#endif
45 79
46#define SUB_INIT "Coro::State::initialize" 80#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
47#define UCORO_STATE "_coro_state" 81# undef CORO_STACKGUARD
82#endif
48 83
49/* The next macro should declare a variable stacklevel that contains and approximation 84#ifndef CORO_STACKGUARD
50 * to the current C stack pointer. Its property is that it changes with each call 85# define CORO_STACKGUARD 0
51 * 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
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
60#ifdef USE_ITHREADS 112#ifdef USE_ITHREADS
61static perl_mutex coro_mutex; 113static perl_mutex coro_mutex;
62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) 114# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) 115# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64#else 116#else
65# define LOCK 0 117# define LOCK (void)0
66# define UNLOCK 0 118# define UNLOCK (void)0
67#endif 119#endif
68 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;
69static struct CoroAPI coroapi; 131static struct CoroAPI coroapi;
70static AV *main_mainstack; /* used to differentiate between $main and others */ 132static AV *main_mainstack; /* used to differentiate between $main and others */
133static JMPENV *main_top_env;
71static HV *coro_state_stash; 134static HV *coro_state_stash, *coro_stash;
72static SV *ucoro_state_sv;
73static U32 ucoro_state_hash;
74static __thread SV *coro_mortal; /* will be freed after next transfer */ 135static SV *coro_mortal; /* will be freed after next transfer */
75 136
76/* 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 */
77typedef struct { 146typedef struct coro_cctx {
78 int refcnt; /* pointer reference counter */ 147 struct coro_cctx *next;
79 int usecnt; /* shared by how many coroutines */
80 int gencnt; /* generation counter */
81 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;
82 coro_context cctx; 157 coro_context cctx;
83 158
84 void *sptr; 159#if CORO_USE_VALGRIND
85 long ssize; /* positive == mmap, otherwise malloc */ 160 int valgrind_id;
86} coro_stack; 161#endif
162 char inuse, mapped;
163} coro_cctx;
87 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 */
88struct coro { 173struct coro {
89 /* the top-level JMPENV for each coroutine, needed to catch dies. */ 174 /* the c coroutine allocated to this perl coroutine, if any */
90 JMPENV start_env; 175 coro_cctx *cctx;
91
92 /* the optional C context */
93 coro_stack *stack;
94 void *cursp;
95 int gencnt;
96
97 /* optionally saved, might be zero */
98 AV *defav;
99 SV *defsv;
100 SV *errsv;
101
102 /* saved global state not related to stacks */
103 U8 dowarn;
104 I32 in_eval;
105
106 /* the stacks and related info (callchain etc..) */
107 PERL_SI *curstackinfo;
108 AV *curstack;
109 AV *mainstack;
110 SV **stack_sp;
111 OP *op;
112 SV **curpad;
113 AV *comppad;
114 SV **stack_base;
115 SV **stack_max;
116 SV **tmps_stack;
117 I32 tmps_floor;
118 I32 tmps_ix;
119 I32 tmps_max;
120 I32 *markstack;
121 I32 *markstack_ptr;
122 I32 *markstack_max;
123 I32 *scopestack;
124 I32 scopestack_ix;
125 I32 scopestack_max;
126 ANY *savestack;
127 I32 savestack_ix;
128 I32 savestack_max;
129 OP **retstack;
130 I32 retstack_ix;
131 I32 retstack_max;
132 COP *curcop;
133 JMPENV *top_env;
134 176
135 /* data associated with this coroutine (initial args) */ 177 /* data associated with this coroutine (initial args) */
136 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 */
137}; 201};
138 202
139typedef struct coro *Coro__State; 203typedef struct coro *Coro__State;
140typedef struct coro *Coro__State_or_hashref; 204typedef struct coro *Coro__State_or_hashref;
141 205
142/* mostly copied from op.c:cv_clone2 */ 206/** Coro ********************************************************************/
143STATIC AV * 207
144clone_padlist (pTHX_ AV *protopadlist) 208#define PRIO_MAX 3
209#define PRIO_HIGH 1
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)
145{ 225{
146 AV *av; 226 AV *padlist = CvPADLIST (cv);
147 I32 ix;
148 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
149 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
150 SV **pname = AvARRAY (protopad_name);
151 SV **ppad = AvARRAY (protopad);
152 I32 fname = AvFILLp (protopad_name);
153 I32 fpad = AvFILLp (protopad);
154 AV *newpadlist, *newpad_name, *newpad; 227 AV *newpadlist, *newpad;
155 SV **npad;
156
157 newpad_name = newAV ();
158 for (ix = fname; ix >= 0; ix--)
159 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
160
161 newpad = newAV ();
162 av_fill (newpad, AvFILLp (protopad));
163 npad = AvARRAY (newpad);
164 228
165 newpadlist = newAV (); 229 newpadlist = newAV ();
166 AvREAL_off (newpadlist); 230 AvREAL_off (newpadlist);
167 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)));
168 av_store (newpadlist, 1, (SV *) newpad); 240 av_store (newpadlist, 1, (SV *)newpad);
169
170 av = newAV (); /* will be @_ */
171 av_extend (av, 0);
172 av_store (newpad, 0, (SV *) av);
173 AvFLAGS (av) = AVf_REIFY;
174
175 for (ix = fpad; ix > 0; ix--)
176 {
177 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
178
179 if (namesv && namesv != &PL_sv_undef)
180 {
181 char *name = SvPVX (namesv); /* XXX */
182
183 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
184 { /* lexical from outside? */
185 npad[ix] = SvREFCNT_inc (ppad[ix]);
186 }
187 else
188 { /* our own lexical */
189 SV *sv;
190 if (*name == '&')
191 sv = SvREFCNT_inc (ppad[ix]);
192 else if (*name == '@')
193 sv = (SV *) newAV ();
194 else if (*name == '%')
195 sv = (SV *) newHV ();
196 else
197 sv = NEWSV (0, 0);
198
199#ifdef SvPADBUSY
200 if (!SvPADBUSY (sv))
201#endif
202 SvPADMY_on (sv);
203
204 npad[ix] = sv;
205 }
206 }
207 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
208 {
209 npad[ix] = SvREFCNT_inc (ppad[ix]);
210 }
211 else
212 {
213 SV *sv = NEWSV (0, 0);
214 SvPADTMP_on (sv);
215 npad[ix] = sv;
216 }
217 }
218
219#if 0 /* return -ENOTUNDERSTOOD */
220 /* Now that vars are all in place, clone nested closures. */
221
222 for (ix = fpad; ix > 0; ix--) {
223 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
224 if (namesv
225 && namesv != &PL_sv_undef
226 && !(SvFLAGS(namesv) & SVf_FAKE)
227 && *SvPVX(namesv) == '&'
228 && CvCLONE(ppad[ix]))
229 {
230 CV *kid = cv_clone((CV*)ppad[ix]);
231 SvREFCNT_dec(ppad[ix]);
232 CvCLONE_on(kid);
233 SvPADMY_on(kid);
234 npad[ix] = (SV*)kid;
235 }
236 }
237#endif
238 241
239 return newpadlist; 242 return newpadlist;
240} 243}
241 244
242STATIC void 245static void
243free_padlist (pTHX_ AV *padlist) 246free_padlist (pTHX_ AV *padlist)
244{ 247{
245 /* may be during global destruction */ 248 /* may be during global destruction */
246 if (SvREFCNT (padlist)) 249 if (SvREFCNT (padlist))
247 { 250 {
261 264
262 SvREFCNT_dec ((SV*)padlist); 265 SvREFCNT_dec ((SV*)padlist);
263 } 266 }
264} 267}
265 268
266STATIC int 269static int
267coro_cv_free (pTHX_ SV *sv, MAGIC *mg) 270coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
268{ 271{
269 AV *padlist; 272 AV *padlist;
270 AV *av = (AV *)mg->mg_obj; 273 AV *av = (AV *)mg->mg_obj;
271 274
272 /* casting is fun. */ 275 /* casting is fun. */
273 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 276 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
274 free_padlist (aTHX_ padlist); 277 free_padlist (aTHX_ padlist);
278
279 SvREFCNT_dec (av);
280
281 return 0;
275} 282}
276 283
277#define PERL_MAGIC_coro PERL_MAGIC_ext 284#define PERL_MAGIC_coro PERL_MAGIC_ext
278 285
279static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; 286static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
280 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
281/* the next two functions merely cache the padlists */ 295/* the next two functions merely cache the padlists */
282STATIC void 296static void
283get_padlist (pTHX_ CV *cv) 297get_padlist (pTHX_ CV *cv)
284{ 298{
285 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 299 MAGIC *mg = CORO_MAGIC (cv);
300 AV *av;
286 301
287 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) 302 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
288 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); 303 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
289 else 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
290 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); 313 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
314#endif
315 }
291} 316}
292 317
293STATIC void 318static void
294put_padlist (pTHX_ CV *cv) 319put_padlist (pTHX_ CV *cv)
295{ 320{
296 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 321 MAGIC *mg = CORO_MAGIC (cv);
322 AV *av;
297 323
298 if (!mg) 324 if (!mg)
299 { 325 {
300 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); 326 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
301 mg = mg_find ((SV *)cv, PERL_MAGIC_coro); 327 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
302 mg->mg_virtual = &vtbl_coro; 328 mg->mg_virtual = &vtbl_coro;
303 mg->mg_obj = (SV *)newAV (); 329 mg->mg_obj = (SV *)newAV ();
304 } 330 }
305 331
306 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); 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);
307} 338}
339
340/** load & save, init *******************************************************/
308 341
309#define SB do { 342#define SB do {
310#define SE } while (0) 343#define SE } while (0)
311 344
312#define LOAD(state) load_state(aTHX_ (state));
313#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
314
315#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE 345#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
316 346
317static void 347static void
318load_state(pTHX_ Coro__State c) 348load_perl (pTHX_ Coro__State c)
319{ 349{
320 PL_dowarn = c->dowarn; 350#define VAR(name,type) PL_ ## name = c->name;
321 PL_in_eval = c->in_eval; 351# include "state.h"
322 352#undef VAR
323 PL_curstackinfo = c->curstackinfo;
324 PL_curstack = c->curstack;
325 PL_mainstack = c->mainstack;
326 PL_stack_sp = c->stack_sp;
327 PL_op = c->op;
328 PL_curpad = c->curpad;
329 PL_comppad = c->comppad;
330 PL_stack_base = c->stack_base;
331 PL_stack_max = c->stack_max;
332 PL_tmps_stack = c->tmps_stack;
333 PL_tmps_floor = c->tmps_floor;
334 PL_tmps_ix = c->tmps_ix;
335 PL_tmps_max = c->tmps_max;
336 PL_markstack = c->markstack;
337 PL_markstack_ptr = c->markstack_ptr;
338 PL_markstack_max = c->markstack_max;
339 PL_scopestack = c->scopestack;
340 PL_scopestack_ix = c->scopestack_ix;
341 PL_scopestack_max = c->scopestack_max;
342 PL_savestack = c->savestack;
343 PL_savestack_ix = c->savestack_ix;
344 PL_savestack_max = c->savestack_max;
345 PL_retstack = c->retstack;
346 PL_retstack_ix = c->retstack_ix;
347 PL_retstack_max = c->retstack_max;
348 PL_curcop = c->curcop;
349 PL_top_env = c->top_env;
350 353
351 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 354 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
352 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 355 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
353 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 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))
362 {
363 SvREFCNT_dec (c->irssv);
364 c->irssv = 0;
365 }
366 else
367 {
368 REPLACE_SV (PL_rs, c->irssv);
369 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
370 sv_setsv (c->irssv_sv, PL_rs);
371 }
372 }
354 373
355 { 374 {
356 dSP; 375 dSP;
357 CV *cv; 376 CV *cv;
358 377
359 /* now do the ugly restore mess */ 378 /* now do the ugly restore mess */
360 while ((cv = (CV *)POPs)) 379 while ((cv = (CV *)POPs))
361 { 380 {
362 AV *padlist = (AV *)POPs;
363
364 if (padlist)
365 {
366 put_padlist (aTHX_ cv); /* mark this padlist as available */ 381 put_padlist (aTHX_ cv); /* mark this padlist as available */
367 CvPADLIST(cv) = padlist; 382 CvDEPTH (cv) = PTR2IV (POPs);
368 } 383 CvPADLIST (cv) = (AV *)POPs;
369
370 ++CvDEPTH(cv);
371 } 384 }
372 385
373 PUTBACK; 386 PUTBACK;
374 } 387 }
375} 388}
376 389
377static void 390static void
378save_state(pTHX_ Coro__State c, int flags) 391save_perl (pTHX_ Coro__State c)
379{ 392{
380 { 393 {
381 dSP; 394 dSP;
382 I32 cxix = cxstack_ix; 395 I32 cxix = cxstack_ix;
383 PERL_CONTEXT *ccstk = cxstack; 396 PERL_CONTEXT *ccstk = cxstack;
386 /* 399 /*
387 * 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
388 * (and reinitialize) all cv's in the whole callchain :( 401 * (and reinitialize) all cv's in the whole callchain :(
389 */ 402 */
390 403
391 PUSHs (Nullsv); 404 XPUSHs (Nullsv);
392 /* this loop was inspired by pp_caller */ 405 /* this loop was inspired by pp_caller */
393 for (;;) 406 for (;;)
394 { 407 {
395 while (cxix >= 0) 408 while (cxix >= 0)
396 { 409 {
397 PERL_CONTEXT *cx = &ccstk[cxix--]; 410 PERL_CONTEXT *cx = &ccstk[cxix--];
398 411
399 if (CxTYPE(cx) == CXt_SUB) 412 if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)
400 { 413 {
401 CV *cv = cx->blk_sub.cv; 414 CV *cv = cx->blk_sub.cv;
415
402 if (CvDEPTH(cv)) 416 if (CvDEPTH (cv))
403 { 417 {
404 EXTEND (SP, CvDEPTH(cv)*2); 418 EXTEND (SP, 3);
405
406 while (--CvDEPTH(cv))
407 {
408 /* this tells the restore code to increment CvDEPTH */
409 PUSHs (Nullsv);
410 PUSHs ((SV *)cv);
411 }
412
413 PUSHs ((SV *)CvPADLIST(cv)); 419 PUSHs ((SV *)CvPADLIST (cv));
420 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
414 PUSHs ((SV *)cv); 421 PUSHs ((SV *)cv);
415 422
423 CvDEPTH (cv) = 0;
416 get_padlist (aTHX_ cv); /* this is a monster */ 424 get_padlist (aTHX_ cv);
417 } 425 }
418 } 426 }
419#ifdef CXt_FORMAT
420 else if (CxTYPE(cx) == CXt_FORMAT)
421 {
422 /* I never used formats, so how should I know how these are implemented? */
423 /* my bold guess is as a simple, plain sub... */
424 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
425 }
426#endif
427 } 427 }
428 428
429 if (top_si->si_type == PERLSI_MAIN) 429 if (top_si->si_type == PERLSI_MAIN)
430 break; 430 break;
431 431
432 top_si = top_si->si_prev; 432 top_si = top_si->si_prev;
433 ccstk = top_si->si_cxstack; 433 ccstk = top_si->si_cxstack;
434 cxix = top_si->si_cxix; 434 cxix = top_si->si_cxix;
435 } 435 }
436 436
437 PUTBACK; 437 PUTBACK;
438 } 438 }
439 439
440 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;
441 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 441 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
442 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;
443 445
444 c->dowarn = PL_dowarn; 446#define VAR(name,type)c->name = PL_ ## name;
445 c->in_eval = PL_in_eval; 447# include "state.h"
446 448#undef VAR
447 c->curstackinfo = PL_curstackinfo;
448 c->curstack = PL_curstack;
449 c->mainstack = PL_mainstack;
450 c->stack_sp = PL_stack_sp;
451 c->op = PL_op;
452 c->curpad = PL_curpad;
453 c->comppad = PL_comppad;
454 c->stack_base = PL_stack_base;
455 c->stack_max = PL_stack_max;
456 c->tmps_stack = PL_tmps_stack;
457 c->tmps_floor = PL_tmps_floor;
458 c->tmps_ix = PL_tmps_ix;
459 c->tmps_max = PL_tmps_max;
460 c->markstack = PL_markstack;
461 c->markstack_ptr = PL_markstack_ptr;
462 c->markstack_max = PL_markstack_max;
463 c->scopestack = PL_scopestack;
464 c->scopestack_ix = PL_scopestack_ix;
465 c->scopestack_max = PL_scopestack_max;
466 c->savestack = PL_savestack;
467 c->savestack_ix = PL_savestack_ix;
468 c->savestack_max = PL_savestack_max;
469 c->retstack = PL_retstack;
470 c->retstack_ix = PL_retstack_ix;
471 c->retstack_max = PL_retstack_max;
472 c->curcop = PL_curcop;
473 c->top_env = PL_top_env;
474} 449}
475 450
476/* 451/*
477 * allocate various perl stacks. This is an exact copy 452 * allocate various perl stacks. This is an exact copy
478 * of perl.c:init_stacks, except that it uses less memory 453 * of perl.c:init_stacks, except that it uses less memory
479 * on the (sometimes correct) assumption that coroutines do 454 * on the (sometimes correct) assumption that coroutines do
480 * not usually need a lot of stackspace. 455 * not usually need a lot of stackspace.
481 */ 456 */
482STATIC void 457#if CORO_PREFER_PERL_FUNCTIONS
458# define coro_init_stacks init_stacks
459#else
460static void
483coro_init_stacks (pTHX) 461coro_init_stacks (pTHX)
484{ 462{
485 LOCK; 463 PL_curstackinfo = new_stackinfo(64, 6);
486
487 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
488 PL_curstackinfo->si_type = PERLSI_MAIN; 464 PL_curstackinfo->si_type = PERLSI_MAIN;
489 PL_curstack = PL_curstackinfo->si_stack; 465 PL_curstack = PL_curstackinfo->si_stack;
490 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 466 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
491 467
492 PL_stack_base = AvARRAY(PL_curstack); 468 PL_stack_base = AvARRAY(PL_curstack);
493 PL_stack_sp = PL_stack_base; 469 PL_stack_sp = PL_stack_base;
494 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 470 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
495 471
496 New(50,PL_tmps_stack,96,SV*); 472 New(50,PL_tmps_stack,64,SV*);
497 PL_tmps_floor = -1; 473 PL_tmps_floor = -1;
498 PL_tmps_ix = -1; 474 PL_tmps_ix = -1;
499 PL_tmps_max = 96; 475 PL_tmps_max = 64;
500 476
501 New(54,PL_markstack,16,I32); 477 New(54,PL_markstack,16,I32);
502 PL_markstack_ptr = PL_markstack; 478 PL_markstack_ptr = PL_markstack;
503 PL_markstack_max = PL_markstack + 16; 479 PL_markstack_max = PL_markstack + 16;
504 480
508 484
509 New(54,PL_scopestack,16,I32); 485 New(54,PL_scopestack,16,I32);
510 PL_scopestack_ix = 0; 486 PL_scopestack_ix = 0;
511 PL_scopestack_max = 16; 487 PL_scopestack_max = 16;
512 488
513 New(54,PL_savestack,96,ANY); 489 New(54,PL_savestack,64,ANY);
514 PL_savestack_ix = 0; 490 PL_savestack_ix = 0;
515 PL_savestack_max = 96; 491 PL_savestack_max = 64;
516 492
493#if !PERL_VERSION_ATLEAST (5,9,0)
517 New(54,PL_retstack,8,OP*); 494 New(54,PL_retstack,4,OP*);
518 PL_retstack_ix = 0; 495 PL_retstack_ix = 0;
519 PL_retstack_max = 8; 496 PL_retstack_max = 4;
520 497#endif
521 UNLOCK;
522} 498}
499#endif
523 500
524/* 501/*
525 * destroy the stacks, the callchain etc... 502 * destroy the stacks, the callchain etc...
526 */ 503 */
527STATIC void 504static void
528destroy_stacks(pTHX) 505coro_destroy_stacks (pTHX)
529{ 506{
530 if (!IN_DESTRUCT) 507 if (!IN_DESTRUCT)
531 { 508 {
532 /* is this ugly, I ask? */ 509 /* restore all saved variables and stuff */
533 LEAVE_SCOPE (0); 510 LEAVE_SCOPE (0);
511 assert (PL_tmps_floor == -1);
534 512
535 /* sure it is, but more important: is it correct?? :/ */ 513 /* free all temporaries */
536 FREETMPS; 514 FREETMPS;
515 assert (PL_tmps_ix == -1);
537 516
517 /* unwind all extra stacks */
538 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ 518 POPSTACK_TO (PL_mainstack);
519
520 /* unwind main stack */
521 dounwind (-1);
539 } 522 }
540 523
541 while (PL_curstackinfo->si_next) 524 while (PL_curstackinfo->si_next)
542 PL_curstackinfo = PL_curstackinfo->si_next; 525 PL_curstackinfo = PL_curstackinfo->si_next;
543 526
544 while (PL_curstackinfo) 527 while (PL_curstackinfo)
545 { 528 {
546 PERL_SI *p = PL_curstackinfo->si_prev; 529 PERL_SI *p = PL_curstackinfo->si_prev;
547 530
548 { /*D*//*remove*/
549 dSP;
550 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
551 PUTBACK; /* possibly superfluous */
552 }
553
554 if (!IN_DESTRUCT) 531 if (!IN_DESTRUCT)
555 {
556 dounwind (-1);/*D*//*remove*/
557 SvREFCNT_dec (PL_curstackinfo->si_stack); 532 SvREFCNT_dec (PL_curstackinfo->si_stack);
558 }
559 533
560 Safefree (PL_curstackinfo->si_cxstack); 534 Safefree (PL_curstackinfo->si_cxstack);
561 Safefree (PL_curstackinfo); 535 Safefree (PL_curstackinfo);
562 PL_curstackinfo = p; 536 PL_curstackinfo = p;
563 } 537 }
564 538
565 Safefree (PL_tmps_stack); 539 Safefree (PL_tmps_stack);
566 Safefree (PL_markstack); 540 Safefree (PL_markstack);
567 Safefree (PL_scopestack); 541 Safefree (PL_scopestack);
568 Safefree (PL_savestack); 542 Safefree (PL_savestack);
543#if !PERL_VERSION_ATLEAST (5,9,0)
569 Safefree (PL_retstack); 544 Safefree (PL_retstack);
570}
571
572static void
573allocate_stack (Coro__State ctx, int alloc)
574{
575 coro_stack *stack;
576
577 New (0, stack, 1, coro_stack);
578
579 stack->refcnt = 1;
580 stack->usecnt = 1;
581 stack->gencnt = ctx->gencnt = 0;
582
583 if (alloc)
584 {
585#if HAVE_MMAP
586 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
587 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
588 if (stack->sptr == (void *)-1)
589#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)
590 { 556 {
591 /*FIXME*//*D*//* reasonable stack size! */ 557 #define VAR(name,type)coro->name = PL_ ## name;
592 stack->ssize = - (8192 * sizeof (long)); 558 # include "state.h"
593 New (0, stack->sptr, 8192, long); 559 #undef VAR
594 } 560 }
595 }
596 else
597 stack->sptr = 0;
598 561
599 ctx->stack = stack; 562 rss += sizeof (coro->curstackinfo);
600} 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);
601 570
602static void 571#if !PERL_VERSION_ATLEAST (5,9,0)
603deallocate_stack (Coro__State ctx) 572 rss += coro->retstack_max * sizeof (OP *);
604{ 573#endif
605 coro_stack *stack = ctx->stack;
606
607 ctx->stack = 0;
608
609 if (stack)
610 { 574 }
611 if (!--stack->refcnt)
612 {
613#ifdef HAVE_MMAP
614 if (stack->ssize > 0 && stack->sptr)
615 munmap (stack->sptr, stack->ssize);
616 else
617#endif
618 Safefree (stack->sptr);
619 575
620 Safefree (stack); 576 return rss;
621 }
622 else if (ctx->gencnt == stack->gencnt)
623 --stack->usecnt;
624 }
625} 577}
626 578
579/** coroutine stack handling ************************************************/
580
627static void 581static void
628setup_coro (void *arg) 582setup_coro (pTHX_ struct coro *coro)
629{ 583{
630 /* 584 /*
631 * emulate part of the perl startup here. 585 * emulate part of the perl startup here.
632 */ 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{
635 dSP;
636 LOGOP myop;
637
638 Zero (&myop, 1, LOGOP);
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);
649 SPAGAIN;
650}
651
652/*
653 * this is a _very_ stripped down perl interpreter ;)
654 */
655static void
656coro_run (void *arg)
657{
633 dTHX; 658 dTHX;
634 dSP;
635 Coro__State ctx = (Coro__State)arg;
636 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
637 659
638 coro_init_stacks (aTHX); 660 /* coro_run is the alternative tail of transfer(), so unlock here. */
639 /*PL_curcop = 0;*/ 661 UNLOCK;
640 /*PL_in_eval = PL_in_eval;*/ /* inherit */
641 SvREFCNT_dec (GvAV (PL_defgv));
642 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
643 662
644 SPAGAIN; 663 PL_top_env = &PL_start_env;
645 664
646 if (ctx->stack) 665 /* inject a fake subroutine call to cctx_init */
647 { 666 prepare_cctx (aTHX_ (coro_cctx *)arg);
648 ctx->cursp = 0;
649 667
650 PUSHMARK(SP); 668 /* somebody or something will hit me for both perl_run and PL_restartop */
651 PUTBACK; 669 PL_restartop = PL_op;
652 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); 670 perl_run (PL_curinterp);
653 671
654 if (SvTRUE (ERRSV)) 672 /*
655 croak (NULL); 673 * If perl-run returns we assume exit() was being called or the coro
656 else 674 * fell off the end, which seems to be the only valid (non-bug)
657 croak ("FATAL: CCTXT coroutine returned!"); 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;
658 } 708 }
659 else 709 else
660 { 710#endif
661 UNOP myop;
662
663 PL_op = (OP *)&myop;
664
665 Zero(&myop, 1, UNOP);
666 myop.op_next = Nullop;
667 myop.op_flags = OPf_WANT_VOID;
668
669 PUSHMARK(SP);
670 XPUSHs (sub_init);
671 /*
672 * the next line is slightly wrong, as PL_op->op_next
673 * is actually being executed so we skip the first op.
674 * that doesn't matter, though, since it is only
675 * pp_nextstate and we never return...
676 * ah yes, and I don't care anyways ;)
677 */
678 PUTBACK;
679 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
680 SPAGAIN;
681
682 ENTER; /* necessary e.g. for dounwind */
683 } 711 {
684} 712 cctx->ssize = coro_stacksize * (long)sizeof (long);
713 New (0, cctx->sptr, coro_stacksize, long);
685 714
686static void 715 if (!cctx->sptr)
687continue_coro (void *arg) 716 {
688{ 717 perror ("FATAL: unable to allocate stack for coroutine");
689 /* 718 _exit (EXIT_FAILURE);
690 * this is a _very_ stripped down perl interpreter ;) 719 }
691 */
692 dTHX;
693 Coro__State ctx = (Coro__State)arg;
694 JMPENV coro_start_env;
695 720
696 PL_top_env = &ctx->start_env; 721 stack_start = cctx->sptr;
722 stack_size = cctx->ssize;
723 }
697 724
698 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
699 PL_op = PL_op->op_next; 768 PL_op = PL_op->op_next;
700 CALLRUNOPS(aTHX); 769 return cctx_new ();
701
702 abort ();
703} 770}
704 771
705STATIC 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
706transfer (pTHX_ struct coro *prev, struct coro *next, int flags) 795transfer (pTHX_ struct coro *prev, struct coro *next)
707{ 796{
708 dSTACKLEVEL; 797 dSTACKLEVEL;
709 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 }
710 if (prev != next) 805 else if (prev != next)
711 { 806 {
712 if (next->mainstack) 807 coro_cctx *prev__cctx;
808
809 if (prev->flags & CF_NEW)
713 { 810 {
714 LOCK; 811 /* create a new empty context */
715 SAVE (prev, flags); 812 Newz (0, prev->cctx, 1, coro_cctx);
716 LOAD (next); 813 prev->cctx->inuse = 1;
717 UNLOCK; 814 prev->flags &= ~CF_NEW;
718 815 prev->flags |= CF_RUNNING;
719 /* mark this state as in-use */
720 next->mainstack = 0;
721 next->tmps_ix = -2;
722
723 /* stacklevel changed? if yes, grab the stack for us! */
724 if (flags & TRANSFER_SAVE_CCTXT)
725 {
726 if (!prev->stack)
727 allocate_stack (prev, 0);
728 else if (prev->cursp != stacklevel
729 && prev->stack->usecnt > 1)
730 {
731 prev->gencnt = ++prev->stack->gencnt;
732 prev->stack->usecnt = 1;
733 }
734
735 /* has our stack been invalidated? */
736 if (next->stack && next->stack->gencnt != next->gencnt)
737 {
738 deallocate_stack (next);
739 allocate_stack (next, 1);
740 coro_create (&(next->stack->cctx),
741 continue_coro, (void *)next,
742 next->stack->sptr, labs (next->stack->ssize));
743 }
744
745 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
746 prev->cursp = stacklevel;
747 /* don't add any code here */
748 }
749 else
750 next->cursp = stacklevel;
751 } 816 }
752 else if (next->tmps_ix == -2) 817
753 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 }
754 else 844 else
755 { 845 {
756 LOCK; 846 /* coroutine already started */
757 SAVE (prev, -1); /* first get rid of the old state */ 847 save_perl (aTHX_ prev);
758 UNLOCK; 848 load_perl (aTHX_ next);
759
760 if (flags & TRANSFER_SAVE_CCTXT)
761 {
762 if (!prev->stack)
763 allocate_stack (prev, 0);
764
765 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
766 {
767 PL_top_env = &next->start_env;
768
769 setup_coro (next);
770 next->cursp = stacklevel;
771
772 prev->stack->refcnt++;
773 prev->stack->usecnt++;
774 next->stack = prev->stack;
775 next->gencnt = prev->gencnt;
776 }
777 else
778 {
779 assert (!next->stack);
780 allocate_stack (next, 1);
781 coro_create (&(next->stack->cctx),
782 setup_coro, (void *)next,
783 next->stack->sptr, labs (next->stack->ssize));
784 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
785 prev->cursp = stacklevel;
786 /* don't add any code here */
787 }
788 }
789 else
790 {
791 setup_coro (next);
792 next->cursp = stacklevel;
793 }
794 } 849 }
795 }
796 850
797 LOCK; 851 prev__cctx = prev->cctx;
798 if (coro_mortal) 852
799 { 853 /* possibly "free" the cctx */
800 SvREFCNT_dec (coro_mortal); 854 if (prev__cctx->idle_sp == STACKLEVEL)
801 coro_mortal = 0; 855 {
802 } 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);
803 UNLOCK; 880 UNLOCK;
881 }
804} 882}
805 883
806#define SV_CORO(sv,func) \ 884struct transfer_args
807 do { \ 885{
808 if (SvROK (sv)) \ 886 struct coro *prev, *next;
809 sv = SvRV (sv); \ 887};
810 \
811 if (SvTYPE (sv) == SVt_PVHV) \
812 { \
813 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
814 \
815 if (!he) \
816 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
817 \
818 (sv) = SvRV (HeVAL(he)); \
819 } \
820 \
821 /* must also be changed inside Coro::Cont::yield */ \
822 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
823 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
824 \
825 } while(0)
826 888
827#define SvSTATE(sv) (struct coro *)SvIV (sv) 889#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
828 890
891/** high level stuff ********************************************************/
892
829static void 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
830api_transfer(pTHX_ SV *prev, SV *next, int flags) 1013api_transfer (SV *prev_sv, SV *next_sv)
831{ 1014{
832 SV_CORO (prev, "Coro::transfer"); 1015 dTHX;
833 SV_CORO (next, "Coro::transfer"); 1016 struct transfer_args ta;
834 1017
835 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;
836} 1033}
837 1034
838/** Coro ********************************************************************/ 1035/** Coro ********************************************************************/
839 1036
840#define PRIO_MAX 3
841#define PRIO_HIGH 1
842#define PRIO_NORMAL 0
843#define PRIO_LOW -1
844#define PRIO_IDLE -3
845#define PRIO_MIN -4
846
847/* for Coro.pm */
848static GV *coro_current, *coro_idle;
849static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
850static int coro_nready;
851
852static void 1037static void
853coro_enq (pTHX_ SV *sv) 1038coro_enq (pTHX_ SV *coro_sv)
854{ 1039{
855 if (SvTYPE (sv) == SVt_PVHV)
856 {
857 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
858 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
859
860 prio = prio > PRIO_MAX ? PRIO_MAX
861 : prio < PRIO_MIN ? PRIO_MIN
862 : prio;
863
864 av_push (coro_ready [prio - PRIO_MIN], sv); 1040 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
865 coro_nready++;
866
867 return;
868 }
869
870 croak ("Coro::ready tried to enqueue something that is not a coroutine");
871} 1041}
872 1042
873static SV * 1043static SV *
874coro_deq (pTHX_ int min_prio) 1044coro_deq (pTHX_ int min_prio)
875{ 1045{
878 min_prio -= PRIO_MIN; 1048 min_prio -= PRIO_MIN;
879 if (min_prio < 0) 1049 if (min_prio < 0)
880 min_prio = 0; 1050 min_prio = 0;
881 1051
882 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 1052 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
883 if (av_len (coro_ready[prio]) >= 0) 1053 if (AvFILLp (coro_ready [prio]) >= 0)
884 {
885 coro_nready--;
886 return av_shift (coro_ready[prio]); 1054 return av_shift (coro_ready [prio]);
887 }
888 1055
889 return 0; 1056 return 0;
890} 1057}
891 1058
892static void 1059static int
893api_ready (SV *coro) 1060api_ready (SV *coro_sv)
894{ 1061{
895 dTHX; 1062 dTHX;
1063 struct coro *coro;
896 1064
897 if (SvROK (coro)) 1065 if (SvROK (coro_sv))
898 coro = SvRV (coro); 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;
899 1074
900 LOCK; 1075 LOCK;
901 coro_enq (aTHX_ SvREFCNT_inc (coro)); 1076 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1077 ++coro_nready;
902 UNLOCK; 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;
903} 1167}
904 1168
905static void 1169static void
906api_schedule (void) 1170api_schedule (void)
907{ 1171{
908 dTHX; 1172 dTHX;
1173 struct transfer_args ta;
909 1174
910 SV *prev, *next; 1175 prepare_schedule (aTHX_ &ta);
911 1176 TRANSFER (ta);
912 LOCK;
913
914 prev = SvRV (GvSV (coro_current));
915 next = coro_deq (aTHX_ PRIO_MIN);
916
917 if (!next)
918 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
919
920 /* free this only after the transfer */
921 coro_mortal = prev;
922 SV_CORO (prev, "Coro::schedule");
923
924 SvRV (GvSV (coro_current)) = next;
925
926 SV_CORO (next, "Coro::schedule");
927
928 UNLOCK;
929
930 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
931 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
932} 1177}
933 1178
934static void 1179static int
935api_cede (void) 1180api_cede (void)
936{ 1181{
937 dTHX; 1182 dTHX;
1183 struct transfer_args ta;
938 1184
939 LOCK; 1185 prepare_cede (aTHX_ &ta);
940 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
941 UNLOCK;
942 1186
943 api_schedule (); 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;
944} 1209}
945 1210
946MODULE = Coro::State PACKAGE = Coro::State 1211MODULE = Coro::State PACKAGE = Coro::State
947 1212
948PROTOTYPES: ENABLE 1213PROTOTYPES: DISABLE
949 1214
950BOOT: 1215BOOT:
951{ /* {} necessary for stoopid perl-5.6.x */ 1216{
952#ifdef USE_ITHREADS 1217#ifdef USE_ITHREADS
953 MUTEX_INIT (&coro_mutex); 1218 MUTEX_INIT (&coro_mutex);
954#endif 1219#endif
1220 BOOT_PAGESIZE;
955 1221
956 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
957 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
958 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1222 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
959 1223
960 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1224 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
961 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1225 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
962 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));
963 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1229 newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
1230 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
964 1231
965 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;
966 1237
967 coroapi.ver = CORO_API_VERSION; 1238 coroapi.ver = CORO_API_VERSION;
968 coroapi.transfer = api_transfer; 1239 coroapi.transfer = api_transfer;
969}
970 1240
971Coro::State 1241 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
972_newprocess(args) 1242}
973 SV * args 1243
974 PROTOTYPE: $ 1244SV *
1245new (char *klass, ...)
975 CODE: 1246 CODE:
976 Coro__State coro; 1247{
1248 struct coro *coro;
1249 HV *hv;
1250 int i;
977 1251
978 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
979 croak ("Coro::State::_newprocess expects an arrayref");
980
981 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;
982 1256
983 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1257 if (coro_first) coro_first->prev = coro;
984 coro->mainstack = 0; /* actual work is done inside transfer */ 1258 coro->next = coro_first;
985 coro->stack = 0; 1259 coro_first = coro;
986 1260
987 /* same as JMPENV_BOOTSTRAP */ 1261 coro->hv = hv = newHV ();
988 /* 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;
989 //Zero(&coro->start_env, 1, JMPENV); 1263 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
990 coro->start_env.je_ret = -1;
991 coro->start_env.je_mustcatch = TRUE;
992 1264
993 RETVAL = coro; 1265 for (i = 1; i < items; i++)
1266 av_push (coro->args, newSVsv (ST (i)));
1267}
994 OUTPUT: 1268 OUTPUT:
995 RETVAL 1269 RETVAL
996 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
997void 1289void
998transfer(prev, next, flags) 1290_set_stacklevel (...)
999 SV *prev 1291 ALIAS:
1000 SV *next 1292 Coro::State::transfer = 1
1001 int flags 1293 Coro::schedule = 2
1002 PROTOTYPE: @ 1294 Coro::cede = 3
1295 Coro::cede_notself = 4
1003 CODE: 1296 CODE:
1004 PUTBACK; 1297{
1005 SV_CORO (next, "Coro::transfer"); 1298 struct transfer_args ta;
1006 SV_CORO (prev, "Coro::transfer"); 1299
1007 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1300 switch (ix)
1008 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
1009 1342
1010void 1343void
1011DESTROY(coro)
1012 Coro::State coro
1013 CODE:
1014
1015 if (coro->mainstack && coro->mainstack != main_mainstack)
1016 {
1017 struct coro temp;
1018
1019 PUTBACK;
1020 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
1021 LOAD(aTHX_ coro);
1022 SPAGAIN;
1023
1024 destroy_stacks (aTHX);
1025
1026 LOAD((&temp)); /* this will get rid of defsv etc.. */
1027 SPAGAIN;
1028
1029 coro->mainstack = 0;
1030 }
1031
1032 deallocate_stack (coro);
1033 SvREFCNT_dec (coro->args);
1034 Safefree (coro);
1035
1036void
1037_exit(code) 1344_exit (code)
1038 int code 1345 int code
1039 PROTOTYPE: $ 1346 PROTOTYPE: $
1040 CODE: 1347 CODE:
1041 _exit (code); 1348 _exit (code);
1042 1349
1043MODULE = 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
1044 1358
1045# 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
1046 1372
1047void 1373void
1048yield(...) 1374list ()
1049 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: $
1050 CODE: 1444 CODE:
1051 static SV *returnstk; 1445 RETVAL = coro_rss (coro);
1052 SV *sv; 1446 OUTPUT:
1053 AV *defav = GvAV (PL_defgv); 1447 RETVAL
1054 struct coro *prev, *next;
1055 1448
1056 if (!returnstk)
1057 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1058
1059 /* set up @_ -- ugly */
1060 av_clear (defav);
1061 av_fill (defav, items - 1);
1062 while (items--)
1063 av_store (defav, items, SvREFCNT_inc (ST(items)));
1064
1065 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1066 sv = av_pop ((AV *)SvRV (returnstk));
1067 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1068 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1069 SvREFCNT_dec (sv);
1070
1071 transfer(aTHX_ prev, next, 0);
1072 1449
1073MODULE = Coro::State PACKAGE = Coro 1450MODULE = Coro::State PACKAGE = Coro
1074 1451
1075# this is slightly dirty (should expose a c-level api)
1076
1077BOOT: 1452BOOT:
1078{ 1453{
1079 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
1080 HV *stash = gv_stashpv ("Coro", TRUE); 1463 coro_stash = gv_stashpv ("Coro", TRUE);
1081 1464
1082 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1465 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1083 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1466 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1084 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1467 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1085 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1468 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1086 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1469 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1087 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1470 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1088
1089 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1090 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1091 1471
1092 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1472 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1093 coro_ready[i] = newAV (); 1473 coro_ready[i] = newAV ();
1094 1474
1095 { 1475 {
1096 SV *sv = perl_get_sv("Coro::API", 1); 1476 SV *sv = perl_get_sv("Coro::API", 1);
1097 1477
1098 coroapi.schedule = api_schedule; 1478 coroapi.schedule = api_schedule;
1479 coroapi.save = api_save;
1099 coroapi.cede = api_cede; 1480 coroapi.cede = api_cede;
1481 coroapi.cede_notself = api_cede_notself;
1100 coroapi.ready = api_ready; 1482 coroapi.ready = api_ready;
1483 coroapi.is_ready = api_is_ready;
1101 coroapi.nready = &coro_nready; 1484 coroapi.nready = &coro_nready;
1102 coroapi.current = coro_current; 1485 coroapi.current = coro_current;
1103 1486
1104 GCoroAPI = &coroapi; 1487 GCoroAPI = &coroapi;
1105 sv_setiv(sv, (IV)&coroapi); 1488 sv_setiv (sv, (IV)&coroapi);
1106 SvREADONLY_on(sv); 1489 SvREADONLY_on (sv);
1107 } 1490 }
1108} 1491}
1109 1492
1110#if !PERL_MICRO
1111
1112void 1493void
1113ready(self) 1494_set_current (SV *current)
1114 SV * self
1115 PROTOTYPE: $ 1495 PROTOTYPE: $
1116 CODE: 1496 CODE:
1117 api_ready (self); 1497 SvREFCNT_dec (SvRV (coro_current));
1118 1498 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1119#endif
1120 1499
1121int 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
1122nready(...) 1531nready (...)
1123 PROTOTYPE: 1532 PROTOTYPE:
1124 CODE: 1533 CODE:
1125 RETVAL = coro_nready; 1534 RETVAL = coro_nready;
1126 OUTPUT: 1535 OUTPUT:
1127 RETVAL 1536 RETVAL
1128 1537
1538# for async_pool speedup
1129void 1539void
1130schedule(...) 1540_pool_1 (SV *cb)
1131 PROTOTYPE:
1132 CODE: 1541 CODE:
1133 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}
1134 1569
1135void 1570void
1136cede(...) 1571_pool_2 (SV *cb)
1137 PROTOTYPE:
1138 CODE: 1572 CODE:
1139 api_cede (); 1573{
1574 struct coro *coro = SvSTATE (coro_current);
1140 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