Mercurial > hg > truffle
annotate src/share/vm/opto/locknode.hpp @ 1994:6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
7002546: regression on SpecJbb2005 on 7b118 comparing to 7b117 on small heaps
Summary: Relaxed assertion checking related to incremental_collection_failed flag to allow for ExplicitGCInvokesConcurrent behaviour where we do not want a failing scavenge to bail to a stop-world collection. Parameterized incremental_collection_will_fail() so we can selectively use, or not use, as appropriate, the statistical prediction at specific use sites. This essentially reverts the scavenge bail-out logic to what it was prior to some recent changes that had inadvertently started using the statistical prediction which can be noisy in the presence of bursty loads. Added some associated verbose non-product debugging messages.
Reviewed-by: johnc, tonyp
| author | ysr |
|---|---|
| date | Tue, 07 Dec 2010 21:55:53 -0800 |
| parents | f95d63e2154a |
| children | b92c45f2bc75 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 1972 | 2 * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
460
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
460
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
460
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_OPTO_LOCKNODE_HPP |
| 26 #define SHARE_VM_OPTO_LOCKNODE_HPP | |
| 27 | |
| 28 #include "opto/node.hpp" | |
| 29 #include "opto/opcodes.hpp" | |
| 30 #include "opto/subnode.hpp" | |
| 31 #ifdef TARGET_ARCH_MODEL_x86_32 | |
| 32 # include "adfiles/ad_x86_32.hpp" | |
| 33 #endif | |
| 34 #ifdef TARGET_ARCH_MODEL_x86_64 | |
| 35 # include "adfiles/ad_x86_64.hpp" | |
| 36 #endif | |
| 37 #ifdef TARGET_ARCH_MODEL_sparc | |
| 38 # include "adfiles/ad_sparc.hpp" | |
| 39 #endif | |
| 40 #ifdef TARGET_ARCH_MODEL_zero | |
| 41 # include "adfiles/ad_zero.hpp" | |
| 42 #endif | |
| 43 | |
| 0 | 44 //------------------------------BoxLockNode------------------------------------ |
| 45 class BoxLockNode : public Node { | |
| 46 public: | |
| 47 const int _slot; | |
| 48 RegMask _inmask; | |
|
66
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
49 bool _is_eliminated; // indicates this lock was safely eliminated |
| 0 | 50 |
| 51 BoxLockNode( int lock ); | |
| 52 virtual int Opcode() const; | |
| 53 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const; | |
| 54 virtual uint size(PhaseRegAlloc *ra_) const; | |
| 55 virtual const RegMask &in_RegMask(uint) const; | |
| 56 virtual const RegMask &out_RegMask() const; | |
| 57 virtual uint size_of() const; | |
|
460
424f9bfe6b96
6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn
parents:
196
diff
changeset
|
58 virtual uint hash() const; |
| 0 | 59 virtual uint cmp( const Node &n ) const; |
| 60 virtual const class Type *bottom_type() const { return TypeRawPtr::BOTTOM; } | |
| 61 virtual uint ideal_reg() const { return Op_RegP; } | |
| 62 | |
| 63 static OptoReg::Name stack_slot(Node* box_node); | |
| 64 | |
|
66
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
65 bool is_eliminated() { return _is_eliminated; } |
|
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
66 // mark lock as eliminated. |
|
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
67 void set_eliminated() { _is_eliminated = true; } |
|
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
68 |
| 0 | 69 #ifndef PRODUCT |
| 70 virtual void format( PhaseRegAlloc *, outputStream *st ) const; | |
| 71 virtual void dump_spec(outputStream *st) const { st->print(" Lock %d",_slot); } | |
| 72 #endif | |
| 73 }; | |
| 74 | |
| 75 //------------------------------FastLockNode----------------------------------- | |
| 76 class FastLockNode: public CmpNode { | |
| 77 private: | |
| 78 BiasedLockingCounters* _counters; | |
| 79 | |
| 80 public: | |
| 81 FastLockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) { | |
| 82 init_req(0,ctrl); | |
| 83 init_class_id(Class_FastLock); | |
| 84 _counters = NULL; | |
| 85 } | |
| 86 Node* obj_node() const { return in(1); } | |
| 87 Node* box_node() const { return in(2); } | |
| 88 | |
| 89 // FastLock and FastUnlockNode do not hash, we need one for each correspoding | |
| 90 // LockNode/UnLockNode to avoid creating Phi's. | |
| 91 virtual uint hash() const ; // { return NO_HASH; } | |
| 92 virtual uint cmp( const Node &n ) const ; // Always fail, except on self | |
| 93 virtual int Opcode() const; | |
| 94 virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; } | |
| 95 const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;} | |
| 96 | |
| 97 void create_lock_counter(JVMState* s); | |
| 98 BiasedLockingCounters* counters() const { return _counters; } | |
| 99 }; | |
| 100 | |
| 101 | |
| 102 //------------------------------FastUnlockNode--------------------------------- | |
| 103 class FastUnlockNode: public CmpNode { | |
| 104 public: | |
| 105 FastUnlockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) { | |
| 106 init_req(0,ctrl); | |
| 107 init_class_id(Class_FastUnlock); | |
| 108 } | |
| 109 Node* obj_node() const { return in(1); } | |
| 110 Node* box_node() const { return in(2); } | |
| 111 | |
| 112 | |
| 113 // FastLock and FastUnlockNode do not hash, we need one for each correspoding | |
| 114 // LockNode/UnLockNode to avoid creating Phi's. | |
| 115 virtual uint hash() const ; // { return NO_HASH; } | |
| 116 virtual uint cmp( const Node &n ) const ; // Always fail, except on self | |
| 117 virtual int Opcode() const; | |
| 118 virtual const Type *Value( PhaseTransform *phase ) const { return TypeInt::CC; } | |
| 119 const Type *sub(const Type *t1, const Type *t2) const { return TypeInt::CC;} | |
| 120 | |
| 121 }; | |
| 1972 | 122 |
| 123 #endif // SHARE_VM_OPTO_LOCKNODE_HPP |