svf-lib 1.0.993 → 1.0.996

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

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

@@ -33,7 +33,7 @@ public:
         this->ptsTo = ptsTo;
         mainModule = LLVMModuleSet::getLLVMModuleSet()->getMainLLVMModule();
 
-        // Add a named metadata node used to check whether or not 
+        // Add a named metadata node used to check whether or not
         // this IR has been annotated with Andersen information
         if (writeFlag)
             mainModule->getOrInsertNamedMetadata("SVFIR-Annotated");
@@ -146,7 +146,7 @@ private:
     void processInstructionNode(Instruction *instruction, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "inode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = instruction->getContext();
@@ -164,7 +164,7 @@ private:
     void processArgumentNode(Argument *argument, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "anode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = argument->getContext();
@@ -182,7 +182,7 @@ private:
     void processFunctionNode(Function *function, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "fnode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = function->getContext();
@@ -200,7 +200,7 @@ private:
     void processGlobalVarNode(GlobalVariable *globalVar, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "gnode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = globalVar->getContext();
@@ -218,7 +218,7 @@ private:
     void processBasicBlockNode(BasicBlock *basicBlock, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "bnode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = basicBlock->getContext();
@@ -236,7 +236,7 @@ private:
     void processConstantNode(const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "cnode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = mainModule->getContext();
@@ -254,7 +254,7 @@ private:
     void processInlineAsmNode(llvm::InlineAsm *inlineAsm, const SVF::NodeID &nodeId, bool writeFlag)
     {
         std::string label = "iAsmnode-" + std::to_string(nodeId);
-        
+
         if (writeFlag)
         {
             LLVMContext &context = mainModule->getContext();

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

@@ -83,10 +83,11 @@ public:
     SVFModule* buildSVFModule(Module &mod);
     SVFModule* buildSVFModule(const std::vector<std::string> &moduleNameVec);
 
-	inline SVFModule* getSVFModule() {
-		assert(svfModule && "svfModule has not been built yet!");
-		return svfModule;
-	}
+    inline SVFModule* getSVFModule()
+    {
+        assert(svfModule && "svfModule has not been built yet!");
+        return svfModule;
+    }
 
     void preProcessBCs(std::vector<std::string> &moduleNameVec);
 
@@ -148,15 +149,15 @@ public:
 
     bool hasDeclaration(const SVFFunction *fun) const
     {
-    	if(fun->isDeclaration() && !hasDefinition(fun))
-    		return false;
+        if(fun->isDeclaration() && !hasDefinition(fun))
+            return false;
 
-    	const SVFFunction* funDef = fun;
+        const SVFFunction* funDef = fun;
         if(fun->isDeclaration() && hasDefinition(fun))
-        	funDef = getDefinition(fun);
+            funDef = getDefinition(fun);
 
-    	FunDefToDeclsMapTy::const_iterator it = FunDefToDeclsMap.find(funDef);
-    	return it != FunDefToDeclsMap.end();
+        FunDefToDeclsMapTy::const_iterator it = FunDefToDeclsMap.find(funDef);
+        return it != FunDefToDeclsMap.end();
     }
 
     const FunctionSetType& getDeclaration(const Function *fun) const
@@ -166,9 +167,9 @@ public:
 
     const FunctionSetType& getDeclaration(const SVFFunction *fun) const
     {
-    	const SVFFunction* funDef = fun;
+        const SVFFunction* funDef = fun;
         if(fun->isDeclaration() && hasDefinition(fun))
-        	funDef = getDefinition(fun);
+            funDef = getDefinition(fun);
 
         FunDefToDeclsMapTy::const_iterator it = FunDefToDeclsMap.find(funDef);
         assert(it != FunDefToDeclsMap.end() && "does not have a function definition (body)?");

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

@@ -406,10 +406,10 @@ bool isObject (const Value * ref);
 /// Return true if the value refers to constant data, e.g., i32 0
 inline bool isConstantData(const Value* val)
 {
-	return SVFUtil::isa<ConstantData>(val)
-			|| SVFUtil::isa<ConstantAggregate>(val)
-			|| SVFUtil::isa<MetadataAsValue>(val)
-			|| SVFUtil::isa<BlockAddress>(val);
+    return SVFUtil::isa<ConstantData>(val)
+           || SVFUtil::isa<ConstantAggregate>(val)
+           || SVFUtil::isa<MetadataAsValue>(val)
+           || SVFUtil::isa<BlockAddress>(val);
 }
 
 /// Method for dead function, which does not have any possible caller

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

@@ -130,8 +130,9 @@ public:
     {
         visitCallSite(&II);
     }
-    void visitCallBrInst(CallBrInst &I) {
-      return visitCallSite(&I);
+    void visitCallBrInst(CallBrInst &I)
+    {
+        return visitCallSite(&I);
     }
     void visitCallSite(CallSite cs);
     void visitReturnInst(ReturnInst &I);
@@ -155,9 +156,9 @@ public:
     /// TODO: var arguments need to be handled.
     /// https://llvm.org/docs/LangRef.html#id1911
     void visitVAArgInst(VAArgInst&);
-    void visitVACopyInst(VACopyInst&){}
-    void visitVAEndInst(VAEndInst&){}
-    void visitVAStartInst(VAStartInst&){}
+    void visitVACopyInst(VACopyInst&) {}
+    void visitVAEndInst(VAEndInst&) {}
+    void visitVAStartInst(VAStartInst&) {}
 
     /// <result> = freeze ty <val>
     /// If <val> is undef or poison, ‘freeze’ returns an arbitrary, but fixed value of type `ty`
@@ -293,7 +294,8 @@ protected:
     /// Add Address edge
     inline AddrStmt* addAddrEdge(NodeID src, NodeID dst)
     {
-        if(AddrStmt *edge = pag->addAddrStmt(src, dst)){
+        if(AddrStmt *edge = pag->addAddrStmt(src, dst))
+        {
             setCurrentBBAndValueForPAGEdge(edge);
             return edge;
         }
@@ -302,7 +304,8 @@ protected:
     /// Add Copy edge
     inline CopyStmt* addCopyEdge(NodeID src, NodeID dst)
     {
-        if(CopyStmt *edge = pag->addCopyStmt(src, dst)){
+        if(CopyStmt *edge = pag->addCopyStmt(src, dst))
+        {
             setCurrentBBAndValueForPAGEdge(edge);
             return edge;
         }
@@ -339,8 +342,9 @@ protected:
         if(UnaryOPStmt *edge = pag->addUnaryOPStmt(src, dst, opcode))
             setCurrentBBAndValueForPAGEdge(edge);
     }
-    /// Add Branch statement 
-    inline void addBranchStmt(NodeID br, NodeID cond, const BranchStmt::SuccAndCondPairVec& succs){
+    /// Add Branch statement
+    inline void addBranchStmt(NodeID br, NodeID cond, const BranchStmt::SuccAndCondPairVec& succs)
+    {
         if(BranchStmt *edge = pag->addBranchStmt(br, cond, succs))
             setCurrentBBAndValueForPAGEdge(edge);
     }

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

@@ -39,7 +39,7 @@
 namespace SVF
 {
 
-class SymbolTableBuilder 
+class SymbolTableBuilder
 {
 
 private:
@@ -47,7 +47,8 @@ private:
 
 public:
     /// Constructor
-    SymbolTableBuilder(SymbolTableInfo* si): symInfo(si){
+    SymbolTableBuilder(SymbolTableInfo* si): symInfo(si)
+    {
     }
 
     /// Start building memory model

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

@@ -36,9 +36,11 @@
 #include "CUDD/cuddInt.h"
 #include "z3++.h"
 
-namespace SVF {
+namespace SVF
+{
 
-class BDDExprManager {
+class BDDExprManager
+{
 public:
     typedef DdNode BDDExpr;
     typedef Map<u32_t, BDDExpr *> IndexToBDDExpr;
@@ -47,11 +49,13 @@ private:
     IndexToBDDExpr indexToBddCondMap;
     DdManager *m_bdd_mgr;
 
-    inline BDDExpr *BddOne() const {
+    inline BDDExpr *BddOne() const
+    {
         return Cudd_ReadOne(m_bdd_mgr);
     }
 
-    inline BDDExpr *BddZero() const {
+    inline BDDExpr *BddZero() const
+    {
         return Cudd_ReadLogicZero(m_bdd_mgr);
     }
 
@@ -65,7 +69,8 @@ public:
     //@{
     static BDDExprManager *getBDDExprMgr();
 
-    static void releaseBDDExprMgr() {
+    static void releaseBDDExprMgr()
+    {
         delete bddExprMgr;
         bddExprMgr = nullptr;
     }
@@ -74,7 +79,8 @@ public:
     /// Destructor
     virtual ~BDDExprManager();
 
-    BDDExpr *createCond(u32_t i) {
+    BDDExpr *createCond(u32_t i)
+    {
         assert(indexToBddCondMap.find(i) == indexToBddCondMap.end() &&
                "This should be fresh index to create new BDD");
         BDDExpr *bddCond = Cudd_bddIthVar(m_bdd_mgr, i);
@@ -85,18 +91,21 @@ public:
     virtual BDDExpr *createFreshBranchCond(const Instruction *inst);
 
     /// Return the number of condition expressions
-    virtual inline u32_t getCondNumber() {
+    virtual inline u32_t getCondNumber()
+    {
         return Cudd_ReadNodeCount(m_bdd_mgr);
     }
 
 
     /// Return the unique true condition
-    inline BDDExpr *getTrueCond() const {
+    inline BDDExpr *getTrueCond() const
+    {
         return trueCond;
     }
 
     /// Return the unique false condition
-    inline BDDExpr *getFalseCond() const {
+    inline BDDExpr *getFalseCond() const
+    {
         return falseCond;
     }
 
@@ -109,17 +118,20 @@ public:
     virtual BDDExpr *NEG(BDDExpr *lhs);
     //@}
 
-    virtual bool isNegCond(const BDDExpr *cond) {
+    virtual bool isNegCond(const BDDExpr *cond)
+    {
         return false;
     }
 
     /// Whether the condition is satisfiable
-    virtual bool isSatisfiable(const BDDExpr *cond) {
+    virtual bool isSatisfiable(const BDDExpr *cond)
+    {
         return cond != getFalseCond();
     }
 
     /// Whether lhs and rhs are equivalent branch conditions
-    virtual bool isEquivalentBranchCond(const BDDExpr *lhs, const BDDExpr *rhs){
+    virtual bool isEquivalentBranchCond(const BDDExpr *lhs, const BDDExpr *rhs)
+    {
         return lhs == rhs;
     }
 
@@ -127,7 +139,8 @@ public:
     bool isAllPathReachable(const BDDExpr *e);
 
     /// Get condition using condition id (z3 ast id)
-    virtual BDDExpr *getCond(u32_t id) {
+    virtual BDDExpr *getCond(u32_t id)
+    {
         auto it = indexToBddCondMap.find(id);
         assert(it != indexToBddCondMap.end() && "condition not found!");
         return it->second;
@@ -135,13 +148,15 @@ public:
 
     /// Get/Set llvm conditional expression
     //{@
-    inline const Instruction *getCondInst(const BDDExpr *cond) const {
+    inline const Instruction *getCondInst(const BDDExpr *cond) const
+    {
         CondToTermInstMap::const_iterator it = condToInstMap.find(cond);
         assert(it != condToInstMap.end() && "this should be a fresh condition");
         return it->second;
     }
 
-    inline void setCondInst(const BDDExpr *cond, const Instruction *inst) {
+    inline void setCondInst(const BDDExpr *cond, const Instruction *inst)
+    {
         assert(condToInstMap.find(cond) == condToInstMap.end() && "this should be a fresh condition");
         condToInstMap[cond] = inst;
     }
@@ -161,7 +176,8 @@ public:
 
     std::string dumpStr(const BDDExpr *e) const;
 
-    inline std::string getMemUsage() {
+    inline std::string getMemUsage()
+    {
         return std::to_string(Cudd_ReadMemoryInUse(m_bdd_mgr));
     }