• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/opto/coalesce.hpp@2a1a77d3458f (annotated)

src/share/vm/opto/coalesce.hpp

Tue, 24 Jun 2008 16:00:14 -0700

author

never

date

Tue, 24 Jun 2008 16:00:14 -0700

changeset 657

2a1a77d3458f

parent 435

a61af66fc99e

child 1907

c18cbe5936b8

permissions

-rw-r--r--

6718676: putback for 6604014 is incomplete
Reviewed-by: kvn, jrose

duke@435	1	/*
duke@435	2	* Copyright 1997-2003 Sun Microsystems, Inc. All Rights Reserved.
duke@435	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435	4	*
duke@435	5	* This code is free software; you can redistribute it and/or modify it
duke@435	6	* under the terms of the GNU General Public License version 2 only, as
duke@435	7	* published by the Free Software Foundation.
duke@435	8	*
duke@435	9	* This code is distributed in the hope that it will be useful, but WITHOUT
duke@435	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435	12	* version 2 for more details (a copy is included in the LICENSE file that
duke@435	13	* accompanied this code).
duke@435	14	*
duke@435	15	* You should have received a copy of the GNU General Public License version
duke@435	16	* 2 along with this work; if not, write to the Free Software Foundation,
duke@435	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435	18	*
duke@435	19	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435	20	* CA 95054 USA or visit www.sun.com if you need additional information or
duke@435	21	* have any questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
duke@435	25	class LoopTree;
duke@435	26	class LRG;
duke@435	27	class LRG_List;
duke@435	28	class Matcher;
duke@435	29	class PhaseIFG;
duke@435	30	class PhaseCFG;
duke@435	31
duke@435	32	//------------------------------PhaseCoalesce----------------------------------
duke@435	33	class PhaseCoalesce : public Phase {
duke@435	34	protected:
duke@435	35	PhaseChaitin &_phc;
duke@435	36
duke@435	37	public:
duke@435	38	// Coalesce copies
duke@435	39	PhaseCoalesce( PhaseChaitin &chaitin ) : Phase(Coalesce), _phc(chaitin) { }
duke@435	40
duke@435	41	virtual void verify() = 0;
duke@435	42
duke@435	43	// Coalesce copies
duke@435	44	void coalesce_driver( );
duke@435	45
duke@435	46	// Coalesce copies in this block
duke@435	47	virtual void coalesce( Block *b ) = 0;
duke@435	48
duke@435	49	// Attempt to coalesce live ranges defined by these 2
duke@435	50	void combine_these_two( Node *n1, Node *n2 );
duke@435	51
duke@435	52	LRG &lrgs( uint lidx ) { return _phc.lrgs(lidx); }
duke@435	53	#ifndef PRODUCT
duke@435	54	// Dump internally name
duke@435	55	void dump( Node *n ) const;
duke@435	56	// Dump whole shebang
duke@435	57	void dump() const;
duke@435	58	#endif
duke@435	59	};
duke@435	60
duke@435	61	//------------------------------PhaseAggressiveCoalesce------------------------
duke@435	62	// Aggressively, pessimistic coalesce copies. Aggressive means ignore graph
duke@435	63	// colorability; perhaps coalescing to the point of forcing a spill.
duke@435	64	// Pessimistic means we cannot coalesce if 2 live ranges interfere. This
duke@435	65	// implies we do not hit a fixed point right away.
duke@435	66	class PhaseAggressiveCoalesce : public PhaseCoalesce {
duke@435	67	uint _unique;
duke@435	68	public:
duke@435	69	// Coalesce copies
duke@435	70	PhaseAggressiveCoalesce( PhaseChaitin &chaitin ) : PhaseCoalesce(chaitin) {}
duke@435	71
duke@435	72	virtual void verify() { };
duke@435	73
duke@435	74	// Aggressively coalesce copies in this block
duke@435	75	virtual void coalesce( Block *b );
duke@435	76
duke@435	77	// Where I fail to coalesce, manifest virtual copies as the Real Thing
duke@435	78	void insert_copies( Matcher &matcher );
duke@435	79
duke@435	80	// Copy insertion needs some smarts in case live ranges overlap
duke@435	81	void insert_copy_with_overlap( Block *b, Node *copy, uint dst_name, uint src_name );
duke@435	82	};
duke@435	83
duke@435	84
duke@435	85	//------------------------------PhaseConservativeCoalesce----------------------
duke@435	86	// Conservatively, pessimistic coalesce copies. Conservative means do not
duke@435	87	// coalesce if the resultant live range will be uncolorable. Pessimistic
duke@435	88	// means we cannot coalesce if 2 live ranges interfere. This implies we do
duke@435	89	// not hit a fixed point right away.
duke@435	90	class PhaseConservativeCoalesce : public PhaseCoalesce {
duke@435	91	IndexSet _ulr; // Union live range interferences
duke@435	92	public:
duke@435	93	// Coalesce copies
duke@435	94	PhaseConservativeCoalesce( PhaseChaitin &chaitin );
duke@435	95
duke@435	96	virtual void verify();
duke@435	97
duke@435	98	// Conservatively coalesce copies in this block
duke@435	99	virtual void coalesce( Block *b );
duke@435	100
duke@435	101	// Coalesce this chain of copies away
duke@435	102	bool copy_copy( Node *dst_copy, Node *src_copy, Block *b, uint bindex );
duke@435	103
duke@435	104	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	105
duke@435	106	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	107
duke@435	108	void update_ifg(uint lr1, uint lr2, IndexSet *n_lr1, IndexSet *n_lr2);
duke@435	109	};