158   if (BO && BO->hasOneUse() && BO->getOpcode() == Opcode)  in isReassociableOp()
167   if (BO && BO->hasOneUse() &&  in isReassociableOp()
531         if (!Op->hasOneUse()) {  in LinearizeExprTree()
552         assert(!Op->hasOneUse() && "Only one use, but we got here twice!");  in LinearizeExprTree()
570         if (!Op->hasOneUse())  in LinearizeExprTree()
587       assert(Op->hasOneUse() && "Has uses outside the expression tree!");  in LinearizeExprTree()
1011   if (Or->hasOneUse() && isInteresting(VB))  in shouldConvertOrWithNoCommonBitsToAdd()
1056   if (Sub->hasOneUse() &&  in ShouldBreakUpSubtract()
1327   if (!Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1361   if (Opnd1->getValue()->hasOneUse())  in CombineXorOpnd()
1363   if (Opnd2->getValue()->hasOneUse())  in CombineXorOpnd()
2054       while (Op->hasOneUse() && Op->user_back()->getOpcode() == Opcode &&  in EraseInst()
2209         (I->hasOneUse() &&  in OptimizeInst()
2267           (!I->hasOneUse() ||  in OptimizeInst()
2294           (!I->hasOneUse() ||  in OptimizeInst()
2317   if (BO->hasOneUse() && BO->user_back()->getOpcode() == Opcode) {  in OptimizeInst()
2329   if (BO->hasOneUse() && BO->getOpcode() == Instruction::Add &&  in OptimizeInst()
2332   if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd &&  in OptimizeInst()
2381   if (I->hasOneUse()) {  in ReassociateExpression()
2473       if (I.hasOneUse() && I.user_back()->getOpcode() == I.getOpcode())  in BuildPairMap()
2484         if (!OpI || OpI->getOpcode() != I.getOpcode() || !OpI->hasOneUse()) {  in BuildPairMap()