… | |
… | |
10 | #include "patchlevel.h" |
10 | #include "patchlevel.h" |
11 | |
11 | |
12 | #include <stdio.h> |
12 | #include <stdio.h> |
13 | #include <errno.h> |
13 | #include <errno.h> |
14 | #include <assert.h> |
14 | #include <assert.h> |
|
|
15 | #include <inttypes.h> /* portable stdint.h */ |
15 | |
16 | |
16 | #ifdef HAVE_MMAP |
17 | #ifdef HAVE_MMAP |
17 | # include <unistd.h> |
18 | # include <unistd.h> |
18 | # include <sys/mman.h> |
19 | # include <sys/mman.h> |
19 | # ifndef MAP_ANONYMOUS |
20 | # ifndef MAP_ANONYMOUS |
… | |
… | |
160 | /* async_pool helper stuff */ |
161 | /* async_pool helper stuff */ |
161 | static SV *sv_pool_rss; |
162 | static SV *sv_pool_rss; |
162 | static SV *sv_pool_size; |
163 | static SV *sv_pool_size; |
163 | static AV *av_async_pool; |
164 | static AV *av_async_pool; |
164 | |
165 | |
165 | static struct coro_cctx *cctx_first; |
166 | static struct coro_cctx *cctx_first[3]; /* index by GIMME_V type, void, scalar, array */ |
166 | static int cctx_count, cctx_idle; |
167 | static int cctx_count, cctx_idle[3]; |
167 | |
168 | |
168 | enum { |
169 | enum { |
169 | CC_MAPPED = 0x01, |
170 | CC_MAPPED = 0x01, |
170 | CC_NOREUSE = 0x02, /* throw this away after tracing */ |
171 | CC_NOREUSE = 0x02, /* throw this away after tracing */ |
171 | CC_TRACE = 0x04, |
172 | CC_TRACE = 0x04, |
… | |
… | |
216 | |
217 | |
217 | /* this is a structure representing a perl-level coroutine */ |
218 | /* this is a structure representing a perl-level coroutine */ |
218 | struct coro { |
219 | struct coro { |
219 | /* the c coroutine allocated to this perl coroutine, if any */ |
220 | /* the c coroutine allocated to this perl coroutine, if any */ |
220 | coro_cctx *cctx; |
221 | coro_cctx *cctx; |
|
|
222 | int gimme; |
221 | |
223 | |
222 | /* process data */ |
224 | /* process data */ |
223 | AV *mainstack; |
225 | AV *mainstack; |
224 | perl_slots *slot; /* basically the saved sp */ |
226 | perl_slots *slot; /* basically the saved sp */ |
225 | |
227 | |
226 | /* data associated with this coroutine (initial args) */ |
228 | AV *args; /* data associated with this coroutine (initial args) */ |
227 | AV *args; |
229 | int refcnt; /* coroutines are refcounted, yes */ |
228 | int refcnt; |
|
|
229 | int flags; /* CF_ flags */ |
230 | int flags; /* CF_ flags */ |
|
|
231 | HV *hv; /* the perl hash associated with this coro, if any */ |
230 | |
232 | |
231 | /* statistics */ |
233 | /* statistics */ |
232 | int usecount; /* number of transfers to this coro */ |
234 | int usecount; /* number of transfers to this coro */ |
233 | |
235 | |
234 | /* coro process data */ |
236 | /* coro process data */ |
235 | int prio; |
237 | int prio; |
236 | SV *throw; |
238 | SV *throw; /* exception to be thrown */ |
237 | |
239 | |
238 | /* async_pool */ |
240 | /* async_pool */ |
239 | SV *saved_deffh; |
241 | SV *saved_deffh; |
240 | |
242 | |
241 | /* linked list */ |
243 | /* linked list */ |
242 | struct coro *next, *prev; |
244 | struct coro *next, *prev; |
243 | HV *hv; /* the perl hash associated with this coro, if any */ |
|
|
244 | }; |
245 | }; |
245 | |
246 | |
246 | typedef struct coro *Coro__State; |
247 | typedef struct coro *Coro__State; |
247 | typedef struct coro *Coro__State_or_hashref; |
248 | typedef struct coro *Coro__State_or_hashref; |
248 | |
249 | |
… | |
… | |
557 | * allocate various perl stacks. This is an exact copy |
558 | * allocate various perl stacks. This is an exact copy |
558 | * of perl.c:init_stacks, except that it uses less memory |
559 | * of perl.c:init_stacks, except that it uses less memory |
559 | * on the (sometimes correct) assumption that coroutines do |
560 | * on the (sometimes correct) assumption that coroutines do |
560 | * not usually need a lot of stackspace. |
561 | * not usually need a lot of stackspace. |
561 | */ |
562 | */ |
562 | #if 1 |
563 | #if CORO_PREFER_PERL_FUNCTIONS |
563 | # define coro_init_stacks init_stacks |
564 | # define coro_init_stacks init_stacks |
564 | #else |
565 | #else |
565 | static void |
566 | static void |
566 | coro_init_stacks (pTHX) |
567 | coro_init_stacks (pTHX) |
567 | { |
568 | { |
… | |
… | |
711 | XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv)))); |
712 | XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv)))); |
712 | PUTBACK; |
713 | PUTBACK; |
713 | PL_op = (OP *)&myop; |
714 | PL_op = (OP *)&myop; |
714 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
715 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
715 | SPAGAIN; |
716 | SPAGAIN; |
|
|
717 | |
|
|
718 | /* |
|
|
719 | * now its very tricky. the "tail" of the next transfer might end up |
|
|
720 | * either in a new cctx, or an existing one. |
|
|
721 | * in case of an existing one we have to take care of whatever |
|
|
722 | * entersub and transfer do to the perl stack. |
|
|
723 | */ |
|
|
724 | ENTER; |
|
|
725 | EXTEND (SP, 4); |
|
|
726 | PUSHs ((SV *)0); /* items */ |
|
|
727 | PUSHs ((SV *)0); /* ix, set_stacklevel */ |
|
|
728 | PUSHs ((SV *)(sp - PL_stack_base + 1)); /* ax */ |
|
|
729 | PUSHs ((SV *)0); /* again */ |
|
|
730 | PUTBACK; |
716 | } |
731 | } |
717 | |
732 | |
718 | ENTER; /* necessary e.g. for dounwind and to balance the xsub-entersub */ |
733 | /* this newly created coroutine might be run on an existing cctx which most |
|
|
734 | * likely was suspended in set_stacklevel, called from entersub. |
|
|
735 | * set_stacklevl doesn't do anything on return, but entersub does LEAVE, |
|
|
736 | * so we ENTER here for symmetry |
|
|
737 | */ |
|
|
738 | ENTER; |
719 | } |
739 | } |
720 | |
740 | |
721 | static void |
741 | static void |
722 | coro_destroy (pTHX_ struct coro *coro) |
742 | coro_destroy (pTHX_ struct coro *coro) |
723 | { |
743 | { |
… | |
… | |
1019 | |
1039 | |
1020 | /* wether this cctx should be destructed */ |
1040 | /* wether this cctx should be destructed */ |
1021 | #define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize || ((cctx)->flags & CC_NOREUSE)) |
1041 | #define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize || ((cctx)->flags & CC_NOREUSE)) |
1022 | |
1042 | |
1023 | static coro_cctx * |
1043 | static coro_cctx * |
1024 | cctx_get (pTHX) |
1044 | cctx_get (pTHX_ int gimme) |
1025 | { |
1045 | { |
1026 | while (expect_true (cctx_first)) |
1046 | while (expect_true (cctx_first[gimme])) |
1027 | { |
1047 | { |
1028 | coro_cctx *cctx = cctx_first; |
1048 | coro_cctx *cctx = cctx_first[gimme]; |
1029 | cctx_first = cctx->next; |
1049 | cctx_first[gimme] = cctx->next; |
1030 | --cctx_idle; |
1050 | --cctx_idle[gimme]; |
1031 | |
1051 | |
1032 | if (expect_true (!CCTX_EXPIRED (cctx))) |
1052 | if (expect_true (!CCTX_EXPIRED (cctx))) |
1033 | return cctx; |
1053 | return cctx; |
1034 | |
1054 | |
1035 | cctx_destroy (cctx); |
1055 | cctx_destroy (cctx); |
1036 | } |
1056 | } |
1037 | |
1057 | |
|
|
1058 | assert (!gimme); |
1038 | return cctx_new (); |
1059 | return cctx_new (); |
1039 | } |
1060 | } |
1040 | |
1061 | |
1041 | static void |
1062 | static void |
1042 | cctx_put (coro_cctx *cctx) |
1063 | cctx_put (coro_cctx *cctx, int gimme) |
1043 | { |
1064 | { |
1044 | /* free another cctx if overlimit */ |
1065 | /* free another cctx if overlimit */ |
1045 | if (expect_false (cctx_idle >= MAX_IDLE_CCTX)) |
1066 | if (expect_false (cctx_idle[gimme] >= MAX_IDLE_CCTX)) |
1046 | { |
1067 | { |
1047 | coro_cctx *first = cctx_first; |
1068 | coro_cctx *first = cctx_first[gimme]; |
1048 | cctx_first = first->next; |
1069 | cctx_first[gimme] = first->next; |
1049 | --cctx_idle; |
1070 | --cctx_idle[gimme]; |
1050 | |
1071 | |
1051 | cctx_destroy (first); |
1072 | cctx_destroy (first); |
1052 | } |
1073 | } |
1053 | |
1074 | |
1054 | ++cctx_idle; |
1075 | ++cctx_idle[gimme]; |
1055 | cctx->next = cctx_first; |
1076 | cctx->next = cctx_first[gimme]; |
1056 | cctx_first = cctx; |
1077 | cctx_first[gimme] = cctx; |
1057 | } |
1078 | } |
1058 | |
1079 | |
1059 | /** coroutine switching *****************************************************/ |
1080 | /** coroutine switching *****************************************************/ |
1060 | |
1081 | |
1061 | static void |
1082 | static void |
… | |
… | |
1140 | |
1161 | |
1141 | /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */ |
1162 | /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */ |
1142 | /* without this the next cctx_get might destroy the prev__cctx while still in use */ |
1163 | /* without this the next cctx_get might destroy the prev__cctx while still in use */ |
1143 | if (expect_false (CCTX_EXPIRED (prev__cctx))) |
1164 | if (expect_false (CCTX_EXPIRED (prev__cctx))) |
1144 | if (!next->cctx) |
1165 | if (!next->cctx) |
1145 | next->cctx = cctx_get (aTHX); |
1166 | next->cctx = cctx_get (aTHX_ next->gimme); |
1146 | |
1167 | |
1147 | cctx_put (prev__cctx); |
1168 | cctx_put (prev__cctx, prev->gimme); |
1148 | } |
1169 | } |
1149 | |
1170 | |
1150 | ++next->usecount; |
1171 | ++next->usecount; |
1151 | |
1172 | |
1152 | if (expect_true (!next->cctx)) |
1173 | if (expect_true (!next->cctx)) |
1153 | next->cctx = cctx_get (aTHX); |
1174 | next->cctx = cctx_get (aTHX_ next->gimme); |
1154 | |
1175 | |
1155 | if (expect_false (prev__cctx != next->cctx)) |
1176 | if (expect_false (prev__cctx != next->cctx)) |
1156 | { |
1177 | { |
1157 | prev__cctx->top_env = PL_top_env; |
1178 | prev__cctx->top_env = PL_top_env; |
1158 | PL_top_env = next->cctx->top_env; |
1179 | PL_top_env = next->cctx->top_env; |
… | |
… | |
1524 | |
1545 | |
1525 | while (main_top_env->je_prev) |
1546 | while (main_top_env->je_prev) |
1526 | main_top_env = main_top_env->je_prev; |
1547 | main_top_env = main_top_env->je_prev; |
1527 | |
1548 | |
1528 | coroapi.ver = CORO_API_VERSION; |
1549 | coroapi.ver = CORO_API_VERSION; |
|
|
1550 | coroapi.rev = CORO_API_REVISION; |
1529 | coroapi.transfer = api_transfer; |
1551 | coroapi.transfer = api_transfer; |
1530 | |
1552 | |
1531 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
1553 | assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL)); |
1532 | } |
1554 | } |
1533 | |
1555 | |
… | |
… | |
1600 | |
1622 | |
1601 | break; |
1623 | break; |
1602 | } |
1624 | } |
1603 | |
1625 | |
1604 | BARRIER; |
1626 | BARRIER; |
|
|
1627 | PUTBACK; |
1605 | TRANSFER (ta); |
1628 | TRANSFER (ta); |
1606 | |
1629 | SPAGAIN; /* might be the sp of a different coroutine now */ |
1607 | if (expect_false (GIMME_V != G_VOID && ta.next != ta.prev)) |
1630 | /* be extra careful not to ever do anything after TRANSFER */ |
1608 | XSRETURN_YES; |
|
|
1609 | } |
1631 | } |
1610 | |
1632 | |
1611 | bool |
1633 | bool |
1612 | _destroy (SV *coro_sv) |
1634 | _destroy (SV *coro_sv) |
1613 | CODE: |
1635 | CODE: |
… | |
… | |
1639 | RETVAL |
1661 | RETVAL |
1640 | |
1662 | |
1641 | int |
1663 | int |
1642 | cctx_idle () |
1664 | cctx_idle () |
1643 | CODE: |
1665 | CODE: |
1644 | RETVAL = cctx_idle; |
1666 | RETVAL = cctx_idle[0] + cctx_idle[1] + cctx_idle[2]; |
1645 | OUTPUT: |
1667 | OUTPUT: |
1646 | RETVAL |
1668 | RETVAL |
1647 | |
1669 | |
1648 | void |
1670 | void |
1649 | list () |
1671 | list () |
… | |
… | |
1673 | |
1695 | |
1674 | { |
1696 | { |
1675 | dSP; |
1697 | dSP; |
1676 | ENTER; |
1698 | ENTER; |
1677 | SAVETMPS; |
1699 | SAVETMPS; |
|
|
1700 | PUTBACK; |
|
|
1701 | PUSHSTACK; |
1678 | PUSHMARK (SP); |
1702 | PUSHMARK (SP); |
1679 | PUTBACK; |
|
|
1680 | |
1703 | |
1681 | if (ix) |
1704 | if (ix) |
1682 | eval_sv (coderef, 0); |
1705 | eval_sv (coderef, 0); |
1683 | else |
1706 | else |
1684 | call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
1707 | call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD); |
1685 | |
1708 | |
1686 | SPAGAIN; |
1709 | POPSTACK; |
1687 | FREETMPS; |
1710 | FREETMPS; |
1688 | LEAVE; |
1711 | LEAVE; |
1689 | PUTBACK; |
1712 | PUTBACK; |
1690 | } |
1713 | } |
1691 | |
1714 | |