jdk8-mips64-public/hotspot: src/share/vm/opto/machnode.cpp@3d42f82cd811

7063628: Use cbcond on T4
Summary: Add new short branch instruction to Hotspot sparc assembler.
Reviewed-by: never, twisti, jrose

     1 /*

     2  * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.

     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

     4  *

     5  * This code is free software; you can redistribute it and/or modify it

     6  * under the terms of the GNU General Public License version 2 only, as

     7  * published by the Free Software Foundation.

     8  *

     9  * This code is distributed in the hope that it will be useful, but WITHOUT

    10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

    11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

    12  * version 2 for more details (a copy is included in the LICENSE file that

    13  * accompanied this code).

    14  *

    15  * You should have received a copy of the GNU General Public License version

    16  * 2 along with this work; if not, write to the Free Software Foundation,

    17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

    18  *

    19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

    20  * or visit www.oracle.com if you need additional information or have any

    21  * questions.

    22  *

    23  */

    25 #include "precompiled.hpp"

    26 #include "gc_interface/collectedHeap.hpp"

    27 #include "opto/machnode.hpp"

    28 #include "opto/regalloc.hpp"

    30 //=============================================================================

    31 // Return the value requested

    32 // result register lookup, corresponding to int_format

    33 int MachOper::reg(PhaseRegAlloc *ra_, const Node *node) const {

    34   return (int)ra_->get_encode(node);

    35 }

    36 // input register lookup, corresponding to ext_format

    37 int MachOper::reg(PhaseRegAlloc *ra_, const Node *node, int idx) const {

    38   return (int)(ra_->get_encode(node->in(idx)));

    39 }

    40 intptr_t  MachOper::constant() const { return 0x00; }

    41 bool MachOper::constant_is_oop() const { return false; }

    42 jdouble MachOper::constantD() const { ShouldNotReachHere(); return 0.0; }

    43 jfloat  MachOper::constantF() const { ShouldNotReachHere(); return 0.0; }

    44 jlong   MachOper::constantL() const { ShouldNotReachHere(); return CONST64(0) ; }

    45 TypeOopPtr *MachOper::oop() const { return NULL; }

    46 int MachOper::ccode() const { return 0x00; }

    47 // A zero, default, indicates this value is not needed.

    48 // May need to lookup the base register, as done in int_ and ext_format

    49 int MachOper::base (PhaseRegAlloc *ra_, const Node *node, int idx)  const { return 0x00; }

    50 int MachOper::index(PhaseRegAlloc *ra_, const Node *node, int idx)  const { return 0x00; }

    51 int MachOper::scale()  const { return 0x00; }

    52 int MachOper::disp (PhaseRegAlloc *ra_, const Node *node, int idx)  const { return 0x00; }

    53 int MachOper::constant_disp()  const { return 0; }

    54 int MachOper::base_position()  const { return -1; }  // no base input

    55 int MachOper::index_position() const { return -1; }  // no index input

    56 // Check for PC-Relative displacement

    57 bool MachOper::disp_is_oop() const { return false; }

    58 // Return the label

    59 Label*   MachOper::label()  const { ShouldNotReachHere(); return 0; }

    60 intptr_t MachOper::method() const { ShouldNotReachHere(); return 0; }

    63 //------------------------------negate-----------------------------------------

    64 // Negate conditional branches.  Error for non-branch operands

    65 void MachOper::negate() {

    66   ShouldNotCallThis();

    67 }

    69 //-----------------------------type--------------------------------------------

    70 const Type *MachOper::type() const {

    71   return Type::BOTTOM;

    72 }

    74 //------------------------------in_RegMask-------------------------------------

    75 const RegMask *MachOper::in_RegMask(int index) const {

    76   ShouldNotReachHere();

    77   return NULL;

    78 }

    80 //------------------------------dump_spec--------------------------------------

    81 // Print any per-operand special info

    82 #ifndef PRODUCT

    83 void MachOper::dump_spec(outputStream *st) const { }

    84 #endif

    86 //------------------------------hash-------------------------------------------

    87 // Print any per-operand special info

    88 uint MachOper::hash() const {

    89   ShouldNotCallThis();

    90   return 5;

    91 }

    93 //------------------------------cmp--------------------------------------------

    94 // Print any per-operand special info

    95 uint MachOper::cmp( const MachOper &oper ) const {

    96   ShouldNotCallThis();

    97   return opcode() == oper.opcode();

    98 }

   100 //------------------------------hash-------------------------------------------

   101 // Print any per-operand special info

   102 uint labelOper::hash() const {

   103   return _block_num;

   104 }

   106 //------------------------------cmp--------------------------------------------

   107 // Print any per-operand special info

   108 uint labelOper::cmp( const MachOper &oper ) const {

   109   return (opcode() == oper.opcode()) && (_label == oper.label());

   110 }

   112 //------------------------------hash-------------------------------------------

   113 // Print any per-operand special info

   114 uint methodOper::hash() const {

   115   return (uint)_method;

   116 }

   118 //------------------------------cmp--------------------------------------------

   119 // Print any per-operand special info

   120 uint methodOper::cmp( const MachOper &oper ) const {

   121   return (opcode() == oper.opcode()) && (_method == oper.method());

   122 }

   125 //=============================================================================

   126 //------------------------------MachNode---------------------------------------

   128 //------------------------------emit-------------------------------------------

   129 void MachNode::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {

   130   #ifdef ASSERT

   131   tty->print("missing MachNode emit function: ");

   132   dump();

   133   #endif

   134   ShouldNotCallThis();

   135 }

   137 //------------------------------size-------------------------------------------

   138 // Size of instruction in bytes

   139 uint MachNode::size(PhaseRegAlloc *ra_) const {

   140   // If a virtual was not defined for this specific instruction,

   141   // Call the helper which finds the size by emitting the bits.

   142   return MachNode::emit_size(ra_);

   143 }

   145 //------------------------------size-------------------------------------------

   146 // Helper function that computes size by emitting code

   147 uint MachNode::emit_size(PhaseRegAlloc *ra_) const {

   148   // Emit into a trash buffer and count bytes emitted.

   149   assert(ra_ == ra_->C->regalloc(), "sanity");

   150   return ra_->C->scratch_emit_size(this);

   151 }

   155 //------------------------------hash-------------------------------------------

   156 uint MachNode::hash() const {

   157   uint no = num_opnds();

   158   uint sum = rule();

   159   for( uint i=0; i<no; i++ )

   160     sum += _opnds[i]->hash();

   161   return sum+Node::hash();

   162 }

   164 //-----------------------------cmp---------------------------------------------

   165 uint MachNode::cmp( const Node &node ) const {

   166   MachNode& n = *((Node&)node).as_Mach();

   167   uint no = num_opnds();

   168   if( no != n.num_opnds() ) return 0;

   169   if( rule() != n.rule() ) return 0;

   170   for( uint i=0; i<no; i++ )    // All operands must match

   171     if( !_opnds[i]->cmp( *n._opnds[i] ) )

   172       return 0;                 // mis-matched operands

   173   return 1;                     // match

   174 }

   176 // Return an equivalent instruction using memory for cisc_operand position

   177 MachNode *MachNode::cisc_version(int offset, Compile* C) {

   178   ShouldNotCallThis();

   179   return NULL;

   180 }

   182 void MachNode::use_cisc_RegMask() {

   183   ShouldNotReachHere();

   184 }

   187 //-----------------------------in_RegMask--------------------------------------

   188 const RegMask &MachNode::in_RegMask( uint idx ) const {

   189   uint numopnds = num_opnds();        // Virtual call for number of operands

   190   uint skipped   = oper_input_base(); // Sum of leaves skipped so far

   191   if( idx < skipped ) {

   192     assert( ideal_Opcode() == Op_AddP, "expected base ptr here" );

   193     assert( idx == 1, "expected base ptr here" );

   194     // debug info can be anywhere

   195     return *Compile::current()->matcher()->idealreg2spillmask[Op_RegP];

   196   }

   197   uint opcnt     = 1;                 // First operand

   198   uint num_edges = _opnds[1]->num_edges(); // leaves for first operand

   199   while( idx >= skipped+num_edges ) {

   200     skipped += num_edges;

   201     opcnt++;                          // Bump operand count

   202     assert( opcnt < numopnds, "Accessing non-existent operand" );

   203     num_edges = _opnds[opcnt]->num_edges(); // leaves for next operand

   204   }

   206   const RegMask *rm = cisc_RegMask();

   207   if( rm == NULL || (int)opcnt != cisc_operand() ) {

   208     rm = _opnds[opcnt]->in_RegMask(idx-skipped);

   209   }

   210   return *rm;

   211 }

   213 //-----------------------------memory_inputs--------------------------------

   214 const MachOper*  MachNode::memory_inputs(Node* &base, Node* &index) const {

   215   const MachOper* oper = memory_operand();

   217   if (oper == (MachOper*)-1) {

   218     base = NodeSentinel;

   219     index = NodeSentinel;

   220   } else {

   221     base = NULL;

   222     index = NULL;

   223     if (oper != NULL) {

   224       // It has a unique memory operand.  Find its index.

   225       int oper_idx = num_opnds();

   226       while (--oper_idx >= 0) {

   227         if (_opnds[oper_idx] == oper)  break;

   228       }

   229       int oper_pos = operand_index(oper_idx);

   230       int base_pos = oper->base_position();

   231       if (base_pos >= 0) {

   232         base = _in[oper_pos+base_pos];

   233       }

   234       int index_pos = oper->index_position();

   235       if (index_pos >= 0) {

   236         index = _in[oper_pos+index_pos];

   237       }

   238     }

   239   }

   241   return oper;

   242 }

   244 //-----------------------------get_base_and_disp----------------------------

   245 const Node* MachNode::get_base_and_disp(intptr_t &offset, const TypePtr* &adr_type) const {

   247   // Find the memory inputs using our helper function

   248   Node* base;

   249   Node* index;

   250   const MachOper* oper = memory_inputs(base, index);

   252   if (oper == NULL) {

   253     // Base has been set to NULL

   254     offset = 0;

   255   } else if (oper == (MachOper*)-1) {

   256     // Base has been set to NodeSentinel

   257     // There is not a unique memory use here.  We will fall to AliasIdxBot.

   258     offset = Type::OffsetBot;

   259   } else {

   260     // Base may be NULL, even if offset turns out to be != 0

   262     intptr_t disp = oper->constant_disp();

   263     int scale = oper->scale();

   264     // Now we have collected every part of the ADLC MEMORY_INTER.

   265     // See if it adds up to a base + offset.

   266     if (index != NULL) {

   267       const Type* t_index = index->bottom_type();

   268       if (t_index->isa_narrowoop()) { // EncodeN, LoadN, LoadConN, LoadNKlass.

   269         // Memory references through narrow oops have a

   270         // funny base so grab the type from the index:

   271         // [R12 + narrow_oop_reg<<3 + offset]

   272         assert(base == NULL, "Memory references through narrow oops have no base");

   273         offset = disp;

   274         adr_type = t_index->make_ptr()->add_offset(offset);

   275         return NULL;

   276       } else if (!index->is_Con()) {

   277         disp = Type::OffsetBot;

   278       } else if (disp != Type::OffsetBot) {

   279         const TypeX* ti = t_index->isa_intptr_t();

   280         if (ti == NULL) {

   281           disp = Type::OffsetBot;  // a random constant??

   282         } else {

   283           disp += ti->get_con() << scale;

   284         }

   285       }

   286     }

   287     offset = disp;

   289     // In i486.ad, indOffset32X uses base==RegI and disp==RegP,

   290     // this will prevent alias analysis without the following support:

   291     // Lookup the TypePtr used by indOffset32X, a compile-time constant oop,

   292     // Add the offset determined by the "base", or use Type::OffsetBot.

   293     if( adr_type == TYPE_PTR_SENTINAL ) {

   294       const TypePtr *t_disp = oper->disp_as_type();  // only !NULL for indOffset32X

   295       if (t_disp != NULL) {

   296         offset = Type::OffsetBot;

   297         const Type* t_base = base->bottom_type();

   298         if (t_base->isa_intptr_t()) {

   299           const TypeX *t_offset = t_base->is_intptr_t();

   300           if( t_offset->is_con() ) {

   301             offset = t_offset->get_con();

   302           }

   303         }

   304         adr_type = t_disp->add_offset(offset);

   305       } else if( base == NULL && offset != 0 && offset != Type::OffsetBot ) {

   306         // Use ideal type if it is oop ptr.

   307         const TypePtr *tp = oper->type()->isa_ptr();

   308         if( tp != NULL) {

   309           adr_type = tp;

   310         }

   311       }

   312     }

   314   }

   315   return base;

   316 }

   319 //---------------------------------adr_type---------------------------------

   320 const class TypePtr *MachNode::adr_type() const {

   321   intptr_t offset = 0;

   322   const TypePtr *adr_type = TYPE_PTR_SENTINAL;  // attempt computing adr_type

   323   const Node *base = get_base_and_disp(offset, adr_type);

   324   if( adr_type != TYPE_PTR_SENTINAL ) {

   325     return adr_type;      // get_base_and_disp has the answer

   326   }

   328   // Direct addressing modes have no base node, simply an indirect

   329   // offset, which is always to raw memory.

   330   // %%%%% Someday we'd like to allow constant oop offsets which

   331   // would let Intel load from static globals in 1 instruction.

   332   // Currently Intel requires 2 instructions and a register temp.

   333   if (base == NULL) {

   334     // NULL base, zero offset means no memory at all (a null pointer!)

   335     if (offset == 0) {

   336       return NULL;

   337     }

   338     // NULL base, any offset means any pointer whatever

   339     if (offset == Type::OffsetBot) {

   340       return TypePtr::BOTTOM;

   341     }

   342     // %%% make offset be intptr_t

   343     assert(!Universe::heap()->is_in_reserved((oop)offset), "must be a raw ptr");

   344     return TypeRawPtr::BOTTOM;

   345   }

   347   // base of -1 with no particular offset means all of memory

   348   if (base == NodeSentinel)  return TypePtr::BOTTOM;

   350   const Type* t = base->bottom_type();

   351   if (UseCompressedOops && Universe::narrow_oop_shift() == 0) {

   352     // 32-bit unscaled narrow oop can be the base of any address expression

   353     t = t->make_ptr();

   354   }

   355   if (t->isa_intptr_t() && offset != 0 && offset != Type::OffsetBot) {

   356     // We cannot assert that the offset does not look oop-ish here.

   357     // Depending on the heap layout the cardmark base could land

   358     // inside some oopish region.  It definitely does for Win2K.

   359     // The sum of cardmark-base plus shift-by-9-oop lands outside

   360     // the oop-ish area but we can't assert for that statically.

   361     return TypeRawPtr::BOTTOM;

   362   }

   364   const TypePtr *tp = t->isa_ptr();

   366   // be conservative if we do not recognize the type

   367   if (tp == NULL) {

   368     assert(false, "this path may produce not optimal code");

   369     return TypePtr::BOTTOM;

   370   }

   371   assert(tp->base() != Type::AnyPtr, "not a bare pointer");

   373   return tp->add_offset(offset);

   374 }

   377 //-----------------------------operand_index---------------------------------

   378 int MachNode::operand_index( uint operand ) const {

   379   if( operand < 1 )  return -1;

   380   assert(operand < num_opnds(), "oob");

   381   if( _opnds[operand]->num_edges() == 0 )  return -1;

   383   uint skipped   = oper_input_base(); // Sum of leaves skipped so far

   384   for (uint opcnt = 1; opcnt < operand; opcnt++) {

   385     uint num_edges = _opnds[opcnt]->num_edges(); // leaves for operand

   386     skipped += num_edges;

   387   }

   388   return skipped;

   389 }

   392 //------------------------------negate-----------------------------------------

   393 // Negate conditional branches.  Error for non-branch Nodes

   394 void MachNode::negate() {

   395   ShouldNotCallThis();

   396 }

   398 //------------------------------peephole---------------------------------------

   399 // Apply peephole rule(s) to this instruction

   400 MachNode *MachNode::peephole( Block *block, int block_index, PhaseRegAlloc *ra_, int &deleted, Compile* C ) {

   401   return NULL;

   402 }

   404 //------------------------------add_case_label---------------------------------

   405 // Adds the label for the case

   406 void MachNode::add_case_label( int index_num, Label* blockLabel) {

   407   ShouldNotCallThis();

   408 }

   410 //------------------------------label_set--------------------------------------

   411 // Set the Label for a LabelOper, if an operand for this instruction

   412 void MachNode::label_set( Label* label, uint block_num ) {

   413   ShouldNotCallThis();

   414 }

   416 //------------------------------method_set-------------------------------------

   417 // Set the absolute address of a method

   418 void MachNode::method_set( intptr_t addr ) {

   419   ShouldNotCallThis();

   420 }

   422 //------------------------------rematerialize----------------------------------

   423 bool MachNode::rematerialize() const {

   424   // Temps are always rematerializable

   425   if (is_MachTemp()) return true;

   427   uint r = rule();              // Match rule

   428   if( r <  Matcher::_begin_rematerialize ||

   429       r >= Matcher::_end_rematerialize )

   430     return false;

   432   // For 2-address instructions, the input live range is also the output

   433   // live range.  Remateralizing does not make progress on the that live range.

   434   if( two_adr() )  return false;

   436   // Check for rematerializing float constants, or not

   437   if( !Matcher::rematerialize_float_constants ) {

   438     int op = ideal_Opcode();

   439     if( op == Op_ConF || op == Op_ConD )

   440       return false;

   441   }

   443   // Defining flags - can't spill these!  Must remateralize.

   444   if( ideal_reg() == Op_RegFlags )

   445     return true;

   447   // Stretching lots of inputs - don't do it.

   448   if( req() > 2 )

   449     return false;

   451   // Don't remateralize somebody with bound inputs - it stretches a

   452   // fixed register lifetime.

   453   uint idx = oper_input_base();

   454   if( req() > idx ) {

   455     const RegMask &rm = in_RegMask(idx);

   456     if( rm.is_bound1() || rm.is_bound2() )

   457       return false;

   458   }

   460   return true;

   461 }

   463 #ifndef PRODUCT

   464 //------------------------------dump_spec--------------------------------------

   465 // Print any per-operand special info

   466 void MachNode::dump_spec(outputStream *st) const {

   467   uint cnt = num_opnds();

   468   for( uint i=0; i<cnt; i++ )

   469     _opnds[i]->dump_spec(st);

   470   const TypePtr *t = adr_type();

   471   if( t ) {

   472     Compile* C = Compile::current();

   473     if( C->alias_type(t)->is_volatile() )

   474       st->print(" Volatile!");

   475   }

   476 }

   478 //------------------------------dump_format------------------------------------

   479 // access to virtual

   480 void MachNode::dump_format(PhaseRegAlloc *ra, outputStream *st) const {

   481   format(ra, st); // access to virtual

   482 }

   483 #endif

   485 //=============================================================================

   486 #ifndef PRODUCT

   487 void MachTypeNode::dump_spec(outputStream *st) const {

   488   _bottom_type->dump_on(st);

   489 }

   490 #endif

   493 //=============================================================================

   494 int MachConstantNode::constant_offset() {

   495   int offset = _constant.offset();

   496   // Bind the offset lazily.

   497   if (offset == -1) {

   498     Compile::ConstantTable& constant_table = Compile::current()->constant_table();

   499     offset = constant_table.table_base_offset() + constant_table.find_offset(_constant);

   500     _constant.set_offset(offset);

   501   }

   502   return offset;

   503 }

   506 //=============================================================================

   507 #ifndef PRODUCT

   508 void MachNullCheckNode::format( PhaseRegAlloc *ra_, outputStream *st ) const {

   509   int reg = ra_->get_reg_first(in(1)->in(_vidx));

   510   tty->print("%s %s", Name(), Matcher::regName[reg]);

   511 }

   512 #endif

   514 void MachNullCheckNode::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {

   515   // only emits entries in the null-pointer exception handler table

   516 }

   517 void MachNullCheckNode::label_set(Label* label, uint block_num) {

   518   // Nothing to emit

   519 }

   521 const RegMask &MachNullCheckNode::in_RegMask( uint idx ) const {

   522   if( idx == 0 ) return RegMask::Empty;

   523   else return in(1)->as_Mach()->out_RegMask();

   524 }

   526 //=============================================================================

   527 const Type *MachProjNode::bottom_type() const {

   528   if( _ideal_reg == fat_proj ) return Type::BOTTOM;

   529   // Try the normal mechanism first

   530   const Type *t = in(0)->bottom_type();

   531   if( t->base() == Type::Tuple ) {

   532     const TypeTuple *tt = t->is_tuple();

   533     if (_con < tt->cnt())

   534       return tt->field_at(_con);

   535   }

   536   // Else use generic type from ideal register set

   537   assert((uint)_ideal_reg < (uint)_last_machine_leaf && Type::mreg2type[_ideal_reg], "in bounds");

   538   return Type::mreg2type[_ideal_reg];

   539 }

   541 const TypePtr *MachProjNode::adr_type() const {

   542   if (bottom_type() == Type::MEMORY) {

   543     // in(0) might be a narrow MemBar; otherwise we will report TypePtr::BOTTOM

   544     const TypePtr* adr_type = in(0)->adr_type();

   545     #ifdef ASSERT

   546     if (!is_error_reported() && !Node::in_dump())

   547       assert(adr_type != NULL, "source must have adr_type");

   548     #endif

   549     return adr_type;

   550   }

   551   assert(bottom_type()->base() != Type::Memory, "no other memories?");

   552   return NULL;

   553 }

   555 #ifndef PRODUCT

   556 void MachProjNode::dump_spec(outputStream *st) const {

   557   ProjNode::dump_spec(st);

   558   switch (_ideal_reg) {

   559   case unmatched_proj:  st->print("/unmatched");                         break;

   560   case fat_proj:        st->print("/fat"); if (WizardMode) _rout.dump(); break;

   561   }

   562 }

   563 #endif

   565 //=============================================================================

   566 #ifndef PRODUCT

   567 void MachIfNode::dump_spec(outputStream *st) const {

   568   st->print("P=%f, C=%f",_prob, _fcnt);

   569 }

   570 #endif

   572 //=============================================================================

   573 uint MachReturnNode::size_of() const { return sizeof(*this); }

   575 //------------------------------Registers--------------------------------------

   576 const RegMask &MachReturnNode::in_RegMask( uint idx ) const {

   577   return _in_rms[idx];

   578 }

   580 const TypePtr *MachReturnNode::adr_type() const {

   581   // most returns and calls are assumed to consume & modify all of memory

   582   // the matcher will copy non-wide adr_types from ideal originals

   583   return _adr_type;

   584 }

   586 //=============================================================================

   587 const Type *MachSafePointNode::bottom_type() const {  return TypeTuple::MEMBAR; }

   589 //------------------------------Registers--------------------------------------

   590 const RegMask &MachSafePointNode::in_RegMask( uint idx ) const {

   591   // Values in the domain use the users calling convention, embodied in the

   592   // _in_rms array of RegMasks.

   593   if( idx < TypeFunc::Parms ) return _in_rms[idx];

   595   if (SafePointNode::needs_polling_address_input() &&

   596       idx == TypeFunc::Parms &&

   597       ideal_Opcode() == Op_SafePoint) {

   598     return MachNode::in_RegMask(idx);

   599   }

   601   // Values outside the domain represent debug info

   602   return *Compile::current()->matcher()->idealreg2spillmask[in(idx)->ideal_reg()];

   603 }

   606 //=============================================================================

   608 uint MachCallNode::cmp( const Node &n ) const

   609 { return _tf == ((MachCallNode&)n)._tf; }

   610 const Type *MachCallNode::bottom_type() const { return tf()->range(); }

   611 const Type *MachCallNode::Value(PhaseTransform *phase) const { return tf()->range(); }

   613 #ifndef PRODUCT

   614 void MachCallNode::dump_spec(outputStream *st) const {

   615   st->print("# ");

   616   tf()->dump_on(st);

   617   if (_cnt != COUNT_UNKNOWN)  st->print(" C=%f",_cnt);

   618   if (jvms() != NULL)  jvms()->dump_spec(st);

   619 }

   620 #endif

   623 bool MachCallNode::return_value_is_used() const {

   624   if (tf()->range()->cnt() == TypeFunc::Parms) {

   625     // void return

   626     return false;

   627   }

   629   // find the projection corresponding to the return value

   630   for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {

   631     Node *use = fast_out(i);

   632     if (!use->is_Proj()) continue;

   633     if (use->as_Proj()->_con == TypeFunc::Parms) {

   634       return true;

   635     }

   636   }

   637   return false;

   638 }

   641 //------------------------------Registers--------------------------------------

   642 const RegMask &MachCallNode::in_RegMask( uint idx ) const {

   643   // Values in the domain use the users calling convention, embodied in the

   644   // _in_rms array of RegMasks.

   645   if (idx < tf()->domain()->cnt())  return _in_rms[idx];

   646   // Values outside the domain represent debug info

   647   return *Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()];

   648 }

   650 //=============================================================================

   651 uint MachCallJavaNode::size_of() const { return sizeof(*this); }

   652 uint MachCallJavaNode::cmp( const Node &n ) const {

   653   MachCallJavaNode &call = (MachCallJavaNode&)n;

   654   return MachCallNode::cmp(call) && _method->equals(call._method);

   655 }

   656 #ifndef PRODUCT

   657 void MachCallJavaNode::dump_spec(outputStream *st) const {

   658   if (_method_handle_invoke)

   659     st->print("MethodHandle ");

   660   if (_method) {

   661     _method->print_short_name(st);

   662     st->print(" ");

   663   }

   664   MachCallNode::dump_spec(st);

   665 }

   666 #endif

   668 //------------------------------Registers--------------------------------------

   669 const RegMask &MachCallJavaNode::in_RegMask(uint idx) const {

   670   // Values in the domain use the users calling convention, embodied in the

   671   // _in_rms array of RegMasks.

   672   if (idx < tf()->domain()->cnt())  return _in_rms[idx];

   673   // Values outside the domain represent debug info

   674   Matcher* m = Compile::current()->matcher();

   675   // If this call is a MethodHandle invoke we have to use a different

   676   // debugmask which does not include the register we use to save the

   677   // SP over MH invokes.

   678   RegMask** debugmask = _method_handle_invoke ? m->idealreg2mhdebugmask : m->idealreg2debugmask;

   679   return *debugmask[in(idx)->ideal_reg()];

   680 }

   682 //=============================================================================

   683 uint MachCallStaticJavaNode::size_of() const { return sizeof(*this); }

   684 uint MachCallStaticJavaNode::cmp( const Node &n ) const {

   685   MachCallStaticJavaNode &call = (MachCallStaticJavaNode&)n;

   686   return MachCallJavaNode::cmp(call) && _name == call._name;

   687 }

   689 //----------------------------uncommon_trap_request----------------------------

   690 // If this is an uncommon trap, return the request code, else zero.

   691 int MachCallStaticJavaNode::uncommon_trap_request() const {

   692   if (_name != NULL && !strcmp(_name, "uncommon_trap")) {

   693     return CallStaticJavaNode::extract_uncommon_trap_request(this);

   694   }

   695   return 0;

   696 }

   698 #ifndef PRODUCT

   699 // Helper for summarizing uncommon_trap arguments.

   700 void MachCallStaticJavaNode::dump_trap_args(outputStream *st) const {

   701   int trap_req = uncommon_trap_request();

   702   if (trap_req != 0) {

   703     char buf[100];

   704     st->print("(%s)",

   705                Deoptimization::format_trap_request(buf, sizeof(buf),

   706                                                    trap_req));

   707   }

   708 }

   710 void MachCallStaticJavaNode::dump_spec(outputStream *st) const {

   711   st->print("Static ");

   712   if (_name != NULL) {

   713     st->print("wrapper for: %s", _name );

   714     dump_trap_args(st);

   715     st->print(" ");

   716   }

   717   MachCallJavaNode::dump_spec(st);

   718 }

   719 #endif

   721 //=============================================================================

   722 #ifndef PRODUCT

   723 void MachCallDynamicJavaNode::dump_spec(outputStream *st) const {

   724   st->print("Dynamic ");

   725   MachCallJavaNode::dump_spec(st);

   726 }

   727 #endif

   728 //=============================================================================

   729 uint MachCallRuntimeNode::size_of() const { return sizeof(*this); }

   730 uint MachCallRuntimeNode::cmp( const Node &n ) const {

   731   MachCallRuntimeNode &call = (MachCallRuntimeNode&)n;

   732   return MachCallNode::cmp(call) && !strcmp(_name,call._name);

   733 }

   734 #ifndef PRODUCT

   735 void MachCallRuntimeNode::dump_spec(outputStream *st) const {

   736   st->print("%s ",_name);

   737   MachCallNode::dump_spec(st);

   738 }

   739 #endif

   740 //=============================================================================

   741 // A shared JVMState for all HaltNodes.  Indicates the start of debug info

   742 // is at TypeFunc::Parms.  Only required for SOE register spill handling -

   743 // to indicate where the stack-slot-only debug info inputs begin.

   744 // There is no other JVM state needed here.

   745 JVMState jvms_for_throw(0);

   746 JVMState *MachHaltNode::jvms() const {

   747   return &jvms_for_throw;

   748 }

   750 //=============================================================================

   751 #ifndef PRODUCT

   752 void labelOper::int_format(PhaseRegAlloc *ra, const MachNode *node, outputStream *st) const {

   753   st->print("B%d", _block_num);

   754 }

   755 #endif // PRODUCT

   757 //=============================================================================

   758 #ifndef PRODUCT

   759 void methodOper::int_format(PhaseRegAlloc *ra, const MachNode *node, outputStream *st) const {

   760   st->print(INTPTR_FORMAT, _method);

   761 }

   762 #endif // PRODUCT

Mercurial > jdk8-mips64-public > hotspot / file revision

src/share/vm/opto/machnode.cpp@3d42f82cd811

src/share/vm/opto/machnode.cpp