svf-lib 1.0.1806 → 1.0.1807

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

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

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

@@ -8,7 +8,6 @@
 #ifndef INCLUDE_UTIL_CASTING_H_
 #define INCLUDE_UTIL_CASTING_H_
 
-
 //===- llvm/Support/Casting.h - Allow flexible, checked, casts --*- C++ -*-===//
 //
 //                     The LLVM Compiler Infrastructure
@@ -382,7 +381,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,7 +311,6 @@ protected:
         return options;
     }
 
-
 protected:
     std::string name;
     std::string description;

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

@@ -116,7 +116,6 @@ protected:
     const SVFInstruction* inst;
 };
 
-
 /*!
  * Context-sensitive thread statement <t,c,s>
  */
@@ -181,7 +180,6 @@ private:
     NodeID tid;
 };
 
-
 /*!
  * Context-sensitive thread <c,t>
  */
@@ -299,7 +297,6 @@ protected:
     bool incycle;
 };
 
-
 /*!
  * Context-sensitive procedure <c,m>
  * c represent current context
@@ -385,7 +382,6 @@ 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,7 +123,6 @@ public:
     }
 };
 
-
 /*!
  * FlowSensitive DPItem
  */
@@ -131,7 +130,6 @@ 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/SCC.h

@@ -121,7 +121,6 @@ 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.
@@ -144,7 +143,6 @@ 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,7 +47,6 @@ namespace SVF
  * Bug Detector Recoder
  */
 
-
 class SVFBugEvent
 {
 public:

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

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

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

@@ -671,7 +671,6 @@ 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,7 +253,6 @@ 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,7 +32,6 @@
  *
  */
 
-
 #ifndef WORKLIST_H_
 #define WORKLIST_H_
 

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

@@ -93,7 +93,6 @@ public:
     /// release z3 solver
     static void releaseSolver();
 
-
     /// null expression
     static z3::expr nullExpr()
     {
@@ -273,7 +272,6 @@ 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);
 
@@ -283,7 +281,6 @@ public:
         return getContext().bool_val(true);
     }
 
-
     /// Return the unique false condition
     static inline Z3Expr getFalseCond()
     {
@@ -315,4 +312,3 @@ 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,7 +156,6 @@ protected:
 class Andersen:  public AndersenBase
 {
 
-
 public:
     typedef SCCDetection<ConstraintGraph*> CGSCC;
     typedef OrderedMap<CallSite, NodeID> CallSite2DummyValPN;
@@ -232,7 +231,6 @@ public:
         return getPTDataTy()->unionPts(id,ptd);
     }
 
-
     void dumpTopLevelPtsTo();
 
     void setDetectPWC(bool flag)
@@ -341,8 +339,6 @@ protected:
     /// SCC detection
     virtual NodeStack& SCCDetect();
 
-
-
     /// Sanitize pts for field insensitive objects
     void sanitizePts()
     {
@@ -376,8 +372,6 @@ protected:
     virtual void cluster(void) const;
 };
 
-
-
 /**
  * Wave propagation with diff points-to set.
  */

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

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

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

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

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

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

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

@@ -20,7 +20,6 @@
 //
 //===----------------------------------------------------------------------===//
 
-
 /*
  * WPASolver.h
  *
@@ -172,7 +171,6 @@ 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,7 +20,6 @@
 //
 //===----------------------------------------------------------------------===//
 
-
 /*
  * FlowSensitiveStat.h
  *

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

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

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

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

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

@@ -322,7 +322,6 @@ public:
         return it->second;
     }
 
-
     Module* getMainLLVMModule() const
     {
         return getModule(0);

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

@@ -466,7 +466,6 @@ std::string dumpValue(const Value* val);
 
 std::string dumpType(const Type* type);
 
-
 /**
  * See more: https://github.com/SVF-tools/SVF/pull/1191
  *

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

@@ -114,7 +114,6 @@ public:
     }
     //@}
 
-
     /// Our visit overrides.
     //@{
     // Instructions that cannot be folded away.

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

@@ -57,7 +57,6 @@ public:
     /// Return size of this object based on LLVM value
     u32_t getNumOfElements(const Type* ety);
 
-
 protected:
 
     /// collect the syms

package/package.json

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