svf-tools 1.0.310 → 1.0.314

package/lib/SVF-FE/SymbolTableInfo.cpp

@@ -47,39 +47,15 @@ using namespace SVFUtil;
 DataLayout* SymbolTableInfo::dl = nullptr;
 SymbolTableInfo* SymbolTableInfo::symInfo = nullptr;
 
+
 /*
- * Initial the memory object here
+ * Initial the memory object here (for a dummy object)
  */
-void MemObj::init(const Value *val)
+ObjTypeInfo* SymbolTableInfo::createObjTypeInfo(const Type* type)
 {
-    const PointerType *refTy = nullptr;
-
-    const Instruction *I = SVFUtil::dyn_cast<Instruction>(val);
-
-    // We consider two types of objects:
-    // (1) A heap/static object from a callsite
-    if (I && isNonInstricCallSite(I))
-        refTy = getRefTypeOfHeapAllocOrStatic(I);
-    // (2) Other objects (e.g., alloca, global, etc.)
-    else
-        refTy = SVFUtil::dyn_cast<PointerType>(val->getType());
-
-    if (refTy)
-    {
-        Type *objTy = refTy->getElementType();
-        if(Options::LocMemModel)
-            typeInfo = new LocObjTypeInfo(val, objTy, Options::MaxFieldLimit);
-        else
-            typeInfo = new ObjTypeInfo(val, objTy, Options::MaxFieldLimit);
-        typeInfo->init(val);
-    }
-    else
-    {
-        writeWrnMsg("try to create an object with a non-pointer type.");
-        writeWrnMsg(val->getName().str());
-        writeWrnMsg("(" + getSourceLoc(val) + ")");
-        assert(false && "Memory object must be held by a pointer-typed ref value.");
-    }
+    ObjTypeInfo* typeInfo = new ObjTypeInfo(StInfo::getMaxFieldLimit(),type);
+    typeInfo->analyzeHeapObjType(type);
+    return typeInfo;
 }
 
 /*!
@@ -89,10 +65,7 @@ SymbolTableInfo* SymbolTableInfo::SymbolInfo()
 {
     if (symInfo == nullptr)
     {
-        if(Options::LocMemModel)
-            symInfo = new LocSymTableInfo();
-        else
-            symInfo = new SymbolTableInfo();
+        symInfo = new SymbolTableInfo();
         symInfo->setModelConstants(Options::ModelConsts);
     }
     return symInfo;
@@ -405,161 +378,6 @@ LocationSet SymbolTableInfo::getModulusOffset(const MemObj* obj, const LocationS
 }
 
 
-/*!
- *  This method identify which is value sym and which is object sym
- */
-void SymbolTableInfo::buildMemModel(SVFModule* svfModule)
-{
-    SVFUtil::increaseStackSize();
-
-    mod = svfModule;
-
-    StInfo::setMaxFieldLimit(Options::MaxFieldLimit);
-
-    // Object #0 is black hole the object that may point to any object
-    assert(totalSymNum == BlackHole && "Something changed!");
-    symTyMap.insert(std::make_pair(totalSymNum++, BlackHole));
-    createBlkOrConstantObj(BlackHole);
-
-    // Object #1 always represents the constant
-    assert(totalSymNum == ConstantObj && "Something changed!");
-    symTyMap.insert(std::make_pair(totalSymNum++, ConstantObj));
-    createBlkOrConstantObj(ConstantObj);
-
-    // Pointer #2 always represents the pointer points-to black hole.
-    assert(totalSymNum == BlkPtr && "Something changed!");
-    symTyMap.insert(std::make_pair(totalSymNum++, BlkPtr));
-
-    // Pointer #3 always represents the null pointer.
-    assert(totalSymNum == NullPtr && "Something changed!");
-    symTyMap.insert(std::make_pair(totalSymNum, NullPtr));
-
-    // Add symbols for all the globals .
-    for (SVFModule::global_iterator I = svfModule->global_begin(), E =
-                svfModule->global_end(); I != E; ++I)
-    {
-        collectSym(*I);
-    }
-
-    // Add symbols for all the global aliases
-    for (SVFModule::alias_iterator I = svfModule->alias_begin(), E =
-                svfModule->alias_end(); I != E; I++)
-    {
-        collectSym(*I);
-        collectSym((*I)->getAliasee());
-    }
-
-    // Add symbols for all of the functions and the instructions in them.
-    for (SVFModule::llvm_iterator F = svfModule->llvmFunBegin(), E = svfModule->llvmFunEnd(); F != E; ++F)
-    {
-        Function *fun = *F;
-        collectSym(fun);
-        collectRet(fun);
-        if (fun->getFunctionType()->isVarArg())
-            collectVararg(fun);
-
-        // Add symbols for all formal parameters.
-        for (Function::arg_iterator I = fun->arg_begin(), E = fun->arg_end();
-                I != E; ++I)
-        {
-            collectSym(&*I);
-        }
-
-        // collect and create symbols inside the function body
-        for (inst_iterator II = inst_begin(*fun), E = inst_end(*fun); II != E; ++II)
-        {
-            const Instruction *inst = &*II;
-            collectSym(inst);
-
-            // initialization for some special instructions
-            //{@
-            if (const StoreInst *st = SVFUtil::dyn_cast<StoreInst>(inst))
-            {
-                collectSym(st->getPointerOperand());
-                collectSym(st->getValueOperand());
-            }
-            else if (const LoadInst *ld = SVFUtil::dyn_cast<LoadInst>(inst))
-            {
-                collectSym(ld->getPointerOperand());
-            }
-            else if (const PHINode *phi = SVFUtil::dyn_cast<PHINode>(inst))
-            {
-                for (u32_t i = 0; i < phi->getNumIncomingValues(); ++i)
-                {
-                    collectSym(phi->getIncomingValue(i));
-                }
-            }
-            else if (const GetElementPtrInst *gep = SVFUtil::dyn_cast<GetElementPtrInst>(
-                    inst))
-            {
-                collectSym(gep->getPointerOperand());
-            }
-            else if (const SelectInst *sel = SVFUtil::dyn_cast<SelectInst>(inst))
-            {
-                collectSym(sel->getTrueValue());
-                collectSym(sel->getFalseValue());
-            }
-            else if (const BinaryOperator *binary = SVFUtil::dyn_cast<BinaryOperator>(inst))
-            {
-                for (u32_t i = 0; i < binary->getNumOperands(); i++)
-                    collectSym(binary->getOperand(i));
-            }
-            else if (const UnaryOperator *unary = SVFUtil::dyn_cast<UnaryOperator>(inst))
-            {
-                for (u32_t i = 0; i < unary->getNumOperands(); i++)
-                    collectSym(unary->getOperand(i));
-            }
-            else if (const CmpInst *cmp = SVFUtil::dyn_cast<CmpInst>(inst))
-            {
-                for (u32_t i = 0; i < cmp->getNumOperands(); i++)
-                    collectSym(cmp->getOperand(i));
-            }
-            else if (const CastInst *cast = SVFUtil::dyn_cast<CastInst>(inst))
-            {
-                collectSym(cast->getOperand(0));
-            }
-            else if (const ReturnInst *ret = SVFUtil::dyn_cast<ReturnInst>(inst))
-            {
-                if(ret->getReturnValue())
-                    collectSym(ret->getReturnValue());
-            }
-            else if (const BranchInst *br = SVFUtil::dyn_cast<BranchInst>(inst))
-            {
-                Value* opnd = br->isConditional() ? br->getCondition() : br->getOperand(0);
-                collectSym(opnd);
-            }
-            else if (const SwitchInst *sw = SVFUtil::dyn_cast<SwitchInst>(inst))
-            {
-                collectSym(sw->getCondition());
-            }
-            else if (isNonInstricCallSite(inst))
-            {
-
-                CallSite cs = SVFUtil::getLLVMCallSite(inst);
-                callSiteSet.insert(cs);
-                for (CallSite::arg_iterator it = cs.arg_begin();
-                        it != cs.arg_end(); ++it)
-                {
-                    collectSym(*it);
-                }
-                // Calls to inline asm need to be added as well because the callee isn't
-                // referenced anywhere else.
-                const Value *Callee = cs.getCalledValue();
-                collectSym(Callee);
-
-                //TODO handle inlineAsm
-                ///if (SVFUtil::isa<InlineAsm>(Callee))
-
-            }
-            //@}
-        }
-    }
-
-    NodeIDAllocator::get()->endSymbolAllocation();
-    if (Options::SymTabPrint) {
-        SymbolTableInfo::SymbolInfo()->dump();
-    }
-}
 
 /*!
  * Destroy the memory for this symbol table after use
@@ -579,121 +397,9 @@ void SymbolTableInfo::destroy()
         if (iter->second)
             delete iter->second;
     }
-}
-
-/*!
- * Collect symbols, including value and object syms
- */
-void SymbolTableInfo::collectSym(const Value *val)
-{
-
-    //TODO: filter the non-pointer type // if (!SVFUtil::isa<PointerType>(val->getType()))  return;
-
-    DBOUT(DMemModel, outs() << "collect sym from ##" << *val << " \n");
-
-    // special sym here
-    if (isNullPtrSym(val) || isBlackholeSym(val))
-        return;
-
-    //TODO handle constant expression value here??
-    handleCE(val);
-
-    // create a value sym
-    collectVal(val);
-
-    // create an object If it is a heap, stack, global, function.
-    if (isObject(val))
-    {
-        collectObj(val);
-    }
-}
-
-/*!
- * Get value sym, if not available create a new one
- */
-void SymbolTableInfo::collectVal(const Value *val)
-{
-    ValueToIDMapTy::iterator iter = valSymMap.find(val);
-    if (iter == valSymMap.end())
-    {
-        // create val sym and sym type
-        SymID id = NodeIDAllocator::get()->allocateValueId();
-        valSymMap.insert(std::make_pair(val, id));
-        symTyMap.insert(std::make_pair(id, ValSym));
-        DBOUT(DMemModel,
-              outs() << "create a new value sym " << id << "\n");
-        ///  handle global constant expression here
-        if (const GlobalVariable* globalVar = SVFUtil::dyn_cast<GlobalVariable>(val))
-            handleGlobalCE(globalVar);
-    }
 
-    if (isConstantObjSym(val))
-        collectObj(val);
-}
-
-/*!
- * Get memory object sym, if not available create a new one
- */
-void SymbolTableInfo::collectObj(const Value *val)
-{
-    val = getGlobalRep(val);
-    ValueToIDMapTy::iterator iter = objSymMap.find(val);
-    if (iter == objSymMap.end())
-    {
-        // if the object pointed by the pointer is a constant data (e.g., i32 0) or a global constant object (e.g. string)
-        // then we treat them as one ConstantObj
-        if(isConstantData(val) || (isConstantObjSym(val) && !getModelConstants()))
-        {
-            objSymMap.insert(std::make_pair(val, constantSymID()));
-        }
-        // otherwise, we will create an object for each abstract memory location
-        else
-        {
-            // create obj sym and sym type
-            SymID id = NodeIDAllocator::get()->allocateObjectId();
-            objSymMap.insert(std::make_pair(val, id));
-            symTyMap.insert(std::make_pair(id, ObjSym));
-            DBOUT(DMemModel,
-                  outs() << "create a new obj sym " << id << "\n");
-
-            // create a memory object
-            MemObj* mem = new MemObj(val, id);
-            assert(objMap.find(id) == objMap.end());
-            objMap[id] = mem;
-        }
-    }
-}
-
-/*!
- * Create unique return sym, if not available create a new one
- */
-void SymbolTableInfo::collectRet(const Function *val)
-{
-    FunToIDMapTy::iterator iter = returnSymMap.find(val);
-    if (iter == returnSymMap.end())
-    {
-        SymID id = NodeIDAllocator::get()->allocateValueId();
-        returnSymMap.insert(std::make_pair(val, id));
-        symTyMap.insert(std::make_pair(id, RetSym));
-        DBOUT(DMemModel,
-              outs() << "create a return sym " << id << "\n");
-    }
-}
-
-/*!
- * Create vararg sym, if not available create a new one
- */
-void SymbolTableInfo::collectVararg(const Function *val)
-{
-    FunToIDMapTy::iterator iter = varargSymMap.find(val);
-    if (iter == varargSymMap.end())
-    {
-        SymID id = NodeIDAllocator::get()->allocateValueId();
-        varargSymMap.insert(std::make_pair(val, id));
-        symTyMap.insert(std::make_pair(id, VarargSym));
-        DBOUT(DMemModel,
-              outs() << "create a vararg sym " << id << "\n");
-    }
+    delete dl;
+    dl = nullptr;
 }
 
 /*!
@@ -751,156 +457,6 @@ bool SymbolTableInfo::isConstantObjSym(const Value *val)
 }
 
 
-/*!
- * Handle constant expression
- */
-void SymbolTableInfo::handleCE(const Value *val)
-{
-    if (const Constant* ref = SVFUtil::dyn_cast<Constant>(val))
-    {
-        if (const ConstantExpr* ce = isGepConstantExpr(ref))
-        {
-            DBOUT(DMemModelCE,
-                  outs() << "handle constant expression " << *ref << "\n");
-            collectVal(ce);
-            collectVal(ce->getOperand(0));
-            // handle the recursive constant express case
-            // like (gep (bitcast (gep X 1)) 1); the inner gep is ce->getOperand(0)
-            handleCE(ce->getOperand(0));
-        }
-        else if (const ConstantExpr* ce = isCastConstantExpr(ref))
-        {
-            DBOUT(DMemModelCE,
-                  outs() << "handle constant expression " << *ref << "\n");
-            collectVal(ce);
-            collectVal(ce->getOperand(0));
-            // handle the recursive constant express case
-            // like (gep (bitcast (gep X 1)) 1); the inner gep is ce->getOperand(0)
-            handleCE(ce->getOperand(0));
-        }
-        else if (const ConstantExpr* ce = isSelectConstantExpr(ref))
-        {
-            DBOUT(DMemModelCE,
-                  outs() << "handle constant expression " << *ref << "\n");
-            collectVal(ce);
-            collectVal(ce->getOperand(0));
-            collectVal(ce->getOperand(1));
-            collectVal(ce->getOperand(2));
-            // handle the recursive constant express case
-            // like (gep (bitcast (gep X 1)) 1); the inner gep is ce->getOperand(0)
-            handleCE(ce->getOperand(0));
-            handleCE(ce->getOperand(1));
-            handleCE(ce->getOperand(2));
-        }
-        // if we meet a int2ptr, then it points-to black hole
-		else if (const ConstantExpr *int2Ptrce = isInt2PtrConstantExpr(ref)) {
-			collectVal(int2Ptrce);
-		} else if (const ConstantExpr *ptr2Intce = isPtr2IntConstantExpr(ref)) {
-			collectVal(ptr2Intce);
-			const Constant *opnd = ptr2Intce->getOperand(0);
-			handleCE(opnd);
-		} else if (isTruncConstantExpr(ref) || isCmpConstantExpr(ref)) {
-			collectVal(ref);
-		} else if (isBinaryConstantExpr(ref)) {
-			collectVal(ref);
-		} else if (isUnaryConstantExpr(ref)) {
-			// we don't handle unary constant expression like fneg(x) now
-			collectVal(ref);
-		} else if (SVFUtil::isa<ConstantAggregate>(ref)) {
-			// we don't handle constant agrgregate like constant vectors
-			collectVal(ref);
-		} else {
-			if (SVFUtil::isa<ConstantExpr>(val))
-				assert(false && "we don't handle all other constant expression for now!");
-			collectVal(ref);
-		}
-    }
-}
-
-/*!
- * Handle global constant expression
- */
-void SymbolTableInfo::handleGlobalCE(const GlobalVariable *G)
-{
-    assert(G);
-
-    //The type this global points to
-    const Type *T = G->getType()->getContainedType(0);
-    bool is_array = 0;
-    //An array is considered a single variable of its type.
-    while (const ArrayType *AT = SVFUtil::dyn_cast<ArrayType>(T))
-    {
-        T = AT->getElementType();
-        is_array = 1;
-    }
-
-    if (SVFUtil::isa<StructType>(T))
-    {
-        //A struct may be used in constant GEP expr.
-        for (Value::const_user_iterator it = G->user_begin(), ie = G->user_end();
-                it != ie; ++it)
-        {
-            handleCE(*it);
-        }
-    }
-    else
-    {
-        if (is_array)
-        {
-            for (Value::const_user_iterator it = G->user_begin(), ie =
-                        G->user_end(); it != ie; ++it)
-            {
-                handleCE(*it);
-            }
-        }
-    }
-
-    if (G->hasInitializer())
-    {
-        handleGlobalInitializerCE(G->getInitializer(), 0);
-    }
-}
-
-/*!
- * Handle global variable initialization
- */
-void SymbolTableInfo::handleGlobalInitializerCE(const Constant *C,
-        u32_t offset)
-{
-
-    if (C->getType()->isSingleValueType())
-    {
-        if (const ConstantExpr *E = SVFUtil::dyn_cast<ConstantExpr>(C))
-        {
-            handleCE(E);
-        }
-        else
-        {
-            collectVal(C);
-        }
-    }
-    else if (SVFUtil::isa<ConstantArray>(C))
-    {
-        for (u32_t i = 0, e = C->getNumOperands(); i != e; i++)
-        {
-            handleGlobalInitializerCE(SVFUtil::cast<Constant>(C->getOperand(i)), offset);
-        }
-    }
-    else if (SVFUtil::isa<ConstantStruct>(C))
-    {
-        const StructType *sty = SVFUtil::cast<StructType>(C->getType());
-        const std::vector<u32_t>& offsetvect =
-            SymbolTableInfo::SymbolInfo()->getFattenFieldIdxVec(sty);
-        for (u32_t i = 0, e = C->getNumOperands(); i != e; i++)
-        {
-            u32_t off = offsetvect[i];
-            handleGlobalInitializerCE(SVFUtil::cast<Constant>(C->getOperand(i)),
-                                      offset + off);
-        }
-    }
-}
-
-
 /*
  * Print out the composite type information
  */
@@ -1089,3 +645,4 @@ u32_t SymbolTableInfo::getTypeSizeInBytes(const StructType *sty, u32_t field_idx
 
 
 
+

package/lib/Util/NodeIDAllocator.cpp

@@ -148,9 +148,10 @@ namespace SVF
         return id;
     }
 
-    void NodeIDAllocator::endSymbolAllocation(void)
+    NodeID NodeIDAllocator::endSymbolAllocation(void)
     {
         numSymbols = numNodes;
+        return numSymbols;
     }
 
     const std::string NodeIDAllocator::Clusterer::NumObjects = "NumObjects";

package/lib/Util/Options.cpp

@@ -26,8 +26,8 @@ namespace SVF
         llvm::cl::desc("Method of allocating (LLVM) values and memory objects as node IDs"),
         llvm::cl::values(
             clEnumValN(NodeIDAllocator::Strategy::DENSE, "dense", "allocate objects together and values together, separately"),
-            clEnumValN(NodeIDAllocator::Strategy::SEQ, "seq", "allocate values and objects sequentially, intermixed"),
-            clEnumValN(NodeIDAllocator::Strategy::DEBUG, "debug", "allocate value and objects sequentially, intermixed, except GEP objects as offsets (default)")));
+            clEnumValN(NodeIDAllocator::Strategy::SEQ, "seq", "allocate values and objects sequentially, intermixed (default)"),
+            clEnumValN(NodeIDAllocator::Strategy::DEBUG, "debug", "allocate value and objects sequentially, intermixed, except GEP objects as offsets")));
 
     const llvm::cl::opt<unsigned> Options::MaxFieldLimit(
         "field-limit",
@@ -629,14 +629,6 @@ namespace SVF
         llvm::cl::desc("add svf.main()")
     );
 
-    
-    // SymbolTableInfo.cpp
-    const llvm::cl::opt<bool> Options::LocMemModel(
-        "loc-mm", 
-        llvm::cl::init(false),
-        llvm::cl::desc("Bytes/bits modeling of memory locations")
-    );
-
     const llvm::cl::opt<bool> Options::ModelConsts(
         "model-consts", 
         llvm::cl::init(false),

package/lib/Util/SVFModule.cpp

@@ -22,7 +22,7 @@
 
 
 #include "Util/SVFModule.h"
-#include "SVF-FE/SymbolTableInfo.h"
+#include "SVF-FE/MemModelBuilder.h"
 #include "Util/SVFUtil.h"
 
 using namespace SVF;
@@ -34,6 +34,7 @@ void SVFModule::buildSymbolTableInfo()
         /// building symbol table
         DBOUT(DGENERAL, SVFUtil::outs() << SVFUtil::pasMsg("Building Symbol table ...\n"));
         SymbolTableInfo *symInfo = SymbolTableInfo::SymbolInfo();
-        symInfo->buildMemModel(this);
+        MemModelBuilder builder(symInfo);
+        builder.buildMemModel(this);
     }
 }

package/lib/WPA/Andersen.cpp

@@ -28,9 +28,9 @@
  */
 
 #include "Util/Options.h"
+#include "SVF-FE/CommonCHG.h"
 #include "SVF-FE/LLVMUtil.h"
 #include "MemoryModel/PointsTo.h"
-#include "Util/Options.h"
 #include "WPA/Andersen.h"
 #include "WPA/Steensgaard.h"
 
@@ -57,6 +57,18 @@ double AndersenBase::timeOfProcessCopyGep = 0;
 double AndersenBase::timeOfProcessLoadStore = 0;
 double AndersenBase::timeOfUpdateCallGraph = 0;
 
+/*!
+ * Destructor
+ */
+AndersenBase::~AndersenBase()
+{
+  delete consCG;
+  consCG = nullptr;
+
+  auto * chg = getCHGraph();
+  delete chg;
+  chg = nullptr;
+}
 
 /*!
  * Initilize analysis

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.310",
+  "version": "1.0.314",
   "description": "* <b>[TypeClone](https://github.com/SVF-tools/SVF/wiki/TypeClone) published in our [ECOOP paper](https://yuleisui.github.io/publications/ecoop20.pdf) is now available in SVF </b> * <b>SVF now uses a single script for its build. Just type [`source ./build.sh`](https://github.com/SVF-tools/SVF/blob/master/build.sh) in your terminal, that's it!</b> * <b>SVF now supports LLVM-10.0.0! </b> * <b>We thank [bsauce](https://github.com/bsauce) for writing a user manual of SVF ([link1](https://www.jianshu.com/p/068a08ec749c) and [link2](https://www.jianshu.com/p/777c30d4240e)) in Chinese </b> * <b>SVF now supports LLVM-9.0.0 (Thank [Byoungyoung Lee](https://github.com/SVF-tools/SVF/issues/142) for his help!). </b> * <b>SVF now supports a set of [field-sensitive pointer analyses](https://yuleisui.github.io/publications/sas2019a.pdf). </b> * <b>[Use SVF as an external lib](https://github.com/SVF-tools/SVF/wiki/Using-SVF-as-a-lib-in-your-own-tool) for your own project (Contributed by [Hongxu Chen](https://github.com/HongxuChen)). </b> * <b>SVF now supports LLVM-7.0.0. </b> * <b>SVF now supports Docker. [Try SVF in Docker](https://github.com/SVF-tools/SVF/wiki/Try-SVF-in-Docker)! </b> * <b>SVF now supports [LLVM-6.0.0](https://github.com/svf-tools/SVF/pull/38) (Contributed by [Jack Anthony](https://github.com/jackanth)). </b> * <b>SVF now supports [LLVM-4.0.0](https://github.com/svf-tools/SVF/pull/23) (Contributed by Jared Carlson. Thank [Jared](https://github.com/jcarlson23) and [Will](https://github.com/dtzWill) for their in-depth [discussions](https://github.com/svf-tools/SVF/pull/18) about updating SVF!) </b> * <b>SVF now supports analysis for C++ programs.</b> <br />",
   "main": "index.js",
   "scripts": {

package/tools/Example/svf-ex.cpp

@@ -160,9 +160,9 @@ int main(int argc, char ** argv)
     SVFModule* svfModule = LLVMModuleSet::getLLVMModuleSet()->buildSVFModule(moduleNameVec);
     svfModule->buildSymbolTableInfo();
 
-	/// Build Program Assignment Graph (PAG)
-	PAGBuilder builder;
-	PAG* pag = builder.build(svfModule);
+    /// Build Program Assignment Graph (PAG)
+    PAGBuilder builder;
+    PAG* pag = builder.build(svfModule);
 
     /// Create Andersen's pointer analysis
     Andersen* ander = AndersenWaveDiff::createAndersenWaveDiff(pag);
@@ -199,7 +199,10 @@ int main(int argc, char ** argv)
     PAG::releasePAG();
 
     LLVMModuleSet::getLLVMModuleSet()->dumpModulesToFile(".svf.bc");
+    SVF::LLVMModuleSet::releaseLLVMModuleSet();
+    delete svfModule;
 
+    llvm::llvm_shutdown();
     return 0;
 }
 

package/include/SVF-FE/LocMemModel.h

@@ -1,35 +0,0 @@
-//===- LocMemModel.h -- Location set based memory model-----------------------//
-//
-//                     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/>.
-//
-//===----------------------------------------------------------------------===//
-
-/*
- * LocMemModel.h
- *
- *  Created on: Apr 28, 2014
- *      Author: Yulei
- */
-
-#ifndef LOCMEMMODEL_H_
-#define LOCMEMMODEL_H_
-
-
-
-#endif /* LOCMEMMODEL_H_ */

package/lib/SVF-FE/LocMemModel.cpp

@@ -1,31 +0,0 @@
-//===- LocMemModel.cpp -- Location set based memory model---------------------//
-//
-//                     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/>.
-//
-//===----------------------------------------------------------------------===//
-
-/*
- * LocMemModel.cpp
- *
- *  Created on: Apr 28, 2014
- *      Author: Yulei Sui
- */
-
-
-