< prev index next >

src/share/vm/gc/parallel/parMarkBitMap.hpp

Print this page
rev 12887 : [mq]: drop_inline_suffix

*** 1,7 **** /* ! * Copyright (c) 2005, 2016, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 2005, 2017, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 303,313 **** return pointer_delta(end_addr, beg_addr) + obj_granularity(); } inline size_t ParMarkBitMap::obj_size(idx_t beg_bit) const { ! const idx_t end_bit = _end_bits.get_next_one_offset_inline(beg_bit, size()); assert(is_marked(beg_bit), "obj not marked"); assert(end_bit < size(), "end bit missing"); return obj_size(beg_bit, end_bit); } --- 303,313 ---- return pointer_delta(end_addr, beg_addr) + obj_granularity(); } inline size_t ParMarkBitMap::obj_size(idx_t beg_bit) const { ! const idx_t end_bit = _end_bits.get_next_one_offset(beg_bit, size()); assert(is_marked(beg_bit), "obj not marked"); assert(end_bit < size(), "end bit missing"); return obj_size(beg_bit, end_bit); }
*** 357,373 **** } inline ParMarkBitMap::idx_t ParMarkBitMap::find_obj_beg(idx_t beg, idx_t end) const { ! return _beg_bits.get_next_one_offset_inline_aligned_right(beg, end); } inline ParMarkBitMap::idx_t ParMarkBitMap::find_obj_end(idx_t beg, idx_t end) const { ! return _end_bits.get_next_one_offset_inline_aligned_right(beg, end); } inline HeapWord* ParMarkBitMap::find_obj_beg(HeapWord* beg, HeapWord* end) const { --- 357,373 ---- } inline ParMarkBitMap::idx_t ParMarkBitMap::find_obj_beg(idx_t beg, idx_t end) const { ! return _beg_bits.get_next_one_offset_aligned_right(beg, end); } inline ParMarkBitMap::idx_t ParMarkBitMap::find_obj_end(idx_t beg, idx_t end) const { ! return _end_bits.get_next_one_offset_aligned_right(beg, end); } inline HeapWord* ParMarkBitMap::find_obj_beg(HeapWord* beg, HeapWord* end) const {
< prev index next >