2007-12-01 00:00:00 +00:00
|
|
|
/*
|
2010-11-23 13:22:55 -08:00
|
|
|
* Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
|
2007-12-01 00:00:00 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
|
*
|
|
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
|
* accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License version
|
|
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*
|
2010-05-27 19:08:38 -07:00
|
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
|
|
* questions.
|
2007-12-01 00:00:00 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#include "precompiled.hpp"
|
|
|
|
#include "ci/ciArrayKlass.hpp"
|
|
|
|
#include "ci/ciObjArrayKlass.hpp"
|
|
|
|
#include "ci/ciTypeArrayKlass.hpp"
|
|
|
|
#include "ci/ciUtilities.hpp"
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
// ciArrayKlass
|
|
|
|
//
|
|
|
|
// This class represents a klassOop in the HotSpot virtual machine
|
|
|
|
// whose Klass part in an arrayKlass.
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::ciArrayKlass
|
|
|
|
//
|
|
|
|
// Loaded array klass.
|
|
|
|
ciArrayKlass::ciArrayKlass(KlassHandle h_k) : ciKlass(h_k) {
|
|
|
|
assert(get_Klass()->oop_is_array(), "wrong type");
|
|
|
|
_dimension = get_arrayKlass()->dimension();
|
|
|
|
}
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::ciArrayKlass
|
|
|
|
//
|
|
|
|
// Unloaded array klass.
|
|
|
|
ciArrayKlass::ciArrayKlass(ciSymbol* name, int dimension, ciKlass* klass)
|
|
|
|
: ciKlass(name, klass) {
|
|
|
|
_dimension = dimension;
|
|
|
|
}
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::element_type
|
|
|
|
//
|
|
|
|
// What type is obtained when this array is indexed once?
|
|
|
|
ciType* ciArrayKlass::element_type() {
|
|
|
|
if (is_type_array_klass()) {
|
|
|
|
return ciType::make(as_type_array_klass()->element_type());
|
|
|
|
} else {
|
|
|
|
return as_obj_array_klass()->element_klass()->as_klass();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::base_element_type
|
|
|
|
//
|
|
|
|
// What type is obtained when this array is indexed as many times as possible?
|
|
|
|
ciType* ciArrayKlass::base_element_type() {
|
|
|
|
if (is_type_array_klass()) {
|
|
|
|
return ciType::make(as_type_array_klass()->element_type());
|
|
|
|
} else {
|
|
|
|
ciKlass* ek = as_obj_array_klass()->base_element_klass();
|
|
|
|
if (ek->is_type_array_klass()) {
|
|
|
|
return ciType::make(ek->as_type_array_klass()->element_type());
|
|
|
|
}
|
|
|
|
return ek;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::is_leaf_type
|
|
|
|
bool ciArrayKlass::is_leaf_type() {
|
|
|
|
if (is_type_array_klass()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
return as_obj_array_klass()->base_element_klass()->is_leaf_type();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ------------------------------------------------------------------
|
|
|
|
// ciArrayKlass::base_element_type
|
|
|
|
//
|
|
|
|
// What type is obtained when this array is indexed as many times as possible?
|
|
|
|
ciArrayKlass* ciArrayKlass::make(ciType* element_type) {
|
|
|
|
if (element_type->is_primitive_type()) {
|
|
|
|
return ciTypeArrayKlass::make(element_type->basic_type());
|
|
|
|
} else {
|
|
|
|
return ciObjArrayKlass::make(element_type->as_klass());
|
|
|
|
}
|
|
|
|
}
|