svf-tools 1.0.595 → 1.0.596

package/SVF-doxygen/html/html/GraphPrinter_8h.html

@@ -70,10 +70,8 @@ $(function() {
 </div><!--header-->
 <div class="contents">
 <div class="textblock"><code>#include &lt;system_error&gt;</code><br />
-<code>#include &lt;llvm/Support/ToolOutputFile.h&gt;</code><br />
-<code>#include &lt;llvm/Support/GraphWriter.h&gt;</code><br />
-<code>#include &lt;llvm/Support/FileSystem.h&gt;</code><br />
-<code>#include &lt;llvm/ADT/GraphTraits.h&gt;</code><br />
+<code>#include &quot;<a class="el" href="GraphWriter_8h_source.html">Graphs/GraphWriter.h</a>&quot;</code><br />
+<code>#include &lt;fstream&gt;</code><br />
 </div>
 <p><a href="GraphPrinter_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">

package/SVF-doxygen/html/html/GraphPrinter_8h_source.html

@@ -66,13 +66,16 @@ $(function() {
 <div class="title">GraphPrinter.h</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="GraphPrinter_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">//===- GraphPrinter.h -- Print Generic Graph---------------------//</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">//                     SVF: Static Value-Flow Analysis</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// Copyright (C) &lt;2013-2017&gt;  &lt;Yulei Sui&gt;</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="comment">// This program is free software: you can redistribute it and/or modify</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// it under the terms of the GNU General Public License as published by</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// (at your option) any later version.</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// This program is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// GNU General Public License for more details.</span></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="comment">// You should have received a copy of the GNU General Public License</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">// along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</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;<span class="comment">/*</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> * GraphPrinter.h</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *  Created on: 19.Sep.,2018</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> *      Author: Yulei</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#ifndef INCLUDE_GRAPHS_GRAPHPRINTER_H_</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#define INCLUDE_GRAPHS_GRAPHPRINTER_H_</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &lt;system_error&gt;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#include &lt;llvm/Support/ToolOutputFile.h&gt;</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#include &lt;llvm/Support/GraphWriter.h&gt;</span>       <span class="comment">// for graph write</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#include &lt;llvm/Support/FileSystem.h&gt;</span>        <span class="comment">// for file open flag</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;<span class="preprocessor">#include &lt;llvm/ADT/GraphTraits.h&gt;</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="keyword">namespace </span><a class="code" href="namespacellvm.html">llvm</a></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;</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="comment"> * Dump and print the graph for debugging</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html">   46</a></span>&#160;<span class="keyword">class </span><a class="code" href="classllvm_1_1GraphPrinter.html">GraphPrinter</a></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;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">   50</a></span>&#160;    <a class="code" href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">GraphPrinter</a>()</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;    }</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">   58</a></span>&#160;    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">WriteGraphToFile</a>(<a class="code" href="namespaceSVF.html#a8bd74fdcb0e58d0249003df9c3fb8b31">SVF::OutStream</a> &amp;O,</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                                 <span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;GraphName, <span class="keyword">const</span> GraphType &amp;GT, <span class="keywordtype">bool</span> simple = <span class="keyword">false</span>)</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    {</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="comment">// Filename of the output dot file</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> Filename = GraphName + <span class="stringliteral">&quot;.dot&quot;</span>;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        O &lt;&lt; <span class="stringliteral">&quot;Writing &#39;&quot;</span> &lt;&lt; Filename &lt;&lt; <span class="stringliteral">&quot;&#39;...&quot;</span>;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        std::error_code ErrInfo;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        llvm::ToolOutputFile F(Filename.c_str(), ErrInfo, llvm::sys::fs::OF_None);</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="keywordflow">if</span> (!ErrInfo)</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        {</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;            <span class="comment">// dump the ValueFlowGraph here</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;            WriteGraph(F.os(), GT, simple);</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;            F.os().close();</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="keywordflow">if</span> (!F.os().has_error())</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;                O &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;                F.keep();</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                <span class="keywordflow">return</span>;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;            }</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        }</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        O &lt;&lt; <span class="stringliteral">&quot;  error opening file for writing!\n&quot;</span>;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        F.os().clear_error();</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="l00086"></a><span class="lineno">   86</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">   87</a></span>&#160;    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">PrintGraph</a>(<a class="code" href="namespaceSVF.html#a8bd74fdcb0e58d0249003df9c3fb8b31">SVF::OutStream</a> &amp;O, <span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;GraphName,</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;                           <span class="keyword">const</span> GraphType &amp;GT)</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;    {</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keyword">typedef</span> llvm::GraphTraits&lt;GraphType&gt; GTraits;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::NodeRef NodeRef;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::nodes_iterator node_iterator;</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::ChildIteratorType child_iterator;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        O &lt;&lt; <span class="stringliteral">&quot;Printing VFG Graph&quot;</span> &lt;&lt; <span class="stringliteral">&quot;&#39;...\n&quot;</span>;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="comment">// Print each node name and its edges</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        node_iterator I = GTraits::nodes_begin(GT);</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        node_iterator E = GTraits::nodes_end(GT);</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">for</span> (; I != E; ++I)</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;            NodeRef *Node = *I;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            O &lt;&lt; <span class="stringliteral">&quot;node :&quot;</span> &lt;&lt; Node &lt;&lt; <span class="stringliteral">&quot;&#39;\n&quot;</span>;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            child_iterator EI = GTraits::child_begin(Node);</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            child_iterator EE = GTraits::child_end(Node);</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; EI != EE &amp;&amp; i != 64; ++EI, ++i)</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            {</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                O &lt;&lt; <span class="stringliteral">&quot;child :&quot;</span> &lt;&lt; *EI &lt;&lt; <span class="stringliteral">&quot;&#39;\n&quot;</span>;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;            }</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        }</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;};</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;} <span class="comment">// End namespace llvm</span></div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* INCLUDE_GRAPHS_GRAPHPRINTER_H_ */</span><span class="preprocessor"></span></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="classllvm_1_1GraphPrinter_html_ad950fc901ea4aabb6d6cdad8f883d381"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">llvm::GraphPrinter::PrintGraph</a></div><div class="ttdeci">static void PrintGraph(SVF::OutStream &amp;O, const std::string &amp;GraphName, const GraphType &amp;GT)</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00087">GraphPrinter.h:87</a></div></div>
-<div class="ttc" id="classllvm_1_1GraphPrinter_html"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html">llvm::GraphPrinter</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00046">GraphPrinter.h:46</a></div></div>
-<div class="ttc" id="classllvm_1_1GraphPrinter_html_af6ed328e74882d2b5e2b4039cb836928"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">llvm::GraphPrinter::WriteGraphToFile</a></div><div class="ttdeci">static void WriteGraphToFile(SVF::OutStream &amp;O, const std::string &amp;GraphName, const GraphType &amp;GT, bool simple=false)</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00058">GraphPrinter.h:58</a></div></div>
+<a href="GraphPrinter_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">//===- GraphPrinter.h -- Print Generic Graph---------------------//</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">//                     SVF: Static Value-Flow Analysis</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// Copyright (C) &lt;2013-2017&gt;  &lt;Yulei Sui&gt;</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="comment">// This program is free software: you can redistribute it and/or modify</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// it under the terms of the GNU General Public License as published by</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// (at your option) any later version.</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// This program is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// GNU General Public License for more details.</span></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="comment">// You should have received a copy of the GNU General Public License</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">// along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</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;<span class="comment">/*</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> * GraphPrinter.h</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *  Created on: 19.Sep.,2018</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> *      Author: Yulei</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#ifndef INCLUDE_GRAPHS_GRAPHPRINTER_H_</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#define INCLUDE_GRAPHS_GRAPHPRINTER_H_</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &lt;system_error&gt;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="GraphWriter_8h.html">Graphs/GraphWriter.h</a>&quot;</span> <span class="comment">// for graph write</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#include &lt;fstream&gt;</span></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="keyword">namespace </span><a class="code" href="namespacellvm.html">llvm</a></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;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment"> * Dump and print the graph for debugging</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html">   44</a></span>&#160;<span class="keyword">class </span><a class="code" href="classllvm_1_1GraphPrinter.html">GraphPrinter</a></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;{</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">   48</a></span>&#160;    <a class="code" href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">GraphPrinter</a>()</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    {</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    }</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">   56</a></span>&#160;    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">WriteGraphToFile</a>(<a class="code" href="namespaceSVF.html#a8bd74fdcb0e58d0249003df9c3fb8b31">SVF::OutStream</a> &amp;O,</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;                                 <span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;GraphName, <span class="keyword">const</span> GraphType &amp;GT, <span class="keywordtype">bool</span> simple = <span class="keyword">false</span>)</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    {</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <span class="comment">// Filename of the output dot file</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> Filename = GraphName + <span class="stringliteral">&quot;.dot&quot;</span>;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        std::ofstream outFile(Filename);</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        <span class="keywordflow">if</span> (outFile.fail())</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        {</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            O &lt;&lt; <span class="stringliteral">&quot;  error opening file for writing!\n&quot;</span>;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            outFile.close();</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span>;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        }</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        O &lt;&lt; <span class="stringliteral">&quot;Writing &#39;&quot;</span> &lt;&lt; Filename &lt;&lt; <span class="stringliteral">&quot;&#39;...&quot;</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;        <a class="code" href="namespacellvm.html#adc0ea9d5e23d0277eda65041e33fee55">WriteGraph</a>(outFile, GT, simple);</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        outFile.close();</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;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType&gt;</div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">   79</a></span>&#160;    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">PrintGraph</a>(<a class="code" href="namespaceSVF.html#a8bd74fdcb0e58d0249003df9c3fb8b31">SVF::OutStream</a> &amp;O, <span class="keyword">const</span> <a class="code" href="cJSON_8h.html#ad4c68ea99a26b0a98ad9a79982960458">std::string</a> &amp;GraphName,</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;                           <span class="keyword">const</span> GraphType &amp;GT)</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    {</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keyword">typedef</span> <a class="code" href="structllvm_1_1GraphTraits.html">llvm::GraphTraits&lt;GraphType&gt;</a> GTraits;</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::NodeRef NodeRef;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::nodes_iterator node_iterator;</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::ChildIteratorType child_iterator;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        O &lt;&lt; <span class="stringliteral">&quot;Printing VFG Graph&quot;</span> &lt;&lt; <span class="stringliteral">&quot;&#39;...\n&quot;</span>;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="comment">// Print each node name and its edges</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        node_iterator I = GTraits::nodes_begin(GT);</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        node_iterator E = GTraits::nodes_end(GT);</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keywordflow">for</span> (; I != E; ++I)</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;            NodeRef *Node = *I;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;            O &lt;&lt; <span class="stringliteral">&quot;node :&quot;</span> &lt;&lt; Node &lt;&lt; <span class="stringliteral">&quot;&#39;\n&quot;</span>;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;            child_iterator EI = GTraits::child_begin(Node);</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;            child_iterator EE = GTraits::child_end(Node);</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; EI != EE &amp;&amp; i != 64; ++EI, ++i)</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">  101</span>&#160;                O &lt;&lt; <span class="stringliteral">&quot;child :&quot;</span> &lt;&lt; *EI &lt;&lt; <span class="stringliteral">&quot;&#39;\n&quot;</span>;</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;    }</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;};</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;} <span class="comment">// End namespace llvm</span></div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* INCLUDE_GRAPHS_GRAPHPRINTER_H_ */</span><span class="preprocessor"></span></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>
+<div class="ttc" id="classllvm_1_1GraphPrinter_html_ad950fc901ea4aabb6d6cdad8f883d381"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#ad950fc901ea4aabb6d6cdad8f883d381">llvm::GraphPrinter::PrintGraph</a></div><div class="ttdeci">static void PrintGraph(SVF::OutStream &amp;O, const std::string &amp;GraphName, const GraphType &amp;GT)</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00079">GraphPrinter.h:79</a></div></div>
+<div class="ttc" id="classllvm_1_1GraphPrinter_html"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html">llvm::GraphPrinter</a></div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00044">GraphPrinter.h:44</a></div></div>
+<div class="ttc" id="classllvm_1_1GraphPrinter_html_af6ed328e74882d2b5e2b4039cb836928"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#af6ed328e74882d2b5e2b4039cb836928">llvm::GraphPrinter::WriteGraphToFile</a></div><div class="ttdeci">static void WriteGraphToFile(SVF::OutStream &amp;O, const std::string &amp;GraphName, const GraphType &amp;GT, bool simple=false)</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00056">GraphPrinter.h:56</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="namespacellvm_html_adc0ea9d5e23d0277eda65041e33fee55"><div class="ttname"><a href="namespacellvm.html#adc0ea9d5e23d0277eda65041e33fee55">llvm::WriteGraph</a></div><div class="ttdeci">std::ofstream &amp; WriteGraph(std::ofstream &amp;O, const GraphType &amp;G, bool ShortNames=false)</div><div class="ttdef"><b>Definition:</b> <a href="GraphWriter_8h_source.html#l00328">GraphWriter.h:328</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a8bd74fdcb0e58d0249003df9c3fb8b31"><div class="ttname"><a href="namespaceSVF.html#a8bd74fdcb0e58d0249003df9c3fb8b31">SVF::OutStream</a></div><div class="ttdeci">std::ostream OutStream</div><div class="ttdef"><b>Definition:</b> <a href="SVFType_8h_source.html#l00049">SVFType.h:49</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 class="ttc" id="classllvm_1_1GraphPrinter_html_a13b2efcc3e5967f60a27e107683cd448"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">llvm::GraphPrinter::GraphPrinter</a></div><div class="ttdeci">GraphPrinter()</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00050">GraphPrinter.h:50</a></div></div>
+<div class="ttc" id="classllvm_1_1GraphPrinter_html_a13b2efcc3e5967f60a27e107683cd448"><div class="ttname"><a href="classllvm_1_1GraphPrinter.html#a13b2efcc3e5967f60a27e107683cd448">llvm::GraphPrinter::GraphPrinter</a></div><div class="ttdeci">GraphPrinter()</div><div class="ttdef"><b>Definition:</b> <a href="GraphPrinter_8h_source.html#l00048">GraphPrinter.h:48</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 <!-- start footer part -->
 <hr class="footer"/><address class="footer"><small>

package/SVF-doxygen/html/html/GraphReachSolver_8h_source.html

@@ -66,8 +66,9 @@ $(function() {
 <div class="title">GraphReachSolver.h</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="GraphReachSolver_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">//===- GraphReachSolver.h -- Generic graph reachability solver---------------------------------//</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">//                     SVF: Static Value-Flow Analysis</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// Copyright (C) &lt;2013-2017&gt;  &lt;Yulei Sui&gt;</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="comment">// This program is free software: you can redistribute it and/or modify</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// it under the terms of the GNU General Public License as published by</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// (at your option) any later version.</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// This program is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// GNU General Public License for more details.</span></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="comment">// You should have received a copy of the GNU General Public License</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">// along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"> * GraphReachSolver.h</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *  Created on: Apr 1, 2014</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *      Author: Yulei Sui</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#ifndef CFLSOLVER_H_</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#define CFLSOLVER_H_</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="WorkList_8h.html">Util/WorkList.h</a>&quot;</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="DPItem_8h.html">Util/DPItem.h</a>&quot;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceSVF.html">SVF</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;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment"> * Generic Graph Reachability solver for demand-driven analysis based on different graphs (e.g. SVFIR, VFG, ThreadVFG)</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment"> * Extend this class for sophisticated CFL-reachability resolution (e.g. field, flow, path)</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType, <span class="keyword">class</span> DPIm = DPItem&gt;</div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html">   44</a></span>&#160;<span class="keyword">class </span><a class="code" href="classSVF_1_1GraphReachSolver.html">GraphReachSolver</a></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;{</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a2ede2e8b4c0f44d7f1d5ab7684915556">   49</a></span>&#160;    <span class="keyword">typedef</span> llvm::GraphTraits&lt;GraphType&gt; <a class="code" href="classSVF_1_1GraphReachSolver.html#a2ede2e8b4c0f44d7f1d5ab7684915556">GTraits</a>;</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#af499845fe35ebe782f660146808506de">   50</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::NodeType          <a class="code" href="classSVF_1_1GraphReachSolver.html#af499845fe35ebe782f660146808506de">GNODE</a>;</div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a8a42bdbb5987d0a340f9935f09e2acd2">   51</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::EdgeType          <a class="code" href="classSVF_1_1GraphReachSolver.html#a8a42bdbb5987d0a340f9935f09e2acd2">GEDGE</a>;</div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a4e5126b0e97e490ce65804e2017f0084">   52</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::nodes_iterator <a class="code" href="classSVF_1_1GraphReachSolver.html#a4e5126b0e97e490ce65804e2017f0084">node_iterator</a>;</div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">   53</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::ChildIteratorType <a class="code" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">child_iterator</a>;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#aa1542934a87c9edce00355fe2d690b9e">   56</a></span>&#160;    <span class="keyword">typedef</span> llvm::GraphTraits&lt;llvm::Inverse&lt;GNODE *&gt; &gt; <a class="code" href="classSVF_1_1GraphReachSolver.html#aa1542934a87c9edce00355fe2d690b9e">InvGTraits</a>;</div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a40fe9f5863619ee7c11a630e4fd89a91">   57</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> InvGTraits::ChildIteratorType <a class="code" href="classSVF_1_1GraphReachSolver.html#a40fe9f5863619ee7c11a630e4fd89a91">inv_child_iterator</a>;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a472784c3cb958b4347958f039d2fe054">   60</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classSVF_1_1FIFOWorkList.html">FIFOWorkList&lt;DPIm&gt;</a> <a class="code" href="classSVF_1_1GraphReachSolver.html#a472784c3cb958b4347958f039d2fe054">WorkList</a>;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keyword">protected</span>:</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a766dc60e7ce7b24b829ba591d069c174">   65</a></span>&#160;    <a class="code" href="classSVF_1_1GraphReachSolver.html#a766dc60e7ce7b24b829ba591d069c174">GraphReachSolver</a>(): <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>(nullptr)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    {</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    }</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a31e78a14271a152f5b7c0d751a39312a">   69</a></span>&#160;    <span class="keyword">virtual</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a31e78a14271a152f5b7c0d751a39312a">~GraphReachSolver</a>()</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;    }</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#a88775eedbbc3039caac1e350b48aa838">   74</a></span>&#160;    <span class="keyword">const</span> <span class="keyword">inline</span> GraphType <a class="code" href="classSVF_1_1GraphReachSolver.html#a88775eedbbc3039caac1e350b48aa838">graph</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    }</div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a0298a692295a8a4eae32ab151aa6ccc3">   78</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a0298a692295a8a4eae32ab151aa6ccc3">setGraph</a>(GraphType g)</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    {</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a> = g;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    }</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">   84</a></span>&#160;    <span class="keyword">inline</span> GNODE* <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> <span class="keywordtype">id</span>)<span class="keyword"> const</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>-&gt;getGNode(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    }</div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">   88</a></span>&#160;    <span class="keyword">virtual</span> <span class="keyword">inline</span> <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> <a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)<span class="keyword"> const</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">return</span> item.getCurNodeID();</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">   93</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">forwardTraverse</a>(DPIm&amp; it)</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(it);</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="keywordflow">while</span> (!<a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</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">   99</span>&#160;            DPIm <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a> = <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>();</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            <a class="code" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">FWProcessCurNode</a>(item);</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            GNODE* v = <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(item));</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            child_iterator EI = GTraits::child_begin(v);</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            child_iterator EE = GTraits::child_end(v);</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="keywordflow">for</span> (; EI != EE; ++EI)</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            {</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                <a class="code" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">FWProcessOutgoingEdge</a>(item,*(EI.getCurrent()) );</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            }</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        }</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    }</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a8785ea71a1b0da03595fc8f594921819">  112</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a8785ea71a1b0da03595fc8f594921819">backwardTraverse</a>(DPIm&amp; it)</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    {</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(it);</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="keywordflow">while</span> (!<a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</a>())</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        {</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            DPIm <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a> = <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>();</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            <a class="code" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">BWProcessCurNode</a>(item);</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            GNODE* v = <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(item));</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            inv_child_iterator EI = InvGTraits::child_begin(v);</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            inv_child_iterator EE = InvGTraits::child_end(v);</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;            <span class="keywordflow">for</span> (; EI != EE; ++EI)</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            {</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <a class="code" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">BWProcessIncomingEdge</a>(item,*(EI.getCurrent()) );</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;        }</div><div class="line"><a name="l00129"></a><span class="lineno">  129</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">  132</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">FWProcessCurNode</a>(<span class="keyword">const</span> DPIm&amp;)</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    {</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    }</div><div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">  135</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">BWProcessCurNode</a>(<span class="keyword">const</span> DPIm&amp;)</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    {</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">  141</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">FWProcessOutgoingEdge</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>, GEDGE* edge)</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    {</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        DPIm newItem(item);</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        newItem.setCurNodeID(edge-&gt;getDstID());</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(newItem);</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">  147</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">BWProcessIncomingEdge</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>, GEDGE* edge)</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    {</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;        DPIm newItem(item);</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        newItem.setCurNodeID(edge-&gt;getSrcID());</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(newItem);</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    }</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">  156</a></span>&#160;    <span class="keyword">inline</span> DPIm <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>()</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    {</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a8fa72918fce7e9c0b2dc34b683a797c6">pop</a>();</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    }</div><div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">  160</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    {</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a0df409a67428e528321869d201f2a474">push</a>(item);</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    }</div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">  164</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</a>()</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    {</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a7056704c224dfb4b57287fe90c004aa8">empty</a>();</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    }</div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a448dd77a75555479e9c8769c0638af2c">  168</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a448dd77a75555479e9c8769c0638af2c">isInWorklist</a>(DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    {</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#ab023f3b60ff61d6729d75f4d2942bd83">find</a>(item);</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    }</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div><div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">  177</a></span>&#160;    GraphType <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">  180</a></span>&#160;    WorkList <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;};</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;} <span class="comment">// End namespace SVF</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* CFLSOLVER_H_ */</span><span class="preprocessor"></span></div><div class="ttc" id="classSVF_1_1GraphReachSolver_html_ad1ad147241183e1077a4691ebe7861b5"><div class="ttname"><a href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">SVF::GraphReachSolver::forwardTraverse</a></div><div class="ttdeci">virtual void forwardTraverse(DPIm &amp;it)</div><div class="ttdoc">CFL forward traverse solve. </div><div class="ttdef"><b>Definition:</b> <a href="GraphReachSolver_8h_source.html#l00093">GraphReachSolver.h:93</a></div></div>
+<a href="GraphReachSolver_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">//===- GraphReachSolver.h -- Generic graph reachability solver---------------------------------//</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">//                     SVF: Static Value-Flow Analysis</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// Copyright (C) &lt;2013-2017&gt;  &lt;Yulei Sui&gt;</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="comment">// This program is free software: you can redistribute it and/or modify</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// it under the terms of the GNU General Public License as published by</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// (at your option) any later version.</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// This program is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// GNU General Public License for more details.</span></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="comment">// You should have received a copy of the GNU General Public License</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">// along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">//===----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"> * GraphReachSolver.h</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment"> *</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *  Created on: Apr 1, 2014</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *      Author: Yulei Sui</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="preprocessor">#ifndef CFLSOLVER_H_</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="preprocessor">#define CFLSOLVER_H_</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="WorkList_8h.html">Util/WorkList.h</a>&quot;</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="DPItem_8h.html">Util/DPItem.h</a>&quot;</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceSVF.html">SVF</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;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment"> * Generic Graph Reachability solver for demand-driven analysis based on different graphs (e.g. SVFIR, VFG, ThreadVFG)</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment"> * Extend this class for sophisticated CFL-reachability resolution (e.g. field, flow, path)</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> GraphType, <span class="keyword">class</span> DPIm = DPItem&gt;</div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html">   44</a></span>&#160;<span class="keyword">class </span><a class="code" href="classSVF_1_1GraphReachSolver.html">GraphReachSolver</a></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;{</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a2ede2e8b4c0f44d7f1d5ab7684915556">   49</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="structllvm_1_1GraphTraits.html">llvm::GraphTraits&lt;GraphType&gt;</a> <a class="code" href="classSVF_1_1GraphReachSolver.html#a2ede2e8b4c0f44d7f1d5ab7684915556">GTraits</a>;</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#af499845fe35ebe782f660146808506de">   50</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::NodeType          <a class="code" href="classSVF_1_1GraphReachSolver.html#af499845fe35ebe782f660146808506de">GNODE</a>;</div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a8a42bdbb5987d0a340f9935f09e2acd2">   51</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::EdgeType          <a class="code" href="classSVF_1_1GraphReachSolver.html#a8a42bdbb5987d0a340f9935f09e2acd2">GEDGE</a>;</div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a4e5126b0e97e490ce65804e2017f0084">   52</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::nodes_iterator <a class="code" href="classSVF_1_1GraphReachSolver.html#a4e5126b0e97e490ce65804e2017f0084">node_iterator</a>;</div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">   53</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> GTraits::ChildIteratorType <a class="code" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">child_iterator</a>;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#aa1542934a87c9edce00355fe2d690b9e">   56</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="structllvm_1_1GraphTraits.html">llvm::GraphTraits&lt;llvm::Inverse&lt;GNODE *&gt;</a> &gt; <a class="code" href="classSVF_1_1GraphReachSolver.html#aa1542934a87c9edce00355fe2d690b9e">InvGTraits</a>;</div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a40fe9f5863619ee7c11a630e4fd89a91">   57</a></span>&#160;    <span class="keyword">typedef</span> <span class="keyword">typename</span> InvGTraits::ChildIteratorType <a class="code" href="classSVF_1_1GraphReachSolver.html#a40fe9f5863619ee7c11a630e4fd89a91">inv_child_iterator</a>;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a472784c3cb958b4347958f039d2fe054">   60</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="classSVF_1_1FIFOWorkList.html">FIFOWorkList&lt;DPIm&gt;</a> <a class="code" href="classSVF_1_1GraphReachSolver.html#a472784c3cb958b4347958f039d2fe054">WorkList</a>;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="keyword">protected</span>:</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a766dc60e7ce7b24b829ba591d069c174">   65</a></span>&#160;    <a class="code" href="classSVF_1_1GraphReachSolver.html#a766dc60e7ce7b24b829ba591d069c174">GraphReachSolver</a>(): <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>(nullptr)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    {</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    }</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a31e78a14271a152f5b7c0d751a39312a">   69</a></span>&#160;    <span class="keyword">virtual</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a31e78a14271a152f5b7c0d751a39312a">~GraphReachSolver</a>()</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;    }</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#a88775eedbbc3039caac1e350b48aa838">   74</a></span>&#160;    <span class="keyword">const</span> <span class="keyword">inline</span> GraphType <a class="code" href="classSVF_1_1GraphReachSolver.html#a88775eedbbc3039caac1e350b48aa838">graph</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    }</div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a0298a692295a8a4eae32ab151aa6ccc3">   78</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a0298a692295a8a4eae32ab151aa6ccc3">setGraph</a>(GraphType g)</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    {</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a> = g;</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    }</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">   84</a></span>&#160;    <span class="keyword">inline</span> GNODE* <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> <span class="keywordtype">id</span>)<span class="keyword"> const</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>-&gt;getGNode(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    }</div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">   88</a></span>&#160;    <span class="keyword">virtual</span> <span class="keyword">inline</span> <a class="code" href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">NodeID</a> <a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)<span class="keyword"> const</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="keyword">    </span>{</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">return</span> item.getCurNodeID();</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">   93</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">forwardTraverse</a>(DPIm&amp; it)</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    {</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(it);</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="keywordflow">while</span> (!<a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</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">   99</span>&#160;            DPIm <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a> = <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>();</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;            <a class="code" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">FWProcessCurNode</a>(item);</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            GNODE* v = <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(item));</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;            child_iterator EI = GTraits::child_begin(v);</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;            child_iterator EE = GTraits::child_end(v);</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            <span class="keywordflow">for</span> (; EI != EE; ++EI)</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            {</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                <a class="code" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">FWProcessOutgoingEdge</a>(item,*(EI.getCurrent()) );</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;            }</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        }</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    }</div><div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a8785ea71a1b0da03595fc8f594921819">  112</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a8785ea71a1b0da03595fc8f594921819">backwardTraverse</a>(DPIm&amp; it)</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    {</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(it);</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="keywordflow">while</span> (!<a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</a>())</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        {</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;            DPIm <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a> = <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>();</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;            <a class="code" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">BWProcessCurNode</a>(item);</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;            GNODE* v = <a class="code" href="classSVF_1_1GraphReachSolver.html#a0b7f0923105dfb198a2a8428d6c1ca98">getNode</a>(<a class="code" href="classSVF_1_1GraphReachSolver.html#a84f39b3234ddf8198c793ff8c5d59cdf">getNodeIDFromItem</a>(item));</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            inv_child_iterator EI = InvGTraits::child_begin(v);</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            inv_child_iterator EE = InvGTraits::child_end(v);</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;            <span class="keywordflow">for</span> (; EI != EE; ++EI)</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;            {</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                <a class="code" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">BWProcessIncomingEdge</a>(item,*(EI.getCurrent()) );</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;        }</div><div class="line"><a name="l00129"></a><span class="lineno">  129</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">  132</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a6ea48755ca28468b426380e838494087">FWProcessCurNode</a>(<span class="keyword">const</span> DPIm&amp;)</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    {</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    }</div><div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">  135</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5b2ec04cbee0e457ed9d8a8a4c2e134f">BWProcessCurNode</a>(<span class="keyword">const</span> DPIm&amp;)</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    {</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">  141</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a3f205f7bc0f0ae1a14184bb8cae4bf92">FWProcessOutgoingEdge</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>, GEDGE* edge)</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    {</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;        DPIm newItem(item);</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;        newItem.setCurNodeID(edge-&gt;getDstID());</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(newItem);</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"><a class="line" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">  147</a></span>&#160;    <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#aac7caf50b94caa7bd6960461c0c16014">BWProcessIncomingEdge</a>(<span class="keyword">const</span> DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>, GEDGE* edge)</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    {</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;        DPIm newItem(item);</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;        newItem.setCurNodeID(edge-&gt;getSrcID());</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;        <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(newItem);</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    }</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div><div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">  156</a></span>&#160;    <span class="keyword">inline</span> DPIm <a class="code" href="classSVF_1_1GraphReachSolver.html#a1638d1ccdcef472f2c54a2e18fc4130b">popFromWorklist</a>()</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    {</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a8fa72918fce7e9c0b2dc34b683a797c6">pop</a>();</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    }</div><div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">  160</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a53564d384938c19980cb138f720e34e9">pushIntoWorklist</a>(DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    {</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a0df409a67428e528321869d201f2a474">push</a>(item);</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    }</div><div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">  164</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a7bfeccdf602cf901699e806e6c481f26">isWorklistEmpty</a>()</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    {</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#a7056704c224dfb4b57287fe90c004aa8">empty</a>();</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    }</div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a448dd77a75555479e9c8769c0638af2c">  168</a></span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a448dd77a75555479e9c8769c0638af2c">isInWorklist</a>(DPIm&amp; <a class="code" href="cJSON_8h.html#ac76cea59d438ba893d2f82aabb367d14">item</a>)</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    {</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>.<a class="code" href="classSVF_1_1FIFOWorkList.html#ab023f3b60ff61d6729d75f4d2942bd83">find</a>(item);</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    }</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="keyword">private</span>:</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div><div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">  177</a></span>&#160;    GraphType <a class="code" href="classSVF_1_1GraphReachSolver.html#af486b67b972d797107ec82f3f7988668">_graph</a>;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">  180</a></span>&#160;    WorkList <a class="code" href="classSVF_1_1GraphReachSolver.html#a5032d3988dbce5a29274c55dc4dbe6bc">worklist</a>;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;};</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;} <span class="comment">// End namespace SVF</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* CFLSOLVER_H_ */</span><span class="preprocessor"></span></div><div class="ttc" id="classSVF_1_1GraphReachSolver_html_ad1ad147241183e1077a4691ebe7861b5"><div class="ttname"><a href="classSVF_1_1GraphReachSolver.html#ad1ad147241183e1077a4691ebe7861b5">SVF::GraphReachSolver::forwardTraverse</a></div><div class="ttdeci">virtual void forwardTraverse(DPIm &amp;it)</div><div class="ttdoc">CFL forward traverse solve. </div><div class="ttdef"><b>Definition:</b> <a href="GraphReachSolver_8h_source.html#l00093">GraphReachSolver.h:93</a></div></div>
 <div class="ttc" id="classSVF_1_1GraphReachSolver_html_a2ede2e8b4c0f44d7f1d5ab7684915556"><div class="ttname"><a href="classSVF_1_1GraphReachSolver.html#a2ede2e8b4c0f44d7f1d5ab7684915556">SVF::GraphReachSolver::GTraits</a></div><div class="ttdeci">llvm::GraphTraits&lt; GraphType &gt; GTraits</div><div class="ttdoc">Define the GTraits and node iterator. </div><div class="ttdef"><b>Definition:</b> <a href="GraphReachSolver_8h_source.html#l00049">GraphReachSolver.h:49</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>
 <div class="ttc" id="namespaceSVF_html_a350ae9bf8606bdfe23c8679681b969dc"><div class="ttname"><a href="namespaceSVF.html#a350ae9bf8606bdfe23c8679681b969dc">SVF::NodeID</a></div><div class="ttdeci">unsigned NodeID</div><div class="ttdef"><b>Definition:</b> <a href="include_2MTA_2MTAResultValidator_8h_source.html#l00020">MTAResultValidator.h:20</a></div></div>
 <div class="ttc" id="classSVF_1_1GraphReachSolver_html_a4e5126b0e97e490ce65804e2017f0084"><div class="ttname"><a href="classSVF_1_1GraphReachSolver.html#a4e5126b0e97e490ce65804e2017f0084">SVF::GraphReachSolver::node_iterator</a></div><div class="ttdeci">GTraits::nodes_iterator node_iterator</div><div class="ttdef"><b>Definition:</b> <a href="GraphReachSolver_8h_source.html#l00052">GraphReachSolver.h:52</a></div></div>
 <div class="ttc" id="classSVF_1_1FIFOWorkList_html_ab023f3b60ff61d6729d75f4d2942bd83"><div class="ttname"><a href="classSVF_1_1FIFOWorkList.html#ab023f3b60ff61d6729d75f4d2942bd83">SVF::FIFOWorkList::find</a></div><div class="ttdeci">bool find(const Data &amp;data) const</div><div class="ttdef"><b>Definition:</b> <a href="WorkList_8h_source.html#l00157">WorkList.h:157</a></div></div>

package/SVF-doxygen/html/html/GraphTraits_8h.html

@@ -0,0 +1,117 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=9"/>
+<meta name="generator" content="Doxygen 1.8.13"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>Static Value-Flow Analysis: /home/runner/work/SVF/SVF/include/Graphs/GraphTraits.h File Reference</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+  <td id="projectalign" style="padding-left: 0.5em;">
+   <div id="projectname">Static Value-Flow Analysis
+   </div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.13 -->
+<script type="text/javascript">
+var searchBox = new SearchBox("searchBox", "search",false,'Search');
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+$(function() {
+  initMenu('',true,false,'search.php','Search');
+  $(document).ready(function() { init_search(); });
+});
+</script>
+<div id="main-nav"></div>
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<iframe src="javascript:void(0)" frameborder="0" 
+        name="MSearchResults" id="MSearchResults">
+</iframe>
+</div>
+
+<div id="nav-path" class="navpath">
+  <ul>
+<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_fa02919a30fec2d2c2d591b4d920d648.html">Graphs</a></li>  </ul>
+</div>
+</div><!-- top -->
+<div class="header">
+  <div class="summary">
+<a href="#nested-classes">Classes</a> &#124;
+<a href="#namespaces">Namespaces</a> &#124;
+<a href="#func-members">Functions</a>  </div>
+  <div class="headertitle">
+<div class="title">GraphTraits.h File Reference</div>  </div>
+</div><!--header-->
+<div class="contents">
+<div class="textblock"><code>#include &quot;<a class="el" href="iterator__range_8h_source.html">Util/iterator_range.h</a>&quot;</code><br />
+</div>
+<p><a href="GraphTraits_8h_source.html">Go to the source code of this file.</a></p>
+<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">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structllvm_1_1GraphTraits.html">llvm::GraphTraits&lt; GraphType &gt;</a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structllvm_1_1Inverse.html">llvm::Inverse&lt; GraphType &gt;</a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01Inverse_3_01T_01_4_01_4_01_4.html">llvm::GraphTraits&lt; Inverse&lt; Inverse&lt; T &gt; &gt; &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="separator:"><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:ad615816ca25b07333f9a7495cbcb8029"><td class="memTemplParams" colspan="2">template&lt;class GraphType &gt; </td></tr>
+<tr class="memitem:ad615816ca25b07333f9a7495cbcb8029"><td class="memTemplItemLeft" align="right" valign="top">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::nodes_iterator &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">llvm::nodes</a> (const GraphType &amp;G)</td></tr>
+<tr class="separator:ad615816ca25b07333f9a7495cbcb8029"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a83fd30d5d8e023c6f35d5a5e998d6810"><td class="memTemplParams" colspan="2">template&lt;class GraphType &gt; </td></tr>
+<tr class="memitem:a83fd30d5d8e023c6f35d5a5e998d6810"><td class="memTemplItemLeft" align="right" valign="top">iterator_range&lt; typename GraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::nodes_iterator &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#a83fd30d5d8e023c6f35d5a5e998d6810">llvm::inverse_nodes</a> (const GraphType &amp;G)</td></tr>
+<tr class="separator:a83fd30d5d8e023c6f35d5a5e998d6810"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a77e0432868a8d88e98b2fdb383790e4a"><td class="memTemplParams" colspan="2">template&lt;class GraphType &gt; </td></tr>
+<tr class="memitem:a77e0432868a8d88e98b2fdb383790e4a"><td class="memTemplItemLeft" align="right" valign="top">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::ChildIteratorType &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#a77e0432868a8d88e98b2fdb383790e4a">llvm::children</a> (const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</td></tr>
+<tr class="separator:a77e0432868a8d88e98b2fdb383790e4a"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a271d439f063099eb81b7e8549fec97a7"><td class="memTemplParams" colspan="2">template&lt;class GraphType &gt; </td></tr>
+<tr class="memitem:a271d439f063099eb81b7e8549fec97a7"><td class="memTemplItemLeft" align="right" valign="top">iterator_range&lt; typename GraphTraits&lt; Inverse&lt; GraphType &gt; &gt;::ChildIteratorType &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#a271d439f063099eb81b7e8549fec97a7">llvm::inverse_children</a> (const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</td></tr>
+<tr class="separator:a271d439f063099eb81b7e8549fec97a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:aa7827c4f1bc6c4c3e21161da5bee01db"><td class="memTemplParams" colspan="2">template&lt;class GraphType &gt; </td></tr>
+<tr class="memitem:aa7827c4f1bc6c4c3e21161da5bee01db"><td class="memTemplItemLeft" align="right" valign="top">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::ChildEdgeIteratorType &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacellvm.html#aa7827c4f1bc6c4c3e21161da5bee01db">llvm::children_edges</a> (const typename GraphTraits&lt; GraphType &gt;::NodeRef &amp;G)</td></tr>
+<tr class="separator:aa7827c4f1bc6c4c3e21161da5bee01db"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+</div><!-- contents -->
+<!-- start footer part -->
+<hr class="footer"/><address class="footer"><small>
+Generated by &#160;<a href="http://www.doxygen.org/index.html">
+<img class="footer" src="doxygen.png" alt="doxygen"/>
+</a> 1.8.13
+</small></address>
+</body>
+</html>