svf-tools 1.0.370 → 1.0.374
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/Dockerfile +1 -1
- package/SVF-doxygen/html/html/AndersenSFR_8cpp_source.html +3 -3
- package/SVF-doxygen/html/html/Andersen_8cpp_source.html +8 -8
- package/SVF-doxygen/html/html/Conditions_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/ConsGEdge_8h_source.html +1 -1
- package/SVF-doxygen/html/html/ConsG_8cpp_source.html +2 -2
- package/SVF-doxygen/html/html/ConsG_8h_source.html +2 -2
- package/SVF-doxygen/html/html/ContextDDA_8cpp_source.html +4 -4
- package/SVF-doxygen/html/html/DDAVFSolver_8h_source.html +6 -6
- package/SVF-doxygen/html/html/FlowDDA_8cpp_source.html +2 -2
- package/SVF-doxygen/html/html/FlowSensitiveStat_8cpp_source.html +3 -3
- package/SVF-doxygen/html/html/FlowSensitiveTBHC_8cpp_source.html +4 -4
- package/SVF-doxygen/html/html/FlowSensitive_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/Graph2Json_8cpp_source.html +4 -4
- package/SVF-doxygen/html/html/ICFGBuilder_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/ICFGEdge_8h_source.html +47 -39
- package/SVF-doxygen/html/html/ICFGNode_8h_source.html +2 -2
- package/SVF-doxygen/html/html/ICFGStat_8h_source.html +4 -4
- package/SVF-doxygen/html/html/ICFG_8cpp_source.html +19 -23
- package/SVF-doxygen/html/html/ICFG_8h_source.html +3 -3
- package/SVF-doxygen/html/html/IRAnnotator_8h_source.html +3 -3
- package/SVF-doxygen/html/html/IRGraph_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/IRGraph_8h_source.html +1 -1
- package/SVF-doxygen/html/html/LLVMUtil_8cpp_source.html +2 -2
- package/SVF-doxygen/html/html/LLVMUtil_8h.html +3 -3
- package/SVF-doxygen/html/html/LLVMUtil_8h_source.html +2 -2
- package/SVF-doxygen/html/html/LocationSet_8cpp_source.html +10 -10
- package/SVF-doxygen/html/html/LocationSet_8h_source.html +10 -11
- package/SVF-doxygen/html/html/MemRegion_8cpp_source.html +5 -5
- package/SVF-doxygen/html/html/Options_8cpp_source.html +22 -21
- package/SVF-doxygen/html/html/Options_8h_source.html +22 -21
- package/SVF-doxygen/html/html/PAGBuilderFromFile_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/PTAStat_8cpp_source.html +14 -14
- package/SVF-doxygen/html/html/PathCondAllocator_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/PointerAnalysisImpl_8cpp_source.html +5 -5
- package/SVF-doxygen/html/html/PointerAnalysis_8cpp_source.html +5 -5
- package/SVF-doxygen/html/html/PointerAnalysis_8h_source.html +5 -5
- package/SVF-doxygen/html/html/SVFG_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/SVFIRBuilder_8cpp_source.html +10 -9
- package/SVF-doxygen/html/html/SVFIRBuilder_8h_source.html +71 -72
- package/SVF-doxygen/html/html/SVFIR_8cpp_source.html +13 -13
- package/SVF-doxygen/html/html/SVFIR_8h_source.html +12 -12
- package/SVF-doxygen/html/html/SVFStatements_8h_source.html +5 -5
- package/SVF-doxygen/html/html/SVFUtil_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/SVFVariables_8h_source.html +80 -83
- package/SVF-doxygen/html/html/SaberSVFGBuilder_8cpp_source.html +2 -2
- package/SVF-doxygen/html/html/SrcSnkDDA_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/SymbolTableBuilder_8cpp_source.html +31 -29
- package/SVF-doxygen/html/html/SymbolTableBuilder_8h_source.html +7 -7
- package/SVF-doxygen/html/html/SymbolTableInfo_8cpp_source.html +54 -52
- package/SVF-doxygen/html/html/SymbolTableInfo_8h_source.html +79 -80
- package/SVF-doxygen/html/html/ThreadCallGraph_8cpp_source.html +3 -3
- package/SVF-doxygen/html/html/TypeAnalysis_8cpp_source.html +1 -1
- package/SVF-doxygen/html/html/TypeBasedHeapCloning_8cpp_source.html +13 -12
- package/SVF-doxygen/html/html/TypeBasedHeapCloning_8h_source.html +1 -1
- package/SVF-doxygen/html/html/VersionedFlowSensitiveStat_8cpp_source.html +3 -3
- package/SVF-doxygen/html/html/WPAPass_8cpp_source.html +4 -4
- package/SVF-doxygen/html/html/classSVF_1_1Andersen.html +2 -2
- package/SVF-doxygen/html/html/classSVF_1_1AndersenBase.html +7 -7
- package/SVF-doxygen/html/html/classSVF_1_1AndersenSFR.html +3 -3
- package/SVF-doxygen/html/html/classSVF_1_1BVDataPTAImpl.html +6 -7
- package/SVF-doxygen/html/html/classSVF_1_1BranchCondManager.html +2 -2
- package/SVF-doxygen/html/html/classSVF_1_1CallCFGEdge-members.html +28 -25
- package/SVF-doxygen/html/html/classSVF_1_1CallCFGEdge.html +105 -12
- package/SVF-doxygen/html/html/classSVF_1_1CallICFGNode-members.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1CallICFGNode.html +6 -6
- package/SVF-doxygen/html/html/classSVF_1_1CloneDummyObjVar.html +11 -11
- package/SVF-doxygen/html/html/classSVF_1_1CloneFIObjVar.html +11 -11
- package/SVF-doxygen/html/html/classSVF_1_1CloneGepObjVar.html +11 -11
- package/SVF-doxygen/html/html/classSVF_1_1ContextDDA.html +4 -4
- package/SVF-doxygen/html/html/classSVF_1_1DDAVFSolver.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1DummyObjVar.html +13 -13
- package/SVF-doxygen/html/html/classSVF_1_1DummyValVar.html +13 -13
- package/SVF-doxygen/html/html/classSVF_1_1FIObjVar.html +13 -13
- package/SVF-doxygen/html/html/classSVF_1_1FlowDDA.html +2 -2
- package/SVF-doxygen/html/html/classSVF_1_1FlowSensitive.html +3 -3
- package/SVF-doxygen/html/html/classSVF_1_1FlowSensitiveStat.html +3 -3
- package/SVF-doxygen/html/html/classSVF_1_1FlowSensitiveTBHC.html +10 -10
- package/SVF-doxygen/html/html/classSVF_1_1GepObjVar.html +34 -34
- package/SVF-doxygen/html/html/classSVF_1_1GepStmt.html +12 -12
- package/SVF-doxygen/html/html/classSVF_1_1GepValVar-members.html +8 -10
- package/SVF-doxygen/html/html/classSVF_1_1GepValVar.html +23 -86
- package/SVF-doxygen/html/html/classSVF_1_1ICFG.html +23 -19
- package/SVF-doxygen/html/html/classSVF_1_1ICFGBuilder.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1ICFGEdge.html +30 -30
- package/SVF-doxygen/html/html/classSVF_1_1ICFGPrinter.html +4 -4
- package/SVF-doxygen/html/html/classSVF_1_1IntraCFGEdge.html +25 -25
- package/SVF-doxygen/html/html/classSVF_1_1LocationSet-members.html +15 -16
- package/SVF-doxygen/html/html/classSVF_1_1LocationSet.html +45 -79
- package/SVF-doxygen/html/html/classSVF_1_1MRGenerator.html +6 -6
- package/SVF-doxygen/html/html/classSVF_1_1MemObj.html +87 -87
- package/SVF-doxygen/html/html/classSVF_1_1NormalGepCGEdge.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1ObjTypeInfo.html +99 -99
- package/SVF-doxygen/html/html/classSVF_1_1ObjVar.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1Options-members.html +55 -54
- package/SVF-doxygen/html/html/classSVF_1_1Options.html +47 -21
- package/SVF-doxygen/html/html/classSVF_1_1PAGBuilderFromFile.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1PTAStat.html +14 -14
- package/SVF-doxygen/html/html/classSVF_1_1PathCondAllocator.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1PointerAnalysis.html +8 -8
- package/SVF-doxygen/html/html/classSVF_1_1RetCFGEdge-members.html +23 -20
- package/SVF-doxygen/html/html/classSVF_1_1RetCFGEdge.html +110 -15
- package/SVF-doxygen/html/html/classSVF_1_1RetPN.html +13 -13
- package/SVF-doxygen/html/html/classSVF_1_1SVFIR-members.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1SVFIR.html +43 -49
- package/SVF-doxygen/html/html/classSVF_1_1SVFIRBuilder-members.html +82 -83
- package/SVF-doxygen/html/html/classSVF_1_1SVFIRBuilder.html +568 -505
- package/SVF-doxygen/html/html/classSVF_1_1SaberSVFGBuilder.html +2 -2
- package/SVF-doxygen/html/html/classSVF_1_1SrcSnkDDA.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1StInfo.html +39 -39
- package/SVF-doxygen/html/html/classSVF_1_1SymbolTableBuilder-members.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1SymbolTableBuilder.html +53 -62
- package/SVF-doxygen/html/html/classSVF_1_1SymbolTableInfo-members.html +8 -10
- package/SVF-doxygen/html/html/classSVF_1_1SymbolTableInfo.html +108 -143
- package/SVF-doxygen/html/html/classSVF_1_1ThreadCallGraph.html +3 -3
- package/SVF-doxygen/html/html/classSVF_1_1TypeAnalysis.html +1 -1
- package/SVF-doxygen/html/html/classSVF_1_1TypeBasedHeapCloning.html +16 -15
- package/SVF-doxygen/html/html/classSVF_1_1VarArgPN.html +13 -13
- package/SVF-doxygen/html/html/classSVF_1_1VersionedFlowSensitiveStat.html +3 -3
- package/SVF-doxygen/html/html/classSVF_1_1WPAPass.html +11 -11
- package/SVF-doxygen/html/html/functions_a.html +29 -27
- package/SVF-doxygen/html/html/functions_c.html +25 -22
- package/SVF-doxygen/html/html/functions_f.html +19 -22
- package/SVF-doxygen/html/html/functions_func.html +30 -28
- package/SVF-doxygen/html/html/functions_func_g.html +25 -25
- package/SVF-doxygen/html/html/functions_func_h.html +1 -1
- package/SVF-doxygen/html/html/functions_func_l.html +2 -2
- package/SVF-doxygen/html/html/functions_g.html +28 -28
- package/SVF-doxygen/html/html/functions_h.html +1 -1
- package/SVF-doxygen/html/html/functions_l.html +5 -5
- package/SVF-doxygen/html/html/functions_m.html +4 -1
- package/SVF-doxygen/html/html/functions_o.html +3 -3
- package/SVF-doxygen/html/html/functions_p.html +4 -4
- package/SVF-doxygen/html/html/functions_r.html +7 -2
- package/SVF-doxygen/html/html/functions_s.html +6 -6
- package/SVF-doxygen/html/html/functions_t.html +8 -10
- package/SVF-doxygen/html/html/functions_v.html +6 -6
- package/SVF-doxygen/html/html/functions_vars_c.html +2 -1
- package/SVF-doxygen/html/html/functions_vars_f.html +0 -3
- package/SVF-doxygen/html/html/functions_vars_m.html +3 -0
- package/SVF-doxygen/html/html/functions_vars_r.html +3 -0
- package/SVF-doxygen/html/html/namespaceSVF.html +1 -1
- package/SVF-doxygen/html/html/namespaceSVF_1_1SVFUtil.html +8 -8
- package/SVF-doxygen/html/html/namespacemembers_func.html +1 -1
- package/SVF-doxygen/html/html/namespacemembers_s.html +1 -1
- package/SVF-doxygen/html/html/search/all_1.js +20 -20
- package/SVF-doxygen/html/html/search/all_10.js +5 -5
- package/SVF-doxygen/html/html/search/all_12.js +2 -2
- package/SVF-doxygen/html/html/search/all_13.js +7 -7
- package/SVF-doxygen/html/html/search/all_14.js +6 -6
- package/SVF-doxygen/html/html/search/all_15.js +1 -1
- package/SVF-doxygen/html/html/search/all_16.js +3 -3
- package/SVF-doxygen/html/html/search/all_3.js +1 -1
- package/SVF-doxygen/html/html/search/all_6.js +0 -1
- package/SVF-doxygen/html/html/search/all_7.js +12 -11
- package/SVF-doxygen/html/html/search/all_8.js +1 -1
- package/SVF-doxygen/html/html/search/all_c.js +5 -5
- package/SVF-doxygen/html/html/search/all_d.js +4 -3
- package/SVF-doxygen/html/html/search/all_e.js +2 -2
- package/SVF-doxygen/html/html/search/all_f.js +2 -2
- package/SVF-doxygen/html/html/search/functions_0.js +20 -20
- package/SVF-doxygen/html/html/search/functions_10.js +2 -2
- package/SVF-doxygen/html/html/search/functions_6.js +12 -11
- package/SVF-doxygen/html/html/search/functions_7.js +1 -1
- package/SVF-doxygen/html/html/search/functions_a.js +1 -1
- package/SVF-doxygen/html/html/search/variables_12.js +1 -0
- package/SVF-doxygen/html/html/search/variables_14.js +2 -2
- package/SVF-doxygen/html/html/search/variables_15.js +1 -1
- package/SVF-doxygen/html/html/search/variables_3.js +1 -1
- package/SVF-doxygen/html/html/search/variables_6.js +0 -1
- package/SVF-doxygen/html/html/search/variables_d.js +2 -1
- package/SVF-doxygen/html/html/search/variables_e.js +2 -2
- package/SVF-doxygen/html/html/structllvm_1_1DOTGraphTraits_3_01ICFG_01_5_01_4.html +17 -31
- package/SVF-doxygen/html/html/structstd_1_1hash_3_01SVF_1_1LocationSet_01_4.html +4 -4
- package/SVF-doxygen/html/html/svf-ex_8cpp.html +1 -1
- package/SVF-doxygen/html/html/svf-ex_8cpp_source.html +1 -1
- package/include/Graphs/ICFGEdge.h +22 -3
- package/include/Graphs/ICFGNode.h +1 -1
- package/include/MemoryModel/LocationSet.h +0 -6
- package/include/MemoryModel/SVFIR.h +1 -1
- package/include/MemoryModel/SVFStatements.h +1 -1
- package/include/MemoryModel/SVFVariables.h +2 -8
- package/include/MemoryModel/SymbolTableInfo.h +2 -6
- package/include/SVF-FE/LLVMUtil.h +1 -1
- package/include/SVF-FE/SVFIRBuilder.h +91 -108
- package/include/SVF-FE/SymbolTableBuilder.h +1 -1
- package/include/Util/Options.h +1 -0
- package/lib/Graphs/ICFG.cpp +19 -50
- package/lib/MemoryModel/LocationSet.cpp +7 -3
- package/lib/MemoryModel/PointerAnalysisImpl.cpp +1 -1
- package/lib/MemoryModel/SVFIR.cpp +17 -17
- package/lib/MemoryModel/SymbolTableInfo.cpp +37 -21
- package/lib/SVF-FE/LLVMUtil.cpp +3 -3
- package/lib/SVF-FE/SVFIRBuilder.cpp +93 -134
- package/lib/SVF-FE/SymbolTableBuilder.cpp +21 -10
- package/lib/Util/Options.cpp +6 -0
- package/lib/Util/TypeBasedHeapCloning.cpp +1 -1
- package/package.json +1 -1
|
@@ -69,7 +69,7 @@ $(function() {
|
|
|
69
69
|
<a href="FlowSensitiveStat_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">//===- FlowSensitiveStat.cpp -- Statistics for flow-sensitive pointer analysis-//</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">//</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// SVF: Static Value-Flow Analysis</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Copyright (C) <2013-2017> <Yulei Sui></span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">//</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// This program is free software: you can redistribute it and/or modify</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// it under the terms of the GNU General Public License as published by</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// (at your option) any later version.</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// This program is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// You should have received a copy of the GNU General Public License</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// along with this program. If not, see <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">//===-----------------------------------------------------------------------===//</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">/*</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * FlowSensitiveStat.cpp</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> *</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * Created on: 27/11/2013</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Author: yesen</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="LLVMUtil_8h.html">SVF-FE/LLVMUtil.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="Andersen_8h.html">WPA/Andersen.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="WPAStat_8h.html">WPA/WPAStat.h</a>"</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="FlowSensitive_8h.html">WPA/FlowSensitive.h</a>"</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="PointsTo_8h.html">MemoryModel/PointsTo.h</a>"</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">using namespace </span><a class="code" href="namespaceSVF.html">SVF</a>;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">using namespace </span>SVFUtil;</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#ab4c205136b22a13b54ceb48135730d23"> 42</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#ab4c205136b22a13b54ceb48135730d23">FlowSensitiveStat::clearStat</a>()</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> {</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  _NumOfNullPtr = 0;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  _NumOfConstantPtr = 0;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  _NumOfBlackholePtr = 0;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  _MaxPtsSize = _MaxTopLvlPtsSize = 0;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  _AvgPtsSize = _AvgTopLvlPtsSize = 0;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  _AvgAddrTakenVarPtsSize = _NumOfAddrTakeVar = 0;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  _MaxAddrTakenVarPts = 0;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  _TotalPtsSize = 0;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=IN; i<=OUT; i++)</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  _NumOfSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  _NumOfFormalInSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  _NumOfFormalOutSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  _NumOfActualInSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  _NumOfActualOutSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  _NumOfLoadSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  _NumOfStoreSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  _NumOfMSSAPhiSVFGNodesHaveInOut[i] = 0;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _NumOfVarHaveINOUTPts[i] = 0;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _NumOfVarHaveEmptyINOUTPts[i] = 0;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _NumOfVarHaveINOUTPtsInFormalIn[i] = 0;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  _NumOfVarHaveINOUTPtsInFormalOut[i] = 0;;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  _NumOfVarHaveINOUTPtsInActualIn[i] = 0;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  _NumOfVarHaveINOUTPtsInActualOut[i] = 0;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  _NumOfVarHaveINOUTPtsInLoad[i] = 0;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  _NumOfVarHaveINOUTPtsInStore[i] = 0;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  _NumOfVarHaveINOUTPtsInMSSAPhi[i] = 0;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _PotentialNumOfVarHaveINOUTPts[i] = 0;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _MaxInOutPtsSize[i] = 0;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  _AvgInOutPtsSize[i] = 0;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#a059047d05e9873a624e333162a460571"> 85</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a059047d05e9873a624e333162a460571">FlowSensitiveStat::performStat</a>()</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="util_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(SVFUtil::isa<FlowSensitive>(fspta) && <span class="stringliteral">"not an flow-sensitive pta pass!! what else??"</span>);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  endClk();</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  clearStat();</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <a class="code" href="classSVF_1_1SVFIR.html">SVFIR</a>* pag = fspta-><a class="code" href="classSVF_1_1SVFIR.html#a37cfa2aa4e7b98ef9dc8179f581a2362">getPAG</a>();</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// stat null ptr number</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  statNullPtr();</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// stat points-to set information</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  statPtsSize();</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// stat address-taken variables' points-to</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  statAddrVarPtsSize();</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> fiObjNumber = 0;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> fsObjNumber = 0;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="namespaceSVF.html#af739db846e47ba6b2fd15eaad31ab7fb">Set<SymID></a> nodeSet;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#a5dfa3f178d4abf37177d0d74ff4c6a97">SVFIR::const_iterator</a> nodeIt = pag-><a class="code" href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">begin</a>(), nodeEit = pag-><a class="code" href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">end</a>(); nodeIt != nodeEit; nodeIt++)</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> nodeId = nodeIt->first;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <a class="code" href="classSVF_1_1SVFVar.html">PAGNode</a>* pagNode = nodeIt->second;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span>(SVFUtil::isa<ObjVar>(pagNode))</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1MemObj.html">MemObj</a> * memObj = pag-><a class="code" href="classSVF_1_1SVFIR.html#af76a55c3b8255a81a566bdce35ffc749">getBaseObj</a>(nodeId);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="namespaceSVF.html#ad11fe2412b2182365a662ff0e4639b48">SymID</a> baseId = memObj-><a class="code" href="classSVF_1_1MemObj.html#a3ab6f65ffbf6442daac4d3f70f2d3cb1">getId</a>();</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (nodeSet.insert(baseId).second)</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (memObj-><a class="code" href="classSVF_1_1MemObj.html#a41d85883d44ad77832b020455951c6fc">isFieldInsensitive</a>())</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  fiObjNumber++;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  fsObjNumber++;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordtype">unsigned</span> numOfCopy = 0;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">unsigned</span> numOfStore = 0;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">unsigned</span> numOfNode = 0;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFG::iterator</a> svfgNodeIt = fspta->svfg->begin();</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFG::iterator</a> svfgNodeEit = fspta->svfg->end();</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">for</span> (; svfgNodeIt != svfgNodeEit; ++svfgNodeIt)</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  numOfNode++;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a>* svfgNode = svfgNodeIt->second;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">if</span> (SVFUtil::isa<CopySVFGNode>(svfgNode))</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  numOfCopy++;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<StoreSVFGNode>(svfgNode))</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  numOfStore++;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="classSVF_1_1PTAStat.html#acfed70588cf921694db35990ec3c7497">PTAStat::performStat</a>();</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  timeStatMap[TotalAnalysisTime] = (endTime - startTime)/<a class="code" href="SVFBasicTypes_8h.html#a1aeda3370621dc00e9a0fe8e7aabc736">TIMEINTERVAL</a>;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  timeStatMap[<span class="stringliteral">"SolveTime"</span>] = fspta->solveTime;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  timeStatMap[<span class="stringliteral">"SCCTime"</span>] = fspta->sccTime;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  timeStatMap[<span class="stringliteral">"ProcessTime"</span>] = fspta->processTime;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  timeStatMap[<span class="stringliteral">"PropagationTime"</span>] = fspta->propagationTime;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  timeStatMap[<span class="stringliteral">"DirectPropaTime"</span>] = fspta->directPropaTime;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  timeStatMap[<span class="stringliteral">"IndirectPropaTime"</span>] = fspta->indirectPropaTime;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  timeStatMap[<span class="stringliteral">"Strong/WeakUpdTime"</span>] = fspta->updateTime;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  timeStatMap[<span class="stringliteral">"AddrTime"</span>] = fspta->addrTime;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  timeStatMap[<span class="stringliteral">"CopyTime"</span>] = fspta->copyTime;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  timeStatMap[<span class="stringliteral">"GepTime"</span>] = fspta->gepTime;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  timeStatMap[<span class="stringliteral">"LoadTime"</span>] = fspta->loadTime;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  timeStatMap[<span class="stringliteral">"StoreTime"</span>] = fspta->storeTime;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  timeStatMap[<span class="stringliteral">"UpdateCGTime"</span>] = fspta->updateCallGraphTime;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  timeStatMap[<span class="stringliteral">"PhiTime"</span>] = fspta->phiTime;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  PTNumStatMap[TotalNumOfPointers] = pag-><a class="code" href="classSVF_1_1IRGraph.html#a0212f3fe2f37363e8060f292c8cf7668">getValueNodeNum</a>() + pag-><a class="code" href="classSVF_1_1SVFIR.html#a8a24e0bf9f95fc1519d4013e0e82dec9">getFieldValNodeNum</a>();</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  PTNumStatMap[TotalNumOfObjects] = pag-><a class="code" href="classSVF_1_1IRGraph.html#a82528aff779ccf8f723f57507dd2d991">getObjectNodeNum</a>() + pag-><a class="code" href="classSVF_1_1SVFIR.html#a3bbaafd80dfcae6ccc82c3d8b9d303ea">getFieldObjNodeNum</a>();</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  PTNumStatMap[NumOfPointers] = pag-><a class="code" href="classSVF_1_1IRGraph.html#a0212f3fe2f37363e8060f292c8cf7668">getValueNodeNum</a>();</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  PTNumStatMap[NumOfMemObjects] = pag-><a class="code" href="classSVF_1_1IRGraph.html#a82528aff779ccf8f723f57507dd2d991">getObjectNodeNum</a>();</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  PTNumStatMap[NumOfGepFieldPointers] = pag-><a class="code" href="classSVF_1_1SVFIR.html#a8a24e0bf9f95fc1519d4013e0e82dec9">getFieldValNodeNum</a>();</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  PTNumStatMap[NumOfGepFieldObjects] = pag-><a class="code" href="classSVF_1_1SVFIR.html#a3bbaafd80dfcae6ccc82c3d8b9d303ea">getFieldObjNodeNum</a>();</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  PTNumStatMap[NumOfCopys] = numOfCopy;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  PTNumStatMap[NumOfStores] = numOfStore;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  PTNumStatMap[NumOfIterations] = fspta->numOfIteration;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  PTNumStatMap[NumOfIndirectEdgeSolved] = fspta->getNumOfResolvedIndCallEdge();</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  PTNumStatMap[NumOfNullPointer] = _NumOfNullPtr;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  PTNumStatMap[<span class="stringliteral">"PointsToConstPtr"</span>] = _NumOfConstantPtr;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  PTNumStatMap[<span class="stringliteral">"PointsToBlkPtr"</span>] = _NumOfBlackholePtr;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  PTNumStatMap[<span class="stringliteral">"StrongUpdates"</span>] = fspta->svfgHasSU.count();</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  PTNumStatMap[<span class="stringliteral">"SNodesHaveIN"</span>] = _NumOfSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  PTNumStatMap[<span class="stringliteral">"SNodesHaveOUT"</span>] = _NumOfSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  PTNumStatMap[<span class="stringliteral">"FI_SNodesHaveIN"</span>] = _NumOfFormalInSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  PTNumStatMap[<span class="stringliteral">"FI_SNodesHaveOUT"</span>] = _NumOfFormalInSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  PTNumStatMap[<span class="stringliteral">"FO_SNodesHaveIN"</span>] = _NumOfFormalOutSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  PTNumStatMap[<span class="stringliteral">"FO_SNodesHaveOUT"</span>] = _NumOfFormalOutSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  PTNumStatMap[<span class="stringliteral">"AI_SNodesHaveIN"</span>] = _NumOfActualInSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  PTNumStatMap[<span class="stringliteral">"AI_SNodesHaveOUT"</span>] = _NumOfActualInSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  PTNumStatMap[<span class="stringliteral">"AO_SNodesHaveIN"</span>] = _NumOfActualOutSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  PTNumStatMap[<span class="stringliteral">"AO_SNodesHaveOUT"</span>] = _NumOfActualOutSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  PTNumStatMap[<span class="stringliteral">"LD_SNodesHaveIN"</span>] = _NumOfLoadSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  PTNumStatMap[<span class="stringliteral">"LD_SNodesHaveOUT"</span>] = _NumOfLoadSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  PTNumStatMap[<span class="stringliteral">"ST_SNodesHaveIN"</span>] = _NumOfStoreSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  PTNumStatMap[<span class="stringliteral">"ST_SNodesHaveOUT"</span>] = _NumOfStoreSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  PTNumStatMap[<span class="stringliteral">"PHI_SNodesHaveIN"</span>] = _NumOfMSSAPhiSVFGNodesHaveInOut[IN];</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  PTNumStatMap[<span class="stringliteral">"PHI_SNodesHaveOUT"</span>] = _NumOfMSSAPhiSVFGNodesHaveInOut[OUT];</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">/*-----------------------------------------------------*/</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// SVFIR nodes.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN"</span>] = _NumOfVarHaveINOUTPts[IN];</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT"</span>] = _NumOfVarHaveINOUTPts[OUT];</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  PTNumStatMap[<span class="stringliteral">"PotentialVarHaveIN"</span>] = _PotentialNumOfVarHaveINOUTPts[IN];</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  PTNumStatMap[<span class="stringliteral">"PotentialVarHaveOUT"</span>] = _PotentialNumOfVarHaveINOUTPts[OUT];</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  PTNumStatMap[<span class="stringliteral">"VarHaveEmptyIN"</span>] = _NumOfVarHaveEmptyINOUTPts[IN];</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  PTNumStatMap[<span class="stringliteral">"VarHaveEmptyOUT"</span>] = _NumOfVarHaveEmptyINOUTPts[OUT];</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_FI"</span>] = _NumOfVarHaveINOUTPtsInFormalIn[IN];</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_FI"</span>] = _NumOfVarHaveINOUTPtsInFormalIn[OUT];</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_FO"</span>] = _NumOfVarHaveINOUTPtsInFormalOut[IN];</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_FO"</span>] = _NumOfVarHaveINOUTPtsInFormalOut[OUT];</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_AI"</span>] = _NumOfVarHaveINOUTPtsInActualIn[IN];</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_AI"</span>] = _NumOfVarHaveINOUTPtsInActualIn[OUT];</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_AO"</span>] = _NumOfVarHaveINOUTPtsInActualOut[IN];</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_AO"</span>] = _NumOfVarHaveINOUTPtsInActualOut[OUT];</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_LD"</span>] = _NumOfVarHaveINOUTPtsInLoad[IN];</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_LD"</span>] = _NumOfVarHaveINOUTPtsInLoad[OUT];</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_ST"</span>] = _NumOfVarHaveINOUTPtsInStore[IN];</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_ST"</span>] = _NumOfVarHaveINOUTPtsInStore[OUT];</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  PTNumStatMap[<span class="stringliteral">"VarHaveIN_PHI"</span>] = _NumOfVarHaveINOUTPtsInMSSAPhi[IN];</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  PTNumStatMap[<span class="stringliteral">"VarHaveOUT_PHI"</span>] = _NumOfVarHaveINOUTPtsInMSSAPhi[OUT];</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  PTNumStatMap[<span class="stringliteral">"MaxPtsSize"</span>] = _MaxPtsSize;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  PTNumStatMap[<span class="stringliteral">"MaxTopLvlPtsSize"</span>] = _MaxTopLvlPtsSize;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  PTNumStatMap[<span class="stringliteral">"MaxINPtsSize"</span>] = _MaxInOutPtsSize[IN];</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  PTNumStatMap[<span class="stringliteral">"MaxOUTPtsSize"</span>] = _MaxInOutPtsSize[OUT];</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  timeStatMap[<span class="stringliteral">"AvgPtsSize"</span>] = _AvgPtsSize;</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  timeStatMap[<span class="stringliteral">"AvgTopLvlPtsSize"</span>] = _AvgTopLvlPtsSize;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  PTNumStatMap[<span class="stringliteral">"NumOfAddrTakenVar"</span>] = _NumOfAddrTakeVar;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  timeStatMap[<span class="stringliteral">"AvgAddrTakenVarPts"</span>] = (_NumOfAddrTakeVar == 0) ?</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  0 : ((<span class="keywordtype">double</span>)_AvgAddrTakenVarPtsSize / _NumOfAddrTakeVar);</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  PTNumStatMap[<span class="stringliteral">"MaxAddrTakenVarPts"</span>] = _MaxAddrTakenVarPts;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  timeStatMap[<span class="stringliteral">"AvgINPtsSize"</span>] = _AvgInOutPtsSize[IN];</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  timeStatMap[<span class="stringliteral">"AvgOUTPtsSize"</span>] = _AvgInOutPtsSize[OUT];</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  PTNumStatMap[<span class="stringliteral">"ProcessedAddr"</span>] = fspta->numOfProcessedAddr;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  PTNumStatMap[<span class="stringliteral">"ProcessedCopy"</span>] = fspta->numOfProcessedCopy;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  PTNumStatMap[<span class="stringliteral">"ProcessedGep"</span>] = fspta->numOfProcessedGep;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  PTNumStatMap[<span class="stringliteral">"ProcessedLoad"</span>] = fspta->numOfProcessedLoad;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  PTNumStatMap[<span class="stringliteral">"ProcessedStore"</span>] = fspta->numOfProcessedStore;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  PTNumStatMap[<span class="stringliteral">"ProcessedPhi"</span>] = fspta->numOfProcessedPhi;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  PTNumStatMap[<span class="stringliteral">"ProcessedAParam"</span>] = fspta->numOfProcessedActualParam;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  PTNumStatMap[<span class="stringliteral">"ProcessedFRet"</span>] = fspta->numOfProcessedFormalRet;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  PTNumStatMap[<span class="stringliteral">"ProcessedMSSANode"</span>] = fspta->numOfProcessedMSSANode;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  PTNumStatMap[<span class="stringliteral">"NumOfNodesInSCC"</span>] = fspta->numOfNodesInSCC;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  PTNumStatMap[<span class="stringliteral">"MaxSCCSize"</span>] = fspta->maxSCCSize;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  PTNumStatMap[<span class="stringliteral">"NumOfSCC"</span>] = fspta->numOfSCC;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  timeStatMap[<span class="stringliteral">"AverageSCCSize"</span>] = (fspta->numOfSCC == 0) ? 0 :</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  ((<span class="keywordtype">double</span>)fspta->numOfNodesInSCC / fspta->numOfSCC);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  std::cout << <span class="stringliteral">"\n****Flow-Sensitive Pointer Analysis Statistics****\n"</span>;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="classSVF_1_1PTAStat.html#aa5f455bfa79743b8e263431593d29bbf">PTAStat::printStat</a>();</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#a36f7be42772b2df6f7594c51b7dc4770"> 271</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a36f7be42772b2df6f7594c51b7dc4770">FlowSensitiveStat::statNullPtr</a>()</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  _NumOfNullPtr = 0;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFIR::iterator</a> iter = fspta->getPAG()->begin(), eiter = fspta->getPAG()->end();</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  iter != eiter; ++iter)</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  {</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> pagNodeId = iter->first;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="code" href="classSVF_1_1SVFVar.html">PAGNode</a>* pagNode = iter->second;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="classSVF_1_1SVFStmt.html#a8cd7b6c6fd8b030b1421d95a086359f4">SVFStmt::SVFStmtSetTy</a>& inComingStore = pagNode-><a class="code" href="classSVF_1_1SVFVar.html#a76964ef7d4842a469d7720881499d8a6">getIncomingEdges</a>(<a class="code" href="classSVF_1_1SVFStmt.html#a0ab8621e75e75f03425c323b3ed62ce9aa0f700b514c431ec5329aec49df56dcc">SVFStmt::Store</a>);</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="classSVF_1_1SVFStmt.html#a8cd7b6c6fd8b030b1421d95a086359f4">SVFStmt::SVFStmtSetTy</a>& outGoingLoad = pagNode-><a class="code" href="classSVF_1_1SVFVar.html#a927733580b47be5ffcfced44ba9fd6c3">getOutgoingEdges</a>(<a class="code" href="classSVF_1_1SVFStmt.html#a0ab8621e75e75f03425c323b3ed62ce9a62ac8480c43fcc657c631ec0003b15d5">SVFStmt::Load</a>);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (inComingStore.empty()==<span class="keyword">false</span> || outGoingLoad.empty()==<span class="keyword">false</span>)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  {</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1PointsTo.html">PointsTo</a>& pts = fspta->getPts(pagNodeId);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span>(fspta->containBlackHoleNode(pts))</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  _NumOfConstantPtr++;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span>(fspta->containConstantNode(pts))</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  {</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  _NumOfBlackholePtr++;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span>(pts.<a class="code" href="classSVF_1_1PointsTo.html#ac4688413177b49b37dbbfd3ed188d59b">empty</a>())</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  std::string str;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="namespaceSVF.html#a726981481ac082dcda3e4921416b65a0">raw_string_ostream</a> rawstr(str);</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (!SVFUtil::isa<DummyValVar>(pagNode) && !SVFUtil::isa<DummyObjVar>(pagNode))</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// if a pointer is in dead function, we do not care</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span>(<a class="code" href="namespaceSVF_1_1SVFUtil.html#a4dcfe3e66a16813350ec8dffd47c5644">isPtrInDeadFunction</a>(pagNode-><a class="code" href="classSVF_1_1SVFVar.html#afaa33caa8d2a306f6741d9d066243e40">getValue</a>()) == <span class="keyword">false</span>)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  {</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  _NumOfNullPtr++;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  rawstr << <span class="stringliteral">"##Null Pointer : (NodeID "</span> << pagNode-><a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>()</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  << <span class="stringliteral">") PtrName:"</span> << pagNode-><a class="code" href="classSVF_1_1SVFVar.html#afaa33caa8d2a306f6741d9d066243e40">getValue</a>()->getName();</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="namespaceSVF_1_1SVFUtil.html#a077caa1b10ab84d101d79fc7ea50db2d">writeWrnMsg</a>(rawstr.str());</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _NumOfNullPtr++;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  rawstr << <span class="stringliteral">"##Null Pointer : (NodeID "</span> << pagNode-><a class="code" href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">getId</a>();</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="namespaceSVF_1_1SVFUtil.html#a077caa1b10ab84d101d79fc7ea50db2d">writeWrnMsg</a>(rawstr.str());</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> }</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> </div><div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#af51e5b90f7bc52e3657a708c7bc5bb75"> 322</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#af51e5b90f7bc52e3657a708c7bc5bb75">FlowSensitiveStat::statPtsSize</a>()</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> {</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// TODO: needs to be made to work for persistent.</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">if</span> (SVFUtil::isa<FlowSensitive::MutDFPTDataTy>(fspta->getPTDataTy()))</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// stat of IN set</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  statInOutPtsSize(fspta->getDFInputMap(), IN);</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// stat of OUT set</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  statInOutPtsSize(fspta->getDFOutputMap(), OUT);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> totalValidTopLvlPointers = 0;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> topTopLvlPtsSize = 0;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVFIR::iterator</a> iter = fspta->getPAG()->begin(), eiter = fspta->getPAG()->end();</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  iter != eiter; ++iter)</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> node = iter->first;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">if</span> (fspta->getPAG()->isValidTopLevelPtr(iter->second) == <span class="keyword">false</span>)</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> size = fspta->getPts(node).count();</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  totalValidTopLvlPointers++;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  topTopLvlPtsSize+=size;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span>(size > _MaxPtsSize) _MaxPtsSize = size;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">if</span> (size > _MaxTopLvlPtsSize) _MaxTopLvlPtsSize = size;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (totalValidTopLvlPointers != 0)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  _AvgTopLvlPtsSize = (double)topTopLvlPtsSize/totalValidTopLvlPointers;</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  _TotalPtsSize += topTopLvlPtsSize;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> totalPointer = totalValidTopLvlPointers + _NumOfVarHaveINOUTPts[IN] + _NumOfVarHaveINOUTPts[OUT];</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (totalPointer != 0)</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  _AvgPtsSize = (double) _TotalPtsSize / totalPointer;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#a8ae7448f6210b6c759a33e6fc8a8cee8"> 361</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a8ae7448f6210b6c759a33e6fc8a8cee8">FlowSensitiveStat::statInOutPtsSize</a>(<span class="keyword">const</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a55d45e82ea3d338114e50da877bcfb75">DFInOutMap</a>& data, <a class="code" href="classSVF_1_1FlowSensitiveStat.html#ab11996ab5606f51c977b9b1385c13d71">ENUM_INOUT</a> inOrOut)</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// Get number of nodes which have IN/OUT set</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _NumOfSVFGNodesHaveInOut[inOrOut] = data.size();</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> inOutPtsSize = 0;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  DFInOutMap::const_iterator it = data.begin();</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  DFInOutMap::const_iterator eit = data.end();</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">for</span> (; it != eit; ++it)</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  {</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a>* node = fspta->svfg->getSVFGNode(it->first);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// Count number of SVFG nodes have IN/OUT set.</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (SVFUtil::isa<FormalINSVFGNode>(node))</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  _NumOfFormalInSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<FormalOUTSVFGNode>(node))</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  _NumOfFormalOutSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<ActualINSVFGNode>(node))</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  _NumOfActualInSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<ActualOUTSVFGNode>(node))</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  _NumOfActualOutSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<LoadSVFGNode>(node))</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  _NumOfLoadSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<StoreSVFGNode>(node))</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  _NumOfStoreSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<MSSAPHISVFGNode>(node))</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _NumOfMSSAPhiSVFGNodesHaveInOut[inOrOut]++;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="util_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(<span class="keyword">false</span> && <span class="stringliteral">"unexpected node have IN/OUT set"</span>);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> </div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">/*-----------------------------------------------------*/</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">// Count SVFIR nodes and their points-to set size.</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a1b605e86f33e79f7d7cd88dc54f2c19e">PtsMap</a>& cptsMap = it->second;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  PtsMap::const_iterator ptsIt = cptsMap.begin();</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  PtsMap::const_iterator ptsEit = cptsMap.end();</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">for</span> (; ptsIt != ptsEit; ++ptsIt)</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (ptsIt->second.empty()) </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  {</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  _NumOfVarHaveEmptyINOUTPts[inOrOut]++;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <a class="code" href="namespaceSVF.html#ad42bff8d0a7d60a085aa32d10f4955af">u32_t</a> ptsNum = ptsIt->second.count(); </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> </div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// Only node with non-empty points-to set are counted.</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  _NumOfVarHaveINOUTPts[inOrOut]++;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (SVFUtil::isa<FormalINSVFGNode>(node))</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  _NumOfVarHaveINOUTPtsInFormalIn[inOrOut]++;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<FormalOUTSVFGNode>(node))</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  _NumOfVarHaveINOUTPtsInFormalOut[inOrOut]++;</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<ActualINSVFGNode>(node))</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  _NumOfVarHaveINOUTPtsInActualIn[inOrOut]++;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<ActualOUTSVFGNode>(node))</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  _NumOfVarHaveINOUTPtsInActualOut[inOrOut]++;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<LoadSVFGNode>(node))</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  _NumOfVarHaveINOUTPtsInLoad[inOrOut]++;</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<StoreSVFGNode>(node))</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  _NumOfVarHaveINOUTPtsInStore[inOrOut]++;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (SVFUtil::isa<MSSAPHISVFGNode>(node))</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  _NumOfVarHaveINOUTPtsInMSSAPhi[inOrOut]++;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="util_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(<span class="keyword">false</span> && <span class="stringliteral">"unexpected node have IN/OUT set"</span>);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  inOutPtsSize += ptsNum;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordflow">if</span> (ptsNum > _MaxInOutPtsSize[inOrOut])</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  _MaxInOutPtsSize[inOrOut] = ptsNum;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (ptsNum > _MaxPtsSize) _MaxPtsSize = ptsNum;</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (_NumOfVarHaveINOUTPts[inOrOut] != 0)</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  _AvgInOutPtsSize[inOrOut] = (double)inOutPtsSize / _NumOfVarHaveINOUTPts[inOrOut];</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  _TotalPtsSize += inOutPtsSize;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// How many IN/OUT PTSs could we have *potentially* had?</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// l'-o->l, l''-o->l, ..., means there is a possibility of 1 IN PTS.</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// *p = q && { o } in pts_ander(p) means there is a possibility of 1 OUT PTS.</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// For OUTs at stores, we must also account for WU/SUs.</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1SVFG.html">SVFG</a> *svfg = fspta->svfg;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">for</span> (<a class="code" href="classSVF_1_1GenericGraph.html#a5dfa3f178d4abf37177d0d74ff4c6a97">SVFG::const_iterator</a> it = svfg-><a class="code" href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">begin</a>(); it != svfg-><a class="code" href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">end</a>(); ++it)</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a> *sn = it->second;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// Unique objects coming into s.</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <a class="code" href="namespaceSVF.html#a740396763e377643790c8b803ab3e4ea">NodeBS</a> incomingObjects;</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGEdge.html">SVFGEdge</a> *e : sn-><a class="code" href="classSVF_1_1GenericNode.html#afc8b5f86d7795b6a0dfc0687d942d79b">getInEdges</a>())</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  {</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1IndirectSVFGEdge.html">IndirectSVFGEdge</a> *ie = <a class="code" href="namespaceSVF_1_1SVFUtil.html#a8182be247907420db00837cef9bcfa70">SVFUtil::dyn_cast</a><<a class="code" href="classSVF_1_1IndirectSVFGEdge.html">IndirectSVFGEdge</a>>(e);</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">if</span> (!ie) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> o : ie-><a class="code" href="classSVF_1_1IndirectSVFGEdge.html#a30aca718d25924f1babdf348bb0ace71">getPointsTo</a>()) incomingObjects.set(o);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  _PotentialNumOfVarHaveINOUTPts[IN] += incomingObjects.count();</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (<span class="keyword">const</span> <a class="code" href="classSVF_1_1StoreVFGNode.html">StoreSVFGNode</a> *store = SVFUtil::dyn_cast<StoreSVFGNode>(sn))</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  {</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> p = store->getPAGDstNodeID();</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// Reuse incomingObjects; what's already in there will be propagated forwarded</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// as a WU/SU, and what's not (first defined at the store), will be added.</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> o : fspta->ander->getPts(p)) incomingObjects.set(o);</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  _PotentialNumOfVarHaveINOUTPts[OUT] += incomingObjects.count();</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00476"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#a81785227a688389c68171a1fbd55fa9b"> 476</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a81785227a688389c68171a1fbd55fa9b">FlowSensitiveStat::statAddrVarPtsSize</a>()</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> {</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  SVFG::SVFGNodeIDToNodeMapTy::const_iterator it = fspta->svfg->begin();</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  SVFG::SVFGNodeIDToNodeMapTy::const_iterator eit = fspta->svfg->end();</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">for</span> (; it != eit; ++it)</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  {</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a>* node = it->second;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (<span class="keyword">const</span> <a class="code" href="classSVF_1_1StoreVFGNode.html">StoreSVFGNode</a>* store = SVFUtil::dyn_cast<StoreSVFGNode>(node))</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  {</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  calculateAddrVarPts(store->getPAGDstNodeID(), store);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> }</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> </div><div class="line"><a name="l00493"></a><span class="lineno"><a class="line" href="classSVF_1_1FlowSensitiveStat.html#a04466753c771238c6e1cc57964061dce"> 493</a></span> <span class="keywordtype">void</span> <a class="code" href="classSVF_1_1FlowSensitiveStat.html#a04466753c771238c6e1cc57964061dce">FlowSensitiveStat::calculateAddrVarPts</a>(<a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> pointer, <span class="keyword">const</span> <a class="code" href="classSVF_1_1VFGNode.html">SVFGNode</a>* svfg_node)</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> {</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1PointsTo.html">PointsTo</a>& pts = fspta->getPts(pointer);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  _NumOfAddrTakeVar += pts.<a class="code" href="classSVF_1_1PointsTo.html#a879783ba6629e500af9aa7dfcda2563d">count</a>();</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="classSVF_1_1PointsTo_1_1PointsToIterator.html">PointsTo::iterator</a> ptsIt = pts.<a class="code" href="classSVF_1_1PointsTo.html#aa53962e561399bf493d1f2b9137356f6">begin</a>();</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <a class="code" href="classSVF_1_1PointsTo_1_1PointsToIterator.html">PointsTo::iterator</a> ptsEit = pts.<a class="code" href="classSVF_1_1PointsTo.html#a8f741cdffbf3c5fe0f602cdca677dee6">end</a>();</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">for</span> (; ptsIt != ptsEit; ++ptsIt)</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  {</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> <a class="code" href="namespaceSVF.html#a43a65e0d33af3c743294f7a1139d2301">NodeID</a> ptd = *ptsIt;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">const</span> <a class="code" href="classSVF_1_1PointsTo.html">PointsTo</a>& cpts = fspta->getDFOutPtsSet(svfg_node, ptd);</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  _AvgAddrTakenVarPtsSize += cpts.<a class="code" href="classSVF_1_1PointsTo.html#a879783ba6629e500af9aa7dfcda2563d">count</a>();</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (cpts.<a class="code" href="classSVF_1_1PointsTo.html#a879783ba6629e500af9aa7dfcda2563d">count</a>() > _MaxAddrTakenVarPts)</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  _MaxAddrTakenVarPts = cpts.<a class="code" href="classSVF_1_1PointsTo.html#a879783ba6629e500af9aa7dfcda2563d">count</a>();</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> }</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="ttc" id="Andersen_8h_html"><div class="ttname"><a href="Andersen_8h.html">Andersen.h</a></div></div>
|
|
70
70
|
<div class="ttc" id="classSVF_1_1GenericGraph_html_a0d9744b1b0e7a09a6f7af29188e243b7"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#a0d9744b1b0e7a09a6f7af29188e243b7">SVF::GenericGraph::begin</a></div><div class="ttdeci">iterator begin()</div><div class="ttdoc">Iterators. </div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00361">GenericGraph.h:361</a></div></div>
|
|
71
71
|
<div class="ttc" id="classSVF_1_1StoreVFGNode_html"><div class="ttname"><a href="classSVF_1_1StoreVFGNode.html">SVF::StoreVFGNode</a></div><div class="ttdef"><b>Definition:</b> <a href="VFGNode_8h_source.html#l00235">VFGNode.h:235</a></div></div>
|
|
72
|
-
<div class="ttc" id="classSVF_1_1MemObj_html"><div class="ttname"><a href="classSVF_1_1MemObj.html">SVF::MemObj</a></div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8h_source.html#
|
|
72
|
+
<div class="ttc" id="classSVF_1_1MemObj_html"><div class="ttname"><a href="classSVF_1_1MemObj.html">SVF::MemObj</a></div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8h_source.html#l00411">SymbolTableInfo.h:411</a></div></div>
|
|
73
73
|
<div class="ttc" id="WPAStat_8h_html"><div class="ttname"><a href="WPAStat_8h.html">WPAStat.h</a></div></div>
|
|
74
74
|
<div class="ttc" id="classSVF_1_1GenericNode_html_afc8b5f86d7795b6a0dfc0687d942d79b"><div class="ttname"><a href="classSVF_1_1GenericNode.html#afc8b5f86d7795b6a0dfc0687d942d79b">SVF::GenericNode::getInEdges</a></div><div class="ttdeci">const GEdgeSetTy & getInEdges() const</div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00182">GenericGraph.h:182</a></div></div>
|
|
75
75
|
<div class="ttc" id="classSVF_1_1SVFStmt_html_a0ab8621e75e75f03425c323b3ed62ce9a62ac8480c43fcc657c631ec0003b15d5"><div class="ttname"><a href="classSVF_1_1SVFStmt.html#a0ab8621e75e75f03425c323b3ed62ce9a62ac8480c43fcc657c631ec0003b15d5">SVF::SVFStmt::Load</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFStatements_8h_source.html#l00056">SVFStatements.h:56</a></div></div>
|
|
@@ -109,12 +109,12 @@ $(function() {
|
|
|
109
109
|
<div class="ttc" id="classSVF_1_1FlowSensitiveStat_html_a8ae7448f6210b6c759a33e6fc8a8cee8"><div class="ttname"><a href="classSVF_1_1FlowSensitiveStat.html#a8ae7448f6210b6c759a33e6fc8a8cee8">SVF::FlowSensitiveStat::statInOutPtsSize</a></div><div class="ttdeci">void statInOutPtsSize(const DFInOutMap &data, ENUM_INOUT inOrOut)</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveStat_8cpp_source.html#l00361">FlowSensitiveStat.cpp:361</a></div></div>
|
|
110
110
|
<div class="ttc" id="classSVF_1_1FlowSensitiveStat_html_a81785227a688389c68171a1fbd55fa9b"><div class="ttname"><a href="classSVF_1_1FlowSensitiveStat.html#a81785227a688389c68171a1fbd55fa9b">SVF::FlowSensitiveStat::statAddrVarPtsSize</a></div><div class="ttdeci">void statAddrVarPtsSize()</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveStat_8cpp_source.html#l00476">FlowSensitiveStat.cpp:476</a></div></div>
|
|
111
111
|
<div class="ttc" id="classSVF_1_1SVFVar_html_a76964ef7d4842a469d7720881499d8a6"><div class="ttname"><a href="classSVF_1_1SVFVar.html#a76964ef7d4842a469d7720881499d8a6">SVF::SVFVar::getIncomingEdges</a></div><div class="ttdeci">SVFStmt::SVFStmtSetTy & getIncomingEdges(SVFStmt::PEDGEK kind)</div><div class="ttdoc">Get incoming SVFIR statements (edges) </div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00164">SVFVariables.h:164</a></div></div>
|
|
112
|
-
<div class="ttc" id="classSVF_1_1MemObj_html_a41d85883d44ad77832b020455951c6fc"><div class="ttname"><a href="classSVF_1_1MemObj.html#a41d85883d44ad77832b020455951c6fc">SVF::MemObj::isFieldInsensitive</a></div><div class="ttdeci">bool isFieldInsensitive() const</div><div class="ttdoc">Return true if its field limit is 0. </div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8cpp_source.html#
|
|
112
|
+
<div class="ttc" id="classSVF_1_1MemObj_html_a41d85883d44ad77832b020455951c6fc"><div class="ttname"><a href="classSVF_1_1MemObj.html#a41d85883d44ad77832b020455951c6fc">SVF::MemObj::isFieldInsensitive</a></div><div class="ttdeci">bool isFieldInsensitive() const</div><div class="ttdoc">Return true if its field limit is 0. </div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8cpp_source.html#l00735">SymbolTableInfo.cpp:735</a></div></div>
|
|
113
113
|
<div class="ttc" id="FlowSensitive_8h_html"><div class="ttname"><a href="FlowSensitive_8h.html">FlowSensitive.h</a></div></div>
|
|
114
114
|
<div class="ttc" id="classSVF_1_1SVFG_html"><div class="ttname"><a href="classSVF_1_1SVFG.html">SVF::SVFG</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFG_8h_source.html#l00065">SVFG.h:65</a></div></div>
|
|
115
115
|
<div class="ttc" id="namespaceSVF_html"><div class="ttname"><a href="namespaceSVF.html">SVF</a></div><div class="ttdoc">for isBitcode </div><div class="ttdef"><b>Definition:</b> <a href="ContextDDA_8h_source.html#l00016">ContextDDA.h:16</a></div></div>
|
|
116
116
|
<div class="ttc" id="classSVF_1_1SVFStmt_html_a0ab8621e75e75f03425c323b3ed62ce9aa0f700b514c431ec5329aec49df56dcc"><div class="ttname"><a href="classSVF_1_1SVFStmt.html#a0ab8621e75e75f03425c323b3ed62ce9aa0f700b514c431ec5329aec49df56dcc">SVF::SVFStmt::Store</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFStatements_8h_source.html#l00056">SVFStatements.h:56</a></div></div>
|
|
117
|
-
<div class="ttc" id="classSVF_1_1MemObj_html_a3ab6f65ffbf6442daac4d3f70f2d3cb1"><div class="ttname"><a href="classSVF_1_1MemObj.html#a3ab6f65ffbf6442daac4d3f70f2d3cb1">SVF::MemObj::getId</a></div><div class="ttdeci">SymID getId() const</div><div class="ttdoc">Get the memory object id. </div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8h_source.html#
|
|
117
|
+
<div class="ttc" id="classSVF_1_1MemObj_html_a3ab6f65ffbf6442daac4d3f70f2d3cb1"><div class="ttname"><a href="classSVF_1_1MemObj.html#a3ab6f65ffbf6442daac4d3f70f2d3cb1">SVF::MemObj::getId</a></div><div class="ttdeci">SymID getId() const</div><div class="ttdoc">Get the memory object id. </div><div class="ttdef"><b>Definition:</b> <a href="SymbolTableInfo_8h_source.html#l00441">SymbolTableInfo.h:441</a></div></div>
|
|
118
118
|
<div class="ttc" id="classSVF_1_1GenericNode_html_ac3e55ef37aefb411ea4c87b1aa3b1895"><div class="ttname"><a href="classSVF_1_1GenericNode.html#ac3e55ef37aefb411ea4c87b1aa3b1895">SVF::GenericNode::getId</a></div><div class="ttdeci">NodeID getId() const</div><div class="ttdoc">Get ID. </div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00165">GenericGraph.h:165</a></div></div>
|
|
119
119
|
<div class="ttc" id="namespaceSVF_html_a740396763e377643790c8b803ab3e4ea"><div class="ttname"><a href="namespaceSVF.html#a740396763e377643790c8b803ab3e4ea">SVF::NodeBS</a></div><div class="ttdeci">llvm::SparseBitVector NodeBS</div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00086">SVFBasicTypes.h:86</a></div></div>
|
|
120
120
|
<div class="ttc" id="namespaceSVF_1_1SVFUtil_html_a8182be247907420db00837cef9bcfa70"><div class="ttname"><a href="namespaceSVF_1_1SVFUtil.html#a8182be247907420db00837cef9bcfa70">SVF::SVFUtil::dyn_cast</a></div><div class="ttdeci">LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val)</div><div class="ttdef"><b>Definition:</b> <a href="Casting_8h_source.html#l00343">Casting.h:343</a></div></div>
|
|
@@ -130,12 +130,12 @@ $(function() {
|
|
|
130
130
|
<div class="ttc" id="classSVF_1_1FlowSensitiveTBHC_html_a42c8023e0e60e8701ec197b3d775b423"><div class="ttname"><a href="classSVF_1_1FlowSensitiveTBHC.html#a42c8023e0e60e8701ec197b3d775b423">SVF::FlowSensitiveTBHC::processLoad</a></div><div class="ttdeci">virtual bool processLoad(const LoadSVFGNode *load) override</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveTBHC_8cpp_source.html#l00364">FlowSensitiveTBHC.cpp:364</a></div></div>
|
|
131
131
|
<div class="ttc" id="classSVF_1_1FlowSensitiveTBHC_html_ac937e0e388071bbf94a477e1880663eb"><div class="ttname"><a href="classSVF_1_1FlowSensitiveTBHC.html#ac937e0e388071bbf94a477e1880663eb">SVF::FlowSensitiveTBHC::processStore</a></div><div class="ttdeci">virtual bool processStore(const StoreSVFGNode *store) override</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveTBHC_8cpp_source.html#l00419">FlowSensitiveTBHC.cpp:419</a></div></div>
|
|
132
132
|
<div class="ttc" id="classSVF_1_1GenericGraph_html_a4bef15157423cef48dc7333a803cd27d"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#a4bef15157423cef48dc7333a803cd27d">SVF::GenericGraph::end</a></div><div class="ttdeci">iterator end()</div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00365">GenericGraph.h:365</a></div></div>
|
|
133
|
-
<div class="ttc" id="classSVF_1_1Options_html_a10cc9fa1d4e553865343d635cf84592e"><div class="ttname"><a href="classSVF_1_1Options.html#a10cc9fa1d4e553865343d635cf84592e">SVF::Options::TBHCStoreReuse</a></div><div class="ttdeci">static const llvm::cl::opt< bool > TBHCStoreReuse</div><div class="ttdoc">Whether we allow reuse for TBHC. </div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#
|
|
133
|
+
<div class="ttc" id="classSVF_1_1Options_html_a10cc9fa1d4e553865343d635cf84592e"><div class="ttname"><a href="classSVF_1_1Options.html#a10cc9fa1d4e553865343d635cf84592e">SVF::Options::TBHCStoreReuse</a></div><div class="ttdeci">static const llvm::cl::opt< bool > TBHCStoreReuse</div><div class="ttdoc">Whether we allow reuse for TBHC. </div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#l00241">Options.h:241</a></div></div>
|
|
134
134
|
<div class="ttc" id="classSVF_1_1DCHGraph_html_a9d2be5aec5216cbc1d1709b41f79c44b"><div class="ttname"><a href="classSVF_1_1DCHGraph.html#a9d2be5aec5216cbc1d1709b41f79c44b">SVF::DCHGraph::isAgg</a></div><div class="ttdeci">static bool isAgg(const DIType *t)</div><div class="ttdef"><b>Definition:</b> <a href="DCHG_8cpp_source.html#l00342">DCHG.cpp:342</a></div></div>
|
|
135
135
|
<div class="ttc" id="classSVF_1_1DFPTData_html_a7e4ae809b40d55448de0103746254158"><div class="ttname"><a href="classSVF_1_1DFPTData.html#a7e4ae809b40d55448de0103746254158">SVF::DFPTData::updateAllDFOutFromIn</a></div><div class="ttdeci">virtual bool updateAllDFOutFromIn(LocID loc, const Key &singleton, bool strongUpdates)=0</div><div class="ttdoc">For each variable var in IN at loc, do updateDFOutFromIn(loc, var, loc, var). </div></div>
|
|
136
136
|
<div class="ttc" id="classSVF_1_1FlowSensitiveTBHC_html_ad5b294dacf51a89306df9a22c6799bad"><div class="ttname"><a href="classSVF_1_1FlowSensitiveTBHC.html#ad5b294dacf51a89306df9a22c6799bad">SVF::FlowSensitiveTBHC::gepIsLoad</a></div><div class="ttdeci">bool gepIsLoad(NodeID gep)</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveTBHC_8cpp_source.html#l00608">FlowSensitiveTBHC.cpp:608</a></div></div>
|
|
137
137
|
<div class="ttc" id="classSVF_1_1GenericGraph_html_ac213302cf5c7cdf3b66f7b18649d0fbc"><div class="ttname"><a href="classSVF_1_1GenericGraph.html#ac213302cf5c7cdf3b66f7b18649d0fbc">SVF::GenericGraph::iterator</a></div><div class="ttdeci">IDToNodeMapTy::iterator iterator</div><div class="ttdoc">Node Iterators. </div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00338">GenericGraph.h:338</a></div></div>
|
|
138
|
-
<div class="ttc" id="classSVF_1_1Options_html_a930ed87e35ba7502f9d00be6f17f902f"><div class="ttname"><a href="classSVF_1_1Options.html#a930ed87e35ba7502f9d00be6f17f902f">SVF::Options::TBHCAllReuse</a></div><div class="ttdeci">static const llvm::cl::opt< bool > TBHCAllReuse</div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#
|
|
138
|
+
<div class="ttc" id="classSVF_1_1Options_html_a930ed87e35ba7502f9d00be6f17f902f"><div class="ttname"><a href="classSVF_1_1Options.html#a930ed87e35ba7502f9d00be6f17f902f">SVF::Options::TBHCAllReuse</a></div><div class="ttdeci">static const llvm::cl::opt< bool > TBHCAllReuse</div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#l00242">Options.h:242</a></div></div>
|
|
139
139
|
<div class="ttc" id="classSVF_1_1FlowSensitiveTBHC_html_a83a4defe2bcb1c99c66aea8c8325d5fd"><div class="ttname"><a href="classSVF_1_1FlowSensitiveTBHC.html#a83a4defe2bcb1c99c66aea8c8325d5fd">SVF::FlowSensitiveTBHC::propAlongIndirectEdge</a></div><div class="ttdeci">virtual bool propAlongIndirectEdge(const IndirectSVFGEdge *edge) override</div><div class="ttdoc">Propagate points-to information along an INDIRECT SVFG edge. </div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveTBHC_8cpp_source.html#l00091">FlowSensitiveTBHC.cpp:91</a></div></div>
|
|
140
140
|
<div class="ttc" id="classSVF_1_1GenericEdge_html_aeaa31a2c8479e831b36ce2e2582ceb86"><div class="ttname"><a href="classSVF_1_1GenericEdge.html#aeaa31a2c8479e831b36ce2e2582ceb86">SVF::GenericEdge::getDstNode</a></div><div class="ttdeci">NodeType * getDstNode() const</div><div class="ttdef"><b>Definition:</b> <a href="GenericGraph_8h_source.html#l00089">GenericGraph.h:89</a></div></div>
|
|
141
141
|
<div class="ttc" id="namespaceSVF_html_af739db846e47ba6b2fd15eaad31ab7fb"><div class="ttname"><a href="namespaceSVF.html#af739db846e47ba6b2fd15eaad31ab7fb">SVF::Set</a></div><div class="ttdeci">std::unordered_set< Key, Hash, KeyEqual, Allocator > Set</div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00095">SVFBasicTypes.h:95</a></div></div>
|
|
@@ -159,8 +159,8 @@ $(function() {
|
|
|
159
159
|
<div class="ttc" id="classSVF_1_1StmtVFGNode_html_a791a01f5d3528f8a8bf19369b5c61c37"><div class="ttname"><a href="classSVF_1_1StmtVFGNode.html#a791a01f5d3528f8a8bf19369b5c61c37">SVF::StmtVFGNode::getPAGSrcNodeID</a></div><div class="ttdeci">NodeID getPAGSrcNodeID() const</div><div class="ttdef"><b>Definition:</b> <a href="VFGNode_8h_source.html#l00138">VFGNode.h:138</a></div></div>
|
|
160
160
|
<div class="ttc" id="classSVF_1_1FlowSensitiveTBHC_html_abce5580e93cba1e591a0bac4e9070816"><div class="ttname"><a href="classSVF_1_1FlowSensitiveTBHC.html#abce5580e93cba1e591a0bac4e9070816">SVF::FlowSensitiveTBHC::processAddr</a></div><div class="ttdeci">virtual bool processAddr(const AddrSVFGNode *addr) override</div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitiveTBHC_8cpp_source.html#l00217">FlowSensitiveTBHC.cpp:217</a></div></div>
|
|
161
161
|
<div class="ttc" id="classSVF_1_1PointerAnalysis_html_ae2cc7cd0803dbd90639140e71b06b1b5"><div class="ttname"><a href="classSVF_1_1PointerAnalysis.html#ae2cc7cd0803dbd90639140e71b06b1b5">SVF::PointerAnalysis::getCHGraph</a></div><div class="ttdeci">CommonCHGraph * getCHGraph() const</div><div class="ttdoc">get CHGraph </div><div class="ttdef"><b>Definition:</b> <a href="PointerAnalysis_8h_source.html#l00444">PointerAnalysis.h:444</a></div></div>
|
|
162
|
-
<div class="ttc" id="classSVF_1_1GepStmt_html_adf6912f8ddae4f765b685a4f9d3be602"><div class="ttname"><a href="classSVF_1_1GepStmt.html#adf6912f8ddae4f765b685a4f9d3be602">SVF::GepStmt::getConstantFieldIdx</a></div><div class="ttdeci">s64_t getConstantFieldIdx() const</div><div class="ttdoc">Field index of the gep statement if it access the field of a struct. </div><div class="ttdef"><b>Definition:</b> <a href="SVFStatements_8h_source.html#
|
|
163
|
-
<div class="ttc" id="classSVF_1_1GepObjVar_html"><div class="ttname"><a href="classSVF_1_1GepObjVar.html">SVF::GepObjVar</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#
|
|
162
|
+
<div class="ttc" id="classSVF_1_1GepStmt_html_adf6912f8ddae4f765b685a4f9d3be602"><div class="ttname"><a href="classSVF_1_1GepStmt.html#adf6912f8ddae4f765b685a4f9d3be602">SVF::GepStmt::getConstantFieldIdx</a></div><div class="ttdeci">s64_t getConstantFieldIdx() const</div><div class="ttdoc">Field index of the gep statement if it access the field of a struct. </div><div class="ttdef"><b>Definition:</b> <a href="SVFStatements_8h_source.html#l00453">SVFStatements.h:453</a></div></div>
|
|
163
|
+
<div class="ttc" id="classSVF_1_1GepObjVar_html"><div class="ttname"><a href="classSVF_1_1GepObjVar.html">SVF::GepObjVar</a></div><div class="ttdef"><b>Definition:</b> <a href="SVFVariables_8h_source.html#l00453">SVFVariables.h:453</a></div></div>
|
|
164
164
|
<div class="ttc" id="PointsTo_8h_html"><div class="ttname"><a href="PointsTo_8h.html">PointsTo.h</a></div></div>
|
|
165
165
|
<div class="ttc" id="classSVF_1_1TypeBasedHeapCloning_html_ad043ab95900849a5a894ca4bada4e032"><div class="ttname"><a href="classSVF_1_1TypeBasedHeapCloning.html#ad043ab95900849a5a894ca4bada4e032">SVF::TypeBasedHeapCloning::getGepObjsFromMemObj</a></div><div class="ttdeci">const NodeBS & getGepObjsFromMemObj(const MemObj *memObj, unsigned offset)</div><div class="ttdef"><b>Definition:</b> <a href="TypeBasedHeapCloning_8cpp_source.html#l00132">TypeBasedHeapCloning.cpp:132</a></div></div>
|
|
166
166
|
<div class="ttc" id="classSVF_1_1PointerAnalysis_html_a5ec3d9bf1fc81346c9df29638daedc0f"><div class="ttname"><a href="classSVF_1_1PointerAnalysis.html#a5ec3d9bf1fc81346c9df29638daedc0f">SVF::PointerAnalysis::stat</a></div><div class="ttdeci">PTAStat * stat</div><div class="ttdoc">Statistics. </div><div class="ttdef"><b>Definition:</b> <a href="PointerAnalysis_8h_source.html#l00155">PointerAnalysis.h:155</a></div></div>
|
|
@@ -104,7 +104,7 @@ $(function() {
|
|
|
104
104
|
<div class="ttc" id="classSVF_1_1FlowSensitive_html_ad3518931d3b8a0671cbeb975f853b956"><div class="ttname"><a href="classSVF_1_1FlowSensitive.html#ad3518931d3b8a0671cbeb975f853b956">SVF::FlowSensitive::propAlongDirectEdge</a></div><div class="ttdeci">virtual bool propAlongDirectEdge(const DirectSVFGEdge *edge)</div><div class="ttdoc">Propagate points-to information along a DIRECT SVFG edge. </div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitive_8cpp_source.html#l00295">FlowSensitive.cpp:295</a></div></div>
|
|
105
105
|
<div class="ttc" id="classSVF_1_1DCHGraph_html"><div class="ttname"><a href="classSVF_1_1DCHGraph.html">SVF::DCHGraph</a></div><div class="ttdoc">Dwarf based CHG. </div><div class="ttdef"><b>Definition:</b> <a href="DCHG_8h_source.html#l00208">DCHG.h:208</a></div></div>
|
|
106
106
|
<div class="ttc" id="classSVF_1_1FlowSensitive_html_afed358369102f01f6fe88b1433e704c3"><div class="ttname"><a href="classSVF_1_1FlowSensitive.html#afed358369102f01f6fe88b1433e704c3">SVF::FlowSensitive::finalize</a></div><div class="ttdeci">virtual void finalize()</div><div class="ttdoc">Finalize analysis. </div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitive_8cpp_source.html#l00131">FlowSensitive.cpp:131</a></div></div>
|
|
107
|
-
<div class="ttc" id="classSVF_1_1Options_html_ad148549070b042aeddafca39ee949c77"><div class="ttname"><a href="classSVF_1_1Options.html#ad148549070b042aeddafca39ee949c77">SVF::Options::CTirAliasEval</a></div><div class="ttdeci">static const llvm::cl::opt< bool > CTirAliasEval</div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#
|
|
107
|
+
<div class="ttc" id="classSVF_1_1Options_html_ad148549070b042aeddafca39ee949c77"><div class="ttname"><a href="classSVF_1_1Options.html#ad148549070b042aeddafca39ee949c77">SVF::Options::CTirAliasEval</a></div><div class="ttdeci">static const llvm::cl::opt< bool > CTirAliasEval</div><div class="ttdef"><b>Definition:</b> <a href="Options_8h_source.html#l00238">Options.h:238</a></div></div>
|
|
108
108
|
<div class="ttc" id="classSVF_1_1StmtVFGNode_html_a4dd7615f42971da9b6ec1dc04f0ec4e6"><div class="ttname"><a href="classSVF_1_1StmtVFGNode.html#a4dd7615f42971da9b6ec1dc04f0ec4e6">SVF::StmtVFGNode::getPAGEdge</a></div><div class="ttdeci">const PAGEdge * getPAGEdge() const</div><div class="ttdef"><b>Definition:</b> <a href="VFGNode_8h_source.html#l00133">VFGNode.h:133</a></div></div>
|
|
109
109
|
<div class="ttc" id="namespaceSVF_html_a8234d4b959abc9123993bcff4eee34c1"><div class="ttname"><a href="namespaceSVF.html#a8234d4b959abc9123993bcff4eee34c1">SVF::Map</a></div><div class="ttdeci">std::unordered_map< Key, Value, Hash, KeyEqual, Allocator > Map</div><div class="ttdef"><b>Definition:</b> <a href="SVFBasicTypes_8h_source.html#l00100">SVFBasicTypes.h:100</a></div></div>
|
|
110
110
|
<div class="ttc" id="classSVF_1_1FlowSensitive_html_a9d81537ec20196315a9a2541477ec5bf"><div class="ttname"><a href="classSVF_1_1FlowSensitive.html#a9d81537ec20196315a9a2541477ec5bf">SVF::FlowSensitive::updateCallGraph</a></div><div class="ttdeci">bool updateCallGraph(const CallSiteToFunPtrMap &callsites)</div><div class="ttdoc">Update call graph. </div><div class="ttdef"><b>Definition:</b> <a href="FlowSensitive_8cpp_source.html#l00648">FlowSensitive.cpp:648</a></div></div>
|