svf-lib 1.0.993 → 1.0.996

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

@@ -148,18 +148,21 @@ public:
         destroy();
     }
     /// Get CallICFGNode given inst
-    CallICFGNode* getCallICFGNode(const Instruction* inst) {
-		return pta->getICFG()->getCallICFGNode(inst);
-	}
-	/// Get SVFFuntion given Function 
-	const SVFFunction* getSVFFun(const Function* fun) const {
-		return LLVMModuleSet::getLLVMModuleSet()->getSVFFunction(fun);
-	}
-	/// Get SVFFModule
-	SVFModule* getSVFModule() const {
-		return pta->getModule();
-	}
-	
+    CallICFGNode* getCallICFGNode(const Instruction* inst)
+    {
+        return pta->getICFG()->getCallICFGNode(inst);
+    }
+    /// Get SVFFuntion given Function
+    const SVFFunction* getSVFFun(const Function* fun) const
+    {
+        return LLVMModuleSet::getLLVMModuleSet()->getSVFFunction(fun);
+    }
+    /// Get SVFFModule
+    SVFModule* getSVFModule() const
+    {
+        return pta->getModule();
+    }
+
     /// Get TCG
     inline ThreadCallGraph* getThreadCallGraph() const
     {
@@ -245,20 +248,22 @@ public:
     /// Whether it is a candidate function for indirect call
     inline bool isCandidateFun(const PTACallGraph::FunctionSet& callees) const
     {
-    	for(PTACallGraph::FunctionSet::const_iterator cit = callees.begin(),
-                    	ecit = callees.end(); cit!=ecit; cit++)
+        for(PTACallGraph::FunctionSet::const_iterator cit = callees.begin(),
+                ecit = callees.end(); cit!=ecit; cit++)
         {
-        	if(candidateFuncSet.find((*cit)->getLLVMFun())!=candidateFuncSet.end())
-        		return true;
+            if(candidateFuncSet.find((*cit)->getLLVMFun())!=candidateFuncSet.end())
+                return true;
         }
         return false;
     }
-	inline bool isCandidateFun(const Function* fun) const {
-		return candidateFuncSet.find(fun)!=candidateFuncSet.end();
-	}
-	inline bool isCandidateFun(const SVFFunction* fun) const {
-		return isCandidateFun(fun->getLLVMFun());
-	}
+    inline bool isCandidateFun(const Function* fun) const
+    {
+        return candidateFuncSet.find(fun)!=candidateFuncSet.end();
+    }
+    inline bool isCandidateFun(const SVFFunction* fun) const
+    {
+        return isCandidateFun(fun->getLLVMFun());
+    }
     /// Whether two functions in the same callgraph scc
     inline bool inSameCallGraphSCC(const PTACallGraphNode* src,const PTACallGraphNode* dst)
     {

package/SVF-osx/include/MemoryModel/LocationSet.h

@@ -104,7 +104,7 @@ public:
     /// Return accumulated constant offset given OffsetValueVec
     s32_t accumulateConstantOffset() const;
 
-    /// Return element number of a type. 
+    /// Return element number of a type.
     u32_t getElementNum(const Type* type) const;
 
     bool addOffsetValue(const Value* offsetValue, const Type* type);
@@ -135,8 +135,10 @@ private:
 
 } // End namespace SVF
 
-template <> struct std::hash<SVF::LocationSet> {
-    size_t operator()(const SVF::LocationSet &ls) const {
+template <> struct std::hash<SVF::LocationSet>
+{
+    size_t operator()(const SVF::LocationSet &ls) const
+    {
         SVF::Hash<std::pair<SVF::NodeID, SVF::NodeID>> h;
         std::hash<SVF::LocationSet::OffsetValueVec> v;
         return h(std::make_pair(ls.accumulateConstantFieldIdx(), v(ls.getOffsetValueVec())));

package/SVF-osx/include/MemoryModel/PersistentPointsToCache.h

@@ -34,7 +34,10 @@ public:
     // TODO: an unordered pair type may be better.
     typedef Map<std::pair<PointsToID, PointsToID>, PointsToID> OpCache;
 
-    static PointsToID emptyPointsToId(void) { return 0; };
+    static PointsToID emptyPointsToId(void)
+    {
+        return 0;
+    };
 
 public:
     PersistentPointsToCache(void) : idCounter(1)
@@ -48,13 +51,13 @@ public:
     /// Clear the cache.
     void clear()
     {
-      for (const Data *d : idToPts) delete d;
-      idToPts.clear();
-      ptsToId.clear();
+        for (const Data *d : idToPts) delete d;
+        idToPts.clear();
+        ptsToId.clear();
 
-      unionCache.clear();
-      complementCache.clear();
-      intersectionCache.clear();
+        unionCache.clear();
+        complementCache.clear();
+        intersectionCache.clear();
     }
 
     /// Resets the cache removing everything except the emptyData it was initialised with.
@@ -108,7 +111,10 @@ public:
     /// Unions lhs and rhs and returns their union's ID.
     PointsToID unionPts(PointsToID lhs, PointsToID rhs)
     {
-        static const DataOp unionOp = [](const Data &lhs, const Data &rhs) { return lhs | rhs; };
+        static const DataOp unionOp = [](const Data &lhs, const Data &rhs)
+        {
+            return lhs | rhs;
+        };
 
         ++totalUnions;
 
@@ -155,7 +161,8 @@ public:
                 ++preemptiveUnions;
                 ++totalUnions;
             }
-        } else ++lookupUnions;
+        }
+        else ++lookupUnions;
 
         return result;
     }
@@ -163,7 +170,10 @@ public:
     /// Relatively complements lhs and rhs (lhs \ rhs) and returns it's ID.
     PointsToID complementPts(PointsToID lhs, PointsToID rhs)
     {
-        static const DataOp complementOp = [](const Data &lhs, const Data &rhs) { return lhs - rhs; };
+        static const DataOp complementOp = [](const Data &lhs, const Data &rhs)
+        {
+            return lhs - rhs;
+        };
 
         ++totalComplements;
 
@@ -214,7 +224,8 @@ public:
                 ++preemptiveComplements;
                 ++totalComplements;
             }
-        } else ++lookupComplements;
+        }
+        else ++lookupComplements;
 
         return result;
     }
@@ -222,7 +233,10 @@ public:
     /// Intersects lhs and rhs (lhs AND rhs) and returns the intersection's ID.
     PointsToID intersectPts(PointsToID lhs, PointsToID rhs)
     {
-        static const DataOp intersectionOp = [](const Data &lhs, const Data &rhs) { return lhs & rhs; };
+        static const DataOp intersectionOp = [](const Data &lhs, const Data &rhs)
+        {
+            return lhs & rhs;
+        };
 
         ++totalIntersections;
 
@@ -287,7 +301,8 @@ public:
                     ++totalUnions;
                 }
             }
-        } else ++lookupIntersections;
+        }
+        else ++lookupIntersections;
 
         return result;
     }

package/SVF-osx/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-osx/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-osx/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-osx/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-osx/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-osx/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;
             }