blib/lib/Text/Nunjucks/Transformer.pm

filter: Statementstmt 76.3% 129 / 169 Branchbran 70.0% 63 / 90 Conditioncond 55.4% 46 / 83 MC/DCmcdc 38.3% 18 / 47 Subroutinesub 87.1% 27 / 31 Podpod 0.0% 0 / 14 totaltotal 65.2% 283 / 434 CC 109 SCAR 26.8
CC
109
Cov
70%
walk
50.3
walk
50.3
_same
14.8
CRAP 14.6
« blib/lib/Text/Nunjucks/Lib/TemplateError.pm ↑ Summary blib/lib/Text/Nunjucks/Lib.pm »
1 package Text::Nunjucks::Transformer;
2 # ABSTRACT: 1:1 port of Nunjucks src/transformer.js -- the async CPS rewrite
3  
4 17 our $VERSION = '0.001';
5  
6 17 ▶use strict;
Subroutine BEGIN: called CC=1 SCAR=0.0
7 17 ▶use warnings;
Subroutine BEGIN: called CC=1 SCAR=0.0
8 17 ▶use Scalar::Util qw( blessed refaddr );
Subroutine BEGIN: called CC=1 SCAR=0.0
9 17 ▶use Text::Nunjucks::Nodes;
Subroutine BEGIN: called CC=1 SCAR=0.0
10 17 ▶use Text::Nunjucks::Lib;
Subroutine BEGIN: called CC=1 SCAR=0.0
11  
12 # 1:1 port of upstream src/transformer.js. transformer.js is a plain bag of
13 # module-level functions with `module.exports = { transform }`; it is ported as
14 # a class-method-only module (getty-perl-core "dispatch through the invocant"),
15 # the same shape as Lib.pm: every upstream function becomes a method taking
16 # $self, in upstream order and snake_case, callers use
17 # Text::Nunjucks::Transformer->transform($ast, \@async_filters), and every
18 # cross-call goes through $self so a subclass can redirect. No instances.
19 #
20 # nodes/lib are reached through their real interfaces (new nodes.X ->
21 # $self->node('X')->new, lib.indexOf -> $self->lib->index_of), never re-derived.
22 #
23 # The transformer rewrites the parse tree so the compiler can emit callback
24 # (CPS) code (ADR 0003): async filters are lifted out into FilterAsync temps,
25 # {{ super() }} into an explicit Super node, and any If/For that turns out to
26 # contain async work is retyped to IfAsync / AsyncEach.
27 #
28 # `var sym = 0` is genuine module-level state upstream -- a process-global
29 # counter behind gensym() that never resets, so the Nth hole minted in a process
30 # carries the Nth number regardless of which template it came from. The 1:1
31 # mapping is a file-lexical $sym; upstream wins on behaviour here (the exact hole
32 # number is not a stable observable -- it is only ever an internal variable name
33 # the compiler both binds and reads back, so its value never reaches output).
34  
35 # Collaborators named once, reached through the invocant (house rule).
36 3693642 ▶sub node { my ( $self, $name ) = @_; return 'Text::Nunjucks::Nodes::' . $name }
Subroutine node: called CC=1 SCAR=0.0
Pod undocumented
37 10462 ▶sub lib { 'Text::Nunjucks::Lib' }
Subroutine lib: called CC=1 SCAR=0.0
Pod undocumented
38  
39 #### gensym / var sym
40  
41 17 my $sym = 0;
42  
43 1318 ▶sub gensym {
Subroutine gensym: called CC=1 SCAR=1.2
Pod undocumented
44 0 ▶ my ($self) = @_;
Subroutine gensym: not called CC=1 SCAR=1.2
Pod undocumented
45 0 return 'hole_' . $sym++;
46 }
47  
48 #### mapCOW -- copy-on-write version of map
49  
50 693871 ▶sub map_cow {
Subroutine map_cow: called CC=5 SCAR=21.7
Pod undocumented
51 0 ▶ my ( $self, $arr, $func ) = @_;
Subroutine map_cow: not called CC=5 SCAR=21.7
Pod undocumented
52 0 my $res;
53 0 for my $i ( 0 .. $#$arr ) {
54 0 my $item = $func->( $arr->[$i] );
55  
56 0 ▶ if ( !$self->_same( $item, $arr->[$i] ) ) {
Branch: 2 branches
BranchTrueFalseTotal
unless ($self->_same($item, $arr->[$i])) 1678 984060 985738
unless ($self->_same($item, $arr->[$i])) 0 0 0
57 0 ▶ $res = [ @$arr ] unless $res; # arr.slice()
Branch: 2 branches
BranchTrueFalseTotal
unless $res 1668 10 1678
unless $res 0 0 0
58 0 $res->[$i] = $item;
59 }
60 }
61  
62 0 ▶ return $res || $arr;
Condition33%2/6
$res || $arr
l!l&&r!l&&!r
16686922030
$res || $arr
l!l&&r!l&&!r
000
MC/DC0%0/2
$res || $arr
$res $arr
MC/DC0%0/2
$res || $arr
$res $arr
Truth table66%2/3
A || B
A= $resB= $arr
ABresult
1X1
011
000
Truth table0%0/3
A || B
A= $resB= $arr
ABresult
1X1
011
000
63 }
64  
65 # JS `a === b` for the copy-on-write identity checks in walk / mapCOW. walk()
66 # returns its argument unchanged (same value or ref) or a freshly built node, so
67 # a change is always observable as a change of reference; a non-node value only
68 # ever passes through unchanged and so is treated as "same".
69 1680730 ▶sub _same {
Subroutine _same: called CC=6 SCAR=26.9
70 0 ▶ my ( $self, $a, $b ) = @_;
Subroutine _same: not called CC=6 SCAR=26.9
71 0 ▶ return 1 unless ref($a) || ref($b);
Branch: 2 branches
BranchTrueFalseTotal
unless ref $a or ref $b 335915 1344815 1680730
unless ref $a or ref $b 0 0 0
Condition33%2/6
ref $a or ref $b
l!l&&r!l&&!r
13448150335915
ref $a or ref $b
l!l&&r!l&&!r
000
MC/DC50%1/2
ref $a or ref $b
ref $a ref $b
MC/DC0%0/2
ref $a or ref $b
ref $a ref $b
Truth table66%2/3
A or B
A= ref $aB= ref $b
ABresult
1X1
011
000
Truth table0%0/3
A or B
A= ref $aB= ref $b
ABresult
1X1
011
000
72 0 ▶ return ( ref($a) && ref($b) && refaddr($a) == refaddr($b) ) ? 1 : 0;
Branch: 2 branches
BranchTrueFalseTotal
ref $a && ref $b && builtin::refaddr($a) == builtin::refaddr($b) ? : 1341199 3616 1344815
ref $a && ref $b && builtin::refaddr($a) == builtin::refaddr($b) ? : 0 0 0
Condition25%3/12
ref $a and ref $b and builtin::refaddr($a) == builtin::refaddr($b)
!ll&&!rl&&r
036161341199
ref $a and ref $b
!ll&&!rl&&r
001344815
ref $a and ref $b and builtin::refaddr($a) == builtin::refaddr($b)
!ll&&!rl&&r
000
ref $a and ref $b
!ll&&!rl&&r
000
MC/DC33%1/3
ref $a and ref $b and builtin::refaddr($a) == builtin::refaddr($b)
ref $a ref $b builtin::refaddr($a) == builtin::refaddr($b)
MC/DC0%0/3
ref $a and ref $b and builtin::refaddr($a) == builtin::refaddr($b)
ref $a ref $b builtin::refaddr($a) == builtin::refaddr($b)
Truth table50%2/4
A and B and C
A= ref $aB= ref $bC= builtin::refaddr($a) == builtin::refaddr($b)
ABCresult
0XX0
10X0
1100
1111
Truth table0%0/4
A and B and C
A= ref $aB= ref $bC= builtin::refaddr($a) == builtin::refaddr($b)
ABCresult
0XX0
10X0
1100
1111
73 }
74  
75 #### walk
76  
77 1052103 ▶sub walk {
Subroutine walk: called CC=15 SCAR=39.2
Pod undocumented
78 0 ▶ my ( $self, $ast, $func, $depth_first ) = @_;
Subroutine walk: not called CC=15 SCAR=39.2
Pod undocumented
79  
80 0 ▶ if ( !( blessed($ast) && $ast->isa( $self->node('Node') ) ) ) {
Branch: 2 branches
BranchTrueFalseTotal
unless (builtin::blessed($ast) and $ast->isa($self->node("Node"))) 357962 694141 1052103
unless (builtin::blessed($ast) and $ast->isa($self->node("Node"))) 0 0 0
Condition33%2/6
builtin::blessed($ast) and $ast->isa($self->node("Node"))
!ll&&!rl&&r
3579620694141
builtin::blessed($ast) and $ast->isa($self->node("Node"))
!ll&&!rl&&r
000
MC/DC50%1/2
builtin::blessed($ast) and $ast->isa($self->node("Node"))
builtin::blessed($ast) $ast->isa($self->node("Node"))
MC/DC0%0/2
builtin::blessed($ast) and $ast->isa($self->node("Node"))
builtin::blessed($ast) $ast->isa($self->node("Node"))
Truth table66%2/3
A and B
A= builtin::blessed($ast)B= $ast->isa($self->node("Node"))
ABresult
0X0
100
111
Truth table0%0/3
A and B
A= builtin::blessed($ast)B= $ast->isa($self->node("Node"))
ABresult
0X0
100
111
81 0 return $ast;
82 }
83  
84 0 ▶ if ( !$depth_first ) {
Branch: 2 branches
BranchTrueFalseTotal
unless ($depth_first) 221735 472406 694141
unless ($depth_first) 0 0 0
85 0 my $ast_t = $func->($ast);
86  
87 0 ▶ if ( $ast_t && !$self->_same( $ast_t, $ast ) ) {
Branch: 2 branches
BranchTrueFalseTotal
if ($ast_t and not $self->_same($ast_t, $ast)) 270 221465 221735
if ($ast_t and not $self->_same($ast_t, $ast)) 0 0 0
Condition50%3/6
$ast_t and not $self->_same($ast_t, $ast)
!ll&&!rl&&r
220658807270
$ast_t and not $self->_same($ast_t, $ast)
!ll&&!rl&&r
000
MC/DC100%2/2
$ast_t and not $self->_same($ast_t, $ast)
$ast_t not $self->_same($ast_t, $ast)
MC/DC0%0/2
$ast_t and not $self->_same($ast_t, $ast)
$ast_t not $self->_same($ast_t, $ast)
Truth table100%3/3
A and not(B)
A= $ast_tB= not $self->_same($ast_t, $ast)
ABresult
0X0
100
111
Truth table0%0/3
A and not(B)
A= $ast_tB= not $self->_same($ast_t, $ast)
ABresult
0X0
100
111
88 0 return $ast_t;
89 }
90 }
91  
92 0 ▶ if ( $ast->isa( $self->node('NodeList') ) ) {
Branch: 4 branches
BranchTrueFalseTotal
if ($ast->isa($self->node('NodeList'))) { } 241971 451900 693871
elsif ($ast->isa($self->node('CallExtension'))) { } 44 451856 451900
if ($ast->isa($self->node('NodeList'))) { } 0 0 0
elsif ($ast->isa($self->node('CallExtension'))) { } 0 0 0
93 0 ▶ my $children = $self->map_cow( $ast->children, sub { $self->walk( $_[0], $func, $depth_first ) } );
Subroutine __ANON__: called CC=1 SCAR=0.4
94  
95 0 ▶ if ( !$self->_same( $children, $ast->children ) ) {
Branch: 2 branches
BranchTrueFalseTotal
unless ($self->_same($children, $ast->children)) 1582 240389 241971
unless ($self->_same($children, $ast->children)) 0 0 0
96 0 $ast = $self->node( $ast->typename )->new( $ast->lineno, $ast->colno, $children );
97 }
98 }
99 elsif ( $ast->isa( $self->node('CallExtension') ) ) {
100 0 my $args = $self->walk( $ast->args, $func, $depth_first );
101 0 ▶ my $content_args = $self->map_cow( $ast->contentArgs, sub { $self->walk( $_[0], $func, $depth_first ) } );
Subroutine __ANON__: called CC=1 SCAR=0.4
102  
103 0 ▶ if ( !$self->_same( $args, $ast->args ) || !$self->_same( $content_args, $ast->contentArgs ) ) {
Branch: 2 branches
BranchTrueFalseTotal
unless ($self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)) 0 44 44
unless ($self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)) 0 0 0
Condition16%1/6
$self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)
!ll&&!rl&&r
0044
$self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)
!ll&&!rl&&r
000
MC/DC0%0/2
$self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)
$self->_same($args, $ast->args) $self->_same($content_args, $ast->contentArgs)
MC/DC0%0/2
$self->_same($args, $ast->args) and $self->_same($content_args, $ast->contentArgs)
$self->_same($args, $ast->args) $self->_same($content_args, $ast->contentArgs)
Truth table33%1/3
A and B
A= $self->_same($args, $ast->args)B= $self->_same($content_args, $ast->contentArgs)
ABresult
0X0
100
111
Truth table0%0/3
A and B
A= $self->_same($args, $ast->args)B= $self->_same($content_args, $ast->contentArgs)
ABresult
0X0
100
111
104 0 $ast = $self->node( $ast->typename )->new( $ast->extName, $ast->prop, $args, $content_args );
105 }
106 }
107 else {
108 0 my $props = [ map { $ast->$_ } @{ $ast->fields } ];
109 0 ▶ my $props_t = $self->map_cow( $props, sub { $self->walk( $_[0], $func, $depth_first ) } );
Subroutine __ANON__: called CC=1 SCAR=0.4
110  
111 0 ▶ if ( !$self->_same( $props_t, $props ) ) {
Branch: 2 branches
BranchTrueFalseTotal
unless ($self->_same($props_t, $props)) 86 451770 451856
unless ($self->_same($props_t, $props)) 0 0 0
112 0 my $fields = $ast->fields;
113 0 $ast = $self->node( $ast->typename )->new( $ast->lineno, $ast->colno );
114 0 for my $i ( 0 .. $#$props_t ) {
115 0 my $field = $fields->[$i];
116 0 $ast->$field( $props_t->[$i] );
117 }
118 }
119 }
120  
121 0 ▶ return $depth_first ? ( $func->($ast) || $ast ) : $ast;
Branch: 2 branches
BranchTrueFalseTotal
$depth_first ? : 472406 221465 693871
$depth_first ? : 0 0 0
Condition33%2/6
&$func($ast) or $ast
l!l&&r!l&&!r
342494381570
&$func($ast) or $ast
l!l&&r!l&&!r
000
MC/DC0%0/2
&$func($ast) or $ast
&$func($ast) $ast
MC/DC0%0/2
&$func($ast) or $ast
&$func($ast) $ast
Truth table66%2/3
A or B
A= &$func($ast)B= $ast
ABresult
1X1
011
000
Truth table0%0/3
A or B
A= &$func($ast)B= $ast
ABresult
1X1
011
000
122 }
123  
124 #### depthWalk
125  
126 52155 ▶sub depth_walk {
Subroutine depth_walk: called CC=1 SCAR=0.0
Pod undocumented
127 52155 my ( $self, $ast, $func ) = @_;
128 52155 return $self->walk( $ast, $func, 1 );
129 }
130  
131 #### _liftFilters
132  
133 33395 ▶sub _lift_filters {
Subroutine _lift_filters: called CC=4 SCAR=13.9
134 33395 my ( $self, $node, $async_filters, $prop ) = @_;
135 33395 my @children;
136  
137 129506 ▶ my $walked = $self->depth_walk( ( $prop ? $node->$prop : $node ), sub {
Subroutine __ANON__: called CC=6 SCAR=17.9
138 129506 my ($desc_node) = @_;
139 129506 my $symbol;
140 129506 ▶ if ( $desc_node->isa( $self->node('Block') ) ) {
Branch: 2 branches
BranchTrueFalseTotal
if ($desc_node->isa($self->node('Block'))) { } 1 129505 129506
elsif ($desc_node->isa($self->node('Filter')) and $self->lib->index_of($async_filters, $desc_node->name->value) != -1 or $desc_node->isa($self->node('CallExtensionAsync'))) { } 131 129374 129505
141 1 return $desc_node;
142 }
143 ▶ elsif ( ( $desc_node->isa( $self->node('Filter') )
Condition100%6/6
$desc_node->isa($self->node("Filter")) and $self->lib->index_of($async_filters, $desc_node->name->value) != -1 or $desc_node->isa($self->node("CallExtensionAsync"))
l!l&&r!l&&!r
1301129374
$desc_node->isa($self->node("Filter")) and $self->lib->index_of($async_filters, $desc_node->name->value) != -1
!ll&&!rl&&r
11904310332130
MC/DC100%3/3
$desc_node->isa($self->node("Filter")) and $self->lib->index_of($async_filters, $desc_node->name->value) != -1 or $desc_node->isa($self->node("CallExtensionAsync"))
$desc_node->isa($self->node("Filter")) $self->lib->index_of($async_filters, $desc_node->name->value) != -1 $desc_node->isa($self->node("CallExtensionAsync"))
Truth table80%4/5
A and B or C
A= $desc_node->isa($self->node("Filter"))B= $self->lib->index_of($async_filters, $desc_node->name->value) != -1C= $desc_node->isa($self->node("CallExtensionAsync"))
ABCresult
11X1
0X11
1011
0X00
1000
144 && $self->lib->index_of( $async_filters, $desc_node->name->value ) != -1 )
145 || $desc_node->isa( $self->node('CallExtensionAsync') ) ) {
146 131 $symbol = $self->node('Symbol')->new( $desc_node->lineno,
147 $desc_node->colno,
148 $self->gensym );
149  
150 131 ▶ push @children, $self->node('FilterAsync')->new( $desc_node->lineno,
Branch: 1 branch
BranchTrueFalseTotal
$desc_node->can('name') ? : 130 1 131
151 $desc_node->colno,
152 # JS reads descNode.name; a CallExtensionAsync has no `name` field, so
153 # upstream gets undefined there (FilterAsync.name = null). The same
154 # can() guard lift_super uses for a non-Symbol node.name.value.
155 ( $desc_node->can('name') ? $desc_node->name : undef ),
156 $desc_node->args,
157 $symbol );
158 }
159 129505 return $symbol;
160 33395 ▶ } );
Branch: 1 branch
BranchTrueFalseTotal
$prop ? : 6493 26902 33395
161  
162 33395 ▶ if ($prop) {
Branch: 1 branch
BranchTrueFalseTotal
if ($prop) { } 6493 26902 33395
163 6493 $node->$prop($walked);
164 }
165 else {
166 26902 $node = $walked;
167 }
168  
169 33395 ▶ if (@children) {
Branch: 1 branch
BranchTrueFalseTotal
if (@children) { } 130 33265 33395
170 130 push @children, $node;
171  
172 130 return $self->node('NodeList')->new(
173 $node->lineno,
174 $node->colno,
175 \@children
176 );
177 }
178 else {
179 33265 return $node;
180 }
181 }
182  
183 #### liftFilters
184  
185 9380 ▶sub lift_filters {
Subroutine lift_filters: called CC=1 SCAR=0.0
Pod undocumented
186 9380 my ( $self, $ast, $async_filters ) = @_;
187 171119 ▶ return $self->depth_walk( $ast, sub {
Subroutine __ANON__: called CC=6 SCAR=17.9
188 171119 my ($node) = @_;
189 171119 ▶ if ( $node->isa( $self->node('Output') ) ) {
Branch: 5 branches
BranchTrueFalseTotal
if ($node->isa($self->node('Output'))) { } 26902 144217 171119
elsif ($node->isa($self->node('Set'))) { } 2879 141338 144217
elsif ($node->isa($self->node('For'))) { } 1552 139786 141338
elsif ($node->isa($self->node('If'))) { } 2047 137739 139786
elsif ($node->isa($self->node('CallExtension'))) { } 15 137724 137739
190 26902 return $self->_lift_filters( $node, $async_filters );
191 }
192 elsif ( $node->isa( $self->node('Set') ) ) {
193 2879 return $self->_lift_filters( $node, $async_filters, 'value' );
194 }
195 elsif ( $node->isa( $self->node('For') ) ) {
196 1552 return $self->_lift_filters( $node, $async_filters, 'arr' );
197 }
198 elsif ( $node->isa( $self->node('If') ) ) {
199 2047 return $self->_lift_filters( $node, $async_filters, 'cond' );
200 }
201 elsif ( $node->isa( $self->node('CallExtension') ) ) {
202 15 return $self->_lift_filters( $node, $async_filters, 'args' );
203 }
204 else {
205 137724 return undef;
206 }
207 9380 } );
208 }
209  
210 #### liftSuper
211  
212 9380 ▶sub lift_super {
Subroutine lift_super: called CC=1 SCAR=0.0
Pod undocumented
213 9380 my ( $self, $ast ) = @_;
214 171781 ▶ return $self->walk( $ast, sub {
Subroutine __ANON__: called CC=3 SCAR=11.0
215 171781 my ($block_node) = @_;
216 171781 ▶ if ( !( $block_node->isa( $self->node('Block') ) ) ) {
Branch: 1 branch
BranchTrueFalseTotal
unless ($block_node->isa($self->node("Block"))) 170594 1187 171781
217 170594 return;
218 }
219  
220 1187 my $has_super = 0;
221 1187 my $symbol = $self->gensym;
222  
223 9040 ▶ $block_node->body( $self->walk( $block_node->body, sub { # eslint-disable-line consistent-return
Subroutine __ANON__: called CC=5 SCAR=16.1
224 9040 my ($node) = @_;
225 # JS reads node.name.value; a non-Symbol name (e.g. LookupVal) has no
226 # `value` field and yields undefined there rather than throwing, so the
227 # `=== 'super'` fails. can('value') reproduces that guarded read.
228 9040 ▶ if ( $node->isa( $self->node('FunCall') )
Branch: 1 branch
BranchTrueFalseTotal
if ($node->isa($self->node("FunCall")) and $node->name->can("value") and defined $node->name->value and $node->name->value eq "super") 270 8770 9040
Condition88%8/9
$node->isa($self->node("FunCall")) and $node->name->can("value") and defined $node->name->value and $node->name->value eq "super"
!ll&&!rl&&r
872050270
$node->isa($self->node("FunCall")) and $node->name->can("value") and defined $node->name->value
!ll&&!rl&&r
87200320
$node->isa($self->node("FunCall")) and $node->name->can("value")
!ll&&!rl&&r
87191320
MC/DC75%3/4
$node->isa($self->node("FunCall")) and $node->name->can("value") and defined $node->name->value and $node->name->value eq "super"
$node->isa($self->node("FunCall")) $node->name->can("value") defined $node->name->value $node->name->value eq "super"
Truth table80%4/5
A and B and C and D
A= $node->isa($self->node("FunCall"))B= $node->name->can("value")C= defined $node->name->valueD= $node->name->value eq "super"
ABCDresult
0XXX0
10XX0
110X0
11100
11111
229 && $node->name->can('value')
230 && defined( $node->name->value )
231 && $node->name->value eq 'super' ) {
232 270 $has_super = 1;
233 270 return $self->node('Symbol')->new( $node->lineno, $node->colno, $symbol );
234 }
235 8770 return;
236 1187 } ) );
237  
238 1187 ▶ if ($has_super) {
Branch: 1 branch
BranchTrueFalseTotal
if ($has_super) 270 917 1187
239 270 unshift @{ $block_node->body->children }, $self->node('Super')->new(
240 0, 0, $block_node->name, $self->node('Symbol')->new( 0, 0, $symbol )
241 );
242 }
243 1187 return;
244 9380 } );
245 }
246  
247 #### convertStatements
248  
249 9380 ▶sub convert_statements {
Subroutine convert_statements: called CC=1 SCAR=0.0
Pod undocumented
250 9380 my ( $self, $ast ) = @_;
251 171781 ▶ return $self->depth_walk( $ast, sub {
Subroutine __ANON__: called CC=7 SCAR=19.5
252 171781 my ($node) = @_;
253 171781 ▶ if ( !( $node->isa( $self->node('If') ) ) && !( $node->isa( $self->node('For') ) ) ) {
Branch: 1 branch
BranchTrueFalseTotal
unless ($node->isa($self->node("If")) or $node->isa($self->node("For"))) 168182 3599 171781
Condition100%3/3
$node->isa($self->node("If")) or $node->isa($self->node("For"))
l!l&&r!l&&!r
20471552168182
MC/DC100%2/2
$node->isa($self->node("If")) or $node->isa($self->node("For"))
$node->isa($self->node("If")) $node->isa($self->node("For"))
Truth table100%3/3
A or B
A= $node->isa($self->node("If"))B= $node->isa($self->node("For"))
ABresult
1X1
011
000
254 168182 return undef;
255 }
256  
257 3599 my $async = 0;
258 40914 ▶ $self->walk( $node, sub {
Subroutine __ANON__: called CC=6 SCAR=17.9
259 40914 my ($child) = @_;
260 40914 ▶ if ( $child->isa( $self->node('FilterAsync') )
Branch: 1 branch
BranchTrueFalseTotal
if ($child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync")) or $child->isa($self->node("AsyncEach")) or $child->isa($self->node("AsyncAll")) or $child->isa($self->node("CallExtensionAsync"))) 807 40107 40914
Condition91%11/12
$child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync")) or $child->isa($self->node("AsyncEach")) or $child->isa($self->node("AsyncAll")) or $child->isa($self->node("CallExtensionAsync"))
l!l&&r!l&&!r
807040107
$child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync")) or $child->isa($self->node("AsyncEach")) or $child->isa($self->node("AsyncAll"))
l!l&&r!l&&!r
7525540107
$child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync")) or $child->isa($self->node("AsyncEach"))
l!l&&r!l&&!r
5270040162
$child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync"))
l!l&&r!l&&!r
391340862
MC/DC80%4/5
$child->isa($self->node("FilterAsync")) or $child->isa($self->node("IfAsync")) or $child->isa($self->node("AsyncEach")) or $child->isa($self->node("AsyncAll")) or $child->isa($self->node("CallExtensionAsync"))
$child->isa($self->node("FilterAsync")) $child->isa($self->node("IfAsync")) $child->isa($self->node("AsyncEach")) $child->isa($self->node("AsyncAll")) $child->isa($self->node("CallExtensionAsync"))
Truth table83%5/6
A or B or C or D or E
A= $child->isa($self->node("FilterAsync"))B= $child->isa($self->node("IfAsync"))C= $child->isa($self->node("AsyncEach"))D= $child->isa($self->node("AsyncAll"))E= $child->isa($self->node("CallExtensionAsync"))
ABCDEresult
1XXXX1
01XXX1
001XX1
0001X1
000011
000000
261 || $child->isa( $self->node('IfAsync') )
262 || $child->isa( $self->node('AsyncEach') )
263 || $child->isa( $self->node('AsyncAll') )
264 || $child->isa( $self->node('CallExtensionAsync') ) ) {
265 807 $async = 1;
266 # Stop iterating by returning the node
267 807 return $child;
268 }
269 40107 return undef;
270 3599 } );
271  
272 3599 ▶ if ($async) {
Branch: 1 branch
BranchTrueFalseTotal
if ($async) 777 2822 3599
273 777 ▶ if ( $node->isa( $self->node('If') ) ) {
Branch: 2 branches
BranchTrueFalseTotal
if ($node->isa($self->node('If'))) { } 17 760 777
elsif ($node->isa($self->node('For')) and not $node->isa($self->node('AsyncAll'))) { } 705 55 760
274 17 return $self->node('IfAsync')->new(
275 $node->lineno,
276 $node->colno,
277 $node->cond,
278 $node->body,
279 $node->else_
280 );
281 }
282 ▶ elsif ( $node->isa( $self->node('For') ) && !( $node->isa( $self->node('AsyncAll') ) ) ) {
Condition66%2/3
$node->isa($self->node("For")) and not $node->isa($self->node("AsyncAll"))
!ll&&!rl&&r
055705
MC/DC50%1/2
$node->isa($self->node("For")) and not $node->isa($self->node("AsyncAll"))
$node->isa($self->node("For")) not $node->isa($self->node("AsyncAll"))
Truth table66%2/3
A and not(B)
A= $node->isa($self->node("For"))B= not $node->isa($self->node("AsyncAll"))
ABresult
0X0
100
111
283 705 return $self->node('AsyncEach')->new(
284 $node->lineno,
285 $node->colno,
286 $node->arr,
287 $node->name,
288 $node->body,
289 $node->else_
290 );
291 }
292 }
293 2877 return undef;
294 9380 } );
295 }
296  
297 #### cps
298  
299 9380 ▶sub cps {
Subroutine cps: called CC=1 SCAR=0.0
Pod undocumented
300 9380 my ( $self, $ast, $async_filters ) = @_;
301 9380 return $self->convert_statements( $self->lift_super( $self->lift_filters( $ast, $async_filters ) ) );
302 }
303  
304 #### module.exports.transform -- transform(ast, asyncFilters)
305  
306 9380 ▶sub transform {
Subroutine transform: called CC=2 SCAR=7.2
Pod undocumented
307 9380 my ( $self, $ast, $async_filters ) = @_;
308 9380 ▶ return $self->cps( $ast, $async_filters || [] );
Condition50%1/2
$async_filters || []
l!l
93800
MC/DC0%0/1
$async_filters || []
$async_filters
Truth table50%1/2
A
A= $async_filters
Aresult
11
00
309 }
310  
311 17 1;
312  
313 __END__
« blib/lib/Text/Nunjucks/Lib/TemplateError.pm ↑ Summary blib/lib/Text/Nunjucks/Lib.pm »