hotspot/src/share/vm/opto/idealKit.cpp
author xdono
Wed, 02 Jul 2008 12:55:16 -0700
changeset 670 ddf3e9583f2f
parent 360 21d113ecbf6a
child 3268 f034e0c86895
permissions -rw-r--r--
6719955: Update copyright year Summary: Update copyright year for files that have been modified in 2008 Reviewed-by: ohair, tbell
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
670
ddf3e9583f2f 6719955: Update copyright year
xdono
parents: 360
diff changeset
     2
 * Copyright 2005-2008 Sun Microsystems, Inc.  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
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
#include "incls/_idealKit.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
// Static initialization
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
// This declares the position where vars are kept in the cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
// For some degree of consistency we use the TypeFunc enum to
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
// soak up spots in the inputs even though we only use early Control
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
// and Memory slots. (So far.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
const uint IdealKit::first_var = TypeFunc::Parms + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
//----------------------------IdealKit-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
IdealKit::IdealKit(PhaseGVN &gvn, Node* control, Node* mem, bool delay_all_transforms) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
  _gvn(gvn), C(gvn.C) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
  _initial_ctrl = control;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  _initial_memory = mem;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
  _delay_all_transforms = delay_all_transforms;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
  _var_ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
  _cvstate = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  // We can go memory state free or else we need the entire memory state
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  assert(mem == NULL || mem->Opcode() == Op_MergeMem, "memory must be pre-split");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
  int init_size = 5;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  _pending_cvstates = new (C->node_arena()) GrowableArray<Node*>(C->node_arena(), init_size, 0, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  _delay_transform  = new (C->node_arena()) GrowableArray<Node*>(C->node_arena(), init_size, 0, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  DEBUG_ONLY(_state = new (C->node_arena()) GrowableArray<int>(C->node_arena(), init_size, 0, 0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
//-------------------------------if_then-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
// Create:  if(left relop right)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
//          /  \
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
//   iffalse    iftrue
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
// Push the iffalse cvstate onto the stack. The iftrue becomes the current cvstate.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
void IdealKit::if_then(Node* left, BoolTest::mask relop,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
                       Node* right, float prob, float cnt, bool push_new_state) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  assert((state() & (BlockS|LoopS|IfThenS|ElseS)), "bad state for new If");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  Node* bol;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
  if (left->bottom_type()->isa_ptr() == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
    if (left->bottom_type()->isa_int() != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
      bol = Bool(CmpI(left, right), relop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
      assert(left->bottom_type()->isa_long() != NULL, "what else?");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
      bol = Bool(CmpL(left, right), relop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
    bol = Bool(CmpP(left, right), relop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  // Delay gvn.tranform on if-nodes until construction is finished
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  // to prevent a constant bool input from discarding a control output.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  IfNode* iff = delay_transform(new (C, 2) IfNode(ctrl(), bol, prob, cnt))->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  Node* then  = IfTrue(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  Node* elsen = IfFalse(iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  Node* else_cvstate = copy_cvstate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  else_cvstate->set_req(TypeFunc::Control, elsen);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  _pending_cvstates->push(else_cvstate);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  DEBUG_ONLY(if (push_new_state) _state->push(IfThenS));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
  set_ctrl(then);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
//-------------------------------else_-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
// Pop the else cvstate off the stack, and push the (current) then cvstate.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
// The else cvstate becomes the current cvstate.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
void IdealKit::else_() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  assert(state() == IfThenS, "bad state for new Else");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  Node* else_cvstate = _pending_cvstates->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  DEBUG_ONLY(_state->pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  // save current (then) cvstate for later use at endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
  _pending_cvstates->push(_cvstate);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
  DEBUG_ONLY(_state->push(ElseS));
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
  _cvstate = else_cvstate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
//-------------------------------end_if-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
// Merge the "then" and "else" cvstates.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
// The if_then() pushed the current state for later use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
// as the initial state for a future "else" clause.  The
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
// current state then became the initial state for the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
// then clause.  If an "else" clause was encountered, it will
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
// pop the top state and use it for it's initial state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
// It will also push the current state (the state at the end of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
// the "then" clause) for latter use at the end_if.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
// At the endif, the states are:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
// 1) else exists a) current state is end of "else" clause
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
//                b) top stack state is end of "then" clause
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
// 2) no else:    a) current state is end of "then" clause
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
//                b) top stack state is from the "if_then" which
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
//                   would have been the initial state of the else.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
// Merging the states is accomplished by:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
//   1) make a label for the merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
//   2) terminate the current state with a goto to the label
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
//   3) pop the top state from the stack and make it the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
//        current state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
//   4) bind the label at the current state.  Binding a label
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
//        terminates the current state with a goto to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
//        label and makes the label's state the current state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
void IdealKit::end_if() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  assert(state() & (IfThenS|ElseS), "bad state for new Endif");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  Node* lab = make_label(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
  // Node* join_state = _pending_cvstates->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
                  /* merging, join */
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  goto_(lab);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  _cvstate = _pending_cvstates->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  bind(lab);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  DEBUG_ONLY(_state->pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
//-------------------------------loop-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
// Create the loop head portion (*) of:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
//  *     iv = init
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
//  *  top: (region node)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
//  *     if (iv relop limit) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
//           loop body
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
//           i = i + 1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
//           goto top
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
//  *     } else // exits loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
// Pushes the loop top cvstate first, then the else (loop exit) cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
// onto the stack.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
void IdealKit::loop(IdealVariable& iv, Node* init, BoolTest::mask relop, Node* limit, float prob, float cnt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  assert((state() & (BlockS|LoopS|IfThenS|ElseS)), "bad state for new loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  set(iv, init);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
  Node* head = make_label(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  bind(head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
  _pending_cvstates->push(head); // push for use at end_loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
  _cvstate = copy_cvstate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
  if_then(value(iv), relop, limit, prob, cnt, false /* no new state */);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
  DEBUG_ONLY(_state->push(LoopS));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
  assert(ctrl()->is_IfTrue(), "true branch stays in loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
  assert(_pending_cvstates->top()->in(TypeFunc::Control)->is_IfFalse(), "false branch exits loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
//-------------------------------end_loop-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
// Creates the goto top label.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
// Expects the else (loop exit) cvstate to be on top of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
// stack, and the loop top cvstate to be 2nd.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
void IdealKit::end_loop() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
  assert((state() == LoopS), "bad state for new end_loop");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
  Node* exit = _pending_cvstates->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
  Node* head = _pending_cvstates->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
  goto_(head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
  clear(head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
  DEBUG_ONLY(_state->pop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
  _cvstate = exit;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
//-------------------------------make_label-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
// Creates a label.  The number of goto's
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
// must be specified (which should be 1 less than
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
// the number of precedessors.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
Node* IdealKit::make_label(int goto_ct) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
  assert(_cvstate != NULL, "must declare variables before labels");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
  Node* lab = new_cvstate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
  int sz = 1 + goto_ct + 1 /* fall thru */;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  Node* reg = delay_transform(new (C, sz) RegionNode(sz));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  lab->init_req(TypeFunc::Control, reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
  return lab;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
//-------------------------------bind-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
// Bind a label at the current cvstate by simulating
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
// a goto to the label.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
void IdealKit::bind(Node* lab) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  goto_(lab, true /* bind */);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  _cvstate = lab;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
//-------------------------------goto_-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
// Make the current cvstate a predecessor of the label,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
// creating phi's to merge values.  If bind is true and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
// this is not the last control edge, then ensure that
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
// all live values have phis created. Used to create phis
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
// at loop-top regions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
void IdealKit::goto_(Node* lab, bool bind) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  Node* reg = lab->in(TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  // find next empty slot in region
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  uint slot = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  while (slot < reg->req() && reg->in(slot) != NULL) slot++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
  assert(slot < reg->req(), "too many gotos");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  // If this is last predecessor, then don't force phi creation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  if (slot == reg->req() - 1) bind = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  reg->init_req(slot, ctrl());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  assert(first_var + _var_ct == _cvstate->req(), "bad _cvstate size");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
  for (uint i = first_var; i < _cvstate->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
    // l is the value of var reaching the label. Could be a single value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
    // reaching the label, or a phi that merges multiples values reaching
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
    // the label.  The latter is true if the label's input: in(..) is
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
    // a phi whose control input is the region node for the label.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
    Node* l = lab->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
    // Get the current value of the var
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
    Node* m = _cvstate->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
    // If the var went unused no need for a phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
    if (m == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
    } else if (l == NULL || m == l) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
      // Only one unique value "m" is known to reach this label so a phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
      // is not yet necessary unless:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
      //    the label is being bound and all predecessors have not been seen,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
      //    in which case "bind" will be true.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
      if (bind) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
        m = promote_to_phi(m, reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
      // Record the phi/value used for this var in the label's cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
      lab->set_req(i, m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
      // More than one value for the variable reaches this label so
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
      // a create a phi if one does not already exist.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
      if (!was_promoted_to_phi(l, reg)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
        l = promote_to_phi(l, reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
        lab->set_req(i, l);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
      // Record in the phi, the var's value from the current state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
      l->set_req(slot, m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
  do_memory_merge(_cvstate, lab);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
  stop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
//-----------------------------promote_to_phi-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
Node* IdealKit::promote_to_phi(Node* n, Node* reg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
  assert(!was_promoted_to_phi(n, reg), "n already promoted to phi on this region");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  // Get a conservative type for the phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
  const BasicType bt = n->bottom_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
  const Type* ct = Type::get_const_basic_type(bt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  return delay_transform(PhiNode::make(reg, n, ct));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
//-----------------------------declares_done-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
void IdealKit::declares_done() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  _cvstate = new_cvstate();   // initialize current cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  set_ctrl(_initial_ctrl);    // initialize control in current cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  set_all_memory(_initial_memory);// initialize memory in current cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
  DEBUG_ONLY(_state->push(BlockS));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
//-----------------------------transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
Node* IdealKit::transform(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
  if (_delay_all_transforms) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
    return delay_transform(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
    return gvn().transform(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
//-----------------------------delay_transform-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
Node* IdealKit::delay_transform(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  gvn().set_type(n, n->bottom_type());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  _delay_transform->push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
//-----------------------------new_cvstate-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
Node* IdealKit::new_cvstate() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  uint sz = _var_ct + first_var;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
  return new (C, sz) Node(sz);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
//-----------------------------copy_cvstate-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
Node* IdealKit::copy_cvstate() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
  Node* ns = new_cvstate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
  for (uint i = 0; i < ns->req(); i++) ns->init_req(i, _cvstate->in(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  // We must clone memory since it will be updated as we do stores.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
  ns->set_req(TypeFunc::Memory, MergeMemNode::make(C, ns->in(TypeFunc::Memory)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  return ns;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
//-----------------------------clear-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
void IdealKit::clear(Node* m) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
  for (uint i = 0; i < m->req(); i++) m->set_req(i, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
//-----------------------------drain_delay_transform----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
void IdealKit::drain_delay_transform() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
  while (_delay_transform->length() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
    Node* n = _delay_transform->pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
    gvn().transform(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
    if (!gvn().is_IterGVN()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
      C->record_for_igvn(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
//-----------------------------IdealVariable----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
IdealVariable::IdealVariable(IdealKit &k) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  k.declare(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
Node* IdealKit::memory(uint alias_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
  MergeMemNode* mem = merged_memory();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  Node* p = mem->memory_at(alias_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
  _gvn.set_type(p, Type::MEMORY);  // must be mapped
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  return p;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
void IdealKit::set_memory(Node* mem, uint alias_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  merged_memory()->set_memory_at(alias_idx, mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
//----------------------------- make_load ----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
Node* IdealKit::load(Node* ctl,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
                     Node* adr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
                     const Type* t,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
                     BasicType bt,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
                     int adr_idx,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
                     bool require_atomic_access) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
  assert(adr_idx != Compile::AliasIdxTop, "use other make_load factory" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  const TypePtr* adr_type = NULL; // debug-mode-only argument
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
  debug_only(adr_type = C->get_adr_type(adr_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  Node* mem = memory(adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
  Node* ld;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
  if (require_atomic_access && bt == T_LONG) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    ld = LoadLNode::make_atomic(C, ctl, mem, adr, adr_type, t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
  } else {
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   348
    ld = LoadNode::make(_gvn, ctl, mem, adr, adr_type, t, bt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  return transform(ld);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
Node* IdealKit::store(Node* ctl, Node* adr, Node *val, BasicType bt,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
                                int adr_idx,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
                                bool require_atomic_access) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
  const TypePtr* adr_type = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
  debug_only(adr_type = C->get_adr_type(adr_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
  Node *mem = memory(adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  Node* st;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  if (require_atomic_access && bt == T_LONG) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
    st = StoreLNode::make_atomic(C, ctl, mem, adr, adr_type, val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
  } else {
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 1
diff changeset
   364
    st = StoreNode::make(_gvn, ctl, mem, adr, adr_type, val, bt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  st = transform(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  set_memory(st, adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
  return st;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
// Card mark store. Must be ordered so that it will come after the store of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
// the oop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
Node* IdealKit::storeCM(Node* ctl, Node* adr, Node *val, Node* oop_store,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
                        BasicType bt,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
                        int adr_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
  assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
  const TypePtr* adr_type = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
  debug_only(adr_type = C->get_adr_type(adr_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
  Node *mem = memory(adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
  // Add required edge to oop_store, optimizer does not support precedence edges.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
  // Convert required edge to precedence edge before allocation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
  Node* st = new (C, 5) StoreCMNode(ctl, mem, adr, adr_type, val, oop_store);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
  st = transform(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
  set_memory(st, adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
  return st;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
//---------------------------- do_memory_merge --------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
// The memory from one merging cvstate needs to be merged with the memory for another
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
// join cvstate. If the join cvstate doesn't have a merged memory yet then we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
// can just copy the state from the merging cvstate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
// Merge one slow path into the rest of memory.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
void IdealKit::do_memory_merge(Node* merging, Node* join) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  // Get the region for the join state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
  Node* join_region = join->in(TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
  assert(join_region != NULL, "join region must exist");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
  if (join->in(TypeFunc::Memory) == NULL ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
    join->set_req(TypeFunc::Memory,  merging->in(TypeFunc::Memory));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
  // The control flow for merging must have already been attached to the join region
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
  // we need its index for the phis.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
  uint slot;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
  for (slot = 1; slot < join_region->req() ; slot ++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
    if (join_region->in(slot) == merging->in(TypeFunc::Control)) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
  assert(slot !=  join_region->req(), "edge must already exist");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  MergeMemNode* join_m    = join->in(TypeFunc::Memory)->as_MergeMem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  MergeMemNode* merging_m = merging->in(TypeFunc::Memory)->as_MergeMem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  // join_m should be an ancestor mergemem of merging
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
  // Slow path memory comes from the current map (which is from a slow call)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
  // Fast path/null path memory comes from the call's input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
  // Merge the other fast-memory inputs with the new slow-default memory.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
  // for (MergeMemStream mms(merged_memory(), fast_mem->as_MergeMem()); mms.next_non_empty2(); ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  for (MergeMemStream mms(join_m, merging_m); mms.next_non_empty2(); ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
    Node* join_slice = mms.force_memory();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
    Node* merging_slice = mms.memory2();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
    if (join_slice != merging_slice) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
      PhiNode* phi;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
      // bool new_phi = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
      // Is the phi for this slice one that we created for this join region or simply
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
      // one we copied? If it is ours then add
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
      if (join_slice->is_Phi() && join_slice->as_Phi()->region() == join_region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
        phi = join_slice->as_Phi();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
        // create the phi with join_slice filling supplying memory for all of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
        // control edges to the join region
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
        phi = PhiNode::make(join_region, join_slice, Type::MEMORY, mms.adr_type(C));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
        phi = (PhiNode*) delay_transform(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
        // gvn().set_type(phi, Type::MEMORY);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
        // new_phi = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
      // Now update the phi with the slice for the merging slice
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
      phi->set_req(slot, merging_slice/* slow_path, slow_slice */);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
      // this updates join_m with the phi
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
      mms.set_memory(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
//----------------------------- make_call  ----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
// Trivial runtime call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
void IdealKit::make_leaf_call(const TypeFunc *slow_call_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
                              address slow_call,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
                              const char *leaf_name,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
                              Node* parm0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
                              Node* parm1,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
                              Node* parm2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  // We only handle taking in RawMem and modifying RawMem
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
  const TypePtr* adr_type = TypeRawPtr::BOTTOM;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  uint adr_idx = C->get_alias_index(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  // Clone initial memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
  MergeMemNode* cloned_mem =  MergeMemNode::make(C, merged_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
  // Slow-path leaf call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  int size = slow_call_type->domain()->cnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
  CallNode *call =  (CallNode*)new (C, size) CallLeafNode( slow_call_type, slow_call, leaf_name, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
  // Set fixed predefined input arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
  call->init_req( TypeFunc::Control, ctrl() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
  call->init_req( TypeFunc::I_O    , top() )     ;   // does no i/o
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  // Narrow memory as only memory input
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
  call->init_req( TypeFunc::Memory , memory(adr_idx));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  call->init_req( TypeFunc::FramePtr, top() /* frameptr() */ );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
  call->init_req( TypeFunc::ReturnAdr, top() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
  if (parm0 != NULL)  call->init_req(TypeFunc::Parms+0, parm0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
  if (parm1 != NULL)  call->init_req(TypeFunc::Parms+1, parm1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
  if (parm2 != NULL)  call->init_req(TypeFunc::Parms+2, parm2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
  // Node *c = _gvn.transform(call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
  call = (CallNode *) _gvn.transform(call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  Node *c = call; // dbx gets confused with call call->dump()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
  // Slow leaf call has no side-effects, sets few values
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
  set_ctrl(transform( new (C, 1) ProjNode(call,TypeFunc::Control) ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
  // Set the incoming clone of memory as current memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
  set_all_memory(cloned_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
  // Make memory for the call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
  Node* mem = _gvn.transform( new (C, 1) ProjNode(call, TypeFunc::Memory) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
  // Set the RawPtr memory state only.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  set_memory(mem, adr_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
  assert(C->alias_type(call->adr_type()) == C->alias_type(adr_type),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
         "call node must be constructed correctly");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
}