locknode.hpp revision 1472:c18cbe5936b8 
1/*
2 * Copyright (c) 1999, 2008, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25//------------------------------BoxLockNode------------------------------------
26class BoxLockNode : public Node {
27public:
28  const int _slot;
29  RegMask   _inmask;
30  bool _is_eliminated;    // indicates this lock was safely eliminated
31
32  BoxLockNode( int lock );
33  virtual int Opcode() const;
34  virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
35  virtual uint size(PhaseRegAlloc *ra_) const;
36  virtual const RegMask &in_RegMask(uint) const;
37  virtual const RegMask &out_RegMask() const;
38  virtual uint size_of() const;
39  virtual uint hash() const;
40  virtual uint cmp( const Node &n ) const;
41  virtual const class Type *bottom_type() const { return TypeRawPtr::BOTTOM; }
42  virtual uint ideal_reg() const { return Op_RegP; }
43
44  static OptoReg::Name stack_slot(Node* box_node);
45
46  bool is_eliminated()  { return _is_eliminated; }
47  // mark lock as eliminated.
48  void set_eliminated() { _is_eliminated = true; }
49
50#ifndef PRODUCT
51  virtual void format( PhaseRegAlloc *, outputStream *st ) const;
52  virtual void dump_spec(outputStream *st) const { st->print("  Lock %d",_slot); }
53#endif
54};
55
56//------------------------------FastLockNode-----------------------------------
57class FastLockNode: public CmpNode {
58private:
59  BiasedLockingCounters* _counters;
60
61public:
62  FastLockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
63    init_req(0,ctrl);
64    init_class_id(Class_FastLock);
65    _counters = NULL;
66  }
67  Node* obj_node() const { return in(1); }
68  Node* box_node() const { return in(2); }
69
70  // FastLock and FastUnlockNode do not hash, we need one for each correspoding
71  // LockNode/UnLockNode to avoid creating Phi's.
72  virtual uint hash() const ;                  // { return NO_HASH; }
73  virtual uint cmp( const Node &n ) const ;    // Always fail, except on self
74  virtual int Opcode() const;
75  virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
76  const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
77
78  void create_lock_counter(JVMState* s);
79  BiasedLockingCounters* counters() const { return _counters; }
80};
81
82
83//------------------------------FastUnlockNode---------------------------------
84class FastUnlockNode: public CmpNode {
85public:
86  FastUnlockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
87    init_req(0,ctrl);
88    init_class_id(Class_FastUnlock);
89  }
90  Node* obj_node() const { return in(1); }
91  Node* box_node() const { return in(2); }
92
93
94  // FastLock and FastUnlockNode do not hash, we need one for each correspoding
95  // LockNode/UnLockNode to avoid creating Phi's.
96  virtual uint hash() const ;                  // { return NO_HASH; }
97  virtual uint cmp( const Node &n ) const ;    // Always fail, except on self
98  virtual int Opcode() const;
99  virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
100  const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
101
102};
103