--- old/src/share/vm/opto/multnode.cpp 2016-07-11 22:46:44.930382929 +0900 +++ new/src/share/vm/opto/multnode.cpp 2016-07-11 22:46:44.795383402 +0900 @@ -44,14 +44,14 @@ //------------------------------proj_out--------------------------------------- // Get a named projection ProjNode* MultiNode::proj_out(uint which_proj) const { - assert((Opcode() != Op_If && Opcode() != Op_RangeCheck) || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0"); - assert((Opcode() != Op_If && Opcode() != Op_RangeCheck) || outcnt() == 2, "bad if #1"); + assert((Opcode() != Opcodes::Op_If && Opcode() != Opcodes::Op_RangeCheck) || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0"); + assert((Opcode() != Opcodes::Op_If && Opcode() != Opcodes::Op_RangeCheck) || outcnt() == 2, "bad if #1"); for( DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++ ) { Node *p = fast_out(i); if (p->is_Proj()) { ProjNode *proj = p->as_Proj(); if (proj->_con == which_proj) { - assert((Opcode() != Op_If && Opcode() != Op_RangeCheck) || proj->Opcode() == (which_proj ? Op_IfTrue : Op_IfFalse), "bad if #2"); + assert((Opcode() != Opcodes::Op_If && Opcode() != Opcodes::Op_RangeCheck) || proj->Opcode() == (which_proj ? Opcodes::Op_IfTrue : Opcodes::Op_IfFalse), "bad if #2"); return proj; } } else { @@ -159,7 +159,7 @@ } //------------------------------ideal_reg-------------------------------------- -uint ProjNode::ideal_reg() const { +Opcodes ProjNode::ideal_reg() const { return bottom_type()->ideal_reg(); } @@ -184,7 +184,7 @@ } return NULL; // don't do further after call } - if (out->Opcode() != Op_Region) + if (out->Opcode() != Opcodes::Op_Region) return NULL; } return NULL; @@ -206,8 +206,8 @@ // we need "If(Conv2B(Opaque1(...)))" pattern for reason_predicate if (reason != Deoptimization::Reason_none) { - if (iff->in(1)->Opcode() != Op_Conv2B || - iff->in(1)->in(1)->Opcode() != Op_Opaque1) { + if (iff->in(1)->Opcode() != Opcodes::Op_Conv2B || + iff->in(1)->in(1)->Opcode() != Opcodes::Op_Opaque1) { return NULL; } }