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