/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 72 bool isElse(PHINode *Phi); 74 void eraseIfUnused(PHINode *Phi); 163 /// \brief Can the condition represented by this PHI node treated like 165 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { 166 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 167 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) { 168 if (Phi->getIncomingBlock(i) == IDom) { 170 if (Phi->getIncomingValue(i) != BoolTrue) 174 if (Phi->getIncomingValue(i) != BoolFalse) 182 // \brief Erase "Phi" if it is not used any mor [all...] |
AMDGPUStructurizeCFG.cpp | 144 /// The condition for the optional "Else" region is expressed as a PHI node. 145 /// The incomming values of the PHI node are true for the "If" edge and false 163 /// consist of a network of PHI nodes where the true incoming values expresses 500 /// \brief Remove all PHI values coming from "From" into "To" and remember 507 PHINode &Phi = cast<PHINode>(*I++); 508 while (Phi.getBasicBlockIndex(From) != -1) { 509 Value *Deleted = Phi.removeIncomingValue(From, false); 510 Map[&Phi].push_back(std::make_pair(From, Deleted)); 515 /// \brief Add a dummy PHI value as soon as we knew the new predecessor 520 PHINode &Phi = cast<PHINode>(*I++) [all...] |
AMDGPUIndirectAddressing.cpp | 177 // We don't need to insert a Phi instruction, so we can just add the 182 // We need to insert a PHI, because we have the same address being 187 MachineInstrBuilder Phi = BuildMI(MBB, MBB.begin(), 189 TII->get(AMDGPU::PHI), PhiDstReg); 198 Phi.addReg(Reg); 199 Phi.addMBB(RegBlock); 214 if (MI.getOpcode() == AMDGPU::PHI) { 326 if (DefInstr->getOpcode() == AMDGPU::PHI) {
|
/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"); 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...] |
GVN.cpp | [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...] |
LoopStrengthReduce.cpp | 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ] 87 // Temporary flag to cleanup congruent phis after LSR phi expansion. 93 cl::desc("Enable LSR phi elimination")); 663 /// isExistingPhi - Return true if this AddRec is already a phi in its loop. 844 // If this is an addrec for another loop, don't second-guess its addrec phi [all...] |
/external/clang/test/CodeGen/ |
2007-03-05-DataLayout.c | 23 double phi; member in struct:bnode 36 #define Phi(x) ((x)->phi)
|
/frameworks/native/services/sensorservice/ |
Fusion.h | 68 mat<mat33_t, 2, 2> Phi;
|
Fusion.cpp | 159 Phi[0][1] = 0; 160 Phi[1][1] = 1; 402 // P(k+1) = Phi(k)*P(k)*Phi(k)' + G*Q(k)*G' 408 // Phi = | Phi00 Phi10 | 437 Phi[0][0] = I33 - wx*(k1*ilwe) + wx2*k0; 438 Phi[1][0] = wx*k0 - I33dT - wx2*(ilwe*ilwe*ilwe)*(lwedT-k1); 444 P = Phi*P*transpose(Phi) + GQGt;
|
/external/llvm/lib/Analysis/ |
ScalarEvolutionExpander.cpp | [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
3d-cube.js | 144 function RotateX(M, Phi) { 145 var a = Phi; 158 function RotateY(M, Phi) { 159 var a = Phi; 172 function RotateZ(M, Phi) { 173 var a = Phi;
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
3d-cube.js | 144 function RotateX(M, Phi) { 145 var a = Phi; 158 function RotateY(M, Phi) { 159 var a = Phi; 172 function RotateZ(M, Phi) { 173 var a = Phi;
|
/external/llvm/lib/Transforms/Vectorize/ |
LoopVectorize.cpp | 487 /// Returns True, if 'Phi' is the kind of reduction variable for type 489 bool AddReductionVar(PHINode *Phi, ReductionKind Kind); 493 /// Returns the induction kind of Phi. This function may return NoInduction 494 /// if the PHI is not an induction variable. 495 InductionKind isInductionVariable(PHINode *Phi); 804 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr); 805 if (Phi && Inductions.count(Phi)) { 806 InductionInfo II = Inductions[Phi]; 823 Phi = dyn_cast<PHINode>(GpPtr) [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/ |
LoopUnroll.cpp | 67 // if there are no PHI nodes. 76 // Resolve any PHI nodes at the start of the block. They are all 86 // Make all PHI nodes that referred to BB now refer to Pred as their 248 // PHI nodes. Insert associations now. 278 // Loop over all of the PHI nodes in the block, changing them to use the 299 // Add phi entries for newly created values to all exit blocks. 305 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { 306 Value *Incoming = phi->getIncomingValueForBlock(*BB); 310 phi->addIncoming(Incoming, New); 330 // Loop over the PHI nodes in the original block, setting incoming values [all...] |
SimplifyCFG.cpp | 51 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1), 52 cl::desc("Control the amount of phi node folding to perform (default = 1)")); 119 // successor, and if that successor has a PHI node, and if *that* PHI node has 140 /// unconditional branch. PhiNodes will store all PHI nodes in common 150 // We fold the unconditional branch if we can easily update all PHI nodes in 179 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will 181 /// flowing into the PHI nodes will be the same as those coming in from 195 /// least one PHI node in it), check to see if the merge at this block is due 658 // Remove PHI node entries for the dead edge [all...] |
/external/llvm/include/llvm/IR/ |
IRBuilder.h | 101 if (PHINode *Phi = dyn_cast<PHINode>(UseInst)) { 102 BasicBlock *PredBB = Phi->getIncomingBlock(U); [all...] |
/external/llvm/lib/Target/X86/ |
X86ISelLowering.cpp | [all...] |