| /external/llvm/include/llvm/Target/ |
| TargetOpcodes.h | 26 PHI = 0,
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 49 /// updates. ProtoValue is the value used to name PHI nodes.
108 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
137 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
179 // If an identical PHI is already in BB, just reuse it.
184 // Otherwise, we do need a PHI: insert one now.
186 MachineInstr *InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
189 // Fill in all the predecessors of the PHI.
194 // See if the PHI node can be merged to a single value. This can happen in
195 // loop cases when we get a PHI of itself and one other value.
204 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n")
[all...] |
| StrongPHIElimination.cpp | 1 //===- StrongPHIElimination.cpp - Eliminate PHI nodes by inserting copies -===//
10 // This pass eliminates PHI instructions by aggressively coalescing the copies
13 // registers appearing in a PHI instruction do not interfere. It then eliminates
72 /// PHI with that register as its destination has been isolated.
112 /// Get the color of a PHI. The color of a PHI is 0 if the PHI has been
117 /// Isolate a PHI.
135 // Lowers a PHI instruction, inserting copies of the source and destination
153 // Maps a basic block to a list of its defs of registers that appear as PHI
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree-ssa-operands.h | 88 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI)
89 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI))
90 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V))
92 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I))
93 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| tree-ssa-operands.h | 88 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI)
89 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI))
90 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V))
92 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I))
93 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| tree-ssa-operands.h | 88 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI)
89 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI))
90 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V))
92 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I))
93 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 46 /// updates with type 'Ty'. PHI nodes get a name based on 'Name'.
71 /// IsEquivalentPHI - Check if PHI has the same incoming value as specified
73 static bool IsEquivalentPHI(PHINode *PHI,
75 unsigned PHINumValues = PHI->getNumIncomingValues();
79 // Scan the phi to see if it matches.
81 if (ValueMapping[PHI->getIncomingBlock(i)] !=
82 PHI->getIncomingValue(i)) {
112 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
127 // is relatively slow. If we already have PHI nodes in this block, walk one
165 // Otherwise, we do need a PHI: check to see if we already have one availabl
[all...] |
| InlineFunction.cpp | 49 PHINode *InnerEHValuesPHI; //< PHI for EH values from landingpad insts.
56 // If there are PHI nodes in the unwind destination block, we need to keep
63 PHINode *PHI = cast<PHINode>(I);
64 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB));
87 /// addIncomingPHIValuesFor - Add incoming-PHI values to the unwind
97 PHINode *phi = cast<PHINode>(I); local
98 phi->addIncoming(UnwindDestPHIValues[i], src);
129 // Create a PHI for the exception values.
160 /// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI
209 // Update any PHI nodes in the exceptional block to indicate that there i
[all...] |
| SimplifyCFG.cpp | 48 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
49 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
91 // successor, and if that successor has a PHI node, and if *that* PHI node has
110 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
112 /// flowing into the PHI nodes will be the same as those coming in from
126 /// least one PHI node in it), check to see if the merge at this block is due
589 // Remove PHI node entries for the dead edge.
644 // Remove PHI node entries for dead edges.
777 // sure we update the number of entries in the PHI nodes for thes
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| tree-ssa-operands.h | 182 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI)
183 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI))
184 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V))
186 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I))
187 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 279 /// dominating definitions for non-PHI blocks.
289 // If this block already needs a PHI, there is nothing to do here.
297 // Need a PHI here.
312 /// FindAvailableVal - If this block requires a PHI, first check if an
313 /// existing PHI matches the PHI placement and reaching definitions computed
314 /// earlier, and if not, create a new PHI. Visit all the block's
316 /// the incoming values for a new PHI.
324 // Check if there needs to be a PHI in BB.
328 // Look for an existing PHI
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 124 STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI");
300 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
302 /// through the predecessor block that doesn't go to the phi block doesn't
308 // Loop for blocks with phi nodes.
314 // For each block with a PHI node, check to see if any of the input values
317 // PHI.
324 // Since this block has a PHI Node, we assume it has multiple input
691 // update PHI nodes later on.
[all...] |
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 141 case Instruction::PHI:
|
| IVUsers.cpp | 145 // Do not infinitely recurse on PHI nodes.
152 // A phi's use is live out of its predecessor block.
153 if (PHINode *PHI = dyn_cast<PHINode>(User)) {
156 UseBB = PHI->getIncomingBlock(ValNo);
161 // Descend recursively, but not into PHI nodes outside the current loop.
234 // them by stride. Start by finding all of the PHI nodes in the header for
|
| ScalarEvolution.cpp | 21 // if there is a cycle in the dataflow for an expression (ie, a PHI node). If
22 // the PHI node is one of the idioms that we can represent (e.g., a polynomial
32 // higher-level code, such as the code that recognizes PHI nodes of various
[all...] |
| /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/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/ |
| CGClass.cpp | 207 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
208 PHI->addIncoming(Value, CastNotNull);
209 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
211 Value = PHI;
265 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
266 PHI->addIncoming(Value, CastNotNull);
267 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
269 Value = PHI;
[all...] |
| CGExprCXX.cpp | [all...] |
| CGVTables.cpp | 210 llvm::PHINode *PHI = CGF.Builder.CreatePHI(ReturnValue->getType(), 2);
211 PHI->addIncoming(ReturnValue, AdjustNotNull);
212 PHI->addIncoming(llvm::Constant::getNullValue(ReturnValue->getType()),
214 ReturnValue = PHI;
|
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 272 case Instruction::PHI:
|
| IndVarSimplify.cpp | 186 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
190 PHINode *PHI = dyn_cast<PHINode>(User);
191 if (!PHI)
195 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
196 if (PHI->getIncomingValue(i) != Def)
199 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
207 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/lib/Target/MBlaze/ |
| MBlazeISelLowering.cpp | 280 // will contain the Phi node for the select.
310 BuildMI(loop, dl, TII->get(MBlaze::PHI), DST)
316 BuildMI(loop, dl, TII->get(MBlaze::PHI), SAMT)
338 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
400 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
402 //BuildMI(dneBB, dl, TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
407 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
462 // 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/include/llvm/CodeGen/ |
| MachineInstr.h | 602 bool isPHI() const { return getOpcode() == TargetOpcode::PHI; }
[all...] |
