HomeSort by relevance Sort by last modified time
    Searched refs:Phi (Results 1 - 14 of 14) sorted by null

  /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...]
GVN.cpp     [all...]
LoopStrengthReduce.cpp 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
86 // Temporary flag to cleanup congruent phis after LSR phi expansion.
92 cl::desc("Enable LSR phi elimination"));
652 /// isExistingPhi - Return true if this AddRec is already a phi in its loop.
833 // 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;
374 // P(k+1) = Phi(k)*P(k)*Phi(k)' + G*Q(k)*G'
379 // Phi = | Phi00 Phi10 |
399 Phi[0][0] = I33 - wx*(k1*ilwe) + wx2*k0;
400 Phi[1][0] = wx*k0 - I33dT - wx2*(ilwe*ilwe*ilwe)*(lwedT-k1);
402 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/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 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/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/include/llvm/
IRBuilder.h 98 if (PHINode *Phi = dyn_cast<PHINode>(UseInst)) {
99 BasicBlock *PredBB = Phi->getIncomingBlock(U);
    [all...]
  /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/
pdfjs.js     [all...]

Completed in 345 milliseconds