| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPUPromoteAlloca.cpp | 608 if (PHINode *Phi = dyn_cast<PHINode>(UseInst)) {
611 switch (Phi->getNumIncomingValues()) {
615 if (!binaryOpIsDerivedFromSameAlloca(BaseAlloca, Val, Phi, 0, 1))
760 } else if (PHINode *Phi = dyn_cast<PHINode>(V)) {
761 for (unsigned I = 0, E = Phi->getNumIncomingValues(); I != E; ++I) {
762 if (isa<ConstantPointerNull>(Phi->getIncomingValue(I)))
763 Phi->setIncomingValue(I, ConstantPointerNull::get(NewTy));
|
| /external/swiftshader/third_party/subzero/src/ |
| IceInstrumentation.cpp | 96 case Inst::Phi:
|
| /external/v8/src/compiler/ |
| js-builtin-reducer.cc | 465 vfalse0 = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
468 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
485 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
488 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
633 vfalse0 = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
636 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
653 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
656 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
[all...] |
| js-inlining-heuristic.cc | 251 common()->Phi(MachineRepresentation::kTagged, num_calls), num_calls + 1,
264 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, num_calls),
|
| raw-machine-assembler.h | 781 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
782 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
784 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
785 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
787 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
788 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
790 Node* Phi(MachineRepresentation rep, int input_count, Node* const* inputs);
791 void AppendPhiInput(Node* phi, Node* new_input);
|
| int64-lowering.cc | 61 // To break cycles with phi nodes we push phis on a separate stack so
693 lt32.Phi(MachineRepresentation::kWord32, GetReplacementLow(input),
696 lt32.Phi(MachineRepresentation::kWord32, GetReplacementHigh(input),
726 Node* low_node = d.Phi(
745 d.Phi(MachineRepresentation::kWord32,
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| RDFLiveness.cpp | 62 // The list ends at a reaching phi def, or when the reference from RefA is
66 // node. This sequence will terminate at the first phi node [1].
68 // is to traverse past phi nodes to the actual defs arising from the code
79 // [1] It is possible for multiple phi nodes to be included in the returned
81 // SubA = phi ...
82 // SubB = phi ...
84 // However, these phi nodes are independent from one another in terms of
100 // Collect all the reaching defs, going up until a phi node is encountered,
124 // Remove all non-phi defs that are not aliased to RefRR, and collect
140 assert(IA.Addr->getKind() == NodeAttrs::Phi);
[all...] |
| RDFDeadCode.cpp | 186 if (Kind == NodeAttrs::Stmt || Kind == NodeAttrs::Phi) {
|
| RDFGraph.h | 115 // p3: phi [d4<r0>(,d12,u9):]
116 // p5: phi [d6<r1>(,,u10):]
123 // kind of the node (i.e. f - function, b - basic block, p - phi, s - state-
159 // - Phi: Phi node, members are reference nodes.
161 // - Block: Basic block, members are instruction nodes (i.e. Phi or Stmt).
241 Phi = 0x0003 << 2, // 011
278 return KB == Phi || KB == Stmt;
279 case Phi:
443 NodeId PredB; // Id of the predecessor block for a phi use
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | [all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 489 std::vector<til::Phi*> CurrentArguments;
491 std::vector<til::Phi*> IncompleteArgs;
|
| /external/swiftshader/src/D3D8/ |
| Direct3DDevice8.hpp | 206 Phi = light.Phi;
|
| /external/swiftshader/third_party/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
222 // PHI nodes. Insert associations now.
252 // Loop over all of the PHI nodes in the block, changing them to use the
273 // Add phi entries for newly created values to all exit blocks.
279 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
280 Value *Incoming = phi->getIncomingValueForBlock(*BB);
284 phi->addIncoming(Incoming, New);
304 // Loop over the PHI nodes in the original block, setting incoming values
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 472 std::vector<til::Phi*> CurrentArguments;
474 std::vector<til::Phi*> IncompleteArgs;
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| fuse.go | 26 // If all Phi ops in ss have identical variables for slots corresponding to
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| fuse.go | 26 // If all Phi ops in ss have identical variables for slots corresponding to
|
| /external/llvm/lib/CodeGen/ |
| CodeGenPrepare.cpp | 248 // Eliminate blocks that contain only PHI nodes and an
367 /// Eliminate blocks that contain only PHI nodes, debug info directives, and an
391 // If the instruction before the branch (skipping debug info) isn't a phi
428 /// unconditional branch between them, and BB contains no other non-phi
432 // We only want to eliminate blocks whose phi nodes are used by phi nodes in
456 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
465 // It is faster to get preds from a PHI than with pred_iterator.
481 // If V2 is a phi node in BB, look up what the mapped value will be.
496 /// Eliminate a basic block that has only phi's and an unconditional branch i
[all...] |
