Tue, 25 Sep 2012 07:05:55 -0700
7200615: NPG: optimized VM build is broken
Reviewed-by: kvn
ysr@777 | 1 | /* |
tonyp@3713 | 2 | * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
ysr@777 | 4 | * |
ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ysr@777 | 7 | * published by the Free Software Foundation. |
ysr@777 | 8 | * |
ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
ysr@777 | 13 | * accompanied this code). |
ysr@777 | 14 | * |
ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
ysr@777 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
ysr@777 | 22 | * |
ysr@777 | 23 | */ |
ysr@777 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSEQ_HPP |
stefank@2314 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSEQ_HPP |
stefank@2314 | 27 | |
ysr@777 | 28 | class HeapRegion; |
ysr@777 | 29 | class HeapRegionClosure; |
tonyp@2963 | 30 | class FreeRegionList; |
tonyp@2963 | 31 | |
tonyp@2963 | 32 | // This class keeps track of the region metadata (i.e., HeapRegion |
tonyp@2963 | 33 | // instances). They are kept in the _regions array in address |
tonyp@2963 | 34 | // order. A region's index in the array corresponds to its index in |
tonyp@2963 | 35 | // the heap (i.e., 0 is the region at the bottom of the heap, 1 is |
tonyp@2963 | 36 | // the one after it, etc.). Two regions that are consecutive in the |
tonyp@2963 | 37 | // array should also be adjacent in the address space (i.e., |
tonyp@2963 | 38 | // region(i).end() == region(i+1).bottom(). |
tonyp@2963 | 39 | // |
tonyp@2963 | 40 | // We create a HeapRegion when we commit the region's address space |
tonyp@2963 | 41 | // for the first time. When we uncommit the address space of a |
tonyp@2963 | 42 | // region we retain the HeapRegion to be able to re-use it in the |
tonyp@2963 | 43 | // future (in case we recommit it). |
tonyp@2963 | 44 | // |
tonyp@2963 | 45 | // We keep track of three lengths: |
tonyp@2963 | 46 | // |
tonyp@2963 | 47 | // * _length (returned by length()) is the number of currently |
tonyp@2963 | 48 | // committed regions. |
tonyp@2963 | 49 | // * _allocated_length (not exposed outside this class) is the |
tonyp@2963 | 50 | // number of regions for which we have HeapRegions. |
tonyp@2963 | 51 | // * _max_length (returned by max_length()) is the maximum number of |
tonyp@2963 | 52 | // regions the heap can have. |
tonyp@2963 | 53 | // |
tonyp@2963 | 54 | // and maintain that: _length <= _allocated_length <= _max_length |
ysr@777 | 55 | |
zgu@3900 | 56 | class HeapRegionSeq: public CHeapObj<mtGC> { |
tonyp@3168 | 57 | friend class VMStructs; |
ysr@777 | 58 | |
tonyp@2963 | 59 | // The array that holds the HeapRegions. |
tonyp@2963 | 60 | HeapRegion** _regions; |
ysr@777 | 61 | |
tonyp@2963 | 62 | // Version of _regions biased to address 0 |
tonyp@2963 | 63 | HeapRegion** _regions_biased; |
ysr@777 | 64 | |
tonyp@2963 | 65 | // The number of regions committed in the heap. |
tonyp@3713 | 66 | uint _length; |
ysr@777 | 67 | |
tonyp@2963 | 68 | // The address of the first reserved word in the heap. |
tonyp@2963 | 69 | HeapWord* _heap_bottom; |
ysr@777 | 70 | |
tonyp@2963 | 71 | // The address of the last reserved word in the heap - 1. |
tonyp@2963 | 72 | HeapWord* _heap_end; |
tonyp@2963 | 73 | |
tonyp@2963 | 74 | // The log of the region byte size. |
tonyp@3713 | 75 | uint _region_shift; |
tonyp@2963 | 76 | |
tonyp@2963 | 77 | // A hint for which index to start searching from for humongous |
tonyp@2963 | 78 | // allocations. |
tonyp@3713 | 79 | uint _next_search_index; |
tonyp@2963 | 80 | |
tonyp@2963 | 81 | // The number of regions for which we have allocated HeapRegions for. |
tonyp@3713 | 82 | uint _allocated_length; |
tonyp@2963 | 83 | |
tonyp@2963 | 84 | // The maximum number of regions in the heap. |
tonyp@3713 | 85 | uint _max_length; |
tonyp@2963 | 86 | |
tonyp@2963 | 87 | // Find a contiguous set of empty regions of length num, starting |
tonyp@2963 | 88 | // from the given index. |
tonyp@3713 | 89 | uint find_contiguous_from(uint from, uint num); |
tonyp@2963 | 90 | |
tonyp@2963 | 91 | // Map a heap address to a biased region index. Assume that the |
tonyp@2963 | 92 | // address is valid. |
tonyp@3713 | 93 | inline uintx addr_to_index_biased(HeapWord* addr) const; |
tonyp@2963 | 94 | |
tonyp@3713 | 95 | void increment_length(uint* length) { |
tonyp@2963 | 96 | assert(*length < _max_length, "pre-condition"); |
tonyp@2963 | 97 | *length += 1; |
tonyp@2963 | 98 | } |
tonyp@2963 | 99 | |
tonyp@3713 | 100 | void decrement_length(uint* length) { |
tonyp@2963 | 101 | assert(*length > 0, "pre-condition"); |
tonyp@2963 | 102 | *length -= 1; |
tonyp@2963 | 103 | } |
ysr@777 | 104 | |
ysr@777 | 105 | public: |
tonyp@2963 | 106 | // Empty contructor, we'll initialize it with the initialize() method. |
tonyp@2963 | 107 | HeapRegionSeq() { } |
ysr@777 | 108 | |
tonyp@3713 | 109 | void initialize(HeapWord* bottom, HeapWord* end, uint max_length); |
ysr@777 | 110 | |
tonyp@2963 | 111 | // Return the HeapRegion at the given index. Assume that the index |
tonyp@2963 | 112 | // is valid. |
tonyp@3713 | 113 | inline HeapRegion* at(uint index) const; |
ysr@777 | 114 | |
tonyp@2963 | 115 | // If addr is within the committed space return its corresponding |
tonyp@2963 | 116 | // HeapRegion, otherwise return NULL. |
tonyp@2963 | 117 | inline HeapRegion* addr_to_region(HeapWord* addr) const; |
ysr@777 | 118 | |
tonyp@2963 | 119 | // Return the HeapRegion that corresponds to the given |
tonyp@2963 | 120 | // address. Assume the address is valid. |
tonyp@2963 | 121 | inline HeapRegion* addr_to_region_unsafe(HeapWord* addr) const; |
ysr@777 | 122 | |
tonyp@2963 | 123 | // Return the number of regions that have been committed in the heap. |
tonyp@3713 | 124 | uint length() const { return _length; } |
tonyp@2963 | 125 | |
tonyp@2963 | 126 | // Return the maximum number of regions in the heap. |
tonyp@3713 | 127 | uint max_length() const { return _max_length; } |
tonyp@2963 | 128 | |
tonyp@2963 | 129 | // Expand the sequence to reflect that the heap has grown from |
tonyp@2963 | 130 | // old_end to new_end. Either create new HeapRegions, or re-use |
tonyp@2963 | 131 | // existing ones, and return them in the given list. Returns the |
tonyp@2963 | 132 | // memory region that covers the newly-created regions. If a |
tonyp@2963 | 133 | // HeapRegion allocation fails, the result memory region might be |
tonyp@2963 | 134 | // smaller than the desired one. |
tonyp@2963 | 135 | MemRegion expand_by(HeapWord* old_end, HeapWord* new_end, |
tonyp@2963 | 136 | FreeRegionList* list); |
tonyp@2963 | 137 | |
tonyp@2963 | 138 | // Return the number of contiguous regions at the end of the sequence |
ysr@777 | 139 | // that are available for allocation. |
tonyp@3713 | 140 | uint free_suffix(); |
ysr@777 | 141 | |
tonyp@2643 | 142 | // Find a contiguous set of empty regions of length num and return |
tonyp@2963 | 143 | // the index of the first region or G1_NULL_HRS_INDEX if the |
tonyp@2963 | 144 | // search was unsuccessful. |
tonyp@3713 | 145 | uint find_contiguous(uint num); |
ysr@777 | 146 | |
tonyp@2963 | 147 | // Apply blk->doHeapRegion() on all committed regions in address order, |
tonyp@2963 | 148 | // terminating the iteration early if doHeapRegion() returns true. |
tonyp@2963 | 149 | void iterate(HeapRegionClosure* blk) const; |
ysr@777 | 150 | |
tonyp@2963 | 151 | // As above, but start the iteration from hr and loop around. If hr |
tonyp@2963 | 152 | // is NULL, we start from the first region in the heap. |
tonyp@2963 | 153 | void iterate_from(HeapRegion* hr, HeapRegionClosure* blk) const; |
ysr@777 | 154 | |
tonyp@2963 | 155 | // Tag as uncommitted as many regions that are completely free as |
tonyp@2963 | 156 | // possible, up to shrink_bytes, from the suffix of the committed |
tonyp@2963 | 157 | // sequence. Return a MemRegion that corresponds to the address |
tonyp@2963 | 158 | // range of the uncommitted regions. Assume shrink_bytes is page and |
tonyp@2963 | 159 | // heap region aligned. |
tonyp@3713 | 160 | MemRegion shrink_by(size_t shrink_bytes, uint* num_regions_deleted); |
ysr@777 | 161 | |
tonyp@2963 | 162 | // Do some sanity checking. |
tonyp@2963 | 163 | void verify_optional() PRODUCT_RETURN; |
ysr@777 | 164 | }; |
stefank@2314 | 165 | |
stefank@2314 | 166 | #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSEQ_HPP |