1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/oops/objArrayKlass.inline.hpp Wed Mar 03 14:48:26 2010 -0800
1.3 @@ -0,0 +1,89 @@
1.4 +/*
1.5 + * Copyright 2010 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
1.24 + * have any questions.
1.25 + *
1.26 + */
1.27 +
1.28 +void objArrayKlass::oop_follow_contents(oop obj, int index) {
1.29 + if (UseCompressedOops) {
1.30 + objarray_follow_contents<narrowOop>(obj, index);
1.31 + } else {
1.32 + objarray_follow_contents<oop>(obj, index);
1.33 + }
1.34 +}
1.35 +
1.36 +template <class T>
1.37 +void objArrayKlass::objarray_follow_contents(oop obj, int index) {
1.38 + objArrayOop a = objArrayOop(obj);
1.39 + const size_t len = size_t(a->length());
1.40 + const size_t beg_index = size_t(index);
1.41 + assert(beg_index < len || len == 0, "index too large");
1.42 +
1.43 + const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);
1.44 + const size_t end_index = beg_index + stride;
1.45 + T* const base = (T*)a->base();
1.46 + T* const beg = base + beg_index;
1.47 + T* const end = base + end_index;
1.48 +
1.49 + // Push the non-NULL elements of the next stride on the marking stack.
1.50 + for (T* e = beg; e < end; e++) {
1.51 + MarkSweep::mark_and_push<T>(e);
1.52 + }
1.53 +
1.54 + if (end_index < len) {
1.55 + MarkSweep::push_objarray(a, end_index); // Push the continuation.
1.56 + }
1.57 +}
1.58 +
1.59 +#ifndef SERIALGC
1.60 +void objArrayKlass::oop_follow_contents(ParCompactionManager* cm, oop obj,
1.61 + int index) {
1.62 + if (UseCompressedOops) {
1.63 + objarray_follow_contents<narrowOop>(cm, obj, index);
1.64 + } else {
1.65 + objarray_follow_contents<oop>(cm, obj, index);
1.66 + }
1.67 +}
1.68 +
1.69 +template <class T>
1.70 +void objArrayKlass::objarray_follow_contents(ParCompactionManager* cm, oop obj,
1.71 + int index) {
1.72 + objArrayOop a = objArrayOop(obj);
1.73 + const size_t len = size_t(a->length());
1.74 + const size_t beg_index = size_t(index);
1.75 + assert(beg_index < len || len == 0, "index too large");
1.76 +
1.77 + const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);
1.78 + const size_t end_index = beg_index + stride;
1.79 + T* const base = (T*)a->base();
1.80 + T* const beg = base + beg_index;
1.81 + T* const end = base + end_index;
1.82 +
1.83 + // Push the non-NULL elements of the next stride on the marking stack.
1.84 + for (T* e = beg; e < end; e++) {
1.85 + PSParallelCompact::mark_and_push<T>(cm, e);
1.86 + }
1.87 +
1.88 + if (end_index < len) {
1.89 + cm->push_objarray(a, end_index); // Push the continuation.
1.90 + }
1.91 +}
1.92 +#endif // #ifndef SERIALGC
