duke@435: /*
stefank@2314:  * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #ifndef SHARE_VM_OPTO_COALESCE_HPP
stefank@2314: #define SHARE_VM_OPTO_COALESCE_HPP
stefank@2314: 
stefank@2314: #include "opto/phase.hpp"
stefank@2314: 
duke@435: class LoopTree;
duke@435: class LRG;
duke@435: class LRG_List;
duke@435: class Matcher;
duke@435: class PhaseIFG;
duke@435: class PhaseCFG;
duke@435: 
duke@435: //------------------------------PhaseCoalesce----------------------------------
duke@435: class PhaseCoalesce : public Phase {
duke@435: protected:
duke@435:   PhaseChaitin &_phc;
duke@435: 
duke@435: public:
duke@435:   // Coalesce copies
duke@435:   PhaseCoalesce( PhaseChaitin &chaitin ) : Phase(Coalesce), _phc(chaitin) { }
duke@435: 
duke@435:   virtual void verify() = 0;
duke@435: 
duke@435:   // Coalesce copies
duke@435:   void coalesce_driver( );
duke@435: 
duke@435:   // Coalesce copies in this block
duke@435:   virtual void coalesce( Block *b ) = 0;
duke@435: 
duke@435:   // Attempt to coalesce live ranges defined by these 2
duke@435:   void combine_these_two( Node *n1, Node *n2 );
duke@435: 
duke@435:   LRG &lrgs( uint lidx ) { return _phc.lrgs(lidx); }
duke@435: #ifndef PRODUCT
duke@435:   // Dump internally name
duke@435:   void dump( Node *n ) const;
duke@435:   // Dump whole shebang
duke@435:   void dump() const;
duke@435: #endif
duke@435: };
duke@435: 
duke@435: //------------------------------PhaseAggressiveCoalesce------------------------
duke@435: // Aggressively, pessimistic coalesce copies.  Aggressive means ignore graph
duke@435: // colorability; perhaps coalescing to the point of forcing a spill.
duke@435: // Pessimistic means we cannot coalesce if 2 live ranges interfere.  This
duke@435: // implies we do not hit a fixed point right away.
duke@435: class PhaseAggressiveCoalesce : public PhaseCoalesce {
duke@435:   uint _unique;
duke@435: public:
duke@435:   // Coalesce copies
duke@435:   PhaseAggressiveCoalesce( PhaseChaitin &chaitin ) : PhaseCoalesce(chaitin) {}
duke@435: 
duke@435:   virtual void verify() { };
duke@435: 
duke@435:   // Aggressively coalesce copies in this block
duke@435:   virtual void coalesce( Block *b );
duke@435: 
duke@435:   // Where I fail to coalesce, manifest virtual copies as the Real Thing
duke@435:   void insert_copies( Matcher &matcher );
duke@435: 
duke@435:   // Copy insertion needs some smarts in case live ranges overlap
duke@435:   void insert_copy_with_overlap( Block *b, Node *copy, uint dst_name, uint src_name );
duke@435: };
duke@435: 
duke@435: 
duke@435: //------------------------------PhaseConservativeCoalesce----------------------
duke@435: // Conservatively, pessimistic coalesce copies.  Conservative means do not
duke@435: // coalesce if the resultant live range will be uncolorable.  Pessimistic
duke@435: // means we cannot coalesce if 2 live ranges interfere.  This implies we do
duke@435: // not hit a fixed point right away.
duke@435: class PhaseConservativeCoalesce : public PhaseCoalesce {
duke@435:   IndexSet _ulr;               // Union live range interferences
duke@435: public:
duke@435:   // Coalesce copies
duke@435:   PhaseConservativeCoalesce( PhaseChaitin &chaitin );
duke@435: 
duke@435:   virtual void verify();
duke@435: 
duke@435:   // Conservatively coalesce copies in this block
duke@435:   virtual void coalesce( Block *b );
duke@435: 
duke@435:   // Coalesce this chain of copies away
duke@435:   bool copy_copy( Node *dst_copy, Node *src_copy, Block *b, uint bindex );
duke@435: 
duke@435:   void union_helper( Node *lr1_node, Node *lr2_node, uint lr1, uint lr2, Node *src_def, Node *dst_copy, Node *src_copy, Block *b, uint bindex );
duke@435: 
duke@435:   uint compute_separating_interferences(Node *dst_copy, Node *src_copy, Block *b, uint bindex, RegMask &rm, uint rm_size, uint reg_degree, uint lr1, uint lr2);
duke@435: 
duke@435:   void update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2);
duke@435: };
stefank@2314: 
stefank@2314: #endif // SHARE_VM_OPTO_COALESCE_HPP