26 #if defined (HAVE_CONFIG_H)
40 profiler::stats::stats ()
41 : m_time (0.0), m_calls (0), m_recursive (false),
42 m_parents (), m_children ()
46 profiler::stats::function_set_value (
const function_set& list)
52 for (
const auto& nm : list)
59 : m_parent (p), m_fcn_id (
f), m_children (), m_time (0.0), m_calls (0)
62 profiler::tree_node::~tree_node ()
64 for (
auto& idx_tnode : m_children)
65 delete idx_tnode.second;
73 child_map::iterator pos = m_children.find (fcn);
74 if (pos == m_children.end ())
76 retval =
new tree_node (
this, fcn);
77 m_children[fcn] = retval;
98 profiler::tree_node::build_flat (flat_profile& data)
const
104 stats& entry = data[m_fcn_id - 1];
106 entry.m_time += m_time;
107 entry.m_calls += m_calls;
110 if (m_parent->m_fcn_id != 0)
112 entry.m_parents.insert (m_parent->m_fcn_id);
113 data[m_parent->m_fcn_id - 1].m_children.insert (m_fcn_id);
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)
120 entry.m_recursive =
true;
126 for (
const auto& idx_tnode : m_children)
127 idx_tnode.second->build_flat (data);
131 profiler::tree_node::get_hierarchical (
double *total)
const
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);
147 for (
const auto& idx_tnode : m_children)
149 const tree_node& entry = *idx_tnode.second;
150 double child_total = entry.m_time;
155 rv_children(i) = entry.get_hierarchical (&child_total);
159 *total += child_total;
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);
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)
193 profiler::enter_function (
const std::string& fcn)
201 if (m_active_fcn && m_active_fcn != m_call_tree)
206 fcn_index_map::iterator pos = m_fcn_index.find (fcn);
207 if (pos == m_fcn_index.end ())
209 m_known_functions.push_back (fcn);
210 fcn_idx = m_known_functions.size ();
211 m_fcn_index[fcn] = fcn_idx;
214 fcn_idx = pos->second;
217 m_active_fcn = m_call_tree;
219 m_active_fcn = m_active_fcn->enter (fcn_idx);
221 m_last_time = query_time ();
226 profiler::exit_function (
const std::string& fcn)
242 fcn_index_map::iterator pos = m_fcn_index.find (fcn);
247 m_active_fcn = m_active_fcn->exit (pos->second);
251 m_last_time = query_time ();
259 error (
"profile: can't reset active profiler");
261 m_known_functions.clear ();
262 m_fcn_index.clear ();
267 m_call_tree =
new tree_node (
nullptr, 0);
268 m_active_fcn =
nullptr;
281 flat_profile flat (
n);
285 m_call_tree->build_flat (flat);
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);
300 rv_parents(i) = stats::function_set_value (flat[i].m_parents);
301 rv_children(i) = stats::function_set_value (flat[i].m_children);
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);
317 static const char *fn[] =
342 retval = m_call_tree->get_hierarchical ();
345 static const char *fn[] =
363 profiler::query_time ()
const
369 volatile double dnow = now.double_value ();
375 profiler::add_current_time ()
379 const double t = query_time ();
381 m_active_fcn->add_time (t - m_last_time);
386 DEFMETHOD (__profiler_enable__, interp, args, ,
392 int nargin = args.length ();
403 std::string status =
"off";
404 if (args(0).bool_value ())
415 DEFMETHOD (__profiler_reset__, interp, args, ,
421 if (args.length () != 0)
432 DEFMETHOD (__profiler_data__, interp, args, nargout,
438 if (args.length () != 0)
449 OCTAVE_END_NAMESPACE(
octave)
Vector representing the dimensions (size) of an Array.
Provides threadsafe access to octave.
bool gui_status_update(const std::string &feature, const std::string &status)
void assign(const std::string &k, const Cell &val)
octave_value get_flat() const
octave_value get_hierarchical() const
OCTAVE_BEGIN_NAMESPACE(octave) static octave_value daspk_fcn
#define DEFMETHOD(name, interp_name, args_name, nargout_name, doc)
Macro to define a builtin method.
void() error(const char *fmt,...)
#define panic_unless(cond)
F77_RET_T const F77_DBLE const F77_DBLE * f
return octave_value(v1.char_array_value() . concat(v2.char_array_value(), ra_idx),((a1.is_sq_string()||a2.is_sq_string()) ? '\'' :'"'))
octave_value_list ovl(const OV_Args &... args)
Construct an octave_value_list with less typing.