1 /*
2 * Copyright (c) 1998, 2019, 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 */
24
25 #include "precompiled.hpp"
26 #include "code/codeBlob.hpp"
27 #include "code/codeCache.hpp"
28 #include "code/nmethod.hpp"
29 #include "code/scopeDesc.hpp"
30 #include "compiler/oopMap.hpp"
31 #include "gc/shared/collectedHeap.hpp"
32 #include "memory/allocation.inline.hpp"
33 #include "memory/iterator.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "memory/universe.hpp"
36 #include "oops/compressedOops.hpp"
37 #include "runtime/frame.inline.hpp"
38 #include "runtime/handles.inline.hpp"
39 #include "runtime/signature.hpp"
40 #include "utilities/align.hpp"
41 #include "utilities/lockFreeStack.hpp"
42 #ifdef COMPILER1
43 #include "c1/c1_Defs.hpp"
44 #endif
45 #ifdef COMPILER2
46 #include "opto/optoreg.hpp"
47 #endif
48
49 // OopMapStream
50
51 OopMapStream::OopMapStream(OopMap* oop_map, int oop_types_mask) {
52 _stream = new CompressedReadStream(oop_map->write_stream()->buffer());
53 _mask = oop_types_mask;
54 _size = oop_map->omv_count();
55 _position = 0;
56 _valid_omv = false;
57 }
58
59 OopMapStream::OopMapStream(const ImmutableOopMap* oop_map, int oop_types_mask) {
60 _stream = new CompressedReadStream(oop_map->data_addr());
61 _mask = oop_types_mask;
62 _size = oop_map->count();
63 _position = 0;
64 _valid_omv = false;
65 }
66
67 void OopMapStream::find_next() {
68 while(_position++ < _size) {
69 _omv.read_from(_stream);
70 if(((int)_omv.type() & _mask) > 0) {
71 _valid_omv = true;
72 return;
73 }
74 }
75 _valid_omv = false;
76 }
77
78
79 // OopMap
80
81 // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
82 // slots to hold 4-byte values like ints and floats in the LP64 build.
83 OopMap::OopMap(int frame_size, int arg_count) {
84 // OopMaps are usually quite so small, so pick a small initial size
85 set_write_stream(new CompressedWriteStream(32));
86 set_omv_count(0);
87
88 #ifdef ASSERT
89 _locs_length = VMRegImpl::stack2reg(0)->value() + frame_size + arg_count;
90 _locs_used = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
91 for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
92 #endif
93 }
94
95
96 OopMap::OopMap(OopMap::DeepCopyToken, OopMap* source) {
97 // This constructor does a deep copy
98 // of the source OopMap.
99 set_write_stream(new CompressedWriteStream(source->omv_count() * 2));
100 set_omv_count(0);
101 set_offset(source->offset());
102
103 #ifdef ASSERT
104 _locs_length = source->_locs_length;
105 _locs_used = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
106 for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
107 #endif
108
109 // We need to copy the entries too.
110 for (OopMapStream oms(source); !oms.is_done(); oms.next()) {
111 OopMapValue omv = oms.current();
112 omv.write_on(write_stream());
113 increment_count();
114 }
115 }
116
117
118 OopMap* OopMap::deep_copy() {
119 return new OopMap(_deep_copy_token, this);
120 }
121
122 void OopMap::copy_data_to(address addr) const {
123 memcpy(addr, write_stream()->buffer(), write_stream()->position());
124 }
125
126 int OopMap::heap_size() const {
127 int size = sizeof(OopMap);
128 int align = sizeof(void *) - 1;
129 size += write_stream()->position();
130 // Align to a reasonable ending point
131 size = ((size+align) & ~align);
132 return size;
133 }
134
135 // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
136 // slots to hold 4-byte values like ints and floats in the LP64 build.
137 void OopMap::set_xxx(VMReg reg, OopMapValue::oop_types x, VMReg optional) {
138
139 assert(reg->value() < _locs_length, "too big reg value for stack size");
140 assert( _locs_used[reg->value()] == OopMapValue::unused_value, "cannot insert twice" );
141 debug_only( _locs_used[reg->value()] = x; )
142
143 OopMapValue o(reg, x);
144
145 if(x == OopMapValue::callee_saved_value) {
146 // This can never be a stack location, so we don't need to transform it.
147 assert(optional->is_reg(), "Trying to callee save a stack location");
148 o.set_content_reg(optional);
149 } else if(x == OopMapValue::derived_oop_value) {
150 o.set_content_reg(optional);
151 }
152
153 o.write_on(write_stream());
154 increment_count();
155 }
156
157
158 void OopMap::set_oop(VMReg reg) {
159 set_xxx(reg, OopMapValue::oop_value, VMRegImpl::Bad());
160 }
161
162
163 void OopMap::set_value(VMReg reg) {
164 // At this time, we don't need value entries in our OopMap.
165 }
166
167
168 void OopMap::set_narrowoop(VMReg reg) {
169 set_xxx(reg, OopMapValue::narrowoop_value, VMRegImpl::Bad());
170 }
171
172
173 void OopMap::set_callee_saved(VMReg reg, VMReg caller_machine_register ) {
174 set_xxx(reg, OopMapValue::callee_saved_value, caller_machine_register);
175 }
176
177
178 void OopMap::set_derived_oop(VMReg reg, VMReg derived_from_local_register ) {
179 if( reg == derived_from_local_register ) {
180 // Actually an oop, derived shares storage with base,
181 set_oop(reg);
182 } else {
183 set_xxx(reg, OopMapValue::derived_oop_value, derived_from_local_register);
184 }
185 }
186
187 // OopMapSet
188
189 OopMapSet::OopMapSet() {
190 set_om_size(MinOopMapAllocation);
191 set_om_count(0);
192 OopMap** temp = NEW_RESOURCE_ARRAY(OopMap*, om_size());
193 set_om_data(temp);
194 }
195
196
197 void OopMapSet::grow_om_data() {
198 int new_size = om_size() * 2;
199 OopMap** new_data = NEW_RESOURCE_ARRAY(OopMap*, new_size);
200 memcpy(new_data,om_data(),om_size() * sizeof(OopMap*));
201 set_om_size(new_size);
202 set_om_data(new_data);
203 }
204
205 void OopMapSet::add_gc_map(int pc_offset, OopMap *map ) {
206 assert(om_size() != -1,"Cannot grow a fixed OopMapSet");
207
208 if(om_count() >= om_size()) {
209 grow_om_data();
210 }
211 map->set_offset(pc_offset);
212
213 #ifdef ASSERT
214 if(om_count() > 0) {
215 OopMap* last = at(om_count()-1);
216 if (last->offset() == map->offset() ) {
217 fatal("OopMap inserted twice");
218 }
219 if(last->offset() > map->offset()) {
220 tty->print_cr( "WARNING, maps not sorted: pc[%d]=%d, pc[%d]=%d",
221 om_count(),last->offset(),om_count()+1,map->offset());
222 }
223 }
224 #endif // ASSERT
225
226 set(om_count(),map);
227 increment_count();
228 }
229
230
231 int OopMapSet::heap_size() const {
232 // The space we use
233 int size = sizeof(OopMap);
234 int align = sizeof(void *) - 1;
235 size = ((size+align) & ~align);
236 size += om_count() * sizeof(OopMap*);
237
238 // Now add in the space needed for the indivdiual OopMaps
239 for(int i=0; i < om_count(); i++) {
240 size += at(i)->heap_size();
241 }
242 // We don't need to align this, it will be naturally pointer aligned
243 return size;
244 }
245
246
247 OopMap* OopMapSet::singular_oop_map() {
248 guarantee(om_count() == 1, "Make sure we only have a single gc point");
249 return at(0);
250 }
251
252
253 OopMap* OopMapSet::find_map_at_offset(int pc_offset) const {
254 int i, len = om_count();
255 assert( len > 0, "must have pointer maps" );
256
257 // Scan through oopmaps. Stop when current offset is either equal or greater
258 // than the one we are looking for.
259 for( i = 0; i < len; i++) {
260 if( at(i)->offset() >= pc_offset )
261 break;
262 }
263
264 assert( i < len, "oopmap not found" );
265
266 OopMap* m = at(i);
267 assert( m->offset() == pc_offset, "oopmap not found" );
268 return m;
269 }
270
271 static void add_derived_oop(oop* base, oop* derived) {
272 #if !defined(TIERED) && !INCLUDE_JVMCI
273 COMPILER1_PRESENT(ShouldNotReachHere();)
274 #endif // !defined(TIERED) && !INCLUDE_JVMCI
275 #if COMPILER2_OR_JVMCI
276 DerivedPointerTable::add(derived, base);
277 #endif // COMPILER2_OR_JVMCI
278 }
279
280
281 #ifndef PRODUCT
282 static void trace_codeblob_maps(const frame *fr, const RegisterMap *reg_map) {
283 // Print oopmap and regmap
284 tty->print_cr("------ ");
285 CodeBlob* cb = fr->cb();
286 const ImmutableOopMapSet* maps = cb->oop_maps();
287 const ImmutableOopMap* map = cb->oop_map_for_return_address(fr->pc());
288 map->print();
289 if( cb->is_nmethod() ) {
290 nmethod* nm = (nmethod*)cb;
291 // native wrappers have no scope data, it is implied
292 if (nm->is_native_method()) {
293 tty->print("bci: 0 (native)");
294 } else {
295 ScopeDesc* scope = nm->scope_desc_at(fr->pc());
296 tty->print("bci: %d ",scope->bci());
297 }
298 }
299 tty->cr();
300 fr->print_on(tty);
301 tty->print(" ");
302 cb->print_value_on(tty); tty->cr();
303 reg_map->print();
304 tty->print_cr("------ ");
305
306 }
307 #endif // PRODUCT
308
309 void OopMapSet::oops_do(const frame *fr, const RegisterMap* reg_map, OopClosure* f) {
310 // add derived oops to a table
311 all_do(fr, reg_map, f, add_derived_oop, &do_nothing_cl);
312 }
313
314
315 void OopMapSet::all_do(const frame *fr, const RegisterMap *reg_map,
316 OopClosure* oop_fn, void derived_oop_fn(oop*, oop*),
317 OopClosure* value_fn) {
318 CodeBlob* cb = fr->cb();
319 assert(cb != NULL, "no codeblob");
320
321 NOT_PRODUCT(if (TraceCodeBlobStacks) trace_codeblob_maps(fr, reg_map);)
322
323 const ImmutableOopMapSet* maps = cb->oop_maps();
324 const ImmutableOopMap* map = cb->oop_map_for_return_address(fr->pc());
325 assert(map != NULL, "no ptr map found");
326
327 // handle derived pointers first (otherwise base pointer may be
328 // changed before derived pointer offset has been collected)
329 OopMapValue omv;
330 {
331 OopMapStream oms(map,OopMapValue::derived_oop_value);
332 if (!oms.is_done()) {
333 #ifndef TIERED
334 COMPILER1_PRESENT(ShouldNotReachHere();)
335 #if INCLUDE_JVMCI
336 if (UseJVMCICompiler) {
337 ShouldNotReachHere();
338 }
339 #endif
340 #endif // !TIERED
341 do {
342 omv = oms.current();
343 oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
344 guarantee(loc != NULL, "missing saved register");
345 oop *derived_loc = loc;
346 oop *base_loc = fr->oopmapreg_to_location(omv.content_reg(), reg_map);
347 // Ignore NULL oops and decoded NULL narrow oops which
348 // equal to CompressedOops::base() when a narrow oop
349 // implicit null check is used in compiled code.
350 // The narrow_oop_base could be NULL or be the address
351 // of the page below heap depending on compressed oops mode.
352 if (base_loc != NULL && *base_loc != NULL && !CompressedOops::is_base(*base_loc)) {
353 derived_oop_fn(base_loc, derived_loc);
354 }
355 oms.next();
356 } while (!oms.is_done());
357 }
358 }
359
360 // We want coop and oop oop_types
361 int mask = OopMapValue::oop_value | OopMapValue::narrowoop_value;
362 {
363 for (OopMapStream oms(map,mask); !oms.is_done(); oms.next()) {
364 omv = oms.current();
365 oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
366 // It should be an error if no location can be found for a
367 // register mentioned as contained an oop of some kind. Maybe
368 // this was allowed previously because value_value items might
369 // be missing?
370 guarantee(loc != NULL, "missing saved register");
371 if ( omv.type() == OopMapValue::oop_value ) {
372 oop val = *loc;
373 if (val == NULL || CompressedOops::is_base(val)) {
374 // Ignore NULL oops and decoded NULL narrow oops which
375 // equal to CompressedOops::base() when a narrow oop
376 // implicit null check is used in compiled code.
377 // The narrow_oop_base could be NULL or be the address
378 // of the page below heap depending on compressed oops mode.
379 continue;
380 }
381 #ifdef ASSERT
382 // We can not verify the oop here if we are using ZGC, the oop
383 // will be bad in case we had a safepoint between a load and a
384 // load barrier.
385 if (!UseZGC &&
386 ((((uintptr_t)loc & (sizeof(*loc)-1)) != 0) ||
387 !Universe::heap()->is_in_or_null(*loc))) {
388 tty->print_cr("# Found non oop pointer. Dumping state at failure");
389 // try to dump out some helpful debugging information
390 trace_codeblob_maps(fr, reg_map);
391 omv.print();
392 tty->print_cr("register r");
393 omv.reg()->print();
394 tty->print_cr("loc = %p *loc = %p\n", loc, (address)*loc);
395 // do the real assert.
396 assert(Universe::heap()->is_in_or_null(*loc), "found non oop pointer");
397 }
398 #endif // ASSERT
399 oop_fn->do_oop(loc);
400 } else if ( omv.type() == OopMapValue::narrowoop_value ) {
401 narrowOop *nl = (narrowOop*)loc;
402 #ifndef VM_LITTLE_ENDIAN
403 VMReg vmReg = omv.reg();
404 // Don't do this on SPARC float registers as they can be individually addressed
405 if (!vmReg->is_stack() SPARC_ONLY(&& !vmReg->is_FloatRegister())) {
406 // compressed oops in registers only take up 4 bytes of an
407 // 8 byte register but they are in the wrong part of the
408 // word so adjust loc to point at the right place.
409 nl = (narrowOop*)((address)nl + 4);
410 }
411 #endif
412 oop_fn->do_oop(nl);
413 }
414 }
415 }
416 }
417
418
419 // Update callee-saved register info for the following frame
420 void OopMapSet::update_register_map(const frame *fr, RegisterMap *reg_map) {
421 ResourceMark rm;
422 CodeBlob* cb = fr->cb();
423 assert(cb != NULL, "no codeblob");
424
425 // Any reg might be saved by a safepoint handler (see generate_handler_blob).
426 assert( reg_map->_update_for_id == NULL || fr->is_older(reg_map->_update_for_id),
427 "already updated this map; do not 'update' it twice!" );
428 debug_only(reg_map->_update_for_id = fr->id());
429
430 // Check if caller must update oop argument
431 assert((reg_map->include_argument_oops() ||
432 !cb->caller_must_gc_arguments(reg_map->thread())),
433 "include_argument_oops should already be set");
434
435 // Scan through oopmap and find location of all callee-saved registers
436 // (we do not do update in place, since info could be overwritten)
437
438 address pc = fr->pc();
439 const ImmutableOopMap* map = cb->oop_map_for_return_address(pc);
440 assert(map != NULL, "no ptr map found");
441 DEBUG_ONLY(int nof_callee = 0;)
442
443 for (OopMapStream oms(map, OopMapValue::callee_saved_value); !oms.is_done(); oms.next()) {
444 OopMapValue omv = oms.current();
445 VMReg reg = omv.content_reg();
446 oop* loc = fr->oopmapreg_to_location(omv.reg(), reg_map);
447 reg_map->set_location(reg, (address) loc);
448 DEBUG_ONLY(nof_callee++;)
449 }
450
451 // Check that runtime stubs save all callee-saved registers
452 #ifdef COMPILER2
453 assert(cb->is_compiled_by_c1() || cb->is_compiled_by_jvmci() || !cb->is_runtime_stub() ||
454 (nof_callee >= SAVED_ON_ENTRY_REG_COUNT || nof_callee >= C_SAVED_ON_ENTRY_REG_COUNT),
455 "must save all");
456 #endif // COMPILER2
457 }
458
459 //=============================================================================
460 // Non-Product code
461
462 #ifndef PRODUCT
463
464 bool ImmutableOopMap::has_derived_pointer() const {
465 #if !defined(TIERED) && !INCLUDE_JVMCI
466 COMPILER1_PRESENT(return false);
467 #endif // !TIERED
468 #if COMPILER2_OR_JVMCI
469 OopMapStream oms(this,OopMapValue::derived_oop_value);
470 return oms.is_done();
471 #else
472 return false;
473 #endif // COMPILER2_OR_JVMCI
474 }
475
476 #endif //PRODUCT
477
478 // Printing code is present in product build for -XX:+PrintAssembly.
479
480 static
481 void print_register_type(OopMapValue::oop_types x, VMReg optional,
482 outputStream* st) {
483 switch( x ) {
484 case OopMapValue::oop_value:
485 st->print("Oop");
486 break;
487 case OopMapValue::narrowoop_value:
488 st->print("NarrowOop");
489 break;
490 case OopMapValue::callee_saved_value:
491 st->print("Callers_");
492 optional->print_on(st);
493 break;
494 case OopMapValue::derived_oop_value:
495 st->print("Derived_oop_");
496 optional->print_on(st);
497 break;
498 default:
499 ShouldNotReachHere();
500 }
501 }
502
503 void OopMapValue::print_on(outputStream* st) const {
504 reg()->print_on(st);
505 st->print("=");
506 print_register_type(type(),content_reg(),st);
507 st->print(" ");
508 }
509
510 void OopMapValue::print() const { print_on(tty); }
511
512 void ImmutableOopMap::print_on(outputStream* st) const {
513 OopMapValue omv;
514 st->print("ImmutableOopMap {");
515 for(OopMapStream oms(this); !oms.is_done(); oms.next()) {
516 omv = oms.current();
517 omv.print_on(st);
518 }
519 st->print("}");
520 }
521
522 void ImmutableOopMap::print() const { print_on(tty); }
523
524 void OopMap::print_on(outputStream* st) const {
525 OopMapValue omv;
526 st->print("OopMap {");
527 for(OopMapStream oms((OopMap*)this); !oms.is_done(); oms.next()) {
528 omv = oms.current();
529 omv.print_on(st);
530 }
531 // Print hex offset in addition.
532 st->print("off=%d/0x%x}", (int) offset(), (int) offset());
533 }
534
535 void OopMap::print() const { print_on(tty); }
536
537 void ImmutableOopMapSet::print_on(outputStream* st) const {
538 const ImmutableOopMap* last = NULL;
539 const int len = count();
540
541 st->print_cr("ImmutableOopMapSet contains %d OopMaps", len);
542
543 for (int i = 0; i < len; i++) {
544 const ImmutableOopMapPair* pair = pair_at(i);
545 const ImmutableOopMap* map = pair->get_from(this);
546 if (map != last) {
547 st->cr();
548 map->print_on(st);
549 st->print(" pc offsets: ");
550 }
551 last = map;
552 st->print("%d ", pair->pc_offset());
553 }
554 st->cr();
555 }
556
557 void ImmutableOopMapSet::print() const { print_on(tty); }
558
559 void OopMapSet::print_on(outputStream* st) const {
560 const int len = om_count();
561
562 st->print_cr("OopMapSet contains %d OopMaps", len);
563
564 for( int i = 0; i < len; i++) {
565 OopMap* m = at(i);
566 st->print_cr("#%d ",i);
567 m->print_on(st);
568 st->cr();
569 }
570 st->cr();
571 }
572
573 void OopMapSet::print() const { print_on(tty); }
574
575 bool OopMap::equals(const OopMap* other) const {
576 if (other->_omv_count != _omv_count) {
577 return false;
578 }
579 if (other->write_stream()->position() != write_stream()->position()) {
580 return false;
581 }
582 if (memcmp(other->write_stream()->buffer(), write_stream()->buffer(), write_stream()->position()) != 0) {
583 return false;
584 }
585 return true;
586 }
587
588 const ImmutableOopMap* ImmutableOopMapSet::find_map_at_offset(int pc_offset) const {
589 ImmutableOopMapPair* pairs = get_pairs();
590 ImmutableOopMapPair* last = NULL;
591
592 for (int i = 0; i < _count; ++i) {
593 if (pairs[i].pc_offset() >= pc_offset) {
594 last = &pairs[i];
595 break;
596 }
597 }
598
599 // Heal Coverity issue: potential index out of bounds access.
600 guarantee(last != NULL, "last may not be null");
601 assert(last->pc_offset() == pc_offset, "oopmap not found");
602 return last->get_from(this);
603 }
604
605 const ImmutableOopMap* ImmutableOopMapPair::get_from(const ImmutableOopMapSet* set) const {
606 return set->oopmap_at_offset(_oopmap_offset);
607 }
608
609 ImmutableOopMap::ImmutableOopMap(const OopMap* oopmap) : _count(oopmap->count()) {
610 address addr = data_addr();
611 oopmap->copy_data_to(addr);
612 }
613
614 #ifdef ASSERT
615 int ImmutableOopMap::nr_of_bytes() const {
616 OopMapStream oms(this);
617
618 while (!oms.is_done()) {
619 oms.next();
620 }
621 return sizeof(ImmutableOopMap) + oms.stream_position();
622 }
623 #endif
624
625 ImmutableOopMapBuilder::ImmutableOopMapBuilder(const OopMapSet* set) : _set(set), _empty(NULL), _last(NULL), _empty_offset(-1), _last_offset(-1), _offset(0), _required(-1), _new_set(NULL) {
626 _mapping = NEW_RESOURCE_ARRAY(Mapping, _set->size());
627 }
628
629 int ImmutableOopMapBuilder::size_for(const OopMap* map) const {
630 return align_up((int)sizeof(ImmutableOopMap) + map->data_size(), 8);
631 }
632
633 int ImmutableOopMapBuilder::heap_size() {
634 int base = sizeof(ImmutableOopMapSet);
635 base = align_up(base, 8);
636
637 // all of ours pc / offset pairs
638 int pairs = _set->size() * sizeof(ImmutableOopMapPair);
639 pairs = align_up(pairs, 8);
640
641 for (int i = 0; i < _set->size(); ++i) {
642 int size = 0;
643 OopMap* map = _set->at(i);
644
645 if (is_empty(map)) {
646 /* only keep a single empty map in the set */
647 if (has_empty()) {
648 _mapping[i].set(Mapping::OOPMAP_EMPTY, _empty_offset, 0, map, _empty);
649 } else {
650 _empty_offset = _offset;
651 _empty = map;
652 size = size_for(map);
653 _mapping[i].set(Mapping::OOPMAP_NEW, _offset, size, map);
654 }
655 } else if (is_last_duplicate(map)) {
656 /* if this entry is identical to the previous one, just point it there */
657 _mapping[i].set(Mapping::OOPMAP_DUPLICATE, _last_offset, 0, map, _last);
658 } else {
659 /* not empty, not an identical copy of the previous entry */
660 size = size_for(map);
661 _mapping[i].set(Mapping::OOPMAP_NEW, _offset, size, map);
662 _last_offset = _offset;
663 _last = map;
664 }
665
666 assert(_mapping[i]._map == map, "check");
667 _offset += size;
668 }
669
670 int total = base + pairs + _offset;
671 DEBUG_ONLY(total += 8);
672 _required = total;
673 return total;
674 }
675
676 void ImmutableOopMapBuilder::fill_pair(ImmutableOopMapPair* pair, const OopMap* map, int offset, const ImmutableOopMapSet* set) {
677 assert(offset < set->nr_of_bytes(), "check");
678 new ((address) pair) ImmutableOopMapPair(map->offset(), offset);
679 }
680
681 int ImmutableOopMapBuilder::fill_map(ImmutableOopMapPair* pair, const OopMap* map, int offset, const ImmutableOopMapSet* set) {
682 fill_pair(pair, map, offset, set);
683 address addr = (address) pair->get_from(_new_set); // location of the ImmutableOopMap
684
685 new (addr) ImmutableOopMap(map);
686 return size_for(map);
687 }
688
689 void ImmutableOopMapBuilder::fill(ImmutableOopMapSet* set, int sz) {
690 ImmutableOopMapPair* pairs = set->get_pairs();
691
692 for (int i = 0; i < set->count(); ++i) {
693 const OopMap* map = _mapping[i]._map;
694 ImmutableOopMapPair* pair = NULL;
695 int size = 0;
696
697 if (_mapping[i]._kind == Mapping::OOPMAP_NEW) {
698 size = fill_map(&pairs[i], map, _mapping[i]._offset, set);
699 } else if (_mapping[i]._kind == Mapping::OOPMAP_DUPLICATE || _mapping[i]._kind == Mapping::OOPMAP_EMPTY) {
700 fill_pair(&pairs[i], map, _mapping[i]._offset, set);
701 }
702
703 const ImmutableOopMap* nv = set->find_map_at_offset(map->offset());
704 assert(memcmp(map->data(), nv->data_addr(), map->data_size()) == 0, "check identity");
705 }
706 }
707
708 #ifdef ASSERT
709 void ImmutableOopMapBuilder::verify(address buffer, int size, const ImmutableOopMapSet* set) {
710 for (int i = 0; i < 8; ++i) {
711 assert(buffer[size - 8 + i] == (unsigned char) 0xff, "overwritten memory check");
712 }
713
714 for (int i = 0; i < set->count(); ++i) {
715 const ImmutableOopMapPair* pair = set->pair_at(i);
716 assert(pair->oopmap_offset() < set->nr_of_bytes(), "check size");
717 const ImmutableOopMap* map = pair->get_from(set);
718 int nr_of_bytes = map->nr_of_bytes();
719 assert(pair->oopmap_offset() + nr_of_bytes <= set->nr_of_bytes(), "check size + size");
720 }
721 }
722 #endif
723
724 ImmutableOopMapSet* ImmutableOopMapBuilder::generate_into(address buffer) {
725 DEBUG_ONLY(memset(&buffer[_required-8], 0xff, 8));
726
727 _new_set = new (buffer) ImmutableOopMapSet(_set, _required);
728 fill(_new_set, _required);
729
730 DEBUG_ONLY(verify(buffer, _required, _new_set));
731
732 return _new_set;
733 }
734
735 ImmutableOopMapSet* ImmutableOopMapBuilder::build() {
736 _required = heap_size();
737
738 // We need to allocate a chunk big enough to hold the ImmutableOopMapSet and all of its ImmutableOopMaps
739 address buffer = (address) NEW_C_HEAP_ARRAY(unsigned char, _required, mtCode);
740 return generate_into(buffer);
741 }
742
743 ImmutableOopMapSet* ImmutableOopMapSet::build_from(const OopMapSet* oopmap_set) {
744 ResourceMark mark;
745 ImmutableOopMapBuilder builder(oopmap_set);
746 return builder.build();
747 }
748
749
750 //------------------------------DerivedPointerTable---------------------------
751
752 #if COMPILER2_OR_JVMCI
753
754 class DerivedPointerTable::Entry : public CHeapObj<mtCompiler> {
755 oop* _location; // Location of derived pointer, also pointing to base
756 intptr_t _offset; // Offset from base pointer
757 Entry* volatile _next;
758
759 static Entry* volatile* next_ptr(Entry& entry) { return &entry._next; }
760
761 public:
762 Entry(oop* location, intptr_t offset) :
763 _location(location), _offset(offset), _next(NULL) {}
764
765 oop* location() const { return _location; }
766 intptr_t offset() const { return _offset; }
767 Entry* next() const { return _next; }
768
769 typedef LockFreeStack<Entry, &next_ptr> List;
770 static List* _list;
771 };
772
773 DerivedPointerTable::Entry::List* DerivedPointerTable::Entry::_list = NULL;
774 bool DerivedPointerTable::_active = false;
775
776 bool DerivedPointerTable::is_empty() {
777 return Entry::_list == NULL || Entry::_list->empty();
778 }
779
780 void DerivedPointerTable::clear() {
781 // The first time, we create the list. Otherwise it should be
782 // empty. If not, then we have probably forgotton to call
783 // update_pointers after last GC/Scavenge.
784 assert (!_active, "should not be active");
785 assert(is_empty(), "table not empty");
786 if (Entry::_list == NULL) {
787 void* mem = NEW_C_HEAP_OBJ(Entry::List, mtCompiler);
788 Entry::_list = ::new (mem) Entry::List();
789 }
790 _active = true;
791 }
792
793 // Returns value of location as an int
794 inline intptr_t value_of_loc(oop *pointer) {
795 return cast_from_oop<intptr_t>((*pointer));
796 }
797
798 void DerivedPointerTable::add(oop *derived_loc, oop *base_loc) {
799 assert(Universe::heap()->is_in_or_null(*base_loc), "not an oop");
800 assert(derived_loc != base_loc, "Base and derived in same location");
801 if (_active) {
802 assert(*derived_loc != (void*)base_loc, "location already added");
803 assert(Entry::_list != NULL, "list must exist");
804 intptr_t offset = value_of_loc(derived_loc) - value_of_loc(base_loc);
805 // This assert is invalid because derived pointers can be
806 // arbitrarily far away from their base.
807 // assert(offset >= -1000000, "wrong derived pointer info");
808
809 if (TraceDerivedPointers) {
810 tty->print_cr(
811 "Add derived pointer@" INTPTR_FORMAT
812 " - Derived: " INTPTR_FORMAT
813 " Base: " INTPTR_FORMAT " (@" INTPTR_FORMAT ") (Offset: " INTX_FORMAT ")",
814 p2i(derived_loc), p2i((address)*derived_loc), p2i((address)*base_loc), p2i(base_loc), offset
815 );
816 }
817 // Set derived oop location to point to base.
818 *derived_loc = (oop)base_loc;
819 Entry* entry = new Entry(derived_loc, offset);
820 Entry::_list->push(*entry);
821 }
822 }
823
824 void DerivedPointerTable::update_pointers() {
825 assert(Entry::_list != NULL, "list must exist");
826 Entry* entries = Entry::_list->pop_all();
827 while (entries != NULL) {
828 Entry* entry = entries;
829 entries = entry->next();
830 oop* derived_loc = entry->location();
831 intptr_t offset = entry->offset();
832 // The derived oop was setup to point to location of base
833 oop base = **(oop**)derived_loc;
834 assert(Universe::heap()->is_in_or_null(base), "must be an oop");
835
836 *derived_loc = (oop)(((address)base) + offset);
837 assert(value_of_loc(derived_loc) - value_of_loc(&base) == offset, "sanity check");
838
839 if (TraceDerivedPointers) {
840 tty->print_cr("Updating derived pointer@" INTPTR_FORMAT
841 " - Derived: " INTPTR_FORMAT " Base: " INTPTR_FORMAT " (Offset: " INTX_FORMAT ")",
842 p2i(derived_loc), p2i((address)*derived_loc), p2i((address)base), offset);
843 }
844
845 // Delete entry
846 delete entry;
847 }
848 assert(Entry::_list->empty(), "invariant");
849 _active = false;
850 }
851
852 #endif // COMPILER2_OR_JVMCI