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