HomeSort by relevance Sort by last modified time
    Searched refs:PHI (Results 26 - 50 of 72) sorted by null

12 3

  /external/llvm/lib/Analysis/
CostModel.cpp 102 case Instruction::PHI:
ValueTracking.cpp 655 case Instruction::PHI: {
657 // Handle the case of a simple two-predecessor recurrence PHI.
685 // Ok, we have a PHI of the form L op= R. Check for low
701 // Unreachable blocks may have zero-operand PHI nodes.
    [all...]
  /external/llvm/lib/Target/Mips/
MipsSEISelLowering.cpp 149 // $vr0 = phi($vr2, $fbb, $vr1, $tbb)
190 // Insert phi function to $Sink.
191 BuildMI(*Sink, Sink->begin(), DL, TII->get(Mips::PHI),
Mips16ISelLowering.cpp 464 // %Result = phi [ %TrueValue, thisMBB ], [ %FalseValue, copy0MBB ]
469 TII->get(Mips::PHI), MI->getOperand(0).getReg())
528 // %Result = phi [ %TrueValue, thisMBB ], [ %FalseValue, copy0MBB ]
533 TII->get(Mips::PHI), MI->getOperand(0).getReg())
593 // %Result = phi [ %TrueValue, thisMBB ], [ %FalseValue, copy0MBB ]
598 TII->get(Mips::PHI), MI->getOperand(0).getReg())
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCUtil.cpp 199 case Instruction::Select: case Instruction::PHI:
  /external/llvm/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp 120 DEBUG(dbgs() << "CVP: Threading PHI over " << *SI << '\n');
258 // The condition can be modified by removePredecessor's PHI simplification
296 case Instruction::PHI:
IndVarSimplify.cpp 188 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
192 PHINode *PHI = dyn_cast<PHINode>(User);
193 if (!PHI)
197 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
198 if (PHI->getIncomingValue(i) != Def)
201 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
209 assert(InsertPt && "Missing phi operand");
259 // If this is not an add of the PHI with a constantfp, or if the constant fp
485 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
490 // If there are no PHI nodes in this exit block, then no values define
    [all...]
  /external/llvm/unittests/Transforms/Utils/
IntegerDivision.cpp 79 EXPECT_TRUE(Quotient && Quotient->getOpcode() == Instruction::PHI);
  /external/clang/lib/CodeGen/
CGClass.cpp 212 // Build a phi if we needed a null check.
218 llvm::PHINode *PHI = Builder.CreatePHI(BasePtrTy, 2, "cast.result");
219 PHI->addIncoming(Value, notNullBB);
220 PHI->addIncoming(llvm::Constant::getNullValue(BasePtrTy), origBB);
221 Value = PHI;
275 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
276 PHI->addIncoming(Value, CastNotNull);
277 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
279 Value = PHI;
    [all...]
CGExprCXX.cpp     [all...]
  /external/llvm/include/llvm/CodeGen/
MachineInstr.h 641 bool isPHI() const { return getOpcode() == TargetOpcode::PHI; }
689 case TargetOpcode::PHI:
    [all...]
  /external/llvm/lib/CodeGen/
LiveIntervalAnalysis.cpp 219 /// or contain only dead phi-defs from ABI blocks.
276 // Create phi-defs at Begin for all live-in registers.
311 // Find all the values used, including PHI kills.
370 // The PHI is live, make sure the predecessors are live-out.
376 // A predecessor is not required to have a live-out value for a PHI.
407 assert(LII != NewLI.end() && "Missing live range for PHI");
411 // This is a dead PHI. Remove it.
414 DEBUG(dbgs() << "Dead PHI at " << VNI->def << " may separate interval\n");
574 // It is technically possible to have a PHI-defined live range identical to a
596 const VNInfo *PHI = *I
    [all...]
  /external/llvm/lib/Target/MBlaze/
MBlazeISelLowering.cpp 282 // will contain the Phi node for the select.
312 BuildMI(loop, dl, TII->get(MBlaze::PHI), DST)
318 BuildMI(loop, dl, TII->get(MBlaze::PHI), SAMT)
340 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
402 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
404 //BuildMI(dneBB, dl, TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
409 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
464 // will contain the Phi node for the select.
    [all...]
  /external/speex/libspeex/
mdf.c 157 spx_word32_t *PHI; /* scratch */
464 st->PHI = (spx_word32_t*)speex_alloc(N*sizeof(spx_word32_t));
611 speex_free(st->PHI);
822 weighted_spectral_mul_conj(st->power_1, FLOAT_SHL(PSEUDOFLOAT(st->prop[j]),-15), &st->X[(j+1)*N*K+speak*N], st->E+chan*N, st->PHI, N);
824 st->W[chan*N*K*M + j*N*K + speak*N + i] += st->PHI[i];
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonNewValueJump.cpp 173 // PHI can be anything after RA.
176 MII->getOpcode() == TargetOpcode::PHI ||
HexagonHardwareLoops.cpp 125 /// R = phi ..., [ R.next, LatchBlock ]
193 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
195 /// +-> back to phi
200 /// phi -+-> bump ---> back to phi
345 MachineInstr *Phi = &*I;
347 // Have a PHI instruction. Get the operand that corresponds to the
349 // where the "reg" is defined by the PHI node we are looking at.
350 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
351 if (Phi->getOperand(i+1).getMBB() != Latch
    [all...]
  /external/llvm/lib/Target/MSP430/
MSP430ISelLowering.cpp     [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineCasts.cpp 211 case Instruction::PHI: {
310 // If we are casting a PHI then fold the cast into the PHI
312 // We don't do this if this would create a PHI node with an illegal type if
418 case Instruction::PHI: {
419 // We can change a phi if we can change all operands. Note that we never
726 case Instruction::PHI: {
727 // We can change a phi if we can change all operands. Note that we never
    [all...]
InstCombineShifts.cpp 168 case Instruction::PHI: {
169 // We can change a phi if we can change all operands. Note that we never
297 case Instruction::PHI: {
298 // We can change a phi if we can change all operands. Note that we never
  /external/llvm/lib/CodeGen/SelectionDAG/
FunctionLoweringInfo.cpp 43 /// PHI nodes or outside of the basic block that defines it, or used by a
142 // also creates the initial PHI MachineInstrs, though none of the input
155 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
167 assert(PHIReg && "PHI node does not have an assigned virtual register!");
176 BuildMI(MBB, DL, TII->get(TargetOpcode::PHI), PHIReg + i);
240 /// register is a PHI destination and the PHI's LiveOutInfo is not valid. If
262 /// ComputePHILiveOutRegInfo - Compute LiveOutInfo for a PHI's destination
  /external/llvm/lib/IR/
Instruction.cpp 242 case PHI: return "phi";
398 /// specified block. Note that PHI nodes are considered to evaluate their
402 // PHI nodes uses values in the corresponding predecessor block. For other
  /external/llvm/lib/Transforms/IPO/
FunctionAttrs.cpp 521 case Instruction::PHI: {
  /external/llvm/include/llvm/IR/
Instructions.h     [all...]
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
codegen.ml 115 * phi. We create a new name because one is used for the phi node, and the
125 * phi. *)
132 let phi = build_phi incoming "iftmp" builder in var
146 phi
190 (* Within the loop, the variable is defined equal to the PHI node. If it
  /external/llvm/lib/AsmParser/
LLLexer.cpp 647 INSTKEYWORD(phi, PHI);

Completed in 1702 milliseconds

12 3