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