HomeSort by relevance Sort by last modified time
    Searched refs:hasOneUse (Results 1 - 25 of 69) sorted by null

1 2 3

  /external/llvm/lib/Analysis/
CodeMetrics.cpp 39 if (!CS.isNoInline() && F->hasInternalLinkage() && F->hasOneUse())
  /external/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 655 (GEPLHS->hasAllConstantIndices() || GEPLHS->hasOneUse()) &&
656 (GEPRHS->hasAllConstantIndices() || GEPRHS->hasOneUse()) &&
728 (isa<ConstantExpr>(GEPLHS) || GEPLHS->hasOneUse()) &&
729 (isa<ConstantExpr>(GEPRHS) || GEPRHS->hasOneUse())) {
    [all...]
InstCombineAndOrXor.cpp 38 return CI->hasOneUse();
134 if (Op->hasOneUse()) {
142 if (Op->hasOneUse()){
164 if (Op->hasOneUse()) {
240 if (Op->hasOneUse()) {
    [all...]
InstCombinePHI.cpp 48 if (!I || I->getOpcode() != Opc || !I->hasOneUse() ||
151 if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() ||
320 if (!LI || !LI->hasOneUse())
437 if (!I || !I->hasOneUse() || !I->isSameOperationAs(FirstInst))
511 if (!PN->hasOneUse()) return false;
670 !UserI->hasOneUse() || !isa<TruncInst>(UserI->user_back()) ||
800 // FIXME: The hasOneUse check will fail for PHIs that use the value more
802 PN.getIncomingValue(0)->hasOneUse())
809 if (PN.hasOneUse()) {
824 if (PHIUser->hasOneUse() &
    [all...]
InstCombineAddSub.cpp 560 InstQuota = ((!isa<Constant>(V0) && V0->hasOneUse()) &&
561 (!isa<Constant>(V1) && V1->hasOneUse())) ? 2 : 1;
970 if (!LHS->hasOneUse() && !RHS->hasOneUse())
    [all...]
InstCombineVectorOps.cpp 46 if (I->getOpcode() == Instruction::Load && I->hasOneUse())
49 if (BO->hasOneUse() &&
54 if (CI->hasOneUse() &&
131 if (!PHIUser->hasOneUse() || !(PHIUser->user_back() == PN) ||
200 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
237 if (I->hasOneUse() &&
283 if (CI->hasOneUse() && (CI->getOpcode() != Instruction::BitCast)) {
290 if (SI->hasOneUse()) {
510 while (V->hasOneUse() && Depth < 10) {
561 if (!IE.hasOneUse() || !isa<InsertElementInst>(IE.user_back()))
    [all...]
InstCombineCasts.cpp 103 if (!AI.hasOneUse() && CastElTyAlign == AllocElTyAlign) return nullptr;
113 if (!AI.hasOneUse() && CastElTyStoreSize < AllocElTyStoreSize) return nullptr;
151 if (!AI.hasOneUse()) {
356 if (!I->hasOneUse()) return false;
477 if (Src->hasOneUse() &&
500 if (Src->hasOneUse() && isa<IntegerType>(Src->getType()) &&
669 if (!I->hasOneUse()) return false;
763 if (CI.hasOneUse() && isa<TruncInst>(CI.user_back()))
    [all...]
InstructionCombining.cpp 316 Op0->hasOneUse() && Op1->hasOneUse()) {
467 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
487 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
689 if (!SI->hasOneUse()) return nullptr;
733 if (!PN->hasOneUse()) {
    [all...]
InstCombineShifts.cpp 46 if (Op1->hasOneUse() && match(Op1, m_SRem(m_Value(A), m_Power2(B)))) {
106 if (!I->hasOneUse()) return false;
406 if (Op0->hasOneUse()) {
419 if (isLeftShift && Op0BO->getOperand(1)->hasOneUse() &&
438 if (isLeftShift && Op0BOOp1->hasOneUse() &&
455 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
473 if (isLeftShift && Op0BO->getOperand(0)->hasOneUse() &&
    [all...]
InstCombineMulDivRem.cpp 32 if (!V->hasOneUse()) return nullptr;
174 if (Op0->hasOneUse()) {
231 if (BO && BO->hasOneUse() &&
305 if (!Op->hasOneUse())
316 if (!OpLog2Of->hasOneUse())
405 if (FMulOrDiv->hasOneUse()) {
560 if (Opnd0->hasOneUse()) {
579 if (Opnd0->hasOneUse() &&
669 if (SI->use_empty() && SelectCond->hasOneUse())
    [all...]
InstCombineSelect.cpp 240 if (TVI->hasOneUse() && TVI->getNumOperands() == 2 &&
275 if (FVI->hasOneUse() && FVI->getNumOperands() == 2 &&
481 if (ICI->hasOneUse())
    [all...]
InstCombineSimplifyDemanded.cpp 154 if (Depth != 0 && !I->hasOneUse()) {
228 if (Depth == 0 && !V->hasOneUse())
354 if (LHSInst->getOpcode() == Instruction::And && LHSInst->hasOneUse() &&
    [all...]
InstCombineLoadStoreAlloca.cpp 426 if (Op->hasOneUse()) {
622 if (Ptr->hasOneUse()) {
627 if (GEP->getOperand(0)->hasOneUse())
    [all...]
  /external/llvm/lib/Transforms/Scalar/
Reassociate.cpp 237 if (V->hasOneUse() && isa<Instruction>(V) &&
566 if (!Op->hasOneUse()) {
585 assert(!Op->hasOneUse() && "Only one use, but we got here twice!");
603 if (!Op->hasOneUse())
618 assert(Op->hasOneUse() && "Has uses outside the expression tree!");
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 456 if (!Op.hasOneUse()) return 0;
518 assert(Op.hasOneUse() && "Unknown reuse!");
620 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
684 if (N0.hasOneUse()) {
705 if (N1.hasOneUse()) {
779 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse())
    [all...]
TargetLowering.cpp 336 if (!Op.getNode()->hasOneUse())
388 if (!Op.getNode()->hasOneUse()) {
661 if (InOp.hasOneUse() &&
663 InnerOp.hasOneUse() &&
    [all...]
SelectionDAGDumper.cpp 535 if (N->getOperand(i).getNode()->hasOneUse())
552 if (!N->hasOneUse() && N != getRoot().getNode())
  /external/llvm/lib/Target/AArch64/
AArch64AddressTypePromotion.cpp 183 (Inst->getType() == ConsideredSExtType || Inst->hasOneUse()))
188 if (!Inst->hasOneUse())
  /external/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp 310 if (!N.hasOneUse())
414 if (Callee.getNode() == Chain.getNode() || !Callee.hasOneUse())
425 if (!Chain.hasOneUse())
441 Callee.getValue(1).hasOneUse())
787 !Shift.hasOneUse())
835 if (!N.hasOneUse() || !Shift.hasOneUse())
    [all...]
  /external/llvm/lib/Target/MSP430/
MSP430ISelDAGToDAG.cpp 359 N1.hasOneUse() &&
408 if (Node->hasOneUse())
  /external/llvm/lib/Target/NVPTX/
NVPTXLowerAggrCopies.cpp 120 if (load->hasOneUse() == false)
  /external/llvm/lib/Transforms/Utils/
LCSSA.cpp 211 (I->hasOneUse() && I->user_back()->getParent() == BB &&
FlattenCFG.cpp 168 if (!PC || !PC->hasOneUse())
  /external/llvm/lib/CodeGen/
CodeGenPrepare.cpp     [all...]
  /external/llvm/include/llvm/IR/
Value.h 273 /// hasOneUse - Return true if there is exactly one user of this value. This
277 bool hasOneUse() const {
295 /// is a linear time operation. Use hasOneUse, hasNUses, or hasNUsesOrMore

Completed in 964 milliseconds

1 2 3