Filename | C:/tmp64ng/perl/lib/B.pm |
Statements | Executed 56 statements in 15.6ms |
Calls | P | F | Exclusive Time |
Inclusive Time |
Subroutine |
---|---|---|---|---|---|
1 | 1 | 1 | 0s | 0s | BEGIN@17 | B::
1 | 1 | 1 | 0s | 0s | BEGIN@254 | B::
1 | 1 | 1 | 0s | 0s | BEGIN@9 | B::
0 | 0 | 0 | 0s | 0s | SAFENAME | B::GV::
0 | 0 | 0 | 0s | 0s | int_value | B::IV::
0 | 0 | 0 | 0s | 0s | add | B::Section::
0 | 0 | 0 | 0s | 0s | default | B::Section::
0 | 0 | 0 | 0s | 0s | get | B::Section::
0 | 0 | 0 | 0s | 0s | index | B::Section::
0 | 0 | 0 | 0s | 0s | name | B::Section::
0 | 0 | 0 | 0s | 0s | new | B::Section::
0 | 0 | 0 | 0s | 0s | output | B::Section::
0 | 0 | 0 | 0s | 0s | symtable | B::Section::
0 | 0 | 0 | 0s | 0s | class | B::
0 | 0 | 0 | 0s | 0s | clearsym | B::
0 | 0 | 0 | 0s | 0s | compile_stats | B::
0 | 0 | 0 | 0s | 0s | debug | B::
0 | 0 | 0 | 0s | 0s | objsym | B::
0 | 0 | 0 | 0s | 0s | parents | B::
0 | 0 | 0 | 0s | 0s | peekop | B::
0 | 0 | 0 | 0s | 0s | savesym | B::
1052 | 3 | 3 | 0s | 0s | svref_2object (xsub) | B::
0 | 0 | 0 | 0s | 0s | timing_info | B::
0 | 0 | 0 | 0s | 0s | walkoptree_exec | B::
0 | 0 | 0 | 0s | 0s | walkoptree_slow | B::
0 | 0 | 0 | 0s | 0s | walksymtable | B::
Line | State ments |
Time on line |
Calls | Time in subs |
Code |
---|---|---|---|---|---|
1 | # B.pm | ||||
2 | # | ||||
3 | # Copyright (c) 1996, 1997, 1998 Malcolm Beattie | ||||
4 | # | ||||
5 | # You may distribute under the terms of either the GNU General Public | ||||
6 | # License or the Artistic License, as specified in the README file. | ||||
7 | # | ||||
8 | package B; | ||||
9 | 2 | 0s | 2 | 0s | # spent 0s within B::BEGIN@9 which was called:
# once (0s+0s) by JSON::PP::BEGIN@11 at line 9 # spent 0s making 1 call to B::BEGIN@9
# spent 0s making 1 call to strict::import |
10 | |||||
11 | 1 | 0s | require Exporter; | ||
12 | 1 | 0s | @B::ISA = qw(Exporter); | ||
13 | |||||
14 | # walkoptree_slow comes from B.pm (you are there), | ||||
15 | # walkoptree comes from B.xs | ||||
16 | |||||
17 | # spent 0s within B::BEGIN@17 which was called:
# once (0s+0s) by JSON::PP::BEGIN@11 at line 28 | ||||
18 | 1 | 0s | $B::VERSION = '1.48'; | ||
19 | 1 | 0s | @B::EXPORT_OK = (); | ||
20 | |||||
21 | # Our BOOT code needs $VERSION set, and will append to @EXPORT_OK. | ||||
22 | # Want our constants loaded before the compiler meets OPf_KIDS below, as | ||||
23 | # the combination of having the constant stay a Proxy Constant Subroutine | ||||
24 | # and its value being inlined saves a little over .5K | ||||
25 | |||||
26 | 1 | 0s | require XSLoader; | ||
27 | 1 | 0s | 1 | 0s | XSLoader::load(); # spent 0s making 1 call to XSLoader::load |
28 | 1 | 0s | 1 | 0s | } # spent 0s making 1 call to B::BEGIN@17 |
29 | |||||
30 | 1 | 0s | push @B::EXPORT_OK, (qw(minus_c ppname save_BEGINs | ||
31 | class peekop cast_I32 cstring cchar hash threadsv_names | ||||
32 | main_root main_start main_cv svref_2object opnumber | ||||
33 | sub_generation amagic_generation perlstring | ||||
34 | walkoptree_slow walkoptree walkoptree_exec walksymtable | ||||
35 | parents comppadlist sv_undef compile_stats timing_info | ||||
36 | begin_av init_av check_av end_av regex_padav dowarn | ||||
37 | defstash curstash warnhook diehook inc_gv @optype | ||||
38 | @specialsv_name unitcheck_av)); | ||||
39 | |||||
40 | 1 | 0s | @B::SV::ISA = 'B::OBJECT'; | ||
41 | 1 | 0s | @B::NULL::ISA = 'B::SV'; | ||
42 | 1 | 0s | @B::PV::ISA = 'B::SV'; | ||
43 | 1 | 0s | @B::IV::ISA = 'B::SV'; | ||
44 | 1 | 0s | @B::NV::ISA = 'B::SV'; | ||
45 | # RV is eliminated with 5.11.0, but effectively is a specialisation of IV now. | ||||
46 | 1 | 0s | @B::RV::ISA = $] >= 5.011 ? 'B::IV' : 'B::SV'; | ||
47 | 1 | 0s | @B::PVIV::ISA = qw(B::PV B::IV); | ||
48 | 1 | 0s | @B::PVNV::ISA = qw(B::PVIV B::NV); | ||
49 | 1 | 0s | @B::PVMG::ISA = 'B::PVNV'; | ||
50 | 1 | 0s | @B::REGEXP::ISA = 'B::PVMG' if $] >= 5.011; | ||
51 | 1 | 0s | @B::INVLIST::ISA = 'B::PV' if $] >= 5.019; | ||
52 | 1 | 0s | @B::PVLV::ISA = 'B::GV'; | ||
53 | 1 | 0s | @B::BM::ISA = 'B::GV'; | ||
54 | 1 | 0s | @B::AV::ISA = 'B::PVMG'; | ||
55 | 1 | 0s | @B::GV::ISA = 'B::PVMG'; | ||
56 | 1 | 0s | @B::HV::ISA = 'B::PVMG'; | ||
57 | 1 | 0s | @B::CV::ISA = 'B::PVMG'; | ||
58 | 1 | 0s | @B::IO::ISA = 'B::PVMG'; | ||
59 | 1 | 0s | @B::FM::ISA = 'B::CV'; | ||
60 | |||||
61 | 1 | 0s | @B::OP::ISA = 'B::OBJECT'; | ||
62 | 1 | 0s | @B::UNOP::ISA = 'B::OP'; | ||
63 | 1 | 0s | @B::BINOP::ISA = 'B::UNOP'; | ||
64 | 1 | 0s | @B::LOGOP::ISA = 'B::UNOP'; | ||
65 | 1 | 0s | @B::LISTOP::ISA = 'B::BINOP'; | ||
66 | 1 | 0s | @B::SVOP::ISA = 'B::OP'; | ||
67 | 1 | 0s | @B::PADOP::ISA = 'B::OP'; | ||
68 | 1 | 0s | @B::PVOP::ISA = 'B::OP'; | ||
69 | 1 | 0s | @B::LOOP::ISA = 'B::LISTOP'; | ||
70 | 1 | 0s | @B::PMOP::ISA = 'B::LISTOP'; | ||
71 | 1 | 0s | @B::COP::ISA = 'B::OP'; | ||
72 | |||||
73 | 1 | 0s | @B::SPECIAL::ISA = 'B::OBJECT'; | ||
74 | |||||
75 | 1 | 0s | @B::optype = qw(OP UNOP BINOP LOGOP LISTOP PMOP SVOP PADOP PVOP LOOP COP); | ||
76 | # bytecode.pl contained the following comment: | ||||
77 | # Nullsv *must* come first in the following so that the condition | ||||
78 | # ($$sv == 0) can continue to be used to test (sv == Nullsv). | ||||
79 | 1 | 0s | @B::specialsv_name = qw(Nullsv &PL_sv_undef &PL_sv_yes &PL_sv_no | ||
80 | (SV*)pWARN_ALL (SV*)pWARN_NONE (SV*)pWARN_STD); | ||||
81 | |||||
82 | { | ||||
83 | # Stop "-w" from complaining about the lack of a real B::OBJECT class | ||||
84 | 1 | 0s | package B::OBJECT; | ||
85 | } | ||||
86 | |||||
87 | sub B::GV::SAFENAME { | ||||
88 | my $name = (shift())->NAME; | ||||
89 | |||||
90 | # The regex below corresponds to the isCONTROLVAR macro | ||||
91 | # from toke.c | ||||
92 | |||||
93 | $name =~ s/^\c?/^?/ | ||||
94 | or $name =~ s/^([\cA-\cZ\c\\c[\c]\c_\c^])/ | ||||
95 | "^" . chr( utf8::unicode_to_native( 64 ^ ord($1) ))/e; | ||||
96 | |||||
97 | # When we say unicode_to_native we really mean ascii_to_native, | ||||
98 | # which matters iff this is a non-ASCII platform (EBCDIC). '\c?' would | ||||
99 | # not have to be special cased, except for non-ASCII. | ||||
100 | |||||
101 | return $name; | ||||
102 | } | ||||
103 | |||||
104 | sub B::IV::int_value { | ||||
105 | my ($self) = @_; | ||||
106 | return (($self->FLAGS() & SVf_IVisUV()) ? $self->UVX : $self->IV); | ||||
107 | } | ||||
108 | |||||
109 | sub B::NULL::as_string() {""} | ||||
110 | 1 | 0s | *B::IV::as_string = \*B::IV::int_value; | ||
111 | 1 | 0s | *B::PV::as_string = \*B::PV::PV; | ||
112 | |||||
113 | # The input typemap checking makes no distinction between different SV types, | ||||
114 | # so the XS body will generate the same C code, despite the different XS | ||||
115 | # "types". So there is no change in behaviour from doing "newXS" like this, | ||||
116 | # compared with the old approach of having a (near) duplicate XS body. | ||||
117 | # We should fix the typemap checking. | ||||
118 | 1 | 0s | *B::IV::RV = \*B::PV::RV if $] > 5.012; | ||
119 | |||||
120 | 1 | 0s | my $debug; | ||
121 | 1 | 0s | my $op_count = 0; | ||
122 | 1 | 0s | my @parents = (); | ||
123 | |||||
124 | sub debug { | ||||
125 | my ($class, $value) = @_; | ||||
126 | $debug = $value; | ||||
127 | walkoptree_debug($value); | ||||
128 | } | ||||
129 | |||||
130 | sub class { | ||||
131 | my $obj = shift; | ||||
132 | my $name = ref $obj; | ||||
133 | $name =~ s/^.*:://; | ||||
134 | return $name; | ||||
135 | } | ||||
136 | |||||
137 | sub parents { \@parents } | ||||
138 | |||||
139 | # For debugging | ||||
140 | sub peekop { | ||||
141 | my $op = shift; | ||||
142 | return sprintf("%s (0x%x) %s", class($op), $$op, $op->name); | ||||
143 | } | ||||
144 | |||||
145 | sub walkoptree_slow { | ||||
146 | my($op, $method, $level) = @_; | ||||
147 | $op_count++; # just for statistics | ||||
148 | $level ||= 0; | ||||
149 | warn(sprintf("walkoptree: %d. %s\n", $level, peekop($op))) if $debug; | ||||
150 | $op->$method($level) if $op->can($method); | ||||
151 | if ($$op && ($op->flags & OPf_KIDS)) { | ||||
152 | my $kid; | ||||
153 | unshift(@parents, $op); | ||||
154 | for ($kid = $op->first; $$kid; $kid = $kid->sibling) { | ||||
155 | walkoptree_slow($kid, $method, $level + 1); | ||||
156 | } | ||||
157 | shift @parents; | ||||
158 | } | ||||
159 | if (class($op) eq 'PMOP' | ||||
160 | && ref($op->pmreplroot) | ||||
161 | && ${$op->pmreplroot} | ||||
162 | && $op->pmreplroot->isa( 'B::OP' )) | ||||
163 | { | ||||
164 | unshift(@parents, $op); | ||||
165 | walkoptree_slow($op->pmreplroot, $method, $level + 1); | ||||
166 | shift @parents; | ||||
167 | } | ||||
168 | } | ||||
169 | |||||
170 | sub compile_stats { | ||||
171 | return "Total number of OPs processed: $op_count\n"; | ||||
172 | } | ||||
173 | |||||
174 | sub timing_info { | ||||
175 | my ($sec, $min, $hr) = localtime; | ||||
176 | my ($user, $sys) = times; | ||||
177 | sprintf("%02d:%02d:%02d user=$user sys=$sys", | ||||
178 | $hr, $min, $sec, $user, $sys); | ||||
179 | } | ||||
180 | |||||
181 | 1 | 0s | my %symtable; | ||
182 | |||||
183 | sub clearsym { | ||||
184 | %symtable = (); | ||||
185 | } | ||||
186 | |||||
187 | sub savesym { | ||||
188 | my ($obj, $value) = @_; | ||||
189 | # warn(sprintf("savesym: sym_%x => %s\n", $$obj, $value)); # debug | ||||
190 | $symtable{sprintf("sym_%x", $$obj)} = $value; | ||||
191 | } | ||||
192 | |||||
193 | sub objsym { | ||||
194 | my $obj = shift; | ||||
195 | return $symtable{sprintf("sym_%x", $$obj)}; | ||||
196 | } | ||||
197 | |||||
198 | sub walkoptree_exec { | ||||
199 | my ($op, $method, $level) = @_; | ||||
200 | $level ||= 0; | ||||
201 | my ($sym, $ppname); | ||||
202 | my $prefix = " " x $level; | ||||
203 | for (; $$op; $op = $op->next) { | ||||
204 | $sym = objsym($op); | ||||
205 | if (defined($sym)) { | ||||
206 | print $prefix, "goto $sym\n"; | ||||
207 | return; | ||||
208 | } | ||||
209 | savesym($op, sprintf("%s (0x%lx)", class($op), $$op)); | ||||
210 | $op->$method($level); | ||||
211 | $ppname = $op->name; | ||||
212 | if ($ppname =~ | ||||
213 | /^(d?or(assign)?|and(assign)?|mapwhile|grepwhile|entertry|range|cond_expr)$/) | ||||
214 | { | ||||
215 | print $prefix, uc($1), " => {\n"; | ||||
216 | walkoptree_exec($op->other, $method, $level + 1); | ||||
217 | print $prefix, "}\n"; | ||||
218 | } elsif ($ppname eq "match" || $ppname eq "subst") { | ||||
219 | my $pmreplstart = $op->pmreplstart; | ||||
220 | if ($$pmreplstart) { | ||||
221 | print $prefix, "PMREPLSTART => {\n"; | ||||
222 | walkoptree_exec($pmreplstart, $method, $level + 1); | ||||
223 | print $prefix, "}\n"; | ||||
224 | } | ||||
225 | } elsif ($ppname eq "substcont") { | ||||
226 | print $prefix, "SUBSTCONT => {\n"; | ||||
227 | walkoptree_exec($op->other->pmreplstart, $method, $level + 1); | ||||
228 | print $prefix, "}\n"; | ||||
229 | $op = $op->other; | ||||
230 | } elsif ($ppname eq "enterloop") { | ||||
231 | print $prefix, "REDO => {\n"; | ||||
232 | walkoptree_exec($op->redoop, $method, $level + 1); | ||||
233 | print $prefix, "}\n", $prefix, "NEXT => {\n"; | ||||
234 | walkoptree_exec($op->nextop, $method, $level + 1); | ||||
235 | print $prefix, "}\n", $prefix, "LAST => {\n"; | ||||
236 | walkoptree_exec($op->lastop, $method, $level + 1); | ||||
237 | print $prefix, "}\n"; | ||||
238 | } elsif ($ppname eq "subst") { | ||||
239 | my $replstart = $op->pmreplstart; | ||||
240 | if ($$replstart) { | ||||
241 | print $prefix, "SUBST => {\n"; | ||||
242 | walkoptree_exec($replstart, $method, $level + 1); | ||||
243 | print $prefix, "}\n"; | ||||
244 | } | ||||
245 | } | ||||
246 | } | ||||
247 | } | ||||
248 | |||||
249 | sub walksymtable { | ||||
250 | my ($symref, $method, $recurse, $prefix) = @_; | ||||
251 | my $sym; | ||||
252 | my $ref; | ||||
253 | my $fullname; | ||||
254 | 2 | 15.6ms | 2 | 0s | # spent 0s within B::BEGIN@254 which was called:
# once (0s+0s) by JSON::PP::BEGIN@11 at line 254 # spent 0s making 1 call to B::BEGIN@254
# spent 0s making 1 call to strict::unimport |
255 | $prefix = '' unless defined $prefix; | ||||
256 | foreach my $sym ( sort keys %$symref ) { | ||||
257 | $ref= $symref->{$sym}; | ||||
258 | $fullname = "*main::".$prefix.$sym; | ||||
259 | if ($sym =~ /::$/) { | ||||
260 | $sym = $prefix . $sym; | ||||
261 | if (svref_2object(\*$sym)->NAME ne "main::" && $sym ne "<none>::" && &$recurse($sym)) { | ||||
262 | walksymtable(\%$fullname, $method, $recurse, $sym); | ||||
263 | } | ||||
264 | } else { | ||||
265 | svref_2object(\*$fullname)->$method(); | ||||
266 | } | ||||
267 | } | ||||
268 | } | ||||
269 | |||||
270 | { | ||||
271 | 1 | 0s | package B::Section; | ||
272 | 1 | 0s | my $output_fh; | ||
273 | 1 | 0s | my %sections; | ||
274 | |||||
275 | sub new { | ||||
276 | my ($class, $section, $symtable, $default) = @_; | ||||
277 | $output_fh ||= FileHandle->new_tmpfile; | ||||
278 | my $obj = bless [-1, $section, $symtable, $default], $class; | ||||
279 | $sections{$section} = $obj; | ||||
280 | return $obj; | ||||
281 | } | ||||
282 | |||||
283 | sub get { | ||||
284 | my ($class, $section) = @_; | ||||
285 | return $sections{$section}; | ||||
286 | } | ||||
287 | |||||
288 | sub add { | ||||
289 | my $section = shift; | ||||
290 | while (defined($_ = shift)) { | ||||
291 | print $output_fh "$section->[1]\t$_\n"; | ||||
292 | $section->[0]++; | ||||
293 | } | ||||
294 | } | ||||
295 | |||||
296 | sub index { | ||||
297 | my $section = shift; | ||||
298 | return $section->[0]; | ||||
299 | } | ||||
300 | |||||
301 | sub name { | ||||
302 | my $section = shift; | ||||
303 | return $section->[1]; | ||||
304 | } | ||||
305 | |||||
306 | sub symtable { | ||||
307 | my $section = shift; | ||||
308 | return $section->[2]; | ||||
309 | } | ||||
310 | |||||
311 | sub default { | ||||
312 | my $section = shift; | ||||
313 | return $section->[3]; | ||||
314 | } | ||||
315 | |||||
316 | sub output { | ||||
317 | my ($section, $fh, $format) = @_; | ||||
318 | my $name = $section->name; | ||||
319 | my $sym = $section->symtable || {}; | ||||
320 | my $default = $section->default; | ||||
321 | |||||
322 | seek($output_fh, 0, 0); | ||||
323 | while (<$output_fh>) { | ||||
324 | chomp; | ||||
325 | s/^(.*?)\t//; | ||||
326 | if ($1 eq $name) { | ||||
327 | s{(s\\_[0-9a-f]+)} { | ||||
328 | exists($sym->{$1}) ? $sym->{$1} : $default; | ||||
329 | }ge; | ||||
330 | printf $fh $format, $_; | ||||
331 | } | ||||
332 | } | ||||
333 | } | ||||
334 | } | ||||
335 | |||||
336 | 1 | 0s | 1; | ||
337 | |||||
338 | __END__ | ||||
# spent 0s within B::svref_2object which was called 1052 times, avg 0s/call:
# 734 times (0s+0s) by JSON::PP::value_to_json at line 405 of JSON/PP.pm, avg 0s/call
# 279 times (0s+0s) by CPAN::Meta::YAML::_has_internal_string_value at line 655 of CPAN/Meta/YAML.pm, avg 0s/call
# 39 times (0s+0s) by CPAN::Meta::Requirements::_find_magic_vstring at line 90 of CPAN/Meta/Requirements.pm, avg 0s/call |