1 /*
2 * Copyright (c) 2022, Red Hat, Inc. All rights reserved.
3 * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
4 * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
5 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 *
7 * This code is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License version 2 only, as
9 * published by the Free Software Foundation.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 *
25 */
26
27 #include "precompiled.hpp"
28 #include "memory/allocation.hpp"
29 #include "oops/markWord.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "runtime/globals.hpp"
32 #include "runtime/javaThread.inline.hpp"
33 #include "runtime/lockStack.inline.hpp"
34 #include "runtime/objectMonitor.inline.hpp"
35 #include "runtime/safepoint.hpp"
36 #include "runtime/stackWatermark.hpp"
37 #include "runtime/stackWatermarkSet.inline.hpp"
38 #include "runtime/synchronizer.inline.hpp"
39 #include "runtime/thread.hpp"
40 #include "utilities/copy.hpp"
41 #include "utilities/debug.hpp"
42 #include "utilities/globalDefinitions.hpp"
43 #include "utilities/growableArray.hpp"
44 #include "utilities/ostream.hpp"
45 #include "utilities/sizes.hpp"
46
47 #include <type_traits>
48
49 const int LockStack::lock_stack_offset = in_bytes(JavaThread::lock_stack_offset());
50 const int LockStack::lock_stack_top_offset = in_bytes(JavaThread::lock_stack_top_offset());
51 const int LockStack::lock_stack_base_offset = in_bytes(JavaThread::lock_stack_base_offset());
52
53 LockStack::LockStack(JavaThread* jt) :
54 _top(lock_stack_base_offset), _base() {
55 // Make sure the layout of the object is compatible with the emitted code's assumptions.
56 STATIC_ASSERT(sizeof(_bad_oop_sentinel) == oopSize);
57 STATIC_ASSERT(sizeof(_base[0]) == oopSize);
58 STATIC_ASSERT(std::is_standard_layout<LockStack>::value);
59 STATIC_ASSERT(offsetof(LockStack, _bad_oop_sentinel) == offsetof(LockStack, _base) - oopSize);
60 #ifdef ASSERT
61 for (int i = 0; i < CAPACITY; i++) {
62 _base[i] = nullptr;
63 }
64 #endif
65 }
66
67 uint32_t LockStack::start_offset() {
68 int offset = lock_stack_base_offset;
69 assert(offset > 0, "must be positive offset");
70 return static_cast<uint32_t>(offset);
71 }
72
73 uint32_t LockStack::end_offset() {
74 int offset = lock_stack_base_offset + CAPACITY * oopSize;
75 assert(offset > 0, "must be positive offset");
76 return static_cast<uint32_t>(offset);
77 }
78
79 #ifndef PRODUCT
80 void LockStack::verify(const char* msg) const {
81 assert(LockingMode == LM_LIGHTWEIGHT, "never use lock-stack when light weight locking is disabled");
82 assert((_top <= end_offset()), "lockstack overflow: _top %d end_offset %d", _top, end_offset());
83 assert((_top >= start_offset()), "lockstack underflow: _top %d start_offset %d", _top, start_offset());
84 if (SafepointSynchronize::is_at_safepoint() || (Thread::current()->is_Java_thread() && is_owning_thread())) {
85 int top = to_index(_top);
86 for (int i = 0; i < top; i++) {
87 assert(_base[i] != nullptr, "no zapped before top");
88 if (VM_Version::supports_recursive_lightweight_locking()) {
89 oop o = _base[i];
90 for (; i < top - 1; i++) {
91 // Consecutive entries may be the same
92 if (_base[i + 1] != o) {
93 break;
94 }
95 }
96 }
97
98 for (int j = i + 1; j < top; j++) {
99 assert(_base[i] != _base[j], "entries must be unique: %s", msg);
100 }
101 }
102 for (int i = top; i < CAPACITY; i++) {
103 assert(_base[i] == nullptr, "only zapped entries after top: i: %d, top: %d, entry: " PTR_FORMAT, i, top, p2i(_base[i]));
104 }
105 }
106 }
107 #endif
108
109 void LockStack::print_on(outputStream* st) {
110 for (int i = to_index(_top); (--i) >= 0;) {
111 st->print("LockStack[%d]: ", i);
112 oop o = _base[i];
113 if (oopDesc::is_oop(o)) {
114 o->print_on(st);
115 } else {
116 st->print_cr("not an oop: " PTR_FORMAT, p2i(o));
117 }
118 }
119 }
120
121 OMCache::OMCache(JavaThread* jt) : _entries() {
122 STATIC_ASSERT(std::is_standard_layout<OMCache>::value);
123 STATIC_ASSERT(std::is_standard_layout<OMCache::OMCacheEntry>::value);
124 STATIC_ASSERT(offsetof(OMCache, _null_sentinel) == offsetof(OMCache, _entries) +
125 offsetof(OMCache::OMCacheEntry, _oop) +
126 OMCache::CAPACITY * in_bytes(oop_to_oop_difference()));
127 }