hotspot/src/share/vm/opto/lcm.cpp
author kvn
Thu, 05 Sep 2013 11:04:39 -0700
changeset 22828 17ecb098bc1e
parent 22807 1cf02ef734e2
parent 19330 49d6711171e6
child 22838 82c7497fbad4
permissions -rw-r--r--
Merge
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
13104
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
     2
 * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
5547
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4580
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4580
diff changeset
    20
 * or visit www.oracle.com if you need additional information or have any
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 4580
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    25
#include "precompiled.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    26
#include "memory/allocation.inline.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    27
#include "opto/block.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    28
#include "opto/c2compiler.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    29
#include "opto/callnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    30
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    31
#include "opto/machnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    32
#include "opto/runtime.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    33
#ifdef TARGET_ARCH_MODEL_x86_32
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    34
# include "adfiles/ad_x86_32.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    35
#endif
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    36
#ifdef TARGET_ARCH_MODEL_x86_64
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    37
# include "adfiles/ad_x86_64.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    38
#endif
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    39
#ifdef TARGET_ARCH_MODEL_sparc
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    40
# include "adfiles/ad_sparc.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    41
#endif
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    42
#ifdef TARGET_ARCH_MODEL_zero
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    43
# include "adfiles/ad_zero.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    44
#endif
8868
1bae515b806b 7029017: Additional architecture support for c2 compiler
roland
parents: 7397
diff changeset
    45
#ifdef TARGET_ARCH_MODEL_arm
1bae515b806b 7029017: Additional architecture support for c2 compiler
roland
parents: 7397
diff changeset
    46
# include "adfiles/ad_arm.hpp"
1bae515b806b 7029017: Additional architecture support for c2 compiler
roland
parents: 7397
diff changeset
    47
#endif
22807
1cf02ef734e2 8016586: PPC64 (part 3): basic changes for PPC64
goetz
parents: 17384
diff changeset
    48
#ifdef TARGET_ARCH_MODEL_ppc_32
1cf02ef734e2 8016586: PPC64 (part 3): basic changes for PPC64
goetz
parents: 17384
diff changeset
    49
# include "adfiles/ad_ppc_32.hpp"
1cf02ef734e2 8016586: PPC64 (part 3): basic changes for PPC64
goetz
parents: 17384
diff changeset
    50
#endif
1cf02ef734e2 8016586: PPC64 (part 3): basic changes for PPC64
goetz
parents: 17384
diff changeset
    51
#ifdef TARGET_ARCH_MODEL_ppc_64
1cf02ef734e2 8016586: PPC64 (part 3): basic changes for PPC64
goetz
parents: 17384
diff changeset
    52
# include "adfiles/ad_ppc_64.hpp"
10019
6ea76c84109f 7061187: need some includes for arm/ppc
jcoomes
parents: 9179
diff changeset
    53
#endif
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6418
diff changeset
    55
// Optimization - Graph Style
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
//------------------------------implicit_null_check----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
// Detect implicit-null-check opportunities.  Basically, find NULL checks
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
// with suitable memory ops nearby.  Use the memory op to do the NULL check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
// I can generate a memory op if there is not one nearby.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
// The proj is the control projection for the not-null case.
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
    62
// The val is the pointer being checked for nullness or
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
    63
// decodeHeapOop_not_null node if it did not fold into address.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  // Assume if null check need for 0 offset then always needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  // Intel solaris doesn't support any null checks yet and no
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
  // mechanism exists (yet) to set the switches at an os_cpu level
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
  if( !ImplicitNullChecks || MacroAssembler::needs_explicit_null_check(0)) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
  // Make sure the ptr-is-null path appears to be uncommon!
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
  float f = end()->as_MachIf()->_prob;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  if( proj->Opcode() == Op_IfTrue ) f = 1.0f - f;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  if( f > PROB_UNLIKELY_MAG(4) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  uint bidx = 0;                // Capture index of value into memop
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  bool was_store;               // Memory op is a store op
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  // Get the successor block for if the test ptr is non-null
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  Block* not_null_block;  // this one goes with the proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  Block* null_block;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  if (_nodes[_nodes.size()-1] == proj) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
    null_block     = _succs[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
    not_null_block = _succs[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
    assert(_nodes[_nodes.size()-2] == proj, "proj is one or the other");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
    not_null_block = _succs[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
    null_block     = _succs[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  }
1136
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    89
  while (null_block->is_Empty() == Block::empty_with_goto) {
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    90
    null_block     = null_block->_succs[0];
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
    91
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
  // Search the exception block for an uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
  // (See Parse::do_if and Parse::do_ifnull for the reason
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
  // we need an uncommon trap.  Briefly, we need a way to
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  // detect failure of this optimization, as in 6366351.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
    bool found_trap = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
    for (uint i1 = 0; i1 < null_block->_nodes.size(); i1++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
      Node* nn = null_block->_nodes[i1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
      if (nn->is_MachCall() &&
6418
6671edbd230e 6978355: renaming for 6961697
twisti
parents: 6188
diff changeset
   102
          nn->as_MachCall()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
        const Type* trtype = nn->in(TypeFunc::Parms)->bottom_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
        if (trtype->isa_int() && trtype->is_int()->is_con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
          jint tr_con = trtype->is_int()->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
          Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(tr_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
          Deoptimization::DeoptAction action = Deoptimization::trap_request_action(tr_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
          assert((int)reason < (int)BitsPerInt, "recode bit map");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
          if (is_set_nth_bit(allowed_reasons, (int) reason)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
              && action != Deoptimization::Action_none) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
            // This uncommon trap is sure to recompile, eventually.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
            // When that happens, C->too_many_traps will prevent
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
            // this transformation from happening again.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
            found_trap = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
    if (!found_trap) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
      // We did not find an uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   126
  // Check for decodeHeapOop_not_null node which did not fold into address
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   127
  bool is_decoden = ((intptr_t)val) & 1;
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   128
  val = (Node*)(((intptr_t)val) & ~1);
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   129
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   130
  assert(!is_decoden || (val->in(0) == NULL) && val->is_Mach() &&
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   131
         (val->as_Mach()->ideal_Opcode() == Op_DecodeN), "sanity");
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   132
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
  // Search the successor block for a load or store who's base value is also
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  // the tested value.  There may be several.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  Node_List *out = new Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  MachNode *best = NULL;        // Best found so far
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
  for (DUIterator i = val->outs(); val->has_out(i); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
    Node *m = val->out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
    if( !m->is_Mach() ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
    MachNode *mach = m->as_Mach();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
    was_store = false;
6188
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   142
    int iop = mach->ideal_Opcode();
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   143
    switch( iop ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
    case Op_LoadB:
13104
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   145
    case Op_LoadUB:
2022
28ce8115a91d 6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents: 1397
diff changeset
   146
    case Op_LoadUS:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
    case Op_LoadD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
    case Op_LoadF:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
    case Op_LoadI:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
    case Op_LoadL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
    case Op_LoadP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   152
    case Op_LoadN:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
    case Op_LoadS:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
    case Op_LoadKlass:
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 372
diff changeset
   155
    case Op_LoadNKlass:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
    case Op_LoadRange:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
    case Op_LoadD_unaligned:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
    case Op_LoadL_unaligned:
4580
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   159
      assert(mach->in(2) == val, "should be address");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
    case Op_StoreB:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
    case Op_StoreC:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
    case Op_StoreCM:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
    case Op_StoreD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
    case Op_StoreF:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
    case Op_StoreI:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
    case Op_StoreL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
    case Op_StoreP:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   169
    case Op_StoreN:
13969
d2a189b83b87 7054512: Compress class pointers after perm gen removal
roland
parents: 13895
diff changeset
   170
    case Op_StoreNKlass:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
      was_store = true;         // Memory op is a store op
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
      // Stores will have their address in slot 2 (memory in slot 1).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
      // If the value being nul-checked is in another slot, it means we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
      // are storing the checked value, which does NOT check the value!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
      if( mach->in(2) != val ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
      break;                    // Found a memory op?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
    case Op_StrComp:
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2259
diff changeset
   178
    case Op_StrEquals:
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2259
diff changeset
   179
    case Op_StrIndexOf:
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   180
    case Op_AryEq:
15242
695bb216be99 6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents: 14623
diff changeset
   181
    case Op_EncodeISOArray:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
      // Not a legit memory op for implicit null check regardless of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
      // embedded loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
    default:                    // Also check for embedded loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
      if( !mach->needs_anti_dependence_check() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
        continue;               // Not an memory op; skip it
6188
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   188
      if( must_clone[iop] ) {
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   189
        // Do not move nodes which produce flags because
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   190
        // RA will try to clone it to place near branch and
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   191
        // it will cause recompilation, see clone_node().
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   192
        continue;
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
   193
      }
4580
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   194
      {
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   195
        // Check that value is used in memory address in
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   196
        // instructions with embedded load (CmpP val1,(val2+off)).
4580
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   197
        Node* base;
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   198
        Node* index;
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   199
        const MachOper* oper = mach->memory_inputs(base, index);
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   200
        if (oper == NULL || oper == (MachOper*)-1) {
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   201
          continue;             // Not an memory op; skip it
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   202
        }
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   203
        if (val == base ||
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   204
            val == index && val->bottom_type()->isa_narrowoop()) {
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   205
          break;                // Found it
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   206
        } else {
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   207
          continue;             // Skip it
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   208
        }
db05951a970c 6912517: JIT bug compiles out (and stops running) code that needs to be run. Causes NPE.
kvn
parents: 4566
diff changeset
   209
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
    // check if the offset is not too high for implicit exception
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
    {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
      intptr_t offset = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
      const TypePtr *adr_type = NULL;  // Do not need this return value here
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
      const Node* base = mach->get_base_and_disp(offset, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
      if (base == NULL || base == NodeSentinel) {
1136
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   218
        // Narrow oop address doesn't have base, only index
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   219
        if( val->bottom_type()->isa_narrowoop() &&
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   220
            MacroAssembler::needs_explicit_null_check(offset) )
9f6351874414 6746907: Improve implicit null check generation
kvn
parents: 961
diff changeset
   221
          continue;             // Give up if offset is beyond page size
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
        // cannot reason about it; is probably not implicit null exception
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
      } else {
2254
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   224
        const TypePtr* tptr;
17384
4e6ea5fa04ad 8014189: JVM crash with SEGV in ConnectionGraph::record_for_escape_analysis()
kvn
parents: 15871
diff changeset
   225
        if (UseCompressedOops && (Universe::narrow_oop_shift() == 0 ||
4e6ea5fa04ad 8014189: JVM crash with SEGV in ConnectionGraph::record_for_escape_analysis()
kvn
parents: 15871
diff changeset
   226
                                  Universe::narrow_klass_shift() == 0)) {
2254
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   227
          // 32-bits narrow oop can be the base of address expressions
17384
4e6ea5fa04ad 8014189: JVM crash with SEGV in ConnectionGraph::record_for_escape_analysis()
kvn
parents: 15871
diff changeset
   228
          tptr = base->get_ptr_type();
2254
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   229
        } else {
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   230
          // only regular oops are expected here
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   231
          tptr = base->bottom_type()->is_ptr();
f13dda645a4b 6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents: 2022
diff changeset
   232
        }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
        // Give up if offset is not a compile-time constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
        if( offset == Type::OffsetBot || tptr->_offset == Type::OffsetBot )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
        offset += tptr->_offset; // correct if base is offseted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
        if( MacroAssembler::needs_explicit_null_check(offset) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
          continue;             // Give up is reference is beyond 4K page size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
    // Check ctrl input to see if the null-check dominates the memory op
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   243
    Block *cb = cfg->get_block_for_node(mach);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
    cb = cb->_idom;             // Always hoist at least 1 block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
    if( !was_store ) {          // Stores can be hoisted only one block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
      while( cb->_dom_depth > (_dom_depth + 1))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
        cb = cb->_idom;         // Hoist loads as far as we want
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
      // The non-null-block should dominate the memory op, too. Live
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
      // range spilling will insert a spill in the non-null-block if it is
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
      // needs to spill the memory op for an implicit null check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
      if (cb->_dom_depth == (_dom_depth + 1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
        if (cb != not_null_block) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
        cb = cb->_idom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
    if( cb != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
    // Found a memory user; see if it can be hoisted to check-block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
    uint vidx = 0;              // Capture index of value into memop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
    uint j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
    for( j = mach->req()-1; j > 0; j-- ) {
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   262
      if( mach->in(j) == val ) {
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   263
        vidx = j;
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   264
        // Ignore DecodeN val which could be hoisted to where needed.
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   265
        if( is_decoden ) continue;
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   266
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
      // Block of memory-op input
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   268
      Block *inb = cfg->get_block_for_node(mach->in(j));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
      Block *b = this;          // Start from nul check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
      while( b != inb && b->_dom_depth > inb->_dom_depth )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
        b = b->_idom;           // search upwards for input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
      // See if input dominates null check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
      if( b != inb )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
    if( j > 0 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
      continue;
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   278
    Block *mb = cfg->get_block_for_node(mach);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
    // Hoisting stores requires more checks for the anti-dependence case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
    // Give up hoisting if we have to move the store past any load.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
    if( was_store ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
      Block *b = mb;            // Start searching here for a local load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
      // mach use (faulting) trying to hoist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
      // n might be blocker to hoisting
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
      while( b != this ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
        uint k;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
        for( k = 1; k < b->_nodes.size(); k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
          Node *n = b->_nodes[k];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
          if( n->needs_anti_dependence_check() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
              n->in(LoadNode::Memory) == mach->in(StoreNode::Memory) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
            break;              // Found anti-dependent load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
        if( k < b->_nodes.size() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
          break;                // Found anti-dependent load
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
        // Make sure control does not do a merge (would have to check allpaths)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
        if( b->num_preds() != 2 ) break;
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   297
        b = cfg->get_block_for_node(b->pred(1)); // Move up to predecessor block
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
      if( b != this ) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
    // Make sure this memory op is not already being used for a NullCheck
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
    Node *e = mb->end();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
    if( e->is_MachNullCheck() && e->in(1) == mach )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
      continue;                 // Already being used as a NULL check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
    // Found a candidate!  Pick one with least dom depth - the highest
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
    // in the dom tree should be closest to the null check.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   309
    if (best == NULL || cfg->get_block_for_node(mach)->_dom_depth < cfg->get_block_for_node(best)->_dom_depth) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
      best = mach;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
      bidx = vidx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
  // No candidate!
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   315
  if (best == NULL) {
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   316
    return;
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   317
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
  // ---- Found an implicit null check
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  extern int implicit_null_checks;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
  implicit_null_checks++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   323
  if( is_decoden ) {
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   324
    // Check if we need to hoist decodeHeapOop_not_null first.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   325
    Block *valb = cfg->get_block_for_node(val);
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   326
    if( this != valb && this->_dom_depth < valb->_dom_depth ) {
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   327
      // Hoist it up to the end of the test block.
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   328
      valb->find_remove(val);
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   329
      this->add_inst(val);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   330
      cfg->map_node_to_block(val, this);
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   331
      // DecodeN on x86 may kill flags. Check for flag-killing projections
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   332
      // that also need to be hoisted.
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   333
      for (DUIterator_Fast jmax, j = val->fast_outs(jmax); j < jmax; j++) {
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   334
        Node* n = val->fast_out(j);
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
   335
        if( n->is_MachProj() ) {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   336
          cfg->get_block_for_node(n)->find_remove(n);
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   337
          this->add_inst(n);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   338
          cfg->map_node_to_block(n, this);
5698
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   339
        }
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   340
      }
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   341
    }
091095915ee6 6954029: Improve implicit null check generation with compressed oops
kvn
parents: 4580
diff changeset
   342
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  // Hoist the memory candidate up to the end of the test block.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   344
  Block *old_block = cfg->get_block_for_node(best);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
  old_block->find_remove(best);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
  add_inst(best);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   347
  cfg->map_node_to_block(best, this);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
  // Move the control dependence
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  if (best->in(0) && best->in(0) == old_block->_nodes[0])
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
    best->set_req(0, _nodes[0]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
  // Check for flag-killing projections that also need to be hoisted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
  // Should be DU safe because no edge updates.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
  for (DUIterator_Fast jmax, j = best->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
    Node* n = best->fast_out(j);
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
   357
    if( n->is_MachProj() ) {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   358
      cfg->get_block_for_node(n)->find_remove(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
      add_inst(n);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   360
      cfg->map_node_to_block(n, this);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
  Compile *C = cfg->C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  // proj==Op_True --> ne test; proj==Op_False --> eq test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  // One of two graph shapes got matched:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  //   (IfTrue  (If (Bool NE (CmpP ptr NULL))))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
  //   (IfFalse (If (Bool EQ (CmpP ptr NULL))))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
  // NULL checks are always branch-if-eq.  If we see a IfTrue projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
  // then we are replacing a 'ne' test with a 'eq' NULL check test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
  // We need to flip the projections to keep the same semantics.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
  if( proj->Opcode() == Op_IfTrue ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    // Swap order of projections in basic block to swap branch targets
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
    Node *tmp1 = _nodes[end_idx()+1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
    Node *tmp2 = _nodes[end_idx()+2];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    _nodes.map(end_idx()+1, tmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
    _nodes.map(end_idx()+2, tmp1);
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 13104
diff changeset
   378
    Node *tmp = new (C) Node(C->top()); // Use not NULL input
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
    tmp1->replace_by(tmp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
    tmp2->replace_by(tmp1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
    tmp->replace_by(tmp2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
    tmp->destruct();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
  // Remove the existing null check; use a new implicit null check instead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
  // Since schedule-local needs precise def-use info, we need to correct
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
  // it as well.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
  Node *old_tst = proj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
  MachNode *nul_chk = new (C) MachNullCheckNode(old_tst->in(0),best,bidx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
  _nodes.map(end_idx(),nul_chk);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   391
  cfg->map_node_to_block(nul_chk, this);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
  // Redirect users of old_test to nul_chk
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
  for (DUIterator_Last i2min, i2 = old_tst->last_outs(i2min); i2 >= i2min; --i2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
    old_tst->last_out(i2)->set_req(0, nul_chk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
  // Clean-up any dead code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
  for (uint i3 = 0; i3 < old_tst->req(); i3++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
    old_tst->set_req(i3, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
  cfg->latency_from_uses(nul_chk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  cfg->latency_from_uses(best);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
//------------------------------select-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
// Select a nice fellow from the worklist to schedule next. If there is only
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
// one choice, then use it. Projections take top priority for correctness
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
// reasons - if I see a projection, then it is next.  There are a number of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
// other special cases, for instructions that consume condition codes, et al.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
// These are chosen immediately. Some instructions are required to immediately
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
// precede the last instruction in the block, and these are taken last. Of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
// remaining cases (most), choose the instruction with the greatest latency
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
// (that is, the most number of pseudo-cycles required to the end of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
// routine). If there is a tie, choose the instruction with the most inputs.
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   414
Node *Block::select(PhaseCFG *cfg, Node_List &worklist, GrowableArray<int> &ready_cnt, VectorSet &next_call, uint sched_slot) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  // If only a single entry on the stack, use it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  uint cnt = worklist.size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
  if (cnt == 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
    Node *n = worklist[0];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
    worklist.map(0,worklist.pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
  uint choice  = 0; // Bigger is most important
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  uint latency = 0; // Bigger is scheduled first
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
  uint score   = 0; // Bigger is better
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   427
  int idx = -1;     // Index in worklist
15871
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   428
  int cand_cnt = 0; // Candidate count
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
  for( uint i=0; i<cnt; i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
    // Order in worklist is used to break ties.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
    // See caller for how this is used to delay scheduling
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
    // of induction variable increments to after the other
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
    // uses of the phi are scheduled.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
    Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
    int iop = n->is_Mach() ? n->as_Mach()->ideal_Opcode() : 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
    if( n->is_Proj() ||         // Projections always win
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
        n->Opcode()== Op_Con || // So does constant 'Top'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
        iop == Op_CreateEx ||   // Create-exception must start block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
        iop == Op_CheckCastPP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
        ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
      worklist.map(i,worklist.pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
      return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
    // Final call in a block must be adjacent to 'catch'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
    Node *e = end();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
    if( e->is_Catch() && e->in(0)->in(0) == n )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
    // Memory op for an implicit null check has to be at the end of the block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
    if( e->is_MachNullCheck() && e->in(1) == n )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
13104
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   456
    // Schedule IV increment last.
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   457
    if (e->is_Mach() && e->as_Mach()->ideal_Opcode() == Op_CountedLoopEnd &&
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   458
        e->in(1)->in(1) == n && n->is_iteratively_computed())
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   459
      continue;
657b387034fb 7119644: Increase superword's vector size up to 256 bits
kvn
parents: 11567
diff changeset
   460
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
    uint n_choice  = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
    // See if this instruction is consumed by a branch. If so, then (as the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
    // branch is the last instruction in the basic block) force it to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
    // end of the basic block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
    if ( must_clone[iop] ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
      // See if any use is a branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
      bool found_machif = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
      for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
        Node* use = n->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
        // The use is a conditional branch, make them adjacent
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   474
        if (use->is_MachIf() && cfg->get_block_for_node(use) == this) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
          found_machif = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
        // More than this instruction pending for successor to be ready,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
        // don't choose this if other opportunities are ready
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   481
        if (ready_cnt.at(use->_idx) > 1)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
          n_choice = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
      // loop terminated, prefer not to use this instruction
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
      if (found_machif)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
    // See if this has a predecessor that is "must_clone", i.e. sets the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
    // condition code. If so, choose this first
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
    for (uint j = 0; j < n->req() ; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
      Node *inn = n->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
      if (inn) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
        if (inn->is_Mach() && must_clone[inn->as_Mach()->ideal_Opcode()] ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
          n_choice = 3;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
    // MachTemps should be scheduled last so they are near their uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
    if (n->is_MachTemp()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
      n_choice = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
19330
49d6711171e6 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 19279
diff changeset
   507
    uint n_latency = cfg->get_latency_for_node(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
    uint n_score   = n->req();   // Many inputs get high score to break ties
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
    // Keep best latency found
15871
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   511
    cand_cnt++;
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   512
    if (choice < n_choice ||
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   513
        (choice == n_choice &&
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   514
         ((StressLCM && Compile::randomized_select(cand_cnt)) ||
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   515
          (!StressLCM &&
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   516
           (latency < n_latency ||
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   517
            (latency == n_latency &&
b04dd94da4e6 8009120: Fuzz instruction scheduling in HotSpot compilers
shade
parents: 15242
diff changeset
   518
             (score < n_score))))))) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
      choice  = n_choice;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
      latency = n_latency;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
      score   = n_score;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
      idx     = i;               // Also keep index in worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  } // End of for all ready nodes in worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   526
  assert(idx >= 0, "index should be set");
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   527
  Node *n = worklist[(uint)idx];      // Get the winner
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   529
  worklist.map((uint)idx, worklist.pop());     // Compress worklist
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
//------------------------------set_next_call----------------------------------
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   535
void Block::set_next_call( Node *n, VectorSet &next_call, PhaseCFG* cfg) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  if( next_call.test_set(n->_idx) ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  for( uint i=0; i<n->len(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
    Node *m = n->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
    if( !m ) continue;  // must see all nodes in block that precede call
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   540
    if (cfg->get_block_for_node(m) == this) {
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   541
      set_next_call(m, next_call, cfg);
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   542
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
//------------------------------needed_for_next_call---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
// Set the flag 'next_call' for each Node that is needed for the next call to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
// be scheduled.  This flag lets me bias scheduling so Nodes needed for the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
// next subroutine call get priority - basically it moves things NOT needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
// for the next call till after the call.  This prevents me from trying to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
// carry lots of stuff live across a call.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   552
void Block::needed_for_next_call(Node *this_call, VectorSet &next_call, PhaseCFG* cfg) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  // Find the next control-defining Node in this block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
  Node* call = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  for (DUIterator_Fast imax, i = this_call->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
    Node* m = this_call->fast_out(i);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   557
    if(cfg->get_block_for_node(m) == this && // Local-block user
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
        m != this_call &&       // Not self-start node
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
   559
        m->is_MachCall() )
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
      call = m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
  if (call == NULL)  return;    // No next call (e.g., block end is near)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  // Set next-call for all inputs to this call
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   565
  set_next_call(call, next_call, cfg);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
11196
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   568
//------------------------------add_call_kills-------------------------------------
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   569
void Block::add_call_kills(MachProjNode *proj, RegMask& regs, const char* save_policy, bool exclude_soe) {
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   570
  // Fill in the kill mask for the call
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   571
  for( OptoReg::Name r = OptoReg::Name(0); r < _last_Mach_Reg; r=OptoReg::add(r,1) ) {
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   572
    if( !regs.Member(r) ) {     // Not already defined by the call
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   573
      // Save-on-call register?
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   574
      if ((save_policy[r] == 'C') ||
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   575
          (save_policy[r] == 'A') ||
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   576
          ((save_policy[r] == 'E') && exclude_soe)) {
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   577
        proj->_rout.Insert(r);
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   578
      }
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   579
    }
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   580
  }
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   581
}
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   582
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   583
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
//------------------------------sched_call-------------------------------------
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   585
uint Block::sched_call( Matcher &matcher, PhaseCFG* cfg, uint node_cnt, Node_List &worklist, GrowableArray<int> &ready_cnt, MachCallNode *mcall, VectorSet &next_call ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
  RegMask regs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  // Schedule all the users of the call right now.  All the users are
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
  // projection Nodes, so they must be scheduled next to the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
  // Collect all the defined registers.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
  for (DUIterator_Fast imax, i = mcall->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
    Node* n = mcall->fast_out(i);
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
   593
    assert( n->is_MachProj(), "" );
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   594
    int n_cnt = ready_cnt.at(n->_idx)-1;
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   595
    ready_cnt.at_put(n->_idx, n_cnt);
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   596
    assert( n_cnt == 0, "" );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
    // Schedule next to call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
    _nodes.map(node_cnt++, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
    // Collect defined registers
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
    regs.OR(n->out_RegMask());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
    // Check for scheduling the next control-definer
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
    if( n->bottom_type() == Type::CONTROL )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
      // Warm up next pile of heuristic bits
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   604
      needed_for_next_call(n, next_call, cfg);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
    // Children of projections are now all ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
    for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
      Node* m = n->fast_out(j); // Get user
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   609
      if(cfg->get_block_for_node(m) != this) {
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   610
        continue;
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   611
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
      if( m->is_Phi() ) continue;
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   613
      int m_cnt = ready_cnt.at(m->_idx)-1;
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   614
      ready_cnt.at_put(m->_idx, m_cnt);
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   615
      if( m_cnt == 0 )
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
        worklist.push(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
  // Act as if the call defines the Frame Pointer.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
  // Certainly the FP is alive and well after the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
  regs.Insert(matcher.c_frame_pointer());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
  // Set all registers killed and not already defined by the call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
  uint r_cnt = mcall->tf()->range()->cnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
  int op = mcall->ideal_Opcode();
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 13104
diff changeset
   628
  MachProjNode *proj = new (matcher.C) MachProjNode( mcall, r_cnt+1, RegMask::Empty, MachProjNode::fat_proj );
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   629
  cfg->map_node_to_block(proj, this);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
  _nodes.insert(node_cnt++, proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
  // Select the right register save policy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
  const char * save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
  switch (op) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
    case Op_CallRuntime:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
    case Op_CallLeaf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
    case Op_CallLeafNoFP:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
      // Calling C code so use C calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
      save_policy = matcher._c_reg_save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
    case Op_CallStaticJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
    case Op_CallDynamicJava:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
      // Calling Java code so use Java calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
      save_policy = matcher._register_save_policy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
      ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
  // When using CallRuntime mark SOE registers as killed by the call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
  // so values that could show up in the RegisterMap aren't live in a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
  // callee saved register since the register wouldn't know where to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
  // find them.  CallLeaf and CallLeafNoFP are ok because they can't
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
  // have debug info on them.  Strictly speaking this only needs to be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
  // done for oops since idealreg2debugmask takes care of debug info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
  // references but there no way to handle oops differently than other
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
  // pointers as far as the kill mask goes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
  bool exclude_soe = op == Op_CallRuntime;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
4566
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   662
  // If the call is a MethodHandle invoke, we need to exclude the
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   663
  // register which is used to save the SP value over MH invokes from
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   664
  // the mask.  Otherwise this register could be used for
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   665
  // deoptimization information.
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   666
  if (op == Op_CallStaticJava) {
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   667
    MachCallStaticJavaNode* mcallstaticjava = (MachCallStaticJavaNode*) mcall;
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   668
    if (mcallstaticjava->_method_handle_invoke)
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   669
      proj->_rout.OR(Matcher::method_handle_invoke_SP_save_mask());
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   670
  }
b363f6ef4068 6829187: compiler optimizations required for JSR 292
twisti
parents: 4470
diff changeset
   671
11196
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   672
  add_call_kills(proj, regs, save_policy, exclude_soe);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
  return node_cnt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
//------------------------------schedule_local---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
// Topological sort within a block.  Someday become a real scheduler.
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   680
bool Block::schedule_local(PhaseCFG *cfg, Matcher &matcher, GrowableArray<int> &ready_cnt, VectorSet &next_call) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
  // Already "sorted" are the block start Node (as the first entry), and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
  // the block-ending Node and any trailing control projections.  We leave
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
  // these alone.  PhiNodes and ParmNodes are made to follow the block start
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
  // Node.  Everything else gets topo-sorted.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
      tty->print_cr("# --- schedule_local B%d, before: ---", _pre_order);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
      for (uint i = 0;i < _nodes.size();i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
        tty->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
        _nodes[i]->fast_dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
      tty->print_cr("#");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
  // RootNode is already sorted
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
  if( _nodes.size() == 1 ) return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
  // Move PhiNodes and ParmNodes from 1 to cnt up to the start
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
  uint node_cnt = end_idx();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
  uint phi_cnt = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
  uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  for( i = 1; i<node_cnt; i++ ) { // Scan for Phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
    Node *n = _nodes[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
    if( n->is_Phi() ||          // Found a PhiNode or ParmNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
        (n->is_Proj()  && n->in(0) == head()) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
      // Move guy at 'phi_cnt' to the end; makes a hole at phi_cnt
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
      _nodes.map(i,_nodes[phi_cnt]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
      _nodes.map(phi_cnt++,n);  // swap Phi/Parm up front
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
    } else {                    // All others
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
      // Count block-local inputs to 'n'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
      uint cnt = n->len();      // Input count
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
      uint local = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
      for( uint j=0; j<cnt; j++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
        Node *m = n->in(j);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   717
        if( m && cfg->get_block_for_node(m) == this && !m->is_top() )
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
          local++;              // One more block-local input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
      }
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   720
      ready_cnt.at_put(n->_idx, local); // Count em up
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
9175
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   722
#ifdef ASSERT
1374
4c24294029a9 6711316: Open source the Garbage-First garbage collector
ysr
parents: 372
diff changeset
   723
      if( UseConcMarkSweepGC || UseG1GC ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
        if( n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_StoreCM ) {
9175
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   725
          // Check the precedence edges
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   726
          for (uint prec = n->req(); prec < n->len(); prec++) {
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   727
            Node* oop_store = n->in(prec);
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   728
            if (oop_store != NULL) {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   729
              assert(cfg->get_block_for_node(oop_store)->_dom_depth <= this->_dom_depth, "oop_store must dominate card-mark");
9175
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   730
            }
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   731
          }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
      }
9175
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   734
#endif
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   735
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   736
      // A few node types require changing a required edge to a precedence edge
80221fe09772 7032963: StoreCM shouldn't participate in store elimination
never
parents: 7397
diff changeset
   737
      // before allocation.
4470
1e6edcab3109 6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents: 2348
diff changeset
   738
      if( n->is_Mach() && n->req() > TypeFunc::Parms &&
1e6edcab3109 6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents: 2348
diff changeset
   739
          (n->as_Mach()->ideal_Opcode() == Op_MemBarAcquire ||
1e6edcab3109 6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents: 2348
diff changeset
   740
           n->as_Mach()->ideal_Opcode() == Op_MemBarVolatile) ) {
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   741
        // MemBarAcquire could be created without Precedent edge.
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   742
        // del_req() replaces the specified edge with the last input edge
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   743
        // and then removes the last edge. If the specified edge > number of
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   744
        // edges the last edge will be moved outside of the input edges array
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   745
        // and the edge will be lost. This is why this code should be
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 670
diff changeset
   746
        // executed only when Precedent (== TypeFunc::Parms) edge is present.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
        Node *x = n->in(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
        n->del_req(TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
        n->add_prec(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
  for(uint i2=i; i2<_nodes.size(); i2++ ) // Trailing guys get zapped count
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   754
    ready_cnt.at_put(_nodes[i2]->_idx, 0);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
  // All the prescheduled guys do not hold back internal nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
  uint i3;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
  for(i3 = 0; i3<phi_cnt; i3++ ) {  // For all pre-scheduled
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
    Node *n = _nodes[i3];       // Get pre-scheduled
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
    for (DUIterator_Fast jmax, j = n->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
      Node* m = n->fast_out(j);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   762
      if (cfg->get_block_for_node(m) == this) { // Local-block user
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   763
        int m_cnt = ready_cnt.at(m->_idx)-1;
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   764
        ready_cnt.at_put(m->_idx, m_cnt);   // Fix ready count
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   765
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
  Node_List delay;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
  // Make a worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
  Node_List worklist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
  for(uint i4=i3; i4<node_cnt; i4++ ) {    // Put ready guys on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
    Node *m = _nodes[i4];
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   774
    if( !ready_cnt.at(m->_idx) ) {   // Zero ready count?
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
      if (m->is_iteratively_computed()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
        // Push induction variable increments last to allow other uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
        // of the phi to be scheduled first. The select() method breaks
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
        // ties in scheduling by worklist order.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
        delay.push(m);
372
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   780
      } else if (m->is_Mach() && m->as_Mach()->ideal_Opcode() == Op_CreateEx) {
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   781
        // Force the CreateEx to the top of the list so it's processed
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   782
        // first and ends up at the start of the block.
b0d8a9fd3646 6601321: Assert(j == 1 || b->_nodes[j-1]->is_Phi(),"CreateEx must be first instruction in block")
never
parents: 360
diff changeset
   783
        worklist.insert(0, m);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
        worklist.push(m);         // Then on to worklist!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  while (delay.size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
    Node* d = delay.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
    worklist.push(d);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  // Warm up the 'next_call' heuristic bits
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   795
  needed_for_next_call(_nodes[0], next_call, cfg);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
      for (uint j=0; j<_nodes.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
        Node     *n = _nodes[j];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
        int     idx = n->_idx;
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   802
        tty->print("#   ready cnt:%3d  ", ready_cnt.at(idx));
19330
49d6711171e6 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 19279
diff changeset
   803
        tty->print("latency:%3d  ", cfg->get_latency_for_node(n));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
        tty->print("%4d: %s\n", idx, n->Name());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   809
  uint max_idx = (uint)ready_cnt.length();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
  // Pull from worklist and schedule
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
  while( worklist.size() ) {    // Worklist is not ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
      tty->print("#   ready list:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
      for( uint i=0; i<worklist.size(); i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
        Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
        tty->print(" %d", n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
    // Select and pop a ready guy from worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
    Node* n = select(cfg, worklist, ready_cnt, next_call, phi_cnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
    _nodes.map(phi_cnt++,n);    // Schedule him next
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
    if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
      tty->print("#    select %d: %s", n->_idx, n->Name());
19330
49d6711171e6 8023003: Cleanup the public interface to PhaseCFG
adlertz
parents: 19279
diff changeset
   831
      tty->print(", latency:%d", cfg->get_latency_for_node(n));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
      n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
      if (Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
        tty->print("#   ready list:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
        for( uint i=0; i<worklist.size(); i++ ) { // Inspect entire worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
          Node *n = worklist[i];      // Get Node on worklist
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
          tty->print(" %d", n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
        tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
    if( n->is_MachCall() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
      MachCallNode *mcall = n->as_MachCall();
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   846
      phi_cnt = sched_call(matcher, cfg, phi_cnt, worklist, ready_cnt, mcall, next_call);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
    }
11196
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   849
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   850
    if (n->is_Mach() && n->as_Mach()->has_call()) {
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   851
      RegMask regs;
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   852
      regs.Insert(matcher.c_frame_pointer());
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   853
      regs.OR(n->out_RegMask());
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   854
13895
f6dfe4123709 7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents: 13104
diff changeset
   855
      MachProjNode *proj = new (matcher.C) MachProjNode( n, 1, RegMask::Empty, MachProjNode::fat_proj );
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   856
      cfg->map_node_to_block(proj, this);
11196
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   857
      _nodes.insert(phi_cnt++, proj);
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   858
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   859
      add_call_kills(proj, regs, matcher._c_reg_save_policy, false);
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   860
    }
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   861
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
    // Children are now all ready
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
    for (DUIterator_Fast i5max, i5 = n->fast_outs(i5max); i5 < i5max; i5++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
      Node* m = n->fast_out(i5); // Get user
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   865
      if (cfg->get_block_for_node(m) != this) {
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   866
        continue;
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   867
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
      if( m->is_Phi() ) continue;
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   869
      if (m->_idx >= max_idx) { // new node, skip it
11196
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   870
        assert(m->is_MachProj() && n->is_Mach() && n->as_Mach()->has_call(), "unexpected node types");
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   871
        continue;
a310a659c580 7077312: Provide a CALL effect for instruct declaration in the ad file
roland
parents: 10255
diff changeset
   872
      }
11567
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   873
      int m_cnt = ready_cnt.at(m->_idx)-1;
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   874
      ready_cnt.at_put(m->_idx, m_cnt);
512b2c76e3b7 7116050: C2/ARM: memory stomping error with DivideMcTests
roland
parents: 11196
diff changeset
   875
      if( m_cnt == 0 )
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
        worklist.push(m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
  if( phi_cnt != end_idx() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
    // did not schedule all.  Retry, Bailout, or Die
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
    Compile* C = matcher.C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
    if (C->subsume_loads() == true && !C->failing()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
      // Retry with subsume_loads == false
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
      // If this is the first failure, the sentinel string will "stick"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
      // to the Compile object, and the C2Compiler will see it and retry.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
      C->record_failure(C2Compiler::retry_no_subsuming_loads());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
    // assert( phi_cnt == end_idx(), "did not schedule all" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
  if (cfg->trace_opto_pipelining()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
    tty->print_cr("#");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
    tty->print_cr("# after schedule_local");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
    for (uint i = 0;i < _nodes.size();i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
      tty->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
      _nodes[i]->fast_dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
    tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
//--------------------------catch_cleanup_fix_all_inputs-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
static void catch_cleanup_fix_all_inputs(Node *use, Node *old_def, Node *new_def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
  for (uint l = 0; l < use->len(); l++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
    if (use->in(l) == old_def) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
      if (l < use->req()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
        use->set_req(l, new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
        use->rm_prec(l);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
        use->add_prec(new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
        l--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
//------------------------------catch_cleanup_find_cloned_def------------------
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   925
static Node *catch_cleanup_find_cloned_def(Block *use_blk, Node *def, Block *def_blk, PhaseCFG* cfg, int n_clone_idx) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
  assert( use_blk != def_blk, "Inter-block cleanup only");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
  // The use is some block below the Catch.  Find and return the clone of the def
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
  // that dominates the use. If there is no clone in a dominating block, then
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
  // create a phi for the def in a dominating block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
  // Find which successor block dominates this use.  The successor
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
  // blocks must all be single-entry (from the Catch only; I will have
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
  // split blocks to make this so), hence they all dominate.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
  while( use_blk->_dom_depth > def_blk->_dom_depth+1 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
    use_blk = use_blk->_idom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
  // Find the successor
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
  Node *fixup = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
  uint j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
  for( j = 0; j < def_blk->_num_succs; j++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
    if( use_blk == def_blk->_succs[j] )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
  if( j == def_blk->_num_succs ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
    // Block at same level in dom-tree is not a successor.  It needs a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
    // PhiNode, the PhiNode uses from the def and IT's uses need fixup.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
    Node_Array inputs = new Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
    for(uint k = 1; k < use_blk->num_preds(); k++) {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   951
      Block* block = cfg->get_block_for_node(use_blk->pred(k));
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   952
      inputs.map(k, catch_cleanup_find_cloned_def(block, def, def_blk, cfg, n_clone_idx));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
    // Check to see if the use_blk already has an identical phi inserted.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
    // If it exists, it will be at the first position since all uses of a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
    // def are processed together.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
    Node *phi = use_blk->_nodes[1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
    if( phi->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
      fixup = phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
      for (uint k = 1; k < use_blk->num_preds(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
        if (phi->in(k) != inputs[k]) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
          // Not a match
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
          fixup = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
    // If an existing PhiNode was not found, make a new one.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
    if (fixup == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
      Node *new_phi = PhiNode::make(use_blk->head(), def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
      use_blk->_nodes.insert(1, new_phi);
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
   974
      cfg->map_node_to_block(new_phi, use_blk);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
      for (uint k = 1; k < use_blk->num_preds(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
        new_phi->set_req(k, inputs[k]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
      fixup = new_phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
    // Found the use just below the Catch.  Make it use the clone.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
    fixup = use_blk->_nodes[n_clone_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
  return fixup;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
//--------------------------catch_cleanup_intra_block--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
// Fix all input edges in use that reference "def".  The use is in the same
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
// block as the def and both have been cloned in each successor block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
static void catch_cleanup_intra_block(Node *use, Node *def, Block *blk, int beg, int n_clone_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
  // Both the use and def have been cloned. For each successor block,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
  // get the clone of the use, and make its input the clone of the def
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
  // found in that block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
  uint use_idx = blk->find_node(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
  uint offset_idx = use_idx - beg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
  for( uint k = 0; k < blk->_num_succs; k++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
    // Get clone in each successor block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
    Block *sb = blk->_succs[k];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
    Node *clone = sb->_nodes[offset_idx+1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
    assert( clone->Opcode() == use->Opcode(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
    // Make use-clone reference the def-clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
    catch_cleanup_fix_all_inputs(clone, def, sb->_nodes[n_clone_idx]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
//------------------------------catch_cleanup_inter_block---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
// Fix all input edges in use that reference "def".  The use is in a different
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
// block than the def.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1014
static void catch_cleanup_inter_block(Node *use, Block *use_blk, Node *def, Block *def_blk, PhaseCFG* cfg, int n_clone_idx) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  if( !use_blk ) return;        // Can happen if the use is a precedence edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1017
  Node *new_def = catch_cleanup_find_cloned_def(use_blk, def, def_blk, cfg, n_clone_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
  catch_cleanup_fix_all_inputs(use, def, new_def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
//------------------------------call_catch_cleanup-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
// If we inserted any instructions between a Call and his CatchNode,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
// clone the instructions on all paths below the Catch.
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1024
void Block::call_catch_cleanup(PhaseCFG* cfg, Compile* C) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  // End of region to clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  uint end = end_idx();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
  if( !_nodes[end]->is_Catch() ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
  // Start of region to clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
  uint beg = end;
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
  1031
  while(!_nodes[beg-1]->is_MachProj() ||
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 10019
diff changeset
  1032
        !_nodes[beg-1]->in(0)->is_MachCall() ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
    beg--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
    assert(beg > 0,"Catch cleanup walking beyond block boundary");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
  // Range of inserted instructions is [beg, end)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
  if( beg == end ) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  // Clone along all Catch output paths.  Clone area between the 'beg' and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  // 'end' indices.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
  for( uint i = 0; i < _num_succs; i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
    Block *sb = _succs[i];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
    // Clone the entire area; ignoring the edge fixup for now.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
    for( uint j = end; j > beg; j-- ) {
6188
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
  1045
      // It is safe here to clone a node with anti_dependence
95ea4d66089a 6973329: C2 with Zero based COOP produces code with broken anti-dependency on x86
kvn
parents: 6180
diff changeset
  1046
      // since clones dominate on each path.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
      Node *clone = _nodes[j-1]->clone();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
      sb->_nodes.insert( 1, clone );
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1049
      cfg->map_node_to_block(clone, sb);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
  // Fixup edges.  Check the def-use info per cloned Node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
  for(uint i2 = beg; i2 < end; i2++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
    uint n_clone_idx = i2-beg+1; // Index of clone of n in each successor block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
    Node *n = _nodes[i2];        // Node that got cloned
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
    // Need DU safe iterator because of edge manipulation in calls.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
    Unique_Node_List *out = new Unique_Node_List(Thread::current()->resource_area());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
    for (DUIterator_Fast j1max, j1 = n->fast_outs(j1max); j1 < j1max; j1++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
      out->push(n->fast_out(j1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
    uint max = out->size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
    for (uint j = 0; j < max; j++) {// For all users
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
      Node *use = out->pop();
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1066
      Block *buse = cfg->get_block_for_node(use);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
      if( use->is_Phi() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
        for( uint k = 1; k < use->req(); k++ )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
          if( use->in(k) == n ) {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1070
            Block* block = cfg->get_block_for_node(buse->pred(k));
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1071
            Node *fixup = catch_cleanup_find_cloned_def(block, n, this, cfg, n_clone_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
            use->set_req(k, fixup);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
        if (this == buse) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
          catch_cleanup_intra_block(use, n, this, beg, n_clone_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
        } else {
19279
4be3c2e6663c 8022284: Hide internal data structure in PhaseCFG
adlertz
parents: 17384
diff changeset
  1078
          catch_cleanup_inter_block(use, buse, n, this, cfg, n_clone_idx);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
    } // End for all users
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
  } // End of for all Nodes in cloned area
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
  // Remove the now-dead cloned ops
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
  for(uint i3 = beg; i3 < end; i3++ ) {
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 13969
diff changeset
  1087
    _nodes[beg]->disconnect_inputs(NULL, C);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
    _nodes.remove(beg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
  // If the successor blocks have a CreateEx node, move it back to the top
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
  for(uint i4 = 0; i4 < _num_succs; i4++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
    Block *sb = _succs[i4];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
    uint new_cnt = end - beg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
    // Remove any newly created, but dead, nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
    for( uint j = new_cnt; j > 0; j-- ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
      Node *n = sb->_nodes[j];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
      if (n->outcnt() == 0 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
          (!n->is_Proj() || n->as_Proj()->in(0)->outcnt() == 1) ){
14623
70c4c1be0a14 7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents: 13969
diff changeset
  1100
        n->disconnect_inputs(NULL, C);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
        sb->_nodes.remove(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
        new_cnt--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
    // If any newly created nodes remain, move the CreateEx node to the top
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
    if (new_cnt > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
      Node *cex = sb->_nodes[1+new_cnt];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
      if( cex->is_Mach() && cex->as_Mach()->ideal_Opcode() == Op_CreateEx ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
        sb->_nodes.remove(1+new_cnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
        sb->_nodes.insert(1,cex);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
}