/external/llvm/lib/Analysis/ |
CodeMetrics.cpp | 39 if (!CS.isNoInline() && F->hasInternalLinkage() && F->hasOneUse())
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineCasts.cpp | 101 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return 0; 111 if (!AI.hasOneUse() && CastElTyStoreSize < AllocElTyStoreSize) return 0; 148 if (!AI.hasOneUse()) { 353 if (!I->hasOneUse()) return false; 474 if (Src->hasOneUse() && 497 if (Src->hasOneUse() && isa<IntegerType>(Src->getType()) && 666 if (!I->hasOneUse()) return false; 750 if (CI.hasOneUse() && isa<TruncInst>(CI.use_back())) [all...] |
InstCombineAndOrXor.cpp | 46 return CI->hasOneUse(); 142 if (Op->hasOneUse()) { 150 if (Op->hasOneUse()){ 172 if (Op->hasOneUse()) { 250 if (Op->hasOneUse()) { 751 LHS->hasOneUse() && RHS->hasOneUse()) { [all...] |
InstCombineCompares.cpp | 623 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) && 624 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) && 696 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) && 697 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) { [all...] |
InstCombinePHI.cpp | 46 if (!I || I->getOpcode() != Opc || !I->hasOneUse() || 149 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || 320 if (!LI || !LI->hasOneUse()) 437 if (I == 0 || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) 511 if (!PN->hasOneUse()) return false; 674 !User->hasOneUse() || !isa<TruncInst>(User->use_back()) || 804 // FIXME: The hasOneUse check will fail for PHIs that use the value more 806 PN.getIncomingValue(0)->hasOneUse()) 813 if (PN.hasOneUse()) { 828 if (PHIUser->hasOneUse() & [all...] |
InstCombineMulDivRem.cpp | 30 if (!V->hasOneUse()) return 0; 131 if (Op0->hasOneUse() && 146 if (Op0->hasOneUse()) { 190 if (BO && BO->hasOneUse() && 264 if (!Op->hasOneUse()) 275 if (!OpLog2Of->hasOneUse()) 484 if (Opnd0->hasOneUse()) { 507 if (Opnd0->hasOneUse() && 567 if (SI->use_empty() && SelectCond->hasOneUse()) 929 if (Op0->hasOneUse() && match(Op0, m_FDiv(m_Value(X), m_Value(Y)))) [all...] |
InstructionCombining.cpp | 314 Op0->hasOneUse() && Op1->hasOneUse()) { 425 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) 447 if (!V && Op0->hasOneUse() && Op1->hasOneUse()) 587 if (!SI->hasOneUse()) return 0; 631 if (!PN->hasOneUse()) { 824 !Src.hasOneUse()) [all...] |
InstCombineVectorOps.cpp | 42 if (I->getOpcode() == Instruction::Load && I->hasOneUse()) 45 if (BO->hasOneUse() && 50 if (CI->hasOneUse() && 129 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) { 158 if (I->hasOneUse() && 204 if (CI->hasOneUse() && EI.hasOneUse() && 395 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.use_back())) {
|
InstCombineAddSub.cpp | 509 InstQuota = ((!isa<Constant>(V0) && V0->hasOneUse()) && 510 (!isa<Constant>(V1) && V1->hasOneUse())) ? 2 : 1; 829 if (!V->hasOneUse() || !V->getType()->isIntegerTy()) 933 if (LHS->hasOneUse() && (XorRHS->getValue()+1).isPowerOf2()) { 1039 if (LHS->hasOneUse() && [all...] |
InstCombineShifts.cpp | 44 if (Op1->hasOneUse() && match(Op1, m_SRem(m_Value(A), m_Power2(B)))) { 104 if (!I->hasOneUse()) return false; 403 if (Op0->hasOneUse()) { 416 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() && 431 if (isLeftShift && Op0BOOp1->hasOneUse() && 448 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() && 462 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
|
InstCombineSelect.cpp | 215 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && 250 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && 367 if (ICI->hasOneUse()) 796 if (TI->hasOneUse() && FI->hasOneUse()) { [all...] |
InstCombineSimplifyDemanded.cpp | 153 if (Depth != 0 && !I->hasOneUse()) { 227 if (Depth == 0 && !V->hasOneUse()) 353 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() && [all...] |
InstCombineLoadStoreAlloca.cpp | 403 if (Op->hasOneUse()) { 587 if (Ptr->hasOneUse()) { 592 if (GEP->getOperand(0)->hasOneUse())
|
/external/llvm/lib/Transforms/Scalar/ |
Reassociate.cpp | 161 if (V->hasOneUse() && isa<Instruction>(V) && 487 if (!Op->hasOneUse()) { 506 assert(!Op->hasOneUse() && "Only one use, but we got here twice!"); 524 if (!Op->hasOneUse()) 539 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); [all...] |
CodeGenPrepare.cpp | 761 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) && [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
DAGCombiner.cpp | 405 if (!Op.hasOneUse()) return 0; 467 assert(Op.hasOneUse() && "Unknown reuse!"); 571 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) 588 if (N0.hasOneUse()) { 606 if (N1.hasOneUse()) { 677 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse()) [all...] |
TargetLowering.cpp | 313 if (!Op.getNode()->hasOneUse()) 365 if (!Op.getNode()->hasOneUse()) { [all...] |
SelectionDAGDumper.cpp | 518 if (N->getOperand(i).getNode()->hasOneUse()) 535 if (!N->hasOneUse() && N != getRoot().getNode())
|
/external/llvm/lib/Target/X86/ |
X86ISelDAGToDAG.cpp | 300 if (!N.hasOneUse()) 405 if (Callee.getNode() == Chain.getNode() || !Callee.hasOneUse()) 416 if (!Chain.hasOneUse()) 432 Callee.getValue(1).hasOneUse()) 774 !Shift.hasOneUse()) 822 if (!N.hasOneUse() || !Shift.hasOneUse()) [all...] |
/external/llvm/lib/Target/MSP430/ |
MSP430ISelDAGToDAG.cpp | 357 N1.hasOneUse() && 407 if (Node->hasOneUse())
|
/external/llvm/include/llvm/IR/ |
Value.h | 152 /// hasOneUse - Return true if there is exactly one user of this value. This 156 bool hasOneUse() const { 174 /// is a linear time operation. Use hasOneUse, hasNUses, or hasNUsesOrMore
|
/external/llvm/lib/Target/MBlaze/ |
MBlazeISelDAGToDAG.cpp | 214 if (Node->hasOneUse())
|
/external/llvm/lib/Target/NVPTX/ |
NVPTXLowerAggrCopies.cpp | 126 if (load->hasOneUse() == false) continue;
|
/external/llvm/lib/Transforms/Utils/ |
LCSSA.cpp | 156 (I->hasOneUse() && I->use_back()->getParent() == BB &&
|
/external/llvm/include/llvm/CodeGen/ |
MachineRegisterInfo.h | 226 /// hasOneUse - Return true if there is exactly one instruction using the 228 bool hasOneUse(unsigned RegNo) const {
|