1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/src/share/vm/oops/objArrayOop.hpp Wed Apr 27 01:25:04 2016 +0800 1.3 @@ -0,0 +1,119 @@ 1.4 +/* 1.5 + * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. 1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1.7 + * 1.8 + * This code is free software; you can redistribute it and/or modify it 1.9 + * under the terms of the GNU General Public License version 2 only, as 1.10 + * published by the Free Software Foundation. 1.11 + * 1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT 1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1.15 + * version 2 for more details (a copy is included in the LICENSE file that 1.16 + * accompanied this code). 1.17 + * 1.18 + * You should have received a copy of the GNU General Public License version 1.19 + * 2 along with this work; if not, write to the Free Software Foundation, 1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1.21 + * 1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 1.23 + * or visit www.oracle.com if you need additional information or have any 1.24 + * questions. 1.25 + * 1.26 + */ 1.27 + 1.28 +#ifndef SHARE_VM_OOPS_OBJARRAYOOP_HPP 1.29 +#define SHARE_VM_OOPS_OBJARRAYOOP_HPP 1.30 + 1.31 +#include "oops/arrayOop.hpp" 1.32 + 1.33 +// An objArrayOop is an array containing oops. 1.34 +// Evaluating "String arg[10]" will create an objArrayOop. 1.35 + 1.36 +class objArrayOopDesc : public arrayOopDesc { 1.37 + friend class ObjArrayKlass; 1.38 + friend class Runtime1; 1.39 + friend class psPromotionManager; 1.40 + friend class CSetMarkOopClosure; 1.41 + friend class G1ParScanPartialArrayClosure; 1.42 + 1.43 + template <class T> T* obj_at_addr(int index) const { 1.44 + assert(is_within_bounds(index), "index out of bounds"); 1.45 + return &((T*)base())[index]; 1.46 + } 1.47 + 1.48 +private: 1.49 + // Give size of objArrayOop in HeapWords minus the header 1.50 + static int array_size(int length) { 1.51 + const int OopsPerHeapWord = HeapWordSize/heapOopSize; 1.52 + assert(OopsPerHeapWord >= 1 && (HeapWordSize % heapOopSize == 0), 1.53 + "Else the following (new) computation would be in error"); 1.54 +#ifdef ASSERT 1.55 + // The old code is left in for sanity-checking; it'll 1.56 + // go away pretty soon. XXX 1.57 + // Without UseCompressedOops, this is simply: 1.58 + // oop->length() * HeapWordsPerOop; 1.59 + // With narrowOops, HeapWordsPerOop is 1/2 or equal 0 as an integer. 1.60 + // The oop elements are aligned up to wordSize 1.61 + const int HeapWordsPerOop = heapOopSize/HeapWordSize; 1.62 + int old_res; 1.63 + if (HeapWordsPerOop > 0) { 1.64 + old_res = length * HeapWordsPerOop; 1.65 + } else { 1.66 + old_res = align_size_up(length, OopsPerHeapWord)/OopsPerHeapWord; 1.67 + } 1.68 +#endif // ASSERT 1.69 + int res = ((uint)length + OopsPerHeapWord - 1)/OopsPerHeapWord; 1.70 + assert(res == old_res, "Inconsistency between old and new."); 1.71 + return res; 1.72 + } 1.73 + 1.74 + public: 1.75 + // Returns the offset of the first element. 1.76 + static int base_offset_in_bytes() { 1.77 + return arrayOopDesc::base_offset_in_bytes(T_OBJECT); 1.78 + } 1.79 + 1.80 + // base is the address following the header. 1.81 + HeapWord* base() const { return (HeapWord*) arrayOopDesc::base(T_OBJECT); } 1.82 + 1.83 + // Accessing 1.84 + oop obj_at(int index) const { 1.85 + // With UseCompressedOops decode the narrow oop in the objArray to an 1.86 + // uncompressed oop. Otherwise this is simply a "*" operator. 1.87 + if (UseCompressedOops) { 1.88 + return load_decode_heap_oop(obj_at_addr<narrowOop>(index)); 1.89 + } else { 1.90 + return load_decode_heap_oop(obj_at_addr<oop>(index)); 1.91 + } 1.92 + } 1.93 + 1.94 + void obj_at_put(int index, oop value) { 1.95 + if (UseCompressedOops) { 1.96 + oop_store(obj_at_addr<narrowOop>(index), value); 1.97 + } else { 1.98 + oop_store(obj_at_addr<oop>(index), value); 1.99 + } 1.100 + } 1.101 + // Sizing 1.102 + static int header_size() { return arrayOopDesc::header_size(T_OBJECT); } 1.103 + int object_size() { return object_size(length()); } 1.104 + 1.105 + static int object_size(int length) { 1.106 + // This returns the object size in HeapWords. 1.107 + uint asz = array_size(length); 1.108 + uint osz = align_object_size(header_size() + asz); 1.109 + assert(osz >= asz, "no overflow"); 1.110 + assert((int)osz > 0, "no overflow"); 1.111 + return (int)osz; 1.112 + } 1.113 + 1.114 + // special iterators for index ranges, returns size of object 1.115 +#define ObjArrayOop_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ 1.116 + int oop_iterate_range(OopClosureType* blk, int start, int end); 1.117 + 1.118 + ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayOop_OOP_ITERATE_DECL) 1.119 + ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayOop_OOP_ITERATE_DECL) 1.120 +}; 1.121 + 1.122 +#endif // SHARE_VM_OOPS_OBJARRAYOOP_HPP