150   if (I && I->hasOneUse() && I->getOpcode() == Opcode)  in isReassociableOp()
159   if (I && I->hasOneUse() &&  in isReassociableOp()
516         if (!Op->hasOneUse()) {  in LinearizeExprTree()
537         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
555         if (!Op->hasOneUse())  in LinearizeExprTree()
572       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
915   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1184   if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1218   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1220   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
1900       while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode &&  in EraseInst()
1920   if (!I->hasOneUse() || I->getType()->isVectorTy())  in canonicalizeNegConstExpr()
2011         (I->hasOneUse() &&  in OptimizeInst()
2055           (!I->hasOneUse() ||  in OptimizeInst()
2079           (!I->hasOneUse() ||  in OptimizeInst()
2102   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) {  in OptimizeInst()
2114   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2117   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2169   if (I->hasOneUse()) {  in ReassociateExpression()
2254       if (I.hasOneUse() && I.user_back()->getOpcode() == I.getOpcode())  in BuildPairMap()
2265         if (!OpI || OpI->getOpcode() != I.getOpcode() || !OpI->hasOneUse()) {  in BuildPairMap()