HomeSort by: relevance | last modified time | path
    Searched defs:Incoming (Results 1 - 14 of 14) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ExecutionDomainFix.cpp 172 LiveRegsDVInfo &Incoming = MBBOutRegsInfos[pred->getNumber()];
173 // Incoming is null if this is a backedge from a BB
175 if (Incoming.empty())
179 DomainValue *pdv = resolve(Incoming[rx]);
287 // Scan the explicit use operands for incoming domains.
328 // incoming DomainValues that we want to merge.
ReachingDefAnalysis.cpp 80 const LiveRegsDefInfo &Incoming = MBBOutRegsInfos[pred->getNumber()];
81 // Incoming is null if this is a backedge from a BB
83 if (Incoming.empty())
88 LiveRegs[Unit] = std::max(LiveRegs[Unit], Incoming[Unit]);
153 // there is now a more recent incoming reaching definition from a predecessor.
157 const LiveRegsDefInfo &Incoming = MBBOutRegsInfos[pred->getNumber()];
158 // Incoming may be empty for dead predecessors.
159 if (Incoming.empty())
163 int Def = Incoming[Unit];
440 SmallPtrSet<MachineInstr*, 2> Incoming;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceGraphBuilder.cpp 99 // 2. Identify incoming edges incident to the nodes inside of the SCC and
144 Incoming, // Incoming edges to the SCC
154 // There is a flag defined for each direction (incoming vs outgoing) and
184 << (Dir == Direction::Incoming ? "incoming)" : "outgoing)")
187 assert((Dir == Direction::Incoming || Dir == Direction::Outgoing) &&
195 if (Dir == Direction::Incoming) {
211 // Process incoming edges incident to the pi-block node.
212 reconnectEdges(N, SCCNode, &PiNode, Direction::Incoming);
    [all...]
InstructionSimplify.cpp 510 /// try to simplify the binop by seeing whether evaluating it on the incoming
534 // Evaluate the BinOp on the incoming phi values.
536 for (Value *Incoming : PI->incoming_values()) {
537 // If the incoming value is the phi node itself, it can safely be skipped.
538 if (Incoming == PI) continue;
540 SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) :
541 SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse);
553 /// comparison by seeing whether comparing with all of the incoming phi values
574 // Evaluate the BinOp on the incoming phi values.
577 Value *Incoming = PI->getIncomingValue(u)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 617 // the incoming values from the previous block.
639 Value *Incoming = PHI.getIncomingValueForBlock(*BB);
640 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming);
642 Incoming = It->second;
643 PHI.addIncoming(Incoming, New);
699 // Loop over the PHI nodes in the original block, setting incoming values.
732 // Preserve the incoming value from BB if we are jumping to the block
LoopUtils.cpp 604 // other incoming values. Given the loop has dedicated exits, all other
605 // incoming values must be from the exiting blocks.
608 // Removes all incoming values from all other exiting blocks (including
611 // NOTE! We need to remove Incoming Values in the reverse order as done
1223 unsigned Ith; // For which incoming value?
1224 const SCEV *ExpansionSCEV; // The SCEV of the incoming value we are rewriting.
1260 Value *Incoming = P->getIncomingValueForBlock(ExitingBlocks[0]);
1262 // If the Incoming value of P is found in RewritePhiSet, we know it
1270 if (Phi.PN == P && (Phi.PN)->getIncomingValue(i) == Incoming) {
1277 if (!found && (I = dyn_cast<Instruction>(Incoming)))
    [all...]
SimplifyIndVar.cpp 235 Value *Incoming = PN->getIncomingValue(Idx);
236 const SCEV *IncomingS = SE->getSCEV(Incoming);
237 CheapExpansions[IncomingS] = Incoming;
1125 /// common dominator for the incoming blocks. A nullptr can be returned if no
SimplifyCFG.cpp 303 // conflicting incoming values from the two switch blocks.
1612 // Make the PHI node use the select for all incoming values for BB1/BB2
1967 // (1) all incoming arcs are unconditional
1968 // (2) there are non-unconditional incoming arcs
2771 // select form of or/ands, unless one of the incoming values is an 'not' and
3317 // could just create a new PHI with an undef incoming value, but that could
3320 // as an incoming operand. If we find one, we use it, else we create a new
3323 // If AlternativeV is not nullptr, we care about both incoming values in PHI.
3894 // 'logical' edges are incoming edges of the phi that is eliminated, not
4357 // Check incoming blocks to see if any of them are trivial
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
StatepointLowering.cpp 187 // All incoming values should have same known stack slot, otherwise result
240 static bool willLowerDirectly(SDValue Incoming) {
243 if (isa<FrameIndexSDNode>(Incoming))
250 if (Incoming.getValueType().getSizeInBits() > 64)
253 return (isa<ConstantSDNode>(Incoming) || isa<ConstantFPSDNode>(Incoming) ||
254 Incoming.isUndef());
257 /// Try to find existing copies of the incoming values in stack slots used for
258 /// statepoint spilling. If we can find a spill slot for the incoming value,
264 SDValue Incoming = Builder.getValue(IncomingValue)
    [all...]
LegalizeIntegerTypes.cpp 2253 // Expand the incoming operand to be shifted, so that we have its parts
2357 // Get the incoming operand to be shifted.
2436 // Get the incoming operand to be shifted.
4900 // EXTRACT_VECTOR_ELT can return types which are wider than the incoming
4940 // For each incoming vector
4942 SDValue Incoming = GetPromotedInteger(N->getOperand(VecIdx));
4943 EVT SclrTy = Incoming->getValueType(0).getVectorElementType();
4944 unsigned NumElem = Incoming->getValueType(0).getVectorNumElements();
4947 // Extract element from incoming vector
4948 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SclrTy, Incoming,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp 55 STATISTIC(NumPhiCommon, "Number of phis deleted via common incoming value");
148 /// Try to simplify a phi with constant incoming values that match the edge
161 // Collect incoming constants and initialize possible common value.
165 Value *Incoming = P->getIncomingValue(i);
166 if (auto *IncomingConstant = dyn_cast<Constant>(Incoming)) {
170 CommonValue = Incoming;
171 } else if (Incoming != CommonValue) {
180 // The common value must be valid in all incoming blocks.
186 // We have a phi with exactly 1 variable incoming value and 1 or more constant
187 // incoming values. See if all constant incoming values can be mapped back t
    [all...]
SimpleLoopUnswitch.cpp 173 /// incoming values along this edge.
182 // If the incoming value for this edge isn't loop invariant the unswitch
217 // incoming basic block. We loop to handle weird cases with repeated
218 // incoming blocks, but expect to typically only have one operand here.
221 "Found incoming block different from unique predecessor!");
248 // create the same number of new incoming edges in the new PHI as we expect
259 Value *Incoming = PN.getIncomingValue(i);
264 NewPN->addIncoming(Incoming, &OldPH);
1121 // have spurious incoming values.
1168 // Loop over the incoming operands backwards so we can easily delete as w
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 1104 // If Arg is a PHI, and one or more incoming values to the
1108 // call could be pushed up to just those paths with non-null incoming
1125 // Determine if the PHI has any null operands, or any incoming
1130 Value *Incoming = GetRCIdentityRoot(PN->getIncomingValue(i));
1131 if (IsNullOrUndef(Incoming))
1186 Value *Incoming = GetRCIdentityRoot(PN->getIncomingValue(i));
1187 if (IsNullOrUndef(Incoming))
1201 Worklist.push_back(std::make_pair(Clone, Incoming));
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Instructions.cpp 107 // removeIncomingValue - Remove an incoming value. This is useful if a
154 return nullptr; // Incoming values not all the same.
167 /// unique non-undef incoming value need not dominate the PHI node.
171 Value *Incoming = getIncomingValue(i);
172 if (Incoming != this && !isa<UndefValue>(Incoming)) {
173 if (ConstantValue && ConstantValue != Incoming)
175 ConstantValue = Incoming;

Completed in 47 milliseconds