65 double timeStart, timeEnd;
70 + M.getName().str() +
"...\n"));
72 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)
74 for (Module::const_iterator F = M.begin(), E = M.end(); F != E; ++F)
76 for (Module::const_iterator F = M.begin(), E = M.end(); F != E; ++F)
99 SVFUtil::errs() <<
"Warning: skipping unsupported vtable initializer for "
100 << globalvalue->getName().str() <<
"; class hierarchy analysis may be incomplete\n";
104 if (!
chg->getNode(className))
107 for (
unsigned int ei = 0; ei < vtblStruct->getNumOperands(); ++ei)
110 assert(vtbl &&
"Element of initializer not an array?");
111 for (
u32_t i = 0; i < vtbl->getNumOperands(); ++i)
115 const Value* bitcastValue = ce->getOperand(0);
143 for (Function::const_iterator B = F->begin(), E = F->end(); B != E; ++B)
145 for (BasicBlock::const_iterator I = B->begin(), E = B->end(); I != E; ++I)
178 if (cs->arg_size() < 1 || (cs->arg_size() < 2 && cs->paramHasAttr(0, llvm::Attribute::StructRet)))
180 if(caller->arg_size() == 0)
187 if (csThisPtr !=
nullptr && samePtr)
204 if (ce->getOpcode() == Instruction::BitCast)
206 const Value* bitcastval = ce->getOperand(0);
209 if (bcce->getOpcode() == Instruction::GetElementPtr)
211 const Value* gepval = bcce->getOperand(0);
215 if (vtblClassName.size() > 0 && dname.
className.compare(vtblClassName) != 0)
228 for (Module::const_named_metadata_iterator mdit = M.named_metadata_begin(),
229 mdeit = M.named_metadata_end(); mdit != mdeit; ++mdit)
232 string mdname = md->getName().str();
233 if (mdname.compare(0, 15,
"__cxx_bases_of_") != 0)
235 string className = mdname.substr(15);
236 for (NamedMDNode::const_op_iterator opit = md->op_begin(),
237 opeit = md->op_end(); opit != opeit; ++opit)
241 string baseName = mdstr->getString().str();
249 assert(!
chg->getNode(className) &&
"this node should never be created before!");
251 chg->classNameToNodeMap[className] = node;
253 if (className.size() > 0 && className[className.size() - 1] ==
'>')
256 CHNode* templateNode =
chg->getNode(templateName);
259 DBOUT(
DCHA,
outs() <<
"\t Create Template CHANode " + templateName +
" for class " + className +
"...\n");
264 chg->addInstances(templateName,node);
280 const CHNode *node = it->second;
284 while (!worklist.
empty())
287 if (visitedNodes.find(curnode) == visitedNodes.end())
289 for (CHEdge::CHEdgeSetTy::const_iterator it =
295 CHNode *succnode = (*it)->getDstNode();
296 chg->classNameToAncestorsMap[node->
getName()].insert(succnode);
297 chg->classNameToDescendantsMap[succnode->
getName()].insert(node);
298 worklist.
push(succnode);
301 visitedNodes.insert(curnode);
308 const string& className)
311 CHGraph::NameToCHNodesMap::const_iterator it =
chg->classNameToInstAndDescsMap.find(className);
312 if (it !=
chg->classNameToInstAndDescsMap.end())
318 chg->classNameToInstAndDescsMap[className] =
chg->getDescendants(className);
319 if (
chg->getNode(className)->isTemplate())
322 for (CHNodeSetTy::const_iterator it = instances.begin(), eit = instances.end(); it != eit; ++it)
325 chg->classNameToInstAndDescsMap[className].insert(node);
327 for (CHNodeSetTy::const_iterator dit =
328 instance_descendants.begin(), deit =
329 instance_descendants.end(); dit != deit; ++dit)
331 chg->classNameToInstAndDescsMap[className].insert(*dit);
335 return chg->classNameToInstAndDescsMap[className];
375 for (Module::const_global_iterator I = M.global_begin(),
376 E = M.global_end(); I != E; ++I)
386 CHNode *node =
chg->getNode(vtblClassName);
387 assert(node &&
"node not found?");
391 globalObjVar->
setName(vtblClassName);
394 for (
unsigned int ei = 0; ei < vtblStruct->getNumOperands(); ++ei)
398 assert(vtbl &&
"Element of initializer not an array?");
406 bool pure_abstract =
true;
408 while (i < vtbl->getNumOperands())
411 bool is_virtual =
false;
412 int null_ptr_num = 0;
413 for (; i < vtbl->getNumOperands(); ++i)
415 Constant* operand = vtbl->getOperand(i);
420 auto foo = [&is_virtual, &null_ptr_num, &vtbl, &i](
const Value* val)
422 if (
getCXXABI(val)->isTypeInfo(val->getName().str()))
426 while (i+null_ptr_num < vtbl->getNumOperands())
438 if(ce->getOpcode() == Instruction::BitCast)
439 foo(ce->getOperand(0));
444 foo(vtbl->getOperand(i - 1));
450 auto foo = [
this, &virtualFunctions, &pure_abstract, &vtblClassName](
const Value* operand)
457 pure_abstract &=
true;
461 pure_abstract &=
false;
465 vtblClassName.compare(dname.
className) != 0)
476 const Constant *aliasValue = alias->getAliasee();
479 aliasValue = valAsAlias->getAliasee();
491 assert(aliasconst->getOpcode() == Instruction::BitCast &&
492 "aliased constantexpr in vtable not a bitcast");
495 assert(aliasbitcastfunc &&
496 "aliased bitcast in vtable not a function");
501 assert(
false &&
"alias not function or bitcast");
504 pure_abstract &=
false;
506 else if (
getCXXABI(operand)->isTypeInfo(operand->getName().str()))
511 assert(
"what else can be in bitcast of a vtable?");
534 u32_t opcode = ce->getOpcode();
535 assert(opcode == Instruction::IntToPtr);
536 assert(ce->getNumOperands() == 1 &&
537 "inttptr operand num not 1");
538 if (opcode == Instruction::IntToPtr)
550 if (is_virtual && virtualFunctions.size() > 0)
552 for (
int i = 0; i < null_ptr_num; ++i)
554 const FunObjVar* fun = virtualFunctions[i];
555 virtualFunctions.insert(virtualFunctions.begin(), fun);
558 if (virtualFunctions.size() > 0)
561 if (pure_abstract ==
true)
581 neit =
chg->end(); nit != neit; ++nit)
583 CHNode *node = nit->second;
584 if (visitedNodes.find(node) != visitedNodes.end())
587 string className = node->
getName();
594 nodeStack.push(node);
595 while (!nodeStack.empty())
597 const CHNode *curnode = nodeStack.top();
599 group.insert(curnode);
600 if (visitedNodes.find(curnode) != visitedNodes.end())
602 for (CHEdge::CHEdgeSetTy::const_iterator it = curnode->
getOutEdges().begin(),
603 eit = curnode->
getOutEdges().end(); it != eit; ++it)
605 CHNode *tmpnode = (*it)->getDstNode();
606 nodeStack.push(tmpnode);
607 group.insert(tmpnode);
609 for (CHEdge::CHEdgeSetTy::const_iterator it = curnode->
getInEdges().begin(),
610 eit = curnode->
getInEdges().end(); it != eit; ++it)
612 CHNode *tmpnode = (*it)->getSrcNode();
613 nodeStack.push(tmpnode);
614 group.insert(tmpnode);
616 visitedNodes.insert(curnode);
622 set<const FunObjVar*> virtualFunctions;
623 for (CHGraph::CHNodeSetTy::iterator it = group.begin(),
624 eit = group.end(); it != eit; ++it)
626 const vector<CHNode::FuncVector> &vecs = (*it)->getVirtualFunctionVectors();
627 for (vector<CHNode::FuncVector>::const_iterator vit = vecs.begin(),
628 veit = vecs.end(); vit != veit; ++vit)
630 for (vector<const FunObjVar*>::const_iterator fit = (*vit).begin(),
631 feit = (*vit).end(); fit != feit; ++fit)
633 virtualFunctions.insert(*fit);
653 set<pair<string, const FunObjVar*> > fNameSet;
654 for (set<const FunObjVar*>::iterator fit = virtualFunctions.begin(),
655 feit = virtualFunctions.end(); fit != feit; ++fit)
659 fNameSet.insert(pair<string, const FunObjVar*>(dname.
funcName, f));
661 for (set<pair<string, const FunObjVar*>>::iterator it = fNameSet.begin(),
662 eit = fNameSet.end(); it != eit; ++it)
664 chg->virtualFunctionToIDMap[it->second] =
chg->vfID++;
675 for (Module::const_iterator F = M.begin(), E = M.end(); F != E; ++F)
686 for (CHNodeSetTy::const_iterator it = chClasses.begin(), eit = chClasses.end(); it != eit; ++it)
695 if (vtbls.size() > 0)
699 chg->callNodeToCHAVtblsMap[icfgNode] = vtbls;
702 if (virtualFunctions.size() > 0)
703 chg->callNodeToCHAVFnsMap[icfgNode] = virtualFunctions;
718 CHGraph::CallNodeToCHNodesMap::const_iterator it =
chg->callNodeToClassesMap.find(icfgNode);
719 if (it !=
chg->callNodeToClassesMap.end())
727 if(thisPtrClassNames.empty())
730 for (
const auto &node: *
chg)
732 chg->callNodeToClassesMap[icfgNode].insert(node.second);
734 return chg->callNodeToClassesMap[icfgNode];
737 for (
const auto &thisPtrClassName: thisPtrClassNames)
739 if (
const CHNode* thisNode =
chg->getNode(thisPtrClassName))
742 chg->callNodeToClassesMap[icfgNode].insert(thisNode);
743 for (CHGraph::CHNodeSetTy::const_iterator it2 = instAndDesces.begin(), eit = instAndDesces.end(); it2 != eit; ++it2)
744 chg->callNodeToClassesMap[icfgNode].insert(*it2);
747 return chg->callNodeToClassesMap[icfgNode];
758 v.push_back(pFunction);
764 v.push_back(pFunction);
const string pureVirtualFunName
#define DBOUT(TYPE, X)
LLVM debug macros, define type of your DBUG model of each pass.
void analyzeVTables(const Module &M)
void connectInheritEdgeViaStore(const Function *caller, const StoreInst *store)
LLVMModuleSet * llvmModuleSet()
void readInheritanceMetadataFromModule(const Module &M)
void buildCHGNodes(const GlobalValue *V)
const CHGraph::CHNodeSetTy & getInstancesAndDescendants(const std::string &className)
CHGraph::WorkList WorkList
void addFuncToFuncVector(CHNode::FuncVector &v, const Function *f)
void buildCHGEdges(const Function *F)
void buildVirtualFunctionToIDMap()
void buildCSToCHAVtblsAndVfnsMap()
CHGraph::CHNodeSetTy CHNodeSetTy
const CHNodeSetTy & getCSClasses(const CallBase *cs)
CHNode * createNode(const std::string &name)
void connectInheritEdgeViaCall(const Function *caller, const CallBase *cs)
void buildClassNameToAncestorsDescendantsMap()
Set< const CHNode * > CHNodeSetTy
virtual const std::string & getName() const
void setVTable(const GlobalObjVar *vtbl)
void setMultiInheritance()
void addVirtualFunctionVector(FuncVector vfuncvec)
void setPureAbstract()
Attribute.
std::vector< const FunObjVar * > FuncVector
bool push(const Data &data)
IDToNodeMapTy::const_iterator const_iterator
NodeType * getGNode(NodeID id) const
Get a node.
const GEdgeSetTy & getOutEdges() const
const GEdgeSetTy & getInEdges() const
const FunObjVar * getFunObjVar(const Function *fun) const
static LLVMModuleSet * getLLVMModuleSet()
ICFGNode * getICFGNode(const Instruction *inst)
Get a basic block ICFGNode.
NodeID getObjectNode(const Value *V)
static const Option< bool > DumpCHA
static PAG * getPAG(bool buildFromFile=false)
Singleton design here to make sure we only have one instance during any analysis.
static double getClk(bool mark=false)
NodeID getId() const
Get ID.
virtual const std::string & getName() const
virtual void setName(const std::string &nameInfo)
bool isCallSite(const Instruction *inst)
Whether an instruction is a call or invoke instruction.
const ConstantExpr * isCastConstantExpr(const Value *val)
const Function * getCallee(const CallBase *cs)
std::string pasMsg(const std::string &msg)
Print each pass/phase message by converting a string into blue string output.
std::enable_if_t<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type > cast(const Y &Val)
LLVM_NODISCARD bool isa(const Y &Val)
std::ostream & errs()
Overwrite llvm::errs().
std::ostream & outs()
Overwrite llvm::outs().
LLVM_NODISCARD std::enable_if_t<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type > dyn_cast(const Y &Val)
std::string getBeforeBrackets(const std::string &name)
const Argument * getConstructorThisPtr(const Function *fun)
bool isSameThisPtrInConstructor(const Argument *thisPtr1, const Value *thisPtr2)
const Value * getVCallThisPtr(const CallBase *cs)
struct DemangledName demangle(const std::string &name)
Set< std::string > getClassNameOfThisPtr(const CallBase *cs)
bool isCPPThunkFunction(const Function *F)
bool isVirtualCallSite(const CallBase *cs)
const Function * getThunkTarget(const Function *F)
const ConstantStruct * getVtblStruct(const GlobalValue *vtbl)
bool isConstructor(const Function *F)
std::string getClassNameFromVtblObj(const std::string &vtblName)
bool isValVtbl(const Value *val)
A carefully crafted input such as FakeVTable _ZTV1A = {{nullptr, nullptr}}; can forge a vtable; detec...
bool isDestructor(const Function *F)
llvm::const_inst_iterator const_inst_iterator
llvm::GlobalAlias GlobalAlias
llvm::ConstantStruct ConstantStruct
llvm::NamedMDNode NamedMDNode
LLVM metadata and debug information.
Set< const GlobalObjVar * > VTableSet
std::unordered_set< Key, Hash, KeyEqual, Allocator > Set
llvm::ConstantArray ConstantArray
llvm::GlobalValue GlobalValue
llvm::Value Value
LLVM Basic classes.
llvm::ConstantExpr ConstantExpr
llvm::StoreInst StoreInst
Set< const FunObjVar * > VFunSet