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