237   if (V->hasOneUse() && isa<Instruction>(V) &&  in isReassociableOp()
566         if (!Op->hasOneUse()) {  in LinearizeExprTree()
585         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
603         if (!Op->hasOneUse())  in LinearizeExprTree()
618       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
916   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1157     if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1193   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1195   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
1798       while (Op->hasOneUse() && Op->use_back()->getOpcode() == Opcode &&  in EraseInst()
1817         (I->hasOneUse() &&  in OptimizeInst()
1871           (!I->hasOneUse() ||  in OptimizeInst()
1888   if (BO->hasOneUse() && BO->use_back()->getOpcode() == Opcode)  in OptimizeInst()
1893   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
1945   if (I->getOpcode() == Instruction::Mul && I->hasOneUse() &&  in ReassociateExpression()