Searched defs:PHI (Results 1 - 18 of 18) sorted by relevance

/external/llvm/include/llvm/Target/
H A DTargetOpcodes.h26 PHI = 0, enumerator in enum:llvm::TargetOpcode::__anon25635
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h281 /// 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
335 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); local
355 PhiT *PHI = Traits::ValueIsNewPHI(Info->AvailableVal, Updater); local
397 CheckIfPHIMatches(PhiT *PHI) argument
[all...]
/external/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp127 PHINode *PHI = dyn_cast<PHINode>(BB->begin()); local
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)
H A DSSAUpdater.cpp64 static bool IsEquivalentPHI(PHINode *PHI, argument
66 unsigned PHINumValues = PHI->getNumIncomingValues();
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.
163 // Set the DebugLoc of the inserted PHI, i
219 PHINode *PHI; member in class:llvm::SSAUpdaterTraits::PHI_iterator
235 PHI_begin(PhiT *PHI) argument
236 PHI_end(PhiT *PHI) argument
266 PHINode *PHI = PHINode::Create(Updater->ProtoType, NumPreds, local
273 AddPHIOperand(PHINode *PHI, Value *Val, BasicBlock *Pred) argument
292 PHINode *PHI = ValueIsPHI(Val, Updater); local
300 GetPHIValue(PHINode *PHI) argument
[all...]
H A DInlineFunction.cpp50 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); local
65 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB));
89 /// addIncomingPHIValuesFor - Add incoming-PHI values to the unwind
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 is
256 // Now that everything is happy, we have one final detail. The PHI nodes in
259 // PHI nod
921 PHINode *PHI = nullptr; local
[all...]
H A DSimplifyCFG.cpp127 // 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.
923 // sure we update the number of entries in the PHI nodes for these
1093 // Unfortunately, the successors of the if/else blocks may have PHI node
3306 PHINode *PHI = FindPHIForConditionForwarding(CaseValue, CaseDest, local
3761 PHINode *PHI = PHIs[I]; local
3788 PHINode *PHI = DefaultResultsList[I].first; local
3874 PHINode *PHI = PHIs[I]; local
[all...]
/external/llvm/lib/CodeGen/
H A DMachineSSAUpdater.cpp51 /// 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
252 MachineInstr *PHI; member in class:llvm::SSAUpdaterTraits::PHI_iterator
269 PHI_begin(PhiT *PHI) argument
270 PHI_end(PhiT *PHI) argument
300 MachineInstr *PHI = InsertNewDef(TargetOpcode::PHI, BB, Loc, local
308 AddPHIOperand(MachineInstr *PHI, unsigned Val, MachineBasicBlock *Pred) argument
330 MachineInstr *PHI = ValueIsPHI(Val, Updater); local
338 GetPHIValue(MachineInstr *PHI) argument
[all...]
H A DEarlyIfConversion.cpp111 MachineInstr *PHI; member in struct:__anon25739::SSAIfConv::PHIInfo
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)
415 PI.TReg = PI.PHI->getOperand(i).getReg();
416 if (PI.PHI->getOperand(i+1).getMBB() == FPred)
417 PI.FReg = PI.PHI
[all...]
H A DLiveIntervalAnalysis.cpp324 // 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; local
621 if (PHI->isUnused() || !PHI
[all...]
/external/clang/lib/CodeGen/
H A DCGVTables.cpp100 llvm::PHINode *PHI = CGF.Builder.CreatePHI(ReturnValue->getType(), 2); local
101 PHI->addIncoming(ReturnValue, AdjustNotNull);
102 PHI->addIncoming(llvm::Constant::getNullValue(ReturnValue->getType()),
104 ReturnValue = PHI;
H A DCGExprCXX.cpp1329 llvm::PHINode *PHI = Builder.CreatePHI(result->getType(), 2); local
1330 PHI->addIncoming(result, notNullBB);
1331 PHI->addIncoming(llvm::Constant::getNullValue(result->getType()),
1334 result = PHI;
1759 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2); local
1760 PHI->addIncoming(Value, CastNotNull);
1761 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()), CastNull);
1763 Value = PHI;
H A DCGClass.cpp221 llvm::PHINode *PHI = Builder.CreatePHI(BasePtrTy, 2, "cast.result"); local
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); local
279 PHI->addIncoming(Value, CastNotNull);
280 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()),
282 Value = PHI;
/external/llvm/lib/Analysis/
H A DMemoryBuiltins.cpp752 SizeOffsetEvalType ObjectSizeOffsetEvaluator::visitPHINode(PHINode &PHI) { argument
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
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DScalarizer.cpp555 bool Scalarizer::visitPHINode(PHINode &PHI) { argument
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, Re
[all...]
H A DIndVarSimplify.cpp192 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
196 PHINode *PHI = dyn_cast<PHINode>(User); local
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);
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 defined
501 // We would like to be able to RAUW single-incoming value PHI node
[all...]
/external/speex/libspeex/
H A Dmdf.c157 spx_word32_t *PHI; /* scratch */ member in struct:SpeexEchoState_
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];
/external/llvm/bindings/ocaml/llvm/
H A Dllvm.ml193 | PHI Constructor in type:Opcode/t
/external/google-tv-pairing-protocol/java/jar/
H A Dbcprov-jdk15-143.jarMETA-INF/MANIFEST.MF META-INF/BCKEY.SF META-INF/BCKEY.DSA META ...

Completed in 515 milliseconds