Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/g1/g1RemSet.inline.hpp @ 342:37f87013dfd8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6711316: Open source the Garbage-First garbage collector Summary: First mercurial integration of the code for the Garbage-First garbage collector. Reviewed-by: apetrusenko, iveresov, jmasa, sgoldman, tonyp, ysr
author ysr
date Thu, 05 Jun 2008 15:57:56 -0700
parents
children 4f360ec815ba
comparison
equal deleted inserted replaced
189:0b27f3512f9e 342:37f87013dfd8
1 /*
2 * Copyright 2001-2007 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 inline size_t G1RemSet::n_workers() {
26 if (_g1->workers() != NULL) {
27 return _g1->workers()->total_workers();
28 } else {
29 return 1;
30 }
31 }
32
33 inline void HRInto_G1RemSet::write_ref_nv(HeapRegion* from, oop* p) {
34 oop obj = *p;
35 assert(from != NULL && from->is_in_reserved(p),
36 "p is not in a from");
37 HeapRegion* to = _g1->heap_region_containing(obj);
38 if (from != to && to != NULL) {
39 if (!to->popular() && !from->is_survivor()) {
40 #if G1_REM_SET_LOGGING
41 gclog_or_tty->print_cr("Adding " PTR_FORMAT " (" PTR_FORMAT ") to RS"
42 " for region [" PTR_FORMAT ", " PTR_FORMAT ")",
43 p, obj,
44 to->bottom(), to->end());
45 #endif
46 assert(to->rem_set() != NULL, "Need per-region 'into' remsets.");
47 if (to->rem_set()->add_reference(p)) {
48 _g1->schedule_popular_region_evac(to);
49 }
50 }
51 }
52 }
53
54 inline void HRInto_G1RemSet::write_ref(HeapRegion* from, oop* p) {
55 write_ref_nv(from, p);
56 }
57
58 inline bool HRInto_G1RemSet::self_forwarded(oop obj) {
59 bool result = (obj->is_forwarded() && (obj->forwardee()== obj));
60 return result;
61 }
62
63 inline void HRInto_G1RemSet::par_write_ref(HeapRegion* from, oop* p, int tid) {
64 oop obj = *p;
65 #ifdef ASSERT
66 // can't do because of races
67 // assert(obj == NULL || obj->is_oop(), "expected an oop");
68
69 // Do the safe subset of is_oop
70 if (obj != NULL) {
71 #ifdef CHECK_UNHANDLED_OOPS
72 oopDesc* o = obj.obj();
73 #else
74 oopDesc* o = obj;
75 #endif // CHECK_UNHANDLED_OOPS
76 assert((intptr_t)o % MinObjAlignmentInBytes == 0, "not oop aligned");
77 assert(Universe::heap()->is_in_reserved(obj), "must be in heap");
78 }
79 #endif // ASSERT
80 assert(from == NULL || from->is_in_reserved(p),
81 "p is not in from");
82 HeapRegion* to = _g1->heap_region_containing(obj);
83 // The test below could be optimized by applying a bit op to to and from.
84 if (to != NULL && from != NULL && from != to) {
85 if (!to->popular() && !from->is_survivor()) {
86 #if G1_REM_SET_LOGGING
87 gclog_or_tty->print_cr("Adding " PTR_FORMAT " (" PTR_FORMAT ") to RS"
88 " for region [" PTR_FORMAT ", " PTR_FORMAT ")",
89 p, obj,
90 to->bottom(), to->end());
91 #endif
92 assert(to->rem_set() != NULL, "Need per-region 'into' remsets.");
93 if (to->rem_set()->add_reference(p, tid)) {
94 _g1->schedule_popular_region_evac(to);
95 }
96 }
97 // There is a tricky infinite loop if we keep pushing
98 // self forwarding pointers onto our _new_refs list.
99 if (_par_traversal_in_progress &&
100 to->in_collection_set() && !self_forwarded(obj)) {
101 _new_refs[tid]->push(p);
102 }
103 }
104 }