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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines