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