| /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...] |
| /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 | 118 // instructions that are pinned to an edge like a phi, or
132 // through multiple levels of phi, so give up if we've already
187 // %exn = phi ...
188 // %selector = phi ...
216 // For all the phis in nonDominated, make a new phi in split to join
217 // that phi with the edge from lastDominated.
220 PHINode *phi = dyn_cast<PHINode>(i); local
221 if (!phi) break;
223 PHINode *splitPhi = PHINode::Create(phi->getType(), 2, phi->getName()
323 PHINode *phi = cast<PHINode>(I); local
[all...] |
| SimplifyCFG.cpp | 44 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
45 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
88 // successor, and if that successor has a PHI node, and if *that* PHI node has
107 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
109 /// flowing into the PHI nodes will be the same as those coming in from
123 /// least one PHI node in it), check to see if the merge at this block is due
587 // Remove PHI node entries for the dead edge.
640 // Remove PHI node entries for dead edges.
773 // sure we update the number of entries in the PHI nodes for thes
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 271 /// dominating definitions for non-PHI blocks.
281 // If this block already needs a PHI, there is nothing to do here.
289 // Need a PHI here.
304 /// FindAvailableVal - If this block requires a PHI, first check if an
305 /// existing PHI matches the PHI placement and reaching definitions computed
306 /// earlier, and if not, create a new PHI. Visit all the block's
308 /// the incoming values for a new PHI.
316 // Check if there needs to be a PHI in BB.
320 // Look for an existing PHI
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/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...] |
| /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...] |
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/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/lib/Analysis/ |
| CaptureTracking.cpp | 118 case Instruction::PHI:
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 221 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
223 /// through the predecessor block that doesn't go to the phi block doesn't
229 // Loop for blocks with phi nodes.
235 // For each block with a PHI node, check to see if any of the input values
238 // PHI.
245 // Since this block has a PHI Node, we assume it has multiple input
611 // update PHI nodes later on.
[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 | 208 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
209 PHI->addIncoming(Value, CastNotNull);
210 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
212 Value = PHI;
266 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
267 PHI->addIncoming(Value, CastNotNull);
268 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
270 Value = PHI;
[all...] |
| CGExprCXX.cpp | 811 // Set up the current-element phi.
[all...] |
| CGVTables.cpp | 212 llvm::PHINode *PHI = CGF.Builder.CreatePHI(ReturnValue->getType(), 2);
213 PHI->addIncoming(ReturnValue, AdjustNotNull);
214 PHI->addIncoming(llvm::Constant::getNullValue(ReturnValue->getType()),
216 ReturnValue = PHI;
|
| /external/llvm/lib/VMCore/ |
| Instruction.cpp | 153 case PHI: return "phi";
293 /// specified block. Note that PHI nodes are considered to evaluate their
297 // PHI nodes uses values in the corresponding predecessor block. For other
430 case PHI:
|
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 189 case Instruction::PHI:
|
| IndVarSimplify.cpp | 198 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
202 PHINode *PHI = dyn_cast<PHINode>(User);
203 if (!PHI)
207 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
208 if (PHI->getIncomingValue(i) != Def)
211 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
219 assert(InsertPt && "Missing phi operand");
271 // If this is not an add of the PHI with a constantfp, or if the constant fp
449 // Add a new IVUsers entry for the newly-created integer PHI.
502 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Sca
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineInstr.h | 270 bool isPHI() const { return getOpcode() == TargetOpcode::PHI; }
492 /// isConstantValuePHI - If the specified instruction is a PHI that always
|
| /external/llvm/lib/Target/MBlaze/ |
| MBlazeISelLowering.cpp | 278 // will contain the Phi node for the select.
308 BuildMI(loop, dl, TII->get(MBlaze::PHI), DST)
314 BuildMI(loop, dl, TII->get(MBlaze::PHI), SAMT)
336 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
398 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
400 //BuildMI(dneBB, dl, TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
405 TII->get(MBlaze::PHI), MI->getOperand(0).getReg())
460 // will contain the Phi node for the select.
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 293 case Instruction::PHI: {
|
| /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/MSP430/ |
| MSP430ISelLowering.cpp | [all...] |
