HomeSort by relevance Sort by last modified time
    Searched refs:Phis (Results 1 - 13 of 13) sorted by null

  /external/swiftshader/third_party/subzero/src/
IceCfgNode.h 78 PhiList &getPhis() { return Phis; }
80 const PhiList &getPhis() const { return Phis; }
146 PhiList Phis; /// unordered set of phi instructions
IceCfgNode.cpp 30 // Validates that all Phis are added before all regular instructions.
48 Phis.push_back(Phi);
87 removeDeletedAndRenumber(&Phis, Func);
116 for (Inst &Instr : Phis) {
166 for (Inst &I : Phis) {
258 for (Inst &I : Succ->Phis) {
275 for (Inst &I : Phis)
414 // However, if we lower Phis early and commit to a sequential ordering, we may
454 for (Inst &I : Phis) {
507 // There shouldn't be two different Phis with the same Dest variable o
    [all...]
  /external/llvm/lib/Target/Hexagon/
RDFLiveness.cpp 157 if (!StmtB) // OB is a phi and phis dominate statements.
169 // Both are phis. There is no ordering between phis (in terms of
242 // Collect all defined registers. Do not consider phis to be defining
327 NodeList Phis;
332 Phis.insert(Phis.end(), Ps.begin(), Ps.end());
337 std::vector<NodeId> PhiUQ; // Work list of phis for upward propagation.
339 // Go over all phis.
340 for (NodeAddr<PhiNode*> PhiA : Phis) {
    [all...]
HexagonBitSimplify.cpp     [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
fuse.go 78 // We need to keep a slot for Phis corresponding to b.
phiopt.go 7 // phiopt eliminates boolean Phis based on the previous if.
tighten.go 18 // Phis need to stay in their block.
regalloc.go 41 // Phi values are special, as always. We define two kinds of phis, those
46 // same register. Register phis are spilled similarly to regular ops:
53 // stack location. Stack phis start out life already spilled - each phi
60 // The stack allocator knows that StoreReg args of stack-allocated phis
92 // TODO: maybe we should introduce these extra phis?
709 var phis []*Value
771 // case below desires; it wants to process phis specially.
800 // We make a separate copy for phis and regular values.
808 phis = append(phis[:0], b.Values[:nphi]...
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
fuse.go 78 // We need to keep a slot for Phis corresponding to b.
phiopt.go 7 // phiopt eliminates boolean Phis based on the previous if.
tighten.go 18 // Phis need to stay in their block.
regalloc.go 41 // Phi values are special, as always. We define two kinds of phis, those
46 // same register. Register phis are spilled similarly to regular ops:
53 // stack location. Stack phis start out life already spilled - each phi
60 // The stack allocator knows that StoreReg args of stack-allocated phis
92 // TODO: maybe we should introduce these extra phis?
709 var phis []*Value
771 // case below desires; it wants to process phis specially.
800 // We make a separate copy for phis and regular values.
808 phis = append(phis[:0], b.Values[:nphi]...
    [all...]
  /external/llvm/lib/Analysis/
ScalarEvolutionExpander.cpp     [all...]

Completed in 472 milliseconds