svf-lib 1.0.1376 → 1.0.1377

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

@@ -1,205 +0,0 @@
-//===- WPASolver.h -- Generic WPA solver--------------------------------------//
-//
-//                     SVF: Static Value-Flow Analysis
-//
-// Copyright (C) <2013-2017>  <Yulei Sui>
-//
-
-// This program is free software: you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation, either version 3 of the License, or
-// (at your option) any later version.
-
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License
-// along with this program.  If not, see <http://www.gnu.org/licenses/>.
-//
-//===----------------------------------------------------------------------===//
-
-
-/*
- * WPASolver.h
- *
- *  Created on: Oct 25, 2013
- *      Author: Yulei Sui
- */
-
-#ifndef GRAPHSOLVER_H_
-#define GRAPHSOLVER_H_
-
-#include "Util/WorkList.h"
-
-namespace SVF
-{
-
-/*
- * Generic graph solver for whole program pointer analysis
- */
-template<class GraphType>
-class WPASolver
-{
-
-public:
-    ///Define the GTraits and node iterator for printing
-    typedef SVF::GenericGraphTraits<GraphType> GTraits;
-    typedef typename GTraits::NodeRef           GNODE;
-    typedef typename GTraits::EdgeType          GEDGE;
-    typedef typename GTraits::ChildIteratorType child_iterator;
-
-    typedef SCCDetection<GraphType> SCC;
-
-    typedef FIFOWorkList<NodeID> WorkList;
-
-protected:
-
-    /// Constructor
-    WPASolver(): reanalyze(false), iterationForPrintStat(1000), _graph(nullptr), numOfIteration(0)
-    {
-    }
-    /// Destructor
-    virtual ~WPASolver() = default;
-
-    /// Get SCC detector
-    inline SCC* getSCCDetector() const
-    {
-        return scc.get();
-    }
-
-    /// Get/Set graph methods
-    //@{
-    const inline GraphType graph()
-    {
-        return _graph;
-    }
-    inline void setGraph(GraphType g)
-    {
-        _graph = g;
-        scc = std::make_unique<SCC>(_graph);
-    }
-    //@}
-
-    /// SCC detection
-    virtual inline NodeStack& SCCDetect()
-    {
-        getSCCDetector()->find();
-        return getSCCDetector()->topoNodeStack();
-    }
-    virtual inline NodeStack& SCCDetect(NodeSet& candidates)
-    {
-        getSCCDetector()->find(candidates);
-        return getSCCDetector()->topoNodeStack();
-    }
-
-    virtual inline void initWorklist()
-    {
-        NodeStack& nodeStack = SCCDetect();
-        while (!nodeStack.empty())
-        {
-            NodeID nodeId = nodeStack.top();
-            nodeStack.pop();
-            pushIntoWorklist(nodeId);
-        }
-    }
-
-    virtual inline void solveWorklist()
-    {
-        while (!isWorklistEmpty())
-        {
-            NodeID nodeId = popFromWorklist();
-            // Keep solving until workList is empty.
-            processNode(nodeId);
-            collapseFields();
-        }
-    }
-
-    /// Following methods are to be implemented in child class, in order to achieve a fully worked PTA
-    //@{
-    /// Process each node on the graph, to be implemented in the child class
-    virtual inline void processNode(NodeID) {}
-    /// collapse positive weight cycles of a graph
-    virtual void collapseFields() {}
-    /// dump statistics
-    /// Propagation for the solving, to be implemented in the child class
-    virtual void propagate(GNODE* v)
-    {
-        child_iterator EI = GTraits::direct_child_begin(*v);
-        child_iterator EE = GTraits::direct_child_end(*v);
-        for (; EI != EE; ++EI)
-        {
-            if (propFromSrcToDst(*(EI.getCurrent())))
-                pushIntoWorklist(Node_Index(*EI));
-        }
-    }
-    /// Propagate information from source to destination node, to be implemented in the child class
-    virtual bool propFromSrcToDst(GEDGE*)
-    {
-        return false;
-    }
-    //@}
-
-    virtual NodeID sccRepNode(NodeID id) const
-    {
-        return getSCCDetector()->repNode(id);
-    }
-
-    /// Worklist operations
-    //@{
-    inline NodeID popFromWorklist()
-    {
-        return sccRepNode(worklist.pop());
-    }
-
-    virtual inline void pushIntoWorklist(NodeID id)
-    {
-        worklist.push(sccRepNode(id));
-    }
-    inline bool isWorklistEmpty()
-    {
-        return worklist.empty();
-    }
-    inline bool isInWorklist(NodeID id)
-    {
-        return worklist.find(id);
-    }
-    //@}
-
-    /// Reanalyze if any constraint value changed
-    bool reanalyze;
-    /// print out statistics for i-th iteration
-    u32_t iterationForPrintStat;
-
-
-    /// Get node on the graph
-    inline GNODE* Node(NodeID id)
-    {
-        return GTraits::getNode(_graph, id);
-    }
-
-    /// Get node ID
-    inline NodeID Node_Index(GNODE node)
-    {
-        return GTraits::getNodeID(node);
-    }
-
-protected:
-    /// Graph
-    GraphType _graph;
-
-    /// SCC
-    std::unique_ptr<SCC> scc;
-
-    /// Worklist for resolution
-    WorkList worklist;
-
-public:
-    /// num of iterations during constaint solving
-    u32_t numOfIteration;
-};
-
-} // End namespace SVF
-
-#endif /* GRAPHSOLVER_H_ */

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

@@ -1,222 +0,0 @@
-//===- WPAStat.h -- WPA statistics--------------------------------------------//
-//
-//                     SVF: Static Value-Flow Analysis
-//
-// Copyright (C) <2013-2017>  <Yulei Sui>
-//
-
-// This program is free software: you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation, either version 3 of the License, or
-// (at your option) any later version.
-
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License
-// along with this program.  If not, see <http://www.gnu.org/licenses/>.
-//
-//===----------------------------------------------------------------------===//
-
-
-/*
- * FlowSensitiveStat.h
- *
- *  Created on: 27/11/2013
- *      Author: yesen
- */
-
-#ifndef FLOWSENSITIVESTAT_H_
-#define FLOWSENSITIVESTAT_H_
-
-#include "Util/PTAStat.h"
-#include "WPA/FlowSensitive.h"
-#include "WPA/VersionedFlowSensitive.h"
-
-namespace SVF
-{
-
-class AndersenBase;
-class SVFIR;
-class ConstraintGraph;
-
-/*!
- * Statistics of Andersen's analysis
- */
-class AndersenStat : public PTAStat
-{
-
-private:
-    AndersenBase* pta;
-
-public:
-    static const char* CollapseTime;
-
-    static u32_t _MaxPtsSize;
-    static u32_t _NumOfCycles;
-    static u32_t _NumOfPWCCycles;
-    static u32_t _NumOfNodesInCycles;
-    static u32_t _MaxNumOfNodesInSCC;
-    u32_t _NumOfNullPtr;
-    u32_t _NumOfConstantPtr;
-    u32_t _NumOfBlackholePtr;
-
-    AndersenStat(AndersenBase* p);
-
-    virtual ~AndersenStat()
-    {
-
-    }
-
-    virtual void performStat();
-
-    void collectCycleInfo(ConstraintGraph* consCG);
-
-    void statNullPtr();
-
-    void constraintGraphStat();
-};
-
-/*!
- * Statistics of flow-sensitive analysis
- */
-class FlowSensitiveStat : public PTAStat
-{
-public:
-    typedef FlowSensitive::DFInOutMap DFInOutMap;
-    typedef FlowSensitive::PtsMap PtsMap;
-
-    FlowSensitive * fspta;
-
-    FlowSensitiveStat(FlowSensitive* pta): PTAStat(pta)
-    {
-        fspta = pta;
-        clearStat();
-        startClk();
-    }
-
-    virtual ~FlowSensitiveStat() {}
-
-    virtual void performStat();
-
-private:
-    enum ENUM_INOUT
-    {
-        IN,
-        OUT
-    };
-
-    void clearStat();
-
-    void statNullPtr();
-
-    void statPtsSize();
-
-    void statAddrVarPtsSize();
-
-    void calculateAddrVarPts(NodeID pointer, const SVFGNode* node);
-
-    void statInOutPtsSize(const DFInOutMap& data, ENUM_INOUT inOrOut);
-
-    u32_t _NumOfNullPtr;
-    u32_t _NumOfConstantPtr;
-    u32_t _NumOfBlackholePtr;
-
-    /// number of SVFG nodes which have IN/OUT set.
-    u32_t _NumOfSVFGNodesHaveInOut[2];
-    u32_t _NumOfFormalInSVFGNodesHaveInOut[2];
-    u32_t _NumOfFormalOutSVFGNodesHaveInOut[2];
-    u32_t _NumOfActualInSVFGNodesHaveInOut[2];
-    u32_t _NumOfActualOutSVFGNodesHaveInOut[2];
-    u32_t _NumOfLoadSVFGNodesHaveInOut[2];
-    u32_t _NumOfStoreSVFGNodesHaveInOut[2];
-    u32_t _NumOfMSSAPhiSVFGNodesHaveInOut[2];
-
-    /// number of pag nodes which have points-to set in IN/OUT set.
-    u32_t _NumOfVarHaveINOUTPts[2];
-    u32_t _NumOfVarHaveEmptyINOUTPts[2];
-    u32_t _NumOfVarHaveINOUTPtsInFormalIn[2];
-    u32_t _NumOfVarHaveINOUTPtsInFormalOut[2];
-    u32_t _NumOfVarHaveINOUTPtsInActualIn[2];
-    u32_t _NumOfVarHaveINOUTPtsInActualOut[2];
-    u32_t _NumOfVarHaveINOUTPtsInLoad[2];
-    u32_t _NumOfVarHaveINOUTPtsInStore[2];
-    u32_t _NumOfVarHaveINOUTPtsInMSSAPhi[2];
-    u32_t _PotentialNumOfVarHaveINOUTPts[2];
-
-    /// sizes of points-to set
-    u32_t _MaxPtsSize;	///< max points-to set size.
-    u32_t _MaxTopLvlPtsSize;	///< max points-to set size in top-level pointers.
-    u32_t _MaxInOutPtsSize[2];	///< max points-to set size in IN/OUT set.
-
-    u32_t _TotalPtsSize;	///< total points-to set size.
-
-    double _AvgPtsSize;	///< average points-to set size.
-    double _AvgTopLvlPtsSize;	///< average points-to set size in top-level pointers.
-    double _AvgInOutPtsSize[2];	///< average points-to set size in IN set.
-    double _AvgAddrTakenVarPtsSize;	///< average points-to set size of addr-taken variables.
-
-    u32_t _MaxAddrTakenVarPts;	///< max points-to set size of addr-taken variables.
-    u32_t _NumOfAddrTakeVar;	///< number of occurrences of addr-taken variables in load/store.
-};
-
-class VersionedFlowSensitiveStat : public PTAStat
-{
-public:
-    VersionedFlowSensitive *vfspta;
-
-    VersionedFlowSensitiveStat(VersionedFlowSensitive* pta): PTAStat(pta)
-    {
-        vfspta = pta;
-        clearStat();
-        startClk();
-    }
-
-    virtual ~VersionedFlowSensitiveStat() { }
-
-    virtual void performStat();
-
-private:
-    void clearStat();
-
-    /// For all version-related statistics.
-    void versionStat(void);
-
-    /// For all PTS size related statistics not handled by versionStat.
-    void ptsSizeStat(void);
-
-    /// Total number of versions across all objects.
-    u32_t _NumVersions;
-    /// Most versions for a single object.
-    u32_t _MaxVersions;
-    /// Number of version PTSs actually used (sum of next two fields).
-    u32_t _NumUsedVersions;
-    /// Number of versions with non-empty points-to sets (since versioning is over-approximate).
-    u32_t _NumNonEmptyVersions;
-    /// Number of versions with empty points-to sets (actually empty, not never-accessed).
-    u32_t _NumEmptyVersions;
-    /// Number of objects which have a single version.
-    u32_t _NumSingleVersion;
-
-    /// Largest PTS size.
-    u32_t _MaxPtsSize;
-    /// Max points-to set size in top-level pointers.
-    u32_t _MaxTopLvlPtsSize;
-    /// Max address-taken points-to set size.
-    u32_t _MaxVersionPtsSize;
-
-    /// Total of points-to set sizes for calculating averages.
-    u32_t _TotalPtsSize;
-
-    /// Average size across all points-to sets.
-    double _AvgPtsSize;
-    /// Average points-to set size for top-level pointers.
-    double _AvgTopLvlPtsSize;
-    /// Average points-to set size for address-taken objects.
-    double _AvgVersionPtsSize;
-};
-} // End namespace SVF
-
-#endif /* FLOWSENSITIVESTAT_H_ */

package/SVF-linux/svf-llvm/include/SVF-LLVM/SVF-LLVM/BasicTypes.h

@@ -1,250 +0,0 @@
-#ifndef SVF_FE_BASIC_TYPES_H
-#define SVF_FE_BASIC_TYPES_H
-
-#include "SVF-LLVM/GEPTypeBridgeIterator.h"
-
-#include <llvm/Pass.h>
-
-#include <llvm/IR/Instructions.h>
-#include <llvm/IR/GetElementPtrTypeIterator.h>	//for gep iterator
-#include <llvm/IR/GlobalVariable.h>	// for GlobalVariable
-#include <llvm/IR/BasicBlock.h>
-#include <llvm/IR/IntrinsicInst.h>
-#include <llvm/IR/LLVMContext.h>
-#include <llvm/IR/Metadata.h>
-#include <llvm/IR/DataLayout.h>
-#include <llvm/IR/IRBuilder.h>
-#include <llvm/IR/DebugInfo.h>
-#include <llvm/IR/InstIterator.h>
-#include <llvm/IR/GetElementPtrTypeIterator.h>
-#include <llvm/IR/DerivedTypes.h>
-#include <llvm/IR/Statepoint.h>
-
-#include <llvm/Analysis/MemoryLocation.h>
-#include <llvm/Analysis/DominanceFrontier.h>
-#include <llvm/Analysis/PostDominators.h>
-#include <llvm/Analysis/ScalarEvolution.h>
-#include <llvm/Analysis/ScalarEvolutionExpressions.h>
-
-#include <llvm/Transforms/Utils/UnifyFunctionExitNodes.h>
-
-#include <llvm/Support/SourceMgr.h>
-
-#include <llvm/Bitcode/BitcodeWriter.h>		// for WriteBitcodeToFile
-#include <llvm/Bitcode/BitcodeReader.h>     /// for isBitcode
-#include <llvm/IRReader/IRReader.h>	// IR reader for bit file
-#include <llvm/IR/InstVisitor.h>	// for instruction visitor
-#include <llvm/IR/InstIterator.h>	// for inst iteration
-
-#include <llvm/BinaryFormat/Dwarf.h> // for dwarf tags
-
-#include <llvm/Analysis/LoopInfo.h>
-
-namespace SVF
-{
-
-typedef llvm::LLVMContext LLVMContext;
-typedef llvm::GlobalObject GlobalObject;
-typedef llvm::Use Use;
-typedef llvm::ModulePass ModulePass;
-typedef llvm::IRBuilder<> IRBuilder;
-#if LLVM_VERSION_MAJOR >= 12
-typedef llvm::UnifyFunctionExitNodesLegacyPass UnifyFunctionExitNodes;
-#else
-typedef llvm::UnifyFunctionExitNodes UnifyFunctionExitNodes;
-#endif
-
-/// LLVM Basic classes
-typedef llvm::Value Value;
-typedef llvm::Type Type;
-typedef llvm::Module Module;
-typedef llvm::Function Function;
-typedef llvm::BasicBlock BasicBlock;
-typedef llvm::Instruction Instruction;
-typedef llvm::GlobalValue GlobalValue;
-
-typedef llvm::SMDiagnostic SMDiagnostic;
-typedef llvm::BlockAddress BlockAddress;
-
-/// LLVM types
-typedef llvm::StructType StructType;
-typedef llvm::ArrayType ArrayType;
-typedef llvm::PointerType PointerType;
-typedef llvm::IntegerType IntegerType;
-typedef llvm::FunctionType FunctionType;
-
-// LLVM Metadata
-typedef llvm::MDString MDString;
-typedef llvm::MetadataAsValue MetadataAsValue;
-
-// LLVM data layout
-typedef llvm::StructLayout StructLayout;
-typedef llvm::ConstantStruct ConstantStruct;
-typedef llvm::MemoryLocation MemoryLocation;
-typedef llvm::DataLayout DataLayout;
-
-/// LLVM metadata and debug information
-typedef llvm::NamedMDNode NamedMDNode;
-typedef llvm::MDNode MDNode;
-typedef llvm::DISubprogram DISubprogram;
-
-// LLVM Aliases and constants
-typedef llvm::ConstantData ConstantData;
-typedef llvm::ConstantAggregate ConstantAggregate;
-typedef llvm::ConstantAggregateZero ConstantAggregateZero;
-typedef llvm::ConstantDataSequential ConstantDataSequential;
-typedef llvm::ConstantExpr ConstantExpr;
-typedef llvm::ConstantDataArray ConstantDataArray;
-typedef llvm::ConstantData ConstantData;
-typedef llvm::ConstantArray ConstantArray;
-typedef llvm::Constant Constant;
-typedef llvm::ConstantInt ConstantInt;
-typedef llvm::ConstantFP ConstantFP;
-typedef llvm::ConstantPointerNull ConstantPointerNull;
-typedef llvm::GlobalAlias GlobalAlias;
-typedef llvm::GlobalVariable GlobalVariable;
-
-/// LLVM Dominators
-typedef llvm::DominatorTree DominatorTree;
-typedef llvm::DomTreeNode DomTreeNode;
-typedef llvm::DominanceFrontier DominanceFrontier;
-typedef llvm::PostDominatorTree PostDominatorTree;
-typedef llvm::DominanceFrontierBase<llvm::BasicBlock, false> DominanceFrontierBase;
-
-/// LLVM Loop
-typedef llvm::Loop Loop;
-typedef llvm::LoopInfo LoopInfo;
-typedef llvm::User User;
-
-// LLVM Instructions
-typedef llvm::Argument Argument;
-typedef llvm::CallBase CallBase;
-typedef llvm::CallInst CallInst;
-typedef llvm::StoreInst StoreInst;
-typedef llvm::LoadInst LoadInst;
-typedef llvm::AllocaInst AllocaInst;
-typedef llvm::AtomicCmpXchgInst AtomicCmpXchgInst;
-typedef llvm::AtomicRMWInst AtomicRMWInst;
-typedef llvm::BitCastInst BitCastInst;
-typedef llvm::BranchInst BranchInst;
-typedef llvm::SwitchInst SwitchInst;
-typedef llvm::CallBrInst CallBrInst;
-typedef llvm::ReturnInst ReturnInst;
-typedef llvm::CastInst CastInst;
-typedef llvm::CmpInst CmpInst;
-typedef llvm::ExtractValueInst  ExtractValueInst;
-typedef llvm::ExtractElementInst ExtractElementInst;
-typedef llvm::GetElementPtrInst GetElementPtrInst;
-typedef llvm::InvokeInst InvokeInst;
-typedef llvm::ShuffleVectorInst ShuffleVectorInst;
-typedef llvm::PHINode PHINode;
-typedef llvm::IntToPtrInst IntToPtrInst;
-typedef llvm::InsertValueInst InsertValueInst;
-typedef llvm::FenceInst FenceInst;
-typedef llvm::FreezeInst FreezeInst;
-typedef llvm::UnreachableInst UnreachableInst;
-typedef llvm::InsertElementInst InsertElementInst;
-typedef llvm::LandingPadInst LandingPadInst;
-typedef llvm::ResumeInst ResumeInst;
-typedef llvm::SelectInst SelectInst;
-typedef llvm::VAArgInst VAArgInst;
-typedef llvm::VACopyInst VACopyInst;
-typedef llvm::VAEndInst VAEndInst;
-typedef llvm::VAStartInst VAStartInst;
-typedef llvm::BinaryOperator BinaryOperator;
-typedef llvm::UnaryOperator UnaryOperator;
-typedef llvm::UndefValue UndefValue;
-
-// LLVM Intrinsic Instructions
-#if LLVM_VERSION_MAJOR >= 13
-typedef llvm::IntrinsicInst IntrinsicInst;
-typedef llvm::DbgInfoIntrinsic DbgInfoIntrinsic;
-typedef llvm::DbgVariableIntrinsic DbgVariableIntrinsic;
-typedef llvm::DbgDeclareInst DbgDeclareInst;
-typedef llvm::DbgAddrIntrinsic DbgAddrIntrinsic;
-typedef llvm::DbgValueInst DbgValueInst;
-typedef llvm::DbgLabelInst DbgLabelInst;
-typedef llvm::VPIntrinsic VPIntrinsic;
-typedef llvm::ConstrainedFPIntrinsic ConstrainedFPIntrinsic;
-typedef llvm::ConstrainedFPCmpIntrinsic ConstrainedFPCmpIntrinsic;
-typedef llvm::MinMaxIntrinsic MinMaxIntrinsic;
-typedef llvm::BinaryOpIntrinsic BinaryOpIntrinsic;
-typedef llvm::WithOverflowInst WithOverflowInst;
-typedef llvm::SaturatingInst SaturatingInst;
-typedef llvm::AtomicMemIntrinsic AtomicMemIntrinsic;
-typedef llvm::AtomicMemSetInst AtomicMemSetInst;
-typedef llvm::AtomicMemTransferInst AtomicMemTransferInst;
-typedef llvm::AtomicMemCpyInst AtomicMemCpyInst;
-typedef llvm::AtomicMemMoveInst AtomicMemMoveInst;
-typedef llvm::MemIntrinsic MemIntrinsic;
-typedef llvm::MemSetInst MemSetInst;
-typedef llvm::MemTransferInst MemTransferInst;
-typedef llvm::MemCpyInst MemCpyInst;
-typedef llvm::MemMoveInst MemMoveInst;
-typedef llvm::MemCpyInlineInst MemCpyInlineInst;
-typedef llvm::AnyMemIntrinsic AnyMemIntrinsic;
-typedef llvm::AnyMemSetInst AnyMemSetInst;
-typedef llvm::AnyMemTransferInst AnyMemTransferInst;
-typedef llvm::AnyMemCpyInst AnyMemCpyInst;
-typedef llvm::AnyMemMoveInst AnyMemMoveInst;
-typedef llvm::VAStartInst VAStartInst;
-typedef llvm::VAEndInst VAEndInst;
-typedef llvm::VACopyInst VACopyInst;
-typedef llvm::InstrProfIncrementInst InstrProfIncrementInst;
-typedef llvm::InstrProfIncrementInstStep InstrProfIncrementInstStep;
-typedef llvm::InstrProfValueProfileInst InstrProfValueProfileInst;
-typedef llvm::PseudoProbeInst PseudoProbeInst;
-typedef llvm::NoAliasScopeDeclInst NoAliasScopeDeclInst;
-typedef llvm::GCStatepointInst GCStatepointInst;
-typedef llvm::GCProjectionInst GCProjectionInst;
-typedef llvm::GCRelocateInst GCRelocateInst;
-typedef llvm::GCResultInst GCResultInst;
-typedef llvm::AssumeInst AssumeInst;
-#endif
-
-// LLVM Debug Information
-typedef llvm::DIType DIType;
-typedef llvm::DICompositeType DICompositeType;
-typedef llvm::DIDerivedType DIDerivedType;
-typedef llvm::DebugInfoFinder DebugInfoFinder;
-typedef llvm::DISubroutineType DISubroutineType;
-typedef llvm::DIBasicType DIBasicType;
-typedef llvm::DISubrange DISubrange;
-typedef llvm::DINode DINode;
-typedef llvm::DINodeArray DINodeArray;
-typedef llvm::DITypeRefArray DITypeRefArray;
-namespace dwarf = llvm::dwarf;
-
-// Iterators.
-typedef llvm::inst_iterator inst_iterator;
-typedef llvm::const_inst_iterator const_inst_iterator;
-typedef llvm::gep_type_iterator gep_type_iterator;
-typedef llvm::bridge_gep_iterator bridge_gep_iterator;
-typedef llvm::const_inst_iterator const_inst_iterator;
-typedef llvm::const_pred_iterator const_pred_iterator;
-
-// LLVM Scalar Evolution.
-typedef llvm::ScalarEvolutionWrapperPass ScalarEvolutionWrapperPass;
-typedef llvm::SCEVAddRecExpr SCEVAddRecExpr;
-typedef llvm::SCEVConstant SCEVConstant;
-typedef llvm::ScalarEvolution ScalarEvolution;
-typedef llvm::SCEV SCEV;
-
-/// LLVM outputs
-typedef llvm::raw_fd_ostream raw_fd_ostream;
-
-// LLVM Types.
-typedef llvm::VectorType VectorType;
-#if (LLVM_VERSION_MAJOR >= 9)
-typedef llvm::FunctionCallee FunctionCallee;
-#endif
-
-/// LLVM Iterators
-#if LLVM_VERSION_MAJOR >= 11
-typedef llvm::const_succ_iterator succ_const_iterator;
-#else
-typedef llvm::succ_const_iterator succ_const_iterator;
-#endif
-} // End namespace SVF
-
-#endif  // SVF_FE_BASIC_TYPES_H