1/*
2 * Copyright (c) 2016, 2018 Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25#ifndef SHARE_GC_SHARED_PRESERVEDMARKS_INLINE_HPP
26#define SHARE_GC_SHARED_PRESERVEDMARKS_INLINE_HPP
27
28#include "gc/shared/preservedMarks.hpp"
29#include "logging/log.hpp"
30#include "oops/oop.inline.hpp"
31#include "utilities/stack.inline.hpp"
32
33inline bool PreservedMarks::should_preserve_mark(oop obj, markOop m) const {
34 return m->must_be_preserved_for_promotion_failure(obj);
35}
36
37inline void PreservedMarks::push(oop obj, markOop m) {
38 assert(should_preserve_mark(obj, m), "pre-condition");
39 OopAndMarkOop elem(obj, m);
40 _stack.push(elem);
41}
42
43inline void PreservedMarks::push_if_necessary(oop obj, markOop m) {
44 if (should_preserve_mark(obj, m)) {
45 push(obj, m);
46 }
47}
48
49inline void PreservedMarks::init_forwarded_mark(oop obj) {
50 obj->init_mark_raw();
51}
52
53inline void PreservedMarksSet::restore(RestorePreservedMarksTaskExecutor* executor) {
54 volatile size_t total_size = 0;
55
56#ifdef ASSERT
57 // This is to make sure the total_size we'll calculate below is correct.
58 size_t total_size_before = 0;
59 for (uint i = 0; i < _num; i += 1) {
60 total_size_before += get(i)->size();
61 }
62#endif // def ASSERT
63
64 executor->restore(this, &total_size);
65 assert_empty();
66
67 assert(total_size == total_size_before,
68 "total_size = " SIZE_FORMAT " before = " SIZE_FORMAT,
69 total_size, total_size_before);
70
71 log_trace(gc)("Restored " SIZE_FORMAT " marks", total_size);
72}
73
74inline PreservedMarks::PreservedMarks()
75 : _stack(OopAndMarkOopStack::default_segment_size(),
76 // This stack should be used very infrequently so there's
77 // no point in caching stack segments (there will be a
78 // waste of space most of the time). So we set the max
79 // cache size to 0.
80 0 /* max_cache_size */) { }
81
82void PreservedMarks::OopAndMarkOop::set_mark() const {
83 _o->set_mark_raw(_m);
84}
85
86#endif // SHARE_GC_SHARED_PRESERVEDMARKS_INLINE_HPP
87