1392   bool insert(Function *NewFunction);
1790 bool MergeFunctions::insert(Function *NewFunction) {  in insert()  argument
1792       FnTree.insert(FunctionNode(NewFunction));  in insert()
1795     assert(FNodesInTree.count(NewFunction) == 0);  in insert()
1796     FNodesInTree.insert({NewFunction, Result.first});  in insert()
1797     DEBUG(dbgs() << "Inserting as unique: " << NewFunction->getName() << '\n');  in insert()
1807   if (NewFunction->size() == 1) {  in insert()
1808     if (NewFunction->front().size() <= 2) {  in insert()
1809       DEBUG(dbgs() << NewFunction->getName()  in insert()
1821   if ((OldF.getFunc()->mayBeOverridden() && NewFunction->mayBeOverridden()) ||  in insert()
1822       (!OldF.getFunc()->mayBeOverridden() && !NewFunction->mayBeOverridden()))  in insert()
1823     if (OldF.getFunc()->getName() > NewFunction->getName()) {  in insert()
1826       replaceFunctionInTree(*Result.first, NewFunction);  in insert()
1827       NewFunction = F;  in insert()
1832   assert(!OldF.getFunc()->mayBeOverridden() || NewFunction->mayBeOverridden());  in insert()
1835                << " == " << NewFunction->getName() << '\n');  in insert()
1837   Function *DeleteF = NewFunction;  in insert()