svf-lib 1.0.992 → 1.0.995

package/SVF-linux/include/MemoryModel/PersistentPointsToDS.h

@@ -589,7 +589,7 @@ public:
     virtual inline bool updateDFInFromIn(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) override
     {
         if (varHasNewDFInPts(srcLoc, srcVar)
-            && this->unionPtsThroughIds(this->getDFInPtIdRef(dstLoc, dstVar), this->getDFInPtIdRef(srcLoc, srcVar)))
+                && this->unionPtsThroughIds(this->getDFInPtIdRef(dstLoc, dstVar), this->getDFInPtIdRef(srcLoc, srcVar)))
         {
             setVarDFInSetUpdated(dstLoc, dstVar);
             return true;
@@ -601,7 +601,7 @@ public:
     virtual inline bool updateDFInFromOut(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) override
     {
         if (varHasNewDFOutPts(srcLoc, srcVar)
-            && this->unionPtsThroughIds(this->getDFInPtIdRef(dstLoc, dstVar), this->getDFOutPtIdRef(srcLoc, srcVar)))
+                && this->unionPtsThroughIds(this->getDFInPtIdRef(dstLoc, dstVar), this->getDFOutPtIdRef(srcLoc, srcVar)))
         {
             setVarDFInSetUpdated(dstLoc, dstVar);
             return true;

package/SVF-linux/include/MemoryModel/PointerAnalysis.h

@@ -165,10 +165,11 @@ protected:
     TypeSystem *typeSystem;
 
 public:
-	/// Get ICFG
-	inline ICFG* getICFG() const {
-		return pag->getICFG();
-	}
+    /// Get ICFG
+    inline ICFG* getICFG() const
+    {
+        return pag->getICFG();
+    }
     /// Return number of resolved indirect call edges
     inline u32_t getNumOfResolvedIndCallEdge() const
     {

package/SVF-linux/include/MemoryModel/PointsTo.h

@@ -124,8 +124,14 @@ public:
     /// If not, remaps.
     void checkAndRemap(void);
 
-    const_iterator begin(void) const { return PointsToIterator(this); }
-    const_iterator end(void) const { return PointsToIterator(this, true); }
+    const_iterator begin(void) const
+    {
+        return PointsToIterator(this);
+    }
+    const_iterator end(void) const
+    {
+        return PointsToIterator(this, true);
+    }
 
     MappingPtr getNodeMapping(void) const;
 

package/SVF-linux/include/MemoryModel/SVFIR.h

@@ -43,10 +43,10 @@ namespace SVF
 class SVFIR : public IRGraph
 {
 
-friend class SVFIRBuilder;
-friend class ExternalPAG;
-friend class PAGBuilderFromFile;
-friend class TypeBasedHeapCloning;  
+    friend class SVFIRBuilder;
+    friend class ExternalPAG;
+    friend class PAGBuilderFromFile;
+    friend class TypeBasedHeapCloning;
 
 public:
     typedef Set<const CallICFGNode*> CallSiteSet;
@@ -447,7 +447,8 @@ public:
 private:
 
     /// Map a SVFStatement type to a set of corresponding SVF statements
-    inline void addToStmt2TypeMap(SVFStmt* edge) {
+    inline void addToStmt2TypeMap(SVFStmt* edge)
+    {
         bool added = KindToSVFStmtSetMap[edge->getEdgeKind()].insert(edge).second;
         assert(added && "duplicated edge, not added!!!");
         if (edge->isPTAEdge())

package/SVF-linux/include/MemoryModel/SVFStatements.h

@@ -194,7 +194,8 @@ private:
  connecting RHS expression and LHS expression with an assignment  (e.g., LHSExpr = RHSExpr)
  Only one operand on the right handside of an assignment
 */
-class AssignStmt : public SVFStmt{
+class AssignStmt : public SVFStmt
+{
 
 private:
     AssignStmt();                      ///< place holder
@@ -244,18 +245,22 @@ public:
     }
     //@}
 
-    inline SVFVar* getRHSVar() const {
+    inline SVFVar* getRHSVar() const
+    {
         return SVFStmt::getSrcNode();
-    }  
-    inline SVFVar* getLHSVar() const {
+    }
+    inline SVFVar* getLHSVar() const
+    {
         return SVFStmt::getDstNode();
-    }  
-    inline NodeID getRHSVarID() const {
+    }
+    inline NodeID getRHSVarID() const
+    {
         return SVFStmt::getSrcID();
-    }  
-    inline NodeID getLHSVarID() const {
+    }
+    inline NodeID getLHSVarID() const
+    {
         return SVFStmt::getDstID();
-    }  
+    }
 
     virtual const std::string toString() const = 0;
 };
@@ -441,7 +446,8 @@ public:
         return getLocationSet().getOffsetValueVec();
     }
     /// Return TRUE if this is a constant location set.
-    inline bool isConstantOffset() const{
+    inline bool isConstantOffset() const
+    {
         return getLocationSet().isConstantOffset();
     }
     /// Return accumulated constant offset (when accessing array or struct) if this offset is a constant.
@@ -455,11 +461,11 @@ public:
         assert(isVariantFieldGep()==false && "Can't retrieve the LocationSet if using a variable field index (pointer arithmetic) for struct field access ");
         return getLocationSet().accumulateConstantFieldIdx();
     }
-    /// Gep statement with a variant field index (pointer arithmetic) for struct field access 
+    /// Gep statement with a variant field index (pointer arithmetic) for struct field access
     inline bool isVariantFieldGep() const
     {
         return variantField;
-    }   
+    }
 
     /// constructor
     GepStmt(SVFVar* s, SVFVar* d, const LocationSet& l, bool varfld=false) : AssignStmt(s,d,SVFStmt::Gep), ls(l), variantField(varfld)
@@ -472,7 +478,7 @@ public:
 
 
 /*!
- * Call 
+ * Call
  */
 class CallPE: public AssignStmt
 {
@@ -481,7 +487,7 @@ private:
     CallPE(const CallPE &);  ///< place holder
     void operator=(const CallPE &); ///< place holder
 
-    const CallICFGNode* call;		        /// the callsite statement calling from 
+    const CallICFGNode* call;		        /// the callsite statement calling from
     const FunEntryICFGNode* entry;		/// the function exit statement calling to
 public:
     /// Methods for support type inquiry through isa, cast, and dyn_cast:
@@ -493,12 +499,12 @@ public:
     static inline bool classof(const SVFStmt *edge)
     {
         return edge->getEdgeKind() == SVFStmt::Call
-        	|| edge->getEdgeKind() == SVFStmt::ThreadFork;
+               || edge->getEdgeKind() == SVFStmt::ThreadFork;
     }
     static inline bool classof(const GenericPAGEdgeTy *edge)
     {
         return edge->getEdgeKind() == SVFStmt::Call
-        	|| edge->getEdgeKind() == SVFStmt::ThreadFork;
+               || edge->getEdgeKind() == SVFStmt::ThreadFork;
     }
     //@}
 
@@ -529,7 +535,7 @@ public:
 
 
 /*!
- * Return 
+ * Return
  */
 class RetPE: public AssignStmt
 {
@@ -550,12 +556,12 @@ public:
     static inline bool classof(const SVFStmt *edge)
     {
         return edge->getEdgeKind() == SVFStmt::Ret
-			|| edge->getEdgeKind() == SVFStmt::ThreadJoin;
+               || edge->getEdgeKind() == SVFStmt::ThreadJoin;
     }
     static inline bool classof(const GenericPAGEdgeTy *edge)
     {
         return edge->getEdgeKind() == SVFStmt::Ret
-    		|| edge->getEdgeKind() == SVFStmt::ThreadJoin;
+               || edge->getEdgeKind() == SVFStmt::ThreadJoin;
     }
     //@}
 
@@ -587,7 +593,8 @@ public:
 /*
 * Program statements with multiple operands including BinaryOPStmt, CmpStmt and PhiStmt
 */
-class MultiOpndStmt : public SVFStmt{
+class MultiOpndStmt : public SVFStmt
+{
 public:
     typedef std::vector<SVFVar*> OPVars;
 private:
@@ -647,7 +654,8 @@ public:
     {
         return opVars.size();
     }
-    inline const OPVars& getOpndVars() const{
+    inline const OPVars& getOpndVars() const
+    {
         return opVars;
     }
     inline OPVars::const_iterator opVarBegin() const
@@ -702,18 +710,20 @@ public:
     {
         assert(opnds.size()==icfgNodes.size() && "Numbers of operands and their ICFGNodes are not consistent?");
     }
-    void addOpVar(SVFVar* op, const ICFGNode* inode){
+    void addOpVar(SVFVar* op, const ICFGNode* inode)
+    {
         opVars.push_back(op);
         opICFGNodes.push_back(inode);
         assert(opVars.size()==opICFGNodes.size() && "Numbers of operands and their ICFGNodes are not consistent?");
     }
 
     /// Return the corresponding ICFGNode of this operand
-    inline const ICFGNode* getOpICFGNode(u32_t op_idx) const{
+    inline const ICFGNode* getOpICFGNode(u32_t op_idx) const
+    {
         return opICFGNodes.at(op_idx);
     }
 
-    /// Return true if this is a phi at the function exit 
+    /// Return true if this is a phi at the function exit
     /// to receive one or multiple return values of this function
     bool isFunctionRetPhi() const;
 
@@ -759,13 +769,16 @@ public:
     }
     virtual const std::string toString() const override;
 
-    inline const SVFVar* getCondition() const{
+    inline const SVFVar* getCondition() const
+    {
         return condition;
     }
-    inline const SVFVar* getTrueValue() const{
+    inline const SVFVar* getTrueValue() const
+    {
         return  getOpVar(0);
     }
-    inline const SVFVar* getFalseValue() const{
+    inline const SVFVar* getFalseValue() const
+    {
         return  getOpVar(1);
     }
 };
@@ -811,7 +824,7 @@ public:
     {
         return predicate;
     }
-    
+
     virtual const std::string toString() const override;
 };
 
@@ -902,10 +915,12 @@ public:
     {
         return opcode;
     }
-    inline const SVFVar* getOpVar() const{
+    inline const SVFVar* getOpVar() const
+    {
         return SVFStmt::getSrcNode();
     }
-    inline const SVFVar* getRes() const{
+    inline const SVFVar* getRes() const
+    {
         return SVFStmt::getDstNode();
     }
     NodeID getOpVarID() const;
@@ -916,7 +931,7 @@ public:
 
 
 /*!
- * Branch statements including if/else and switch 
+ * Branch statements including if/else and switch
  */
 class BranchStmt: public SVFStmt
 {
@@ -926,8 +941,8 @@ private:
     BranchStmt();                      ///< place holder
     BranchStmt(const BranchStmt &);  ///< place holder
     void operator=(const BranchStmt &); ///< place holder
-    SVFVar* getSrcNode();  ///< place holder, not allowed 
-    SVFVar* getDstNode();    ///< place holder, not allowed 
+    SVFVar* getSrcNode();  ///< place holder, not allowed
+    SVFVar* getDstNode();    ///< place holder, not allowed
     NodeID getSrcID();  ///< place holder, use getOpVarID(pos) instead
     NodeID getDstID();    ///< place holder, use getResID() instead
 
@@ -961,33 +976,38 @@ public:
     bool isUnconditional() const;
     /// The branch is conditional if cond is not a null value
     bool isConditional() const;
-    /// Return the condition 
+    /// Return the condition
     const SVFVar* getCondition() const;
-    const SVFVar* getBranchInst() const{
+    const SVFVar* getBranchInst() const
+    {
         return brInst;
     }
-    
+
     /// For example if(c) {stmt1} else {stmt2}
     /// successor(0): stmt1, 1
-    /// successor(1): stmt2, 0 
+    /// successor(1): stmt2, 0
 
     /// For example switch(c) case 0: {stmt1; break;} case 1: {stmt2; break;} default {stmt3: break}
     /// successor(0): stmt1, 0
-    /// successor(1): stmt2, 1 
-    /// successor(3): stmt3, -1 
+    /// successor(1): stmt2, 1
+    /// successor(3): stmt3, -1
 
     /// Successors of this branch statement
     ///@{
-    u32_t getNumSuccessors() const{
+    u32_t getNumSuccessors() const
+    {
         return successors.size();
     }
-    const SuccAndCondPairVec& getSuccessors() const{
+    const SuccAndCondPairVec& getSuccessors() const
+    {
         return successors;
     }
-    const ICFGNode* getSuccessor (u32_t i) const{
+    const ICFGNode* getSuccessor (u32_t i) const
+    {
         return successors.at(i).first;
     }
-    s32_t getSuccessorCondValue (u32_t i) const{ 
+    s32_t getSuccessorCondValue (u32_t i) const
+    {
         return successors.at(i).second;
     }
     //@}
@@ -996,7 +1016,7 @@ public:
 
 
 /*!
- * Thread Fork 
+ * Thread Fork
  */
 class TDForkPE: public CallPE
 {
@@ -1034,7 +1054,7 @@ public:
 
 
 /*!
- * Thread Join 
+ * Thread Join
  */
 class TDJoinPE: public RetPE
 {

package/SVF-linux/include/MemoryModel/SVFVariables.h

@@ -45,9 +45,9 @@ class SVFVar;
 typedef GenericNode<SVFVar,SVFStmt> GenericPAGNodeTy;
 class SVFVar : public GenericPAGNodeTy
 {
-friend class IRGraph;
-friend class SVFIR;
-friend class VFG;
+    friend class IRGraph;
+    friend class SVFIR;
+    friend class VFG;
 
 public:
     /// Nine kinds of SVFIR variables
@@ -177,7 +177,7 @@ public:
         else
             return false;
     }
-    
+
     /// Get incoming SVFStmt iterator
     inline SVFStmt::SVFStmtSetTy::iterator getIncomingEdgesBegin(SVFStmt::PEDGEK kind) const
     {
@@ -233,7 +233,8 @@ private:
         SVFStmt::KindToSVFStmtMapTy::const_iterator it = InEdgeKindToSetMap.find(SVFStmt::Gep);
         if (it != InEdgeKindToSetMap.end())
         {
-            for(auto gep : it->second){
+            for(auto gep : it->second)
+            {
                 if(SVFUtil::cast<GepStmt>(gep)->isVariantFieldGep())
                     return true;
             }

package/SVF-linux/include/MemoryModel/SymbolTableInfo.h

@@ -47,7 +47,7 @@ class StInfo;
  */
 class SymbolTableInfo
 {
-friend class SymbolTableBuilder;
+    friend class SymbolTableBuilder;
 
 public:
 
@@ -154,7 +154,7 @@ public:
     {
         return mod;
     }
-        /// Module
+    /// Module
     inline void setModule(SVFModule* m)
     {
         mod = m;
@@ -278,7 +278,7 @@ public:
     }
     //@}
 
- 
+
     /// Statistics
     //@{
     inline u32_t getTotalSymNum() const
@@ -389,7 +389,7 @@ protected:
 /*!
  * Memory object symbols or MemObj (address-taken variables in LLVM-based languages)
  */
-class MemObj 
+class MemObj
 {
 
 private:
@@ -427,7 +427,7 @@ public:
     /// Get obj type
     const Type* getType() const;
 
-    /// Get the number of elements of this object 
+    /// Get the number of elements of this object
     u32_t getNumOfElements() const;
 
     /// Set the number of elements of this object
@@ -496,11 +496,11 @@ private:
     /// All field infos after flattening a struct
     std::vector<const Type*> finfo;
     /// stride represents the number of repetitive elements if this StInfo represent an ArrayType. stride is 1 by default.
-    u32_t stride; 
+    u32_t stride;
     /// number of elements after flattenning (including array elements)
-    u32_t numOfFlattenElements; 
+    u32_t numOfFlattenElements;
     /// number of fields after flattenning (ignoring array elements)
-    u32_t numOfFlattenFields; 
+    u32_t numOfFlattenFields;
     /// Type vector of fields
     std::vector<const Type*> flattenElementTypes;
     /// Max field limit
@@ -554,16 +554,19 @@ public:
     }
 
     /// Return number of elements after flattenning (including array elements)
-    inline u32_t getNumOfFlattenElements() const {
+    inline u32_t getNumOfFlattenElements() const
+    {
         return numOfFlattenElements;
     }
 
     /// Return the number of fields after flattenning (ignoring array elements)
-    inline u32_t getNumOfFlattenFields() const {
+    inline u32_t getNumOfFlattenFields() const
+    {
         return numOfFlattenFields;
     }
     /// Return the stride
-    inline u32_t getStride() const{
+    inline u32_t getStride() const
+    {
         return stride;
     }
 };
@@ -573,7 +576,7 @@ public:
  */
 class ObjTypeInfo
 {
-friend class SymbolTableBuilder;
+    friend class SymbolTableBuilder;
 public:
     typedef enum
     {
@@ -613,7 +616,7 @@ public:
     virtual ~ObjTypeInfo()
     {
     }
-    
+
     /// Get LLVM type
     inline const Type* getType() const
     {
@@ -632,14 +635,14 @@ public:
         maxOffsetLimit = limit;
     }
 
-    /// Set the number of elements of this object 
+    /// Set the number of elements of this object
     inline void setNumOfElements(u32_t num)
     {
         elemNum = num;
         setMaxFieldOffsetLimit(num);
     }
 
-    /// Get the number of elements of this object 
+    /// Get the number of elements of this object
     inline u32_t getNumOfElements() const
     {
         return elemNum;

package/SVF-linux/include/SABER/PathCondAllocator.h

@@ -133,12 +133,14 @@ public:
     {
         return condMgr->getCondInst(cond);
     }
-    inline void setCondInst(const Condition* cond, const Instruction* inst){
+    inline void setCondInst(const Condition* cond, const Instruction* inst)
+    {
         condMgr->setCondInst(cond, inst);
     }
     //@}
 
-    bool isNegCond(const Condition *condition) {
+    bool isNegCond(const Condition *condition)
+    {
         return condMgr->isNegCond(condition);
     }
 
@@ -189,20 +191,24 @@ public:
     void printPathCond();
 
     /// whether condition is satisfiable
-    inline bool isSatisfiable(Condition* condition){
+    inline bool isSatisfiable(Condition* condition)
+    {
         return condMgr->isSatisfiable(condition);
     }
 
     /// whether condition is satisfiable for all possible boolean guards
-    inline bool isAllPathReachable(Condition* condition){
+    inline bool isAllPathReachable(Condition* condition)
+    {
         return condMgr->isAllPathReachable(condition);
     }
 
-    bool isEquivalentBranchCond(const Condition *lhs, const Condition *rhs) const{
+    bool isEquivalentBranchCond(const Condition *lhs, const Condition *rhs) const
+    {
         return condMgr->isEquivalentBranchCond(lhs, rhs);
     }
 
-    inline ICFG* getICFG() const {
+    inline ICFG* getICFG() const
+    {
         return PAG::getPAG()->getICFG();
     }
 
@@ -276,7 +282,8 @@ private:
 
 
     /// Release memory
-    void destroy(){
+    void destroy()
+    {
 
     }
 

package/SVF-linux/include/SABER/ProgSlice.h

@@ -253,7 +253,8 @@ protected:
     }
     //@}
 
-    inline bool isEquivalentBranchCond(const Condition *lhs, const Condition *rhs) const {
+    inline bool isEquivalentBranchCond(const Condition *lhs, const Condition *rhs) const
+    {
         return pathAllocator->isEquivalentBranchCond(lhs, rhs);
     };
 

package/SVF-linux/include/SABER/SaberSVFGBuilder.h

@@ -59,7 +59,7 @@ public:
     /// Add ActualParmVFGNode
     inline void addActualParmVFGNode(const PAGNode* pagNode, const CallICFGNode* cs)
     {
-    	svfg->addActualParmVFGNode(pagNode, cs);
+        svfg->addActualParmVFGNode(pagNode, cs);
     }
 
 protected:

package/SVF-linux/include/SABER/SrcSnkDDA.h

@@ -169,19 +169,23 @@ public:
     ///@{
     virtual void initSrcs() = 0;
     virtual void initSnks() = 0;
-    virtual bool isSourceLikeFun(const SVFFunction* fun) {
+    virtual bool isSourceLikeFun(const SVFFunction* fun)
+    {
         return false;
     }
 
-    virtual bool isSinkLikeFun(const SVFFunction* fun) {
+    virtual bool isSinkLikeFun(const SVFFunction* fun)
+    {
         return false;
     }
 
-    bool isSource(const SVFGNode* node) const {
+    bool isSource(const SVFGNode* node) const
+    {
         return getSources().find(node)!=getSources().end();
     }
 
-    bool isSink(const SVFGNode* node) const {
+    bool isSink(const SVFGNode* node) const
+    {
         return getSinks().find(node)!=getSinks().end();
     }
     ///@}

package/SVF-linux/include/SVF-FE/CHGBuilder.h

@@ -29,9 +29,11 @@
 
 #include "Graphs/CHG.h"
 
-namespace SVF{
+namespace SVF
+{
 
-class CHGBuilder{
+class CHGBuilder
+{
 
 private:
     CHGraph* chg;

package/SVF-linux/include/SVF-FE/DataFlowUtil.h

@@ -119,25 +119,26 @@ public:
 };
 
 
-class PTACFInfoBuilder{
+class PTACFInfoBuilder
+{
 public:
     typedef Map<const Function*, DominatorTree*> FunToDTMap;  ///< map a function to its dominator tree
     typedef Map<const Function*, PostDominatorTree*> FunToPostDTMap;  ///< map a function to its post dominator tree
     typedef Map<const Function*, LoopInfo*> FunToLoopInfoMap;  ///< map a function to its loop info
 
     /// Constructor
-     PTACFInfoBuilder();
+    PTACFInfoBuilder();
 
-     ~PTACFInfoBuilder();
+    ~PTACFInfoBuilder();
 
-     /// Get loop info of a function
-     LoopInfo* getLoopInfo(const Function* f);
+    /// Get loop info of a function
+    LoopInfo* getLoopInfo(const Function* f);
 
-     /// Get post dominator tree of a function
-     PostDominatorTree* getPostDT(const Function* f);
+    /// Get post dominator tree of a function
+    PostDominatorTree* getPostDT(const Function* f);
 
-     /// Get dominator tree of a function
-     DominatorTree* getDT(const Function* f);
+    /// Get dominator tree of a function
+    DominatorTree* getDT(const Function* f);
 
 private:
     FunToLoopInfoMap funToLoopInfoMap;      ///< map a function to its loop info