/external/llvm/lib/CodeGen/ |
MachineSSAUpdater.cpp | 51 /// updates. ProtoValue is the value used to name PHI nodes. 110 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define 139 /// a block. Because of this, we need to insert a new PHI node in SomeBB to 181 // If an identical PHI is already in BB, just reuse it. 186 // Otherwise, we do need a PHI: insert one now. 188 MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB, 191 // Fill in all the predecessors of the PHI. 195 // See if the PHI node can be merged to a single value. This can happen in 196 // loop cases when we get a PHI of itself and one other value. 205 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n") [all...] |
EarlyIfConversion.cpp | 109 /// Information about each phi in the Tail block. 111 MachineInstr *PHI; 116 PHIInfo(MachineInstr *phi) 117 : PHI(phi), TReg(0), FReg(0), CondCycles(0), TCycles(0), FCycles(0) {} 147 /// Replace PHI instructions in Tail with selects. 150 /// Insert selects and rewrite PHI operands to use them. 412 // Find PHI operands corresponding to TPred and FPred. 413 for (unsigned i = 1; i != PI.PHI->getNumOperands(); i += 2) { 414 if (PI.PHI->getOperand(i+1).getMBB() == TPred [all...] |
MachineTraceMetrics.cpp | 659 // Get the input data dependencies of a PHI instruction, using Pred as the 669 assert(UseMI->isPHI() && UseMI->getNumOperands() % 2 && "Bad PHI"); [all...] |
/external/llvm/include/llvm/Target/ |
TargetOpcodes.h | 26 PHI = 0,
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
tree-ssa-operands.h | 75 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI) 76 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI)) 77 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V)) 79 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I)) 80 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I)) [all...] |
/external/llvm/lib/Transforms/Utils/ |
SSAUpdater.cpp | 64 static bool IsEquivalentPHI(PHINode *PHI, 66 unsigned PHINumValues = PHI->getNumIncomingValues(); 70 // Scan the phi to see if it matches. 72 if (ValueMapping[PHI->getIncomingBlock(i)] != 73 PHI->getIncomingValue(i)) { 97 // is relatively slow. If we already have PHI nodes in this block, walk one 135 // Otherwise, we do need a PHI: check to see if we already have one available 152 // Fill in all the predecessors of the PHI. 156 // See if the PHI node can be merged to a single value. This can happen in 157 // loop cases when we get a PHI of itself and one other value [all...] |
FlattenCFG.cpp | 127 PHINode *PHI = dyn_cast<PHINode>(BB->begin()); 128 if (PHI) 129 return false; // For simplicity, avoid cases containing PHI nodes. 262 // PS2 should not contain PHI node. 263 PHI = dyn_cast<PHINode>(PS2->begin()); 264 if (PHI)
|
InlineFunction.cpp | 50 PHINode *InnerEHValuesPHI; ///< PHI for EH values from landingpad insts. 57 // If there are PHI nodes in the unwind destination block, we need to keep 64 PHINode *PHI = cast<PHINode>(I); 65 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB)); 89 /// addIncomingPHIValuesFor - Add incoming-PHI values to the unwind 99 PHINode *phi = cast<PHINode>(I); local 100 phi->addIncoming(UnwindDestPHIValues[i], src); 131 // Create a PHI for the exception values. 163 /// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI 203 // Update any PHI nodes in the exceptional block to indicate that there i [all...] |
SimplifyCFG.cpp | 55 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1), 56 cl::desc("Control the amount of phi node folding to perform (default = 1)")); 127 // successor, and if that successor has a PHI node, and if *that* PHI node has 148 /// unconditional branch. PhiNodes will store all PHI nodes in common 158 // We fold the unconditional branch if we can easily update all PHI nodes in 187 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will 189 /// flowing into the PHI nodes will be the same as those coming in from 610 // Remove PHI node entries for the dead edge. 684 // Remove PHI node entries for dead edges [all...] |
SimplifyIndVar.cpp | 310 if (PHINode *PHI = dyn_cast<PHINode>(UseInst)) 311 UseBB = PHI->getIncomingBlock(U);
|
/external/llvm/include/llvm/Transforms/Utils/ |
SSAUpdaterImpl.h | 281 /// dominating definitions for non-PHI blocks. 291 // If this block already needs a PHI, there is nothing to do here. 299 // Need a PHI here. 314 /// FindAvailableVal - If this block requires a PHI, first check if an 315 /// existing PHI matches the PHI placement and reaching definitions computed 316 /// earlier, and if not, create a new PHI. Visit all the block's 318 /// the incoming values for a new PHI. 326 // Check if there needs to be a PHI in BB. 330 // Look for an existing PHI [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCContract.cpp | 26 // TODO: ObjCARCContract could insert PHI nodes when uses aren't 466 if (PHINode *PHI = dyn_cast<PHINode>(U.getUser())) { 467 // For PHI nodes, insert the bitcast in the predecessor block. 469 BasicBlock *BB = PHI->getIncomingBlock(ValNo); 473 // While we're here, rewrite all edges for this PHI, rather 476 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) 477 if (PHI->getIncomingBlock(i) == BB) { 480 &PHI->getOperandUse( 483 PHI->setIncomingValue(i, Replacement);
|
/external/llvm/lib/Transforms/Scalar/ |
Scalarizer.cpp | 555 bool Scalarizer::visitPHINode(PHINode &PHI) { 556 VectorType *VT = dyn_cast<VectorType>(PHI.getType()); 561 IRBuilder<> Builder(PHI.getParent(), &PHI); 565 unsigned NumOps = PHI.getNumOperands(); 568 PHI.getName() + ".i" + Twine(I)); 571 Scatterer Op = scatter(&PHI, PHI.getIncomingValue(I)); 572 BasicBlock *IncomingBlock = PHI.getIncomingBlock(I); 576 gather(&PHI, Res) [all...] |
ConstantHoisting.cpp | 225 // We can't insert directly before a phi node or landing pad. Insert before 227 assert(Entry != Inst->getParent() && "PHI or landing pad in entry block!"); 436 /// instruction Mat. If the instruction is a PHI node then special 442 if (auto PHI = dyn_cast<PHINode>(Inst)) { 443 // Check if any previous operand of the PHI node has the same incoming basic 449 BasicBlock *IncomingBB = PHI->getIncomingBlock(Idx); 451 if (PHI->getIncomingBlock(i) == IncomingBB) { 452 Value *IncomingVal = PHI->getIncomingValue(i);
|
/external/llvm/lib/Analysis/ |
CaptureTracking.cpp | 144 case Instruction::PHI:
|
MemoryBuiltins.cpp | 752 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) { 754 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 755 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues()); 758 CacheMap[&PHI] = std::make_pair(SizePHI, OffsetPHI); 760 // compute offset/size for each PHI incoming pointer 761 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) { 762 Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt()); 763 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i)); 772 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i)); 773 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i)) [all...] |
IVUsers.cpp | 151 // Do not infinitely recurse on PHI nodes. 158 // A phi's use is live out of its predecessor block. 159 if (PHINode *PHI = dyn_cast<PHINode>(User)) { 162 UseBB = PHI->getIncomingBlock(ValNo); 167 // Descend recursively, but not into PHI nodes outside the current loop. 260 // them by stride. Start by finding all of the PHI nodes in the header for
|
/external/llvm/include/llvm/CodeGen/ |
MachineTraceMetrics.h | 92 /// Doesn't count PHI and COPY instructions that are likely to be removed. 213 /// This does not include PHI uses in the current block, but it does 214 /// include PHI uses in deeper blocks. 286 /// Return the Depth of a PHI instruction in a trace center block successor. 287 /// The PHI does not have to be part of the trace. 288 unsigned getPHIDepth(const MachineInstr *PHI) const;
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
codegen.ml | 67 * phi. We create a new name because one is used for the phi node, and the 77 * phi. *) 84 let phi = build_phi incoming "iftmp" builder in var 98 phi 116 (* Start the PHI node with an entry for start. *) 119 (* Within the loop, the variable is defined equal to the PHI node. If it 159 (* Add a new entry to the PHI node for the backedge. *)
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAGISel.cpp | 131 STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI"); 368 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that 370 /// through the predecessor block that doesn't go to the phi block doesn't 376 // Loop for blocks with phi nodes. 382 // For each block with a PHI node, check to see if any of the input values 385 // PHI. 392 // Since this block has a PHI Node, we assume it has multiple input 796 // update PHI nodes later on. [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
codegen.ml | 85 * phi. We create a new name because one is used for the phi node, and the 95 * phi. *) 102 let phi = build_phi incoming "iftmp" builder in var 116 phi 134 (* Start the PHI node with an entry for start. *) 137 (* Within the loop, the variable is defined equal to the PHI node. If it 177 (* Add a new entry to the PHI node for the backedge. *)
|
/external/clang/lib/CodeGen/ |
CGExprCXX.cpp | [all...] |
CGVTables.cpp | 100 llvm::PHINode *PHI = CGF.Builder.CreatePHI(ReturnValue->getType(), 2); 101 PHI->addIncoming(ReturnValue, AdjustNotNull); 102 PHI->addIncoming(llvm::Constant::getNullValue(ReturnValue->getType()), 104 ReturnValue = PHI;
|
/external/llvm/unittests/Transforms/Utils/ |
IntegerDivision.cpp | 80 EXPECT_TRUE(Quotient && Quotient->getOpcode() == Instruction::PHI); 201 EXPECT_TRUE(Quotient && Quotient->getOpcode() == Instruction::PHI);
|
/external/llvm/include/llvm/Analysis/ |
MemoryBuiltins.h | 269 SizeOffsetEvalType visitPHINode(PHINode &PHI);
|