Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/oops/objArrayKlass.inline.hpp@f90c822e73f8 (annotated)
src/share/vm/oops/objArrayKlass.inline.hpp
Wed, 27 Apr 2016 01:25:04 +0800
- author
- aoqi
- date
- Wed, 27 Apr 2016 01:25:04 +0800
- changeset 0
- f90c822e73f8
- child 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | #ifndef SHARE_VM_OOPS_OBJARRAYKLASS_INLINE_HPP |
| aoqi@0 | 26 | #define SHARE_VM_OOPS_OBJARRAYKLASS_INLINE_HPP |
| aoqi@0 | 27 | |
| aoqi@0 | 28 | #include "gc_implementation/shared/markSweep.inline.hpp" |
| aoqi@0 | 29 | #include "oops/objArrayKlass.hpp" |
| aoqi@0 | 30 | #include "utilities/macros.hpp" |
| aoqi@0 | 31 | #if INCLUDE_ALL_GCS |
| aoqi@0 | 32 | #include "gc_implementation/parallelScavenge/psCompactionManager.inline.hpp" |
| aoqi@0 | 33 | #include "gc_implementation/parallelScavenge/psParallelCompact.hpp" |
| aoqi@0 | 34 | #endif // INCLUDE_ALL_GCS |
| aoqi@0 | 35 | |
| aoqi@0 | 36 | void ObjArrayKlass::oop_follow_contents(oop obj, int index) { |
| aoqi@0 | 37 | if (UseCompressedOops) { |
| aoqi@0 | 38 | objarray_follow_contents<narrowOop>(obj, index); |
| aoqi@0 | 39 | } else { |
| aoqi@0 | 40 | objarray_follow_contents<oop>(obj, index); |
| aoqi@0 | 41 | } |
| aoqi@0 | 42 | } |
| aoqi@0 | 43 | |
| aoqi@0 | 44 | template <class T> |
| aoqi@0 | 45 | void ObjArrayKlass::objarray_follow_contents(oop obj, int index) { |
| aoqi@0 | 46 | objArrayOop a = objArrayOop(obj); |
| aoqi@0 | 47 | const size_t len = size_t(a->length()); |
| aoqi@0 | 48 | const size_t beg_index = size_t(index); |
| aoqi@0 | 49 | assert(beg_index < len || len == 0, "index too large"); |
| aoqi@0 | 50 | |
| aoqi@0 | 51 | const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride); |
| aoqi@0 | 52 | const size_t end_index = beg_index + stride; |
| aoqi@0 | 53 | T* const base = (T*)a->base(); |
| aoqi@0 | 54 | T* const beg = base + beg_index; |
| aoqi@0 | 55 | T* const end = base + end_index; |
| aoqi@0 | 56 | |
| aoqi@0 | 57 | // Push the non-NULL elements of the next stride on the marking stack. |
| aoqi@0 | 58 | for (T* e = beg; e < end; e++) { |
| aoqi@0 | 59 | MarkSweep::mark_and_push<T>(e); |
| aoqi@0 | 60 | } |
| aoqi@0 | 61 | |
| aoqi@0 | 62 | if (end_index < len) { |
| aoqi@0 | 63 | MarkSweep::push_objarray(a, end_index); // Push the continuation. |
| aoqi@0 | 64 | } |
| aoqi@0 | 65 | } |
| aoqi@0 | 66 | |
| aoqi@0 | 67 | #if INCLUDE_ALL_GCS |
| aoqi@0 | 68 | void ObjArrayKlass::oop_follow_contents(ParCompactionManager* cm, oop obj, |
| aoqi@0 | 69 | int index) { |
| aoqi@0 | 70 | if (UseCompressedOops) { |
| aoqi@0 | 71 | objarray_follow_contents<narrowOop>(cm, obj, index); |
| aoqi@0 | 72 | } else { |
| aoqi@0 | 73 | objarray_follow_contents<oop>(cm, obj, index); |
| aoqi@0 | 74 | } |
| aoqi@0 | 75 | } |
| aoqi@0 | 76 | |
| aoqi@0 | 77 | template <class T> |
| aoqi@0 | 78 | void ObjArrayKlass::objarray_follow_contents(ParCompactionManager* cm, oop obj, |
| aoqi@0 | 79 | int index) { |
| aoqi@0 | 80 | objArrayOop a = objArrayOop(obj); |
| aoqi@0 | 81 | const size_t len = size_t(a->length()); |
| aoqi@0 | 82 | const size_t beg_index = size_t(index); |
| aoqi@0 | 83 | assert(beg_index < len || len == 0, "index too large"); |
| aoqi@0 | 84 | |
| aoqi@0 | 85 | const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride); |
| aoqi@0 | 86 | const size_t end_index = beg_index + stride; |
| aoqi@0 | 87 | T* const base = (T*)a->base(); |
| aoqi@0 | 88 | T* const beg = base + beg_index; |
| aoqi@0 | 89 | T* const end = base + end_index; |
| aoqi@0 | 90 | |
| aoqi@0 | 91 | // Push the non-NULL elements of the next stride on the marking stack. |
| aoqi@0 | 92 | for (T* e = beg; e < end; e++) { |
| aoqi@0 | 93 | PSParallelCompact::mark_and_push<T>(cm, e); |
| aoqi@0 | 94 | } |
| aoqi@0 | 95 | |
| aoqi@0 | 96 | if (end_index < len) { |
| aoqi@0 | 97 | cm->push_objarray(a, end_index); // Push the continuation. |
| aoqi@0 | 98 | } |
| aoqi@0 | 99 | } |
| aoqi@0 | 100 | #endif // INCLUDE_ALL_GCS |
| aoqi@0 | 101 | |
| aoqi@0 | 102 | #endif // SHARE_VM_OOPS_OBJARRAYKLASS_INLINE_HPP |
