Searched refs:OP_PHI (Results 1 – 8 of 8) sorted by relevance
126 if (inst->op == OP_PHI) { in insertHead()160 if (inst->op == OP_PHI) { in insertTail()193 if (p->op == OP_PHI) { in insertBefore()201 assert(p->op == OP_PHI); in insertBefore()219 assert(q->op != OP_PHI || p->op == OP_PHI); in insertAfter()225 if (p->op == OP_PHI && q->op != OP_PHI) in insertAfter()255 if (insn->prev && insn->prev->op != OP_PHI) in remove()262 phi = (insn->next && insn->next->op == OP_PHI) ? insn->next : 0; in remove()280 assert(a->op != OP_PHI && b->op != OP_PHI); in permuteAdjacent()333 assert(!insn || insn->op != OP_PHI); in splitBefore()[all …]
385 phi = new_Instruction(this, OP_PHI, typeOfSize(lval->reg.size)); in convertToSSA()478 if (stmt->op != OP_PHI) { in search()516 for (phi = sb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in search()
410 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) in splitEdges()427 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in splitEdges()439 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in splitEdges()470 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) { in visit()606 for (i = bb->getPhi(); i && i->op == OP_PHI; i = i->next) in buildLiveSets()655 for (Instruction *i = out->getPhi(); i && i->op == OP_PHI; i = i->next) { in visit()675 for (Instruction *i = bb->getExit(); i && i->op != OP_PHI; i = i->prev) { in visit()1064 case OP_PHI: in doCoalesce()1906 if (v->getInsn()->op == OP_PHI || v->getInsn()->op == OP_UNION) { in resolveSplitsAndMerges()
44 OP_PHI, enumerator
36 if (op == OP_PHI || op == OP_SPLIT || op == OP_MERGE || op == OP_CONSTRAINT) in isNop()110 if (mov->getDef(0)->reg.data.id < 0 && si && si->op != OP_PHI) { in visit()3272 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = next) { in visit()
2039 case OP_PHI: in emitInstruction()
2618 case OP_PHI: in emitInstruction()
2825 case OP_PHI: in emitInstruction()