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

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

src/share/vm/opto/coalesce.hpp

Thu, 24 May 2018 19:26:50 +0800

author

aoqi

date

Thu, 24 May 2018 19:26:50 +0800

changeset 8862

fd13a567f179

parent 6876

710a3c8b516e

permissions

-rw-r--r--

#7046 C2 supports long branch
Contributed-by: fujie

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