< prev index next > src/hotspot/share/gc/shenandoah/shenandoahMarkBitMap.hpp
Print this page
/*
* Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020, Red Hat, Inc. and/or its affiliates.
+ * Copyright Amazon.com Inc. 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.
inline bool is_marked(HeapWord* addr) const;
inline bool is_marked_strong(HeapWord* w) const;
inline bool is_marked_weak(HeapWord* addr) const;
+ bool is_bitmap_clear_range(const HeapWord* start, const HeapWord* end) const;
+
// Return the address corresponding to the next marked bit at or after
// "addr", and before "limit", if "limit" is non-null. If there is no
// such bit, returns "limit" if that is non-null, or else "endWord()".
HeapWord* get_next_marked_addr(const HeapWord* addr,
const HeapWord* limit) const;
< prev index next >