1/* 2 * Copyright (c) 2001, 2016, 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#include "precompiled.hpp" 26#include "gc/g1/g1FromCardCache.hpp" 27#include "gc/g1/g1RemSet.hpp" 28#include "memory/padded.inline.hpp" 29#include "utilities/debug.hpp" 30 31int** G1FromCardCache::_cache = NULL; 32uint G1FromCardCache::_max_regions = 0; 33size_t G1FromCardCache::_static_mem_size = 0; 34 35void G1FromCardCache::initialize(uint num_par_rem_sets, uint max_num_regions) { 36 guarantee(max_num_regions > 0, "Heap size must be valid"); 37 guarantee(_cache == NULL, "Should not call this multiple times"); 38 39 _max_regions = max_num_regions; 40 _cache = Padded2DArray<int, mtGC>::create_unfreeable(_max_regions, 41 num_par_rem_sets, 42 &_static_mem_size); 43 44 invalidate(0, _max_regions); 45} 46 47void G1FromCardCache::invalidate(uint start_idx, size_t new_num_regions) { 48 guarantee((size_t)start_idx + new_num_regions <= max_uintx, 49 "Trying to invalidate beyond maximum region, from %u size " SIZE_FORMAT, 50 start_idx, new_num_regions); 51 uint end_idx = (start_idx + (uint)new_num_regions); 52 assert(end_idx <= _max_regions, "Must be within max."); 53 54 for (uint i = 0; i < G1RemSet::num_par_rem_sets(); i++) { 55 for (uint j = start_idx; j < end_idx; j++) { 56 set(i, j, InvalidCard); 57 } 58 } 59} 60 61#ifndef PRODUCT 62void G1FromCardCache::print(outputStream* out) { 63 for (uint i = 0; i < G1RemSet::num_par_rem_sets(); i++) { 64 for (uint j = 0; j < _max_regions; j++) { 65 out->print_cr("_from_card_cache[%u][%u] = %d.", 66 i, j, at(i, j)); 67 } 68 } 69} 70#endif 71 72void G1FromCardCache::clear(uint region_idx) { 73 uint num_par_remsets = G1RemSet::num_par_rem_sets(); 74 for (uint i = 0; i < num_par_remsets; i++) { 75 set(i, region_idx, InvalidCard); 76 } 77} 78