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

src/share/vm/opto/locknode.hpp@606acabe7b5c (annotated)

src/share/vm/opto/locknode.hpp

Thu, 20 Mar 2014 17:49:27 -0700

author

kvn

date

Thu, 20 Mar 2014 17:49:27 -0700

changeset 6429

606acabe7b5c

parent 4153

b9a9ed0f8eeb

child 6518

62c54fcc0a35

permissions

-rw-r--r--

8031320: Use Intel RTM instructions for locks
Summary: Use RTM for inflated locks and stack locks.
Reviewed-by: iveresov, twisti, roland, dcubed

duke@435	1	/*
mikael@4153	2	* Copyright (c) 1999, 2012, Oracle and/or its affiliates. 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	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
duke@435	22	*
duke@435	23	*/
duke@435	24
stefank@2314	25	#ifndef SHARE_VM_OPTO_LOCKNODE_HPP
stefank@2314	26	#define SHARE_VM_OPTO_LOCKNODE_HPP
stefank@2314	27
stefank@2314	28	#include "opto/node.hpp"
stefank@2314	29	#include "opto/opcodes.hpp"
stefank@2314	30	#include "opto/subnode.hpp"
stefank@2314	31	#ifdef TARGET_ARCH_MODEL_x86_32
stefank@2314	32	# include "adfiles/ad_x86_32.hpp"
stefank@2314	33	#endif
stefank@2314	34	#ifdef TARGET_ARCH_MODEL_x86_64
stefank@2314	35	# include "adfiles/ad_x86_64.hpp"
stefank@2314	36	#endif
stefank@2314	37	#ifdef TARGET_ARCH_MODEL_sparc
stefank@2314	38	# include "adfiles/ad_sparc.hpp"
stefank@2314	39	#endif
stefank@2314	40	#ifdef TARGET_ARCH_MODEL_zero
stefank@2314	41	# include "adfiles/ad_zero.hpp"
stefank@2314	42	#endif
bobv@2508	43	#ifdef TARGET_ARCH_MODEL_arm
bobv@2508	44	# include "adfiles/ad_arm.hpp"
bobv@2508	45	#endif
bobv@2508	46	#ifdef TARGET_ARCH_MODEL_ppc
bobv@2508	47	# include "adfiles/ad_ppc.hpp"
bobv@2508	48	#endif
stefank@2314	49
duke@435	50	//------------------------------BoxLockNode------------------------------------
duke@435	51	class BoxLockNode : public Node {
kvn@3419	52	const int _slot; // stack slot
kvn@3419	53	RegMask _inmask; // OptoReg corresponding to stack slot
kvn@3419	54	bool _is_eliminated; // Associated locks were safely eliminated
duke@435	55
kvn@3406	56	public:
duke@435	57	BoxLockNode( int lock );
duke@435	58	virtual int Opcode() const;
duke@435	59	virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435	60	virtual uint size(PhaseRegAlloc *ra_) const;
duke@435	61	virtual const RegMask &in_RegMask(uint) const;
duke@435	62	virtual const RegMask &out_RegMask() const;
duke@435	63	virtual uint size_of() const;
kvn@895	64	virtual uint hash() const;
duke@435	65	virtual uint cmp( const Node &n ) const;
duke@435	66	virtual const class Type *bottom_type() const { return TypeRawPtr::BOTTOM; }
duke@435	67	virtual uint ideal_reg() const { return Op_RegP; }
duke@435	68
kvn@3406	69	static OptoReg::Name reg(Node* box_node);
kvn@3406	70	static BoxLockNode* box_node(Node* box_node);
kvn@3419	71	static bool same_slot(Node* box1, Node* box2) {
kvn@3419	72	return box1->as_BoxLock()->_slot == box2->as_BoxLock()->_slot;
kvn@3419	73	}
kvn@3406	74	int stack_slot() const { return _slot; }
duke@435	75
kvn@3406	76	bool is_eliminated() const { return _is_eliminated; }
kvn@501	77	// mark lock as eliminated.
kvn@3406	78	void set_eliminated() { _is_eliminated = true; }
kvn@3406	79
kvn@3406	80	// Is BoxLock node used for one simple lock region?
kvn@3406	81	bool is_simple_lock_region(LockNode** unique_lock, Node* obj);
kvn@501	82
duke@435	83	#ifndef PRODUCT
duke@435	84	virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435	85	virtual void dump_spec(outputStream *st) const { st->print(" Lock %d",_slot); }
duke@435	86	#endif
duke@435	87	};
duke@435	88
duke@435	89	//------------------------------FastLockNode-----------------------------------
duke@435	90	class FastLockNode: public CmpNode {
duke@435	91	private:
kvn@6429	92	BiasedLockingCounters* _counters;
kvn@6429	93	RTMLockingCounters* _rtm_counters; // RTM lock counters for inflated locks
kvn@6429	94	RTMLockingCounters* _stack_rtm_counters; // RTM lock counters for stack locks
duke@435	95
duke@435	96	public:
duke@435	97	FastLockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
duke@435	98	init_req(0,ctrl);
duke@435	99	init_class_id(Class_FastLock);
duke@435	100	_counters = NULL;
kvn@6429	101	_rtm_counters = NULL;
kvn@6429	102	_stack_rtm_counters = NULL;
duke@435	103	}
duke@435	104	Node* obj_node() const { return in(1); }
duke@435	105	Node* box_node() const { return in(2); }
kvn@3406	106	void set_box_node(Node* box) { set_req(2, box); }
duke@435	107
duke@435	108	// FastLock and FastUnlockNode do not hash, we need one for each correspoding
duke@435	109	// LockNode/UnLockNode to avoid creating Phi's.
duke@435	110	virtual uint hash() const ; // { return NO_HASH; }
kvn@6429	111	virtual uint size_of() const;
duke@435	112	virtual uint cmp( const Node &n ) const ; // Always fail, except on self
duke@435	113	virtual int Opcode() const;
duke@435	114	virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
duke@435	115	const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
duke@435	116
duke@435	117	void create_lock_counter(JVMState* s);
kvn@6429	118	void create_rtm_lock_counter(JVMState* state);
kvn@6429	119	BiasedLockingCounters* counters() const { return _counters; }
kvn@6429	120	RTMLockingCounters* rtm_counters() const { return _rtm_counters; }
kvn@6429	121	RTMLockingCounters* stack_rtm_counters() const { return _stack_rtm_counters; }
duke@435	122	};
duke@435	123
duke@435	124
duke@435	125	//------------------------------FastUnlockNode---------------------------------
duke@435	126	class FastUnlockNode: public CmpNode {
duke@435	127	public:
duke@435	128	FastUnlockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
duke@435	129	init_req(0,ctrl);
duke@435	130	init_class_id(Class_FastUnlock);
duke@435	131	}
duke@435	132	Node* obj_node() const { return in(1); }
duke@435	133	Node* box_node() const { return in(2); }
duke@435	134
duke@435	135
duke@435	136	// FastLock and FastUnlockNode do not hash, we need one for each correspoding
duke@435	137	// LockNode/UnLockNode to avoid creating Phi's.
duke@435	138	virtual uint hash() const ; // { return NO_HASH; }
duke@435	139	virtual uint cmp( const Node &n ) const ; // Always fail, except on self
duke@435	140	virtual int Opcode() const;
duke@435	141	virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
duke@435	142	const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
duke@435	143
duke@435	144	};
stefank@2314	145
stefank@2314	146	#endif // SHARE_VM_OPTO_LOCKNODE_HPP