1.1 --- a/src/share/vm/runtime/mutex.cpp Wed Feb 01 10:36:58 2012 +0100
1.2 +++ b/src/share/vm/runtime/mutex.cpp Wed Feb 01 07:59:01 2012 -0800
1.3 @@ -1,6 +1,6 @@
1.4
1.5 /*
1.6 - * Copyright (c) 1998, 2010, Oracle and/or its affiliates. All rights reserved.
1.7 + * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved.
1.8 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.9 *
1.10 * This code is free software; you can redistribute it and/or modify it
1.11 @@ -1296,10 +1296,6 @@
1.12
1.13 assert(this->rank() >= 0, "bad lock rank");
1.14
1.15 - if (LogMultipleMutexLocking && locks != NULL) {
1.16 - Events::log("thread " INTPTR_FORMAT " locks %s, already owns %s", new_owner, name(), locks->name());
1.17 - }
1.18 -
1.19 // Deadlock avoidance rules require us to acquire Mutexes only in
1.20 // a global total order. For example m1 is the lowest ranked mutex
1.21 // that the thread holds and m2 is the mutex the thread is trying
1.22 @@ -1343,10 +1339,6 @@
1.23 #ifdef ASSERT
1.24 Monitor *locks = old_owner->owned_locks();
1.25
1.26 - if (LogMultipleMutexLocking && locks != this) {
1.27 - Events::log("thread " INTPTR_FORMAT " unlocks %s, still owns %s", old_owner, this->name(), locks->name());
1.28 - }
1.29 -
1.30 // remove "this" from the owned locks list
1.31
1.32 Monitor *prev = NULL;
