Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/memory/modRefBarrierSet.hpp@7ae4e26cb1e0 (annotated)
src/share/vm/memory/modRefBarrierSet.hpp
Thu, 12 Oct 2017 21:27:07 +0800
- author
- aoqi
- date
- Thu, 12 Oct 2017 21:27:07 +0800
- changeset 7535
- 7ae4e26cb1e0
- parent 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | #ifndef SHARE_VM_MEMORY_MODREFBARRIERSET_HPP |
| aoqi@0 | 26 | #define SHARE_VM_MEMORY_MODREFBARRIERSET_HPP |
| aoqi@0 | 27 | |
| aoqi@0 | 28 | #include "memory/barrierSet.hpp" |
| aoqi@0 | 29 | |
| aoqi@0 | 30 | // This kind of "BarrierSet" allows a "CollectedHeap" to detect and |
| aoqi@0 | 31 | // enumerate ref fields that have been modified (since the last |
| aoqi@0 | 32 | // enumeration), using a card table. |
| aoqi@0 | 33 | |
| aoqi@0 | 34 | class OopClosure; |
| aoqi@0 | 35 | class Generation; |
| aoqi@0 | 36 | |
| aoqi@0 | 37 | class ModRefBarrierSet: public BarrierSet { |
| aoqi@0 | 38 | public: |
| aoqi@0 | 39 | |
| aoqi@0 | 40 | ModRefBarrierSet() { _kind = BarrierSet::ModRef; } |
| aoqi@0 | 41 | |
| aoqi@0 | 42 | bool is_a(BarrierSet::Name bsn) { |
| aoqi@0 | 43 | return bsn == BarrierSet::ModRef; |
| aoqi@0 | 44 | } |
| aoqi@0 | 45 | |
| aoqi@0 | 46 | // Barriers only on ref writes. |
| aoqi@0 | 47 | bool has_read_ref_barrier() { return false; } |
| aoqi@0 | 48 | bool has_read_prim_barrier() { return false; } |
| aoqi@0 | 49 | bool has_write_ref_barrier() { return true; } |
| aoqi@0 | 50 | bool has_write_prim_barrier() { return false; } |
| aoqi@0 | 51 | |
| aoqi@0 | 52 | bool read_ref_needs_barrier(void* field) { return false; } |
| aoqi@0 | 53 | bool read_prim_needs_barrier(HeapWord* field, size_t bytes) { return false; } |
| aoqi@0 | 54 | bool write_prim_needs_barrier(HeapWord* field, size_t bytes, |
| aoqi@0 | 55 | juint val1, juint val2) { return false; } |
| aoqi@0 | 56 | |
| aoqi@0 | 57 | void write_prim_field(oop obj, size_t offset, size_t bytes, |
| aoqi@0 | 58 | juint val1, juint val2) {} |
| aoqi@0 | 59 | |
| aoqi@0 | 60 | void read_ref_field(void* field) {} |
| aoqi@0 | 61 | void read_prim_field(HeapWord* field, size_t bytes) {} |
| aoqi@0 | 62 | protected: |
| aoqi@0 | 63 | virtual void write_ref_field_work(void* field, oop new_val, bool release = false) = 0; |
| aoqi@0 | 64 | public: |
| aoqi@0 | 65 | void write_prim_field(HeapWord* field, size_t bytes, |
| aoqi@0 | 66 | juint val1, juint val2) {} |
| aoqi@0 | 67 | |
| aoqi@0 | 68 | bool has_read_ref_array_opt() { return false; } |
| aoqi@0 | 69 | bool has_read_prim_array_opt() { return false; } |
| aoqi@0 | 70 | bool has_write_prim_array_opt() { return false; } |
| aoqi@0 | 71 | |
| aoqi@0 | 72 | bool has_read_region_opt() { return false; } |
| aoqi@0 | 73 | |
| aoqi@0 | 74 | |
| aoqi@0 | 75 | // These operations should assert false unless the correponding operation |
| aoqi@0 | 76 | // above returns true. |
| aoqi@0 | 77 | void read_ref_array(MemRegion mr) { |
| aoqi@0 | 78 | assert(false, "can't call"); |
| aoqi@0 | 79 | } |
| aoqi@0 | 80 | void read_prim_array(MemRegion mr) { |
| aoqi@0 | 81 | assert(false, "can't call"); |
| aoqi@0 | 82 | } |
| aoqi@0 | 83 | void write_prim_array(MemRegion mr) { |
| aoqi@0 | 84 | assert(false, "can't call"); |
| aoqi@0 | 85 | } |
| aoqi@0 | 86 | void read_region(MemRegion mr) { |
| aoqi@0 | 87 | assert(false, "can't call"); |
| aoqi@0 | 88 | } |
| aoqi@0 | 89 | |
| aoqi@0 | 90 | // Causes all refs in "mr" to be assumed to be modified. If "whole_heap" |
| aoqi@0 | 91 | // is true, the caller asserts that the entire heap is being invalidated, |
| aoqi@0 | 92 | // which may admit an optimized implementation for some barriers. |
| aoqi@0 | 93 | virtual void invalidate(MemRegion mr, bool whole_heap = false) = 0; |
| aoqi@0 | 94 | |
| aoqi@0 | 95 | // The caller guarantees that "mr" contains no references. (Perhaps it's |
| aoqi@0 | 96 | // objects have been moved elsewhere.) |
| aoqi@0 | 97 | virtual void clear(MemRegion mr) = 0; |
| aoqi@0 | 98 | |
| aoqi@0 | 99 | // Pass along the argument to the superclass. |
| aoqi@0 | 100 | ModRefBarrierSet(int max_covered_regions) : |
| aoqi@0 | 101 | BarrierSet(max_covered_regions) {} |
| aoqi@0 | 102 | }; |
| aoqi@0 | 103 | |
| aoqi@0 | 104 | #endif // SHARE_VM_MEMORY_MODREFBARRIERSET_HPP |
