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