| /external/llvm/include/llvm/Target/ |
| TargetOpcodes.h | 26 PHI = 0,
|
| /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/ |
| 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...] |
| EarlyIfConversion.cpp | 108 /// Information about each phi in the Tail block.
110 MachineInstr *PHI;
115 PHIInfo(MachineInstr *phi)
116 : PHI(phi), TReg(0), FReg(0), CondCycles(0), TCycles(0), FCycles(0) {}
146 /// Replace PHI instructions in Tail with selects.
149 /// Insert selects and rewrite PHI operands to use them.
411 // Find PHI operands corresponding to TPred and FPred.
412 for (unsigned i = 1; i != PI.PHI->getNumOperands(); i += 2) {
413 if (PI.PHI->getOperand(i+1).getMBB() == TPred
[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...] |
| LiveIntervalAnalysis.cpp | 208 // Virtual registers may be defined multiple times (due to phi
259 // A phi join register is killed at the end of the MBB and revived as a
261 assert(vi.AliveBlocks.empty() && "Phi join can't pass through blocks");
262 DEBUG(dbgs() << " phi-join");
288 "PHI def index points at actual instruction.");
305 // must be due to phi elimination or two addr elimination. If this is
350 // In the case of PHI elimination, each variable definition is only
363 DEBUG(dbgs() << " phi-join +" << LR);
519 /// or contain only dead phi-defs from ABI blocks.
576 // Create phi-defs at Begin for all live-in registers
[all...] |
| /external/clang/lib/CodeGen/ |
| 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;
|
| CGClass.cpp | 209 // Build a phi if we needed a null check.
215 llvm::PHINode *PHI = Builder.CreatePHI(BasePtrTy, 2, "cast.result");
216 PHI->addIncoming(Value, notNullBB);
217 PHI->addIncoming(llvm::Constant::getNullValue(BasePtrTy), origBB);
218 Value = PHI;
272 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
273 PHI->addIncoming(Value, CastNotNull);
274 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
276 Value = PHI;
[all...] |
| CGExprCXX.cpp | [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 | 50 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
51 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
108 // successor, and if that successor has a PHI node, and if *that* PHI node has
129 /// unconditional branch. PhiNodes will store all PHI nodes in common
139 // We fold the unconditional branch if we can easily update all PHI nodes in
168 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
170 /// flowing into the PHI nodes will be the same as those coming in from
184 /// least one PHI node in it), check to see if the merge at this block is due
651 // Remove PHI node entries for the dead edge
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| 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");
261 // If this is not an add of the PHI with a constantfp, or if the constant fp
487 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
492 // If there are no PHI nodes in this exit block, then no values define
[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/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 124 STATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI");
298 /// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that
300 /// through the predecessor block that doesn't go to the phi block doesn't
306 // Loop for blocks with phi nodes.
312 // For each block with a PHI node, check to see if any of the input values
315 // PHI.
322 // Since this block has a PHI Node, we assume it has multiple input
688 // update PHI nodes later on.
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 189 | PHI
[all...] |
| /tools/motodev/src/plugins/certmanager/lib/ |
| bcprov-jdk15on-147.jar | |
