14 print " " x $x->{depth};
15 print qq({ "id": "$x->{seqn}", "name": "$x->{name}", "depth":$x->{depth}, "children":[ \n);
22 delete $seqn2node{$x->{seqn}};
23 my $self_size = 0; $self_size += $_ for values %{$x->{leaves}};
24 $x->{self_size} = $self_size;
25 if (my $parent = $stack[-1]) {
27 $x->{parent_seqn} = $parent->{seqn};
28 # accumulate into parent
29 $parent->{kids_node_count} += 1 + ($x->{kids_node_count}||0);
30 $parent->{kids_size} += $self_size + $x->{kids_size};
31 push @{$parent->{child_seqn}}, $x->{seqn};
36 print " " x $x->{depth};
37 my $size = $self_size + $x->{kids_size};
38 print qq(], "data":{ "\$area": $size } },\n);
43 print "memnodes = [" if $opt_json;
47 my ($type, $seqn, $val, $name, $extra) = split / /, $_, 5;
48 if ($type eq "N") { # Node ($val is depth)
49 while ($val < @stack) {
50 leave_node(my $x = pop @stack);
51 warn "N $seqn d$val ends $x->{seqn} d$x->{depth}: size $x->{self_size}+$x->{kids_size}\n";
53 die 1 if $stack[$val];
54 my $node = $stack[$val] = { seqn => $seqn, name => $name, extra => $extra, attr => [], leaves => {}, depth => $val, self_size=>0, kids_size=>0 };
56 $seqn2node{$seqn} = $node;
58 elsif ($type eq "L") { # Leaf name and memory size
59 my $node = $seqn2node{$seqn} || die;
60 $node->{leaves}{$name} += $val;
62 elsif ($type eq "A") { # Attribute name and value
63 my $node = $seqn2node{$seqn} || die;
64 push @{ $node->{attr} }, $name, $val; # pairs
67 warn "Invalid type '$type' on line $. ($_)";
73 leave_node($x = pop @stack) while @stack;
74 warn "EOF ends $x->{seqn} d$x->{depth}: size $x->{self_size}+$x->{kids_size}\n";
76 print " ];\n" if $opt_json;
80 warn Dumper(\%seqn2node);
83 SV(PVAV) fill=1/1 [#1 @0]
90 : : : : SV(PVAV) fill=-1/-1 [#5 @4]
98 N 1 0 SV(PVAV) fill=1/1
105 N 5 4 SV(PVAV) fill=-1/-1