Mercurial > hg > graal-compiler
annotate src/share/vm/oops/oop.inline.hpp @ 878:abe076e3636f
6864003: Modify JVM_FindClassFromBootLoader to return null if class not found
Summary: JVM_FindClassFromBootLoader returns null if class not found
Reviewed-by: acorn, alanb, dholmes
author | mchung |
---|---|
date | Mon, 27 Jul 2009 09:06:22 -0700 |
parents | e5b0439ef4ae |
children | df6caf649ff7 |
rev | line source |
---|---|
0 | 1 /* |
579 | 2 * Copyright 1997-2009 Sun Microsystems, Inc. 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 * | |
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 // Implementation of all inlined member functions defined in oop.hpp | |
26 // We need a separate file to avoid circular references | |
27 | |
28 inline void oopDesc::release_set_mark(markOop m) { | |
29 OrderAccess::release_store_ptr(&_mark, m); | |
30 } | |
31 | |
32 inline markOop oopDesc::cas_set_mark(markOop new_mark, markOop old_mark) { | |
33 return (markOop) Atomic::cmpxchg_ptr(new_mark, &_mark, old_mark); | |
34 } | |
35 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
36 inline klassOop oopDesc::klass() const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
37 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
38 return (klassOop)decode_heap_oop_not_null(_metadata._compressed_klass); |
167
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
39 } else { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
40 return _metadata._klass; |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
41 } |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
42 } |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
43 |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
44 inline klassOop oopDesc::klass_or_null() const volatile { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
45 // can be NULL in CMS |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
46 if (UseCompressedOops) { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
47 return (klassOop)decode_heap_oop(_metadata._compressed_klass); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
48 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
49 return _metadata._klass; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
50 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
51 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
52 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
53 inline int oopDesc::klass_gap_offset_in_bytes() { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
54 assert(UseCompressedOops, "only applicable to compressed headers"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
55 return oopDesc::klass_offset_in_bytes() + sizeof(narrowOop); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
56 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
57 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
58 inline oop* oopDesc::klass_addr() { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
59 // Only used internally and with CMS and will not work with |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
60 // UseCompressedOops |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
61 assert(!UseCompressedOops, "only supported with uncompressed oops"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
62 return (oop*) &_metadata._klass; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
63 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
64 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
65 inline narrowOop* oopDesc::compressed_klass_addr() { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
66 assert(UseCompressedOops, "only called by compressed oops"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
67 return (narrowOop*) &_metadata._compressed_klass; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
68 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
69 |
0 | 70 inline void oopDesc::set_klass(klassOop k) { |
71 // since klasses are promoted no store check is needed | |
72 assert(Universe::is_bootstrapping() || k != NULL, "must be a real klassOop"); | |
73 assert(Universe::is_bootstrapping() || k->is_klass(), "not a klassOop"); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
74 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
75 oop_store_without_check(compressed_klass_addr(), (oop)k); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
76 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
77 oop_store_without_check(klass_addr(), (oop) k); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
78 } |
0 | 79 } |
80 | |
167
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
81 inline int oopDesc::klass_gap() const { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
82 return *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()); |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
83 } |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
84 |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
85 inline void oopDesc::set_klass_gap(int v) { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
86 if (UseCompressedOops) { |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
87 *(int*)(((intptr_t)this) + klass_gap_offset_in_bytes()) = v; |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
88 } |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
89 } |
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
90 |
0 | 91 inline void oopDesc::set_klass_to_list_ptr(oop k) { |
92 // This is only to be used during GC, for from-space objects, so no | |
93 // barrier is needed. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
94 if (UseCompressedOops) { |
454
df4305d4c1a1
6774607: SIGSEGV or (!is_null(v),"oop value can never be zero") assertion when running with CMS and COOPs
ysr
parents:
356
diff
changeset
|
95 _metadata._compressed_klass = encode_heap_oop(k); // may be null (parnew overflow handling) |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
96 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
97 _metadata._klass = (klassOop)k; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
98 } |
0 | 99 } |
100 | |
101 inline void oopDesc::init_mark() { set_mark(markOopDesc::prototype_for_object(this)); } | |
102 inline Klass* oopDesc::blueprint() const { return klass()->klass_part(); } | |
103 | |
104 inline bool oopDesc::is_a(klassOop k) const { return blueprint()->is_subtype_of(k); } | |
105 | |
106 inline bool oopDesc::is_instance() const { return blueprint()->oop_is_instance(); } | |
107 inline bool oopDesc::is_instanceRef() const { return blueprint()->oop_is_instanceRef(); } | |
108 inline bool oopDesc::is_array() const { return blueprint()->oop_is_array(); } | |
109 inline bool oopDesc::is_objArray() const { return blueprint()->oop_is_objArray(); } | |
110 inline bool oopDesc::is_typeArray() const { return blueprint()->oop_is_typeArray(); } | |
111 inline bool oopDesc::is_javaArray() const { return blueprint()->oop_is_javaArray(); } | |
112 inline bool oopDesc::is_symbol() const { return blueprint()->oop_is_symbol(); } | |
113 inline bool oopDesc::is_klass() const { return blueprint()->oop_is_klass(); } | |
114 inline bool oopDesc::is_thread() const { return blueprint()->oop_is_thread(); } | |
115 inline bool oopDesc::is_method() const { return blueprint()->oop_is_method(); } | |
116 inline bool oopDesc::is_constMethod() const { return blueprint()->oop_is_constMethod(); } | |
117 inline bool oopDesc::is_methodData() const { return blueprint()->oop_is_methodData(); } | |
118 inline bool oopDesc::is_constantPool() const { return blueprint()->oop_is_constantPool(); } | |
119 inline bool oopDesc::is_constantPoolCache() const { return blueprint()->oop_is_constantPoolCache(); } | |
120 inline bool oopDesc::is_compiledICHolder() const { return blueprint()->oop_is_compiledICHolder(); } | |
121 | |
122 inline void* oopDesc::field_base(int offset) const { return (void*)&((char*)this)[offset]; } | |
123 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
124 template <class T> inline T* oopDesc::obj_field_addr(int offset) const { return (T*)field_base(offset); } |
0 | 125 inline jbyte* oopDesc::byte_field_addr(int offset) const { return (jbyte*) field_base(offset); } |
126 inline jchar* oopDesc::char_field_addr(int offset) const { return (jchar*) field_base(offset); } | |
127 inline jboolean* oopDesc::bool_field_addr(int offset) const { return (jboolean*)field_base(offset); } | |
128 inline jint* oopDesc::int_field_addr(int offset) const { return (jint*) field_base(offset); } | |
129 inline jshort* oopDesc::short_field_addr(int offset) const { return (jshort*) field_base(offset); } | |
130 inline jlong* oopDesc::long_field_addr(int offset) const { return (jlong*) field_base(offset); } | |
131 inline jfloat* oopDesc::float_field_addr(int offset) const { return (jfloat*) field_base(offset); } | |
132 inline jdouble* oopDesc::double_field_addr(int offset) const { return (jdouble*) field_base(offset); } | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
133 inline address* oopDesc::address_field_addr(int offset) const { return (address*) field_base(offset); } |
0 | 134 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
135 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
136 // Functions for getting and setting oops within instance objects. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
137 // If the oops are compressed, the type passed to these overloaded functions |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
138 // is narrowOop. All functions are overloaded so they can be called by |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
139 // template functions without conditionals (the compiler instantiates via |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
140 // the right type and inlines the appopriate code). |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
141 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
142 inline bool oopDesc::is_null(oop obj) { return obj == NULL; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
143 inline bool oopDesc::is_null(narrowOop obj) { return obj == 0; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
144 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
145 // Algorithm for encoding and decoding oops from 64 bit pointers to 32 bit |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
146 // offset from the heap base. Saving the check for null can save instructions |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
147 // in inner GC loops so these are separated. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
148 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
149 inline narrowOop oopDesc::encode_heap_oop_not_null(oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
150 assert(!is_null(v), "oop value can never be zero"); |
642
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
151 address base = Universe::narrow_oop_base(); |
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
152 int shift = Universe::narrow_oop_shift(); |
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
153 uint64_t pd = (uint64_t)(pointer_delta((void*)v, (void*)base, 1)); |
135
b7268662a986
6689523: max heap calculation for compressed oops is off by MaxPermSize
coleenp
parents:
133
diff
changeset
|
154 assert(OopEncodingHeapMax > pd, "change encoding max if new encoding"); |
642
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
155 uint64_t result = pd >> shift; |
135
b7268662a986
6689523: max heap calculation for compressed oops is off by MaxPermSize
coleenp
parents:
133
diff
changeset
|
156 assert((result & CONST64(0xffffffff00000000)) == 0, "narrow oop overflow"); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
157 return (narrowOop)result; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
158 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
159 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
160 inline narrowOop oopDesc::encode_heap_oop(oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
161 return (is_null(v)) ? (narrowOop)0 : encode_heap_oop_not_null(v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
162 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
163 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
164 inline oop oopDesc::decode_heap_oop_not_null(narrowOop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
165 assert(!is_null(v), "narrow oop value can never be zero"); |
642
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
166 address base = Universe::narrow_oop_base(); |
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
167 int shift = Universe::narrow_oop_shift(); |
660978a2a31a
6791178: Specialize for zero as the compressed oop vm heap base
kvn
parents:
518
diff
changeset
|
168 return (oop)(void*)((uintptr_t)base + ((uintptr_t)v << shift)); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
169 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
170 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
171 inline oop oopDesc::decode_heap_oop(narrowOop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
172 return is_null(v) ? (oop)NULL : decode_heap_oop_not_null(v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
173 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
174 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
175 inline oop oopDesc::decode_heap_oop_not_null(oop v) { return v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
176 inline oop oopDesc::decode_heap_oop(oop v) { return v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
177 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
178 // Load an oop out of the Java heap as is without decoding. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
179 // Called by GC to check for null before decoding. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
180 inline oop oopDesc::load_heap_oop(oop* p) { return *p; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
181 inline narrowOop oopDesc::load_heap_oop(narrowOop* p) { return *p; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
182 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
183 // Load and decode an oop out of the Java heap into a wide oop. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
184 inline oop oopDesc::load_decode_heap_oop_not_null(oop* p) { return *p; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
185 inline oop oopDesc::load_decode_heap_oop_not_null(narrowOop* p) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
186 return decode_heap_oop_not_null(*p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
187 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
188 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
189 // Load and decode an oop out of the heap accepting null |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
190 inline oop oopDesc::load_decode_heap_oop(oop* p) { return *p; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
191 inline oop oopDesc::load_decode_heap_oop(narrowOop* p) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
192 return decode_heap_oop(*p); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
193 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
194 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
195 // Store already encoded heap oop into the heap. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
196 inline void oopDesc::store_heap_oop(oop* p, oop v) { *p = v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
197 inline void oopDesc::store_heap_oop(narrowOop* p, narrowOop v) { *p = v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
198 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
199 // Encode and store a heap oop. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
200 inline void oopDesc::encode_store_heap_oop_not_null(narrowOop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
201 *p = encode_heap_oop_not_null(v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
202 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
203 inline void oopDesc::encode_store_heap_oop_not_null(oop* p, oop v) { *p = v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
204 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
205 // Encode and store a heap oop allowing for null. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
206 inline void oopDesc::encode_store_heap_oop(narrowOop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
207 *p = encode_heap_oop(v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
208 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
209 inline void oopDesc::encode_store_heap_oop(oop* p, oop v) { *p = v; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
210 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
211 // Store heap oop as is for volatile fields. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
212 inline void oopDesc::release_store_heap_oop(volatile oop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
213 OrderAccess::release_store_ptr(p, v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
214 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
215 inline void oopDesc::release_store_heap_oop(volatile narrowOop* p, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
216 narrowOop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
217 OrderAccess::release_store(p, v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
218 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
219 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
220 inline void oopDesc::release_encode_store_heap_oop_not_null( |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
221 volatile narrowOop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
222 // heap oop is not pointer sized. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
223 OrderAccess::release_store(p, encode_heap_oop_not_null(v)); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
224 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
225 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
226 inline void oopDesc::release_encode_store_heap_oop_not_null( |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
227 volatile oop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
228 OrderAccess::release_store_ptr(p, v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
229 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
230 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
231 inline void oopDesc::release_encode_store_heap_oop(volatile oop* p, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
232 oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
233 OrderAccess::release_store_ptr(p, v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
234 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
235 inline void oopDesc::release_encode_store_heap_oop( |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
236 volatile narrowOop* p, oop v) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
237 OrderAccess::release_store(p, encode_heap_oop(v)); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
238 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
239 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
240 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
241 // These functions are only used to exchange oop fields in instances, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
242 // not headers. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
243 inline oop oopDesc::atomic_exchange_oop(oop exchange_value, volatile HeapWord *dest) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
244 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
245 // encode exchange value from oop to T |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
246 narrowOop val = encode_heap_oop(exchange_value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
247 narrowOop old = (narrowOop)Atomic::xchg(val, (narrowOop*)dest); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
248 // decode old from T to oop |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
249 return decode_heap_oop(old); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
250 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
251 return (oop)Atomic::xchg_ptr(exchange_value, (oop*)dest); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
252 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
253 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
254 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
255 inline oop oopDesc::atomic_compare_exchange_oop(oop exchange_value, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
256 volatile HeapWord *dest, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
257 oop compare_value) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
258 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
259 // encode exchange and compare value from oop to T |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
260 narrowOop val = encode_heap_oop(exchange_value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
261 narrowOop cmp = encode_heap_oop(compare_value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
262 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
263 narrowOop old = (narrowOop) Atomic::cmpxchg(val, (narrowOop*)dest, cmp); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
264 // decode old from T to oop |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
265 return decode_heap_oop(old); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
266 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
267 return (oop)Atomic::cmpxchg_ptr(exchange_value, (oop*)dest, compare_value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
268 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
269 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
270 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
271 // In order to put or get a field out of an instance, must first check |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
272 // if the field has been compressed and uncompress it. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
273 inline oop oopDesc::obj_field(int offset) const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
274 return UseCompressedOops ? |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
275 load_decode_heap_oop(obj_field_addr<narrowOop>(offset)) : |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
276 load_decode_heap_oop(obj_field_addr<oop>(offset)); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
277 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
278 inline void oopDesc::obj_field_put(int offset, oop value) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
279 UseCompressedOops ? oop_store(obj_field_addr<narrowOop>(offset), value) : |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
280 oop_store(obj_field_addr<oop>(offset), value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
281 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
282 inline void oopDesc::obj_field_raw_put(int offset, oop value) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
283 UseCompressedOops ? |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
284 encode_store_heap_oop(obj_field_addr<narrowOop>(offset), value) : |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
285 encode_store_heap_oop(obj_field_addr<oop>(offset), value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
286 } |
0 | 287 |
288 inline jbyte oopDesc::byte_field(int offset) const { return (jbyte) *byte_field_addr(offset); } | |
289 inline void oopDesc::byte_field_put(int offset, jbyte contents) { *byte_field_addr(offset) = (jint) contents; } | |
290 | |
291 inline jboolean oopDesc::bool_field(int offset) const { return (jboolean) *bool_field_addr(offset); } | |
292 inline void oopDesc::bool_field_put(int offset, jboolean contents) { *bool_field_addr(offset) = (jint) contents; } | |
293 | |
294 inline jchar oopDesc::char_field(int offset) const { return (jchar) *char_field_addr(offset); } | |
295 inline void oopDesc::char_field_put(int offset, jchar contents) { *char_field_addr(offset) = (jint) contents; } | |
296 | |
297 inline jint oopDesc::int_field(int offset) const { return *int_field_addr(offset); } | |
298 inline void oopDesc::int_field_put(int offset, jint contents) { *int_field_addr(offset) = contents; } | |
299 | |
300 inline jshort oopDesc::short_field(int offset) const { return (jshort) *short_field_addr(offset); } | |
301 inline void oopDesc::short_field_put(int offset, jshort contents) { *short_field_addr(offset) = (jint) contents;} | |
302 | |
303 inline jlong oopDesc::long_field(int offset) const { return *long_field_addr(offset); } | |
304 inline void oopDesc::long_field_put(int offset, jlong contents) { *long_field_addr(offset) = contents; } | |
305 | |
306 inline jfloat oopDesc::float_field(int offset) const { return *float_field_addr(offset); } | |
307 inline void oopDesc::float_field_put(int offset, jfloat contents) { *float_field_addr(offset) = contents; } | |
308 | |
309 inline jdouble oopDesc::double_field(int offset) const { return *double_field_addr(offset); } | |
310 inline void oopDesc::double_field_put(int offset, jdouble contents) { *double_field_addr(offset) = contents; } | |
311 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
312 inline address oopDesc::address_field(int offset) const { return *address_field_addr(offset); } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
313 inline void oopDesc::address_field_put(int offset, address contents) { *address_field_addr(offset) = contents; } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
314 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
315 inline oop oopDesc::obj_field_acquire(int offset) const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
316 return UseCompressedOops ? |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
317 decode_heap_oop((narrowOop) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
318 OrderAccess::load_acquire(obj_field_addr<narrowOop>(offset))) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
319 : decode_heap_oop((oop) |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
320 OrderAccess::load_ptr_acquire(obj_field_addr<oop>(offset))); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
321 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
322 inline void oopDesc::release_obj_field_put(int offset, oop value) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
323 UseCompressedOops ? |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
324 oop_store((volatile narrowOop*)obj_field_addr<narrowOop>(offset), value) : |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
325 oop_store((volatile oop*) obj_field_addr<oop>(offset), value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
326 } |
0 | 327 |
328 inline jbyte oopDesc::byte_field_acquire(int offset) const { return OrderAccess::load_acquire(byte_field_addr(offset)); } | |
329 inline void oopDesc::release_byte_field_put(int offset, jbyte contents) { OrderAccess::release_store(byte_field_addr(offset), contents); } | |
330 | |
331 inline jboolean oopDesc::bool_field_acquire(int offset) const { return OrderAccess::load_acquire(bool_field_addr(offset)); } | |
332 inline void oopDesc::release_bool_field_put(int offset, jboolean contents) { OrderAccess::release_store(bool_field_addr(offset), contents); } | |
333 | |
334 inline jchar oopDesc::char_field_acquire(int offset) const { return OrderAccess::load_acquire(char_field_addr(offset)); } | |
335 inline void oopDesc::release_char_field_put(int offset, jchar contents) { OrderAccess::release_store(char_field_addr(offset), contents); } | |
336 | |
337 inline jint oopDesc::int_field_acquire(int offset) const { return OrderAccess::load_acquire(int_field_addr(offset)); } | |
338 inline void oopDesc::release_int_field_put(int offset, jint contents) { OrderAccess::release_store(int_field_addr(offset), contents); } | |
339 | |
340 inline jshort oopDesc::short_field_acquire(int offset) const { return (jshort)OrderAccess::load_acquire(short_field_addr(offset)); } | |
341 inline void oopDesc::release_short_field_put(int offset, jshort contents) { OrderAccess::release_store(short_field_addr(offset), contents); } | |
342 | |
343 inline jlong oopDesc::long_field_acquire(int offset) const { return OrderAccess::load_acquire(long_field_addr(offset)); } | |
344 inline void oopDesc::release_long_field_put(int offset, jlong contents) { OrderAccess::release_store(long_field_addr(offset), contents); } | |
345 | |
346 inline jfloat oopDesc::float_field_acquire(int offset) const { return OrderAccess::load_acquire(float_field_addr(offset)); } | |
347 inline void oopDesc::release_float_field_put(int offset, jfloat contents) { OrderAccess::release_store(float_field_addr(offset), contents); } | |
348 | |
349 inline jdouble oopDesc::double_field_acquire(int offset) const { return OrderAccess::load_acquire(double_field_addr(offset)); } | |
350 inline void oopDesc::release_double_field_put(int offset, jdouble contents) { OrderAccess::release_store(double_field_addr(offset), contents); } | |
351 | |
710 | 352 inline address oopDesc::address_field_acquire(int offset) const { return (address) OrderAccess::load_ptr_acquire(address_field_addr(offset)); } |
353 inline void oopDesc::release_address_field_put(int offset, address contents) { OrderAccess::release_store_ptr(address_field_addr(offset), contents); } | |
354 | |
0 | 355 inline int oopDesc::size_given_klass(Klass* klass) { |
356 int lh = klass->layout_helper(); | |
357 int s = lh >> LogHeapWordSize; // deliver size scaled by wordSize | |
358 | |
359 // lh is now a value computed at class initialization that may hint | |
360 // at the size. For instances, this is positive and equal to the | |
361 // size. For arrays, this is negative and provides log2 of the | |
362 // array element size. For other oops, it is zero and thus requires | |
363 // a virtual call. | |
364 // | |
365 // We go to all this trouble because the size computation is at the | |
366 // heart of phase 2 of mark-compaction, and called for every object, | |
367 // alive or dead. So the speed here is equal in importance to the | |
368 // speed of allocation. | |
369 | |
370 if (lh <= Klass::_lh_neutral_value) { | |
371 // The most common case is instances; fall through if so. | |
372 if (lh < Klass::_lh_neutral_value) { | |
373 // Second most common case is arrays. We have to fetch the | |
374 // length of the array, shift (multiply) it appropriately, | |
375 // up to wordSize, add the header, and align to object size. | |
376 size_t size_in_bytes; | |
377 #ifdef _M_IA64 | |
378 // The Windows Itanium Aug 2002 SDK hoists this load above | |
379 // the check for s < 0. An oop at the end of the heap will | |
380 // cause an access violation if this load is performed on a non | |
381 // array oop. Making the reference volatile prohibits this. | |
382 // (%%% please explain by what magic the length is actually fetched!) | |
383 volatile int *array_length; | |
384 array_length = (volatile int *)( (intptr_t)this + | |
385 arrayOopDesc::length_offset_in_bytes() ); | |
386 assert(array_length > 0, "Integer arithmetic problem somewhere"); | |
387 // Put into size_t to avoid overflow. | |
388 size_in_bytes = (size_t) array_length; | |
389 size_in_bytes = size_in_bytes << Klass::layout_helper_log2_element_size(lh); | |
390 #else | |
391 size_t array_length = (size_t) ((arrayOop)this)->length(); | |
392 size_in_bytes = array_length << Klass::layout_helper_log2_element_size(lh); | |
393 #endif | |
394 size_in_bytes += Klass::layout_helper_header_size(lh); | |
395 | |
396 // This code could be simplified, but by keeping array_header_in_bytes | |
397 // in units of bytes and doing it this way we can round up just once, | |
398 // skipping the intermediate round to HeapWordSize. Cast the result | |
399 // of round_to to size_t to guarantee unsigned division == right shift. | |
400 s = (int)((size_t)round_to(size_in_bytes, MinObjAlignmentInBytes) / | |
401 HeapWordSize); | |
402 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
403 // UseParNewGC, UseParallelGC and UseG1GC can change the length field |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
404 // of an "old copy" of an object array in the young gen so it indicates |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
405 // the grey portion of an already copied array. This will cause the first |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
406 // disjunct below to fail if the two comparands are computed across such |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
407 // a concurrent change. |
0 | 408 // UseParNewGC also runs with promotion labs (which look like int |
409 // filler arrays) which are subject to changing their declared size | |
410 // when finally retiring a PLAB; this also can cause the first disjunct | |
411 // to fail for another worker thread that is concurrently walking the block | |
412 // offset table. Both these invariant failures are benign for their | |
413 // current uses; we relax the assertion checking to cover these two cases below: | |
414 // is_objArray() && is_forwarded() // covers first scenario above | |
415 // || is_typeArray() // covers second scenario above | |
416 // If and when UseParallelGC uses the same obj array oop stealing/chunking | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
417 // technique, we will need to suitably modify the assertion. |
0 | 418 assert((s == klass->oop_size(this)) || |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
419 (Universe::heap()->is_gc_active() && |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
420 ((is_typeArray() && UseParNewGC) || |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
421 (is_objArray() && is_forwarded() && (UseParNewGC || UseParallelGC || UseG1GC)))), |
0 | 422 "wrong array object size"); |
423 } else { | |
424 // Must be zero, so bite the bullet and take the virtual call. | |
425 s = klass->oop_size(this); | |
426 } | |
427 } | |
428 | |
429 assert(s % MinObjAlignment == 0, "alignment check"); | |
430 assert(s > 0, "Bad size calculated"); | |
431 return s; | |
432 } | |
433 | |
434 | |
435 inline int oopDesc::size() { | |
436 return size_given_klass(blueprint()); | |
437 } | |
438 | |
439 inline bool oopDesc::is_parsable() { | |
440 return blueprint()->oop_is_parsable(this); | |
441 } | |
442 | |
518
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
454
diff
changeset
|
443 inline bool oopDesc::is_conc_safe() { |
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
454
diff
changeset
|
444 return blueprint()->oop_is_conc_safe(this); |
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
454
diff
changeset
|
445 } |
0af8b0718fc9
6692899: CMS: many vm.parallel_class_loading tests fail with assert "missing Printezis mark"
jmasa
parents:
454
diff
changeset
|
446 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
447 inline void update_barrier_set(void* p, oop v) { |
0 | 448 assert(oopDesc::bs() != NULL, "Uninitialized bs in oop!"); |
449 oopDesc::bs()->write_ref_field(p, v); | |
450 } | |
451 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
452 inline void update_barrier_set_pre(void* p, oop v) { |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
453 oopDesc::bs()->write_ref_field_pre(p, v); |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
454 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
455 |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
456 template <class T> inline void oop_store(T* p, oop v) { |
0 | 457 if (always_do_update_barrier) { |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
458 oop_store((volatile T*)p, v); |
0 | 459 } else { |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
460 update_barrier_set_pre(p, v); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
461 oopDesc::encode_store_heap_oop(p, v); |
0 | 462 update_barrier_set(p, v); |
463 } | |
464 } | |
465 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
466 template <class T> inline void oop_store(volatile T* p, oop v) { |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
467 update_barrier_set_pre((void*)p, v); |
0 | 468 // Used by release_obj_field_put, so use release_store_ptr. |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
469 oopDesc::release_encode_store_heap_oop(p, v); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
470 update_barrier_set((void*)p, v); |
0 | 471 } |
472 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
473 template <class T> inline void oop_store_without_check(T* p, oop v) { |
0 | 474 // XXX YSR FIX ME!!! |
475 if (always_do_update_barrier) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
476 oop_store(p, v); |
0 | 477 } else { |
478 assert(!Universe::heap()->barrier_set()->write_ref_needs_barrier(p, v), | |
479 "oop store without store check failed"); | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
480 oopDesc::encode_store_heap_oop(p, v); |
0 | 481 } |
482 } | |
483 | |
484 // When it absolutely has to get there. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
485 template <class T> inline void oop_store_without_check(volatile T* p, oop v) { |
0 | 486 // XXX YSR FIX ME!!! |
487 if (always_do_update_barrier) { | |
488 oop_store(p, v); | |
489 } else { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
490 assert(!Universe::heap()->barrier_set()->write_ref_needs_barrier((T*)p, v), |
0 | 491 "oop store without store check failed"); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
492 oopDesc::release_encode_store_heap_oop(p, v); |
0 | 493 } |
494 } | |
495 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
496 // Should replace *addr = oop assignments where addr type depends on UseCompressedOops |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
497 // (without having to remember the function name this calls). |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
498 inline void oop_store_raw(HeapWord* addr, oop value) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
499 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
500 oopDesc::encode_store_heap_oop((narrowOop*)addr, value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
501 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
502 oopDesc::encode_store_heap_oop((oop*)addr, value); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
503 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
504 } |
0 | 505 |
506 // Used only for markSweep, scavenging | |
507 inline bool oopDesc::is_gc_marked() const { | |
508 return mark()->is_marked(); | |
509 } | |
510 | |
511 inline bool oopDesc::is_locked() const { | |
512 return mark()->is_locked(); | |
513 } | |
514 | |
515 inline bool oopDesc::is_unlocked() const { | |
516 return mark()->is_unlocked(); | |
517 } | |
518 | |
519 inline bool oopDesc::has_bias_pattern() const { | |
520 return mark()->has_bias_pattern(); | |
521 } | |
522 | |
523 inline bool check_obj_alignment(oop obj) { | |
524 return (intptr_t)obj % MinObjAlignmentInBytes == 0; | |
525 } | |
526 | |
527 | |
528 // used only for asserts | |
529 inline bool oopDesc::is_oop(bool ignore_mark_word) const { | |
530 oop obj = (oop) this; | |
531 if (!check_obj_alignment(obj)) return false; | |
532 if (!Universe::heap()->is_in_reserved(obj)) return false; | |
533 // obj is aligned and accessible in heap | |
534 // try to find metaclass cycle safely without seg faulting on bad input | |
535 // we should reach klassKlassObj by following klass link at most 3 times | |
536 for (int i = 0; i < 3; i++) { | |
167
feeb96a45707
6696264: assert("narrow oop can never be zero") for GCBasher & ParNewGC
coleenp
parents:
135
diff
changeset
|
537 obj = obj->klass_or_null(); |
0 | 538 // klass should be aligned and in permspace |
539 if (!check_obj_alignment(obj)) return false; | |
540 if (!Universe::heap()->is_in_permanent(obj)) return false; | |
541 } | |
542 if (obj != Universe::klassKlassObj()) { | |
543 // During a dump, the _klassKlassObj moved to a shared space. | |
544 if (DumpSharedSpaces && Universe::klassKlassObj()->is_shared()) { | |
545 return true; | |
546 } | |
547 return false; | |
548 } | |
549 | |
550 // Header verification: the mark is typically non-NULL. If we're | |
551 // at a safepoint, it must not be null. | |
552 // Outside of a safepoint, the header could be changing (for example, | |
553 // another thread could be inflating a lock on this object). | |
554 if (ignore_mark_word) { | |
555 return true; | |
556 } | |
557 if (mark() != NULL) { | |
558 return true; | |
559 } | |
560 return !SafepointSynchronize::is_at_safepoint(); | |
561 } | |
562 | |
563 | |
564 // used only for asserts | |
565 inline bool oopDesc::is_oop_or_null(bool ignore_mark_word) const { | |
566 return this == NULL ? true : is_oop(ignore_mark_word); | |
567 } | |
568 | |
569 #ifndef PRODUCT | |
570 // used only for asserts | |
571 inline bool oopDesc::is_unlocked_oop() const { | |
572 if (!Universe::heap()->is_in_reserved(this)) return false; | |
573 return mark()->is_unlocked(); | |
574 } | |
575 #endif // PRODUCT | |
576 | |
577 inline void oopDesc::follow_header() { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
578 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
579 MarkSweep::mark_and_push(compressed_klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
580 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
581 MarkSweep::mark_and_push(klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
582 } |
0 | 583 } |
584 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
585 inline void oopDesc::follow_contents(void) { |
0 | 586 assert (is_gc_marked(), "should be marked"); |
587 blueprint()->oop_follow_contents(this); | |
588 } | |
589 | |
590 | |
591 // Used by scavengers | |
592 | |
593 inline bool oopDesc::is_forwarded() const { | |
594 // The extra heap check is needed since the obj might be locked, in which case the | |
595 // mark would point to a stack location and have the sentinel bit cleared | |
596 return mark()->is_marked(); | |
597 } | |
598 | |
599 // Used by scavengers | |
600 inline void oopDesc::forward_to(oop p) { | |
601 assert(Universe::heap()->is_in_reserved(p), | |
602 "forwarding to something not in heap"); | |
603 markOop m = markOopDesc::encode_pointer_as_mark(p); | |
604 assert(m->decode_pointer() == p, "encoding must be reversable"); | |
605 set_mark(m); | |
606 } | |
607 | |
608 // Used by parallel scavengers | |
609 inline bool oopDesc::cas_forward_to(oop p, markOop compare) { | |
610 assert(Universe::heap()->is_in_reserved(p), | |
611 "forwarding to something not in heap"); | |
612 markOop m = markOopDesc::encode_pointer_as_mark(p); | |
613 assert(m->decode_pointer() == p, "encoding must be reversable"); | |
614 return cas_set_mark(m, compare) == compare; | |
615 } | |
616 | |
617 // Note that the forwardee is not the same thing as the displaced_mark. | |
618 // The forwardee is used when copying during scavenge and mark-sweep. | |
619 // It does need to clear the low two locking- and GC-related bits. | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
620 inline oop oopDesc::forwardee() const { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
621 return (oop) mark()->decode_pointer(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
622 } |
0 | 623 |
624 inline bool oopDesc::has_displaced_mark() const { | |
625 return mark()->has_displaced_mark_helper(); | |
626 } | |
627 | |
628 inline markOop oopDesc::displaced_mark() const { | |
629 return mark()->displaced_mark_helper(); | |
630 } | |
631 | |
632 inline void oopDesc::set_displaced_mark(markOop m) { | |
633 mark()->set_displaced_mark_helper(m); | |
634 } | |
635 | |
636 // The following method needs to be MT safe. | |
637 inline int oopDesc::age() const { | |
638 assert(!is_forwarded(), "Attempt to read age from forwarded mark"); | |
639 if (has_displaced_mark()) { | |
640 return displaced_mark()->age(); | |
641 } else { | |
642 return mark()->age(); | |
643 } | |
644 } | |
645 | |
646 inline void oopDesc::incr_age() { | |
647 assert(!is_forwarded(), "Attempt to increment age of forwarded mark"); | |
648 if (has_displaced_mark()) { | |
649 set_displaced_mark(displaced_mark()->incr_age()); | |
650 } else { | |
651 set_mark(mark()->incr_age()); | |
652 } | |
653 } | |
654 | |
655 | |
656 inline intptr_t oopDesc::identity_hash() { | |
657 // Fast case; if the object is unlocked and the hash value is set, no locking is needed | |
658 // Note: The mark must be read into local variable to avoid concurrent updates. | |
659 markOop mrk = mark(); | |
660 if (mrk->is_unlocked() && !mrk->has_no_hash()) { | |
661 return mrk->hash(); | |
662 } else if (mrk->is_marked()) { | |
663 return mrk->hash(); | |
664 } else { | |
665 return slow_identity_hash(); | |
666 } | |
667 } | |
668 | |
669 inline void oopDesc::oop_iterate_header(OopClosure* blk) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
670 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
671 blk->do_oop(compressed_klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
672 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
673 blk->do_oop(klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
674 } |
0 | 675 } |
676 | |
677 inline void oopDesc::oop_iterate_header(OopClosure* blk, MemRegion mr) { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
678 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
679 if (mr.contains(compressed_klass_addr())) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
680 blk->do_oop(compressed_klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
681 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
682 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
683 if (mr.contains(klass_addr())) blk->do_oop(klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
684 } |
0 | 685 } |
686 | |
687 inline int oopDesc::adjust_pointers() { | |
688 debug_only(int check_size = size()); | |
689 int s = blueprint()->oop_adjust_pointers(this); | |
690 assert(s == check_size, "should be the same"); | |
691 return s; | |
692 } | |
693 | |
694 inline void oopDesc::adjust_header() { | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
695 if (UseCompressedOops) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
696 MarkSweep::adjust_pointer(compressed_klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
697 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
698 MarkSweep::adjust_pointer(klass_addr()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
699 } |
0 | 700 } |
701 | |
702 #define OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ | |
703 \ | |
704 inline int oopDesc::oop_iterate(OopClosureType* blk) { \ | |
705 SpecializationStats::record_call(); \ | |
706 return blueprint()->oop_oop_iterate##nv_suffix(this, blk); \ | |
707 } \ | |
708 \ | |
709 inline int oopDesc::oop_iterate(OopClosureType* blk, MemRegion mr) { \ | |
710 SpecializationStats::record_call(); \ | |
711 return blueprint()->oop_oop_iterate##nv_suffix##_m(this, blk, mr); \ | |
712 } | |
713 | |
714 ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_DEFN) | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
715 ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_DEFN) |
0 | 716 |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
717 #ifndef SERIALGC |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
718 #define OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
719 \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
720 inline int oopDesc::oop_iterate_backwards(OopClosureType* blk) { \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
721 SpecializationStats::record_call(); \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
722 return blueprint()->oop_oop_iterate_backwards##nv_suffix(this, blk); \ |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
723 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
724 |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
725 ALL_OOP_OOP_ITERATE_CLOSURES_1(OOP_ITERATE_BACKWARDS_DEFN) |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
726 ALL_OOP_OOP_ITERATE_CLOSURES_2(OOP_ITERATE_BACKWARDS_DEFN) |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
135
diff
changeset
|
727 #endif // !SERIALGC |
0 | 728 |
729 inline bool oopDesc::is_shared() const { | |
730 return CompactingPermGenGen::is_shared(this); | |
731 } | |
732 | |
733 inline bool oopDesc::is_shared_readonly() const { | |
734 return CompactingPermGenGen::is_shared_readonly(this); | |
735 } | |
736 | |
737 inline bool oopDesc::is_shared_readwrite() const { | |
738 return CompactingPermGenGen::is_shared_readwrite(this); | |
739 } |