src/share/vm/oops/arrayKlassKlass.cpp

Sat, 30 Oct 2010 11:45:35 -0700

author
jrose
date
Sat, 30 Oct 2010 11:45:35 -0700
changeset 2265
d1896d1dda3e
parent 2068
7fcd5f39bd7a
child 2314
f95d63e2154a
permissions
-rw-r--r--

6981788: GC map generator sometimes picks up the wrong kind of instruction operand
Summary: Distinguish pool indexes from cache indexes in recently changed code.
Reviewed-by: never

     1 /*
     2  * Copyright (c) 1997, 2007, 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  */
    25 # include "incls/_precompiled.incl"
    26 # include "incls/_arrayKlassKlass.cpp.incl"
    29 klassOop arrayKlassKlass::create_klass(TRAPS) {
    30   arrayKlassKlass o;
    31   KlassHandle h_this_klass(THREAD, Universe::klassKlassObj());
    32   KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL);
    33   // Make sure size calculation is right
    34   assert(k()->size() == align_object_size(header_size()), "wrong size for object");
    35   java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror, make links
    36   return k();
    37 }
    39 bool arrayKlassKlass::oop_is_parsable(oop obj) const {
    40   assert(obj->is_klass(), "must be klass");
    41   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
    42   return (!ak->null_vtbl()) && ak->object_is_parsable();
    43 }
    45 void arrayKlassKlass::oop_follow_contents(oop obj) {
    46   assert(obj->is_klass(), "must be klass");
    47   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
    48   MarkSweep::mark_and_push(ak->adr_component_mirror());
    49   MarkSweep::mark_and_push(ak->adr_lower_dimension());
    50   MarkSweep::mark_and_push(ak->adr_higher_dimension());
    51   {
    52     HandleMark hm;
    53     ak->vtable()->oop_follow_contents();
    54   }
    55   klassKlass::oop_follow_contents(obj);
    56 }
    58 #ifndef SERIALGC
    59 void arrayKlassKlass::oop_follow_contents(ParCompactionManager* cm,
    60                                           oop obj) {
    61   assert(obj->is_klass(), "must be klass");
    62   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
    63   PSParallelCompact::mark_and_push(cm, ak->adr_component_mirror());
    64   PSParallelCompact::mark_and_push(cm, ak->adr_lower_dimension());
    65   PSParallelCompact::mark_and_push(cm, ak->adr_higher_dimension());
    66   {
    67     HandleMark hm;
    68     ak->vtable()->oop_follow_contents(cm);
    69   }
    70   klassKlass::oop_follow_contents(cm, obj);
    71 }
    72 #endif // SERIALGC
    75 int arrayKlassKlass::oop_adjust_pointers(oop obj) {
    76   assert(obj->is_klass(), "must be klass");
    77   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
    78   MarkSweep::adjust_pointer(ak->adr_component_mirror());
    79   MarkSweep::adjust_pointer(ak->adr_lower_dimension());
    80   MarkSweep::adjust_pointer(ak->adr_higher_dimension());
    81   {
    82     HandleMark hm;
    83     ak->vtable()->oop_adjust_pointers();
    84   }
    85   return klassKlass::oop_adjust_pointers(obj);
    86 }
    89 int arrayKlassKlass::oop_oop_iterate(oop obj, OopClosure* blk) {
    90   assert(obj->is_klass(), "must be klass");
    91   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
    92   blk->do_oop(ak->adr_component_mirror());
    93   blk->do_oop(ak->adr_lower_dimension());
    94   blk->do_oop(ak->adr_higher_dimension());
    95   ak->vtable()->oop_oop_iterate(blk);
    96   return klassKlass::oop_oop_iterate(obj, blk);
    97 }
   100 int arrayKlassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) {
   101   assert(obj->is_klass(), "must be klass");
   102   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
   103   blk->do_oop(ak->adr_component_mirror());
   104   blk->do_oop(ak->adr_lower_dimension());
   105   blk->do_oop(ak->adr_higher_dimension());
   106   ak->vtable()->oop_oop_iterate_m(blk, mr);
   107   return klassKlass::oop_oop_iterate_m(obj, blk, mr);
   108 }
   110 #ifndef SERIALGC
   111 void arrayKlassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
   112   assert(obj->blueprint()->oop_is_arrayKlass(),"must be an array klass");
   113 }
   115 int arrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
   116   assert(obj->is_klass(), "must be klass");
   117   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
   118   PSParallelCompact::adjust_pointer(ak->adr_component_mirror());
   119   PSParallelCompact::adjust_pointer(ak->adr_lower_dimension());
   120   PSParallelCompact::adjust_pointer(ak->adr_higher_dimension());
   121   {
   122     HandleMark hm;
   123     ak->vtable()->oop_update_pointers(cm);
   124   }
   125   return klassKlass::oop_update_pointers(cm, obj);
   126 }
   128 int
   129 arrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
   130                                      HeapWord* beg_addr, HeapWord* end_addr) {
   131   assert(obj->is_klass(), "must be klass");
   132   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
   134   oop* p;
   135   p = ak->adr_component_mirror();
   136   PSParallelCompact::adjust_pointer(p, beg_addr, end_addr);
   137   p = ak->adr_lower_dimension();
   138   PSParallelCompact::adjust_pointer(p, beg_addr, end_addr);
   139   p = ak->adr_higher_dimension();
   140   PSParallelCompact::adjust_pointer(p, beg_addr, end_addr);
   142   {
   143     HandleMark hm;
   144     ak->vtable()->oop_update_pointers(cm, beg_addr, end_addr);
   145   }
   146   return klassKlass::oop_update_pointers(cm, obj, beg_addr, end_addr);
   147 }
   148 #endif // SERIALGC
   150 // Printing
   152 void arrayKlassKlass::oop_print_on(oop obj, outputStream* st) {
   153   assert(obj->is_klass(), "must be klass");
   154   klassKlass::oop_print_on(obj, st);
   155 }
   157 void arrayKlassKlass::oop_print_value_on(oop obj, outputStream* st) {
   158   assert(obj->is_klass(), "must be klass");
   159   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
   160   for(int index = 0; index < ak->dimension(); index++) {
   161     st->print("[]");
   162   }
   163 }
   166 const char* arrayKlassKlass::internal_name() const {
   167   return "{array class}";
   168 }
   170 void arrayKlassKlass::oop_verify_on(oop obj, outputStream* st) {
   171   klassKlass::oop_verify_on(obj, st);
   173   arrayKlass* ak = arrayKlass::cast(klassOop(obj));
   174   if (!obj->partially_loaded()) {
   175     if (ak->component_mirror() != NULL)
   176       guarantee(ak->component_mirror()->klass(), "should have a class");
   177     if (ak->lower_dimension() != NULL)
   178       guarantee(ak->lower_dimension()->klass(), "should have a class");
   179     if (ak->higher_dimension() != NULL)
   180       guarantee(ak->higher_dimension()->klass(), "should have a class");
   181   }
   182 }

mercurial