author | tonyp |
Fri, 10 Jun 2011 13:16:40 -0400 | |
changeset 9989 | 305a76435cf1 |
parent 8928 | e5c53268bef5 |
child 10243 | d00a21009f1f |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
7905
cc7740616b03
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
7416
diff
changeset
|
2 |
* Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
1374 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
2742
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
2742
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
2742
diff
changeset
|
21 |
* questions. |
1374 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP |
26 |
#define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP |
|
27 |
||
28 |
#include "gc_implementation/g1/concurrentMark.hpp" |
|
29 |
#include "gc_implementation/g1/g1CollectedHeap.hpp" |
|
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
30 |
#include "gc_implementation/g1/g1AllocRegion.inline.hpp" |
7398 | 31 |
#include "gc_implementation/g1/g1CollectorPolicy.hpp" |
7920 | 32 |
#include "gc_implementation/g1/heapRegionSeq.inline.hpp" |
7397 | 33 |
#include "utilities/taskqueue.hpp" |
34 |
||
1374 | 35 |
// Inline functions for G1CollectedHeap |
36 |
||
9989 | 37 |
template <class T> |
1374 | 38 |
inline HeapRegion* |
9989 | 39 |
G1CollectedHeap::heap_region_containing(const T addr) const { |
40 |
HeapRegion* hr = _hrs.addr_to_region((HeapWord*) addr); |
|
1374 | 41 |
// hr can be null if addr in perm_gen |
42 |
if (hr != NULL && hr->continuesHumongous()) { |
|
43 |
hr = hr->humongous_start_region(); |
|
44 |
} |
|
45 |
return hr; |
|
46 |
} |
|
47 |
||
9989 | 48 |
template <class T> |
1374 | 49 |
inline HeapRegion* |
9989 | 50 |
G1CollectedHeap::heap_region_containing_raw(const T addr) const { |
51 |
assert(_g1_reserved.contains((const void*) addr), "invariant"); |
|
52 |
HeapRegion* res = _hrs.addr_to_region_unsafe((HeapWord*) addr); |
|
1374 | 53 |
return res; |
54 |
} |
|
55 |
||
56 |
inline bool G1CollectedHeap::obj_in_cs(oop obj) { |
|
9989 | 57 |
HeapRegion* r = _hrs.addr_to_region((HeapWord*) obj); |
1374 | 58 |
return r != NULL && r->in_collection_set(); |
59 |
} |
|
60 |
||
7398 | 61 |
inline HeapWord* |
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
62 |
G1CollectedHeap::attempt_allocation(size_t word_size, |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
63 |
unsigned int* gc_count_before_ret) { |
7905
cc7740616b03
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
7416
diff
changeset
|
64 |
assert_heap_not_locked_and_not_at_safepoint(); |
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
65 |
assert(!isHumongous(word_size), "attempt_allocation() should not " |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
66 |
"be called for humongous allocation requests"); |
7398 | 67 |
|
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
68 |
HeapWord* result = _mutator_alloc_region.attempt_allocation(word_size, |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
69 |
false /* bot_updates */); |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
70 |
if (result == NULL) { |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
71 |
result = attempt_allocation_slow(word_size, gc_count_before_ret); |
1374 | 72 |
} |
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
73 |
assert_heap_not_locked(); |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
74 |
if (result != NULL) { |
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
75 |
dirty_young_block(result, word_size); |
7905
cc7740616b03
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
7416
diff
changeset
|
76 |
} |
8928
e5c53268bef5
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
7923
diff
changeset
|
77 |
return result; |
7905
cc7740616b03
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
7416
diff
changeset
|
78 |
} |
cc7740616b03
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
7416
diff
changeset
|
79 |
|
7398 | 80 |
// It dirties the cards that cover the block so that so that the post |
81 |
// write barrier never queues anything when updating objects on this |
|
82 |
// block. It is assumed (and in fact we assert) that the block |
|
83 |
// belongs to a young region. |
|
84 |
inline void |
|
85 |
G1CollectedHeap::dirty_young_block(HeapWord* start, size_t word_size) { |
|
86 |
assert_heap_not_locked(); |
|
87 |
||
88 |
// Assign the containing region to containing_hr so that we don't |
|
89 |
// have to keep calling heap_region_containing_raw() in the |
|
90 |
// asserts below. |
|
91 |
DEBUG_ONLY(HeapRegion* containing_hr = heap_region_containing_raw(start);) |
|
92 |
assert(containing_hr != NULL && start != NULL && word_size > 0, |
|
93 |
"pre-condition"); |
|
94 |
assert(containing_hr->is_in(start), "it should contain start"); |
|
95 |
assert(containing_hr->is_young(), "it should be young"); |
|
96 |
assert(!containing_hr->isHumongous(), "it should not be humongous"); |
|
97 |
||
98 |
HeapWord* end = start + word_size; |
|
99 |
assert(containing_hr->is_in(end - 1), "it should also contain end - 1"); |
|
100 |
||
101 |
MemRegion mr(start, end); |
|
102 |
((CardTableModRefBS*)_g1h->barrier_set())->dirty(mr); |
|
1374 | 103 |
} |
104 |
||
6251 | 105 |
inline RefToScanQueue* G1CollectedHeap::task_queue(int i) const { |
1374 | 106 |
return _task_queues->queue(i); |
107 |
} |
|
108 |
||
109 |
inline bool G1CollectedHeap::isMarkedPrev(oop obj) const { |
|
110 |
return _cm->prevMarkBitMap()->isMarked((HeapWord *)obj); |
|
111 |
} |
|
112 |
||
113 |
inline bool G1CollectedHeap::isMarkedNext(oop obj) const { |
|
114 |
return _cm->nextMarkBitMap()->isMarked((HeapWord *)obj); |
|
115 |
} |
|
7397 | 116 |
|
117 |
#endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP |