duke@435: /*
hseigel@5784:  * Copyright (c) 1998, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "code/codeBlob.hpp"
stefank@2314: #include "code/codeCache.hpp"
stefank@2314: #include "code/nmethod.hpp"
stefank@2314: #include "code/scopeDesc.hpp"
stefank@2314: #include "compiler/oopMap.hpp"
stefank@2314: #include "gc_interface/collectedHeap.hpp"
stefank@2314: #include "memory/allocation.inline.hpp"
stefank@2314: #include "memory/resourceArea.hpp"
stefank@2314: #include "runtime/frame.inline.hpp"
stefank@2314: #include "runtime/signature.hpp"
stefank@2314: #ifdef COMPILER1
stefank@2314: #include "c1/c1_Defs.hpp"
stefank@2314: #endif
duke@435: 
duke@435: // OopMapStream
duke@435: 
duke@435: OopMapStream::OopMapStream(OopMap* oop_map) {
duke@435:   if(oop_map->omv_data() == NULL) {
duke@435:     _stream = new CompressedReadStream(oop_map->write_stream()->buffer());
duke@435:   } else {
duke@435:     _stream = new CompressedReadStream(oop_map->omv_data());
duke@435:   }
duke@435:   _mask = OopMapValue::type_mask_in_place;
duke@435:   _size = oop_map->omv_count();
duke@435:   _position = 0;
duke@435:   _valid_omv = false;
duke@435: }
duke@435: 
duke@435: 
duke@435: OopMapStream::OopMapStream(OopMap* oop_map, int oop_types_mask) {
duke@435:   if(oop_map->omv_data() == NULL) {
duke@435:     _stream = new CompressedReadStream(oop_map->write_stream()->buffer());
duke@435:   } else {
duke@435:     _stream = new CompressedReadStream(oop_map->omv_data());
duke@435:   }
duke@435:   _mask = oop_types_mask;
duke@435:   _size = oop_map->omv_count();
duke@435:   _position = 0;
duke@435:   _valid_omv = false;
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapStream::find_next() {
duke@435:   while(_position++ < _size) {
duke@435:     _omv.read_from(_stream);
duke@435:     if(((int)_omv.type() & _mask) > 0) {
duke@435:       _valid_omv = true;
duke@435:       return;
duke@435:     }
duke@435:   }
duke@435:   _valid_omv = false;
duke@435: }
duke@435: 
duke@435: 
duke@435: // OopMap
duke@435: 
duke@435: // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
duke@435: // slots to hold 4-byte values like ints and floats in the LP64 build.
duke@435: OopMap::OopMap(int frame_size, int arg_count) {
duke@435:   // OopMaps are usually quite so small, so pick a small initial size
duke@435:   set_write_stream(new CompressedWriteStream(32));
duke@435:   set_omv_data(NULL);
duke@435:   set_omv_count(0);
duke@435: 
duke@435: #ifdef ASSERT
duke@435:   _locs_length = VMRegImpl::stack2reg(0)->value() + frame_size + arg_count;
duke@435:   _locs_used   = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
duke@435:   for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
duke@435: #endif
duke@435: }
duke@435: 
duke@435: 
duke@435: OopMap::OopMap(OopMap::DeepCopyToken, OopMap* source) {
duke@435:   // This constructor does a deep copy
duke@435:   // of the source OopMap.
duke@435:   set_write_stream(new CompressedWriteStream(source->omv_count() * 2));
duke@435:   set_omv_data(NULL);
duke@435:   set_omv_count(0);
duke@435:   set_offset(source->offset());
duke@435: 
duke@435: #ifdef ASSERT
duke@435:   _locs_length = source->_locs_length;
duke@435:   _locs_used = NEW_RESOURCE_ARRAY(OopMapValue::oop_types, _locs_length);
duke@435:   for(int i = 0; i < _locs_length; i++) _locs_used[i] = OopMapValue::unused_value;
duke@435: #endif
duke@435: 
duke@435:   // We need to copy the entries too.
duke@435:   for (OopMapStream oms(source); !oms.is_done(); oms.next()) {
duke@435:     OopMapValue omv = oms.current();
duke@435:     omv.write_on(write_stream());
duke@435:     increment_count();
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: OopMap* OopMap::deep_copy() {
duke@435:   return new OopMap(_deep_copy_token, this);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::copy_to(address addr) {
duke@435:   memcpy(addr,this,sizeof(OopMap));
duke@435:   memcpy(addr + sizeof(OopMap),write_stream()->buffer(),write_stream()->position());
duke@435:   OopMap* new_oop = (OopMap*)addr;
duke@435:   new_oop->set_omv_data_size(write_stream()->position());
duke@435:   new_oop->set_omv_data((unsigned char *)(addr + sizeof(OopMap)));
duke@435:   new_oop->set_write_stream(NULL);
duke@435: }
duke@435: 
duke@435: 
duke@435: int OopMap::heap_size() const {
duke@435:   int size = sizeof(OopMap);
duke@435:   int align = sizeof(void *) - 1;
duke@435:   if(write_stream() != NULL) {
duke@435:     size += write_stream()->position();
duke@435:   } else {
duke@435:     size += omv_data_size();
duke@435:   }
duke@435:   // Align to a reasonable ending point
duke@435:   size = ((size+align) & ~align);
duke@435:   return size;
duke@435: }
duke@435: 
duke@435: // frame_size units are stack-slots (4 bytes) NOT intptr_t; we can name odd
duke@435: // slots to hold 4-byte values like ints and floats in the LP64 build.
duke@435: void OopMap::set_xxx(VMReg reg, OopMapValue::oop_types x, VMReg optional) {
duke@435: 
duke@435:   assert(reg->value() < _locs_length, "too big reg value for stack size");
duke@435:   assert( _locs_used[reg->value()] == OopMapValue::unused_value, "cannot insert twice" );
duke@435:   debug_only( _locs_used[reg->value()] = x; )
duke@435: 
duke@435:   OopMapValue o(reg, x);
duke@435: 
duke@435:   if(x == OopMapValue::callee_saved_value) {
duke@435:     // This can never be a stack location, so we don't need to transform it.
duke@435:     assert(optional->is_reg(), "Trying to callee save a stack location");
duke@435:     o.set_content_reg(optional);
duke@435:   } else if(x == OopMapValue::derived_oop_value) {
duke@435:     o.set_content_reg(optional);
duke@435:   }
duke@435: 
duke@435:   o.write_on(write_stream());
duke@435:   increment_count();
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::set_oop(VMReg reg) {
duke@435:   set_xxx(reg, OopMapValue::oop_value, VMRegImpl::Bad());
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::set_value(VMReg reg) {
duke@435:   // At this time, we only need value entries in our OopMap when ZapDeadCompiledLocals is active.
duke@435:   if (ZapDeadCompiledLocals)
duke@435:     set_xxx(reg, OopMapValue::value_value, VMRegImpl::Bad());
duke@435: }
duke@435: 
duke@435: 
coleenp@548: void OopMap::set_narrowoop(VMReg reg) {
coleenp@548:   set_xxx(reg, OopMapValue::narrowoop_value, VMRegImpl::Bad());
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::set_callee_saved(VMReg reg, VMReg caller_machine_register ) {
duke@435:   set_xxx(reg, OopMapValue::callee_saved_value, caller_machine_register);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::set_derived_oop(VMReg reg, VMReg derived_from_local_register ) {
duke@435:   if( reg == derived_from_local_register ) {
duke@435:     // Actually an oop, derived shares storage with base,
duke@435:     set_oop(reg);
duke@435:   } else {
duke@435:     set_xxx(reg, OopMapValue::derived_oop_value, derived_from_local_register);
duke@435:   }
duke@435: }
duke@435: 
duke@435: // OopMapSet
duke@435: 
duke@435: OopMapSet::OopMapSet() {
duke@435:   set_om_size(MinOopMapAllocation);
duke@435:   set_om_count(0);
duke@435:   OopMap** temp = NEW_RESOURCE_ARRAY(OopMap*, om_size());
duke@435:   set_om_data(temp);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapSet::grow_om_data() {
duke@435:   int new_size = om_size() * 2;
duke@435:   OopMap** new_data = NEW_RESOURCE_ARRAY(OopMap*, new_size);
duke@435:   memcpy(new_data,om_data(),om_size() * sizeof(OopMap*));
duke@435:   set_om_size(new_size);
duke@435:   set_om_data(new_data);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapSet::copy_to(address addr) {
duke@435:   address temp = addr;
duke@435:   int align = sizeof(void *) - 1;
duke@435:   // Copy this
duke@435:   memcpy(addr,this,sizeof(OopMapSet));
duke@435:   temp += sizeof(OopMapSet);
duke@435:   temp = (address)((intptr_t)(temp + align) & ~align);
duke@435:   // Do the needed fixups to the new OopMapSet
duke@435:   OopMapSet* new_set = (OopMapSet*)addr;
duke@435:   new_set->set_om_data((OopMap**)temp);
duke@435:   // Allow enough space for the OopMap pointers
duke@435:   temp += (om_count() * sizeof(OopMap*));
duke@435: 
duke@435:   for(int i=0; i < om_count(); i++) {
duke@435:     OopMap* map = at(i);
duke@435:     map->copy_to((address)temp);
duke@435:     new_set->set(i,(OopMap*)temp);
duke@435:     temp += map->heap_size();
duke@435:   }
duke@435:   // This "locks" the OopMapSet
duke@435:   new_set->set_om_size(-1);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapSet::add_gc_map(int pc_offset, OopMap *map ) {
duke@435:   assert(om_size() != -1,"Cannot grow a fixed OopMapSet");
duke@435: 
duke@435:   if(om_count() >= om_size()) {
duke@435:     grow_om_data();
duke@435:   }
duke@435:   map->set_offset(pc_offset);
duke@435: 
duke@435: #ifdef ASSERT
duke@435:   if(om_count() > 0) {
duke@435:     OopMap* last = at(om_count()-1);
duke@435:     if (last->offset() == map->offset() ) {
duke@435:       fatal("OopMap inserted twice");
duke@435:     }
duke@435:     if(last->offset() > map->offset()) {
duke@435:       tty->print_cr( "WARNING, maps not sorted: pc[%d]=%d, pc[%d]=%d",
duke@435:                       om_count(),last->offset(),om_count()+1,map->offset());
duke@435:     }
duke@435:   }
duke@435: #endif // ASSERT
duke@435: 
duke@435:   set(om_count(),map);
duke@435:   increment_count();
duke@435: }
duke@435: 
duke@435: 
duke@435: int OopMapSet::heap_size() const {
duke@435:   // The space we use
duke@435:   int size = sizeof(OopMap);
duke@435:   int align = sizeof(void *) - 1;
duke@435:   size = ((size+align) & ~align);
duke@435:   size += om_count() * sizeof(OopMap*);
duke@435: 
duke@435:   // Now add in the space needed for the indivdiual OopMaps
duke@435:   for(int i=0; i < om_count(); i++) {
duke@435:     size += at(i)->heap_size();
duke@435:   }
duke@435:   // We don't need to align this, it will be naturally pointer aligned
duke@435:   return size;
duke@435: }
duke@435: 
duke@435: 
duke@435: OopMap* OopMapSet::singular_oop_map() {
duke@435:   guarantee(om_count() == 1, "Make sure we only have a single gc point");
duke@435:   return at(0);
duke@435: }
duke@435: 
duke@435: 
duke@435: OopMap* OopMapSet::find_map_at_offset(int pc_offset) const {
duke@435:   int i, len = om_count();
duke@435:   assert( len > 0, "must have pointer maps" );
duke@435: 
duke@435:   // Scan through oopmaps. Stop when current offset is either equal or greater
duke@435:   // than the one we are looking for.
duke@435:   for( i = 0; i < len; i++) {
duke@435:     if( at(i)->offset() >= pc_offset )
duke@435:       break;
duke@435:   }
duke@435: 
duke@435:   assert( i < len, "oopmap not found" );
duke@435: 
duke@435:   OopMap* m = at(i);
duke@435:   assert( m->offset() == pc_offset, "oopmap not found" );
duke@435:   return m;
duke@435: }
duke@435: 
duke@435: class DoNothingClosure: public OopClosure {
coleenp@548:  public:
coleenp@548:   void do_oop(oop* p)       {}
coleenp@548:   void do_oop(narrowOop* p) {}
duke@435: };
duke@435: static DoNothingClosure do_nothing;
duke@435: 
duke@435: static void add_derived_oop(oop* base, oop* derived) {
duke@435: #ifndef TIERED
duke@435:   COMPILER1_PRESENT(ShouldNotReachHere();)
duke@435: #endif // TIERED
duke@435: #ifdef COMPILER2
duke@435:   DerivedPointerTable::add(derived, base);
duke@435: #endif // COMPILER2
duke@435: }
duke@435: 
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: static void trace_codeblob_maps(const frame *fr, const RegisterMap *reg_map) {
duke@435:   // Print oopmap and regmap
duke@435:   tty->print_cr("------ ");
duke@435:   CodeBlob* cb = fr->cb();
duke@435:   OopMapSet* maps = cb->oop_maps();
duke@435:   OopMap* map = cb->oop_map_for_return_address(fr->pc());
duke@435:   map->print();
duke@435:   if( cb->is_nmethod() ) {
duke@435:     nmethod* nm = (nmethod*)cb;
duke@435:     // native wrappers have no scope data, it is implied
duke@435:     if (nm->is_native_method()) {
duke@435:       tty->print("bci: 0 (native)");
duke@435:     } else {
duke@435:       ScopeDesc* scope  = nm->scope_desc_at(fr->pc());
duke@435:       tty->print("bci: %d ",scope->bci());
duke@435:     }
duke@435:   }
duke@435:   tty->cr();
duke@435:   fr->print_on(tty);
duke@435:   tty->print("     ");
duke@435:   cb->print_value_on(tty);  tty->cr();
duke@435:   reg_map->print();
duke@435:   tty->print_cr("------ ");
duke@435: 
duke@435: }
duke@435: #endif // PRODUCT
duke@435: 
duke@435: void OopMapSet::oops_do(const frame *fr, const RegisterMap* reg_map, OopClosure* f) {
duke@435:   // add derived oops to a table
coleenp@548:   all_do(fr, reg_map, f, add_derived_oop, &do_nothing);
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapSet::all_do(const frame *fr, const RegisterMap *reg_map,
duke@435:                        OopClosure* oop_fn, void derived_oop_fn(oop*, oop*),
coleenp@548:                        OopClosure* value_fn) {
duke@435:   CodeBlob* cb = fr->cb();
coleenp@548:   assert(cb != NULL, "no codeblob");
duke@435: 
duke@435:   NOT_PRODUCT(if (TraceCodeBlobStacks) trace_codeblob_maps(fr, reg_map);)
duke@435: 
duke@435:   OopMapSet* maps = cb->oop_maps();
coleenp@548:   OopMap* map = cb->oop_map_for_return_address(fr->pc());
coleenp@548:   assert(map != NULL, "no ptr map found");
duke@435: 
duke@435:   // handle derived pointers first (otherwise base pointer may be
duke@435:   // changed before derived pointer offset has been collected)
duke@435:   OopMapValue omv;
duke@435:   {
duke@435:     OopMapStream oms(map,OopMapValue::derived_oop_value);
duke@435:     if (!oms.is_done()) {
duke@435: #ifndef TIERED
duke@435:       COMPILER1_PRESENT(ShouldNotReachHere();)
duke@435: #endif // !TIERED
duke@435:       // Protect the operation on the derived pointers.  This
duke@435:       // protects the addition of derived pointers to the shared
duke@435:       // derived pointer table in DerivedPointerTable::add().
duke@435:       MutexLockerEx x(DerivedPointerTableGC_lock, Mutex::_no_safepoint_check_flag);
duke@435:       do {
duke@435:         omv = oms.current();
duke@435:         oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435:         if ( loc != NULL ) {
duke@435:           oop *base_loc    = fr->oopmapreg_to_location(omv.content_reg(), reg_map);
duke@435:           oop *derived_loc = loc;
kvn@1293:           oop val = *base_loc;
kvn@1293:           if (val == (oop)NULL || Universe::is_narrow_oop_base(val)) {
kvn@1293:             // Ignore NULL oops and decoded NULL narrow oops which
kvn@1293:             // equal to Universe::narrow_oop_base when a narrow oop
kvn@1293:             // implicit null check is used in compiled code.
kvn@1293:             // The narrow_oop_base could be NULL or be the address
kvn@1293:             // of the page below heap depending on compressed oops mode.
kvn@1293:           } else
kvn@1293:             derived_oop_fn(base_loc, derived_loc);
duke@435:         }
duke@435:         oms.next();
duke@435:       }  while (!oms.is_done());
duke@435:     }
duke@435:   }
duke@435: 
coleenp@548:   // We want coop, value and oop oop_types
coleenp@548:   int mask = OopMapValue::oop_value | OopMapValue::value_value | OopMapValue::narrowoop_value;
duke@435:   {
duke@435:     for (OopMapStream oms(map,mask); !oms.is_done(); oms.next()) {
duke@435:       omv = oms.current();
duke@435:       oop* loc = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435:       if ( loc != NULL ) {
duke@435:         if ( omv.type() == OopMapValue::oop_value ) {
kvn@1293:           oop val = *loc;
kvn@1293:           if (val == (oop)NULL || Universe::is_narrow_oop_base(val)) {
kvn@1293:             // Ignore NULL oops and decoded NULL narrow oops which
kvn@1293:             // equal to Universe::narrow_oop_base when a narrow oop
kvn@1293:             // implicit null check is used in compiled code.
kvn@1293:             // The narrow_oop_base could be NULL or be the address
kvn@1293:             // of the page below heap depending on compressed oops mode.
kvn@1293:             continue;
kvn@1293:           }
duke@435: #ifdef ASSERT
kvn@679:           if ((((uintptr_t)loc & (sizeof(*loc)-1)) != 0) ||
coleenp@548:              !Universe::heap()->is_in_or_null(*loc)) {
duke@435:             tty->print_cr("# Found non oop pointer.  Dumping state at failure");
duke@435:             // try to dump out some helpful debugging information
duke@435:             trace_codeblob_maps(fr, reg_map);
duke@435:             omv.print();
coleenp@548:             tty->print_cr("register r");
coleenp@548:             omv.reg()->print();
duke@435:             tty->print_cr("loc = %p *loc = %p\n", loc, (address)*loc);
duke@435:             // do the real assert.
duke@435:             assert(Universe::heap()->is_in_or_null(*loc), "found non oop pointer");
duke@435:           }
duke@435: #endif // ASSERT
duke@435:           oop_fn->do_oop(loc);
duke@435:         } else if ( omv.type() == OopMapValue::value_value ) {
kvn@1293:           assert((*loc) == (oop)NULL || !Universe::is_narrow_oop_base(*loc),
kvn@1293:                  "found invalid value pointer");
duke@435:           value_fn->do_oop(loc);
coleenp@548:         } else if ( omv.type() == OopMapValue::narrowoop_value ) {
coleenp@548:           narrowOop *nl = (narrowOop*)loc;
coleenp@548: #ifndef VM_LITTLE_ENDIAN
coleenp@548:           if (!omv.reg()->is_stack()) {
coleenp@548:             // compressed oops in registers only take up 4 bytes of an
coleenp@548:             // 8 byte register but they are in the wrong part of the
coleenp@548:             // word so adjust loc to point at the right place.
coleenp@548:             nl = (narrowOop*)((address)nl + 4);
coleenp@548:           }
coleenp@548: #endif
coleenp@548:           oop_fn->do_oop(nl);
duke@435:         }
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: // Update callee-saved register info for the following frame
duke@435: void OopMapSet::update_register_map(const frame *fr, RegisterMap *reg_map) {
duke@435:   ResourceMark rm;
duke@435:   CodeBlob* cb = fr->cb();
duke@435:   assert(cb != NULL, "no codeblob");
duke@435: 
duke@435:   // Any reg might be saved by a safepoint handler (see generate_handler_blob).
duke@435:   const int max_saved_on_entry_reg_count = ConcreteRegisterImpl::number_of_registers;
duke@435:   assert( reg_map->_update_for_id == NULL || fr->is_older(reg_map->_update_for_id),
duke@435:          "already updated this map; do not 'update' it twice!" );
duke@435:   debug_only(reg_map->_update_for_id = fr->id());
duke@435: 
duke@435:   // Check if caller must update oop argument
duke@435:   assert((reg_map->include_argument_oops() ||
duke@435:           !cb->caller_must_gc_arguments(reg_map->thread())),
duke@435:          "include_argument_oops should already be set");
duke@435: 
duke@435:   int nof_callee = 0;
duke@435:   oop*        locs[2*max_saved_on_entry_reg_count+1];
duke@435:   VMReg regs[2*max_saved_on_entry_reg_count+1];
duke@435:   // ("+1" because max_saved_on_entry_reg_count might be zero)
duke@435: 
duke@435:   // Scan through oopmap and find location of all callee-saved registers
duke@435:   // (we do not do update in place, since info could be overwritten)
duke@435: 
duke@435:   address pc = fr->pc();
duke@435: 
duke@435:   OopMap* map  = cb->oop_map_for_return_address(pc);
duke@435: 
duke@435:   assert(map != NULL, " no ptr map found");
duke@435: 
duke@435:   OopMapValue omv;
duke@435:   for(OopMapStream oms(map,OopMapValue::callee_saved_value); !oms.is_done(); oms.next()) {
duke@435:     omv = oms.current();
duke@435:     assert(nof_callee < 2*max_saved_on_entry_reg_count, "overflow");
duke@435:     regs[nof_callee] = omv.content_reg();
duke@435:     locs[nof_callee] = fr->oopmapreg_to_location(omv.reg(),reg_map);
duke@435:     nof_callee++;
duke@435:   }
duke@435: 
duke@435:   // Check that runtime stubs save all callee-saved registers
duke@435: #ifdef COMPILER2
duke@435:   assert(cb->is_compiled_by_c1() || !cb->is_runtime_stub() ||
duke@435:          (nof_callee >= SAVED_ON_ENTRY_REG_COUNT || nof_callee >= C_SAVED_ON_ENTRY_REG_COUNT),
duke@435:          "must save all");
duke@435: #endif // COMPILER2
duke@435: 
duke@435:   // Copy found callee-saved register to reg_map
duke@435:   for(int i = 0; i < nof_callee; i++) {
duke@435:     reg_map->set_location(regs[i], (address)locs[i]);
duke@435:   }
duke@435: }
duke@435: 
duke@435: //=============================================================================
duke@435: // Non-Product code
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: 
duke@435: bool OopMap::has_derived_pointer() const {
duke@435: #ifndef TIERED
duke@435:   COMPILER1_PRESENT(return false);
duke@435: #endif // !TIERED
duke@435: #ifdef COMPILER2
duke@435:   OopMapStream oms((OopMap*)this,OopMapValue::derived_oop_value);
duke@435:   return oms.is_done();
duke@435: #else
duke@435:   return false;
duke@435: #endif // COMPILER2
duke@435: }
duke@435: 
jrose@535: #endif //PRODUCT
duke@435: 
jrose@535: // Printing code is present in product build for -XX:+PrintAssembly.
jrose@535: 
jrose@535: static
jrose@535: void print_register_type(OopMapValue::oop_types x, VMReg optional,
jrose@535:                          outputStream* st) {
duke@435:   switch( x ) {
duke@435:   case OopMapValue::oop_value:
kvn@460:     st->print("Oop");
duke@435:     break;
duke@435:   case OopMapValue::value_value:
kvn@4478:     st->print("Value");
duke@435:     break;
coleenp@548:   case OopMapValue::narrowoop_value:
kvn@4478:     st->print("NarrowOop");
duke@435:     break;
duke@435:   case OopMapValue::callee_saved_value:
kvn@4478:     st->print("Callers_");
kvn@460:     optional->print_on(st);
duke@435:     break;
duke@435:   case OopMapValue::derived_oop_value:
kvn@4478:     st->print("Derived_oop_");
kvn@460:     optional->print_on(st);
duke@435:     break;
duke@435:   default:
duke@435:     ShouldNotReachHere();
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
kvn@460: void OopMapValue::print_on(outputStream* st) const {
kvn@460:   reg()->print_on(st);
kvn@460:   st->print("=");
kvn@460:   print_register_type(type(),content_reg(),st);
kvn@460:   st->print(" ");
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMap::print_on(outputStream* st) const {
duke@435:   OopMapValue omv;
jrose@535:   st->print("OopMap{");
duke@435:   for(OopMapStream oms((OopMap*)this); !oms.is_done(); oms.next()) {
duke@435:     omv = oms.current();
duke@435:     omv.print_on(st);
duke@435:   }
jrose@535:   st->print("off=%d}", (int) offset());
duke@435: }
duke@435: 
duke@435: 
duke@435: void OopMapSet::print_on(outputStream* st) const {
duke@435:   int i, len = om_count();
duke@435: 
duke@435:   st->print_cr("OopMapSet contains %d OopMaps\n",len);
duke@435: 
duke@435:   for( i = 0; i < len; i++) {
duke@435:     OopMap* m = at(i);
jrose@535:     st->print_cr("#%d ",i);
duke@435:     m->print_on(st);
jrose@535:     st->cr();
duke@435:   }
duke@435: }
jrose@535: 
duke@435: 
duke@435: 
duke@435: //------------------------------DerivedPointerTable---------------------------
duke@435: 
duke@435: #ifdef COMPILER2
duke@435: 
zgu@3900: class DerivedPointerEntry : public CHeapObj<mtCompiler> {
duke@435:  private:
duke@435:   oop*     _location; // Location of derived pointer (also pointing to the base)
duke@435:   intptr_t _offset;   // Offset from base pointer
duke@435:  public:
duke@435:   DerivedPointerEntry(oop* location, intptr_t offset) { _location = location; _offset = offset; }
duke@435:   oop* location()    { return _location; }
duke@435:   intptr_t  offset() { return _offset; }
duke@435: };
duke@435: 
duke@435: 
duke@435: GrowableArray<DerivedPointerEntry*>* DerivedPointerTable::_list = NULL;
duke@435: bool DerivedPointerTable::_active = false;
duke@435: 
duke@435: 
duke@435: void DerivedPointerTable::clear() {
duke@435:   // The first time, we create the list.  Otherwise it should be
duke@435:   // empty.  If not, then we have probably forgotton to call
duke@435:   // update_pointers after last GC/Scavenge.
duke@435:   assert (!_active, "should not be active");
duke@435:   assert(_list == NULL || _list->length() == 0, "table not empty");
duke@435:   if (_list == NULL) {
zgu@3900:     _list = new (ResourceObj::C_HEAP, mtCompiler) GrowableArray<DerivedPointerEntry*>(10, true); // Allocated on C heap
duke@435:   }
duke@435:   _active = true;
duke@435: }
duke@435: 
duke@435: 
duke@435: // Returns value of location as an int
hseigel@5784: intptr_t value_of_loc(oop *pointer) { return cast_from_oop<intptr_t>((*pointer)); }
duke@435: 
duke@435: 
duke@435: void DerivedPointerTable::add(oop *derived_loc, oop *base_loc) {
duke@435:   assert(Universe::heap()->is_in_or_null(*base_loc), "not an oop");
duke@435:   assert(derived_loc != base_loc, "Base and derived in same location");
duke@435:   if (_active) {
duke@435:     assert(*derived_loc != (oop)base_loc, "location already added");
duke@435:     assert(_list != NULL, "list must exist");
duke@435:     intptr_t offset = value_of_loc(derived_loc) - value_of_loc(base_loc);
never@2950:     // This assert is invalid because derived pointers can be
never@2950:     // arbitrarily far away from their base.
never@2950:     // assert(offset >= -1000000, "wrong derived pointer info");
duke@435: 
duke@435:     if (TraceDerivedPointers) {
duke@435:       tty->print_cr(
duke@435:         "Add derived pointer@" INTPTR_FORMAT
duke@435:         " - Derived: " INTPTR_FORMAT
duke@435:         " Base: " INTPTR_FORMAT " (@" INTPTR_FORMAT ") (Offset: %d)",
duke@435:         derived_loc, (address)*derived_loc, (address)*base_loc, base_loc, offset
duke@435:       );
duke@435:     }
duke@435:     // Set derived oop location to point to base.
duke@435:     *derived_loc = (oop)base_loc;
duke@435:     assert_lock_strong(DerivedPointerTableGC_lock);
duke@435:     DerivedPointerEntry *entry = new DerivedPointerEntry(derived_loc, offset);
duke@435:     _list->append(entry);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void DerivedPointerTable::update_pointers() {
duke@435:   assert(_list != NULL, "list must exist");
duke@435:   for(int i = 0; i < _list->length(); i++) {
duke@435:     DerivedPointerEntry* entry = _list->at(i);
duke@435:     oop* derived_loc = entry->location();
duke@435:     intptr_t offset  = entry->offset();
duke@435:     // The derived oop was setup to point to location of base
duke@435:     oop  base        = **(oop**)derived_loc;
duke@435:     assert(Universe::heap()->is_in_or_null(base), "must be an oop");
duke@435: 
duke@435:     *derived_loc = (oop)(((address)base) + offset);
duke@435:     assert(value_of_loc(derived_loc) - value_of_loc(&base) == offset, "sanity check");
duke@435: 
duke@435:     if (TraceDerivedPointers) {
duke@435:       tty->print_cr("Updating derived pointer@" INTPTR_FORMAT
duke@435:                     " - Derived: " INTPTR_FORMAT "  Base: " INTPTR_FORMAT " (Offset: %d)",
duke@435:           derived_loc, (address)*derived_loc, (address)base, offset);
duke@435:     }
duke@435: 
duke@435:     // Delete entry
duke@435:     delete entry;
duke@435:     _list->at_put(i, NULL);
duke@435:   }
duke@435:   // Clear list, so it is ready for next traversal (this is an invariant)
duke@435:   if (TraceDerivedPointers && !_list->is_empty()) {
duke@435:     tty->print_cr("--------------------------");
duke@435:   }
duke@435:   _list->clear();
duke@435:   _active = false;
duke@435: }
duke@435: 
duke@435: #endif // COMPILER2