165   if (BO && BO->hasOneUse() && BO->getOpcode() == Opcode)  in isReassociableOp()
174   if (BO && BO->hasOneUse() &&  in isReassociableOp()
542         if (!Op->hasOneUse()) {  in LinearizeExprTree()
563         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
581         if (!Op->hasOneUse())  in LinearizeExprTree()
598       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
1037   if (Or->hasOneUse() && isInteresting(VB))  in shouldConvertOrWithNoCommonBitsToAdd()
1082   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1354   if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1388   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1390   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
2079       while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode &&  in EraseInst()
2234         (I->hasOneUse() &&  in OptimizeInst()
2293           (!I->hasOneUse() ||  in OptimizeInst()
2320           (!I->hasOneUse() ||  in OptimizeInst()
2343   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) {  in OptimizeInst()
2355   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2358   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2408   if (I->hasOneUse()) {  in ReassociateExpression()
2575       if (I.hasOneUse() && I.user_back()->getOpcode() == I.getOpcode())  in BuildPairMap()
2586         if (!OpI || OpI->getOpcode() != I.getOpcode() || !OpI->hasOneUse()) {  in BuildPairMap()