Mercurial > octave
comparison libinterp/parse-tree/profiler.cc @ 31607:aac27ad79be6 stable
maint: Re-indent code after switch to using namespace macros.
* build-env.h, build-env.in.cc, Cell.h, __betainc__.cc, __eigs__.cc,
__ftp__.cc, __ichol__.cc, __ilu__.cc, __isprimelarge__.cc, __magick_read__.cc,
__pchip_deriv__.cc, amd.cc, base-text-renderer.cc, base-text-renderer.h,
besselj.cc, bitfcns.cc, bsxfun.cc, c-file-ptr-stream.h, call-stack.cc,
call-stack.h, ccolamd.cc, cellfun.cc, chol.cc, colamd.cc, dasrt.cc, data.cc,
debug.cc, defaults.cc, defaults.h, det.cc, display.cc, display.h, dlmread.cc,
dynamic-ld.cc, dynamic-ld.h, ellipj.cc, environment.cc, environment.h,
error.cc, error.h, errwarn.h, event-manager.cc, event-manager.h,
event-queue.cc, event-queue.h, fcn-info.cc, fcn-info.h, fft.cc, fft2.cc,
file-io.cc, filter.cc, find.cc, ft-text-renderer.cc, ft-text-renderer.h,
gcd.cc, gl-render.cc, gl-render.h, gl2ps-print.cc, gl2ps-print.h,
graphics-toolkit.cc, graphics-toolkit.h, graphics.cc, gsvd.cc, gtk-manager.cc,
gtk-manager.h, help.cc, help.h, hook-fcn.cc, hook-fcn.h, input.cc, input.h,
interpreter-private.cc, interpreter-private.h, interpreter.cc, interpreter.h,
inv.cc, jsondecode.cc, jsonencode.cc, latex-text-renderer.cc,
latex-text-renderer.h, load-path.cc, load-path.h, load-save.cc, load-save.h,
lookup.cc, ls-hdf5.cc, ls-mat4.cc, ls-mat5.cc, lsode.cc, lu.cc, mappers.cc,
matrix_type.cc, max.cc, mex.cc, mexproto.h, mxarray.h, mxtypes.in.h,
oct-errno.in.cc, oct-hdf5-types.cc, oct-hist.cc, oct-hist.h, oct-map.cc,
oct-map.h, oct-opengl.h, oct-prcstrm.h, oct-process.cc, oct-process.h,
oct-stdstrm.h, oct-stream.cc, oct-stream.h, oct-strstrm.h,
octave-default-image.h, ordqz.cc, ordschur.cc, pager.cc, pager.h, pinv.cc,
pow2.cc, pr-output.cc, psi.cc, qr.cc, quadcc.cc, rand.cc, regexp.cc,
settings.cc, settings.h, sighandlers.cc, sighandlers.h, sparse-xpow.cc,
sqrtm.cc, stack-frame.cc, stack-frame.h, stream-euler.cc, strfns.cc, svd.cc,
syminfo.cc, syminfo.h, symrcm.cc, symrec.cc, symrec.h, symscope.cc, symscope.h,
symtab.cc, symtab.h, sysdep.cc, sysdep.h, text-engine.cc, text-engine.h,
text-renderer.cc, text-renderer.h, time.cc, toplev.cc, typecast.cc,
url-handle-manager.cc, url-handle-manager.h, urlwrite.cc, utils.cc, utils.h,
variables.cc, variables.h, xdiv.cc, __delaunayn__.cc, __init_fltk__.cc,
__init_gnuplot__.cc, __ode15__.cc, __voronoi__.cc, audioread.cc, convhulln.cc,
gzip.cc, cdef-class.cc, cdef-class.h, cdef-fwd.h, cdef-manager.cc,
cdef-manager.h, cdef-method.cc, cdef-method.h, cdef-object.cc, cdef-object.h,
cdef-package.cc, cdef-package.h, cdef-property.cc, cdef-property.h,
cdef-utils.cc, cdef-utils.h, ov-base-diag.cc, ov-base-int.cc, ov-base-mat.cc,
ov-base-mat.h, ov-base-scalar.cc, ov-base.cc, ov-base.h, ov-bool-mat.cc,
ov-bool-mat.h, ov-bool-sparse.cc, ov-bool.cc, ov-builtin.h, ov-cell.cc,
ov-ch-mat.cc, ov-class.cc, ov-class.h, ov-classdef.cc, ov-classdef.h,
ov-complex.cc, ov-cx-diag.cc, ov-cx-mat.cc, ov-cx-sparse.cc, ov-dld-fcn.cc,
ov-dld-fcn.h, ov-fcn-handle.cc, ov-fcn-handle.h, ov-fcn.h, ov-float.cc,
ov-flt-complex.cc, ov-flt-cx-diag.cc, ov-flt-cx-mat.cc, ov-flt-re-diag.cc,
ov-flt-re-mat.cc, ov-flt-re-mat.h, ov-intx.h, ov-java.cc, ov-lazy-idx.cc,
ov-legacy-range.cc, ov-magic-int.cc, ov-mex-fcn.cc, ov-mex-fcn.h,
ov-null-mat.cc, ov-perm.cc, ov-range.cc, ov-re-diag.cc, ov-re-mat.cc,
ov-re-mat.h, ov-re-sparse.cc, ov-scalar.cc, ov-str-mat.cc, ov-struct.cc,
ov-typeinfo.cc, ov-typeinfo.h, ov-usr-fcn.cc, ov-usr-fcn.h, ov.cc, ov.h, ovl.h,
octave.cc, octave.h, op-b-sbm.cc, op-bm-sbm.cc, op-cs-scm.cc, op-fm-fcm.cc,
op-fs-fcm.cc, op-s-scm.cc, op-scm-cs.cc, op-scm-s.cc, op-sm-cs.cc, ops.h,
anon-fcn-validator.cc, anon-fcn-validator.h, bp-table.cc, bp-table.h,
comment-list.cc, comment-list.h, filepos.h, lex.h, oct-lvalue.cc, oct-lvalue.h,
parse.h, profiler.cc, profiler.h, pt-anon-scopes.cc, pt-anon-scopes.h,
pt-arg-list.cc, pt-arg-list.h, pt-args-block.cc, pt-args-block.h,
pt-array-list.cc, pt-array-list.h, pt-assign.cc, pt-assign.h, pt-binop.cc,
pt-binop.h, pt-bp.cc, pt-bp.h, pt-cbinop.cc, pt-cbinop.h, pt-cell.cc,
pt-cell.h, pt-check.cc, pt-check.h, pt-classdef.cc, pt-classdef.h, pt-cmd.h,
pt-colon.cc, pt-colon.h, pt-const.cc, pt-const.h, pt-decl.cc, pt-decl.h,
pt-eval.cc, pt-eval.h, pt-except.cc, pt-except.h, pt-exp.cc, pt-exp.h,
pt-fcn-handle.cc, pt-fcn-handle.h, pt-id.cc, pt-id.h, pt-idx.cc, pt-idx.h,
pt-jump.h, pt-loop.cc, pt-loop.h, pt-mat.cc, pt-mat.h, pt-misc.cc, pt-misc.h,
pt-pr-code.cc, pt-pr-code.h, pt-select.cc, pt-select.h, pt-spmd.cc, pt-spmd.h,
pt-stmt.cc, pt-stmt.h, pt-tm-const.cc, pt-tm-const.h, pt-unop.cc, pt-unop.h,
pt-walk.cc, pt-walk.h, pt.cc, pt.h, token.cc, token.h, Range.cc, Range.h,
idx-vector.cc, idx-vector.h, range-fwd.h, CollocWt.cc, CollocWt.h,
aepbalance.cc, aepbalance.h, chol.cc, chol.h, gepbalance.cc, gepbalance.h,
gsvd.cc, gsvd.h, hess.cc, hess.h, lo-mappers.cc, lo-mappers.h, lo-specfun.cc,
lo-specfun.h, lu.cc, lu.h, oct-convn.cc, oct-convn.h, oct-fftw.cc, oct-fftw.h,
oct-norm.cc, oct-norm.h, oct-rand.cc, oct-rand.h, oct-spparms.cc,
oct-spparms.h, qr.cc, qr.h, qrp.cc, qrp.h, randgamma.cc, randgamma.h,
randmtzig.cc, randmtzig.h, randpoisson.cc, randpoisson.h, schur.cc, schur.h,
sparse-chol.cc, sparse-chol.h, sparse-lu.cc, sparse-lu.h, sparse-qr.cc,
sparse-qr.h, svd.cc, svd.h, child-list.cc, child-list.h, dir-ops.cc, dir-ops.h,
file-ops.cc, file-ops.h, file-stat.cc, file-stat.h, lo-sysdep.cc, lo-sysdep.h,
lo-sysinfo.cc, lo-sysinfo.h, mach-info.cc, mach-info.h, oct-env.cc, oct-env.h,
oct-group.cc, oct-group.h, oct-password.cc, oct-password.h, oct-syscalls.cc,
oct-syscalls.h, oct-time.cc, oct-time.h, oct-uname.cc, oct-uname.h,
action-container.cc, action-container.h, base-list.h, cmd-edit.cc, cmd-edit.h,
cmd-hist.cc, cmd-hist.h, f77-fcn.h, file-info.cc, file-info.h,
lo-array-errwarn.cc, lo-array-errwarn.h, lo-hash.cc, lo-hash.h, lo-ieee.h,
lo-regexp.cc, lo-regexp.h, lo-utils.cc, lo-utils.h, oct-base64.cc,
oct-base64.h, oct-glob.cc, oct-glob.h, oct-inttypes.h, oct-mutex.cc,
oct-mutex.h, oct-refcount.h, oct-shlib.cc, oct-shlib.h, oct-sparse.cc,
oct-sparse.h, oct-string.h, octave-preserve-stream-state.h, pathsearch.cc,
pathsearch.h, quit.cc, quit.h, unwind-prot.cc, unwind-prot.h, url-transfer.cc,
url-transfer.h:
Re-indent code after switch to using namespace macros.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 01 Dec 2022 18:02:15 -0800 |
parents | e88a07dec498 |
children | 597f3ee61a48 |
comparison
equal
deleted
inserted
replaced
31605:e88a07dec498 | 31607:aac27ad79be6 |
---|---|
35 #include "pager.h" | 35 #include "pager.h" |
36 #include "profiler.h" | 36 #include "profiler.h" |
37 | 37 |
38 OCTAVE_BEGIN_NAMESPACE(octave) | 38 OCTAVE_BEGIN_NAMESPACE(octave) |
39 | 39 |
40 profiler::stats::stats (void) | 40 profiler::stats::stats (void) |
41 : m_time (0.0), m_calls (0), m_recursive (false), | 41 : m_time (0.0), m_calls (0), m_recursive (false), |
42 m_parents (), m_children () | 42 m_parents (), m_children () |
43 { } | 43 { } |
44 | 44 |
45 octave_value | 45 octave_value |
46 profiler::stats::function_set_value (const function_set& list) | 46 profiler::stats::function_set_value (const function_set& list) |
47 { | 47 { |
48 const octave_idx_type n = list.size (); | 48 const octave_idx_type n = list.size (); |
49 | 49 |
50 RowVector retval (n); | 50 RowVector retval (n); |
51 octave_idx_type i = 0; | 51 octave_idx_type i = 0; |
52 for (const auto& nm : list) | 52 for (const auto& nm : list) |
53 retval(i++) = nm; | 53 retval(i++) = nm; |
54 | 54 |
55 return retval; | 55 return retval; |
56 } | 56 } |
57 | 57 |
58 profiler::tree_node::tree_node (tree_node *p, octave_idx_type f) | 58 profiler::tree_node::tree_node (tree_node *p, octave_idx_type f) |
59 : m_parent (p), m_fcn_id (f), m_children (), m_time (0.0), m_calls (0) | 59 : m_parent (p), m_fcn_id (f), m_children (), m_time (0.0), m_calls (0) |
60 { } | 60 { } |
61 | 61 |
62 profiler::tree_node::~tree_node () | 62 profiler::tree_node::~tree_node () |
63 { | 63 { |
64 for (auto& idx_tnode : m_children) | 64 for (auto& idx_tnode : m_children) |
65 delete idx_tnode.second; | 65 delete idx_tnode.second; |
66 } | 66 } |
67 | 67 |
68 profiler::tree_node* | 68 profiler::tree_node * |
69 profiler::tree_node::enter (octave_idx_type fcn) | 69 profiler::tree_node::enter (octave_idx_type fcn) |
70 { | 70 { |
71 tree_node *retval; | 71 tree_node *retval; |
72 | 72 |
73 child_map::iterator pos = m_children.find (fcn); | 73 child_map::iterator pos = m_children.find (fcn); |
74 if (pos == m_children.end ()) | 74 if (pos == m_children.end ()) |
75 { | |
76 retval = new tree_node (this, fcn); | |
77 m_children[fcn] = retval; | |
78 } | |
79 else | |
80 retval = pos->second; | |
81 | |
82 ++retval->m_calls; | |
83 return retval; | |
84 } | |
85 | |
86 profiler::tree_node * | |
87 profiler::tree_node::exit (octave_idx_type /* fcn */) | |
88 { | |
89 // FIXME: These panic_unless statements don't make sense if profile() is | |
90 // called from within a function hierarchy to begin with. See bug #39587. | |
91 // panic_unless (m_parent); | |
92 // panic_unless (m_fcn_id == fcn); | |
93 | |
94 return m_parent; | |
95 } | |
96 | |
97 void | |
98 profiler::tree_node::build_flat (flat_profile& data) const | |
99 { | |
100 // If this is not the top-level node, | |
101 // update profile entry for this function. | |
102 if (m_fcn_id != 0) | |
103 { | |
104 stats& entry = data[m_fcn_id - 1]; | |
105 | |
106 entry.m_time += m_time; | |
107 entry.m_calls += m_calls; | |
108 | |
109 panic_unless (m_parent); | |
110 if (m_parent->m_fcn_id != 0) | |
111 { | |
112 entry.m_parents.insert (m_parent->m_fcn_id); | |
113 data[m_parent->m_fcn_id - 1].m_children.insert (m_fcn_id); | |
114 } | |
115 | |
116 if (! entry.m_recursive) | |
117 for (const tree_node *i = m_parent; i; i = i->m_parent) | |
118 if (i->m_fcn_id == m_fcn_id) | |
119 { | |
120 entry.m_recursive = true; | |
121 break; | |
122 } | |
123 } | |
124 | |
125 // Recurse on children. | |
126 for (const auto& idx_tnode : m_children) | |
127 idx_tnode.second->build_flat (data); | |
128 } | |
129 | |
130 octave_value | |
131 profiler::tree_node::get_hierarchical (double *total) const | |
132 { | |
133 // Note that we don't generate the entry just for this node, but | |
134 // rather a struct-array with entries for all children. This way, the | |
135 // top-node (for which we don't want a real entry) generates already | |
136 // the final hierarchical profile data. | |
137 | |
138 const octave_idx_type n = m_children.size (); | |
139 | |
140 Cell rv_indices (n, 1); | |
141 Cell rv_times (n, 1); | |
142 Cell rv_totals (n, 1); | |
143 Cell rv_calls (n, 1); | |
144 Cell rv_children (n, 1); | |
145 | |
146 octave_idx_type i = 0; | |
147 for (const auto& idx_tnode : m_children) | |
148 { | |
149 const tree_node& entry = *idx_tnode.second; | |
150 double child_total = entry.m_time; | |
151 | |
152 rv_indices(i) = octave_value (idx_tnode.first); | |
153 rv_times(i) = octave_value (entry.m_time); | |
154 rv_calls(i) = octave_value (entry.m_calls); | |
155 rv_children(i) = entry.get_hierarchical (&child_total); | |
156 rv_totals(i) = octave_value (child_total); | |
157 | |
158 if (total) | |
159 *total += child_total; | |
160 | |
161 ++i; | |
162 } | |
163 | |
164 octave_map retval; | |
165 | |
166 retval.assign ("Index", rv_indices); | |
167 retval.assign ("SelfTime", rv_times); | |
168 retval.assign ("TotalTime", rv_totals); | |
169 retval.assign ("NumCalls", rv_calls); | |
170 retval.assign ("Children", rv_children); | |
171 | |
172 return retval; | |
173 } | |
174 | |
175 profiler::profiler (void) | |
176 : m_known_functions (), m_fcn_index (), | |
177 m_enabled (false), m_call_tree (new tree_node (nullptr, 0)), | |
178 m_active_fcn (nullptr), m_last_time (-1.0) | |
179 { } | |
180 | |
181 profiler::~profiler (void) | |
182 { | |
183 delete m_call_tree; | |
184 } | |
185 | |
186 void | |
187 profiler::set_active (bool value) | |
188 { | |
189 m_enabled = value; | |
190 } | |
191 | |
192 void | |
193 profiler::enter_function (const std::string& fcn) | |
194 { | |
195 // The enter class will check and only call us if the profiler is active. | |
196 panic_unless (enabled ()); | |
197 panic_unless (m_call_tree); | |
198 | |
199 // If there is already an active function, add to its time before | |
200 // pushing the new one. | |
201 if (m_active_fcn && m_active_fcn != m_call_tree) | |
202 add_current_time (); | |
203 | |
204 // Map the function's name to its index. | |
205 octave_idx_type fcn_idx; | |
206 fcn_index_map::iterator pos = m_fcn_index.find (fcn); | |
207 if (pos == m_fcn_index.end ()) | |
208 { | |
209 m_known_functions.push_back (fcn); | |
210 fcn_idx = m_known_functions.size (); | |
211 m_fcn_index[fcn] = fcn_idx; | |
212 } | |
213 else | |
214 fcn_idx = pos->second; | |
215 | |
216 if (! m_active_fcn) | |
217 m_active_fcn = m_call_tree; | |
218 | |
219 m_active_fcn = m_active_fcn->enter (fcn_idx); | |
220 | |
221 m_last_time = query_time (); | |
222 | |
223 } | |
224 | |
225 void | |
226 profiler::exit_function (const std::string& fcn) | |
227 { | |
228 if (m_active_fcn) | |
229 { | |
230 panic_unless (m_call_tree); | |
231 // FIXME: This panic_unless statements doesn't make sense if profile() | |
232 // is called from within a function hierarchy to begin with. | |
233 // See bug #39587. | |
234 // panic_unless (m_active_fcn != m_call_tree); | |
235 | |
236 // Usually, if we are disabled this function is not even called. But | |
237 // the call disabling the profiler is an exception. So also check here | |
238 // and only record the time if enabled. | |
239 if (enabled ()) | |
240 add_current_time (); | |
241 | |
242 fcn_index_map::iterator pos = m_fcn_index.find (fcn); | |
243 // FIXME: This panic_unless statements doesn't make sense if profile() | |
244 // is called from within a function hierarchy to begin with. | |
245 // See bug #39587. | |
246 // panic_unless (pos != m_fcn_index.end ()); | |
247 m_active_fcn = m_active_fcn->exit (pos->second); | |
248 | |
249 // If this was an "inner call", we resume executing the parent function | |
250 // up the stack. So note the start-time for this! | |
251 m_last_time = query_time (); | |
252 } | |
253 } | |
254 | |
255 void | |
256 profiler::reset (void) | |
257 { | |
258 if (enabled ()) | |
259 error ("profile: can't reset active profiler"); | |
260 | |
261 m_known_functions.clear (); | |
262 m_fcn_index.clear (); | |
263 | |
264 if (m_call_tree) | |
265 { | |
266 delete m_call_tree; | |
267 m_call_tree = new tree_node (nullptr, 0); | |
268 m_active_fcn = nullptr; | |
269 } | |
270 | |
271 m_last_time = -1.0; | |
272 } | |
273 | |
274 octave_value | |
275 profiler::get_flat (void) const | |
276 { | |
277 octave_value retval; | |
278 | |
279 const octave_idx_type n = m_known_functions.size (); | |
280 | |
281 flat_profile flat (n); | |
282 | |
283 if (m_call_tree) | |
284 { | |
285 m_call_tree->build_flat (flat); | |
286 | |
287 Cell rv_names (n, 1); | |
288 Cell rv_times (n, 1); | |
289 Cell rv_calls (n, 1); | |
290 Cell rv_recursive (n, 1); | |
291 Cell rv_parents (n, 1); | |
292 Cell rv_children (n, 1); | |
293 | |
294 for (octave_idx_type i = 0; i != n; ++i) | |
295 { | |
296 rv_names(i) = octave_value (m_known_functions[i]); | |
297 rv_times(i) = octave_value (flat[i].m_time); | |
298 rv_calls(i) = octave_value (flat[i].m_calls); | |
299 rv_recursive(i) = octave_value (flat[i].m_recursive); | |
300 rv_parents(i) = stats::function_set_value (flat[i].m_parents); | |
301 rv_children(i) = stats::function_set_value (flat[i].m_children); | |
302 } | |
303 | |
304 octave_map m; | |
305 | |
306 m.assign ("FunctionName", rv_names); | |
307 m.assign ("TotalTime", rv_times); | |
308 m.assign ("NumCalls", rv_calls); | |
309 m.assign ("IsRecursive", rv_recursive); | |
310 m.assign ("Parents", rv_parents); | |
311 m.assign ("Children", rv_children); | |
312 | |
313 retval = m; | |
314 } | |
315 else | |
316 { | |
317 static const char *fn[] = | |
75 { | 318 { |
76 retval = new tree_node (this, fcn); | 319 "FunctionName", |
77 m_children[fcn] = retval; | 320 "TotalTime", |
78 } | 321 "NumCalls", |
79 else | 322 "IsRecursive", |
80 retval = pos->second; | 323 "Parents", |
81 | 324 "Children", |
82 ++retval->m_calls; | 325 nullptr |
83 return retval; | 326 }; |
84 } | 327 |
85 | 328 static octave_map m (dim_vector (0, 1), string_vector (fn)); |
86 profiler::tree_node* | 329 |
87 profiler::tree_node::exit (octave_idx_type /* fcn */) | 330 retval = m; |
88 { | 331 } |
89 // FIXME: These panic_unless statements don't make sense if profile() is | 332 |
90 // called from within a function hierarchy to begin with. See bug #39587. | 333 return retval; |
91 // panic_unless (m_parent); | 334 } |
92 // panic_unless (m_fcn_id == fcn); | 335 |
93 | 336 octave_value |
94 return m_parent; | 337 profiler::get_hierarchical (void) const |
95 } | 338 { |
96 | 339 octave_value retval; |
97 void | 340 |
98 profiler::tree_node::build_flat (flat_profile& data) const | 341 if (m_call_tree) |
99 { | 342 retval = m_call_tree->get_hierarchical (); |
100 // If this is not the top-level node, | 343 else |
101 // update profile entry for this function. | 344 { |
102 if (m_fcn_id != 0) | 345 static const char *fn[] = |
103 { | 346 { |
104 stats& entry = data[m_fcn_id - 1]; | 347 "Index", |
105 | 348 "SelfTime", |
106 entry.m_time += m_time; | 349 "NumCalls", |
107 entry.m_calls += m_calls; | 350 "Children", |
108 | 351 nullptr |
109 panic_unless (m_parent); | 352 }; |
110 if (m_parent->m_fcn_id != 0) | 353 |
111 { | 354 static octave_map m (dim_vector (0, 1), string_vector (fn)); |
112 entry.m_parents.insert (m_parent->m_fcn_id); | 355 |
113 data[m_parent->m_fcn_id - 1].m_children.insert (m_fcn_id); | 356 retval = m; |
114 } | 357 } |
115 | 358 |
116 if (! entry.m_recursive) | 359 return retval; |
117 for (const tree_node *i = m_parent; i; i = i->m_parent) | 360 } |
118 if (i->m_fcn_id == m_fcn_id) | 361 |
119 { | 362 double |
120 entry.m_recursive = true; | 363 profiler::query_time (void) const |
121 break; | 364 { |
122 } | 365 sys::time now; |
123 } | 366 |
124 | 367 // FIXME: is this volatile declaration really needed? |
125 // Recurse on children. | 368 // See bug #34210 for additional details. |
126 for (const auto& idx_tnode : m_children) | 369 volatile double dnow = now.double_value (); |
127 idx_tnode.second->build_flat (data); | 370 |
128 } | 371 return dnow; |
129 | 372 } |
130 octave_value | 373 |
131 profiler::tree_node::get_hierarchical (double *total) const | 374 void |
132 { | 375 profiler::add_current_time (void) |
133 // Note that we don't generate the entry just for this node, but | 376 { |
134 // rather a struct-array with entries for all children. This way, the | 377 if (m_active_fcn) |
135 // top-node (for which we don't want a real entry) generates already | 378 { |
136 // the final hierarchical profile data. | 379 const double t = query_time (); |
137 | 380 |
138 const octave_idx_type n = m_children.size (); | 381 m_active_fcn->add_time (t - m_last_time); |
139 | 382 } |
140 Cell rv_indices (n, 1); | 383 } |
141 Cell rv_times (n, 1); | |
142 Cell rv_totals (n, 1); | |
143 Cell rv_calls (n, 1); | |
144 Cell rv_children (n, 1); | |
145 | |
146 octave_idx_type i = 0; | |
147 for (const auto& idx_tnode : m_children) | |
148 { | |
149 const tree_node& entry = *idx_tnode.second; | |
150 double child_total = entry.m_time; | |
151 | |
152 rv_indices(i) = octave_value (idx_tnode.first); | |
153 rv_times(i) = octave_value (entry.m_time); | |
154 rv_calls(i) = octave_value (entry.m_calls); | |
155 rv_children(i) = entry.get_hierarchical (&child_total); | |
156 rv_totals(i) = octave_value (child_total); | |
157 | |
158 if (total) | |
159 *total += child_total; | |
160 | |
161 ++i; | |
162 } | |
163 | |
164 octave_map retval; | |
165 | |
166 retval.assign ("Index", rv_indices); | |
167 retval.assign ("SelfTime", rv_times); | |
168 retval.assign ("TotalTime", rv_totals); | |
169 retval.assign ("NumCalls", rv_calls); | |
170 retval.assign ("Children", rv_children); | |
171 | |
172 return retval; | |
173 } | |
174 | |
175 profiler::profiler (void) | |
176 : m_known_functions (), m_fcn_index (), | |
177 m_enabled (false), m_call_tree (new tree_node (nullptr, 0)), | |
178 m_active_fcn (nullptr), m_last_time (-1.0) | |
179 { } | |
180 | |
181 profiler::~profiler (void) | |
182 { | |
183 delete m_call_tree; | |
184 } | |
185 | |
186 void | |
187 profiler::set_active (bool value) | |
188 { | |
189 m_enabled = value; | |
190 } | |
191 | |
192 void | |
193 profiler::enter_function (const std::string& fcn) | |
194 { | |
195 // The enter class will check and only call us if the profiler is active. | |
196 panic_unless (enabled ()); | |
197 panic_unless (m_call_tree); | |
198 | |
199 // If there is already an active function, add to its time before | |
200 // pushing the new one. | |
201 if (m_active_fcn && m_active_fcn != m_call_tree) | |
202 add_current_time (); | |
203 | |
204 // Map the function's name to its index. | |
205 octave_idx_type fcn_idx; | |
206 fcn_index_map::iterator pos = m_fcn_index.find (fcn); | |
207 if (pos == m_fcn_index.end ()) | |
208 { | |
209 m_known_functions.push_back (fcn); | |
210 fcn_idx = m_known_functions.size (); | |
211 m_fcn_index[fcn] = fcn_idx; | |
212 } | |
213 else | |
214 fcn_idx = pos->second; | |
215 | |
216 if (! m_active_fcn) | |
217 m_active_fcn = m_call_tree; | |
218 | |
219 m_active_fcn = m_active_fcn->enter (fcn_idx); | |
220 | |
221 m_last_time = query_time (); | |
222 | |
223 } | |
224 | |
225 void | |
226 profiler::exit_function (const std::string& fcn) | |
227 { | |
228 if (m_active_fcn) | |
229 { | |
230 panic_unless (m_call_tree); | |
231 // FIXME: This panic_unless statements doesn't make sense if profile() | |
232 // is called from within a function hierarchy to begin with. | |
233 // See bug #39587. | |
234 // panic_unless (m_active_fcn != m_call_tree); | |
235 | |
236 // Usually, if we are disabled this function is not even called. But | |
237 // the call disabling the profiler is an exception. So also check here | |
238 // and only record the time if enabled. | |
239 if (enabled ()) | |
240 add_current_time (); | |
241 | |
242 fcn_index_map::iterator pos = m_fcn_index.find (fcn); | |
243 // FIXME: This panic_unless statements doesn't make sense if profile() | |
244 // is called from within a function hierarchy to begin with. | |
245 // See bug #39587. | |
246 // panic_unless (pos != m_fcn_index.end ()); | |
247 m_active_fcn = m_active_fcn->exit (pos->second); | |
248 | |
249 // If this was an "inner call", we resume executing the parent function | |
250 // up the stack. So note the start-time for this! | |
251 m_last_time = query_time (); | |
252 } | |
253 } | |
254 | |
255 void | |
256 profiler::reset (void) | |
257 { | |
258 if (enabled ()) | |
259 error ("profile: can't reset active profiler"); | |
260 | |
261 m_known_functions.clear (); | |
262 m_fcn_index.clear (); | |
263 | |
264 if (m_call_tree) | |
265 { | |
266 delete m_call_tree; | |
267 m_call_tree = new tree_node (nullptr, 0); | |
268 m_active_fcn = nullptr; | |
269 } | |
270 | |
271 m_last_time = -1.0; | |
272 } | |
273 | |
274 octave_value | |
275 profiler::get_flat (void) const | |
276 { | |
277 octave_value retval; | |
278 | |
279 const octave_idx_type n = m_known_functions.size (); | |
280 | |
281 flat_profile flat (n); | |
282 | |
283 if (m_call_tree) | |
284 { | |
285 m_call_tree->build_flat (flat); | |
286 | |
287 Cell rv_names (n, 1); | |
288 Cell rv_times (n, 1); | |
289 Cell rv_calls (n, 1); | |
290 Cell rv_recursive (n, 1); | |
291 Cell rv_parents (n, 1); | |
292 Cell rv_children (n, 1); | |
293 | |
294 for (octave_idx_type i = 0; i != n; ++i) | |
295 { | |
296 rv_names(i) = octave_value (m_known_functions[i]); | |
297 rv_times(i) = octave_value (flat[i].m_time); | |
298 rv_calls(i) = octave_value (flat[i].m_calls); | |
299 rv_recursive(i) = octave_value (flat[i].m_recursive); | |
300 rv_parents(i) = stats::function_set_value (flat[i].m_parents); | |
301 rv_children(i) = stats::function_set_value (flat[i].m_children); | |
302 } | |
303 | |
304 octave_map m; | |
305 | |
306 m.assign ("FunctionName", rv_names); | |
307 m.assign ("TotalTime", rv_times); | |
308 m.assign ("NumCalls", rv_calls); | |
309 m.assign ("IsRecursive", rv_recursive); | |
310 m.assign ("Parents", rv_parents); | |
311 m.assign ("Children", rv_children); | |
312 | |
313 retval = m; | |
314 } | |
315 else | |
316 { | |
317 static const char *fn[] = | |
318 { | |
319 "FunctionName", | |
320 "TotalTime", | |
321 "NumCalls", | |
322 "IsRecursive", | |
323 "Parents", | |
324 "Children", | |
325 nullptr | |
326 }; | |
327 | |
328 static octave_map m (dim_vector (0, 1), string_vector (fn)); | |
329 | |
330 retval = m; | |
331 } | |
332 | |
333 return retval; | |
334 } | |
335 | |
336 octave_value | |
337 profiler::get_hierarchical (void) const | |
338 { | |
339 octave_value retval; | |
340 | |
341 if (m_call_tree) | |
342 retval = m_call_tree->get_hierarchical (); | |
343 else | |
344 { | |
345 static const char *fn[] = | |
346 { | |
347 "Index", | |
348 "SelfTime", | |
349 "NumCalls", | |
350 "Children", | |
351 nullptr | |
352 }; | |
353 | |
354 static octave_map m (dim_vector (0, 1), string_vector (fn)); | |
355 | |
356 retval = m; | |
357 } | |
358 | |
359 return retval; | |
360 } | |
361 | |
362 double | |
363 profiler::query_time (void) const | |
364 { | |
365 sys::time now; | |
366 | |
367 // FIXME: is this volatile declaration really needed? | |
368 // See bug #34210 for additional details. | |
369 volatile double dnow = now.double_value (); | |
370 | |
371 return dnow; | |
372 } | |
373 | |
374 void | |
375 profiler::add_current_time (void) | |
376 { | |
377 if (m_active_fcn) | |
378 { | |
379 const double t = query_time (); | |
380 | |
381 m_active_fcn->add_time (t - m_last_time); | |
382 } | |
383 } | |
384 | 384 |
385 // Enable or disable the profiler data collection. | 385 // Enable or disable the profiler data collection. |
386 DEFMETHOD (__profiler_enable__, interp, args, , | 386 DEFMETHOD (__profiler_enable__, interp, args, , |
387 doc: /* -*- texinfo -*- | 387 doc: /* -*- texinfo -*- |
388 @deftypefn {} {@var{state} =} __profiler_enable__ () | 388 @deftypefn {} {@var{state} =} __profiler_enable__ () |