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