/*

 * Copyright (c) 2015, 2019, Oracle and/or its affiliates. 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

 * 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_GC_Z_ZVALUE_INLINE_HPP

#define SHARE_GC_Z_ZVALUE_INLINE_HPP

#include "gc/z/zCPU.inline.hpp"

#include "gc/z/zGlobals.hpp"

#include "gc/z/zNUMA.hpp"

#include "gc/z/zThread.inline.hpp"

#include "gc/z/zUtils.hpp"

#include "gc/z/zValue.hpp"

#include "runtime/globals.hpp"

#include "utilities/align.hpp"

//

// Storage

//

template <typename T> uintptr_t ZValueStorage<T>::_end = 0;

template <typename T> uintptr_t ZValueStorage<T>::_top = 0;

template <typename S>

uintptr_t ZValueStorage<S>::alloc(size_t size) {

  assert(size <= offset, "Allocation too large");

  // Allocate entry in existing memory block

  const uintptr_t addr = align_up(_top, S::alignment());

  _top = addr + size;

  if (_top < _end) {

    // Success

    return addr;

  }

  // Allocate new block of memory

  const size_t block_alignment = offset;

  const size_t block_size = offset * S::count();

  _top = ZUtils::alloc_aligned(block_alignment, block_size);

  _end = _top + offset;

  // Retry allocation

  return alloc(size);

}

inline size_t ZContendedStorage::alignment() {

  return ZCacheLineSize;

}

inline uint32_t ZContendedStorage::count() {

  return 1;

}

inline uint32_t ZContendedStorage::id() {

  return 0;

}

inline size_t ZPerCPUStorage::alignment() {

  return sizeof(uintptr_t);

}

inline uint32_t ZPerCPUStorage::count() {

  return ZCPU::count();

}

inline uint32_t ZPerCPUStorage::id() {

  return ZCPU::id();

}

inline size_t ZPerNUMAStorage::alignment() {

  return sizeof(uintptr_t);

}

inline uint32_t ZPerNUMAStorage::count() {

  return ZNUMA::count();

}

inline uint32_t ZPerNUMAStorage::id() {

  return ZNUMA::id();

}

inline size_t ZPerWorkerStorage::alignment() {

  return sizeof(uintptr_t);

}

inline uint32_t ZPerWorkerStorage::count() {

  return MAX2(ParallelGCThreads, ConcGCThreads);

}

inline uint32_t ZPerWorkerStorage::id() {

  return ZThread::worker_id();

}

//

// Value

//

template <typename S, typename T>

inline uintptr_t ZValue<S, T>::value_addr(uint32_t value_id) const {

  return _addr + (value_id * S::offset);

}

template <typename S, typename T>

inline ZValue<S, T>::ZValue() :

    _addr(S::alloc(sizeof(T))) {

  // Initialize all instances

  ZValueIterator<S, T> iter(this);

  for (T* addr; iter.next(&addr);) {

    ::new (addr) T;

  }

}

template <typename S, typename T>

inline ZValue<S, T>::ZValue(const T& value) :

    _addr(S::alloc(sizeof(T))) {

  // Initialize all instances

  ZValueIterator<S, T> iter(this);

  for (T* addr; iter.next(&addr);) {

    ::new (addr) T(value);

  }

}

template <typename S, typename T>

inline const T* ZValue<S, T>::addr(uint32_t value_id) const {

  return reinterpret_cast<const T*>(value_addr(value_id));

}

template <typename S, typename T>

inline T* ZValue<S, T>::addr(uint32_t value_id) {

  return reinterpret_cast<T*>(value_addr(value_id));

}

template <typename S, typename T>

inline const T& ZValue<S, T>::get(uint32_t value_id) const {

  return *addr(value_id);

}

template <typename S, typename T>

inline T& ZValue<S, T>::get(uint32_t value_id) {

  return *addr(value_id);

}

template <typename S, typename T>

inline void ZValue<S, T>::set(const T& value, uint32_t value_id) {

  get(value_id) = value;

}

template <typename S, typename T>

inline void ZValue<S, T>::set_all(const T& value) {

  ZValueIterator<S, T> iter(this);

  for (T* addr; iter.next(&addr);) {

    *addr = value;

  }

}

template <typename T>

inline ZContended<T>::ZContended() :

    ZValue<ZContendedStorage, T>() {}

template <typename T>

inline ZContended<T>::ZContended(const T& value) :

    ZValue<ZContendedStorage, T>(value) {}

template <typename T>

inline ZPerCPU<T>::ZPerCPU() :

    ZValue<ZPerCPUStorage, T>() {}

template <typename T>

inline ZPerCPU<T>::ZPerCPU(const T& value) :

    ZValue<ZPerCPUStorage, T>(value) {}

template <typename T>

inline ZPerNUMA<T>::ZPerNUMA() :

    ZValue<ZPerNUMAStorage, T>() {}

template <typename T>

inline ZPerNUMA<T>::ZPerNUMA(const T& value) :

    ZValue<ZPerNUMAStorage, T>(value) {}

template <typename T>

inline ZPerWorker<T>::ZPerWorker() :

    ZValue<ZPerWorkerStorage, T>() {}

template <typename T>

inline ZPerWorker<T>::ZPerWorker(const T& value) :

    ZValue<ZPerWorkerStorage, T>(value) {}

//

// Iterator

//

template <typename S, typename T>

inline ZValueIterator<S, T>::ZValueIterator(ZValue<S, T>* value) :

    _value(value),

    _value_id(0) {}

template <typename S, typename T>

inline bool ZValueIterator<S, T>::next(T** value) {

  if (_value_id < S::count()) {

    *value = _value->addr(_value_id++);

    return true;

  }

  return false;

}

template <typename T>

inline ZPerCPUIterator<T>::ZPerCPUIterator(ZPerCPU<T>* value) :

    ZValueIterator<ZPerCPUStorage, T>(value) {}

template <typename T>

inline ZPerNUMAIterator<T>::ZPerNUMAIterator(ZPerNUMA<T>* value) :

    ZValueIterator<ZPerNUMAStorage, T>(value) {}

template <typename T>

inline ZPerWorkerIterator<T>::ZPerWorkerIterator(ZPerWorker<T>* value) :

    ZValueIterator<ZPerWorkerStorage, T>(value) {}

template <typename S, typename T>

inline ZValueConstIterator<S, T>::ZValueConstIterator(const ZValue<S, T>* value) :

    _value(value),

    _value_id(0) {}

template <typename S, typename T>

inline bool ZValueConstIterator<S, T>::next(const T** value) {

  if (_value_id < S::count()) {

    *value = _value->addr(_value_id++);

    return true;

  }

  return false;

}

template <typename T>

inline ZPerCPUConstIterator<T>::ZPerCPUConstIterator(const ZPerCPU<T>* value) :

    ZValueConstIterator<ZPerCPUStorage, T>(value) {}

template <typename T>

inline ZPerNUMAConstIterator<T>::ZPerNUMAConstIterator(const ZPerNUMA<T>* value) :

    ZValueConstIterator<ZPerNUMAStorage, T>(value) {}

template <typename T>

inline ZPerWorkerConstIterator<T>::ZPerWorkerConstIterator(const ZPerWorker<T>* value) :

    ZValueConstIterator<ZPerWorkerStorage, T>(value) {}

#endif // SHARE_GC_Z_ZVALUE_INLINE_HPP