| /external/llvm/lib/Transforms/Scalar/ |
| PartiallyInlineLibCalls.cpp | 126 // dst = phi(v0, v1)
130 // Create phi and replace all uses.
133 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2);
134 Call->replaceAllUsesWith(Phi);
153 // Add phi operands.
154 Phi->addIncoming(Call, &CurrBB);
155 Phi->addIncoming(LibCall, LibCallBB);
|
| LoopIdiomRecognize.cpp | 119 /// is set to the corresponding phi node. 3) \p Var is set to the value
343 // x1 = phi (x0, x2);
344 // cnt1 = phi(cnt0, cnt2);
422 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0));
423 if (!Phi || Phi->getParent() != LoopEntry)
436 CountPhi = Phi;
[all...] |
| StructurizeCFG.cpp | 142 /// The condition for the optional "Else" region is expressed as a PHI node.
143 /// The incomming values of the PHI node are true for the "If" edge and false
161 /// consist of a network of PHI nodes where the true incoming values expresses
561 /// \brief Remove all PHI values coming from "From" into "To" and remember
568 PHINode &Phi = cast<PHINode>(*I++);
569 while (Phi.getBasicBlockIndex(From) != -1) {
570 Value *Deleted = Phi.removeIncomingValue(From, false);
571 Map[&Phi].push_back(std::make_pair(From, Deleted));
576 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
581 PHINode &Phi = cast<PHINode>(*I++)
[all...] |
| IndVarSimplify.cpp | 193 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
197 PHINode *PHI = dyn_cast<PHINode>(User);
198 if (!PHI)
202 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
203 if (PHI->getIncomingValue(i) != Def)
206 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
214 assert(InsertPt && "Missing phi operand");
264 // If this is not an add of the PHI with a constantfp, or if the constant fp
490 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
495 // 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/v8/src/compiler/ |
| common-operator.cc | 176 const Operator* CommonOperatorBuilder::Phi(MachineType type, int arguments) {
179 arguments, 1, "Phi", type);
|
| raw-machine-assembler.h | 393 Node* Phi(MachineType type, Node* n1, Node* n2) {
394 return NewNode(common()->Phi(type, 2), n1, n2);
396 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3) {
397 return NewNode(common()->Phi(type, 3), n1, n2, n3);
399 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3, Node* n4) {
400 return NewNode(common()->Phi(type, 4), n1, n2, n3, n4);
|
| /external/v8/test/cctest/compiler/ |
| test-phi-reducer.cc | 10 #include "src/compiler/phi-reducer.h"
32 void CheckReduce(Node* expect, Node* phi) {
34 Reduction reduction = reducer.Reduce(phi);
35 if (expect == phi) {
55 Node* Phi(Node* a) {
56 return SetSelfReferences(graph.NewNode(common.Phi(kMachAnyTagged, 1), a));
59 Node* Phi(Node* a, Node* b) {
61 graph.NewNode(common.Phi(kMachAnyTagged, 2), a, b));
64 Node* Phi(Node* a, Node* b, Node* c) {
66 graph.NewNode(common.Phi(kMachAnyTagged, 3), a, b, c))
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 78 bool isElse(PHINode *Phi);
80 void eraseIfUnused(PHINode *Phi);
170 /// \brief Can the condition represented by this PHI node treated like
172 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
174 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
175 if (Phi->getIncomingBlock(i) == IDom) {
177 if (Phi->getIncomingValue(i) != BoolTrue)
181 if (Phi->getIncomingValue(i) != BoolFalse)
189 // \brief Erase "Phi" if it is not used any mor
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 123 /// R = phi ..., [ R.next, LatchBlock ]
191 /// The desired flow is: phi ---> bump -+-> comparison-in-latch.
193 /// +-> back to phi
198 /// phi -+-> bump ---> back to phi
340 MachineInstr *Phi = &*I;
342 // Have a PHI instruction. Get the operand that corresponds to the
344 // where the "reg" is defined by the PHI node we are looking at.
345 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
346 if (Phi->getOperand(i+1).getMBB() != Latch
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| DataFlowSanitizer.cpp | 820 // We will not necessarily be able to compute the shadow for every phi node
821 // until we have visited every block. Therefore, the code that handles phi
[all...] |
| /external/clang/lib/CodeGen/ |
| MicrosoftCXXABI.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| CodeGenPrepare.cpp | 226 // Eliminate blocks that contain only PHI nodes and an
345 /// EliminateMostlyEmptyBlocks - eliminate blocks that contain only PHI nodes,
361 // If the instruction before the branch (skipping debug info) isn't a phi
390 /// single uncond branch between them, and BB contains no other non-phi
394 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
418 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
427 // It is faster to get preds from a PHI than with pred_iterator.
443 // If V2 is a phi node in BB, look up what the mapped value will be.
458 /// EliminateMostlyEmptyBlock - Eliminate a basic block that have only phi's an
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 61 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(2),
62 cl::desc("Control the amount of phi node folding to perform (default = 2)"));
90 // The first field contains the phi node that generates a result of the switch
92 // for that PHI.
148 // successor, and if that successor has a PHI node, and if *that* PHI node has
169 /// unconditional branch. PhiNodes will store all PHI nodes in common
179 // We fold the unconditional branch if we can easily update all PHI nodes in
208 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
210 /// flowing into the PHI nodes will be the same as those coming in fro
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 299 /// \brief The Loop exit block may have single value PHI nodes where the
[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...] |
