/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

#ifndef SHARE_VM_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP

#define SHARE_VM_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP

#include "gc/parallel/parMarkBitMap.hpp"

#include "gc/parallel/psCompactionManager.hpp"

#include "gc/parallel/psParallelCompact.inline.hpp"

#include "gc/shared/taskqueue.inline.hpp"

#include "oops/objArrayOop.hpp"

#include "oops/oop.inline.hpp"

#include "utilities/debug.hpp"

#include "utilities/globalDefinitions.hpp"

inline bool ParCompactionManager::steal(int queue_num, int* seed, oop& t) {

  return stack_array()->steal(queue_num, seed, t);

}

inline bool ParCompactionManager::steal_objarray(int queue_num, int* seed, ObjArrayTask& t) {

  return _objarray_queues->steal(queue_num, seed, t);

}

inline bool ParCompactionManager::steal(int queue_num, int* seed, size_t& region) {

  return region_array()->steal(queue_num, seed, region);

}

inline void ParCompactionManager::push(oop obj) {

  _marking_stack.push(obj);

}

void ParCompactionManager::push_objarray(oop obj, size_t index)

{

  ObjArrayTask task(obj, index);

  assert(task.is_valid(), "bad ObjArrayTask");

  _objarray_stack.push(task);

}

void ParCompactionManager::push_region(size_t index)

{

#ifdef ASSERT

  const ParallelCompactData& sd = PSParallelCompact::summary_data();

  ParallelCompactData::RegionData* const region_ptr = sd.region(index);

  assert(region_ptr->claimed(), "must be claimed");

  assert(region_ptr->_pushed++ == 0, "should only be pushed once");

#endif

  region_stack()->push(index);

}

template <typename T>

inline void ParCompactionManager::mark_and_push(T* p) {

  T heap_oop = oopDesc::load_heap_oop(p);

  if (!oopDesc::is_null(heap_oop)) {

    oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);

    assert(ParallelScavengeHeap::heap()->is_in(obj), "should be in heap");

    if (mark_bitmap()->is_unmarked(obj) && PSParallelCompact::mark_obj(obj)) {

      push(obj);

    }

  }

}

template <typename T>

inline void ParCompactionManager::MarkAndPushClosure::do_oop_nv(T* p) {

  _compaction_manager->mark_and_push(p);

}

inline void ParCompactionManager::MarkAndPushClosure::do_oop(oop* p)       { do_oop_nv(p); }

inline void ParCompactionManager::MarkAndPushClosure::do_oop(narrowOop* p) { do_oop_nv(p); }

inline void ParCompactionManager::follow_klass(Klass* klass) {

  oop holder = klass->klass_holder();

  mark_and_push(&holder);

}

inline void ParCompactionManager::FollowStackClosure::do_void() {

  _compaction_manager->follow_marking_stacks();

}

inline void ParCompactionManager::follow_class_loader(ClassLoaderData* cld) {

  MarkAndPushClosure mark_and_push_closure(this);

}

inline void ParCompactionManager::follow_contents(oop obj) {

  assert(PSParallelCompact::mark_bitmap()->is_marked(obj), "should be marked");

  obj->pc_follow_contents(this);

}

template <class T>

inline void oop_pc_follow_contents_specialized(objArrayOop obj, int index, ParCompactionManager* cm) {

  const size_t len = size_t(obj->length());

  const size_t beg_index = size_t(index);

  assert(beg_index < len || len == 0, "index too large");

  const size_t stride = MIN2(len - beg_index, ObjArrayMarkingStride);

  const size_t end_index = beg_index + stride;

  T* const base = (T*)obj->base();

  T* const beg = base + beg_index;

  T* const end = base + end_index;

  if (end_index < len) {

    cm->push_objarray(obj, end_index); // Push the continuation.

  }

  // Push the non-NULL elements of the next stride on the marking stack.

  for (T* e = beg; e < end; e++) {

    cm->mark_and_push<T>(e);

  }

}

inline void ParCompactionManager::follow_contents(objArrayOop obj, int index) {

  if (UseCompressedOops) {

    oop_pc_follow_contents_specialized<narrowOop>(obj, index, this);

  } else {

    oop_pc_follow_contents_specialized<oop>(obj, index, this);

  }

}

inline void ParCompactionManager::update_contents(oop obj) {

  obj->pc_update_contents(this);

}

#endif // SHARE_VM_GC_PARALLEL_PSCOMPACTIONMANAGER_INLINE_HPP