151   if (I && I->hasOneUse() && I->getOpcode() == Opcode)  in isReassociableOp()
160   if (I && I->hasOneUse() &&  in isReassociableOp()
523         if (!Op->hasOneUse()) {  in LinearizeExprTree()
544         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
562         if (!Op->hasOneUse())  in LinearizeExprTree()
579       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
993   if (Or->hasOneUse() && isInteresting(VB))  in ShouldConvertOrWithNoCommonBitsToAdd()
1038   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1310   if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1344   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1346   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
2026       while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode &&  in EraseInst()
2181         (I->hasOneUse() &&  in OptimizeInst()
2238           (!I->hasOneUse() ||  in OptimizeInst()
2265           (!I->hasOneUse() ||  in OptimizeInst()
2288   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) {  in OptimizeInst()
2300   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2303   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2355   if (I->hasOneUse()) {  in ReassociateExpression()
2447       if (I.hasOneUse() && I.user_back()->getOpcode() == I.getOpcode())  in BuildPairMap()
2458         if (!OpI || OpI->getOpcode() != I.getOpcode() || !OpI->hasOneUse()) {  in BuildPairMap()