svf-tools 1.0.458 → 1.0.461

package/SVF-doxygen/html/html/classSVF_1_1WPAPass.html

@@ -117,9 +117,9 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a1f47c1cb5a64bab9a6b8ac38103416ac"><td class="memItemLeft" align="right" valign="top">virtual bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPAPass.html#a1f47c1cb5a64bab9a6b8ac38103416ac">runOnModule</a> (<a class="el" href="namespaceSVF.html#aa7a770b5dd5cd0e37d06a1088f252906">Module</a> &amp;module)</td></tr>
 <tr class="memdesc:a1f47c1cb5a64bab9a6b8ac38103416ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Run pointer analysis on LLVM module.  <a href="#a1f47c1cb5a64bab9a6b8ac38103416ac">More...</a><br /></td></tr>
 <tr class="separator:a1f47c1cb5a64bab9a6b8ac38103416ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a12fda9849e3d9e4eb71e0bff8d0696f8"><td class="memItemLeft" align="right" valign="top">virtual <a class="el" href="namespaceSVF.html#a88fd7387fcf16caf70abe265cdcf90b9">StringRef</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPAPass.html#a12fda9849e3d9e4eb71e0bff8d0696f8">getPassName</a> () const</td></tr>
-<tr class="memdesc:a12fda9849e3d9e4eb71e0bff8d0696f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">PTA name.  <a href="#a12fda9849e3d9e4eb71e0bff8d0696f8">More...</a><br /></td></tr>
-<tr class="separator:a12fda9849e3d9e4eb71e0bff8d0696f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a8f6bbf39ea2848ff3b6d105aeb5a31b1"><td class="memItemLeft" align="right" valign="top">virtual std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classSVF_1_1WPAPass.html#a8f6bbf39ea2848ff3b6d105aeb5a31b1">getPassName</a> () const</td></tr>
+<tr class="memdesc:a8f6bbf39ea2848ff3b6d105aeb5a31b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">PTA name.  <a href="#a8f6bbf39ea2848ff3b6d105aeb5a31b1">More...</a><br /></td></tr>
+<tr class="separator:a8f6bbf39ea2848ff3b6d105aeb5a31b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-attribs"></a>
 Static Public Attributes</h2></td></tr>
@@ -520,8 +520,8 @@ Private Attributes</h2></td></tr>
 </div><!-- fragment -->
 </div>
 </div>
-<a id="a12fda9849e3d9e4eb71e0bff8d0696f8"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a12fda9849e3d9e4eb71e0bff8d0696f8">&#9670;&nbsp;</a></span>getPassName()</h2>
+<a id="a8f6bbf39ea2848ff3b6d105aeb5a31b1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8f6bbf39ea2848ff3b6d105aeb5a31b1">&#9670;&nbsp;</a></span>getPassName()</h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -530,7 +530,7 @@ Private Attributes</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">virtual <a class="el" href="namespaceSVF.html#a88fd7387fcf16caf70abe265cdcf90b9">StringRef</a> SVF::WPAPass::getPassName </td>
+          <td class="memname">virtual std::string SVF::WPAPass::getPassName </td>
           <td>(</td>
           <td class="paramname"></td><td>)</td>
           <td> const</td>
@@ -577,14 +577,14 @@ Private Attributes</h2></td></tr>
 
 <p class="definition">Definition at line <a class="el" href="WPAPass_8cpp_source.html#l00159">159</a> of file <a class="el" href="WPAPass_8cpp_source.html">WPAPass.cpp</a>.</p>
 <div class="fragment"><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;{</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;    <a class="code" href="classSVF_1_1SVFIR.html">SVFIR</a>* pag = pta-&gt;<a class="code" href="classSVF_1_1PointerAnalysis.html#a240219c2dc4f5cc5f85445e18c79b83b">getPAG</a>();</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;    <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFIR::iterator</a> lit = pag-&gt;<a class="code" href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">begin</a>(), elit = pag-&gt;<a class="code" href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">end</a>(); lit != elit; ++lit)</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">  164</span>&#160;        <a class="code" href="classSVF_1_1SVFVar.html">PAGNode</a>* node1 = lit-&gt;second;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        <a class="code" href="classSVF_1_1SVFVar.html">PAGNode</a>* node2 = node1;</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;        <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFIR::iterator</a> rit = lit, erit = pag-&gt;<a class="code" href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">end</a>(); rit != erit; ++rit)</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">  168</span>&#160;            node2 = rit-&gt;second;</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            <span class="keywordflow">if</span>(node1==node2)</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a5faee14fa1dd41447bc73ac365fe33c1">Function</a>* fun1 = node1-&gt;<a class="code" href="classSVF_1_1SVFVar.html#a53439a493963d16e5a1b5ed36ab6d33e">getFunction</a>();</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;            <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a5faee14fa1dd41447bc73ac365fe33c1">Function</a>* fun2 = node2-&gt;<a class="code" href="classSVF_1_1SVFVar.html#a53439a493963d16e5a1b5ed36ab6d33e">getFunction</a>();</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;            <a class="code" href="namespaceSVF.html#a61c01e2e687ab3a001fb806737583943">AliasResult</a> <a class="code" href="cuddInt_8c.html#a8b2e13c78efca330f06b6ddcd7464b41">result</a> = pta-&gt;<a class="code" href="classSVF_1_1PointerAnalysis.html#a6c01f259ad2379a422d7106ce0255eb8">alias</a>(node1-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>(), node2-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>());</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;            <a class="code" href="namespaceSVF_1_1SVFUtil.html#aed0b0b9f035057552a6a82154fd88e61">SVFUtil::outs</a>() &lt;&lt; (result == <a class="code" href="namespaceSVF.html#a61c01e2e687ab3a001fb806737583943afdd83ddff93d38902f07775cd36df239">AliasResult::NoAlias</a> ? <span class="stringliteral">&quot;NoAlias&quot;</span> : <span class="stringliteral">&quot;MayAlias&quot;</span>)</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                            &lt;&lt; <span class="stringliteral">&quot; var&quot;</span> &lt;&lt; node1-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>() &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; node1-&gt;<a class="code" href="classSVF_1_1SVFVar.html#a54b2a5ed3ed21e54eaf04182f0338333">getValueName</a>()</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                            &lt;&lt; <span class="stringliteral">&quot;@&quot;</span> &lt;&lt; (fun1==<span class="keyword">nullptr</span>?<span class="stringliteral">&quot;&quot;</span>:fun1-&gt;getName().str()) &lt;&lt; <span class="stringliteral">&quot;] --&quot;</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                            &lt;&lt; <span class="stringliteral">&quot; var&quot;</span> &lt;&lt; node2-&gt;<a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>() &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; node2-&gt;<a class="code" href="classSVF_1_1SVFVar.html#a54b2a5ed3ed21e54eaf04182f0338333">getValueName</a>()</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                            &lt;&lt; <span class="stringliteral">&quot;@&quot;</span> &lt;&lt; (fun2==<span class="keyword">nullptr</span>?<span class="stringliteral">&quot;&quot;</span>:fun2-&gt;getName().str()) &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        }</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    }</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;}</div><div class="ttc" id="classSVF_1_1GenericGraph_html_a0d9744b1b0e7a09a6f7af29188e243b7"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">SVF::GenericGraph::begin</a></div><div class="ttdeci">iterator begin()</div><div class="ttdoc">Iterators. </div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00365">GenericGraph.h:365</a></div></div>
-<div class="ttc" id="classSVF_1_1SVFVar_html"><div class="ttname"><a href="classSVF_1_1SVFVar.html">SVF::SVFVar</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00046">SVFVariables.h:46</a></div></div>
+<div class="ttc" id="classSVF_1_1SVFVar_html"><div class="ttname"><a href="classSVF_1_1SVFVar.html">SVF::SVFVar</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00045">SVFVariables.h:45</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a61c01e2e687ab3a001fb806737583943"><div class="ttname"><a href="namespaceSVF.html#a61c01e2e687ab3a001fb806737583943">SVF::AliasResult</a></div><div class="ttdeci">AliasResult</div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00195">SVFBasicTypes.h:195</a></div></div>
 <div class="ttc" id="classSVF_1_1GenericGraph_html_a4bef15157423cef48dc7333a803cd27d"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">SVF::GenericGraph::end</a></div><div class="ttdeci">iterator end()</div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00369">GenericGraph.h:369</a></div></div>
 <div class="ttc" id="classSVF_1_1GenericGraph_html_ac213302cf5c7cdf3b66f7b18649d0fbc"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVF::GenericGraph&lt; SVFVar, SVFStmt &gt;::iterator</a></div><div class="ttdeci">IDToNodeMapTy::iterator iterator</div><div class="ttdoc">Node Iterators. </div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00342">GenericGraph.h:342</a></div></div>
 <div class="ttc" id="namespaceSVF_html_a5faee14fa1dd41447bc73ac365fe33c1"><div class="ttname"><a href="namespaceSVF.html#a5faee14fa1dd41447bc73ac365fe33c1">SVF::Function</a></div><div class="ttdeci">llvm::Function Function</div><div class="ttdef"><b>Definition:</b> <a href="Util_2BasicTypes_8h_source.html#l00066">BasicTypes.h:66</a></div></div>
 <div class="ttc" id="classSVF_1_1PointerAnalysis_html_a240219c2dc4f5cc5f85445e18c79b83b"><div class="ttname"><a href="classSVF_1_1PointerAnalysis.html#a240219c2dc4f5cc5f85445e18c79b83b">SVF::PointerAnalysis::getPAG</a></div><div class="ttdeci">SVFIR * getPAG() const</div><div class="ttdef"><b>Definition:</b> <a href="PointerAnalysis_8h_source.html#l00206">PointerAnalysis.h:206</a></div></div>
 <div class="ttc" id="namespaceSVF_1_1SVFUtil_html_aed0b0b9f035057552a6a82154fd88e61"><div class="ttname"><a href="namespaceSVF_1_1SVFUtil.html#aed0b0b9f035057552a6a82154fd88e61">SVF::SVFUtil::outs</a></div><div class="ttdeci">std::ostream &amp; outs()</div><div class="ttdoc">Overwrite llvm::outs() </div><div class="ttdef"><b>Definition:</b> <a href="SVFUtil_8h_source.html#l00049">SVFUtil.h:49</a></div></div>
-<div class="ttc" id="classSVF_1_1SVFVar_html_a53439a493963d16e5a1b5ed36ab6d33e"><div class="ttname"><a href="classSVF_1_1SVFVar.html#a53439a493963d16e5a1b5ed36ab6d33e">SVF::SVFVar::getFunction</a></div><div class="ttdeci">virtual const Function * getFunction() const</div><div class="ttdoc">Return the function that this SVFVar resides in. Return nullptr if it is a global or constantexpr nod...</div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00138">SVFVariables.h:138</a></div></div>
+<div class="ttc" id="classSVF_1_1SVFVar_html_a53439a493963d16e5a1b5ed36ab6d33e"><div class="ttname"><a href="classSVF_1_1SVFVar.html#a53439a493963d16e5a1b5ed36ab6d33e">SVF::SVFVar::getFunction</a></div><div class="ttdeci">virtual const Function * getFunction() const</div><div class="ttdoc">Return the function that this SVFVar resides in. Return nullptr if it is a global or constantexpr nod...</div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00131">SVFVariables.h:131</a></div></div>
 <div class="ttc" id="classSVF_1_1PointerAnalysis_html_a6c01f259ad2379a422d7106ce0255eb8"><div class="ttname"><a href="classSVF_1_1PointerAnalysis.html#a6c01f259ad2379a422d7106ce0255eb8">SVF::PointerAnalysis::alias</a></div><div class="ttdeci">virtual AliasResult alias(const Value *V1, const Value *V2)=0</div><div class="ttdoc">Interface exposed to users of our pointer analysis, given Value infos. </div></div>
 <div class="ttc" id="classSVF_1_1SVFVar_html_a54b2a5ed3ed21e54eaf04182f0338333"><div class="ttname"><a href="classSVF_1_1SVFVar.html#a54b2a5ed3ed21e54eaf04182f0338333">SVF::SVFVar::getValueName</a></div><div class="ttdeci">virtual const std::string getValueName() const =0</div><div class="ttdoc">Get name of the LLVM value. </div></div>
 <div class="ttc" id="cuddInt_8c_html_a8b2e13c78efca330f06b6ddcd7464b41"><div class="ttname"><a href="cuddInt_8c.html#a8b2e13c78efca330f06b6ddcd7464b41">result</a></div><div class="ttdeci">static int result</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8c_source.html#l07466">cuddInt.c:7466</a></div></div>

package/SVF-doxygen/html/html/cuddInt_8c.html

@@ -11829,7 +11829,7 @@ S: MTR_SOFT </li>
 <p>SeeAlso [] </p>
 
 <p class="definition">Definition at line <a class="el" href="cuddInt_8c_source.html#l20917">20917</a> of file <a class="el" href="cuddInt_8c_source.html">cuddInt.c</a>.</p>
-<div class="fragment"><div class="line"><a name="l20920"></a><span class="lineno">20920</span>&#160;{</div><div class="line"><a name="l20921"></a><span class="lineno">20921</span>&#160;<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> slots, oldslots;</div><div class="line"><a name="l20922"></a><span class="lineno">20922</span>&#160;<span class="keywordtype">int</span> shift, oldshift;</div><div class="line"><a name="l20923"></a><span class="lineno">20923</span>&#160;<span class="keywordtype">int</span> j, pos;</div><div class="line"><a name="l20924"></a><span class="lineno">20924</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *nodelist, *oldnodelist;</div><div class="line"><a name="l20925"></a><span class="lineno">20925</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *node, *next;</div><div class="line"><a name="l20926"></a><span class="lineno">20926</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *sentinel = &amp;(unique-&gt;<a class="code" href="structDdManager.html#a8679aac5ecef09b42b3cf11786d57139">sentinel</a>);</div><div class="line"><a name="l20927"></a><span class="lineno">20927</span>&#160;<a class="code" href="unionhack.html">hack</a> split;</div><div class="line"><a name="l20928"></a><span class="lineno">20928</span>&#160;<span class="keyword">extern</span> <a class="code" href="cudd_8h.html#a70985999f50facb0c680b928c161d7c1">DD_OOMFP</a> <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l20929"></a><span class="lineno">20929</span>&#160;<a class="code" href="cudd_8h.html#a70985999f50facb0c680b928c161d7c1">DD_OOMFP</a> saveHandler;</div><div class="line"><a name="l20930"></a><span class="lineno">20930</span>&#160;</div><div class="line"><a name="l20931"></a><span class="lineno">20931</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> == <a class="code" href="cuddInt_8h.html#a000b28ff395aeb4c1ca8bc720f07753f">DD_GC_FRAC_HI</a> &amp;&amp; unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#a08442885cc19bd4e63ee8ca294669efa">looseUpTo</a>) {</div><div class="line"><a name="l20932"></a><span class="lineno">20932</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> = <a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a>;</div><div class="line"><a name="l20933"></a><span class="lineno">20933</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a> = (unsigned) (<a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a> * (<span class="keywordtype">double</span>) unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a>);</div><div class="line"><a name="l20934"></a><span class="lineno">20934</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l20935"></a><span class="lineno">20935</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;GC fraction = %.2f\t&quot;</span>, <a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a>);</div><div class="line"><a name="l20936"></a><span class="lineno">20936</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;minDead = %d\n&quot;</span>, unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>);</div><div class="line"><a name="l20937"></a><span class="lineno">20937</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20938"></a><span class="lineno">20938</span>&#160;}</div><div class="line"><a name="l20939"></a><span class="lineno">20939</span>&#160;</div><div class="line"><a name="l20940"></a><span class="lineno">20940</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> != <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a> &amp;&amp; unique-&gt;<a class="code" href="structDdManager.html#aeabd28ce0f5ff9709ec8ab78d80a6946">memused</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#aca692386284b334539799b3753e0e7b9">maxmem</a>) {</div><div class="line"><a name="l20941"></a><span class="lineno">20941</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> = <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a>;</div><div class="line"><a name="l20942"></a><span class="lineno">20942</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a> = (unsigned) (<a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a> * (<span class="keywordtype">double</span>) unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a>);</div><div class="line"><a name="l20943"></a><span class="lineno">20943</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l20944"></a><span class="lineno">20944</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;GC fraction = %.2f\t&quot;</span>, <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a>);</div><div class="line"><a name="l20945"></a><span class="lineno">20945</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;minDead = %d\n&quot;</span>, unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>);</div><div class="line"><a name="l20946"></a><span class="lineno">20946</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20947"></a><span class="lineno">20947</span>&#160;<a class="code" href="cuddInt_8c.html#a68543f5aa10af3730f82919fdac4fd98">cuddShrinkDeathRow</a>(unique);</div><div class="line"><a name="l20948"></a><span class="lineno">20948</span>&#160;<span class="keywordflow">if</span> (<a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1) &gt; 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l20949"></a><span class="lineno">20949</span>&#160;}</div><div class="line"><a name="l20950"></a><span class="lineno">20950</span>&#160;</div><div class="line"><a name="l20951"></a><span class="lineno">20951</span>&#160;<span class="keywordflow">if</span> (i != <a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>) {</div><div class="line"><a name="l20952"></a><span class="lineno">20952</span>&#160;oldslots = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a>;</div><div class="line"><a name="l20953"></a><span class="lineno">20953</span>&#160;oldshift = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>;</div><div class="line"><a name="l20954"></a><span class="lineno">20954</span>&#160;oldnodelist = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l20955"></a><span class="lineno">20955</span>&#160;</div><div class="line"><a name="l20956"></a><span class="lineno">20956</span>&#160;<span class="comment">/* Compute the new size of the subtable. */</span></div><div class="line"><a name="l20957"></a><span class="lineno">20957</span>&#160;slots = oldslots &lt;&lt; 1;</div><div class="line"><a name="l20958"></a><span class="lineno">20958</span>&#160;shift = oldshift - 1;</div><div class="line"><a name="l20959"></a><span class="lineno">20959</span>&#160;</div><div class="line"><a name="l20960"></a><span class="lineno">20960</span>&#160;saveHandler = <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l20961"></a><span class="lineno">20961</span>&#160;MMoutOfMemory = <a class="code" href="cuddInt_8c.html#a3115ee582497df51b35f9893074017a5">Cudd_OutOfMem</a>;</div><div class="line"><a name="l20962"></a><span class="lineno">20962</span>&#160;nodelist = <a class="code" href="util_8h.html#a21755cdb11c76954a33c653579810f3a">ALLOC</a>(<a class="code" href="structDdNode.html">DdNodePtr</a>, slots);</div><div class="line"><a name="l20963"></a><span class="lineno">20963</span>&#160;MMoutOfMemory = saveHandler;</div><div class="line"><a name="l20964"></a><span class="lineno">20964</span>&#160;<span class="keywordflow">if</span> (nodelist == NULL) {</div><div class="line"><a name="l20965"></a><span class="lineno">20965</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l20966"></a><span class="lineno">20966</span>&#160;<span class="stringliteral">&quot;Unable to resize subtable %d for lack of memory\n&quot;</span>,</div><div class="line"><a name="l20967"></a><span class="lineno">20967</span>&#160;i);</div><div class="line"><a name="l20968"></a><span class="lineno">20968</span>&#160;<span class="comment">/* Prevent frequent resizing attempts. */</span></div><div class="line"><a name="l20969"></a><span class="lineno">20969</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l20970"></a><span class="lineno">20970</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a> != NULL) {</div><div class="line"><a name="l20971"></a><span class="lineno">20971</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a>);</div><div class="line"><a name="l20972"></a><span class="lineno">20972</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a> = NULL;</div><div class="line"><a name="l20973"></a><span class="lineno">20973</span>&#160;<span class="comment">/* Inhibit resizing of tables. */</span></div><div class="line"><a name="l20974"></a><span class="lineno">20974</span>&#160;<a class="code" href="cuddInt_8c.html#a917f877ac725fc2d169102ab9d7aec97">cuddSlowTableGrowth</a>(unique);</div><div class="line"><a name="l20975"></a><span class="lineno">20975</span>&#160;}</div><div class="line"><a name="l20976"></a><span class="lineno">20976</span>&#160;<span class="keywordflow">return</span>;</div><div class="line"><a name="l20977"></a><span class="lineno">20977</span>&#160;}</div><div class="line"><a name="l20978"></a><span class="lineno">20978</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a> = nodelist;</div><div class="line"><a name="l20979"></a><span class="lineno">20979</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a> = slots;</div><div class="line"><a name="l20980"></a><span class="lineno">20980</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a> = shift;</div><div class="line"><a name="l20981"></a><span class="lineno">20981</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> = slots * <a class="code" href="cuddInt_8h.html#ac208c481d05e63d611b27bc3de089b35">DD_MAX_SUBTABLE_DENSITY</a>;</div><div class="line"><a name="l20982"></a><span class="lineno">20982</span>&#160;</div><div class="line"><a name="l20983"></a><span class="lineno">20983</span>&#160;<span class="comment">/* Move the nodes from the old table to the new table.</span></div><div class="line"><a name="l20984"></a><span class="lineno">20984</span>&#160;<span class="comment">** This code depends on the type of hash function.</span></div><div class="line"><a name="l20985"></a><span class="lineno">20985</span>&#160;<span class="comment">** It assumes that the effect of doubling the size of the table</span></div><div class="line"><a name="l20986"></a><span class="lineno">20986</span>&#160;<span class="comment">** is to retain one more bit of the 32-bit hash value.</span></div><div class="line"><a name="l20987"></a><span class="lineno">20987</span>&#160;<span class="comment">** The additional bit is the LSB. */</span></div><div class="line"><a name="l20988"></a><span class="lineno">20988</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; oldslots; j++) {</div><div class="line"><a name="l20989"></a><span class="lineno">20989</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *evenP, *oddP;</div><div class="line"><a name="l20990"></a><span class="lineno">20990</span>&#160;node = oldnodelist[j];</div><div class="line"><a name="l20991"></a><span class="lineno">20991</span>&#160;evenP = &amp;(nodelist[j&lt;&lt;1]);</div><div class="line"><a name="l20992"></a><span class="lineno">20992</span>&#160;oddP = &amp;(nodelist[(j&lt;&lt;1)+1]);</div><div class="line"><a name="l20993"></a><span class="lineno">20993</span>&#160;<span class="keywordflow">while</span> (node != sentinel) {</div><div class="line"><a name="l20994"></a><span class="lineno">20994</span>&#160;next = node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l20995"></a><span class="lineno">20995</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(<a class="code" href="cuddInt_8h.html#a09834c697b92ac296b1e50c863f88262">cuddT</a>(node), <a class="code" href="cuddInt_8h.html#aaef03f10591d8e28bb5fecd2aa7c93ff">cuddE</a>(node), shift);</div><div class="line"><a name="l20996"></a><span class="lineno">20996</span>&#160;<span class="keywordflow">if</span> (pos &amp; 1) {</div><div class="line"><a name="l20997"></a><span class="lineno">20997</span>&#160;*oddP = node;</div><div class="line"><a name="l20998"></a><span class="lineno">20998</span>&#160;oddP = &amp;(node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>);</div><div class="line"><a name="l20999"></a><span class="lineno">20999</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l21000"></a><span class="lineno">21000</span>&#160;*evenP = node;</div><div class="line"><a name="l21001"></a><span class="lineno">21001</span>&#160;evenP = &amp;(node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>);</div><div class="line"><a name="l21002"></a><span class="lineno">21002</span>&#160;}</div><div class="line"><a name="l21003"></a><span class="lineno">21003</span>&#160;node = next;</div><div class="line"><a name="l21004"></a><span class="lineno">21004</span>&#160;}</div><div class="line"><a name="l21005"></a><span class="lineno">21005</span>&#160;*evenP = *oddP = sentinel;</div><div class="line"><a name="l21006"></a><span class="lineno">21006</span>&#160;}</div><div class="line"><a name="l21007"></a><span class="lineno">21007</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(oldnodelist);</div><div class="line"><a name="l21008"></a><span class="lineno">21008</span>&#160;</div><div class="line"><a name="l21009"></a><span class="lineno">21009</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l21010"></a><span class="lineno">21010</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21011"></a><span class="lineno">21011</span>&#160;<span class="stringliteral">&quot;rehashing layer %d: keys %d dead %d new size %d\n&quot;</span>,</div><div class="line"><a name="l21012"></a><span class="lineno">21012</span>&#160;i, unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>,</div><div class="line"><a name="l21013"></a><span class="lineno">21013</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a>, slots);</div><div class="line"><a name="l21014"></a><span class="lineno">21014</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l21015"></a><span class="lineno">21015</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l21016"></a><span class="lineno">21016</span>&#160;oldslots = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a>;</div><div class="line"><a name="l21017"></a><span class="lineno">21017</span>&#160;oldshift = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>;</div><div class="line"><a name="l21018"></a><span class="lineno">21018</span>&#160;oldnodelist = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l21019"></a><span class="lineno">21019</span>&#160;</div><div class="line"><a name="l21020"></a><span class="lineno">21020</span>&#160;<span class="comment">/* The constant subtable is never subjected to reordering.</span></div><div class="line"><a name="l21021"></a><span class="lineno">21021</span>&#160;<span class="comment">** Therefore, when it is resized, it is because it has just</span></div><div class="line"><a name="l21022"></a><span class="lineno">21022</span>&#160;<span class="comment">** reached the maximum load. We can safely just double the size,</span></div><div class="line"><a name="l21023"></a><span class="lineno">21023</span>&#160;<span class="comment">** with no need for the loop we use for the other tables.</span></div><div class="line"><a name="l21024"></a><span class="lineno">21024</span>&#160;<span class="comment">*/</span></div><div class="line"><a name="l21025"></a><span class="lineno">21025</span>&#160;slots = oldslots &lt;&lt; 1;</div><div class="line"><a name="l21026"></a><span class="lineno">21026</span>&#160;shift = oldshift - 1;</div><div class="line"><a name="l21027"></a><span class="lineno">21027</span>&#160;saveHandler = <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l21028"></a><span class="lineno">21028</span>&#160;MMoutOfMemory = <a class="code" href="cuddInt_8c.html#a3115ee582497df51b35f9893074017a5">Cudd_OutOfMem</a>;</div><div class="line"><a name="l21029"></a><span class="lineno">21029</span>&#160;nodelist = <a class="code" href="util_8h.html#a21755cdb11c76954a33c653579810f3a">ALLOC</a>(<a class="code" href="structDdNode.html">DdNodePtr</a>, slots);</div><div class="line"><a name="l21030"></a><span class="lineno">21030</span>&#160;MMoutOfMemory = saveHandler;</div><div class="line"><a name="l21031"></a><span class="lineno">21031</span>&#160;<span class="keywordflow">if</span> (nodelist == NULL) {</div><div class="line"><a name="l21032"></a><span class="lineno">21032</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21033"></a><span class="lineno">21033</span>&#160;<span class="stringliteral">&quot;Unable to resize constant subtable for lack of memory\n&quot;</span>);</div><div class="line"><a name="l21034"></a><span class="lineno">21034</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l21035"></a><span class="lineno">21035</span>&#160;<span class="keywordflow">for</span> (j = 0; j &lt; unique-&gt;<a class="code" href="structDdManager.html#a5fc169bc41431f1a0645f64c753457e3">size</a>; j++) {</div><div class="line"><a name="l21036"></a><span class="lineno">21036</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[j].<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> &lt;&lt;= 1;</div><div class="line"><a name="l21037"></a><span class="lineno">21037</span>&#160;}</div><div class="line"><a name="l21038"></a><span class="lineno">21038</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> &lt;&lt;= 1;</div><div class="line"><a name="l21039"></a><span class="lineno">21039</span>&#160;<span class="keywordflow">return</span>;</div><div class="line"><a name="l21040"></a><span class="lineno">21040</span>&#160;}</div><div class="line"><a name="l21041"></a><span class="lineno">21041</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a> = slots;</div><div class="line"><a name="l21042"></a><span class="lineno">21042</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a> = shift;</div><div class="line"><a name="l21043"></a><span class="lineno">21043</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> = slots * <a class="code" href="cuddInt_8h.html#ac208c481d05e63d611b27bc3de089b35">DD_MAX_SUBTABLE_DENSITY</a>;</div><div class="line"><a name="l21044"></a><span class="lineno">21044</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a> = nodelist;</div><div class="line"><a name="l21045"></a><span class="lineno">21045</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; slots; j++) {</div><div class="line"><a name="l21046"></a><span class="lineno">21046</span>&#160;nodelist[j] = NULL;</div><div class="line"><a name="l21047"></a><span class="lineno">21047</span>&#160;}</div><div class="line"><a name="l21048"></a><span class="lineno">21048</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; oldslots; j++) {</div><div class="line"><a name="l21049"></a><span class="lineno">21049</span>&#160;node = oldnodelist[j];</div><div class="line"><a name="l21050"></a><span class="lineno">21050</span>&#160;<span class="keywordflow">while</span> (node != NULL) {</div><div class="line"><a name="l21051"></a><span class="lineno">21051</span>&#160;next = node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l21052"></a><span class="lineno">21052</span>&#160;split.<a class="code" href="unionhack.html#a57925aea3fe6bc712a7d34f05e3c31f4">value</a> = <a class="code" href="cuddInt_8h.html#ae4c91711a93064634cccc69dc22f3712">cuddV</a>(node);</div><div class="line"><a name="l21053"></a><span class="lineno">21053</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[0], split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[1], shift);</div><div class="line"><a name="l21054"></a><span class="lineno">21054</span>&#160;node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a> = nodelist[pos];</div><div class="line"><a name="l21055"></a><span class="lineno">21055</span>&#160;nodelist[pos] = node;</div><div class="line"><a name="l21056"></a><span class="lineno">21056</span>&#160;node = next;</div><div class="line"><a name="l21057"></a><span class="lineno">21057</span>&#160;}</div><div class="line"><a name="l21058"></a><span class="lineno">21058</span>&#160;}</div><div class="line"><a name="l21059"></a><span class="lineno">21059</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(oldnodelist);</div><div class="line"><a name="l21060"></a><span class="lineno">21060</span>&#160;</div><div class="line"><a name="l21061"></a><span class="lineno">21061</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l21062"></a><span class="lineno">21062</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21063"></a><span class="lineno">21063</span>&#160;<span class="stringliteral">&quot;rehashing constants: keys %d dead %d new size %d\n&quot;</span>,</div><div class="line"><a name="l21064"></a><span class="lineno">21064</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>,unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a>,slots);</div><div class="line"><a name="l21065"></a><span class="lineno">21065</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l21066"></a><span class="lineno">21066</span>&#160;}</div><div class="line"><a name="l21067"></a><span class="lineno">21067</span>&#160;</div><div class="line"><a name="l21068"></a><span class="lineno">21068</span>&#160;<span class="comment">/* Update global data */</span></div><div class="line"><a name="l21069"></a><span class="lineno">21069</span>&#160;</div><div class="line"><a name="l21070"></a><span class="lineno">21070</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aeabd28ce0f5ff9709ec8ab78d80a6946">memused</a> += (slots - oldslots) * <span class="keyword">sizeof</span>(<a class="code" href="structDdNode.html">DdNodePtr</a>);</div><div class="line"><a name="l21071"></a><span class="lineno">21071</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a> += (slots - oldslots);</div><div class="line"><a name="l21072"></a><span class="lineno">21072</span>&#160;<a class="code" href="cuddInt_8c.html#a289296f33cef84ced5299b7600a9c352">ddFixLimits</a>(unique);</div><div class="line"><a name="l21073"></a><span class="lineno">21073</span>&#160;</div><div class="line"><a name="l21074"></a><span class="lineno">21074</span>&#160;} <span class="comment">/* end of cuddRehash */</span></div><div class="ttc" id="structDdSubtable_html_aca2eea345c00c69090e701ffacff7de4"><div class="ttname"><a href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">DdSubtable::keys</a></div><div class="ttdeci">unsigned int keys</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00327">cuddInt.h:327</a></div></div>
+<div class="fragment"><div class="line"><a name="l20920"></a><span class="lineno">20920</span>&#160;{</div><div class="line"><a name="l20921"></a><span class="lineno">20921</span>&#160;<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> slots, oldslots;</div><div class="line"><a name="l20922"></a><span class="lineno">20922</span>&#160;<span class="keywordtype">int</span> shift, oldshift;</div><div class="line"><a name="l20923"></a><span class="lineno">20923</span>&#160;<span class="keywordtype">int</span> j, pos;</div><div class="line"><a name="l20924"></a><span class="lineno">20924</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *nodelist, *oldnodelist;</div><div class="line"><a name="l20925"></a><span class="lineno">20925</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *node, *next;</div><div class="line"><a name="l20926"></a><span class="lineno">20926</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *sentinel = &amp;(unique-&gt;<a class="code" href="structDdManager.html#a8679aac5ecef09b42b3cf11786d57139">sentinel</a>);</div><div class="line"><a name="l20927"></a><span class="lineno">20927</span>&#160;<a class="code" href="unionhack.html">hack</a> <a class="code" href="namespaceSVF_1_1SVFUtil.html#af54e70082388bbd70868250aaa0bc86b">split</a>;</div><div class="line"><a name="l20928"></a><span class="lineno">20928</span>&#160;<span class="keyword">extern</span> <a class="code" href="cudd_8h.html#a70985999f50facb0c680b928c161d7c1">DD_OOMFP</a> <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l20929"></a><span class="lineno">20929</span>&#160;<a class="code" href="cudd_8h.html#a70985999f50facb0c680b928c161d7c1">DD_OOMFP</a> saveHandler;</div><div class="line"><a name="l20930"></a><span class="lineno">20930</span>&#160;</div><div class="line"><a name="l20931"></a><span class="lineno">20931</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> == <a class="code" href="cuddInt_8h.html#a000b28ff395aeb4c1ca8bc720f07753f">DD_GC_FRAC_HI</a> &amp;&amp; unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#a08442885cc19bd4e63ee8ca294669efa">looseUpTo</a>) {</div><div class="line"><a name="l20932"></a><span class="lineno">20932</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> = <a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a>;</div><div class="line"><a name="l20933"></a><span class="lineno">20933</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a> = (unsigned) (<a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a> * (<span class="keywordtype">double</span>) unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a>);</div><div class="line"><a name="l20934"></a><span class="lineno">20934</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l20935"></a><span class="lineno">20935</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;GC fraction = %.2f\t&quot;</span>, <a class="code" href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a>);</div><div class="line"><a name="l20936"></a><span class="lineno">20936</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;minDead = %d\n&quot;</span>, unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>);</div><div class="line"><a name="l20937"></a><span class="lineno">20937</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20938"></a><span class="lineno">20938</span>&#160;}</div><div class="line"><a name="l20939"></a><span class="lineno">20939</span>&#160;</div><div class="line"><a name="l20940"></a><span class="lineno">20940</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> != <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a> &amp;&amp; unique-&gt;<a class="code" href="structDdManager.html#aeabd28ce0f5ff9709ec8ab78d80a6946">memused</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#aca692386284b334539799b3753e0e7b9">maxmem</a>) {</div><div class="line"><a name="l20941"></a><span class="lineno">20941</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6d7c2a944d2b73afcf3d085410568849">gcFrac</a> = <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a>;</div><div class="line"><a name="l20942"></a><span class="lineno">20942</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a> = (unsigned) (<a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a> * (<span class="keywordtype">double</span>) unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a>);</div><div class="line"><a name="l20943"></a><span class="lineno">20943</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l20944"></a><span class="lineno">20944</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;GC fraction = %.2f\t&quot;</span>, <a class="code" href="cuddInt_8h.html#acb2a86b57416fca50100a29ba98b8639">DD_GC_FRAC_MIN</a>);</div><div class="line"><a name="l20945"></a><span class="lineno">20945</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,<span class="stringliteral">&quot;minDead = %d\n&quot;</span>, unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>);</div><div class="line"><a name="l20946"></a><span class="lineno">20946</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20947"></a><span class="lineno">20947</span>&#160;<a class="code" href="cuddInt_8c.html#a68543f5aa10af3730f82919fdac4fd98">cuddShrinkDeathRow</a>(unique);</div><div class="line"><a name="l20948"></a><span class="lineno">20948</span>&#160;<span class="keywordflow">if</span> (<a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1) &gt; 0) <span class="keywordflow">return</span>;</div><div class="line"><a name="l20949"></a><span class="lineno">20949</span>&#160;}</div><div class="line"><a name="l20950"></a><span class="lineno">20950</span>&#160;</div><div class="line"><a name="l20951"></a><span class="lineno">20951</span>&#160;<span class="keywordflow">if</span> (i != <a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>) {</div><div class="line"><a name="l20952"></a><span class="lineno">20952</span>&#160;oldslots = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a>;</div><div class="line"><a name="l20953"></a><span class="lineno">20953</span>&#160;oldshift = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>;</div><div class="line"><a name="l20954"></a><span class="lineno">20954</span>&#160;oldnodelist = unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l20955"></a><span class="lineno">20955</span>&#160;</div><div class="line"><a name="l20956"></a><span class="lineno">20956</span>&#160;<span class="comment">/* Compute the new size of the subtable. */</span></div><div class="line"><a name="l20957"></a><span class="lineno">20957</span>&#160;slots = oldslots &lt;&lt; 1;</div><div class="line"><a name="l20958"></a><span class="lineno">20958</span>&#160;shift = oldshift - 1;</div><div class="line"><a name="l20959"></a><span class="lineno">20959</span>&#160;</div><div class="line"><a name="l20960"></a><span class="lineno">20960</span>&#160;saveHandler = <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l20961"></a><span class="lineno">20961</span>&#160;MMoutOfMemory = <a class="code" href="cuddInt_8c.html#a3115ee582497df51b35f9893074017a5">Cudd_OutOfMem</a>;</div><div class="line"><a name="l20962"></a><span class="lineno">20962</span>&#160;nodelist = <a class="code" href="util_8h.html#a21755cdb11c76954a33c653579810f3a">ALLOC</a>(<a class="code" href="structDdNode.html">DdNodePtr</a>, slots);</div><div class="line"><a name="l20963"></a><span class="lineno">20963</span>&#160;MMoutOfMemory = saveHandler;</div><div class="line"><a name="l20964"></a><span class="lineno">20964</span>&#160;<span class="keywordflow">if</span> (nodelist == NULL) {</div><div class="line"><a name="l20965"></a><span class="lineno">20965</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l20966"></a><span class="lineno">20966</span>&#160;<span class="stringliteral">&quot;Unable to resize subtable %d for lack of memory\n&quot;</span>,</div><div class="line"><a name="l20967"></a><span class="lineno">20967</span>&#160;i);</div><div class="line"><a name="l20968"></a><span class="lineno">20968</span>&#160;<span class="comment">/* Prevent frequent resizing attempts. */</span></div><div class="line"><a name="l20969"></a><span class="lineno">20969</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l20970"></a><span class="lineno">20970</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a> != NULL) {</div><div class="line"><a name="l20971"></a><span class="lineno">20971</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a>);</div><div class="line"><a name="l20972"></a><span class="lineno">20972</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a0c7a23b6822e1f426e2021e6864af0e9">stash</a> = NULL;</div><div class="line"><a name="l20973"></a><span class="lineno">20973</span>&#160;<span class="comment">/* Inhibit resizing of tables. */</span></div><div class="line"><a name="l20974"></a><span class="lineno">20974</span>&#160;<a class="code" href="cuddInt_8c.html#a917f877ac725fc2d169102ab9d7aec97">cuddSlowTableGrowth</a>(unique);</div><div class="line"><a name="l20975"></a><span class="lineno">20975</span>&#160;}</div><div class="line"><a name="l20976"></a><span class="lineno">20976</span>&#160;<span class="keywordflow">return</span>;</div><div class="line"><a name="l20977"></a><span class="lineno">20977</span>&#160;}</div><div class="line"><a name="l20978"></a><span class="lineno">20978</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a> = nodelist;</div><div class="line"><a name="l20979"></a><span class="lineno">20979</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a> = slots;</div><div class="line"><a name="l20980"></a><span class="lineno">20980</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a> = shift;</div><div class="line"><a name="l20981"></a><span class="lineno">20981</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> = slots * <a class="code" href="cuddInt_8h.html#ac208c481d05e63d611b27bc3de089b35">DD_MAX_SUBTABLE_DENSITY</a>;</div><div class="line"><a name="l20982"></a><span class="lineno">20982</span>&#160;</div><div class="line"><a name="l20983"></a><span class="lineno">20983</span>&#160;<span class="comment">/* Move the nodes from the old table to the new table.</span></div><div class="line"><a name="l20984"></a><span class="lineno">20984</span>&#160;<span class="comment">** This code depends on the type of hash function.</span></div><div class="line"><a name="l20985"></a><span class="lineno">20985</span>&#160;<span class="comment">** It assumes that the effect of doubling the size of the table</span></div><div class="line"><a name="l20986"></a><span class="lineno">20986</span>&#160;<span class="comment">** is to retain one more bit of the 32-bit hash value.</span></div><div class="line"><a name="l20987"></a><span class="lineno">20987</span>&#160;<span class="comment">** The additional bit is the LSB. */</span></div><div class="line"><a name="l20988"></a><span class="lineno">20988</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; oldslots; j++) {</div><div class="line"><a name="l20989"></a><span class="lineno">20989</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *evenP, *oddP;</div><div class="line"><a name="l20990"></a><span class="lineno">20990</span>&#160;node = oldnodelist[j];</div><div class="line"><a name="l20991"></a><span class="lineno">20991</span>&#160;evenP = &amp;(nodelist[j&lt;&lt;1]);</div><div class="line"><a name="l20992"></a><span class="lineno">20992</span>&#160;oddP = &amp;(nodelist[(j&lt;&lt;1)+1]);</div><div class="line"><a name="l20993"></a><span class="lineno">20993</span>&#160;<span class="keywordflow">while</span> (node != sentinel) {</div><div class="line"><a name="l20994"></a><span class="lineno">20994</span>&#160;next = node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l20995"></a><span class="lineno">20995</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(<a class="code" href="cuddInt_8h.html#a09834c697b92ac296b1e50c863f88262">cuddT</a>(node), <a class="code" href="cuddInt_8h.html#aaef03f10591d8e28bb5fecd2aa7c93ff">cuddE</a>(node), shift);</div><div class="line"><a name="l20996"></a><span class="lineno">20996</span>&#160;<span class="keywordflow">if</span> (pos &amp; 1) {</div><div class="line"><a name="l20997"></a><span class="lineno">20997</span>&#160;*oddP = node;</div><div class="line"><a name="l20998"></a><span class="lineno">20998</span>&#160;oddP = &amp;(node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>);</div><div class="line"><a name="l20999"></a><span class="lineno">20999</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l21000"></a><span class="lineno">21000</span>&#160;*evenP = node;</div><div class="line"><a name="l21001"></a><span class="lineno">21001</span>&#160;evenP = &amp;(node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>);</div><div class="line"><a name="l21002"></a><span class="lineno">21002</span>&#160;}</div><div class="line"><a name="l21003"></a><span class="lineno">21003</span>&#160;node = next;</div><div class="line"><a name="l21004"></a><span class="lineno">21004</span>&#160;}</div><div class="line"><a name="l21005"></a><span class="lineno">21005</span>&#160;*evenP = *oddP = sentinel;</div><div class="line"><a name="l21006"></a><span class="lineno">21006</span>&#160;}</div><div class="line"><a name="l21007"></a><span class="lineno">21007</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(oldnodelist);</div><div class="line"><a name="l21008"></a><span class="lineno">21008</span>&#160;</div><div class="line"><a name="l21009"></a><span class="lineno">21009</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l21010"></a><span class="lineno">21010</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21011"></a><span class="lineno">21011</span>&#160;<span class="stringliteral">&quot;rehashing layer %d: keys %d dead %d new size %d\n&quot;</span>,</div><div class="line"><a name="l21012"></a><span class="lineno">21012</span>&#160;i, unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>,</div><div class="line"><a name="l21013"></a><span class="lineno">21013</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[i].<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a>, slots);</div><div class="line"><a name="l21014"></a><span class="lineno">21014</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l21015"></a><span class="lineno">21015</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l21016"></a><span class="lineno">21016</span>&#160;oldslots = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a>;</div><div class="line"><a name="l21017"></a><span class="lineno">21017</span>&#160;oldshift = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>;</div><div class="line"><a name="l21018"></a><span class="lineno">21018</span>&#160;oldnodelist = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l21019"></a><span class="lineno">21019</span>&#160;</div><div class="line"><a name="l21020"></a><span class="lineno">21020</span>&#160;<span class="comment">/* The constant subtable is never subjected to reordering.</span></div><div class="line"><a name="l21021"></a><span class="lineno">21021</span>&#160;<span class="comment">** Therefore, when it is resized, it is because it has just</span></div><div class="line"><a name="l21022"></a><span class="lineno">21022</span>&#160;<span class="comment">** reached the maximum load. We can safely just double the size,</span></div><div class="line"><a name="l21023"></a><span class="lineno">21023</span>&#160;<span class="comment">** with no need for the loop we use for the other tables.</span></div><div class="line"><a name="l21024"></a><span class="lineno">21024</span>&#160;<span class="comment">*/</span></div><div class="line"><a name="l21025"></a><span class="lineno">21025</span>&#160;slots = oldslots &lt;&lt; 1;</div><div class="line"><a name="l21026"></a><span class="lineno">21026</span>&#160;shift = oldshift - 1;</div><div class="line"><a name="l21027"></a><span class="lineno">21027</span>&#160;saveHandler = <a class="code" href="util_8h.html#af76722b9c78f324a2cd1a57318e0eea1">MMoutOfMemory</a>;</div><div class="line"><a name="l21028"></a><span class="lineno">21028</span>&#160;MMoutOfMemory = <a class="code" href="cuddInt_8c.html#a3115ee582497df51b35f9893074017a5">Cudd_OutOfMem</a>;</div><div class="line"><a name="l21029"></a><span class="lineno">21029</span>&#160;nodelist = <a class="code" href="util_8h.html#a21755cdb11c76954a33c653579810f3a">ALLOC</a>(<a class="code" href="structDdNode.html">DdNodePtr</a>, slots);</div><div class="line"><a name="l21030"></a><span class="lineno">21030</span>&#160;MMoutOfMemory = saveHandler;</div><div class="line"><a name="l21031"></a><span class="lineno">21031</span>&#160;<span class="keywordflow">if</span> (nodelist == NULL) {</div><div class="line"><a name="l21032"></a><span class="lineno">21032</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21033"></a><span class="lineno">21033</span>&#160;<span class="stringliteral">&quot;Unable to resize constant subtable for lack of memory\n&quot;</span>);</div><div class="line"><a name="l21034"></a><span class="lineno">21034</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l21035"></a><span class="lineno">21035</span>&#160;<span class="keywordflow">for</span> (j = 0; j &lt; unique-&gt;<a class="code" href="structDdManager.html#a5fc169bc41431f1a0645f64c753457e3">size</a>; j++) {</div><div class="line"><a name="l21036"></a><span class="lineno">21036</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a835661f21be3f5d8944d76e22995be1f">subtables</a>[j].<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> &lt;&lt;= 1;</div><div class="line"><a name="l21037"></a><span class="lineno">21037</span>&#160;}</div><div class="line"><a name="l21038"></a><span class="lineno">21038</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> &lt;&lt;= 1;</div><div class="line"><a name="l21039"></a><span class="lineno">21039</span>&#160;<span class="keywordflow">return</span>;</div><div class="line"><a name="l21040"></a><span class="lineno">21040</span>&#160;}</div><div class="line"><a name="l21041"></a><span class="lineno">21041</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ab01ae39304c9a7ce2236584a78ff5856">slots</a> = slots;</div><div class="line"><a name="l21042"></a><span class="lineno">21042</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a> = shift;</div><div class="line"><a name="l21043"></a><span class="lineno">21043</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a> = slots * <a class="code" href="cuddInt_8h.html#ac208c481d05e63d611b27bc3de089b35">DD_MAX_SUBTABLE_DENSITY</a>;</div><div class="line"><a name="l21044"></a><span class="lineno">21044</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a> = nodelist;</div><div class="line"><a name="l21045"></a><span class="lineno">21045</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; slots; j++) {</div><div class="line"><a name="l21046"></a><span class="lineno">21046</span>&#160;nodelist[j] = NULL;</div><div class="line"><a name="l21047"></a><span class="lineno">21047</span>&#160;}</div><div class="line"><a name="l21048"></a><span class="lineno">21048</span>&#160;<span class="keywordflow">for</span> (j = 0; (unsigned) j &lt; oldslots; j++) {</div><div class="line"><a name="l21049"></a><span class="lineno">21049</span>&#160;node = oldnodelist[j];</div><div class="line"><a name="l21050"></a><span class="lineno">21050</span>&#160;<span class="keywordflow">while</span> (node != NULL) {</div><div class="line"><a name="l21051"></a><span class="lineno">21051</span>&#160;next = node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l21052"></a><span class="lineno">21052</span>&#160;split.<a class="code" href="unionhack.html#a57925aea3fe6bc712a7d34f05e3c31f4">value</a> = <a class="code" href="cuddInt_8h.html#ae4c91711a93064634cccc69dc22f3712">cuddV</a>(node);</div><div class="line"><a name="l21053"></a><span class="lineno">21053</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[0], split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[1], shift);</div><div class="line"><a name="l21054"></a><span class="lineno">21054</span>&#160;node-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a> = nodelist[pos];</div><div class="line"><a name="l21055"></a><span class="lineno">21055</span>&#160;nodelist[pos] = node;</div><div class="line"><a name="l21056"></a><span class="lineno">21056</span>&#160;node = next;</div><div class="line"><a name="l21057"></a><span class="lineno">21057</span>&#160;}</div><div class="line"><a name="l21058"></a><span class="lineno">21058</span>&#160;}</div><div class="line"><a name="l21059"></a><span class="lineno">21059</span>&#160;<a class="code" href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a>(oldnodelist);</div><div class="line"><a name="l21060"></a><span class="lineno">21060</span>&#160;</div><div class="line"><a name="l21061"></a><span class="lineno">21061</span>&#160;<span class="preprocessor">#ifdef DD_VERBOSE</span></div><div class="line"><a name="l21062"></a><span class="lineno">21062</span>&#160;(void) fprintf(unique-&gt;<a class="code" href="structDdManager.html#a6b0364070de52e689fe3485a86bb2825">err</a>,</div><div class="line"><a name="l21063"></a><span class="lineno">21063</span>&#160;<span class="stringliteral">&quot;rehashing constants: keys %d dead %d new size %d\n&quot;</span>,</div><div class="line"><a name="l21064"></a><span class="lineno">21064</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>,unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a>,slots);</div><div class="line"><a name="l21065"></a><span class="lineno">21065</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l21066"></a><span class="lineno">21066</span>&#160;}</div><div class="line"><a name="l21067"></a><span class="lineno">21067</span>&#160;</div><div class="line"><a name="l21068"></a><span class="lineno">21068</span>&#160;<span class="comment">/* Update global data */</span></div><div class="line"><a name="l21069"></a><span class="lineno">21069</span>&#160;</div><div class="line"><a name="l21070"></a><span class="lineno">21070</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aeabd28ce0f5ff9709ec8ab78d80a6946">memused</a> += (slots - oldslots) * <span class="keyword">sizeof</span>(<a class="code" href="structDdNode.html">DdNodePtr</a>);</div><div class="line"><a name="l21071"></a><span class="lineno">21071</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#a8a0404c6d3d8c1e49ed84e4467c3387c">slots</a> += (slots - oldslots);</div><div class="line"><a name="l21072"></a><span class="lineno">21072</span>&#160;<a class="code" href="cuddInt_8c.html#a289296f33cef84ced5299b7600a9c352">ddFixLimits</a>(unique);</div><div class="line"><a name="l21073"></a><span class="lineno">21073</span>&#160;</div><div class="line"><a name="l21074"></a><span class="lineno">21074</span>&#160;} <span class="comment">/* end of cuddRehash */</span></div><div class="ttc" id="structDdSubtable_html_aca2eea345c00c69090e701ffacff7de4"><div class="ttname"><a href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">DdSubtable::keys</a></div><div class="ttdeci">unsigned int keys</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00327">cuddInt.h:327</a></div></div>
 <div class="ttc" id="cuddInt_8h_html_a04555d27c114939b7c4a37be638b7968"><div class="ttname"><a href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a></div><div class="ttdeci">#define ddHash(f, g, s)</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00713">cuddInt.h:713</a></div></div>
 <div class="ttc" id="structDdNode_html"><div class="ttname"><a href="structDdNode.html">DdNode</a></div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00271">cudd.h:271</a></div></div>
 <div class="ttc" id="util_8h_html_aa279a8302d25fa9dfeb3e00161aee784"><div class="ttname"><a href="util_8h.html#aa279a8302d25fa9dfeb3e00161aee784">FREE</a></div><div class="ttdeci">#define FREE(obj)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00080">util.h:80</a></div></div>
@@ -11855,6 +11855,7 @@ S: MTR_SOFT </li>
 <div class="ttc" id="structDdNode_html_a9422352d3b46de31b325d1cf18b9f25f"><div class="ttname"><a href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">DdNode::next</a></div><div class="ttdeci">DdNode * next</div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00275">cudd.h:275</a></div></div>
 <div class="ttc" id="cuddInt_8h_html_a9b1f609f95c31c8f64395a4b0c778a3f"><div class="ttname"><a href="cuddInt_8h.html#a9b1f609f95c31c8f64395a4b0c778a3f">DD_GC_FRAC_LO</a></div><div class="ttdeci">#define DD_GC_FRAC_LO</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00134">cuddInt.h:134</a></div></div>
 <div class="ttc" id="structDdSubtable_html_a2997673187c40bc7d7977a2581581420"><div class="ttname"><a href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">DdSubtable::maxKeys</a></div><div class="ttdeci">unsigned int maxKeys</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00328">cuddInt.h:328</a></div></div>
+<div class="ttc" id="namespaceSVF_1_1SVFUtil_html_af54e70082388bbd70868250aaa0bc86b"><div class="ttname"><a href="namespaceSVF_1_1SVFUtil.html#af54e70082388bbd70868250aaa0bc86b">SVF::SVFUtil::split</a></div><div class="ttdeci">std::vector&lt; std::string &gt; split(const std::string &amp;s, char seperator)</div><div class="ttdoc">Split into two substrings around the first occurrence of a separator string. </div><div class="ttdef"><b>Definition:</b> <a href="SVFUtil_8h_source.html#l00243">SVFUtil.h:243</a></div></div>
 <div class="ttc" id="cudd_8h_html_aa097684bc69c58891332b245d577b986"><div class="ttname"><a href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a></div><div class="ttdeci">#define CUDD_CONST_INDEX</div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00107">cudd.h:107</a></div></div>
 <div class="ttc" id="structDdSubtable_html_a1226ea7ecfb6d6b56269cb518ac5e2d7"><div class="ttname"><a href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">DdSubtable::nodelist</a></div><div class="ttdeci">DdNode ** nodelist</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00324">cuddInt.h:324</a></div></div>
 <div class="ttc" id="cuddInt_8h_html_a09834c697b92ac296b1e50c863f88262"><div class="ttname"><a href="cuddInt_8h.html#a09834c697b92ac296b1e50c863f88262">cuddT</a></div><div class="ttdeci">#define cuddT(node)</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00626">cuddInt.h:626</a></div></div>
@@ -12684,7 +12685,7 @@ Repeat 1-4 until no further improvement. </li>
 <p>SideEffects [None] </p>
 
 <p class="definition">Definition at line <a class="el" href="cuddInt_8c_source.html#l20837">20837</a> of file <a class="el" href="cuddInt_8c_source.html">cuddInt.c</a>.</p>
-<div class="fragment"><div class="line"><a name="l20840"></a><span class="lineno">20840</span>&#160;{</div><div class="line"><a name="l20841"></a><span class="lineno">20841</span>&#160;<span class="keywordtype">int</span> pos;</div><div class="line"><a name="l20842"></a><span class="lineno">20842</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *nodelist;</div><div class="line"><a name="l20843"></a><span class="lineno">20843</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *looking;</div><div class="line"><a name="l20844"></a><span class="lineno">20844</span>&#160;<a class="code" href="unionhack.html">hack</a> split;</div><div class="line"><a name="l20845"></a><span class="lineno">20845</span>&#160;</div><div class="line"><a name="l20846"></a><span class="lineno">20846</span>&#160;<span class="preprocessor">#ifdef DD_UNIQUE_PROFILE</span></div><div class="line"><a name="l20847"></a><span class="lineno">20847</span>&#160;unique-&gt;uniqueLookUps++;</div><div class="line"><a name="l20848"></a><span class="lineno">20848</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20849"></a><span class="lineno">20849</span>&#160;</div><div class="line"><a name="l20850"></a><span class="lineno">20850</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a>) {</div><div class="line"><a name="l20851"></a><span class="lineno">20851</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a9ea7f1aaa19f3621745b590b7dca4f26">gcEnabled</a> &amp;&amp; ((unique-&gt;<a class="code" href="structDdManager.html#a170c1cfcbbd9b83bb479fc85c177c52e">dead</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>) ||</div><div class="line"><a name="l20852"></a><span class="lineno">20852</span>&#160;(10 * unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a> &gt; 9 * unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>))) {  <span class="comment">/* too many dead */</span></div><div class="line"><a name="l20853"></a><span class="lineno">20853</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l20854"></a><span class="lineno">20854</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l20855"></a><span class="lineno">20855</span>&#160;<a class="code" href="cuddInt_8c.html#a808cc83054e0925704d498f721605926">cuddRehash</a>(unique,<a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>);</div><div class="line"><a name="l20856"></a><span class="lineno">20856</span>&#160;}</div><div class="line"><a name="l20857"></a><span class="lineno">20857</span>&#160;}</div><div class="line"><a name="l20858"></a><span class="lineno">20858</span>&#160;</div><div class="line"><a name="l20859"></a><span class="lineno">20859</span>&#160;<a class="code" href="cuddInt_8h.html#a2ff323254eb979e424f99cbe8ef593fe">cuddAdjust</a>(value); <span class="comment">/* for the case of crippled infinities */</span></div><div class="line"><a name="l20860"></a><span class="lineno">20860</span>&#160;</div><div class="line"><a name="l20861"></a><span class="lineno">20861</span>&#160;<span class="keywordflow">if</span> (<a class="code" href="cuddInt_8h.html#aa2b85051644f4b773320ab64c0eae9c2">ddAbs</a>(value) &lt; unique-&gt;<a class="code" href="structDdManager.html#ad495ea9a4104c2be5b4ca850a1da8c28">epsilon</a>) {</div><div class="line"><a name="l20862"></a><span class="lineno">20862</span>&#160;value = 0.0;</div><div class="line"><a name="l20863"></a><span class="lineno">20863</span>&#160;}</div><div class="line"><a name="l20864"></a><span class="lineno">20864</span>&#160;split.<a class="code" href="unionhack.html#a57925aea3fe6bc712a7d34f05e3c31f4">value</a> = value;</div><div class="line"><a name="l20865"></a><span class="lineno">20865</span>&#160;</div><div class="line"><a name="l20866"></a><span class="lineno">20866</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[0], split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[1], unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>);</div><div class="line"><a name="l20867"></a><span class="lineno">20867</span>&#160;nodelist = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l20868"></a><span class="lineno">20868</span>&#160;looking = nodelist[pos];</div><div class="line"><a name="l20869"></a><span class="lineno">20869</span>&#160;</div><div class="line"><a name="l20870"></a><span class="lineno">20870</span>&#160;<span class="comment">/* Here we compare values both for equality and for difference less</span></div><div class="line"><a name="l20871"></a><span class="lineno">20871</span>&#160;<span class="comment"> * than epsilon. The first comparison is required when values are</span></div><div class="line"><a name="l20872"></a><span class="lineno">20872</span>&#160;<span class="comment"> * infinite, since Infinity - Infinity is NaN and NaN &lt; X is 0 for</span></div><div class="line"><a name="l20873"></a><span class="lineno">20873</span>&#160;<span class="comment"> * every X.</span></div><div class="line"><a name="l20874"></a><span class="lineno">20874</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l20875"></a><span class="lineno">20875</span>&#160;<span class="keywordflow">while</span> (looking != NULL) {</div><div class="line"><a name="l20876"></a><span class="lineno">20876</span>&#160;<span class="keywordflow">if</span> (looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a> == value ||</div><div class="line"><a name="l20877"></a><span class="lineno">20877</span>&#160;<a class="code" href="cuddInt_8h.html#adaebebca92b84664b62c0f962d0aa3d5">ddEqualVal</a>(looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a>,value,unique-&gt;<a class="code" href="structDdManager.html#ad495ea9a4104c2be5b4ca850a1da8c28">epsilon</a>)) {</div><div class="line"><a name="l20878"></a><span class="lineno">20878</span>&#160;<span class="keywordflow">if</span> (looking-&gt;<a class="code" href="structDdNode.html#a530470565dbead9303a714e120c35b70">ref</a> == 0) {</div><div class="line"><a name="l20879"></a><span class="lineno">20879</span>&#160;<a class="code" href="cuddInt_8c.html#acc19dbda07ed77727cd149f7aeb2527b">cuddReclaim</a>(unique,looking);</div><div class="line"><a name="l20880"></a><span class="lineno">20880</span>&#160;}</div><div class="line"><a name="l20881"></a><span class="lineno">20881</span>&#160;<span class="keywordflow">return</span>(looking);</div><div class="line"><a name="l20882"></a><span class="lineno">20882</span>&#160;}</div><div class="line"><a name="l20883"></a><span class="lineno">20883</span>&#160;looking = looking-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l20884"></a><span class="lineno">20884</span>&#160;<span class="preprocessor">#ifdef DD_UNIQUE_PROFILE</span></div><div class="line"><a name="l20885"></a><span class="lineno">20885</span>&#160;unique-&gt;uniqueLinks++;</div><div class="line"><a name="l20886"></a><span class="lineno">20886</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20887"></a><span class="lineno">20887</span>&#160;}</div><div class="line"><a name="l20888"></a><span class="lineno">20888</span>&#160;</div><div class="line"><a name="l20889"></a><span class="lineno">20889</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#afaedd101dfa7b7e2cb11614647ec37b2">keys</a>++;</div><div class="line"><a name="l20890"></a><span class="lineno">20890</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>++;</div><div class="line"><a name="l20891"></a><span class="lineno">20891</span>&#160;</div><div class="line"><a name="l20892"></a><span class="lineno">20892</span>&#160;looking = <a class="code" href="cuddInt_8c.html#aeab770a8c957379ede9ec8edd1dd696a">cuddAllocNode</a>(unique);</div><div class="line"><a name="l20893"></a><span class="lineno">20893</span>&#160;<span class="keywordflow">if</span> (looking == NULL) <span class="keywordflow">return</span>(NULL);</div><div class="line"><a name="l20894"></a><span class="lineno">20894</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#abbd39b25b9abe4b4d53cd267a4103bda">index</a> = <a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>;</div><div class="line"><a name="l20895"></a><span class="lineno">20895</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a> = value;</div><div class="line"><a name="l20896"></a><span class="lineno">20896</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a> = nodelist[pos];</div><div class="line"><a name="l20897"></a><span class="lineno">20897</span>&#160;nodelist[pos] = looking;</div><div class="line"><a name="l20898"></a><span class="lineno">20898</span>&#160;</div><div class="line"><a name="l20899"></a><span class="lineno">20899</span>&#160;<span class="keywordflow">return</span>(looking);</div><div class="line"><a name="l20900"></a><span class="lineno">20900</span>&#160;</div><div class="line"><a name="l20901"></a><span class="lineno">20901</span>&#160;} <span class="comment">/* end of cuddUniqueConst */</span></div><div class="ttc" id="structDdNode_html_a530470565dbead9303a714e120c35b70"><div class="ttname"><a href="structDdNode.html#a530470565dbead9303a714e120c35b70">DdNode::ref</a></div><div class="ttdeci">DdHalfWord ref</div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00274">cudd.h:274</a></div></div>
+<div class="fragment"><div class="line"><a name="l20840"></a><span class="lineno">20840</span>&#160;{</div><div class="line"><a name="l20841"></a><span class="lineno">20841</span>&#160;<span class="keywordtype">int</span> pos;</div><div class="line"><a name="l20842"></a><span class="lineno">20842</span>&#160;<a class="code" href="structDdNode.html">DdNodePtr</a> *nodelist;</div><div class="line"><a name="l20843"></a><span class="lineno">20843</span>&#160;<a class="code" href="structDdNode.html">DdNode</a> *looking;</div><div class="line"><a name="l20844"></a><span class="lineno">20844</span>&#160;<a class="code" href="unionhack.html">hack</a> <a class="code" href="namespaceSVF_1_1SVFUtil.html#af54e70082388bbd70868250aaa0bc86b">split</a>;</div><div class="line"><a name="l20845"></a><span class="lineno">20845</span>&#160;</div><div class="line"><a name="l20846"></a><span class="lineno">20846</span>&#160;<span class="preprocessor">#ifdef DD_UNIQUE_PROFILE</span></div><div class="line"><a name="l20847"></a><span class="lineno">20847</span>&#160;unique-&gt;uniqueLookUps++;</div><div class="line"><a name="l20848"></a><span class="lineno">20848</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20849"></a><span class="lineno">20849</span>&#160;</div><div class="line"><a name="l20850"></a><span class="lineno">20850</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">maxKeys</a>) {</div><div class="line"><a name="l20851"></a><span class="lineno">20851</span>&#160;<span class="keywordflow">if</span> (unique-&gt;<a class="code" href="structDdManager.html#a9ea7f1aaa19f3621745b590b7dca4f26">gcEnabled</a> &amp;&amp; ((unique-&gt;<a class="code" href="structDdManager.html#a170c1cfcbbd9b83bb479fc85c177c52e">dead</a> &gt; unique-&gt;<a class="code" href="structDdManager.html#a6cd4e44cf6d9a86bf2f75c34c3e2254b">minDead</a>) ||</div><div class="line"><a name="l20852"></a><span class="lineno">20852</span>&#160;(10 * unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a5f391dd3334a05f5e753d7df4da807bc">dead</a> &gt; 9 * unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>))) {  <span class="comment">/* too many dead */</span></div><div class="line"><a name="l20853"></a><span class="lineno">20853</span>&#160;(void) <a class="code" href="cuddInt_8c.html#a67e9deab5db86e16734a413ad199719c">cuddGarbageCollect</a>(unique,1);</div><div class="line"><a name="l20854"></a><span class="lineno">20854</span>&#160;} <span class="keywordflow">else</span> {</div><div class="line"><a name="l20855"></a><span class="lineno">20855</span>&#160;<a class="code" href="cuddInt_8c.html#a808cc83054e0925704d498f721605926">cuddRehash</a>(unique,<a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>);</div><div class="line"><a name="l20856"></a><span class="lineno">20856</span>&#160;}</div><div class="line"><a name="l20857"></a><span class="lineno">20857</span>&#160;}</div><div class="line"><a name="l20858"></a><span class="lineno">20858</span>&#160;</div><div class="line"><a name="l20859"></a><span class="lineno">20859</span>&#160;<a class="code" href="cuddInt_8h.html#a2ff323254eb979e424f99cbe8ef593fe">cuddAdjust</a>(value); <span class="comment">/* for the case of crippled infinities */</span></div><div class="line"><a name="l20860"></a><span class="lineno">20860</span>&#160;</div><div class="line"><a name="l20861"></a><span class="lineno">20861</span>&#160;<span class="keywordflow">if</span> (<a class="code" href="cuddInt_8h.html#aa2b85051644f4b773320ab64c0eae9c2">ddAbs</a>(value) &lt; unique-&gt;<a class="code" href="structDdManager.html#ad495ea9a4104c2be5b4ca850a1da8c28">epsilon</a>) {</div><div class="line"><a name="l20862"></a><span class="lineno">20862</span>&#160;value = 0.0;</div><div class="line"><a name="l20863"></a><span class="lineno">20863</span>&#160;}</div><div class="line"><a name="l20864"></a><span class="lineno">20864</span>&#160;split.<a class="code" href="unionhack.html#a57925aea3fe6bc712a7d34f05e3c31f4">value</a> = value;</div><div class="line"><a name="l20865"></a><span class="lineno">20865</span>&#160;</div><div class="line"><a name="l20866"></a><span class="lineno">20866</span>&#160;pos = <a class="code" href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a>(split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[0], split.<a class="code" href="unionhack.html#ac9f31214d556c4a179ba01f23036bc91">bits</a>[1], unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#ae89bb40a595ce1eda70d63fd78b23865">shift</a>);</div><div class="line"><a name="l20867"></a><span class="lineno">20867</span>&#160;nodelist = unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">nodelist</a>;</div><div class="line"><a name="l20868"></a><span class="lineno">20868</span>&#160;looking = nodelist[pos];</div><div class="line"><a name="l20869"></a><span class="lineno">20869</span>&#160;</div><div class="line"><a name="l20870"></a><span class="lineno">20870</span>&#160;<span class="comment">/* Here we compare values both for equality and for difference less</span></div><div class="line"><a name="l20871"></a><span class="lineno">20871</span>&#160;<span class="comment"> * than epsilon. The first comparison is required when values are</span></div><div class="line"><a name="l20872"></a><span class="lineno">20872</span>&#160;<span class="comment"> * infinite, since Infinity - Infinity is NaN and NaN &lt; X is 0 for</span></div><div class="line"><a name="l20873"></a><span class="lineno">20873</span>&#160;<span class="comment"> * every X.</span></div><div class="line"><a name="l20874"></a><span class="lineno">20874</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l20875"></a><span class="lineno">20875</span>&#160;<span class="keywordflow">while</span> (looking != NULL) {</div><div class="line"><a name="l20876"></a><span class="lineno">20876</span>&#160;<span class="keywordflow">if</span> (looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a> == value ||</div><div class="line"><a name="l20877"></a><span class="lineno">20877</span>&#160;<a class="code" href="cuddInt_8h.html#adaebebca92b84664b62c0f962d0aa3d5">ddEqualVal</a>(looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a>,value,unique-&gt;<a class="code" href="structDdManager.html#ad495ea9a4104c2be5b4ca850a1da8c28">epsilon</a>)) {</div><div class="line"><a name="l20878"></a><span class="lineno">20878</span>&#160;<span class="keywordflow">if</span> (looking-&gt;<a class="code" href="structDdNode.html#a530470565dbead9303a714e120c35b70">ref</a> == 0) {</div><div class="line"><a name="l20879"></a><span class="lineno">20879</span>&#160;<a class="code" href="cuddInt_8c.html#acc19dbda07ed77727cd149f7aeb2527b">cuddReclaim</a>(unique,looking);</div><div class="line"><a name="l20880"></a><span class="lineno">20880</span>&#160;}</div><div class="line"><a name="l20881"></a><span class="lineno">20881</span>&#160;<span class="keywordflow">return</span>(looking);</div><div class="line"><a name="l20882"></a><span class="lineno">20882</span>&#160;}</div><div class="line"><a name="l20883"></a><span class="lineno">20883</span>&#160;looking = looking-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a>;</div><div class="line"><a name="l20884"></a><span class="lineno">20884</span>&#160;<span class="preprocessor">#ifdef DD_UNIQUE_PROFILE</span></div><div class="line"><a name="l20885"></a><span class="lineno">20885</span>&#160;unique-&gt;uniqueLinks++;</div><div class="line"><a name="l20886"></a><span class="lineno">20886</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l20887"></a><span class="lineno">20887</span>&#160;}</div><div class="line"><a name="l20888"></a><span class="lineno">20888</span>&#160;</div><div class="line"><a name="l20889"></a><span class="lineno">20889</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#afaedd101dfa7b7e2cb11614647ec37b2">keys</a>++;</div><div class="line"><a name="l20890"></a><span class="lineno">20890</span>&#160;unique-&gt;<a class="code" href="structDdManager.html#aa8d293b6a4f69f6b4795e2fc24ede216">constants</a>.<a class="code" href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">keys</a>++;</div><div class="line"><a name="l20891"></a><span class="lineno">20891</span>&#160;</div><div class="line"><a name="l20892"></a><span class="lineno">20892</span>&#160;looking = <a class="code" href="cuddInt_8c.html#aeab770a8c957379ede9ec8edd1dd696a">cuddAllocNode</a>(unique);</div><div class="line"><a name="l20893"></a><span class="lineno">20893</span>&#160;<span class="keywordflow">if</span> (looking == NULL) <span class="keywordflow">return</span>(NULL);</div><div class="line"><a name="l20894"></a><span class="lineno">20894</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#abbd39b25b9abe4b4d53cd267a4103bda">index</a> = <a class="code" href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a>;</div><div class="line"><a name="l20895"></a><span class="lineno">20895</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#ac7e82d45498ac66d16e74db9a7971d9b">type</a>.<a class="code" href="structDdNode.html#a4daed26b440c68f410d46eb180a55abb">value</a> = value;</div><div class="line"><a name="l20896"></a><span class="lineno">20896</span>&#160;looking-&gt;<a class="code" href="structDdNode.html#a9422352d3b46de31b325d1cf18b9f25f">next</a> = nodelist[pos];</div><div class="line"><a name="l20897"></a><span class="lineno">20897</span>&#160;nodelist[pos] = looking;</div><div class="line"><a name="l20898"></a><span class="lineno">20898</span>&#160;</div><div class="line"><a name="l20899"></a><span class="lineno">20899</span>&#160;<span class="keywordflow">return</span>(looking);</div><div class="line"><a name="l20900"></a><span class="lineno">20900</span>&#160;</div><div class="line"><a name="l20901"></a><span class="lineno">20901</span>&#160;} <span class="comment">/* end of cuddUniqueConst */</span></div><div class="ttc" id="structDdNode_html_a530470565dbead9303a714e120c35b70"><div class="ttname"><a href="structDdNode.html#a530470565dbead9303a714e120c35b70">DdNode::ref</a></div><div class="ttdeci">DdHalfWord ref</div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00274">cudd.h:274</a></div></div>
 <div class="ttc" id="structDdSubtable_html_aca2eea345c00c69090e701ffacff7de4"><div class="ttname"><a href="structDdSubtable.html#aca2eea345c00c69090e701ffacff7de4">DdSubtable::keys</a></div><div class="ttdeci">unsigned int keys</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00327">cuddInt.h:327</a></div></div>
 <div class="ttc" id="cuddInt_8c_html_aeab770a8c957379ede9ec8edd1dd696a"><div class="ttname"><a href="cuddInt_8c.html#aeab770a8c957379ede9ec8edd1dd696a">cuddAllocNode</a></div><div class="ttdeci">DdNode * cuddAllocNode(DdManager *unique)</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8c_source.html#l19624">cuddInt.c:19624</a></div></div>
 <div class="ttc" id="cuddInt_8h_html_a04555d27c114939b7c4a37be638b7968"><div class="ttname"><a href="cuddInt_8h.html#a04555d27c114939b7c4a37be638b7968">ddHash</a></div><div class="ttdeci">#define ddHash(f, g, s)</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00713">cuddInt.h:713</a></div></div>
@@ -12701,6 +12702,7 @@ Repeat 1-4 until no further improvement. </li>
 <div class="ttc" id="cuddInt_8h_html_aa2b85051644f4b773320ab64c0eae9c2"><div class="ttname"><a href="cuddInt_8h.html#aa2b85051644f4b773320ab64c0eae9c2">ddAbs</a></div><div class="ttdeci">#define ddAbs(x)</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00816">cuddInt.h:816</a></div></div>
 <div class="ttc" id="structDdSubtable_html_a2997673187c40bc7d7977a2581581420"><div class="ttname"><a href="structDdSubtable.html#a2997673187c40bc7d7977a2581581420">DdSubtable::maxKeys</a></div><div class="ttdeci">unsigned int maxKeys</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00328">cuddInt.h:328</a></div></div>
 <div class="ttc" id="structDdManager_html_a9ea7f1aaa19f3621745b590b7dca4f26"><div class="ttname"><a href="structDdManager.html#a9ea7f1aaa19f3621745b590b7dca4f26">DdManager::gcEnabled</a></div><div class="ttdeci">int gcEnabled</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00374">cuddInt.h:374</a></div></div>
+<div class="ttc" id="namespaceSVF_1_1SVFUtil_html_af54e70082388bbd70868250aaa0bc86b"><div class="ttname"><a href="namespaceSVF_1_1SVFUtil.html#af54e70082388bbd70868250aaa0bc86b">SVF::SVFUtil::split</a></div><div class="ttdeci">std::vector&lt; std::string &gt; split(const std::string &amp;s, char seperator)</div><div class="ttdoc">Split into two substrings around the first occurrence of a separator string. </div><div class="ttdef"><b>Definition:</b> <a href="SVFUtil_8h_source.html#l00243">SVFUtil.h:243</a></div></div>
 <div class="ttc" id="cudd_8h_html_aa097684bc69c58891332b245d577b986"><div class="ttname"><a href="cudd_8h.html#aa097684bc69c58891332b245d577b986">CUDD_CONST_INDEX</a></div><div class="ttdeci">#define CUDD_CONST_INDEX</div><div class="ttdef"><b>Definition:</b> <a href="cudd_8h_source.html#l00107">cudd.h:107</a></div></div>
 <div class="ttc" id="structDdSubtable_html_a1226ea7ecfb6d6b56269cb518ac5e2d7"><div class="ttname"><a href="structDdSubtable.html#a1226ea7ecfb6d6b56269cb518ac5e2d7">DdSubtable::nodelist</a></div><div class="ttdeci">DdNode ** nodelist</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8h_source.html#l00324">cuddInt.h:324</a></div></div>
 <div class="ttc" id="unionhack_html_a57925aea3fe6bc712a7d34f05e3c31f4"><div class="ttname"><a href="unionhack.html#a57925aea3fe6bc712a7d34f05e3c31f4">hack::value</a></div><div class="ttdeci">CUDD_VALUE_TYPE value</div><div class="ttdef"><b>Definition:</b> <a href="cuddInt_8c_source.html#l19538">cuddInt.c:19538</a></div></div>