<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.15"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: profiler_node.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(initResizable); /* @license-end */</script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.15 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(function(){initNavTree('a00839_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">profiler_node.h</div> </div> </div><!--header--> <div class="contents"> <a href="a00839.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2009-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">//</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License along</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// with this library; see the file COPYING3. If not see</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">/** @file profile/impl/profiler_node.h</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * @brief Data structures to represent a single profiling event.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> */</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// Written by Lixia Liu and Silvius Rus.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#ifndef _GLIBCXX_PROFILE_PROFILER_NODE_H</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define _GLIBCXX_PROFILE_PROFILER_NODE_H 1</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <<a class="code" href="a00239.html">cstdio</a>></span> <span class="comment">// FILE, fprintf</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00182.html">vector</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#if defined _GLIBCXX_HAVE_EXECINFO_H</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <execinfo.h></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">namespace </span><a class="code" href="a01570.html">__gnu_profile</a></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">typedef</span> <span class="keywordtype">void</span>* __instruction_address_t;</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">typedef</span> std::_GLIBCXX_STD_C::vector<__instruction_address_t> __stack_npt;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">typedef</span> __stack_npt* __stack_t;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  std::size_t __stack_max_depth();</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">inline</span> __stack_t</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  __get_stack()</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#if defined _GLIBCXX_HAVE_EXECINFO_H</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  __try</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  std::size_t __max_depth = __stack_max_depth();</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (__max_depth == 0)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  __stack_npt __buffer(__max_depth);</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">int</span> __depth = backtrace(&__buffer[0], __max_depth);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> <span class="keyword">new</span>(std::nothrow) __stack_npt(__buffer.begin(),</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  __buffer.begin() + __depth);</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  __catch(...)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">inline</span> std::size_t</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  __size(__stack_t __stack)</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (!__stack)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">return</span> __stack->size();</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// XXX</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  __write(FILE* __f, __stack_t __stack)</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (!__stack)</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  __stack_npt::const_iterator __it;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (__it = __stack->begin(); __it != __stack->end(); ++__it)</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  std::fprintf(__f, <span class="stringliteral">"%p "</span>, *__it);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"></span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /** @brief Hash function for summary trace using call stack as index. */</span></div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="a08984.html"> 93</a></span>  <span class="keyword">class </span><a class="code" href="a08984.html">__stack_hash</a> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  {</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::size_t</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  operator()(__stack_t __s)<span class="keyword"> const</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (!__s) </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  std::size_t __index = 0;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  __stack_npt::const_iterator __it;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">for</span> (__it = __s->begin(); __it != __s->end(); ++__it)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  __index += reinterpret_cast<std::size_t>(*__it);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> __index;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordtype">bool</span> operator() (__stack_t __stack1, __stack_t __stack2)<span class="keyword"> const</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (!__stack1 && !__stack2)</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (!__stack1 || !__stack2)</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (__stack1->size() != __stack2->size())</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  std::size_t __byte_size</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  = __stack1->size() * <span class="keyword">sizeof</span>(__stack_npt::value_type);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> __builtin_memcmp(&(*__stack1)[0], &(*__stack2)[0],</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  __byte_size) == 0;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  };</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"></span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> /** @brief Base class for a line in the object table. */</span></div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="a08988.html"> 127</a></span>  <span class="keyword">class </span><a class="code" href="a08988.html">__object_info_base</a></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="a08988.html">__object_info_base</a>(__stack_t __stack)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  : _M_stack(__stack), _M_valid(<span class="keyword">true</span>) { }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  __is_valid()<span class="keyword"> const </span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_valid; }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  __set_invalid()</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  { _M_valid = <span class="keyword">false</span>; }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __merge(<span class="keyword">const</span> <a class="code" href="a08988.html">__object_info_base</a>& __o)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  { _M_valid &= __o._M_valid; }</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  __stack_t</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  __stack()<span class="keyword"> const</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_stack; }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  __stack_t _M_stack;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">bool</span> _M_valid;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  };</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> } <span class="comment">// namespace __gnu_profile</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PROFILE_PROFILER_NODE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00239_html"><div class="ttname"><a href="a00239.html">cstdio</a></div></div> <div class="ttc" id="a08984_html"><div class="ttname"><a href="a08984.html">__gnu_profile::__stack_hash</a></div><div class="ttdoc">Hash function for summary trace using call stack as index.</div><div class="ttdef"><b>Definition:</b> <a href="a00839_source.html#l00093">profiler_node.h:93</a></div></div> <div class="ttc" id="a00182_html"><div class="ttname"><a href="a00182.html">vector</a></div></div> <div class="ttc" id="a01570_html"><div class="ttname"><a href="a01570.html">__gnu_profile</a></div><div class="ttdoc">GNU profile code for public use.</div></div> <div class="ttc" id="a08988_html"><div class="ttname"><a href="a08988.html">__gnu_profile::__object_info_base</a></div><div class="ttdoc">Base class for a line in the object table.</div><div class="ttdef"><b>Definition:</b> <a href="a00839_source.html#l00127">profiler_node.h:127</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_17cbb5fff567462faba633e523c7df35.html">profile</a></li><li class="navelem"><a class="el" href="dir_7602fc727cd532ef079c9c8012f55e2d.html">impl</a></li><li class="navelem"><a class="el" href="a00839.html">profiler_node.h</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li> </ul> </div> </body> </html>