HomeSort by relevance Sort by last modified time
    Searched refs:Phi (Results 151 - 175 of 185) sorted by null

1 2 3 4 5 67 8

  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
d3d9types.h     [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/gen/
genericOps.go 272 // Data movement, max argument length for Phi is indefinite so just pick
274 {name: "Phi", argLength: -1}, // select an argument based on which predecessor block we came from
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/gen/
genericOps.go 272 // Data movement, max argument length for Phi is indefinite so just pick
274 {name: "Phi", argLength: -1}, // select an argument based on which predecessor block we came from
  /external/v8/src/compiler/
bytecode-graph-builder.cc 265 // Introduce Phi nodes for values that have differing input at merge points,
266 // potentially extending an existing Phi node if possible.
278 // Create a Phi for external effects.
    [all...]
escape-analysis.cc 428 bool IsEquivalentPhi(Node* phi, ZoneVector<Node*>& inputs) {
429 if (phi->opcode() != IrOpcode::kPhi) return false;
430 if (static_cast<size_t>(phi->op()->ValueInputCount()) != inputs.size()) {
434 Node* input = NodeProperties::GetValueInput(phi, static_cast<int>(i));
458 Node* phi = graph->NewNode( local
459 common->Phi(MachineRepresentation::kTagged, value_input_count),
461 NodeProperties::SetType(phi, phi_type);
462 SetField(i, phi, true);
466 PrintF(" Creating Phi #%d as merge of", phi->id())
1462 Node* phi = graph()->NewNode( local
    [all...]
js-native-context-specialization.cc 652 // Merge+Phi+EffectPhi at the bottom.
773 common()->Phi(MachineRepresentation::kTagged, control_count),
    [all...]
machine-operator-reducer.cc 58 return d.Phi(MachineRepresentation::kFloat64, Float64Constant(V8_INFINITY),
    [all...]
js-create-lowering.cc 694 Node* phi = local
695 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
698 ReplaceWithValue(node, phi, effect_phi, merge);
    [all...]
ast-graph-builder.cc 3085 Node* phi = builder_->NewPhi(1, values()->at(i), control); local
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
loopreschedchecks.go 10 // counter phi functions at the target of the backedge that must
14 m *Value // phi for memory at dest of e
15 c *Value // phi for counter at dest of e
59 // 4. Ensure that phi functions that will-be-needed for mem and counter
65 // and modify destination phi function appropriately with new
104 for j := 0; mem == nil; j++ { // if there's no def, then there's no phi, so the visible mem is identical in all predecessors.
117 // longer live. This will avoid creation of dead phi functions. This optimization is ignored for the mem variable
142 // Maps from block to newly-inserted phi function in block.
146 // Insert phi functions as necessary for future changes to flow graph.
151 // find the phi function for the memory input at "h", if there is one
    [all...]
regalloc.go 41 // Phi values are special, as always. We define two kinds of phis, those
42 // where the merge happens in a register (a "register" phi) and those where
43 // the merge happens in a stack location (a "stack" phi).
45 // A register phi must have the phi and all of its inputs allocated to the
49 // b3: x = phi(y, z) : AX
52 // A stack phi must have the phi and all of its inputs allocated to the same
53 // stack location. Stack phis start out life already spilled - each phi
59 // b3: x = phi(y2, z2
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
loopreschedchecks.go 10 // counter phi functions at the target of the backedge that must
14 m *Value // phi for memory at dest of e
15 c *Value // phi for counter at dest of e
59 // 4. Ensure that phi functions that will-be-needed for mem and counter
65 // and modify destination phi function appropriately with new
104 for j := 0; mem == nil; j++ { // if there's no def, then there's no phi, so the visible mem is identical in all predecessors.
117 // longer live. This will avoid creation of dead phi functions. This optimization is ignored for the mem variable
142 // Maps from block to newly-inserted phi function in block.
146 // Insert phi functions as necessary for future changes to flow graph.
151 // find the phi function for the memory input at "h", if there is one
    [all...]
regalloc.go 41 // Phi values are special, as always. We define two kinds of phis, those
42 // where the merge happens in a register (a "register" phi) and those where
43 // the merge happens in a stack location (a "stack" phi).
45 // A register phi must have the phi and all of its inputs allocated to the
49 // b3: x = phi(y, z) : AX
52 // A stack phi must have the phi and all of its inputs allocated to the same
53 // stack location. Stack phis start out life already spilled - each phi
59 // b3: x = phi(y2, z2
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 24 // %i = phi [ 0, %entry ], [ %i.next, %latch ]
89 // Temporary flag to cleanup congruent phis after LSR phi expansion.
95 cl::desc("Enable LSR phi elimination"));
714 /// Return true if this AddRec is already a phi in its loop.
914 // If this is an addrec for another loop, don't second-guess its addrec phi
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 62 "phi-node-folding-threshold", cl::Hidden, cl::init(2),
64 "Control the amount of phi node folding to perform (default = 2)"));
118 // The first field contains the phi node that generates a result of the switch
120 // switch for that PHI.
182 // successor, and if that successor has a PHI node, and if *that* PHI node has
202 /// store all PHI nodes in common successors.
211 // We fold the unconditional branch if we can easily update all PHI nodes in
240 /// Update PHI nodes in Succ to indicate that there will now be entries in it
241 /// from the 'NewPred' block. The values that will be flowing into the PHI node
    [all...]
  /external/mesa3d/include/D3D9/
d3d9types.h     [all...]
  /external/swiftshader/third_party/subzero/src/
PNaClTranslator.cpp     [all...]
IceTargetLoweringARM32.cpp     [all...]
IceTargetLoweringX86BaseImpl.h 482 // Lower Phi instructions.
492 Func->dump("After Phi lowering");
563 Func->dump("After advanced Phi lowering");
617 Func->dump("After Phi lowering");
    [all...]
  /external/fonttools/Lib/fontTools/
agl.py 227 03A6;Phi;GREEK CAPITAL LETTER PHI
583 03C6;phi;GREEK SMALL LETTER PHI
584 03D5;phi1;GREEK PHI SYMBOL
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
SimplifyCFG.cpp 44 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(1),
45 cl::desc("Control the amount of phi node folding to perform (default = 1)"));
88 // successor, and if that successor has a PHI node, and if *that* PHI node has
107 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
109 /// flowing into the PHI nodes will be the same as those coming in from
123 /// least one PHI node in it), check to see if the merge at this block is due
587 // Remove PHI node entries for the dead edge.
640 // Remove PHI node entries for dead edges.
773 // sure we update the number of entries in the PHI nodes for thes
    [all...]
  /external/mesa3d/src/gallium/state_trackers/nine/
nine_state.c     [all...]
  /prebuilts/go/darwin-x86/src/encoding/xml/
xml.go     [all...]
  /prebuilts/go/darwin-x86/src/html/
entity.go 388 "Phi;": '\U000003A6',
    [all...]
  /prebuilts/go/linux-x86/src/encoding/xml/
xml.go     [all...]

Completed in 1351 milliseconds

1 2 3 4 5 67 8