Branch Coverage

Simple.xs
Criterion Covered Total %
branch 40 64 62.5


line true false branch
124 3827 0 if (PL_parser && PL_parser->error_count) {
0 3827 if (PL_parser && PL_parser->error_count) {
129 0 3827 if (kw_len > (STRLEN)I32_MAX) {
133 0 3827 if (!(hints = GvHV(PL_hintgv))) {
137 3757 70 if (!(psv = hv_fetchs(hints, HINTK_KEYWORDS, 0))) {
142 70 0 if (!(SvROK(sv) && (sv2 = SvRV(sv), SvTYPE(sv2) == SVt_PVHV))) {
0 70 if (!(SvROK(sv) && (sv2 = SvRV(sv), SvTYPE(sv2) == SVt_PVHV))) {
147 0 70 if (lex_bufutf8()) {
150 60 10 if (!(psv = hv_fetch((HV *)sv2, kw_ptr, kw_xlen, 0))) {
155 10 0 if (!(SvROK(sv) && (sv2 = SvRV(sv), SvTYPE(sv2) == SVt_PVCV))) {
0 10 if (!(SvROK(sv) && (sv2 = SvRV(sv), SvTYPE(sv2) == SVt_PVCV))) {
165 72 0 SV *sv = FILTER_DATA(idx);
167 72 0 ptr = SvPV(sv, len);
168 7 65 if (!len) {
172 61 4 if (!n) {
174 61 0 d = nl ? (STRLEN)(nl - ptr + 1) : len;
176 4 0 d = n < 0 ? INT_MAX : n;
177 4 0 if (d > len) {
195 0 10 if (lex_bufutf8()) {
204 3 7 if (PL_parser->rsfp || PL_parser_filtered) {
0 3 if (PL_parser->rsfp || PL_parser_filtered) {
205 0 7 if (!PL_rsfp_filters) {
209 7 7 while (FILTER_READ(0, sv, 4096) > 0)
213 0 10 PUSHMARK(SP);
214 0 10 mXPUSHs(newRV_inc(sv));
223 10 0 SvPV_force(sv, n);
224 10 0 p = SvGROW(sv, n + 2);
0 10 p = SvGROW(sv, n + 2);
230 3 7 if (PL_parser->rsfp || PL_parser_filtered) {
0 3 if (PL_parser->rsfp || PL_parser_filtered) {
237 10 0 FREETMPS;
244 10 3817 if ((cb = kw_handler(aTHX_ keyword_ptr, keyword_len))) {