hotspot/src/share/vm/opto/superword.cpp
author never
Mon, 18 Aug 2008 23:17:51 -0700
changeset 1057 44220ef9a775
parent 961 7fb3b13d4205
child 2022 28ce8115a91d
permissions -rw-r--r--
6732194: Data corruption dependent on -server/-client/-Xbatch Summary: rematerializing nodes results in incorrect inputs Reviewed-by: rasbold
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 2007-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
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
#include "incls/_superword.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
//                  S U P E R W O R D   T R A N S F O R M
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
//------------------------------SuperWord---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
SuperWord::SuperWord(PhaseIdealLoop* phase) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
  _phase(phase),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
  _igvn(phase->_igvn),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
  _arena(phase->C->comp_arena()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
  _packset(arena(), 8,  0, NULL),         // packs for the current block
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
  _bb_idx(arena(), (int)(1.10 * phase->C->unique()), 0, 0), // node idx to index in bb
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
  _block(arena(), 8,  0, NULL),           // nodes in current block
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
  _data_entry(arena(), 8,  0, NULL),      // nodes with all inputs from outside
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  _mem_slice_head(arena(), 8,  0, NULL),  // memory slice heads
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
  _mem_slice_tail(arena(), 8,  0, NULL),  // memory slice tails
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
  _node_info(arena(), 8,  0, SWNodeInfo::initial), // info needed per node
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
  _align_to_ref(NULL),                    // memory reference to align vectors to
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  _disjoint_ptrs(arena(), 8,  0, OrderedPair::initial), // runtime disambiguated pointer pairs
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  _dg(_arena),                            // dependence graph
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
  _visited(arena()),                      // visited node set
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
  _post_visited(arena()),                 // post visited node set
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
  _n_idx_list(arena(), 8),                // scratch list of (node,index) pairs
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  _stk(arena(), 8, 0, NULL),              // scratch stack of nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
  _nlist(arena(), 8, 0, NULL),            // scratch list of nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
  _lpt(NULL),                             // loop tree node
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  _lp(NULL),                              // LoopNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
  _bb(NULL),                              // basic block
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
  _iv(NULL)                               // induction var
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
{}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
//------------------------------transform_loop---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
void SuperWord::transform_loop(IdealLoopTree* lpt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  assert(lpt->_head->is_CountedLoop(), "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  CountedLoopNode *cl = lpt->_head->as_CountedLoop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
  if (!cl->is_main_loop() ) return; // skip normal, pre, and post loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
  // Check for no control flow in body (other than exit)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  Node *cl_exit = cl->loopexit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  if (cl_exit->in(0) != lpt->_head) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
352
6d8e1aa5834e 6646020: assert(in_bb(n),"must be in block") in -Xcomp mode
never
parents: 245
diff changeset
    68
  // Make sure the are no extra control users of the loop backedge
6d8e1aa5834e 6646020: assert(in_bb(n),"must be in block") in -Xcomp mode
never
parents: 245
diff changeset
    69
  if (cl->back_control()->outcnt() != 1) {
6d8e1aa5834e 6646020: assert(in_bb(n),"must be in block") in -Xcomp mode
never
parents: 245
diff changeset
    70
    return;
6d8e1aa5834e 6646020: assert(in_bb(n),"must be in block") in -Xcomp mode
never
parents: 245
diff changeset
    71
  }
6d8e1aa5834e 6646020: assert(in_bb(n),"must be in block") in -Xcomp mode
never
parents: 245
diff changeset
    72
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  // Check for pre-loop ending with CountedLoopEnd(Bool(Cmp(x,Opaque1(limit))))
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  CountedLoopEndNode* pre_end = get_pre_loop_end(cl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  if (pre_end == NULL) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  Node *pre_opaq1 = pre_end->limit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  if (pre_opaq1->Opcode() != Op_Opaque1) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  // Do vectors exist on this architecture?
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  if (vector_width_in_bytes() == 0) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  init(); // initialize data structures
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  set_lpt(lpt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  set_lp(cl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
 // For now, define one block which is the entire loop body
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  set_bb(cl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  assert(_packset.length() == 0, "packset must be empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  SLP_extract();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
//------------------------------SLP_extract---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
// Extract the superword level parallelism
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
// 1) A reverse post-order of nodes in the block is constructed.  By scanning
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
//    this list from first to last, all definitions are visited before their uses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
// 2) A point-to-point dependence graph is constructed between memory references.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
//    This simplies the upcoming "independence" checker.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
// 3) The maximum depth in the node graph from the beginning of the block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
//    to each node is computed.  This is used to prune the graph search
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
//    in the independence checker.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
// 4) For integer types, the necessary bit width is propagated backwards
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
//    from stores to allow packed operations on byte, char, and short
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
//    integers.  This reverses the promotion to type "int" that javac
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
//    did for operations like: char c1,c2,c3;  c1 = c2 + c3.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
// 5) One of the memory references is picked to be an aligned vector reference.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
//    The pre-loop trip count is adjusted to align this reference in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
//    unrolled body.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
// 6) The initial set of pack pairs is seeded with memory references.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
// 7) The set of pack pairs is extended by following use->def and def->use links.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
// 8) The pairs are combined into vector sized packs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
// 9) Reorder the memory slices to co-locate members of the memory packs.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
// 10) Generate ideal vector nodes for the final set of packs and where necessary,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
//    inserting scalar promotion, vector creation from multiple scalars, and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
//    extraction of scalar values from vectors.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
void SuperWord::SLP_extract() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
  // Ready the block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  construct_bb();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  dependence_graph();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  compute_max_depth();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
  compute_vector_element_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
  // Attempt vectorization
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
  find_adjacent_refs();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  extend_packlist();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
  combine_packs();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
  construct_my_pack_map();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
  filter_packs();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  schedule();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  output();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
//------------------------------find_adjacent_refs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
// Find the adjacent memory references and create pack pairs for them.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
// This is the initial set of packs that will then be extended by
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
// following use->def and def->use links.  The align positions are
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
// assigned relative to the reference "align_to_ref"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
void SuperWord::find_adjacent_refs() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
  // Get list of memory operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  Node_List memops;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
    Node* n = _block.at(i);
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
   167
    if (n->is_Mem() && in_bb(n) &&
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
   168
        is_java_primitive(n->as_Mem()->memory_type())) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
      int align = memory_alignment(n->as_Mem(), 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
      if (align != bottom_align) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
        memops.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
  if (memops.size() == 0) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
  // Find a memory reference to align to.  The pre-loop trip count
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
  // is modified to align this reference to a vector-aligned address
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
  find_align_to_ref(memops);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
  if (align_to_ref() == NULL) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
  SWPointer align_to_ref_p(align_to_ref(), this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
  int offset = align_to_ref_p.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
  int scale  = align_to_ref_p.scale_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  int vw              = vector_width_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  int stride_sign     = (scale * iv_stride()) > 0 ? 1 : -1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
  int iv_adjustment   = (stride_sign * vw - (offset % vw)) % vw;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
  if (TraceSuperWord)
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
   191
    tty->print_cr("\noffset = %d iv_adjustment = %d  elt_align = %d scale = %d iv_stride = %d",
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
   192
                  offset, iv_adjustment, align_to_ref_p.memory_size(), align_to_ref_p.scale_in_bytes(), iv_stride());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  // Set alignment relative to "align_to_ref"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
  for (int i = memops.size() - 1; i >= 0; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
    MemNode* s = memops.at(i)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
    SWPointer p2(s, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
    if (p2.comparable(align_to_ref_p)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
      int align = memory_alignment(s, iv_adjustment);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
      set_alignment(s, align);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
      memops.remove(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  // Create initial pack pairs of memory operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  for (uint i = 0; i < memops.size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
    Node* s1 = memops.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
    for (uint j = 0; j < memops.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
      Node* s2 = memops.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
      if (s1 != s2 && are_adjacent_refs(s1, s2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
        int align = alignment(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
        if (stmts_can_pack(s1, s2, align)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
          Node_List* pair = new Node_List();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
          pair->push(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
          pair->push(s2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
          _packset.append(pair);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
    tty->print_cr("\nAfter find_adjacent_refs");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
    print_packset();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
//------------------------------find_align_to_ref---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
// Find a memory reference to align the loop induction variable to.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
// Looks first at stores then at loads, looking for a memory reference
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
// with the largest number of references similar to it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
void SuperWord::find_align_to_ref(Node_List &memops) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
  GrowableArray<int> cmp_ct(arena(), memops.size(), memops.size(), 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
  // Count number of comparable memory ops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
  for (uint i = 0; i < memops.size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
    MemNode* s1 = memops.at(i)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
    SWPointer p1(s1, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
    // Discard if pre loop can't align this reference
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
    if (!ref_is_alignable(p1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
      *cmp_ct.adr_at(i) = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
    for (uint j = i+1; j < memops.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
      MemNode* s2 = memops.at(j)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
      if (isomorphic(s1, s2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
        SWPointer p2(s2, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
        if (p1.comparable(p2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
          (*cmp_ct.adr_at(i))++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
          (*cmp_ct.adr_at(j))++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
  // Find Store (or Load) with the greatest number of "comparable" references
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
  int max_ct        = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
  int max_idx       = -1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  int min_size      = max_jint;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  int min_iv_offset = max_jint;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  for (uint j = 0; j < memops.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
    MemNode* s = memops.at(j)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
    if (s->is_Store()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
      SWPointer p(s, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
      if (cmp_ct.at(j) > max_ct ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
          cmp_ct.at(j) == max_ct && (data_size(s) < min_size ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
                                     data_size(s) == min_size &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
                                        p.offset_in_bytes() < min_iv_offset)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
        max_ct = cmp_ct.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
        max_idx = j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
        min_size = data_size(s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
        min_iv_offset = p.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  // If no stores, look at loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  if (max_ct == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
    for (uint j = 0; j < memops.size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
      MemNode* s = memops.at(j)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
      if (s->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
        SWPointer p(s, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
        if (cmp_ct.at(j) > max_ct ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
            cmp_ct.at(j) == max_ct && (data_size(s) < min_size ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
                                       data_size(s) == min_size &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
                                          p.offset_in_bytes() < min_iv_offset)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
          max_ct = cmp_ct.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
          max_idx = j;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
          min_size = data_size(s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
          min_iv_offset = p.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  if (max_ct > 0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
    set_align_to_ref(memops.at(max_idx)->as_Mem());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
  if (TraceSuperWord && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
    tty->print_cr("\nVector memops after find_align_to_refs");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
    for (uint i = 0; i < memops.size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
      MemNode* s = memops.at(i)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
      s->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
//------------------------------ref_is_alignable---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
// Can the preloop align the reference to position zero in the vector?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
bool SuperWord::ref_is_alignable(SWPointer& p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  if (!p.has_iv()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
    return true;   // no induction variable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
  CountedLoopEndNode* pre_end = get_pre_loop_end(lp()->as_CountedLoop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  assert(pre_end->stride_is_con(), "pre loop stride is constant");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
  int preloop_stride = pre_end->stride_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  int span = preloop_stride * p.scale_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  // Stride one accesses are alignable.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
  if (ABS(span) == p.memory_size())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  // If initial offset from start of object is computable,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  // compute alignment within the vector.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
  int vw = vector_width_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  if (vw % span == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
    Node* init_nd = pre_end->init_trip();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
    if (init_nd->is_Con() && p.invar() == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
      int init = init_nd->bottom_type()->is_int()->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
      int init_offset = init * p.scale_in_bytes() + p.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
      assert(init_offset >= 0, "positive offset from object start");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
      if (span > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
        return (vw - (init_offset % vw)) % span == 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
        assert(span < 0, "nonzero stride * scale");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
        return (init_offset % vw) % -span == 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
//---------------------------dependence_graph---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
// Construct dependency graph.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
// Add dependence edges to load/store nodes for memory dependence
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
//    A.out()->DependNode.in(1) and DependNode.out()->B.prec(x)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
void SuperWord::dependence_graph() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  // First, assign a dependence node to each memory node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
  for (int i = 0; i < _block.length(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
    Node *n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
    if (n->is_Mem() || n->is_Phi() && n->bottom_type() == Type::MEMORY) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
      _dg.make_node(n);
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
  // For each memory slice, create the dependences
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  for (int i = 0; i < _mem_slice_head.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
    Node* n      = _mem_slice_head.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
    Node* n_tail = _mem_slice_tail.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
    // Get slice in predecessor order (last is first)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    mem_slice_preds(n_tail, n, _nlist);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    // Make the slice dependent on the root
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    DepMem* slice = _dg.dep(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
    _dg.make_edge(_dg.root(), slice);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    // Create a sink for the slice
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
    DepMem* slice_sink = _dg.make_node(NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
    _dg.make_edge(slice_sink, _dg.tail());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
    // Now visit each pair of memory ops, creating the edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
    for (int j = _nlist.length() - 1; j >= 0 ; j--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
      Node* s1 = _nlist.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
      // If no dependency yet, use slice
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
      if (_dg.dep(s1)->in_cnt() == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
        _dg.make_edge(slice, s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
      SWPointer p1(s1->as_Mem(), this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
      bool sink_dependent = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
      for (int k = j - 1; k >= 0; k--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
        Node* s2 = _nlist.at(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
        if (s1->is_Load() && s2->is_Load())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
        SWPointer p2(s2->as_Mem(), this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
        int cmp = p1.cmp(p2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
        if (SuperWordRTDepCheck &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
            p1.base() != p2.base() && p1.valid() && p2.valid()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
          // Create a runtime check to disambiguate
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
          OrderedPair pp(p1.base(), p2.base());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
          _disjoint_ptrs.append_if_missing(pp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
        } else if (!SWPointer::not_equal(cmp)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
          // Possibly same address
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
          _dg.make_edge(s1, s2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
          sink_dependent = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
      if (sink_dependent) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
        _dg.make_edge(s1, slice_sink);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
    if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
      tty->print_cr("\nDependence graph for slice: %d", n->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
      for (int q = 0; q < _nlist.length(); q++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
        _dg.print(_nlist.at(q));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
    _nlist.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
    tty->print_cr("\ndisjoint_ptrs: %s", _disjoint_ptrs.length() > 0 ? "" : "NONE");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
    for (int r = 0; r < _disjoint_ptrs.length(); r++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
      _disjoint_ptrs.at(r).print();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
    tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
//---------------------------mem_slice_preds---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
// Return a memory slice (node list) in predecessor order starting at "start"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
void SuperWord::mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  assert(preds.length() == 0, "start empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
  Node* n = start;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
  Node* prev = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
  while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
    assert(in_bb(n), "must be in block");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
      Node* out = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
      if (out->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
        if (in_bb(out)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
          preds.push(out);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
        // FIXME
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
        if (out->is_MergeMem() && !in_bb(out)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
          // Either unrolling is causing a memory edge not to disappear,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
          // or need to run igvn.optimize() again before SLP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
        } else if (out->is_Phi() && out->bottom_type() == Type::MEMORY && !in_bb(out)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
          // Ditto.  Not sure what else to check further.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
        } else if (out->Opcode() == Op_StoreCM && out->in(4) == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
          // StoreCM has an input edge used as a precedence edge.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
          // Maybe an issue when oop stores are vectorized.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
          assert(out == prev || prev == NULL, "no branches off of store slice");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
    if (n == stop) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
    preds.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
    prev = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
    n = n->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
//------------------------------stmts_can_pack---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
// Can s1 and s2 be in a pack with s1 immediately preceeding s2 and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
// s1 aligned at "align"
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
bool SuperWord::stmts_can_pack(Node* s1, Node* s2, int align) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
  if (isomorphic(s1, s2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
    if (independent(s1, s2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
      if (!exists_at(s1, 0) && !exists_at(s2, 1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
        if (!s1->is_Mem() || are_adjacent_refs(s1, s2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
          int s1_align = alignment(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
          int s2_align = alignment(s2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
          if (s1_align == top_align || s1_align == align) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
            if (s2_align == top_align || s2_align == align + data_size(s1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
              return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
//------------------------------exists_at---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
// Does s exist in a pack at position pos?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
bool SuperWord::exists_at(Node* s, uint pos) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
    Node_List* p = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
    if (p->at(pos) == s) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
//------------------------------are_adjacent_refs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
// Is s1 immediately before s2 in memory?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
bool SuperWord::are_adjacent_refs(Node* s1, Node* s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  if (!s1->is_Mem() || !s2->is_Mem()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
  if (!in_bb(s1)    || !in_bb(s2))    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
  // FIXME - co_locate_pack fails on Stores in different mem-slices, so
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
  // only pack memops that are in the same alias set until that's fixed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
  if (_phase->C->get_alias_index(s1->as_Mem()->adr_type()) !=
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
      _phase->C->get_alias_index(s2->as_Mem()->adr_type()))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  SWPointer p1(s1->as_Mem(), this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  SWPointer p2(s2->as_Mem(), this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  if (p1.base() != p2.base() || !p1.comparable(p2)) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  int diff = p2.offset_in_bytes() - p1.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  return diff == data_size(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
//------------------------------isomorphic---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
// Are s1 and s2 similar?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
bool SuperWord::isomorphic(Node* s1, Node* s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
  if (s1->Opcode() != s2->Opcode()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
  if (s1->req() != s2->req()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
  if (s1->in(0) != s2->in(0)) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
  if (velt_type(s1) != velt_type(s2)) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
//------------------------------independent---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
// Is there no data path from s1 to s2 or s2 to s1?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
bool SuperWord::independent(Node* s1, Node* s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  //  assert(s1->Opcode() == s2->Opcode(), "check isomorphic first");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  int d1 = depth(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  int d2 = depth(s2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  if (d1 == d2) return s1 != s2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  Node* deep    = d1 > d2 ? s1 : s2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  Node* shallow = d1 > d2 ? s2 : s1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  visited_clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  return independent_path(shallow, deep);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
//------------------------------independent_path------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
// Helper for independent
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
bool SuperWord::independent_path(Node* shallow, Node* deep, uint dp) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  if (dp >= 1000) return false; // stop deep recursion
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  visited_set(deep);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  int shal_depth = depth(shallow);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
  assert(shal_depth <= depth(deep), "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
  for (DepPreds preds(deep, _dg); !preds.done(); preds.next()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
    Node* pred = preds.current();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
    if (in_bb(pred) && !visited_test(pred)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
      if (shallow == pred) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
        return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
      if (shal_depth < depth(pred) && !independent_path(shallow, pred, dp+1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
        return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
//------------------------------set_alignment---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
void SuperWord::set_alignment(Node* s1, Node* s2, int align) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
  set_alignment(s1, align);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
  set_alignment(s2, align + data_size(s1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
//------------------------------data_size---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
int SuperWord::data_size(Node* s) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  const Type* t = velt_type(s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  BasicType  bt = t->array_element_basic_type();
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
   579
  int bsize = type2aelembytes(bt);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
  assert(bsize != 0, "valid size");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
  return bsize;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
//------------------------------extend_packlist---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
// Extend packset by following use->def and def->use links from pack members.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
void SuperWord::extend_packlist() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
  bool changed;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
    changed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
    for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
      Node_List* p = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
      changed |= follow_use_defs(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
      changed |= follow_def_uses(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  } while (changed);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
    tty->print_cr("\nAfter extend_packlist");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
    print_packset();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
//------------------------------follow_use_defs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
// Extend the packset by visiting operand definitions of nodes in pack p
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
bool SuperWord::follow_use_defs(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
  Node* s1 = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
  Node* s2 = p->at(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
  assert(p->size() == 2, "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  assert(s1->req() == s2->req(), "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  assert(alignment(s1) + data_size(s1) == alignment(s2), "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
  if (s1->is_Load()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
  int align = alignment(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
  bool changed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
  int start = s1->is_Store() ? MemNode::ValueIn   : 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  int end   = s1->is_Store() ? MemNode::ValueIn+1 : s1->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
  for (int j = start; j < end; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
    Node* t1 = s1->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
    Node* t2 = s2->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
    if (!in_bb(t1) || !in_bb(t2))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
      continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
    if (stmts_can_pack(t1, t2, align)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
      if (est_savings(t1, t2) >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
        Node_List* pair = new Node_List();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
        pair->push(t1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   629
        pair->push(t2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
        _packset.append(pair);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
        set_alignment(t1, t2, align);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
        changed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   634
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  return changed;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
//------------------------------follow_def_uses---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
// Extend the packset by visiting uses of nodes in pack p
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
bool SuperWord::follow_def_uses(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
  bool changed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
  Node* s1 = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
  Node* s2 = p->at(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  assert(p->size() == 2, "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
  assert(s1->req() == s2->req(), "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
  assert(alignment(s1) + data_size(s1) == alignment(s2), "just checking");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
  if (s1->is_Store()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
  int align = alignment(s1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
  int savings = -1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
  Node* u1 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
  Node* u2 = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
  for (DUIterator_Fast imax, i = s1->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
    Node* t1 = s1->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
    if (!in_bb(t1)) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
    for (DUIterator_Fast jmax, j = s2->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
      Node* t2 = s2->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
      if (!in_bb(t2)) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
      if (!opnd_positions_match(s1, t1, s2, t2))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
      if (stmts_can_pack(t1, t2, align)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
        int my_savings = est_savings(t1, t2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
        if (my_savings > savings) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
          savings = my_savings;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
          u1 = t1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
          u2 = t2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
  if (savings >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
    Node_List* pair = new Node_List();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
    pair->push(u1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
    pair->push(u2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
    _packset.append(pair);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
    set_alignment(u1, u2, align);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
    changed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
  return changed;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
//---------------------------opnd_positions_match-------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
// Is the use of d1 in u1 at the same operand position as d2 in u2?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
bool SuperWord::opnd_positions_match(Node* d1, Node* u1, Node* d2, Node* u2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
  uint ct = u1->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  if (ct != u2->req()) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
  uint i1 = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
  uint i2 = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
  do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
    for (i1++; i1 < ct; i1++) if (u1->in(i1) == d1) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
    for (i2++; i2 < ct; i2++) if (u2->in(i2) == d2) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
    if (i1 != i2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
  } while (i1 < ct);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
//------------------------------est_savings---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
// Estimate the savings from executing s1 and s2 as a pack
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
int SuperWord::est_savings(Node* s1, Node* s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  int save = 2 - 1; // 2 operations per instruction in packed form
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
  // inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
  for (uint i = 1; i < s1->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
    Node* x1 = s1->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
    Node* x2 = s2->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
    if (x1 != x2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
      if (are_adjacent_refs(x1, x2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
        save += adjacent_profit(x1, x2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
      } else if (!in_packset(x1, x2)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
        save -= pack_cost(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
        save += unpack_cost(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  // uses of result
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
  uint ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
  for (DUIterator_Fast imax, i = s1->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
    Node* s1_use = s1->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
    for (int j = 0; j < _packset.length(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
      Node_List* p = _packset.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
      if (p->at(0) == s1_use) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
        for (DUIterator_Fast kmax, k = s2->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
          Node* s2_use = s2->fast_out(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
          if (p->at(p->size()-1) == s2_use) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
            ct++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
            if (are_adjacent_refs(s1_use, s2_use)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
              save += adjacent_profit(s1_use, s2_use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
  if (ct < s1->outcnt()) save += unpack_cost(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
  if (ct < s2->outcnt()) save += unpack_cost(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
  return save;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
//------------------------------costs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
int SuperWord::adjacent_profit(Node* s1, Node* s2) { return 2; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
int SuperWord::pack_cost(int ct)   { return ct; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
int SuperWord::unpack_cost(int ct) { return ct; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
//------------------------------combine_packs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
// Combine packs A and B with A.last == B.first into A.first..,A.last,B.second,..B.last
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
void SuperWord::combine_packs() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
  bool changed;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
  do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
    changed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
    for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
      Node_List* p1 = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
      if (p1 == NULL) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
      for (int j = 0; j < _packset.length(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
        Node_List* p2 = _packset.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
        if (p2 == NULL) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
        if (p1->at(p1->size()-1) == p2->at(0)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
          for (uint k = 1; k < p2->size(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
            p1->push(p2->at(k));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
          _packset.at_put(j, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
          changed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
  } while (changed);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
  for (int i = _packset.length() - 1; i >= 0; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
    Node_List* p1 = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
    if (p1 == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
      _packset.remove_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
    tty->print_cr("\nAfter combine_packs");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
    print_packset();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
//-----------------------------construct_my_pack_map--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
// Construct the map from nodes to packs.  Only valid after the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
// point where a node is only in one pack (after combine_packs).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
void SuperWord::construct_my_pack_map() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  Node_List* rslt = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
    Node_List* p = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
    for (uint j = 0; j < p->size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
      Node* s = p->at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
      assert(my_pack(s) == NULL, "only in one pack");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
      set_my_pack(s, p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
//------------------------------filter_packs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
// Remove packs that are not implemented or not profitable.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
void SuperWord::filter_packs() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
  // Remove packs that are not implemented
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
  for (int i = _packset.length() - 1; i >= 0; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
    Node_List* pk = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
    bool impl = implemented(pk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
    if (!impl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
      if (TraceSuperWord && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
        tty->print_cr("Unimplemented");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
        pk->at(0)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
      remove_pack_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
  // Remove packs that are not profitable
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
  bool changed;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
  do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
    changed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
    for (int i = _packset.length() - 1; i >= 0; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
      Node_List* pk = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
      bool prof = profitable(pk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
      if (!prof) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
        if (TraceSuperWord && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
          tty->print_cr("Unprofitable");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
          pk->at(0)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
        remove_pack_at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
        changed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
  } while (changed);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
    tty->print_cr("\nAfter filter_packs");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
    print_packset();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
    tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
//------------------------------implemented---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
// Can code be generated for pack p?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
bool SuperWord::implemented(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
  Node* p0 = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
  int vopc = VectorNode::opcode(p0->Opcode(), p->size(), velt_type(p0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
  return vopc > 0 && Matcher::has_match_rule(vopc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
//------------------------------profitable---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
// For pack p, are all operands and all uses (with in the block) vector?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
bool SuperWord::profitable(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
  Node* p0 = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
  uint start, end;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
  vector_opd_range(p0, &start, &end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
  // Return false if some input is not vector and inside block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
  for (uint i = start; i < end; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
    if (!is_vector_use(p0, i)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
      // For now, return false if not scalar promotion case (inputs are the same.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
      // Later, implement PackNode and allow differring, non-vector inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
      // (maybe just the ones from outside the block.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
      Node* p0_def = p0->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
      for (uint j = 1; j < p->size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
        Node* use = p->at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
        Node* def = use->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
        if (p0_def != def)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
          return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  if (!p0->is_Store()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
    // For now, return false if not all uses are vector.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
    // Later, implement ExtractNode and allow non-vector uses (maybe
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
    // just the ones outside the block.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
    for (uint i = 0; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
      Node* def = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
      for (DUIterator_Fast jmax, j = def->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
        Node* use = def->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
        for (uint k = 0; k < use->req(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
          Node* n = use->in(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
          if (def == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
            if (!is_vector_use(use, k)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
              return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   903
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
//------------------------------schedule---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
// Adjust the memory graph for the packed operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
void SuperWord::schedule() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
  // Co-locate in the memory graph the members of each memory pack
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
    co_locate_pack(_packset.at(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
//------------------------------co_locate_pack---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
// Within a pack, move stores down to the last executed store,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
// and move loads up to the first executed load.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
void SuperWord::co_locate_pack(Node_List* pk) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   919
  if (pk->at(0)->is_Store()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
    // Push Stores down towards last executed pack member
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
    MemNode* first     = executed_first(pk)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
    MemNode* last      = executed_last(pk)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
    MemNode* insert_pt = last;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
    MemNode* current   = last->in(MemNode::Memory)->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
    while (true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
      assert(in_bb(current), "stay in block");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
      Node* my_mem = current->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
      if (in_pack(current, pk)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
        // Forward users of my memory state to my input memory state
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
        _igvn.hash_delete(current);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
        _igvn.hash_delete(my_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
        for (DUIterator i = current->outs(); current->has_out(i); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
          Node* use = current->out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
          if (use->is_Mem()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
            assert(use->in(MemNode::Memory) == current, "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
            _igvn.hash_delete(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
            use->set_req(MemNode::Memory, my_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
            _igvn._worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
            --i; // deleted this edge; rescan position
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
        // put current immediately before insert_pt
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
        current->set_req(MemNode::Memory, insert_pt->in(MemNode::Memory));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
        _igvn.hash_delete(insert_pt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
        insert_pt->set_req(MemNode::Memory, current);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
        _igvn._worklist.push(insert_pt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
        _igvn._worklist.push(current);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
        insert_pt = current;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
      if (current == first) break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
      current = my_mem->as_Mem();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
  } else if (pk->at(0)->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
    // Pull Loads up towards first executed pack member
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
    LoadNode* first = executed_first(pk)->as_Load();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
    Node* first_mem = first->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
    _igvn.hash_delete(first_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
    // Give each load same memory state as first
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
    for (uint i = 0; i < pk->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
      LoadNode* ld = pk->at(i)->as_Load();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
      _igvn.hash_delete(ld);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
      ld->set_req(MemNode::Memory, first_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
      _igvn._worklist.push(ld);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
//------------------------------output---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
// Convert packs into vector node operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
void SuperWord::output() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
  if (_packset.length() == 0) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
  // MUST ENSURE main loop's initial value is properly aligned:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
  //  (iv_initial_value + min_iv_offset) % vector_width_in_bytes() == 0
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
  align_initial_loop_index(align_to_ref());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
  // Insert extract (unpack) operations for scalar uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
    insert_extracts(_packset.at(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
  for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
    Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
    Node_List* p = my_pack(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
    if (p && n == executed_last(p)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
      uint vlen = p->size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
      Node* vn = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
      Node* low_adr = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
      Node* first   = executed_first(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
      if (n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
        int   opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
        Node* ctl = n->in(MemNode::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
        Node* mem = first->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
        Node* adr = low_adr->in(MemNode::Address);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
        const TypePtr* atyp = n->adr_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
        vn = VectorLoadNode::make(_phase->C, opc, ctl, mem, adr, atyp, vlen);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
      } else if (n->is_Store()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
        // Promote value to be stored to vector
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
        VectorNode* val = vector_opd(p, MemNode::ValueIn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
        int   opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
        Node* ctl = n->in(MemNode::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
        Node* mem = first->in(MemNode::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
        Node* adr = low_adr->in(MemNode::Address);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
        const TypePtr* atyp = n->adr_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
        vn = VectorStoreNode::make(_phase->C, opc, ctl, mem, adr, atyp, val, vlen);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
      } else if (n->req() == 3) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
        // Promote operands to vector
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
        Node* in1 = vector_opd(p, 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
        Node* in2 = vector_opd(p, 2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
        vn = VectorNode::make(_phase->C, n->Opcode(), in1, in2, vlen, velt_type(n));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
        ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
      _phase->_igvn.register_new_node_with_optimizer(vn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
      _phase->set_ctrl(vn, _phase->get_ctrl(p->at(0)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
      for (uint j = 0; j < p->size(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
        Node* pm = p->at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
        _igvn.hash_delete(pm);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
        _igvn.subsume_node(pm, vn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
      _igvn._worklist.push(vn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
//------------------------------vector_opd---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
// Create a vector operand for the nodes in pack p for operand: in(opd_idx)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
VectorNode* SuperWord::vector_opd(Node_List* p, int opd_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
  Node* p0 = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
  uint vlen = p->size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
  Node* opd = p0->in(opd_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  bool same_opd = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  for (uint i = 1; i < vlen; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
    Node* pi = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
    Node* in = pi->in(opd_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
    if (opd != in) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
      same_opd = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
  if (same_opd) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
    if (opd->is_Vector()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
      return (VectorNode*)opd; // input is matching vector
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
    // Convert scalar input to vector. Use p0's type because it's container
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
    // maybe smaller than the operand's container.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
    const Type* opd_t = velt_type(!in_bb(opd) ? p0 : opd);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
    const Type* p0_t  = velt_type(p0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
    if (p0_t->higher_equal(opd_t)) opd_t = p0_t;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
    VectorNode* vn    = VectorNode::scalar2vector(_phase->C, opd, vlen, opd_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
    _phase->_igvn.register_new_node_with_optimizer(vn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
    _phase->set_ctrl(vn, _phase->get_ctrl(opd));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
    return vn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
  // Insert pack operation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
  const Type* opd_t = velt_type(!in_bb(opd) ? p0 : opd);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
  PackNode* pk = PackNode::make(_phase->C, opd, opd_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
  for (uint i = 1; i < vlen; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
    Node* pi = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
    Node* in = pi->in(opd_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
    assert(my_pack(in) == NULL, "Should already have been unpacked");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
    assert(opd_t == velt_type(!in_bb(in) ? pi : in), "all same type");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
    pk->add_opd(in);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
  _phase->_igvn.register_new_node_with_optimizer(pk);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
  _phase->set_ctrl(pk, _phase->get_ctrl(opd));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
  return pk;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
//------------------------------insert_extracts---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
// If a use of pack p is not a vector use, then replace the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
// use with an extract operation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
void SuperWord::insert_extracts(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
  if (p->at(0)->is_Store()) return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
  assert(_n_idx_list.is_empty(), "empty (node,index) list");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
  // Inspect each use of each pack member.  For each use that is
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
  // not a vector use, replace the use with an extract operation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
  for (uint i = 0; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
    Node* def = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
    for (DUIterator_Fast jmax, j = def->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
      Node* use = def->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
      for (uint k = 0; k < use->req(); k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
        Node* n = use->in(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
        if (def == n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
          if (!is_vector_use(use, k)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
            _n_idx_list.push(use, k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
  while (_n_idx_list.is_nonempty()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
    Node* use = _n_idx_list.node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
    int   idx = _n_idx_list.index();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
    _n_idx_list.pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
    Node* def = use->in(idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
    // Insert extract operation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
    _igvn.hash_delete(def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
    _igvn.hash_delete(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
    int def_pos = alignment(def) / data_size(def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1116
    const Type* def_t = velt_type(def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
    Node* ex = ExtractNode::make(_phase->C, def, def_pos, def_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
    _phase->_igvn.register_new_node_with_optimizer(ex);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
    _phase->set_ctrl(ex, _phase->get_ctrl(def));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
    use->set_req(idx, ex);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
    _igvn._worklist.push(def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1123
    _igvn._worklist.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1124
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1125
    bb_insert_after(ex, bb_idx(def));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
    set_velt_type(ex, def_t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1130
//------------------------------is_vector_use---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
// Is use->in(u_idx) a vector use?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
bool SuperWord::is_vector_use(Node* use, int u_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
  Node_List* u_pk = my_pack(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
  if (u_pk == NULL) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
  Node* def = use->in(u_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
  Node_List* d_pk = my_pack(def);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
  if (d_pk == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
    // check for scalar promotion
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
    Node* n = u_pk->at(0)->in(u_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
    for (uint i = 1; i < u_pk->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
      if (u_pk->at(i)->in(u_idx) != n) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
  if (u_pk->size() != d_pk->size())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1146
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1147
  for (uint i = 0; i < u_pk->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1148
    Node* ui = u_pk->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
    Node* di = d_pk->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
    if (ui->in(u_idx) != di || alignment(ui) != alignment(di))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
//------------------------------construct_bb---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
// Construct reverse postorder list of block members
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
void SuperWord::construct_bb() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
  Node* entry = bb();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
  assert(_stk.length() == 0,            "stk is empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
  assert(_block.length() == 0,          "block is empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1163
  assert(_data_entry.length() == 0,     "data_entry is empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
  assert(_mem_slice_head.length() == 0, "mem_slice_head is empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1165
  assert(_mem_slice_tail.length() == 0, "mem_slice_tail is empty");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1166
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1167
  // Find non-control nodes with no inputs from within block,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
  // create a temporary map from node _idx to bb_idx for use
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1169
  // by the visited and post_visited sets,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
  // and count number of nodes in block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
  int bb_ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1172
  for (uint i = 0; i < lpt()->_body.size(); i++ ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1173
    Node *n = lpt()->_body.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1174
    set_bb_idx(n, i); // Create a temporary map
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1175
    if (in_bb(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1176
      bb_ct++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
      if (!n->is_CFG()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1178
        bool found = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1179
        for (uint j = 0; j < n->req(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1180
          Node* def = n->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1181
          if (def && in_bb(def)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1182
            found = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
            break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1184
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
        if (!found) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
          assert(n != entry, "can't be entry");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
          _data_entry.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
  // Find memory slices (head and tail)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
  for (DUIterator_Fast imax, i = lp()->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
    Node *n = lp()->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
    if (in_bb(n) && (n->is_Phi() && n->bottom_type() == Type::MEMORY)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
      Node* n_tail  = n->in(LoopNode::LoopBackControl);
961
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 781
diff changeset
  1199
      if (n_tail != n->in(LoopNode::EntryControl)) {
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 781
diff changeset
  1200
        _mem_slice_head.push(n);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 781
diff changeset
  1201
        _mem_slice_tail.push(n_tail);
7fb3b13d4205 6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents: 781
diff changeset
  1202
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
  // Create an RPO list of nodes in block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
  visited_clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
  post_visited_clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
  // Push all non-control nodes with no inputs from within block, then control entry
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  for (int j = 0; j < _data_entry.length(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
    Node* n = _data_entry.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
    visited_set(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
    _stk.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
  visited_set(entry);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
  _stk.push(entry);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
  // Do a depth first walk over out edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
  int rpo_idx = bb_ct - 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
  int size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
  while ((size = _stk.length()) > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
    Node* n = _stk.top(); // Leave node on stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
    if (!visited_test_set(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
      // forward arc in graph
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
    } else if (!post_visited_test(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
      // cross or back arc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
      for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
        Node *use = n->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
        if (in_bb(use) && !visited_test(use) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
            // Don't go around backedge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
            (!use->is_Phi() || n == entry)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
          _stk.push(use);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
      if (_stk.length() == size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
        // There were no additional uses, post visit node now
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
        _stk.pop(); // Remove node from stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
        assert(rpo_idx >= 0, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
        _block.at_put_grow(rpo_idx, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
        rpo_idx--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
        post_visited_set(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
        assert(rpo_idx >= 0 || _stk.is_empty(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
      _stk.pop(); // Remove post-visited node from stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
  // Create real map of block indices for nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
  for (int j = 0; j < _block.length(); j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
    Node* n = _block.at(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
    set_bb_idx(n, j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
  initialize_bb(); // Ensure extra info is allocated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
  if (TraceSuperWord) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
    print_bb();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
    tty->print_cr("\ndata entry nodes: %s", _data_entry.length() > 0 ? "" : "NONE");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
    for (int m = 0; m < _data_entry.length(); m++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
      tty->print("%3d ", m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
      _data_entry.at(m)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1267
    tty->print_cr("\nmemory slices: %s", _mem_slice_head.length() > 0 ? "" : "NONE");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
    for (int m = 0; m < _mem_slice_head.length(); m++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
      tty->print("%3d ", m); _mem_slice_head.at(m)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
      tty->print("    ");    _mem_slice_tail.at(m)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
  assert(rpo_idx == -1 && bb_ct == _block.length(), "all block members found");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
//------------------------------initialize_bb---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
// Initialize per node info
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
void SuperWord::initialize_bb() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
  Node* last = _block.at(_block.length() - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
  grow_node_info(bb_idx(last));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1284
//------------------------------bb_insert_after---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
// Insert n into block after pos
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
void SuperWord::bb_insert_after(Node* n, int pos) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
  int n_pos = pos + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
  // Make room
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
  for (int i = _block.length() - 1; i >= n_pos; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
    _block.at_put_grow(i+1, _block.at(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
  for (int j = _node_info.length() - 1; j >= n_pos; j--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
    _node_info.at_put_grow(j+1, _node_info.at(j));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
  // Set value
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
  _block.at_put_grow(n_pos, n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
  _node_info.at_put_grow(n_pos, SWNodeInfo::initial);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
  // Adjust map from node->_idx to _block index
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
  for (int i = n_pos; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
    set_bb_idx(_block.at(i), i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
//------------------------------compute_max_depth---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
// Compute max depth for expressions from beginning of block
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
// Use to prune search paths during test for independence.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1307
void SuperWord::compute_max_depth() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
  int ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
  bool again;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
  do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
    again = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
    for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
      Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
      if (!n->is_Phi()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
        int d_orig = depth(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
        int d_in   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
        for (DepPreds preds(n, _dg); !preds.done(); preds.next()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1318
          Node* pred = preds.current();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1319
          if (in_bb(pred)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1320
            d_in = MAX2(d_in, depth(pred));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
        if (d_in + 1 != d_orig) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
          set_depth(n, d_in + 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
          again = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1326
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1328
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1329
    ct++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1330
  } while (again);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
  if (TraceSuperWord && Verbose)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
    tty->print_cr("compute_max_depth iterated: %d times", ct);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1336
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1337
//-------------------------compute_vector_element_type-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
// Compute necessary vector element type for expressions
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
// This propagates backwards a narrower integer type when the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
// upper bits of the value are not needed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
// Example:  char a,b,c;  a = b + c;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
// Normally the type of the add is integer, but for packed character
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
// operations the type of the add needs to be char.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1344
void SuperWord::compute_vector_element_type() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1345
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1346
  if (TraceSuperWord && Verbose)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1347
    tty->print_cr("\ncompute_velt_type:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1348
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1349
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1350
  // Initial type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1351
  for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1352
    Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1353
    const Type* t  = n->is_Mem() ? Type::get_const_basic_type(n->as_Mem()->memory_type())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1354
                                 : _igvn.type(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1355
    const Type* vt = container_type(t);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1356
    set_velt_type(n, vt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1357
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1358
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1359
  // Propagate narrowed type backwards through operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1360
  // that don't depend on higher order bits
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1361
  for (int i = _block.length() - 1; i >= 0; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1362
    Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1363
    // Only integer types need be examined
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1364
    if (n->bottom_type()->isa_int()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1365
      uint start, end;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1366
      vector_opd_range(n, &start, &end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1367
      const Type* vt = velt_type(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1368
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
      for (uint j = start; j < end; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1370
        Node* in  = n->in(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1371
        // Don't propagate through a type conversion
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1372
        if (n->bottom_type() != in->bottom_type())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1373
          continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1374
        switch(in->Opcode()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1375
        case Op_AddI:    case Op_AddL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1376
        case Op_SubI:    case Op_SubL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1377
        case Op_MulI:    case Op_MulL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1378
        case Op_AndI:    case Op_AndL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1379
        case Op_OrI:     case Op_OrL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1380
        case Op_XorI:    case Op_XorL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
        case Op_LShiftI: case Op_LShiftL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1382
        case Op_CMoveI:  case Op_CMoveL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1383
          if (in_bb(in)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1384
            bool same_type = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1385
            for (DUIterator_Fast kmax, k = in->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1386
              Node *use = in->fast_out(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1387
              if (!in_bb(use) || velt_type(use) != vt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1388
                same_type = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1389
                break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1390
              }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1391
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1392
            if (same_type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1393
              set_velt_type(in, vt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1394
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1396
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1397
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1398
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1399
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1400
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
  if (TraceSuperWord && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
    for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
      Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
      velt_type(n)->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
      tty->print("\t");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
      n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
//------------------------------memory_alignment---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
// Alignment within a vector memory reference
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
int SuperWord::memory_alignment(MemNode* s, int iv_adjust_in_bytes) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
  SWPointer p(s, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
  if (!p.valid()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
    return bottom_align;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1419
  int offset  = p.offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1420
  offset     += iv_adjust_in_bytes;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1421
  int off_rem = offset % vector_width_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1422
  int off_mod = off_rem >= 0 ? off_rem : off_rem + vector_width_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1423
  return off_mod;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
//---------------------------container_type---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
// Smallest type containing range of values
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
const Type* SuperWord::container_type(const Type* t) {
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 360
diff changeset
  1429
  const Type* tp = t->make_ptr();
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 360
diff changeset
  1430
  if (tp && tp->isa_aryptr()) {
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 360
diff changeset
  1431
    t = tp->is_aryptr()->elem();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1433
  if (t->basic_type() == T_INT) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
    if (t->higher_equal(TypeInt::BOOL))  return TypeInt::BOOL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
    if (t->higher_equal(TypeInt::BYTE))  return TypeInt::BYTE;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
    if (t->higher_equal(TypeInt::CHAR))  return TypeInt::CHAR;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1437
    if (t->higher_equal(TypeInt::SHORT)) return TypeInt::SHORT;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
    return TypeInt::INT;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
  return t;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
//-------------------------vector_opd_range-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
// (Start, end] half-open range defining which operands are vector
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1445
void SuperWord::vector_opd_range(Node* n, uint* start, uint* end) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1446
  switch (n->Opcode()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
  case Op_LoadB:   case Op_LoadC:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1448
  case Op_LoadI:   case Op_LoadL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
  case Op_LoadF:   case Op_LoadD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
  case Op_LoadP:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1451
    *start = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
    *end   = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1453
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
  case Op_StoreB:  case Op_StoreC:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
  case Op_StoreI:  case Op_StoreL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1456
  case Op_StoreF:  case Op_StoreD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
  case Op_StoreP:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
    *start = MemNode::ValueIn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
    *end   = *start + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
  case Op_LShiftI: case Op_LShiftL:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
    *start = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
    *end   = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1464
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
  case Op_CMoveI:  case Op_CMoveL:  case Op_CMoveF:  case Op_CMoveD:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
    *start = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1467
    *end   = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
  *start = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
  *end   = n->req(); // default is all operands
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
//------------------------------in_packset---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1475
// Are s1 and s2 in a pack pair and ordered as s1,s2?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1476
bool SuperWord::in_packset(Node* s1, Node* s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1477
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1478
    Node_List* p = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1479
    assert(p->size() == 2, "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1480
    if (p->at(0) == s1 && p->at(p->size()-1) == s2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1481
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1482
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1483
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1484
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1485
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1486
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1487
//------------------------------in_pack---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1488
// Is s in pack p?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1489
Node_List* SuperWord::in_pack(Node* s, Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1490
  for (uint i = 0; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1491
    if (p->at(i) == s) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1492
      return p;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1493
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1494
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1495
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
//------------------------------remove_pack_at---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
// Remove the pack at position pos in the packset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
void SuperWord::remove_pack_at(int pos) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
  Node_List* p = _packset.at(pos);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
  for (uint i = 0; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
    Node* s = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
    set_my_pack(s, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1505
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
  _packset.remove_at(pos);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1507
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
//------------------------------executed_first---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
// Return the node executed first in pack p.  Uses the RPO block list
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
// to determine order.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
Node* SuperWord::executed_first(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
  Node* n = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
  int n_rpo = bb_idx(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
  for (uint i = 1; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
    Node* s = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
    int s_rpo = bb_idx(s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1518
    if (s_rpo < n_rpo) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
      n = s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1520
      n_rpo = s_rpo;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1521
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1522
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1523
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1524
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1525
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1526
//------------------------------executed_last---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1527
// Return the node executed last in pack p.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1528
Node* SuperWord::executed_last(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1529
  Node* n = p->at(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1530
  int n_rpo = bb_idx(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1531
  for (uint i = 1; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1532
    Node* s = p->at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1533
    int s_rpo = bb_idx(s);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1534
    if (s_rpo > n_rpo) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1535
      n = s;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
      n_rpo = s_rpo;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
//----------------------------align_initial_loop_index---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
// Adjust pre-loop limit so that in main loop, a load/store reference
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
// to align_to_ref will be a position zero in the vector.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
//   (iv + k) mod vector_align == 0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
void SuperWord::align_initial_loop_index(MemNode* align_to_ref) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
  CountedLoopNode *main_head = lp()->as_CountedLoop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
  assert(main_head->is_main_loop(), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
  CountedLoopEndNode* pre_end = get_pre_loop_end(main_head);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
  assert(pre_end != NULL, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
  Node *pre_opaq1 = pre_end->limit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
  assert(pre_opaq1->Opcode() == Op_Opaque1, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
  Opaque1Node *pre_opaq = (Opaque1Node*)pre_opaq1;
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1554
  Node *lim0 = pre_opaq->in(1);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
  // Where we put new limit calculations
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
  Node *pre_ctrl = pre_end->loopnode()->in(LoopNode::EntryControl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
  // Ensure the original loop limit is available from the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
  // pre-loop Opaque1 node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1561
  Node *orig_limit = pre_opaq->original_loop_limit();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1562
  assert(orig_limit != NULL && _igvn.type(orig_limit) != Type::TOP, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
  SWPointer align_to_ref_p(align_to_ref, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1566
  // Given:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1567
  //     lim0 == original pre loop limit
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1568
  //     V == v_align (power of 2)
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1569
  //     invar == extra invariant piece of the address expression
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1570
  //     e == k [ +/- invar ]
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1571
  //
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1572
  // When reassociating expressions involving '%' the basic rules are:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1573
  //     (a - b) % k == 0   =>  a % k == b % k
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1574
  // and:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1575
  //     (a + b) % k == 0   =>  a % k == (k - b) % k
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1576
  //
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1577
  // For stride > 0 && scale > 0,
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1578
  //   Derive the new pre-loop limit "lim" such that the two constraints:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1579
  //     (1) lim = lim0 + N           (where N is some positive integer < V)
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1580
  //     (2) (e + lim) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1581
  //   are true.
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1582
  //
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1583
  //   Substituting (1) into (2),
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1584
  //     (e + lim0 + N) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1585
  //   solve for N:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1586
  //     N = (V - (e + lim0)) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1587
  //   substitute back into (1), so that new limit
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1588
  //     lim = lim0 + (V - (e + lim0)) % V
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1589
  //
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1590
  // For stride > 0 && scale < 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1591
  //   Constraints:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1592
  //     lim = lim0 + N
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1593
  //     (e - lim) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1594
  //   Solving for lim:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1595
  //     (e - lim0 - N) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1596
  //     N = (e - lim0) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1597
  //     lim = lim0 + (e - lim0) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1598
  //
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1599
  // For stride < 0 && scale > 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1600
  //   Constraints:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1601
  //     lim = lim0 - N
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1602
  //     (e + lim) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1603
  //   Solving for lim:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1604
  //     (e + lim0 - N) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1605
  //     N = (e + lim0) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1606
  //     lim = lim0 - (e + lim0) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1607
  //
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1608
  // For stride < 0 && scale < 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1609
  //   Constraints:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1610
  //     lim = lim0 - N
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1611
  //     (e - lim) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1612
  //   Solving for lim:
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1613
  //     (e - lim0 + N) % V == 0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1614
  //     N = (V - (e - lim0)) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1615
  //     lim = lim0 - (V - (e - lim0)) % V
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1616
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1617
  int stride   = iv_stride();
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1618
  int scale    = align_to_ref_p.scale_in_bytes();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1619
  int elt_size = align_to_ref_p.memory_size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
  int v_align  = vector_width_in_bytes() / elt_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1621
  int k        = align_to_ref_p.offset_in_bytes() / elt_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1622
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
  Node *kn   = _igvn.intcon(k);
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1624
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1625
  Node *e = kn;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
  if (align_to_ref_p.invar() != NULL) {
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1627
    // incorporate any extra invariant piece producing k +/- invar >>> log2(elt)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1628
    Node* log2_elt = _igvn.intcon(exact_log2(elt_size));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1629
    Node* aref     = new (_phase->C, 3) URShiftINode(align_to_ref_p.invar(), log2_elt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1630
    _phase->_igvn.register_new_node_with_optimizer(aref);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1631
    _phase->set_ctrl(aref, pre_ctrl);
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1632
    if (align_to_ref_p.negate_invar()) {
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1633
      e = new (_phase->C, 3) SubINode(e, aref);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1634
    } else {
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1635
      e = new (_phase->C, 3) AddINode(e, aref);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
    }
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1637
    _phase->_igvn.register_new_node_with_optimizer(e);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1638
    _phase->set_ctrl(e, pre_ctrl);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1639
  }
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1640
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1641
  // compute e +/- lim0
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1642
  if (scale < 0) {
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1643
    e = new (_phase->C, 3) SubINode(e, lim0);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1644
  } else {
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1645
    e = new (_phase->C, 3) AddINode(e, lim0);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1646
  }
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1647
  _phase->_igvn.register_new_node_with_optimizer(e);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1648
  _phase->set_ctrl(e, pre_ctrl);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1649
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1650
  if (stride * scale > 0) {
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1651
    // compute V - (e +/- lim0)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1652
    Node* va  = _igvn.intcon(v_align);
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1653
    e = new (_phase->C, 3) SubINode(va, e);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1654
    _phase->_igvn.register_new_node_with_optimizer(e);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1655
    _phase->set_ctrl(e, pre_ctrl);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1656
  }
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1657
  // compute N = (exp) % V
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1658
  Node* va_msk = _igvn.intcon(v_align - 1);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1659
  Node* N = new (_phase->C, 3) AndINode(e, va_msk);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1660
  _phase->_igvn.register_new_node_with_optimizer(N);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1661
  _phase->set_ctrl(N, pre_ctrl);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1662
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1663
  //   substitute back into (1), so that new limit
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1664
  //     lim = lim0 + N
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1665
  Node* lim;
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1666
  if (stride < 0) {
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1667
    lim = new (_phase->C, 3) SubINode(lim0, N);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1668
  } else {
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1669
    lim = new (_phase->C, 3) AddINode(lim0, N);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1670
  }
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1671
  _phase->_igvn.register_new_node_with_optimizer(lim);
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1672
  _phase->set_ctrl(lim, pre_ctrl);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1673
  Node* constrained =
245
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1674
    (stride > 0) ? (Node*) new (_phase->C,3) MinINode(lim, orig_limit)
b9df534a2faa 6663621: JVM crashes while trying to execute api/java_security/Signature/SignatureTests.html#initSign tests.
never
parents: 202
diff changeset
  1675
                 : (Node*) new (_phase->C,3) MaxINode(lim, orig_limit);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1676
  _phase->_igvn.register_new_node_with_optimizer(constrained);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1677
  _phase->set_ctrl(constrained, pre_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1678
  _igvn.hash_delete(pre_opaq);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1679
  pre_opaq->set_req(1, constrained);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1680
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
//----------------------------get_pre_loop_end---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1683
// Find pre loop end from main loop.  Returns null if none.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1684
CountedLoopEndNode* SuperWord::get_pre_loop_end(CountedLoopNode *cl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1685
  Node *ctrl = cl->in(LoopNode::EntryControl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1686
  if (!ctrl->is_IfTrue() && !ctrl->is_IfFalse()) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1687
  Node *iffm = ctrl->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1688
  if (!iffm->is_If()) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1689
  Node *p_f = iffm->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1690
  if (!p_f->is_IfFalse()) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1691
  if (!p_f->in(0)->is_CountedLoopEnd()) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1692
  CountedLoopEndNode *pre_end = p_f->in(0)->as_CountedLoopEnd();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1693
  if (!pre_end->loopnode()->is_pre_loop()) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1694
  return pre_end;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1695
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1696
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1697
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1698
//------------------------------init---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1699
void SuperWord::init() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1700
  _dg.init();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
  _packset.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1702
  _disjoint_ptrs.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1703
  _block.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1704
  _data_entry.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1705
  _mem_slice_head.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1706
  _mem_slice_tail.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1707
  _node_info.clear();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1708
  _align_to_ref = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1709
  _lpt = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1710
  _lp = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1711
  _bb = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1712
  _iv = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1713
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1714
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1715
//------------------------------print_packset---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1716
void SuperWord::print_packset() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1717
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1718
  tty->print_cr("packset");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
  for (int i = 0; i < _packset.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
    tty->print_cr("Pack: %d", i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
    Node_List* p = _packset.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
    print_pack(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1723
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1724
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
//------------------------------print_pack---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
void SuperWord::print_pack(Node_List* p) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1729
  for (uint i = 0; i < p->size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1730
    print_stmt(p->at(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1731
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1732
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1733
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1734
//------------------------------print_bb---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1735
void SuperWord::print_bb() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1736
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1737
  tty->print_cr("\nBlock");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1738
  for (int i = 0; i < _block.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1739
    Node* n = _block.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1740
    tty->print("%d ", i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1741
    if (n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1742
      n->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1743
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1744
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1745
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1746
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1747
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1748
//------------------------------print_stmt---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1749
void SuperWord::print_stmt(Node* s) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1750
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1751
  tty->print(" align: %d \t", alignment(s));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1752
  s->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1753
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1754
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1755
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1756
//------------------------------blank---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1757
char* SuperWord::blank(uint depth) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1758
  static char blanks[101];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1759
  assert(depth < 101, "too deep");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1760
  for (uint i = 0; i < depth; i++) blanks[i] = ' ';
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1761
  blanks[depth] = '\0';
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1762
  return blanks;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1763
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1764
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1765
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1766
//==============================SWPointer===========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1767
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1768
//----------------------------SWPointer------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1769
SWPointer::SWPointer(MemNode* mem, SuperWord* slp) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1770
  _mem(mem), _slp(slp),  _base(NULL),  _adr(NULL),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1771
  _scale(0), _offset(0), _invar(NULL), _negate_invar(false) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1772
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1773
  Node* adr = mem->in(MemNode::Address);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1774
  if (!adr->is_AddP()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1775
    assert(!valid(), "too complex");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1776
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1777
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1778
  // Match AddP(base, AddP(ptr, k*iv [+ invariant]), constant)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1779
  Node* base = adr->in(AddPNode::Base);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1780
  for (int i = 0; i < 3; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1781
    if (!scaled_iv_plus_offset(adr->in(AddPNode::Offset))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1782
      assert(!valid(), "too complex");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1783
      return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1784
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1785
    adr = adr->in(AddPNode::Address);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1786
    if (base == adr || !adr->is_AddP()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1787
      break; // stop looking at addp's
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1788
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1789
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1790
  _base = base;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1791
  _adr  = adr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1792
  assert(valid(), "Usable");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1793
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1794
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1795
// Following is used to create a temporary object during
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1796
// the pattern match of an address expression.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1797
SWPointer::SWPointer(SWPointer* p) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1798
  _mem(p->_mem), _slp(p->_slp),  _base(NULL),  _adr(NULL),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1799
  _scale(0), _offset(0), _invar(NULL), _negate_invar(false) {}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1800
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1801
//------------------------scaled_iv_plus_offset--------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1802
// Match: k*iv + offset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1803
// where: k is a constant that maybe zero, and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1804
//        offset is (k2 [+/- invariant]) where k2 maybe zero and invariant is optional
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1805
bool SWPointer::scaled_iv_plus_offset(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1806
  if (scaled_iv(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1807
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1808
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1809
  if (offset_plus_k(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1810
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1811
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1812
  int opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1813
  if (opc == Op_AddI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1814
    if (scaled_iv(n->in(1)) && offset_plus_k(n->in(2))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1815
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1816
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1817
    if (scaled_iv(n->in(2)) && offset_plus_k(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1818
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1819
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1820
  } else if (opc == Op_SubI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1821
    if (scaled_iv(n->in(1)) && offset_plus_k(n->in(2), true)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1822
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1823
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1824
    if (scaled_iv(n->in(2)) && offset_plus_k(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1825
      _scale *= -1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1826
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1827
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1828
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1829
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1830
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1831
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1832
//----------------------------scaled_iv------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1833
// Match: k*iv where k is a constant that's not zero
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1834
bool SWPointer::scaled_iv(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1835
  if (_scale != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1836
    return false;  // already found a scale
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1837
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1838
  if (n == iv()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1839
    _scale = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1840
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1841
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1842
  int opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1843
  if (opc == Op_MulI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1844
    if (n->in(1) == iv() && n->in(2)->is_Con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1845
      _scale = n->in(2)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1846
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1847
    } else if (n->in(2) == iv() && n->in(1)->is_Con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1848
      _scale = n->in(1)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1849
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1850
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1851
  } else if (opc == Op_LShiftI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1852
    if (n->in(1) == iv() && n->in(2)->is_Con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1853
      _scale = 1 << n->in(2)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1854
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1855
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1856
  } else if (opc == Op_ConvI2L) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1857
    if (scaled_iv_plus_offset(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1858
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1859
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1860
  } else if (opc == Op_LShiftL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1861
    if (!has_iv() && _invar == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1862
      // Need to preserve the current _offset value, so
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1863
      // create a temporary object for this expression subtree.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1864
      // Hacky, so should re-engineer the address pattern match.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1865
      SWPointer tmp(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1866
      if (tmp.scaled_iv_plus_offset(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1867
        if (tmp._invar == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1868
          int mult = 1 << n->in(2)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1869
          _scale   = tmp._scale  * mult;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1870
          _offset += tmp._offset * mult;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1871
          return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1872
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1873
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1874
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1875
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1876
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1877
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1878
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1879
//----------------------------offset_plus_k------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1880
// Match: offset is (k [+/- invariant])
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1881
// where k maybe zero and invariant is optional, but not both.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1882
bool SWPointer::offset_plus_k(Node* n, bool negate) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1883
  int opc = n->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1884
  if (opc == Op_ConI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1885
    _offset += negate ? -(n->get_int()) : n->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1886
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1887
  } else if (opc == Op_ConL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1888
    // Okay if value fits into an int
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1889
    const TypeLong* t = n->find_long_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1890
    if (t->higher_equal(TypeLong::INT)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1891
      jlong loff = n->get_long();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1892
      jint  off  = (jint)loff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1893
      _offset += negate ? -off : loff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1894
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1895
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1896
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1897
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1898
  if (_invar != NULL) return false; // already have an invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1899
  if (opc == Op_AddI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1900
    if (n->in(2)->is_Con() && invariant(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1901
      _negate_invar = negate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1902
      _invar = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1903
      _offset += negate ? -(n->in(2)->get_int()) : n->in(2)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1904
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1905
    } else if (n->in(1)->is_Con() && invariant(n->in(2))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1906
      _offset += negate ? -(n->in(1)->get_int()) : n->in(1)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1907
      _negate_invar = negate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1908
      _invar = n->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1909
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1910
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1911
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1912
  if (opc == Op_SubI) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1913
    if (n->in(2)->is_Con() && invariant(n->in(1))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1914
      _negate_invar = negate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1915
      _invar = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1916
      _offset += !negate ? -(n->in(2)->get_int()) : n->in(2)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1917
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1918
    } else if (n->in(1)->is_Con() && invariant(n->in(2))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1919
      _offset += negate ? -(n->in(1)->get_int()) : n->in(1)->get_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1920
      _negate_invar = !negate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1921
      _invar = n->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1922
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1923
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1924
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1925
  if (invariant(n)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1926
    _negate_invar = negate;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1927
    _invar = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1928
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1929
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1930
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1931
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1932
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1933
//----------------------------print------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1934
void SWPointer::print() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1935
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1936
  tty->print("base: %d  adr: %d  scale: %d  offset: %d  invar: %c%d\n",
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1937
             _base != NULL ? _base->_idx : 0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1938
             _adr  != NULL ? _adr->_idx  : 0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1939
             _scale, _offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1940
             _negate_invar?'-':'+',
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1941
             _invar != NULL ? _invar->_idx : 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1942
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1943
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1944
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1945
// ========================= OrderedPair =====================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1946
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1947
const OrderedPair OrderedPair::initial;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1948
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1949
// ========================= SWNodeInfo =====================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1950
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1951
const SWNodeInfo SWNodeInfo::initial;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1952
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1953
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1954
// ============================ DepGraph ===========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1955
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1956
//------------------------------make_node---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1957
// Make a new dependence graph node for an ideal node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1958
DepMem* DepGraph::make_node(Node* node) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1959
  DepMem* m = new (_arena) DepMem(node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1960
  if (node != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1961
    assert(_map.at_grow(node->_idx) == NULL, "one init only");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1962
    _map.at_put_grow(node->_idx, m);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1963
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1964
  return m;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1965
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1966
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1967
//------------------------------make_edge---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1968
// Make a new dependence graph edge from dpred -> dsucc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1969
DepEdge* DepGraph::make_edge(DepMem* dpred, DepMem* dsucc) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1970
  DepEdge* e = new (_arena) DepEdge(dpred, dsucc, dsucc->in_head(), dpred->out_head());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1971
  dpred->set_out_head(e);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1972
  dsucc->set_in_head(e);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1973
  return e;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1974
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1975
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1976
// ========================== DepMem ========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1977
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1978
//------------------------------in_cnt---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1979
int DepMem::in_cnt() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1980
  int ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1981
  for (DepEdge* e = _in_head; e != NULL; e = e->next_in()) ct++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1982
  return ct;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1983
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1984
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1985
//------------------------------out_cnt---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1986
int DepMem::out_cnt() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1987
  int ct = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1988
  for (DepEdge* e = _out_head; e != NULL; e = e->next_out()) ct++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1989
  return ct;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1990
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1991
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1992
//------------------------------print-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1993
void DepMem::print() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1994
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1995
  tty->print("  DepNode %d (", _node->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1996
  for (DepEdge* p = _in_head; p != NULL; p = p->next_in()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1997
    Node* pred = p->pred()->node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1998
    tty->print(" %d", pred != NULL ? pred->_idx : 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1999
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2000
  tty->print(") [");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2001
  for (DepEdge* s = _out_head; s != NULL; s = s->next_out()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2002
    Node* succ = s->succ()->node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2003
    tty->print(" %d", succ != NULL ? succ->_idx : 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2004
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2005
  tty->print_cr(" ]");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2006
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2007
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2008
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2009
// =========================== DepEdge =========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2010
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2011
//------------------------------DepPreds---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2012
void DepEdge::print() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2013
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2014
  tty->print_cr("DepEdge: %d [ %d ]", _pred->node()->_idx, _succ->node()->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2015
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2016
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2017
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2018
// =========================== DepPreds =========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2019
// Iterator over predecessor edges in the dependence graph.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2020
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2021
//------------------------------DepPreds---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2022
DepPreds::DepPreds(Node* n, DepGraph& dg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2023
  _n = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2024
  _done = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2025
  if (_n->is_Store() || _n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2026
    _next_idx = MemNode::Address;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2027
    _end_idx  = n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2028
    _dep_next = dg.dep(_n)->in_head();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2029
  } else if (_n->is_Mem()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2030
    _next_idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2031
    _end_idx  = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2032
    _dep_next = dg.dep(_n)->in_head();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2033
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2034
    _next_idx = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2035
    _end_idx  = _n->req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2036
    _dep_next = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2037
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2038
  next();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2039
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2040
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2041
//------------------------------next---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2042
void DepPreds::next() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2043
  if (_dep_next != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2044
    _current  = _dep_next->pred()->node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2045
    _dep_next = _dep_next->next_in();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2046
  } else if (_next_idx < _end_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2047
    _current  = _n->in(_next_idx++);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2048
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2049
    _done = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2050
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2051
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2052
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2053
// =========================== DepSuccs =========================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2054
// Iterator over successor edges in the dependence graph.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2055
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2056
//------------------------------DepSuccs---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2057
DepSuccs::DepSuccs(Node* n, DepGraph& dg) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2058
  _n = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2059
  _done = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2060
  if (_n->is_Load()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2061
    _next_idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2062
    _end_idx  = _n->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2063
    _dep_next = dg.dep(_n)->out_head();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2064
  } else if (_n->is_Mem() || _n->is_Phi() && _n->bottom_type() == Type::MEMORY) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2065
    _next_idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2066
    _end_idx  = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2067
    _dep_next = dg.dep(_n)->out_head();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2068
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2069
    _next_idx = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2070
    _end_idx  = _n->outcnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2071
    _dep_next = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2072
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2073
  next();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2074
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2075
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2076
//-------------------------------next---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2077
void DepSuccs::next() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2078
  if (_dep_next != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2079
    _current  = _dep_next->succ()->node();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2080
    _dep_next = _dep_next->next_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2081
  } else if (_next_idx < _end_idx) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2082
    _current  = _n->raw_out(_next_idx++);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2083
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2084
    _done = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2085
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2086
}