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