/external/llvm/lib/Transforms/Scalar/ |
PartiallyInlineLibCalls.cpp | 120 // dst = phi(v0, v1) 124 // Create phi and replace all uses. 127 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2); 128 Call->replaceAllUsesWith(Phi); 147 // Add phi operands. 148 Phi->addIncoming(Call, &CurrBB); 149 Phi->addIncoming(LibCall, LibCallBB);
|
LoopIdiomRecognize.cpp | 119 /// is set to the corresponding phi node. 3) \p Var is set to the value 375 // x1 = phi (x0, x2); 376 // cnt1 = phi(cnt0, cnt2); 454 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0)); 455 if (!Phi || Phi->getParent() != LoopEntry) 468 CountPhi = Phi; [all...] |
StructurizeCFG.cpp | 138 /// The condition for the optional "Else" region is expressed as a PHI node. 139 /// The incomming values of the PHI node are true for the "If" edge and false 157 /// consist of a network of PHI nodes where the true incoming values expresses 496 /// \brief Remove all PHI values coming from "From" into "To" and remember 503 PHINode &Phi = cast<PHINode>(*I++); 504 while (Phi.getBasicBlockIndex(From) != -1) { 505 Value *Deleted = Phi.removeIncomingValue(From, false); 506 Map[&Phi].push_back(std::make_pair(From, Deleted)); 511 /// \brief Add a dummy PHI value as soon as we knew the new predecessor 516 PHINode &Phi = cast<PHINode>(*I++) [all...] |
IndVarSimplify.cpp | 192 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest 196 PHINode *PHI = dyn_cast<PHINode>(User); 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); 213 assert(InsertPt && "Missing phi operand"); 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 define [all...] |
GVN.cpp | [all...] |
/frameworks/native/services/sensorservice/ |
Fusion.h | 68 mat<mat33_t, 2, 2> Phi;
|
/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 75 bool isElse(PHINode *Phi); 77 void eraseIfUnused(PHINode *Phi); 166 /// \brief Can the condition represented by this PHI node treated like 168 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { 169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 170 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) { 171 if (Phi->getIncomingBlock(i) == IDom) { 173 if (Phi->getIncomingValue(i) != BoolTrue) 177 if (Phi->getIncomingValue(i) != BoolFalse) 185 // \brief Erase "Phi" if it is not used any mor [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/Instrumentation/ |
DataFlowSanitizer.cpp | 754 // We will not necessarily be able to compute the shadow for every phi node 755 // until we have visited every block. Therefore, the code that handles phi [all...] |
AddressSanitizer.cpp | [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
ThreadSafetyTIL.h | [all...] |
/external/clang/lib/CodeGen/ |
MicrosoftCXXABI.cpp | [all...] |
/external/llvm/lib/Transforms/Utils/ |
SimplifyCFG.cpp | 55 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1), 56 cl::desc("Control the amount of phi node folding to perform (default = 1)")); 127 // 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 [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
LoopVectorize.cpp | 305 /// \brief The Loop exit block may have single value PHI nodes where the 751 /// Returns True, if 'Phi' is the kind of reduction variable for type 753 bool AddReductionVar(PHINode *Phi, ReductionKind Kind); 765 /// Returns the induction kind of Phi. This function may return NoInduction 766 /// if the PHI is not an induction variable. 767 InductionKind isInductionVariable(PHINode *Phi); [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
d3d8types.h | [all...] |
d3d9types.h | [all...] |
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
pdfjs.js | [all...] |