svf-tools 1.0.306 → 1.0.310

package/SVF-doxygen/html/html/structstd_1_1hash_3_01std_1_1vector_3_01T_01_4_01_4.html

@@ -82,7 +82,7 @@ Public Member Functions</h2></td></tr>
 struct std::hash&lt; std::vector&lt; T &gt; &gt;</h3>
 
 
-<p class="definition">Definition at line <a class="el" href="SVFBasicTypes_8h_source.html#l00305">305</a> of file <a class="el" href="SVFBasicTypes_8h_source.html">SVFBasicTypes.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="SVFBasicTypes_8h_source.html#l00307">307</a> of file <a class="el" href="SVFBasicTypes_8h_source.html">SVFBasicTypes.h</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a921ca626d87c3eed7b71210cfc24d0dd"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a921ca626d87c3eed7b71210cfc24d0dd">&#9670;&nbsp;</a></span>operator()()</h2>
@@ -110,8 +110,8 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="SVFBasicTypes_8h_source.html#l00307">307</a> of file <a class="el" href="SVFBasicTypes_8h_source.html">SVFBasicTypes.h</a>.</p>
-<div class="fragment"><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;                                                   {</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;        <span class="comment">// TODO: repetition with CBV.</span></div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;        <span class="keywordtype">size_t</span> h = v.size();</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <a class="code" href="structSVF_1_1Hash.html">SVF::Hash&lt;T&gt;</a> hf;</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="keywordflow">for</span> (<span class="keyword">const</span> T &amp;t : v)</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;        {</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;            h ^= hf(t) + 0x9e3779b9 + (h &lt;&lt; 6) + (h &gt;&gt; 2);</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        }</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keywordflow">return</span> h;</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;    }</div><div class="ttc" id="structSVF_1_1Hash_html"><div class="ttname"><a href="structSVF_1_1Hash.html">SVF::Hash</a></div><div class="ttdoc">provide extra hash function for std::pair handling </div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00052">SVFBasicTypes.h:52</a></div></div>
+<p class="definition">Definition at line <a class="el" href="SVFBasicTypes_8h_source.html#l00309">309</a> of file <a class="el" href="SVFBasicTypes_8h_source.html">SVFBasicTypes.h</a>.</p>
+<div class="fragment"><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;                                                   {</div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        <span class="comment">// TODO: repetition with CBV.</span></div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;        <span class="keywordtype">size_t</span> h = v.size();</div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;        <a class="code" href="structSVF_1_1Hash.html">SVF::Hash&lt;T&gt;</a> hf;</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;        <span class="keywordflow">for</span> (<span class="keyword">const</span> T &amp;t : v)</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        {</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;            h ^= hf(t) + 0x9e3779b9 + (h &lt;&lt; 6) + (h &gt;&gt; 2);</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        }</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;</div><div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        <span class="keywordflow">return</span> h;</div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;    }</div><div class="ttc" id="structSVF_1_1Hash_html"><div class="ttname"><a href="structSVF_1_1Hash.html">SVF::Hash</a></div><div class="ttdoc">provide extra hash function for std::pair handling </div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00052">SVFBasicTypes.h:52</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>

package/SVF-doxygen/html/html/tools_2DDA_2CMakeLists_8txt.html

@@ -67,7 +67,7 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a7686df215f6da6fdcfa2c20950c96939"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2DDA_2CMakeLists_8txt.html#a7686df215f6da6fdcfa2c20950c96939">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="lib_2CUDD_2CMakeLists_8txt.html#a97d8d30dc013aa2acba4c146fdcb1acf">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(dvf dda.cpp) else() add_executable(dvf dda.cpp) target_link_libraries(dvf Svf Cudd $</td></tr>
+<tr class="memitem:a7686df215f6da6fdcfa2c20950c96939"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2DDA_2CMakeLists_8txt.html#a7686df215f6da6fdcfa2c20950c96939">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="tools_2WPA_2CMakeLists_8txt.html#ae7f9c126d87731a942268db0cad0ac75">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(dvf dda.cpp) else() add_executable(dvf dda.cpp) target_link_libraries(dvf Svf Cudd $</td></tr>
 <tr class="separator:a7686df215f6da6fdcfa2c20950c96939"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <h2 class="groupheader">Function Documentation</h2>

package/SVF-doxygen/html/html/tools_2Example_2CMakeLists_8txt.html

@@ -67,7 +67,7 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a99a811bf6e0c9c244f0663f312a3ee41"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2Example_2CMakeLists_8txt.html#a99a811bf6e0c9c244f0663f312a3ee41">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="lib_2CUDD_2CMakeLists_8txt.html#a97d8d30dc013aa2acba4c146fdcb1acf">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(svf-ex svf-ex.cpp) else() add_executable(svf-ex svf-ex.cpp) target_link_libraries(svf-ex Svf Cudd $</td></tr>
+<tr class="memitem:a99a811bf6e0c9c244f0663f312a3ee41"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2Example_2CMakeLists_8txt.html#a99a811bf6e0c9c244f0663f312a3ee41">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="tools_2WPA_2CMakeLists_8txt.html#ae7f9c126d87731a942268db0cad0ac75">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(svf-ex svf-ex.cpp) else() add_executable(svf-ex svf-ex.cpp) target_link_libraries(svf-ex Svf Cudd $</td></tr>
 <tr class="separator:a99a811bf6e0c9c244f0663f312a3ee41"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <h2 class="groupheader">Function Documentation</h2>

package/SVF-doxygen/html/html/tools_2MTA_2CMakeLists_8txt.html

@@ -67,7 +67,7 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a4bd9f4b25fec671a4e18608050c47e87"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2MTA_2CMakeLists_8txt.html#a4bd9f4b25fec671a4e18608050c47e87">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="lib_2CUDD_2CMakeLists_8txt.html#a97d8d30dc013aa2acba4c146fdcb1acf">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(mta mta.cpp) else() add_executable(mta mta.cpp) target_link_libraries(mta Svf Cudd $</td></tr>
+<tr class="memitem:a4bd9f4b25fec671a4e18608050c47e87"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2MTA_2CMakeLists_8txt.html#a4bd9f4b25fec671a4e18608050c47e87">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="tools_2WPA_2CMakeLists_8txt.html#ae7f9c126d87731a942268db0cad0ac75">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(mta mta.cpp) else() add_executable(mta mta.cpp) target_link_libraries(mta Svf Cudd $</td></tr>
 <tr class="separator:a4bd9f4b25fec671a4e18608050c47e87"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <h2 class="groupheader">Function Documentation</h2>

package/SVF-doxygen/html/html/tools_2SABER_2CMakeLists_8txt.html

@@ -67,7 +67,7 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a8090d680f76934d4cad048ea01b7fe8e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2SABER_2CMakeLists_8txt.html#a8090d680f76934d4cad048ea01b7fe8e">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="lib_2CUDD_2CMakeLists_8txt.html#a97d8d30dc013aa2acba4c146fdcb1acf">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(saber saber.cpp) else() add_executable(saber saber.cpp) target_link_libraries(saber Svf Cudd $</td></tr>
+<tr class="memitem:a8090d680f76934d4cad048ea01b7fe8e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2SABER_2CMakeLists_8txt.html#a8090d680f76934d4cad048ea01b7fe8e">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="tools_2WPA_2CMakeLists_8txt.html#ae7f9c126d87731a942268db0cad0ac75">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(saber saber.cpp) else() add_executable(saber saber.cpp) target_link_libraries(saber Svf Cudd $</td></tr>
 <tr class="separator:a8090d680f76934d4cad048ea01b7fe8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <h2 class="groupheader">Function Documentation</h2>

package/SVF-doxygen/html/html/tools_2WPA_2CMakeLists_8txt.html

@@ -67,28 +67,28 @@ $(function() {
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a8f8a16342f9f4e608e8173ec0d0d7e0b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2WPA_2CMakeLists_8txt.html#a8f8a16342f9f4e608e8173ec0d0d7e0b">if</a> (DEFINED IN_SOURCE_BUILD) <a class="el" href="lib_2CUDD_2CMakeLists_8txt.html#a97d8d30dc013aa2acba4c146fdcb1acf">set</a>(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(wpa wpa.cpp) else() add_executable(wpa wpa.cpp) target_link_libraries(wpa Svf Cudd $</td></tr>
-<tr class="separator:a8f8a16342f9f4e608e8173ec0d0d7e0b"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ae7f9c126d87731a942268db0cad0ac75"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="tools_2WPA_2CMakeLists_8txt.html#ae7f9c126d87731a942268db0cad0ac75">set</a> (THREADS_PREFER_PTHREAD_FLAG ON) find_package(Threads REQUIRED) <a class="el" href="tools_2SABER_2CMakeLists_8txt.html#a8090d680f76934d4cad048ea01b7fe8e">if</a>(DEFINED IN_SOURCE_BUILD) set(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd) add_llvm_tool(wpa wpa.cpp) else() add_executable(wpa wpa.cpp) target_link_libraries(wpa Svf Cudd $</td></tr>
+<tr class="separator:ae7f9c126d87731a942268db0cad0ac75"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <h2 class="groupheader">Function Documentation</h2>
-<a id="a8f8a16342f9f4e608e8173ec0d0d7e0b"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a8f8a16342f9f4e608e8173ec0d0d7e0b">&#9670;&nbsp;</a></span>if()</h2>
+<a id="ae7f9c126d87731a942268db0cad0ac75"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae7f9c126d87731a942268db0cad0ac75">&#9670;&nbsp;</a></span>set()</h2>
 
 <div class="memitem">
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname">if </td>
+          <td class="memname">set </td>
           <td>(</td>
-          <td class="paramtype">DEFINED&#160;</td>
-          <td class="paramname"><em>IN_SOURCE_BUILD</em></td><td>)</td>
+          <td class="paramtype">THREADS_PREFER_PTHREAD_FLAG&#160;</td>
+          <td class="paramname"><em>ON</em></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 
-<p class="definition">Definition at line <a class="el" href="tools_2WPA_2CMakeLists_8txt_source.html#l00002">2</a> of file <a class="el" href="tools_2WPA_2CMakeLists_8txt_source.html">CMakeLists.txt</a>.</p>
-<div class="fragment"><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;                                         {llvm_libs} )</div></div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="tools_2WPA_2CMakeLists_8txt_source.html#l00001">1</a> of file <a class="el" href="tools_2WPA_2CMakeLists_8txt_source.html">CMakeLists.txt</a>.</p>
+<div class="fragment"><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;                                         {llvm_libs} Threads::Threads )</div></div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->

package/include/MemoryModel/PersistentPointsToCache.h

@@ -138,7 +138,7 @@ public:
             if (lhs != result)
             {
                 unionCache[std::minmax(lhs, result)] = result;
-                ++propertyUnions;
+                ++preemptiveUnions;
                 ++totalUnions;
             }
 
@@ -146,7 +146,7 @@ public:
             if (rhs != result)
             {
                 unionCache[std::minmax(rhs, result)] = result;
-                ++propertyUnions;
+                ++preemptiveUnions;
                 ++totalUnions;
             }
         } else ++lookupUnions;
@@ -195,17 +195,17 @@ public:
             {
                 // result AND rhs = EMPTY_SET,
                 intersectionCache[std::minmax(result, rhs)] = emptyPointsToId();
-                ++propertyIntersections;
+                ++preemptiveIntersections;
                 ++totalIntersections;
 
                 // and result AND lhs = result,
                 intersectionCache[std::minmax(result, lhs)] = result;
-                ++propertyIntersections;
+                ++preemptiveIntersections;
                 ++totalIntersections;
 
                 // and result - rhs = result.
                 complementCache[std::make_pair(result, rhs)] = result;
-                ++propertyComplements;
+                ++preemptiveComplements;
                 ++totalComplements;
             }
         } else ++lookupComplements;
@@ -252,7 +252,7 @@ public:
                 if (result != rhs)
                 {
                     intersectionCache[std::minmax(result, rhs)] = result;
-                    ++propertyIntersections;
+                    ++preemptiveIntersections;
                     ++totalIntersections;
                 }
 
@@ -260,7 +260,7 @@ public:
                 if (result != lhs)
                 {
                     intersectionCache[std::minmax(result, lhs)] = result;
-                    ++propertyIntersections;
+                    ++preemptiveIntersections;
                     ++totalIntersections;
                 }
 
@@ -269,7 +269,7 @@ public:
                 if (result != emptyPointsToId() && result != lhs)
                 {
                     unionCache[std::minmax(lhs, result)] = lhs;
-                    ++propertyUnions;
+                    ++preemptiveUnions;
                     ++totalUnions;
                 }
 
@@ -277,7 +277,7 @@ public:
                 if (result != emptyPointsToId() && result != rhs)
                 {
                     unionCache[std::minmax(rhs, result)] = rhs;
-                    ++propertyUnions;
+                    ++preemptiveUnions;
                     ++totalUnions;
                 }
             }
@@ -294,22 +294,25 @@ public:
 
         std::cout << "****Persistent Points-To Cache Statistics: " << subtitle << "****\n";
 
-        std::cout << std::setw(fieldWidth) << "UniquePointsToSets"    << idToPts.size()        << "\n";
+        std::cout << std::setw(fieldWidth) << "UniquePointsToSets"      << idToPts.size()          << "\n";
 
-        std::cout << std::setw(fieldWidth) << "TotalUnions"           << totalUnions           << "\n";
-        std::cout << std::setw(fieldWidth) << "PropertyUnions"        << propertyUnions        << "\n";
-        std::cout << std::setw(fieldWidth) << "UniqueUnions"          << uniqueUnions          << "\n";
-        std::cout << std::setw(fieldWidth) << "LookupUnions"          << lookupUnions          << "\n";
+        std::cout << std::setw(fieldWidth) << "TotalUnions"             << totalUnions             << "\n";
+        std::cout << std::setw(fieldWidth) << "PropertyUnions"          << propertyUnions          << "\n";
+        std::cout << std::setw(fieldWidth) << "UniqueUnions"            << uniqueUnions            << "\n";
+        std::cout << std::setw(fieldWidth) << "LookupUnions"            << lookupUnions            << "\n";
+        std::cout << std::setw(fieldWidth) << "PreemptiveUnions"        << preemptiveUnions        << "\n";
 
-        std::cout << std::setw(fieldWidth) << "TotalComplements"      << totalComplements      << "\n";
-        std::cout << std::setw(fieldWidth) << "PropertyComplements"   << propertyComplements   << "\n";
-        std::cout << std::setw(fieldWidth) << "UniqueComplements"     << uniqueComplements     << "\n";
-        std::cout << std::setw(fieldWidth) << "LookupComplements"     << lookupComplements     << "\n";
+        std::cout << std::setw(fieldWidth) << "TotalComplements"        << totalComplements        << "\n";
+        std::cout << std::setw(fieldWidth) << "PropertyComplements"     << propertyComplements     << "\n";
+        std::cout << std::setw(fieldWidth) << "UniqueComplements"       << uniqueComplements       << "\n";
+        std::cout << std::setw(fieldWidth) << "LookupComplements"       << lookupComplements       << "\n";
+        std::cout << std::setw(fieldWidth) << "PreemptiveComplements"   << preemptiveComplements   << "\n";
 
-        std::cout << std::setw(fieldWidth) << "TotalIntersections"    << totalIntersections    << "\n";
-        std::cout << std::setw(fieldWidth) << "PropertyIntersections" << propertyIntersections << "\n";
-        std::cout << std::setw(fieldWidth) << "UniqueIntersections"   << uniqueIntersections   << "\n";
-        std::cout << std::setw(fieldWidth) << "LookupIntersections"   << lookupIntersections   << "\n";
+        std::cout << std::setw(fieldWidth) << "TotalIntersections"      << totalIntersections      << "\n";
+        std::cout << std::setw(fieldWidth) << "PropertyIntersections"   << propertyIntersections   << "\n";
+        std::cout << std::setw(fieldWidth) << "UniqueIntersections"     << uniqueIntersections     << "\n";
+        std::cout << std::setw(fieldWidth) << "LookupIntersections"     << lookupIntersections     << "\n";
+        std::cout << std::setw(fieldWidth) << "PreemptiveIntersections" << preemptiveIntersections << "\n";
 
         std::cout.flush();
     }
@@ -379,18 +382,21 @@ private:
     inline void initStats(void)
     {
 
-        totalUnions           = 0;
-        uniqueUnions          = 0;
-        propertyUnions        = 0;
-        lookupUnions          = 0;
-        totalComplements      = 0;
-        uniqueComplements     = 0;
-        propertyComplements   = 0;
-        lookupComplements     = 0;
-        totalIntersections    = 0;
-        uniqueIntersections   = 0;
-        propertyIntersections = 0;
-        lookupIntersections   = 0;
+        totalUnions              = 0;
+        uniqueUnions             = 0;
+        propertyUnions           = 0;
+        lookupUnions             = 0;
+        preemptiveUnions         = 0;
+        totalComplements         = 0;
+        uniqueComplements        = 0;
+        propertyComplements      = 0;
+        lookupComplements        = 0;
+        preemptiveComplements    = 0;
+        totalIntersections       = 0;
+        uniqueIntersections      = 0;
+        propertyIntersections    = 0;
+        lookupIntersections      = 0;
+        preemptiveIntersections  = 0;
     }
 
 private:
@@ -418,14 +424,17 @@ private:
     u64_t uniqueUnions;
     u64_t propertyUnions;
     u64_t lookupUnions;
+    u64_t preemptiveUnions;
     u64_t totalComplements;
     u64_t uniqueComplements;
     u64_t propertyComplements;
     u64_t lookupComplements;
+    u64_t preemptiveComplements;
     u64_t totalIntersections;
     u64_t uniqueIntersections;
     u64_t propertyIntersections;
     u64_t lookupIntersections;
+    u64_t preemptiveIntersections;
 };
 
 } // End namespace SVF

package/include/MemoryModel/PointerAnalysisImpl.h

@@ -165,11 +165,7 @@ protected:
 
 
     /// Finalization of pointer analysis, and normalize points-to information to Bit Vector representation
-    virtual void finalize()
-    {
-        normalizePointsTo();
-        PointerAnalysis::finalize();
-    }
+    virtual void finalize();
 
     /// Update callgraph. This should be implemented by its subclass.
     virtual inline bool updateCallGraph(const CallSiteToFunPtrMap&)

package/include/Util/SVFBasicTypes.h

@@ -138,7 +138,9 @@ template <> struct Hash<NodePair>
         // and u64_t. If NodeID is not actually u32_t or size_t
         // is not u64_t we should be fine since we get a
         // consistent result.
-        return ((uint64_t)(p.first) << 32) | (uint64_t)(p.second);
+        uint32_t first = (uint32_t)(p.first);
+        uint32_t second = (uint32_t)(p.second);
+        return ((uint64_t)(first) << 32) | (uint64_t)(second);
     }
 };
 
@@ -266,7 +268,7 @@ template <> struct std::hash<SVF::NodePair> {
         // consistent result.
         uint32_t first = (uint32_t)(p.first);
         uint32_t second = (uint32_t)(p.second);
-        return ((uint64_t)(p.first) << 32) | (uint64_t)(p.second);
+        return ((uint64_t)(first) << 32) | (uint64_t)(second);
     }
 };
 

package/lib/MemoryModel/PointerAnalysisImpl.cpp

@@ -69,6 +69,13 @@ BVDataPTAImpl::BVDataPTAImpl(PAG* p, PointerAnalysis::PTATY type, bool alias_che
     ptaImplTy = BVDataImpl;
 }
 
+void BVDataPTAImpl::finalize()
+{
+    normalizePointsTo();
+    PointerAnalysis::finalize();
+    if (Options::ptDataBacking == PTBackingType::Persistent && Options::PStat) ptCache.printStats("bv-finalize");
+}
+
 /*!
  * Expand all fields of an aggregate in all points-to sets
  */

package/lib/MemoryModel/PointsTo.cpp

@@ -276,9 +276,9 @@ bool PointsTo::intersectWithComplement(const PointsTo &rhs)
     if (type == CBV) return cbv.intersectWithComplement(rhs.cbv);
     else if (type == SBV) return sbv.intersectWithComplement(rhs.sbv);
     else if (type == BV) return bv.intersectWithComplement(rhs.bv);
-    else {
-        assert(false && "PointsTo::intersectWithComplement(PT): unknown type");
-    }
+
+    assert(false && "PointsTo::intersectWithComplement(PT): unknown type");
+    abort();
 }
 
 void PointsTo::intersectWithComplement(const PointsTo &lhs, const PointsTo &rhs)

package/lib/Util/PTAStat.cpp

@@ -124,10 +124,9 @@ double PTAStat::getClk(bool mark) {
     {
         return CLOCK_IN_MS();
     }
-    else
-    {
-        assert(false && "PTAStat::getClk: unknown clock type");
-    }
+
+    assert(false && "PTAStat::getClk: unknown clock type");
+    abort();
 }
 
 void PTAStat::performStat()

package/lib/Util/SVFUtil.cpp

@@ -378,6 +378,7 @@ std::string SVFUtil::hclustMethodToString(hclust_fast_methods method)
         return "svf-best";
     default:
         assert(false && "SVFUtil::hclustMethodToString: unknown method");
+        abort();
     }
 }
 

package/lib/WPA/FlowSensitive.cpp

@@ -170,7 +170,7 @@ void FlowSensitive::finalize()
         }
     }
 
-    PointerAnalysis::finalize();
+    BVDataPTAImpl::finalize();
 }
 
 /*!

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.306",
+  "version": "1.0.310",
   "description": "* <b>[TypeClone](https://github.com/SVF-tools/SVF/wiki/TypeClone) published in our [ECOOP paper](https://yuleisui.github.io/publications/ecoop20.pdf) is now available in SVF </b> * <b>SVF now uses a single script for its build. Just type [`source ./build.sh`](https://github.com/SVF-tools/SVF/blob/master/build.sh) in your terminal, that's it!</b> * <b>SVF now supports LLVM-10.0.0! </b> * <b>We thank [bsauce](https://github.com/bsauce) for writing a user manual of SVF ([link1](https://www.jianshu.com/p/068a08ec749c) and [link2](https://www.jianshu.com/p/777c30d4240e)) in Chinese </b> * <b>SVF now supports LLVM-9.0.0 (Thank [Byoungyoung Lee](https://github.com/SVF-tools/SVF/issues/142) for his help!). </b> * <b>SVF now supports a set of [field-sensitive pointer analyses](https://yuleisui.github.io/publications/sas2019a.pdf). </b> * <b>[Use SVF as an external lib](https://github.com/SVF-tools/SVF/wiki/Using-SVF-as-a-lib-in-your-own-tool) for your own project (Contributed by [Hongxu Chen](https://github.com/HongxuChen)). </b> * <b>SVF now supports LLVM-7.0.0. </b> * <b>SVF now supports Docker. [Try SVF in Docker](https://github.com/SVF-tools/SVF/wiki/Try-SVF-in-Docker)! </b> * <b>SVF now supports [LLVM-6.0.0](https://github.com/svf-tools/SVF/pull/38) (Contributed by [Jack Anthony](https://github.com/jackanth)). </b> * <b>SVF now supports [LLVM-4.0.0](https://github.com/svf-tools/SVF/pull/23) (Contributed by Jared Carlson. Thank [Jared](https://github.com/jcarlson23) and [Will](https://github.com/dtzWill) for their in-depth [discussions](https://github.com/svf-tools/SVF/pull/18) about updating SVF!) </b> * <b>SVF now supports analysis for C++ programs.</b> <br />",
   "main": "index.js",
   "scripts": {

package/tools/WPA/CMakeLists.txt

@@ -1,3 +1,5 @@
+set(THREADS_PREFER_PTHREAD_FLAG ON)
+find_package(Threads REQUIRED)
 
 if(DEFINED IN_SOURCE_BUILD)
     set(LLVM_LINK_COMPONENTS BitWriter Core IPO IrReader InstCombine Instrumentation Target Linker Analysis ScalarOpts Support Svf Cudd)
@@ -5,7 +7,7 @@ if(DEFINED IN_SOURCE_BUILD)
 else()
     add_executable( wpa wpa.cpp )
 
-    target_link_libraries( wpa Svf Cudd ${llvm_libs} )
+    target_link_libraries( wpa Svf Cudd ${llvm_libs} Threads::Threads )
 
     set_target_properties( wpa PROPERTIES
                            RUNTIME_OUTPUT_DIRECTORY ${CMAKE_BINARY_DIR}/bin )