| /external/llvm/lib/Target/Mips/ |
| MipsOptimizeMathLibCalls.cpp | 142 // dst = phi(v0, v1)
146 // Create phi and replace all uses.
149 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2);
150 Call->replaceAllUsesWith(Phi);
169 // Add phi operands.
170 Phi->addIncoming(Call, &CurrBB);
171 Phi->addIncoming(LibCall, LibCallBB);
|
| /frameworks/native/services/sensorservice/ |
| Fusion.h | 68 mat<mat33_t, 2, 2> Phi;
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUIndirectAddressing.cpp | 179 // We don't need to insert a Phi instruction, so we can just add the
184 // We need to insert a PHI, because we have the same address being
189 MachineInstrBuilder Phi = BuildMI(MBB, MBB.begin(),
191 TII->get(AMDGPU::PHI), PhiDstReg);
200 Phi.addReg(Reg);
201 Phi.addMBB(RegBlock);
216 if (MI.getOpcode() == AMDGPU::PHI) {
328 if (DefInstr->getOpcode() == AMDGPU::PHI) {
|
| SIAnnotateControlFlow.cpp | 74 bool isElse(PHINode *Phi);
76 void eraseIfUnused(PHINode *Phi);
165 /// \brief Can the condition represented by this PHI node treated like
167 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
168 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
169 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
170 if (Phi->getIncomingBlock(i) == IDom) {
172 if (Phi->getIncomingValue(i) != BoolTrue)
176 if (Phi->getIncomingValue(i) != BoolFalse)
184 // \brief Erase "Phi" if it is not used any mor
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 137 /// The condition for the optional "Else" region is expressed as a PHI node.
138 /// The incomming values of the PHI node are true for the "If" edge and false
156 /// consist of a network of PHI nodes where the true incoming values expresses
492 /// \brief Remove all PHI values coming from "From" into "To" and remember
499 PHINode &Phi = cast<PHINode>(*I++);
500 while (Phi.getBasicBlockIndex(From) != -1) {
501 Value *Deleted = Phi.removeIncomingValue(From, false);
502 Map[&Phi].push_back(std::make_pair(From, Deleted));
507 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
512 PHINode &Phi = cast<PHINode>(*I++)
[all...] |
| LoopIdiomRecognize.cpp | 120 /// is set to the corresponding phi node. 3) \p Var is set to the value
376 // x1 = phi (x0, x2);
377 // cnt1 = phi(cnt0, cnt2);
455 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0));
456 if (!Phi || Phi->getParent() != LoopEntry)
470 CountPhi = Phi;
[all...] |
| GVN.cpp | [all...] |
| 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");
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/clang/lib/CodeGen/ |
| MicrosoftCXXABI.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 125 /// R = phi ..., [ R.next, LatchBlock ]
193 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
195 /// +-> back to phi
200 /// phi -+-> bump ---> back to phi
345 MachineInstr *Phi = &*I;
347 // Have a PHI instruction. Get the operand that corresponds to the
349 // where the "reg" is defined by the PHI node we are looking at.
350 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
351 if (Phi->getOperand(i+1).getMBB() != Latch
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 53 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
54 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
124 // successor, and if that successor has a PHI node, and if *that* PHI node has
145 /// unconditional branch. PhiNodes will store all PHI nodes in common
155 // We fold the unconditional branch if we can easily update all PHI nodes in
184 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
186 /// flowing into the PHI nodes will be the same as those coming in from
598 // Remove PHI node entries for the dead edge.
672 // Remove PHI node entries for dead edges
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelLowering.cpp | [all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| pdfjs.js | [all...] |
