1 |
#include "libcoro/coro.c" |
2 |
|
3 |
#define PERL_NO_GET_CONTEXT |
4 |
|
5 |
#include "EXTERN.h" |
6 |
#include "perl.h" |
7 |
#include "XSUB.h" |
8 |
|
9 |
#include "patchlevel.h" |
10 |
|
11 |
#include <stdio.h> |
12 |
#include <errno.h> |
13 |
#include <assert.h> |
14 |
|
15 |
#ifdef HAVE_MMAP |
16 |
# include <unistd.h> |
17 |
# include <sys/mman.h> |
18 |
# ifndef MAP_ANONYMOUS |
19 |
# ifdef MAP_ANON |
20 |
# define MAP_ANONYMOUS MAP_ANON |
21 |
# else |
22 |
# undef HAVE_MMAP |
23 |
# endif |
24 |
# endif |
25 |
# include <limits.h> |
26 |
# ifndef PAGESIZE |
27 |
# define PAGESIZE pagesize |
28 |
# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
29 |
static long pagesize; |
30 |
# else |
31 |
# define BOOT_PAGESIZE (void)0 |
32 |
# endif |
33 |
#else |
34 |
# define PAGESIZE 0 |
35 |
# define BOOT_PAGESIZE (void)0 |
36 |
#endif |
37 |
|
38 |
#if CORO_USE_VALGRIND |
39 |
# include <valgrind/valgrind.h> |
40 |
# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end)) |
41 |
#else |
42 |
# define REGISTER_STACK(cctx,start,end) |
43 |
#endif |
44 |
|
45 |
/* the maximum number of idle cctx that will be pooled */ |
46 |
#define MAX_IDLE_CCTX 8 |
47 |
|
48 |
#define PERL_VERSION_ATLEAST(a,b,c) \ |
49 |
(PERL_REVISION > (a) \ |
50 |
|| (PERL_REVISION == (a) \ |
51 |
&& (PERL_VERSION > (b) \ |
52 |
|| (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
53 |
|
54 |
#if !PERL_VERSION_ATLEAST (5,6,0) |
55 |
# ifndef PL_ppaddr |
56 |
# define PL_ppaddr ppaddr |
57 |
# endif |
58 |
# ifndef call_sv |
59 |
# define call_sv perl_call_sv |
60 |
# endif |
61 |
# ifndef get_sv |
62 |
# define get_sv perl_get_sv |
63 |
# endif |
64 |
# ifndef get_cv |
65 |
# define get_cv perl_get_cv |
66 |
# endif |
67 |
# ifndef IS_PADGV |
68 |
# define IS_PADGV(v) 0 |
69 |
# endif |
70 |
# ifndef IS_PADCONST |
71 |
# define IS_PADCONST(v) 0 |
72 |
# endif |
73 |
#endif |
74 |
|
75 |
/* 5.8.7 */ |
76 |
#ifndef SvRV_set |
77 |
# define SvRV_set(s,v) SvRV(s) = (v) |
78 |
#endif |
79 |
|
80 |
#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
81 |
# undef CORO_STACKGUARD |
82 |
#endif |
83 |
|
84 |
#ifndef CORO_STACKGUARD |
85 |
# define CORO_STACKGUARD 0 |
86 |
#endif |
87 |
|
88 |
/* prefer perl internal functions over our own? */ |
89 |
#ifndef CORO_PREFER_PERL_FUNCTIONS |
90 |
# define CORO_PREFER_PERL_FUNCTIONS 0 |
91 |
#endif |
92 |
|
93 |
/* The next macros try to return the current stack pointer, in an as |
94 |
* portable way as possible. */ |
95 |
#define dSTACKLEVEL volatile char stacklevel |
96 |
#define STACKLEVEL ((void *)&stacklevel) |
97 |
|
98 |
#define IN_DESTRUCT (PL_main_cv == Nullcv) |
99 |
|
100 |
#if __GNUC__ >= 3 |
101 |
# define attribute(x) __attribute__(x) |
102 |
# define BARRIER __asm__ __volatile__ ("" : : : "memory") |
103 |
#else |
104 |
# define attribute(x) |
105 |
# define BARRIER |
106 |
#endif |
107 |
|
108 |
#define NOINLINE attribute ((noinline)) |
109 |
|
110 |
#include "CoroAPI.h" |
111 |
|
112 |
#ifdef USE_ITHREADS |
113 |
static perl_mutex coro_mutex; |
114 |
# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
115 |
# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
116 |
#else |
117 |
# define LOCK (void)0 |
118 |
# define UNLOCK (void)0 |
119 |
#endif |
120 |
|
121 |
/* helper storage struct for Coro::AIO */ |
122 |
struct io_state |
123 |
{ |
124 |
int errorno; |
125 |
I32 laststype; |
126 |
int laststatval; |
127 |
Stat_t statcache; |
128 |
}; |
129 |
|
130 |
static size_t coro_stacksize = CORO_STACKSIZE; |
131 |
static struct CoroAPI coroapi; |
132 |
static AV *main_mainstack; /* used to differentiate between $main and others */ |
133 |
static JMPENV *main_top_env; |
134 |
static HV *coro_state_stash, *coro_stash; |
135 |
static SV *coro_mortal; /* will be freed after next transfer */ |
136 |
|
137 |
/* async_pool helper stuff */ |
138 |
static SV *sv_pool_rss; |
139 |
static SV *sv_pool_size; |
140 |
static AV *av_async_pool; |
141 |
|
142 |
static struct coro_cctx *cctx_first; |
143 |
static int cctx_count, cctx_idle; |
144 |
|
145 |
enum { |
146 |
CC_MAPPED = 0x01, |
147 |
CC_NOREUSE = 0x02, /* throw this away after tracing */ |
148 |
CC_TRACE = 0x04, |
149 |
CC_TRACE_SUB = 0x08, /* trace sub calls */ |
150 |
CC_TRACE_LINE = 0x10, /* trace each statement */ |
151 |
CC_TRACE_ALL = CC_TRACE_SUB | CC_TRACE_LINE, |
152 |
}; |
153 |
|
154 |
/* this is a structure representing a c-level coroutine */ |
155 |
typedef struct coro_cctx { |
156 |
struct coro_cctx *next; |
157 |
|
158 |
/* the stack */ |
159 |
void *sptr; |
160 |
size_t ssize; |
161 |
|
162 |
/* cpu state */ |
163 |
void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
164 |
JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
165 |
JMPENV *top_env; |
166 |
coro_context cctx; |
167 |
|
168 |
#if CORO_USE_VALGRIND |
169 |
int valgrind_id; |
170 |
#endif |
171 |
unsigned char flags; |
172 |
} coro_cctx; |
173 |
|
174 |
enum { |
175 |
CF_RUNNING = 0x0001, /* coroutine is running */ |
176 |
CF_READY = 0x0002, /* coroutine is ready */ |
177 |
CF_NEW = 0x0004, /* has never been switched to */ |
178 |
CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
179 |
}; |
180 |
|
181 |
/* this is a structure representing a perl-level coroutine */ |
182 |
struct coro { |
183 |
/* the c coroutine allocated to this perl coroutine, if any */ |
184 |
coro_cctx *cctx; |
185 |
|
186 |
/* data associated with this coroutine (initial args) */ |
187 |
AV *args; |
188 |
int refcnt; |
189 |
int save; /* CORO_SAVE flags */ |
190 |
int flags; /* CF_ flags */ |
191 |
|
192 |
/* optionally saved, might be zero */ |
193 |
AV *defav; /* @_ */ |
194 |
SV *defsv; /* $_ */ |
195 |
SV *errsv; /* $@ */ |
196 |
GV *deffh; /* default filehandle */ |
197 |
SV *irssv; /* $/ */ |
198 |
SV *irssv_sv; /* real $/ cache */ |
199 |
|
200 |
#define VAR(name,type) type name; |
201 |
# include "state.h" |
202 |
#undef VAR |
203 |
|
204 |
/* statistics */ |
205 |
int usecount; /* number of switches to this coro */ |
206 |
|
207 |
/* coro process data */ |
208 |
int prio; |
209 |
|
210 |
/* linked list */ |
211 |
struct coro *next, *prev; |
212 |
HV *hv; /* the perl hash associated with this coro, if any */ |
213 |
}; |
214 |
|
215 |
typedef struct coro *Coro__State; |
216 |
typedef struct coro *Coro__State_or_hashref; |
217 |
|
218 |
/** Coro ********************************************************************/ |
219 |
|
220 |
#define PRIO_MAX 3 |
221 |
#define PRIO_HIGH 1 |
222 |
#define PRIO_NORMAL 0 |
223 |
#define PRIO_LOW -1 |
224 |
#define PRIO_IDLE -3 |
225 |
#define PRIO_MIN -4 |
226 |
|
227 |
/* for Coro.pm */ |
228 |
static SV *coro_current; |
229 |
static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
230 |
static int coro_nready; |
231 |
static struct coro *coro_first; |
232 |
|
233 |
/** lowlevel stuff **********************************************************/ |
234 |
|
235 |
static AV * |
236 |
coro_clone_padlist (pTHX_ CV *cv) |
237 |
{ |
238 |
AV *padlist = CvPADLIST (cv); |
239 |
AV *newpadlist, *newpad; |
240 |
|
241 |
newpadlist = newAV (); |
242 |
AvREAL_off (newpadlist); |
243 |
#if PERL_VERSION_ATLEAST (5,9,0) |
244 |
Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
245 |
#else |
246 |
Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
247 |
#endif |
248 |
newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
249 |
--AvFILLp (padlist); |
250 |
|
251 |
av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
252 |
av_store (newpadlist, 1, (SV *)newpad); |
253 |
|
254 |
return newpadlist; |
255 |
} |
256 |
|
257 |
static void |
258 |
free_padlist (pTHX_ AV *padlist) |
259 |
{ |
260 |
/* may be during global destruction */ |
261 |
if (SvREFCNT (padlist)) |
262 |
{ |
263 |
I32 i = AvFILLp (padlist); |
264 |
while (i >= 0) |
265 |
{ |
266 |
SV **svp = av_fetch (padlist, i--, FALSE); |
267 |
if (svp) |
268 |
{ |
269 |
SV *sv; |
270 |
while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
271 |
SvREFCNT_dec (sv); |
272 |
|
273 |
SvREFCNT_dec (*svp); |
274 |
} |
275 |
} |
276 |
|
277 |
SvREFCNT_dec ((SV*)padlist); |
278 |
} |
279 |
} |
280 |
|
281 |
static int |
282 |
coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
283 |
{ |
284 |
AV *padlist; |
285 |
AV *av = (AV *)mg->mg_obj; |
286 |
|
287 |
/* casting is fun. */ |
288 |
while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
289 |
free_padlist (aTHX_ padlist); |
290 |
|
291 |
SvREFCNT_dec (av); |
292 |
|
293 |
return 0; |
294 |
} |
295 |
|
296 |
#define PERL_MAGIC_coro PERL_MAGIC_ext |
297 |
|
298 |
static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
299 |
|
300 |
#define CORO_MAGIC(cv) \ |
301 |
SvMAGIC (cv) \ |
302 |
? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \ |
303 |
? SvMAGIC (cv) \ |
304 |
: mg_find ((SV *)cv, PERL_MAGIC_coro) \ |
305 |
: 0 |
306 |
|
307 |
static struct coro * |
308 |
SvSTATE_ (pTHX_ SV *coro) |
309 |
{ |
310 |
HV *stash; |
311 |
MAGIC *mg; |
312 |
|
313 |
if (SvROK (coro)) |
314 |
coro = SvRV (coro); |
315 |
|
316 |
if (SvTYPE (coro) != SVt_PVHV) |
317 |
croak ("Coro::State object required"); |
318 |
|
319 |
stash = SvSTASH (coro); |
320 |
if (stash != coro_stash && stash != coro_state_stash) |
321 |
{ |
322 |
/* very slow, but rare, check */ |
323 |
if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State")) |
324 |
croak ("Coro::State object required"); |
325 |
} |
326 |
|
327 |
mg = CORO_MAGIC (coro); |
328 |
return (struct coro *)mg->mg_ptr; |
329 |
} |
330 |
|
331 |
#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv)) |
332 |
|
333 |
/* the next two functions merely cache the padlists */ |
334 |
static void |
335 |
get_padlist (pTHX_ CV *cv) |
336 |
{ |
337 |
MAGIC *mg = CORO_MAGIC (cv); |
338 |
AV *av; |
339 |
|
340 |
if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
341 |
CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
342 |
else |
343 |
{ |
344 |
#if CORO_PREFER_PERL_FUNCTIONS |
345 |
/* this is probably cleaner, but also slower? */ |
346 |
CV *cp = Perl_cv_clone (cv); |
347 |
CvPADLIST (cv) = CvPADLIST (cp); |
348 |
CvPADLIST (cp) = 0; |
349 |
SvREFCNT_dec (cp); |
350 |
#else |
351 |
CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
352 |
#endif |
353 |
} |
354 |
} |
355 |
|
356 |
static void |
357 |
put_padlist (pTHX_ CV *cv) |
358 |
{ |
359 |
MAGIC *mg = CORO_MAGIC (cv); |
360 |
AV *av; |
361 |
|
362 |
if (!mg) |
363 |
{ |
364 |
sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
365 |
mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
366 |
mg->mg_virtual = &vtbl_coro; |
367 |
mg->mg_obj = (SV *)newAV (); |
368 |
} |
369 |
|
370 |
av = (AV *)mg->mg_obj; |
371 |
|
372 |
if (AvFILLp (av) >= AvMAX (av)) |
373 |
av_extend (av, AvMAX (av) + 1); |
374 |
|
375 |
AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
376 |
} |
377 |
|
378 |
/** load & save, init *******************************************************/ |
379 |
|
380 |
#define SB do { |
381 |
#define SE } while (0) |
382 |
|
383 |
#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
384 |
|
385 |
static void |
386 |
load_perl (pTHX_ Coro__State c) |
387 |
{ |
388 |
#define VAR(name,type) PL_ ## name = c->name; |
389 |
# include "state.h" |
390 |
#undef VAR |
391 |
|
392 |
if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
393 |
if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
394 |
if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
395 |
if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh); |
396 |
|
397 |
if (c->irssv) |
398 |
{ |
399 |
if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv)) |
400 |
{ |
401 |
SvREFCNT_dec (c->irssv); |
402 |
c->irssv = 0; |
403 |
} |
404 |
else |
405 |
{ |
406 |
REPLACE_SV (PL_rs, c->irssv); |
407 |
if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0); |
408 |
sv_setsv (c->irssv_sv, PL_rs); |
409 |
} |
410 |
} |
411 |
|
412 |
{ |
413 |
dSP; |
414 |
CV *cv; |
415 |
|
416 |
/* now do the ugly restore mess */ |
417 |
while ((cv = (CV *)POPs)) |
418 |
{ |
419 |
put_padlist (aTHX_ cv); /* mark this padlist as available */ |
420 |
CvDEPTH (cv) = PTR2IV (POPs); |
421 |
CvPADLIST (cv) = (AV *)POPs; |
422 |
} |
423 |
|
424 |
PUTBACK; |
425 |
} |
426 |
} |
427 |
|
428 |
static void |
429 |
save_perl (pTHX_ Coro__State c) |
430 |
{ |
431 |
{ |
432 |
dSP; |
433 |
I32 cxix = cxstack_ix; |
434 |
PERL_CONTEXT *ccstk = cxstack; |
435 |
PERL_SI *top_si = PL_curstackinfo; |
436 |
|
437 |
/* |
438 |
* the worst thing you can imagine happens first - we have to save |
439 |
* (and reinitialize) all cv's in the whole callchain :( |
440 |
*/ |
441 |
|
442 |
XPUSHs (Nullsv); |
443 |
/* this loop was inspired by pp_caller */ |
444 |
for (;;) |
445 |
{ |
446 |
while (cxix >= 0) |
447 |
{ |
448 |
PERL_CONTEXT *cx = &ccstk[cxix--]; |
449 |
|
450 |
if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT) |
451 |
{ |
452 |
CV *cv = cx->blk_sub.cv; |
453 |
|
454 |
if (CvDEPTH (cv)) |
455 |
{ |
456 |
EXTEND (SP, 3); |
457 |
PUSHs ((SV *)CvPADLIST (cv)); |
458 |
PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
459 |
PUSHs ((SV *)cv); |
460 |
|
461 |
CvDEPTH (cv) = 0; |
462 |
get_padlist (aTHX_ cv); |
463 |
} |
464 |
} |
465 |
} |
466 |
|
467 |
if (top_si->si_type == PERLSI_MAIN) |
468 |
break; |
469 |
|
470 |
top_si = top_si->si_prev; |
471 |
ccstk = top_si->si_cxstack; |
472 |
cxix = top_si->si_cxix; |
473 |
} |
474 |
|
475 |
PUTBACK; |
476 |
} |
477 |
|
478 |
c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
479 |
c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
480 |
c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
481 |
c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0; |
482 |
c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0; |
483 |
|
484 |
#define VAR(name,type)c->name = PL_ ## name; |
485 |
# include "state.h" |
486 |
#undef VAR |
487 |
} |
488 |
|
489 |
/* |
490 |
* allocate various perl stacks. This is an exact copy |
491 |
* of perl.c:init_stacks, except that it uses less memory |
492 |
* on the (sometimes correct) assumption that coroutines do |
493 |
* not usually need a lot of stackspace. |
494 |
*/ |
495 |
#if CORO_PREFER_PERL_FUNCTIONS |
496 |
# define coro_init_stacks init_stacks |
497 |
#else |
498 |
static void |
499 |
coro_init_stacks (pTHX) |
500 |
{ |
501 |
PL_curstackinfo = new_stackinfo(64, 6); |
502 |
PL_curstackinfo->si_type = PERLSI_MAIN; |
503 |
PL_curstack = PL_curstackinfo->si_stack; |
504 |
PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
505 |
|
506 |
PL_stack_base = AvARRAY(PL_curstack); |
507 |
PL_stack_sp = PL_stack_base; |
508 |
PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
509 |
|
510 |
New(50,PL_tmps_stack,64,SV*); |
511 |
PL_tmps_floor = -1; |
512 |
PL_tmps_ix = -1; |
513 |
PL_tmps_max = 64; |
514 |
|
515 |
New(54,PL_markstack,16,I32); |
516 |
PL_markstack_ptr = PL_markstack; |
517 |
PL_markstack_max = PL_markstack + 16; |
518 |
|
519 |
#ifdef SET_MARK_OFFSET |
520 |
SET_MARK_OFFSET; |
521 |
#endif |
522 |
|
523 |
New(54,PL_scopestack,16,I32); |
524 |
PL_scopestack_ix = 0; |
525 |
PL_scopestack_max = 16; |
526 |
|
527 |
New(54,PL_savestack,64,ANY); |
528 |
PL_savestack_ix = 0; |
529 |
PL_savestack_max = 64; |
530 |
|
531 |
#if !PERL_VERSION_ATLEAST (5,9,0) |
532 |
New(54,PL_retstack,4,OP*); |
533 |
PL_retstack_ix = 0; |
534 |
PL_retstack_max = 4; |
535 |
#endif |
536 |
} |
537 |
#endif |
538 |
|
539 |
/* |
540 |
* destroy the stacks, the callchain etc... |
541 |
*/ |
542 |
static void |
543 |
coro_destroy_stacks (pTHX) |
544 |
{ |
545 |
if (!IN_DESTRUCT) |
546 |
{ |
547 |
/* restore all saved variables and stuff */ |
548 |
LEAVE_SCOPE (0); |
549 |
assert (PL_tmps_floor == -1); |
550 |
|
551 |
/* free all temporaries */ |
552 |
FREETMPS; |
553 |
assert (PL_tmps_ix == -1); |
554 |
|
555 |
/* unwind all extra stacks */ |
556 |
POPSTACK_TO (PL_mainstack); |
557 |
|
558 |
/* unwind main stack */ |
559 |
dounwind (-1); |
560 |
} |
561 |
|
562 |
while (PL_curstackinfo->si_next) |
563 |
PL_curstackinfo = PL_curstackinfo->si_next; |
564 |
|
565 |
while (PL_curstackinfo) |
566 |
{ |
567 |
PERL_SI *p = PL_curstackinfo->si_prev; |
568 |
|
569 |
if (!IN_DESTRUCT) |
570 |
SvREFCNT_dec (PL_curstackinfo->si_stack); |
571 |
|
572 |
Safefree (PL_curstackinfo->si_cxstack); |
573 |
Safefree (PL_curstackinfo); |
574 |
PL_curstackinfo = p; |
575 |
} |
576 |
|
577 |
Safefree (PL_tmps_stack); |
578 |
Safefree (PL_markstack); |
579 |
Safefree (PL_scopestack); |
580 |
Safefree (PL_savestack); |
581 |
#if !PERL_VERSION_ATLEAST (5,9,0) |
582 |
Safefree (PL_retstack); |
583 |
#endif |
584 |
} |
585 |
|
586 |
static size_t |
587 |
coro_rss (pTHX_ struct coro *coro) |
588 |
{ |
589 |
size_t rss = sizeof (coro); |
590 |
|
591 |
if (coro->mainstack) |
592 |
{ |
593 |
if (coro->flags & CF_RUNNING) |
594 |
{ |
595 |
#define VAR(name,type)coro->name = PL_ ## name; |
596 |
# include "state.h" |
597 |
#undef VAR |
598 |
} |
599 |
|
600 |
rss += sizeof (coro->curstackinfo); |
601 |
rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *); |
602 |
rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT); |
603 |
rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *); |
604 |
rss += coro->tmps_max * sizeof (SV *); |
605 |
rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32); |
606 |
rss += coro->scopestack_max * sizeof (I32); |
607 |
rss += coro->savestack_max * sizeof (ANY); |
608 |
|
609 |
#if !PERL_VERSION_ATLEAST (5,9,0) |
610 |
rss += coro->retstack_max * sizeof (OP *); |
611 |
#endif |
612 |
} |
613 |
|
614 |
return rss; |
615 |
} |
616 |
|
617 |
/** coroutine stack handling ************************************************/ |
618 |
|
619 |
static void |
620 |
setup_coro (pTHX_ struct coro *coro) |
621 |
{ |
622 |
/* |
623 |
* emulate part of the perl startup here. |
624 |
*/ |
625 |
coro_init_stacks (aTHX); |
626 |
|
627 |
PL_runops = RUNOPS_DEFAULT; |
628 |
PL_curcop = &PL_compiling; |
629 |
PL_in_eval = EVAL_NULL; |
630 |
PL_comppad = 0; |
631 |
PL_curpm = 0; |
632 |
PL_localizing = 0; |
633 |
PL_dirty = 0; |
634 |
PL_restartop = 0; |
635 |
|
636 |
{ |
637 |
dSP; |
638 |
LOGOP myop; |
639 |
|
640 |
SvREFCNT_dec (GvAV (PL_defgv)); |
641 |
GvAV (PL_defgv) = coro->args; coro->args = 0; |
642 |
|
643 |
Zero (&myop, 1, LOGOP); |
644 |
myop.op_next = Nullop; |
645 |
myop.op_flags = OPf_WANT_VOID; |
646 |
|
647 |
PUSHMARK (SP); |
648 |
XPUSHs (av_shift (GvAV (PL_defgv))); |
649 |
PUTBACK; |
650 |
PL_op = (OP *)&myop; |
651 |
PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
652 |
SPAGAIN; |
653 |
} |
654 |
|
655 |
ENTER; /* necessary e.g. for dounwind */ |
656 |
} |
657 |
|
658 |
static void |
659 |
free_coro_mortal (pTHX) |
660 |
{ |
661 |
if (coro_mortal) |
662 |
{ |
663 |
SvREFCNT_dec (coro_mortal); |
664 |
coro_mortal = 0; |
665 |
} |
666 |
} |
667 |
|
668 |
static int |
669 |
runops_trace (pTHX) |
670 |
{ |
671 |
COP *oldcop = 0; |
672 |
int oldcxix = -2; |
673 |
struct coro *coro = SvSTATE (coro_current); /* trace cctx is tied to specific coro */ |
674 |
coro_cctx *cctx = coro->cctx; |
675 |
|
676 |
while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX))) |
677 |
{ |
678 |
PERL_ASYNC_CHECK (); |
679 |
|
680 |
if (cctx->flags & CC_TRACE_ALL) |
681 |
{ |
682 |
if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB) |
683 |
{ |
684 |
PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
685 |
SV **bot, **top; |
686 |
AV *av = newAV (); /* return values */ |
687 |
SV **cb; |
688 |
dSP; |
689 |
|
690 |
GV *gv = CvGV (cx->blk_sub.cv); |
691 |
SV *fullname = sv_2mortal (newSV (0)); |
692 |
if (isGV (gv)) |
693 |
gv_efullname3 (fullname, gv, 0); |
694 |
|
695 |
bot = PL_stack_base + cx->blk_oldsp + 1; |
696 |
top = cx->blk_gimme == G_ARRAY ? SP + 1 |
697 |
: cx->blk_gimme == G_SCALAR ? bot + 1 |
698 |
: bot; |
699 |
|
700 |
while (bot < top) |
701 |
av_push (av, SvREFCNT_inc (*bot++)); |
702 |
|
703 |
PL_runops = RUNOPS_DEFAULT; |
704 |
ENTER; |
705 |
SAVETMPS; |
706 |
EXTEND (SP, 3); |
707 |
PUSHMARK (SP); |
708 |
PUSHs (&PL_sv_no); |
709 |
PUSHs (fullname); |
710 |
PUSHs (sv_2mortal (newRV_noinc ((SV *)av))); |
711 |
PUTBACK; |
712 |
cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
713 |
if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
714 |
SPAGAIN; |
715 |
FREETMPS; |
716 |
LEAVE; |
717 |
PL_runops = runops_trace; |
718 |
} |
719 |
|
720 |
if (oldcop != PL_curcop) |
721 |
{ |
722 |
oldcop = PL_curcop; |
723 |
|
724 |
if (PL_curcop != &PL_compiling) |
725 |
{ |
726 |
SV **cb; |
727 |
|
728 |
if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB) |
729 |
{ |
730 |
PERL_CONTEXT *cx = &cxstack[cxstack_ix]; |
731 |
|
732 |
if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix) |
733 |
{ |
734 |
runops_proc_t old_runops = PL_runops; |
735 |
dSP; |
736 |
GV *gv = CvGV (cx->blk_sub.cv); |
737 |
SV *fullname = sv_2mortal (newSV (0)); |
738 |
|
739 |
if (isGV (gv)) |
740 |
gv_efullname3 (fullname, gv, 0); |
741 |
|
742 |
PL_runops = RUNOPS_DEFAULT; |
743 |
ENTER; |
744 |
SAVETMPS; |
745 |
EXTEND (SP, 3); |
746 |
PUSHMARK (SP); |
747 |
PUSHs (&PL_sv_yes); |
748 |
PUSHs (fullname); |
749 |
PUSHs (cx->blk_sub.hasargs ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef); |
750 |
PUTBACK; |
751 |
cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0); |
752 |
if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
753 |
SPAGAIN; |
754 |
FREETMPS; |
755 |
LEAVE; |
756 |
PL_runops = runops_trace; |
757 |
} |
758 |
|
759 |
oldcxix = cxstack_ix; |
760 |
} |
761 |
|
762 |
if (cctx->flags & CC_TRACE_LINE) |
763 |
{ |
764 |
dSP; |
765 |
|
766 |
PL_runops = RUNOPS_DEFAULT; |
767 |
ENTER; |
768 |
SAVETMPS; |
769 |
EXTEND (SP, 3); |
770 |
PL_runops = RUNOPS_DEFAULT; |
771 |
PUSHMARK (SP); |
772 |
PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0))); |
773 |
PUSHs (sv_2mortal (newSViv (CopLINE (oldcop)))); |
774 |
PUTBACK; |
775 |
cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_line_cb", sizeof ("_trace_line_cb") - 1, 0); |
776 |
if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
777 |
SPAGAIN; |
778 |
FREETMPS; |
779 |
LEAVE; |
780 |
PL_runops = runops_trace; |
781 |
} |
782 |
} |
783 |
} |
784 |
} |
785 |
} |
786 |
|
787 |
TAINT_NOT; |
788 |
return 0; |
789 |
} |
790 |
|
791 |
/* inject a fake call to Coro::State::_cctx_init into the execution */ |
792 |
/* _cctx_init should be careful, as it could be called at almost any time */ |
793 |
/* during execution of a perl program */ |
794 |
static void NOINLINE |
795 |
prepare_cctx (pTHX_ coro_cctx *cctx) |
796 |
{ |
797 |
dSP; |
798 |
LOGOP myop; |
799 |
|
800 |
PL_top_env = &PL_start_env; |
801 |
|
802 |
if (cctx->flags & CC_TRACE) |
803 |
PL_runops = runops_trace; |
804 |
|
805 |
Zero (&myop, 1, LOGOP); |
806 |
myop.op_next = PL_op; |
807 |
myop.op_flags = OPf_WANT_VOID | OPf_STACKED; |
808 |
|
809 |
PUSHMARK (SP); |
810 |
EXTEND (SP, 2); |
811 |
PUSHs (sv_2mortal (newSViv (PTR2IV (cctx)))); |
812 |
PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE)); |
813 |
PUTBACK; |
814 |
PL_op = (OP *)&myop; |
815 |
PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
816 |
SPAGAIN; |
817 |
} |
818 |
|
819 |
/* |
820 |
* this is a _very_ stripped down perl interpreter ;) |
821 |
*/ |
822 |
static void |
823 |
coro_run (void *arg) |
824 |
{ |
825 |
dTHX; |
826 |
|
827 |
/* coro_run is the alternative tail of transfer(), so unlock here. */ |
828 |
UNLOCK; |
829 |
|
830 |
/* we now skip the entersub that lead to transfer() */ |
831 |
PL_op = PL_op->op_next; |
832 |
|
833 |
/* inject a fake subroutine call to cctx_init */ |
834 |
prepare_cctx (aTHX_ (coro_cctx *)arg); |
835 |
|
836 |
/* somebody or something will hit me for both perl_run and PL_restartop */ |
837 |
PL_restartop = PL_op; |
838 |
perl_run (PL_curinterp); |
839 |
|
840 |
/* |
841 |
* If perl-run returns we assume exit() was being called or the coro |
842 |
* fell off the end, which seems to be the only valid (non-bug) |
843 |
* reason for perl_run to return. We try to exit by jumping to the |
844 |
* bootstrap-time "top" top_env, as we cannot restore the "main" |
845 |
* coroutine as Coro has no such concept |
846 |
*/ |
847 |
PL_top_env = main_top_env; |
848 |
JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */ |
849 |
} |
850 |
|
851 |
static coro_cctx * |
852 |
cctx_new () |
853 |
{ |
854 |
coro_cctx *cctx; |
855 |
void *stack_start; |
856 |
size_t stack_size; |
857 |
|
858 |
++cctx_count; |
859 |
|
860 |
Newz (0, cctx, 1, coro_cctx); |
861 |
|
862 |
#if HAVE_MMAP |
863 |
|
864 |
cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE; |
865 |
/* mmap supposedly does allocate-on-write for us */ |
866 |
cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
867 |
|
868 |
if (cctx->sptr != (void *)-1) |
869 |
{ |
870 |
# if CORO_STACKGUARD |
871 |
mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE); |
872 |
# endif |
873 |
stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr; |
874 |
stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE; |
875 |
cctx->flags |= CC_MAPPED; |
876 |
} |
877 |
else |
878 |
#endif |
879 |
{ |
880 |
cctx->ssize = coro_stacksize * (long)sizeof (long); |
881 |
New (0, cctx->sptr, coro_stacksize, long); |
882 |
|
883 |
if (!cctx->sptr) |
884 |
{ |
885 |
perror ("FATAL: unable to allocate stack for coroutine"); |
886 |
_exit (EXIT_FAILURE); |
887 |
} |
888 |
|
889 |
stack_start = cctx->sptr; |
890 |
stack_size = cctx->ssize; |
891 |
} |
892 |
|
893 |
REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size); |
894 |
coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size); |
895 |
|
896 |
return cctx; |
897 |
} |
898 |
|
899 |
static void |
900 |
cctx_destroy (coro_cctx *cctx) |
901 |
{ |
902 |
if (!cctx) |
903 |
return; |
904 |
|
905 |
--cctx_count; |
906 |
|
907 |
#if CORO_USE_VALGRIND |
908 |
VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
909 |
#endif |
910 |
|
911 |
#if HAVE_MMAP |
912 |
if (cctx->flags & CC_MAPPED) |
913 |
munmap (cctx->sptr, cctx->ssize); |
914 |
else |
915 |
#endif |
916 |
Safefree (cctx->sptr); |
917 |
|
918 |
Safefree (cctx); |
919 |
} |
920 |
|
921 |
static coro_cctx * |
922 |
cctx_get (pTHX) |
923 |
{ |
924 |
while (cctx_first) |
925 |
{ |
926 |
coro_cctx *cctx = cctx_first; |
927 |
cctx_first = cctx->next; |
928 |
--cctx_idle; |
929 |
|
930 |
if (cctx->ssize >= coro_stacksize && !(cctx->flags & CC_NOREUSE)) |
931 |
return cctx; |
932 |
|
933 |
cctx_destroy (cctx); |
934 |
} |
935 |
|
936 |
return cctx_new (); |
937 |
} |
938 |
|
939 |
static void |
940 |
cctx_put (coro_cctx *cctx) |
941 |
{ |
942 |
/* free another cctx if overlimit */ |
943 |
if (cctx_idle >= MAX_IDLE_CCTX) |
944 |
{ |
945 |
coro_cctx *first = cctx_first; |
946 |
cctx_first = first->next; |
947 |
--cctx_idle; |
948 |
|
949 |
cctx_destroy (first); |
950 |
} |
951 |
|
952 |
++cctx_idle; |
953 |
cctx->next = cctx_first; |
954 |
cctx_first = cctx; |
955 |
} |
956 |
|
957 |
/** coroutine switching *****************************************************/ |
958 |
|
959 |
static void NOINLINE |
960 |
transfer_check (pTHX_ struct coro *prev, struct coro *next) |
961 |
{ |
962 |
if (prev != next) |
963 |
{ |
964 |
if (!(prev->flags & (CF_RUNNING | CF_NEW))) |
965 |
croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states"); |
966 |
|
967 |
if (next->flags & CF_RUNNING) |
968 |
croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
969 |
|
970 |
if (next->flags & CF_DESTROYED) |
971 |
croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
972 |
|
973 |
if (PL_lex_state != LEX_NOTPARSING) |
974 |
croak ("Coro::State::transfer called while parsing, but this is not supported"); |
975 |
} |
976 |
} |
977 |
|
978 |
/* always use the TRANSFER macro */ |
979 |
static void NOINLINE |
980 |
transfer (pTHX_ struct coro *prev, struct coro *next) |
981 |
{ |
982 |
dSTACKLEVEL; |
983 |
|
984 |
/* sometimes transfer is only called to set idle_sp */ |
985 |
if (!next) |
986 |
{ |
987 |
((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
988 |
assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
989 |
} |
990 |
else if (prev != next) |
991 |
{ |
992 |
coro_cctx *prev__cctx; |
993 |
|
994 |
if (prev->flags & CF_NEW) |
995 |
{ |
996 |
/* create a new empty context */ |
997 |
Newz (0, prev->cctx, 1, coro_cctx); |
998 |
prev->flags &= ~CF_NEW; |
999 |
prev->flags |= CF_RUNNING; |
1000 |
} |
1001 |
|
1002 |
prev->flags &= ~CF_RUNNING; |
1003 |
next->flags |= CF_RUNNING; |
1004 |
|
1005 |
LOCK; |
1006 |
|
1007 |
if (next->flags & CF_NEW) |
1008 |
{ |
1009 |
/* need to start coroutine */ |
1010 |
next->flags &= ~CF_NEW; |
1011 |
/* first get rid of the old state */ |
1012 |
save_perl (aTHX_ prev); |
1013 |
/* setup coroutine call */ |
1014 |
setup_coro (aTHX_ next); |
1015 |
} |
1016 |
else |
1017 |
{ |
1018 |
/* coroutine already started */ |
1019 |
save_perl (aTHX_ prev); |
1020 |
load_perl (aTHX_ next); |
1021 |
} |
1022 |
|
1023 |
prev__cctx = prev->cctx; |
1024 |
|
1025 |
/* possibly "free" the cctx */ |
1026 |
if (prev__cctx->idle_sp == STACKLEVEL && !(prev__cctx->flags & CC_TRACE)) |
1027 |
{ |
1028 |
/* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
1029 |
assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
1030 |
|
1031 |
prev->cctx = 0; |
1032 |
|
1033 |
cctx_put (prev__cctx); |
1034 |
} |
1035 |
|
1036 |
++next->usecount; |
1037 |
|
1038 |
if (!next->cctx) |
1039 |
next->cctx = cctx_get (aTHX); |
1040 |
|
1041 |
if (prev__cctx != next->cctx) |
1042 |
{ |
1043 |
prev__cctx->top_env = PL_top_env; |
1044 |
PL_top_env = next->cctx->top_env; |
1045 |
coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
1046 |
} |
1047 |
|
1048 |
free_coro_mortal (aTHX); |
1049 |
UNLOCK; |
1050 |
} |
1051 |
} |
1052 |
|
1053 |
struct transfer_args |
1054 |
{ |
1055 |
struct coro *prev, *next; |
1056 |
}; |
1057 |
|
1058 |
#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next) |
1059 |
#define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next) |
1060 |
|
1061 |
/** high level stuff ********************************************************/ |
1062 |
|
1063 |
static int |
1064 |
coro_state_destroy (pTHX_ struct coro *coro) |
1065 |
{ |
1066 |
if (coro->flags & CF_DESTROYED) |
1067 |
return 0; |
1068 |
|
1069 |
coro->flags |= CF_DESTROYED; |
1070 |
|
1071 |
if (coro->flags & CF_READY) |
1072 |
{ |
1073 |
/* reduce nready, as destroying a ready coro effectively unreadies it */ |
1074 |
/* alternative: look through all ready queues and remove the coro */ |
1075 |
LOCK; |
1076 |
--coro_nready; |
1077 |
UNLOCK; |
1078 |
} |
1079 |
else |
1080 |
coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
1081 |
|
1082 |
if (coro->mainstack && coro->mainstack != main_mainstack) |
1083 |
{ |
1084 |
struct coro temp; |
1085 |
|
1086 |
assert (!(coro->flags & CF_RUNNING)); |
1087 |
|
1088 |
Zero (&temp, 1, struct coro); |
1089 |
temp.save = CORO_SAVE_ALL; |
1090 |
|
1091 |
if (coro->flags & CF_RUNNING) |
1092 |
croak ("FATAL: tried to destroy currently running coroutine"); |
1093 |
|
1094 |
save_perl (aTHX_ &temp); |
1095 |
load_perl (aTHX_ coro); |
1096 |
|
1097 |
coro_destroy_stacks (aTHX); |
1098 |
|
1099 |
load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */ |
1100 |
|
1101 |
coro->mainstack = 0; |
1102 |
} |
1103 |
|
1104 |
cctx_destroy (coro->cctx); |
1105 |
SvREFCNT_dec (coro->args); |
1106 |
|
1107 |
if (coro->next) coro->next->prev = coro->prev; |
1108 |
if (coro->prev) coro->prev->next = coro->next; |
1109 |
if (coro == coro_first) coro_first = coro->next; |
1110 |
|
1111 |
return 1; |
1112 |
} |
1113 |
|
1114 |
static int |
1115 |
coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
1116 |
{ |
1117 |
struct coro *coro = (struct coro *)mg->mg_ptr; |
1118 |
mg->mg_ptr = 0; |
1119 |
|
1120 |
coro->hv = 0; |
1121 |
|
1122 |
if (--coro->refcnt < 0) |
1123 |
{ |
1124 |
coro_state_destroy (aTHX_ coro); |
1125 |
Safefree (coro); |
1126 |
} |
1127 |
|
1128 |
return 0; |
1129 |
} |
1130 |
|
1131 |
static int |
1132 |
coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params) |
1133 |
{ |
1134 |
struct coro *coro = (struct coro *)mg->mg_ptr; |
1135 |
|
1136 |
++coro->refcnt; |
1137 |
|
1138 |
return 0; |
1139 |
} |
1140 |
|
1141 |
static MGVTBL coro_state_vtbl = { |
1142 |
0, 0, 0, 0, |
1143 |
coro_state_free, |
1144 |
0, |
1145 |
#ifdef MGf_DUP |
1146 |
coro_state_dup, |
1147 |
#else |
1148 |
# define MGf_DUP 0 |
1149 |
#endif |
1150 |
}; |
1151 |
|
1152 |
static void |
1153 |
prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv) |
1154 |
{ |
1155 |
ta->prev = SvSTATE (prev_sv); |
1156 |
ta->next = SvSTATE (next_sv); |
1157 |
TRANSFER_CHECK (*ta); |
1158 |
} |
1159 |
|
1160 |
static void |
1161 |
api_transfer (SV *prev_sv, SV *next_sv) |
1162 |
{ |
1163 |
dTHX; |
1164 |
struct transfer_args ta; |
1165 |
|
1166 |
prepare_transfer (aTHX_ &ta, prev_sv, next_sv); |
1167 |
TRANSFER (ta); |
1168 |
} |
1169 |
|
1170 |
static int |
1171 |
api_save (SV *coro_sv, int new_save) |
1172 |
{ |
1173 |
dTHX; |
1174 |
struct coro *coro = SvSTATE (coro_sv); |
1175 |
int old_save = coro->save; |
1176 |
|
1177 |
if (new_save >= 0) |
1178 |
coro->save = new_save; |
1179 |
|
1180 |
return old_save; |
1181 |
} |
1182 |
|
1183 |
/** Coro ********************************************************************/ |
1184 |
|
1185 |
static void |
1186 |
coro_enq (pTHX_ SV *coro_sv) |
1187 |
{ |
1188 |
av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
1189 |
} |
1190 |
|
1191 |
static SV * |
1192 |
coro_deq (pTHX_ int min_prio) |
1193 |
{ |
1194 |
int prio = PRIO_MAX - PRIO_MIN; |
1195 |
|
1196 |
min_prio -= PRIO_MIN; |
1197 |
if (min_prio < 0) |
1198 |
min_prio = 0; |
1199 |
|
1200 |
for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
1201 |
if (AvFILLp (coro_ready [prio]) >= 0) |
1202 |
return av_shift (coro_ready [prio]); |
1203 |
|
1204 |
return 0; |
1205 |
} |
1206 |
|
1207 |
static int |
1208 |
api_ready (SV *coro_sv) |
1209 |
{ |
1210 |
dTHX; |
1211 |
struct coro *coro; |
1212 |
|
1213 |
if (SvROK (coro_sv)) |
1214 |
coro_sv = SvRV (coro_sv); |
1215 |
|
1216 |
coro = SvSTATE (coro_sv); |
1217 |
|
1218 |
if (coro->flags & CF_READY) |
1219 |
return 0; |
1220 |
|
1221 |
coro->flags |= CF_READY; |
1222 |
|
1223 |
LOCK; |
1224 |
coro_enq (aTHX_ SvREFCNT_inc (coro_sv)); |
1225 |
++coro_nready; |
1226 |
UNLOCK; |
1227 |
|
1228 |
return 1; |
1229 |
} |
1230 |
|
1231 |
static int |
1232 |
api_is_ready (SV *coro_sv) |
1233 |
{ |
1234 |
dTHX; |
1235 |
return !!(SvSTATE (coro_sv)->flags & CF_READY); |
1236 |
} |
1237 |
|
1238 |
static void |
1239 |
prepare_schedule (pTHX_ struct transfer_args *ta) |
1240 |
{ |
1241 |
SV *prev_sv, *next_sv; |
1242 |
|
1243 |
for (;;) |
1244 |
{ |
1245 |
LOCK; |
1246 |
next_sv = coro_deq (aTHX_ PRIO_MIN); |
1247 |
|
1248 |
/* nothing to schedule: call the idle handler */ |
1249 |
if (!next_sv) |
1250 |
{ |
1251 |
dSP; |
1252 |
UNLOCK; |
1253 |
|
1254 |
ENTER; |
1255 |
SAVETMPS; |
1256 |
|
1257 |
PUSHMARK (SP); |
1258 |
PUTBACK; |
1259 |
call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
1260 |
|
1261 |
FREETMPS; |
1262 |
LEAVE; |
1263 |
continue; |
1264 |
} |
1265 |
|
1266 |
ta->next = SvSTATE (next_sv); |
1267 |
|
1268 |
/* cannot transfer to destroyed coros, skip and look for next */ |
1269 |
if (ta->next->flags & CF_DESTROYED) |
1270 |
{ |
1271 |
UNLOCK; |
1272 |
SvREFCNT_dec (next_sv); |
1273 |
/* coro_nready is already taken care of by destroy */ |
1274 |
continue; |
1275 |
} |
1276 |
|
1277 |
--coro_nready; |
1278 |
UNLOCK; |
1279 |
break; |
1280 |
} |
1281 |
|
1282 |
/* free this only after the transfer */ |
1283 |
prev_sv = SvRV (coro_current); |
1284 |
ta->prev = SvSTATE (prev_sv); |
1285 |
TRANSFER_CHECK (*ta); |
1286 |
assert (ta->next->flags & CF_READY); |
1287 |
ta->next->flags &= ~CF_READY; |
1288 |
SvRV_set (coro_current, next_sv); |
1289 |
|
1290 |
LOCK; |
1291 |
free_coro_mortal (aTHX); |
1292 |
coro_mortal = prev_sv; |
1293 |
UNLOCK; |
1294 |
} |
1295 |
|
1296 |
static void |
1297 |
prepare_cede (pTHX_ struct transfer_args *ta) |
1298 |
{ |
1299 |
api_ready (coro_current); |
1300 |
prepare_schedule (aTHX_ ta); |
1301 |
} |
1302 |
|
1303 |
static int |
1304 |
prepare_cede_notself (pTHX_ struct transfer_args *ta) |
1305 |
{ |
1306 |
if (coro_nready) |
1307 |
{ |
1308 |
SV *prev = SvRV (coro_current); |
1309 |
prepare_schedule (aTHX_ ta); |
1310 |
api_ready (prev); |
1311 |
return 1; |
1312 |
} |
1313 |
else |
1314 |
return 0; |
1315 |
} |
1316 |
|
1317 |
static void |
1318 |
api_schedule (void) |
1319 |
{ |
1320 |
dTHX; |
1321 |
struct transfer_args ta; |
1322 |
|
1323 |
prepare_schedule (aTHX_ &ta); |
1324 |
TRANSFER (ta); |
1325 |
} |
1326 |
|
1327 |
static int |
1328 |
api_cede (void) |
1329 |
{ |
1330 |
dTHX; |
1331 |
struct transfer_args ta; |
1332 |
|
1333 |
prepare_cede (aTHX_ &ta); |
1334 |
|
1335 |
if (ta.prev != ta.next) |
1336 |
{ |
1337 |
TRANSFER (ta); |
1338 |
return 1; |
1339 |
} |
1340 |
else |
1341 |
return 0; |
1342 |
} |
1343 |
|
1344 |
static int |
1345 |
api_cede_notself (void) |
1346 |
{ |
1347 |
dTHX; |
1348 |
struct transfer_args ta; |
1349 |
|
1350 |
if (prepare_cede_notself (aTHX_ &ta)) |
1351 |
{ |
1352 |
TRANSFER (ta); |
1353 |
return 1; |
1354 |
} |
1355 |
else |
1356 |
return 0; |
1357 |
} |
1358 |
|
1359 |
static void |
1360 |
api_trace (SV *coro_sv, int flags) |
1361 |
{ |
1362 |
dTHX; |
1363 |
struct coro *coro = SvSTATE (coro_sv); |
1364 |
|
1365 |
if (flags & CC_TRACE) |
1366 |
{ |
1367 |
if (!coro->cctx) |
1368 |
coro->cctx = cctx_new (); |
1369 |
else if (!(coro->cctx->flags & CC_TRACE)) |
1370 |
croak ("cannot enable tracing on coroutine with custom stack"); |
1371 |
|
1372 |
coro->cctx->flags |= CC_NOREUSE | (flags & (CC_TRACE | CC_TRACE_ALL)); |
1373 |
} |
1374 |
else if (coro->cctx && coro->cctx->flags & CC_TRACE) |
1375 |
{ |
1376 |
coro->cctx->flags &= ~(CC_TRACE | CC_TRACE_ALL); |
1377 |
|
1378 |
if (coro->flags & CF_RUNNING) |
1379 |
PL_runops = RUNOPS_DEFAULT; |
1380 |
else |
1381 |
coro->runops = RUNOPS_DEFAULT; |
1382 |
} |
1383 |
} |
1384 |
|
1385 |
MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_ |
1386 |
|
1387 |
PROTOTYPES: DISABLE |
1388 |
|
1389 |
BOOT: |
1390 |
{ |
1391 |
#ifdef USE_ITHREADS |
1392 |
MUTEX_INIT (&coro_mutex); |
1393 |
#endif |
1394 |
BOOT_PAGESIZE; |
1395 |
|
1396 |
coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
1397 |
|
1398 |
newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE)); |
1399 |
newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB)); |
1400 |
newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE)); |
1401 |
newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL)); |
1402 |
|
1403 |
newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV)); |
1404 |
newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV)); |
1405 |
newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV)); |
1406 |
newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV)); |
1407 |
newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH)); |
1408 |
newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF)); |
1409 |
newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL)); |
1410 |
|
1411 |
main_mainstack = PL_mainstack; |
1412 |
main_top_env = PL_top_env; |
1413 |
|
1414 |
while (main_top_env->je_prev) |
1415 |
main_top_env = main_top_env->je_prev; |
1416 |
|
1417 |
coroapi.ver = CORO_API_VERSION; |
1418 |
coroapi.transfer = api_transfer; |
1419 |
|
1420 |
assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
1421 |
} |
1422 |
|
1423 |
SV * |
1424 |
new (char *klass, ...) |
1425 |
CODE: |
1426 |
{ |
1427 |
struct coro *coro; |
1428 |
HV *hv; |
1429 |
int i; |
1430 |
|
1431 |
Newz (0, coro, 1, struct coro); |
1432 |
coro->args = newAV (); |
1433 |
coro->save = CORO_SAVE_DEF; |
1434 |
coro->flags = CF_NEW; |
1435 |
|
1436 |
if (coro_first) coro_first->prev = coro; |
1437 |
coro->next = coro_first; |
1438 |
coro_first = coro; |
1439 |
|
1440 |
coro->hv = hv = newHV (); |
1441 |
sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP; |
1442 |
RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1)); |
1443 |
|
1444 |
for (i = 1; i < items; i++) |
1445 |
av_push (coro->args, newSVsv (ST (i))); |
1446 |
} |
1447 |
OUTPUT: |
1448 |
RETVAL |
1449 |
|
1450 |
int |
1451 |
save (SV *coro, int new_save = -1) |
1452 |
CODE: |
1453 |
RETVAL = api_save (coro, new_save); |
1454 |
OUTPUT: |
1455 |
RETVAL |
1456 |
|
1457 |
int |
1458 |
save_also (SV *coro_sv, int save_also) |
1459 |
CODE: |
1460 |
{ |
1461 |
struct coro *coro = SvSTATE (coro_sv); |
1462 |
RETVAL = coro->save; |
1463 |
coro->save |= save_also; |
1464 |
} |
1465 |
OUTPUT: |
1466 |
RETVAL |
1467 |
|
1468 |
void |
1469 |
_set_stacklevel (...) |
1470 |
ALIAS: |
1471 |
Coro::State::transfer = 1 |
1472 |
Coro::schedule = 2 |
1473 |
Coro::cede = 3 |
1474 |
Coro::cede_notself = 4 |
1475 |
CODE: |
1476 |
{ |
1477 |
struct transfer_args ta; |
1478 |
|
1479 |
switch (ix) |
1480 |
{ |
1481 |
case 0: |
1482 |
ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0))); |
1483 |
ta.next = 0; |
1484 |
break; |
1485 |
|
1486 |
case 1: |
1487 |
if (items != 2) |
1488 |
croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items); |
1489 |
|
1490 |
prepare_transfer (aTHX_ &ta, ST (0), ST (1)); |
1491 |
break; |
1492 |
|
1493 |
case 2: |
1494 |
prepare_schedule (aTHX_ &ta); |
1495 |
break; |
1496 |
|
1497 |
case 3: |
1498 |
prepare_cede (aTHX_ &ta); |
1499 |
break; |
1500 |
|
1501 |
case 4: |
1502 |
if (!prepare_cede_notself (aTHX_ &ta)) |
1503 |
XSRETURN_EMPTY; |
1504 |
|
1505 |
break; |
1506 |
} |
1507 |
|
1508 |
BARRIER; |
1509 |
TRANSFER (ta); |
1510 |
|
1511 |
if (GIMME_V != G_VOID && ta.next != ta.prev) |
1512 |
XSRETURN_YES; |
1513 |
} |
1514 |
|
1515 |
bool |
1516 |
_destroy (SV *coro_sv) |
1517 |
CODE: |
1518 |
RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv)); |
1519 |
OUTPUT: |
1520 |
RETVAL |
1521 |
|
1522 |
void |
1523 |
_exit (code) |
1524 |
int code |
1525 |
PROTOTYPE: $ |
1526 |
CODE: |
1527 |
_exit (code); |
1528 |
|
1529 |
int |
1530 |
cctx_stacksize (int new_stacksize = 0) |
1531 |
CODE: |
1532 |
RETVAL = coro_stacksize; |
1533 |
if (new_stacksize) |
1534 |
coro_stacksize = new_stacksize; |
1535 |
OUTPUT: |
1536 |
RETVAL |
1537 |
|
1538 |
int |
1539 |
cctx_count () |
1540 |
CODE: |
1541 |
RETVAL = cctx_count; |
1542 |
OUTPUT: |
1543 |
RETVAL |
1544 |
|
1545 |
int |
1546 |
cctx_idle () |
1547 |
CODE: |
1548 |
RETVAL = cctx_idle; |
1549 |
OUTPUT: |
1550 |
RETVAL |
1551 |
|
1552 |
void |
1553 |
list () |
1554 |
PPCODE: |
1555 |
{ |
1556 |
struct coro *coro; |
1557 |
for (coro = coro_first; coro; coro = coro->next) |
1558 |
if (coro->hv) |
1559 |
XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv))); |
1560 |
} |
1561 |
|
1562 |
void |
1563 |
call (Coro::State coro, SV *coderef) |
1564 |
ALIAS: |
1565 |
eval = 1 |
1566 |
CODE: |
1567 |
{ |
1568 |
if (coro->mainstack) |
1569 |
{ |
1570 |
struct coro temp; |
1571 |
Zero (&temp, 1, struct coro); |
1572 |
temp.save = CORO_SAVE_ALL; |
1573 |
|
1574 |
if (!(coro->flags & CF_RUNNING)) |
1575 |
{ |
1576 |
save_perl (aTHX_ &temp); |
1577 |
load_perl (aTHX_ coro); |
1578 |
} |
1579 |
|
1580 |
{ |
1581 |
dSP; |
1582 |
ENTER; |
1583 |
SAVETMPS; |
1584 |
PUSHMARK (SP); |
1585 |
PUTBACK; |
1586 |
if (ix) |
1587 |
eval_sv (coderef, 0); |
1588 |
else |
1589 |
call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
1590 |
SPAGAIN; |
1591 |
FREETMPS; |
1592 |
LEAVE; |
1593 |
PUTBACK; |
1594 |
} |
1595 |
|
1596 |
if (!(coro->flags & CF_RUNNING)) |
1597 |
{ |
1598 |
save_perl (aTHX_ coro); |
1599 |
load_perl (aTHX_ &temp); |
1600 |
} |
1601 |
} |
1602 |
} |
1603 |
|
1604 |
SV * |
1605 |
is_ready (Coro::State coro) |
1606 |
PROTOTYPE: $ |
1607 |
ALIAS: |
1608 |
is_ready = CF_READY |
1609 |
is_running = CF_RUNNING |
1610 |
is_new = CF_NEW |
1611 |
is_destroyed = CF_DESTROYED |
1612 |
CODE: |
1613 |
RETVAL = boolSV (coro->flags & ix); |
1614 |
OUTPUT: |
1615 |
RETVAL |
1616 |
|
1617 |
void |
1618 |
api_trace (SV *coro, int flags = CC_TRACE | CC_TRACE_SUB) |
1619 |
|
1620 |
SV * |
1621 |
has_stack (Coro::State coro) |
1622 |
PROTOTYPE: $ |
1623 |
CODE: |
1624 |
RETVAL = boolSV (!!coro->cctx); |
1625 |
OUTPUT: |
1626 |
RETVAL |
1627 |
|
1628 |
int |
1629 |
is_traced (Coro::State coro) |
1630 |
PROTOTYPE: $ |
1631 |
CODE: |
1632 |
RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL; |
1633 |
OUTPUT: |
1634 |
RETVAL |
1635 |
|
1636 |
IV |
1637 |
rss (Coro::State coro) |
1638 |
PROTOTYPE: $ |
1639 |
ALIAS: |
1640 |
usecount = 1 |
1641 |
CODE: |
1642 |
switch (ix) |
1643 |
{ |
1644 |
case 0: RETVAL = coro_rss (aTHX_ coro); break; |
1645 |
case 1: RETVAL = coro->usecount; break; |
1646 |
} |
1647 |
OUTPUT: |
1648 |
RETVAL |
1649 |
|
1650 |
|
1651 |
MODULE = Coro::State PACKAGE = Coro |
1652 |
|
1653 |
BOOT: |
1654 |
{ |
1655 |
int i; |
1656 |
|
1657 |
sv_pool_rss = get_sv ("Coro::POOL_RSS" , TRUE); |
1658 |
sv_pool_size = get_sv ("Coro::POOL_SIZE" , TRUE); |
1659 |
av_async_pool = get_av ("Coro::async_pool", TRUE); |
1660 |
|
1661 |
coro_current = get_sv ("Coro::current", FALSE); |
1662 |
SvREADONLY_on (coro_current); |
1663 |
|
1664 |
coro_stash = gv_stashpv ("Coro", TRUE); |
1665 |
|
1666 |
newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
1667 |
newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
1668 |
newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
1669 |
newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
1670 |
newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
1671 |
newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
1672 |
|
1673 |
for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1674 |
coro_ready[i] = newAV (); |
1675 |
|
1676 |
{ |
1677 |
SV *sv = perl_get_sv("Coro::API", 1); |
1678 |
|
1679 |
coroapi.schedule = api_schedule; |
1680 |
coroapi.save = api_save; |
1681 |
coroapi.cede = api_cede; |
1682 |
coroapi.cede_notself = api_cede_notself; |
1683 |
coroapi.ready = api_ready; |
1684 |
coroapi.is_ready = api_is_ready; |
1685 |
coroapi.nready = &coro_nready; |
1686 |
coroapi.current = coro_current; |
1687 |
|
1688 |
GCoroAPI = &coroapi; |
1689 |
sv_setiv (sv, (IV)&coroapi); |
1690 |
SvREADONLY_on (sv); |
1691 |
} |
1692 |
} |
1693 |
|
1694 |
void |
1695 |
_set_current (SV *current) |
1696 |
PROTOTYPE: $ |
1697 |
CODE: |
1698 |
SvREFCNT_dec (SvRV (coro_current)); |
1699 |
SvRV_set (coro_current, SvREFCNT_inc (SvRV (current))); |
1700 |
|
1701 |
int |
1702 |
prio (Coro::State coro, int newprio = 0) |
1703 |
ALIAS: |
1704 |
nice = 1 |
1705 |
CODE: |
1706 |
{ |
1707 |
RETVAL = coro->prio; |
1708 |
|
1709 |
if (items > 1) |
1710 |
{ |
1711 |
if (ix) |
1712 |
newprio = coro->prio - newprio; |
1713 |
|
1714 |
if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1715 |
if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1716 |
|
1717 |
coro->prio = newprio; |
1718 |
} |
1719 |
} |
1720 |
OUTPUT: |
1721 |
RETVAL |
1722 |
|
1723 |
SV * |
1724 |
ready (SV *self) |
1725 |
PROTOTYPE: $ |
1726 |
CODE: |
1727 |
RETVAL = boolSV (api_ready (self)); |
1728 |
OUTPUT: |
1729 |
RETVAL |
1730 |
|
1731 |
int |
1732 |
nready (...) |
1733 |
PROTOTYPE: |
1734 |
CODE: |
1735 |
RETVAL = coro_nready; |
1736 |
OUTPUT: |
1737 |
RETVAL |
1738 |
|
1739 |
# for async_pool speedup |
1740 |
void |
1741 |
_pool_1 (SV *cb) |
1742 |
CODE: |
1743 |
{ |
1744 |
int i, len; |
1745 |
HV *hv = (HV *)SvRV (coro_current); |
1746 |
AV *defav = GvAV (PL_defgv); |
1747 |
SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0); |
1748 |
AV *invoke_av; |
1749 |
|
1750 |
if (!invoke) |
1751 |
croak ("\3terminate\2\n"); |
1752 |
|
1753 |
hv_store (hv, "desc", sizeof ("desc") - 1, |
1754 |
newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0); |
1755 |
|
1756 |
invoke_av = (AV *)SvRV (invoke); |
1757 |
len = av_len (invoke_av); |
1758 |
|
1759 |
sv_setsv (cb, AvARRAY (invoke_av)[0]); |
1760 |
|
1761 |
if (len > 0) |
1762 |
{ |
1763 |
av_fill (defav, len - 1); |
1764 |
for (i = 0; i < len; ++i) |
1765 |
av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1])); |
1766 |
} |
1767 |
|
1768 |
SvREFCNT_dec (invoke); |
1769 |
} |
1770 |
|
1771 |
void |
1772 |
_pool_2 (SV *cb) |
1773 |
CODE: |
1774 |
{ |
1775 |
struct coro *coro = SvSTATE (coro_current); |
1776 |
|
1777 |
sv_setsv (cb, &PL_sv_undef); |
1778 |
|
1779 |
if (coro_rss (aTHX_ coro) > SvIV (sv_pool_rss) |
1780 |
|| av_len (av_async_pool) + 1 >= SvIV (sv_pool_size)) |
1781 |
croak ("\3terminate\2\n"); |
1782 |
|
1783 |
av_clear (GvAV (PL_defgv)); |
1784 |
hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1, |
1785 |
newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0); |
1786 |
|
1787 |
coro->save = CORO_SAVE_DEF; |
1788 |
coro->prio = 0; |
1789 |
|
1790 |
if (coro->cctx && (coro->cctx->flags & CC_TRACE)) |
1791 |
api_trace (coro_current, 0); |
1792 |
|
1793 |
av_push (av_async_pool, newSVsv (coro_current)); |
1794 |
} |
1795 |
|
1796 |
|
1797 |
MODULE = Coro::State PACKAGE = Coro::AIO |
1798 |
|
1799 |
SV * |
1800 |
_get_state () |
1801 |
CODE: |
1802 |
{ |
1803 |
struct io_state *data; |
1804 |
|
1805 |
RETVAL = newSV (sizeof (struct io_state)); |
1806 |
data = (struct io_state *)SvPVX (RETVAL); |
1807 |
SvCUR_set (RETVAL, sizeof (struct io_state)); |
1808 |
SvPOK_only (RETVAL); |
1809 |
|
1810 |
data->errorno = errno; |
1811 |
data->laststype = PL_laststype; |
1812 |
data->laststatval = PL_laststatval; |
1813 |
data->statcache = PL_statcache; |
1814 |
} |
1815 |
OUTPUT: |
1816 |
RETVAL |
1817 |
|
1818 |
void |
1819 |
_set_state (char *data_) |
1820 |
PROTOTYPE: $ |
1821 |
CODE: |
1822 |
{ |
1823 |
struct io_state *data = (void *)data_; |
1824 |
|
1825 |
errno = data->errorno; |
1826 |
PL_laststype = data->laststype; |
1827 |
PL_laststatval = data->laststatval; |
1828 |
PL_statcache = data->statcache; |
1829 |
} |
1830 |
|