mirror of
https://github.com/openjdk/jdk.git
synced 2025-08-28 07:14:30 +02:00
8191890: Biased locking still uses the inferior stop the world safepoint for revocation
Revocations are now executed with thread local handshakes instead of safepoints Reviewed-by: dcubed, coleenp, dholmes, rehn, mgronlun
This commit is contained in:
parent
238c17bdb5
commit
fe39168fa7
8 changed files with 410 additions and 261 deletions
|
@ -1106,7 +1106,7 @@ JRT_ENTRY(nmethod*,
|
||||||
objects_to_revoke->append(Handle(THREAD, kptr->obj()));
|
objects_to_revoke->append(Handle(THREAD, kptr->obj()));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
BiasedLocking::revoke(objects_to_revoke);
|
BiasedLocking::revoke(objects_to_revoke, thread);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return osr_nm;
|
return osr_nm;
|
||||||
|
|
|
@ -119,6 +119,7 @@ bool BiasedLocking::enabled() {
|
||||||
return _biased_locking_enabled || BiasedLockingStartupDelay == 0;
|
return _biased_locking_enabled || BiasedLockingStartupDelay == 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// Returns MonitorInfos for all objects locked on this thread in youngest to oldest order
|
// Returns MonitorInfos for all objects locked on this thread in youngest to oldest order
|
||||||
static GrowableArray<MonitorInfo*>* get_or_compute_monitor_info(JavaThread* thread) {
|
static GrowableArray<MonitorInfo*>* get_or_compute_monitor_info(JavaThread* thread) {
|
||||||
GrowableArray<MonitorInfo*>* info = thread->cached_monitor_info();
|
GrowableArray<MonitorInfo*>* info = thread->cached_monitor_info();
|
||||||
|
@ -153,9 +154,13 @@ static GrowableArray<MonitorInfo*>* get_or_compute_monitor_info(JavaThread* thre
|
||||||
return info;
|
return info;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// After the call, *biased_locker will be set to obj->mark()->biased_locker() if biased_locker != NULL,
|
// After the call, *biased_locker will be set to obj->mark()->biased_locker() if biased_locker != NULL,
|
||||||
// AND it is a living thread. Otherwise it will not be updated, (i.e. the caller is responsible for initialization).
|
// AND it is a living thread. Otherwise it will not be updated, (i.e. the caller is responsible for initialization).
|
||||||
static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_bulk, JavaThread* requesting_thread, JavaThread** biased_locker) {
|
BiasedLocking::Condition BiasedLocking::single_revoke_at_safepoint(oop obj, bool allow_rebias, bool is_bulk, JavaThread* requesting_thread, JavaThread** biased_locker) {
|
||||||
|
assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
|
||||||
|
assert(Thread::current()->is_VM_thread(), "must be VMThread");
|
||||||
|
|
||||||
markOop mark = obj->mark();
|
markOop mark = obj->mark();
|
||||||
if (!mark->has_bias_pattern()) {
|
if (!mark->has_bias_pattern()) {
|
||||||
if (log_is_enabled(Info, biasedlocking)) {
|
if (log_is_enabled(Info, biasedlocking)) {
|
||||||
|
@ -168,7 +173,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
obj->klass()->external_name(),
|
obj->klass()->external_name(),
|
||||||
(intptr_t) requesting_thread);
|
(intptr_t) requesting_thread);
|
||||||
}
|
}
|
||||||
return BiasedLocking::NOT_BIASED;
|
return NOT_BIASED;
|
||||||
}
|
}
|
||||||
|
|
||||||
uint age = mark->age();
|
uint age = mark->age();
|
||||||
|
@ -214,7 +219,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
} else {
|
} else {
|
||||||
log_trace(biasedlocking)(" Revoked bias of anonymously-biased object");
|
log_trace(biasedlocking)(" Revoked bias of anonymously-biased object");
|
||||||
}
|
}
|
||||||
return BiasedLocking::BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Handle case where the thread toward which the object was biased has exited
|
// Handle case where the thread toward which the object was biased has exited
|
||||||
|
@ -239,7 +244,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
log_trace(biasedlocking)(" Revoked bias of object biased toward dead thread ("
|
log_trace(biasedlocking)(" Revoked bias of object biased toward dead thread ("
|
||||||
PTR_FORMAT ")", p2i(biased_thread));
|
PTR_FORMAT ")", p2i(biased_thread));
|
||||||
}
|
}
|
||||||
return BiasedLocking::BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Log at "info" level if not bulk, else "trace" level
|
// Log at "info" level if not bulk, else "trace" level
|
||||||
|
@ -264,7 +269,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
log_trace(biasedlocking)(" mon_info->owner (" PTR_FORMAT ") == obj (" PTR_FORMAT ")",
|
log_trace(biasedlocking)(" mon_info->owner (" PTR_FORMAT ") == obj (" PTR_FORMAT ")",
|
||||||
p2i((void *) mon_info->owner()),
|
p2i((void *) mon_info->owner()),
|
||||||
p2i((void *) obj));
|
p2i((void *) obj));
|
||||||
// Assume recursive case and fix up highest lock later
|
// Assume recursive case and fix up highest lock below
|
||||||
markOop mark = markOopDesc::encode((BasicLock*) NULL);
|
markOop mark = markOopDesc::encode((BasicLock*) NULL);
|
||||||
highest_lock = mon_info->lock();
|
highest_lock = mon_info->lock();
|
||||||
highest_lock->set_displaced_header(mark);
|
highest_lock->set_displaced_header(mark);
|
||||||
|
@ -279,7 +284,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
// object at it
|
// object at it
|
||||||
highest_lock->set_displaced_header(unbiased_prototype);
|
highest_lock->set_displaced_header(unbiased_prototype);
|
||||||
// Reset object header to point to displaced mark.
|
// Reset object header to point to displaced mark.
|
||||||
// Must release storing the lock address for platforms without TSO
|
// Must release store the lock address for platforms without TSO
|
||||||
// ordering (e.g. ppc).
|
// ordering (e.g. ppc).
|
||||||
obj->release_set_mark(markOopDesc::encode(highest_lock));
|
obj->release_set_mark(markOopDesc::encode(highest_lock));
|
||||||
assert(!obj->mark()->has_bias_pattern(), "illegal mark state: stack lock used bias bit");
|
assert(!obj->mark()->has_bias_pattern(), "illegal mark state: stack lock used bias bit");
|
||||||
|
@ -309,7 +314,7 @@ static BiasedLocking::Condition revoke_bias(oop obj, bool allow_rebias, bool is_
|
||||||
*biased_locker = biased_thread;
|
*biased_locker = biased_thread;
|
||||||
}
|
}
|
||||||
|
|
||||||
return BiasedLocking::BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@ -321,7 +326,7 @@ enum HeuristicsResult {
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
static HeuristicsResult update_heuristics(oop o, bool allow_rebias) {
|
static HeuristicsResult update_heuristics(oop o) {
|
||||||
markOop mark = o->mark();
|
markOop mark = o->mark();
|
||||||
if (!mark->has_bias_pattern()) {
|
if (!mark->has_bias_pattern()) {
|
||||||
return HR_NOT_BIASED;
|
return HR_NOT_BIASED;
|
||||||
|
@ -374,11 +379,12 @@ static HeuristicsResult update_heuristics(oop o, bool allow_rebias) {
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
BiasedLocking::Condition BiasedLocking::bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
bool bulk_rebias,
|
bool bulk_rebias,
|
||||||
bool attempt_rebias_of_object,
|
bool attempt_rebias_of_object,
|
||||||
JavaThread* requesting_thread) {
|
JavaThread* requesting_thread) {
|
||||||
assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
|
assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
|
||||||
|
assert(Thread::current()->is_VM_thread(), "must be VMThread");
|
||||||
|
|
||||||
log_info(biasedlocking)("* Beginning bulk revocation (kind == %s) because of object "
|
log_info(biasedlocking)("* Beginning bulk revocation (kind == %s) because of object "
|
||||||
INTPTR_FORMAT " , mark " INTPTR_FORMAT " , type %s",
|
INTPTR_FORMAT " , mark " INTPTR_FORMAT " , type %s",
|
||||||
|
@ -390,7 +396,6 @@ static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
jlong cur_time = os::javaTimeMillis();
|
jlong cur_time = os::javaTimeMillis();
|
||||||
o->klass()->set_last_biased_lock_bulk_revocation_time(cur_time);
|
o->klass()->set_last_biased_lock_bulk_revocation_time(cur_time);
|
||||||
|
|
||||||
|
|
||||||
Klass* k_o = o->klass();
|
Klass* k_o = o->klass();
|
||||||
Klass* klass = k_o;
|
Klass* klass = k_o;
|
||||||
|
|
||||||
|
@ -432,7 +437,7 @@ static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
|
|
||||||
// At this point we're done. All we have to do is potentially
|
// At this point we're done. All we have to do is potentially
|
||||||
// adjust the header of the given object to revoke its bias.
|
// adjust the header of the given object to revoke its bias.
|
||||||
revoke_bias(o, attempt_rebias_of_object && klass->prototype_header()->has_bias_pattern(), true, requesting_thread, NULL);
|
single_revoke_at_safepoint(o, attempt_rebias_of_object && klass->prototype_header()->has_bias_pattern(), true, requesting_thread, NULL);
|
||||||
} else {
|
} else {
|
||||||
if (log_is_enabled(Info, biasedlocking)) {
|
if (log_is_enabled(Info, biasedlocking)) {
|
||||||
ResourceMark rm;
|
ResourceMark rm;
|
||||||
|
@ -454,20 +459,20 @@ static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
oop owner = mon_info->owner();
|
oop owner = mon_info->owner();
|
||||||
markOop mark = owner->mark();
|
markOop mark = owner->mark();
|
||||||
if ((owner->klass() == k_o) && mark->has_bias_pattern()) {
|
if ((owner->klass() == k_o) && mark->has_bias_pattern()) {
|
||||||
revoke_bias(owner, false, true, requesting_thread, NULL);
|
single_revoke_at_safepoint(owner, false, true, requesting_thread, NULL);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Must force the bias of the passed object to be forcibly revoked
|
// Must force the bias of the passed object to be forcibly revoked
|
||||||
// as well to ensure guarantees to callers
|
// as well to ensure guarantees to callers
|
||||||
revoke_bias(o, false, true, requesting_thread, NULL);
|
single_revoke_at_safepoint(o, false, true, requesting_thread, NULL);
|
||||||
}
|
}
|
||||||
} // ThreadsListHandle is destroyed here.
|
} // ThreadsListHandle is destroyed here.
|
||||||
|
|
||||||
log_info(biasedlocking)("* Ending bulk revocation");
|
log_info(biasedlocking)("* Ending bulk revocation");
|
||||||
|
|
||||||
BiasedLocking::Condition status_code = BiasedLocking::BIAS_REVOKED;
|
BiasedLocking::Condition status_code = BIAS_REVOKED;
|
||||||
|
|
||||||
if (attempt_rebias_of_object &&
|
if (attempt_rebias_of_object &&
|
||||||
o->mark()->has_bias_pattern() &&
|
o->mark()->has_bias_pattern() &&
|
||||||
|
@ -475,7 +480,7 @@ static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
markOop new_mark = markOopDesc::encode(requesting_thread, o->mark()->age(),
|
markOop new_mark = markOopDesc::encode(requesting_thread, o->mark()->age(),
|
||||||
klass->prototype_header()->bias_epoch());
|
klass->prototype_header()->bias_epoch());
|
||||||
o->set_mark(new_mark);
|
o->set_mark(new_mark);
|
||||||
status_code = BiasedLocking::BIAS_REVOKED_AND_REBIASED;
|
status_code = BIAS_REVOKED_AND_REBIASED;
|
||||||
log_info(biasedlocking)(" Rebiased object toward thread " INTPTR_FORMAT, (intptr_t) requesting_thread);
|
log_info(biasedlocking)(" Rebiased object toward thread " INTPTR_FORMAT, (intptr_t) requesting_thread);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -487,78 +492,126 @@ static BiasedLocking::Condition bulk_revoke_or_rebias_at_safepoint(oop o,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
static void clean_up_cached_monitor_info() {
|
static void clean_up_cached_monitor_info(JavaThread* thread = NULL) {
|
||||||
|
if (thread != NULL) {
|
||||||
|
thread->set_cached_monitor_info(NULL);
|
||||||
|
} else {
|
||||||
// Walk the thread list clearing out the cached monitors
|
// Walk the thread list clearing out the cached monitors
|
||||||
for (JavaThreadIteratorWithHandle jtiwh; JavaThread *thr = jtiwh.next(); ) {
|
for (JavaThreadIteratorWithHandle jtiwh; JavaThread *thr = jtiwh.next(); ) {
|
||||||
thr->set_cached_monitor_info(NULL);
|
thr->set_cached_monitor_info(NULL);
|
||||||
}
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
class VM_RevokeBias : public VM_Operation {
|
class VM_BulkRevokeBias : public VM_Operation {
|
||||||
protected:
|
private:
|
||||||
Handle* _obj;
|
Handle* _obj;
|
||||||
GrowableArray<Handle>* _objs;
|
|
||||||
JavaThread* _requesting_thread;
|
JavaThread* _requesting_thread;
|
||||||
|
bool _bulk_rebias;
|
||||||
|
bool _attempt_rebias_of_object;
|
||||||
BiasedLocking::Condition _status_code;
|
BiasedLocking::Condition _status_code;
|
||||||
traceid _biased_locker_id;
|
|
||||||
uint64_t _safepoint_id;
|
uint64_t _safepoint_id;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
VM_RevokeBias(Handle* obj, JavaThread* requesting_thread)
|
VM_BulkRevokeBias(Handle* obj, JavaThread* requesting_thread,
|
||||||
|
bool bulk_rebias,
|
||||||
|
bool attempt_rebias_of_object)
|
||||||
: _obj(obj)
|
: _obj(obj)
|
||||||
, _objs(NULL)
|
|
||||||
, _requesting_thread(requesting_thread)
|
, _requesting_thread(requesting_thread)
|
||||||
|
, _bulk_rebias(bulk_rebias)
|
||||||
|
, _attempt_rebias_of_object(attempt_rebias_of_object)
|
||||||
, _status_code(BiasedLocking::NOT_BIASED)
|
, _status_code(BiasedLocking::NOT_BIASED)
|
||||||
, _biased_locker_id(0)
|
|
||||||
, _safepoint_id(0) {}
|
, _safepoint_id(0) {}
|
||||||
|
|
||||||
VM_RevokeBias(GrowableArray<Handle>* objs, JavaThread* requesting_thread)
|
virtual VMOp_Type type() const { return VMOp_BulkRevokeBias; }
|
||||||
: _obj(NULL)
|
|
||||||
, _objs(objs)
|
|
||||||
, _requesting_thread(requesting_thread)
|
|
||||||
, _status_code(BiasedLocking::NOT_BIASED)
|
|
||||||
, _biased_locker_id(0)
|
|
||||||
, _safepoint_id(0) {}
|
|
||||||
|
|
||||||
virtual VMOp_Type type() const { return VMOp_RevokeBias; }
|
|
||||||
|
|
||||||
virtual bool doit_prologue() {
|
|
||||||
// Verify that there is actual work to do since the callers just
|
|
||||||
// give us locked object(s). If we don't find any biased objects
|
|
||||||
// there is nothing to do and we avoid a safepoint.
|
|
||||||
if (_obj != NULL) {
|
|
||||||
markOop mark = (*_obj)()->mark();
|
|
||||||
if (mark->has_bias_pattern()) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
for ( int i = 0 ; i < _objs->length(); i++ ) {
|
|
||||||
markOop mark = (_objs->at(i))()->mark();
|
|
||||||
if (mark->has_bias_pattern()) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
virtual void doit() {
|
virtual void doit() {
|
||||||
if (_obj != NULL) {
|
_status_code = BiasedLocking::bulk_revoke_or_rebias_at_safepoint((*_obj)(), _bulk_rebias, _attempt_rebias_of_object, _requesting_thread);
|
||||||
log_info(biasedlocking)("Revoking bias with potentially per-thread safepoint:");
|
|
||||||
JavaThread* biased_locker = NULL;
|
|
||||||
_status_code = revoke_bias((*_obj)(), false, false, _requesting_thread, &biased_locker);
|
|
||||||
if (biased_locker != NULL) {
|
|
||||||
_biased_locker_id = JFR_THREAD_ID(biased_locker);
|
|
||||||
}
|
|
||||||
_safepoint_id = SafepointSynchronize::safepoint_id();
|
_safepoint_id = SafepointSynchronize::safepoint_id();
|
||||||
clean_up_cached_monitor_info();
|
clean_up_cached_monitor_info();
|
||||||
|
}
|
||||||
|
|
||||||
|
bool is_bulk_rebias() const {
|
||||||
|
return _bulk_rebias;
|
||||||
|
}
|
||||||
|
|
||||||
|
BiasedLocking::Condition status_code() const {
|
||||||
|
return _status_code;
|
||||||
|
}
|
||||||
|
|
||||||
|
uint64_t safepoint_id() const {
|
||||||
|
return _safepoint_id;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
class RevokeOneBias : public ThreadClosure {
|
||||||
|
protected:
|
||||||
|
Handle _obj;
|
||||||
|
JavaThread* _requesting_thread;
|
||||||
|
JavaThread* _biased_locker;
|
||||||
|
BiasedLocking::Condition _status_code;
|
||||||
|
traceid _biased_locker_id;
|
||||||
|
|
||||||
|
public:
|
||||||
|
RevokeOneBias(Handle obj, JavaThread* requesting_thread, JavaThread* biased_locker)
|
||||||
|
: _obj(obj)
|
||||||
|
, _requesting_thread(requesting_thread)
|
||||||
|
, _biased_locker(biased_locker)
|
||||||
|
, _status_code(BiasedLocking::NOT_BIASED)
|
||||||
|
, _biased_locker_id(0) {}
|
||||||
|
|
||||||
|
void do_thread(Thread* target) {
|
||||||
|
assert(target == _biased_locker, "Wrong thread");
|
||||||
|
|
||||||
|
oop o = _obj();
|
||||||
|
markOop mark = o->mark();
|
||||||
|
|
||||||
|
if (!mark->has_bias_pattern()) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
markOop prototype = o->klass()->prototype_header();
|
||||||
|
if (!prototype->has_bias_pattern()) {
|
||||||
|
// This object has a stale bias from before the handshake
|
||||||
|
// was requested. If we fail this race, the object's bias
|
||||||
|
// has been revoked by another thread so we simply return.
|
||||||
|
markOop biased_value = mark;
|
||||||
|
mark = o->cas_set_mark(markOopDesc::prototype()->set_age(mark->age()), mark);
|
||||||
|
assert(!o->mark()->has_bias_pattern(), "even if we raced, should still be revoked");
|
||||||
|
if (biased_value == mark) {
|
||||||
|
_status_code = BiasedLocking::BIAS_REVOKED;
|
||||||
|
}
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (_biased_locker == mark->biased_locker()) {
|
||||||
|
if (mark->bias_epoch() == prototype->bias_epoch()) {
|
||||||
|
// Epoch is still valid. This means biaser could be currently
|
||||||
|
// synchronized on this object. We must walk its stack looking
|
||||||
|
// for monitor records associated with this object and change
|
||||||
|
// them to be stack locks if any are found.
|
||||||
|
ResourceMark rm;
|
||||||
|
BiasedLocking::walk_stack_and_revoke(o, _biased_locker);
|
||||||
|
_biased_locker->set_cached_monitor_info(NULL);
|
||||||
|
assert(!o->mark()->has_bias_pattern(), "invariant");
|
||||||
|
_biased_locker_id = JFR_THREAD_ID(_biased_locker);
|
||||||
|
_status_code = BiasedLocking::BIAS_REVOKED;
|
||||||
return;
|
return;
|
||||||
} else {
|
} else {
|
||||||
log_info(biasedlocking)("Revoking bias with global safepoint:");
|
markOop biased_value = mark;
|
||||||
BiasedLocking::revoke_at_safepoint(_objs);
|
mark = o->cas_set_mark(markOopDesc::prototype()->set_age(mark->age()), mark);
|
||||||
|
if (mark == biased_value || !mark->has_bias_pattern()) {
|
||||||
|
assert(!o->mark()->has_bias_pattern(), "should be revoked");
|
||||||
|
_status_code = (biased_value == mark) ? BiasedLocking::BIAS_REVOKED : BiasedLocking::NOT_BIASED;
|
||||||
|
return;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
_status_code = BiasedLocking::NOT_REVOKED;
|
||||||
|
}
|
||||||
|
|
||||||
BiasedLocking::Condition status_code() const {
|
BiasedLocking::Condition status_code() const {
|
||||||
return _status_code;
|
return _status_code;
|
||||||
|
@ -567,40 +620,9 @@ public:
|
||||||
traceid biased_locker() const {
|
traceid biased_locker() const {
|
||||||
return _biased_locker_id;
|
return _biased_locker_id;
|
||||||
}
|
}
|
||||||
|
|
||||||
uint64_t safepoint_id() const {
|
|
||||||
return _safepoint_id;
|
|
||||||
}
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
class VM_BulkRevokeBias : public VM_RevokeBias {
|
|
||||||
private:
|
|
||||||
bool _bulk_rebias;
|
|
||||||
bool _attempt_rebias_of_object;
|
|
||||||
|
|
||||||
public:
|
|
||||||
VM_BulkRevokeBias(Handle* obj, JavaThread* requesting_thread,
|
|
||||||
bool bulk_rebias,
|
|
||||||
bool attempt_rebias_of_object)
|
|
||||||
: VM_RevokeBias(obj, requesting_thread)
|
|
||||||
, _bulk_rebias(bulk_rebias)
|
|
||||||
, _attempt_rebias_of_object(attempt_rebias_of_object) {}
|
|
||||||
|
|
||||||
virtual VMOp_Type type() const { return VMOp_BulkRevokeBias; }
|
|
||||||
virtual bool doit_prologue() { return true; }
|
|
||||||
|
|
||||||
virtual void doit() {
|
|
||||||
_status_code = bulk_revoke_or_rebias_at_safepoint((*_obj)(), _bulk_rebias, _attempt_rebias_of_object, _requesting_thread);
|
|
||||||
_safepoint_id = SafepointSynchronize::safepoint_id();
|
|
||||||
clean_up_cached_monitor_info();
|
|
||||||
}
|
|
||||||
|
|
||||||
bool is_bulk_rebias() const {
|
|
||||||
return _bulk_rebias;
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
static void post_self_revocation_event(EventBiasedLockSelfRevocation* event, Klass* k) {
|
static void post_self_revocation_event(EventBiasedLockSelfRevocation* event, Klass* k) {
|
||||||
assert(event != NULL, "invariant");
|
assert(event != NULL, "invariant");
|
||||||
assert(k != NULL, "invariant");
|
assert(k != NULL, "invariant");
|
||||||
|
@ -609,13 +631,13 @@ static void post_self_revocation_event(EventBiasedLockSelfRevocation* event, Kla
|
||||||
event->commit();
|
event->commit();
|
||||||
}
|
}
|
||||||
|
|
||||||
static void post_revocation_event(EventBiasedLockRevocation* event, Klass* k, VM_RevokeBias* op) {
|
static void post_revocation_event(EventBiasedLockRevocation* event, Klass* k, RevokeOneBias* op) {
|
||||||
assert(event != NULL, "invariant");
|
assert(event != NULL, "invariant");
|
||||||
assert(k != NULL, "invariant");
|
assert(k != NULL, "invariant");
|
||||||
assert(op != NULL, "invariant");
|
assert(op != NULL, "invariant");
|
||||||
assert(event->should_commit(), "invariant");
|
assert(event->should_commit(), "invariant");
|
||||||
event->set_lockClass(k);
|
event->set_lockClass(k);
|
||||||
event->set_safepointId(op->safepoint_id());
|
event->set_safepointId(0);
|
||||||
event->set_previousOwner(op->biased_locker());
|
event->set_previousOwner(op->biased_locker());
|
||||||
event->commit();
|
event->commit();
|
||||||
}
|
}
|
||||||
|
@ -631,9 +653,126 @@ static void post_class_revocation_event(EventBiasedLockClassRevocation* event, K
|
||||||
event->commit();
|
event->commit();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
BiasedLocking::Condition BiasedLocking::single_revoke_with_handshake(Handle obj, JavaThread *requester, JavaThread *biaser) {
|
||||||
|
|
||||||
|
EventBiasedLockRevocation event;
|
||||||
|
if (PrintBiasedLockingStatistics) {
|
||||||
|
Atomic::inc(handshakes_count_addr());
|
||||||
|
}
|
||||||
|
log_info(biasedlocking, handshake)("JavaThread " INTPTR_FORMAT " handshaking JavaThread "
|
||||||
|
INTPTR_FORMAT " to revoke object " INTPTR_FORMAT, p2i(requester),
|
||||||
|
p2i(biaser), p2i(obj()));
|
||||||
|
|
||||||
|
RevokeOneBias revoke(obj, requester, biaser);
|
||||||
|
bool executed = Handshake::execute(&revoke, biaser);
|
||||||
|
if (revoke.status_code() == NOT_REVOKED) {
|
||||||
|
return NOT_REVOKED;
|
||||||
|
}
|
||||||
|
if (executed) {
|
||||||
|
log_info(biasedlocking, handshake)("Handshake revocation for object " INTPTR_FORMAT " succeeded. Bias was %srevoked",
|
||||||
|
p2i(obj()), (revoke.status_code() == BIAS_REVOKED ? "" : "already "));
|
||||||
|
if (event.should_commit() && revoke.status_code() == BIAS_REVOKED) {
|
||||||
|
post_revocation_event(&event, obj->klass(), &revoke);
|
||||||
|
}
|
||||||
|
assert(!obj->mark()->has_bias_pattern(), "invariant");
|
||||||
|
return revoke.status_code();
|
||||||
|
} else {
|
||||||
|
// Thread was not alive.
|
||||||
|
// Grab Threads_lock before manually trying to revoke bias. This avoids race with a newly
|
||||||
|
// created JavaThread (that happens to get the same memory address as biaser) synchronizing
|
||||||
|
// on this object.
|
||||||
|
{
|
||||||
|
MutexLocker ml(Threads_lock);
|
||||||
|
markOop mark = obj->mark();
|
||||||
|
// Check if somebody else was able to revoke it before biased thread exited.
|
||||||
|
if (!mark->has_bias_pattern()) {
|
||||||
|
return NOT_BIASED;
|
||||||
|
}
|
||||||
|
ThreadsListHandle tlh;
|
||||||
|
markOop prototype = obj->klass()->prototype_header();
|
||||||
|
if (!prototype->has_bias_pattern() || (!tlh.includes(biaser) && biaser == mark->biased_locker() &&
|
||||||
|
prototype->bias_epoch() == mark->bias_epoch())) {
|
||||||
|
obj->cas_set_mark(markOopDesc::prototype()->set_age(mark->age()), mark);
|
||||||
|
if (event.should_commit()) {
|
||||||
|
post_revocation_event(&event, obj->klass(), &revoke);
|
||||||
|
}
|
||||||
|
assert(!obj->mark()->has_bias_pattern(), "bias should be revoked by now");
|
||||||
|
return BIAS_REVOKED;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return NOT_REVOKED;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// Caller should have instantiated a ResourceMark object before calling this method
|
||||||
|
void BiasedLocking::walk_stack_and_revoke(oop obj, JavaThread* biased_locker) {
|
||||||
|
assert(!SafepointSynchronize::is_at_safepoint() || !ThreadLocalHandshakes,
|
||||||
|
"if ThreadLocalHandshakes is enabled this should always be executed outside safepoints");
|
||||||
|
assert(Thread::current() == biased_locker || Thread::current()->is_VM_thread(), "wrong thread");
|
||||||
|
|
||||||
|
markOop mark = obj->mark();
|
||||||
|
assert(mark->biased_locker() == biased_locker &&
|
||||||
|
obj->klass()->prototype_header()->bias_epoch() == mark->bias_epoch(), "invariant");
|
||||||
|
|
||||||
|
log_trace(biasedlocking)("%s(" INTPTR_FORMAT ") revoking object " INTPTR_FORMAT ", mark "
|
||||||
|
INTPTR_FORMAT ", type %s, prototype header " INTPTR_FORMAT
|
||||||
|
", biaser " INTPTR_FORMAT " %s",
|
||||||
|
Thread::current()->is_VM_thread() ? "VMThread" : "JavaThread",
|
||||||
|
p2i(Thread::current()),
|
||||||
|
p2i(obj),
|
||||||
|
p2i(mark),
|
||||||
|
obj->klass()->external_name(),
|
||||||
|
p2i(obj->klass()->prototype_header()),
|
||||||
|
p2i(biased_locker),
|
||||||
|
Thread::current()->is_VM_thread() ? "" : "(walking own stack)");
|
||||||
|
|
||||||
|
markOop unbiased_prototype = markOopDesc::prototype()->set_age(obj->mark()->age());
|
||||||
|
|
||||||
|
GrowableArray<MonitorInfo*>* cached_monitor_info = get_or_compute_monitor_info(biased_locker);
|
||||||
|
BasicLock* highest_lock = NULL;
|
||||||
|
for (int i = 0; i < cached_monitor_info->length(); i++) {
|
||||||
|
MonitorInfo* mon_info = cached_monitor_info->at(i);
|
||||||
|
if (oopDesc::equals(mon_info->owner(), obj)) {
|
||||||
|
log_trace(biasedlocking)(" mon_info->owner (" PTR_FORMAT ") == obj (" PTR_FORMAT ")",
|
||||||
|
p2i(mon_info->owner()),
|
||||||
|
p2i(obj));
|
||||||
|
// Assume recursive case and fix up highest lock below
|
||||||
|
markOop mark = markOopDesc::encode((BasicLock*) NULL);
|
||||||
|
highest_lock = mon_info->lock();
|
||||||
|
highest_lock->set_displaced_header(mark);
|
||||||
|
} else {
|
||||||
|
log_trace(biasedlocking)(" mon_info->owner (" PTR_FORMAT ") != obj (" PTR_FORMAT ")",
|
||||||
|
p2i(mon_info->owner()),
|
||||||
|
p2i(obj));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (highest_lock != NULL) {
|
||||||
|
// Fix up highest lock to contain displaced header and point
|
||||||
|
// object at it
|
||||||
|
highest_lock->set_displaced_header(unbiased_prototype);
|
||||||
|
// Reset object header to point to displaced mark.
|
||||||
|
// Must release store the lock address for platforms without TSO
|
||||||
|
// ordering (e.g. ppc).
|
||||||
|
obj->release_set_mark(markOopDesc::encode(highest_lock));
|
||||||
|
assert(!obj->mark()->has_bias_pattern(), "illegal mark state: stack lock used bias bit");
|
||||||
|
log_info(biasedlocking)(" Revoked bias of currently-locked object");
|
||||||
|
} else {
|
||||||
|
log_info(biasedlocking)(" Revoked bias of currently-unlocked object");
|
||||||
|
// Store the unlocked value into the object's header.
|
||||||
|
obj->set_mark(unbiased_prototype);
|
||||||
|
}
|
||||||
|
|
||||||
|
assert(!obj->mark()->has_bias_pattern(), "must not be biased");
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attempt_rebias, TRAPS) {
|
BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attempt_rebias, TRAPS) {
|
||||||
assert(!SafepointSynchronize::is_at_safepoint(), "must not be called while at safepoint");
|
assert(!SafepointSynchronize::is_at_safepoint(), "must not be called while at safepoint");
|
||||||
|
|
||||||
|
while (true) {
|
||||||
// We can revoke the biases of anonymously-biased objects
|
// We can revoke the biases of anonymously-biased objects
|
||||||
// efficiently enough that we should not cause these revocations to
|
// efficiently enough that we should not cause these revocations to
|
||||||
// update the heuristics because doing so may cause unwanted bulk
|
// update the heuristics because doing so may cause unwanted bulk
|
||||||
|
@ -652,6 +791,7 @@ BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attem
|
||||||
if (res_mark == biased_value) {
|
if (res_mark == biased_value) {
|
||||||
return BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
}
|
}
|
||||||
|
mark = res_mark; // Refresh mark with the latest value.
|
||||||
} else if (mark->has_bias_pattern()) {
|
} else if (mark->has_bias_pattern()) {
|
||||||
Klass* k = obj->klass();
|
Klass* k = obj->klass();
|
||||||
markOop prototype_header = k->prototype_header();
|
markOop prototype_header = k->prototype_header();
|
||||||
|
@ -662,8 +802,7 @@ BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attem
|
||||||
// CAS. If we fail this race, the object's bias has been revoked
|
// CAS. If we fail this race, the object's bias has been revoked
|
||||||
// by another thread so we simply return and let the caller deal
|
// by another thread so we simply return and let the caller deal
|
||||||
// with it.
|
// with it.
|
||||||
markOop biased_value = mark;
|
obj->cas_set_mark(prototype_header->set_age(mark->age()), mark);
|
||||||
markOop res_mark = obj->cas_set_mark(prototype_header, mark);
|
|
||||||
assert(!obj->mark()->has_bias_pattern(), "even if we raced, should still be revoked");
|
assert(!obj->mark()->has_bias_pattern(), "even if we raced, should still be revoked");
|
||||||
return BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
} else if (prototype_header->bias_epoch() != mark->bias_epoch()) {
|
} else if (prototype_header->bias_epoch() != mark->bias_epoch()) {
|
||||||
|
@ -674,67 +813,60 @@ BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attem
|
||||||
// heuristics. This is normally done in the assembly code but we
|
// heuristics. This is normally done in the assembly code but we
|
||||||
// can reach this point due to various points in the runtime
|
// can reach this point due to various points in the runtime
|
||||||
// needing to revoke biases.
|
// needing to revoke biases.
|
||||||
|
markOop res_mark;
|
||||||
if (attempt_rebias) {
|
if (attempt_rebias) {
|
||||||
assert(THREAD->is_Java_thread(), "");
|
assert(THREAD->is_Java_thread(), "");
|
||||||
markOop biased_value = mark;
|
markOop biased_value = mark;
|
||||||
markOop rebiased_prototype = markOopDesc::encode((JavaThread*) THREAD, mark->age(), prototype_header->bias_epoch());
|
markOop rebiased_prototype = markOopDesc::encode((JavaThread*) THREAD, mark->age(), prototype_header->bias_epoch());
|
||||||
markOop res_mark = obj->cas_set_mark(rebiased_prototype, mark);
|
res_mark = obj->cas_set_mark(rebiased_prototype, mark);
|
||||||
if (res_mark == biased_value) {
|
if (res_mark == biased_value) {
|
||||||
return BIAS_REVOKED_AND_REBIASED;
|
return BIAS_REVOKED_AND_REBIASED;
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
markOop biased_value = mark;
|
markOop biased_value = mark;
|
||||||
markOop unbiased_prototype = markOopDesc::prototype()->set_age(mark->age());
|
markOop unbiased_prototype = markOopDesc::prototype()->set_age(mark->age());
|
||||||
markOop res_mark = obj->cas_set_mark(unbiased_prototype, mark);
|
res_mark = obj->cas_set_mark(unbiased_prototype, mark);
|
||||||
if (res_mark == biased_value) {
|
if (res_mark == biased_value) {
|
||||||
return BIAS_REVOKED;
|
return BIAS_REVOKED;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
mark = res_mark; // Refresh mark with the latest value.
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
HeuristicsResult heuristics = update_heuristics(obj(), attempt_rebias);
|
HeuristicsResult heuristics = update_heuristics(obj());
|
||||||
if (heuristics == HR_NOT_BIASED) {
|
if (heuristics == HR_NOT_BIASED) {
|
||||||
return NOT_BIASED;
|
return NOT_BIASED;
|
||||||
} else if (heuristics == HR_SINGLE_REVOKE) {
|
} else if (heuristics == HR_SINGLE_REVOKE) {
|
||||||
Klass *k = obj->klass();
|
JavaThread *blt = mark->biased_locker();
|
||||||
markOop prototype_header = k->prototype_header();
|
assert(blt != NULL, "invariant");
|
||||||
if (mark->biased_locker() == THREAD &&
|
if (blt == THREAD) {
|
||||||
prototype_header->bias_epoch() == mark->bias_epoch()) {
|
|
||||||
// A thread is trying to revoke the bias of an object biased
|
// A thread is trying to revoke the bias of an object biased
|
||||||
// toward it, again likely due to an identity hash code
|
// toward it, again likely due to an identity hash code
|
||||||
// computation. We can again avoid a safepoint in this case
|
// computation. We can again avoid a safepoint/handshake in this case
|
||||||
// since we are only going to walk our own stack. There are no
|
// since we are only going to walk our own stack. There are no
|
||||||
// races with revocations occurring in other threads because we
|
// races with revocations occurring in other threads because we
|
||||||
// reach no safepoints in the revocation path.
|
// reach no safepoints in the revocation path.
|
||||||
// Also check the epoch because even if threads match, another thread
|
|
||||||
// can come in with a CAS to steal the bias of an object that has a
|
|
||||||
// stale epoch.
|
|
||||||
ResourceMark rm;
|
|
||||||
log_info(biasedlocking)("Revoking bias by walking my own stack:");
|
|
||||||
EventBiasedLockSelfRevocation event;
|
EventBiasedLockSelfRevocation event;
|
||||||
BiasedLocking::Condition cond = revoke_bias(obj(), false, false, (JavaThread*) THREAD, NULL);
|
ResourceMark rm;
|
||||||
((JavaThread*) THREAD)->set_cached_monitor_info(NULL);
|
walk_stack_and_revoke(obj(), blt);
|
||||||
assert(cond == BIAS_REVOKED, "why not?");
|
blt->set_cached_monitor_info(NULL);
|
||||||
|
assert(!obj->mark()->has_bias_pattern(), "invariant");
|
||||||
if (event.should_commit()) {
|
if (event.should_commit()) {
|
||||||
post_self_revocation_event(&event, k);
|
post_self_revocation_event(&event, obj->klass());
|
||||||
}
|
}
|
||||||
return cond;
|
return BIAS_REVOKED;
|
||||||
} else {
|
} else {
|
||||||
EventBiasedLockRevocation event;
|
BiasedLocking::Condition cond = single_revoke_with_handshake(obj, (JavaThread*)THREAD, blt);
|
||||||
VM_RevokeBias revoke(&obj, (JavaThread*) THREAD);
|
if (cond != NOT_REVOKED) {
|
||||||
VMThread::execute(&revoke);
|
return cond;
|
||||||
if (event.should_commit() && revoke.status_code() != NOT_BIASED) {
|
|
||||||
post_revocation_event(&event, k, &revoke);
|
|
||||||
}
|
|
||||||
return revoke.status_code();
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
} else {
|
||||||
assert((heuristics == HR_BULK_REVOKE) ||
|
assert((heuristics == HR_BULK_REVOKE) ||
|
||||||
(heuristics == HR_BULK_REBIAS), "?");
|
(heuristics == HR_BULK_REBIAS), "?");
|
||||||
EventBiasedLockClassRevocation event;
|
EventBiasedLockClassRevocation event;
|
||||||
VM_BulkRevokeBias bulk_revoke(&obj, (JavaThread*) THREAD,
|
VM_BulkRevokeBias bulk_revoke(&obj, (JavaThread*)THREAD,
|
||||||
(heuristics == HR_BULK_REBIAS),
|
(heuristics == HR_BULK_REBIAS),
|
||||||
attempt_rebias);
|
attempt_rebias);
|
||||||
VMThread::execute(&bulk_revoke);
|
VMThread::execute(&bulk_revoke);
|
||||||
|
@ -742,30 +874,42 @@ BiasedLocking::Condition BiasedLocking::revoke_and_rebias(Handle obj, bool attem
|
||||||
post_class_revocation_event(&event, obj->klass(), &bulk_revoke);
|
post_class_revocation_event(&event, obj->klass(), &bulk_revoke);
|
||||||
}
|
}
|
||||||
return bulk_revoke.status_code();
|
return bulk_revoke.status_code();
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// All objects in objs should be locked by biaser
|
||||||
void BiasedLocking::revoke(GrowableArray<Handle>* objs) {
|
void BiasedLocking::revoke(GrowableArray<Handle>* objs, JavaThread *biaser) {
|
||||||
assert(!SafepointSynchronize::is_at_safepoint(), "must not be called while at safepoint");
|
bool clean_my_cache = false;
|
||||||
if (objs->length() == 0) {
|
for (int i = 0; i < objs->length(); i++) {
|
||||||
return;
|
oop obj = (objs->at(i))();
|
||||||
|
markOop mark = obj->mark();
|
||||||
|
if (mark->has_bias_pattern()) {
|
||||||
|
walk_stack_and_revoke(obj, biaser);
|
||||||
|
clean_my_cache = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (clean_my_cache) {
|
||||||
|
clean_up_cached_monitor_info(biaser);
|
||||||
}
|
}
|
||||||
VM_RevokeBias revoke(objs, JavaThread::current());
|
|
||||||
VMThread::execute(&revoke);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
void BiasedLocking::revoke_at_safepoint(Handle h_obj) {
|
void BiasedLocking::revoke_at_safepoint(Handle h_obj) {
|
||||||
assert(SafepointSynchronize::is_at_safepoint(), "must only be called while at safepoint");
|
assert(SafepointSynchronize::is_at_safepoint(), "must only be called while at safepoint");
|
||||||
oop obj = h_obj();
|
oop obj = h_obj();
|
||||||
HeuristicsResult heuristics = update_heuristics(obj, false);
|
HeuristicsResult heuristics = update_heuristics(obj);
|
||||||
if (heuristics == HR_SINGLE_REVOKE) {
|
if (heuristics == HR_SINGLE_REVOKE) {
|
||||||
revoke_bias(obj, false, false, NULL, NULL);
|
JavaThread* biased_locker = NULL;
|
||||||
|
single_revoke_at_safepoint(obj, false, false, NULL, &biased_locker);
|
||||||
|
if (biased_locker) {
|
||||||
|
clean_up_cached_monitor_info(biased_locker);
|
||||||
|
}
|
||||||
} else if ((heuristics == HR_BULK_REBIAS) ||
|
} else if ((heuristics == HR_BULK_REBIAS) ||
|
||||||
(heuristics == HR_BULK_REVOKE)) {
|
(heuristics == HR_BULK_REVOKE)) {
|
||||||
bulk_revoke_or_rebias_at_safepoint(obj, (heuristics == HR_BULK_REBIAS), false, NULL);
|
bulk_revoke_or_rebias_at_safepoint(obj, (heuristics == HR_BULK_REBIAS), false, NULL);
|
||||||
}
|
|
||||||
clean_up_cached_monitor_info();
|
clean_up_cached_monitor_info();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@ -774,9 +918,9 @@ void BiasedLocking::revoke_at_safepoint(GrowableArray<Handle>* objs) {
|
||||||
int len = objs->length();
|
int len = objs->length();
|
||||||
for (int i = 0; i < len; i++) {
|
for (int i = 0; i < len; i++) {
|
||||||
oop obj = (objs->at(i))();
|
oop obj = (objs->at(i))();
|
||||||
HeuristicsResult heuristics = update_heuristics(obj, false);
|
HeuristicsResult heuristics = update_heuristics(obj);
|
||||||
if (heuristics == HR_SINGLE_REVOKE) {
|
if (heuristics == HR_SINGLE_REVOKE) {
|
||||||
revoke_bias(obj, false, false, NULL, NULL);
|
single_revoke_at_safepoint(obj, false, false, NULL, NULL);
|
||||||
} else if ((heuristics == HR_BULK_REBIAS) ||
|
} else if ((heuristics == HR_BULK_REBIAS) ||
|
||||||
(heuristics == HR_BULK_REVOKE)) {
|
(heuristics == HR_BULK_REVOKE)) {
|
||||||
bulk_revoke_or_rebias_at_safepoint(obj, (heuristics == HR_BULK_REBIAS), false, NULL);
|
bulk_revoke_or_rebias_at_safepoint(obj, (heuristics == HR_BULK_REBIAS), false, NULL);
|
||||||
|
@ -862,6 +1006,7 @@ int* BiasedLocking::biased_lock_entry_count_addr() { return _counter
|
||||||
int* BiasedLocking::anonymously_biased_lock_entry_count_addr() { return _counters.anonymously_biased_lock_entry_count_addr(); }
|
int* BiasedLocking::anonymously_biased_lock_entry_count_addr() { return _counters.anonymously_biased_lock_entry_count_addr(); }
|
||||||
int* BiasedLocking::rebiased_lock_entry_count_addr() { return _counters.rebiased_lock_entry_count_addr(); }
|
int* BiasedLocking::rebiased_lock_entry_count_addr() { return _counters.rebiased_lock_entry_count_addr(); }
|
||||||
int* BiasedLocking::revoked_lock_entry_count_addr() { return _counters.revoked_lock_entry_count_addr(); }
|
int* BiasedLocking::revoked_lock_entry_count_addr() { return _counters.revoked_lock_entry_count_addr(); }
|
||||||
|
int* BiasedLocking::handshakes_count_addr() { return _counters.handshakes_count_addr(); }
|
||||||
int* BiasedLocking::fast_path_entry_count_addr() { return _counters.fast_path_entry_count_addr(); }
|
int* BiasedLocking::fast_path_entry_count_addr() { return _counters.fast_path_entry_count_addr(); }
|
||||||
int* BiasedLocking::slow_path_entry_count_addr() { return _counters.slow_path_entry_count_addr(); }
|
int* BiasedLocking::slow_path_entry_count_addr() { return _counters.slow_path_entry_count_addr(); }
|
||||||
|
|
||||||
|
@ -885,6 +1030,7 @@ void BiasedLockingCounters::print_on(outputStream* st) const {
|
||||||
tty->print_cr("# anonymously biased lock entries: %d", _anonymously_biased_lock_entry_count);
|
tty->print_cr("# anonymously biased lock entries: %d", _anonymously_biased_lock_entry_count);
|
||||||
tty->print_cr("# rebiased lock entries: %d", _rebiased_lock_entry_count);
|
tty->print_cr("# rebiased lock entries: %d", _rebiased_lock_entry_count);
|
||||||
tty->print_cr("# revoked lock entries: %d", _revoked_lock_entry_count);
|
tty->print_cr("# revoked lock entries: %d", _revoked_lock_entry_count);
|
||||||
|
tty->print_cr("# handshakes entries: %d", _handshakes_count);
|
||||||
tty->print_cr("# fast path lock entries: %d", _fast_path_entry_count);
|
tty->print_cr("# fast path lock entries: %d", _fast_path_entry_count);
|
||||||
tty->print_cr("# slow path lock entries: %d", slow_path_entry_count());
|
tty->print_cr("# slow path lock entries: %d", slow_path_entry_count());
|
||||||
}
|
}
|
||||||
|
|
|
@ -76,17 +76,17 @@
|
||||||
// Revocation of the lock's bias is fairly straightforward. We want to
|
// Revocation of the lock's bias is fairly straightforward. We want to
|
||||||
// restore the object's header and stack-based BasicObjectLocks and
|
// restore the object's header and stack-based BasicObjectLocks and
|
||||||
// BasicLocks to the state they would have been in had the object been
|
// BasicLocks to the state they would have been in had the object been
|
||||||
// locked by HotSpot's usual fast locking scheme. To do this, we bring
|
// locked by HotSpot's usual fast locking scheme. To do this, we execute
|
||||||
// the system to a safepoint and walk the stack of the thread toward
|
// a handshake with the JavaThread that biased the lock. Inside the
|
||||||
// which the lock is biased. We find all of the lock records on the
|
// handshake we walk the biaser stack searching for all of the lock
|
||||||
// stack corresponding to this object, in particular the first /
|
// records corresponding to this object, in particular the first / "highest"
|
||||||
// "highest" record. We fill in the highest lock record with the
|
// record. We fill in the highest lock record with the object's displaced
|
||||||
// object's displaced header (which is a well-known value given that
|
// header (which is a well-known value given that we don't maintain an
|
||||||
// we don't maintain an identity hash nor age bits for the object
|
// identity hash nor age bits for the object while it's in the biased
|
||||||
// while it's in the biased state) and all other lock records with 0,
|
// state) and all other lock records with 0, the value for recursive locks.
|
||||||
// the value for recursive locks. When the safepoint is released, the
|
// Alternatively, we can revoke the bias of an object inside a safepoint
|
||||||
// formerly-biased thread and all other threads revert back to
|
// if we are already in one and we detect that we need to perform a
|
||||||
// HotSpot's CAS-based locking.
|
// revocation.
|
||||||
//
|
//
|
||||||
// This scheme can not handle transfers of biases of single objects
|
// This scheme can not handle transfers of biases of single objects
|
||||||
// from thread to thread efficiently, but it can handle bulk transfers
|
// from thread to thread efficiently, but it can handle bulk transfers
|
||||||
|
@ -115,6 +115,7 @@ class BiasedLockingCounters {
|
||||||
int _anonymously_biased_lock_entry_count;
|
int _anonymously_biased_lock_entry_count;
|
||||||
int _rebiased_lock_entry_count;
|
int _rebiased_lock_entry_count;
|
||||||
int _revoked_lock_entry_count;
|
int _revoked_lock_entry_count;
|
||||||
|
int _handshakes_count;
|
||||||
int _fast_path_entry_count;
|
int _fast_path_entry_count;
|
||||||
int _slow_path_entry_count;
|
int _slow_path_entry_count;
|
||||||
|
|
||||||
|
@ -125,6 +126,7 @@ class BiasedLockingCounters {
|
||||||
_anonymously_biased_lock_entry_count(0),
|
_anonymously_biased_lock_entry_count(0),
|
||||||
_rebiased_lock_entry_count(0),
|
_rebiased_lock_entry_count(0),
|
||||||
_revoked_lock_entry_count(0),
|
_revoked_lock_entry_count(0),
|
||||||
|
_handshakes_count(0),
|
||||||
_fast_path_entry_count(0),
|
_fast_path_entry_count(0),
|
||||||
_slow_path_entry_count(0) {}
|
_slow_path_entry_count(0) {}
|
||||||
|
|
||||||
|
@ -135,6 +137,7 @@ class BiasedLockingCounters {
|
||||||
int* anonymously_biased_lock_entry_count_addr() { return &_anonymously_biased_lock_entry_count; }
|
int* anonymously_biased_lock_entry_count_addr() { return &_anonymously_biased_lock_entry_count; }
|
||||||
int* rebiased_lock_entry_count_addr() { return &_rebiased_lock_entry_count; }
|
int* rebiased_lock_entry_count_addr() { return &_rebiased_lock_entry_count; }
|
||||||
int* revoked_lock_entry_count_addr() { return &_revoked_lock_entry_count; }
|
int* revoked_lock_entry_count_addr() { return &_revoked_lock_entry_count; }
|
||||||
|
int* handshakes_count_addr() { return &_handshakes_count; }
|
||||||
int* fast_path_entry_count_addr() { return &_fast_path_entry_count; }
|
int* fast_path_entry_count_addr() { return &_fast_path_entry_count; }
|
||||||
int* slow_path_entry_count_addr() { return &_slow_path_entry_count; }
|
int* slow_path_entry_count_addr() { return &_slow_path_entry_count; }
|
||||||
|
|
||||||
|
@ -146,6 +149,9 @@ class BiasedLockingCounters {
|
||||||
|
|
||||||
|
|
||||||
class BiasedLocking : AllStatic {
|
class BiasedLocking : AllStatic {
|
||||||
|
friend class VM_BulkRevokeBias;
|
||||||
|
friend class RevokeOneBias;
|
||||||
|
|
||||||
private:
|
private:
|
||||||
static BiasedLockingCounters _counters;
|
static BiasedLockingCounters _counters;
|
||||||
|
|
||||||
|
@ -155,15 +161,24 @@ public:
|
||||||
static int* anonymously_biased_lock_entry_count_addr();
|
static int* anonymously_biased_lock_entry_count_addr();
|
||||||
static int* rebiased_lock_entry_count_addr();
|
static int* rebiased_lock_entry_count_addr();
|
||||||
static int* revoked_lock_entry_count_addr();
|
static int* revoked_lock_entry_count_addr();
|
||||||
|
static int* handshakes_count_addr();
|
||||||
static int* fast_path_entry_count_addr();
|
static int* fast_path_entry_count_addr();
|
||||||
static int* slow_path_entry_count_addr();
|
static int* slow_path_entry_count_addr();
|
||||||
|
|
||||||
enum Condition {
|
enum Condition {
|
||||||
NOT_BIASED = 1,
|
NOT_BIASED = 1,
|
||||||
BIAS_REVOKED = 2,
|
BIAS_REVOKED = 2,
|
||||||
BIAS_REVOKED_AND_REBIASED = 3
|
BIAS_REVOKED_AND_REBIASED = 3,
|
||||||
|
NOT_REVOKED = 4
|
||||||
};
|
};
|
||||||
|
|
||||||
|
private:
|
||||||
|
static Condition single_revoke_at_safepoint(oop obj, bool allow_rebias, bool is_bulk, JavaThread* requester, JavaThread** biaser);
|
||||||
|
static Condition bulk_revoke_or_rebias_at_safepoint(oop o, bool bulk_rebias, bool attempt_rebias, JavaThread* requester);
|
||||||
|
static Condition single_revoke_with_handshake(Handle obj, JavaThread *requester, JavaThread *biaser);
|
||||||
|
static void walk_stack_and_revoke(oop obj, JavaThread* biased_locker);
|
||||||
|
|
||||||
|
public:
|
||||||
// This initialization routine should only be called once and
|
// This initialization routine should only be called once and
|
||||||
// schedules a PeriodicTask to turn on biased locking a few seconds
|
// schedules a PeriodicTask to turn on biased locking a few seconds
|
||||||
// into the VM run to avoid startup time regressions
|
// into the VM run to avoid startup time regressions
|
||||||
|
@ -178,7 +193,7 @@ public:
|
||||||
|
|
||||||
// These do not allow rebiasing; they are used by deoptimization to
|
// These do not allow rebiasing; they are used by deoptimization to
|
||||||
// ensure that monitors on the stack can be migrated
|
// ensure that monitors on the stack can be migrated
|
||||||
static void revoke(GrowableArray<Handle>* objs);
|
static void revoke(GrowableArray<Handle>* objs, JavaThread *biaser);
|
||||||
static void revoke_at_safepoint(Handle obj);
|
static void revoke_at_safepoint(Handle obj);
|
||||||
static void revoke_at_safepoint(GrowableArray<Handle>* objs);
|
static void revoke_at_safepoint(GrowableArray<Handle>* objs);
|
||||||
|
|
||||||
|
|
|
@ -1432,7 +1432,7 @@ void Deoptimization::revoke_biases_of_monitors(JavaThread* thread, frame fr, Reg
|
||||||
if (SafepointSynchronize::is_at_safepoint()) {
|
if (SafepointSynchronize::is_at_safepoint()) {
|
||||||
BiasedLocking::revoke_at_safepoint(objects_to_revoke);
|
BiasedLocking::revoke_at_safepoint(objects_to_revoke);
|
||||||
} else {
|
} else {
|
||||||
BiasedLocking::revoke(objects_to_revoke);
|
BiasedLocking::revoke(objects_to_revoke, thread);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -46,11 +46,12 @@ public:
|
||||||
class HandshakeThreadsOperation: public HandshakeOperation {
|
class HandshakeThreadsOperation: public HandshakeOperation {
|
||||||
static Semaphore _done;
|
static Semaphore _done;
|
||||||
ThreadClosure* _thread_cl;
|
ThreadClosure* _thread_cl;
|
||||||
|
bool _executed;
|
||||||
public:
|
public:
|
||||||
HandshakeThreadsOperation(ThreadClosure* cl) : _thread_cl(cl) {}
|
HandshakeThreadsOperation(ThreadClosure* cl) : _thread_cl(cl), _executed(false) {}
|
||||||
void do_handshake(JavaThread* thread);
|
void do_handshake(JavaThread* thread);
|
||||||
bool thread_has_completed() { return _done.trywait(); }
|
bool thread_has_completed() { return _done.trywait(); }
|
||||||
|
bool executed() const { return _executed; }
|
||||||
|
|
||||||
#ifdef ASSERT
|
#ifdef ASSERT
|
||||||
void check_state() {
|
void check_state() {
|
||||||
|
@ -109,24 +110,23 @@ void VM_Handshake::handle_timeout() {
|
||||||
|
|
||||||
class VM_HandshakeOneThread: public VM_Handshake {
|
class VM_HandshakeOneThread: public VM_Handshake {
|
||||||
JavaThread* _target;
|
JavaThread* _target;
|
||||||
bool _thread_alive;
|
|
||||||
public:
|
public:
|
||||||
VM_HandshakeOneThread(HandshakeThreadsOperation* op, JavaThread* target) :
|
VM_HandshakeOneThread(HandshakeThreadsOperation* op, JavaThread* target) :
|
||||||
VM_Handshake(op), _target(target), _thread_alive(false) {}
|
VM_Handshake(op), _target(target) {}
|
||||||
|
|
||||||
void doit() {
|
void doit() {
|
||||||
DEBUG_ONLY(_op->check_state();)
|
DEBUG_ONLY(_op->check_state();)
|
||||||
TraceTime timer("Performing single-target operation (vmoperation doit)", TRACETIME_LOG(Info, handshake));
|
TraceTime timer("Finished executing single-target operation (VM_HandshakeOneThread::doit)", TRACETIME_LOG(Info, handshake));
|
||||||
|
|
||||||
ThreadsListHandle tlh;
|
ThreadsListHandle tlh;
|
||||||
if (tlh.includes(_target)) {
|
if (tlh.includes(_target)) {
|
||||||
set_handshake(_target);
|
set_handshake(_target);
|
||||||
_thread_alive = true;
|
|
||||||
} else {
|
} else {
|
||||||
|
log_trace(handshake)("JavaThread " INTPTR_FORMAT " is not alive", p2i(_target));
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
log_trace(handshake)("Thread signaled, begin processing by VMThtread");
|
log_trace(handshake)("JavaThread " INTPTR_FORMAT " signaled, begin attempt to process by VMThtread", p2i(_target));
|
||||||
jlong start_time = os::elapsed_counter();
|
jlong start_time = os::elapsed_counter();
|
||||||
do {
|
do {
|
||||||
if (handshake_has_timed_out(start_time)) {
|
if (handshake_has_timed_out(start_time)) {
|
||||||
|
@ -146,7 +146,7 @@ class VM_HandshakeOneThread: public VM_Handshake {
|
||||||
|
|
||||||
VMOp_Type type() const { return VMOp_HandshakeOneThread; }
|
VMOp_Type type() const { return VMOp_HandshakeOneThread; }
|
||||||
|
|
||||||
bool thread_alive() const { return _thread_alive; }
|
bool executed() const { return _op->executed(); }
|
||||||
};
|
};
|
||||||
|
|
||||||
class VM_HandshakeAllThreads: public VM_Handshake {
|
class VM_HandshakeAllThreads: public VM_Handshake {
|
||||||
|
@ -155,7 +155,7 @@ class VM_HandshakeAllThreads: public VM_Handshake {
|
||||||
|
|
||||||
void doit() {
|
void doit() {
|
||||||
DEBUG_ONLY(_op->check_state();)
|
DEBUG_ONLY(_op->check_state();)
|
||||||
TraceTime timer("Performing operation (vmoperation doit)", TRACETIME_LOG(Info, handshake));
|
TraceTime timer("Finished executing multi-target operation (VM_HandshakeAllThreads::doit)", TRACETIME_LOG(Info, handshake));
|
||||||
|
|
||||||
JavaThreadIteratorWithHandle jtiwh;
|
JavaThreadIteratorWithHandle jtiwh;
|
||||||
int number_of_threads_issued = 0;
|
int number_of_threads_issued = 0;
|
||||||
|
@ -211,18 +211,19 @@ class VM_HandshakeFallbackOperation : public VM_Operation {
|
||||||
ThreadClosure* _thread_cl;
|
ThreadClosure* _thread_cl;
|
||||||
Thread* _target_thread;
|
Thread* _target_thread;
|
||||||
bool _all_threads;
|
bool _all_threads;
|
||||||
bool _thread_alive;
|
bool _executed;
|
||||||
public:
|
public:
|
||||||
VM_HandshakeFallbackOperation(ThreadClosure* cl) :
|
VM_HandshakeFallbackOperation(ThreadClosure* cl) :
|
||||||
_thread_cl(cl), _target_thread(NULL), _all_threads(true), _thread_alive(true) {}
|
_thread_cl(cl), _target_thread(NULL), _all_threads(true), _executed(false) {}
|
||||||
VM_HandshakeFallbackOperation(ThreadClosure* cl, Thread* target) :
|
VM_HandshakeFallbackOperation(ThreadClosure* cl, Thread* target) :
|
||||||
_thread_cl(cl), _target_thread(target), _all_threads(false), _thread_alive(false) {}
|
_thread_cl(cl), _target_thread(target), _all_threads(false), _executed(false) {}
|
||||||
|
|
||||||
void doit() {
|
void doit() {
|
||||||
|
log_trace(handshake)("VMThread executing VM_HandshakeFallbackOperation");
|
||||||
for (JavaThreadIteratorWithHandle jtiwh; JavaThread *t = jtiwh.next(); ) {
|
for (JavaThreadIteratorWithHandle jtiwh; JavaThread *t = jtiwh.next(); ) {
|
||||||
if (_all_threads || t == _target_thread) {
|
if (_all_threads || t == _target_thread) {
|
||||||
if (t == _target_thread) {
|
if (t == _target_thread) {
|
||||||
_thread_alive = true;
|
_executed = true;
|
||||||
}
|
}
|
||||||
_thread_cl->do_thread(t);
|
_thread_cl->do_thread(t);
|
||||||
}
|
}
|
||||||
|
@ -230,7 +231,7 @@ public:
|
||||||
}
|
}
|
||||||
|
|
||||||
VMOp_Type type() const { return VMOp_HandshakeFallback; }
|
VMOp_Type type() const { return VMOp_HandshakeFallback; }
|
||||||
bool thread_alive() const { return _thread_alive; }
|
bool executed() const { return _executed; }
|
||||||
};
|
};
|
||||||
|
|
||||||
void HandshakeThreadsOperation::do_handshake(JavaThread* thread) {
|
void HandshakeThreadsOperation::do_handshake(JavaThread* thread) {
|
||||||
|
@ -242,6 +243,7 @@ void HandshakeThreadsOperation::do_handshake(JavaThread* thread) {
|
||||||
// Only actually execute the operation for non terminated threads.
|
// Only actually execute the operation for non terminated threads.
|
||||||
if (!thread->is_terminated()) {
|
if (!thread->is_terminated()) {
|
||||||
_thread_cl->do_thread(thread);
|
_thread_cl->do_thread(thread);
|
||||||
|
_executed = true;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Use the semaphore to inform the VM thread that we have completed the operation
|
// Use the semaphore to inform the VM thread that we have completed the operation
|
||||||
|
@ -264,11 +266,11 @@ bool Handshake::execute(ThreadClosure* thread_cl, JavaThread* target) {
|
||||||
HandshakeThreadsOperation cto(thread_cl);
|
HandshakeThreadsOperation cto(thread_cl);
|
||||||
VM_HandshakeOneThread handshake(&cto, target);
|
VM_HandshakeOneThread handshake(&cto, target);
|
||||||
VMThread::execute(&handshake);
|
VMThread::execute(&handshake);
|
||||||
return handshake.thread_alive();
|
return handshake.executed();
|
||||||
} else {
|
} else {
|
||||||
VM_HandshakeFallbackOperation op(thread_cl, target);
|
VM_HandshakeFallbackOperation op(thread_cl, target);
|
||||||
VMThread::execute(&op);
|
VMThread::execute(&op);
|
||||||
return op.thread_alive();
|
return op.executed();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -369,6 +371,7 @@ void HandshakeState::process_by_vmthread(JavaThread* target) {
|
||||||
// getting caught by the semaphore.
|
// getting caught by the semaphore.
|
||||||
if (vmthread_can_process_handshake(target)) {
|
if (vmthread_can_process_handshake(target)) {
|
||||||
guarantee(!_semaphore.trywait(), "we should already own the semaphore");
|
guarantee(!_semaphore.trywait(), "we should already own the semaphore");
|
||||||
|
log_trace(handshake)("Processing handshake by VMThtread");
|
||||||
_operation->do_handshake(target);
|
_operation->do_handshake(target);
|
||||||
// Disarm after VM thread have executed the operation.
|
// Disarm after VM thread have executed the operation.
|
||||||
clear_handshake(target);
|
clear_handshake(target);
|
||||||
|
|
|
@ -77,7 +77,6 @@
|
||||||
template(HandshakeAllThreads) \
|
template(HandshakeAllThreads) \
|
||||||
template(HandshakeFallback) \
|
template(HandshakeFallback) \
|
||||||
template(EnableBiasedLocking) \
|
template(EnableBiasedLocking) \
|
||||||
template(RevokeBias) \
|
|
||||||
template(BulkRevokeBias) \
|
template(BulkRevokeBias) \
|
||||||
template(PopulateDumpSharedSpace) \
|
template(PopulateDumpSharedSpace) \
|
||||||
template(JNIFunctionTableCopier) \
|
template(JNIFunctionTableCopier) \
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright (c) 2014, 2018, Oracle and/or its affiliates. All rights reserved.
|
* Copyright (c) 2014, 2019, Oracle and/or its affiliates. All rights reserved.
|
||||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
*
|
*
|
||||||
* This code is free software; you can redistribute it and/or modify it
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
@ -59,7 +59,6 @@ public enum VMOps {
|
||||||
G1IncCollectionPause,
|
G1IncCollectionPause,
|
||||||
G1Concurrent,
|
G1Concurrent,
|
||||||
EnableBiasedLocking,
|
EnableBiasedLocking,
|
||||||
RevokeBias,
|
|
||||||
BulkRevokeBias,
|
BulkRevokeBias,
|
||||||
PopulateDumpSharedSpace,
|
PopulateDumpSharedSpace,
|
||||||
JNIFunctionTableCopier,
|
JNIFunctionTableCopier,
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
/*
|
/*
|
||||||
* Copyright (c) 2017, 2018, Oracle and/or its affiliates. All rights reserved.
|
* Copyright (c) 2017, 2019, Oracle and/or its affiliates. All rights reserved.
|
||||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||||
*
|
*
|
||||||
* This code is free software; you can redistribute it and/or modify it
|
* This code is free software; you can redistribute it and/or modify it
|
||||||
|
@ -264,7 +264,6 @@ public class TestBiasedLockRevocationEvents {
|
||||||
|
|
||||||
Recording recording = new Recording();
|
Recording recording = new Recording();
|
||||||
|
|
||||||
recording.enable(EventNames.BiasedLockRevocation);
|
|
||||||
recording.enable(EventNames.BiasedLockClassRevocation);
|
recording.enable(EventNames.BiasedLockClassRevocation);
|
||||||
recording.enable(EventNames.ExecuteVMOperation);
|
recording.enable(EventNames.ExecuteVMOperation);
|
||||||
recording.start();
|
recording.start();
|
||||||
|
@ -274,8 +273,7 @@ public class TestBiasedLockRevocationEvents {
|
||||||
recording.stop();
|
recording.stop();
|
||||||
List<RecordedEvent> events = Events.fromRecording(recording);
|
List<RecordedEvent> events = Events.fromRecording(recording);
|
||||||
|
|
||||||
// Determine which safepoints included single and bulk revocation VM operations
|
// Determine which safepoints included bulk revocation VM operations
|
||||||
Set<Long> vmOperationsSingle = new HashSet<>();
|
|
||||||
Set<Long> vmOperationsBulk = new HashSet<>();
|
Set<Long> vmOperationsBulk = new HashSet<>();
|
||||||
|
|
||||||
for (RecordedEvent event : events) {
|
for (RecordedEvent event : events) {
|
||||||
|
@ -283,27 +281,17 @@ public class TestBiasedLockRevocationEvents {
|
||||||
String operation = event.getValue("operation");
|
String operation = event.getValue("operation");
|
||||||
Long safepointId = event.getValue("safepointId");
|
Long safepointId = event.getValue("safepointId");
|
||||||
|
|
||||||
if (operation.equals("RevokeBias")) {
|
if (operation.equals("BulkRevokeBias")) {
|
||||||
vmOperationsSingle.add(safepointId);
|
|
||||||
} else if (operation.equals("BulkRevokeBias")) {
|
|
||||||
vmOperationsBulk.add(safepointId);
|
vmOperationsBulk.add(safepointId);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
int revokeCount = 0;
|
|
||||||
int bulkRevokeCount = 0;
|
int bulkRevokeCount = 0;
|
||||||
|
|
||||||
// Match all revoke events to a corresponding VMOperation event
|
// Match all revoke events to a corresponding VMOperation event
|
||||||
for (RecordedEvent event : events) {
|
for (RecordedEvent event : events) {
|
||||||
if (event.getEventType().getName().equals(EventNames.BiasedLockRevocation)) {
|
if (event.getEventType().getName().equals(EventNames.BiasedLockClassRevocation)) {
|
||||||
Long safepointId = event.getValue("safepointId");
|
|
||||||
String lockClass = ((RecordedClass)event.getValue("lockClass")).getName();
|
|
||||||
if (lockClass.equals(MyLock.class.getName())) {
|
|
||||||
Asserts.assertTrue(vmOperationsSingle.contains(safepointId));
|
|
||||||
revokeCount++;
|
|
||||||
}
|
|
||||||
} else if (event.getEventType().getName().equals(EventNames.BiasedLockClassRevocation)) {
|
|
||||||
Long safepointId = event.getValue("safepointId");
|
Long safepointId = event.getValue("safepointId");
|
||||||
String lockClass = ((RecordedClass)event.getValue("revokedClass")).getName();
|
String lockClass = ((RecordedClass)event.getValue("revokedClass")).getName();
|
||||||
if (lockClass.toString().equals(MyLock.class.getName())) {
|
if (lockClass.toString().equals(MyLock.class.getName())) {
|
||||||
|
@ -314,6 +302,5 @@ public class TestBiasedLockRevocationEvents {
|
||||||
}
|
}
|
||||||
|
|
||||||
Asserts.assertGT(bulkRevokeCount, 0);
|
Asserts.assertGT(bulkRevokeCount, 0);
|
||||||
Asserts.assertGT(revokeCount, bulkRevokeCount);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue