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

  /frameworks/native/services/sensorservice/
Fusion.h 68 mat<mat33_t, 2, 2> Phi;
  /external/clang/test/CodeGen/
2007-03-05-DataLayout.c 23 double phi; member in struct:bnode
36 #define Phi(x) ((x)->phi)
  /external/llvm/lib/Analysis/
ScalarEvolutionExpander.cpp     [all...]
  /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...]
  /external/llvm/lib/Transforms/Utils/
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...]
  /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/
pdfjs.js     [all...]

Completed in 133 milliseconds