npm - svf-tools - Versions diffs - 1.0.596 → 1.0.598 - Mend

svf-tools 1.0.596 → 1.0.598

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (802) hide show

package/SVF-doxygen/html/html/dda_8cpp_source.html CHANGED Viewed

@@ -67,7 +67,7 @@ $(function() {
 </div><!--header-->
 <div class="contents">
 <a href="dda_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> // On Demand Value Flow Analysis</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> //</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> // Author: Yulei Sui,</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">//#include &quot;AliasUtil/AliasAnalysisCounter.h&quot;</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//#include &quot;MemoryModel/ComTypeModel.h&quot;</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="LLVMUtil_8h.html">SVF-LLVM/LLVMUtil.h</a>&quot;</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="SVFIRBuilder_8h.html">SVF-LLVM/SVFIRBuilder.h</a>&quot;</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="DDAPass_8h.html">DDA/DDAPass.h</a>&quot;</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="Options_8h.html">Util/Options.h</a>&quot;</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="keyword">using namespace </span><a class="code" href="namespacellvm.html">llvm</a>;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="keyword">using namespace </span><a class="code" href="namespaceSVF.html">SVF</a>;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">static</span> cl::opt&lt;bool&gt;</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<a class="code" href="dda_8cpp.html#afffbd7760f0128b74c9dbfd517d0f99e">StandardCompileOpts</a>(<span class="stringliteral">&quot;std-compile-opts&quot;</span>,</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;                    cl::desc(<span class="stringliteral">&quot;Include the standard compile time optimizations&quot;</span>));</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="keyword">static</span> llvm::cl::opt&lt;std::string&gt; <a class="code" href="dda_8cpp.html#a139199e1f33675df72b018c31e0be35c">InputFilename</a>(llvm::cl::Positional,</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;        llvm::cl::desc(<span class="stringliteral">&quot;&lt;input bitcode&gt;&quot;</span>), llvm::cl::init(<span class="stringliteral">&quot;-&quot;</span>));</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">//static cl::list&lt;const PassInfo*, bool, PassNameParser&gt;</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">//PassList(cl::desc(&quot;Optimizations available:&quot;));</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#a55c1167d4e6efe7828f050d978291725">DAA</a>(<span class="stringliteral">&quot;daa&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;                         cl::desc(<span class="stringliteral">&quot;Demand-Driven Alias Analysis Pass&quot;</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="keyword">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#a5ed1de5ad06cf459c1b4e63685316618">REGPT</a>(<span class="stringliteral">&quot;dreg&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;                           cl::desc(<span class="stringliteral">&quot;Demand-driven regular points-to analysis&quot;</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="keyword">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#a3abc2ce6737d192a5c3f967734fe8389">RFINEPT</a>(<span class="stringliteral">&quot;dref&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;                             cl::desc(<span class="stringliteral">&quot;Demand-driven refinement points-to analysis&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">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#adad2a8a1b2f5bf9f333382725f174cb0">ENABLEFIELD</a>(<span class="stringliteral">&quot;fdaa&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;                                 cl::desc(<span class="stringliteral">&quot;enable field-sensitivity for demand-driven analysis&quot;</span>));</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="keyword">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#a1fe1900e000a62ca91dc0651bfa3a24f">ENABLECONTEXT</a>(<span class="stringliteral">&quot;cdaa&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;                                   cl::desc(<span class="stringliteral">&quot;enable context-sensitivity for demand-driven analysis&quot;</span>));</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keyword">static</span> cl::opt&lt;bool&gt; <a class="code" href="dda_8cpp.html#af95c31f8cf35812a4fe4a22342aacaa2">ENABLEFLOW</a>(<span class="stringliteral">&quot;ldaa&quot;</span>, cl::init(<span class="keyword">false</span>),</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;                                cl::desc(<span class="stringliteral">&quot;enable flow-sensitivity for demand-driven analysis&quot;</span>));</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="dda_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">   45</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="dda_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> ** argv)</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;</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">int</span> arg_num = 0;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="keywordtype">char</span> **arg_value = <span class="keyword">new</span> <span class="keywordtype">char</span>*[argc];</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    std::vector&lt;std::string&gt; moduleNameVec;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <a class="code" href="namespaceSVF_1_1LLVMUtil.html#accdd44093d6d145dc92edeaaff3f5732">LLVMUtil::processArguments</a>(argc, argv, arg_num, arg_value, moduleNameVec);</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    cl::ParseCommandLineOptions(arg_num, arg_value,</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;                                <span class="stringliteral">&quot;Demand-Driven Points-to Analysis\n&quot;</span>);</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keywordflow">if</span> (Options::WriteAnder == <span class="stringliteral">&quot;ir_annotator&quot;</span>)</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    {</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        LLVMModuleSet::getLLVMModuleSet()-&gt;preProcessBCs(moduleNameVec);</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;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <a class="code" href="classSVF_1_1SVFModule.html">SVFModule</a>* svfModule = LLVMModuleSet::getLLVMModuleSet()-&gt;buildSVFModule(moduleNameVec);</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <a class="code" href="classSVF_1_1SVFIRBuilder.html">SVFIRBuilder</a> builder(svfModule);</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    <a class="code" href="classSVF_1_1SVFIR.html">SVFIR</a>* pag = builder.<a class="code" href="classSVF_1_1SVFIRBuilder.html#a5ecf1deb5646ccb46b0b3101417f4689">build</a>();</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;    <a class="code" href="classSVF_1_1DDAPass.html">DDAPass</a> *dda = <span class="keyword">new</span> <a class="code" href="classSVF_1_1DDAPass.html">DDAPass</a>();</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    dda-&gt;<a class="code" href="classSVF_1_1DDAPass.html#aca46f1d464f5766ae666661a164a51a9">runOnModule</a>(pag);</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">return</span> 0;</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;}</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div><div class="ttc" id="dda_8cpp_html_a1fe1900e000a62ca91dc0651bfa3a24f"><div class="ttname"><a href="dda_8cpp.html#a1fe1900e000a62ca91dc0651bfa3a24f">ENABLECONTEXT</a></div><div class="ttdeci">static cl::opt&lt; bool &gt; ENABLECONTEXT(&quot;cdaa&quot;, cl::init(false), cl::desc(&quot;enable context-sensitivity for demand-driven analysis&quot;))</div></div>
-<div class="ttc" id="namespacellvm_html"><div class="ttname"><a href="namespacellvm.html">llvm</a></div><div class="ttdef"><b>Definition:</b> <a href="CFLGraph_8h_source.html#l00192">CFLGraph.h:192</a></div></div>
+<div class="ttc" id="namespacellvm_html"><div class="ttname"><a href="namespacellvm.html">llvm</a></div><div class="ttdef"><b>Definition:</b> <a href="GEPTypeBridgeIterator_8h_source.html#l00013">GEPTypeBridgeIterator.h:13</a></div></div>
 <div class="ttc" id="dda_8cpp_html_a139199e1f33675df72b018c31e0be35c"><div class="ttname"><a href="dda_8cpp.html#a139199e1f33675df72b018c31e0be35c">InputFilename</a></div><div class="ttdeci">static llvm::cl::opt&lt; std::string &gt; InputFilename(llvm::cl::Positional, llvm::cl::desc(&quot;&lt;input bitcode&gt;&quot;), llvm::cl::init(&quot;-&quot;))</div></div>
 <div class="ttc" id="dda_8cpp_html_afffbd7760f0128b74c9dbfd517d0f99e"><div class="ttname"><a href="dda_8cpp.html#afffbd7760f0128b74c9dbfd517d0f99e">StandardCompileOpts</a></div><div class="ttdeci">static cl::opt&lt; bool &gt; StandardCompileOpts(&quot;std-compile-opts&quot;, cl::desc(&quot;Include the standard compile time optimizations&quot;))</div></div>
 <div class="ttc" id="dda_8cpp_html_a5ed1de5ad06cf459c1b4e63685316618"><div class="ttname"><a href="dda_8cpp.html#a5ed1de5ad06cf459c1b4e63685316618">REGPT</a></div><div class="ttdeci">static cl::opt&lt; bool &gt; REGPT(&quot;dreg&quot;, cl::init(false), cl::desc(&quot;Demand-driven regular points-to analysis&quot;))</div></div>

package/SVF-doxygen/html/html/fastcluster__R__dm_8cpp_8inc_source.html CHANGED Viewed

@@ -66,8 +66,8 @@ $(function() {
 <div class="title">fastcluster_R_dm.cpp.inc</div>  </div>
 </div><!--header-->
 <div class="contents">
-<a href="fastcluster__R__dm_8cpp_8inc.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">//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// Excerpt from fastcluster_R.cpp</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// Copyright: Daniel Müllner, 2011 &lt;http://danifold.net&gt;</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="keyword">struct </span>pos_node {</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;  t_index pos;</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;  <span class="keywordtype">int</span> node;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;};</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordtype">void</span> order_nodes(<span class="keyword">const</span> <span class="keywordtype">int</span> N, <span class="keyword">const</span> <span class="keywordtype">int</span> * <span class="keyword">const</span> merge, <span class="keyword">const</span> t_index * <span class="keyword">const</span> node_size, <span class="keywordtype">int</span> * <span class="keyword">const</span> order) {</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;  <span class="comment">/* Parameters:</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">     N         : number of data points</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">     merge     : (N-1)×2 array which specifies the node indices which are</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">                 merged in each step of the clustering procedure.</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">                 Negative entries -1...-N point to singleton nodes, while</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">                 positive entries 1...(N-1) point to nodes which are themselves</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">                 parents of other nodes.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">     node_size : array of node sizes - makes it easier</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">     order     : output array of size N</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">     Runtime: Θ(N)</span></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;  auto_array_ptr&lt;pos_node&gt; queue(N/2);</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;  <span class="keywordtype">int</span> parent;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;  <span class="keywordtype">int</span> <a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;  t_index pos = 0;</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;  queue[0].pos = 0;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;  queue[0].node = N-2;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;  t_index idx = 1;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    --idx;</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    pos = queue[idx].pos;</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    parent = queue[idx].node;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="comment">// First child</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    child = merge[parent];</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    <span class="keywordflow">if</span> (child&lt;0) { <span class="comment">// singleton node, write this into the &#39;order&#39; array.</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;      order[pos] = -<a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;      ++pos;</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;    <span class="keywordflow">else</span> { <span class="comment">/* compound node: put it on top of the queue and decompose it</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">              in a later iteration. */</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;      queue[idx].pos = pos;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;      queue[idx].node = child-1; <span class="comment">// convert index-1 based to index-0 based</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;      ++idx;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;      pos += node_size[child-1];</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    }</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="comment">// Second child</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    child = merge[parent+N-1];</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keywordflow">if</span> (child&lt;0) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;      order[pos] = -<a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    }</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;      queue[idx].pos = pos;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;      queue[idx].node = child-1;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;      ++idx;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    }</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;  } <span class="keywordflow">while</span> (idx&gt;0);</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;}</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="preprocessor">#define size_(r_) ( ((r_&lt;N) ? 1 : node_size[r_-N]) )</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;<span class="keyword">template</span> &lt;const <span class="keywordtype">bool</span> sorted&gt;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="keywordtype">void</span> generate_R_dendrogram(<span class="keywordtype">int</span> * <span class="keyword">const</span> merge, <span class="keywordtype">double</span> * <span class="keyword">const</span> height, <span class="keywordtype">int</span> * <span class="keyword">const</span> order, cluster_result &amp; Z2, <span class="keyword">const</span> <span class="keywordtype">int</span> N) {</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  <span class="comment">// The array &quot;nodes&quot; is a union-find data structure for the cluster</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;  <span class="comment">// identites (only needed for unsorted cluster_result input).</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;  union_find <a class="code" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">nodes</a>(sorted ? 0 : N);</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;  <span class="keywordflow">if</span> (!sorted) {</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    std::stable_sort(Z2[0], Z2[N-1]);</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;  }</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  t_index node1, node2;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;  auto_array_ptr&lt;t_index&gt; node_size(N-1);</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;  <span class="keywordflow">for</span> (t_index i=0; i&lt;N-1; ++i) {</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    <span class="comment">// Get two data points whose clusters are merged in step i.</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    <span class="comment">// Find the cluster identifiers for these points.</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordflow">if</span> (sorted) {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;      node1 = Z2[i]-&gt;node1;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;      node2 = Z2[i]-&gt;node2;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;      node1 = <a class="code" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">nodes</a>.Find(Z2[i]-&gt;node1);</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;      node2 = <a class="code" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">nodes</a>.Find(Z2[i]-&gt;node2);</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;      <span class="comment">// Merge the nodes in the union-find data structure by making them</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;      <span class="comment">// children of a new node.</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;      <a class="code" href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">nodes</a>.Union(node1, node2);</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    }</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="comment">// Sort the nodes in the output array.</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    <span class="keywordflow">if</span> (node1&gt;node2) {</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;      t_index tmp = node1;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;      node1 = node2;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;      node2 = tmp;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    }</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="comment">/* Conversion between labeling conventions.</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="comment">       Input:  singleton nodes 0,...,N-1</span></div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment">               compound nodes  N,...,2N-2</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="comment">       Output: singleton nodes -1,...,-N</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">               compound nodes  1,...,N</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment">    */</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    merge[i]     = (node1&lt;N) ? -static_cast&lt;int&gt;(node1)-1</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                              : <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node1)-N+1;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    merge[i+N-1] = (node2&lt;N) ? -static_cast&lt;int&gt;(node2)-1</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                              : <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node2)-N+1;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    height[i] = Z2[i]-&gt;dist;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    node_size[i] = size_(node1) + size_(node2);</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;  order_nodes(N, merge, node_size, order);</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div><div class="ttc" id="cJSON_8cpp_html_ad00efb41ca386db28bacc7aefe79535c"><div class="ttname"><a href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a></div><div class="ttdeci">cJSON * child</div><div class="ttdef"><b>Definition:</b> <a href="cJSON_8cpp_source.html#l02723">cJSON.cpp:2723</a></div></div>
-<div class="ttc" id="namespacellvm_html_ad615816ca25b07333f9a7495cbcb8029"><div class="ttname"><a href="namespacellvm.html#ad615816ca25b07333f9a7495cbcb8029">llvm::nodes</a></div><div class="ttdeci">iterator_range&lt; typename GraphTraits&lt; GraphType &gt;::nodes_iterator &gt; nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00111">GraphTraits.h:111</a></div></div>
+<a href="fastcluster__R__dm_8cpp_8inc.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">//</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment">// Excerpt from fastcluster_R.cpp</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">// Copyright: Daniel Müllner, 2011 &lt;http://danifold.net&gt;</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;</div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="keyword">struct </span>pos_node {</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;  t_index pos;</div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;  <span class="keywordtype">int</span> node;</div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;};</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="keywordtype">void</span> order_nodes(<span class="keyword">const</span> <span class="keywordtype">int</span> N, <span class="keyword">const</span> <span class="keywordtype">int</span> * <span class="keyword">const</span> merge, <span class="keyword">const</span> t_index * <span class="keyword">const</span> node_size, <span class="keywordtype">int</span> * <span class="keyword">const</span> order) {</div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;  <span class="comment">/* Parameters:</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">     N         : number of data points</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">     merge     : (N-1)×2 array which specifies the node indices which are</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">                 merged in each step of the clustering procedure.</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">                 Negative entries -1...-N point to singleton nodes, while</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">                 positive entries 1...(N-1) point to nodes which are themselves</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="comment">                 parents of other nodes.</span></div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">     node_size : array of node sizes - makes it easier</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">     order     : output array of size N</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">     Runtime: Θ(N)</span></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;  auto_array_ptr&lt;pos_node&gt; queue(N/2);</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;  <span class="keywordtype">int</span> parent;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;  <span class="keywordtype">int</span> <a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;  t_index pos = 0;</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;  queue[0].pos = 0;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;  queue[0].node = N-2;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;  t_index idx = 1;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    --idx;</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    pos = queue[idx].pos;</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    parent = queue[idx].node;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="comment">// First child</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    child = merge[parent];</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    <span class="keywordflow">if</span> (child&lt;0) { <span class="comment">// singleton node, write this into the &#39;order&#39; array.</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;      order[pos] = -<a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;      ++pos;</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;    <span class="keywordflow">else</span> { <span class="comment">/* compound node: put it on top of the queue and decompose it</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">              in a later iteration. */</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;      queue[idx].pos = pos;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;      queue[idx].node = child-1; <span class="comment">// convert index-1 based to index-0 based</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;      ++idx;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;      pos += node_size[child-1];</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    }</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="comment">// Second child</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    child = merge[parent+N-1];</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;    <span class="keywordflow">if</span> (child&lt;0) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;      order[pos] = -<a class="code" href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a>;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;    }</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;      queue[idx].pos = pos;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;      queue[idx].node = child-1;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;      ++idx;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    }</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;  } <span class="keywordflow">while</span> (idx&gt;0);</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;}</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="preprocessor">#define size_(r_) ( ((r_&lt;N) ? 1 : node_size[r_-N]) )</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;<span class="keyword">template</span> &lt;const <span class="keywordtype">bool</span> sorted&gt;</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="keywordtype">void</span> generate_R_dendrogram(<span class="keywordtype">int</span> * <span class="keyword">const</span> merge, <span class="keywordtype">double</span> * <span class="keyword">const</span> height, <span class="keywordtype">int</span> * <span class="keyword">const</span> order, cluster_result &amp; Z2, <span class="keyword">const</span> <span class="keywordtype">int</span> N) {</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  <span class="comment">// The array &quot;nodes&quot; is a union-find data structure for the cluster</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;  <span class="comment">// identites (only needed for unsorted cluster_result input).</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;  union_find <a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>(sorted ? 0 : N);</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;  <span class="keywordflow">if</span> (!sorted) {</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    std::stable_sort(Z2[0], Z2[N-1]);</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;  }</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  t_index node1, node2;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;  auto_array_ptr&lt;t_index&gt; node_size(N-1);</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;  <span class="keywordflow">for</span> (t_index i=0; i&lt;N-1; ++i) {</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    <span class="comment">// Get two data points whose clusters are merged in step i.</span></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    <span class="comment">// Find the cluster identifiers for these points.</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordflow">if</span> (sorted) {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;      node1 = Z2[i]-&gt;node1;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;      node2 = Z2[i]-&gt;node2;</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;      node1 = <a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>.Find(Z2[i]-&gt;node1);</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;      node2 = <a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>.Find(Z2[i]-&gt;node2);</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;      <span class="comment">// Merge the nodes in the union-find data structure by making them</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;      <span class="comment">// children of a new node.</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;      <a class="code" href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">nodes</a>.Union(node1, node2);</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    }</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="comment">// Sort the nodes in the output array.</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    <span class="keywordflow">if</span> (node1&gt;node2) {</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;      t_index tmp = node1;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;      node1 = node2;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;      node2 = tmp;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    }</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="comment">/* Conversion between labeling conventions.</span></div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;<span class="comment">       Input:  singleton nodes 0,...,N-1</span></div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;<span class="comment">               compound nodes  N,...,2N-2</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="comment">       Output: singleton nodes -1,...,-N</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;<span class="comment">               compound nodes  1,...,N</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="comment">    */</span></div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    merge[i]     = (node1&lt;N) ? -static_cast&lt;int&gt;(node1)-1</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;                              : <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node1)-N+1;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    merge[i+N-1] = (node2&lt;N) ? -static_cast&lt;int&gt;(node2)-1</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;                              : <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node2)-N+1;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    height[i] = Z2[i]-&gt;dist;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    node_size[i] = size_(node1) + size_(node2);</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;  order_nodes(N, merge, node_size, order);</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div><div class="ttc" id="cJSON_8cpp_html_ad00efb41ca386db28bacc7aefe79535c"><div class="ttname"><a href="cJSON_8cpp.html#ad00efb41ca386db28bacc7aefe79535c">child</a></div><div class="ttdeci">cJSON * child</div><div class="ttdef"><b>Definition:</b> <a href="cJSON_8cpp_source.html#l02723">cJSON.cpp:2723</a></div></div>
+<div class="ttc" id="namespaceSVF_html_ae6c7046834fe00382052ece7d06eb0ac"><div class="ttname"><a href="namespaceSVF.html#ae6c7046834fe00382052ece7d06eb0ac">SVF::nodes</a></div><div class="ttdeci">iter_range&lt; typename GenericGraphTraits&lt; GraphType &gt;::nodes_iterator &gt; nodes(const GraphType &amp;G)</div><div class="ttdef"><b>Definition:</b> <a href="GraphTraits_8h_source.html#l00111">GraphTraits.h:111</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 <!-- start footer part -->
 <hr class="footer"/><address class="footer"><small>

package/SVF-doxygen/html/html/functions_a.html CHANGED Viewed

@@ -322,7 +322,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1MRGenerator.html#af50efed3af17806a3ba3f668e4466d3e">SVF::MRGenerator</a>
 </li>
 <li>addCustomGraphFeatures()
-: <a class="el" href="structllvm_1_1DefaultDOTGraphTraits.html#ae2bdfe5fa774a3dc5aad9a8465b50011">llvm::DefaultDOTGraphTraits</a>
+: <a class="el" href="structSVF_1_1DefaultDOTGraphTraits.html#a47ee60dc78e3f869ce4e808e73437ddf">SVF::DefaultDOTGraphTraits</a>
 </li>
 <li>addCxtLock()
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a6b8d03d75751635e492dbda47e2d543e">SVF::LockAnalysis</a>

package/SVF-doxygen/html/html/functions_b.html CHANGED Viewed

@@ -163,7 +163,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1VersionedPTData.html#a9833b47df24ed821a55d5ce9a3917f1f">SVF::VersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>
 </li>
 <li>BaseT
-: <a class="el" href="classllvm_1_1iterator__adaptor__base.html#ac1f22569ffff340b8f178b93513bc0eb">llvm::iterator_adaptor_base&lt; DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
+: <a class="el" href="classSVF_1_1iter__adaptor__base.html#afbad8b4d7822152aec9a206c0e293f96">SVF::iter_adaptor_base&lt; DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
 </li>
 <li>BaseVersionedPTData
 : <a class="el" href="classSVF_1_1MutableVersionedPTData.html#aa80044e3b4c3ed58117573dfa54d803b">SVF::MutableVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>
@@ -221,12 +221,12 @@ $(function() {
 </li>
 <li>begin()
 : <a class="el" href="classllvm_1_1generic__bridge__gep__type__iterator.html#aabd833b8eca182f681462209c9f24f1a">llvm::generic_bridge_gep_type_iterator&lt; ItTy &gt;</a>
-, <a class="el" href="classllvm_1_1iterator__range.html#af5a020bd9dd7bc8487dd53ce443fdd8f">llvm::iterator_range&lt; IteratorT &gt;</a>
 , <a class="el" href="classSVF_1_1CondPointsToSet.html#a3521ec3be48cc03d9d3f562cb088a9ad">SVF::CondPointsToSet&lt; Cond &gt;</a>
 , <a class="el" href="classSVF_1_1CondStdSet.html#adf095111734d81b6ad1908a7f795b038">SVF::CondStdSet&lt; Element &gt;</a>
 , <a class="el" href="classSVF_1_1ContextCond.html#a4ae7e2236708b0d205f393cdce75c8d1">SVF::ContextCond</a>
 , <a class="el" href="classSVF_1_1CoreBitVector.html#a835bf11a1f698942db8e6bdadbbfd1f3">SVF::CoreBitVector</a>
 , <a class="el" href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">SVF::GenericGraph&lt; NodeTy, EdgeTy &gt;</a>
+, <a class="el" href="classSVF_1_1iter__range.html#a35c298cfeda798cbf4f65150796f8489">SVF::iter_range&lt; IteratorT &gt;</a>
 , <a class="el" href="classSVF_1_1PointsTo.html#aa53962e561399bf493d1f2b9137356f6">SVF::PointsTo</a>
 , <a class="el" href="classSVF_1_1SparseBitVector.html#abf76d8157c49ddba24bdc9dab3655772">SVF::SparseBitVector&lt; ElementSize &gt;</a>
 , <a class="el" href="classSVF_1_1SVFBasicBlock.html#ac9cb2f17e42c40ca81b49c8b63a855fc">SVF::SVFBasicBlock</a>
@@ -234,7 +234,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1SVFModule.html#a5486697889c6cca4f9f426650defc255">SVF::SVFModule</a>
 </li>
 <li>begin_iterator
-: <a class="el" href="classllvm_1_1iterator__range.html#aeac0e00835772be18abf2daed29f5d1f">llvm::iterator_range&lt; IteratorT &gt;</a>
+: <a class="el" href="classSVF_1_1iter__range.html#a56f458edec1d1181e1cfe0f9a23c8003">SVF::iter_range&lt; IteratorT &gt;</a>
 </li>
 <li>BestCandidate
 : <a class="el" href="classSVF_1_1NodeIDAllocator_1_1Clusterer.html#a3556bdda6725b72d0ca88364daeae32e">SVF::NodeIDAllocator::Clusterer</a>
@@ -431,7 +431,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1LLVMLoopAnalysis.html#a82b29fc1e138e082d7da6e016a5b7eb8">SVF::LLVMLoopAnalysis</a>
 </li>
 <li>buildSVFModule()
-: <a class="el" href="classSVF_1_1LLVMModuleSet.html#ae919327019b5014f64b754dbdeb07f75">SVF::LLVMModuleSet</a>
+: <a class="el" href="classSVF_1_1LLVMModuleSet.html#a1f8e769251c89433311eeb6f98d115e9">SVF::LLVMModuleSet</a>
 </li>
 <li>buildThreadCallGraph()
 : <a class="el" href="classSVF_1_1ThreadCallGraphBuilder.html#a0f5bf24257858919c10af0e076d87ef7">SVF::ThreadCallGraphBuilder</a>

package/SVF-doxygen/html/html/functions_c.html CHANGED Viewed

@@ -543,16 +543,16 @@ $(function() {
 : <a class="el" href="structcJSON.html#a401b274c2da358dac5c23ab8b2c71f85">cJSON</a>
 </li>
 <li>child_begin()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a40de5c2e7ac24421cc93b2235d00089c">llvm::GraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#aecba6127f1e1802104590d63ac710421">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a94ebf9aa4f1b1c6e74237baf70535261">SVF::GenericGraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#ae637bc31f349b6f73f0af2af6804de16">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>child_end()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#ab82e90ae6e1f1b39e5c33f9c9a6cfcf9">llvm::GraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#af7353e7790e6d4828d76fc16bea16212">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#ad46aad713072be28258bd2d0350300cc">SVF::GenericGraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a478b8ebeec4d12d2e831ba9b5679011e">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>child_iterator
-: <a class="el" href="classllvm_1_1GraphWriter.html#a72ce38d44134ece4a898bc84c0c3a278">llvm::GraphWriter&lt; GraphType &gt;</a>
-, <a class="el" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">SVF::GraphReachSolver&lt; GraphType, DPIm &gt;</a>
+: <a class="el" href="classSVF_1_1GraphReachSolver.html#ad3fb81ac5017c6c3dc4b2b3b65b3ca04">SVF::GraphReachSolver&lt; GraphType, DPIm &gt;</a>
+, <a class="el" href="classSVF_1_1GraphWriter.html#ad41e952ca114bba64b87478f469b6d56">SVF::GraphWriter&lt; GraphType &gt;</a>
 , <a class="el" href="classSVF_1_1SCCDetection.html#ac1274a90ddbea6f1f0b539710505d902">SVF::SCCDetection&lt; GraphType &gt;</a>
 , <a class="el" href="classSVF_1_1SrcSnkSolver.html#a78684539084301715a665f0aece23c8e">SVF::SrcSnkSolver&lt; GraphType, DPIm &gt;</a>
 , <a class="el" href="classSVF_1_1WPAMinimumSolver.html#ab16212294f1dab31215fe113b02f09c6">SVF::WPAMinimumSolver&lt; GraphType &gt;</a>
@@ -560,11 +560,11 @@ $(function() {
 , <a class="el" href="classSVF_1_1WPASolver.html#a4d5b605b8932824a7088399305952f12">SVF::WPASolver&lt; GraphType &gt;</a>
 </li>
 <li>ChildIteratorType
-: <a class="el" href="structllvm_1_1DOTGraphTraits_3_01IRGraph_01_5_01_4.html#a03a1edb4d4b703eff1bdad004179c1ec">llvm::DOTGraphTraits&lt; IRGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01PTACallGraph_01_5_01_4.html#a38abf60604b5f9b4bc992cb1d65a447b">llvm::DOTGraphTraits&lt; PTACallGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01TCT_01_5_01_4.html#a73a500d1bdff303590f9dc8786e1f8c0">llvm::DOTGraphTraits&lt; TCT * &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a62d135bf75ae93de38cf6f7f326967e6">llvm::GraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#adcfe8b2d350b25cfe9bf9fc6fa55fa03">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1DOTGraphTraits_3_01IRGraph_01_5_01_4.html#a72a273d644d002b59a546b047d4bb0dd">SVF::DOTGraphTraits&lt; IRGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01PTACallGraph_01_5_01_4.html#a95fc3b739ccea8d236e5b795b8770787">SVF::DOTGraphTraits&lt; PTACallGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01TCT_01_5_01_4.html#a4036db1b2c075bd1f2b7249b8e268937">SVF::DOTGraphTraits&lt; TCT * &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a9be4c858403f9161e48f6aa551932b04">SVF::GenericGraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#ab4886d654f7f3678490d09c15b42f79e">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>CHISet
 : <a class="el" href="classSVF_1_1MemSSA.html#af9cf084e3070456d8cca491e1391b0c4">SVF::MemSSA</a>
@@ -1747,21 +1747,23 @@ $(function() {
 <li>CxtStmtSet
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a42ed881d4cd79eae099266a9e171aeb2">SVF::LockAnalysis</a>
 </li>
-<li>CxtStmtToAliveFlagMap
-: <a class="el" href="classSVF_1_1ForkJoinAnalysis.html#acdc652faba35e45820cce0cdd20ea99c">SVF::ForkJoinAnalysis</a>
-</li>
 <li>cxtStmtToAliveFlagMap
 : <a class="el" href="classSVF_1_1ForkJoinAnalysis.html#aa31b3f3d51b963ccd475e66b77143dba">SVF::ForkJoinAnalysis</a>
 </li>
+<li>CxtStmtToAliveFlagMap
+: <a class="el" href="classSVF_1_1ForkJoinAnalysis.html#acdc652faba35e45820cce0cdd20ea99c">SVF::ForkJoinAnalysis</a>
+</li>
 <li>CxtStmtToCxtLockS
 : <a class="el" href="classSVF_1_1LockResultValidator.html#a284e4c4d5d84da5ebe0938cad8490dfc">SVF::LockResultValidator</a>
 </li>
+<li>cxtStmtToCxtLockSet
+: <a class="el" href="classSVF_1_1LockAnalysis.html#ae256a84fd63947a6f81bee030bdbe7fc">SVF::LockAnalysis</a>
+</li>
 <li>CxtStmtToCxtLockSet
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a710aad28484677637367e9098a55c7d7">SVF::LockAnalysis</a>
 </li>
 <li>cxtStmtToCxtLockSet
-: <a class="el" href="classSVF_1_1LockAnalysis.html#ae256a84fd63947a6f81bee030bdbe7fc">SVF::LockAnalysis</a>
-, <a class="el" href="classSVF_1_1LockResultValidator.html#ad8a03181445edeb835fed08c88f6e0bb">SVF::LockResultValidator</a>
+: <a class="el" href="classSVF_1_1LockResultValidator.html#ad8a03181445edeb835fed08c88f6e0bb">SVF::LockResultValidator</a>
 </li>
 <li>CxtStmtToLockFlagMap
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a451d9b41fd048e11615ea47872f614c9">SVF::LockAnalysis</a>
@@ -1777,7 +1779,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1LockAnalysis.html#ae2218961699a4b4385f47fb039005dbe">SVF::LockAnalysis</a>
 </li>
 <li>CxtThread()
-: <a class="el" href="classSVF_1_1CxtThread.html#ac6af46ba08bbad4454358298fd2557d3">SVF::CxtThread</a>
+: <a class="el" href="classSVF_1_1CxtThread.html#ad05fb5464900d6d444c1fd3a6e0d9280">SVF::CxtThread</a>
 </li>
 <li>CxtThreadProc()
 : <a class="el" href="classSVF_1_1CxtThreadProc.html#a1c7dd7740266a07d354df537a9167bcc">SVF::CxtThreadProc</a>
@@ -1789,7 +1791,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1TCT.html#a23df579f18d4ea4b0f47272091ddc43e">SVF::TCT</a>
 </li>
 <li>CxtThreadStmt()
-: <a class="el" href="classSVF_1_1CxtThreadStmt.html#a5a4392f444e5fe64a1387c134935893d">SVF::CxtThreadStmt</a>
+: <a class="el" href="classSVF_1_1CxtThreadStmt.html#ab5487e3f330bb18685281c5effcecfbb">SVF::CxtThreadStmt</a>
 </li>
 <li>CxtThreadStmtSet
 : <a class="el" href="classSVF_1_1MHP.html#a28031502c4f8f0d4012c0827c57efb32">SVF::MHP</a>

package/SVF-doxygen/html/html/functions_d.html CHANGED Viewed

@@ -140,7 +140,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1PointerAnalysis.html#a0b182ac680cce0547dbe7714c870ca85adb3d4cbd8c38c1c498bc51198626a790">SVF::PointerAnalysis</a>
 </li>
 <li>DefaultDOTGraphTraits()
-: <a class="el" href="structllvm_1_1DefaultDOTGraphTraits.html#a8a0585a182245d87b224f4a26a41cf16">llvm::DefaultDOTGraphTraits</a>
+: <a class="el" href="structSVF_1_1DefaultDOTGraphTraits.html#a2fdfa8abc93bd4d0211c4db8ef4ede3e">SVF::DefaultDOTGraphTraits</a>
 </li>
 <li>defNodes
 : <a class="el" href="classSVF_1_1SVFGOPT.html#abd524dca72261bbcc7ebb1103b693a2b">SVF::SVFGOPT</a>
@@ -171,7 +171,7 @@ $(function() {
 , <a class="el" href="structprintbuffer.html#aa7311b5da38ff8d1737824c611b48732">printbuffer</a>
 </li>
 <li>deref_val()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericGraph_3_01NodeTy_00_01EdgeTy_01_4_01_5_4.html#a60846a619cccd2546bf53c8e2dd81c87">llvm::GraphTraits&lt; SVF::GenericGraph&lt; NodeTy, EdgeTy &gt; *&gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericGraph_3_01NodeTy_00_01EdgeTy_01_4_01_5_4.html#a15f4cee67b783061f09705dc7d2a2f87">SVF::GenericGraphTraits&lt; SVF::GenericGraph&lt; NodeTy, EdgeTy &gt; *&gt;</a>
 </li>
 <li>destory()
 : <a class="el" href="classSVF_1_1ExtAPI.html#abe3e0e2500532acfc01cee7e2ce1cd90">SVF::ExtAPI</a>
@@ -250,9 +250,9 @@ $(function() {
 : <a class="el" href="classSVF_1_1PTData.html#a74ce29609c51f2be34a0b5b7650a9848a03a155517b9587d79c3f0b6dc3b72447">SVF::PTData&lt; Key, KeySet, Data, DataSet &gt;</a>
 </li>
 <li>difference_type
-: <a class="el" href="classllvm_1_1iterator__adaptor__base.html#afddc7f6db019bdab6daa810e83d78de3">llvm::iterator_adaptor_base&lt; DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
-, <a class="el" href="classllvm_1_1iterator__facade__base.html#a7e07dfa56b74ed115bdddd442e8184e6">llvm::iterator_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
-, <a class="el" href="classSVF_1_1CoreBitVector_1_1CoreBitVectorIterator.html#aeabc3acd9ce15b8beff0db8a49d8781f">SVF::CoreBitVector::CoreBitVectorIterator</a>
+: <a class="el" href="classSVF_1_1CoreBitVector_1_1CoreBitVectorIterator.html#aeabc3acd9ce15b8beff0db8a49d8781f">SVF::CoreBitVector::CoreBitVectorIterator</a>
+, <a class="el" href="classSVF_1_1iter__adaptor__base.html#a0dc562917692ec5e4880509444b66e9a">SVF::iter_adaptor_base&lt; DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
+, <a class="el" href="classSVF_1_1iter__facade__base.html#a4850340b864a13fb78e52dfb46d0e8a3">SVF::iter_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
 , <a class="el" href="classSVF_1_1PointsTo_1_1PointsToIterator.html#a79da80a016d68d70b63bcaa884cf53cb">SVF::PointsTo::PointsToIterator</a>
 </li>
 <li>DiffPTData()
@@ -275,10 +275,10 @@ $(function() {
 : <a class="el" href="classSVF_1_1ForkJoinAnalysis.html#ab5678bd46e573070827cc413f0e0d5be">SVF::ForkJoinAnalysis</a>
 </li>
 <li>direct_child_begin()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a0c74bc70e04aa3186fbc369717b22a12">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a46c6957a8771d6e52dc71d5f7b3c4e81">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>direct_child_end()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a58094251972081b08b4c6db42a3a374f">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a543da98c9818fbfd235152beab355e9c">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>directCalls
 : <a class="el" href="classSVF_1_1PTACallGraphEdge.html#a2f3e4b61225c4ca37b0f70e3edc61920">SVF::PTACallGraphEdge</a>
@@ -380,19 +380,19 @@ $(function() {
 , <a class="el" href="classSVF_1_1SVFLoopAndDomInfo.html#a342f2825d6b7e3289d0f0f4b7ee8247c">SVF::SVFLoopAndDomInfo</a>
 </li>
 <li>DOTGraphTraits()
-: <a class="el" href="structllvm_1_1DOTGraphTraits.html#a44b9192cea3ca9e59ab71c502c21a352">llvm::DOTGraphTraits&lt; Ty &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01CFLGraph_01_5_01_4.html#a0a47c58da5bab4b282856a0c7616388e">llvm::DOTGraphTraits&lt; CFLGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01CHGraph_01_5_01_4.html#a9ed844169fc8d8f3e42d25dfcc6f451f">llvm::DOTGraphTraits&lt; CHGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01ConstraintGraph_01_5_01_4.html#a007736227bec42182208176006b7d83d">llvm::DOTGraphTraits&lt; ConstraintGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01ICFG_01_5_01_4.html#a72d303201f61fdec14f08bddabf649e5">llvm::DOTGraphTraits&lt; ICFG * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01IRGraph_01_5_01_4.html#ad540c20d134f28f3b99a32d0e69b2a3f">llvm::DOTGraphTraits&lt; IRGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01PTACallGraph_01_5_01_4.html#a34fdb3c78cdda82f0bb81f143891cea8">llvm::DOTGraphTraits&lt; PTACallGraph * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01SVFG_01_5_01_4.html#a1e5cce964fc852f8bdada1edc174bd5a">llvm::DOTGraphTraits&lt; SVFG * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01TCT_01_5_01_4.html#a1c96cefb862ef290819e689104b18280">llvm::DOTGraphTraits&lt; TCT * &gt;</a>
-, <a class="el" href="structllvm_1_1DOTGraphTraits_3_01VFG_01_5_01_4.html#a0ae94170a4f95bfc7e89d0149ff67882">llvm::DOTGraphTraits&lt; VFG * &gt;</a>
+: <a class="el" href="structSVF_1_1DOTGraphTraits.html#a359df069e6c41d32e8b7ed5a23817e99">SVF::DOTGraphTraits&lt; Ty &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01CFLGraph_01_5_01_4.html#a85e149bc2cb9c6de4ad5b106138f5cd9">SVF::DOTGraphTraits&lt; CFLGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01CHGraph_01_5_01_4.html#a1766ccfed581eae6505f66d38ba6a047">SVF::DOTGraphTraits&lt; CHGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01ConstraintGraph_01_5_01_4.html#ad816997d240e758f7a2f1f6508048ef3">SVF::DOTGraphTraits&lt; ConstraintGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01ICFG_01_5_01_4.html#af0d447adf06f88bad4b25ba8fd14efd5">SVF::DOTGraphTraits&lt; ICFG * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01IRGraph_01_5_01_4.html#a176af80970e864d657ee3dd8dbd67a35">SVF::DOTGraphTraits&lt; IRGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01PTACallGraph_01_5_01_4.html#a6ee6203a72086167e4277a43f0a3f6fd">SVF::DOTGraphTraits&lt; PTACallGraph * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01SVFG_01_5_01_4.html#ad3c3175e8f9729650cf55c72de96ff8e">SVF::DOTGraphTraits&lt; SVFG * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01TCT_01_5_01_4.html#adafb93ca8d752a5405c5ec39bcb76e18">SVF::DOTGraphTraits&lt; TCT * &gt;</a>
+, <a class="el" href="structSVF_1_1DOTGraphTraits_3_01VFG_01_5_01_4.html#a682f25ccfcb9ff37d6323ce8bce7ca64">SVF::DOTGraphTraits&lt; VFG * &gt;</a>
 </li>
 <li>DOTTraits
-: <a class="el" href="classllvm_1_1GraphWriter.html#aeec6e5ec72e25776f32f269ef33b2a42">llvm::GraphWriter&lt; GraphType &gt;</a>
+: <a class="el" href="classSVF_1_1GraphWriter.html#a245d85f8c907a409533ab151e9e3d9a2">SVF::GraphWriter&lt; GraphType &gt;</a>
 </li>
 <li>DoubleFreeChecker()
 : <a class="el" href="classSVF_1_1DoubleFreeChecker.html#ac9d147b16442bb4746f66cffe46a070a">SVF::DoubleFreeChecker</a>
@@ -440,7 +440,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1SVFLoopAndDomInfo.html#a34296b98ee8dd1bfc0b1ae7fe327cde3">SVF::SVFLoopAndDomInfo</a>
 </li>
 <li>DTraits
-: <a class="el" href="classllvm_1_1GraphWriter.html#aed76f440aab643d1af5dbfda1a3f9c78">llvm::GraphWriter&lt; GraphType &gt;</a>
+: <a class="el" href="classSVF_1_1GraphWriter.html#a36f1ca2744fae2f45400e82f39e4fcd8">SVF::GraphWriter&lt; GraphType &gt;</a>
 </li>
 <li>DummyObjNode
 : <a class="el" href="classSVF_1_1SVFVar.html#a283f7c0c2eaae07c6865f73a0daafeffa1ab625ecaf51446246dcc2944d6559af">SVF::SVFVar</a>
@@ -527,7 +527,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1DDAVFSolver.html#aa4dc73ea65f736282a413a9d286141e5">SVF::DDAVFSolver&lt; CVar, CPtSet, DPIm &gt;</a>
 </li>
 <li>dumpCxt()
-: <a class="el" href="classSVF_1_1MTAResultValidator.html#ae7d61becd14123f60976fd7261d0c84d">SVF::MTAResultValidator</a>
+: <a class="el" href="classSVF_1_1MTAResultValidator.html#a073f442fd9441d95731b7b7b92675ec7">SVF::MTAResultValidator</a>
 , <a class="el" href="classSVF_1_1TCT.html#aa86c4422e17cf00408444f18687d555b">SVF::TCT</a>
 </li>
 <li>DumpFree

package/SVF-doxygen/html/html/functions_e.html CHANGED Viewed

@@ -83,8 +83,8 @@ $(function() {
 : <a class="el" href="classSVF_1_1MTASVFGBuilder.html#a1c0de33bba2f05f14140d872c345ab38">SVF::MTASVFGBuilder</a>
 </li>
 <li>edge_dest()
-: <a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a1b463e94c43d2966b8d6cf096b3d04cd">llvm::GraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#a84cc3da79c2c9c5bcdf50da4b919b7da">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#ad2165b803309699067af3b876a741c8c">SVF::GenericGraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#ad2b32bee6c168b7d2ed993ae1231efaa">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 </li>
 <li>edgeFlag
 : <a class="el" href="classSVF_1_1GenericEdge.html#aa1f446e93750580dce04a127231dd1a3">SVF::GenericEdge&lt; NodeTy &gt;</a>
@@ -116,18 +116,16 @@ $(function() {
 : <a class="el" href="classSVF_1_1GenericGraph.html#a2fbc96de5f066469c2739229307bcc0c">SVF::GenericGraph&lt; NodeTy, EdgeTy &gt;</a>
 </li>
 <li>edgeTargetsEdgeSource()
-: <a class="el" href="structllvm_1_1DefaultDOTGraphTraits.html#a89ab1cad8814ece47ef2b4cff3045532">llvm::DefaultDOTGraphTraits</a>
-</li>
-<li>EdgeType
-: <a class="el" href="structllvm_1_1GraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#a279f6f463a31f98fe8e1d5f4c78f9e6d">llvm::GraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericGraph_3_01NodeTy_00_01EdgeTy_01_4_01_5_4.html#a57c4c711251842dd9d969428ba5966f2">llvm::GraphTraits&lt; SVF::GenericGraph&lt; NodeTy, EdgeTy &gt; *&gt;</a>
-, <a class="el" href="structllvm_1_1GraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#afc3616d9a36f7b26473f9211484e3e6c">llvm::GraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
+: <a class="el" href="structSVF_1_1DefaultDOTGraphTraits.html#a78c40f9b1af839116b88519fca154396">SVF::DefaultDOTGraphTraits</a>
 </li>
 <li>edgeType
 : <a class="el" href="classSVF_1_1CHEdge.html#a58ac14decda4041e773d723475f5c1c8">SVF::CHEdge</a>
 </li>
 <li>EdgeType
 : <a class="el" href="classSVF_1_1GenericGraph.html#a12d493d6ad2b6c89f240c9ccfa3bdf30">SVF::GenericGraph&lt; NodeTy, EdgeTy &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01Inverse_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_4_01_4.html#aced5ac52d86c89f0befb9f94d32c837a">SVF::GenericGraphTraits&lt; Inverse&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; *&gt; &gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericGraph_3_01NodeTy_00_01EdgeTy_01_4_01_5_4.html#a0fadf3d9a1e5043ff6fdb0f12ec796e9">SVF::GenericGraphTraits&lt; SVF::GenericGraph&lt; NodeTy, EdgeTy &gt; *&gt;</a>
+, <a class="el" href="structSVF_1_1GenericGraphTraits_3_01SVF_1_1GenericNode_3_01NodeTy_00_01EdgeTy_01_4_01_5_01_4.html#aeba2a9cf0cf40f5fdfe5c1d73cec675d">SVF::GenericGraphTraits&lt; SVF::GenericNode&lt; NodeTy, EdgeTy &gt; * &gt;</a>
 , <a class="el" href="classSVF_1_1GenericNode.html#a458c626543431b4314f5f4f532eb51de">SVF::GenericNode&lt; NodeTy, EdgeTy &gt;</a>
 </li>
 <li>EFT_A0R_NEW
@@ -254,17 +252,16 @@ $(function() {
 : <a class="el" href="classSVF_1_1ObjTypeInfo.html#a5fdcd5f3b7550e7bdc30c8c030c6226d">SVF::ObjTypeInfo</a>
 </li>
 <li>emitEdge()
-: <a class="el" href="classllvm_1_1GraphWriter.html#ad621d196f82bd8898a0840c045920ea3">llvm::GraphWriter&lt; GraphType &gt;</a>
+: <a class="el" href="classSVF_1_1GraphWriter.html#a320577b81479578a8e6021380f9c07a7">SVF::GraphWriter&lt; GraphType &gt;</a>
 </li>
 <li>emitSimpleNode()
-: <a class="el" href="classllvm_1_1GraphWriter.html#a5f409f860e49edb941120a2908613c43">llvm::GraphWriter&lt; GraphType &gt;</a>
+: <a class="el" href="classSVF_1_1GraphWriter.html#a0feff91ed80b997dd4550fae16382768">SVF::GraphWriter&lt; GraphType &gt;</a>
 </li>
 <li>emplacePts()
 : <a class="el" href="classSVF_1_1PersistentPointsToCache.html#a98d176e384469e0308bfee2061ef84b5">SVF::PersistentPointsToCache&lt; Data &gt;</a>
 </li>
 <li>empty()
-: <a class="el" href="classllvm_1_1iterator__range.html#a06fff5bdd2bdf6d2c200e281787dc284">llvm::iterator_range&lt; IteratorT &gt;</a>
-, <a class="el" href="classSVF_1_1CFLFIFOWorkList.html#aa0ce832f5eeae74d52260fd8954d545f">SVF::CFLFIFOWorkList&lt; Data &gt;</a>
+: <a class="el" href="classSVF_1_1CFLFIFOWorkList.html#aa0ce832f5eeae74d52260fd8954d545f">SVF::CFLFIFOWorkList&lt; Data &gt;</a>
 , <a class="el" href="classSVF_1_1CondPointsToSet.html#aca84f0f9e09686d9f30f309d36267aff">SVF::CondPointsToSet&lt; Cond &gt;</a>
 , <a class="el" href="classSVF_1_1CondStdSet.html#a0305cbf452b4e858e464023727417d76">SVF::CondStdSet&lt; Element &gt;</a>
 , <a class="el" href="classSVF_1_1CoreBitVector.html#a98b9795b4fdc74d9d2efa9a3f2ecb62f">SVF::CoreBitVector</a>
@@ -275,7 +272,8 @@ $(function() {
 : <a class="el" href="classSVF_1_1ForkJoinAnalysis.html#a8d40e687caf8999369621ed385dfc631a9d940442c782d5a1297102209540182f">SVF::ForkJoinAnalysis</a>
 </li>
 <li>empty()
-: <a class="el" href="classSVF_1_1List.html#a063246d2aa23e389e513c5498ff33aca">SVF::List&lt; Data &gt;</a>
+: <a class="el" href="classSVF_1_1iter__range.html#ad8b380db56076165a0324922daa2e850">SVF::iter_range&lt; IteratorT &gt;</a>
+, <a class="el" href="classSVF_1_1List.html#a063246d2aa23e389e513c5498ff33aca">SVF::List&lt; Data &gt;</a>
 , <a class="el" href="classSVF_1_1LLVMModuleSet.html#ae19e38054c55d5822dfc83a12f12aa60">SVF::LLVMModuleSet</a>
 </li>
 <li>Empty
@@ -297,20 +295,20 @@ $(function() {
 </li>
 <li>end()
 : <a class="el" href="classllvm_1_1generic__bridge__gep__type__iterator.html#a4f13b7cccd69bdac2a4f5feff5625f01">llvm::generic_bridge_gep_type_iterator&lt; ItTy &gt;</a>
-, <a class="el" href="classllvm_1_1iterator__range.html#aa0344673da91896d39f1b35755ee5d4e">llvm::iterator_range&lt; IteratorT &gt;</a>
 , <a class="el" href="classSVF_1_1CondPointsToSet.html#a5ead697952ada3fbb07da3459a2b1b86">SVF::CondPointsToSet&lt; Cond &gt;</a>
 , <a class="el" href="classSVF_1_1CondStdSet.html#a93c232ef7e5dea652622da7f994e1dc3">SVF::CondStdSet&lt; Element &gt;</a>
 , <a class="el" href="classSVF_1_1ContextCond.html#a4b56b54896a1241032d7614309829399">SVF::ContextCond</a>
 , <a class="el" href="classSVF_1_1CoreBitVector.html#a93cdd9890522cc9fee2451567e0b1f0d">SVF::CoreBitVector</a>
 , <a class="el" href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">SVF::GenericGraph&lt; NodeTy, EdgeTy &gt;</a>
+, <a class="el" href="classSVF_1_1iter__range.html#a86124761467c76a7f7b0926b47d4f031">SVF::iter_range&lt; IteratorT &gt;</a>
 , <a class="el" href="classSVF_1_1PointsTo.html#a8f741cdffbf3c5fe0f602cdca677dee6">SVF::PointsTo</a>
 , <a class="el" href="classSVF_1_1SparseBitVector.html#a1b5abe09fd0fcd337385653cb47343c1">SVF::SparseBitVector&lt; ElementSize &gt;</a>
 , <a class="el" href="classSVF_1_1SVFBasicBlock.html#ab65173c2668b80643cb96e8133e5ea0a">SVF::SVFBasicBlock</a>
 , <a class="el" href="classSVF_1_1SVFFunction.html#a2f274c3af098ae6a5919246b1b88e7b7">SVF::SVFFunction</a>
-, <a class="el" href="classSVF_1_1SVFModule.html#ad3f057892f970c22ef3bf345841eb4cc">SVF::SVFModule</a>
+, <a class="el" href="classSVF_1_1SVFModule.html#a58d03edb6ff85f4943135478f113df31">SVF::SVFModule</a>
 </li>
 <li>end_iterator
-: <a class="el" href="classllvm_1_1iterator__range.html#a823f166661c0251fc90181a2d9fc13fa">llvm::iterator_range&lt; IteratorT &gt;</a>
+: <a class="el" href="classSVF_1_1iter__range.html#aced2e91eaf4970e387ad249f6e936373">SVF::iter_range&lt; IteratorT &gt;</a>
 </li>
 <li>endClk()
 : <a class="el" href="classSVF_1_1SVFStat.html#a1b7f1e3381de87f75f06cddb9c6c1ec1">SVF::SVFStat</a>

package/SVF-doxygen/html/html/functions_eval_i.html CHANGED Viewed

@@ -93,10 +93,10 @@ $(function() {
 : <a class="el" href="classSVF_1_1VFGEdge.html#a156ae6a8b3a033f505c18c6b162e7cf5aa80551154bcfbfa84f02df32ead6b1b0">SVF::VFGEdge</a>
 </li>
 <li>IsBidirectional
-: <a class="el" href="classllvm_1_1iterator__facade__base.html#ac111dbf74717bf5e6db6b9f8d5a81809a4e1f229fa73b6b5c2f25734ab347c51f">llvm::iterator_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
+: <a class="el" href="classSVF_1_1iter__facade__base.html#a1935969a70a0312f809db166d65fec89a0552120a5aa8ae40a219b52934ad3409">SVF::iter_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
 </li>
 <li>IsRandomAccess
-: <a class="el" href="classllvm_1_1iterator__facade__base.html#ac111dbf74717bf5e6db6b9f8d5a81809a4f2910ff91c3e559958a66f09bfefe56">llvm::iterator_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
+: <a class="el" href="classSVF_1_1iter__facade__base.html#a1935969a70a0312f809db166d65fec89a3571f11b56b4970ffff3c021f6fb47e8">SVF::iter_facade_base&lt; DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT &gt;</a>
 </li>
 </ul>
 </div><!-- contents -->

package/SVF-doxygen/html/html/functions_f.html CHANGED Viewed

@@ -62,7 +62,7 @@ $(function() {
 <h3><a id="index_f"></a>- f -</h3><ul>
 <li>F
-: <a class="el" href="classllvm_1_1mapped__iter.html#a9bd10b1c45d544ecba54657f762f8258">llvm::mapped_iter&lt; ItTy, FuncTy, FuncReturnTy &gt;</a>
+: <a class="el" href="classSVF_1_1mapped__iter.html#a98e22cf9681fc948e9656bb1faeb36e1">SVF::mapped_iter&lt; ItTy, FuncTy, FuncReturnTy &gt;</a>
 </li>
 <li>FastClusterTime
 : <a class="el" href="classSVF_1_1NodeIDAllocator_1_1Clusterer.html#ae78d2b60035350c634f6f58d7a043c22">SVF::NodeIDAllocator::Clusterer</a>

package/SVF-doxygen/html/html/functions_func.html CHANGED Viewed

@@ -298,7 +298,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1MRGenerator.html#af50efed3af17806a3ba3f668e4466d3e">SVF::MRGenerator</a>
 </li>
 <li>addCustomGraphFeatures()
-: <a class="el" href="structllvm_1_1DefaultDOTGraphTraits.html#ae2bdfe5fa774a3dc5aad9a8465b50011">llvm::DefaultDOTGraphTraits</a>
+: <a class="el" href="structSVF_1_1DefaultDOTGraphTraits.html#a47ee60dc78e3f869ce4e808e73437ddf">SVF::DefaultDOTGraphTraits</a>
 </li>
 <li>addCxtLock()
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a6b8d03d75751635e492dbda47e2d543e">SVF::LockAnalysis</a>