src/share/vm/oops/objArrayKlass.inline.hpp

changeset 0
f90c822e73f8
child 6876
710a3c8b516e
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/share/vm/oops/objArrayKlass.inline.hpp	Wed Apr 27 01:25:04 2016 +0800
     1.3 @@ -0,0 +1,102 @@
     1.4 +/*
     1.5 + * Copyright (c) 2010, 2013, 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_OBJARRAYKLASS_INLINE_HPP
    1.29 +#define SHARE_VM_OOPS_OBJARRAYKLASS_INLINE_HPP
    1.30 +
    1.31 +#include "gc_implementation/shared/markSweep.inline.hpp"
    1.32 +#include "oops/objArrayKlass.hpp"
    1.33 +#include "utilities/macros.hpp"
    1.34 +#if INCLUDE_ALL_GCS
    1.35 +#include "gc_implementation/parallelScavenge/psCompactionManager.inline.hpp"
    1.36 +#include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
    1.37 +#endif // INCLUDE_ALL_GCS
    1.38 +
    1.39 +void ObjArrayKlass::oop_follow_contents(oop obj, int index) {
    1.40 +  if (UseCompressedOops) {
    1.41 +    objarray_follow_contents<narrowOop>(obj, index);
    1.42 +  } else {
    1.43 +    objarray_follow_contents<oop>(obj, index);
    1.44 +  }
    1.45 +}
    1.46 +
    1.47 +template <class T>
    1.48 +void ObjArrayKlass::objarray_follow_contents(oop obj, int index) {
    1.49 +  objArrayOop a = objArrayOop(obj);
    1.50 +  const size_t len = size_t(a->length());
    1.51 +  const size_t beg_index = size_t(index);
    1.52 +  assert(beg_index < len || len == 0, "index too large");
    1.53 +
    1.54 +  const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);
    1.55 +  const size_t end_index = beg_index + stride;
    1.56 +  T* const base = (T*)a->base();
    1.57 +  T* const beg = base + beg_index;
    1.58 +  T* const end = base + end_index;
    1.59 +
    1.60 +  // Push the non-NULL elements of the next stride on the marking stack.
    1.61 +  for (T* e = beg; e < end; e++) {
    1.62 +    MarkSweep::mark_and_push<T>(e);
    1.63 +  }
    1.64 +
    1.65 +  if (end_index < len) {
    1.66 +    MarkSweep::push_objarray(a, end_index); // Push the continuation.
    1.67 +  }
    1.68 +}
    1.69 +
    1.70 +#if INCLUDE_ALL_GCS
    1.71 +void ObjArrayKlass::oop_follow_contents(ParCompactionManager* cm, oop obj,
    1.72 +                                        int index) {
    1.73 +  if (UseCompressedOops) {
    1.74 +    objarray_follow_contents<narrowOop>(cm, obj, index);
    1.75 +  } else {
    1.76 +    objarray_follow_contents<oop>(cm, obj, index);
    1.77 +  }
    1.78 +}
    1.79 +
    1.80 +template <class T>
    1.81 +void ObjArrayKlass::objarray_follow_contents(ParCompactionManager* cm, oop obj,
    1.82 +                                             int index) {
    1.83 +  objArrayOop a = objArrayOop(obj);
    1.84 +  const size_t len = size_t(a->length());
    1.85 +  const size_t beg_index = size_t(index);
    1.86 +  assert(beg_index < len || len == 0, "index too large");
    1.87 +
    1.88 +  const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);
    1.89 +  const size_t end_index = beg_index + stride;
    1.90 +  T* const base = (T*)a->base();
    1.91 +  T* const beg = base + beg_index;
    1.92 +  T* const end = base + end_index;
    1.93 +
    1.94 +  // Push the non-NULL elements of the next stride on the marking stack.
    1.95 +  for (T* e = beg; e < end; e++) {
    1.96 +    PSParallelCompact::mark_and_push<T>(cm, e);
    1.97 +  }
    1.98 +
    1.99 +  if (end_index < len) {
   1.100 +    cm->push_objarray(a, end_index); // Push the continuation.
   1.101 +  }
   1.102 +}
   1.103 +#endif // INCLUDE_ALL_GCS
   1.104 +
   1.105 +#endif // SHARE_VM_OOPS_OBJARRAYKLASS_INLINE_HPP

mercurial