Searched refs:OP_PHI (Results 1 – 8 of 8) sorted by relevance
122 if (inst->op == OP_PHI) { in insertHead()156 if (inst->op == OP_PHI) { in insertTail()189 if (p->op == OP_PHI) { in insertBefore()197 assert(p->op == OP_PHI); in insertBefore()215 assert(q->op != OP_PHI || p->op == OP_PHI); in insertAfter()221 if (p->op == OP_PHI && q->op != OP_PHI) in insertAfter()251 if (insn->prev && insn->prev->op != OP_PHI) in remove()258 phi = (insn->next && insn->next->op == OP_PHI) ? insn->next : 0; in remove()276 assert(a->op != OP_PHI && b->op != OP_PHI); in permuteAdjacent()329 assert(!insn || insn->op != OP_PHI); in splitBefore()[all …]
384 phi = new_Instruction(this, OP_PHI, typeOfSize(lval->reg.size)); in convertToSSA()466 if (stmt->op != OP_PHI) { in search()501 for (phi = sb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in search()
369 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in visit()501 for (i = bb->getPhi(); i && i->op == OP_PHI; i = i->next) in buildLiveSets()550 for (Instruction *i = out->getPhi(); i && i->op == OP_PHI; i = i->next) { in visit()570 for (Instruction *i = bb->getExit(); i && i->op != OP_PHI; i = i->prev) { in visit()913 case OP_PHI: in doCoalesce()1498 if (usei->op == OP_PHI) { in run()1510 if (defi->op == OP_PHI) { in run()
43 OP_PHI, enumerator
36 if (op == OP_PHI || op == OP_SPLIT || op == OP_MERGE || op == OP_CONSTRAINT) in isNop()106 if (mov->getDef(0)->reg.data.id < 0 && si && si->op != OP_PHI) { in visit()2135 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = next) { in visit()
1698 case OP_PHI: in emitInstruction()
216 case OP_PHI: in findOverwritingDefs()240 if (usei->op == OP_PHI || usei->op == OP_UNION) { in findFirstUses()251 usei->op == OP_PHI || in findFirstUses()
1735 case OP_PHI: in emitInstruction()