/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp

Bug Summary

File:	jdk/src/hotspot/share/opto/matcher.cpp
Warning:	line 2656, column 22 1st function call argument is an uninitialized value
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name matcher.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -mthread-model posix -fno-delete-null-pointer-checks -mframe-pointer=all -relaxed-aliasing -fmath-errno -fno-rounding-math -masm-verbose -mconstructor-aliases -munwind-tables -target-cpu x86-64 -dwarf-column-info -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /usr/lib/llvm-10/lib/clang/10.0.0 -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/hotspot/variant-server/libjvm/objs/precompiled -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D _GNU_SOURCE -D _REENTRANT -D LIBC=gnu -D LINUX -D VM_LITTLE_ENDIAN -D _LP64=1 -D ASSERT -D CHECK_UNHANDLED_OOPS -D TARGET_ARCH_x86 -D INCLUDE_SUFFIX_OS=_linux -D INCLUDE_SUFFIX_CPU=_x86 -D INCLUDE_SUFFIX_COMPILER=_gcc -D TARGET_COMPILER_gcc -D AMD64 -D HOTSPOT_LIB_ARCH="amd64" -D COMPILER1 -D COMPILER2 -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/hotspot/variant-server/gensrc/adfiles -I /home/daniel/Projects/java/jdk/src/hotspot/share -I /home/daniel/Projects/java/jdk/src/hotspot/os/linux -I /home/daniel/Projects/java/jdk/src/hotspot/os/posix -I /home/daniel/Projects/java/jdk/src/hotspot/cpu/x86 -I /home/daniel/Projects/java/jdk/src/hotspot/os_cpu/linux_x86 -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/hotspot/variant-server/gensrc -I /home/daniel/Projects/java/jdk/src/hotspot/share/precompiled -I /home/daniel/Projects/java/jdk/src/hotspot/share/include -I /home/daniel/Projects/java/jdk/src/hotspot/os/posix/include -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/support/modules_include/java.base -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/support/modules_include/java.base/linux -I /home/daniel/Projects/java/jdk/src/java.base/share/native/libjimage -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/hotspot/variant-server/gensrc/adfiles -I /home/daniel/Projects/java/jdk/src/hotspot/share -I /home/daniel/Projects/java/jdk/src/hotspot/os/linux -I /home/daniel/Projects/java/jdk/src/hotspot/os/posix -I /home/daniel/Projects/java/jdk/src/hotspot/cpu/x86 -I /home/daniel/Projects/java/jdk/src/hotspot/os_cpu/linux_x86 -I /home/daniel/Projects/java/jdk/build/linux-x86_64-server-fastdebug/hotspot/variant-server/gensrc -D _FORTIFY_SOURCE=2 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.5.0/../../../../include/c++/7.5.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.5.0/../../../../include/x86_64-linux-gnu/c++/7.5.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.5.0/../../../../include/x86_64-linux-gnu/c++/7.5.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/7.5.0/../../../../include/c++/7.5.0/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-10/lib/clang/10.0.0/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O3 -Wno-format-zero-length -Wno-unused-parameter -Wno-unused -Wno-parentheses -Wno-comment -Wno-unknown-pragmas -Wno-address -Wno-delete-non-virtual-dtor -Wno-char-subscripts -Wno-array-bounds -Wno-int-in-bool-context -Wno-ignored-qualifiers -Wno-missing-field-initializers -Wno-implicit-fallthrough -Wno-empty-body -Wno-strict-overflow -Wno-sequence-point -Wno-maybe-uninitialized -Wno-misleading-indentation -Wno-cast-function-type -Wno-shift-negative-value -std=c++14 -fdeprecated-macro -fdebug-compilation-dir /home/daniel/Projects/java/jdk/make/hotspot -ferror-limit 19 -fmessage-length 0 -fvisibility hidden -stack-protector 1 -fno-rtti -fgnuc-version=4.2.1 -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -faddrsig -o /home/daniel/Projects/java/scan/2021-12-21-193737-8510-1 -x c++ /home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp
1/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/

25#include "precompiled.hpp"
26#include "gc/shared/barrierSet.hpp"
27#include "gc/shared/c2/barrierSetC2.hpp"
28#include "memory/allocation.inline.hpp"
29#include "memory/resourceArea.hpp"
30#include "oops/compressedOops.hpp"
31#include "opto/ad.hpp"
32#include "opto/addnode.hpp"
33#include "opto/callnode.hpp"
34#include "opto/idealGraphPrinter.hpp"
35#include "opto/matcher.hpp"
36#include "opto/memnode.hpp"
37#include "opto/movenode.hpp"
38#include "opto/opcodes.hpp"
39#include "opto/regmask.hpp"
40#include "opto/rootnode.hpp"
41#include "opto/runtime.hpp"
42#include "opto/type.hpp"
43#include "opto/vectornode.hpp"
44#include "runtime/os.hpp"
45#include "runtime/sharedRuntime.hpp"
46#include "utilities/align.hpp"

48OptoReg::Name OptoReg::c_frame_pointer;

50const RegMask *Matcher::idealreg2regmask[_last_machine_leaf];
51RegMask Matcher::mreg2regmask[_last_Mach_Reg];
52RegMask Matcher::caller_save_regmask;
53RegMask Matcher::caller_save_regmask_exclude_soe;
54RegMask Matcher::mh_caller_save_regmask;
55RegMask Matcher::mh_caller_save_regmask_exclude_soe;
56RegMask Matcher::STACK_ONLY_mask;
57RegMask Matcher::c_frame_ptr_mask;
58const uint Matcher::_begin_rematerialize = _BEGIN_REMATERIALIZE;
59const uint Matcher::_end_rematerialize   = _END_REMATERIALIZE;

61//---------------------------Matcher-------------------------------------------
62Matcher::Matcher()
PhaseTransform( Phase::Ins_Select ),
_states_arena(Chunk::medium_size, mtCompiler),
_visited(&_states_arena),
_shared(&_states_arena),
_dontcare(&_states_arena),
_reduceOp(reduceOp), _leftOp(leftOp), _rightOp(rightOp),
_swallowed(swallowed),
_begin_inst_chain_rule(_BEGIN_INST_CHAIN_RULE),
_end_inst_chain_rule(_END_INST_CHAIN_RULE),
_must_clone(must_clone),
_shared_nodes(C->comp_arena()),
74#ifndef PRODUCT
_old2new_map(C->comp_arena()),
_new2old_map(C->comp_arena()),
_reused(C->comp_arena()),
78#endif // !PRODUCT
_allocation_started(false),
_ruleName(ruleName),
_register_save_policy(register_save_policy),
_c_reg_save_policy(c_reg_save_policy),
_register_save_type(register_save_type) {
C->set_matcher(this);

idealreg2spillmask  [Op_RegI] = NULL__null;
idealreg2spillmask  [Op_RegN] = NULL__null;
idealreg2spillmask  [Op_RegL] = NULL__null;
idealreg2spillmask  [Op_RegF] = NULL__null;
idealreg2spillmask  [Op_RegD] = NULL__null;
idealreg2spillmask  [Op_RegP] = NULL__null;
idealreg2spillmask  [Op_VecA] = NULL__null;
idealreg2spillmask  [Op_VecS] = NULL__null;
idealreg2spillmask  [Op_VecD] = NULL__null;
idealreg2spillmask  [Op_VecX] = NULL__null;
idealreg2spillmask  [Op_VecY] = NULL__null;
idealreg2spillmask  [Op_VecZ] = NULL__null;
idealreg2spillmask  [Op_RegFlags] = NULL__null;
idealreg2spillmask  [Op_RegVectMask] = NULL__null;

idealreg2debugmask  [Op_RegI] = NULL__null;
idealreg2debugmask  [Op_RegN] = NULL__null;
idealreg2debugmask  [Op_RegL] = NULL__null;
idealreg2debugmask  [Op_RegF] = NULL__null;
idealreg2debugmask  [Op_RegD] = NULL__null;
idealreg2debugmask  [Op_RegP] = NULL__null;
idealreg2debugmask  [Op_VecA] = NULL__null;
idealreg2debugmask  [Op_VecS] = NULL__null;
idealreg2debugmask  [Op_VecD] = NULL__null;
idealreg2debugmask  [Op_VecX] = NULL__null;
idealreg2debugmask  [Op_VecY] = NULL__null;
idealreg2debugmask  [Op_VecZ] = NULL__null;
idealreg2debugmask  [Op_RegFlags] = NULL__null;
idealreg2debugmask  [Op_RegVectMask] = NULL__null;

idealreg2mhdebugmask[Op_RegI] = NULL__null;
idealreg2mhdebugmask[Op_RegN] = NULL__null;
idealreg2mhdebugmask[Op_RegL] = NULL__null;
idealreg2mhdebugmask[Op_RegF] = NULL__null;
idealreg2mhdebugmask[Op_RegD] = NULL__null;
idealreg2mhdebugmask[Op_RegP] = NULL__null;
idealreg2mhdebugmask[Op_VecA] = NULL__null;
idealreg2mhdebugmask[Op_VecS] = NULL__null;
idealreg2mhdebugmask[Op_VecD] = NULL__null;
idealreg2mhdebugmask[Op_VecX] = NULL__null;
idealreg2mhdebugmask[Op_VecY] = NULL__null;
idealreg2mhdebugmask[Op_VecZ] = NULL__null;
idealreg2mhdebugmask[Op_RegFlags] = NULL__null;
idealreg2mhdebugmask[Op_RegVectMask] = NULL__null;

debug_only(_mem_node = NULL;)_mem_node = __null;   // Ideal memory node consumed by mach node
132}

134//------------------------------warp_incoming_stk_arg------------------------
135// This warps a VMReg into an OptoReg::Name
136OptoReg::Name Matcher::warp_incoming_stk_arg( VMReg reg ) {
OptoReg::Name warped;
if( reg->is_stack() ) {  // Stack slot argument?
  warped = OptoReg::add(_old_SP, reg->reg2stack() );
  warped = OptoReg::add(warped, C->out_preserve_stack_slots());
  if( warped >= _in_arg_limit )
    _in_arg_limit = OptoReg::add(warped, 1); // Bump max stack slot seen
  if (!RegMask::can_represent_arg(warped)) {
    // the compiler cannot represent this method's calling sequence
    C->record_method_not_compilable("unsupported incoming calling sequence");
    return OptoReg::Bad;
  }
  return warped;
}
return OptoReg::as_OptoReg(reg);
151}

153//---------------------------compute_old_SP------------------------------------
154OptoReg::Name Compile::compute_old_SP() {
int fixed    = fixed_slots();
int preserve = in_preserve_stack_slots();
return OptoReg::stack2reg(align_up(fixed + preserve, (int)Matcher::stack_alignment_in_slots()));
158}



162#ifdef ASSERT1
163void Matcher::verify_new_nodes_only(Node* xroot) {
// Make sure that the new graph only references new nodes
ResourceMark rm;
Unique_Node_List worklist;
VectorSet visited;
worklist.push(xroot);
while (worklist.size() > 0) {
  Node* n = worklist.pop();
  visited.set(n->_idx);
  assert(C->node_arena()->contains(n), "dead node")do { if (!(C->node_arena()->contains(n))) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 172, "assert(" "C->node_arena()->contains(n)" ") failed"
, "dead node"); ::breakpoint(); } } while (0);
  for (uint j = 0; j < n->req(); j++) {
    Node* in = n->in(j);
    if (in != NULL__null) {
      assert(C->node_arena()->contains(in), "dead node")do { if (!(C->node_arena()->contains(in))) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 176, "assert(" "C->node_arena()->contains(in)" ") failed"
, "dead node"); ::breakpoint(); } } while (0);
      if (!visited.test(in->_idx)) {
        worklist.push(in);
      }
    }
  }
}
183}
184#endif


187//---------------------------match---------------------------------------------
188void Matcher::match( ) {
if( MaxLabelRootDepth < 100 ) { // Too small?
  assert(false, "invalid MaxLabelRootDepth, increase it to 100 minimum")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 190, "assert(" "false" ") failed", "invalid MaxLabelRootDepth, increase it to 100 minimum"
); ::breakpoint(); } } while (0);
  MaxLabelRootDepth = 100;
}
// One-time initialization of some register masks.
init_spill_mask( C->root()->in(1) );
_return_addr_mask = return_addr();
196#ifdef _LP641
// Pointers take 2 slots in 64-bit land
_return_addr_mask.Insert(OptoReg::add(return_addr(),1));
199#endif

// Map a Java-signature return type into return register-value
// machine registers for 0, 1 and 2 returned values.
const TypeTuple *range = C->tf()->range();
if( range->cnt() > TypeFunc::Parms ) { // If not a void function
  // Get ideal-register return type
  uint ireg = range->field_at(TypeFunc::Parms)->ideal_reg();
  // Get machine return register
  uint sop = C->start()->Opcode();
  OptoRegPair regs = return_value(ireg);

  // And mask for same
  _return_value_mask = RegMask(regs.first());
  if( OptoReg::is_valid(regs.second()) )
    _return_value_mask.Insert(regs.second());
}

// ---------------
// Frame Layout

// Need the method signature to determine the incoming argument types,
// because the types determine which registers the incoming arguments are
// in, and this affects the matched code.
const TypeTuple *domain = C->tf()->domain();
uint             argcnt = domain->cnt() - TypeFunc::Parms;
BasicType *sig_bt        = NEW_RESOURCE_ARRAY( BasicType, argcnt )(BasicType*) resource_allocate_bytes((argcnt) * sizeof(BasicType
));
VMRegPair *vm_parm_regs  = NEW_RESOURCE_ARRAY( VMRegPair, argcnt )(VMRegPair*) resource_allocate_bytes((argcnt) * sizeof(VMRegPair
));
_parm_regs               = NEW_RESOURCE_ARRAY( OptoRegPair, argcnt )(OptoRegPair*) resource_allocate_bytes((argcnt) * sizeof(OptoRegPair
));
_calling_convention_mask = NEW_RESOURCE_ARRAY( RegMask, argcnt )(RegMask*) resource_allocate_bytes((argcnt) * sizeof(RegMask)
);
uint i;
for( i = 0; i<argcnt; i++ ) {
  sig_bt[i] = domain->field_at(i+TypeFunc::Parms)->basic_type();
}

// Pass array of ideal registers and length to USER code (from the AD file)
// that will convert this to an array of register numbers.
const StartNode *start = C->start();
start->calling_convention( sig_bt, vm_parm_regs, argcnt );
238#ifdef ASSERT1
// Sanity check users' calling convention.  Real handy while trying to
// get the initial port correct.
{ for (uint i = 0; i<argcnt; i++) {
    if( !vm_parm_regs[i].first()->is_valid() && !vm_parm_regs[i].second()->is_valid() ) {
      assert(domain->field_at(i+TypeFunc::Parms)==Type::HALF, "only allowed on halve" )do { if (!(domain->field_at(i+TypeFunc::Parms)==Type::HALF
)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 243, "assert(" "domain->field_at(i+TypeFunc::Parms)==Type::HALF"
 ") failed", "only allowed on halve"); ::breakpoint(); } } while
 (0);
      _parm_regs[i].set_bad();
      continue;
    }
    VMReg parm_reg = vm_parm_regs[i].first();
    assert(parm_reg->is_valid(), "invalid arg?")do { if (!(parm_reg->is_valid())) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 248, "assert(" "parm_reg->is_valid()" ") failed", "invalid arg?"
); ::breakpoint(); } } while (0);
    if (parm_reg->is_reg()) {
      OptoReg::Name opto_parm_reg = OptoReg::as_OptoReg(parm_reg);
      assert(can_be_java_arg(opto_parm_reg) ||do { if (!(can_be_java_arg(opto_parm_reg) || C->stub_function
() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg
 == inline_cache_reg())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 254, "assert(" "can_be_java_arg(opto_parm_reg) || C->stub_function() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg == inline_cache_reg()"
 ") failed", "parameters in register must be preserved by runtime stubs"
); ::breakpoint(); } } while (0)
             C->stub_function() == CAST_FROM_FN_PTR(address, OptoRuntime::rethrow_C) ||do { if (!(can_be_java_arg(opto_parm_reg) || C->stub_function
() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg
 == inline_cache_reg())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 254, "assert(" "can_be_java_arg(opto_parm_reg) || C->stub_function() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg == inline_cache_reg()"
 ") failed", "parameters in register must be preserved by runtime stubs"
); ::breakpoint(); } } while (0)
             opto_parm_reg == inline_cache_reg(),do { if (!(can_be_java_arg(opto_parm_reg) || C->stub_function
() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg
 == inline_cache_reg())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 254, "assert(" "can_be_java_arg(opto_parm_reg) || C->stub_function() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg == inline_cache_reg()"
 ") failed", "parameters in register must be preserved by runtime stubs"
); ::breakpoint(); } } while (0)
             "parameters in register must be preserved by runtime stubs")do { if (!(can_be_java_arg(opto_parm_reg) || C->stub_function
() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg
 == inline_cache_reg())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 254, "assert(" "can_be_java_arg(opto_parm_reg) || C->stub_function() == ((address)((address_word)(OptoRuntime::rethrow_C))) || opto_parm_reg == inline_cache_reg()"
 ") failed", "parameters in register must be preserved by runtime stubs"
); ::breakpoint(); } } while (0);
    }
    for (uint j = 0; j < i; j++) {
      assert(parm_reg != vm_parm_regs[j].first(),do { if (!(parm_reg != vm_parm_regs[j].first())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 258, "assert(" "parm_reg != vm_parm_regs[j].first()" ") failed"
, "calling conv. must produce distinct regs"); ::breakpoint()
; } } while (0)
             "calling conv. must produce distinct regs")do { if (!(parm_reg != vm_parm_regs[j].first())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 258, "assert(" "parm_reg != vm_parm_regs[j].first()" ") failed"
, "calling conv. must produce distinct regs"); ::breakpoint()
; } } while (0);
    }
  }
}
262#endif

// Do some initial frame layout.

// Compute the old incoming SP (may be called FP) as
//   OptoReg::stack0() + locks + in_preserve_stack_slots + pad2.
_old_SP = C->compute_old_SP();
assert( is_even(_old_SP), "must be even" )do { if (!(is_even(_old_SP))) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 269, "assert(" "is_even(_old_SP)" ") failed", "must be even"
); ::breakpoint(); } } while (0);

// Compute highest incoming stack argument as
//   _old_SP + out_preserve_stack_slots + incoming argument size.
_in_arg_limit = OptoReg::add(_old_SP, C->out_preserve_stack_slots());
assert( is_even(_in_arg_limit), "out_preserve must be even" )do { if (!(is_even(_in_arg_limit))) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 274, "assert(" "is_even(_in_arg_limit)" ") failed", "out_preserve must be even"
); ::breakpoint(); } } while (0);
for( i = 0; i < argcnt; i++ ) {
  // Permit args to have no register
  _calling_convention_mask[i].Clear();
  if( !vm_parm_regs[i].first()->is_valid() && !vm_parm_regs[i].second()->is_valid() ) {
    continue;
  }
  // calling_convention returns stack arguments as a count of
  // slots beyond OptoReg::stack0()/VMRegImpl::stack0.  We need to convert this to
  // the allocators point of view, taking into account all the
  // preserve area, locks & pad2.

  OptoReg::Name reg1 = warp_incoming_stk_arg(vm_parm_regs[i].first());
  if( OptoReg::is_valid(reg1))
    _calling_convention_mask[i].Insert(reg1);

  OptoReg::Name reg2 = warp_incoming_stk_arg(vm_parm_regs[i].second());
  if( OptoReg::is_valid(reg2))
    _calling_convention_mask[i].Insert(reg2);

  // Saved biased stack-slot register number
  _parm_regs[i].set_pair(reg2, reg1);
}

// Finally, make sure the incoming arguments take up an even number of
// words, in case the arguments or locals need to contain doubleword stack
// slots.  The rest of the system assumes that stack slot pairs (in
// particular, in the spill area) which look aligned will in fact be
// aligned relative to the stack pointer in the target machine.  Double
// stack slots will always be allocated aligned.
_new_SP = OptoReg::Name(align_up(_in_arg_limit, (int)RegMask::SlotsPerLong));

// Compute highest outgoing stack argument as
//   _new_SP + out_preserve_stack_slots + max(outgoing argument size).
_out_arg_limit = OptoReg::add(_new_SP, C->out_preserve_stack_slots());
assert( is_even(_out_arg_limit), "out_preserve must be even" )do { if (!(is_even(_out_arg_limit))) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 309, "assert(" "is_even(_out_arg_limit)" ") failed", "out_preserve must be even"
); ::breakpoint(); } } while (0);

if (!RegMask::can_represent_arg(OptoReg::add(_out_arg_limit,-1))) {
  // the compiler cannot represent this method's calling sequence
  C->record_method_not_compilable("must be able to represent all call arguments in reg mask");
}

if (C->failing())  return;  // bailed out on incoming arg failure

// ---------------
// Collect roots of matcher trees.  Every node for which
// _shared[_idx] is cleared is guaranteed to not be shared, and thus
// can be a valid interior of some tree.
find_shared( C->root() );
find_shared( C->top() );

C->print_method(PHASE_BEFORE_MATCHING);

// Create new ideal node ConP #NULL even if it does exist in old space
// to avoid false sharing if the corresponding mach node is not used.
// The corresponding mach node is only used in rare cases for derived
// pointers.
Node* new_ideal_null = ConNode::make(TypePtr::NULL_PTR);

// Swap out to old-space; emptying new-space
Arena *old = C->node_arena()->move_contents(C->old_arena());

// Save debug and profile information for nodes in old space:
_old_node_note_array = C->node_note_array();
if (_old_node_note_array != NULL__null) {
  C->set_node_note_array(new(C->comp_arena()) GrowableArray<Node_Notes*>
                         (C->comp_arena(), _old_node_note_array->length(),
                          0, NULL__null));
}

// Pre-size the new_node table to avoid the need for range checks.
grow_new_node_array(C->unique());

// Reset node counter so MachNodes start with _idx at 0
int live_nodes = C->live_nodes();
C->set_unique(0);
C->reset_dead_node_list();

// Recursively match trees from old space into new space.
// Correct leaves of new-space Nodes; they point to old-space.
_visited.clear();
C->set_cached_top_node(xform( C->top(), live_nodes ));
if (!C->failing()) {
  Node* xroot =        xform( C->root(), 1 );
  if (xroot == NULL__null) {
    Matcher::soft_match_failure();  // recursive matching process failed
    C->record_method_not_compilable("instruction match failed");
  } else {
    // During matching shared constants were attached to C->root()
    // because xroot wasn't available yet, so transfer the uses to
    // the xroot.
    for( DUIterator_Fast jmax, j = C->root()->fast_outs(jmax); j < jmax; j++ ) {
      Node* n = C->root()->fast_out(j);
      if (C->node_arena()->contains(n)) {
        assert(n->in(0) == C->root(), "should be control user")do { if (!(n->in(0) == C->root())) { (*g_assert_poison)
 = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 368, "assert(" "n->in(0) == C->root()" ") failed", "should be control user"
); ::breakpoint(); } } while (0);
        n->set_req(0, xroot);
        --j;
        --jmax;
      }
    }

    // Generate new mach node for ConP #NULL
    assert(new_ideal_null != NULL, "sanity")do { if (!(new_ideal_null != __null)) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 376, "assert(" "new_ideal_null != __null" ") failed", "sanity"
); ::breakpoint(); } } while (0);
    _mach_null = match_tree(new_ideal_null);
    // Don't set control, it will confuse GCM since there are no uses.
    // The control will be set when this node is used first time
    // in find_base_for_derived().
    assert(_mach_null != NULL, "")do { if (!(_mach_null != __null)) { (*g_assert_poison) = 'X';
; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 381, "assert(" "_mach_null != __null" ") failed", ""); ::breakpoint
(); } } while (0);

    C->set_root(xroot->is_Root() ? xroot->as_Root() : NULL__null);

385#ifdef ASSERT1
    verify_new_nodes_only(xroot);
387#endif
  }
}
if (C->top() == NULL__null || C->root() == NULL__null) {
  C->record_method_not_compilable("graph lost"); // %%% cannot happen?
}
if (C->failing()) {
  // delete old;
  old->destruct_contents();
  return;
}
assert( C->top(), "" )do { if (!(C->top())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 398, "assert(" "C->top()" ") failed", ""); ::breakpoint(
); } } while (0);
assert( C->root(), "" )do { if (!(C->root())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 399, "assert(" "C->root()" ") failed", ""); ::breakpoint
(); } } while (0);
validate_null_checks();

// Now smoke old-space
NOT_DEBUG( old->destruct_contents() );

// ------------------------
// Set up save-on-entry registers.
Fixup_Save_On_Entry( );

{ // Cleanup mach IR after selection phase is over.
  Compile::TracePhase tp("postselect_cleanup", &timers[_t_postselect_cleanup]);
  do_postselect_cleanup();
  if (C->failing())  return;
  assert(verify_after_postselect_cleanup(), "")do { if (!(verify_after_postselect_cleanup())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 413, "assert(" "verify_after_postselect_cleanup()" ") failed"
, ""); ::breakpoint(); } } while (0);
}
415}

417//------------------------------Fixup_Save_On_Entry----------------------------
418// The stated purpose of this routine is to take care of save-on-entry
419// registers.  However, the overall goal of the Match phase is to convert into
420// machine-specific instructions which have RegMasks to guide allocation.
421// So what this procedure really does is put a valid RegMask on each input
422// to the machine-specific variations of all Return, TailCall and Halt
423// instructions.  It also adds edgs to define the save-on-entry values (and of
424// course gives them a mask).

426static RegMask *init_input_masks( uint size, RegMask &ret_adr, RegMask &fp ) {
RegMask *rms = NEW_RESOURCE_ARRAY( RegMask, size )(RegMask*) resource_allocate_bytes((size) * sizeof(RegMask));
// Do all the pre-defined register masks
rms[TypeFunc::Control  ] = RegMask::Empty;
rms[TypeFunc::I_O      ] = RegMask::Empty;
rms[TypeFunc::Memory   ] = RegMask::Empty;
rms[TypeFunc::ReturnAdr] = ret_adr;
rms[TypeFunc::FramePtr ] = fp;
return rms;
435}

437const int Matcher::scalable_predicate_reg_slots() {
assert(Matcher::has_predicated_vectors() && Matcher::supports_scalable_vector(),do { if (!(Matcher::has_predicated_vectors() && Matcher
::supports_scalable_vector())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 439, "assert(" "Matcher::has_predicated_vectors() && Matcher::supports_scalable_vector()"
 ") failed", "scalable predicate vector should be supported")
; ::breakpoint(); } } while (0)
      "scalable predicate vector should be supported")do { if (!(Matcher::has_predicated_vectors() && Matcher
::supports_scalable_vector())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 439, "assert(" "Matcher::has_predicated_vectors() && Matcher::supports_scalable_vector()"
 ") failed", "scalable predicate vector should be supported")
; ::breakpoint(); } } while (0);
int vector_reg_bit_size = Matcher::scalable_vector_reg_size(T_BYTE) << LogBitsPerByte;
// We assume each predicate register is one-eighth of the size of
// scalable vector register, one mask bit per vector byte.
int predicate_reg_bit_size = vector_reg_bit_size >> 3;
// Compute number of slots which is required when scalable predicate
// register is spilled. E.g. if scalable vector register is 640 bits,
// predicate register is 80 bits, which is 2.5 * slots.
// We will round up the slot number to power of 2, which is required
// by find_first_set().
int slots = predicate_reg_bit_size & (BitsPerInt - 1)
            ? (predicate_reg_bit_size >> LogBitsPerInt) + 1
            : predicate_reg_bit_size >> LogBitsPerInt;
return round_up_power_of_2(slots);
453}

455#define NOF_STACK_MASKS(3*13) (3*13)

457// Create the initial stack mask used by values spilling to the stack.
458// Disallow any debug info in outgoing argument areas by setting the
459// initial mask accordingly.
460void Matcher::init_first_stack_mask() {

// Allocate storage for spill masks as masks for the appropriate load type.
RegMask *rms = (RegMask*)C->comp_arena()->AmallocWords(sizeof(RegMask) * NOF_STACK_MASKS(3*13));

// Initialize empty placeholder masks into the newly allocated arena
for (int i = 0; i < NOF_STACK_MASKS(3*13); i++) {
  new (rms + i) RegMask();
}

idealreg2spillmask  [Op_RegN] = &rms[0];
idealreg2spillmask  [Op_RegI] = &rms[1];
idealreg2spillmask  [Op_RegL] = &rms[2];
idealreg2spillmask  [Op_RegF] = &rms[3];
idealreg2spillmask  [Op_RegD] = &rms[4];
idealreg2spillmask  [Op_RegP] = &rms[5];

idealreg2debugmask  [Op_RegN] = &rms[6];
idealreg2debugmask  [Op_RegI] = &rms[7];
idealreg2debugmask  [Op_RegL] = &rms[8];
idealreg2debugmask  [Op_RegF] = &rms[9];
idealreg2debugmask  [Op_RegD] = &rms[10];
idealreg2debugmask  [Op_RegP] = &rms[11];

idealreg2mhdebugmask[Op_RegN] = &rms[12];
idealreg2mhdebugmask[Op_RegI] = &rms[13];
idealreg2mhdebugmask[Op_RegL] = &rms[14];
idealreg2mhdebugmask[Op_RegF] = &rms[15];
idealreg2mhdebugmask[Op_RegD] = &rms[16];
idealreg2mhdebugmask[Op_RegP] = &rms[17];

idealreg2spillmask  [Op_VecA] = &rms[18];
idealreg2spillmask  [Op_VecS] = &rms[19];
idealreg2spillmask  [Op_VecD] = &rms[20];
idealreg2spillmask  [Op_VecX] = &rms[21];
idealreg2spillmask  [Op_VecY] = &rms[22];
idealreg2spillmask  [Op_VecZ] = &rms[23];

idealreg2debugmask  [Op_VecA] = &rms[24];
idealreg2debugmask  [Op_VecS] = &rms[25];
idealreg2debugmask  [Op_VecD] = &rms[26];
idealreg2debugmask  [Op_VecX] = &rms[27];
idealreg2debugmask  [Op_VecY] = &rms[28];
idealreg2debugmask  [Op_VecZ] = &rms[29];

idealreg2mhdebugmask[Op_VecA] = &rms[30];
idealreg2mhdebugmask[Op_VecS] = &rms[31];
idealreg2mhdebugmask[Op_VecD] = &rms[32];
idealreg2mhdebugmask[Op_VecX] = &rms[33];
idealreg2mhdebugmask[Op_VecY] = &rms[34];
idealreg2mhdebugmask[Op_VecZ] = &rms[35];

idealreg2spillmask  [Op_RegVectMask] = &rms[36];
idealreg2debugmask  [Op_RegVectMask] = &rms[37];
idealreg2mhdebugmask[Op_RegVectMask] = &rms[38];

OptoReg::Name i;

// At first, start with the empty mask
C->FIRST_STACK_mask().Clear();

// Add in the incoming argument area
OptoReg::Name init_in = OptoReg::add(_old_SP, C->out_preserve_stack_slots());
for (i = init_in; i < _in_arg_limit; i = OptoReg::add(i,1)) {
  C->FIRST_STACK_mask().Insert(i);
}
// Add in all bits past the outgoing argument area
guarantee(RegMask::can_represent_arg(OptoReg::add(_out_arg_limit,-1)),do { if (!(RegMask::can_represent_arg(OptoReg::add(_out_arg_limit
,-1)))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 528, "guarantee(" "RegMask::can_represent_arg(OptoReg::add(_out_arg_limit,-1))"
 ") failed", "must be able to represent all call arguments in reg mask"
); ::breakpoint(); } } while (0)
          "must be able to represent all call arguments in reg mask")do { if (!(RegMask::can_represent_arg(OptoReg::add(_out_arg_limit
,-1)))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 528, "guarantee(" "RegMask::can_represent_arg(OptoReg::add(_out_arg_limit,-1))"
 ") failed", "must be able to represent all call arguments in reg mask"
); ::breakpoint(); } } while (0);
OptoReg::Name init = _out_arg_limit;
for (i = init; RegMask::can_represent(i); i = OptoReg::add(i,1)) {
  C->FIRST_STACK_mask().Insert(i);
}
// Finally, set the "infinite stack" bit.
C->FIRST_STACK_mask().set_AllStack();

// Make spill masks.  Registers for their class, plus FIRST_STACK_mask.
RegMask aligned_stack_mask = C->FIRST_STACK_mask();
// Keep spill masks aligned.
aligned_stack_mask.clear_to_pairs();
assert(aligned_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(aligned_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 540, "assert(" "aligned_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
RegMask scalable_stack_mask = aligned_stack_mask;

*idealreg2spillmask[Op_RegP] = *idealreg2regmask[Op_RegP];
544#ifdef _LP641
*idealreg2spillmask[Op_RegN] = *idealreg2regmask[Op_RegN];
 idealreg2spillmask[Op_RegN]->OR(C->FIRST_STACK_mask());
 idealreg2spillmask[Op_RegP]->OR(aligned_stack_mask);
548#else
 idealreg2spillmask[Op_RegP]->OR(C->FIRST_STACK_mask());
550#endif
*idealreg2spillmask[Op_RegI] = *idealreg2regmask[Op_RegI];
 idealreg2spillmask[Op_RegI]->OR(C->FIRST_STACK_mask());
*idealreg2spillmask[Op_RegL] = *idealreg2regmask[Op_RegL];
 idealreg2spillmask[Op_RegL]->OR(aligned_stack_mask);
*idealreg2spillmask[Op_RegF] = *idealreg2regmask[Op_RegF];
 idealreg2spillmask[Op_RegF]->OR(C->FIRST_STACK_mask());
*idealreg2spillmask[Op_RegD] = *idealreg2regmask[Op_RegD];
 idealreg2spillmask[Op_RegD]->OR(aligned_stack_mask);

if (Matcher::has_predicated_vectors()) {
  *idealreg2spillmask[Op_RegVectMask] = *idealreg2regmask[Op_RegVectMask];
   idealreg2spillmask[Op_RegVectMask]->OR(aligned_stack_mask);
} else {
  *idealreg2spillmask[Op_RegVectMask] = RegMask::Empty;
}

if (Matcher::vector_size_supported(T_BYTE,4)) {
  *idealreg2spillmask[Op_VecS] = *idealreg2regmask[Op_VecS];
   idealreg2spillmask[Op_VecS]->OR(C->FIRST_STACK_mask());
} else {
  *idealreg2spillmask[Op_VecS] = RegMask::Empty;
}

if (Matcher::vector_size_supported(T_FLOAT,2)) {
  // For VecD we need dual alignment and 8 bytes (2 slots) for spills.
  // RA guarantees such alignment since it is needed for Double and Long values.
  *idealreg2spillmask[Op_VecD] = *idealreg2regmask[Op_VecD];
   idealreg2spillmask[Op_VecD]->OR(aligned_stack_mask);
} else {
  *idealreg2spillmask[Op_VecD] = RegMask::Empty;
}

if (Matcher::vector_size_supported(T_FLOAT,4)) {
  // For VecX we need quadro alignment and 16 bytes (4 slots) for spills.
  //
  // RA can use input arguments stack slots for spills but until RA
  // we don't know frame size and offset of input arg stack slots.
  //
  // Exclude last input arg stack slots to avoid spilling vectors there
  // otherwise vector spills could stomp over stack slots in caller frame.
  OptoReg::Name in = OptoReg::add(_in_arg_limit, -1);
  for (int k = 1; (in >= init_in) && (k < RegMask::SlotsPerVecX); k++) {
    aligned_stack_mask.Remove(in);
    in = OptoReg::add(in, -1);
  }
   aligned_stack_mask.clear_to_sets(RegMask::SlotsPerVecX);
   assert(aligned_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(aligned_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 597, "assert(" "aligned_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
  *idealreg2spillmask[Op_VecX] = *idealreg2regmask[Op_VecX];
   idealreg2spillmask[Op_VecX]->OR(aligned_stack_mask);
} else {
  *idealreg2spillmask[Op_VecX] = RegMask::Empty;
}

if (Matcher::vector_size_supported(T_FLOAT,8)) {
  // For VecY we need octo alignment and 32 bytes (8 slots) for spills.
  OptoReg::Name in = OptoReg::add(_in_arg_limit, -1);
  for (int k = 1; (in >= init_in) && (k < RegMask::SlotsPerVecY); k++) {
    aligned_stack_mask.Remove(in);
    in = OptoReg::add(in, -1);
  }
   aligned_stack_mask.clear_to_sets(RegMask::SlotsPerVecY);
   assert(aligned_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(aligned_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 612, "assert(" "aligned_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
  *idealreg2spillmask[Op_VecY] = *idealreg2regmask[Op_VecY];
   idealreg2spillmask[Op_VecY]->OR(aligned_stack_mask);
} else {
  *idealreg2spillmask[Op_VecY] = RegMask::Empty;
}

if (Matcher::vector_size_supported(T_FLOAT,16)) {
  // For VecZ we need enough alignment and 64 bytes (16 slots) for spills.
  OptoReg::Name in = OptoReg::add(_in_arg_limit, -1);
  for (int k = 1; (in >= init_in) && (k < RegMask::SlotsPerVecZ); k++) {
    aligned_stack_mask.Remove(in);
    in = OptoReg::add(in, -1);
  }
   aligned_stack_mask.clear_to_sets(RegMask::SlotsPerVecZ);
   assert(aligned_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(aligned_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 627, "assert(" "aligned_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
  *idealreg2spillmask[Op_VecZ] = *idealreg2regmask[Op_VecZ];
   idealreg2spillmask[Op_VecZ]->OR(aligned_stack_mask);
} else {
  *idealreg2spillmask[Op_VecZ] = RegMask::Empty;
}

if (Matcher::supports_scalable_vector()) {
  int k = 1;
  OptoReg::Name in = OptoReg::add(_in_arg_limit, -1);
  if (Matcher::has_predicated_vectors()) {
    // Exclude last input arg stack slots to avoid spilling vector register there,
    // otherwise RegVectMask spills could stomp over stack slots in caller frame.
    for (; (in >= init_in) && (k < scalable_predicate_reg_slots()); k++) {
      scalable_stack_mask.Remove(in);
      in = OptoReg::add(in, -1);
    }

    // For RegVectMask
    scalable_stack_mask.clear_to_sets(scalable_predicate_reg_slots());
    assert(scalable_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(scalable_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 647, "assert(" "scalable_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
    *idealreg2spillmask[Op_RegVectMask] = *idealreg2regmask[Op_RegVectMask];
    idealreg2spillmask[Op_RegVectMask]->OR(scalable_stack_mask);
  }

  // Exclude last input arg stack slots to avoid spilling vector register there,
  // otherwise vector spills could stomp over stack slots in caller frame.
  for (; (in >= init_in) && (k < scalable_vector_reg_size(T_FLOAT)); k++) {
    scalable_stack_mask.Remove(in);
    in = OptoReg::add(in, -1);
  }

  // For VecA
   scalable_stack_mask.clear_to_sets(RegMask::SlotsPerVecA);
   assert(scalable_stack_mask.is_AllStack(), "should be infinite stack")do { if (!(scalable_stack_mask.is_AllStack())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 661, "assert(" "scalable_stack_mask.is_AllStack()" ") failed"
, "should be infinite stack"); ::breakpoint(); } } while (0);
  *idealreg2spillmask[Op_VecA] = *idealreg2regmask[Op_VecA];
   idealreg2spillmask[Op_VecA]->OR(scalable_stack_mask);
} else {
  *idealreg2spillmask[Op_VecA] = RegMask::Empty;
}

if (UseFPUForSpilling) {
  // This mask logic assumes that the spill operations are
  // symmetric and that the registers involved are the same size.
  // On sparc for instance we may have to use 64 bit moves will
  // kill 2 registers when used with F0-F31.
  idealreg2spillmask[Op_RegI]->OR(*idealreg2regmask[Op_RegF]);
  idealreg2spillmask[Op_RegF]->OR(*idealreg2regmask[Op_RegI]);
675#ifdef _LP641
  idealreg2spillmask[Op_RegN]->OR(*idealreg2regmask[Op_RegF]);
  idealreg2spillmask[Op_RegL]->OR(*idealreg2regmask[Op_RegD]);
  idealreg2spillmask[Op_RegD]->OR(*idealreg2regmask[Op_RegL]);
  idealreg2spillmask[Op_RegP]->OR(*idealreg2regmask[Op_RegD]);
680#else
  idealreg2spillmask[Op_RegP]->OR(*idealreg2regmask[Op_RegF]);
682#ifdef ARM
  // ARM has support for moving 64bit values between a pair of
  // integer registers and a double register
  idealreg2spillmask[Op_RegL]->OR(*idealreg2regmask[Op_RegD]);
  idealreg2spillmask[Op_RegD]->OR(*idealreg2regmask[Op_RegL]);
687#endif
688#endif
}

// Make up debug masks.  Any spill slot plus callee-save (SOE) registers.
// Caller-save (SOC, AS) registers are assumed to be trashable by the various
// inline-cache fixup routines.
*idealreg2debugmask  [Op_RegN] = *idealreg2spillmask[Op_RegN];
*idealreg2debugmask  [Op_RegI] = *idealreg2spillmask[Op_RegI];
*idealreg2debugmask  [Op_RegL] = *idealreg2spillmask[Op_RegL];
*idealreg2debugmask  [Op_RegF] = *idealreg2spillmask[Op_RegF];
*idealreg2debugmask  [Op_RegD] = *idealreg2spillmask[Op_RegD];
*idealreg2debugmask  [Op_RegP] = *idealreg2spillmask[Op_RegP];
*idealreg2debugmask  [Op_RegVectMask] = *idealreg2spillmask[Op_RegVectMask];

*idealreg2debugmask  [Op_VecA] = *idealreg2spillmask[Op_VecA];
*idealreg2debugmask  [Op_VecS] = *idealreg2spillmask[Op_VecS];
*idealreg2debugmask  [Op_VecD] = *idealreg2spillmask[Op_VecD];
*idealreg2debugmask  [Op_VecX] = *idealreg2spillmask[Op_VecX];
*idealreg2debugmask  [Op_VecY] = *idealreg2spillmask[Op_VecY];
*idealreg2debugmask  [Op_VecZ] = *idealreg2spillmask[Op_VecZ];

*idealreg2mhdebugmask[Op_RegN] = *idealreg2spillmask[Op_RegN];
*idealreg2mhdebugmask[Op_RegI] = *idealreg2spillmask[Op_RegI];
*idealreg2mhdebugmask[Op_RegL] = *idealreg2spillmask[Op_RegL];
*idealreg2mhdebugmask[Op_RegF] = *idealreg2spillmask[Op_RegF];
*idealreg2mhdebugmask[Op_RegD] = *idealreg2spillmask[Op_RegD];
*idealreg2mhdebugmask[Op_RegP] = *idealreg2spillmask[Op_RegP];
*idealreg2mhdebugmask[Op_RegVectMask] = *idealreg2spillmask[Op_RegVectMask];

*idealreg2mhdebugmask[Op_VecA] = *idealreg2spillmask[Op_VecA];
*idealreg2mhdebugmask[Op_VecS] = *idealreg2spillmask[Op_VecS];
*idealreg2mhdebugmask[Op_VecD] = *idealreg2spillmask[Op_VecD];
*idealreg2mhdebugmask[Op_VecX] = *idealreg2spillmask[Op_VecX];
*idealreg2mhdebugmask[Op_VecY] = *idealreg2spillmask[Op_VecY];
*idealreg2mhdebugmask[Op_VecZ] = *idealreg2spillmask[Op_VecZ];

// Prevent stub compilations from attempting to reference
// callee-saved (SOE) registers from debug info
bool exclude_soe = !Compile::current()->is_method_compilation();
RegMask* caller_save_mask = exclude_soe ? &caller_save_regmask_exclude_soe : &caller_save_regmask;
RegMask* mh_caller_save_mask = exclude_soe ? &mh_caller_save_regmask_exclude_soe : &mh_caller_save_regmask;

idealreg2debugmask[Op_RegN]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegI]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegL]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegF]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegD]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegP]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_RegVectMask]->SUBTRACT(*caller_save_mask);

idealreg2debugmask[Op_VecA]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_VecS]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_VecD]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_VecX]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_VecY]->SUBTRACT(*caller_save_mask);
idealreg2debugmask[Op_VecZ]->SUBTRACT(*caller_save_mask);

idealreg2mhdebugmask[Op_RegN]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegI]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegL]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegF]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegD]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegP]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_RegVectMask]->SUBTRACT(*mh_caller_save_mask);

idealreg2mhdebugmask[Op_VecA]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_VecS]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_VecD]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_VecX]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_VecY]->SUBTRACT(*mh_caller_save_mask);
idealreg2mhdebugmask[Op_VecZ]->SUBTRACT(*mh_caller_save_mask);
759}

761//---------------------------is_save_on_entry----------------------------------
762bool Matcher::is_save_on_entry(int reg) {
return
  _register_save_policy[reg] == 'E' ||
  _register_save_policy[reg] == 'A'; // Save-on-entry register?
766}

768//---------------------------Fixup_Save_On_Entry-------------------------------
769void Matcher::Fixup_Save_On_Entry( ) {
init_first_stack_mask();

Node *root = C->root();       // Short name for root
// Count number of save-on-entry registers.
uint soe_cnt = number_of_saved_registers();
uint i;

// Find the procedure Start Node
StartNode *start = C->start();
assert( start, "Expect a start node" )do { if (!(start)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 779, "assert(" "start" ") failed", "Expect a start node"); ::
breakpoint(); } } while (0);

// Input RegMask array shared by all Returns.
// The type for doubles and longs has a count of 2, but
// there is only 1 returned value
uint ret_edge_cnt = TypeFunc::Parms + ((C->tf()->range()->cnt() == TypeFunc::Parms) ? 0 : 1);
RegMask *ret_rms  = init_input_masks( ret_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask );
// Returns have 0 or 1 returned values depending on call signature.
// Return register is specified by return_value in the AD file.
if (ret_edge_cnt > TypeFunc::Parms)
  ret_rms[TypeFunc::Parms+0] = _return_value_mask;

// Input RegMask array shared by all Rethrows.
uint reth_edge_cnt = TypeFunc::Parms+1;
RegMask *reth_rms  = init_input_masks( reth_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask );
// Rethrow takes exception oop only, but in the argument 0 slot.
OptoReg::Name reg = find_receiver();
if (reg >= 0) {
  reth_rms[TypeFunc::Parms] = mreg2regmask[reg];
798#ifdef _LP641
  // Need two slots for ptrs in 64-bit land
  reth_rms[TypeFunc::Parms].Insert(OptoReg::add(OptoReg::Name(reg), 1));
801#endif
}

// Input RegMask array shared by all TailCalls
uint tail_call_edge_cnt = TypeFunc::Parms+2;
RegMask *tail_call_rms = init_input_masks( tail_call_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask );

// Input RegMask array shared by all TailJumps
uint tail_jump_edge_cnt = TypeFunc::Parms+2;
RegMask *tail_jump_rms = init_input_masks( tail_jump_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask );

// TailCalls have 2 returned values (target & moop), whose masks come
// from the usual MachNode/MachOper mechanism.  Find a sample
// TailCall to extract these masks and put the correct masks into
// the tail_call_rms array.
for( i=1; i < root->req(); i++ ) {
  MachReturnNode *m = root->in(i)->as_MachReturn();
  if( m->ideal_Opcode() == Op_TailCall ) {
    tail_call_rms[TypeFunc::Parms+0] = m->MachNode::in_RegMask(TypeFunc::Parms+0);
    tail_call_rms[TypeFunc::Parms+1] = m->MachNode::in_RegMask(TypeFunc::Parms+1);
    break;
  }
}

// TailJumps have 2 returned values (target & ex_oop), whose masks come
// from the usual MachNode/MachOper mechanism.  Find a sample
// TailJump to extract these masks and put the correct masks into
// the tail_jump_rms array.
for( i=1; i < root->req(); i++ ) {
  MachReturnNode *m = root->in(i)->as_MachReturn();
  if( m->ideal_Opcode() == Op_TailJump ) {
    tail_jump_rms[TypeFunc::Parms+0] = m->MachNode::in_RegMask(TypeFunc::Parms+0);
    tail_jump_rms[TypeFunc::Parms+1] = m->MachNode::in_RegMask(TypeFunc::Parms+1);
    break;
  }
}

// Input RegMask array shared by all Halts
uint halt_edge_cnt = TypeFunc::Parms;
RegMask *halt_rms = init_input_masks( halt_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask );

// Capture the return input masks into each exit flavor
for( i=1; i < root->req(); i++ ) {
  MachReturnNode *exit = root->in(i)->as_MachReturn();
  switch( exit->ideal_Opcode() ) {
    case Op_Return   : exit->_in_rms = ret_rms;  break;
    case Op_Rethrow  : exit->_in_rms = reth_rms; break;
    case Op_TailCall : exit->_in_rms = tail_call_rms; break;
    case Op_TailJump : exit->_in_rms = tail_jump_rms; break;
    case Op_Halt     : exit->_in_rms = halt_rms; break;
    default          : ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 851); ::breakpoint(); } while (0);
  }
}

// Next unused projection number from Start.
int proj_cnt = C->tf()->domain()->cnt();

// Do all the save-on-entry registers.  Make projections from Start for
// them, and give them a use at the exit points.  To the allocator, they
// look like incoming register arguments.
for( i = 0; i < _last_Mach_Reg; i++ ) {
  if( is_save_on_entry(i) ) {

    // Add the save-on-entry to the mask array
    ret_rms      [      ret_edge_cnt] = mreg2regmask[i];
    reth_rms     [     reth_edge_cnt] = mreg2regmask[i];
    tail_call_rms[tail_call_edge_cnt] = mreg2regmask[i];
    tail_jump_rms[tail_jump_edge_cnt] = mreg2regmask[i];
    // Halts need the SOE registers, but only in the stack as debug info.
    // A just-prior uncommon-trap or deoptimization will use the SOE regs.
    halt_rms     [     halt_edge_cnt] = *idealreg2spillmask[_register_save_type[i]];

    Node *mproj;

    // Is this a RegF low half of a RegD?  Double up 2 adjacent RegF's
    // into a single RegD.
    if( (i&1) == 0 &&
        _register_save_type[i  ] == Op_RegF &&
        _register_save_type[i+1] == Op_RegF &&
        is_save_on_entry(i+1) ) {
      // Add other bit for double
      ret_rms      [      ret_edge_cnt].Insert(OptoReg::Name(i+1));
      reth_rms     [     reth_edge_cnt].Insert(OptoReg::Name(i+1));
      tail_call_rms[tail_call_edge_cnt].Insert(OptoReg::Name(i+1));
      tail_jump_rms[tail_jump_edge_cnt].Insert(OptoReg::Name(i+1));
      halt_rms     [     halt_edge_cnt].Insert(OptoReg::Name(i+1));
      mproj = new MachProjNode( start, proj_cnt, ret_rms[ret_edge_cnt], Op_RegD );
      proj_cnt += 2;          // Skip 2 for doubles
    }
    else if( (i&1) == 1 &&    // Else check for high half of double
             _register_save_type[i-1] == Op_RegF &&
             _register_save_type[i  ] == Op_RegF &&
             is_save_on_entry(i-1) ) {
      ret_rms      [      ret_edge_cnt] = RegMask::Empty;
      reth_rms     [     reth_edge_cnt] = RegMask::Empty;
      tail_call_rms[tail_call_edge_cnt] = RegMask::Empty;
      tail_jump_rms[tail_jump_edge_cnt] = RegMask::Empty;
      halt_rms     [     halt_edge_cnt] = RegMask::Empty;
      mproj = C->top();
    }
    // Is this a RegI low half of a RegL?  Double up 2 adjacent RegI's
    // into a single RegL.
    else if( (i&1) == 0 &&
        _register_save_type[i  ] == Op_RegI &&
        _register_save_type[i+1] == Op_RegI &&
      is_save_on_entry(i+1) ) {
      // Add other bit for long
      ret_rms      [      ret_edge_cnt].Insert(OptoReg::Name(i+1));
      reth_rms     [     reth_edge_cnt].Insert(OptoReg::Name(i+1));
      tail_call_rms[tail_call_edge_cnt].Insert(OptoReg::Name(i+1));
      tail_jump_rms[tail_jump_edge_cnt].Insert(OptoReg::Name(i+1));
      halt_rms     [     halt_edge_cnt].Insert(OptoReg::Name(i+1));
      mproj = new MachProjNode( start, proj_cnt, ret_rms[ret_edge_cnt], Op_RegL );
      proj_cnt += 2;          // Skip 2 for longs
    }
    else if( (i&1) == 1 &&    // Else check for high half of long
             _register_save_type[i-1] == Op_RegI &&
             _register_save_type[i  ] == Op_RegI &&
             is_save_on_entry(i-1) ) {
      ret_rms      [      ret_edge_cnt] = RegMask::Empty;
      reth_rms     [     reth_edge_cnt] = RegMask::Empty;
      tail_call_rms[tail_call_edge_cnt] = RegMask::Empty;
      tail_jump_rms[tail_jump_edge_cnt] = RegMask::Empty;
      halt_rms     [     halt_edge_cnt] = RegMask::Empty;
      mproj = C->top();
    } else {
      // Make a projection for it off the Start
      mproj = new MachProjNode( start, proj_cnt++, ret_rms[ret_edge_cnt], _register_save_type[i] );
    }

    ret_edge_cnt ++;
    reth_edge_cnt ++;
    tail_call_edge_cnt ++;
    tail_jump_edge_cnt ++;
    halt_edge_cnt ++;

    // Add a use of the SOE register to all exit paths
    for( uint j=1; j < root->req(); j++ )
      root->in(j)->add_req(mproj);
  } // End of if a save-on-entry register
} // End of for all machine registers
942}

944//------------------------------init_spill_mask--------------------------------
945void Matcher::init_spill_mask( Node *ret ) {
if( idealreg2regmask[Op_RegI] ) return; // One time only init

OptoReg::c_frame_pointer = c_frame_pointer();
c_frame_ptr_mask = c_frame_pointer();
950#ifdef _LP641
// pointers are twice as big
c_frame_ptr_mask.Insert(OptoReg::add(c_frame_pointer(),1));
953#endif

// Start at OptoReg::stack0()
STACK_ONLY_mask.Clear();
OptoReg::Name init = OptoReg::stack2reg(0);
// STACK_ONLY_mask is all stack bits
OptoReg::Name i;
for (i = init; RegMask::can_represent(i); i = OptoReg::add(i,1))
  STACK_ONLY_mask.Insert(i);
// Also set the "infinite stack" bit.
STACK_ONLY_mask.set_AllStack();

for (i = OptoReg::Name(0); i < OptoReg::Name(_last_Mach_Reg); i = OptoReg::add(i, 1)) {
  // Copy the register names over into the shared world.
  // SharedInfo::regName[i] = regName[i];
  // Handy RegMasks per machine register
  mreg2regmask[i].Insert(i);

  // Set up regmasks used to exclude save-on-call (and always-save) registers from debug masks.
  if (_register_save_policy[i] == 'C' ||
      _register_save_policy[i] == 'A') {
    caller_save_regmask.Insert(i);
    mh_caller_save_regmask.Insert(i);
  }
  // Exclude save-on-entry registers from debug masks for stub compilations.
  if (_register_save_policy[i] == 'C' ||
      _register_save_policy[i] == 'A' ||
      _register_save_policy[i] == 'E') {
    caller_save_regmask_exclude_soe.Insert(i);
    mh_caller_save_regmask_exclude_soe.Insert(i);
  }
}

// Also exclude the register we use to save the SP for MethodHandle
// invokes to from the corresponding MH debug masks
const RegMask sp_save_mask = method_handle_invoke_SP_save_mask();
mh_caller_save_regmask.OR(sp_save_mask);
mh_caller_save_regmask_exclude_soe.OR(sp_save_mask);

// Grab the Frame Pointer
Node *fp  = ret->in(TypeFunc::FramePtr);
// Share frame pointer while making spill ops
set_shared(fp);

997// Get the ADLC notion of the right regmask, for each basic type.
998#ifdef _LP641
idealreg2regmask[Op_RegN] = regmask_for_ideal_register(Op_RegN, ret);
1000#endif
idealreg2regmask[Op_RegI] = regmask_for_ideal_register(Op_RegI, ret);
idealreg2regmask[Op_RegP] = regmask_for_ideal_register(Op_RegP, ret);
idealreg2regmask[Op_RegF] = regmask_for_ideal_register(Op_RegF, ret);
idealreg2regmask[Op_RegD] = regmask_for_ideal_register(Op_RegD, ret);
idealreg2regmask[Op_RegL] = regmask_for_ideal_register(Op_RegL, ret);
idealreg2regmask[Op_VecA] = regmask_for_ideal_register(Op_VecA, ret);
idealreg2regmask[Op_VecS] = regmask_for_ideal_register(Op_VecS, ret);
idealreg2regmask[Op_VecD] = regmask_for_ideal_register(Op_VecD, ret);
idealreg2regmask[Op_VecX] = regmask_for_ideal_register(Op_VecX, ret);
idealreg2regmask[Op_VecY] = regmask_for_ideal_register(Op_VecY, ret);
idealreg2regmask[Op_VecZ] = regmask_for_ideal_register(Op_VecZ, ret);
idealreg2regmask[Op_RegVectMask] = regmask_for_ideal_register(Op_RegVectMask, ret);
1013}

1015#ifdef ASSERT1
1016static void match_alias_type(Compile* C, Node* n, Node* m) {
if (!VerifyAliases)  return;  // do not go looking for trouble by default
const TypePtr* nat = n->adr_type();
const TypePtr* mat = m->adr_type();
int nidx = C->get_alias_index(nat);
int midx = C->get_alias_index(mat);
// Detune the assert for cases like (AndI 0xFF (LoadB p)).
if (nidx == Compile::AliasIdxTop && midx >= Compile::AliasIdxRaw) {
  for (uint i = 1; i < n->req(); i++) {
    Node* n1 = n->in(i);
    const TypePtr* n1at = n1->adr_type();
    if (n1at != NULL__null) {
      nat = n1at;
      nidx = C->get_alias_index(n1at);
    }
  }
}
// %%% Kludgery.  Instead, fix ideal adr_type methods for all these cases:
if (nidx == Compile::AliasIdxTop && midx == Compile::AliasIdxRaw) {
  switch (n->Opcode()) {
  case Op_PrefetchAllocation:
    nidx = Compile::AliasIdxRaw;
    nat = TypeRawPtr::BOTTOM;
    break;
  }
}
if (nidx == Compile::AliasIdxRaw && midx == Compile::AliasIdxTop) {
  switch (n->Opcode()) {
  case Op_ClearArray:
    midx = Compile::AliasIdxRaw;
    mat = TypeRawPtr::BOTTOM;
    break;
  }
}
if (nidx == Compile::AliasIdxTop && midx == Compile::AliasIdxBot) {
  switch (n->Opcode()) {
  case Op_Return:
  case Op_Rethrow:
  case Op_Halt:
  case Op_TailCall:
  case Op_TailJump:
    nidx = Compile::AliasIdxBot;
    nat = TypePtr::BOTTOM;
    break;
  }
}
if (nidx == Compile::AliasIdxBot && midx == Compile::AliasIdxTop) {
  switch (n->Opcode()) {
  case Op_StrComp:
  case Op_StrEquals:
  case Op_StrIndexOf:
  case Op_StrIndexOfChar:
  case Op_AryEq:
  case Op_HasNegatives:
  case Op_MemBarVolatile:
  case Op_MemBarCPUOrder: // %%% these ideals should have narrower adr_type?
  case Op_StrInflatedCopy:
  case Op_StrCompressedCopy:
  case Op_OnSpinWait:
  case Op_EncodeISOArray:
    nidx = Compile::AliasIdxTop;
    nat = NULL__null;
    break;
  }
}
if (nidx != midx) {
  if (PrintOpto || (PrintMiscellaneous && (WizardMode || Verbose))) {
    tty->print_cr("==== Matcher alias shift %d => %d", nidx, midx);
    n->dump();
    m->dump();
  }
  assert(C->subsume_loads() && C->must_alias(nat, midx),do { if (!(C->subsume_loads() && C->must_alias(
nat, midx))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1088, "assert(" "C->subsume_loads() && C->must_alias(nat, midx)"
 ") failed", "must not lose alias info when matching"); ::breakpoint
(); } } while (0)
         "must not lose alias info when matching")do { if (!(C->subsume_loads() && C->must_alias(
nat, midx))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1088, "assert(" "C->subsume_loads() && C->must_alias(nat, midx)"
 ") failed", "must not lose alias info when matching"); ::breakpoint
(); } } while (0);
}
1090}
1091#endif

1093//------------------------------xform------------------------------------------
1094// Given a Node in old-space, Match him (Label/Reduce) to produce a machine
1095// Node in new-space.  Given a new-space Node, recursively walk his children.
1096Node *Matcher::transform( Node *n ) { ShouldNotCallThis()do { (*g_assert_poison) = 'X';; report_should_not_call("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1096); ::breakpoint(); } while (0); return n; }
1097Node *Matcher::xform( Node *n, int max_stack ) {
// Use one stack to keep both: child's node/state and parent's node/index
MStack mstack(max_stack * 2 * 2); // usually: C->live_nodes() * 2 * 2
mstack.push(n, Visit, NULL__null, -1);  // set NULL as parent to indicate root
while (mstack.is_nonempty()) {
  C->check_node_count(NodeLimitFudgeFactor, "too many nodes matching instructions");
  if (C->failing()) return NULL__null;
  n = mstack.node();          // Leave node on stack
  Node_State nstate = mstack.state();
  if (nstate == Visit) {
    mstack.set_state(Post_Visit);
    Node *oldn = n;
    // Old-space or new-space check
    if (!C->node_arena()->contains(n)) {
      // Old space!
      Node* m;
      if (has_new_node(n)) {  // Not yet Label/Reduced
        m = new_node(n);
      } else {
        if (!is_dontcare(n)) { // Matcher can match this guy
          // Calls match special.  They match alone with no children.
          // Their children, the incoming arguments, match normally.
          m = n->is_SafePoint() ? match_sfpt(n->as_SafePoint()):match_tree(n);
          if (C->failing())  return NULL__null;
          if (m == NULL__null) { Matcher::soft_match_failure(); return NULL__null; }
          if (n->is_MemBar()) {
            m->as_MachMemBar()->set_adr_type(n->adr_type());
          }
        } else {                  // Nothing the matcher cares about
          if (n->is_Proj() && n->in(0) != NULL__null && n->in(0)->is_Multi()) {       // Projections?
            // Convert to machine-dependent projection
            m = n->in(0)->as_Multi()->match( n->as_Proj(), this );
            NOT_PRODUCT(record_new2old(m, n);)record_new2old(m, n);
            if (m->in(0) != NULL__null) // m might be top
              collect_null_checks(m, n);
          } else {                // Else just a regular 'ol guy
            m = n->clone();       // So just clone into new-space
            NOT_PRODUCT(record_new2old(m, n);)record_new2old(m, n);
            // Def-Use edges will be added incrementally as Uses
            // of this node are matched.
            assert(m->outcnt() == 0, "no Uses of this clone yet")do { if (!(m->outcnt() == 0)) { (*g_assert_poison) = 'X';;
 report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1137, "assert(" "m->outcnt() == 0" ") failed", "no Uses of this clone yet"
); ::breakpoint(); } } while (0);
          }
        }

        set_new_node(n, m);       // Map old to new
        if (_old_node_note_array != NULL__null) {
          Node_Notes* nn = C->locate_node_notes(_old_node_note_array,
                                                n->_idx);
          C->set_node_notes_at(m->_idx, nn);
        }
        debug_only(match_alias_type(C, n, m))match_alias_type(C, n, m);
      }
      n = m;    // n is now a new-space node
      mstack.set_node(n);
    }

    // New space!
    if (_visited.test_set(n->_idx)) continue; // while(mstack.is_nonempty())

    int i;
    // Put precedence edges on stack first (match them last).
    for (i = oldn->req(); (uint)i < oldn->len(); i++) {
      Node *m = oldn->in(i);
      if (m == NULL__null) break;
      // set -1 to call add_prec() instead of set_req() during Step1
      mstack.push(m, Visit, n, -1);
    }

    // Handle precedence edges for interior nodes
    for (i = n->len()-1; (uint)i >= n->req(); i--) {
      Node *m = n->in(i);
      if (m == NULL__null || C->node_arena()->contains(m)) continue;
      n->rm_prec(i);
      // set -1 to call add_prec() instead of set_req() during Step1
      mstack.push(m, Visit, n, -1);
    }

    // For constant debug info, I'd rather have unmatched constants.
    int cnt = n->req();
    JVMState* jvms = n->jvms();
    int debug_cnt = jvms ? jvms->debug_start() : cnt;

    // Now do only debug info.  Clone constants rather than matching.
    // Constants are represented directly in the debug info without
    // the need for executable machine instructions.
    // Monitor boxes are also represented directly.
    for (i = cnt - 1; i >= debug_cnt; --i) { // For all debug inputs do
      Node *m = n->in(i);          // Get input
      int op = m->Opcode();
      assert((op == Op_BoxLock) == jvms->is_monitor_use(i), "boxes only at monitor sites")do { if (!((op == Op_BoxLock) == jvms->is_monitor_use(i)))
 { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1186, "assert(" "(op == Op_BoxLock) == jvms->is_monitor_use(i)"
 ") failed", "boxes only at monitor sites"); ::breakpoint(); }
 } while (0);
      if( op == Op_ConI || op == Op_ConP || op == Op_ConN || op == Op_ConNKlass ||
          op == Op_ConF || op == Op_ConD || op == Op_ConL
          // || op == Op_BoxLock  // %%%% enable this and remove (+++) in chaitin.cpp
          ) {
        m = m->clone();
        NOT_PRODUCT(record_new2old(m, n))record_new2old(m, n);
        mstack.push(m, Post_Visit, n, i); // Don't need to visit
        mstack.push(m->in(0), Visit, m, 0);
      } else {
        mstack.push(m, Visit, n, i);
      }
    }

    // And now walk his children, and convert his inputs to new-space.
    for( ; i >= 0; --i ) { // For all normal inputs do
      Node *m = n->in(i);  // Get input
      if(m != NULL__null)
        mstack.push(m, Visit, n, i);
    }

  }
  else if (nstate == Post_Visit) {
    // Set xformed input
    Node *p = mstack.parent();
    if (p != NULL__null) { // root doesn't have parent
      int i = (int)mstack.index();
      if (i >= 0)
        p->set_req(i, n); // required input
      else if (i == -1)
        p->add_prec(n);   // precedence input
      else
        ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1218); ::breakpoint(); } while (0);
    }
    mstack.pop(); // remove processed node from stack
  }
  else {
    ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1223); ::breakpoint(); } while (0);
  }
} // while (mstack.is_nonempty())
return n; // Return new-space Node
1227}

1229//------------------------------warp_outgoing_stk_arg------------------------
1230OptoReg::Name Matcher::warp_outgoing_stk_arg( VMReg reg, OptoReg::Name begin_out_arg_area, OptoReg::Name &out_arg_limit_per_call ) {
// Convert outgoing argument location to a pre-biased stack offset
if (reg->is_stack()) {
  OptoReg::Name warped = reg->reg2stack();
  // Adjust the stack slot offset to be the register number used
  // by the allocator.
  warped = OptoReg::add(begin_out_arg_area, warped);
  // Keep track of the largest numbered stack slot used for an arg.
  // Largest used slot per call-site indicates the amount of stack
  // that is killed by the call.
  if( warped >= out_arg_limit_per_call )
    out_arg_limit_per_call = OptoReg::add(warped,1);
  if (!RegMask::can_represent_arg(warped)) {
    C->record_method_not_compilable("unsupported calling sequence");
    return OptoReg::Bad;
  }
  return warped;
}
return OptoReg::as_OptoReg(reg);
1249}


1252//------------------------------match_sfpt-------------------------------------
1253// Helper function to match call instructions.  Calls match special.
1254// They match alone with no children.  Their children, the incoming
1255// arguments, match normally.
1256MachNode *Matcher::match_sfpt( SafePointNode *sfpt ) {
MachSafePointNode *msfpt = NULL__null;
MachCallNode      *mcall = NULL__null;
uint               cnt;
// Split out case for SafePoint vs Call
CallNode *call;
const TypeTuple *domain;
ciMethod*        method = NULL__null;
bool             is_method_handle_invoke = false;  // for special kill effects
if( sfpt->is_Call() ) {
  call = sfpt->as_Call();
  domain = call->tf()->domain();
  cnt = domain->cnt();

  // Match just the call, nothing else
  MachNode *m = match_tree(call);
  if (C->failing())  return NULL__null;
  if( m == NULL__null ) { Matcher::soft_match_failure(); return NULL__null; }

  // Copy data from the Ideal SafePoint to the machine version
  mcall = m->as_MachCall();

  mcall->set_tf(                  call->tf());
  mcall->set_entry_point(         call->entry_point());
  mcall->set_cnt(                 call->cnt());
  mcall->set_guaranteed_safepoint(call->guaranteed_safepoint());

  if( mcall->is_MachCallJava() ) {
    MachCallJavaNode *mcall_java  = mcall->as_MachCallJava();
    const CallJavaNode *call_java =  call->as_CallJava();
    assert(call_java->validate_symbolic_info(), "inconsistent info")do { if (!(call_java->validate_symbolic_info())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1286, "assert(" "call_java->validate_symbolic_info()" ") failed"
, "inconsistent info"); ::breakpoint(); } } while (0);
    method = call_java->method();
    mcall_java->_method = method;
    mcall_java->_optimized_virtual = call_java->is_optimized_virtual();
    is_method_handle_invoke = call_java->is_method_handle_invoke();
    mcall_java->_method_handle_invoke = is_method_handle_invoke;
    mcall_java->_override_symbolic_info = call_java->override_symbolic_info();
    mcall_java->_arg_escape = call_java->arg_escape();
    if (is_method_handle_invoke) {
      C->set_has_method_handle_invokes(true);
    }
    if( mcall_java->is_MachCallStaticJava() )
      mcall_java->as_MachCallStaticJava()->_name =
       call_java->as_CallStaticJava()->_name;
    if( mcall_java->is_MachCallDynamicJava() )
      mcall_java->as_MachCallDynamicJava()->_vtable_index =
       call_java->as_CallDynamicJava()->_vtable_index;
  }
  else if( mcall->is_MachCallRuntime() ) {
    MachCallRuntimeNode* mach_call_rt = mcall->as_MachCallRuntime();
    mach_call_rt->_name = call->as_CallRuntime()->_name;
    mach_call_rt->_leaf_no_fp = call->is_CallLeafNoFP();
  }
  else if( mcall->is_MachCallNative() ) {
    MachCallNativeNode* mach_call_native = mcall->as_MachCallNative();
    CallNativeNode* call_native = call->as_CallNative();
    mach_call_native->_name = call_native->_name;
    mach_call_native->_arg_regs = call_native->_arg_regs;
    mach_call_native->_ret_regs = call_native->_ret_regs;
  }
  msfpt = mcall;
}
// This is a non-call safepoint
else {
  call = NULL__null;
  domain = NULL__null;
  MachNode *mn = match_tree(sfpt);
  if (C->failing())  return NULL__null;
  msfpt = mn->as_MachSafePoint();
  cnt = TypeFunc::Parms;
}
msfpt->_has_ea_local_in_scope = sfpt->has_ea_local_in_scope();

// Advertise the correct memory effects (for anti-dependence computation).
msfpt->set_adr_type(sfpt->adr_type());

// Allocate a private array of RegMasks.  These RegMasks are not shared.
msfpt->_in_rms = NEW_RESOURCE_ARRAY( RegMask, cnt )(RegMask*) resource_allocate_bytes((cnt) * sizeof(RegMask));
// Empty them all.
for (uint i = 0; i < cnt; i++) ::new (&(msfpt->_in_rms[i])) RegMask();

// Do all the pre-defined non-Empty register masks
msfpt->_in_rms[TypeFunc::ReturnAdr] = _return_addr_mask;
msfpt->_in_rms[TypeFunc::FramePtr ] = c_frame_ptr_mask;

// Place first outgoing argument can possibly be put.
OptoReg::Name begin_out_arg_area = OptoReg::add(_new_SP, C->out_preserve_stack_slots());
assert( is_even(begin_out_arg_area), "" )do { if (!(is_even(begin_out_arg_area))) { (*g_assert_poison)
 = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1343, "assert(" "is_even(begin_out_arg_area)" ") failed", ""
); ::breakpoint(); } } while (0);
// Compute max outgoing register number per call site.
OptoReg::Name out_arg_limit_per_call = begin_out_arg_area;
// Calls to C may hammer extra stack slots above and beyond any arguments.
// These are usually backing store for register arguments for varargs.
if( call != NULL__null && call->is_CallRuntime() )
  out_arg_limit_per_call = OptoReg::add(out_arg_limit_per_call,C->varargs_C_out_slots_killed());
if( call != NULL__null && call->is_CallNative() )
  out_arg_limit_per_call = OptoReg::add(out_arg_limit_per_call, call->as_CallNative()->_shadow_space_bytes);


// Do the normal argument list (parameters) register masks
int argcnt = cnt - TypeFunc::Parms;
if( argcnt > 0 ) {          // Skip it all if we have no args
  BasicType *sig_bt  = NEW_RESOURCE_ARRAY( BasicType, argcnt )(BasicType*) resource_allocate_bytes((argcnt) * sizeof(BasicType
));
  VMRegPair *parm_regs = NEW_RESOURCE_ARRAY( VMRegPair, argcnt )(VMRegPair*) resource_allocate_bytes((argcnt) * sizeof(VMRegPair
));
  int i;
  for( i = 0; i < argcnt; i++ ) {
    sig_bt[i] = domain->field_at(i+TypeFunc::Parms)->basic_type();
  }
  // V-call to pick proper calling convention
  call->calling_convention( sig_bt, parm_regs, argcnt );

1366#ifdef ASSERT1
  // Sanity check users' calling convention.  Really handy during
  // the initial porting effort.  Fairly expensive otherwise.
  { for (int i = 0; i<argcnt; i++) {
    if( !parm_regs[i].first()->is_valid() &&
        !parm_regs[i].second()->is_valid() ) continue;
    VMReg reg1 = parm_regs[i].first();
    VMReg reg2 = parm_regs[i].second();
    for (int j = 0; j < i; j++) {
      if( !parm_regs[j].first()->is_valid() &&
          !parm_regs[j].second()->is_valid() ) continue;
      VMReg reg3 = parm_regs[j].first();
      VMReg reg4 = parm_regs[j].second();
      if( !reg1->is_valid() ) {
        assert( !reg2->is_valid(), "valid halvsies" )do { if (!(!reg2->is_valid())) { (*g_assert_poison) = 'X';
; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1380, "assert(" "!reg2->is_valid()" ") failed", "valid halvsies"
); ::breakpoint(); } } while (0);
      } else if( !reg3->is_valid() ) {
        assert( !reg4->is_valid(), "valid halvsies" )do { if (!(!reg4->is_valid())) { (*g_assert_poison) = 'X';
; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1382, "assert(" "!reg4->is_valid()" ") failed", "valid halvsies"
); ::breakpoint(); } } while (0);
      } else {
        assert( reg1 != reg2, "calling conv. must produce distinct regs")do { if (!(reg1 != reg2)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1384, "assert(" "reg1 != reg2" ") failed", "calling conv. must produce distinct regs"
); ::breakpoint(); } } while (0);
        assert( reg1 != reg3, "calling conv. must produce distinct regs")do { if (!(reg1 != reg3)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1385, "assert(" "reg1 != reg3" ") failed", "calling conv. must produce distinct regs"
); ::breakpoint(); } } while (0);
        assert( reg1 != reg4, "calling conv. must produce distinct regs")do { if (!(reg1 != reg4)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1386, "assert(" "reg1 != reg4" ") failed", "calling conv. must produce distinct regs"
); ::breakpoint(); } } while (0);
        assert( reg2 != reg3, "calling conv. must produce distinct regs")do { if (!(reg2 != reg3)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1387, "assert(" "reg2 != reg3" ") failed", "calling conv. must produce distinct regs"
); ::breakpoint(); } } while (0);
        assert( reg2 != reg4 || !reg2->is_valid(), "calling conv. must produce distinct regs")do { if (!(reg2 != reg4 || !reg2->is_valid())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1388, "assert(" "reg2 != reg4 || !reg2->is_valid()" ") failed"
, "calling conv. must produce distinct regs"); ::breakpoint()
; } } while (0);
        assert( reg3 != reg4, "calling conv. must produce distinct regs")do { if (!(reg3 != reg4)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1389, "assert(" "reg3 != reg4" ") failed", "calling conv. must produce distinct regs"
); ::breakpoint(); } } while (0);
      }
    }
  }
  }
1394#endif

  // Visit each argument.  Compute its outgoing register mask.
  // Return results now can have 2 bits returned.
  // Compute max over all outgoing arguments both per call-site
  // and over the entire method.
  for( i = 0; i < argcnt; i++ ) {
    // Address of incoming argument mask to fill in
    RegMask *rm = &mcall->_in_rms[i+TypeFunc::Parms];
    VMReg first = parm_regs[i].first();
    VMReg second = parm_regs[i].second();
    if(!first->is_valid() &&
       !second->is_valid()) {
      continue;               // Avoid Halves
    }
    // Handle case where arguments are in vector registers.
    if(call->in(TypeFunc::Parms + i)->bottom_type()->isa_vect()) {
      OptoReg::Name reg_fst = OptoReg::as_OptoReg(first);
      OptoReg::Name reg_snd = OptoReg::as_OptoReg(second);
      assert (reg_fst <= reg_snd, "fst=%d snd=%d", reg_fst, reg_snd)do { if (!(reg_fst <= reg_snd)) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1413, "assert(" "reg_fst <= reg_snd" ") failed", "fst=%d snd=%d"
, reg_fst, reg_snd); ::breakpoint(); } } while (0);
      for (OptoReg::Name r = reg_fst; r <= reg_snd; r++) {
        rm->Insert(r);
      }
    }
    // Grab first register, adjust stack slots and insert in mask.
    OptoReg::Name reg1 = warp_outgoing_stk_arg(first, begin_out_arg_area, out_arg_limit_per_call );
    if (OptoReg::is_valid(reg1))
      rm->Insert( reg1 );
    // Grab second register (if any), adjust stack slots and insert in mask.
    OptoReg::Name reg2 = warp_outgoing_stk_arg(second, begin_out_arg_area, out_arg_limit_per_call );
    if (OptoReg::is_valid(reg2))
      rm->Insert( reg2 );
  } // End of for all arguments
}

// Compute the max stack slot killed by any call.  These will not be
// available for debug info, and will be used to adjust FIRST_STACK_mask
// after all call sites have been visited.
if( _out_arg_limit < out_arg_limit_per_call)
  _out_arg_limit = out_arg_limit_per_call;

if (mcall) {
  // Kill the outgoing argument area, including any non-argument holes and
  // any legacy C-killed slots.  Use Fat-Projections to do the killing.
  // Since the max-per-method covers the max-per-call-site and debug info
  // is excluded on the max-per-method basis, debug info cannot land in
  // this killed area.
  uint r_cnt = mcall->tf()->range()->cnt();
  MachProjNode *proj = new MachProjNode( mcall, r_cnt+10000, RegMask::Empty, MachProjNode::fat_proj );
  if (!RegMask::can_represent_arg(OptoReg::Name(out_arg_limit_per_call-1))) {
    C->record_method_not_compilable("unsupported outgoing calling sequence");
  } else {
    for (int i = begin_out_arg_area; i < out_arg_limit_per_call; i++)
      proj->_rout.Insert(OptoReg::Name(i));
  }
  if (proj->_rout.is_NotEmpty()) {
    push_projection(proj);
  }
}
// Transfer the safepoint information from the call to the mcall
// Move the JVMState list
msfpt->set_jvms(sfpt->jvms());
for (JVMState* jvms = msfpt->jvms(); jvms; jvms = jvms->caller()) {
  jvms->set_map(sfpt);
}

// Debug inputs begin just after the last incoming parameter
assert((mcall == NULL) || (mcall->jvms() == NULL) ||do { if (!((mcall == __null) || (mcall->jvms() == __null) ||
 (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall
->tf()->domain()->cnt()))) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1462, "assert(" "(mcall == __null) || (mcall->jvms() == __null) || (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall->tf()->domain()->cnt())"
 ") failed", ""); ::breakpoint(); } } while (0)
       (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall->tf()->domain()->cnt()), "")do { if (!((mcall == __null) || (mcall->jvms() == __null) ||
 (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall
->tf()->domain()->cnt()))) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1462, "assert(" "(mcall == __null) || (mcall->jvms() == __null) || (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall->tf()->domain()->cnt())"
 ") failed", ""); ::breakpoint(); } } while (0);

// Add additional edges.
if (msfpt->mach_constant_base_node_input() != (uint)-1 && !msfpt->is_MachCallLeaf()) {
  // For these calls we can not add MachConstantBase in expand(), as the
  // ins are not complete then.
  msfpt->ins_req(msfpt->mach_constant_base_node_input(), C->mach_constant_base_node());
  if (msfpt->jvms() &&
      msfpt->mach_constant_base_node_input() <= msfpt->jvms()->debug_start() + msfpt->_jvmadj) {
    // We added an edge before jvms, so we must adapt the position of the ins.
    msfpt->jvms()->adapt_position(+1);
  }
}

// Registers killed by the call are set in the local scheduling pass
// of Global Code Motion.
return msfpt;
1479}

1481//---------------------------match_tree----------------------------------------
1482// Match a Ideal Node DAG - turn it into a tree; Label & Reduce.  Used as part
1483// of the whole-sale conversion from Ideal to Mach Nodes.  Also used for
1484// making GotoNodes while building the CFG and in init_spill_mask() to identify
1485// a Load's result RegMask for memoization in idealreg2regmask[]
1486MachNode *Matcher::match_tree( const Node *n ) {
assert( n->Opcode() != Op_Phi, "cannot match" )do { if (!(n->Opcode() != Op_Phi)) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1487, "assert(" "n->Opcode() != Op_Phi" ") failed", "cannot match"
); ::breakpoint(); } } while (0);
assert( !n->is_block_start(), "cannot match" )do { if (!(!n->is_block_start())) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1488, "assert(" "!n->is_block_start()" ") failed", "cannot match"
); ::breakpoint(); } } while (0);
// Set the mark for all locally allocated State objects.
// When this call returns, the _states_arena arena will be reset
// freeing all State objects.
ResourceMark rm( &_states_arena );

LabelRootDepth = 0;

// StoreNodes require their Memory input to match any LoadNodes
Node *mem = n->is_Store() ? n->in(MemNode::Memory) : (Node*)1 ;
1498#ifdef ASSERT1
Node* save_mem_node = _mem_node;
_mem_node = n->is_Store() ? (Node*)n : NULL__null;
1501#endif
// State object for root node of match tree
// Allocate it on _states_arena - stack allocation can cause stack overflow.
State *s = new (&_states_arena) State;
s->_kids[0] = NULL__null;
s->_kids[1] = NULL__null;
s->_leaf = (Node*)n;
// Label the input tree, allocating labels from top-level arena
Node* root_mem = mem;
Label_Root(n, s, n->in(0), root_mem);
if (C->failing())  return NULL__null;

// The minimum cost match for the whole tree is found at the root State
uint mincost = max_juint;
uint cost = max_juint;
uint i;
for (i = 0; i < NUM_OPERANDS139; i++) {
  if (s->valid(i) &&               // valid entry and
      s->cost(i) < cost &&         // low cost and
      s->rule(i) >= NUM_OPERANDS139) {// not an operand
    mincost = i;
    cost = s->cost(i);
  }
}
if (mincost == max_juint) {
1526#ifndef PRODUCT
  tty->print("No matching rule for:");
  s->dump();
1529#endif
  Matcher::soft_match_failure();
  return NULL__null;
}
// Reduce input tree based upon the state labels to machine Nodes
MachNode *m = ReduceInst(s, s->rule(mincost), mem);
// New-to-old mapping is done in ReduceInst, to cover complex instructions.
NOT_PRODUCT(_old2new_map.map(n->_idx, m);)_old2new_map.map(n->_idx, m);

// Add any Matcher-ignored edges
uint cnt = n->req();
uint start = 1;
if( mem != (Node*)1 ) start = MemNode::Memory+1;
if( n->is_AddP() ) {
  assert( mem == (Node*)1, "" )do { if (!(mem == (Node*)1)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1543, "assert(" "mem == (Node*)1" ") failed", ""); ::breakpoint
(); } } while (0);
  start = AddPNode::Base+1;
}
for( i = start; i < cnt; i++ ) {
  if( !n->match_edge(i) ) {
    if( i < m->req() )
      m->ins_req( i, n->in(i) );
    else
      m->add_req( n->in(i) );
  }
}

debug_only( _mem_node = save_mem_node; )_mem_node = save_mem_node;
return m;
1557}


1560//------------------------------match_into_reg---------------------------------
1561// Choose to either match this Node in a register or part of the current
1562// match tree.  Return true for requiring a register and false for matching
1563// as part of the current match tree.
1564static bool match_into_reg( const Node *n, Node *m, Node *control, int i, bool shared ) {

const Type *t = m->bottom_type();

if (t->singleton()) {
  // Never force constants into registers.  Allow them to match as
  // constants or registers.  Copies of the same value will share
  // the same register.  See find_shared_node.
  return false;
} else {                      // Not a constant
  // Stop recursion if they have different Controls.
  Node* m_control = m->in(0);
  // Control of load's memory can post-dominates load's control.
  // So use it since load can't float above its memory.
  Node* mem_control = (m->is_Load()) ? m->in(MemNode::Memory)->in(0) : NULL__null;
  if (control && m_control && control != m_control && control != mem_control) {

    // Actually, we can live with the most conservative control we
    // find, if it post-dominates the others.  This allows us to
    // pick up load/op/store trees where the load can float a little
    // above the store.
    Node *x = control;
    const uint max_scan = 6;  // Arbitrary scan cutoff
    uint j;
    for (j=0; j<max_scan; j++) {
      if (x->is_Region())     // Bail out at merge points
        return true;
      x = x->in(0);
      if (x == m_control)     // Does 'control' post-dominate
        break;                // m->in(0)?  If so, we can use it
      if (x == mem_control)   // Does 'control' post-dominate
        break;                // mem_control?  If so, we can use it
    }
    if (j == max_scan)        // No post-domination before scan end?
      return true;            // Then break the match tree up
  }
  if ((m->is_DecodeN() && Matcher::narrow_oop_use_complex_address()) ||
      (m->is_DecodeNKlass() && Matcher::narrow_klass_use_complex_address())) {
    // These are commonly used in address expressions and can
    // efficiently fold into them on X64 in some cases.
    return false;
  }
}

// Not forceable cloning.  If shared, put it into a register.
return shared;
1610}


1613//------------------------------Instruction Selection--------------------------
1614// Label method walks a "tree" of nodes, using the ADLC generated DFA to match
1615// ideal nodes to machine instructions.  Trees are delimited by shared Nodes,
1616// things the Matcher does not match (e.g., Memory), and things with different
1617// Controls (hence forced into different blocks).  We pass in the Control
1618// selected for this entire State tree.

1620// The Matcher works on Trees, but an Intel add-to-memory requires a DAG: the
1621// Store and the Load must have identical Memories (as well as identical
1622// pointers).  Since the Matcher does not have anything for Memory (and
1623// does not handle DAGs), I have to match the Memory input myself.  If the
1624// Tree root is a Store or if there are multiple Loads in the tree, I require
1625// all Loads to have the identical memory.
1626Node* Matcher::Label_Root(const Node* n, State* svec, Node* control, Node*& mem) {
// Since Label_Root is a recursive function, its possible that we might run
// out of stack space.  See bugs 6272980 & 6227033 for more info.
LabelRootDepth++;
if (LabelRootDepth > MaxLabelRootDepth) {
  C->record_method_not_compilable("Out of stack space, increase MaxLabelRootDepth");
  return NULL__null;
}
uint care = 0;                // Edges matcher cares about
uint cnt = n->req();
uint i = 0;

// Examine children for memory state
// Can only subsume a child into your match-tree if that child's memory state
// is not modified along the path to another input.
// It is unsafe even if the other inputs are separate roots.
Node *input_mem = NULL__null;
for( i = 1; i < cnt; i++ ) {
  if( !n->match_edge(i) ) continue;
  Node *m = n->in(i);         // Get ith input
  assert( m, "expect non-null children" )do { if (!(m)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1646, "assert(" "m" ") failed", "expect non-null children")
; ::breakpoint(); } } while (0);
  if( m->is_Load() ) {
    if( input_mem == NULL__null ) {
      input_mem = m->in(MemNode::Memory);
      if (mem == (Node*)1) {
        // Save this memory to bail out if there's another memory access
        // to a different memory location in the same tree.
        mem = input_mem;
      }
    } else if( input_mem != m->in(MemNode::Memory) ) {
      input_mem = NodeSentinel(Node*)-1;
    }
  }
}

for( i = 1; i < cnt; i++ ){// For my children
  if( !n->match_edge(i) ) continue;
  Node *m = n->in(i);         // Get ith input
  // Allocate states out of a private arena
  State *s = new (&_states_arena) State;
  svec->_kids[care++] = s;
  assert( care <= 2, "binary only for now" )do { if (!(care <= 2)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1667, "assert(" "care <= 2" ") failed", "binary only for now"
); ::breakpoint(); } } while (0);

  // Recursively label the State tree.
  s->_kids[0] = NULL__null;
  s->_kids[1] = NULL__null;
  s->_leaf = m;

  // Check for leaves of the State Tree; things that cannot be a part of
  // the current tree.  If it finds any, that value is matched as a
  // register operand.  If not, then the normal matching is used.
  if( match_into_reg(n, m, control, i, is_shared(m)) ||
      // Stop recursion if this is a LoadNode and there is another memory access
      // to a different memory location in the same tree (for example, a StoreNode
      // at the root of this tree or another LoadNode in one of the children).
      ((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) ||
      // Can NOT include the match of a subtree when its memory state
      // is used by any of the other subtrees
      (input_mem == NodeSentinel(Node*)-1) ) {
    // Print when we exclude matching due to different memory states at input-loads
    if (PrintOpto && (Verbose && WizardMode) && (input_mem == NodeSentinel(Node*)-1)
        && !((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem)) {
      tty->print_cr("invalid input_mem");
    }
    // Switch to a register-only opcode; this value must be in a register
    // and cannot be subsumed as part of a larger instruction.
    s->DFA( m->ideal_reg(), m );

  } else {
    // If match tree has no control and we do, adopt it for entire tree
    if( control == NULL__null && m->in(0) != NULL__null && m->req() > 1 )
      control = m->in(0);         // Pick up control
    // Else match as a normal part of the match tree.
    control = Label_Root(m, s, control, mem);
    if (C->failing()) return NULL__null;
  }
}

// Call DFA to match this node, and return
svec->DFA( n->Opcode(), n );

1707#ifdef ASSERT1
uint x;
for( x = 0; x < _LAST_MACH_OPER; x++ )
  if( svec->valid(x) )
    break;

if (x >= _LAST_MACH_OPER) {
  n->dump();
  svec->dump();
  assert( false, "bad AD file" )do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1716, "assert(" "false" ") failed", "bad AD file"); ::breakpoint
(); } } while (0);
}
1718#endif
return control;
1720}


1723// Con nodes reduced using the same rule can share their MachNode
1724// which reduces the number of copies of a constant in the final
1725// program.  The register allocator is free to split uses later to
1726// split live ranges.
1727MachNode* Matcher::find_shared_node(Node* leaf, uint rule) {
if (!leaf->is_Con() && !leaf->is_DecodeNarrowPtr()) return NULL__null;

// See if this Con has already been reduced using this rule.
if (_shared_nodes.Size() <= leaf->_idx) return NULL__null;
MachNode* last = (MachNode*)_shared_nodes.at(leaf->_idx);
if (last != NULL__null && rule == last->rule()) {
  // Don't expect control change for DecodeN
  if (leaf->is_DecodeNarrowPtr())
    return last;
  // Get the new space root.
  Node* xroot = new_node(C->root());
  if (xroot == NULL__null) {
    // This shouldn't happen give the order of matching.
    return NULL__null;
  }

  // Shared constants need to have their control be root so they
  // can be scheduled properly.
  Node* control = last->in(0);
  if (control != xroot) {
    if (control == NULL__null || control == C->root()) {
      last->set_req(0, xroot);
    } else {
      assert(false, "unexpected control")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1751, "assert(" "false" ") failed", "unexpected control"); ::
breakpoint(); } } while (0);
      return NULL__null;
    }
  }
  return last;
}
return NULL__null;
1758}


1761//------------------------------ReduceInst-------------------------------------
1762// Reduce a State tree (with given Control) into a tree of MachNodes.
1763// This routine (and it's cohort ReduceOper) convert Ideal Nodes into
1764// complicated machine Nodes.  Each MachNode covers some tree of Ideal Nodes.
1765// Each MachNode has a number of complicated MachOper operands; each
1766// MachOper also covers a further tree of Ideal Nodes.

1768// The root of the Ideal match tree is always an instruction, so we enter
1769// the recursion here.  After building the MachNode, we need to recurse
1770// the tree checking for these cases:
1771// (1) Child is an instruction -
1772//     Build the instruction (recursively), add it as an edge.
1773//     Build a simple operand (register) to hold the result of the instruction.
1774// (2) Child is an interior part of an instruction -
1775//     Skip over it (do nothing)
1776// (3) Child is the start of a operand -
1777//     Build the operand, place it inside the instruction
1778//     Call ReduceOper.
1779MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) {
assert( rule >= NUM_OPERANDS, "called with operand rule" )do { if (!(rule >= 139)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1780, "assert(" "rule >= 139" ") failed", "called with operand rule"
); ::breakpoint(); } } while (0);

MachNode* shared_node = find_shared_node(s->_leaf, rule);
if (shared_node != NULL__null) {
  return shared_node;
}

// Build the object to represent this state & prepare for recursive calls
MachNode *mach = s->MachNodeGenerator(rule);
guarantee(mach != NULL, "Missing MachNode")do { if (!(mach != __null)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1789, "guarantee(" "mach != NULL" ") failed", "Missing MachNode"
); ::breakpoint(); } } while (0);
mach->_opnds[0] = s->MachOperGenerator(_reduceOp[rule]);
assert( mach->_opnds[0] != NULL, "Missing result operand" )do { if (!(mach->_opnds[0] != __null)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1791, "assert(" "mach->_opnds[0] != __null" ") failed", "Missing result operand"
); ::breakpoint(); } } while (0);
Node *leaf = s->_leaf;
NOT_PRODUCT(record_new2old(mach, leaf);)record_new2old(mach, leaf);
// Check for instruction or instruction chain rule
if( rule >= _END_INST_CHAIN_RULE || rule < _BEGIN_INST_CHAIN_RULE ) {
  assert(C->node_arena()->contains(s->_leaf) || !has_new_node(s->_leaf),do { if (!(C->node_arena()->contains(s->_leaf) || !has_new_node
(s->_leaf))) { (*g_assert_poison) = 'X';; report_vm_error(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1797, "assert(" "C->node_arena()->contains(s->_leaf) || !has_new_node(s->_leaf)"
 ") failed", "duplicating node that's already been matched");
 ::breakpoint(); } } while (0)
         "duplicating node that's already been matched")do { if (!(C->node_arena()->contains(s->_leaf) || !has_new_node
(s->_leaf))) { (*g_assert_poison) = 'X';; report_vm_error(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1797, "assert(" "C->node_arena()->contains(s->_leaf) || !has_new_node(s->_leaf)"
 ") failed", "duplicating node that's already been matched");
 ::breakpoint(); } } while (0);
  // Instruction
  mach->add_req( leaf->in(0) ); // Set initial control
  // Reduce interior of complex instruction
  ReduceInst_Interior( s, rule, mem, mach, 1 );
} else {
  // Instruction chain rules are data-dependent on their inputs
  mach->add_req(0);             // Set initial control to none
  ReduceInst_Chain_Rule( s, rule, mem, mach );
}

// If a Memory was used, insert a Memory edge
if( mem != (Node*)1 ) {
  mach->ins_req(MemNode::Memory,mem);
1811#ifdef ASSERT1
  // Verify adr type after matching memory operation
  const MachOper* oper = mach->memory_operand();
  if (oper != NULL__null && oper != (MachOper*)-1) {
    // It has a unique memory operand.  Find corresponding ideal mem node.
    Node* m = NULL__null;
    if (leaf->is_Mem()) {
      m = leaf;
    } else {
      m = _mem_node;
      assert(m != NULL && m->is_Mem(), "expecting memory node")do { if (!(m != __null && m->is_Mem())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1821, "assert(" "m != __null && m->is_Mem()" ") failed"
, "expecting memory node"); ::breakpoint(); } } while (0);
    }
    const Type* mach_at = mach->adr_type();
    // DecodeN node consumed by an address may have different type
    // than its input. Don't compare types for such case.
    if (m->adr_type() != mach_at &&
        (m->in(MemNode::Address)->is_DecodeNarrowPtr() ||
         (m->in(MemNode::Address)->is_AddP() &&
          m->in(MemNode::Address)->in(AddPNode::Address)->is_DecodeNarrowPtr()) ||
         (m->in(MemNode::Address)->is_AddP() &&
          m->in(MemNode::Address)->in(AddPNode::Address)->is_AddP() &&
          m->in(MemNode::Address)->in(AddPNode::Address)->in(AddPNode::Address)->is_DecodeNarrowPtr()))) {
      mach_at = m->adr_type();
    }
    if (m->adr_type() != mach_at) {
      m->dump();
      tty->print_cr("mach:");
      mach->dump(1);
    }
    assert(m->adr_type() == mach_at, "matcher should not change adr type")do { if (!(m->adr_type() == mach_at)) { (*g_assert_poison)
 = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1840, "assert(" "m->adr_type() == mach_at" ") failed", "matcher should not change adr type"
); ::breakpoint(); } } while (0);
  }
1842#endif
}

// If the _leaf is an AddP, insert the base edge
if (leaf->is_AddP()) {
  mach->ins_req(AddPNode::Base,leaf->in(AddPNode::Base));
}

uint number_of_projections_prior = number_of_projections();

// Perform any 1-to-many expansions required
MachNode *ex = mach->Expand(s, _projection_list, mem);
if (ex != mach) {
  assert(ex->ideal_reg() == mach->ideal_reg(), "ideal types should match")do { if (!(ex->ideal_reg() == mach->ideal_reg())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1855, "assert(" "ex->ideal_reg() == mach->ideal_reg()"
 ") failed", "ideal types should match"); ::breakpoint(); } }
 while (0);
  if( ex->in(1)->is_Con() )
    ex->in(1)->set_req(0, C->root());
  // Remove old node from the graph
  for( uint i=0; i<mach->req(); i++ ) {
    mach->set_req(i,NULL__null);
  }
  NOT_PRODUCT(record_new2old(ex, s->_leaf);)record_new2old(ex, s->_leaf);
}

// PhaseChaitin::fixup_spills will sometimes generate spill code
// via the matcher.  By the time, nodes have been wired into the CFG,
// and any further nodes generated by expand rules will be left hanging
// in space, and will not get emitted as output code.  Catch this.
// Also, catch any new register allocation constraints ("projections")
// generated belatedly during spill code generation.
if (_allocation_started) {
  guarantee(ex == mach, "no expand rules during spill generation")do { if (!(ex == mach)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1872, "guarantee(" "ex == mach" ") failed", "no expand rules during spill generation"
); ::breakpoint(); } } while (0);
  guarantee(number_of_projections_prior == number_of_projections(), "no allocation during spill generation")do { if (!(number_of_projections_prior == number_of_projections
())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1873, "guarantee(" "number_of_projections_prior == number_of_projections()"
 ") failed", "no allocation during spill generation"); ::breakpoint
(); } } while (0);
}

if (leaf->is_Con() || leaf->is_DecodeNarrowPtr()) {
  // Record the con for sharing
  _shared_nodes.map(leaf->_idx, ex);
}

// Have mach nodes inherit GC barrier data
if (leaf->is_LoadStore()) {
  mach->set_barrier_data(leaf->as_LoadStore()->barrier_data());
} else if (leaf->is_Mem()) {
  mach->set_barrier_data(leaf->as_Mem()->barrier_data());
}

return ex;
1889}

1891void Matcher::handle_precedence_edges(Node* n, MachNode *mach) {
for (uint i = n->req(); i < n->len(); i++) {
  if (n->in(i) != NULL__null) {
    mach->add_prec(n->in(i));
  }
}
1897}

1899void Matcher::ReduceInst_Chain_Rule(State* s, int rule, Node* &mem, MachNode* mach) {
// 'op' is what I am expecting to receive
int op = _leftOp[rule];
// Operand type to catch childs result
// This is what my child will give me.
unsigned int opnd_class_instance = s->rule(op);
// Choose between operand class or not.
// This is what I will receive.
int catch_op = (FIRST_OPERAND_CLASS138 <= op && op < NUM_OPERANDS139) ? opnd_class_instance : op;
// New rule for child.  Chase operand classes to get the actual rule.
unsigned int newrule = s->rule(catch_op);

if (newrule < NUM_OPERANDS139) {
  // Chain from operand or operand class, may be output of shared node
  assert(opnd_class_instance < NUM_OPERANDS, "Bad AD file: Instruction chain rule must chain from operand")do { if (!(opnd_class_instance < 139)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1913, "assert(" "opnd_class_instance < 139" ") failed", "Bad AD file: Instruction chain rule must chain from operand"
); ::breakpoint(); } } while (0);
  // Insert operand into array of operands for this instruction
  mach->_opnds[1] = s->MachOperGenerator(opnd_class_instance);

  ReduceOper(s, newrule, mem, mach);
} else {
  // Chain from the result of an instruction
  assert(newrule >= _LAST_MACH_OPER, "Do NOT chain from internal operand")do { if (!(newrule >= _LAST_MACH_OPER)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1920, "assert(" "newrule >= _LAST_MACH_OPER" ") failed",
 "Do NOT chain from internal operand"); ::breakpoint(); } } while
 (0);
  mach->_opnds[1] = s->MachOperGenerator(_reduceOp[catch_op]);
  Node *mem1 = (Node*)1;
  debug_only(Node *save_mem_node = _mem_node;)Node *save_mem_node = _mem_node;
  mach->add_req( ReduceInst(s, newrule, mem1) );
  debug_only(_mem_node = save_mem_node;)_mem_node = save_mem_node;
}
return;
1928}


1931uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
handle_precedence_edges(s->_leaf, mach);

if( s->_leaf->is_Load() ) {
  Node *mem2 = s->_leaf->in(MemNode::Memory);
  assert( mem == (Node*)1 || mem == mem2, "multiple Memories being matched at once?" )do { if (!(mem == (Node*)1 || mem == mem2)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1936, "assert(" "mem == (Node*)1 || mem == mem2" ") failed"
, "multiple Memories being matched at once?"); ::breakpoint()
; } } while (0);
  debug_only( if( mem == (Node*)1 ) _mem_node = s->_leaf;)if( mem == (Node*)1 ) _mem_node = s->_leaf;
  mem = mem2;
}
if( s->_leaf->in(0) != NULL__null && s->_leaf->req() > 1) {
  if( mach->in(0) == NULL__null )
    mach->set_req(0, s->_leaf->in(0));
}

// Now recursively walk the state tree & add operand list.
for( uint i=0; i<2; i++ ) {   // binary tree
  State *newstate = s->_kids[i];
  if( newstate == NULL__null ) break;      // Might only have 1 child
  // 'op' is what I am expecting to receive
  int op;
  if( i == 0 ) {
    op = _leftOp[rule];
  } else {
    op = _rightOp[rule];
  }
  // Operand type to catch childs result
  // This is what my child will give me.
  int opnd_class_instance = newstate->rule(op);
  // Choose between operand class or not.
  // This is what I will receive.
  int catch_op = (op >= FIRST_OPERAND_CLASS138 && op < NUM_OPERANDS139) ? opnd_class_instance : op;
  // New rule for child.  Chase operand classes to get the actual rule.
  int newrule = newstate->rule(catch_op);

  if (newrule < NUM_OPERANDS139) { // Operand/operandClass or internalOp/instruction?
    // Operand/operandClass
    // Insert operand into array of operands for this instruction
    mach->_opnds[num_opnds++] = newstate->MachOperGenerator(opnd_class_instance);
    ReduceOper(newstate, newrule, mem, mach);

  } else {                    // Child is internal operand or new instruction
    if (newrule < _LAST_MACH_OPER) { // internal operand or instruction?
      // internal operand --> call ReduceInst_Interior
      // Interior of complex instruction.  Do nothing but recurse.
      num_opnds = ReduceInst_Interior(newstate, newrule, mem, mach, num_opnds);
    } else {
      // instruction --> call build operand(  ) to catch result
      //             --> ReduceInst( newrule )
      mach->_opnds[num_opnds++] = s->MachOperGenerator(_reduceOp[catch_op]);
      Node *mem1 = (Node*)1;
      debug_only(Node *save_mem_node = _mem_node;)Node *save_mem_node = _mem_node;
      mach->add_req( ReduceInst( newstate, newrule, mem1 ) );
      debug_only(_mem_node = save_mem_node;)_mem_node = save_mem_node;
    }
  }
  assert( mach->_opnds[num_opnds-1], "" )do { if (!(mach->_opnds[num_opnds-1])) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 1986, "assert(" "mach->_opnds[num_opnds-1]" ") failed", ""
); ::breakpoint(); } } while (0);
}
return num_opnds;
1989}

1991// This routine walks the interior of possible complex operands.
1992// At each point we check our children in the match tree:
1993// (1) No children -
1994//     We are a leaf; add _leaf field as an input to the MachNode
1995// (2) Child is an internal operand -
1996//     Skip over it ( do nothing )
1997// (3) Child is an instruction -
1998//     Call ReduceInst recursively and
1999//     and instruction as an input to the MachNode
2000void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
assert( rule < _LAST_MACH_OPER, "called with operand rule" )do { if (!(rule < _LAST_MACH_OPER)) { (*g_assert_poison) =
 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2001, "assert(" "rule < _LAST_MACH_OPER" ") failed", "called with operand rule"
); ::breakpoint(); } } while (0);
State *kid = s->_kids[0];
assert( kid == NULL || s->_leaf->in(0) == NULL, "internal operands have no control" )do { if (!(kid == __null || s->_leaf->in(0) == __null))
 { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2003, "assert(" "kid == __null || s->_leaf->in(0) == __null"
 ") failed", "internal operands have no control"); ::breakpoint
(); } } while (0);

// Leaf?  And not subsumed?
if( kid == NULL__null && !_swallowed[rule] ) {
  mach->add_req( s->_leaf );  // Add leaf pointer
  return;                     // Bail out
}

if( s->_leaf->is_Load() ) {
  assert( mem == (Node*)1, "multiple Memories being matched at once?" )do { if (!(mem == (Node*)1)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2012, "assert(" "mem == (Node*)1" ") failed", "multiple Memories being matched at once?"
); ::breakpoint(); } } while (0);
  mem = s->_leaf->in(MemNode::Memory);
  debug_only(_mem_node = s->_leaf;)_mem_node = s->_leaf;
}

handle_precedence_edges(s->_leaf, mach);

if( s->_leaf->in(0) && s->_leaf->req() > 1) {
  if( !mach->in(0) )
    mach->set_req(0,s->_leaf->in(0));
  else {
    assert( s->_leaf->in(0) == mach->in(0), "same instruction, differing controls?" )do { if (!(s->_leaf->in(0) == mach->in(0))) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2023, "assert(" "s->_leaf->in(0) == mach->in(0)" ") failed"
, "same instruction, differing controls?"); ::breakpoint(); }
 } while (0);
  }
}

for (uint i = 0; kid != NULL__null && i < 2; kid = s->_kids[1], i++) {   // binary tree
  int newrule;
  if( i == 0) {
    newrule = kid->rule(_leftOp[rule]);
  } else {
    newrule = kid->rule(_rightOp[rule]);
  }

  if (newrule < _LAST_MACH_OPER) { // Operand or instruction?
    // Internal operand; recurse but do nothing else
    ReduceOper(kid, newrule, mem, mach);

  } else {                    // Child is a new instruction
    // Reduce the instruction, and add a direct pointer from this
    // machine instruction to the newly reduced one.
    Node *mem1 = (Node*)1;
    debug_only(Node *save_mem_node = _mem_node;)Node *save_mem_node = _mem_node;
    mach->add_req( ReduceInst( kid, newrule, mem1 ) );
    debug_only(_mem_node = save_mem_node;)_mem_node = save_mem_node;
  }
}
2048}


2051// -------------------------------------------------------------------------
2052// Java-Java calling convention
2053// (what you use when Java calls Java)

2055//------------------------------find_receiver----------------------------------
2056// For a given signature, return the OptoReg for parameter 0.
2057OptoReg::Name Matcher::find_receiver() {
VMRegPair regs;
BasicType sig_bt = T_OBJECT;
SharedRuntime::java_calling_convention(&sig_bt, &regs, 1);
// Return argument 0 register.  In the LP64 build pointers
// take 2 registers, but the VM wants only the 'main' name.
return OptoReg::as_OptoReg(regs.first());
2064}

2066bool Matcher::is_vshift_con_pattern(Node* n, Node* m) {
if (n != NULL__null && m != NULL__null) {
  return VectorNode::is_vector_shift(n) &&
         VectorNode::is_vector_shift_count(m) && m->in(1)->is_Con();
}
return false;
2072}

2074bool Matcher::clone_node(Node* n, Node* m, Matcher::MStack& mstack) {
// Must clone all producers of flags, or we will not match correctly.
// Suppose a compare setting int-flags is shared (e.g., a switch-tree)
// then it will match into an ideal Op_RegFlags.  Alas, the fp-flags
// are also there, so we may match a float-branch to int-flags and
// expect the allocator to haul the flags from the int-side to the
// fp-side.  No can do.
if (_must_clone[m->Opcode()]) {
  mstack.push(m, Visit);
  return true;
}
return pd_clone_node(n, m, mstack);
2086}

2088bool Matcher::clone_base_plus_offset_address(AddPNode* m, Matcher::MStack& mstack, VectorSet& address_visited) {
Node *off = m->in(AddPNode::Offset);
if (off->is_Con()) {
  address_visited.test_set(m->_idx); // Flag as address_visited
  mstack.push(m->in(AddPNode::Address), Pre_Visit);
  // Clone X+offset as it also folds into most addressing expressions
  mstack.push(off, Visit);
  mstack.push(m->in(AddPNode::Base), Pre_Visit);
  return true;
}
return false;
2099}

2101// A method-klass-holder may be passed in the inline_cache_reg
2102// and then expanded into the inline_cache_reg and a method_ptr register
2103//   defined in ad_<arch>.cpp

2105//------------------------------find_shared------------------------------------
2106// Set bits if Node is shared or otherwise a root
2107void Matcher::find_shared(Node* n) {
// Allocate stack of size C->live_nodes() * 2 to avoid frequent realloc
MStack mstack(C->live_nodes() * 2);
// Mark nodes as address_visited if they are inputs to an address expression
VectorSet address_visited;
mstack.push(n, Visit);     // Don't need to pre-visit root node
while (mstack.is_nonempty()) {
  n = mstack.node();       // Leave node on stack
  Node_State nstate = mstack.state();
  uint nop = n->Opcode();
  if (nstate == Pre_Visit) {
    if (address_visited.test(n->_idx)) { // Visited in address already?
      // Flag as visited and shared now.
      set_visited(n);
    }
    if (is_visited(n)) {   // Visited already?
      // Node is shared and has no reason to clone.  Flag it as shared.
      // This causes it to match into a register for the sharing.
      set_shared(n);       // Flag as shared and
      if (n->is_DecodeNarrowPtr()) {
        // Oop field/array element loads must be shared but since
        // they are shared through a DecodeN they may appear to have
        // a single use so force sharing here.
        set_shared(n->in(1));
      }
      mstack.pop();        // remove node from stack
      continue;
    }
    nstate = Visit; // Not already visited; so visit now
  }
  if (nstate == Visit) {
    mstack.set_state(Post_Visit);
    set_visited(n);   // Flag as visited now
    bool mem_op = false;
    int mem_addr_idx = MemNode::Address;
    if (find_shared_visit(mstack, n, nop, mem_op, mem_addr_idx)) {
      continue;
    }
    for (int i = n->req() - 1; i >= 0; --i) { // For my children
      Node* m = n->in(i); // Get ith input
      if (m == NULL__null) {
        continue;  // Ignore NULLs
      }
      if (clone_node(n, m, mstack)) {
        continue;
      }

      // Clone addressing expressions as they are "free" in memory access instructions
      if (mem_op && i == mem_addr_idx && m->is_AddP() &&
          // When there are other uses besides address expressions
          // put it on stack and mark as shared.
          !is_visited(m)) {
        // Some inputs for address expression are not put on stack
        // to avoid marking them as shared and forcing them into register
        // if they are used only in address expressions.
        // But they should be marked as shared if there are other uses
        // besides address expressions.

        if (pd_clone_address_expressions(m->as_AddP(), mstack, address_visited)) {
          continue;
        }
      }   // if( mem_op &&
      mstack.push(m, Pre_Visit);
    }     // for(int i = ...)
  }
  else if (nstate == Alt_Post_Visit) {
    mstack.pop(); // Remove node from stack
    // We cannot remove the Cmp input from the Bool here, as the Bool may be
    // shared and all users of the Bool need to move the Cmp in parallel.
    // This leaves both the Bool and the If pointing at the Cmp.  To
    // prevent the Matcher from trying to Match the Cmp along both paths
    // BoolNode::match_edge always returns a zero.

    // We reorder the Op_If in a pre-order manner, so we can visit without
    // accidentally sharing the Cmp (the Bool and the If make 2 users).
    n->add_req( n->in(1)->in(1) ); // Add the Cmp next to the Bool
  }
  else if (nstate == Post_Visit) {
    mstack.pop(); // Remove node from stack

    // Now hack a few special opcodes
    uint opcode = n->Opcode();
    bool gc_handled = BarrierSet::barrier_set()->barrier_set_c2()->matcher_find_shared_post_visit(this, n, opcode);
    if (!gc_handled) {
      find_shared_post_visit(n, opcode);
    }
  }
  else {
    ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2195); ::breakpoint(); } while (0);
  }
} // end of while (mstack.is_nonempty())
2198}

2200bool Matcher::find_shared_visit(MStack& mstack, Node* n, uint opcode, bool& mem_op, int& mem_addr_idx) {
switch(opcode) {  // Handle some opcodes special
  case Op_Phi:             // Treat Phis as shared roots
  case Op_Parm:
  case Op_Proj:            // All handled specially during matching
  case Op_SafePointScalarObject:
    set_shared(n);
    set_dontcare(n);
    break;
  case Op_If:
  case Op_CountedLoopEnd:
    mstack.set_state(Alt_Post_Visit); // Alternative way
    // Convert (If (Bool (CmpX A B))) into (If (Bool) (CmpX A B)).  Helps
    // with matching cmp/branch in 1 instruction.  The Matcher needs the
    // Bool and CmpX side-by-side, because it can only get at constants
    // that are at the leaves of Match trees, and the Bool's condition acts
    // as a constant here.
    mstack.push(n->in(1), Visit);         // Clone the Bool
    mstack.push(n->in(0), Pre_Visit);     // Visit control input
    return true; // while (mstack.is_nonempty())
  case Op_ConvI2D:         // These forms efficiently match with a prior
  case Op_ConvI2F:         //   Load but not a following Store
    if( n->in(1)->is_Load() &&        // Prior load
        n->outcnt() == 1 &&           // Not already shared
        n->unique_out()->is_Store() ) // Following store
      set_shared(n);       // Force it to be a root
    break;
  case Op_ReverseBytesI:
  case Op_ReverseBytesL:
    if( n->in(1)->is_Load() &&        // Prior load
        n->outcnt() == 1 )            // Not already shared
      set_shared(n);                  // Force it to be a root
    break;
  case Op_BoxLock:         // Cant match until we get stack-regs in ADLC
  case Op_IfFalse:
  case Op_IfTrue:
  case Op_MachProj:
  case Op_MergeMem:
  case Op_Catch:
  case Op_CatchProj:
  case Op_CProj:
  case Op_JumpProj:
  case Op_JProj:
  case Op_NeverBranch:
    set_dontcare(n);
    break;
  case Op_Jump:
    mstack.push(n->in(1), Pre_Visit);     // Switch Value (could be shared)
    mstack.push(n->in(0), Pre_Visit);     // Visit Control input
    return true;                             // while (mstack.is_nonempty())
  case Op_StrComp:
  case Op_StrEquals:
  case Op_StrIndexOf:
  case Op_StrIndexOfChar:
  case Op_AryEq:
  case Op_HasNegatives:
  case Op_StrInflatedCopy:
  case Op_StrCompressedCopy:
  case Op_EncodeISOArray:
  case Op_FmaD:
  case Op_FmaF:
  case Op_FmaVD:
  case Op_FmaVF:
  case Op_MacroLogicV:
  case Op_LoadVectorMasked:
  case Op_VectorCmpMasked:
  case Op_VectorLoadMask:
    set_shared(n); // Force result into register (it will be anyways)
    break;
  case Op_ConP: {  // Convert pointers above the centerline to NUL
    TypeNode *tn = n->as_Type(); // Constants derive from type nodes
    const TypePtr* tp = tn->type()->is_ptr();
    if (tp->_ptr == TypePtr::AnyNull) {
      tn->set_type(TypePtr::NULL_PTR);
    }
    break;
  }
  case Op_ConN: {  // Convert narrow pointers above the centerline to NUL
    TypeNode *tn = n->as_Type(); // Constants derive from type nodes
    const TypePtr* tp = tn->type()->make_ptr();
    if (tp && tp->_ptr == TypePtr::AnyNull) {
      tn->set_type(TypeNarrowOop::NULL_PTR);
    }
    break;
  }
  case Op_Binary:         // These are introduced in the Post_Visit state.
    ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2286); ::breakpoint(); } while (0);
    break;
  case Op_ClearArray:
  case Op_SafePoint:
    mem_op = true;
    break;
  default:
    if( n->is_Store() ) {
      // Do match stores, despite no ideal reg
      mem_op = true;
      break;
    }
    if( n->is_Mem() ) { // Loads and LoadStores
      mem_op = true;
      // Loads must be root of match tree due to prior load conflict
      if( C->subsume_loads() == false )
        set_shared(n);
    }
    // Fall into default case
    if( !n->ideal_reg() )
      set_dontcare(n);  // Unmatchable Nodes
} // end_switch
return false;
2309}

2311void Matcher::find_shared_post_visit(Node* n, uint opcode) {
if (n->is_predicated_vector()) {
  // Restructure into binary trees for Matching.
  if (n->req() == 4) {
    n->set_req(1, new BinaryNode(n->in(1), n->in(2)));
    n->set_req(2, n->in(3));
    n->del_req(3);
  } else if (n->req() == 5) {
    n->set_req(1, new BinaryNode(n->in(1), n->in(2)));
    n->set_req(2, new BinaryNode(n->in(3), n->in(4)));
    n->del_req(4);
    n->del_req(3);
  }
  return;
}

switch(opcode) {       // Handle some opcodes special
  case Op_StorePConditional:
  case Op_StoreIConditional:
  case Op_StoreLConditional:
  case Op_CompareAndExchangeB:
  case Op_CompareAndExchangeS:
  case Op_CompareAndExchangeI:
  case Op_CompareAndExchangeL:
  case Op_CompareAndExchangeP:
  case Op_CompareAndExchangeN:
  case Op_WeakCompareAndSwapB:
  case Op_WeakCompareAndSwapS:
  case Op_WeakCompareAndSwapI:
  case Op_WeakCompareAndSwapL:
  case Op_WeakCompareAndSwapP:
  case Op_WeakCompareAndSwapN:
  case Op_CompareAndSwapB:
  case Op_CompareAndSwapS:
  case Op_CompareAndSwapI:
  case Op_CompareAndSwapL:
  case Op_CompareAndSwapP:
  case Op_CompareAndSwapN: {   // Convert trinary to binary-tree
    Node* newval = n->in(MemNode::ValueIn);
    Node* oldval = n->in(LoadStoreConditionalNode::ExpectedIn);
    Node* pair = new BinaryNode(oldval, newval);
    n->set_req(MemNode::ValueIn, pair);
    n->del_req(LoadStoreConditionalNode::ExpectedIn);
    break;
  }
  case Op_CMoveD:              // Convert trinary to binary-tree
  case Op_CMoveF:
  case Op_CMoveI:
  case Op_CMoveL:
  case Op_CMoveN:
  case Op_CMoveP:
  case Op_CMoveVF:
  case Op_CMoveVD:  {
    // Restructure into a binary tree for Matching.  It's possible that
    // we could move this code up next to the graph reshaping for IfNodes
    // or vice-versa, but I do not want to debug this for Ladybird.
    // 10/2/2000 CNC.
    Node* pair1 = new BinaryNode(n->in(1), n->in(1)->in(1));
    n->set_req(1, pair1);
    Node* pair2 = new BinaryNode(n->in(2), n->in(3));
    n->set_req(2, pair2);
    n->del_req(3);
    break;
  }
  case Op_VectorCmpMasked: {
    Node* pair1 = new BinaryNode(n->in(2), n->in(3));
    n->set_req(2, pair1);
    n->del_req(3);
    break;
  }
  case Op_MacroLogicV: {
    Node* pair1 = new BinaryNode(n->in(1), n->in(2));
    Node* pair2 = new BinaryNode(n->in(3), n->in(4));
    n->set_req(1, pair1);
    n->set_req(2, pair2);
    n->del_req(4);
    n->del_req(3);
    break;
  }
  case Op_StoreVectorMasked: {
    Node* pair = new BinaryNode(n->in(3), n->in(4));
    n->set_req(3, pair);
    n->del_req(4);
    break;
  }
  case Op_LoopLimit: {
    Node* pair1 = new BinaryNode(n->in(1), n->in(2));
    n->set_req(1, pair1);
    n->set_req(2, n->in(3));
    n->del_req(3);
    break;
  }
  case Op_StrEquals:
  case Op_StrIndexOfChar: {
    Node* pair1 = new BinaryNode(n->in(2), n->in(3));
    n->set_req(2, pair1);
    n->set_req(3, n->in(4));
    n->del_req(4);
    break;
  }
  case Op_StrComp:
  case Op_StrIndexOf: {
    Node* pair1 = new BinaryNode(n->in(2), n->in(3));
    n->set_req(2, pair1);
    Node* pair2 = new BinaryNode(n->in(4),n->in(5));
    n->set_req(3, pair2);
    n->del_req(5);
    n->del_req(4);
    break;
  }
  case Op_StrCompressedCopy:
  case Op_StrInflatedCopy:
  case Op_EncodeISOArray: {
    // Restructure into a binary tree for Matching.
    Node* pair = new BinaryNode(n->in(3), n->in(4));
    n->set_req(3, pair);
    n->del_req(4);
    break;
  }
  case Op_FmaD:
  case Op_FmaF:
  case Op_FmaVD:
  case Op_FmaVF: {
    // Restructure into a binary tree for Matching.
    Node* pair = new BinaryNode(n->in(1), n->in(2));
    n->set_req(2, pair);
    n->set_req(1, n->in(3));
    n->del_req(3);
    break;
  }
  case Op_MulAddS2I: {
    Node* pair1 = new BinaryNode(n->in(1), n->in(2));
    Node* pair2 = new BinaryNode(n->in(3), n->in(4));
    n->set_req(1, pair1);
    n->set_req(2, pair2);
    n->del_req(4);
    n->del_req(3);
    break;
  }
  case Op_CopySignD:
  case Op_SignumF:
  case Op_SignumD: {
    Node* pair = new BinaryNode(n->in(2), n->in(3));
    n->set_req(2, pair);
    n->del_req(3);
    break;
  }
  case Op_VectorBlend:
  case Op_VectorInsert: {
    Node* pair = new BinaryNode(n->in(1), n->in(2));
    n->set_req(1, pair);
    n->set_req(2, n->in(3));
    n->del_req(3);
    break;
  }
  case Op_LoadVectorGatherMasked:
  case Op_StoreVectorScatter: {
    Node* pair = new BinaryNode(n->in(MemNode::ValueIn), n->in(MemNode::ValueIn+1));
    n->set_req(MemNode::ValueIn, pair);
    n->del_req(MemNode::ValueIn+1);
    break;
  }
  case Op_StoreVectorScatterMasked: {
    Node* pair = new BinaryNode(n->in(MemNode::ValueIn+1), n->in(MemNode::ValueIn+2));
    n->set_req(MemNode::ValueIn+1, pair);
    n->del_req(MemNode::ValueIn+2);
    pair = new BinaryNode(n->in(MemNode::ValueIn), n->in(MemNode::ValueIn+1));
    n->set_req(MemNode::ValueIn, pair);
    n->del_req(MemNode::ValueIn+1);
    break;
  }
  case Op_VectorMaskCmp: {
    n->set_req(1, new BinaryNode(n->in(1), n->in(2)));
    n->set_req(2, n->in(3));
    n->del_req(3);
    break;
  }
  default:
    break;
}
2491}

2493#ifndef PRODUCT
2494void Matcher::record_new2old(Node* newn, Node* old) {
_new2old_map.map(newn->_idx, old);
if (!_reused.test_set(old->_igv_idx)) {
  // Reuse the Ideal-level IGV identifier so that the node can be tracked
  // across matching. If there are multiple machine nodes expanded from the
  // same Ideal node, only one will reuse its IGV identifier.
  newn->_igv_idx = old->_igv_idx;
}
2502}

2504// machine-independent root to machine-dependent root
2505void Matcher::dump_old2new_map() {
_old2new_map.dump();
2507}
2508#endif // !PRODUCT

2510//---------------------------collect_null_checks-------------------------------
2511// Find null checks in the ideal graph; write a machine-specific node for
2512// it.  Used by later implicit-null-check handling.  Actually collects
2513// either an IfTrue or IfFalse for the common NOT-null path, AND the ideal
2514// value being tested.
2515void Matcher::collect_null_checks( Node *proj, Node *orig_proj ) {
Node *iff = proj->in(0);
if( iff->Opcode() == Op_If ) {
  // During matching If's have Bool & Cmp side-by-side
  BoolNode *b = iff->in(1)->as_Bool();
  Node *cmp = iff->in(2);
  int opc = cmp->Opcode();
  if (opc != Op_CmpP && opc != Op_CmpN) return;

  const Type* ct = cmp->in(2)->bottom_type();
  if (ct == TypePtr::NULL_PTR ||
      (opc == Op_CmpN && ct == TypeNarrowOop::NULL_PTR)) {

    bool push_it = false;
    if( proj->Opcode() == Op_IfTrue ) {
2530#ifndef PRODUCT
      extern int all_null_checks_found;
      all_null_checks_found++;
2533#endif
      if( b->_test._test == BoolTest::ne ) {
        push_it = true;
      }
    } else {
      assert( proj->Opcode() == Op_IfFalse, "" )do { if (!(proj->Opcode() == Op_IfFalse)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2538, "assert(" "proj->Opcode() == Op_IfFalse" ") failed"
, ""); ::breakpoint(); } } while (0);
      if( b->_test._test == BoolTest::eq ) {
        push_it = true;
      }
    }
    if( push_it ) {
      _null_check_tests.push(proj);
      Node* val = cmp->in(1);
2546#ifdef _LP641
      if (val->bottom_type()->isa_narrowoop() &&
          !Matcher::narrow_oop_use_complex_address()) {
        //
        // Look for DecodeN node which should be pinned to orig_proj.
        // On platforms (Sparc) which can not handle 2 adds
        // in addressing mode we have to keep a DecodeN node and
        // use it to do implicit NULL check in address.
        //
        // DecodeN node was pinned to non-null path (orig_proj) during
        // CastPP transformation in final_graph_reshaping_impl().
        //
        uint cnt = orig_proj->outcnt();
        for (uint i = 0; i < orig_proj->outcnt(); i++) {
          Node* d = orig_proj->raw_out(i);
          if (d->is_DecodeN() && d->in(1) == val) {
            val = d;
            val->set_req(0, NULL__null); // Unpin now.
            // Mark this as special case to distinguish from
            // a regular case: CmpP(DecodeN, NULL).
            val = (Node*)(((intptr_t)val) | 1);
            break;
          }
        }
      }
2571#endif
      _null_check_tests.push(val);
    }
  }
}
2576}

2578//---------------------------validate_null_checks------------------------------
2579// Its possible that the value being NULL checked is not the root of a match
2580// tree.  If so, I cannot use the value in an implicit null check.
2581void Matcher::validate_null_checks( ) {
uint cnt = _null_check_tests.size();
for( uint i=0; i < cnt; i+=2 ) {
  Node *test = _null_check_tests[i];
  Node *val = _null_check_tests[i+1];
  bool is_decoden = ((intptr_t)val) & 1;
  val = (Node*)(((intptr_t)val) & ~1);
  if (has_new_node(val)) {
    Node* new_val = new_node(val);
    if (is_decoden) {
      assert(val->is_DecodeNarrowPtr() && val->in(0) == NULL, "sanity")do { if (!(val->is_DecodeNarrowPtr() && val->in
(0) == __null)) { (*g_assert_poison) = 'X';; report_vm_error(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2591, "assert(" "val->is_DecodeNarrowPtr() && val->in(0) == __null"
 ") failed", "sanity"); ::breakpoint(); } } while (0);
      // Note: new_val may have a control edge if
      // the original ideal node DecodeN was matched before
      // it was unpinned in Matcher::collect_null_checks().
      // Unpin the mach node and mark it.
      new_val->set_req(0, NULL__null);
      new_val = (Node*)(((intptr_t)new_val) | 1);
    }
    // Is a match-tree root, so replace with the matched value
    _null_check_tests.map(i+1, new_val);
  } else {
    // Yank from candidate list
    _null_check_tests.map(i+1,_null_check_tests[--cnt]);
    _null_check_tests.map(i,_null_check_tests[--cnt]);
    _null_check_tests.pop();
    _null_check_tests.pop();
    i-=2;
  }
}
2610}

2612bool Matcher::gen_narrow_oop_implicit_null_checks() {
// Advice matcher to perform null checks on the narrow oop side.
// Implicit checks are not possible on the uncompressed oop side anyway
// (at least not for read accesses).
// Performs significantly better (especially on Power 6).
if (!os::zero_page_read_protected()) {
  return true;
}
return CompressedOops::use_implicit_null_checks() &&
       (narrow_oop_use_complex_address() ||
        CompressedOops::base() != NULL__null);
2623}

2625// Compute RegMask for an ideal register.
2626const RegMask* Matcher::regmask_for_ideal_register(uint ideal_reg, Node* ret) {
const Type* t = Type::mreg2type[ideal_reg];
if (t == NULL__null) {
1
Assuming 't' is not equal to NULL→
2
←
Taking false branch→
  assert(ideal_reg >= Op_VecA && ideal_reg <= Op_VecZ, "not a vector: %d", ideal_reg)do { if (!(ideal_reg >= Op_VecA && ideal_reg <=
 Op_VecZ)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2629, "assert(" "ideal_reg >= Op_VecA && ideal_reg <= Op_VecZ"
 ") failed", "not a vector: %d", ideal_reg); ::breakpoint(); }
 } while (0);
  return NULL__null; // not supported
}
Node* fp  = ret->in(TypeFunc::FramePtr);
Node* mem = ret->in(TypeFunc::Memory);
const TypePtr* atp = TypePtr::BOTTOM;
MemNode::MemOrd mo = MemNode::unordered;

Node* spill;
3
←
'spill' declared without an initial value→
switch (ideal_reg) {
4
←
Control jumps to the 'default' case at line 2654→
  case Op_RegN: spill = new LoadNNode(NULL__null, mem, fp, atp, t->is_narrowoop(), mo); break;
  case Op_RegI: spill = new LoadINode(NULL__null, mem, fp, atp, t->is_int(),       mo); break;
  case Op_RegP: spill = new LoadPNode(NULL__null, mem, fp, atp, t->is_ptr(),       mo); break;
  case Op_RegF: spill = new LoadFNode(NULL__null, mem, fp, atp, t,                 mo); break;
  case Op_RegD: spill = new LoadDNode(NULL__null, mem, fp, atp, t,                 mo); break;
  case Op_RegL: spill = new LoadLNode(NULL__null, mem, fp, atp, t->is_long(),      mo); break;

  case Op_VecA: // fall-through
  case Op_VecS: // fall-through
  case Op_VecD: // fall-through
  case Op_VecX: // fall-through
  case Op_VecY: // fall-through
  case Op_VecZ: spill = new LoadVectorNode(NULL__null, mem, fp, atp, t->is_vect()); break;
  case Op_RegVectMask: return Matcher::predicate_reg_mask();

  default: ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here(
"/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2654); ::breakpoint(); } while (0);
5
←
Loop condition is false.  Exiting loop→
}
MachNode* mspill = match_tree(spill);
6
←
1st function call argument is an uninitialized value
assert(mspill != NULL, "matching failed: %d", ideal_reg)do { if (!(mspill != __null)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2657, "assert(" "mspill != __null" ") failed", "matching failed: %d"
, ideal_reg); ::breakpoint(); } } while (0);
// Handle generic vector operand case
if (Matcher::supports_generic_vector_operands && t->isa_vect()) {
  specialize_mach_node(mspill);
}
return &mspill->out_RegMask();
2663}

2665// Process Mach IR right after selection phase is over.
2666void Matcher::do_postselect_cleanup() {
if (supports_generic_vector_operands) {
  specialize_generic_vector_operands();
  if (C->failing())  return;
}
2671}

2673//----------------------------------------------------------------------
2674// Generic machine operands elision.
2675//----------------------------------------------------------------------

2677// Compute concrete vector operand for a generic TEMP vector mach node based on its user info.
2678void Matcher::specialize_temp_node(MachTempNode* tmp, MachNode* use, uint idx) {
assert(use->in(idx) == tmp, "not a user")do { if (!(use->in(idx) == tmp)) { (*g_assert_poison) = 'X'
;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2679, "assert(" "use->in(idx) == tmp" ") failed", "not a user"
); ::breakpoint(); } } while (0);
assert(!Matcher::is_generic_vector(use->_opnds[0]), "use not processed yet")do { if (!(!Matcher::is_generic_vector(use->_opnds[0]))) {
 (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2680, "assert(" "!Matcher::is_generic_vector(use->_opnds[0])"
 ") failed", "use not processed yet"); ::breakpoint(); } } while
 (0);

if ((uint)idx == use->two_adr()) { // DEF_TEMP case
  tmp->_opnds[0] = use->_opnds[0]->clone();
} else {
  uint ideal_vreg = vector_ideal_reg(C->max_vector_size());
  tmp->_opnds[0] = Matcher::pd_specialize_generic_vector_operand(tmp->_opnds[0], ideal_vreg, true /*is_temp*/);
}
2688}

2690// Compute concrete vector operand for a generic DEF/USE vector operand (of mach node m at index idx).
2691MachOper* Matcher::specialize_vector_operand(MachNode* m, uint opnd_idx) {
assert(Matcher::is_generic_vector(m->_opnds[opnd_idx]), "repeated updates")do { if (!(Matcher::is_generic_vector(m->_opnds[opnd_idx])
)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2692, "assert(" "Matcher::is_generic_vector(m->_opnds[opnd_idx])"
 ") failed", "repeated updates"); ::breakpoint(); } } while (
0);
Node* def = NULL__null;
if (opnd_idx == 0) { // DEF
  def = m; // use mach node itself to compute vector operand type
} else {
  int base_idx = m->operand_index(opnd_idx);
  def = m->in(base_idx);
  if (def->is_Mach()) {
    if (def->is_MachTemp() && Matcher::is_generic_vector(def->as_Mach()->_opnds[0])) {
      specialize_temp_node(def->as_MachTemp(), m, base_idx); // MachTemp node use site
    } else if (is_reg2reg_move(def->as_Mach())) {
      def = def->in(1); // skip over generic reg-to-reg moves
    }
  }
}
assert(def->bottom_type()->isa_vect(), "not a vector")do { if (!(def->bottom_type()->isa_vect())) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2707, "assert(" "def->bottom_type()->isa_vect()" ") failed"
, "not a vector"); ::breakpoint(); } } while (0);
uint ideal_vreg = def->bottom_type()->ideal_reg();
return Matcher::pd_specialize_generic_vector_operand(m->_opnds[opnd_idx], ideal_vreg, false /*is_temp*/);
2710}

2712void Matcher::specialize_mach_node(MachNode* m) {
assert(!m->is_MachTemp(), "processed along with its user")do { if (!(!m->is_MachTemp())) { (*g_assert_poison) = 'X';
; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2713, "assert(" "!m->is_MachTemp()" ") failed", "processed along with its user"
); ::breakpoint(); } } while (0);
// For generic use operands pull specific register class operands from
// its def instruction's output operand (def operand).
for (uint i = 0; i < m->num_opnds(); i++) {
  if (Matcher::is_generic_vector(m->_opnds[i])) {
    m->_opnds[i] = specialize_vector_operand(m, i);
  }
}
2721}

2723// Replace generic vector operands with concrete vector operands and eliminate generic reg-to-reg moves from the graph.
2724void Matcher::specialize_generic_vector_operands() {
assert(supports_generic_vector_operands, "sanity")do { if (!(supports_generic_vector_operands)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2725, "assert(" "supports_generic_vector_operands" ") failed"
, "sanity"); ::breakpoint(); } } while (0);
ResourceMark rm;

// Replace generic vector operands (vec/legVec) with concrete ones (vec[SDXYZ]/legVec[SDXYZ])
// and remove reg-to-reg vector moves (MoveVec2Leg and MoveLeg2Vec).
Unique_Node_List live_nodes;
C->identify_useful_nodes(live_nodes);

while (live_nodes.size() > 0) {
  MachNode* m = live_nodes.pop()->isa_Mach();
  if (m != NULL__null) {
    if (Matcher::is_reg2reg_move(m)) {
      // Register allocator properly handles vec <=> leg moves using register masks.
      int opnd_idx = m->operand_index(1);
      Node* def = m->in(opnd_idx);
      m->subsume_by(def, C);
    } else if (m->is_MachTemp()) {
      // process MachTemp nodes at use site (see Matcher::specialize_vector_operand)
    } else {
      specialize_mach_node(m);
    }
  }
}
2748}

2750uint Matcher::vector_length(const Node* n) {
const TypeVect* vt = n->bottom_type()->is_vect();
return vt->length();
2753}

2755uint Matcher::vector_length(const MachNode* use, const MachOper* opnd) {
int def_idx = use->operand_index(opnd);
Node* def = use->in(def_idx);
return def->bottom_type()->is_vect()->length();
2759}

2761uint Matcher::vector_length_in_bytes(const Node* n) {
const TypeVect* vt = n->bottom_type()->is_vect();
return vt->length_in_bytes();
2764}

2766uint Matcher::vector_length_in_bytes(const MachNode* use, const MachOper* opnd) {
uint def_idx = use->operand_index(opnd);
Node* def = use->in(def_idx);
return def->bottom_type()->is_vect()->length_in_bytes();
2770}

2772BasicType Matcher::vector_element_basic_type(const Node* n) {
const TypeVect* vt = n->bottom_type()->is_vect();
return vt->element_basic_type();
2775}

2777BasicType Matcher::vector_element_basic_type(const MachNode* use, const MachOper* opnd) {
int def_idx = use->operand_index(opnd);
Node* def = use->in(def_idx);
return def->bottom_type()->is_vect()->element_basic_type();
2781}

2783#ifdef ASSERT1
2784bool Matcher::verify_after_postselect_cleanup() {
assert(!C->failing(), "sanity")do { if (!(!C->failing())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2785, "assert(" "!C->failing()" ") failed", "sanity"); ::
breakpoint(); } } while (0);
if (supports_generic_vector_operands) {
  Unique_Node_List useful;
  C->identify_useful_nodes(useful);
  for (uint i = 0; i < useful.size(); i++) {
    MachNode* m = useful.at(i)->isa_Mach();
    if (m != NULL__null) {
      assert(!Matcher::is_reg2reg_move(m), "no MoveVec nodes allowed")do { if (!(!Matcher::is_reg2reg_move(m))) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2792, "assert(" "!Matcher::is_reg2reg_move(m)" ") failed", "no MoveVec nodes allowed"
); ::breakpoint(); } } while (0);
      for (uint j = 0; j < m->num_opnds(); j++) {
        assert(!Matcher::is_generic_vector(m->_opnds[j]), "no generic vector operands allowed")do { if (!(!Matcher::is_generic_vector(m->_opnds[j]))) { (
*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2794, "assert(" "!Matcher::is_generic_vector(m->_opnds[j])"
 ") failed", "no generic vector operands allowed"); ::breakpoint
(); } } while (0);
      }
    }
  }
}
return true;
2800}
2801#endif // ASSERT

2803// Used by the DFA in dfa_xxx.cpp.  Check for a following barrier or
2804// atomic instruction acting as a store_load barrier without any
2805// intervening volatile load, and thus we don't need a barrier here.
2806// We retain the Node to act as a compiler ordering barrier.
2807bool Matcher::post_store_load_barrier(const Node* vmb) {
Compile* C = Compile::current();
assert(vmb->is_MemBar(), "")do { if (!(vmb->is_MemBar())) { (*g_assert_poison) = 'X';;
 report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2809, "assert(" "vmb->is_MemBar()" ") failed", ""); ::breakpoint
(); } } while (0);
assert(vmb->Opcode() != Op_MemBarAcquire && vmb->Opcode() != Op_LoadFence, "")do { if (!(vmb->Opcode() != Op_MemBarAcquire && vmb
->Opcode() != Op_LoadFence)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2810, "assert(" "vmb->Opcode() != Op_MemBarAcquire && vmb->Opcode() != Op_LoadFence"
 ") failed", ""); ::breakpoint(); } } while (0);
const MemBarNode* membar = vmb->as_MemBar();

// Get the Ideal Proj node, ctrl, that can be used to iterate forward
Node* ctrl = NULL__null;
for (DUIterator_Fast imax, i = membar->fast_outs(imax); i < imax; i++) {
  Node* p = membar->fast_out(i);
  assert(p->is_Proj(), "only projections here")do { if (!(p->is_Proj())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2817, "assert(" "p->is_Proj()" ") failed", "only projections here"
); ::breakpoint(); } } while (0);
  if ((p->as_Proj()->_con == TypeFunc::Control) &&
      !C->node_arena()->contains(p)) { // Unmatched old-space only
    ctrl = p;
    break;
  }
}
assert((ctrl != NULL), "missing control projection")do { if (!((ctrl != __null))) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2824, "assert(" "(ctrl != __null)" ") failed", "missing control projection"
); ::breakpoint(); } } while (0);

for (DUIterator_Fast jmax, j = ctrl->fast_outs(jmax); j < jmax; j++) {
  Node *x = ctrl->fast_out(j);
  int xop = x->Opcode();

  // We don't need current barrier if we see another or a lock
  // before seeing volatile load.
  //
  // Op_Fastunlock previously appeared in the Op_* list below.
  // With the advent of 1-0 lock operations we're no longer guaranteed
  // that a monitor exit operation contains a serializing instruction.

  if (xop == Op_MemBarVolatile ||
      xop == Op_CompareAndExchangeB ||
      xop == Op_CompareAndExchangeS ||
      xop == Op_CompareAndExchangeI ||
      xop == Op_CompareAndExchangeL ||
      xop == Op_CompareAndExchangeP ||
      xop == Op_CompareAndExchangeN ||
      xop == Op_WeakCompareAndSwapB ||
      xop == Op_WeakCompareAndSwapS ||
      xop == Op_WeakCompareAndSwapL ||
      xop == Op_WeakCompareAndSwapP ||
      xop == Op_WeakCompareAndSwapN ||
      xop == Op_WeakCompareAndSwapI ||
      xop == Op_CompareAndSwapB ||
      xop == Op_CompareAndSwapS ||
      xop == Op_CompareAndSwapL ||
      xop == Op_CompareAndSwapP ||
      xop == Op_CompareAndSwapN ||
      xop == Op_CompareAndSwapI ||
      BarrierSet::barrier_set()->barrier_set_c2()->matcher_is_store_load_barrier(x, xop)) {
    return true;
  }

  // Op_FastLock previously appeared in the Op_* list above.
  if (xop == Op_FastLock) {
    return true;
  }

  if (x->is_MemBar()) {
    // We must retain this membar if there is an upcoming volatile
    // load, which will be followed by acquire membar.
    if (xop == Op_MemBarAcquire || xop == Op_LoadFence) {
      return false;
    } else {
      // For other kinds of barriers, check by pretending we
      // are them, and seeing if we can be removed.
      return post_store_load_barrier(x->as_MemBar());
    }
  }

  // probably not necessary to check for these
  if (x->is_Call() || x->is_SafePoint() || x->is_block_proj()) {
    return false;
  }
}
return false;
2883}

2885// Check whether node n is a branch to an uncommon trap that we could
2886// optimize as test with very high branch costs in case of going to
2887// the uncommon trap. The code must be able to be recompiled to use
2888// a cheaper test.
2889bool Matcher::branches_to_uncommon_trap(const Node *n) {
// Don't do it for natives, adapters, or runtime stubs
Compile *C = Compile::current();
if (!C->is_method_compilation()) return false;

assert(n->is_If(), "You should only call this on if nodes.")do { if (!(n->is_If())) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2894, "assert(" "n->is_If()" ") failed", "You should only call this on if nodes."
); ::breakpoint(); } } while (0);
IfNode *ifn = n->as_If();

Node *ifFalse = NULL__null;
for (DUIterator_Fast imax, i = ifn->fast_outs(imax); i < imax; i++) {
  if (ifn->fast_out(i)->is_IfFalse()) {
    ifFalse = ifn->fast_out(i);
    break;
  }
}
assert(ifFalse, "An If should have an ifFalse. Graph is broken.")do { if (!(ifFalse)) { (*g_assert_poison) = 'X';; report_vm_error
("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2904, "assert(" "ifFalse" ") failed", "An If should have an ifFalse. Graph is broken."
); ::breakpoint(); } } while (0);

Node *reg = ifFalse;
int cnt = 4; // We must protect against cycles.  Limit to 4 iterations.
             // Alternatively use visited set?  Seems too expensive.
while (reg != NULL__null && cnt > 0) {
  CallNode *call = NULL__null;
  RegionNode *nxt_reg = NULL__null;
  for (DUIterator_Fast imax, i = reg->fast_outs(imax); i < imax; i++) {
    Node *o = reg->fast_out(i);
    if (o->is_Call()) {
      call = o->as_Call();
    }
    if (o->is_Region()) {
      nxt_reg = o->as_Region();
    }
  }

  if (call &&
      call->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point()) {
    const Type* trtype = call->in(TypeFunc::Parms)->bottom_type();
    if (trtype->isa_int() && trtype->is_int()->is_con()) {
      jint tr_con = trtype->is_int()->get_con();
      Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(tr_con);
      Deoptimization::DeoptAction action = Deoptimization::trap_request_action(tr_con);
      assert((int)reason < (int)BitsPerInt, "recode bit map")do { if (!((int)reason < (int)BitsPerInt)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2929, "assert(" "(int)reason < (int)BitsPerInt" ") failed"
, "recode bit map"); ::breakpoint(); } } while (0);

      if (is_set_nth_bit(C->allowed_deopt_reasons(), (int)reason)
          && action != Deoptimization::Action_none) {
        // This uncommon trap is sure to recompile, eventually.
        // When that happens, C->too_many_traps will prevent
        // this transformation from happening again.
        return true;
      }
    }
  }

  reg = nxt_reg;
  cnt--;
}

return false;
2946}

2948//=============================================================================
2949//---------------------------State---------------------------------------------
2950State::State(void) : _rule() {
2951#ifdef ASSERT1
_id = 0;
_kids[0] = _kids[1] = (State*)(intptr_t) CONST64(0xcafebabecafebabe)(0xcafebabecafebabeLL);
_leaf = (Node*)(intptr_t) CONST64(0xbaadf00dbaadf00d)(0xbaadf00dbaadf00dLL);
2955#endif
2956}

2958#ifdef ASSERT1
2959State::~State() {
_id = 99;
_kids[0] = _kids[1] = (State*)(intptr_t) CONST64(0xcafebabecafebabe)(0xcafebabecafebabeLL);
_leaf = (Node*)(intptr_t) CONST64(0xbaadf00dbaadf00d)(0xbaadf00dbaadf00dLL);
memset(_cost, -3, sizeof(_cost));
memset(_rule, -3, sizeof(_rule));
2965}
2966#endif

2968#ifndef PRODUCT
2969//---------------------------dump----------------------------------------------
2970void State::dump() {
tty->print("\n");
dump(0);
2973}

2975void State::dump(int depth) {
for (int j = 0; j < depth; j++) {
  tty->print("   ");
}
tty->print("--N: ");
_leaf->dump();
uint i;
for (i = 0; i < _LAST_MACH_OPER; i++) {
  // Check for valid entry
  if (valid(i)) {
    for (int j = 0; j < depth; j++) {
      tty->print("   ");
    }
    assert(cost(i) != max_juint, "cost must be a valid value")do { if (!(cost(i) != max_juint)) { (*g_assert_poison) = 'X';
; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2988, "assert(" "cost(i) != max_juint" ") failed", "cost must be a valid value"
); ::breakpoint(); } } while (0);
    assert(rule(i) < _last_Mach_Node, "rule[i] must be valid rule")do { if (!(rule(i) < _last_Mach_Node)) { (*g_assert_poison
) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/opto/matcher.cpp"
, 2989, "assert(" "rule(i) < _last_Mach_Node" ") failed", "rule[i] must be valid rule"
); ::breakpoint(); } } while (0);
    tty->print_cr("%s  %d  %s",
                  ruleName[i], cost(i), ruleName[rule(i)] );
  }
}
tty->cr();

for (i = 0; i < 2; i++) {
  if (_kids[i]) {
    _kids[i]->dump(depth + 1);
  }
}
3001}
3002#endif