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.198 by root, Sun Oct 7 03:58:37 2007 UTC

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

Diff Legend

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