1 /* 2 * Copyright (c) 2019, 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/g1NUMA.hpp" 27 #include "gc/g1/g1RegionCounts.hpp" 28 29 G1RegionCounts::G1RegionCounts() : _length_per_node(NULL), _numa(G1NUMA::numa()) { 30 _length_per_node = NEW_C_HEAP_ARRAY(uint, _numa->num_active_nodes(), mtGC); 31 clear(); 32 } 33 34 G1RegionCounts::~G1RegionCounts() { 35 FREE_C_HEAP_ARRAY(uint, _length_per_node); 36 } 37 38 uint G1RegionCounts::add(HeapRegion* hr) { 39 uint node_index = hr->node_index(); 40 41 // Update only if the node index is valid. 42 if (node_index < _numa->num_active_nodes()) { 43 *(_length_per_node + node_index) += 1; 44 return node_index; 45 } 46 47 return G1NUMA::UnknownNodeIndex; 48 } 49 50 void G1RegionCounts::clear() { 51 for (uint i = 0; i < _numa->num_active_nodes(); i++) { 52 _length_per_node[i] = 0; 53 } 54 } 55 56 uint G1RegionCounts::length(uint node_index) const { 57 return _length_per_node[node_index]; 58 }