2007-12-01 00:00:00 +00:00
|
|
|
/*
|
2010-07-16 21:33:21 -07:00
|
|
|
* Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
|
2007-12-01 00:00:00 +00:00
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
|
* accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License version
|
|
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*
|
2010-05-27 19:08:38 -07:00
|
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
|
|
* questions.
|
2007-12-01 00:00:00 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
|
|
|
|
#define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
|
|
|
|
|
|
|
|
#include "gc_implementation/parallelScavenge/psPromotionManager.hpp"
|
|
|
|
#include "gc_implementation/parallelScavenge/psScavenge.hpp"
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
inline PSPromotionManager* PSPromotionManager::manager_array(int index) {
|
|
|
|
assert(_manager_array != NULL, "access of NULL manager_array");
|
|
|
|
assert(index >= 0 && index <= (int)ParallelGCThreads, "out of range manager_array access");
|
|
|
|
return _manager_array[index];
|
|
|
|
}
|
|
|
|
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
template <class T>
|
|
|
|
inline void PSPromotionManager::claim_or_forward_internal_depth(T* p) {
|
|
|
|
if (p != NULL) { // XXX: error if p != NULL here
|
|
|
|
oop o = oopDesc::load_decode_heap_oop_not_null(p);
|
2007-12-01 00:00:00 +00:00
|
|
|
if (o->is_forwarded()) {
|
|
|
|
o = o->forwardee();
|
|
|
|
// Card mark
|
|
|
|
if (PSScavenge::is_obj_in_young((HeapWord*) o)) {
|
|
|
|
PSScavenge::card_table()->inline_write_ref_field_gc(p, o);
|
|
|
|
}
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
oopDesc::encode_store_heap_oop_not_null(p, o);
|
2007-12-01 00:00:00 +00:00
|
|
|
} else {
|
|
|
|
push_depth(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
template <class T>
|
|
|
|
inline void PSPromotionManager::claim_or_forward_depth(T* p) {
|
|
|
|
assert(PSScavenge::should_scavenge(p, true), "revisiting object?");
|
|
|
|
assert(Universe::heap()->kind() == CollectedHeap::ParallelScavengeHeap,
|
|
|
|
"Sanity");
|
2007-12-01 00:00:00 +00:00
|
|
|
assert(Universe::heap()->is_in(p), "pointer outside heap");
|
|
|
|
|
|
|
|
claim_or_forward_internal_depth(p);
|
|
|
|
}
|
|
|
|
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
inline void PSPromotionManager::process_popped_location_depth(StarTask p) {
|
2007-12-01 00:00:00 +00:00
|
|
|
if (is_oop_masked(p)) {
|
|
|
|
assert(PSChunkLargeArrays, "invariant");
|
|
|
|
oop const old = unmask_chunked_array_oop(p);
|
|
|
|
process_array_chunk(old);
|
|
|
|
} else {
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
if (p.is_narrow()) {
|
2009-07-14 15:40:39 -07:00
|
|
|
assert(UseCompressedOops, "Error");
|
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
Compressed oops in instances, arrays, and headers. Code contributors are coleenp, phh, never, swamyv
Reviewed-by: jmasa, kamg, acorn, tbell, kvn, rasbold
2008-04-13 17:43:42 -04:00
|
|
|
PSScavenge::copy_and_push_safe_barrier(this, (narrowOop*)p);
|
|
|
|
} else {
|
|
|
|
PSScavenge::copy_and_push_safe_barrier(this, (oop*)p);
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
}
|
2010-07-16 21:33:21 -07:00
|
|
|
|
|
|
|
#if TASKQUEUE_STATS
|
|
|
|
void PSPromotionManager::record_steal(StarTask& p) {
|
|
|
|
if (is_oop_masked(p)) {
|
|
|
|
++_masked_steals;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif // TASKQUEUE_STATS
|
2010-11-23 13:22:55 -08:00
|
|
|
|
|
|
|
#endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSPROMOTIONMANAGER_INLINE_HPP
|