| /external/llvm/include/llvm/Target/ |
| TargetOpcodes.h | 26 PHI = 0,
|
| /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/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...] |
| LiveIntervalAnalysis.cpp | 236 /// or contain only dead phi-defs from ABI blocks.
287 // Create phi-defs at Begin for all live-in registers.
324 // Find all the values used, including PHI kills.
385 // The PHI is live, make sure the predecessors are live-out.
391 // A predecessor is not required to have a live-out value for a PHI.
434 assert(LRI != LR.end() && "Missing segment for PHI");
438 // This is a dead PHI. Remove it.
441 DEBUG(dbgs() << "Dead PHI at " << VNI->def << " may separate interval\n");
598 // It is technically possible to have a PHI-defined live range identical to a
620 const VNInfo *PHI = *I
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| 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)
|
| 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...] |
| 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...] |
| /external/clang/lib/CodeGen/ |
| 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;
|
| CGExprCXX.cpp | [all...] |
| CGClass.cpp | 215 // Build a phi if we needed a null check.
221 llvm::PHINode *PHI = Builder.CreatePHI(BasePtrTy, 2, "cast.result");
222 PHI->addIncoming(Value, notNullBB);
223 PHI->addIncoming(llvm::Constant::getNullValue(BasePtrTy), origBB);
224 Value = PHI;
278 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
279 PHI->addIncoming(Value, CastNotNull);
280 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
282 Value = PHI;
[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/Transforms/Scalar/ |
| IndVarSimplify.cpp | 192 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
196 PHINode *PHI = dyn_cast<PHINode>(User);
197 if (!PHI)
201 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
202 if (PHI->getIncomingValue(i) != Def)
205 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
213 assert(InsertPt && "Missing phi operand");
263 // If this is not an add of the PHI with a constantfp, or if the constant fp
489 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
494 // If there are no PHI nodes in this exit block, then no values define
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 193 | PHI
[all...] |
| /external/google-tv-pairing-protocol/java/jar/ |
| bcprov-jdk15-143.jar | |
| /prebuilts/devtools/tools/lib/ |
| bcprov-jdk15on-1.48.jar | |
| /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/ |
| bcprov-jdk15on-1.48.jar | |
