Searched refs:NewFunction (Results 1 – 3 of 3) sorted by relevance
240 bool insert(Function *NewFunction);921 bool MergeFunctions::insert(Function *NewFunction) { in insert() argument923 FnTree.insert(FunctionNode(NewFunction)); in insert()926 assert(FNodesInTree.count(NewFunction) == 0); in insert()927 FNodesInTree.insert({NewFunction, Result.first}); in insert()928 LLVM_DEBUG(dbgs() << "Inserting as unique: " << NewFunction->getName() in insert()935 if (!isFuncOrderCorrect(OldF.getFunc(), NewFunction)) { in insert()938 replaceFunctionInTree(*Result.first, NewFunction); in insert()939 NewFunction = F; in insert()944 << " == " << NewFunction->getName() << '\n'); in insert()[all …]
1570 Function &NewFunction) { in getEdgeKind() argument1583 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()1626 Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction); in addSplitFunction()1700 for (Function *NewFunction : NewFunctions) in addSplitRefRecursiveFunctions()1701 lookupRefSCC(get(*NewFunction))->verify(); in addSplitRefRecursiveFunctions()1707 for (Function *NewFunction : NewFunctions) { in addSplitRefRecursiveFunctions()[all …]
1078 void addSplitFunction(Function &OriginalFunction, Function &NewFunction);