svf-lib 1.0.1815 → 1.0.1817

package/SVF-osx/svf/include/MemoryModel/PersistentPointsToDS.h

@@ -791,6 +791,7 @@ private:
     }
     ///@}
 
+
 private:
     UpdatedVarMap outUpdatedVarMap;
     UpdatedVarMap inUpdatedVarMap;

package/SVF-osx/svf/include/MemoryModel/PointerAnalysis.h

@@ -86,6 +86,7 @@ public:
         PathS_DDA,		///< Guarded value-flow DDA
         Cxt_DDA,		///< context sensitive DDA
 
+
         Default_PTA		///< default pta without any analysis
     };
 

package/SVF-osx/svf/include/MemoryModel/PointerAnalysisImpl.h

@@ -157,6 +157,7 @@ protected:
         return ptD.get();
     }
 
+
     /// Finalization of pointer analysis, and normalize points-to information to Bit Vector representation
     void finalize() override;
 

package/SVF-osx/svf/include/MemoryModel/PointsTo.h

@@ -251,4 +251,5 @@ struct std::hash<SVF::PointsTo>
     }
 };
 
+
 #endif  // POINTSTO_H_

package/SVF-osx/svf/include/SABER/DoubleFreeChecker.h

@@ -64,6 +64,7 @@ public:
     /// Report file/close bugs
     void reportBug(ProgSlice* slice) override;
 
+
     /// Validate test cases for regression test purpose
     void testsValidation(ProgSlice* slice);
     void validateSuccessTests(ProgSlice* slice, const SVFFunction* fun);

package/SVF-osx/svf/include/SABER/ProgSlice.h

@@ -60,6 +60,7 @@ public:
 
     typedef SaberCondAllocator::SVFGNodeToSVFGNodeSetMap SVFGNodeToSVFGNodeSetMap;
 
+
     /// Constructor
     ProgSlice(const SVFGNode* src, SaberCondAllocator* pa, const SVFG* graph):
         root(src), partialReachable(false), fullReachable(false), reachGlob(false),

package/SVF-osx/svf/include/SABER/SaberCondAllocator.h

@@ -36,6 +36,7 @@
 #include "Graphs/SVFG.h"
 #include "Util/Z3Expr.h"
 
+
 namespace SVF
 {
 
@@ -57,6 +58,7 @@ public:
     typedef FIFOWorkList<const SVFBasicBlock*> CFWorkList;	///< worklist for control-flow guard computation
     typedef Map<const SVFGNode*, Set<const SVFGNode*>> SVFGNodeToSVFGNodeSetMap;
 
+
     /// Constructor
     SaberCondAllocator();
 
@@ -231,6 +233,7 @@ public:
     }
     //@}
 
+
     /// mark neg Z3 expression
     inline void setNegCondInst(const Condition &condition, const SVFInstruction* inst)
     {
@@ -295,6 +298,7 @@ private:
     /// extract subexpression from a Z3 expression
     void extractSubConds(const Condition &condition, NodeBS &support) const;
 
+
     FunToExitBBsMap funToExitBBsMap;		///< map a function to all its basic blocks calling program exit
     BBToCondMap bbToCondMap;				///< map a basic block to its path condition starting from root
     const SVFGNode* curEvalSVFGNode{};			///< current llvm value to evaluate branch condition when computing guards

package/SVF-osx/svf/include/SABER/SaberSVFGBuilder.h

@@ -34,6 +34,7 @@
 #include "SVFIR/SVFValue.h"
 #include "Util/WorkList.h"
 
+
 namespace SVF
 {
 

package/SVF-osx/svf/include/SVFIR/SVFIR.h

@@ -687,4 +687,6 @@ typedef SVFIR PAG;
 
 } // End namespace SVF
 
+
+
 #endif /* INCLUDE_SVFIR_H_ */

package/SVF-osx/svf/include/SVFIR/SVFStatements.h

@@ -20,6 +20,7 @@
 //
 //===----------------------------------------------------------------------===//
 
+
 /*
  * SVFStatements.h
  *
@@ -550,6 +551,7 @@ public:
 
 };
 
+
 /*!
  * Call
  */

package/SVF-osx/svf/include/SVFIR/SVFType.h

@@ -300,6 +300,7 @@ public:
         return getPointerToTy;
     }
 
+
     inline void setTypeInfo(StInfo* ti)
     {
         typeinfo = ti;
@@ -502,6 +503,7 @@ public:
         numOfElement = elemNum;
     }
 
+
 };
 
 class SVFOtherType : public SVFType

package/SVF-osx/svf/include/SVFIR/SVFValue.h

@@ -40,6 +40,7 @@ namespace SVF
 /// LLVM Aliases and constants
 typedef SVF::GraphPrinter GraphPrinter;
 
+
 class SVFInstruction;
 class SVFBasicBlock;
 class SVFArgument;
@@ -134,6 +135,7 @@ public:
         return bb2PIdom;
     }
 
+
     inline Map<const SVFBasicBlock*,BBSet>& getDomTreeMap()
     {
         return dtBBsMap;
@@ -1102,6 +1104,7 @@ public:
     }
 };
 
+
 class CallSite
 {
     friend class SVFIRReader;

package/SVF-osx/svf/include/SVFIR/SVFVariables.h

@@ -73,6 +73,7 @@ public:
         DummyObjNode,
     };
 
+
 protected:
     const SVFValue* value; ///< value of this SVFIR node
     SVFStmt::KindToSVFStmtMapTy InEdgeKindToSetMap;
@@ -253,6 +254,8 @@ public:
     //@}
 };
 
+
+
 /*
  * Value (Pointer) variable
  */
@@ -368,6 +371,7 @@ public:
     virtual const std::string toString() const;
 };
 
+
 /*
  * Gep Value (Pointer) variable, this variable can be dynamic generated for field sensitive analysis
  * e.g. memcpy, temp gep value variable needs to be created
@@ -436,6 +440,7 @@ public:
     virtual const std::string toString() const;
 };
 
+
 /*
  * Gep Obj variable, this is dynamic generated for field sensitive analysis
  * Each gep obj variable is one field of a MemObj (base)

package/SVF-osx/svf/include/SVFIR/SymbolTableInfo.h

@@ -30,6 +30,7 @@
 #ifndef INCLUDE_SVFIR_SYMBOLTABLEINFO_H_
 #define INCLUDE_SVFIR_SYMBOLTABLEINFO_H_
 
+
 #include "Util/SVFUtil.h"
 #include "MemoryModel/AccessPath.h"
 #include "SVFIR/SVFModule.h"
@@ -241,6 +242,7 @@ public:
     }
     //@}
 
+
     /// Statistics
     //@{
     inline u32_t getTotalSymNum() const
@@ -371,6 +373,7 @@ protected:
     Set<const StInfo*> stInfos;
 };
 
+
 /*!
  * Memory object symbols or MemObj (address-taken variables in LLVM-based languages)
  */
@@ -441,6 +444,7 @@ public:
     /// Check if byte size is a const value
     bool isConstantByteSize() const;
 
+
     /// object attributes methods
     //@{
     bool isFunction() const;
@@ -643,6 +647,7 @@ public:
     //@}
 };
 
+
 } // End namespace SVF
 
 #endif /* INCLUDE_SVFIR_SYMBOLTABLEINFO_H_ */

package/SVF-osx/svf/include/Util/CDGBuilder.h

@@ -60,8 +60,11 @@ public:
     /// build map at icfg node level
     void buildICFGNodeControlMap();
 
+
+
 private:
 
+
     /// extract basic block edges to be processed
     static void
     extractBBS(const SVFFunction *func,
@@ -72,14 +75,17 @@ private:
     extractNodesBetweenPdomNodes(const SVFBasicBlock *succ, const SVFBasicBlock *LCA,
                                  std::vector<const SVFBasicBlock *> &tgtNodes);
 
+
     void dfsNodesBetweenPdomNodes(const SVFBasicBlock *cur,
                                   const SVFBasicBlock *tgt,
                                   std::vector<const SVFBasicBlock *> &path,
                                   std::vector<const SVFBasicBlock *> &tgtNodes,
                                   SVFLoopAndDomInfo *ld);
 
+
     s64_t getBBSuccessorBranchID(const SVFBasicBlock *BB, const SVFBasicBlock *Succ);
 
+
     /// update map
     inline void updateMap(const SVFBasicBlock *pred, const SVFBasicBlock *bb, s32_t pos)
     {
@@ -87,6 +93,7 @@ private:
         _svfdependentOnMap[bb][pred].insert(pos);
     }
 
+
 private:
     CDG *_controlDG;
     Map<const SVFBasicBlock *, Map<const SVFBasicBlock *, Set<s32_t>>> _svfcontrolMap; ///< map a basicblock to its controlling BBs (position, set of BBs)
@@ -96,4 +103,5 @@ private:
 };
 }
 
+
 #endif //SVF_CDGBUILDER_H

package/SVF-osx/svf/include/Util/CallGraphBuilder.h

@@ -20,6 +20,7 @@
 //
 //===----------------------------------------------------------------------===//
 
+
 /*
  * CallGraphBuilder.h
  *
@@ -69,4 +70,5 @@ public:
 
 } // End namespace SVF
 
+
 #endif /* INCLUDE_UTIL_CALLGRAPHBUILDER_H_ */

package/SVF-osx/svf/include/Util/Casting.h

@@ -8,6 +8,7 @@
 #ifndef INCLUDE_UTIL_CASTING_H_
 #define INCLUDE_UTIL_CASTING_H_
 
+
 //===- llvm/Support/Casting.h - Allow flexible, checked, casts --*- C++ -*-===//
 //
 //                     The LLVM Compiler Infrastructure
@@ -381,7 +382,7 @@ inline typename cast_retty<X, Y *>::ret_type cast(Y *Val)
 
 template <class X, class Y>
 inline typename cast_retty<X, std::unique_ptr<Y>>::ret_type
-        cast(std::unique_ptr<Y> &&Val)
+cast(std::unique_ptr<Y> &&Val)
 {
     assert(SVFUtil::isa<X>(Val.get()) && "cast<Ty>() argument of incompatible type!");
     using ret_type = typename cast_retty<X, std::unique_ptr<Y>>::ret_type;

package/SVF-osx/svf/include/Util/CommandLine.h

@@ -311,6 +311,7 @@ protected:
         return options;
     }
 
+
 protected:
     std::string name;
     std::string description;

package/SVF-osx/svf/include/Util/CxtStmt.h

@@ -116,6 +116,7 @@ protected:
     const SVFInstruction* inst;
 };
 
+
 /*!
  * Context-sensitive thread statement <t,c,s>
  */
@@ -180,6 +181,7 @@ private:
     NodeID tid;
 };
 
+
 /*!
  * Context-sensitive thread <c,t>
  */
@@ -297,6 +299,7 @@ protected:
     bool incycle;
 };
 
+
 /*!
  * Context-sensitive procedure <c,m>
  * c represent current context
@@ -382,6 +385,7 @@ protected:
     const SVFFunction* fun;
 };
 
+
 /*!
  * Context-sensitive procedure <t,c,m>
  * t represent current thread during traversing

package/SVF-osx/svf/include/Util/DPItem.h

@@ -123,6 +123,7 @@ public:
     }
 };
 
+
 /*!
  * FlowSensitive DPItem
  */
@@ -130,6 +131,7 @@ template<class LocCond>
 class StmtDPItem : public DPItem
 {
 
+
 protected:
     const LocCond* curloc;
 

package/SVF-osx/svf/include/Util/NodeIDAllocator.h

@@ -192,8 +192,8 @@ public:
 
         // From all the candidates, returns the best mapping for pointsToSets (points-to set -> # occurrences).
         static inline std::pair<hclust_fast_methods, std::vector<NodeID>> determineBestMapping(
-                    const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
-                    Map<PointsTo, unsigned> pointsToSets, const std::string &evalSubtitle, double &evalTime);
+            const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
+            Map<PointsTo, unsigned> pointsToSets, const std::string &evalSubtitle, double &evalTime);
 
     };
 };

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

@@ -53,11 +53,29 @@ public:
 
     NodeBS localVarInRecursion;
 
+    inline void setMemUsageBefore(u32_t vmrss, u32_t vmsize)
+    {
+        _vmrssUsageBefore = vmrss;
+        _vmsizeUsageBefore = vmsize;
+    }
+
+    inline void setMemUsageAfter(u32_t vmrss, u32_t vmsize)
+    {
+        _vmrssUsageAfter = vmrss;
+        _vmsizeUsageAfter = vmsize;
+    }
+
     void performStat() override;
 
     void callgraphStat() override;
-private:
+
+
+protected:
     PointerAnalysis* pta;
+    u32_t _vmrssUsageBefore;
+    u32_t _vmrssUsageAfter;
+    u32_t _vmsizeUsageBefore;
+    u32_t _vmsizeUsageAfter;
 };
 
 } // End namespace SVF

package/SVF-osx/svf/include/Util/SCC.h

@@ -121,6 +121,7 @@ public:
           _I(0)
     {}
 
+
     // Return a handle to the stack of nodes in topological
     // order.  This will be used to seed the initial solution
     // and improve efficiency.
@@ -143,6 +144,7 @@ public:
         return rep!= UINT_MAX ? rep : n ;
     }
 
+
     /// whether the node is in a cycle
     inline bool isInCycle(NodeID n) const
     {

package/SVF-osx/svf/include/Util/SVFBugReport.h

@@ -47,6 +47,7 @@ namespace SVF
  * Bug Detector Recoder
  */
 
+
 class SVFBugEvent
 {
 public:

package/SVF-osx/svf/include/Util/SVFStat.h

@@ -33,6 +33,7 @@
 namespace SVF
 {
 
+
 /*!
  * Pointer Analysis Statistics
  */

package/SVF-osx/svf/include/Util/SVFUtil.h

@@ -671,6 +671,7 @@ template <typename... Ts>
 constexpr bool is_sequence_container_v = is_sequence_container<Ts...>::value;
 ///@}
 
+
 } // End namespace SVFUtil
 
 } // End namespace SVF

package/SVF-osx/svf/include/Util/ThreadAPI.h

@@ -253,6 +253,7 @@ public:
     }
     //@}
 
+
     /// Return true if this call exits/terminate a thread
     //@{
     inline bool isTDExit(const SVFInstruction *inst) const

package/SVF-osx/svf/include/Util/WorkList.h

@@ -32,6 +32,7 @@
  *
  */
 
+
 #ifndef WORKLIST_H_
 #define WORKLIST_H_
 

package/SVF-osx/svf/include/Util/Z3Expr.h

@@ -93,6 +93,7 @@ public:
     /// release z3 solver
     static void releaseSolver();
 
+
     /// null expression
     static z3::expr nullExpr()
     {
@@ -272,6 +273,7 @@ public:
     /// output Z3 expression as a string
     static std::string dumpStr(const Z3Expr &z3Expr);
 
+
     /// get the number of subexpression of a Z3 expression
     static u32_t getExprSize(const Z3Expr &z3Expr);
 
@@ -281,6 +283,7 @@ public:
         return getContext().bool_val(true);
     }
 
+
     /// Return the unique false condition
     static inline Z3Expr getFalseCond()
     {
@@ -312,3 +315,4 @@ struct std::hash<SVF::Z3Expr>
 };
 
 #endif //Z3_EXAMPLE_Z3EXPR_H
+

package/SVF-osx/svf/include/Util/iterator.h

@@ -352,7 +352,7 @@ struct pointee_iter
 template <typename RangeT, typename WrappedIteratorT =
           decltype(std::begin(std::declval<RangeT>()))>
 iter_range<pointee_iter<WrappedIteratorT>>
-                                        make_pointee_range(RangeT &&Range)
+make_pointee_range(RangeT &&Range)
 {
     using PointeeIteratorT = pointee_iter<WrappedIteratorT>;
     return make_range(PointeeIteratorT(std::begin(std::forward<RangeT>(Range))),
@@ -388,7 +388,7 @@ public:
 template <typename RangeT, typename WrappedIteratorT =
           decltype(std::begin(std::declval<RangeT>()))>
 iter_range<pointer_iterator<WrappedIteratorT>>
-        make_pointer_range(RangeT &&Range)
+make_pointer_range(RangeT &&Range)
 {
     using PointerIteratorT = pointer_iterator<WrappedIteratorT>;
     return make_range(PointerIteratorT(std::begin(std::forward<RangeT>(Range))),

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

@@ -156,6 +156,7 @@ protected:
 class Andersen:  public AndersenBase
 {
 
+
 public:
     typedef SCCDetection<ConstraintGraph*> CGSCC;
     typedef OrderedMap<CallSite, NodeID> CallSite2DummyValPN;
@@ -231,6 +232,7 @@ public:
         return getPTDataTy()->unionPts(id,ptd);
     }
 
+
     void dumpTopLevelPtsTo();
 
     void setDetectPWC(bool flag)
@@ -339,6 +341,8 @@ protected:
     /// SCC detection
     virtual NodeStack& SCCDetect();
 
+
+
     /// Sanitize pts for field insensitive objects
     void sanitizePts()
     {
@@ -372,6 +376,8 @@ protected:
     virtual void cluster(void) const;
 };
 
+
+
 /**
  * Wave propagation with diff points-to set.
  */

package/SVF-osx/svf/include/WPA/AndersenPWC.h

@@ -30,6 +30,7 @@
 #ifndef PROJECT_ANDERSENSFR_H
 #define PROJECT_ANDERSENSFR_H
 
+
 #include "WPA/Andersen.h"
 #include "WPA/CSC.h"
 #include "MemoryModel/PointsTo.h"
@@ -93,6 +94,8 @@ protected:
 
 };
 
+
+
 /*!
  * Selective Cycle Detection with Stride-based Field Representation
  */

package/SVF-osx/svf/include/WPA/WPAFSSolver.h

@@ -32,6 +32,7 @@
  *
  */
 
+
 #ifndef WPAFSSOLVER_H_
 #define WPAFSSOLVER_H_
 
@@ -97,6 +98,8 @@ protected:
     }
 };
 
+
+
 /*!
  * Solver based on SCC cycles.
  */
@@ -168,6 +171,8 @@ protected:
     NodeID curSCCID;	///< index of current SCC.
 };
 
+
+
 /*!
  * Only solve nodes which need to be analyzed.
  */

package/SVF-osx/svf/include/WPA/WPAPass.h

@@ -20,6 +20,7 @@
 //
 //===----------------------------------------------------------------------===//
 
+
 /*
  * @file: WPA.h
  * @author: yesen
@@ -32,6 +33,7 @@
  *
  */
 
+
 #ifndef WPA_H_
 #define WPA_H_
 

package/SVF-osx/svf/include/WPA/WPASolver.h

@@ -20,6 +20,7 @@
 //
 //===----------------------------------------------------------------------===//
 
+
 /*
  * WPASolver.h
  *
@@ -171,6 +172,7 @@ protected:
     /// print out statistics for i-th iteration
     u32_t iterationForPrintStat;
 
+
     /// Get node on the graph
     inline GNODE* Node(NodeID id)
     {

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

@@ -20,6 +20,7 @@
 //
 //===----------------------------------------------------------------------===//
 
+
 /*
  * FlowSensitiveStat.h
  *

package/SVF-osx/svf-llvm/include/SVF-LLVM/BreakConstantExpr.h

@@ -44,6 +44,7 @@ public:
     virtual bool runOnModule (Module & M);
 };
 
+
 //
 // Pass: MergeFunctionRets
 //

package/SVF-osx/svf-llvm/include/SVF-LLVM/DCHG.h

@@ -447,6 +447,7 @@ private:
         return nullptr;
     }
 
+
     /// Creates an edge between from t1 to t2.
     DCHEdge* addEdge(const DIType* t1, const DIType* t2, DCHEdge::GEdgeKind et);
     /// Returns the edge between t1 and t2 if it exists, returns nullptr otherwise.

package/SVF-osx/svf-llvm/include/SVF-LLVM/GEPTypeBridgeIterator.h

@@ -100,6 +100,7 @@ public:
         return const_cast<Value*>(&**OpIt);
     }
 
+
     generic_bridge_gep_type_iterator& operator++()
     {
         if ( CurTy.getInt() )
@@ -132,6 +133,7 @@ public:
         return *this;
     }
 
+
     generic_bridge_gep_type_iterator operator++(int)
     {
         generic_bridge_gep_type_iterator tmp = *this;
@@ -141,6 +143,7 @@ public:
 
 };
 
+
 typedef generic_bridge_gep_type_iterator<> bridge_gep_iterator;
 
 inline bridge_gep_iterator bridge_gep_begin(const User* GEP)