Mon, 26 Apr 2010 23:59:45 -0700
6943485: JVMTI always on capabilities change code generation too much
Reviewed-by: twisti, dcubed
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1999-2005 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_ciArrayKlass.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | // ciArrayKlass |
duke@435 | 29 | // |
duke@435 | 30 | // This class represents a klassOop in the HotSpot virtual machine |
duke@435 | 31 | // whose Klass part in an arrayKlass. |
duke@435 | 32 | |
duke@435 | 33 | // ------------------------------------------------------------------ |
duke@435 | 34 | // ciArrayKlass::ciArrayKlass |
duke@435 | 35 | // |
duke@435 | 36 | // Loaded array klass. |
duke@435 | 37 | ciArrayKlass::ciArrayKlass(KlassHandle h_k) : ciKlass(h_k) { |
duke@435 | 38 | assert(get_Klass()->oop_is_array(), "wrong type"); |
duke@435 | 39 | _dimension = get_arrayKlass()->dimension(); |
duke@435 | 40 | } |
duke@435 | 41 | |
duke@435 | 42 | // ------------------------------------------------------------------ |
duke@435 | 43 | // ciArrayKlass::ciArrayKlass |
duke@435 | 44 | // |
duke@435 | 45 | // Unloaded array klass. |
duke@435 | 46 | ciArrayKlass::ciArrayKlass(ciSymbol* name, int dimension, ciKlass* klass) |
duke@435 | 47 | : ciKlass(name, klass) { |
duke@435 | 48 | _dimension = dimension; |
duke@435 | 49 | } |
duke@435 | 50 | |
duke@435 | 51 | // ------------------------------------------------------------------ |
duke@435 | 52 | // ciArrayKlass::element_type |
duke@435 | 53 | // |
duke@435 | 54 | // What type is obtained when this array is indexed once? |
duke@435 | 55 | ciType* ciArrayKlass::element_type() { |
duke@435 | 56 | if (is_type_array_klass()) { |
duke@435 | 57 | return ciType::make(as_type_array_klass()->element_type()); |
duke@435 | 58 | } else { |
duke@435 | 59 | return as_obj_array_klass()->element_klass()->as_klass(); |
duke@435 | 60 | } |
duke@435 | 61 | } |
duke@435 | 62 | |
duke@435 | 63 | |
duke@435 | 64 | // ------------------------------------------------------------------ |
duke@435 | 65 | // ciArrayKlass::base_element_type |
duke@435 | 66 | // |
duke@435 | 67 | // What type is obtained when this array is indexed as many times as possible? |
duke@435 | 68 | ciType* ciArrayKlass::base_element_type() { |
duke@435 | 69 | if (is_type_array_klass()) { |
duke@435 | 70 | return ciType::make(as_type_array_klass()->element_type()); |
duke@435 | 71 | } else { |
duke@435 | 72 | ciKlass* ek = as_obj_array_klass()->base_element_klass(); |
duke@435 | 73 | if (ek->is_type_array_klass()) { |
duke@435 | 74 | return ciType::make(ek->as_type_array_klass()->element_type()); |
duke@435 | 75 | } |
duke@435 | 76 | return ek; |
duke@435 | 77 | } |
duke@435 | 78 | } |
duke@435 | 79 | |
duke@435 | 80 | |
duke@435 | 81 | // ------------------------------------------------------------------ |
duke@435 | 82 | // ciArrayKlass::is_leaf_type |
duke@435 | 83 | bool ciArrayKlass::is_leaf_type() { |
duke@435 | 84 | if (is_type_array_klass()) { |
duke@435 | 85 | return true; |
duke@435 | 86 | } else { |
duke@435 | 87 | return as_obj_array_klass()->base_element_klass()->is_leaf_type(); |
duke@435 | 88 | } |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | |
duke@435 | 92 | // ------------------------------------------------------------------ |
duke@435 | 93 | // ciArrayKlass::base_element_type |
duke@435 | 94 | // |
duke@435 | 95 | // What type is obtained when this array is indexed as many times as possible? |
duke@435 | 96 | ciArrayKlass* ciArrayKlass::make(ciType* element_type) { |
duke@435 | 97 | if (element_type->is_primitive_type()) { |
duke@435 | 98 | return ciTypeArrayKlass::make(element_type->basic_type()); |
duke@435 | 99 | } else { |
duke@435 | 100 | return ciObjArrayKlass::make(element_type->as_klass()); |
duke@435 | 101 | } |
duke@435 | 102 | } |