Wed, 27 Apr 2016 01:25:04 +0800
Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #include "precompiled.hpp" |
aoqi@0 | 26 | #include "ci/ciArrayKlass.hpp" |
aoqi@0 | 27 | #include "ci/ciObjArrayKlass.hpp" |
aoqi@0 | 28 | #include "ci/ciTypeArrayKlass.hpp" |
aoqi@0 | 29 | #include "ci/ciUtilities.hpp" |
aoqi@0 | 30 | |
aoqi@0 | 31 | // ciArrayKlass |
aoqi@0 | 32 | // |
aoqi@0 | 33 | // This class represents a Klass* in the HotSpot virtual machine |
aoqi@0 | 34 | // whose Klass part in an ArrayKlass. |
aoqi@0 | 35 | |
aoqi@0 | 36 | // ------------------------------------------------------------------ |
aoqi@0 | 37 | // ciArrayKlass::ciArrayKlass |
aoqi@0 | 38 | // |
aoqi@0 | 39 | // Loaded array klass. |
aoqi@0 | 40 | ciArrayKlass::ciArrayKlass(KlassHandle h_k) : ciKlass(h_k) { |
aoqi@0 | 41 | assert(get_Klass()->oop_is_array(), "wrong type"); |
aoqi@0 | 42 | _dimension = get_ArrayKlass()->dimension(); |
aoqi@0 | 43 | } |
aoqi@0 | 44 | |
aoqi@0 | 45 | // ------------------------------------------------------------------ |
aoqi@0 | 46 | // ciArrayKlass::ciArrayKlass |
aoqi@0 | 47 | // |
aoqi@0 | 48 | // Unloaded array klass. |
aoqi@0 | 49 | ciArrayKlass::ciArrayKlass(ciSymbol* name, int dimension, BasicType bt) |
aoqi@0 | 50 | : ciKlass(name, bt) { |
aoqi@0 | 51 | _dimension = dimension; |
aoqi@0 | 52 | } |
aoqi@0 | 53 | |
aoqi@0 | 54 | // ------------------------------------------------------------------ |
aoqi@0 | 55 | // ciArrayKlass::element_type |
aoqi@0 | 56 | // |
aoqi@0 | 57 | // What type is obtained when this array is indexed once? |
aoqi@0 | 58 | ciType* ciArrayKlass::element_type() { |
aoqi@0 | 59 | if (is_type_array_klass()) { |
aoqi@0 | 60 | return ciType::make(as_type_array_klass()->element_type()); |
aoqi@0 | 61 | } else { |
aoqi@0 | 62 | return as_obj_array_klass()->element_klass()->as_klass(); |
aoqi@0 | 63 | } |
aoqi@0 | 64 | } |
aoqi@0 | 65 | |
aoqi@0 | 66 | |
aoqi@0 | 67 | // ------------------------------------------------------------------ |
aoqi@0 | 68 | // ciArrayKlass::base_element_type |
aoqi@0 | 69 | // |
aoqi@0 | 70 | // What type is obtained when this array is indexed as many times as possible? |
aoqi@0 | 71 | ciType* ciArrayKlass::base_element_type() { |
aoqi@0 | 72 | if (is_type_array_klass()) { |
aoqi@0 | 73 | return ciType::make(as_type_array_klass()->element_type()); |
aoqi@0 | 74 | } else { |
aoqi@0 | 75 | ciKlass* ek = as_obj_array_klass()->base_element_klass(); |
aoqi@0 | 76 | if (ek->is_type_array_klass()) { |
aoqi@0 | 77 | return ciType::make(ek->as_type_array_klass()->element_type()); |
aoqi@0 | 78 | } |
aoqi@0 | 79 | return ek; |
aoqi@0 | 80 | } |
aoqi@0 | 81 | } |
aoqi@0 | 82 | |
aoqi@0 | 83 | |
aoqi@0 | 84 | // ------------------------------------------------------------------ |
aoqi@0 | 85 | // ciArrayKlass::is_leaf_type |
aoqi@0 | 86 | bool ciArrayKlass::is_leaf_type() { |
aoqi@0 | 87 | if (is_type_array_klass()) { |
aoqi@0 | 88 | return true; |
aoqi@0 | 89 | } else { |
aoqi@0 | 90 | return as_obj_array_klass()->base_element_klass()->is_leaf_type(); |
aoqi@0 | 91 | } |
aoqi@0 | 92 | } |
aoqi@0 | 93 | |
aoqi@0 | 94 | |
aoqi@0 | 95 | // ------------------------------------------------------------------ |
aoqi@0 | 96 | // ciArrayKlass::base_element_type |
aoqi@0 | 97 | // |
aoqi@0 | 98 | // What type is obtained when this array is indexed as many times as possible? |
aoqi@0 | 99 | ciArrayKlass* ciArrayKlass::make(ciType* element_type) { |
aoqi@0 | 100 | if (element_type->is_primitive_type()) { |
aoqi@0 | 101 | return ciTypeArrayKlass::make(element_type->basic_type()); |
aoqi@0 | 102 | } else { |
aoqi@0 | 103 | return ciObjArrayKlass::make(element_type->as_klass()); |
aoqi@0 | 104 | } |
aoqi@0 | 105 | } |