Searched refs:NewFunction (Results 1 – 5 of 5) sorted by relevance
238 bool insert(Function *NewFunction);925 bool MergeFunctions::insert(Function *NewFunction) { in insert() argument927 FnTree.insert(FunctionNode(NewFunction)); in insert()930 assert(FNodesInTree.count(NewFunction) == 0); in insert()931 FNodesInTree.insert({NewFunction, Result.first}); in insert()932 LLVM_DEBUG(dbgs() << "Inserting as unique: " << NewFunction->getName() in insert()939 if (!isFuncOrderCorrect(OldF.getFunc(), NewFunction)) { in insert()942 replaceFunctionInTree(*Result.first, NewFunction); in insert()943 NewFunction = F; in insert()948 << " == " << NewFunction->getName() << '\n'); in insert()[all …]
1583 if (Callee == &NewFunction) in getEdgeKind()1600 if (&F == &NewFunction) in getEdgeKind()1610 Function &NewFunction) { in addSplitFunction() argument1622 assert(!lookup(NewFunction) && in addSplitFunction()1624 Node &NewN = initNode(NewFunction); in addSplitFunction()1700 for (Function *NewFunction : NewFunctions) in addSplitRefRecursiveFunctions()1701 lookupRefSCC(get(*NewFunction))->verify(); in addSplitRefRecursiveFunctions()1707 for (Function *NewFunction : NewFunctions) { in addSplitRefRecursiveFunctions()1708 Node &NewN = initNode(*NewFunction); in addSplitRefRecursiveFunctions()1740 for (Function *NewFunction : NewFunctions) { in addSplitRefRecursiveFunctions()[all …]
1078 void addSplitFunction(Function &OriginalFunction, Function &NewFunction);
3229 const FunctionDecl *NewFunction, in FunctionNonObjectParamTypesAreEqual() argument3234 NewFunction->getNumNonObjectParams()) in FunctionNonObjectParamTypesAreEqual()3240 unsigned(NewFunction->hasCXXExplicitFunctionObjectParameter()); in FunctionNonObjectParamTypesAreEqual()3243 auto *NewPT = cast<FunctionProtoType>(NewFunction->getFunctionType()); in FunctionNonObjectParamTypesAreEqual()
3870 const FunctionDecl *NewFunction,