svf-tools 1.0.357 → 1.0.358

package/SVF-doxygen/html/html/search/variables_6.js

@@ -36,7 +36,6 @@ var searchData=
   ['fspta',['fspta',['../classSVF_1_1FlowSensitive.html#a4ad2095dc708df07602de25e4a004776',1,'SVF::FlowSensitive::fspta()'],['../classSVF_1_1FlowSensitiveStat.html#af7e04f73ee17647c52e571cadef8729f',1,'SVF::FlowSensitiveStat::fspta()']]],
   ['fstimelimit',['FsTimeLimit',['../classSVF_1_1Options.html#ad03c4697dd4da2b6adde112e3ee1884b',1,'SVF::Options']]],
   ['fulljoin',['fullJoin',['../classSVF_1_1ForkJoinAnalysis.html#a4193a30050195cd9aaafd58511b66ccc',1,'SVF::ForkJoinAnalysis']]],
-  ['fulloffsetvec',['fullOffsetVec',['../classSVF_1_1StInfo.html#a5a7987ced798a2194d8c74025547f407',1,'SVF::StInfo']]],
   ['fullreachable',['fullReachable',['../classSVF_1_1ProgSlice.html#a632db4b2e69848955925746ac721d94f',1,'SVF::ProgSlice']]],
   ['fun',['fun',['../classSVF_1_1ICFGNode.html#a03587dbd558d8fffe25307b42e3195be',1,'SVF::ICFGNode::fun()'],['../classSVF_1_1FunExitICFGNode.html#adfcebc33f3c36b8145074d370dfa1cb9',1,'SVF::FunExitICFGNode::fun()'],['../classSVF_1_1PTACallGraphNode.html#a1453299fc45dc51d2c9842ff4de1b860',1,'SVF::PTACallGraphNode::fun()'],['../classSVF_1_1InterMSSAPHISVFGNode.html#aa7ccd369a342e151e22062c92bf1f978',1,'SVF::InterMSSAPHISVFGNode::fun()'],['../classSVF_1_1FormalParmVFGNode.html#ad8f56074e213d2e7dc1d22a1b0765f8c',1,'SVF::FormalParmVFGNode::fun()'],['../classSVF_1_1FormalRetVFGNode.html#ae267daf3681188e6e74f656a73d21be3',1,'SVF::FormalRetVFGNode::fun()'],['../classSVF_1_1InterPHIVFGNode.html#a5aa8e8a10a5c30f2f4669c9190e18740',1,'SVF::InterPHIVFGNode::fun()'],['../classSVF_1_1RetMU.html#a4982f6fffac4f4775e27f994677a9f2c',1,'SVF::RetMU::fun()'],['../classSVF_1_1EntryCHI.html#afd2b2d4a7198f62467b4062740e5196c',1,'SVF::EntryCHI::fun()'],['../classSVF_1_1SVFFunction.html#af33c2824b5ca3a44e0467655ae890623',1,'SVF::SVFFunction::fun()'],['../classSVF_1_1CxtProc.html#a70b6a2ae40bd7e4b08ddcb6d6b0289df',1,'SVF::CxtProc::fun()']]],
   ['funargslistmap',['funArgsListMap',['../classSVF_1_1SVFIR.html#a864c465fbfdbbbdcc7fc8bbe26737903',1,'SVF::SVFIR']]],

package/SVF-doxygen/html/html/search/variables_d.js

@@ -17,7 +17,7 @@ var searchData=
   ['maxcachehard',['maxCacheHard',['../structDdManager.html#a1b53bee9cf86fc1131c420c2aef7e473',1,'DdManager']]],
   ['maxcontextlen',['MaxContextLen',['../classSVF_1_1Options.html#a2e53156bd075d7802d390672f129c6a8',1,'SVF::Options']]],
   ['maxcxtsize',['MaxCxtSize',['../classSVF_1_1TCT.html#aaae41663b1d1f4d38b047c50c156defb',1,'SVF::TCT']]],
-  ['maxfieldlimit',['maxFieldLimit',['../classSVF_1_1SymbolTableInfo.html#a9b8b7ecb217c7395025231b04e7b4c26',1,'SVF::SymbolTableInfo::maxFieldLimit()'],['../classSVF_1_1StInfo.html#a4cd926bd095254dd287f1cf26e02483e',1,'SVF::StInfo::maxFieldLimit()'],['../classSVF_1_1Options.html#adfc1a5c6098d3867e29fc65ca9ffa1cc',1,'SVF::Options::MaxFieldLimit()']]],
+  ['maxfieldlimit',['MaxFieldLimit',['../classSVF_1_1Options.html#adfc1a5c6098d3867e29fc65ca9ffa1cc',1,'SVF::Options::MaxFieldLimit()'],['../classSVF_1_1SymbolTableInfo.html#a9b8b7ecb217c7395025231b04e7b4c26',1,'SVF::SymbolTableInfo::maxFieldLimit()'],['../classSVF_1_1StInfo.html#a4cd926bd095254dd287f1cf26e02483e',1,'SVF::StInfo::maxFieldLimit()']]],
   ['maxgrowth',['maxGrowth',['../structDdManager.html#a8a6a4238d1bc8a87eabd2c3eabd233d7',1,'DdManager']]],
   ['maxgrowthalt',['maxGrowthAlt',['../structDdManager.html#a2926e48e488cec20a61e9b0dc6b91795',1,'DdManager']]],
   ['maximumbudget',['maximumBudget',['../classSVF_1_1DPItem.html#a5dbb0e6010b38c5b937ff06cb40cd0ef',1,'SVF::DPItem']]],

package/SVF-doxygen/html/html/search/variables_e.js

@@ -71,7 +71,9 @@ var searchData=
   ['numofentrychi',['NumOfEntryChi',['../classSVF_1_1MemSSAStat.html#ad96437d0c28f8088c711a718d2f2730e',1,'SVF::MemSSAStat']]],
   ['numofentrynodes',['numOfEntryNodes',['../classSVF_1_1ICFGStat.html#ad37793e64fe58a8faba201c18d876685',1,'SVF::ICFGStat']]],
   ['numofexitnodes',['numOfExitNodes',['../classSVF_1_1ICFGStat.html#ad7e00680fb8ca31afbd166f9a4adc5ec',1,'SVF::ICFGStat']]],
-  ['numoffieldexpand',['numOfFieldExpand',['../classSVF_1_1AndersenBase.html#a9f453ec1b4236b8194ae590981217259',1,'SVF::AndersenBase::numOfFieldExpand()'],['../classSVF_1_1PTAStat.html#a1745e5c3c026a130a70954da9c0074b1',1,'SVF::PTAStat::NumOfFieldExpand()']]],
+  ['numoffieldexpand',['NumOfFieldExpand',['../classSVF_1_1PTAStat.html#a1745e5c3c026a130a70954da9c0074b1',1,'SVF::PTAStat::NumOfFieldExpand()'],['../classSVF_1_1AndersenBase.html#a9f453ec1b4236b8194ae590981217259',1,'SVF::AndersenBase::numOfFieldExpand()']]],
+  ['numofflattenelements',['numOfFlattenElements',['../classSVF_1_1StInfo.html#a7aa5b5018b4dec4913eb6aecf25568a4',1,'SVF::StInfo']]],
+  ['numofflattenfields',['numOfFlattenFields',['../classSVF_1_1StInfo.html#aa9b4e659f4a4421aadf736a3de24ca50',1,'SVF::StInfo']]],
   ['numofformalin',['numOfFormalIn',['../classSVF_1_1SVFGStat.html#abc5e079242666bb55ec7dbc7f258b3db',1,'SVF::SVFGStat']]],
   ['numofformalout',['numOfFormalOut',['../classSVF_1_1SVFGStat.html#ab20900eb0ecb0d2e1e601755848ac531',1,'SVF::SVFGStat']]],
   ['numofformalparam',['numOfFormalParam',['../classSVF_1_1SVFGStat.html#a1e9ddd5678b05e145af41a6d53f47748',1,'SVF::SVFGStat']]],

package/include/MemoryModel/SymbolTableInfo.h

@@ -344,18 +344,7 @@ public:
     /// Get struct info
     //@{
     ///Get an iterator for StructInfo, designed as internal methods
-    TypeToFieldInfoMap::iterator getStructInfoIter(const Type *T)
-    {
-        assert(T);
-        TypeToFieldInfoMap::iterator it = typeToFieldInfo.find(T);
-        if (it != typeToFieldInfo.end())
-            return it;
-        else
-        {
-            collectTypeInfo(T);
-            return typeToFieldInfo.find(T);
-        }
-    }
+    TypeToFieldInfoMap::iterator getStructInfoIter(const Type *T);
 
     ///Get a reference to StructInfo.
     inline StInfo* getStructInfo(const Type *T)
@@ -364,8 +353,12 @@ public:
     }
 
     ///Get a reference to the components of struct_info.
-    /// Flatterned full offset information of a struct including its array fields 
-    const std::vector<u32_t>& getFlattenedOffsetVec(const StructType *T);
+    /// Number of flattenned elements of an array or struct
+    const u32_t getNumOfFlattenElements(const Type *T);
+    /// Number of flattenned fields of a struct
+    const u32_t getNumOfFlattenFields(const StructType *T);
+    /// Flatterned element idx of an array or struct by considering stride
+    const std::vector<u32_t>& getFlattenedElemIdxVec(const Type *T);
     /// Flatterned field index information of a struct ignoring any array field
     const std::vector<u32_t>& getFlattenedFieldIdxVec(const StructType *T);
 
@@ -513,14 +506,18 @@ class StInfo
 private:
     /// flattened field indices of a struct (ignoring arrays)
     std::vector<u32_t> fldIdxVec;
-    /// flattened full offset (including array strides)
-    std::vector<u32_t> fullOffsetVec;
+    /// flattened element indices including structs and arrays by considering strides
+    std::vector<u32_t> elemIdxVec;
     /// Types of all fields of a struct
     Map<u32_t, const Type*> fldIdx2TypeMap;
     /// All field infos after flattening a struct
     std::vector<FlattenedFieldInfo> finfo;
     /// stride represents the number of repetitive elements if this StInfo represent an ArrayType. stride is 1 by default.
     u32_t stride; 
+    /// number of elements after flattenning (including array elements)
+    u32_t numOfFlattenElements; 
+    /// number of fields after flattenning (ignoring array elements)
+    u32_t numOfFlattenFields; 
     /// Max field limit
     static u32_t maxFieldLimit;
 
@@ -530,7 +527,7 @@ private:
 
 public:
     /// Constructor
-    StInfo(u32_t s) : stride(s)
+    StInfo(u32_t s) : stride(s), numOfFlattenElements(s), numOfFlattenFields(s)
     {
     }
     /// Destructor
@@ -552,28 +549,16 @@ public:
     ///  OriginalFieldType of b with field_idx 1 : Struct A
     ///  FlatternedFieldType of b with field_idx 1 : int
     //{@
-    inline const Type* getOriginalFieldType(u32_t fldIdx)
-    {
-        Map<u32_t, const Type*>::const_iterator it = fldIdx2TypeMap.find(fldIdx);
-        if(it!=fldIdx2TypeMap.end())
-            return it->second;
-        return nullptr;
-    }
-    inline const Type* getFlatternedFieldType(u32_t fldIdx)
-    {
-        for(FlattenedFieldInfo& fallenedFld : finfo){
-            if(fallenedFld.getFlattenFldIdx() == fldIdx)
-                return fallenedFld.getFlattenElemTy();
-        }
-        return nullptr;
-    }
+    const Type* getOriginalFieldType(u32_t fldIdx);
+    const Type* getFlatternedFieldType(u32_t fldIdx);
+
     inline std::vector<u32_t>& getFlattenedFieldIdxVec()
     {
         return fldIdxVec;
     }
-    inline std::vector<u32_t>& getFlattenedOffsetVec()
+    inline std::vector<u32_t>& getFlattenedElemIdxVec()
     {
-        return fullOffsetVec;
+        return elemIdxVec;
     }
     inline std::vector<FlattenedFieldInfo>& getFlattenedFieldInfoVec()
     {
@@ -581,16 +566,27 @@ public:
     }
     //@}
 
-    /// Add field (index and offset) with its corresponding type
-    inline void addFldWithType(u32_t fldIdx, const Type* type, u32_t fullOffset)
+    /// Add field index and element index and their corresponding type
+    void addFldWithType(u32_t fldIdx, const Type* type, u32_t elemIdx);
+
+    /// Set number of fields and elements of an aggrate
+    inline void setNumOfFieldsAndElems(u32_t nf, u32_t ne)
     {
-        fldIdxVec.push_back(fldIdx);
-        fullOffsetVec.push_back(fullOffset);
-        fldIdx2TypeMap[fldIdx] = type;
+        numOfFlattenFields = nf;
+        numOfFlattenElements = ne;
     }
 
-    /// Array Type can have 
-    inline u32_t getStride() const {
+    /// Return number of elements after flattenning (including array elements)
+    inline u32_t getNumOfFlattenElements() const {
+        return numOfFlattenElements;
+    }
+
+    /// Return the number of fields after flattenning (ignoring array elements)
+    inline u32_t getNumOfFlattenFields() const {
+        return numOfFlattenFields;
+    }
+    /// Return the stride
+    inline u32_t getStride() const{
         return stride;
     }
 };

package/lib/MemoryModel/LocationSet.cpp

@@ -56,71 +56,76 @@ bool LocationSet::isConstantOffset() const
 }
 
 /// Return element number of a type
-/// (1) StructType, return flatterned number elements, i.e., the index of the last element (getFlattenedOffsetVec().back()) plus one.
-/// (2) ArrayType, return number of elements
-/// (3) PointerType, return the element number of the pointee 
-/// (4) non-pointer SingleValueType, return 1
+/// (1) StructType or Array, return flatterned number elements.
+/// (2) PointerType, return the element number of the pointee 
+/// (3) non-pointer SingleValueType, return 1
 u32_t LocationSet::getElementNum(const Type* type) const{
-    u32_t sz = 1;
-    if(const ArrayType* aty = SVFUtil::dyn_cast<ArrayType>(type))
-    {
-        /// handle nested arrays
-        const Type* innerTy = aty;
-        while (const ArrayType* arr = SVFUtil::dyn_cast<ArrayType>(innerTy))
-        {
-            sz *= arr->getNumElements();
-            innerTy = arr->getElementType();
-        }
-    }
-    else if (const StructType *sty = SVFUtil::dyn_cast<StructType>(type) )
+
+    if(SVFUtil::isa<ArrayType>(type) || SVFUtil::isa<StructType>(type))
     {
-        const vector<u32_t> &so = SymbolTableInfo::SymbolInfo()->getFlattenedOffsetVec(sty);
-        sz = so.back() + 1;
+        return SymbolTableInfo::SymbolInfo()->getNumOfFlattenElements(type);
     }
     else if (type->isSingleValueType())
     {
         /// This is a pointer arithmic
-        if(const PointerType* pty = SVFUtil::dyn_cast<PointerType>(type) ){
-            sz = getElementNum(pty->getElementType());
-        }
+        if(const PointerType* pty = SVFUtil::dyn_cast<PointerType>(type))
+            return getElementNum(pty->getElementType());
+        else
+            return 1;
     }
     else{
         SVFUtil::outs() << "GepIter Type" << *type << "\n";
         assert(false && "What other types for this gep?");
+        abort();
     }
-    return sz;
 }
 
 /// Return accumulated constant offset
 /// 
 /// "value" is the offset variable (must be a constant)
 /// "type" is the location where we want to compute offset
-/// e.g., %3 = getelementptr inbounds [10 x i32], [10 x i32]* %1, i64 0, i64 5 
-/// offsetValues[0] value: i64 0, type: [10 x i32]*
-/// offsetValues[1] value: i64 5, type: [10 x i32]
-/// 
-/// Given a vector: [(v1,t1), (v2,t2), (v3,t3)]
-/// totalConstOffset = v1 * sz(t2) + v2 * sz(t3) + v3 * 1
-/// If the vector only has one element (one gep operand), then it must be a pointer arithmetic and type must be a PointerType
-/// totalConstOffset = v1 * sz(t1) 
+/// Given a vector: [(value1,type1), (value2,type2), (value3,type3)]
+/// totalConstOffset = flattenOffset(value1,type1) * flattenOffset(type2,type2) + flattenOffset(type3,type3)
+/// For a pointer type (e.g., t1 is PointerType), we will retrieve the pointee type and times the offset, i.e., getElementNum(t1) X off1
+
+/// For example,
+// struct inner{ int rollNumber; float percentage;};
+// struct Student { struct inner rollNumber; char studentName[10][3];}
+// char x = studentRecord[1].studentName[3][2];
+
+/// %5 = getelementptr inbounds %struct.Student, %struct.Student* %4, i64 1
+///     value1: i64 1 type1: %struct.Student*  
+///     accumulateConstantOffset = 32
+/// %6 = getelementptr inbounds %struct.Student, %struct.Student* %5, i32 0, i32 1 
+///     value1: i32 0  type1: %struct.Student* 
+///     value2: i32 1  type2: %struct.Student = type { %struct.inner, [10 x [3 x i8]] }  
+///     accumulateConstantOffset = 2
+/// %7 = getelementptr inbounds [10 x [3 x i8]], [10 x [3 x i8]]* %6, i64 0, i64 3 
+///     value1: i64 0  type1: [10 x [3 x i8]]*
+///     value2: i64 3  type2: [10 x [3 x i8]]       
+///     accumulateConstantOffset = 9
+/// %8 = getelementptr inbounds [3 x i8], [3 x i8]* %7, i64 0, i64 2 
+///     value1: i64 0  type1: [3 x i8]*
+///     value2: i64 2  type2: [3 x i8]
+///     accumulateConstantOffset = 2
 s64_t LocationSet::accumulateConstantOffset() const{
     
     assert(isConstantOffset() && "not a constant offset");
 
     s64_t totalConstOffset = 0;
-    u32_t sz = 1;
     for(int i = offsetValues.size() - 1; i >= 0; i--){
         const Value* value = offsetValues[i].first;
         const Type* type = offsetValues[i].second;
         const ConstantInt *op = SVFUtil::dyn_cast<ConstantInt>(value);
         assert(op && "not a constant offset?");
-        /// if this gep only has one operand, the gepIterType must be the pointer type, and we will need to retrieve size of its elementType.
-        if(offsetValues.size()==1){
-            assert(SVFUtil::isa<PointerType>(type) && "If gep has only one operand, its gepIterType must be PointerType!");
-            sz = getElementNum(type);
+        if(const PointerType* pty = SVFUtil::dyn_cast<PointerType>(type))
+            totalConstOffset += op->getSExtValue() * getElementNum(pty->getElementType());
+        else{
+            s64_t offset = op->getSExtValue();
+            const std::vector<u32_t>& so = SymbolTableInfo::SymbolInfo()->getFlattenedElemIdxVec(type); 
+            assert((u32_t)offset <= so.size() && "out of bounds or offset is a negative value?");
+            totalConstOffset += so[op->getSExtValue()];
         }
-        totalConstOffset += op->getSExtValue() * sz; 
-        sz *= getElementNum(type);
     }
     return totalConstOffset;
 }

package/lib/MemoryModel/SymbolTableInfo.cpp

@@ -43,6 +43,48 @@ DataLayout* SymbolTableInfo::dl = nullptr;
 SymbolTableInfo* SymbolTableInfo::symInfo = nullptr;
 u32_t StInfo::maxFieldLimit = 0;
 
+
+/// Add field (index and offset) with its corresponding type
+void StInfo::addFldWithType(u32_t fldIdx, const Type* type, u32_t elemIdx)
+{
+    fldIdxVec.push_back(fldIdx);
+    elemIdxVec.push_back(elemIdx);
+    fldIdx2TypeMap[fldIdx] = type;
+}
+
+///  struct A { int id; int salary; }; struct B { char name[20]; struct A a;}   B b;
+///  OriginalFieldType of b with field_idx 1 : Struct A
+///  FlatternedFieldType of b with field_idx 1 : int
+//{@
+const Type* StInfo::getOriginalFieldType(u32_t fldIdx)
+{
+    Map<u32_t, const Type*>::const_iterator it = fldIdx2TypeMap.find(fldIdx);
+    if(it!=fldIdx2TypeMap.end())
+        return it->second;
+    return nullptr;
+}
+const Type* StInfo::getFlatternedFieldType(u32_t fldIdx)
+{
+    for(FlattenedFieldInfo& fallenedFld : finfo){
+        if(fallenedFld.getFlattenFldIdx() == fldIdx)
+            return fallenedFld.getFlattenElemTy();
+    }
+    return nullptr;
+}
+
+SymbolTableInfo::TypeToFieldInfoMap::iterator SymbolTableInfo::getStructInfoIter(const Type *T)
+{
+    assert(T);
+    TypeToFieldInfoMap::iterator it = typeToFieldInfo.find(T);
+    if (it != typeToFieldInfo.end())
+        return it;
+    else
+    {
+        collectTypeInfo(T);
+        return typeToFieldInfo.find(T);
+    }
+}
+
 /*
  * Initial the memory object here (for a dummy object)
  */
@@ -87,20 +129,17 @@ void SymbolTableInfo::collectTypeInfo(const Type* ty)
  */
 void SymbolTableInfo::collectArrayInfo(const ArrayType* ty)
 {
-    u64_t out_num = ty->getNumElements();
+    u64_t totalElemNum = ty->getNumElements();
     const Type* elemTy = ty->getElementType();
     while (const ArrayType* aty = SVFUtil::dyn_cast<ArrayType>(elemTy))
     {
-        out_num *= aty->getNumElements();
+        totalElemNum *= aty->getNumElements();
         elemTy = aty->getElementType();
     }
     
-    StInfo* stinfo = new StInfo(out_num);
+    StInfo* stinfo = new StInfo(totalElemNum);
     typeToFieldInfo[ty] = stinfo;
 
-    /// Array itself only has one field which is the inner most element
-    stinfo->addFldWithType(0, elemTy, 0);
-
     /// Array's flatten field infor is the same as its element's
     /// flatten infor.
     StInfo* elemStInfo = getStructInfo(elemTy);
@@ -112,6 +151,14 @@ void SymbolTableInfo::collectArrayInfo(const ArrayType* ty)
         FlattenedFieldInfo field(idx, fieldTy);
         stinfo->getFlattenedFieldInfoVec().push_back(field);
     }
+
+    /// Flatten arrays, map each array element index `i` to flattened index `(i * nfE * totalElemNum)/outArrayElemNum`
+    /// nfE>1 if the array element is a struct with more than one field.
+    u32_t outArrayElemNum = ty->getNumElements();
+    for(u32_t i = 0; i < outArrayElemNum; i++)
+        stinfo->addFldWithType(0, elemTy, (i * nfE * totalElemNum)/outArrayElemNum);
+
+    stinfo->setNumOfFieldsAndElems(nfE, nfE * totalElemNum);
 }
 
 
@@ -160,6 +207,8 @@ void SymbolTableInfo::collectStructInfo(const StructType *sty)
         }
     }
 
+    stinfo->setNumOfFieldsAndElems(nf,strideOffset);
+
     //Record the size of the complete struct and update max_struct.
     if (nf > maxStSize)
     {
@@ -182,6 +231,8 @@ void SymbolTableInfo::collectSimpleTypeInfo(const Type* ty)
 
     FlattenedFieldInfo field(0, ty);
     stinfo->getFlattenedFieldInfoVec().push_back(field);
+
+    stinfo->setNumOfFieldsAndElems(1,1);
 }
 
 
@@ -322,10 +373,22 @@ const MemObj* SymbolTableInfo::createDummyObj(SymID symId, const Type* type)
     return memObj;
 }
 
+/// Number of flattenned elements of an array or struct
+const u32_t SymbolTableInfo::getNumOfFlattenElements(const Type *T)
+{
+    return getStructInfoIter(T)->second->getNumOfFlattenElements();
+}
+
+/// Number of flattenned fields of a struct
+const u32_t SymbolTableInfo::getNumOfFlattenFields(const StructType *T)
+{
+    return getStructInfoIter(T)->second->getNumOfFlattenFields();
+}
+
 /// Flatterned full offset information of a struct including its array fields 
-const std::vector<u32_t>& SymbolTableInfo::getFlattenedOffsetVec(const StructType *T)
+const std::vector<u32_t>& SymbolTableInfo::getFlattenedElemIdxVec(const Type *T)
 {
-    return getStructInfoIter(T)->second->getFlattenedOffsetVec();
+    return getStructInfoIter(T)->second->getFlattenedElemIdxVec();
 }
 
 /// Flatterned field index information of a struct ignoring any array field

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.357",
+  "version": "1.0.358",
   "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": {