Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/parallelScavenge/psScavenge.inline.hpp @ 0:a61af66fc99e jdk7-b24

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial load
author duke
date Sat, 01 Dec 2007 00:00:00 +0000
parents
children ba764ed4b6f2
comparison
equal deleted inserted replaced
-1:000000000000 0:a61af66fc99e
1 /*
2 * Copyright 2002-2006 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25
26 inline void PSScavenge::save_to_space_top_before_gc() {
27 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap();
28 _to_space_top_before_gc = heap->young_gen()->to_space()->top();
29 }
30
31 inline bool PSScavenge::should_scavenge(oop p) {
32 return p == NULL ? false : PSScavenge::is_obj_in_young((HeapWord*) p);
33 }
34
35 inline bool PSScavenge::should_scavenge(oop p, MutableSpace* to_space) {
36 if (should_scavenge(p)) {
37 // Skip objects copied to to_space since the scavenge started.
38 HeapWord* const addr = (HeapWord*) p;
39 return addr < to_space_top_before_gc() || addr >= to_space->end();
40 }
41 return false;
42 }
43
44 inline bool PSScavenge::should_scavenge(oop p, bool check_to_space) {
45 if (check_to_space) {
46 ParallelScavengeHeap* heap = (ParallelScavengeHeap*) Universe::heap();
47 return should_scavenge(p, heap->young_gen()->to_space());
48 }
49 return should_scavenge(p);
50 }
51
52 // Attempt to "claim" oop at p via CAS, push the new obj if successful
53 // This version tests the oop* to make sure it is within the heap before
54 // attempting marking.
55 inline void PSScavenge::copy_and_push_safe_barrier(PSPromotionManager* pm,
56 oop* p) {
57 assert(should_scavenge(*p, true), "revisiting object?");
58
59 oop o = *p;
60 if (o->is_forwarded()) {
61 *p = o->forwardee();
62 } else {
63 *p = pm->copy_to_survivor_space(o, pm->depth_first());
64 }
65
66 // We cannot mark without test, as some code passes us pointers
67 // that are outside the heap.
68 if ((!PSScavenge::is_obj_in_young((HeapWord*) p)) &&
69 Universe::heap()->is_in_reserved(p)) {
70 o = *p;
71 if (PSScavenge::is_obj_in_young((HeapWord*) o)) {
72 card_table()->inline_write_ref_field_gc(p, o);
73 }
74 }
75 }