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