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

src/share/vm/opto/rootnode.hpp@82a980778b92 (annotated)

src/share/vm/opto/rootnode.hpp

Thu, 05 Feb 2009 11:42:10 -0800

author

never

date

Thu, 05 Feb 2009 11:42:10 -0800

changeset 979

82a980778b92

parent 435

a61af66fc99e

child 1907

c18cbe5936b8

permissions

-rw-r--r--

6793828: G1: invariant: queues are empty when activated
Reviewed-by: jrose, kvn

duke@435	1	/*
duke@435	2	* Copyright 1997-2005 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	//------------------------------RootNode---------------------------------------
duke@435	26	// The one-and-only before-all-else and after-all-else RootNode. The RootNode
duke@435	27	// represents what happens if the user runs the whole program repeatedly. The
duke@435	28	// RootNode produces the initial values of I/O and memory for the program or
duke@435	29	// procedure start.
duke@435	30	class RootNode : public LoopNode {
duke@435	31	public:
duke@435	32	RootNode( ) : LoopNode(0,0) {
duke@435	33	init_class_id(Class_Root);
duke@435	34	del_req(2);
duke@435	35	del_req(1);
duke@435	36	}
duke@435	37	virtual int Opcode() const;
duke@435	38	virtual const Node *is_block_proj() const { return this; }
duke@435	39	virtual const Type *bottom_type() const { return Type::BOTTOM; }
duke@435	40	virtual Node *Identity( PhaseTransform *phase ) { return this; }
duke@435	41	virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435	42	virtual const Type *Value( PhaseTransform *phase ) const { return Type::BOTTOM; }
duke@435	43	};
duke@435	44
duke@435	45	//------------------------------HaltNode---------------------------------------
duke@435	46	// Throw an exception & die
duke@435	47	class HaltNode : public Node {
duke@435	48	public:
duke@435	49	HaltNode( Node *ctrl, Node *frameptr );
duke@435	50	virtual int Opcode() const;
duke@435	51	virtual bool pinned() const { return true; };
duke@435	52	virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435	53	virtual const Type *Value( PhaseTransform *phase ) const;
duke@435	54	virtual const Type *bottom_type() const;
duke@435	55	virtual bool is_CFG() const { return true; }
duke@435	56	virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash
duke@435	57	virtual bool depends_only_on_test() const { return false; }
duke@435	58	virtual const Node *is_block_proj() const { return this; }
duke@435	59	virtual const RegMask &out_RegMask() const;
duke@435	60	virtual uint ideal_reg() const { return NotAMachineReg; }
duke@435	61	virtual uint match_edge(uint idx) const { return 0; }
duke@435	62	};