--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/share/vm/opto/locknode.hpp	Sat Dec 01 00:00:00 2007 +0000
@@ -0,0 +1,97 @@
+/*
+ * Copyright 1999-2006 Sun Microsystems, Inc.  All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
+ * CA 95054 USA or visit www.sun.com if you need additional information or
+ * have any questions.
+ *
+ */
+
+//------------------------------BoxLockNode------------------------------------
+class BoxLockNode : public Node {
+public:
+  const int _slot;
+  RegMask   _inmask;
+
+  BoxLockNode( int lock );
+  virtual int Opcode() const;
+  virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
+  virtual uint size(PhaseRegAlloc *ra_) const;
+  virtual const RegMask &in_RegMask(uint) const;
+  virtual const RegMask &out_RegMask() const;
+  virtual uint size_of() const;
+  virtual uint hash() const { return Node::hash() + _slot; }
+  virtual uint cmp( const Node &n ) const;
+  virtual const class Type *bottom_type() const { return TypeRawPtr::BOTTOM; }
+  virtual uint ideal_reg() const { return Op_RegP; }
+
+  static OptoReg::Name stack_slot(Node* box_node);
+
+#ifndef PRODUCT
+  virtual void format( PhaseRegAlloc *, outputStream *st ) const;
+  virtual void dump_spec(outputStream *st) const { st->print("  Lock %d",_slot); }
+#endif
+};
+
+//------------------------------FastLockNode-----------------------------------
+class FastLockNode: public CmpNode {
+private:
+  BiasedLockingCounters* _counters;
+
+public:
+  FastLockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
+    init_req(0,ctrl);
+    init_class_id(Class_FastLock);
+    _counters = NULL;
+  }
+  Node* obj_node() const { return in(1); }
+  Node* box_node() const { return in(2); }
+
+  // FastLock and FastUnlockNode do not hash, we need one for each correspoding
+  // LockNode/UnLockNode to avoid creating Phi's.
+  virtual uint hash() const ;                  // { return NO_HASH; }
+  virtual uint cmp( const Node &n ) const ;    // Always fail, except on self
+  virtual int Opcode() const;
+  virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
+  const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
+
+  void create_lock_counter(JVMState* s);
+  BiasedLockingCounters* counters() const { return _counters; }
+};
+
+
+//------------------------------FastUnlockNode---------------------------------
+class FastUnlockNode: public CmpNode {
+public:
+  FastUnlockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) {
+    init_req(0,ctrl);
+    init_class_id(Class_FastUnlock);
+  }
+  Node* obj_node() const { return in(1); }
+  Node* box_node() const { return in(2); }
+
+
+  // FastLock and FastUnlockNode do not hash, we need one for each correspoding
+  // LockNode/UnLockNode to avoid creating Phi's.
+  virtual uint hash() const ;                  // { return NO_HASH; }
+  virtual uint cmp( const Node &n ) const ;    // Always fail, except on self
+  virtual int Opcode() const;
+  virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; }
+  const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;}
+
+};