1 | #define PERL_NO_GET_CONTEXT |
|
|
2 | |
|
|
3 | #include "libcoro/coro.c" |
1 | #include "libcoro/coro.c" |
4 | |
2 | |
5 | #include "EXTERN.h" |
3 | #include "EXTERN.h" |
6 | #include "perl.h" |
4 | #include "perl.h" |
7 | #include "XSUB.h" |
5 | #include "XSUB.h" |
8 | |
6 | |
9 | #include "patchlevel.h" |
7 | #include "patchlevel.h" |
10 | |
8 | |
11 | // threaded perls might need much more, 65536 or more, |
9 | #if USE_VALGRIND |
12 | // which is 0.5 to 1MB |
10 | # include <valgrind/valgrind.h> |
13 | #define STACKSIZE 16384 |
11 | #endif |
14 | |
12 | |
15 | #if PERL_VERSION < 6 |
13 | /* the maximum number of idle cctx that will be pooled */ |
|
|
14 | #define MAX_IDLE_CCTX 8 |
|
|
15 | |
|
|
16 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
17 | (PERL_REVISION > (a) \ |
|
|
18 | || (PERL_REVISION == (a) \ |
|
|
19 | && (PERL_VERSION > (b) \ |
|
|
20 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
21 | |
|
|
22 | #if !PERL_VERSION_ATLEAST (5,6,0) |
16 | # ifndef PL_ppaddr |
23 | # ifndef PL_ppaddr |
17 | # define PL_ppaddr ppaddr |
24 | # define PL_ppaddr ppaddr |
18 | # endif |
25 | # endif |
19 | # ifndef call_sv |
26 | # ifndef call_sv |
20 | # define call_sv perl_call_sv |
27 | # define call_sv perl_call_sv |
… | |
… | |
31 | # ifndef IS_PADCONST |
38 | # ifndef IS_PADCONST |
32 | # define IS_PADCONST(v) 0 |
39 | # define IS_PADCONST(v) 0 |
33 | # endif |
40 | # endif |
34 | #endif |
41 | #endif |
35 | |
42 | |
36 | #include <signal.h> |
43 | #include <stdio.h> |
|
|
44 | #include <errno.h> |
|
|
45 | #include <assert.h> |
|
|
46 | |
|
|
47 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
48 | # undef STACKGUARD |
|
|
49 | #endif |
|
|
50 | |
|
|
51 | #ifndef STACKGUARD |
|
|
52 | # define STACKGUARD 0 |
|
|
53 | #endif |
37 | |
54 | |
38 | #ifdef HAVE_MMAP |
55 | #ifdef HAVE_MMAP |
39 | # include <unistd.h> |
56 | # include <unistd.h> |
40 | # include <sys/mman.h> |
57 | # include <sys/mman.h> |
41 | # ifndef MAP_ANONYMOUS |
58 | # ifndef MAP_ANONYMOUS |
… | |
… | |
43 | # define MAP_ANONYMOUS MAP_ANON |
60 | # define MAP_ANONYMOUS MAP_ANON |
44 | # else |
61 | # else |
45 | # undef HAVE_MMAP |
62 | # undef HAVE_MMAP |
46 | # endif |
63 | # endif |
47 | # endif |
64 | # endif |
|
|
65 | # include <limits.h> |
|
|
66 | # ifndef PAGESIZE |
|
|
67 | # define PAGESIZE pagesize |
|
|
68 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
69 | static long pagesize; |
|
|
70 | # else |
|
|
71 | # define BOOT_PAGESIZE (void)0 |
48 | #endif |
72 | # endif |
49 | |
73 | #else |
50 | #define SUB_INIT "Coro::State::initialize" |
74 | # define PAGESIZE 0 |
51 | #define UCORO_STATE "_coro_state" |
75 | # define BOOT_PAGESIZE (void)0 |
|
|
76 | #endif |
52 | |
77 | |
53 | /* The next macro should declare a variable stacklevel that contains and approximation |
78 | /* The next macro should declare a variable stacklevel that contains and approximation |
54 | * to the current C stack pointer. Its property is that it changes with each call |
79 | * to the current C stack pointer. Its property is that it changes with each call |
55 | * and should be unique. */ |
80 | * and should be unique. */ |
|
|
81 | #define dSTACKLEVEL int stacklevel |
56 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
82 | #define STACKLEVEL ((void *)&stacklevel) |
57 | |
83 | |
58 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
84 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
59 | |
85 | |
60 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
86 | #if __GNUC__ >= 3 |
|
|
87 | # define attribute(x) __attribute__(x) |
|
|
88 | #else |
|
|
89 | # define attribute(x) |
|
|
90 | #endif |
|
|
91 | |
|
|
92 | #define NOINLINE attribute ((noinline)) |
61 | |
93 | |
62 | #include "CoroAPI.h" |
94 | #include "CoroAPI.h" |
63 | |
95 | |
64 | #ifdef USE_ITHREADS |
96 | #ifdef USE_ITHREADS |
65 | static perl_mutex coro_mutex; |
97 | static perl_mutex coro_mutex; |
66 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
98 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
67 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
99 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
68 | #else |
100 | #else |
69 | # define LOCK 0 |
101 | # define LOCK (void)0 |
70 | # define UNLOCK 0 |
102 | # define UNLOCK (void)0 |
71 | #endif |
103 | #endif |
|
|
104 | |
|
|
105 | struct io_state |
|
|
106 | { |
|
|
107 | int errorno; |
|
|
108 | I32 laststype; |
|
|
109 | int laststatval; |
|
|
110 | Stat_t statcache; |
|
|
111 | }; |
72 | |
112 | |
73 | static struct CoroAPI coroapi; |
113 | static struct CoroAPI coroapi; |
74 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
114 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
75 | static HV *coro_state_stash; |
115 | 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 */ |
116 | static SV *coro_mortal; /* will be freed after next transfer */ |
79 | |
117 | |
80 | /* this is actually not only the c stack but also c registers etc... */ |
118 | static struct coro_cctx *cctx_first; |
|
|
119 | static int cctx_count, cctx_idle; |
|
|
120 | |
|
|
121 | /* this is a structure representing a c-level coroutine */ |
81 | typedef struct { |
122 | typedef struct coro_cctx { |
82 | int refcnt; /* pointer reference counter */ |
123 | struct coro_cctx *next; |
83 | int usecnt; /* shared by how many coroutines */ |
|
|
84 | int gencnt; /* generation counter */ |
|
|
85 | |
124 | |
86 | coro_context cctx; |
125 | /* the stack */ |
87 | |
|
|
88 | void *sptr; |
126 | void *sptr; |
89 | long ssize; /* positive == mmap, otherwise malloc */ |
127 | long ssize; /* positive == mmap, otherwise malloc */ |
90 | } coro_stack; |
|
|
91 | |
128 | |
|
|
129 | /* cpu state */ |
|
|
130 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
131 | JMPENV *top_env; |
|
|
132 | coro_context cctx; |
|
|
133 | |
|
|
134 | int inuse; |
|
|
135 | |
|
|
136 | #if USE_VALGRIND |
|
|
137 | int valgrind_id; |
|
|
138 | #endif |
|
|
139 | } coro_cctx; |
|
|
140 | |
|
|
141 | enum { |
|
|
142 | CF_RUNNING = 0x0001, /* coroutine is running */ |
|
|
143 | CF_READY = 0x0002, /* coroutine is ready */ |
|
|
144 | CF_NEW = 0x0004, /* ahs never been switched to */ |
|
|
145 | }; |
|
|
146 | |
|
|
147 | /* this is a structure representing a perl-level coroutine */ |
92 | struct coro { |
148 | struct coro { |
93 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
149 | /* the c coroutine allocated to this perl coroutine, if any */ |
94 | JMPENV start_env; |
150 | 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 | |
151 | |
141 | /* data associated with this coroutine (initial args) */ |
152 | /* data associated with this coroutine (initial args) */ |
142 | AV *args; |
153 | AV *args; |
|
|
154 | int refcnt; |
|
|
155 | int save; /* CORO_SAVE flags */ |
|
|
156 | int flags; /* CF_ flags */ |
|
|
157 | |
|
|
158 | /* optionally saved, might be zero */ |
|
|
159 | AV *defav; /* @_ */ |
|
|
160 | SV *defsv; /* $_ */ |
|
|
161 | SV *errsv; /* $@ */ |
|
|
162 | SV *irssv; /* $/ */ |
|
|
163 | SV *irssv_sv; /* real $/ cache */ |
|
|
164 | |
|
|
165 | #define VAR(name,type) type name; |
|
|
166 | # include "state.h" |
|
|
167 | #undef VAR |
|
|
168 | |
|
|
169 | /* coro process data */ |
|
|
170 | int prio; |
143 | }; |
171 | }; |
144 | |
172 | |
145 | typedef struct coro *Coro__State; |
173 | typedef struct coro *Coro__State; |
146 | typedef struct coro *Coro__State_or_hashref; |
174 | typedef struct coro *Coro__State_or_hashref; |
147 | |
175 | |
148 | /* mostly copied from op.c:cv_clone2 */ |
176 | static AV * |
149 | STATIC AV * |
177 | coro_clone_padlist (CV *cv) |
150 | clone_padlist (pTHX_ AV *protopadlist) |
|
|
151 | { |
178 | { |
152 | AV *av; |
179 | 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; |
180 | 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 | |
181 | |
171 | newpadlist = newAV (); |
182 | newpadlist = newAV (); |
172 | AvREAL_off (newpadlist); |
183 | AvREAL_off (newpadlist); |
173 | av_store (newpadlist, 0, (SV *) newpad_name); |
184 | #if PERL_VERSION_ATLEAST (5,9,0) |
|
|
185 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
186 | #else |
|
|
187 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
188 | #endif |
|
|
189 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
190 | --AvFILLp (padlist); |
|
|
191 | |
|
|
192 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
174 | av_store (newpadlist, 1, (SV *) newpad); |
193 | 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 | |
194 | |
245 | return newpadlist; |
195 | return newpadlist; |
246 | } |
196 | } |
247 | |
197 | |
248 | STATIC void |
198 | static void |
249 | free_padlist (pTHX_ AV *padlist) |
199 | free_padlist (AV *padlist) |
250 | { |
200 | { |
251 | /* may be during global destruction */ |
201 | /* may be during global destruction */ |
252 | if (SvREFCNT (padlist)) |
202 | if (SvREFCNT (padlist)) |
253 | { |
203 | { |
254 | I32 i = AvFILLp (padlist); |
204 | I32 i = AvFILLp (padlist); |
… | |
… | |
267 | |
217 | |
268 | SvREFCNT_dec ((SV*)padlist); |
218 | SvREFCNT_dec ((SV*)padlist); |
269 | } |
219 | } |
270 | } |
220 | } |
271 | |
221 | |
272 | STATIC int |
222 | static int |
273 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
223 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
274 | { |
224 | { |
275 | AV *padlist; |
225 | AV *padlist; |
276 | AV *av = (AV *)mg->mg_obj; |
226 | AV *av = (AV *)mg->mg_obj; |
277 | |
227 | |
278 | /* casting is fun. */ |
228 | /* casting is fun. */ |
279 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
229 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
280 | free_padlist (aTHX_ padlist); |
230 | free_padlist (padlist); |
281 | |
231 | |
282 | SvREFCNT_dec (av); |
232 | SvREFCNT_dec (av); |
|
|
233 | |
|
|
234 | return 0; |
283 | } |
235 | } |
284 | |
236 | |
285 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
237 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
286 | |
238 | |
287 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
239 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
288 | |
240 | |
|
|
241 | #define CORO_MAGIC(cv) \ |
|
|
242 | SvMAGIC (cv) \ |
|
|
243 | ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \ |
|
|
244 | ? SvMAGIC (cv) \ |
|
|
245 | : mg_find ((SV *)cv, PERL_MAGIC_coro) \ |
|
|
246 | : 0 |
|
|
247 | |
289 | /* the next two functions merely cache the padlists */ |
248 | /* the next two functions merely cache the padlists */ |
290 | STATIC void |
249 | static void |
291 | get_padlist (pTHX_ CV *cv) |
250 | get_padlist (CV *cv) |
292 | { |
251 | { |
293 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
252 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
253 | AV *av; |
294 | |
254 | |
295 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
255 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
296 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
256 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
297 | else |
257 | else |
|
|
258 | { |
|
|
259 | #if 0 |
|
|
260 | /* this is probably cleaner, but also slower? */ |
|
|
261 | CV *cp = Perl_cv_clone (cv); |
|
|
262 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
263 | CvPADLIST (cp) = 0; |
|
|
264 | SvREFCNT_dec (cp); |
|
|
265 | #else |
298 | CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); |
266 | CvPADLIST (cv) = coro_clone_padlist (cv); |
|
|
267 | #endif |
|
|
268 | } |
299 | } |
269 | } |
300 | |
270 | |
301 | STATIC void |
271 | static void |
302 | put_padlist (pTHX_ CV *cv) |
272 | put_padlist (CV *cv) |
303 | { |
273 | { |
304 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
274 | MAGIC *mg = CORO_MAGIC (cv); |
|
|
275 | AV *av; |
305 | |
276 | |
306 | if (!mg) |
277 | if (!mg) |
307 | { |
278 | { |
308 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
279 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
309 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
280 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
310 | mg->mg_virtual = &vtbl_coro; |
281 | mg->mg_virtual = &vtbl_coro; |
311 | mg->mg_obj = (SV *)newAV (); |
282 | mg->mg_obj = (SV *)newAV (); |
312 | } |
283 | } |
313 | |
284 | |
314 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
285 | av = (AV *)mg->mg_obj; |
|
|
286 | |
|
|
287 | if (AvFILLp (av) >= AvMAX (av)) |
|
|
288 | av_extend (av, AvMAX (av) + 1); |
|
|
289 | |
|
|
290 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
315 | } |
291 | } |
316 | |
292 | |
317 | #define SB do { |
293 | #define SB do { |
318 | #define SE } while (0) |
294 | #define SE } while (0) |
319 | |
295 | |
320 | #define LOAD(state) load_state(aTHX_ (state)); |
|
|
321 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
|
|
322 | |
|
|
323 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
296 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
324 | |
297 | |
325 | static void |
298 | static void |
326 | load_state(pTHX_ Coro__State c) |
299 | load_perl (Coro__State c) |
327 | { |
300 | { |
328 | PL_dowarn = c->dowarn; |
301 | #define VAR(name,type) PL_ ## name = c->name; |
329 | PL_in_eval = c->in_eval; |
302 | # include "state.h" |
330 | |
303 | #undef VAR |
331 | PL_curstackinfo = c->curstackinfo; |
|
|
332 | PL_curstack = c->curstack; |
|
|
333 | PL_mainstack = c->mainstack; |
|
|
334 | PL_stack_sp = c->stack_sp; |
|
|
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 | |
304 | |
361 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
305 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
362 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
306 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
363 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
307 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
|
|
308 | if (c->irssv) |
|
|
309 | { |
|
|
310 | if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv)) |
|
|
311 | SvREFCNT_dec (c->irssv); |
|
|
312 | else |
|
|
313 | { |
|
|
314 | REPLACE_SV (PL_rs, c->irssv); |
|
|
315 | if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0); |
|
|
316 | sv_setsv (c->irssv_sv, PL_rs); |
|
|
317 | } |
|
|
318 | } |
364 | |
319 | |
365 | { |
320 | { |
366 | dSP; |
321 | dSP; |
367 | CV *cv; |
322 | CV *cv; |
368 | |
323 | |
369 | /* now do the ugly restore mess */ |
324 | /* now do the ugly restore mess */ |
370 | while ((cv = (CV *)POPs)) |
325 | while ((cv = (CV *)POPs)) |
371 | { |
326 | { |
372 | AV *padlist = (AV *)POPs; |
|
|
373 | |
|
|
374 | if (padlist) |
|
|
375 | { |
|
|
376 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
327 | put_padlist (cv); /* mark this padlist as available */ |
377 | CvPADLIST(cv) = padlist; |
328 | CvDEPTH (cv) = PTR2IV (POPs); |
378 | } |
329 | CvPADLIST (cv) = (AV *)POPs; |
379 | |
|
|
380 | ++CvDEPTH(cv); |
|
|
381 | } |
330 | } |
382 | |
331 | |
383 | PUTBACK; |
332 | PUTBACK; |
384 | } |
333 | } |
385 | } |
334 | } |
386 | |
335 | |
387 | static void |
336 | static void |
388 | save_state(pTHX_ Coro__State c, int flags) |
337 | save_perl (Coro__State c) |
389 | { |
338 | { |
390 | { |
339 | { |
391 | dSP; |
340 | dSP; |
392 | I32 cxix = cxstack_ix; |
341 | I32 cxix = cxstack_ix; |
393 | PERL_CONTEXT *ccstk = cxstack; |
342 | PERL_CONTEXT *ccstk = cxstack; |
… | |
… | |
404 | { |
353 | { |
405 | while (cxix >= 0) |
354 | while (cxix >= 0) |
406 | { |
355 | { |
407 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
356 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
408 | |
357 | |
409 | if (CxTYPE(cx) == CXt_SUB) |
358 | if (CxTYPE (cx) == CXt_SUB) |
410 | { |
359 | { |
411 | CV *cv = cx->blk_sub.cv; |
360 | CV *cv = cx->blk_sub.cv; |
|
|
361 | |
412 | if (CvDEPTH(cv)) |
362 | if (CvDEPTH (cv)) |
413 | { |
363 | { |
414 | EXTEND (SP, CvDEPTH(cv)*2); |
364 | EXTEND (SP, 3); |
415 | |
365 | |
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)); |
366 | PUSHs ((SV *)CvPADLIST (cv)); |
|
|
367 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
424 | PUSHs ((SV *)cv); |
368 | PUSHs ((SV *)cv); |
425 | |
369 | |
426 | get_padlist (aTHX_ cv); /* this is a monster */ |
370 | CvDEPTH (cv) = 0; |
|
|
371 | get_padlist (cv); |
427 | } |
372 | } |
428 | } |
373 | } |
429 | #ifdef CXt_FORMAT |
374 | #ifdef CXt_FORMAT |
430 | else if (CxTYPE(cx) == CXt_FORMAT) |
375 | else if (CxTYPE (cx) == CXt_FORMAT) |
431 | { |
376 | { |
432 | /* I never used formats, so how should I know how these are implemented? */ |
377 | /* I never used formats, so how should I know how these are implemented? */ |
433 | /* my bold guess is as a simple, plain sub... */ |
378 | /* my bold guess is as a simple, plain sub... */ |
434 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
379 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
435 | } |
380 | } |
… | |
… | |
445 | } |
390 | } |
446 | |
391 | |
447 | PUTBACK; |
392 | PUTBACK; |
448 | } |
393 | } |
449 | |
394 | |
450 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
395 | c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
451 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
396 | c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
452 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
397 | c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
|
|
398 | c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0; |
453 | |
399 | |
454 | c->dowarn = PL_dowarn; |
400 | #define VAR(name,type)c->name = PL_ ## name; |
455 | c->in_eval = PL_in_eval; |
401 | # include "state.h" |
456 | |
402 | #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 | } |
403 | } |
487 | |
404 | |
488 | /* |
405 | /* |
489 | * allocate various perl stacks. This is an exact copy |
406 | * allocate various perl stacks. This is an exact copy |
490 | * of perl.c:init_stacks, except that it uses less memory |
407 | * of perl.c:init_stacks, except that it uses less memory |
491 | * on the (sometimes correct) assumption that coroutines do |
408 | * on the (sometimes correct) assumption that coroutines do |
492 | * not usually need a lot of stackspace. |
409 | * not usually need a lot of stackspace. |
493 | */ |
410 | */ |
494 | STATIC void |
411 | static void |
495 | coro_init_stacks (pTHX) |
412 | coro_init_stacks () |
496 | { |
413 | { |
497 | LOCK; |
|
|
498 | |
|
|
499 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
414 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
500 | PL_curstackinfo->si_type = PERLSI_MAIN; |
415 | PL_curstackinfo->si_type = PERLSI_MAIN; |
501 | PL_curstack = PL_curstackinfo->si_stack; |
416 | PL_curstack = PL_curstackinfo->si_stack; |
502 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
417 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
503 | |
418 | |
504 | PL_stack_base = AvARRAY(PL_curstack); |
419 | PL_stack_base = AvARRAY(PL_curstack); |
505 | PL_stack_sp = PL_stack_base; |
420 | PL_stack_sp = PL_stack_base; |
506 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
421 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
507 | |
422 | |
508 | New(50,PL_tmps_stack,96,SV*); |
423 | New(50,PL_tmps_stack,128,SV*); |
509 | PL_tmps_floor = -1; |
424 | PL_tmps_floor = -1; |
510 | PL_tmps_ix = -1; |
425 | PL_tmps_ix = -1; |
511 | PL_tmps_max = 96; |
426 | PL_tmps_max = 128; |
512 | |
427 | |
513 | New(54,PL_markstack,16,I32); |
428 | New(54,PL_markstack,32,I32); |
514 | PL_markstack_ptr = PL_markstack; |
429 | PL_markstack_ptr = PL_markstack; |
515 | PL_markstack_max = PL_markstack + 16; |
430 | PL_markstack_max = PL_markstack + 32; |
516 | |
431 | |
517 | #ifdef SET_MARK_OFFSET |
432 | #ifdef SET_MARK_OFFSET |
518 | SET_MARK_OFFSET; |
433 | SET_MARK_OFFSET; |
519 | #endif |
434 | #endif |
520 | |
435 | |
521 | New(54,PL_scopestack,16,I32); |
436 | New(54,PL_scopestack,32,I32); |
522 | PL_scopestack_ix = 0; |
437 | PL_scopestack_ix = 0; |
523 | PL_scopestack_max = 16; |
438 | PL_scopestack_max = 32; |
524 | |
439 | |
525 | New(54,PL_savestack,96,ANY); |
440 | New(54,PL_savestack,64,ANY); |
526 | PL_savestack_ix = 0; |
441 | PL_savestack_ix = 0; |
527 | PL_savestack_max = 96; |
442 | PL_savestack_max = 64; |
528 | |
443 | |
|
|
444 | #if !PERL_VERSION_ATLEAST (5,9,0) |
529 | New(54,PL_retstack,8,OP*); |
445 | New(54,PL_retstack,16,OP*); |
530 | PL_retstack_ix = 0; |
446 | PL_retstack_ix = 0; |
531 | PL_retstack_max = 8; |
447 | PL_retstack_max = 16; |
532 | |
448 | #endif |
533 | UNLOCK; |
|
|
534 | } |
449 | } |
535 | |
450 | |
536 | /* |
451 | /* |
537 | * destroy the stacks, the callchain etc... |
452 | * destroy the stacks, the callchain etc... |
538 | */ |
453 | */ |
539 | STATIC void |
454 | static void |
540 | destroy_stacks(pTHX) |
455 | coro_destroy_stacks () |
541 | { |
456 | { |
542 | if (!IN_DESTRUCT) |
457 | if (!IN_DESTRUCT) |
543 | { |
458 | { |
544 | /* is this ugly, I ask? */ |
459 | /* is this ugly, I ask? */ |
545 | LEAVE_SCOPE (0); |
460 | LEAVE_SCOPE (0); |
… | |
… | |
576 | |
491 | |
577 | Safefree (PL_tmps_stack); |
492 | Safefree (PL_tmps_stack); |
578 | Safefree (PL_markstack); |
493 | Safefree (PL_markstack); |
579 | Safefree (PL_scopestack); |
494 | Safefree (PL_scopestack); |
580 | Safefree (PL_savestack); |
495 | Safefree (PL_savestack); |
|
|
496 | #if !PERL_VERSION_ATLEAST (5,9,0) |
581 | Safefree (PL_retstack); |
497 | 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 |
498 | #endif |
602 | { |
|
|
603 | /*FIXME*//*D*//* reasonable stack size! */ |
|
|
604 | stack->ssize = - (STACKSIZE * sizeof (long)); |
|
|
605 | New (0, stack->sptr, STACKSIZE, long); |
|
|
606 | } |
|
|
607 | } |
|
|
608 | else |
|
|
609 | stack->sptr = 0; |
|
|
610 | |
|
|
611 | ctx->stack = stack; |
|
|
612 | } |
499 | } |
613 | |
500 | |
614 | static void |
501 | static void |
615 | deallocate_stack (Coro__State ctx) |
502 | setup_coro (struct coro *coro) |
616 | { |
|
|
617 | coro_stack *stack = ctx->stack; |
|
|
618 | |
|
|
619 | ctx->stack = 0; |
|
|
620 | |
|
|
621 | if (stack) |
|
|
622 | { |
|
|
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 | |
|
|
632 | Safefree (stack); |
|
|
633 | } |
|
|
634 | else if (ctx->gencnt == stack->gencnt) |
|
|
635 | --stack->usecnt; |
|
|
636 | } |
|
|
637 | } |
|
|
638 | |
|
|
639 | static void |
|
|
640 | setup_coro (void *arg) |
|
|
641 | { |
503 | { |
642 | /* |
504 | /* |
643 | * emulate part of the perl startup here. |
505 | * emulate part of the perl startup here. |
644 | */ |
506 | */ |
645 | dTHX; |
507 | |
|
|
508 | coro_init_stacks (); |
|
|
509 | |
|
|
510 | PL_curcop = &PL_compiling; |
|
|
511 | PL_in_eval = EVAL_NULL; |
|
|
512 | PL_curpm = 0; |
|
|
513 | PL_localizing = 0; |
|
|
514 | PL_dirty = 0; |
|
|
515 | PL_restartop = 0; |
|
|
516 | |
|
|
517 | { |
|
|
518 | dSP; |
|
|
519 | LOGOP myop; |
|
|
520 | |
|
|
521 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
522 | GvAV (PL_defgv) = coro->args; coro->args = 0; |
|
|
523 | |
|
|
524 | Zero (&myop, 1, LOGOP); |
|
|
525 | myop.op_next = Nullop; |
|
|
526 | myop.op_flags = OPf_WANT_VOID; |
|
|
527 | |
|
|
528 | PUSHMARK (SP); |
|
|
529 | XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE)); |
|
|
530 | PUTBACK; |
|
|
531 | PL_op = (OP *)&myop; |
|
|
532 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
533 | SPAGAIN; |
|
|
534 | } |
|
|
535 | |
|
|
536 | ENTER; /* necessary e.g. for dounwind */ |
|
|
537 | } |
|
|
538 | |
|
|
539 | static void |
|
|
540 | free_coro_mortal () |
|
|
541 | { |
|
|
542 | if (coro_mortal) |
|
|
543 | { |
|
|
544 | SvREFCNT_dec (coro_mortal); |
|
|
545 | coro_mortal = 0; |
|
|
546 | } |
|
|
547 | } |
|
|
548 | |
|
|
549 | /* inject a fake call to Coro::State::_cctx_init into the execution */ |
|
|
550 | static void NOINLINE |
|
|
551 | prepare_cctx (coro_cctx *cctx) |
|
|
552 | { |
646 | dSP; |
553 | dSP; |
647 | Coro__State ctx = (Coro__State)arg; |
554 | LOGOP myop; |
648 | SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); |
|
|
649 | |
555 | |
650 | coro_init_stacks (aTHX); |
556 | Zero (&myop, 1, LOGOP); |
651 | /*PL_curcop = 0;*/ |
557 | myop.op_next = PL_op; |
652 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
558 | myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
653 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
654 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
|
|
655 | |
559 | |
|
|
560 | PUSHMARK (SP); |
|
|
561 | EXTEND (SP, 2); |
|
|
562 | PUSHs (sv_2mortal (newSViv (PTR2IV (cctx)))); |
|
|
563 | PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
|
|
564 | PUTBACK; |
|
|
565 | PL_op = (OP *)&myop; |
|
|
566 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
656 | SPAGAIN; |
567 | SPAGAIN; |
657 | |
|
|
658 | if (ctx->stack) |
|
|
659 | { |
|
|
660 | ctx->cursp = 0; |
|
|
661 | |
|
|
662 | PUSHMARK(SP); |
|
|
663 | PUTBACK; |
|
|
664 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
665 | |
|
|
666 | if (SvTRUE (ERRSV)) |
|
|
667 | croak (NULL); |
|
|
668 | else |
|
|
669 | croak ("FATAL: CCTXT coroutine returned!"); |
|
|
670 | } |
|
|
671 | else |
|
|
672 | { |
|
|
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 | } |
|
|
696 | } |
568 | } |
697 | |
569 | |
698 | static void |
570 | static void |
699 | continue_coro (void *arg) |
571 | coro_run (void *arg) |
700 | { |
572 | { |
|
|
573 | /* coro_run is the alternative tail of transfer(), so unlock here. */ |
|
|
574 | UNLOCK; |
|
|
575 | |
701 | /* |
576 | /* |
702 | * this is a _very_ stripped down perl interpreter ;) |
577 | * this is a _very_ stripped down perl interpreter ;) |
703 | */ |
578 | */ |
704 | dTHX; |
|
|
705 | Coro__State ctx = (Coro__State)arg; |
|
|
706 | JMPENV coro_start_env; |
|
|
707 | |
|
|
708 | PL_top_env = &ctx->start_env; |
579 | PL_top_env = &PL_start_env; |
709 | |
580 | |
710 | ctx->cursp = 0; |
581 | /* inject call to cctx_init */ |
711 | PL_op = PL_op->op_next; |
582 | prepare_cctx ((coro_cctx *)arg); |
712 | CALLRUNOPS(aTHX); |
|
|
713 | |
583 | |
|
|
584 | /* somebody will hit me for both perl_run and PL_restartop */ |
|
|
585 | PL_restartop = PL_op; |
|
|
586 | perl_run (PL_curinterp); |
|
|
587 | |
|
|
588 | fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr); |
714 | abort (); |
589 | abort (); |
715 | } |
590 | } |
716 | |
591 | |
717 | STATIC void |
592 | static coro_cctx * |
|
|
593 | cctx_new () |
|
|
594 | { |
|
|
595 | coro_cctx *cctx; |
|
|
596 | |
|
|
597 | ++cctx_count; |
|
|
598 | |
|
|
599 | Newz (0, cctx, 1, coro_cctx); |
|
|
600 | |
|
|
601 | #if HAVE_MMAP |
|
|
602 | |
|
|
603 | cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; |
|
|
604 | /* mmap supposedly does allocate-on-write for us */ |
|
|
605 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
606 | |
|
|
607 | if (cctx->sptr == (void *)-1) |
|
|
608 | { |
|
|
609 | perror ("FATAL: unable to mmap stack for coroutine"); |
|
|
610 | _exit (EXIT_FAILURE); |
|
|
611 | } |
|
|
612 | |
|
|
613 | # if STACKGUARD |
|
|
614 | mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
615 | # endif |
|
|
616 | |
|
|
617 | #else |
|
|
618 | |
|
|
619 | cctx->ssize = STACKSIZE * (long)sizeof (long); |
|
|
620 | New (0, cctx->sptr, STACKSIZE, long); |
|
|
621 | |
|
|
622 | if (!cctx->sptr) |
|
|
623 | { |
|
|
624 | perror ("FATAL: unable to malloc stack for coroutine"); |
|
|
625 | _exit (EXIT_FAILURE); |
|
|
626 | } |
|
|
627 | |
|
|
628 | #endif |
|
|
629 | |
|
|
630 | #if USE_VALGRIND |
|
|
631 | cctx->valgrind_id = VALGRIND_STACK_REGISTER ( |
|
|
632 | STACKGUARD * PAGESIZE + (char *)cctx->sptr, |
|
|
633 | cctx->ssize + (char *)cctx->sptr |
|
|
634 | ); |
|
|
635 | #endif |
|
|
636 | |
|
|
637 | coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize); |
|
|
638 | |
|
|
639 | return cctx; |
|
|
640 | } |
|
|
641 | |
|
|
642 | static void |
|
|
643 | cctx_destroy (coro_cctx *cctx) |
|
|
644 | { |
|
|
645 | if (!cctx) |
|
|
646 | return; |
|
|
647 | |
|
|
648 | --cctx_count; |
|
|
649 | |
|
|
650 | #if USE_VALGRIND |
|
|
651 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
|
|
652 | #endif |
|
|
653 | |
|
|
654 | #if HAVE_MMAP |
|
|
655 | munmap (cctx->sptr, cctx->ssize); |
|
|
656 | #else |
|
|
657 | Safefree (cctx->sptr); |
|
|
658 | #endif |
|
|
659 | |
|
|
660 | Safefree (cctx); |
|
|
661 | } |
|
|
662 | |
|
|
663 | static coro_cctx * |
|
|
664 | cctx_get () |
|
|
665 | { |
|
|
666 | coro_cctx *cctx; |
|
|
667 | |
|
|
668 | if (cctx_first) |
|
|
669 | { |
|
|
670 | cctx = cctx_first; |
|
|
671 | cctx_first = cctx->next; |
|
|
672 | --cctx_idle; |
|
|
673 | } |
|
|
674 | else |
|
|
675 | { |
|
|
676 | cctx = cctx_new (); |
|
|
677 | PL_op = PL_op->op_next; |
|
|
678 | } |
|
|
679 | |
|
|
680 | return cctx; |
|
|
681 | } |
|
|
682 | |
|
|
683 | static void |
|
|
684 | cctx_put (coro_cctx *cctx) |
|
|
685 | { |
|
|
686 | /* free another cctx if overlimit */ |
|
|
687 | if (cctx_idle >= MAX_IDLE_CCTX) |
|
|
688 | { |
|
|
689 | coro_cctx *first = cctx_first; |
|
|
690 | cctx_first = first->next; |
|
|
691 | --cctx_idle; |
|
|
692 | |
|
|
693 | assert (!first->inuse); |
|
|
694 | cctx_destroy (first); |
|
|
695 | } |
|
|
696 | |
|
|
697 | ++cctx_idle; |
|
|
698 | cctx->next = cctx_first; |
|
|
699 | cctx_first = cctx; |
|
|
700 | } |
|
|
701 | |
|
|
702 | /* never call directly, always through the coro_state_transfer global variable */ |
|
|
703 | static void NOINLINE |
718 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
704 | transfer (struct coro *prev, struct coro *next) |
719 | { |
705 | { |
720 | dSTACKLEVEL; |
706 | dSTACKLEVEL; |
721 | |
707 | |
|
|
708 | /* sometimes transfer is only called to set idle_sp */ |
|
|
709 | if (!next) |
|
|
710 | { |
|
|
711 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
|
|
712 | assert (((coro_cctx *)prev)->top_env = PL_top_env); /* just for the side effetc when assert is enabled */ |
|
|
713 | } |
722 | if (prev != next) |
714 | else if (prev != next) |
723 | { |
715 | { |
724 | if (next->mainstack) |
716 | coro_cctx *prev__cctx; |
|
|
717 | |
|
|
718 | if (prev->flags & CF_NEW) |
725 | { |
719 | { |
726 | LOCK; |
720 | /* create a new empty context */ |
727 | SAVE (prev, flags); |
721 | Newz (0, prev->cctx, 1, coro_cctx); |
728 | LOAD (next); |
722 | prev->cctx->inuse = 1; |
729 | UNLOCK; |
723 | prev->flags &= ~CF_NEW; |
730 | |
724 | prev->flags |= CF_RUNNING; |
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 | } |
725 | } |
764 | else if (next->tmps_ix == -2) |
726 | |
765 | croak ("tried to transfer to running coroutine"); |
727 | /*TODO: must not croak here */ |
|
|
728 | if (!prev->flags & CF_RUNNING) |
|
|
729 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
|
|
730 | |
|
|
731 | if (next->flags & CF_RUNNING) |
|
|
732 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
733 | |
|
|
734 | prev->flags &= ~CF_RUNNING; |
|
|
735 | next->flags |= CF_RUNNING; |
|
|
736 | |
|
|
737 | LOCK; |
|
|
738 | |
|
|
739 | if (next->flags & CF_NEW) |
|
|
740 | { |
|
|
741 | /* need to start coroutine */ |
|
|
742 | next->flags &= ~CF_NEW; |
|
|
743 | /* first get rid of the old state */ |
|
|
744 | save_perl (prev); |
|
|
745 | /* setup coroutine call */ |
|
|
746 | setup_coro (next); |
|
|
747 | /* need a new stack */ |
|
|
748 | assert (!next->cctx); |
|
|
749 | } |
766 | else |
750 | else |
767 | { |
751 | { |
768 | LOCK; |
752 | /* coroutine already started */ |
769 | SAVE (prev, -1); /* first get rid of the old state */ |
753 | save_perl (prev); |
770 | UNLOCK; |
754 | load_perl (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 | } |
755 | } |
|
|
756 | |
|
|
757 | prev__cctx = prev->cctx; |
|
|
758 | |
|
|
759 | /* possibly "free" the cctx */ |
|
|
760 | if (prev__cctx->idle_sp == STACKLEVEL) |
|
|
761 | { |
|
|
762 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
|
|
763 | assert (PL_top_env == prev__cctx->top_env); |
|
|
764 | |
|
|
765 | prev->cctx = 0; |
|
|
766 | |
|
|
767 | cctx_put (prev__cctx); |
|
|
768 | prev__cctx->inuse = 0; |
|
|
769 | } |
|
|
770 | |
|
|
771 | if (!next->cctx) |
|
|
772 | { |
|
|
773 | next->cctx = cctx_get (); |
|
|
774 | assert (!next->cctx->inuse); |
|
|
775 | next->cctx->inuse = 1; |
|
|
776 | } |
|
|
777 | |
|
|
778 | if (prev__cctx != next->cctx) |
|
|
779 | { |
|
|
780 | prev__cctx->top_env = PL_top_env; |
|
|
781 | PL_top_env = next->cctx->top_env; |
|
|
782 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
|
|
783 | } |
|
|
784 | |
|
|
785 | free_coro_mortal (); |
|
|
786 | |
|
|
787 | UNLOCK; |
807 | } |
788 | } |
|
|
789 | } |
808 | |
790 | |
809 | LOCK; |
791 | struct transfer_args |
810 | if (coro_mortal) |
792 | { |
|
|
793 | struct coro *prev, *next; |
|
|
794 | }; |
|
|
795 | |
|
|
796 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next) |
|
|
797 | |
|
|
798 | static void |
|
|
799 | coro_state_destroy (struct coro *coro) |
|
|
800 | { |
|
|
801 | if (coro->refcnt--) |
|
|
802 | return; |
|
|
803 | |
|
|
804 | if (coro->mainstack && coro->mainstack != main_mainstack) |
811 | { |
805 | { |
812 | SvREFCNT_dec (coro_mortal); |
806 | struct coro temp; |
|
|
807 | Zero (&temp, 1, struct coro); |
|
|
808 | temp.save = CORO_SAVE_ALL; |
|
|
809 | |
|
|
810 | if (coro->flags & CF_RUNNING) |
|
|
811 | croak ("FATAL: tried to destroy currently running coroutine"); |
|
|
812 | |
|
|
813 | save_perl (&temp); |
|
|
814 | load_perl (coro); |
|
|
815 | |
|
|
816 | coro_destroy_stacks (); |
|
|
817 | |
|
|
818 | load_perl (&temp); /* this will get rid of defsv etc.. */ |
|
|
819 | |
813 | coro_mortal = 0; |
820 | coro->mainstack = 0; |
814 | } |
821 | } |
815 | UNLOCK; |
|
|
816 | } |
|
|
817 | |
822 | |
818 | #define SV_CORO(sv,func) \ |
823 | cctx_destroy (coro->cctx); |
819 | do { \ |
824 | SvREFCNT_dec (coro->args); |
820 | if (SvROK (sv)) \ |
825 | Safefree (coro); |
821 | sv = SvRV (sv); \ |
826 | } |
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 | |
827 | |
839 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
840 | |
|
|
841 | static void |
828 | static int |
|
|
829 | coro_state_clear (pTHX_ SV *sv, MAGIC *mg) |
|
|
830 | { |
|
|
831 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
832 | mg->mg_ptr = 0; |
|
|
833 | |
|
|
834 | coro_state_destroy (coro); |
|
|
835 | |
|
|
836 | return 0; |
|
|
837 | } |
|
|
838 | |
|
|
839 | static int |
|
|
840 | coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
|
|
841 | { |
|
|
842 | struct coro *coro = (struct coro *)mg->mg_ptr; |
|
|
843 | |
|
|
844 | ++coro->refcnt; |
|
|
845 | |
|
|
846 | return 0; |
|
|
847 | } |
|
|
848 | |
|
|
849 | static MGVTBL coro_state_vtbl = { |
|
|
850 | 0, 0, 0, 0, |
|
|
851 | coro_state_clear, |
|
|
852 | 0, |
|
|
853 | #ifdef MGf_DUP |
|
|
854 | coro_state_dup, |
|
|
855 | #else |
|
|
856 | # define MGf_DUP 0 |
|
|
857 | #endif |
|
|
858 | }; |
|
|
859 | |
|
|
860 | static struct coro * |
|
|
861 | SvSTATE (SV *coro) |
|
|
862 | { |
|
|
863 | HV *stash; |
|
|
864 | MAGIC *mg; |
|
|
865 | |
|
|
866 | if (SvROK (coro)) |
|
|
867 | coro = SvRV (coro); |
|
|
868 | |
|
|
869 | stash = SvSTASH (coro); |
|
|
870 | if (stash != coro_stash && stash != coro_state_stash) |
|
|
871 | { |
|
|
872 | /* very slow, but rare, check */ |
|
|
873 | if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
|
|
874 | croak ("Coro::State object required"); |
|
|
875 | } |
|
|
876 | |
|
|
877 | mg = SvMAGIC (coro); |
|
|
878 | assert (mg->mg_type == PERL_MAGIC_ext); |
|
|
879 | return (struct coro *)mg->mg_ptr; |
|
|
880 | } |
|
|
881 | |
|
|
882 | static void |
|
|
883 | prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv) |
|
|
884 | { |
|
|
885 | ta->prev = SvSTATE (prev_sv); |
|
|
886 | ta->next = SvSTATE (next_sv); |
|
|
887 | } |
|
|
888 | |
|
|
889 | static void |
842 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
890 | api_transfer (SV *prev_sv, SV *next_sv) |
843 | { |
891 | { |
844 | SV_CORO (prev, "Coro::transfer"); |
892 | struct transfer_args ta; |
845 | SV_CORO (next, "Coro::transfer"); |
|
|
846 | |
893 | |
847 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
894 | prepare_transfer (&ta, prev_sv, next_sv); |
|
|
895 | TRANSFER (ta); |
|
|
896 | } |
|
|
897 | |
|
|
898 | static int |
|
|
899 | api_save (SV *coro_sv, int new_save) |
|
|
900 | { |
|
|
901 | struct coro *coro = SvSTATE (coro_sv); |
|
|
902 | int old_save = coro->save; |
|
|
903 | |
|
|
904 | if (new_save >= 0) |
|
|
905 | coro->save = new_save; |
|
|
906 | |
|
|
907 | return old_save; |
848 | } |
908 | } |
849 | |
909 | |
850 | /** Coro ********************************************************************/ |
910 | /** Coro ********************************************************************/ |
851 | |
911 | |
852 | #define PRIO_MAX 3 |
912 | #define PRIO_MAX 3 |
… | |
… | |
855 | #define PRIO_LOW -1 |
915 | #define PRIO_LOW -1 |
856 | #define PRIO_IDLE -3 |
916 | #define PRIO_IDLE -3 |
857 | #define PRIO_MIN -4 |
917 | #define PRIO_MIN -4 |
858 | |
918 | |
859 | /* for Coro.pm */ |
919 | /* for Coro.pm */ |
860 | static GV *coro_current, *coro_idle; |
920 | static SV *coro_current; |
861 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
921 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
862 | static int coro_nready; |
922 | static int coro_nready; |
863 | |
923 | |
864 | static void |
924 | static void |
865 | coro_enq (pTHX_ SV *sv) |
925 | coro_enq (SV *coro_sv) |
866 | { |
926 | { |
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); |
927 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
877 | coro_nready++; |
928 | coro_nready++; |
878 | |
|
|
879 | return; |
|
|
880 | } |
|
|
881 | |
|
|
882 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
883 | } |
929 | } |
884 | |
930 | |
885 | static SV * |
931 | static SV * |
886 | coro_deq (pTHX_ int min_prio) |
932 | coro_deq (int min_prio) |
887 | { |
933 | { |
888 | int prio = PRIO_MAX - PRIO_MIN; |
934 | int prio = PRIO_MAX - PRIO_MIN; |
889 | |
935 | |
890 | min_prio -= PRIO_MIN; |
936 | min_prio -= PRIO_MIN; |
891 | if (min_prio < 0) |
937 | if (min_prio < 0) |
892 | min_prio = 0; |
938 | min_prio = 0; |
893 | |
939 | |
894 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
940 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
895 | if (av_len (coro_ready[prio]) >= 0) |
941 | if (AvFILLp (coro_ready [prio]) >= 0) |
896 | { |
942 | { |
897 | coro_nready--; |
943 | coro_nready--; |
898 | return av_shift (coro_ready[prio]); |
944 | return av_shift (coro_ready [prio]); |
899 | } |
945 | } |
900 | |
946 | |
901 | return 0; |
947 | return 0; |
902 | } |
948 | } |
903 | |
949 | |
904 | static void |
950 | static int |
905 | api_ready (SV *coro) |
951 | api_ready (SV *coro_sv) |
906 | { |
952 | { |
907 | dTHX; |
953 | struct coro *coro; |
908 | |
954 | |
909 | if (SvROK (coro)) |
955 | if (SvROK (coro_sv)) |
910 | coro = SvRV (coro); |
956 | coro_sv = SvRV (coro_sv); |
|
|
957 | |
|
|
958 | coro = SvSTATE (coro_sv); |
|
|
959 | |
|
|
960 | if (coro->flags & CF_READY) |
|
|
961 | return 0; |
|
|
962 | |
|
|
963 | #if 0 /* this is actually harmless */ |
|
|
964 | if (coro->flags & CF_RUNNING) |
|
|
965 | croak ("Coro::ready called on currently running coroutine"); |
|
|
966 | #endif |
|
|
967 | |
|
|
968 | coro->flags |= CF_READY; |
911 | |
969 | |
912 | LOCK; |
970 | LOCK; |
913 | coro_enq (aTHX_ SvREFCNT_inc (coro)); |
971 | coro_enq (SvREFCNT_inc (coro_sv)); |
914 | UNLOCK; |
972 | UNLOCK; |
|
|
973 | |
|
|
974 | return 1; |
|
|
975 | } |
|
|
976 | |
|
|
977 | static int |
|
|
978 | api_is_ready (SV *coro_sv) |
|
|
979 | { |
|
|
980 | return !!SvSTATE (coro_sv)->flags & CF_READY; |
|
|
981 | } |
|
|
982 | |
|
|
983 | static void |
|
|
984 | prepare_schedule (struct transfer_args *ta) |
|
|
985 | { |
|
|
986 | SV *prev, *next; |
|
|
987 | |
|
|
988 | for (;;) |
|
|
989 | { |
|
|
990 | LOCK; |
|
|
991 | next = coro_deq (PRIO_MIN); |
|
|
992 | UNLOCK; |
|
|
993 | |
|
|
994 | if (next) |
|
|
995 | break; |
|
|
996 | |
|
|
997 | { |
|
|
998 | dSP; |
|
|
999 | |
|
|
1000 | ENTER; |
|
|
1001 | SAVETMPS; |
|
|
1002 | |
|
|
1003 | PUSHMARK (SP); |
|
|
1004 | PUTBACK; |
|
|
1005 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1006 | |
|
|
1007 | FREETMPS; |
|
|
1008 | LEAVE; |
|
|
1009 | } |
|
|
1010 | } |
|
|
1011 | |
|
|
1012 | prev = SvRV (coro_current); |
|
|
1013 | SvRV_set (coro_current, next); |
|
|
1014 | |
|
|
1015 | /* free this only after the transfer */ |
|
|
1016 | LOCK; |
|
|
1017 | free_coro_mortal (); |
|
|
1018 | UNLOCK; |
|
|
1019 | coro_mortal = prev; |
|
|
1020 | |
|
|
1021 | assert (!SvROK(prev));//D |
|
|
1022 | assert (!SvROK(next));//D |
|
|
1023 | |
|
|
1024 | ta->prev = SvSTATE (prev); |
|
|
1025 | ta->next = SvSTATE (next); |
|
|
1026 | |
|
|
1027 | assert (ta->next->flags & CF_READY); |
|
|
1028 | ta->next->flags &= ~CF_READY; |
|
|
1029 | } |
|
|
1030 | |
|
|
1031 | static void |
|
|
1032 | prepare_cede (struct transfer_args *ta) |
|
|
1033 | { |
|
|
1034 | api_ready (coro_current); |
|
|
1035 | |
|
|
1036 | prepare_schedule (ta); |
915 | } |
1037 | } |
916 | |
1038 | |
917 | static void |
1039 | static void |
918 | api_schedule (void) |
1040 | api_schedule (void) |
919 | { |
1041 | { |
920 | dTHX; |
1042 | struct transfer_args ta; |
921 | |
1043 | |
922 | SV *prev, *next; |
1044 | prepare_schedule (&ta); |
923 | |
1045 | 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 | } |
1046 | } |
945 | |
1047 | |
946 | static void |
1048 | static void |
947 | api_cede (void) |
1049 | api_cede (void) |
948 | { |
1050 | { |
949 | dTHX; |
1051 | struct transfer_args ta; |
950 | |
1052 | |
951 | LOCK; |
1053 | prepare_cede (&ta); |
952 | coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
1054 | TRANSFER (ta); |
953 | UNLOCK; |
|
|
954 | |
|
|
955 | api_schedule (); |
|
|
956 | } |
1055 | } |
957 | |
1056 | |
958 | MODULE = Coro::State PACKAGE = Coro::State |
1057 | MODULE = Coro::State PACKAGE = Coro::State |
959 | |
1058 | |
960 | PROTOTYPES: ENABLE |
1059 | PROTOTYPES: DISABLE |
961 | |
1060 | |
962 | BOOT: |
1061 | BOOT: |
963 | { /* {} necessary for stoopid perl-5.6.x */ |
1062 | { |
964 | #ifdef USE_ITHREADS |
1063 | #ifdef USE_ITHREADS |
965 | MUTEX_INIT (&coro_mutex); |
1064 | MUTEX_INIT (&coro_mutex); |
966 | #endif |
1065 | #endif |
|
|
1066 | BOOT_PAGESIZE; |
967 | |
1067 | |
968 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
|
|
969 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
|
|
970 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
1068 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
971 | |
1069 | |
972 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
1070 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV)); |
973 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
1071 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV)); |
974 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
1072 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV)); |
|
|
1073 | newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV)); |
975 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
1074 | newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL)); |
976 | |
1075 | |
977 | main_mainstack = PL_mainstack; |
1076 | main_mainstack = PL_mainstack; |
978 | |
1077 | |
979 | coroapi.ver = CORO_API_VERSION; |
1078 | coroapi.ver = CORO_API_VERSION; |
980 | coroapi.transfer = api_transfer; |
1079 | coroapi.transfer = api_transfer; |
981 | } |
|
|
982 | |
1080 | |
983 | Coro::State |
1081 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
984 | _newprocess(args) |
1082 | } |
985 | SV * args |
1083 | |
986 | PROTOTYPE: $ |
1084 | SV * |
|
|
1085 | new (char *klass, ...) |
987 | CODE: |
1086 | CODE: |
988 | Coro__State coro; |
1087 | { |
|
|
1088 | struct coro *coro; |
|
|
1089 | HV *hv; |
|
|
1090 | int i; |
989 | |
1091 | |
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); |
1092 | Newz (0, coro, 1, struct coro); |
|
|
1093 | coro->args = newAV (); |
|
|
1094 | coro->save = CORO_SAVE_ALL; |
|
|
1095 | coro->flags = CF_NEW; |
994 | |
1096 | |
995 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
1097 | hv = newHV (); |
996 | /*coro->mainstack = 0; *//*actual work is done inside transfer */ |
1098 | sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
997 | /*coro->stack = 0;*/ |
1099 | RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
998 | |
1100 | |
999 | /* same as JMPENV_BOOTSTRAP */ |
1101 | for (i = 1; i < items; i++) |
1000 | /* we might be able to recycle start_env, but safe is safe */ |
1102 | av_push (coro->args, newSVsv (ST (i))); |
1001 | /*Zero(&coro->start_env, 1, JMPENV);*/ |
1103 | } |
1002 | coro->start_env.je_ret = -1; |
|
|
1003 | coro->start_env.je_mustcatch = TRUE; |
|
|
1004 | |
|
|
1005 | RETVAL = coro; |
|
|
1006 | OUTPUT: |
1104 | OUTPUT: |
1007 | RETVAL |
1105 | RETVAL |
1008 | |
1106 | |
|
|
1107 | int |
|
|
1108 | save (SV *coro, int new_save = -1) |
|
|
1109 | CODE: |
|
|
1110 | RETVAL = api_save (coro, new_save); |
|
|
1111 | OUTPUT: |
|
|
1112 | RETVAL |
|
|
1113 | |
1009 | void |
1114 | void |
1010 | transfer(prev, next, flags) |
1115 | _set_stacklevel (...) |
1011 | SV *prev |
1116 | ALIAS: |
1012 | SV *next |
1117 | Coro::State::transfer = 1 |
1013 | int flags |
1118 | Coro::schedule = 2 |
1014 | PROTOTYPE: @ |
1119 | Coro::cede = 3 |
1015 | CODE: |
1120 | CODE: |
1016 | PUTBACK; |
1121 | { |
1017 | SV_CORO (next, "Coro::transfer"); |
1122 | struct transfer_args ta; |
1018 | SV_CORO (prev, "Coro::transfer"); |
1123 | |
1019 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
1124 | switch (ix) |
1020 | SPAGAIN; |
1125 | { |
|
|
1126 | case 0: |
|
|
1127 | ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
|
|
1128 | ta.next = 0; |
|
|
1129 | break; |
|
|
1130 | |
|
|
1131 | case 1: |
|
|
1132 | if (items != 2) |
|
|
1133 | croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items); |
|
|
1134 | |
|
|
1135 | prepare_transfer (&ta, ST (0), ST (1)); |
|
|
1136 | break; |
|
|
1137 | |
|
|
1138 | case 2: |
|
|
1139 | prepare_schedule (&ta); |
|
|
1140 | break; |
|
|
1141 | |
|
|
1142 | case 3: |
|
|
1143 | prepare_cede (&ta); |
|
|
1144 | break; |
|
|
1145 | } |
|
|
1146 | |
|
|
1147 | TRANSFER (ta); |
|
|
1148 | } |
1021 | |
1149 | |
1022 | void |
1150 | void |
1023 | DESTROY(coro) |
1151 | _clone_state_from (SV *dst, SV *src) |
1024 | Coro::State coro |
1152 | CODE: |
1025 | CODE: |
1153 | { |
|
|
1154 | struct coro *coro_src = SvSTATE (src); |
1026 | |
1155 | |
1027 | if (coro->mainstack && coro->mainstack != main_mainstack) |
1156 | sv_unmagic (SvRV (dst), PERL_MAGIC_ext); |
1028 | { |
|
|
1029 | struct coro temp; |
|
|
1030 | |
1157 | |
1031 | PUTBACK; |
1158 | ++coro_src->refcnt; |
1032 | SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL); |
1159 | sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP; |
1033 | LOAD (aTHX_ coro); |
1160 | } |
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 | |
1161 | |
1048 | void |
1162 | void |
1049 | _exit(code) |
1163 | _exit (code) |
1050 | int code |
1164 | int code |
1051 | PROTOTYPE: $ |
1165 | PROTOTYPE: $ |
1052 | CODE: |
1166 | CODE: |
1053 | _exit (code); |
1167 | _exit (code); |
1054 | |
1168 | |
1055 | MODULE = Coro::State PACKAGE = Coro::Cont |
1169 | int |
|
|
1170 | cctx_count () |
|
|
1171 | CODE: |
|
|
1172 | RETVAL = cctx_count; |
|
|
1173 | OUTPUT: |
|
|
1174 | RETVAL |
1056 | |
1175 | |
1057 | # this is slightly dirty (should expose a c-level api) |
1176 | int |
1058 | |
1177 | cctx_idle () |
1059 | void |
1178 | CODE: |
1060 | yield(...) |
1179 | RETVAL = cctx_idle; |
1061 | PROTOTYPE: @ |
1180 | OUTPUT: |
1062 | CODE: |
1181 | RETVAL |
1063 | SV *yieldstack; |
|
|
1064 | SV *sv; |
|
|
1065 | AV *defav = GvAV (PL_defgv); |
|
|
1066 | struct coro *prev, *next; |
|
|
1067 | |
|
|
1068 | yieldstack = *hv_fetch ( |
|
|
1069 | (HV *)SvRV (GvSV (coro_current)), |
|
|
1070 | "yieldstack", sizeof ("yieldstack") - 1, |
|
|
1071 | 0 |
|
|
1072 | ); |
|
|
1073 | |
|
|
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 | |
1182 | |
1087 | MODULE = Coro::State PACKAGE = Coro |
1183 | MODULE = Coro::State PACKAGE = Coro |
1088 | |
1184 | |
1089 | # this is slightly dirty (should expose a c-level api) |
|
|
1090 | |
|
|
1091 | BOOT: |
1185 | BOOT: |
1092 | { |
1186 | { |
1093 | int i; |
1187 | int i; |
|
|
1188 | |
1094 | HV *stash = gv_stashpv ("Coro", TRUE); |
1189 | coro_stash = gv_stashpv ("Coro", TRUE); |
1095 | |
1190 | |
1096 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1191 | newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1097 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1192 | newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1098 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1193 | newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1099 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1194 | newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1100 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1195 | newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1101 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1196 | newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1102 | |
1197 | |
1103 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1198 | coro_current = get_sv ("Coro::current", FALSE); |
1104 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1199 | SvREADONLY_on (coro_current); |
1105 | |
1200 | |
1106 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1201 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1107 | coro_ready[i] = newAV (); |
1202 | coro_ready[i] = newAV (); |
1108 | |
1203 | |
1109 | { |
1204 | { |
1110 | SV *sv = perl_get_sv("Coro::API", 1); |
1205 | SV *sv = perl_get_sv("Coro::API", 1); |
1111 | |
1206 | |
1112 | coroapi.schedule = api_schedule; |
1207 | coroapi.schedule = api_schedule; |
|
|
1208 | coroapi.save = api_save; |
1113 | coroapi.cede = api_cede; |
1209 | coroapi.cede = api_cede; |
1114 | coroapi.ready = api_ready; |
1210 | coroapi.ready = api_ready; |
|
|
1211 | coroapi.is_ready = api_is_ready; |
1115 | coroapi.nready = &coro_nready; |
1212 | coroapi.nready = &coro_nready; |
1116 | coroapi.current = coro_current; |
1213 | coroapi.current = coro_current; |
1117 | |
1214 | |
1118 | GCoroAPI = &coroapi; |
1215 | GCoroAPI = &coroapi; |
1119 | sv_setiv(sv, (IV)&coroapi); |
1216 | sv_setiv (sv, (IV)&coroapi); |
1120 | SvREADONLY_on(sv); |
1217 | SvREADONLY_on (sv); |
1121 | } |
1218 | } |
1122 | } |
1219 | } |
1123 | |
1220 | |
1124 | #if !PERL_MICRO |
|
|
1125 | |
|
|
1126 | void |
1221 | void |
1127 | ready(self) |
1222 | _set_current (SV *current) |
1128 | SV * self |
|
|
1129 | PROTOTYPE: $ |
1223 | PROTOTYPE: $ |
1130 | CODE: |
1224 | CODE: |
1131 | api_ready (self); |
1225 | SvREFCNT_dec (SvRV (coro_current)); |
1132 | |
1226 | SvRV_set (coro_current, SvREFCNT_inc (SvRV (current))); |
1133 | #endif |
|
|
1134 | |
1227 | |
1135 | int |
1228 | int |
|
|
1229 | prio (Coro::State coro, int newprio = 0) |
|
|
1230 | ALIAS: |
|
|
1231 | nice = 1 |
|
|
1232 | CODE: |
|
|
1233 | { |
|
|
1234 | RETVAL = coro->prio; |
|
|
1235 | |
|
|
1236 | if (items > 1) |
|
|
1237 | { |
|
|
1238 | if (ix) |
|
|
1239 | newprio += coro->prio; |
|
|
1240 | |
|
|
1241 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
|
|
1242 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
|
|
1243 | |
|
|
1244 | coro->prio = newprio; |
|
|
1245 | } |
|
|
1246 | } |
|
|
1247 | |
|
|
1248 | SV * |
|
|
1249 | ready (SV *self) |
|
|
1250 | PROTOTYPE: $ |
|
|
1251 | CODE: |
|
|
1252 | RETVAL = boolSV (api_ready (self)); |
|
|
1253 | OUTPUT: |
|
|
1254 | RETVAL |
|
|
1255 | |
|
|
1256 | SV * |
|
|
1257 | is_ready (SV *self) |
|
|
1258 | PROTOTYPE: $ |
|
|
1259 | CODE: |
|
|
1260 | RETVAL = boolSV (api_is_ready (self)); |
|
|
1261 | OUTPUT: |
|
|
1262 | RETVAL |
|
|
1263 | |
|
|
1264 | int |
1136 | nready(...) |
1265 | nready (...) |
1137 | PROTOTYPE: |
1266 | PROTOTYPE: |
1138 | CODE: |
1267 | CODE: |
1139 | RETVAL = coro_nready; |
1268 | RETVAL = coro_nready; |
1140 | OUTPUT: |
1269 | OUTPUT: |
1141 | RETVAL |
1270 | RETVAL |
1142 | |
1271 | |
|
|
1272 | MODULE = Coro::State PACKAGE = Coro::AIO |
|
|
1273 | |
|
|
1274 | SV * |
|
|
1275 | _get_state () |
|
|
1276 | CODE: |
|
|
1277 | { |
|
|
1278 | struct io_state *data; |
|
|
1279 | |
|
|
1280 | RETVAL = newSV (sizeof (struct io_state)); |
|
|
1281 | data = (struct io_state *)SvPVX (RETVAL); |
|
|
1282 | SvCUR_set (RETVAL, sizeof (struct io_state)); |
|
|
1283 | SvPOK_only (RETVAL); |
|
|
1284 | |
|
|
1285 | data->errorno = errno; |
|
|
1286 | data->laststype = PL_laststype; |
|
|
1287 | data->laststatval = PL_laststatval; |
|
|
1288 | data->statcache = PL_statcache; |
|
|
1289 | } |
|
|
1290 | OUTPUT: |
|
|
1291 | RETVAL |
|
|
1292 | |
1143 | void |
1293 | void |
1144 | schedule(...) |
1294 | _set_state (char *data_) |
1145 | PROTOTYPE: |
1295 | PROTOTYPE: $ |
1146 | CODE: |
1296 | CODE: |
1147 | api_schedule (); |
1297 | { |
|
|
1298 | struct io_state *data = (void *)data_; |
1148 | |
1299 | |
1149 | void |
1300 | errno = data->errorno; |
1150 | cede(...) |
1301 | PL_laststype = data->laststype; |
1151 | PROTOTYPE: |
1302 | PL_laststatval = data->laststatval; |
1152 | CODE: |
1303 | PL_statcache = data->statcache; |
1153 | api_cede (); |
1304 | } |
1154 | |
1305 | |