svf-tools 1.0.596 → 1.0.598

package/SVF-doxygen/html/html/GraphTraits_8h_source.html

@@ -66,20 +66,20 @@ $(function() {
 <div class="title">GraphTraits.h</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="GraphTraits_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">//===- llvm/ADT/GraphTraits.h - Graph traits template -----------*- C++ -*-===//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// From the LLVM Project with some modifications, under the Apache License v2.0</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// with LLVM Exceptions. See https://llvm.org/LICENSE.txt for license information.</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// This file defines the little GraphTraits&lt;X&gt; template class that should be</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// specialized by classes that want to be iteratable by generic graph iterators.</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// This file also defines the marker class Inverse that is used to iterate over</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// graphs in a graph defined, inverse ordering...</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#ifndef LLVM_ADT_GRAPHTRAITS_H</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#define LLVM_ADT_GRAPHTRAITS_H</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="iterator__range_8h.html">Util/iterator_range.h</a>&quot;</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacellvm.html">llvm</a></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;{</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">// GraphTraits - This class should be specialized by different graph types...</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">// which is why the default version is empty.</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">// This template evolved from supporting `BasicBlock` to also later supporting</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">// more complex types (e.g. CFG and DomTree).</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">// GraphTraits can be used to create a view over a graph interpreting it</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment">// differently without requiring a copy of the original graph. This could</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">// be achieved by carrying more data in NodeRef. See LoopBodyTraits for one</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment">// example.</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structllvm_1_1GraphTraits.html">   36</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;{</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="comment">// Elements to provide:</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="comment">// typedef NodeRef           - Type of Node token in the graph, which should</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="comment">//                             be cheap to copy.</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    <span class="comment">// typedef ChildIteratorType - Type used to iterate over children in graph,</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="comment">//                             dereference to a NodeRef.</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="comment">// static NodeRef getEntryNode(const GraphType &amp;)</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="comment">//    Return the entry node of the graph</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="comment">// static ChildIteratorType child_begin(NodeRef)</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="comment">// static ChildIteratorType child_end  (NodeRef)</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="comment">//    Return iterators that point to the beginning and ending of the child</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <span class="comment">//    node list for the specified node.</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="comment">// typedef  ...iterator nodes_iterator; - dereference to a NodeRef</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    <span class="comment">// static nodes_iterator nodes_begin(GraphType *G)</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="comment">// static nodes_iterator nodes_end  (GraphType *G)</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    <span class="comment">//    nodes_iterator/begin/end - Allow iteration over all nodes in the graph</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="comment">// typedef EdgeRef           - Type of Edge token in the graph, which should</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    <span class="comment">//                             be cheap to copy.</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="comment">// typedef ChildEdgeIteratorType - Type used to iterate over children edges in</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="comment">//                             graph, dereference to a EdgeRef.</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    <span class="comment">// static ChildEdgeIteratorType child_edge_begin(NodeRef)</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;    <span class="comment">// static ChildEdgeIteratorType child_edge_end(NodeRef)</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    <span class="comment">//     Return iterators that point to the beginning and ending of the</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    <span class="comment">//     edge list for the given callgraph node.</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    <span class="comment">//</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    <span class="comment">// static NodeRef edge_dest(EdgeRef)</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="comment">//     Return the destination node of an edge.</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="comment">// static unsigned       size       (GraphType *G)</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    <span class="comment">//    Return total number of nodes in the graph</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="comment">// If anyone tries to use this class without having an appropriate</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    <span class="comment">// specialization, make an error.  If you get this error, it&#39;s because you</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <span class="comment">// need to include the appropriate specialization of GraphTraits&lt;&gt; for your</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    <span class="comment">// graph, or you need to define it for a new graph type. Either that or</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <span class="comment">// your argument to XXX_begin(...) is unknown or needs to have the proper .h</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    <span class="comment">// file #include&#39;d.</span></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">   80</a></span>&#160;    <span class="keyword">using</span> <a class="code" href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">NodeRef</a> = <span class="keyword">typename</span> GraphType::UnknownGraphTypeError;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;};</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="comment">// Inverse - This class is used as a little marker class to tell the graph</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="comment">// iterator to iterate over the graph in a graph defined &quot;Inverse&quot; ordering.</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment">// Not all graphs define an inverse ordering, and if they do, it depends on</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="comment">// the graph exactly what that is.  Here&#39;s an example of usage with the</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="comment">// df_iterator:</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment">// idf_iterator&lt;Method*&gt; I = idf_begin(M), E = idf_end(M);</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">// for (; I != E; ++I) { ... }</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment">// Which is equivalent to:</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="comment">// df_iterator&lt;Inverse&lt;Method*&gt;&gt; I = idf_begin(M), E = idf_end(M);</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment">// for (; I != E; ++I) { ... }</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="structllvm_1_1Inverse.html">   97</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structllvm_1_1Inverse.html">Inverse</a></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;{</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structllvm_1_1Inverse.html#a169e126ff147c68b5f1cfd6a1d2c8286">   99</a></span>&#160;    <span class="keyword">const</span> GraphType &amp;<a class="code" href="structllvm_1_1Inverse.html#a169e126ff147c68b5f1cfd6a1d2c8286">Graph</a>;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structllvm_1_1Inverse.html#a8fbccad4b16b94dadafea57bad9ee017">  101</a></span>&#160;    <span class="keyword">inline</span> <a class="code" href="structllvm_1_1Inverse.html#a8fbccad4b16b94dadafea57bad9ee017">Inverse</a>(<span class="keyword">const</span> GraphType &amp;G) : Graph(G) {}</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;};</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">// Provide a partial specialization of GraphTraits so that the inverse of an</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment">// inverse falls back to the original graph.</span></div><div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="structllvm_1_1GraphTraits_3_01Inverse_3_01Inverse_3_01T_01_4_01_4_01_4.html">  106</a></span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt; <span class="keyword">struct </span><a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse</a>&lt;T&gt;&gt;&gt; : <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;T&gt; {};</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="comment">// Provide iterator ranges for the graph traits nodes and children</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<a class="code" href="classllvm_1_1iterator__range.html">iterator_range&lt;typename GraphTraits&lt;GraphType&gt;::nodes_iterator</a>&gt;</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">  111</a></span>&#160;<a class="code" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">nodes</a>(<span class="keyword">const</span> GraphType &amp;G)</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;{</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">make_range</a>(<a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::nodes_begin</a>(G),</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                      <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::nodes_end</a>(G));</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<a class="code" href="classllvm_1_1iterator__range.html">iterator_range&lt;typename GraphTraits&lt;Inverse&lt;GraphType&gt;</a>&gt;::nodes_iterator&gt;</div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="namespacellvm.html#a83fd30d5d8e023c6f35d5a5e998d6810">  118</a></span>&#160;        <a class="code" href="namespacellvm.html#a83fd30d5d8e023c6f35d5a5e998d6810">inverse_nodes</a>(<span class="keyword">const</span> GraphType &amp;G)</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;{</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">make_range</a>(<a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::nodes_begin(G),</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                      <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::nodes_end(G));</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;}</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<a class="code" href="classllvm_1_1iterator__range.html">iterator_range&lt;typename GraphTraits&lt;GraphType&gt;::ChildIteratorType</a>&gt;</div><div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="namespacellvm.html#a77e0432868a8d88e98b2fdb383790e4a">  126</a></span>&#160;<a class="code" href="namespacellvm.html#a77e0432868a8d88e98b2fdb383790e4a">children</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">GraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;{</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">make_range</a>(<a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::child_begin</a>(G),</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                      <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::child_end</a>(G));</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;}</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<a class="code" href="classllvm_1_1iterator__range.html">iterator_range&lt;typename GraphTraits&lt;Inverse&lt;GraphType&gt;</a>&gt;::ChildIteratorType&gt;</div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="namespacellvm.html#a271d439f063099eb81b7e8549fec97a7">  134</a></span>&#160;        <a class="code" href="namespacellvm.html#a271d439f063099eb81b7e8549fec97a7">inverse_children</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">GraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;{</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">make_range</a>(<a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::child_begin(G),</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                      <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits</a>&lt;<a class="code" href="structllvm_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::child_end(G));</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;}</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<a class="code" href="classllvm_1_1iterator__range.html">iterator_range&lt;typename GraphTraits&lt;GraphType&gt;::ChildEdgeIteratorType</a>&gt;</div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="namespacellvm.html#aa7827c4f1bc6c4c3e21161da5bee01db">  142</a></span>&#160;<a class="code" href="namespacellvm.html#aa7827c4f1bc6c4c3e21161da5bee01db">children_edges</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">GraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;{</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">make_range</a>(<a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::child_edge_begin</a>(G),</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                      <a class="code" href="structllvm_1_1GraphTraits.html">GraphTraits&lt;GraphType&gt;::child_edge_end</a>(G));</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;}</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;} <span class="comment">// end namespace llvm</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="preprocessor">#endif // LLVM_ADT_GRAPHTRAITS_H</span></div><div class="ttc" id="namespacellvm_html_a77e0432868a8d88e98b2fdb383790e4a"><div class="ttname"><a href="namespacellvm.html#a77e0432868a8d88e98b2fdb383790e4a">llvm::children</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::ChildIteratorType &gt; children(const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00126">GraphTraits.h:126</a></div></div>
-<div class="ttc" id="namespacellvm_html"><div class="ttname"><a href="namespacellvm.html">llvm</a></div><div class="ttdef"><b>Definition:</b> <a href="CFLGraph_8h_source.html#l00192">CFLGraph.h:192</a></div></div>
-<div class="ttc" id="structllvm_1_1GraphTraits_html"><div class="ttname"><a href="structllvm_1_1GraphTraits.html">llvm::GraphTraits</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00036">GraphTraits.h:36</a></div></div>
+<a href="GraphTraits_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">//===- llvm/ADT/GenericGraphTraits.h - Graph traits template -----------*- C++ -*-===//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// From the LLVM Project with some modifications, under the Apache License v2.0</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// with LLVM Exceptions. See https://llvm.org/LICENSE.txt for license information.</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// This file defines the little GenericGraphTraits&lt;X&gt; template class that should be</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// specialized by classes that want to be iteratable by generic graph iterators.</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// This file also defines the marker class Inverse that is used to iterate over</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// graphs in a graph defined, inverse ordering...</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#ifndef GRAPHS_GRAPHTRAITS_H</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#define GRAPHS_GRAPHTRAITS_H</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="iterator__range_8h.html">Util/iterator_range.h</a>&quot;</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceSVF.html">SVF</a></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;{</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">// GenericGraphTraits - This class should be specialized by different graph types...</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment">// which is why the default version is empty.</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment">// This template evolved from supporting `BasicBlock` to also later supporting</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment">// more complex types (e.g. CFG and DomTree).</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">// GenericGraphTraits can be used to create a view over a graph interpreting it</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="comment">// differently without requiring a copy of the original graph. This could</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">// be achieved by carrying more data in NodeRef. See LoopBodyTraits for one</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="comment">// example.</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="structSVF_1_1GenericGraphTraits.html">   36</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;{</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="comment">// Elements to provide:</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="comment">// typedef NodeRef           - Type of Node token in the graph, which should</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="comment">//                             be cheap to copy.</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    <span class="comment">// typedef ChildIteratorType - Type used to iterate over children in graph,</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="comment">//                             dereference to a NodeRef.</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="comment">// static NodeRef getEntryNode(const GraphType &amp;)</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="comment">//    Return the entry node of the graph</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="comment">// static ChildIteratorType child_begin(NodeRef)</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="comment">// static ChildIteratorType child_end  (NodeRef)</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="comment">//    Return iterators that point to the beginning and ending of the child</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <span class="comment">//    node list for the specified node.</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="comment">// typedef  ...iterator nodes_iterator; - dereference to a NodeRef</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    <span class="comment">// static nodes_iterator nodes_begin(GraphType *G)</span></div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="comment">// static nodes_iterator nodes_end  (GraphType *G)</span></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    <span class="comment">//    nodes_iterator/begin/end - Allow iteration over all nodes in the graph</span></div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="comment">// typedef EdgeRef           - Type of Edge token in the graph, which should</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    <span class="comment">//                             be cheap to copy.</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="comment">// typedef ChildEdgeIteratorType - Type used to iterate over children edges in</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="comment">//                             graph, dereference to a EdgeRef.</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    <span class="comment">// static ChildEdgeIteratorType child_edge_begin(NodeRef)</span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;    <span class="comment">// static ChildEdgeIteratorType child_edge_end(NodeRef)</span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    <span class="comment">//     Return iterators that point to the beginning and ending of the</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    <span class="comment">//     edge list for the given callgraph node.</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    <span class="comment">//</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    <span class="comment">// static NodeRef edge_dest(EdgeRef)</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    <span class="comment">//     Return the destination node of an edge.</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="comment">// static unsigned       size       (GraphType *G)</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;    <span class="comment">//    Return total number of nodes in the graph</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="comment">// If anyone tries to use this class without having an appropriate</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    <span class="comment">// specialization, make an error.  If you get this error, it&#39;s because you</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <span class="comment">// need to include the appropriate specialization of GenericGraphTraits&lt;&gt; for your</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    <span class="comment">// graph, or you need to define it for a new graph type. Either that or</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <span class="comment">// your argument to XXX_begin(...) is unknown or needs to have the proper .h</span></div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    <span class="comment">// file #include&#39;d.</span></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">   80</a></span>&#160;    <span class="keyword">using</span> <a class="code" href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">NodeRef</a> = <span class="keyword">typename</span> GraphType::UnknownGraphTypeError;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;};</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;<span class="comment">// Inverse - This class is used as a little marker class to tell the graph</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="comment">// iterator to iterate over the graph in a graph defined &quot;Inverse&quot; ordering.</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment">// Not all graphs define an inverse ordering, and if they do, it depends on</span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="comment">// the graph exactly what that is.  Here&#39;s an example of usage with the</span></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="comment">// df_iterator:</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment">// idf_iterator&lt;Method*&gt; I = idf_begin(M), E = idf_end(M);</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">// for (; I != E; ++I) { ... }</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment">// Which is equivalent to:</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="comment">// df_iterator&lt;Inverse&lt;Method*&gt;&gt; I = idf_begin(M), E = idf_end(M);</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment">// for (; I != E; ++I) { ... }</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="structSVF_1_1Inverse.html">   97</a></span>&#160;<span class="keyword">struct </span><a class="code" href="structSVF_1_1Inverse.html">Inverse</a></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;{</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="structSVF_1_1Inverse.html#a2037408b7047e9265b4b14e54bb584a2">   99</a></span>&#160;    <span class="keyword">const</span> GraphType &amp;<a class="code" href="structSVF_1_1Inverse.html#a2037408b7047e9265b4b14e54bb584a2">Graph</a>;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;</div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="structSVF_1_1Inverse.html#a9bff8acbcb891eeaeb6a9324312358a0">  101</a></span>&#160;    <span class="keyword">inline</span> <a class="code" href="structSVF_1_1Inverse.html#a9bff8acbcb891eeaeb6a9324312358a0">Inverse</a>(<span class="keyword">const</span> GraphType &amp;G) : Graph(G) {}</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;};</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">// Provide a partial specialization of GenericGraphTraits so that the inverse of an</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment">// inverse falls back to the original graph.</span></div><div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01Inverse_3_01T_01_4_01_4_01_4.html">  106</a></span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt; <span class="keyword">struct </span><a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse</a>&lt;T&gt;&gt;&gt; : <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;T&gt; {};</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="comment">// Provide iterator ranges for the graph traits nodes and children</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<a class="code" href="classSVF_1_1iter__range.html">iter_range&lt;typename GenericGraphTraits&lt;GraphType&gt;::nodes_iterator</a>&gt;</div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">  111</a></span>&#160;<a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>(<span class="keyword">const</span> GraphType &amp;G)</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;{</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">make_range</a>(<a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::nodes_begin</a>(G),</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;                      <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::nodes_end</a>(G));</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<a class="code" href="classSVF_1_1iter__range.html">iter_range&lt;typename GenericGraphTraits&lt;Inverse&lt;GraphType&gt;</a>&gt;::nodes_iterator&gt;</div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="namespaceSVF.html#a6506af0b08e86390c0e4786b6ee294ae">  118</a></span>&#160;        <a class="code" href="namespaceSVF.html#a6506af0b08e86390c0e4786b6ee294ae">inverse_nodes</a>(<span class="keyword">const</span> GraphType &amp;G)</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;{</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">make_range</a>(<a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::nodes_begin(G),</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                      <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::nodes_end(G));</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;}</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<a class="code" href="classSVF_1_1iter__range.html">iter_range&lt;typename GenericGraphTraits&lt;GraphType&gt;::ChildIteratorType</a>&gt;</div><div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="namespaceSVF.html#a67f454fa9341632d195fd5da619130f0">  126</a></span>&#160;<a class="code" href="namespaceSVF.html#a67f454fa9341632d195fd5da619130f0">children</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">GenericGraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;{</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">make_range</a>(<a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::child_begin</a>(G),</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                      <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::child_end</a>(G));</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;}</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<a class="code" href="classSVF_1_1iter__range.html">iter_range&lt;typename GenericGraphTraits&lt;Inverse&lt;GraphType&gt;</a>&gt;::ChildIteratorType&gt;</div><div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="namespaceSVF.html#a155eb379cf271ac550333afb13cb36fa">  134</a></span>&#160;        <a class="code" href="namespaceSVF.html#a155eb379cf271ac550333afb13cb36fa">inverse_children</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">GenericGraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;{</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">make_range</a>(<a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::child_begin(G),</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                      <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits</a>&lt;<a class="code" href="structSVF_1_1Inverse.html">Inverse&lt;GraphType&gt;</a>&gt;::child_end(G));</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;}</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<a class="code" href="classSVF_1_1iter__range.html">iter_range&lt;typename GenericGraphTraits&lt;GraphType&gt;::ChildEdgeIteratorType</a>&gt;</div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="namespaceSVF.html#ab485076115c46b3e009cc5c4d252adae">  142</a></span>&#160;<a class="code" href="namespaceSVF.html#ab485076115c46b3e009cc5c4d252adae">children_edges</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">GenericGraphTraits&lt;GraphType&gt;::NodeRef</a> &amp;G)</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;{</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">make_range</a>(<a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::child_edge_begin</a>(G),</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                      <a class="code" href="structSVF_1_1GenericGraphTraits.html">GenericGraphTraits&lt;GraphType&gt;::child_edge_end</a>(G));</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;}</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;} <span class="comment">// end namespace llvm</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="preprocessor">#endif // LLVM_ADT_GRAPHTRAITS_H</span></div><div class="ttc" id="structSVF_1_1Inverse_html_a2037408b7047e9265b4b14e54bb584a2"><div class="ttname"><a href="structSVF_1_1Inverse.html#a2037408b7047e9265b4b14e54bb584a2">SVF::Inverse::Graph</a></div><div class="ttdeci">const GraphType &amp; Graph</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00099">GraphTraits.h:99</a></div></div>
+<div class="ttc" id="namespaceSVF_html_a3b6bc8132d0fd4902888ab9f77c20124"><div class="ttname"><a href="namespaceSVF.html#a3b6bc8132d0fd4902888ab9f77c20124">SVF::make_range</a></div><div class="ttdeci">iter_range&lt; T &gt; make_range(T x, T y)</div><div class="ttdef"><b>Definition:</b> <a href="iterator__range_8h_source.html#l00064">iterator_range.h:64</a></div></div>
 <div class="ttc" id="iterator__range_8h_html"><div class="ttname"><a href="iterator__range_8h.html">iterator_range.h</a></div></div>
-<div class="ttc" id="namespacellvm_html_a271d439f063099eb81b7e8549fec97a7"><div class="ttname"><a href="namespacellvm.html#a271d439f063099eb81b7e8549fec97a7">llvm::inverse_children</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::ChildIteratorType &gt; inverse_children(const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00134">GraphTraits.h:134</a></div></div>
-<div class="ttc" id="structllvm_1_1Inverse_html"><div class="ttname"><a href="structllvm_1_1Inverse.html">llvm::Inverse</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00097">GraphTraits.h:97</a></div></div>
-<div class="ttc" id="structllvm_1_1GraphTraits_html_a741f7d63af17a7bd0bcf63f68e8658bd"><div class="ttname"><a href="structllvm_1_1GraphTraits.html#a741f7d63af17a7bd0bcf63f68e8658bd">llvm::GraphTraits&lt; SVF::GenericNode&lt; SVF::CHNode, SVF::CHEdge &gt; * &gt;::NodeRef</a></div><div class="ttdeci">typename SVF::GenericNode&lt; SVF::CHNode, SVF::CHEdge &gt; *::UnknownGraphTypeError NodeRef</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00080">GraphTraits.h:80</a></div></div>
-<div class="ttc" id="namespacellvm_html_aa7827c4f1bc6c4c3e21161da5bee01db"><div class="ttname"><a href="namespacellvm.html#aa7827c4f1bc6c4c3e21161da5bee01db">llvm::children_edges</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::ChildEdgeIteratorType &gt; children_edges(const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00142">GraphTraits.h:142</a></div></div>
-<div class="ttc" id="namespacellvm_html_a83fd30d5d8e023c6f35d5a5e998d6810"><div class="ttname"><a href="namespacellvm.html#a83fd30d5d8e023c6f35d5a5e998d6810">llvm::inverse_nodes</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::nodes_iterator &gt; inverse_nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00118">GraphTraits.h:118</a></div></div>
-<div class="ttc" id="namespacellvm_html_ad1a91b49e0c092818a0b82f6cc130a1b"><div class="ttname"><a href="namespacellvm.html#ad1a91b49e0c092818a0b82f6cc130a1b">llvm::make_range</a></div><div class="ttdeci">iterator_range&lt; T &gt; make_range(T x, T y)</div><div class="ttdef"><b>Definition:</b> <a href="iterator__range_8h_source.html#l00064">iterator_range.h:64</a></div></div>
-<div class="ttc" id="structllvm_1_1Inverse_html_a169e126ff147c68b5f1cfd6a1d2c8286"><div class="ttname"><a href="structllvm_1_1Inverse.html#a169e126ff147c68b5f1cfd6a1d2c8286">llvm::Inverse::Graph</a></div><div class="ttdeci">const GraphType &amp; Graph</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00099">GraphTraits.h:99</a></div></div>
-<div class="ttc" id="classllvm_1_1iterator__range_html"><div class="ttname"><a href="classllvm_1_1iterator__range.html">llvm::iterator_range</a></div><div class="ttdef"><b>Definition:</b> <a href="iterator__range_8h_source.html#l00031">iterator_range.h:31</a></div></div>
-<div class="ttc" id="namespacellvm_html_ad615816ca25b07333f9a7495cbcb8029"><div class="ttname"><a href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">llvm::nodes</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::nodes_iterator &gt; nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00111">GraphTraits.h:111</a></div></div>
-<div class="ttc" id="structllvm_1_1Inverse_html_a8fbccad4b16b94dadafea57bad9ee017"><div class="ttname"><a href="structllvm_1_1Inverse.html#a8fbccad4b16b94dadafea57bad9ee017">llvm::Inverse::Inverse</a></div><div class="ttdeci">Inverse(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00101">GraphTraits.h:101</a></div></div>
+<div class="ttc" id="namespaceSVF_html_ab485076115c46b3e009cc5c4d252adae"><div class="ttname"><a href="namespaceSVF.html#ab485076115c46b3e009cc5c4d252adae">SVF::children_edges</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; GraphType &gt;::ChildEdgeIteratorType &gt; children_edges(const typename GenericGraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00142">GraphTraits.h:142</a></div></div>
+<div class="ttc" id="structSVF_1_1GenericGraphTraits_html_a05654ab9615d75bc8e5f8c5cf9297205"><div class="ttname"><a href="structSVF_1_1GenericGraphTraits.html#a05654ab9615d75bc8e5f8c5cf9297205">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; SVF::CHNode, SVF::CHEdge &gt; * &gt;::NodeRef</a></div><div class="ttdeci">typename SVF::GenericNode&lt; SVF::CHNode, SVF::CHEdge &gt; *::UnknownGraphTypeError NodeRef</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00080">GraphTraits.h:80</a></div></div>
+<div class="ttc" id="namespaceSVF_html_a67f454fa9341632d195fd5da619130f0"><div class="ttname"><a href="namespaceSVF.html#a67f454fa9341632d195fd5da619130f0">SVF::children</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; GraphType &gt;::ChildIteratorType &gt; children(const typename GenericGraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00126">GraphTraits.h:126</a></div></div>
+<div class="ttc" id="structSVF_1_1Inverse_html"><div class="ttname"><a href="structSVF_1_1Inverse.html">SVF::Inverse</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00097">GraphTraits.h:97</a></div></div>
+<div class="ttc" id="structSVF_1_1Inverse_html_a9bff8acbcb891eeaeb6a9324312358a0"><div class="ttname"><a href="structSVF_1_1Inverse.html#a9bff8acbcb891eeaeb6a9324312358a0">SVF::Inverse::Inverse</a></div><div class="ttdeci">Inverse(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00101">GraphTraits.h:101</a></div></div>
+<div class="ttc" id="namespaceSVF_html"><div class="ttname"><a href="namespaceSVF.html">SVF</a></div><div class="ttdoc">for isBitcode </div><div class="ttdef"><b>Definition:</b> <a href="CFGNormalizer_8h_source.html#l00035">CFGNormalizer.h:35</a></div></div>
+<div class="ttc" id="namespaceSVF_html_a6506af0b08e86390c0e4786b6ee294ae"><div class="ttname"><a href="namespaceSVF.html#a6506af0b08e86390c0e4786b6ee294ae">SVF::inverse_nodes</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::nodes_iterator &gt; inverse_nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00118">GraphTraits.h:118</a></div></div>
+<div class="ttc" id="classSVF_1_1iter__range_html"><div class="ttname"><a href="classSVF_1_1iter__range.html">SVF::iter_range</a></div><div class="ttdef"><b>Definition:</b> <a href="iterator__range_8h_source.html#l00031">iterator_range.h:31</a></div></div>
+<div class="ttc" id="structSVF_1_1GenericGraphTraits_html"><div class="ttname"><a href="structSVF_1_1GenericGraphTraits.html">SVF::GenericGraphTraits</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00036">GraphTraits.h:36</a></div></div>
+<div class="ttc" id="namespaceSVF_html_a155eb379cf271ac550333afb13cb36fa"><div class="ttname"><a href="namespaceSVF.html#a155eb379cf271ac550333afb13cb36fa">SVF::inverse_children</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::ChildIteratorType &gt; inverse_children(const typename GenericGraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00134">GraphTraits.h:134</a></div></div>
+<div class="ttc" id="namespaceSVF_html_ae6c7046834fe00382052ece7d06eb0ac"><div class="ttname"><a href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">SVF::nodes</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; GraphType &gt;::nodes_iterator &gt; nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00111">GraphTraits.h:111</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 <!-- start footer part -->
 <hr class="footer"/><address class="footer"><small>

package/SVF-doxygen/html/html/GraphWriter_8cpp_source.html

@@ -66,7 +66,7 @@ $(function() {
 <div class="title">GraphWriter.cpp</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="GraphWriter_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">//===- GraphWriter.cpp - Implements GraphWriter support routines ----------===//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// From the LLVM Project with some modifications, under the Apache License v2.0</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// with LLVM Exceptions. See https://llvm.org/LICENSE.txt for license information.</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="GraphWriter_8h.html">Graphs/GraphWriter.h</a>&quot;</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno"><a class="line" href="namespacellvm_1_1DOT.html#a31e5d80aa888e96643a4150bfedaa917">   12</a></span>&#160;<a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> <a class="code" href="namespacellvm_1_1DOT.html#a31e5d80aa888e96643a4150bfedaa917">llvm::DOT::EscapeStr</a>(<span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;Label)</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;{</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> Str(Label);</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i != Str.length(); ++i)</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordflow">switch</span> (Str[i])</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        {</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\n&#39;</span>:</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39;\\&#39;</span>);  <span class="comment">// Escape character...</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;            ++i;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;            Str[i] = <span class="charliteral">&#39;n&#39;</span>;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\t&#39;</span>:</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39; &#39;</span>);  <span class="comment">// Convert to two spaces</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;            ++i;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;            Str[i] = <span class="charliteral">&#39; &#39;</span>;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\\&#39;</span>:</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;            <span class="keywordflow">if</span> (i+1 != Str.length())</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;                <span class="keywordflow">switch</span> (Str[i+1])</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;                {</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;l&#39;</span>:</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;                    <span class="keywordflow">continue</span>; <span class="comment">// don&#39;t disturb \l</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;|&#39;</span>:</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;{&#39;</span>:</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;                    Str.erase(Str.begin()+i);</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;                    <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;                <span class="keywordflow">default</span>:</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;                    <span class="keywordflow">break</span>;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;                }</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;{&#39;</span>:</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&lt;&#39;</span>:</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&gt;&#39;</span>:</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;|&#39;</span>:</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&quot;&#39;</span>:</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39;\\&#39;</span>);  <span class="comment">// Escape character...</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ++i;  <span class="comment">// don&#39;t infinite loop</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        }</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keywordflow">return</span> Str;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;}</div><div class="ttc" id="namespacellvm_1_1DOT_html_a31e5d80aa888e96643a4150bfedaa917"><div class="ttname"><a href="namespacellvm_1_1DOT.html#a31e5d80aa888e96643a4150bfedaa917">llvm::DOT::EscapeStr</a></div><div class="ttdeci">std::string EscapeStr(const std::string &amp;Label)</div><div class="ttdef"><b>Definition:</b> <a href="GraphWriter_8cpp_source.html#l00012">GraphWriter.cpp:12</a></div></div>
+<a href="GraphWriter_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">//===- GraphWriter.cpp - Implements GraphWriter support routines ----------===//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// From the LLVM Project with some modifications, under the Apache License v2.0</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// with LLVM Exceptions. See https://llvm.org/LICENSE.txt for license information.</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="GraphWriter_8h.html">Graphs/GraphWriter.h</a>&quot;</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno"><a class="line" href="namespaceSVF_1_1DOT.html#a9e3127c2bbedaec1f20d4437bea9e2f7">   12</a></span>&#160;<a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> <a class="code" href="namespaceSVF_1_1DOT.html#a9e3127c2bbedaec1f20d4437bea9e2f7">SVF::DOT::EscapeStr</a>(<span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;Label)</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;{</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;    <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> Str(Label);</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i != Str.length(); ++i)</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        <span class="keywordflow">switch</span> (Str[i])</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        {</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\n&#39;</span>:</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39;\\&#39;</span>);  <span class="comment">// Escape character...</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;            ++i;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;            Str[i] = <span class="charliteral">&#39;n&#39;</span>;</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\t&#39;</span>:</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39; &#39;</span>);  <span class="comment">// Convert to two spaces</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;            ++i;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;            Str[i] = <span class="charliteral">&#39; &#39;</span>;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;\\&#39;</span>:</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;            <span class="keywordflow">if</span> (i+1 != Str.length())</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;                <span class="keywordflow">switch</span> (Str[i+1])</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;                {</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;l&#39;</span>:</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;                    <span class="keywordflow">continue</span>; <span class="comment">// don&#39;t disturb \l</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;|&#39;</span>:</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;{&#39;</span>:</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;                <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;                    Str.erase(Str.begin()+i);</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;                    <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;                <span class="keywordflow">default</span>:</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;                    <span class="keywordflow">break</span>;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;                }</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;{&#39;</span>:</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&lt;&#39;</span>:</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&gt;&#39;</span>:</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;|&#39;</span>:</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="keywordflow">case</span> <span class="charliteral">&#39;&quot;&#39;</span>:</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;            Str.insert(Str.begin()+i, <span class="charliteral">&#39;\\&#39;</span>);  <span class="comment">// Escape character...</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;            ++i;  <span class="comment">// don&#39;t infinite loop</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;            <span class="keywordflow">break</span>;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        }</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keywordflow">return</span> Str;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;}</div><div class="ttc" id="namespaceSVF_1_1DOT_html_a9e3127c2bbedaec1f20d4437bea9e2f7"><div class="ttname"><a href="namespaceSVF_1_1DOT.html#a9e3127c2bbedaec1f20d4437bea9e2f7">SVF::DOT::EscapeStr</a></div><div class="ttdeci">std::string EscapeStr(const std::string &amp;Label)</div><div class="ttdef"><b>Definition:</b> <a href="GraphWriter_8cpp_source.html#l00012">GraphWriter.cpp:12</a></div></div>
 <div class="ttc" id="GraphWriter_8h_html"><div class="ttname"><a href="GraphWriter_8h.html">GraphWriter.h</a></div></div>
 <div class="ttc" id="cJSON_8h_html_ad4c68ea99a26b0a98ad9a79982960458"><div class="ttname"><a href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">string</a></div><div class="ttdeci">const char *const string</div><div class="ttdef"><b>Definition:</b> <a href="cJSON_8h_source.html#l00172">cJSON.h:172</a></div></div>
 </div><!-- fragment --></div><!-- contents -->

package/SVF-doxygen/html/html/GraphWriter_8h.html

@@ -87,44 +87,45 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
 Classes</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classllvm_1_1GraphWriter.html">llvm::GraphWriter&lt; GraphType &gt;</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1GraphWriter.html">SVF::GraphWriter&lt; GraphType &gt;</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
 Namespaces</h2></td></tr>
-<tr class="memitem:namespacellvm"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacellvm.html">llvm</a></td></tr>
+<tr class="memitem:namespaceSVF"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceSVF.html">SVF</a></td></tr>
+<tr class="memdesc:namespaceSVF"><td class="mdescLeft">&#160;</td><td class="mdescRight">for isBitcode <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:namespacellvm_1_1DOT"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacellvm_1_1DOT.html">llvm::DOT</a></td></tr>
+<tr class="memitem:namespaceSVF_1_1DOT"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceSVF_1_1DOT.html">SVF::DOT</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:namespacellvm_1_1GraphProgram"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacellvm_1_1GraphProgram.html">llvm::GraphProgram</a></td></tr>
+<tr class="memitem:namespaceSVF_1_1GraphProgram"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceSVF_1_1GraphProgram.html">SVF::GraphProgram</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="enum-members"></a>
 Enumerations</h2></td></tr>
-<tr class="memitem:a0ad4685976f8c4d4a697a53fbe05d10b"><td class="memItemLeft" align="right" valign="top">enum &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10b">llvm::GraphProgram::Name</a> { <br />
-&#160;&#160;<a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10baa979410a6f3129644e1be86fb488e455">llvm::GraphProgram::DOT</a>, 
-<a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10ba369c1aafe1a79637a098d1ac61c3c940">llvm::GraphProgram::FDP</a>, 
-<a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10ba5f97d56ae6699c2775313a0b5cd6badb">llvm::GraphProgram::NEATO</a>, 
-<a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10ba3af922b814bd0960a3c12abbe6b87a0d">llvm::GraphProgram::TWOPI</a>, 
+<tr class="memitem:a10f45758abb5c1ef51b0ba38d18efd37"><td class="memItemLeft" align="right" valign="top">enum &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37">SVF::GraphProgram::Name</a> { <br />
+&#160;&#160;<a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37ae09e3feb3996d73e682cf2a5077c090c">SVF::GraphProgram::DOT</a>, 
+<a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37ac3a20ad67d8b23a37a2c81ef793323a9">SVF::GraphProgram::FDP</a>, 
+<a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37a280cacd79d09366b6832ebc6e54b5a9c">SVF::GraphProgram::NEATO</a>, 
+<a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37ac6a6eaaa34322cf54953ba390895f0c5">SVF::GraphProgram::TWOPI</a>, 
 <br />
-&#160;&#160;<a class="el" href="namespacellvm_1_1GraphProgram.html#a0ad4685976f8c4d4a697a53fbe05d10bab89542c270041afd91cb19369af6dc31">llvm::GraphProgram::CIRCO</a>
+&#160;&#160;<a class="el" href="namespaceSVF_1_1GraphProgram.html#a10f45758abb5c1ef51b0ba38d18efd37a88732178df8f5804ab976cc48e584674">SVF::GraphProgram::CIRCO</a>
 <br />
  }</td></tr>
-<tr class="separator:a0ad4685976f8c4d4a697a53fbe05d10b"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="separator:a10f45758abb5c1ef51b0ba38d18efd37"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a31e5d80aa888e96643a4150bfedaa917"><td class="memItemLeft" align="right" valign="top"><a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacellvm_1_1DOT.html#a31e5d80aa888e96643a4150bfedaa917">llvm::DOT::EscapeStr</a> (const <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> &amp;Label)</td></tr>
-<tr class="separator:a31e5d80aa888e96643a4150bfedaa917"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adc0ea9d5e23d0277eda65041e33fee55"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
-<tr class="memitem:adc0ea9d5e23d0277eda65041e33fee55"><td class="memTemplItemLeft" align="right" valign="top">std::ofstream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#adc0ea9d5e23d0277eda65041e33fee55">llvm::WriteGraph</a> (std::ofstream &amp;O, const GraphType &amp;G, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>)</td></tr>
-<tr class="separator:adc0ea9d5e23d0277eda65041e33fee55"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8532ada875ed55f0d803315ae7c39f39"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
-<tr class="memitem:a8532ada875ed55f0d803315ae7c39f39"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#a8532ada875ed55f0d803315ae7c39f39">llvm::WriteGraph</a> (const GraphType &amp;G, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>, <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> Filename=&quot;&quot;)</td></tr>
-<tr class="separator:a8532ada875ed55f0d803315ae7c39f39"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a470c5592e4cd36a22901d15832b9c41b"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
-<tr class="memitem:a470c5592e4cd36a22901d15832b9c41b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#a470c5592e4cd36a22901d15832b9c41b">llvm::ViewGraph</a> (const GraphType &amp;G, const <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> &amp;<a class="el" href="cJSON_8cpp.html#acc128f98d9ceca227038c771308eff39">name</a>, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>, GraphProgram::Name Program=GraphProgram::DOT)</td></tr>
-<tr class="separator:a470c5592e4cd36a22901d15832b9c41b"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a9e3127c2bbedaec1f20d4437bea9e2f7"><td class="memItemLeft" align="right" valign="top"><a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceSVF_1_1DOT.html#a9e3127c2bbedaec1f20d4437bea9e2f7">SVF::DOT::EscapeStr</a> (const <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> &amp;Label)</td></tr>
+<tr class="separator:a9e3127c2bbedaec1f20d4437bea9e2f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ae27267f89add1338fd5afe3a38f61ebd"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
+<tr class="memitem:ae27267f89add1338fd5afe3a38f61ebd"><td class="memTemplItemLeft" align="right" valign="top">std::ofstream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceSVF.html#ae27267f89add1338fd5afe3a38f61ebd">SVF::WriteGraph</a> (std::ofstream &amp;O, const GraphType &amp;G, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>)</td></tr>
+<tr class="separator:ae27267f89add1338fd5afe3a38f61ebd"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a587614f74cb00a35a423559265239798"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
+<tr class="memitem:a587614f74cb00a35a423559265239798"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceSVF.html#a587614f74cb00a35a423559265239798">SVF::WriteGraph</a> (const GraphType &amp;G, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>, <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> Filename=&quot;&quot;)</td></tr>
+<tr class="separator:a587614f74cb00a35a423559265239798"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a4582a7d33a5631a5a38973f50035327e"><td class="memTemplParams" colspan="2">template&lt;typename GraphType &gt; </td></tr>
+<tr class="memitem:a4582a7d33a5631a5a38973f50035327e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceSVF.html#a4582a7d33a5631a5a38973f50035327e">SVF::ViewGraph</a> (const GraphType &amp;G, const <a class="el" href="cJSON_8cpp.html#ae1adbce218e7a9d09164012443191d24">std::string</a> &amp;<a class="el" href="cJSON_8cpp.html#acc128f98d9ceca227038c771308eff39">name</a>, bool ShortNames=<a class="el" href="cJSON_8cpp.html#a65e9886d74aaee76545e83dd09011727">false</a>, GraphProgram::Name Program=GraphProgram::DOT)</td></tr>
+<tr class="separator:a4582a7d33a5631a5a38973f50035327e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
 <!-- start footer part -->