src/hotspot/share/gc/shared/cardTableBarrierSet.inline.hpp - master - githubmirror/panama-vector

src/hotspot/share/gc/shared/cardTableBarrierSet.inline.hpp
245 строк10 KB
David Simms
8389219: Implement JEP 401: Value Objects (Preview)
31 июл 2026, 03:45
31 июл 2026, 03:45cc278db
/*
 * Copyright (c) 2000, 2026, 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_SHARED_CARDTABLEBARRIERSET_INLINE_HPP
#define SHARE_GC_SHARED_CARDTABLEBARRIERSET_INLINE_HPP

#include "gc/shared/cardTableBarrierSet.hpp"

#include "gc/shared/barrierSet.hpp"
#include "gc/shared/cardTable.hpp"
#include "oops/compressedOops.inline.hpp"
#include "oops/inlineKlass.inline.hpp"
#include "oops/layoutKind.hpp"
#include "oops/objArrayOop.hpp"
#include "oops/oop.hpp"
#include "utilities/debug.hpp"

template <DecoratorSet decorators, typename T>
inline void CardTableBarrierSet::write_ref_field_post(T* field) {
  volatile CardValue* byte = card_table()->byte_for(field);
  *byte = CardTable::dirty_card_val();
}

class Klass;

// count is number of array elements being written
void CardTableBarrierSet::write_ref_array(HeapWord* start, size_t count) {
  HeapWord* end = (HeapWord*)((char*)start + (count*heapOopSize));
  // In the case of compressed oops, start and end may potentially be misaligned;
  // so we need to conservatively align the first downward (this is not
  // strictly necessary for current uses, but a case of good hygiene and,
  // if you will, aesthetics) and the second upward (this is essential for
  // current uses) to a HeapWord boundary, so we mark all cards overlapping
  // this write. If this evolves in the future to calling a
  // logging barrier of narrow oop granularity, like the pre-barrier for G1
  // (mentioned here merely by way of example), we will need to change this
  // interface, so it is "exactly precise" (if i may be allowed the adverbial
  // redundancy for emphasis) and does not include narrow oop slots not
  // included in the original write interval.
  HeapWord* aligned_start = align_down(start, HeapWordSize);
  HeapWord* aligned_end   = align_up  (end,   HeapWordSize);
  // If compressed oops were not being used, these should already be aligned
  assert(UseCompressedOops || (aligned_start == start && aligned_end == end),
         "Expected heap word alignment of start and end");
  write_region(MemRegion(aligned_start, aligned_end));
}

template <DecoratorSet decorators, typename BarrierSetT>
template <typename T>
inline void CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
oop_store_in_heap(T* addr, oop value) {
  BarrierSetT *bs = barrier_set_cast<BarrierSetT>(barrier_set());
  bs->template write_ref_field_pre<decorators>(addr);
  Raw::oop_store(addr, value);
  bs->template write_ref_field_post<decorators>(addr);
}

template <DecoratorSet decorators, typename BarrierSetT>
template <typename T>
inline oop CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
oop_atomic_cmpxchg_in_heap(T* addr, oop compare_value, oop new_value) {
  BarrierSetT *bs = barrier_set_cast<BarrierSetT>(barrier_set());
  bs->template write_ref_field_pre<decorators>(addr);
  oop result = Raw::oop_atomic_cmpxchg(addr, compare_value, new_value);
  if (result == compare_value) {
    bs->template write_ref_field_post<decorators>(addr);
  }
  return result;
}

template <DecoratorSet decorators, typename BarrierSetT>
template <typename T>
inline oop CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
oop_atomic_xchg_in_heap(T* addr, oop new_value) {
  BarrierSetT *bs = barrier_set_cast<BarrierSetT>(barrier_set());
  bs->template write_ref_field_pre<decorators>(addr);
  oop result = Raw::oop_atomic_xchg(addr, new_value);
  bs->template write_ref_field_post<decorators>(addr);
  return result;
}

template <DecoratorSet decorators, typename BarrierSetT>
template <typename T>
inline void CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
oop_arraycopy_partial_barrier(BarrierSetT *bs, T* dst_raw, T* p) {
  const size_t pd = pointer_delta(p, dst_raw, (size_t)heapOopSize);
  // pointer delta is scaled to number of elements (length field in
  // objArrayOop) which we assume is 32 bit.
  assert(pd == (size_t)(int)pd, "length field overflow");
  if (pd > 0) {
    // Copied at least one element; call the barrier.
    bs->write_ref_array((HeapWord*)dst_raw, pd);
  }
}

template <DecoratorSet decorators, typename BarrierSetT>
template <typename T>
inline OopCopyResult CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
oop_arraycopy_in_heap(arrayOop src_obj, size_t src_offset_in_bytes, T* src_raw,
                      arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw,
                      size_t length) {
  BarrierSetT *bs = barrier_set_cast<BarrierSetT>(barrier_set());

  src_raw = arrayOopDesc::obj_offset_to_raw(src_obj, src_offset_in_bytes, src_raw);
  dst_raw = arrayOopDesc::obj_offset_to_raw(dst_obj, dst_offset_in_bytes, dst_raw);

  if ((!HasDecorator<decorators, ARRAYCOPY_CHECKCAST>::value) &&
      (!HasDecorator<decorators, ARRAYCOPY_NOTNULL>::value)) {
    // Optimized covariant case
    if (!HasDecorator<decorators, IS_DEST_UNINITIALIZED>::value) {
      bs->write_ref_array_pre(dst_raw, length);
    }
    Raw::oop_arraycopy(nullptr, 0, src_raw, nullptr, 0, dst_raw, length);
    bs->write_ref_array((HeapWord*)dst_raw, length);
  } else {
    assert(dst_obj != nullptr, "better have an actual oop");
    Klass* bound = objArrayOop(dst_obj)->element_klass();
    T* from = const_cast<T*>(src_raw);
    T* end = from + length;
    for (T* p = dst_raw; from < end; from++, p++) {
      T element = *from;
      // Apply any required checks
      if (HasDecorator<decorators, ARRAYCOPY_NOTNULL>::value && CompressedOops::is_null(element)) {
        oop_arraycopy_partial_barrier(bs, dst_raw, p);
        return OopCopyResult::failed_check_null;
      }
      if (HasDecorator<decorators, ARRAYCOPY_CHECKCAST>::value &&
          (!oopDesc::is_instanceof_or_null(CompressedOops::decode(element), bound))) {
        oop_arraycopy_partial_barrier(bs, dst_raw, p);
        return OopCopyResult::failed_check_class_cast;
      }
      // write
      bs->template write_ref_field_pre<decorators>(p);
      *p = element;
    }
    bs->write_ref_array((HeapWord*)dst_raw, length);
  }

  return OopCopyResult::ok;
}

template <DecoratorSet decorators, typename BarrierSetT>
inline void CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
clone_in_heap(oop src, oop dst, size_t size) {
  Raw::clone(src, dst, size);
  BarrierSetT *bs = barrier_set_cast<BarrierSetT>(barrier_set());
  bs->write_region(MemRegion((HeapWord*)(void*)dst, size));
}

template <DecoratorSet decorators, typename BarrierSetT>
inline void CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
value_copy_in_heap(const ValuePayload& src, const ValuePayload& dst) {
  precond(src.klass() == dst.klass());

  const InlineKlass* md = src.klass();
  if (!md->contains_oops()) {
    // If we do not have oops in the flat array, we can just do a raw copy.
    Raw::value_copy(src, dst);
  } else {
    BarrierSetT* bs = barrier_set_cast<BarrierSetT>(BarrierSet::barrier_set());
    // addr() points at the payload start, the oop map offset are relative to
    // the object header, adjust address to account for this discrepancy.
    const address oop_map_adjusted_dst_addr = dst.addr() - md->payload_offset();
    typedef typename ValueOopType<decorators>::type OopType;

    // Pre-barriers...
    if (!HasDecorator<decorators, IS_DEST_UNINITIALIZED>::value) {
      OopMapBlock* map = md->start_of_nonstatic_oop_maps();
      OopMapBlock* const end = map + md->nonstatic_oop_map_count();

      while (map != end) {
        address doop_address = oop_map_adjusted_dst_addr + map->offset();

        bs->write_ref_array_pre((OopType*) doop_address, map->count());
        map++;
      }
    }

    Raw::value_copy(src, dst);

    // Post-barriers...
    OopMapBlock* map = md->start_of_nonstatic_oop_maps();
    OopMapBlock* const end = map + md->nonstatic_oop_map_count();
    while (map != end) {
      address doop_address = oop_map_adjusted_dst_addr + map->offset();
      // The post-barrier needs to be called for initialized and uninitialized destinations.
      bs->write_ref_array((HeapWord*) doop_address, map->count());
      map++;
    }
  }
}

template <DecoratorSet decorators, typename BarrierSetT>
inline void CardTableBarrierSet::AccessBarrier<decorators, BarrierSetT>::
value_store_null_in_heap(const ValuePayload& dst) {
  const InlineKlass* md = dst.klass();
  if (!md->contains_oops()) {
    // If we do not have oops in the flat array, we can just do a raw clear.
    Raw::value_store_null(dst);
  } else {
    BarrierSetT* bs = barrier_set_cast<BarrierSetT>(BarrierSet::barrier_set());
    // addr() points at the payload start, the oop map offset are relative to
    // the object header, adjust address to account for this discrepancy.
    const address oop_map_adjusted_dst_addr = dst.addr() - md->payload_offset();
    typedef typename ValueOopType<decorators>::type OopType;

    // Pre-barriers...
    if (!HasDecorator<decorators, IS_DEST_UNINITIALIZED>::value) {
      OopMapBlock* map = md->start_of_nonstatic_oop_maps();
      OopMapBlock* const end = map + md->nonstatic_oop_map_count();
      while (map != end) {
        address doop_address = oop_map_adjusted_dst_addr + map->offset();
        bs->write_ref_array_pre((OopType*) doop_address, map->count());
        map++;
      }
    }

    Raw::value_store_null(dst);

    // Storing null does not require post-barriers
  }
}

#endif // SHARE_GC_SHARED_CARDTABLEBARRIERSET_INLINE_HPP