svf-lib 1.0.1178 → 1.0.1179

package/SVF-osx/include/CFL/CFGNormalizer.h

@@ -27,8 +27,8 @@
  *      Author: Pei Xu
  */
 
-#ifndef INCLUDE_CFL_CFGNormalizer_H_
-#define INCLUDE_CFL_CFGNormalizer_H_
+#ifndef INCLUDE_CFL_CFGNORMALIZER_H_
+#define INCLUDE_CFL_CFGNORMALIZER_H_
 
 #include "CFLGrammar.h"
 
@@ -79,4 +79,4 @@ private:
 
 } // End namespace SVF
 
-#endif /* INCLUDE_CFL_CFGNormalizer_H_*/
+#endif /* INCLUDE_CFL_CFGNORMALIZER_H_*/

package/SVF-osx/include/CFL/CFLAlias.h

@@ -27,6 +27,8 @@
  *      Author: Yulei Sui
  */
 
+#ifndef INCLUDE_CFL_CFLALIAS_H_
+#define INCLUDE_CFL_CFLALIAS_H_
 
 #include "CFL/CFLSolver.h"
 #include "CFL/CFGNormalizer.h"
@@ -144,4 +146,6 @@ private:
     CFLSolver *solver;
 };
 
-}
+} // End namespace SVF
+
+#endif /* INCLUDE_CFL_CFLALIAS_H_*/

package/SVF-osx/include/CFL/CFLGraphBuilder.h

@@ -27,6 +27,9 @@
  *      Author: Pei Xu
  */
 
+#ifndef INCLUDE_CFL_CFLGRAPHBUILDER_H_
+#define INCLUDE_CFL_CFLGRAPHBUILDER_H_
+
 #include "CFL/CFLGrammar.h"
 #include "Graphs/CFLGraph.h"
 namespace SVF
@@ -118,6 +121,7 @@ public:
         }
         return cflGraph;
     }
+
     /// Build graph from file
     void build(std::string filename, CFLGraph* cflGraph);
 
@@ -138,6 +142,8 @@ public:
     {
         return this->kind2AttrsMap;
     }
+
+
 };
 
 class AliasCFLGraphBuilder : public CFLGraphBuilder
@@ -145,8 +151,12 @@ class AliasCFLGraphBuilder : public CFLGraphBuilder
 public:
     /// Build Bidirectional graph by copying nodes and edges from const graph inherited from GenericGraph
     CFLGraph* buildBigraph(ConstraintGraph *graph, Kind startKind, GrammarBase *grammar);
+
+    /// Build Bidirectional graph by copying nodes and edges from any graph inherited from GenericGraph
+    /// And transfer Load Store to copy edge and address edge to construct PEG style CFG
+    CFLGraph* buildBiPEGgraph(ConstraintGraph *graph, Kind startKind, GrammarBase *grammar, SVFIR* pag);
 };
 
 }// SVF
 
-
+#endif /* INCLUDE_CFL_CFLGRAPHBUILDER_H_*/

package/SVF-osx/include/CFL/PEGGrammar.txt

@@ -0,0 +1,28 @@
+Start:  
+   V
+Terminal:
+   Addr Copy Store Load Gep Vgep 
+Productions:
+   F -> epsilon;
+   M -> Addr V Addrbar;
+   V -> Fbar V F;
+   V -> Gepbar_i V Gep_i;
+   V -> M;
+   V -> epsilon;
+   F -> F Copy;
+   F -> F Copy M;
+   Fbar -> epsilon;
+   Fbar -> Copybar Fbar;
+   Fbar -> M Copybar Fbar;
+   Gep_1 -> Gep_0 F Vgep;
+   Gepbar_1 -> Vgepbar Fbar Gepbar_0;
+   Gepbarpath -> Gepbar_0 Gepbar_0;
+   Gepbarpath -> Gepbarpath Gepbar_0;
+   Gep_3 -> Gep_0;
+   Gepbar_3 -> Gepbar_0;
+   Memcpy -> Addrbar V Addr;
+   Memcpy -> Gep_i Memcpy Gepbar_i;
+   Memcpy -> F Memcpy Fbar;
+   V -> Gepbar_i Memcpy Gep_i;
+   V -> Gep_i Memcpy Gepbar_i;
+   V -> Gepbarpath V Gep_0;

package/SVF-osx/include/DDA/DDAStat.h

@@ -8,7 +8,7 @@
 #ifndef DDASTAT_H_
 #define DDASTAT_H_
 
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 #include "MemoryModel/PointsTo.h"
 
 namespace SVF

package/SVF-osx/include/Graphs/ICFGStat.h

@@ -29,7 +29,7 @@
 #ifndef INCLUDE_UTIL_ICFGSTAT_H_
 #define INCLUDE_UTIL_ICFGSTAT_H_
 
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 #include "Graphs/ICFG.h"
 #include <iomanip>
 

package/SVF-osx/include/Graphs/SVFGStat.h

@@ -37,7 +37,7 @@
 #define SVFGSTAT_H_
 
 #include "Graphs/SVFG.h"
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 #include "Util/SCC.h"
 
 namespace SVF

package/SVF-osx/include/MTA/MTAStat.h

@@ -8,7 +8,7 @@
 #ifndef MTASTAT_H_
 #define MTASTAT_H_
 
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 
 namespace SVF
 {

package/SVF-osx/include/SVF-FE/LLVMUtil.h

@@ -1,4 +1,4 @@
-//===- SVFUtil.h -- Analysis helper functions----------------------------//
+//===- LLVMUtil.h -- Analysis helper functions----------------------------//
 //
 //                     SVF: Static Value-Flow Analysis
 //
@@ -21,7 +21,7 @@
 //===----------------------------------------------------------------------===//
 
 /*
- * SVFUtil.h
+ * LLVMUtil.h
  *
  *  Created on: Apr 11, 2013
  *      Author: Yulei Sui

package/SVF-osx/include/Util/ExtAPI.h

@@ -63,14 +63,14 @@ overwrite_app_function = 1: Use specifications in ExtAPI.json to overwrite the u
 Function type represents the properties of the function.
 For example,
 "EFT_ALLOC" represents if this external function allocates a new object and assigns it to one of its arguments,
-For the selection of function type and a more detailed explanation, please refer to the definition of enum *extf_t* in ExtAPI.h.
+For the selection of function type and a more detailed explanation, please refer to the definition of enum *extType* in ExtAPI.h.
 
 *** [4] Function operations
 Function operations indicate the relationships between input and output,
 mainly between function parameters or between parameters and return values after the execution.
 For example,
 "copy": ["A2", "L"] indicates that after this external function is executed, the value of the 2nd parameter is copied into the return value.
-For the selection of function type and a more detailed explanation, please refer to the definition of enum *extType* in ExtAPI.h.
+For the selection of function type and a more detailed explanation, please refer to the definition of enum *extf_t* in ExtAPI.h.
 
 For operands of function operation, e.g., "A2", "L", there are the following options:
 "A": represents a parameter;

package/SVF-osx/include/Util/Options.h

@@ -5,7 +5,7 @@
 
 #include <sstream>
 #include "FastCluster/fastcluster.h"
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 #include "MemoryModel/PointerAnalysisImpl.h"
 #include "Util/NodeIDAllocator.h"
 #include "MSSA/MemSSA.h"
@@ -253,6 +253,8 @@ public:
     static const llvm::cl::opt<std::string> CFLGraph;
     static const llvm::cl::opt<bool> PrintCFL;
     static const llvm::cl::opt<bool> FlexSymMap;
+    static const llvm::cl::opt<bool>  PEGTransfer;
+    static const llvm::cl::opt<bool> NullDummyNode;
 
     // Loop Analysis
     static const llvm::cl::opt<bool> LoopAnalysis;

package/SVF-osx/include/Util/PTAStat.h

@@ -0,0 +1,174 @@
+//===- PTAStat.h -- Base class for statistics---------------------------------//
+//
+//                     SVF: Static Value-Flow Analysis
+//
+// Copyright (C) <2013-2017>  <Yulei Sui>
+//
+
+// This program is free software: you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+//===----------------------------------------------------------------------===//
+
+/*
+ * AndersenStat.h
+ *
+ *  Created on: Oct 12, 2013
+ *      Author: Yulei Sui
+ */
+
+#ifndef ANDERSENSTAT_H_
+#define ANDERSENSTAT_H_
+
+#include "Util/BasicTypes.h"
+#include "MemoryModel/PointsTo.h"
+#include <iostream>
+#include <map>
+#include <string>
+
+using namespace std;
+
+namespace SVF
+{
+
+class PointerAnalysis;
+
+/*!
+ * Pointer Analysis Statistics
+ */
+class PTAStat
+{
+public:
+    static const char* TotalAnalysisTime; ///< Total analysis time
+    static const char* SCCDetectionTime; ///< Total SCC detection time
+    static const char* SCCMergeTime; ///< Total SCC merge time
+
+    static const char* ProcessLoadStoreTime;///< time of processing loads and stores
+    static const char* ProcessCopyGepTime;	///< time of processing copys and geps
+    static const char* UpdateCallGraphTime;	///< time of updating call graph
+
+    static const char* TotalNumOfPointers;	///< Total SVFIR value node
+    static const char* TotalNumOfObjects;	///< Total SVFIR object node
+    static const char* TotalNumOfFieldObjects;	///< Total SVFIR field object node
+    static const char* MaxStructSize;	///< Max struct size
+    static const char* TotalNumOfEdges;	///< Total SVFIR edge number
+
+    static const char* NumOfAddrs;		///< SVFIR addr edge
+    static const char* NumOfLoads;		///< SVFIR load edge
+    static const char* NumOfStores;		///< SVFIR store edge
+    static const char* NumOfCopys;		///< SVFIR copy edge
+    static const char* NumOfGeps;		///< SVFIR gep edge
+    static const char* NumOfCalls;		///< SVFIR call edge
+    static const char* NumOfReturns;	///< SVFIR return edge
+
+    static const char* NumOfProcessedAddrs;		///< SVFIR processed addr edge
+    static const char* NumOfProcessedLoads;		///< SVFIR processed load edge
+    static const char* NumOfProcessedStores;	///< SVFIR processed store edge
+    static const char* NumOfProcessedCopys;		///< SVFIR processed copy edge
+    static const char* NumOfProcessedGeps;		///< SVFIR processed gep edge
+
+    static const char* NumOfSfr;                ///< num of field representatives
+    static const char* NumOfFieldExpand;
+
+    static const char* NumOfFunctionObjs;	///< Function numbers
+    static const char* NumOfGlobalObjs;	///< SVFIR global object node
+    static const char* NumOfHeapObjs;	///< SVFIR heap object node
+    static const char* NumOfStackObjs;	///< SVFIR stack object node
+
+    static const char* NumOfObjsHasVarStruct;	///< SVFIR object node has var struct (maybe nested with array)
+    static const char* NumOfObjsHasVarArray;	///< SVFIR object node has var array (maybe nested with struct)
+    static const char* NumOfObjsHasConstStruct;	///< SVFIR object node has const struct (maybe nested with array)
+    static const char* NumOfObjsHasConstArray;	///< SVFIR object node has const array (maybe nested with struct)
+    static const char* NumOfNonPtrObjs;	///< SVFIR object node which is non pointer type object (do not have pts)
+    static const char* NumOfConstantObjs;	///< SVFIR object node which is purely constant
+
+    static const char* NumberOfFieldInsensitiveObj;
+    static const char* NumberOfFieldSensitiveObj;
+
+    static const char* NumOfPointers;	///< SVFIR value node, each of them maps to a llvm value
+    static const char* NumOfGepFieldPointers;	///< SVFIR gep value node (field value, dynamically created dummy node)
+
+    static const char* NumOfMemObjects;	///< SVFIR object node, each of them maps to a llvm value
+    static const char* NumOfGepFieldObjects;	///< SVFIR gep object node (field obj, dynamically created dummy node)
+
+    static const char* AveragePointsToSetSize;		///< Average points-to size of all variables
+    static const char* AverageTopLevPointsToSetSize; ///< Average points-to size of top-level variables
+    static const char* MaxPointsToSetSize;			///< Max points-to size
+
+    static const char* NumOfIterations;	///< Number of iterations during resolution
+
+    static const char* NumOfIndirectCallSites;	///< Number of indirect callsites
+    static const char* NumOfIndirectEdgeSolved;	///< Number of indirect calledge resolved
+
+    static const char* NumOfSCCDetection; ///< Number of scc detection performed
+    static const char* NumOfCycles;   ///< Number of scc cycles detected
+    static const char* NumOfPWCCycles;   ///< Number of scc cycles detected
+    static const char* NumOfNodesInCycles; ///< Number of nodes in cycles detected
+    static const char* MaxNumOfNodesInSCC;	///< max Number of nodes in one scc
+
+    static const char* NumOfNullPointer;	///< Number of pointers points-to null
+
+    typedef Map<const char*,u32_t> NUMStatMap;
+
+    typedef Map<const char*,double> TIMEStatMap;
+
+    enum ClockType
+    {
+        Wall,
+        CPU,
+    };
+
+    PTAStat(PointerAnalysis* p);
+    virtual ~PTAStat() {}
+
+    virtual inline void startClk()
+    {
+        startTime = getClk(true);
+    }
+    virtual inline void endClk()
+    {
+        endTime = getClk(true);
+    }
+    /// When mark is true, real clock is always returned. When mark is false, it is
+    /// only returned when Options::MarkedClocksOnly is not set.
+    /// Default call for getClk is unmarked, while MarkedClocksOnly is false by default.
+    static double getClk(bool mark=false);
+
+    NUMStatMap generalNumMap;
+    NUMStatMap PTNumStatMap;
+    TIMEStatMap timeStatMap;
+    NodeBS localVarInRecursion;
+
+    double startTime;
+    double endTime;
+
+    virtual void performStat();
+
+    virtual void printStat(string str = "");
+
+    virtual void performStatPerQuery(NodeID) {}
+
+    virtual void printStatPerQuery(NodeID, const PointsTo&) {}
+
+    virtual void callgraphStat();
+private:
+    void bitcastInstStat();
+    void branchStat();
+
+    PointerAnalysis* pta;
+    std::string moduleName;
+};
+
+} // End namespace SVF
+
+#endif /* ANDERSENSTAT_H_ */

package/SVF-osx/include/WPA/Andersen.h

@@ -27,8 +27,8 @@
  *      Author: Yulei Sui
  */
 
-#ifndef ANDERSENPASS_H_
-#define ANDERSENPASS_H_
+#ifndef INCLUDE_WPA_ANDERSEN_H_
+#define INCLUDE_WPA_ANDERSEN_H_
 
 #include "MemoryModel/PointerAnalysisImpl.h"
 #include "WPA/WPAStat.h"
@@ -433,4 +433,4 @@ public:
 
 } // End namespace SVF
 
-#endif /* ANDERSENPASS_H_ */
+#endif /* INCLUDE_WPA_ANDERSEN_H_ */

package/SVF-osx/include/WPA/WPAStat.h

@@ -31,7 +31,7 @@
 #ifndef FLOWSENSITIVESTAT_H_
 #define FLOWSENSITIVESTAT_H_
 
-#include "MemoryModel/PTAStat.h"
+#include "Util/PTAStat.h"
 #include "WPA/FlowSensitive.h"
 #include "WPA/VersionedFlowSensitive.h"
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-lib",
-  "version": "1.0.1178",
+  "version": "1.0.1179",
   "description": "SVF's npm support",
   "main": "index.js",
   "scripts": {