129   if (V->hasOneUse() && isa<Instruction>(V) &&  in isReassociableOp()
139   if (V->hasOneUse() && isa<Instruction>(V) &&  in isReassociableOp()
501         if (!Op->hasOneUse()) {  in LinearizeExprTree()
520         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
538         if (!Op->hasOneUse())  in LinearizeExprTree()
555       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
895   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1166     if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1203   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1205   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
1878       while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode &&  in EraseInst()
1889   if (!I->hasOneUse() || I->getType()->isVectorTy())  in canonicalizeNegConstExpr()
1974         (I->hasOneUse() &&  in OptimizeInst()
2023           (!I->hasOneUse() ||  in OptimizeInst()
2047           (!I->hasOneUse() ||  in OptimizeInst()
2070   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) {  in OptimizeInst()
2082   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2085   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2136   if (I->hasOneUse()) {  in ReassociateExpression()