svf-tools 1.0.1024 → 1.0.1025
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/package.json +1 -1
- package/svf/include/SVFIR/SVFIR.h +4 -4
- package/svf-llvm/include/SVF-LLVM/LLVMUtil.h +35 -0
- package/svf-llvm/lib/CppUtil.cpp +1 -1
- package/svf-llvm/lib/DCHG.cpp +1 -1
- package/svf-llvm/lib/ICFGBuilder.cpp +1 -1
- package/svf-llvm/lib/LLVMModule.cpp +1 -2
- package/svf-llvm/lib/ObjTypeInference.cpp +1 -1
- package/svf-llvm/lib/SVFIRBuilder.cpp +9 -9
- package/svf-llvm/lib/SVFIRExtAPI.cpp +3 -2
- package/svf-llvm/lib/SymbolTableBuilder.cpp +3 -3
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "svf-tools",
|
|
3
|
-
"version": "1.0.
|
|
3
|
+
"version": "1.0.1025",
|
|
4
4
|
"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 />",
|
|
5
5
|
"main": "index.js",
|
|
6
6
|
"scripts": {
|
|
@@ -585,10 +585,10 @@ private:
|
|
|
585
585
|
return addNode(node, i);
|
|
586
586
|
}
|
|
587
587
|
|
|
588
|
-
inline NodeID addConstantIntValNode(const SVFValue* curInst, s64_t
|
|
588
|
+
inline NodeID addConstantIntValNode(const SVFValue* curInst, const std::pair<s64_t, u64_t>& intValue, const NodeID i,
|
|
589
589
|
const ICFGNode* icfgNode)
|
|
590
590
|
{
|
|
591
|
-
SVFVar* node = new ConstantIntValVar(curInst,
|
|
591
|
+
SVFVar* node = new ConstantIntValVar(curInst, intValue.first, intValue.second, i, icfgNode);
|
|
592
592
|
return addNode(node, i);
|
|
593
593
|
}
|
|
594
594
|
|
|
@@ -656,13 +656,13 @@ private:
|
|
|
656
656
|
}
|
|
657
657
|
|
|
658
658
|
|
|
659
|
-
inline NodeID addConstantIntObjNode(const SVFValue* curInst, s64_t
|
|
659
|
+
inline NodeID addConstantIntObjNode(const SVFValue* curInst, const std::pair<s64_t, u64_t>& intValue, const NodeID i)
|
|
660
660
|
{
|
|
661
661
|
const MemObj* mem = getMemObj(curInst);
|
|
662
662
|
NodeID base = mem->getId();
|
|
663
663
|
memToFieldsMap[base].set(mem->getId());
|
|
664
664
|
ConstantIntObjVar* node =
|
|
665
|
-
new ConstantIntObjVar(curInst,
|
|
665
|
+
new ConstantIntObjVar(curInst, intValue.first, intValue.second, mem->getId(), mem);
|
|
666
666
|
return addObjNode(curInst, node, mem->getId());
|
|
667
667
|
}
|
|
668
668
|
|
|
@@ -52,6 +52,41 @@ inline bool isCallSite(const Value* val)
|
|
|
52
52
|
return SVFUtil::isa<CallBase>(val);
|
|
53
53
|
}
|
|
54
54
|
|
|
55
|
+
inline double getDoubleValue(const ConstantFP* fpValue)
|
|
56
|
+
{
|
|
57
|
+
double dval = 0;
|
|
58
|
+
if (fpValue->isNormalFP())
|
|
59
|
+
{
|
|
60
|
+
const llvm::fltSemantics& semantics = fpValue->getValueAPF().getSemantics();
|
|
61
|
+
if (&semantics == &llvm::APFloat::IEEEhalf() ||
|
|
62
|
+
&semantics == &llvm::APFloat::IEEEsingle() ||
|
|
63
|
+
&semantics == &llvm::APFloat::IEEEdouble() ||
|
|
64
|
+
&semantics == &llvm::APFloat::IEEEquad() ||
|
|
65
|
+
&semantics == &llvm::APFloat::x87DoubleExtended())
|
|
66
|
+
{
|
|
67
|
+
dval = fpValue->getValueAPF().convertToDouble();
|
|
68
|
+
}
|
|
69
|
+
else
|
|
70
|
+
{
|
|
71
|
+
assert (false && "Unsupported floating point type");
|
|
72
|
+
abort();
|
|
73
|
+
}
|
|
74
|
+
}
|
|
75
|
+
else
|
|
76
|
+
{
|
|
77
|
+
// other cfp type, like isZero(), isInfinity(), isNegative(), etc.
|
|
78
|
+
// do nothing
|
|
79
|
+
}
|
|
80
|
+
return dval;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
inline std::pair<s64_t, u64_t> getIntegerValue(const ConstantInt* intValue)
|
|
84
|
+
{
|
|
85
|
+
if (intValue->getBitWidth() <= 64 && intValue->getBitWidth() >= 1)
|
|
86
|
+
return std::make_pair(intValue->getSExtValue(), intValue->getZExtValue());
|
|
87
|
+
else
|
|
88
|
+
return std::make_pair(0,0);
|
|
89
|
+
}
|
|
55
90
|
|
|
56
91
|
/// Return LLVM callsite given a value
|
|
57
92
|
inline const CallBase* getLLVMCallSite(const Value* value)
|
package/svf-llvm/lib/CppUtil.cpp
CHANGED
package/svf-llvm/lib/DCHG.cpp
CHANGED
|
@@ -1087,7 +1087,7 @@ std::string DCHGraph::diTypeToStr(const DIType *t)
|
|
|
1087
1087
|
int64_t count = -1;
|
|
1088
1088
|
if (const ConstantInt* ci = sr->getCount().dyn_cast<ConstantInt* >())
|
|
1089
1089
|
{
|
|
1090
|
-
count = ci
|
|
1090
|
+
count = LLVMUtil::getIntegerValue(ci).first;
|
|
1091
1091
|
}
|
|
1092
1092
|
|
|
1093
1093
|
ss << "[" << count << "]";
|
|
@@ -196,7 +196,7 @@ void ICFGBuilder::processFunBody(WorkList& worklist)
|
|
|
196
196
|
/// default case is set to -1;
|
|
197
197
|
s64_t val = -1;
|
|
198
198
|
if (condVal && condVal->getBitWidth() <= 64)
|
|
199
|
-
val = condVal
|
|
199
|
+
val = LLVMUtil::getIntegerValue(condVal).first;
|
|
200
200
|
icfg->addConditionalIntraEdge(srcNode, dstNode,val);
|
|
201
201
|
}
|
|
202
202
|
else
|
|
@@ -704,8 +704,7 @@ std::vector<const Function* > LLVMModuleSet::getLLVMGlobalFunctions(const Global
|
|
|
704
704
|
|
|
705
705
|
if (priority && func)
|
|
706
706
|
{
|
|
707
|
-
queue.push(LLVMGlobalFunction(priority
|
|
708
|
-
->getZExtValue(),
|
|
707
|
+
queue.push(LLVMGlobalFunction(LLVMUtil::getIntegerValue(priority).second,
|
|
709
708
|
func));
|
|
710
709
|
}
|
|
711
710
|
}
|
|
@@ -628,7 +628,7 @@ void ObjTypeInference::validateTypeCheck(const CallBase *cs)
|
|
|
628
628
|
SVFUtil::dyn_cast<llvm::ConstantInt>(cs->getOperand(1));
|
|
629
629
|
assert(pInt && "the second argument is a integer");
|
|
630
630
|
u32_t iTyNum = objTyToNumFields(objType);
|
|
631
|
-
if (iTyNum >= pInt
|
|
631
|
+
if (iTyNum >= LLVMUtil::getIntegerValue(pInt).second)
|
|
632
632
|
SVFUtil::outs() << SVFUtil::sucMsg("\t SUCCESS :") << dumpValueAndDbgInfo(cs)
|
|
633
633
|
<< SVFUtil::pasMsg(" TYPE: ")
|
|
634
634
|
<< dumpType(objType) << "\n";
|
|
@@ -247,13 +247,13 @@ void SVFIRBuilder::initialiseNodes()
|
|
|
247
247
|
}
|
|
248
248
|
else if (auto fpValue = SVFUtil::dyn_cast<ConstantFP>(llvmValue))
|
|
249
249
|
{
|
|
250
|
-
pag->addConstantFPValNode(iter->first, fpValue
|
|
250
|
+
pag->addConstantFPValNode(iter->first, LLVMUtil::getDoubleValue(fpValue), iter->second, icfgNode);
|
|
251
251
|
llvmModuleSet()->addToLLVMVal2SVFVarMap(
|
|
252
252
|
fpValue, pag->getGNode(iter->second));
|
|
253
253
|
}
|
|
254
254
|
else if (auto intValue = SVFUtil::dyn_cast<ConstantInt>(llvmValue))
|
|
255
255
|
{
|
|
256
|
-
pag->addConstantIntValNode(iter->first,
|
|
256
|
+
pag->addConstantIntValNode(iter->first, LLVMUtil::getIntegerValue(intValue), iter->second, icfgNode);
|
|
257
257
|
llvmModuleSet()->addToLLVMVal2SVFVarMap(
|
|
258
258
|
intValue, pag->getGNode(iter->second));
|
|
259
259
|
}
|
|
@@ -322,13 +322,13 @@ void SVFIRBuilder::initialiseNodes()
|
|
|
322
322
|
}
|
|
323
323
|
else if (auto fpValue = SVFUtil::dyn_cast<ConstantFP>(llvmValue))
|
|
324
324
|
{
|
|
325
|
-
pag->addConstantFPObjNode(iter->first, fpValue
|
|
325
|
+
pag->addConstantFPObjNode(iter->first, LLVMUtil::getDoubleValue(fpValue), iter->second);
|
|
326
326
|
llvmModuleSet()->addToLLVMVal2SVFVarMap(
|
|
327
327
|
fpValue, pag->getGNode(iter->second));
|
|
328
328
|
}
|
|
329
329
|
else if (auto intValue = SVFUtil::dyn_cast<ConstantInt>(llvmValue))
|
|
330
330
|
{
|
|
331
|
-
pag->addConstantIntObjNode(iter->first,
|
|
331
|
+
pag->addConstantIntObjNode(iter->first, LLVMUtil::getIntegerValue(intValue), iter->second);
|
|
332
332
|
llvmModuleSet()->addToLLVMVal2SVFVarMap(
|
|
333
333
|
intValue, pag->getGNode(iter->second));
|
|
334
334
|
}
|
|
@@ -457,9 +457,9 @@ bool SVFIRBuilder::computeGepOffset(const User *V, AccessPath& ap)
|
|
|
457
457
|
// but we can distinguish different field of an array of struct, e.g. s[1].f1 is different from s[0].f2
|
|
458
458
|
if(const ArrayType* arrTy = SVFUtil::dyn_cast<ArrayType>(gepTy))
|
|
459
459
|
{
|
|
460
|
-
if(!op || (arrTy->getArrayNumElements() <= (u32_t)op
|
|
460
|
+
if(!op || (arrTy->getArrayNumElements() <= (u32_t)LLVMUtil::getIntegerValue(op).first))
|
|
461
461
|
continue;
|
|
462
|
-
APOffset idx =
|
|
462
|
+
APOffset idx = (u32_t)LLVMUtil::getIntegerValue(op).first;
|
|
463
463
|
u32_t offset = pag->getSymbolInfo()->getFlattenedElemIdx(llvmModuleSet()->getSVFType(arrTy), idx);
|
|
464
464
|
ap.setFldIdx(ap.getConstantStructFldIdx() + offset);
|
|
465
465
|
}
|
|
@@ -467,7 +467,7 @@ bool SVFIRBuilder::computeGepOffset(const User *V, AccessPath& ap)
|
|
|
467
467
|
{
|
|
468
468
|
assert(op && "non-const offset accessing a struct");
|
|
469
469
|
//The actual index
|
|
470
|
-
APOffset idx =
|
|
470
|
+
APOffset idx = (u32_t)LLVMUtil::getIntegerValue(op).first;
|
|
471
471
|
u32_t offset = pag->getSymbolInfo()->getFlattenedElemIdx(llvmModuleSet()->getSVFType(ST), idx);
|
|
472
472
|
ap.setFldIdx(ap.getConstantStructFldIdx() + offset);
|
|
473
473
|
}
|
|
@@ -1176,7 +1176,7 @@ void SVFIRBuilder::visitSwitchInst(SwitchInst &inst)
|
|
|
1176
1176
|
/// default case is set to -1;
|
|
1177
1177
|
s64_t val = -1;
|
|
1178
1178
|
if (condVal && condVal->getBitWidth() <= 64)
|
|
1179
|
-
val =
|
|
1179
|
+
val = (u32_t)LLVMUtil::getIntegerValue(condVal).first;
|
|
1180
1180
|
const ICFGNode* icfgNode = llvmModuleSet()->getICFGNode(succInst);
|
|
1181
1181
|
successors.push_back(std::make_pair(icfgNode, val));
|
|
1182
1182
|
}
|
|
@@ -1297,7 +1297,7 @@ const Value* SVFIRBuilder::getBaseValueForExtArg(const Value* V)
|
|
|
1297
1297
|
for (bridge_gep_iterator gi = bridge_gep_begin(gep), ge = bridge_gep_end(gep); gi != ge; ++gi)
|
|
1298
1298
|
{
|
|
1299
1299
|
if(const ConstantInt* op = SVFUtil::dyn_cast<ConstantInt>(gi.getOperand()))
|
|
1300
|
-
totalidx += op
|
|
1300
|
+
totalidx += LLVMUtil::getIntegerValue(op).first;
|
|
1301
1301
|
}
|
|
1302
1302
|
if(totalidx == 0 && !SVFUtil::isa<StructType>(value->getType()))
|
|
1303
1303
|
value = gep->getPointerOperand();
|
|
@@ -50,7 +50,8 @@ const Type* SVFIRBuilder::getBaseTypeAndFlattenedFields(const Value* V, std::vec
|
|
|
50
50
|
/// use user-specified size for this copy operation if the size is a constaint int
|
|
51
51
|
if(szValue && SVFUtil::isa<ConstantInt>(szValue))
|
|
52
52
|
{
|
|
53
|
-
|
|
53
|
+
auto szIntVal = LLVMUtil::getIntegerValue(SVFUtil::cast<ConstantInt>(szValue));
|
|
54
|
+
numOfElems = (numOfElems > szIntVal.first) ? szIntVal.first : numOfElems;
|
|
54
55
|
}
|
|
55
56
|
|
|
56
57
|
LLVMContext& context = LLVMModuleSet::getLLVMModuleSet()->getContext();
|
|
@@ -64,7 +65,7 @@ const Type* SVFIRBuilder::getBaseTypeAndFlattenedFields(const Value* V, std::vec
|
|
|
64
65
|
{
|
|
65
66
|
SymbolTableBuilder builder(pag->getSymbolInfo());
|
|
66
67
|
builder.collectSym(offset);
|
|
67
|
-
pag->addConstantIntValNode(svfOffset,
|
|
68
|
+
pag->addConstantIntValNode(svfOffset, LLVMUtil::getIntegerValue(offset), pag->getSymbolInfo()->getValSym(svfOffset), nullptr);
|
|
68
69
|
}
|
|
69
70
|
ls.addOffsetVarAndGepTypePair(getPAG()->getGNode(getPAG()->getValueNode(svfOffset)), nullptr);
|
|
70
71
|
fields.push_back(ls);
|
|
@@ -781,7 +781,7 @@ u32_t SymbolTableBuilder::analyzeHeapAllocByteSize(const Value* val)
|
|
|
781
781
|
llvm::dyn_cast<llvm::ConstantInt>(arg))
|
|
782
782
|
{
|
|
783
783
|
// Multiply the constant Value if all Args are const
|
|
784
|
-
product *= constIntArg
|
|
784
|
+
product *= LLVMUtil::getIntegerValue(constIntArg).second;
|
|
785
785
|
}
|
|
786
786
|
else
|
|
787
787
|
{
|
|
@@ -871,8 +871,8 @@ void SymbolTableBuilder::initTypeInfo(ObjTypeInfo* typeinfo, const Value* val,
|
|
|
871
871
|
/// In most cases, `NumElements` is not specified in the instruction, which means there is only one element (objSize=1).
|
|
872
872
|
if(const ConstantInt* sz = SVFUtil::dyn_cast<ConstantInt>(allocaInst->getArraySize()))
|
|
873
873
|
{
|
|
874
|
-
elemNum = sz
|
|
875
|
-
byteSize = sz
|
|
874
|
+
elemNum = LLVMUtil::getIntegerValue(sz).second * getNumOfElements(objTy);
|
|
875
|
+
byteSize = LLVMUtil::getIntegerValue(sz).second * typeinfo->getType()->getByteSize();
|
|
876
876
|
}
|
|
877
877
|
/// if ArraySize is not constant, byteSize is not static determined.
|
|
878
878
|
else
|