Wed, 06 Jan 2010 22:21:39 -0800
Merge
duke@435 | 1 | /* |
xdono@1014 | 2 | * Copyright 1997-2009 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 | // A typeArrayKlass is the klass of a typeArray |
duke@435 | 26 | // It contains the type and size of the elements |
duke@435 | 27 | |
duke@435 | 28 | class typeArrayKlass : public arrayKlass { |
duke@435 | 29 | friend class VMStructs; |
duke@435 | 30 | private: |
duke@435 | 31 | jint _max_length; // maximum number of elements allowed in an array |
duke@435 | 32 | public: |
duke@435 | 33 | // instance variables |
duke@435 | 34 | jint max_length() { return _max_length; } |
duke@435 | 35 | void set_max_length(jint m) { _max_length = m; } |
duke@435 | 36 | |
duke@435 | 37 | // testers |
duke@435 | 38 | bool oop_is_typeArray_slow() const { return true; } |
duke@435 | 39 | |
duke@435 | 40 | // klass allocation |
duke@435 | 41 | DEFINE_ALLOCATE_PERMANENT(typeArrayKlass); |
jcoomes@916 | 42 | static klassOop create_klass(BasicType type, int scale, const char* name_str, |
jcoomes@916 | 43 | TRAPS); |
jcoomes@916 | 44 | static inline klassOop create_klass(BasicType type, int scale, TRAPS) { |
jcoomes@916 | 45 | return create_klass(type, scale, external_name(type), CHECK_NULL); |
jcoomes@916 | 46 | } |
duke@435 | 47 | |
duke@435 | 48 | int oop_size(oop obj) const; |
duke@435 | 49 | int klass_oop_size() const { return object_size(); } |
duke@435 | 50 | |
duke@435 | 51 | bool compute_is_subtype_of(klassOop k); |
duke@435 | 52 | |
duke@435 | 53 | // Allocation |
duke@435 | 54 | typeArrayOop allocate(int length, TRAPS); |
duke@435 | 55 | typeArrayOop allocate_permanent(int length, TRAPS); // used for class file structures |
duke@435 | 56 | oop multi_allocate(int rank, jint* sizes, TRAPS); |
duke@435 | 57 | |
duke@435 | 58 | // Copying |
duke@435 | 59 | void copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS); |
duke@435 | 60 | |
duke@435 | 61 | // Iteration |
duke@435 | 62 | int oop_oop_iterate(oop obj, OopClosure* blk); |
duke@435 | 63 | int oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr); |
duke@435 | 64 | |
duke@435 | 65 | // Garbage collection |
duke@435 | 66 | void oop_follow_contents(oop obj); |
duke@435 | 67 | int oop_adjust_pointers(oop obj); |
duke@435 | 68 | |
duke@435 | 69 | // Parallel Scavenge and Parallel Old |
duke@435 | 70 | PARALLEL_GC_DECLS |
duke@435 | 71 | |
duke@435 | 72 | protected: |
duke@435 | 73 | // Find n'th dimensional array |
duke@435 | 74 | virtual klassOop array_klass_impl(bool or_null, int n, TRAPS); |
duke@435 | 75 | |
duke@435 | 76 | // Returns the array class with this class as element type |
duke@435 | 77 | virtual klassOop array_klass_impl(bool or_null, TRAPS); |
duke@435 | 78 | |
duke@435 | 79 | public: |
duke@435 | 80 | // Casting from klassOop |
duke@435 | 81 | static typeArrayKlass* cast(klassOop k) { |
duke@435 | 82 | assert(k->klass_part()->oop_is_typeArray_slow(), "cast to typeArrayKlass"); |
duke@435 | 83 | return (typeArrayKlass*) k->klass_part(); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | // Naming |
duke@435 | 87 | static const char* external_name(BasicType type); |
duke@435 | 88 | |
duke@435 | 89 | // Sizing |
duke@435 | 90 | static int header_size() { return oopDesc::header_size() + sizeof(typeArrayKlass)/HeapWordSize; } |
duke@435 | 91 | int object_size() const { return arrayKlass::object_size(header_size()); } |
duke@435 | 92 | |
duke@435 | 93 | // Initialization (virtual from Klass) |
duke@435 | 94 | void initialize(TRAPS); |
duke@435 | 95 | |
duke@435 | 96 | private: |
duke@435 | 97 | // Helpers |
duke@435 | 98 | static klassOop array_klass_impl(typeArrayKlassHandle h_this, bool or_null, int n, TRAPS); |
duke@435 | 99 | |
duke@435 | 100 | #ifndef PRODUCT |
duke@435 | 101 | public: |
duke@435 | 102 | // Printing |
duke@435 | 103 | void oop_print_on(oop obj, outputStream* st); |
duke@435 | 104 | #endif |
duke@435 | 105 | public: |
duke@435 | 106 | const char* internal_name() const; |
duke@435 | 107 | }; |