src/share/vm/gc_implementation/g1/heapRegionSet.inline.hpp

Tue, 08 Aug 2017 15:57:29 +0800

author
aoqi
date
Tue, 08 Aug 2017 15:57:29 +0800
changeset 6876
710a3c8b516e
parent 6549
14bd75c9dbfa
parent 0
f90c822e73f8
child 7535
7ae4e26cb1e0
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2011, 2014, 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_GC_IMPLEMENTATION_G1_HEAPREGIONSET_INLINE_HPP
aoqi@0 26 #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_INLINE_HPP
aoqi@0 27
aoqi@0 28 #include "gc_implementation/g1/heapRegionSet.hpp"
aoqi@0 29
aoqi@0 30 inline void HeapRegionSetBase::add(HeapRegion* hr) {
aoqi@0 31 check_mt_safety();
aoqi@0 32 assert(hr->containing_set() == NULL, hrs_ext_msg(this, "should not already have a containing set %u"));
aoqi@0 33 assert(hr->next() == NULL && hr->prev() == NULL, hrs_ext_msg(this, "should not already be linked"));
aoqi@0 34
aoqi@0 35 _count.increment(1u, hr->capacity());
aoqi@0 36 hr->set_containing_set(this);
aoqi@0 37 verify_region(hr);
aoqi@0 38 }
aoqi@0 39
aoqi@0 40 inline void HeapRegionSetBase::remove(HeapRegion* hr) {
aoqi@0 41 check_mt_safety();
aoqi@0 42 verify_region(hr);
aoqi@0 43 assert(hr->next() == NULL && hr->prev() == NULL, hrs_ext_msg(this, "should already be unlinked"));
aoqi@0 44
aoqi@0 45 hr->set_containing_set(NULL);
aoqi@0 46 assert(_count.length() > 0, hrs_ext_msg(this, "pre-condition"));
aoqi@0 47 _count.decrement(1u, hr->capacity());
aoqi@0 48 }
aoqi@0 49
aoqi@0 50 inline void FreeRegionList::add_ordered(HeapRegion* hr) {
aoqi@0 51 check_mt_safety();
aoqi@0 52 assert((length() == 0 && _head == NULL && _tail == NULL) ||
aoqi@0 53 (length() > 0 && _head != NULL && _tail != NULL),
aoqi@0 54 hrs_ext_msg(this, "invariant"));
aoqi@0 55 // add() will verify the region and check mt safety.
aoqi@0 56 add(hr);
aoqi@0 57
aoqi@0 58 // Now link the region
aoqi@0 59 if (_head != NULL) {
aoqi@0 60 HeapRegion* curr;
aoqi@0 61
aoqi@0 62 if (_last != NULL && _last->hrs_index() < hr->hrs_index()) {
aoqi@0 63 curr = _last;
aoqi@0 64 } else {
aoqi@0 65 curr = _head;
aoqi@0 66 }
aoqi@0 67
aoqi@0 68 // Find first entry with a Region Index larger than entry to insert.
aoqi@0 69 while (curr != NULL && curr->hrs_index() < hr->hrs_index()) {
aoqi@0 70 curr = curr->next();
aoqi@0 71 }
aoqi@0 72
aoqi@0 73 hr->set_next(curr);
aoqi@0 74
aoqi@0 75 if (curr == NULL) {
aoqi@0 76 // Adding at the end
aoqi@0 77 hr->set_prev(_tail);
aoqi@0 78 _tail->set_next(hr);
aoqi@0 79 _tail = hr;
aoqi@0 80 } else if (curr->prev() == NULL) {
aoqi@0 81 // Adding at the beginning
aoqi@0 82 hr->set_prev(NULL);
aoqi@0 83 _head = hr;
aoqi@0 84 curr->set_prev(hr);
aoqi@0 85 } else {
aoqi@0 86 hr->set_prev(curr->prev());
aoqi@0 87 hr->prev()->set_next(hr);
aoqi@0 88 curr->set_prev(hr);
aoqi@0 89 }
aoqi@0 90 } else {
aoqi@0 91 // The list was empty
aoqi@0 92 _tail = hr;
aoqi@0 93 _head = hr;
aoqi@0 94 }
aoqi@0 95 _last = hr;
aoqi@0 96 }
aoqi@0 97
aoqi@0 98 inline void FreeRegionList::add_as_head(HeapRegion* hr) {
aoqi@0 99 assert((length() == 0 && _head == NULL && _tail == NULL) ||
aoqi@0 100 (length() > 0 && _head != NULL && _tail != NULL),
aoqi@0 101 hrs_ext_msg(this, "invariant"));
aoqi@0 102 // add() will verify the region and check mt safety.
aoqi@0 103 add(hr);
aoqi@0 104
aoqi@0 105 // Now link the region.
aoqi@0 106 if (_head != NULL) {
aoqi@0 107 hr->set_next(_head);
aoqi@0 108 _head->set_prev(hr);
aoqi@0 109 } else {
aoqi@0 110 _tail = hr;
aoqi@0 111 }
aoqi@0 112 _head = hr;
aoqi@0 113 }
aoqi@0 114
aoqi@0 115 inline void FreeRegionList::add_as_tail(HeapRegion* hr) {
aoqi@0 116 check_mt_safety();
aoqi@0 117 assert((length() == 0 && _head == NULL && _tail == NULL) ||
aoqi@0 118 (length() > 0 && _head != NULL && _tail != NULL),
aoqi@0 119 hrs_ext_msg(this, "invariant"));
aoqi@0 120 // add() will verify the region and check mt safety.
aoqi@0 121 add(hr);
aoqi@0 122
aoqi@0 123 // Now link the region.
aoqi@0 124 if (_tail != NULL) {
aoqi@0 125 _tail->set_next(hr);
aoqi@0 126 hr->set_prev(_tail);
aoqi@0 127 } else {
aoqi@0 128 _head = hr;
aoqi@0 129 }
aoqi@0 130 _tail = hr;
aoqi@0 131 }
aoqi@0 132
aoqi@0 133 inline HeapRegion* FreeRegionList::remove_head() {
aoqi@0 134 assert(!is_empty(), hrs_ext_msg(this, "the list should not be empty"));
aoqi@0 135 assert(length() > 0 && _head != NULL && _tail != NULL,
aoqi@0 136 hrs_ext_msg(this, "invariant"));
aoqi@0 137
aoqi@0 138 // We need to unlink it first.
aoqi@0 139 HeapRegion* hr = _head;
aoqi@0 140 _head = hr->next();
aoqi@0 141 if (_head == NULL) {
aoqi@0 142 _tail = NULL;
aoqi@0 143 } else {
aoqi@0 144 _head->set_prev(NULL);
aoqi@0 145 }
aoqi@0 146 hr->set_next(NULL);
aoqi@0 147
aoqi@0 148 if (_last == hr) {
aoqi@0 149 _last = NULL;
aoqi@0 150 }
aoqi@0 151
aoqi@0 152 // remove() will verify the region and check mt safety.
aoqi@0 153 remove(hr);
aoqi@0 154 return hr;
aoqi@0 155 }
aoqi@0 156
aoqi@0 157 inline HeapRegion* FreeRegionList::remove_head_or_null() {
aoqi@0 158 check_mt_safety();
aoqi@0 159 if (!is_empty()) {
aoqi@0 160 return remove_head();
aoqi@0 161 } else {
aoqi@0 162 return NULL;
aoqi@0 163 }
aoqi@0 164 }
aoqi@0 165
aoqi@0 166 inline HeapRegion* FreeRegionList::remove_tail() {
aoqi@0 167 assert(!is_empty(), hrs_ext_msg(this, "The list should not be empty"));
aoqi@0 168 assert(length() > 0 && _head != NULL && _tail != NULL,
aoqi@0 169 hrs_ext_msg(this, "invariant"));
aoqi@0 170
aoqi@0 171 // We need to unlink it first
aoqi@0 172 HeapRegion* hr = _tail;
aoqi@0 173
aoqi@0 174 _tail = hr->prev();
aoqi@0 175 if (_tail == NULL) {
aoqi@0 176 _head = NULL;
aoqi@0 177 } else {
aoqi@0 178 _tail->set_next(NULL);
aoqi@0 179 }
aoqi@0 180 hr->set_prev(NULL);
aoqi@0 181
aoqi@0 182 if (_last == hr) {
aoqi@0 183 _last = NULL;
aoqi@0 184 }
aoqi@0 185
aoqi@0 186 // remove() will verify the region and check mt safety.
aoqi@0 187 remove(hr);
aoqi@0 188 return hr;
aoqi@0 189 }
aoqi@0 190
aoqi@0 191 inline HeapRegion* FreeRegionList::remove_tail_or_null() {
aoqi@0 192 check_mt_safety();
aoqi@0 193
aoqi@0 194 if (!is_empty()) {
aoqi@0 195 return remove_tail();
aoqi@0 196 } else {
aoqi@0 197 return NULL;
aoqi@0 198 }
aoqi@0 199 }
aoqi@0 200
aoqi@0 201 inline HeapRegion* FreeRegionList::remove_region(bool from_head) {
aoqi@0 202 if (from_head) {
aoqi@0 203 return remove_head_or_null();
aoqi@0 204 } else {
aoqi@0 205 return remove_tail_or_null();
aoqi@0 206 }
aoqi@0 207 }
aoqi@0 208
aoqi@0 209 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_INLINE_HPP

mercurial