Mon, 19 Aug 2019 10:11:31 +0200
8229401: Fix JFR code cache test failures
8223689: Add JFR Thread Sampling Support
8223690: Add JFR BiasedLock Event Support
8223691: Add JFR G1 Region Type Change Event Support
8223692: Add JFR G1 Heap Summary Event Support
Summary: Backport JFR from JDK11, additional fixes
Reviewed-by: neugens, apetushkov
Contributed-by: denghui.ddh@alibaba-inc.com
1 /*
2 * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP
28 #include "gc_implementation/g1/g1BlockOffsetTable.hpp"
29 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
30 #include "gc_implementation/g1/heapRegion.inline.hpp"
31 #include "memory/space.hpp"
33 inline HeapWord* G1BlockOffsetTable::block_start(const void* addr) {
34 if (addr >= _bottom && addr < _end) {
35 return block_start_unsafe(addr);
36 } else {
37 return NULL;
38 }
39 }
41 inline HeapWord*
42 G1BlockOffsetTable::block_start_const(const void* addr) const {
43 if (addr >= _bottom && addr < _end) {
44 return block_start_unsafe_const(addr);
45 } else {
46 return NULL;
47 }
48 }
50 #define check_index(index, msg) \
51 assert((index) < (_reserved.word_size() >> LogN_words), \
52 err_msg("%s - index: "SIZE_FORMAT", _vs.committed_size: "SIZE_FORMAT, \
53 msg, (index), (_reserved.word_size() >> LogN_words))); \
54 assert(G1CollectedHeap::heap()->is_in_exact(address_for_index_raw(index)), \
55 err_msg("Index "SIZE_FORMAT" corresponding to "PTR_FORMAT \
56 " (%u) is not in committed area.", \
57 (index), \
58 p2i(address_for_index_raw(index)), \
59 G1CollectedHeap::heap()->addr_to_region(address_for_index_raw(index))));
61 u_char G1BlockOffsetSharedArray::offset_array(size_t index) const {
62 check_index(index, "index out of range");
63 return _offset_array[index];
64 }
66 inline void G1BlockOffsetSharedArray::set_offset_array_raw(size_t index, u_char offset) {
67 _offset_array[index] = offset;
68 }
70 void G1BlockOffsetSharedArray::set_offset_array(size_t index, u_char offset) {
71 check_index(index, "index out of range");
72 set_offset_array_raw(index, offset);
73 }
75 void G1BlockOffsetSharedArray::set_offset_array(size_t index, HeapWord* high, HeapWord* low) {
76 check_index(index, "index out of range");
77 assert(high >= low, "addresses out of order");
78 size_t offset = pointer_delta(high, low);
79 check_offset(offset, "offset too large");
80 set_offset_array(index, (u_char)offset);
81 }
83 void G1BlockOffsetSharedArray::set_offset_array(size_t left, size_t right, u_char offset) {
84 check_index(right, "right index out of range");
85 assert(left <= right, "indexes out of order");
86 size_t num_cards = right - left + 1;
87 if (UseMemSetInBOT) {
88 memset(const_cast<u_char*> (&_offset_array[left]), offset, num_cards);
89 } else {
90 size_t i = left;
91 const size_t end = i + num_cards;
92 for (; i < end; i++) {
93 _offset_array[i] = offset;
94 }
95 }
96 }
98 // Variant of index_for that does not check the index for validity.
99 inline size_t G1BlockOffsetSharedArray::index_for_raw(const void* p) const {
100 return pointer_delta((char*)p, _reserved.start(), sizeof(char)) >> LogN;
101 }
103 inline size_t G1BlockOffsetSharedArray::index_for(const void* p) const {
104 char* pc = (char*)p;
105 assert(pc >= (char*)_reserved.start() &&
106 pc < (char*)_reserved.end(),
107 err_msg("p (" PTR_FORMAT ") not in reserved [" PTR_FORMAT ", " PTR_FORMAT ")",
108 p2i(p), p2i(_reserved.start()), p2i(_reserved.end())));
109 size_t result = index_for_raw(p);
110 check_index(result, "bad index from address");
111 return result;
112 }
114 inline HeapWord*
115 G1BlockOffsetSharedArray::address_for_index(size_t index) const {
116 check_index(index, "index out of range");
117 HeapWord* result = address_for_index_raw(index);
118 assert(result >= _reserved.start() && result < _reserved.end(),
119 err_msg("bad address from index result " PTR_FORMAT
120 " _reserved.start() " PTR_FORMAT " _reserved.end() "
121 PTR_FORMAT,
122 p2i(result), p2i(_reserved.start()), p2i(_reserved.end())));
123 return result;
124 }
126 #undef check_index
128 inline size_t
129 G1BlockOffsetArray::block_size(const HeapWord* p) const {
130 return gsp()->block_size(p);
131 }
133 inline HeapWord*
134 G1BlockOffsetArray::block_at_or_preceding(const void* addr,
135 bool has_max_index,
136 size_t max_index) const {
137 assert(_array->offset_array(0) == 0, "objects can't cross covered areas");
138 size_t index = _array->index_for(addr);
139 // We must make sure that the offset table entry we use is valid. If
140 // "addr" is past the end, start at the last known one and go forward.
141 if (has_max_index) {
142 index = MIN2(index, max_index);
143 }
144 HeapWord* q = _array->address_for_index(index);
146 uint offset = _array->offset_array(index); // Extend u_char to uint.
147 while (offset >= N_words) {
148 // The excess of the offset from N_words indicates a power of Base
149 // to go back by.
150 size_t n_cards_back = BlockOffsetArray::entry_to_cards_back(offset);
151 q -= (N_words * n_cards_back);
152 assert(q >= gsp()->bottom(), "Went below bottom!");
153 index -= n_cards_back;
154 offset = _array->offset_array(index);
155 }
156 assert(offset < N_words, "offset too large");
157 q -= offset;
158 return q;
159 }
161 inline HeapWord*
162 G1BlockOffsetArray::
163 forward_to_block_containing_addr_const(HeapWord* q, HeapWord* n,
164 const void* addr) const {
165 if (addr >= gsp()->top()) return gsp()->top();
166 while (n <= addr) {
167 q = n;
168 oop obj = oop(q);
169 if (obj->klass_or_null() == NULL) return q;
170 n += block_size(q);
171 }
172 assert(q <= n, "wrong order for q and addr");
173 assert(addr < n, "wrong order for addr and n");
174 return q;
175 }
177 inline HeapWord*
178 G1BlockOffsetArray::forward_to_block_containing_addr(HeapWord* q,
179 const void* addr) {
180 if (oop(q)->klass_or_null() == NULL) return q;
181 HeapWord* n = q + block_size(q);
182 // In the normal case, where the query "addr" is a card boundary, and the
183 // offset table chunks are the same size as cards, the block starting at
184 // "q" will contain addr, so the test below will fail, and we'll fall
185 // through quickly.
186 if (n <= addr) {
187 q = forward_to_block_containing_addr_slow(q, n, addr);
188 }
189 assert(q <= addr, "wrong order for current and arg");
190 return q;
191 }
193 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP