src/share/vm/opto/loopnode.hpp

rev 8571 : 8080289: Intermediate writes in a loop not eliminated by optimizer
Summary: Move Stores out of loop (after or before) when possible
Reviewed-by:

*** 358,368 ****
        _allow_optimizations(true),
        _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0)
    { }
  
    // Is 'l' a member of 'this'?
!   int is_member( const IdealLoopTree *l ) const; // Test for nested membership
  
    // Set loop nesting depth.  Accumulate has_call bits.
    int set_nest( uint depth );
  
    // Split out multiple fall-in edges from the loop header.  Move them to a
--- 358,368 ----
        _allow_optimizations(true),
        _nest(0), _irreducible(0), _has_call(0), _has_sfpt(0), _rce_candidate(0)
    { }
  
    // Is 'l' a member of 'this'?
!   bool is_member(const IdealLoopTree *l) const; // Test for nested membership
  
    // Set loop nesting depth.  Accumulate has_call bits.
    int set_nest( uint depth );
  
    // Split out multiple fall-in edges from the loop header.  Move them to a
*** 1055,1064 ****
--- 1055,1066 ----
    Node *find_use_block( Node *use, Node *def, Node *old_false, Node *new_false, Node *old_true, Node *new_true );
    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 );
    bool split_up( Node *n, Node *blk1, Node *blk2 );
    void sink_use( Node *use, Node *post_loop );
    Node *place_near_use( Node *useblock ) const;
+   Node* try_move_store_before_loop(Node* n, Node *n_ctrl);
+   void try_move_store_after_loop(Node* n);
  
    bool _created_loop_node;
  public:
    void set_created_loop_node() { _created_loop_node = true; }
    bool created_loop_node()     { return _created_loop_node; }