--- old/hotspot/src/share/vm/oops/objArrayOop.hpp 2009-08-01 04:13:09.597424353 +0100 +++ new/hotspot/src/share/vm/oops/objArrayOop.hpp 2009-08-01 04:13:09.522731857 +0100 @@ -2,7 +2,7 @@ #pragma ident "@(#)objArrayOop.hpp 1.29 07/05/05 17:06:07 JVM" #endif /* - * Copyright 1997-2003 Sun Microsystems, Inc. All Rights Reserved. + * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it @@ -29,20 +29,69 @@ // Evaluating "String arg[10]" will create an objArrayOop. class objArrayOopDesc : public arrayOopDesc { + friend class objArrayKlass; + friend class Runtime1; + friend class psPromotionManager; + friend class CSMarkOopClosure; + friend class G1ParScanPartialArrayClosure; + + template T* obj_at_addr(int index) const { + assert(is_within_bounds(index), "index out of bounds"); + return &((T*)base())[index]; + } + public: + // base is the address following the header. + HeapWord* base() const { return (HeapWord*) arrayOopDesc::base(T_OBJECT); } + // Accessing - oop obj_at(int index) const { return *obj_at_addr(index); } - void obj_at_put(int index, oop value) { oop_store(obj_at_addr(index), value); } - oop* base() const { return (oop*) arrayOopDesc::base(T_OBJECT); } + oop obj_at(int index) const { + // With UseCompressedOops decode the narrow oop in the objArray to an + // uncompressed oop. Otherwise this is simply a "*" operator. + if (UseCompressedOops) { + return load_decode_heap_oop(obj_at_addr(index)); + } else { + return load_decode_heap_oop(obj_at_addr(index)); + } + } + void obj_at_put(int index, oop value) { + if (UseCompressedOops) { + oop_store(obj_at_addr(index), value); + } else { + oop_store(obj_at_addr(index), value); + } + } // Sizing - static int header_size() { return arrayOopDesc::header_size(T_OBJECT); } - static int object_size(int length) { return align_object_size(header_size() + length); } - int object_size() { return object_size(length()); } + static int header_size() { return arrayOopDesc::header_size(T_OBJECT); } + int object_size() { return object_size(length()); } + int array_size() { return array_size(length()); } - // Returns the address of the index'th element - oop* obj_at_addr(int index) const { - assert(is_within_bounds(index), "index out of bounds"); - return &base()[index]; + static int object_size(int length) { + // This returns the object size in HeapWords. + return align_object_size(header_size() + array_size(length)); + } + + // Give size of objArrayOop in HeapWords minus the header + static int array_size(int length) { + // Without UseCompressedOops, this is simply: + // oop->length() * HeapWordsPerOop; + // With narrowOops, HeapWordsPerOop is 1/2 or equal 0 as an integer. + // The oop elements are aligned up to wordSize + const int HeapWordsPerOop = heapOopSize/HeapWordSize; + if (HeapWordsPerOop > 0) { + return length * HeapWordsPerOop; + } else { + const int OopsPerHeapWord = HeapWordSize/heapOopSize; + int word_len = align_size_up(length, OopsPerHeapWord)/OopsPerHeapWord; + return word_len; + } } + + // special iterators for index ranges, returns size of object +#define ObjArrayOop_OOP_ITERATE_DECL(OopClosureType, nv_suffix) \ + int oop_iterate_range(OopClosureType* blk, int start, int end); + + ALL_OOP_OOP_ITERATE_CLOSURES_1(ObjArrayOop_OOP_ITERATE_DECL) + ALL_OOP_OOP_ITERATE_CLOSURES_2(ObjArrayOop_OOP_ITERATE_DECL) };