vm/oops/memOopKlass.cpp

   1 /* Copyright 1994, 1995 LongView Technologies L.L.C. $Revision: 1.37 $ */
   2 /* Copyright (c) 2006, Sun Microsystems, Inc.
   3 All rights reserved.
   4
   5 Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
   6 following conditions are met:
   7
   8     * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
   9     * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following
  10           disclaimer in the documentation and/or other materials provided with the distribution.
  11     * Neither the name of Sun Microsystems nor the names of its contributors may be used to endorse or promote products derived
  12           from this software without specific prior written permission.
  13
  14 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT
  15 NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
  16 THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  17 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  18 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
  19 OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
  20
  21
  22 */
  23
  24 # include "incls/_precompiled.incl"
  25 # include "incls/_memOopKlass.cpp.incl"
  26
  27 void set_memOopKlass_vtbl(Klass* k) {
  28   memOopKlass o;
  29   k->set_vtbl_value(o.vtbl_value());
  30 }
  31
  32 int memOopKlass::oop_scavenge_contents(oop obj) {
  33   int size = non_indexable_size();
  34   // header
  35   memOop(obj)->scavenge_header();
  36   // instance variables
  37   memOop(obj)->scavenge_body(memOopDesc::header_size(), size);
  38   return size;
  39 }
  40
  41 int memOopKlass::oop_scavenge_tenured_contents(oop obj) {
  42   int size = non_indexable_size();
  43   // header
  44   memOop(obj)->scavenge_tenured_header();
  45   // instance variables
  46   memOop(obj)->scavenge_tenured_body(memOopDesc::header_size(), size);
  47   return size;
  48 }
  49
  50 void memOopKlass::oop_follow_contents(oop obj) {
  51   // header
  52   memOop(obj)->follow_header();
  53   // instance variables
  54   memOop(obj)->follow_body(memOopDesc::header_size(), non_indexable_size());
  55 }
  56
  57 bool memOopKlass::oop_verify(oop obj) {
  58   return Universe::verify_oop(memOop(obj));
  59 }
  60
  61 void memOopKlass::oop_layout_iterate(oop obj, ObjectLayoutClosure* blk) {
  62   // header
  63   memOop(obj)->layout_iterate_header(blk);
  64   // instance variables
  65   memOop(obj)->layout_iterate_body(blk, memOopDesc::header_size(), non_indexable_size());
  66 }
  67
  68 void memOopKlass::oop_oop_iterate(oop obj, OopClosure* blk) {
  69   // header
  70   memOop(obj)->oop_iterate_header(blk);
  71   // instance variables
  72   memOop(obj)->oop_iterate_body(blk, memOopDesc::header_size(), non_indexable_size());
  73 }
  74
  75 void memOopKlass::oop_print_on(oop obj, outputStream* st) {
  76   PrintObjectClosure blk(st);
  77   blk.do_object(memOop(obj));
  78   memOop(obj)->layout_iterate(&blk);
  79 }
  80
  81 void memOopKlass::oop_print_value_on(oop obj, outputStream* st) {
  82        if (obj == nilObj)   st->print("nil");
  83   else if (obj == trueObj)  st->print("true");
  84   else if (obj == falseObj) st->print("false");
  85   else {
  86     if (PrintObjectID) {
  87       memOop(obj)->print_id_on(st);
  88       st->print("-");
  89     }
  90     print_name_on(st);
  91   }
  92   if (PrintOopAddress) st->print(" (%#x)", this);
  93 }
  94
  95 oop memOopKlass::allocateObject() {
  96   klassOop k    = as_klassOop();
  97   int      size = non_indexable_size();
  98   // allocate
  99   memOop obj = as_memOop(Universe::allocate(size, (memOop*)&k));
 100   // header
 101   obj->initialize_header(has_untagged_contents(), k);
 102   // instance variables
 103   obj->initialize_body(memOopDesc::header_size(), size);
 104   return obj;
 105 }
 106
 107 oop memOopKlass::allocateObjectSize(int size) {
 108   return markSymbol(vmSymbols::not_indexable());
 109 }
 110
 111 klassOop memOopKlass::create_subclass(mixinOop mixin, Format format) {
 112   assert(can_be_subclassed(), "must be able to subclass this");
 113   if (format == mem_klass)             return memOopKlass::create_class(as_klassOop(), mixin);
 114
 115   if (format == objArray_klass)        return objArrayKlass::create_class(as_klassOop(), mixin);
 116   if (format == byteArray_klass)       return byteArrayKlass::create_class(as_klassOop(), mixin);
 117   if (format == doubleByteArray_klass) return doubleByteArrayKlass::create_class(as_klassOop(), mixin);
 118   if (format == weakArray_klass)       return weakArrayKlass::create_class(as_klassOop(), mixin);
 119
 120   if (number_of_instance_variables() > 0) {
 121     warning("super class has instance variables when mixing in special mixin");
 122     return NULL;
 123   }
 124
 125   if (format == mixin_klass)           return mixinKlass::create_class(as_klassOop(), mixin);
 126   if (format == proxy_klass)           return proxyKlass::create_class(as_klassOop(), mixin);
 127   if (format == process_klass)         return processKlass::create_class(as_klassOop(), mixin);
 128   return NULL;
 129 }
 130
 131 klassOop memOopKlass::create_class(klassOop super_class, mixinOop mixin) {
 132   memOopKlass o;
 133   return create_generic_class(super_class, mixin, o.vtbl_value());
 134 }
 135
 136 oop memOopKlass::oop_shallow_copy(oop obj, bool tenured) {
 137   // Do not copy oddballs (nil, true, false)
 138   if (obj == nilObj)   return obj;
 139   if (obj == trueObj)  return obj;
 140   if (obj == falseObj) return obj;
 141
 142   int  len   = memOop(obj)->size();
 143   // Important to preserve obj (in case of scavenge).
 144   oop* clone = tenured ? Universe::allocate_tenured(len) : Universe::allocate(len, (memOop*)&obj);
 145   oop* to    = clone;
 146   oop* from  = (oop*) memOop(obj)->addr();
 147   oop* end   = to + len;
 148   while (to < end) *to++ = *from++;
 149
 150   if (!as_memOop(clone)->is_new()) {
 151     // Remember to update the remembered set if the clone is in old space.
 152     // Note:
 153     //   should we do something special for arrays.
 154     Universe::remembered_set->record_store(clone);
 155   }
 156   return as_memOop(clone);
 157 }