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