arrayKlass.hpp revision 0
3980N/A/*
3980N/A * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
3980N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3980N/A *
3980N/A * This code is free software; you can redistribute it and/or modify it
3980N/A * under the terms of the GNU General Public License version 2 only, as
3980N/A * published by the Free Software Foundation.
3980N/A *
3980N/A * This code is distributed in the hope that it will be useful, but WITHOUT
3980N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
3980N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
3980N/A * version 2 for more details (a copy is included in the LICENSE file that
3980N/A * accompanied this code).
3980N/A *
4722N/A * You should have received a copy of the GNU General Public License version
3980N/A * 2 along with this work; if not, write to the Free Software Foundation,
3980N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
3980N/A *
3980N/A * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
3980N/A * CA 95054 USA or visit www.sun.com if you need additional information or
3980N/A * have any questions.
3980N/A *
3980N/A */
3980N/A
3980N/A// arrayKlass is the abstract baseclass for all array classes
3980N/A
3980N/Aclass arrayKlass: public Klass {
3980N/A friend class VMStructs;
private:
int _dimension; // This is n'th-dimensional array.
klassOop _higher_dimension; // Refers the (n+1)'th-dimensional array (if present).
klassOop _lower_dimension; // Refers the (n-1)'th-dimensional array (if present).
int _vtable_len; // size of vtable for this klass
juint _alloc_size; // allocation profiling support
oop _component_mirror; // component type, as a java/lang/Class
public:
// Testing operation
bool oop_is_array() const { return true; }
// Instance variables
int dimension() const { return _dimension; }
void set_dimension(int dimension) { _dimension = dimension; }
klassOop higher_dimension() const { return _higher_dimension; }
void set_higher_dimension(klassOop k) { oop_store_without_check((oop*) &_higher_dimension, (oop) k); }
oop* adr_higher_dimension() { return (oop*)&this->_higher_dimension;}
klassOop lower_dimension() const { return _lower_dimension; }
void set_lower_dimension(klassOop k) { oop_store_without_check((oop*) &_lower_dimension, (oop) k); }
oop* adr_lower_dimension() { return (oop*)&this->_lower_dimension;}
// Allocation profiling support
juint alloc_size() const { return _alloc_size; }
void set_alloc_size(juint n) { _alloc_size = n; }
// offset of first element, including any padding for the sake of alignment
int array_header_in_bytes() const { return layout_helper_header_size(layout_helper()); }
int log2_element_size() const { return layout_helper_log2_element_size(layout_helper()); }
// type of elements (T_OBJECT for both oop arrays and array-arrays)
BasicType element_type() const { return layout_helper_element_type(layout_helper()); }
oop component_mirror() const { return _component_mirror; }
void set_component_mirror(oop m) { oop_store((oop*) &_component_mirror, m); }
oop* adr_component_mirror() { return (oop*)&this->_component_mirror;}
// Compiler/Interpreter offset
static ByteSize component_mirror_offset() { return byte_offset_of(arrayKlass, _component_mirror); }
virtual klassOop java_super() const;//{ return SystemDictionary::object_klass(); }
// Allocation
// Sizes points to the first dimension of the array, subsequent dimensions
// are always in higher memory. The callers of these set that up.
virtual oop multi_allocate(int rank, jint* sizes, TRAPS);
objArrayOop allocate_arrayArray(int n, int length, TRAPS);
// Lookup operations
methodOop uncached_lookup_method(symbolOop name, symbolOop signature) const;
// Casting from klassOop
static arrayKlass* cast(klassOop k) {
Klass* kp = k->klass_part();
assert(kp->null_vtbl() || kp->oop_is_array(), "cast to arrayKlass");
return (arrayKlass*) kp;
}
objArrayOop compute_secondary_supers(int num_extra_slots, TRAPS);
bool compute_is_subtype_of(klassOop k);
// Sizing
static int header_size() { return oopDesc::header_size() + sizeof(arrayKlass)/HeapWordSize; }
int object_size(int header_size) const;
bool object_is_parsable() const { return _vtable_len > 0; }
// Java vtable
klassVtable* vtable() const; // return new klassVtable
int vtable_length() const { return _vtable_len; }
static int base_vtable_length() { return Universe::base_vtable_size(); }
void set_vtable_length(int len) { assert(len == base_vtable_length(), "bad length"); _vtable_len = len; }
protected:
inline intptr_t* start_of_vtable() const;
public:
// Iterators
void array_klasses_do(void f(klassOop k));
void with_array_klasses_do(void f(klassOop k));
// Shared creation method
static arrayKlassHandle base_create_array_klass(
const Klass_vtbl& vtbl,
int header_size, KlassHandle klass,
TRAPS);
// Return a handle.
static void complete_create_array_klass(arrayKlassHandle k, KlassHandle super_klass, TRAPS);
public:
// jvm support
jint compute_modifier_flags(TRAPS) const;
public:
// JVMTI support
jint jvmti_class_status() const;
#ifndef PRODUCT
public:
// Printing
void oop_print_on(oop obj, outputStream* st);
#endif
public:
// Verification
void oop_verify_on(oop obj, outputStream* st);
};