hotspot/src/share/vm/opto/loopnode.hpp
author mcberg
Fri, 12 Feb 2016 16:12:15 -0800
changeset 36066 60ce66ce3c76
parent 36065 4f0e0cb7b016
child 36309 61fbc15c4d23
permissions -rw-r--r--
8149421: Vectorized Post Loops Summary: add vectorised post loop for counted loops with vectors. Reviewed-by: kvn
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
35084
5b34a4ae0f58 6869327: Add new C2 flag to keep safepoints in counted loops.
aeriksso
parents: 34164
diff changeset
     2
 * Copyright (c) 1998, 2015, Oracle and/or its affiliates. All rights reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
5547
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5054
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5054
diff changeset
    20
 * or visit www.oracle.com if you need additional information or have any
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 5054
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    25
#ifndef SHARE_VM_OPTO_LOOPNODE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    26
#define SHARE_VM_OPTO_LOOPNODE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    27
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    28
#include "opto/cfgnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    29
#include "opto/multnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    30
#include "opto/phaseX.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    31
#include "opto/subnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    32
#include "opto/type.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
    33
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
class CmpNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
class CountedLoopEndNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
class CountedLoopNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
class IdealLoopTree;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
class LoopNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
class Node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
class PhaseIdealLoop;
33166
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
    41
class CountedLoopReserveKit;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
class VectorSet;
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
    43
class Invariance;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
struct small_cache;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
//                  I D E A L I Z E D   L O O P S
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
// Idealized loops are the set of loops I perform more interesting
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
// transformations on, beyond simple hoisting.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
//------------------------------LoopNode---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
// Simple loop header.  Fall in path on left, loop-back path on right.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
class LoopNode : public RegionNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
  // Size is bigger to hold the flags.  However, the flags do not change
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
  // the semantics so it does not appear in the hash & cmp functions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
protected:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  short _loop_flags;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  // Names for flag bitfields
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    61
  enum { Normal=0, Pre=1, Main=2, Post=3, PreMainPostFlagsMask=3,
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    62
         MainHasNoPreLoop=4,
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    63
         HasExactTripCount=8,
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    64
         InnerLoop=16,
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    65
         PartialPeelLoop=32,
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
    66
         PartialPeelFailed=64,
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
    67
         HasReductions=128,
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
    68
         WasSlpAnalyzed=256,
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
    69
         PassedSlpAnalysis=512,
36066
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
    70
         DoUnrollOnly=1024,
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
    71
         VectorizedLoop=2048,
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
    72
         HasAtomicPostLoop=4096 };
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  char _unswitch_count;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  enum { _unswitch_max=3 };
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
  // Names for edge indices
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  enum { Self=0, EntryControl, LoopBackControl };
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    80
  int is_inner_loop() const { return _loop_flags & InnerLoop; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    81
  void set_inner_loop() { _loop_flags |= InnerLoop; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    83
  int is_partial_peel_loop() const { return _loop_flags & PartialPeelLoop; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    84
  void set_partial_peel_loop() { _loop_flags |= PartialPeelLoop; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    85
  int partial_peel_has_failed() const { return _loop_flags & PartialPeelFailed; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
    86
  void mark_partial_peel_failed() { _loop_flags |= PartialPeelFailed; }
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
    87
  void mark_has_reductions() { _loop_flags |= HasReductions; }
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
    88
  void mark_was_slp() { _loop_flags |= WasSlpAnalyzed; }
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
    89
  void mark_passed_slp() { _loop_flags |= PassedSlpAnalysis; }
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
    90
  void mark_do_unroll_only() { _loop_flags |= DoUnrollOnly; }
36066
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
    91
  void mark_loop_vectorized() { _loop_flags |= VectorizedLoop; }
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
    92
  void mark_has_atomic_post_loop() { _loop_flags |= HasAtomicPostLoop; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
  int unswitch_max() { return _unswitch_max; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
  int unswitch_count() { return _unswitch_count; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  void set_unswitch_count(int val) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
    assert (val <= unswitch_max(), "too many unswitches");
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
    _unswitch_count = val;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
  LoopNode( Node *entry, Node *backedge ) : RegionNode(3), _loop_flags(0), _unswitch_count(0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
    init_class_id(Class_Loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
    init_req(EntryControl, entry);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
    init_req(LoopBackControl, backedge);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  bool can_be_counted_loop(PhaseTransform* phase) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
    return req() == 3 && in(0) != NULL &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
      in(1) != NULL && phase->type(in(1)) != Type::TOP &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
      in(2) != NULL && phase->type(in(2)) != Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  }
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   114
  bool is_valid_counted_loop() const;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
//------------------------------Counted Loops----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
// Counted loops are all trip-counted loops, with exactly 1 trip-counter exit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
// path (and maybe some other exit paths).  The trip-counter exit is always
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   123
// last in the loop.  The trip-counter have to stride by a constant;
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   124
// the exit value is also loop invariant.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
// CountedLoopNodes and CountedLoopEndNodes come in matched pairs.  The
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
// CountedLoopNode has the incoming loop control and the loop-back-control
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
// which is always the IfTrue before the matching CountedLoopEndNode.  The
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
// CountedLoopEndNode has an incoming control (possibly not the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
// CountedLoopNode if there is control flow in the loop), the post-increment
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
// trip-counter value, and the limit.  The trip-counter value is always of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
// the form (Op old-trip-counter stride).  The old-trip-counter is produced
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   133
// by a Phi connected to the CountedLoopNode.  The stride is constant.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
// The Op is any commutable opcode, including Add, Mul, Xor.  The
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
// CountedLoopEndNode also takes in the loop-invariant limit value.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
// From a CountedLoopNode I can reach the matching CountedLoopEndNode via the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
// loop-back control.  From CountedLoopEndNodes I can reach CountedLoopNodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
// via the old-trip-counter from the Op node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
//------------------------------CountedLoopNode--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
// CountedLoopNodes head simple counted loops.  CountedLoopNodes have as
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
// inputs the incoming loop-start control and the loop-back control, so they
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
// act like RegionNodes.  They also take in the initial trip counter, the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
// loop-invariant stride and the loop-invariant limit value.  CountedLoopNodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
// produce a loop-body control and the trip counter value.  Since
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
// CountedLoopNodes behave like RegionNodes I still have a standard CFG model.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
class CountedLoopNode : public LoopNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
  // Size is bigger to hold _main_idx.  However, _main_idx does not change
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  // the semantics so it does not appear in the hash & cmp functions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  // For Pre- and Post-loops during debugging ONLY, this holds the index of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
  // the Main CountedLoop.  Used to assert that we understand the graph shape.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
  node_idx_t _main_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   158
  // Known trip count calculated by compute_exact_trip_count()
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   159
  uint  _trip_count;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
  // Expected trip count from profile data
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
  float _profile_trip_cnt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  // Log2 of original loop bodies in unrolled loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  int _unrolled_count_log2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
  // Node count prior to last unrolling - used to decide if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
  // unroll,optimize,unroll,optimize,... is making progress
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
  int _node_count_before_unroll;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   171
  // If slp analysis is performed we record the maximum
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   172
  // vector mapped unroll factor here
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   173
  int _slp_maximum_unroll_factor;
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   174
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
  CountedLoopNode( Node *entry, Node *backedge )
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   177
    : LoopNode(entry, backedge), _main_idx(0), _trip_count(max_juint),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
      _profile_trip_cnt(COUNT_UNKNOWN), _unrolled_count_log2(0),
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   179
      _node_count_before_unroll(0), _slp_maximum_unroll_factor(0) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
    init_class_id(Class_CountedLoop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
    // Initialize _trip_count to the largest possible value.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
    // Will be reset (lower) if the loop's trip count is known.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
  Node *init_control() const { return in(EntryControl); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
  Node *back_control() const { return in(LoopBackControl); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
  CountedLoopEndNode *loopexit() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
  Node *init_trip() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
  Node *stride() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
  int   stride_con() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
  bool  stride_is_con() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  Node *limit() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
  Node *incr() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
  Node *phi() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
  // Match increment with optional truncation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
  static Node* match_incr_with_optional_truncation(Node* expr, Node** trunc1, Node** trunc2, const TypeInt** trunc_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
  // A 'main' loop has a pre-loop and a post-loop.  The 'main' loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
  // can run short a few iterations and may start a few iterations in.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  // It will be RCE'd and unrolled and aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  // A following 'post' loop will run any remaining iterations.  Used
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  // during Range Check Elimination, the 'post' loop will do any final
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
  // iterations with full checks.  Also used by Loop Unrolling, where
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
  // the 'post' loop will do any epilog iterations needed.  Basically,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  // a 'post' loop can not profitably be further unrolled or RCE'd.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
  // A preceding 'pre' loop will run at least 1 iteration (to do peeling),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  // it may do under-flow checks for RCE and may do alignment iterations
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
  // so the following main loop 'knows' that it is striding down cache
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
  // lines.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
  // A 'main' loop that is ONLY unrolled or peeled, never RCE'd or
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
  // Aligned, may be missing it's pre-loop.
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   219
  int is_normal_loop   () const { return (_loop_flags&PreMainPostFlagsMask) == Normal; }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   220
  int is_pre_loop      () const { return (_loop_flags&PreMainPostFlagsMask) == Pre;    }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   221
  int is_main_loop     () const { return (_loop_flags&PreMainPostFlagsMask) == Main;   }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   222
  int is_post_loop     () const { return (_loop_flags&PreMainPostFlagsMask) == Post;   }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   223
  int is_reduction_loop() const { return (_loop_flags&HasReductions) == HasReductions; }
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
   224
  int was_slp_analyzed () const { return (_loop_flags&WasSlpAnalyzed) == WasSlpAnalyzed; }
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   225
  int has_passed_slp   () const { return (_loop_flags&PassedSlpAnalysis) == PassedSlpAnalysis; }
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
   226
  int do_unroll_only      () const { return (_loop_flags&DoUnrollOnly) == DoUnrollOnly; }
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   227
  int is_main_no_pre_loop() const { return _loop_flags & MainHasNoPreLoop; }
36066
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
   228
  int is_vectorized_loop    () const { return (_loop_flags & VectorizedLoop) == VectorizedLoop; }
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
   229
  int has_atomic_post_loop  () const { return (_loop_flags & HasAtomicPostLoop) == HasAtomicPostLoop; }
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   230
  void set_main_no_pre_loop() { _loop_flags |= MainHasNoPreLoop; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
1399
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 670
diff changeset
   232
  int main_idx() const { return _main_idx; }
9648dfd4ce09 6384206: Phis which are later unneeded are impairing our ability to inline based on static types
never
parents: 670
diff changeset
   233
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
  void set_pre_loop  (CountedLoopNode *main) { assert(is_normal_loop(),""); _loop_flags |= Pre ; _main_idx = main->_idx; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  void set_main_loop (                     ) { assert(is_normal_loop(),""); _loop_flags |= Main;                         }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
  void set_post_loop (CountedLoopNode *main) { assert(is_normal_loop(),""); _loop_flags |= Post; _main_idx = main->_idx; }
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   238
  void set_normal_loop(                    ) { _loop_flags &= ~PreMainPostFlagsMask; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   239
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   240
  void set_trip_count(uint tc) { _trip_count = tc; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   241
  uint trip_count()            { return _trip_count; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   243
  bool has_exact_trip_count() const { return (_loop_flags & HasExactTripCount) != 0; }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   244
  void set_exact_trip_count(uint tc) {
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   245
    _trip_count = tc;
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   246
    _loop_flags |= HasExactTripCount;
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   247
  }
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   248
  void set_nonexact_trip_count() {
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   249
    _loop_flags &= ~HasExactTripCount;
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   250
  }
31772
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
   251
  void set_notpassed_slp() {
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
   252
    _loop_flags &= ~PassedSlpAnalysis;
718fc367468d 8129920: Vectorized loop unrolling
kvn
parents: 31403
diff changeset
   253
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  void set_profile_trip_cnt(float ptc) { _profile_trip_cnt = ptc; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
  float profile_trip_cnt()             { return _profile_trip_cnt; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  void double_unrolled_count() { _unrolled_count_log2++; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
  int  unrolled_count()        { return 1 << MIN2(_unrolled_count_log2, BitsPerInt-3); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   261
  void set_node_count_before_unroll(int ct)  { _node_count_before_unroll = ct; }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   262
  int  node_count_before_unroll()            { return _node_count_before_unroll; }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   263
  void set_slp_max_unroll(int unroll_factor) { _slp_maximum_unroll_factor = unroll_factor; }
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   264
  int  slp_max_unroll() const                { return _slp_maximum_unroll_factor; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
//------------------------------CountedLoopEndNode-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
// CountedLoopEndNodes end simple trip counted loops.  They act much like
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
// IfNodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
class CountedLoopEndNode : public IfNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  enum { TestControl, TestValue };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
  CountedLoopEndNode( Node *control, Node *test, float prob, float cnt )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
    : IfNode( control, test, prob, cnt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
    init_class_id(Class_CountedLoopEnd);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
  Node *cmp_node() const            { return (in(TestValue)->req() >=2) ? in(TestValue)->in(1) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
  Node *incr() const                { Node *tmp = cmp_node(); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
  Node *limit() const               { Node *tmp = cmp_node(); return (tmp && tmp->req()==3) ? tmp->in(2) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  Node *stride() const              { Node *tmp = incr    (); return (tmp && tmp->req()==3) ? tmp->in(2) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
  Node *phi() const                 { Node *tmp = incr    (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
  Node *init_trip() const           { Node *tmp = phi     (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  int stride_con() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
  bool stride_is_con() const        { Node *tmp = stride  (); return (tmp != NULL && tmp->is_Con()); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
  BoolTest::mask test_trip() const  { return in(TestValue)->as_Bool()->_test._test; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
  CountedLoopNode *loopnode() const {
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   294
    // The CountedLoopNode that goes with this CountedLoopEndNode may
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   295
    // have been optimized out by the IGVN so be cautious with the
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   296
    // pattern matching on the graph
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   297
    if (phi() == NULL) {
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   298
      return NULL;
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   299
    }
33067
0cabc639c87b 8134739: compiler/loopopts/superword/TestVectorizationWithInvariant crashes in loop opts
thartmann
parents: 32372
diff changeset
   300
    assert(phi()->is_Phi(), "should be PhiNode");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
    Node *ln = phi()->in(0);
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   302
    if (ln->is_CountedLoop() && ln->as_CountedLoop()->loopexit() == this) {
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   303
      return (CountedLoopNode*)ln;
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   304
    }
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   305
    return NULL;
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   306
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  virtual void dump_spec(outputStream *st) const;
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
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
inline CountedLoopEndNode *CountedLoopNode::loopexit() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
  Node *bc = back_control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  if( bc == NULL ) return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
  Node *le = bc->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  if( le->Opcode() != Op_CountedLoopEnd )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  return (CountedLoopEndNode*)le;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
inline Node *CountedLoopNode::init_trip() const { return loopexit() ? loopexit()->init_trip() : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
inline Node *CountedLoopNode::stride() const { return loopexit() ? loopexit()->stride() : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
inline int CountedLoopNode::stride_con() const { return loopexit() ? loopexit()->stride_con() : 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
inline bool CountedLoopNode::stride_is_con() const { return loopexit() && loopexit()->stride_is_con(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
inline Node *CountedLoopNode::limit() const { return loopexit() ? loopexit()->limit() : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
inline Node *CountedLoopNode::incr() const { return loopexit() ? loopexit()->incr() : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
inline Node *CountedLoopNode::phi() const { return loopexit() ? loopexit()->phi() : NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   330
//------------------------------LoopLimitNode-----------------------------
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   331
// Counted Loop limit node which represents exact final iterator value:
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   332
// trip_count = (limit - init_trip + stride - 1)/stride
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   333
// final_value= trip_count * stride + init_trip.
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   334
// Use HW instructions to calculate it when it can overflow in integer.
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   335
// Note, final_value should fit into integer since counted loop has
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   336
// limit check: limit <= max_int-stride.
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   337
class LoopLimitNode : public Node {
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   338
  enum { Init=1, Limit=2, Stride=3 };
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   339
 public:
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   340
  LoopLimitNode( Compile* C, Node *init, Node *limit, Node *stride ) : Node(0,init,limit,stride) {
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   341
    // Put it on the Macro nodes list to optimize during macro nodes expansion.
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   342
    init_flags(Flag_is_macro);
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   343
    C->add_macro_node(this);
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   344
  }
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   345
  virtual int Opcode() const;
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   346
  virtual const Type *bottom_type() const { return TypeInt::INT; }
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   347
  virtual uint ideal_reg() const { return Op_RegI; }
35551
36ef3841fb34 8146629: Make phase->is_IterGVN() accessible from Node::Identity and Node::Value
thartmann
parents: 35084
diff changeset
   348
  virtual const Type* Value(PhaseGVN* phase) const;
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   349
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
35551
36ef3841fb34 8146629: Make phase->is_IterGVN() accessible from Node::Identity and Node::Value
thartmann
parents: 35084
diff changeset
   350
  virtual Node* Identity(PhaseGVN* phase);
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   351
};
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
// -----------------------------IdealLoopTree----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
class IdealLoopTree : public ResourceObj {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
  IdealLoopTree *_parent;       // Parent in loop tree
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
  IdealLoopTree *_next;         // Next sibling in loop tree
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
  IdealLoopTree *_child;        // First child in loop tree
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  // The head-tail backedge defines the loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  // If tail is NULL then this loop has multiple backedges as part of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
  // same loop.  During cleanup I'll peel off the multiple backedges; merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
  // them at the loop bottom and flow 1 real backedge into the loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
  Node *_head;                  // Head of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  Node *_tail;                  // Tail of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  inline Node *tail();          // Handle lazy update of _tail field
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  PhaseIdealLoop* _phase;
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   368
  int _local_loop_unroll_limit;
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   369
  int _local_loop_unroll_factor;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
  Node_List _body;              // Loop body for inner loops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
24425
53764d2358f9 8041415: remove port.{cpp,hpp} files
zgu
parents: 22234
diff changeset
   373
  uint8_t _nest;                // Nesting depth
53764d2358f9 8041415: remove port.{cpp,hpp} files
zgu
parents: 22234
diff changeset
   374
  uint8_t _irreducible:1,       // True if irreducible
53764d2358f9 8041415: remove port.{cpp,hpp} files
zgu
parents: 22234
diff changeset
   375
          _has_call:1,          // True if has call safepoint
53764d2358f9 8041415: remove port.{cpp,hpp} files
zgu
parents: 22234
diff changeset
   376
          _has_sfpt:1,          // True if has non-call safepoint
53764d2358f9 8041415: remove port.{cpp,hpp} files
zgu
parents: 22234
diff changeset
   377
          _rce_candidate:1;     // True if candidate for range check elimination
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
13524
bae2f51dfb73 7160161: Missed safepoint in non-Counted loop
kvn
parents: 11447
diff changeset
   379
  Node_List* _safepts;          // List of safepoints in this loop
212
cd4963e67949 6667612: (Escape Analysis) disable loop cloning if it has a scalar replaceable allocation
kvn
parents: 190
diff changeset
   380
  Node_List* _required_safept;  // A inner loop cannot delete these safepts;
cd4963e67949 6667612: (Escape Analysis) disable loop cloning if it has a scalar replaceable allocation
kvn
parents: 190
diff changeset
   381
  bool  _allow_optimizations;   // Allow loop optimizations
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
  IdealLoopTree( PhaseIdealLoop* phase, Node *head, Node *tail )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
    : _parent(0), _next(0), _child(0),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
      _head(head), _tail(tail),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
      _phase(phase),
13524
bae2f51dfb73 7160161: Missed safepoint in non-Counted loop
kvn
parents: 11447
diff changeset
   387
      _safepts(NULL),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
      _required_safept(NULL),
212
cd4963e67949 6667612: (Escape Analysis) disable loop cloning if it has a scalar replaceable allocation
kvn
parents: 190
diff changeset
   389
      _allow_optimizations(true),
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   390
      _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0),
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   391
      _local_loop_unroll_limit(0), _local_loop_unroll_factor(0)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
  { }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
  // Is 'l' a member of 'this'?
32372
b82e88dcb26c 8080289: Intermediate writes in a loop not eliminated by optimizer
roland
parents: 31772
diff changeset
   395
  bool is_member(const IdealLoopTree *l) const; // Test for nested membership
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
  // Set loop nesting depth.  Accumulate has_call bits.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
  int set_nest( uint depth );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  // Split out multiple fall-in edges from the loop header.  Move them to a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
  // private RegionNode before the loop.  This becomes the loop landing pad.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
  void split_fall_in( PhaseIdealLoop *phase, int fall_in_cnt );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
  // Split out the outermost loop from this shared header.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
  void split_outer_loop( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
  // Merge all the backedges from the shared header into a private Region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
  // Feed that region as the one backedge to this loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
  void merge_many_backedges( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
  // Split shared headers and insert loop landing pads.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
  // Insert a LoopNode to replace the RegionNode.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
  // Returns TRUE if loop tree is structurally changed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
  bool beautify_loops( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   416
  // Perform optimization to use the loop predicates for null checks and range checks.
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   417
  // Applies to any loop level (not just the innermost one)
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   418
  bool loop_predication( PhaseIdealLoop *phase);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   419
1433
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   420
  // Perform iteration-splitting on inner loops.  Split iterations to
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   421
  // avoid range checks or one-shot null checks.  Returns false if the
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   422
  // current round of loop opts should stop.
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   423
  bool iteration_split( PhaseIdealLoop *phase, Node_List &old_new );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
1433
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   425
  // Driver for various flavors of iteration splitting.  Returns false
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   426
  // if the current round of loop opts should stop.
ee60bd139c07 6743188: incomplete fix for 6700047 C2 failed in idom_no_update
never
parents: 1399
diff changeset
   427
  bool iteration_split_impl( PhaseIdealLoop *phase, Node_List &old_new );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
  // Given dominators, try to find loops with calls that must always be
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
  // executed (call dominates loop tail).  These loops do not need non-call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
  // safepoints (ncsfpt).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
  void check_safepts(VectorSet &visited, Node_List &stack);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
  // Allpaths backwards scan from loop tail, terminating each path at first safepoint
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
  // encountered.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
  void allpaths_check_safepts(VectorSet &visited, Node_List &stack);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
35084
5b34a4ae0f58 6869327: Add new C2 flag to keep safepoints in counted loops.
aeriksso
parents: 34164
diff changeset
   438
  // Remove safepoints from loop. Optionally keeping one.
5b34a4ae0f58 6869327: Add new C2 flag to keep safepoints in counted loops.
aeriksso
parents: 34164
diff changeset
   439
  void remove_safepoints(PhaseIdealLoop* phase, bool keep_one);
5b34a4ae0f58 6869327: Add new C2 flag to keep safepoints in counted loops.
aeriksso
parents: 34164
diff changeset
   440
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
  // Convert to counted loops where possible
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
  void counted_loop( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
  // Check for Node being a loop-breaking test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
  Node *is_loop_exit(Node *iff) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
  // Returns true if ctrl is executed on every complete iteration
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
  bool dominates_backedge(Node* ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
  // Remove simplistic dead code from loop body
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
  void DCE_loop_body();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
  // Look for loop-exit tests with my 50/50 guesses from the Parsing stage.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  // Replace with a 1-in-10 exit guess.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  void adjust_loop_exit_prob( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
  // Return TRUE or FALSE if the loop should never be RCE'd or aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
  // Useful for unrolling loops with NO array accesses.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
  bool policy_peel_only( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  // Return TRUE or FALSE if the loop should be unswitched -- clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
  // loop with an invariant test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  bool policy_unswitching( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  // Micro-benchmark spamming.  Remove empty loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
  bool policy_do_remove_empty_loop( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   468
  // Convert one iteration loop into normal code.
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   469
  bool policy_do_one_iteration_loop( PhaseIdealLoop *phase );
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   470
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
  // Return TRUE or FALSE if the loop should be peeled or not.  Peel if we can
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
  // make some loop-invariant test (usually a null-check) happen before the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
  // loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
  bool policy_peeling( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
  // Return TRUE or FALSE if the loop should be maximally unrolled. Stash any
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  // known trip count in the counted loop node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
  bool policy_maximally_unroll( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
  // Return TRUE or FALSE if the loop should be unrolled or not.  Unroll if
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
  // the loop is a CountedLoop and the body is small enough.
31403
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   482
  bool policy_unroll(PhaseIdealLoop *phase);
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   483
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   484
  // Loop analyses to map to a maximal superword unrolling for vectorization.
7bf7e00a1aac 8080325: SuperWord loop unrolling analysis
mcberg
parents: 31133
diff changeset
   485
  void policy_unroll_slp_analysis(CountedLoopNode *cl, PhaseIdealLoop *phase, int future_unroll_ct);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
  // Return TRUE or FALSE if the loop should be range-check-eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
  // Gather a list of IF tests that are dominated by iteration splitting;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
  // also gather the end of the first split and the start of the 2nd split.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
  bool policy_range_check( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
  // Return TRUE or FALSE if the loop should be cache-line aligned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
  // Gather the expression that does the alignment.  Note that only
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1433
diff changeset
   494
  // one array base can be aligned in a loop (unless the VM guarantees
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
  // mutual alignment).  Note that if we vectorize short memory ops
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
  // into longer memory ops, we may want to increase alignment.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
  bool policy_align( PhaseIdealLoop *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   499
  // Return TRUE if "iff" is a range check.
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   500
  bool is_range_check_if(IfNode *iff, PhaseIdealLoop *phase, Invariance& invar) const;
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   501
9121
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   502
  // Compute loop exact trip count if possible
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   503
  void compute_exact_trip_count( PhaseIdealLoop *phase );
704ece791737 7004555: Add new policy for one iteration loops
kvn
parents: 9101
diff changeset
   504
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
  // Compute loop trip count from profile data
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
  void compute_profile_trip_cnt( PhaseIdealLoop *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
  // Reassociate invariant expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  void reassociate_invariants(PhaseIdealLoop *phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
  // Reassociate invariant add and subtract expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
  Node* reassociate_add_sub(Node* n1, PhaseIdealLoop *phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
  // Return nonzero index of invariant operand if invariant and variant
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1433
diff changeset
   513
  // are combined with an Add or Sub. Helper for reassociate_invariants.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
  int is_invariant_addition(Node* n, PhaseIdealLoop *phase);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  // Return true if n is invariant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  bool is_invariant(Node* n) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  // Put loop body on igvn work list
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  void record_for_igvn();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
  bool is_loop()    { return !_irreducible && _tail && !_tail->is_top(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
  bool is_inner()   { return is_loop() && _child == NULL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  bool is_counted() { return is_loop() && _head != NULL && _head->is_CountedLoop(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
31133
3e7542b42a61 8085832: Optimize main and post loop out when pre loop is found empty
roland
parents: 30211
diff changeset
   526
  void remove_main_post_loops(CountedLoopNode *cl, PhaseIdealLoop *phase);
3e7542b42a61 8085832: Optimize main and post loop out when pre loop is found empty
roland
parents: 30211
diff changeset
   527
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
  void dump_head( ) const;      // Dump loop head only
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  void dump() const;            // Dump this loop recursively
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  void verify_tree(IdealLoopTree *loop, const IdealLoopTree *parent) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
// -----------------------------PhaseIdealLoop---------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
// Computes the mapping from Nodes to IdealLoopTrees.  Organizes IdealLoopTrees into a
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
// loop tree.  Drives the loop-based transformations on the ideal graph.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
class PhaseIdealLoop : public PhaseTransform {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  friend class IdealLoopTree;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  friend class SuperWord;
33166
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   542
  friend class CountedLoopReserveKit;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   543
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
  // Pre-computed def-use info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  PhaseIterGVN &_igvn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  // Head of loop tree
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
  IdealLoopTree *_ltree_root;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
  // Array of pre-order numbers, plus post-visited bit.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  // ZERO for not pre-visited.  EVEN for pre-visited but not post-visited.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
  // ODD for post-visited.  Other bits are the pre-order number.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
  uint *_preorders;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
  uint _max_preorder;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   556
  const PhaseIdealLoop* _verify_me;
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   557
  bool _verify_only;
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   558
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
  // Allocate _preorders[] array
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
  void allocate_preorders() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
    _max_preorder = C->unique()+8;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
    _preorders = NEW_RESOURCE_ARRAY(uint, _max_preorder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
    memset(_preorders, 0, sizeof(uint) * _max_preorder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
  // Allocate _preorders[] array
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
  void reallocate_preorders() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
    if ( _max_preorder < C->unique() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
      _preorders = REALLOC_RESOURCE_ARRAY(uint, _preorders, _max_preorder, C->unique());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
      _max_preorder = C->unique();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
    memset(_preorders, 0, sizeof(uint) * _max_preorder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
  // Check to grow _preorders[] array for the case when build_loop_tree_impl()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
  // adds new nodes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  void check_grow_preorders( ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
    if ( _max_preorder < C->unique() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
      uint newsize = _max_preorder<<1;  // double size of array
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
      _preorders = REALLOC_RESOURCE_ARRAY(uint, _preorders, _max_preorder, newsize);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
      memset(&_preorders[_max_preorder],0,sizeof(uint)*(newsize-_max_preorder));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
      _max_preorder = newsize;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
  // Check for pre-visited.  Zero for NOT visited; non-zero for visited.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
  int is_visited( Node *n ) const { return _preorders[n->_idx]; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
  // Pre-order numbers are written to the Nodes array as low-bit-set values.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  void set_preorder_visited( Node *n, int pre_order ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
    assert( !is_visited( n ), "already set" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
    _preorders[n->_idx] = (pre_order<<1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
  // Return pre-order number.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
  int get_preorder( Node *n ) const { assert( is_visited(n), "" ); return _preorders[n->_idx]>>1; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  // Check for being post-visited.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
  // Should be previsited already (checked with assert(is_visited(n))).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
  int is_postvisited( Node *n ) const { assert( is_visited(n), "" ); return _preorders[n->_idx]&1; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
  // Mark as post visited
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
  void set_postvisited( Node *n ) { assert( !is_postvisited( n ), "" ); _preorders[n->_idx] |= 1; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
  // Set/get control node out.  Set lower bit to distinguish from IdealLoopTree
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
  // Returns true if "n" is a data node, false if it's a control node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
  bool has_ctrl( Node *n ) const { return ((intptr_t)_nodes[n->_idx]) & 1; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
  // clear out dead code after build_loop_late
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
  Node_List _deadlist;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
  // Support for faster execution of get_late_ctrl()/dom_lca()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
  // when a node has many uses and dominator depth is deep.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  Node_Array _dom_lca_tags;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  void   init_dom_lca_tags();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
  void   clear_dom_lca_tags();
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   614
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   615
  // Helper for debugging bad dominance relationships
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   616
  bool verify_dominance(Node* n, Node* use, Node* LCA, Node* early);
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   617
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   618
  Node* compute_lca_of_uses(Node* n, Node* early, bool verify = false);
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   619
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
  // Inline wrapper for frequent cases:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
  // 1) only one use
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
  // 2) a use is the same as the current LCA passed as 'n1'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
  Node *dom_lca_for_get_late_ctrl( Node *lca, Node *n, Node *tag ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
    assert( n->is_CFG(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
    // Fast-path NULL lca
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
    if( lca != NULL && lca != n ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   627
      assert( lca->is_CFG(), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   628
      // find LCA of all uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
   629
      n = dom_lca_for_get_late_ctrl_internal( lca, n, tag );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   630
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   631
    return find_non_split_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   632
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   633
  Node *dom_lca_for_get_late_ctrl_internal( Node *lca, Node *n, Node *tag );
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   634
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   635
  // Helper function for directing control inputs away from CFG split
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  // points.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
  Node *find_non_split_ctrl( Node *ctrl ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
    if (ctrl != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
      if (ctrl->is_MultiBranch()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
        ctrl = ctrl->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
      assert(ctrl->is_CFG(), "CFG");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
    return ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
27708
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 24425
diff changeset
   647
  bool cast_incr_before_loop(Node* incr, Node* ctrl, Node* loop);
8a8710cb8fc4 8054478: C2: Incorrectly compiled char[] array access crashes JVM
roland
parents: 24425
diff changeset
   648
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
public:
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   650
  bool has_node( Node* n ) const {
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   651
    guarantee(n != NULL, "No Node.");
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   652
    return _nodes[n->_idx] != NULL;
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   653
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
  // check if transform created new nodes that need _ctrl recorded
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
  Node *get_late_ctrl( Node *n, Node *early );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
  Node *get_early_ctrl( Node *n );
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   657
  Node *get_early_ctrl_for_expensive(Node *n, Node* earliest);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
  void set_early_ctrl( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
  void set_subtree_ctrl( Node *root );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
  void set_ctrl( Node *n, Node *ctrl ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
    assert( !has_node(n) || has_ctrl(n), "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
    assert( ctrl->in(0), "cannot set dead control node" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
    assert( ctrl == find_non_split_ctrl(ctrl), "must set legal crtl" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
    _nodes.map( n->_idx, (Node*)((intptr_t)ctrl + 1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
  // Set control and update loop membership
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
  void set_ctrl_and_loop(Node* n, Node* ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
    IdealLoopTree* old_loop = get_loop(get_ctrl(n));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
    IdealLoopTree* new_loop = get_loop(ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
    if (old_loop != new_loop) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
      if (old_loop->_child == NULL) old_loop->_body.yank(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
      if (new_loop->_child == NULL) new_loop->_body.push(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
    set_ctrl(n, ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
  // Control nodes can be replaced or subsumed.  During this pass they
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
  // get their replacement Node in slot 1.  Instead of updating the block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
  // location of all Nodes in the subsumed block, we lazily do it.  As we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
  // pull such a subsumed block out of the array, we write back the final
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
  // correct block.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
  Node *get_ctrl( Node *i ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
    assert(has_node(i), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
    Node *n = get_ctrl_no_update(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
    _nodes.map( i->_idx, (Node*)((intptr_t)n + 1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
    assert(has_node(i) && has_ctrl(i), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
    assert(n == find_non_split_ctrl(n), "must return legal ctrl" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  }
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   689
  // true if CFG node d dominates CFG node n
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   690
  bool is_dominator(Node *d, Node *n);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   691
  // return get_ctrl for a data node and self(n) for a CFG node
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   692
  Node* ctrl_or_self(Node* n) {
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   693
    if (has_ctrl(n))
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   694
      return get_ctrl(n);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   695
    else {
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   696
      assert (n->is_CFG(), "must be a CFG node");
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   697
      return n;
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   698
    }
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   699
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
private:
35759
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   702
  Node *get_ctrl_no_update_helper(Node *i) const {
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   703
    assert(has_ctrl(i), "should be control, not loop");
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   704
    return (Node*)(((intptr_t)_nodes[i->_idx]) & ~1);
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   705
  }
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   706
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   707
  Node *get_ctrl_no_update(Node *i) const {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
    assert( has_ctrl(i), "" );
35759
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   709
    Node *n = get_ctrl_no_update_helper(i);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
    if (!n->in(0)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
      // Skip dead CFG nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
      do {
35759
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   713
        n = get_ctrl_no_update_helper(n);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
      } while (!n->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
      n = find_non_split_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
  // Check for loop being set
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  // "n" must be a control node. Returns true if "n" is known to be in a loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
  bool has_loop( Node *n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
    assert(!has_node(n) || !has_ctrl(n), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
    return has_node(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
  // Set loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
  void set_loop( Node *n, IdealLoopTree *loop ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
    _nodes.map(n->_idx, (Node*)loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
  // Lazy-dazy update of 'get_ctrl' and 'idom_at' mechanisms.  Replace
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
  // the 'old_node' with 'new_node'.  Kill old-node.  Add a reference
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  // from old_node to new_node to support the lazy update.  Reference
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   733
  // replaces loop reference, since that is not needed for dead node.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
public:
35759
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   735
  void lazy_update(Node *old_node, Node *new_node) {
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   736
    assert(old_node != new_node, "no cycles please");
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   737
    // Re-use the side array slot for this node to provide the
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   738
    // forwarding pointer.
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   739
    _nodes.map(old_node->_idx, (Node*)((intptr_t)new_node + 1));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
  }
35759
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   741
  void lazy_replace(Node *old_node, Node *new_node) {
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   742
    _igvn.replace_node(old_node, new_node);
85d3873f87b4 8147645: get_ctrl_no_update() code is wrong
roland
parents: 35551
diff changeset
   743
    lazy_update(old_node, new_node);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
  // Place 'n' in some loop nest, where 'n' is a CFG node
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
  void build_loop_tree();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
  int build_loop_tree_impl( Node *n, int pre_order );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  // Insert loop into the existing loop tree.  'innermost' is a leaf of the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
  // loop tree, not the root.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
  IdealLoopTree *sort( IdealLoopTree *loop, IdealLoopTree *innermost );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
  // Place Data nodes in some loop nest
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   756
  void build_loop_early( VectorSet &visited, Node_List &worklist, Node_Stack &nstack );
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   757
  void build_loop_late ( VectorSet &visited, Node_List &worklist, Node_Stack &nstack );
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   758
  void build_loop_late_post ( Node* n );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  // Array of immediate dominance info for each CFG node indexed by node idx
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
  uint _idom_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
  Node **_idom;                 // Array of immediate dominators
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
  uint *_dom_depth;           // Used for fast LCA test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
  GrowableArray<uint>* _dom_stk; // For recomputation of dom depth
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
  Node* idom_no_update(Node* d) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
    assert(d->_idx < _idom_size, "oob");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
    Node* n = _idom[d->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
    assert(n != NULL,"Bad immediate dominator info.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
    while (n->in(0) == NULL) {  // Skip dead CFG nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
      //n = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
      n = (Node*)(((intptr_t)_nodes[n->_idx]) & ~1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
      assert(n != NULL,"Bad immediate dominator info.");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
  Node *idom(Node* d) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
    uint didx = d->_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
    Node *n = idom_no_update(d);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
    _idom[didx] = n;            // Lazily remove dead CFG nodes from table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
    return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
  uint dom_depth(Node* d) const {
16375
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   785
    guarantee(d != NULL, "Null dominator info.");
d27fedd8b2b2 8008811: [parfait] Null pointer deference in hotspot/src/share/vm/opto/loopopts.cpp
morris
parents: 15618
diff changeset
   786
    guarantee(d->_idx < _idom_size, "");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
    return _dom_depth[d->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  void set_idom(Node* d, Node* n, uint dom_depth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
  // Locally compute IDOM using dom_lca call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
  Node *compute_idom( Node *region ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  // Recompute dom_depth
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  void recompute_dom_depth();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  // Is safept not required by an outer loop?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
  bool is_deleteable_safept(Node* sfpt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   798
  // Replace parallel induction variable (parallel to trip counter)
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   799
  void replace_parallel_iv(IdealLoopTree *loop);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   800
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   801
  // Perform verification that the graph is valid.
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   802
  PhaseIdealLoop( PhaseIterGVN &igvn) :
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   803
    PhaseTransform(Ideal_Loop),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   804
    _igvn(igvn),
8318
f23dc75398b2 7017240: C2: native memory leak in nsk/regression/b4675027 on windows-x86 in comp mode with G1
kvn
parents: 7397
diff changeset
   805
    _dom_lca_tags(arena()), // Thread::resource_area
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   806
    _verify_me(NULL),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   807
    _verify_only(true) {
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10258
diff changeset
   808
    build_and_optimize(false, false);
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   809
  }
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   810
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   811
  // build the loop tree and perform any requested optimizations
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10258
diff changeset
   812
  void build_and_optimize(bool do_split_if, bool skip_loop_opts);
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   813
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
  // Dominators for the sea of nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
  void Dominators();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
  Node *dom_lca( Node *n1, Node *n2 ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
    return find_non_split_ctrl(dom_lca_internal(n1, n2));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
  Node *dom_lca_internal( Node *n1, Node *n2 ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
  // Compute the Ideal Node to Loop mapping
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10258
diff changeset
   823
  PhaseIdealLoop( PhaseIterGVN &igvn, bool do_split_ifs, bool skip_loop_opts = false) :
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   824
    PhaseTransform(Ideal_Loop),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   825
    _igvn(igvn),
8318
f23dc75398b2 7017240: C2: native memory leak in nsk/regression/b4675027 on windows-x86 in comp mode with G1
kvn
parents: 7397
diff changeset
   826
    _dom_lca_tags(arena()), // Thread::resource_area
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   827
    _verify_me(NULL),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   828
    _verify_only(false) {
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10258
diff changeset
   829
    build_and_optimize(do_split_ifs, skip_loop_opts);
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   830
  }
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   831
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   832
  // Verify that verify_me made the same decisions as a fresh run.
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   833
  PhaseIdealLoop( PhaseIterGVN &igvn, const PhaseIdealLoop *verify_me) :
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   834
    PhaseTransform(Ideal_Loop),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   835
    _igvn(igvn),
8318
f23dc75398b2 7017240: C2: native memory leak in nsk/regression/b4675027 on windows-x86 in comp mode with G1
kvn
parents: 7397
diff changeset
   836
    _dom_lca_tags(arena()), // Thread::resource_area
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   837
    _verify_me(verify_me),
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   838
    _verify_only(false) {
10988
a3b2bd43ef4f 7107042: assert(no_dead_loop) failed: dead loop detected
kvn
parents: 10258
diff changeset
   839
    build_and_optimize(false, false);
3676
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   840
  }
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   841
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   842
  // Build and verify the loop tree without modifying the graph.  This
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   843
  // is useful to verify that all inputs properly dominate their uses.
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   844
  static void verify(PhaseIterGVN& igvn) {
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   845
#ifdef ASSERT
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   846
    PhaseIdealLoop v(igvn);
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   847
#endif
3bac3e882cd3 6862956: PhaseIdealLoop should have a CFG verification mode
never
parents: 2131
diff changeset
   848
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
  // True if the method has at least 1 irreducible loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
  bool _has_irreducible_loops;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
  // Per-Node transform
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
  virtual Node *transform( Node *a_node ) { return 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   856
  bool is_counted_loop( Node *x, IdealLoopTree *loop );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   858
  Node* exact_limit( IdealLoopTree *loop );
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   859
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
  // Return a post-walked LoopNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
  IdealLoopTree *get_loop( Node *n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
    // Dead nodes have no loop, so return the top level loop instead
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
    if (!has_node(n))  return _ltree_root;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
    assert(!has_ctrl(n), "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
    return (IdealLoopTree*)_nodes[n->_idx];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
  // Is 'n' a (nested) member of 'loop'?
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
  int is_member( const IdealLoopTree *loop, Node *n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
    return loop->is_member(get_loop(n)); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
  // This is the basic building block of the loop optimizations.  It clones an
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
  // entire loop body.  It makes an old_new loop body mapping; with this
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
  // mapping you can find the new-loop equivalent to an old-loop node.  All
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
  // new-loop nodes are exactly equal to their old-loop counterparts, all
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
  // edges are the same.  All exits from the old-loop now have a RegionNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
  // that merges the equivalent new-loop path.  This is true even for the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
  // normal "loop-exit" condition.  All uses of loop-invariant old-loop values
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
  // now come from (one or more) Phis that merge their new-loop equivalents.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
  // Parameter side_by_side_idom:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
  //   When side_by_size_idom is NULL, the dominator tree is constructed for
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
  //      the clone loop to dominate the original.  Used in construction of
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  //      pre-main-post loop sequence.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
  //   When nonnull, the clone and original are side-by-side, both are
489c9b5090e2 Initial load
duke
parents:
diff changeset
   885
  //      dominated by the passed in side_by_side_idom node.  Used in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
  //      construction of unswitched loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
  void clone_loop( IdealLoopTree *loop, Node_List &old_new, int dom_depth,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
                   Node* side_by_side_idom = NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
  // If we got the effect of peeling, either by actually peeling or by
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
  // making a pre-loop which must execute at least once, we can remove
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
  // all loop-invariant dominated tests in the main body.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   893
  void peeled_dom_test_elim( IdealLoopTree *loop, Node_List &old_new );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
  // Generate code to do a loop peel for the given loop (and body).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
  // old_new is a temp array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
  void do_peeling( IdealLoopTree *loop, Node_List &old_new );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
  // Add pre and post loops around the given loop.  These loops are used
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
  // during RCE, unrolling and aligning loops.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
  void insert_pre_post_loops( IdealLoopTree *loop, Node_List &old_new, bool peel_only );
36066
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
   902
  // Add a vector post loop between a vector main loop and the current post loop
60ce66ce3c76 8149421: Vectorized Post Loops
mcberg
parents: 36065
diff changeset
   903
  void insert_vector_post_loop(IdealLoopTree *loop, Node_List &old_new);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
  // If Node n lives in the back_ctrl block, we clone a private version of n
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
  // in preheader_ctrl block and return that, otherwise return n.
10011
e8b38f7b9959 7044738: Loop unroll optimization causes incorrect result
kvn
parents: 9941
diff changeset
   906
  Node *clone_up_backedge_goo( Node *back_ctrl, Node *preheader_ctrl, Node *n, VectorSet &visited, Node_Stack &clones );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
  // Take steps to maximally unroll the loop.  Peel any odd iterations, then
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
  // unroll to do double iterations.  The next round of major loop transforms
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
  // will repeat till the doubled loop body does all remaining iterations in 1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   911
  // pass.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
  void do_maximally_unroll( IdealLoopTree *loop, Node_List &old_new );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
  // Unroll the loop body one step - make each trip do 2 iterations.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
  void do_unroll( IdealLoopTree *loop, Node_List &old_new, bool adjust_min_trip );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
30211
442fbbb31f75 8074981: Integer/FP scalar reduction optimization
kvn
parents: 27708
diff changeset
   917
  // Mark vector reduction candidates before loop unrolling
442fbbb31f75 8074981: Integer/FP scalar reduction optimization
kvn
parents: 27708
diff changeset
   918
  void mark_reductions( IdealLoopTree *loop );
442fbbb31f75 8074981: Integer/FP scalar reduction optimization
kvn
parents: 27708
diff changeset
   919
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
  // Return true if exp is a constant times an induction var
489c9b5090e2 Initial load
duke
parents:
diff changeset
   921
  bool is_scaled_iv(Node* exp, Node* iv, int* p_scale);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
489c9b5090e2 Initial load
duke
parents:
diff changeset
   923
  // Return true if exp is a scaled induction var plus (or minus) constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
  bool is_scaled_iv_plus_offset(Node* exp, Node* iv, int* p_scale, Node** p_offset, int depth = 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   925
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   926
  // Create a new if above the uncommon_trap_if_pattern for the predicate to be promoted
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   927
  ProjNode* create_new_if_for_predicate(ProjNode* cont_proj, Node* new_entry,
34164
a9e6034d7707 8137168: Replace IfNode with a new RangeCheckNode for range checks
roland
parents: 33469
diff changeset
   928
                                        Deoptimization::DeoptReason reason,
a9e6034d7707 8137168: Replace IfNode with a new RangeCheckNode for range checks
roland
parents: 33469
diff changeset
   929
                                        int opcode);
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   930
  void register_control(Node* n, IdealLoopTree *loop, Node* pred);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   931
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   932
  // Clone loop predicates to cloned loops (peeled, unswitched)
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   933
  static ProjNode* clone_predicate(ProjNode* predicate_proj, Node* new_entry,
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   934
                                   Deoptimization::DeoptReason reason,
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   935
                                   PhaseIdealLoop* loop_phase,
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   936
                                   PhaseIterGVN* igvn);
10258
10c77b8c8d3e 7068051: SIGSEGV in PhaseIdealLoop::build_loop_late_post
kvn
parents: 10253
diff changeset
   937
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   938
  static Node* clone_loop_predicates(Node* old_entry, Node* new_entry,
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   939
                                         bool clone_limit_check,
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   940
                                         PhaseIdealLoop* loop_phase,
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   941
                                         PhaseIterGVN* igvn);
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   942
  Node* clone_loop_predicates(Node* old_entry, Node* new_entry, bool clone_limit_check);
9101
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   943
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   944
  static Node* skip_loop_predicates(Node* entry);
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   945
ff58f9a8e31c 7004535: Clone loop predicate during loop unswitch
kvn
parents: 8732
diff changeset
   946
  // Find a good location to insert a predicate
8732
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   947
  static ProjNode* find_predicate_insertion_point(Node* start_c, Deoptimization::DeoptReason reason);
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   948
  // Find a predicate
16fc1c68714b 7008866: Missing loop predicate for loop with multiple entries
kvn
parents: 8318
diff changeset
   949
  static Node* find_predicate(Node* entry);
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   950
  // Construct a range check for a predicate if
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
   951
  BoolNode* rc_predicate(IdealLoopTree *loop, Node* ctrl,
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   952
                         int scale, Node* offset,
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   953
                         Node* init, Node* limit, Node* stride,
5054
6d42dc4dd98c 6930043: C2: SIGSEGV in javasoft.sqe.tests.lang.arr017.arr01702.arr01702.loop_forw(II)I
never
parents: 4643
diff changeset
   954
                         Node* range, bool upper);
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   955
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   956
  // Implementation of the loop predication to promote checks outside the loop
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   957
  bool loop_predication_impl(IdealLoopTree *loop);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   958
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   959
  // Helper function to collect predicate for eliminating the useless ones
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   960
  void collect_potentially_useful_predicates(IdealLoopTree *loop, Unique_Node_List &predicate_opaque1);
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   961
  void eliminate_useless_predicates();
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
   962
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   963
  // Change the control input of expensive nodes to allow commoning by
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   964
  // IGVN when it is guaranteed to not result in a more frequent
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   965
  // execution of the expensive node. Return true if progress.
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   966
  bool process_expensive_nodes();
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   967
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   968
  // Check whether node has become unreachable
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   969
  bool is_node_unreachable(Node *n) const {
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   970
    return !has_node(n) || n->is_unreachable(_igvn);
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   971
  }
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
   972
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
  // Eliminate range-checks and other trip-counter vs loop-invariant tests.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
  void do_range_check( IdealLoopTree *loop, Node_List &old_new );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
  // Create a slow version of the loop by cloning the loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
  // and inserting an if to select fast-slow versions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
  ProjNode* create_slow_version_of_loop(IdealLoopTree *loop,
34164
a9e6034d7707 8137168: Replace IfNode with a new RangeCheckNode for range checks
roland
parents: 33469
diff changeset
   979
                                        Node_List &old_new,
a9e6034d7707 8137168: Replace IfNode with a new RangeCheckNode for range checks
roland
parents: 33469
diff changeset
   980
                                        int opcode);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
33166
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   982
  // Clone a loop and return the clone head (clone_loop_head).
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   983
  // Added nodes include int(1), int(0) - disconnected, If, IfTrue, IfFalse,
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   984
  // This routine was created for usage in CountedLoopReserveKit.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   985
  //
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   986
  //    int(1) -> If -> IfTrue -> original_loop_head
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   987
  //              |
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   988
  //              V
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   989
  //           IfFalse -> clone_loop_head (returned by function pointer)
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   990
  //
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
   991
  LoopNode* create_reserve_version_of_loop(IdealLoopTree *loop, CountedLoopReserveKit* lk);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
  // Clone loop with an invariant test (that does not exit) and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
  // insert a clone of the test that selects which version to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
  // execute.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
  void do_unswitching (IdealLoopTree *loop, Node_List &old_new);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
  // Find candidate "if" for unswitching
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
  IfNode* find_unswitching_candidate(const IdealLoopTree *loop) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
  // Range Check Elimination uses this function!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
  // Constrain the main loop iterations so the affine function:
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
  1002
  //    low_limit <= scale_con * I + offset  <  upper_limit
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
  // always holds true.  That is, either increase the number of iterations in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
  // the pre-loop or the post-loop until the condition holds true in the main
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
  // loop.  Scale_con, offset and limit are all loop invariant.
9446
748a37b25d10 5091921: Sign flip issues in loop optimizer
kvn
parents: 9121
diff changeset
  1006
  void add_constraint( int stride_con, int scale_con, Node *offset, Node *low_limit, Node *upper_limit, Node *pre_ctrl, Node **pre_limit, Node **main_limit );
9941
f2365fbd62f4 7044725: -XX:-UnrollLimitCheck -Xcomp : Exception: String index out of range: 29488
kvn
parents: 9446
diff changeset
  1007
  // Helper function for add_constraint().
f2365fbd62f4 7044725: -XX:-UnrollLimitCheck -Xcomp : Exception: String index out of range: 29488
kvn
parents: 9446
diff changeset
  1008
  Node* adjust_limit( int stride_con, Node * scale, Node *offset, Node *rc_limit, Node *loop_limit, Node *pre_ctrl );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
  // Partially peel loop up through last_peel node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
  bool partial_peel( IdealLoopTree *loop, Node_List &old_new );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
  // Create a scheduled list of nodes control dependent on ctrl set.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  void scheduled_nodelist( IdealLoopTree *loop, VectorSet& ctrl, Node_List &sched );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  // Has a use in the vector set
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
  bool has_use_in_set( Node* n, VectorSet& vset );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
  // Has use internal to the vector set (ie. not in a phi at the loop head)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
  bool has_use_internal_to_set( Node* n, VectorSet& vset, IdealLoopTree *loop );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
  // clone "n" for uses that are outside of loop
17620
67820da7568e 8014811: loopTransform.cpp assert(cmp_end->in(2) == limit) failed
kvn
parents: 16375
diff changeset
  1020
  int  clone_for_use_outside_loop( IdealLoopTree *loop, Node* n, Node_List& worklist );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
  // clone "n" for special uses that are in the not_peeled region
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
  void clone_for_special_use_inside_loop( IdealLoopTree *loop, Node* n,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
                                          VectorSet& not_peel, Node_List& sink_list, Node_List& worklist );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  void insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  // Validate the loop partition sets: peel and not_peel
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
  bool is_valid_loop_partition( IdealLoopTree *loop, VectorSet& peel, Node_List& peel_list, VectorSet& not_peel );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
  // Ensure that uses outside of loop are of the right form
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
  bool is_valid_clone_loop_form( IdealLoopTree *loop, Node_List& peel_list,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
                                 uint orig_exit_idx, uint clone_exit_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
  bool is_valid_clone_loop_exit_use( IdealLoopTree *loop, Node* use, uint exit_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
  // Returns nonzero constant stride if-node is a possible iv test (otherwise returns zero.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
  int stride_of_possible_iv( Node* iff );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
  bool is_possible_iv_test( Node* iff ) { return stride_of_possible_iv(iff) != 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
  // Return the (unique) control output node that's in the loop (if it exists.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  Node* stay_in_loop( Node* n, IdealLoopTree *loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  // Insert a signed compare loop exit cloned from an unsigned compare.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
  IfNode* insert_cmpi_loop_exit(IfNode* if_cmpu, IdealLoopTree *loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
  void remove_cmpi_loop_exit(IfNode* if_cmp, IdealLoopTree *loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
  // Utility to register node "n" with PhaseIdealLoop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
  void register_node(Node* n, IdealLoopTree *loop, Node* pred, int ddepth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
  // Utility to create an if-projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
  ProjNode* proj_clone(ProjNode* p, IfNode* iff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
  // Force the iff control output to be the live_proj
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
  Node* short_circuit_if(IfNode* iff, ProjNode* live_proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
  // Insert a region before an if projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
  RegionNode* insert_region_before_proj(ProjNode* proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
  // Insert a new if before an if projection
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
  ProjNode* insert_if_before_proj(Node* left, bool Signed, BoolTest::mask relop, Node* right, ProjNode* proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
  // Passed in a Phi merging (recursively) some nearly equivalent Bool/Cmps.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
  // "Nearly" because all Nodes have been cloned from the original in the loop,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
  // but the fall-in edges to the Cmp are different.  Clone bool/Cmp pairs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
  // through the Phi recursively, and return a Bool.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
  BoolNode *clone_iff( PhiNode *phi, IdealLoopTree *loop );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
  CmpNode *clone_bool( PhiNode *phi, IdealLoopTree *loop );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
  // Rework addressing expressions to get the most loop-invariant stuff
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
  // moved out.  We'd like to do all associative operators, but it's especially
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
  // important (common) to do address expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
  Node *remix_address_expressions( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
  // Attempt to use a conditional move instead of a phi/branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
  Node *conditional_move( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
  // Reorganize offset computations to lower register pressure.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
  // Mostly prevent loop-fallout uses of the pre-incremented trip counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
  // (which are then alive with the post-incremented trip counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
  // forcing an extra register move)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
  void reorg_offsets( IdealLoopTree *loop );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
  // Check for aggressive application of 'split-if' optimization,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
  // using basic block level info.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
  void  split_if_with_blocks     ( VectorSet &visited, Node_Stack &nstack );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
  Node *split_if_with_blocks_pre ( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
  void  split_if_with_blocks_post( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
  Node *has_local_phi_input( Node *n );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
  // Mark an IfNode as being dominated by a prior test,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
  // without actually altering the CFG (and hence IDOM info).
10253
35b975b1e8f3 7070134: Hotspot crashes with sigsegv from PorterStemmer
kvn
parents: 10011
diff changeset
  1084
  void dominated_by( Node *prevdom, Node *iff, bool flip = false, bool exclude_loop_predicate = false );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
  // Split Node 'n' through merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
  Node *split_thru_region( Node *n, Node *region );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
  // Split Node 'n' through merge point if there is enough win.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
  Node *split_thru_phi( Node *n, Node *region, int policy );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
  // Found an If getting its condition-code input from a Phi in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
  // same block.  Split thru the Region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
  void do_split_if( Node *iff );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
6433
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1094
  // Conversion of fill/copy patterns into intrisic versions
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1095
  bool do_intrinsify_fill();
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1096
  bool intrinsify_fill(IdealLoopTree* lpt);
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1097
  bool match_fill_loop(IdealLoopTree* lpt, Node*& store, Node*& store_value,
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1098
                       Node*& shift, Node*& offset);
b0e4fafdc38b 4809552: Optimize Arrays.fill(...)
never
parents: 5901
diff changeset
  1099
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
  // Return a type based on condition control flow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
  const TypeInt* filtered_type( Node *n, Node* n_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
  const TypeInt* filtered_type( Node *n ) { return filtered_type(n, NULL); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
 // Helpers for filtered type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
  const TypeInt* filtered_type_from_dominators( Node* val, Node *val_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
  // Helper functions
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
  Node *spinup( Node *iff, Node *new_false, Node *new_true, Node *region, Node *phi, small_cache *cache );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
  Node *find_use_block( Node *use, Node *def, Node *old_false, Node *new_false, Node *old_true, Node *new_true );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
  void handle_use( Node *use, Node *def, small_cache *cache, Node *region_dom, Node *new_false, Node *new_true, Node *old_false, Node *old_true );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
  bool split_up( Node *n, Node *blk1, Node *blk2 );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
  void sink_use( Node *use, Node *post_loop );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
  Node *place_near_use( Node *useblock ) const;
32372
b82e88dcb26c 8080289: Intermediate writes in a loop not eliminated by optimizer
roland
parents: 31772
diff changeset
  1114
  Node* try_move_store_before_loop(Node* n, Node *n_ctrl);
b82e88dcb26c 8080289: Intermediate writes in a loop not eliminated by optimizer
roland
parents: 31772
diff changeset
  1115
  void try_move_store_after_loop(Node* n);
36065
4f0e0cb7b016 8143542: C2 doesn't eliminate identical checks
roland
parents: 35759
diff changeset
  1116
  bool identical_backtoback_ifs(Node *n);
4f0e0cb7b016 8143542: C2 doesn't eliminate identical checks
roland
parents: 35759
diff changeset
  1117
  bool can_split_if(Node *n_ctrl);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
  bool _created_loop_node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
  void set_created_loop_node() { _created_loop_node = true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
  bool created_loop_node()     { return _created_loop_node; }
4643
61c659c91c57 6894779: Loop Predication for Loop Optimizer in C2
cfang
parents: 3676
diff changeset
  1123
  void register_new_node( Node *n, Node *blk );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1124
11447
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
  1125
#ifdef ASSERT
15618
3eb521896836 7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents: 13963
diff changeset
  1126
  void dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA);
11447
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
  1127
#endif
84ff3ddd7679 7064302: JDK7 build 147 crashed after testing my java 6-compiled web app
kvn
parents: 10988
diff changeset
  1128
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1130
  void dump( ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
  void dump( IdealLoopTree *loop, uint rpo_idx, Node_List &rpo_list ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
  void rpo( Node *start, Node_Stack &stk, VectorSet &visited, Node_List &rpo_list ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
  void verify() const;          // Major slow  :-)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
  void verify_compare( Node *n, const PhaseIdealLoop *loop_verify, VectorSet &visited ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
  IdealLoopTree *get_loop_idx(Node* n) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
    // Dead nodes have no loop, so return the top level loop instead
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
    return _nodes[n->_idx] ? (IdealLoopTree*)_nodes[n->_idx] : _ltree_root;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
  // Print some stats
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
  static void print_statistics();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
  static int _loop_invokes;     // Count of PhaseIdealLoop invokes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
  static int _loop_work;        // Sum of PhaseIdealLoop x _unique
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
33166
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1146
// This kit may be used for making of a reserved copy of a loop before this loop
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1147
//  goes under non-reversible changes.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1148
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1149
// Function create_reserve() creates a reserved copy (clone) of the loop.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1150
// The reserved copy is created by calling
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1151
// PhaseIdealLoop::create_reserve_version_of_loop - see there how
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1152
// the original and reserved loops are connected in the outer graph.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1153
// If create_reserve succeeded, it returns 'true' and _has_reserved is set to 'true'.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1154
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1155
// By default the reserved copy (clone) of the loop is created as dead code - it is
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1156
// dominated in the outer loop by this node chain:
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1157
//   intcon(1)->If->IfFalse->reserved_copy.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1158
// The original loop is dominated by the the same node chain but IfTrue projection:
33469
30f4811eded0 8139340: SuperWord enhancement to support vector conditional move (CMovVD) on Intel AVX cpu
iveresov
parents: 33166
diff changeset
  1159
//   intcon(0)->If->IfTrue->original_loop.
33166
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1160
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1161
// In this implementation of CountedLoopReserveKit the ctor includes create_reserve()
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1162
// and the dtor, checks _use_new value.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1163
// If _use_new == false, it "switches" control to reserved copy of the loop
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1164
// by simple replacing of node intcon(1) with node intcon(0).
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1165
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1166
// Here is a proposed example of usage (see also SuperWord::output in superword.cpp).
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1167
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1168
// void CountedLoopReserveKit_example()
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1169
// {
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1170
//    CountedLoopReserveKit lrk((phase, lpt, DoReserveCopy = true); // create local object
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1171
//    if (DoReserveCopy && !lrk.has_reserved()) {
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1172
//      return; //failed to create reserved loop copy
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1173
//    }
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1174
//    ...
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1175
//    //something is wrong, switch to original loop
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1176
///   if(something_is_wrong) return; // ~CountedLoopReserveKit makes the switch
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1177
//    ...
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1178
//    //everything worked ok, return with the newly modified loop
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1179
//    lrk.use_new();
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1180
//    return; // ~CountedLoopReserveKit does nothing once use_new() was called
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1181
//  }
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1182
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1183
// Keep in mind, that by default if create_reserve() is not followed by use_new()
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1184
// the dtor will "switch to the original" loop.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1185
// NOTE. You you modify outside of the original loop this class is no help.
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1186
//
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1187
class CountedLoopReserveKit {
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1188
  private:
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1189
    PhaseIdealLoop* _phase;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1190
    IdealLoopTree*  _lpt;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1191
    LoopNode*       _lp;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1192
    IfNode*         _iff;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1193
    LoopNode*       _lp_reserved;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1194
    bool            _has_reserved;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1195
    bool            _use_new;
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1196
    const bool      _active; //may be set to false in ctor, then the object is dummy
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1197
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1198
  public:
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1199
    CountedLoopReserveKit(PhaseIdealLoop* phase, IdealLoopTree *loop, bool active);
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1200
    ~CountedLoopReserveKit();
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1201
    void use_new()                {_use_new = true;}
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1202
    void set_iff(IfNode* x)       {_iff = x;}
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1203
    bool has_reserved()     const { return _active && _has_reserved;}
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1204
  private:
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1205
    bool create_reserve();
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1206
};// class CountedLoopReserveKit
81352250770f 8136725: Provide utility for creation a counted loop reserve copy (clone)
iveresov
parents: 33067
diff changeset
  1207
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
inline Node* IdealLoopTree::tail() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
// Handle lazy update of _tail field
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
  Node *n = _tail;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
  //while( !n->in(0) )  // Skip dead CFG nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
    //n = n->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
  if (n->in(0) == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
    n = _phase->get_ctrl(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
  _tail = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
// Iterate over the loop tree using a preorder, left-to-right traversal.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
// Example that visits all counted loops from within PhaseIdealLoop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
//  for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
//   IdealLoopTree* lpt = iter.current();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
//   if (!lpt->is_counted()) continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
//   ...
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
class LoopTreeIterator : public StackObj {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
  IdealLoopTree* _root;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
  IdealLoopTree* _curnt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
  LoopTreeIterator(IdealLoopTree* root) : _root(root), _curnt(root) {}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
  bool done() { return _curnt == NULL; }       // Finished iterating?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
  void next();                                 // Advance to next loop tree
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
  IdealLoopTree* current() { return _curnt; }  // Return current value of iterator.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
};
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
  1242
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 6433
diff changeset
  1243
#endif // SHARE_VM_OPTO_LOOPNODE_HPP