1 /* 2 * Copyright (c) 2014, 2022, 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 #include "precompiled.hpp" 25 #include "jfr/leakprofiler/chains/bitset.inline.hpp" 26 27 BitSet::BitMapFragment::BitMapFragment(uintptr_t granule, BitMapFragment* next) : 28 _bits(_bitmap_granularity_size >> LogMinObjAlignmentInBytes, mtTracing, true /* clear */), 29 _next(next) { 30 } 31 32 BitSet::BitMapFragmentTable::~BitMapFragmentTable() { 33 for (int index = 0; index < table_size(); index ++) { 34 Entry* e = bucket(index); 35 while (e != nullptr) { 36 Entry* tmp = e; 37 e = e->next(); 38 free_entry(tmp); 39 } 40 } 41 } 42 43 BitSet::BitSet() : 44 _bitmap_fragments(32), 45 _fragment_list(NULL), 46 _last_fragment_bits(NULL), 47 _last_fragment_granule(UINTPTR_MAX) { 48 } 49 50 BitSet::~BitSet() { 51 BitMapFragment* current = _fragment_list; 52 while (current != NULL) { 53 BitMapFragment* next = current->next(); 54 delete current; 55 current = next; 56 } 57 }