svf-tools 1.0.458 → 1.0.461

package/SVF-doxygen/html/html/cuddInt_8h.html

@@ -5726,7 +5726,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>
@@ -5752,6 +5752,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>
@@ -6581,7 +6582,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>
@@ -6598,6 +6599,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>

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

@@ -607,9 +607,6 @@ $(function() {
 <li>addModSideEffectOfFunction()
 : <a class="el" href="classSVF_1_1MRGenerator.html#a39604645ca9ba10607ada3872b14705a">SVF::MRGenerator</a>
 </li>
-<li>addMrVer()
-: <a class="el" href="classSVF_1_1IndirectSVFGEdge.html#a7ac57ccfe31b6cd6bbc6f15ed22a6531">SVF::IndirectSVFGEdge</a>
-</li>
 <li>AddMSSAPHI()
 : <a class="el" href="classSVF_1_1MemSSA.html#a606aaf7a76ca71cb32adc9af7291ae6e">SVF::MemSSA</a>
 </li>
@@ -710,7 +707,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1VFGNode.html#a99a54cf322b0eec3a1ef109ce5f2db75af866301a661c59a7aa3182c0a7fc0c92">SVF::VFGNode</a>
 </li>
 <li>AddrCGEdge()
-: <a class="el" href="classSVF_1_1AddrCGEdge.html#a131779667553499b85423e1932664252">SVF::AddrCGEdge</a>
+: <a class="el" href="classSVF_1_1AddrCGEdge.html#a9c8da69a469e51d83c5009ba2685bcf6">SVF::AddrCGEdge</a>
 </li>
 <li>AddrCGEdgeSet
 : <a class="el" href="classSVF_1_1ConstraintGraph.html#a5bbd6df25027d26911f5d8d6a10881dc">SVF::ConstraintGraph</a>
@@ -805,7 +802,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1ConstraintGraph.html#a633666953f8d6675961981c4eab1adb0">SVF::ConstraintGraph</a>
 </li>
 <li>AddStoreCHI()
-: <a class="el" href="classSVF_1_1MemSSA.html#a4e11797df16b0b612191607180acc0c5">SVF::MemSSA</a>
+: <a class="el" href="classSVF_1_1MemSSA.html#a8d9bfa2ad724a3b286edc56b7c15e9bf">SVF::MemSSA</a>
 </li>
 <li>addStoreEdge()
 : <a class="el" href="classSVF_1_1SVFIRBuilder.html#a30f043eeca79259d84b97e265110f018">SVF::SVFIRBuilder</a>
@@ -936,10 +933,10 @@ $(function() {
 : <a class="el" href="classSVF_1_1VFG.html#a65c88a6c20380b715ac8b6c31e68afed">SVF::VFG</a>
 </li>
 <li>addValNode()
-: <a class="el" href="classSVF_1_1SVFIR.html#a3face8a526a33d82ef7cde7602030bc9">SVF::SVFIR</a>
+: <a class="el" href="classSVF_1_1SVFIR.html#a93bc14960cdd4eb345c64e9b79757ccf">SVF::SVFIR</a>
 </li>
 <li>addVarargNode()
-: <a class="el" href="classSVF_1_1SVFIR.html#a078c01295f47bf12f1a2b8abfab8b28d">SVF::SVFIR</a>
+: <a class="el" href="classSVF_1_1SVFIR.html#a6ade5bf3edc7b6c3faafc3e5ff3d0538">SVF::SVFIR</a>
 </li>
 <li>addVariantGepCGEdge()
 : <a class="el" href="classSVF_1_1ConstraintGraph.html#a6902cabb252b1eaadb3c8220b4581a2f">SVF::ConstraintGraph</a>
@@ -976,7 +973,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1WPAPass.html#a5a71ab4d4bd993ff52da60c730d7b57f">SVF::WPAPass</a>
 </li>
 <li>alias_begin()
-: <a class="el" href="classSVF_1_1SVFModule.html#a7f2b4647c8d69c8328b63e576cb6d065">SVF::SVFModule</a>
+: <a class="el" href="classSVF_1_1SVFModule.html#a0e28f6eaf32efc6f2c0987e64f1df852">SVF::SVFModule</a>
 </li>
 <li>alias_end()
 : <a class="el" href="classSVF_1_1SVFModule.html#a1bb5c818ec63d81a238f3d242a89079f">SVF::SVFModule</a>

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

@@ -414,11 +414,13 @@ $(function() {
 </li>
 <li>cbv
 : <a class="el" href="classSVF_1_1CoreBitVector_1_1CoreBitVectorIterator.html#a0cba79551b56ed83dc45ab63619dc590">SVF::CoreBitVector::CoreBitVectorIterator</a>
-, <a class="el" href="classSVF_1_1PointsTo.html#a79333c4ae5c002d9632fa589956b3605">SVF::PointsTo</a>
 </li>
 <li>CBV
 : <a class="el" href="classSVF_1_1PointsTo.html#a8f757f92ebf0a2ebdb5e6b001606923ea0397c2678894d1792fcd3432a7aa64fb">SVF::PointsTo</a>
 </li>
+<li>cbv
+: <a class="el" href="classSVF_1_1PointsTo.html#a79333c4ae5c002d9632fa589956b3605">SVF::PointsTo</a>
+</li>
 <li>cbvIt
 : <a class="el" href="classSVF_1_1PointsTo_1_1PointsToIterator.html#a4db2c62eb3ad789ab7aaf7506cd340b2">SVF::PointsTo::PointsToIterator</a>
 </li>
@@ -1758,12 +1760,14 @@ $(function() {
 <li>CxtStmtToCxtLockS
 : <a class="el" href="classSVF_1_1LockResultValidator.html#a03954bdf28345cd7fbcd5cc242d40681">SVF::LockResultValidator</a>
 </li>
+<li>cxtStmtToCxtLockSet
+: <a class="el" href="classSVF_1_1LockAnalysis.html#ae256a84fd63947a6f81bee030bdbe7fc">SVF::LockAnalysis</a>
+</li>
 <li>CxtStmtToCxtLockSet
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a710aad28484677637367e9098a55c7d7">SVF::LockAnalysis</a>
 </li>
 <li>cxtStmtToCxtLockSet
-: <a class="el" href="classSVF_1_1LockAnalysis.html#ae256a84fd63947a6f81bee030bdbe7fc">SVF::LockAnalysis</a>
-, <a class="el" href="classSVF_1_1LockResultValidator.html#ad8a03181445edeb835fed08c88f6e0bb">SVF::LockResultValidator</a>
+: <a class="el" href="classSVF_1_1LockResultValidator.html#ad8a03181445edeb835fed08c88f6e0bb">SVF::LockResultValidator</a>
 </li>
 <li>CxtStmtToLockFlagMap
 : <a class="el" href="classSVF_1_1LockAnalysis.html#a451d9b41fd048e11615ea47872f614c9">SVF::LockAnalysis</a>
@@ -1782,7 +1786,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1CxtThread.html#ac6af46ba08bbad4454358298fd2557d3">SVF::CxtThread</a>
 </li>
 <li>CxtThreadProc()
-: <a class="el" href="classSVF_1_1CxtThreadProc.html#acce14996e41ae55ae8e27b29408ef7c8">SVF::CxtThreadProc</a>
+: <a class="el" href="classSVF_1_1CxtThreadProc.html#a1c7dd7740266a07d354df537a9167bcc">SVF::CxtThreadProc</a>
 </li>
 <li>CxtThreadProcSet
 : <a class="el" href="classSVF_1_1TCT.html#a09493a428c0ebe7f67847b48f0481f40">SVF::TCT</a>
@@ -1791,7 +1795,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1TCT.html#a23df579f18d4ea4b0f47272091ddc43e">SVF::TCT</a>
 </li>
 <li>CxtThreadStmt()
-: <a class="el" href="classSVF_1_1CxtThreadStmt.html#ab5487e3f330bb18685281c5effcecfbb">SVF::CxtThreadStmt</a>
+: <a class="el" href="classSVF_1_1CxtThreadStmt.html#adeef75dbfd24665521931780c70aa5f9">SVF::CxtThreadStmt</a>
 </li>
 <li>CxtThreadStmtSet
 : <a class="el" href="classSVF_1_1MHP.html#a28031502c4f8f0d4012c0827c57efb32">SVF::MHP</a>

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

@@ -540,11 +540,13 @@ $(function() {
 </li>
 <li>FunToLoopInfoMap
 : <a class="el" href="classSVF_1_1MTA.html#a2473be56f2861ad101f65a65e02dff8d">SVF::MTA</a>
-, <a class="el" href="classSVF_1_1PTACFInfoBuilder.html#ad76c187197c73fad8dd0c8bdb57b10f7">SVF::PTACFInfoBuilder</a>
 </li>
 <li>funToLoopInfoMap
 : <a class="el" href="classSVF_1_1PTACFInfoBuilder.html#a155db92ff5057abcb929c0ca8e8bee89">SVF::PTACFInfoBuilder</a>
 </li>
+<li>FunToLoopInfoMap
+: <a class="el" href="classSVF_1_1PTACFInfoBuilder.html#ad76c187197c73fad8dd0c8bdb57b10f7">SVF::PTACFInfoBuilder</a>
+</li>
 <li>funToModsMap
 : <a class="el" href="classSVF_1_1MRGenerator.html#a2c94bfa19ad8d1d6360b12693c8b891d">SVF::MRGenerator</a>
 </li>
@@ -584,12 +586,12 @@ $(function() {
 <li>FunToRetMap
 : <a class="el" href="classSVF_1_1SVFIR.html#ae34e5ff2f065ad752c248337d625b2e3">SVF::SVFIR</a>
 </li>
-<li>FunToReturnMuSetMap
-: <a class="el" href="classSVF_1_1MemSSA.html#a3cfc6d7134f98e5876c16c6c043a3d92">SVF::MemSSA</a>
-</li>
 <li>funToReturnMuSetMap
 : <a class="el" href="classSVF_1_1MemSSA.html#abae2396bf8a37a22be9365d368fe455c">SVF::MemSSA</a>
 </li>
+<li>FunToReturnMuSetMap
+: <a class="el" href="classSVF_1_1MemSSA.html#a3cfc6d7134f98e5876c16c6c043a3d92">SVF::MemSSA</a>
+</li>
 <li>FunToSEMap
 : <a class="el" href="classSVF_1_1MTA.html#a2c92809f1395aa064c80aef0c3e4c944">SVF::MTA</a>
 </li>

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

@@ -556,9 +556,6 @@ $(function() {
 <li>addModSideEffectOfFunction()
 : <a class="el" href="classSVF_1_1MRGenerator.html#a39604645ca9ba10607ada3872b14705a">SVF::MRGenerator</a>
 </li>
-<li>addMrVer()
-: <a class="el" href="classSVF_1_1IndirectSVFGEdge.html#a7ac57ccfe31b6cd6bbc6f15ed22a6531">SVF::IndirectSVFGEdge</a>
-</li>
 <li>AddMSSAPHI()
 : <a class="el" href="classSVF_1_1MemSSA.html#a606aaf7a76ca71cb32adc9af7291ae6e">SVF::MemSSA</a>
 </li>
@@ -649,7 +646,7 @@ $(function() {
 , <a class="el" href="classSVF_1_1PersistentDFPTData.html#a95df7d565ba8e990b61b1c932c8d4273">SVF::PersistentDFPTData&lt; Key, KeySet, Data, DataSet &gt;</a>
 , <a class="el" href="classSVF_1_1PersistentDiffPTData.html#a9f748619f67f3ff9c4c4a429e6614989">SVF::PersistentDiffPTData&lt; Key, KeySet, Data, DataSet &gt;</a>
 , <a class="el" href="classSVF_1_1PersistentPTData.html#a8d53322eadc657ed88a8b724647070b2">SVF::PersistentPTData&lt; Key, KeySet, Data, DataSet &gt;</a>
-, <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#ae4877cf4db5b1da5e7d05fe65ae8ed32">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>
+, <a class="el" href="classSVF_1_1PersistentVersionedPTData.html#a7f3730473af9218bea520ec0498fb4ac">SVF::PersistentVersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>
 , <a class="el" href="classSVF_1_1PTData.html#ac1b9dc035fb0bdf468c7d14b9f9d437a">SVF::PTData&lt; Key, KeySet, Data, DataSet &gt;</a>
 , <a class="el" href="classSVF_1_1VersionedPTData.html#ae00316730227769a39b22d3df1b6d38a">SVF::VersionedPTData&lt; Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet &gt;</a>
 </li>
@@ -683,7 +680,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1SVFG.html#a8ebf0e285c69db8332a1f8914d6190f6">SVF::SVFG</a>
 </li>
 <li>addRetNode()
-: <a class="el" href="classSVF_1_1SVFIR.html#a38f6d0c7db935fd4e556761f96f1fa09">SVF::SVFIR</a>
+: <a class="el" href="classSVF_1_1SVFIR.html#a1f63adcd679596996ee2eabf0179462f">SVF::SVFIR</a>
 </li>
 <li>addRetPE()
 : <a class="el" href="classSVF_1_1FormalRetVFGNode.html#a051f7dc0da465d7ce0dc733d9a8fae6a">SVF::FormalRetVFGNode</a>
@@ -694,10 +691,10 @@ $(function() {
 : <a class="el" href="classSVF_1_1MutablePTData.html#ad3175d9c02d8a9f6ad1752ccf3e468cb">SVF::MutablePTData&lt; Key, KeySet, Data, DataSet &gt;</a>
 </li>
 <li>AddrStmt()
-: <a class="el" href="classSVF_1_1AddrStmt.html#a42caa75acb42ce8e290c1278622f139c">SVF::AddrStmt</a>
+: <a class="el" href="classSVF_1_1AddrStmt.html#a0fa28f3a081cd6d32801ab245b6e95ae">SVF::AddrStmt</a>
 </li>
 <li>AddrVFGNode()
-: <a class="el" href="classSVF_1_1AddrVFGNode.html#ae83e51310f51cfb9cd7e2bb2002d758a">SVF::AddrVFGNode</a>
+: <a class="el" href="classSVF_1_1AddrVFGNode.html#ad44d3d2b21708a472469b08450114f2c">SVF::AddrVFGNode</a>
 </li>
 <li>addSccCandidate()
 : <a class="el" href="classSVF_1_1AndersenSCD.html#ad8530ce52f87c4ea94cac579288e2689">SVF::AndersenSCD</a>
@@ -734,7 +731,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1ConstraintGraph.html#a633666953f8d6675961981c4eab1adb0">SVF::ConstraintGraph</a>
 </li>
 <li>AddStoreCHI()
-: <a class="el" href="classSVF_1_1MemSSA.html#a8d9bfa2ad724a3b286edc56b7c15e9bf">SVF::MemSSA</a>
+: <a class="el" href="classSVF_1_1MemSSA.html#a4e11797df16b0b612191607180acc0c5">SVF::MemSSA</a>
 </li>
 <li>addStoreEdge()
 : <a class="el" href="classSVF_1_1SVFIRBuilder.html#a30f043eeca79259d84b97e265110f018">SVF::SVFIRBuilder</a>
@@ -859,7 +856,7 @@ $(function() {
 : <a class="el" href="classSVF_1_1VFG.html#a65c88a6c20380b715ac8b6c31e68afed">SVF::VFG</a>
 </li>
 <li>addValNode()
-: <a class="el" href="classSVF_1_1SVFIR.html#a3face8a526a33d82ef7cde7602030bc9">SVF::SVFIR</a>
+: <a class="el" href="classSVF_1_1SVFIR.html#a93bc14960cdd4eb345c64e9b79757ccf">SVF::SVFIR</a>
 </li>
 <li>addVarargNode()
 : <a class="el" href="classSVF_1_1SVFIR.html#a078c01295f47bf12f1a2b8abfab8b28d">SVF::SVFIR</a>
@@ -891,18 +888,18 @@ $(function() {
 </li>
 <li>alias()
 : <a class="el" href="classSVF_1_1BVDataPTAImpl.html#a25720f154731a8c745da10aa76ab8517">SVF::BVDataPTAImpl</a>
-, <a class="el" href="classSVF_1_1CFLAlias.html#a0575c3badff6a158a6043e3e940af507">SVF::CFLAlias</a>
-, <a class="el" href="classSVF_1_1CondPTAImpl.html#a171918ada9b679b0114b27476caa5ee6">SVF::CondPTAImpl&lt; Cond &gt;</a>
+, <a class="el" href="classSVF_1_1CFLAlias.html#afb96040a903b9b889fcf23b26cb4565a">SVF::CFLAlias</a>
+, <a class="el" href="classSVF_1_1CondPTAImpl.html#adb1ed3728d53a13c94402392155e9913">SVF::CondPTAImpl&lt; Cond &gt;</a>
 , <a class="el" href="classSVF_1_1DDAPass.html#a96de481dd2af7b39428aff38158c1d4e">SVF::DDAPass</a>
 , <a class="el" href="classSVF_1_1LockAnalysis.html#a4424f27444c12dce8071c56a95c664bf">SVF::LockAnalysis</a>
 , <a class="el" href="classSVF_1_1PointerAnalysis.html#a6c01f259ad2379a422d7106ce0255eb8">SVF::PointerAnalysis</a>
 , <a class="el" href="classSVF_1_1WPAPass.html#a5a71ab4d4bd993ff52da60c730d7b57f">SVF::WPAPass</a>
 </li>
 <li>alias_begin()
-: <a class="el" href="classSVF_1_1SVFModule.html#a0e28f6eaf32efc6f2c0987e64f1df852">SVF::SVFModule</a>
+: <a class="el" href="classSVF_1_1SVFModule.html#a7f2b4647c8d69c8328b63e576cb6d065">SVF::SVFModule</a>
 </li>
 <li>alias_end()
-: <a class="el" href="classSVF_1_1SVFModule.html#a1bb5c818ec63d81a238f3d242a89079f">SVF::SVFModule</a>
+: <a class="el" href="classSVF_1_1SVFModule.html#a3cfd0983849950099d1e8f8e0fda42bc">SVF::SVFModule</a>
 </li>
 <li>AliasDDAClient()
 : <a class="el" href="classSVF_1_1AliasDDAClient.html#af55b1ccfa6cfaa6ec079b19d62288cb6">SVF::AliasDDAClient</a>