Mercurial > hg > truffle
annotate src/share/vm/oops/cpCacheKlass.cpp @ 656:6bdd6923ba16
6541756: Reduce executable C-heap
Summary: Add executable parameters to reserve_memory and commit_memory to reduce executable memory to only the Code Heap.
Reviewed-by: xlu, kvn, acorn
author | coleenp |
---|---|
date | Wed, 25 Mar 2009 14:19:20 -0400 |
parents | 0fbdb4381b99 |
children | be93aad57795 |
rev | line source |
---|---|
0 | 1 /* |
579 | 2 * Copyright 1998-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 #include "incls/_precompiled.incl" | |
26 #include "incls/_cpCacheKlass.cpp.incl" | |
27 | |
28 | |
29 int constantPoolCacheKlass::oop_size(oop obj) const { | |
30 assert(obj->is_constantPoolCache(), "must be constantPool"); | |
31 return constantPoolCacheOop(obj)->object_size(); | |
32 } | |
33 | |
34 | |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
35 constantPoolCacheOop constantPoolCacheKlass::allocate(int length, |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
36 bool is_conc_safe, |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
37 TRAPS) { |
0 | 38 // allocate memory |
39 int size = constantPoolCacheOopDesc::object_size(length); | |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
40 |
0 | 41 KlassHandle klass (THREAD, as_klassOop()); |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
42 |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
43 // This is the original code. The code from permanent_obj_allocate() |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
44 // was in-lined to allow the setting of is_conc_safe before the klass |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
45 // is installed. |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
46 // constantPoolCacheOop cache = (constantPoolCacheOop) |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
47 // CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
48 |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
49 oop obj = CollectedHeap::permanent_obj_allocate_no_klass_install(klass, size, CHECK_NULL); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
50 constantPoolCacheOop cache = (constantPoolCacheOop) obj; |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
51 cache->set_is_conc_safe(is_conc_safe); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
52 // The store to is_conc_safe must be visible before the klass |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
53 // is set. This should be done safely because _is_conc_safe has |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
54 // been declared volatile. If there are any problems, consider adding |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
55 // OrderAccess::storestore(); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
56 CollectedHeap::post_allocation_install_obj_klass(klass, obj, size); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
57 NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value((HeapWord*) obj, |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
58 size)); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
59 |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
60 // The length field affects the size of the object. The allocation |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
61 // above allocates the correct size (see calculation of "size") but |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
62 // the size() method of the constant pool cache oop will not reflect |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
63 // that size until the correct length is set. |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
64 cache->set_length(length); |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
65 |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
66 // The store of the length must be visible before is_conc_safe is |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
67 // set to a safe state. |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
68 // This should be done safely because _is_conc_safe has |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
69 // been declared volatile. If there are any problems, consider adding |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
70 // OrderAccess::storestore(); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
71 cache->set_is_conc_safe(methodOopDesc::IsSafeConc); |
0 | 72 cache->set_constant_pool(NULL); |
73 return cache; | |
74 } | |
75 | |
76 klassOop constantPoolCacheKlass::create_klass(TRAPS) { | |
77 constantPoolCacheKlass o; | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
78 KlassHandle h_this_klass(THREAD, Universe::klassKlassObj()); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
79 KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
80 // Make sure size calculation is right |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
81 assert(k()->size() == align_object_size(header_size()), "wrong size for object"); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
82 java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror |
0 | 83 return k(); |
84 } | |
85 | |
86 | |
87 void constantPoolCacheKlass::oop_follow_contents(oop obj) { | |
88 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
89 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
90 // Performance tweak: We skip iterating over the klass pointer since we | |
91 // know that Universe::constantPoolCacheKlassObj never moves. | |
92 // gc of constant pool cache instance variables | |
93 MarkSweep::mark_and_push((oop*)cache->constant_pool_addr()); | |
94 // gc of constant pool cache entries | |
95 int i = cache->length(); | |
96 while (i-- > 0) cache->entry_at(i)->follow_contents(); | |
97 } | |
98 | |
99 #ifndef SERIALGC | |
100 void constantPoolCacheKlass::oop_follow_contents(ParCompactionManager* cm, | |
101 oop obj) { | |
102 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
103 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
104 // Performance tweak: We skip iterating over the klass pointer since we | |
105 // know that Universe::constantPoolCacheKlassObj never moves. | |
106 // gc of constant pool cache instance variables | |
107 PSParallelCompact::mark_and_push(cm, (oop*)cache->constant_pool_addr()); | |
108 // gc of constant pool cache entries | |
109 int i = cache->length(); | |
110 while (i-- > 0) cache->entry_at(i)->follow_contents(cm); | |
111 } | |
112 #endif // SERIALGC | |
113 | |
114 | |
115 int constantPoolCacheKlass::oop_oop_iterate(oop obj, OopClosure* blk) { | |
116 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
117 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
118 // Get size before changing pointers. | |
119 // Don't call size() or oop_size() since that is a virtual call. | |
120 int size = cache->object_size(); | |
121 // Performance tweak: We skip iterating over the klass pointer since we | |
122 // know that Universe::constantPoolCacheKlassObj never moves. | |
123 // iteration over constant pool cache instance variables | |
124 blk->do_oop((oop*)cache->constant_pool_addr()); | |
125 // iteration over constant pool cache entries | |
126 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate(blk); | |
127 return size; | |
128 } | |
129 | |
130 | |
131 int constantPoolCacheKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { | |
132 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
133 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
134 // Get size before changing pointers. | |
135 // Don't call size() or oop_size() since that is a virtual call. | |
136 int size = cache->object_size(); | |
137 // Performance tweak: We skip iterating over the klass pointer since we | |
138 // know that Universe::constantPoolCacheKlassObj never moves. | |
139 // iteration over constant pool cache instance variables | |
140 oop* addr = (oop*)cache->constant_pool_addr(); | |
141 if (mr.contains(addr)) blk->do_oop(addr); | |
142 // iteration over constant pool cache entries | |
143 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate_m(blk, mr); | |
144 return size; | |
145 } | |
146 | |
147 int constantPoolCacheKlass::oop_adjust_pointers(oop obj) { | |
148 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
149 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
150 // Get size before changing pointers. | |
151 // Don't call size() or oop_size() since that is a virtual call. | |
152 int size = cache->object_size(); | |
153 // Performance tweak: We skip iterating over the klass pointer since we | |
154 // know that Universe::constantPoolCacheKlassObj never moves. | |
155 // Iteration over constant pool cache instance variables | |
156 MarkSweep::adjust_pointer((oop*)cache->constant_pool_addr()); | |
157 // iteration over constant pool cache entries | |
158 for (int i = 0; i < cache->length(); i++) | |
159 cache->entry_at(i)->adjust_pointers(); | |
160 return size; | |
161 } | |
162 | |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
163 bool constantPoolCacheKlass::oop_is_conc_safe(oop obj) const { |
546
05c6d52fa7a9
6690928: Use spinning in combination with yields for workstealing termination.
jmasa
parents:
542
diff
changeset
|
164 assert(obj->is_constantPoolCache(), "should be constant pool"); |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
165 return constantPoolCacheOop(obj)->is_conc_safe(); |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
166 } |
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
196
diff
changeset
|
167 |
0 | 168 #ifndef SERIALGC |
169 void constantPoolCacheKlass::oop_copy_contents(PSPromotionManager* pm, | |
170 oop obj) { | |
171 assert(obj->is_constantPoolCache(), "should be constant pool"); | |
172 } | |
173 | |
174 void constantPoolCacheKlass::oop_push_contents(PSPromotionManager* pm, | |
175 oop obj) { | |
176 assert(obj->is_constantPoolCache(), "should be constant pool"); | |
177 } | |
178 | |
179 int | |
180 constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { | |
181 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
182 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
183 | |
184 // Iteration over constant pool cache instance variables | |
185 PSParallelCompact::adjust_pointer((oop*)cache->constant_pool_addr()); | |
186 | |
187 // iteration over constant pool cache entries | |
188 for (int i = 0; i < cache->length(); ++i) { | |
189 cache->entry_at(i)->update_pointers(); | |
190 } | |
191 | |
192 return cache->object_size(); | |
193 } | |
194 | |
195 int | |
196 constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, | |
197 HeapWord* beg_addr, | |
198 HeapWord* end_addr) { | |
199 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
200 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
201 | |
202 // Iteration over constant pool cache instance variables | |
203 oop* p; | |
204 p = (oop*)cache->constant_pool_addr(); | |
205 PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); | |
206 | |
207 // Iteration over constant pool cache entries | |
208 for (int i = 0; i < cache->length(); ++i) { | |
209 cache->entry_at(i)->update_pointers(beg_addr, end_addr); | |
210 } | |
211 return cache->object_size(); | |
212 } | |
213 #endif // SERIALGC | |
214 | |
215 #ifndef PRODUCT | |
216 | |
217 void constantPoolCacheKlass::oop_print_on(oop obj, outputStream* st) { | |
218 assert(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
219 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
220 // super print | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
221 Klass::oop_print_on(obj, st); |
0 | 222 // print constant pool cache entries |
223 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->print(st, i); | |
224 } | |
225 | |
226 #endif | |
227 | |
228 void constantPoolCacheKlass::oop_verify_on(oop obj, outputStream* st) { | |
229 guarantee(obj->is_constantPoolCache(), "obj must be constant pool cache"); | |
230 constantPoolCacheOop cache = (constantPoolCacheOop)obj; | |
231 // super verify | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
232 Klass::oop_verify_on(obj, st); |
0 | 233 // print constant pool cache entries |
234 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->verify(st); | |
235 } | |
236 | |
237 | |
238 const char* constantPoolCacheKlass::internal_name() const { | |
239 return "{constant pool cache}"; | |
240 } |