Searched refs:NewFunction (Results 1 – 3 of 3) sorted by relevance
239 bool insert(Function *NewFunction);903 bool MergeFunctions::insert(Function *NewFunction) { in insert() argument905 FnTree.insert(FunctionNode(NewFunction)); in insert()908 assert(FNodesInTree.count(NewFunction) == 0); in insert()909 FNodesInTree.insert({NewFunction, Result.first}); in insert()910 LLVM_DEBUG(dbgs() << "Inserting as unique: " << NewFunction->getName() in insert()917 if (!isFuncOrderCorrect(OldF.getFunc(), NewFunction)) { in insert()920 replaceFunctionInTree(*Result.first, NewFunction); in insert()921 NewFunction = F; in insert()926 << " == " << NewFunction->getName() << '\n'); in insert()[all …]
1586 if (Callee == &NewFunction) in getEdgeKind()1603 if (&F == &NewFunction) in getEdgeKind()1613 Function &NewFunction) { in addSplitFunction() argument1625 assert(!lookup(NewFunction) && in addSplitFunction()1627 Node &NewN = initNode(NewFunction); in addSplitFunction()1703 for (Function *NewFunction : NewFunctions) in addSplitRefRecursiveFunctions()1704 lookupRefSCC(get(*NewFunction))->verify(); in addSplitRefRecursiveFunctions()1710 for (Function *NewFunction : NewFunctions) { in addSplitRefRecursiveFunctions()1711 Node &NewN = initNode(*NewFunction); in addSplitRefRecursiveFunctions()1743 for (Function *NewFunction : NewFunctions) { in addSplitRefRecursiveFunctions()[all …]
1059 void addSplitFunction(Function &OriginalFunction, Function &NewFunction);