Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/g1CollectedHeap.inline.hpp @ 2433:abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
7023151: G1: refactor the code that operates on _cur_alloc_region to be re-used for allocs by the GC threads
7018286: G1: humongous allocation attempts should take the GC locker into account
Summary: First, this change replaces the asymmetric locking scheme in the G1 slow alloc path by a summetric one. Second, it factors out the code that operates on _cur_alloc_region so that it can be re-used for allocations by the GC threads in the future.
Reviewed-by: stefank, brutisso, johnc
| author | tonyp |
|---|---|
| date | Wed, 30 Mar 2011 10:26:59 -0400 |
| parents | 0fa27f37d4d4 |
| children | c3f1170908be |
| rev | line source |
|---|---|
| 342 | 1 /* |
|
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
1991
diff
changeset
|
2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
| 342 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
752
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
752
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
752
diff
changeset
|
21 * questions. |
| 342 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 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" | |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
30 #include "gc_implementation/g1/g1AllocRegion.inline.hpp" |
| 1973 | 31 #include "gc_implementation/g1/g1CollectorPolicy.hpp" |
| 2149 | 32 #include "gc_implementation/g1/heapRegionSeq.inline.hpp" |
| 1972 | 33 #include "utilities/taskqueue.hpp" |
| 34 | |
| 342 | 35 // Inline functions for G1CollectedHeap |
| 36 | |
| 37 inline HeapRegion* | |
| 38 G1CollectedHeap::heap_region_containing(const void* addr) const { | |
| 39 HeapRegion* hr = _hrs->addr_to_region(addr); | |
| 40 // hr can be null if addr in perm_gen | |
| 41 if (hr != NULL && hr->continuesHumongous()) { | |
| 42 hr = hr->humongous_start_region(); | |
| 43 } | |
| 44 return hr; | |
| 45 } | |
| 46 | |
| 47 inline HeapRegion* | |
| 48 G1CollectedHeap::heap_region_containing_raw(const void* addr) const { | |
| 526 | 49 assert(_g1_reserved.contains(addr), "invariant"); |
|
752
a2957df801a1
6833576: G1: assert illegal index, growableArray.hpp:186
johnc
parents:
579
diff
changeset
|
50 size_t index = pointer_delta(addr, _g1_reserved.start(), 1) |
|
a2957df801a1
6833576: G1: assert illegal index, growableArray.hpp:186
johnc
parents:
579
diff
changeset
|
51 >> HeapRegion::LogOfHRGrainBytes; |
|
a2957df801a1
6833576: G1: assert illegal index, growableArray.hpp:186
johnc
parents:
579
diff
changeset
|
52 |
| 526 | 53 HeapRegion* res = _hrs->at(index); |
| 54 assert(res == _hrs->addr_to_region(addr), "sanity"); | |
| 342 | 55 return res; |
| 56 } | |
| 57 | |
| 58 inline bool G1CollectedHeap::obj_in_cs(oop obj) { | |
| 59 HeapRegion* r = _hrs->addr_to_region(obj); | |
| 60 return r != NULL && r->in_collection_set(); | |
| 61 } | |
| 62 | |
| 1973 | 63 inline HeapWord* |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
64 G1CollectedHeap::attempt_allocation(size_t word_size, |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
65 unsigned int* gc_count_before_ret) { |
|
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
1991
diff
changeset
|
66 assert_heap_not_locked_and_not_at_safepoint(); |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
67 assert(!isHumongous(word_size), "attempt_allocation() should not " |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
68 "be called for humongous allocation requests"); |
| 1973 | 69 |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
70 HeapWord* result = _mutator_alloc_region.attempt_allocation(word_size, |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
71 false /* bot_updates */); |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
72 if (result == NULL) { |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
73 result = attempt_allocation_slow(word_size, gc_count_before_ret); |
| 342 | 74 } |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
75 assert_heap_not_locked(); |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
76 if (result != NULL) { |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
77 dirty_young_block(result, word_size); |
|
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
1991
diff
changeset
|
78 } |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2152
diff
changeset
|
79 return result; |
|
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
1991
diff
changeset
|
80 } |
|
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
1991
diff
changeset
|
81 |
| 1973 | 82 // It dirties the cards that cover the block so that so that the post |
| 83 // write barrier never queues anything when updating objects on this | |
| 84 // block. It is assumed (and in fact we assert) that the block | |
| 85 // belongs to a young region. | |
| 86 inline void | |
| 87 G1CollectedHeap::dirty_young_block(HeapWord* start, size_t word_size) { | |
| 88 assert_heap_not_locked(); | |
| 89 | |
| 90 // Assign the containing region to containing_hr so that we don't | |
| 91 // have to keep calling heap_region_containing_raw() in the | |
| 92 // asserts below. | |
| 93 DEBUG_ONLY(HeapRegion* containing_hr = heap_region_containing_raw(start);) | |
| 94 assert(containing_hr != NULL && start != NULL && word_size > 0, | |
| 95 "pre-condition"); | |
| 96 assert(containing_hr->is_in(start), "it should contain start"); | |
| 97 assert(containing_hr->is_young(), "it should be young"); | |
| 98 assert(!containing_hr->isHumongous(), "it should not be humongous"); | |
| 99 | |
| 100 HeapWord* end = start + word_size; | |
| 101 assert(containing_hr->is_in(end - 1), "it should also contain end - 1"); | |
| 102 | |
| 103 MemRegion mr(start, end); | |
| 104 ((CardTableModRefBS*)_g1h->barrier_set())->dirty(mr); | |
| 342 | 105 } |
| 106 | |
| 1709 | 107 inline RefToScanQueue* G1CollectedHeap::task_queue(int i) const { |
| 342 | 108 return _task_queues->queue(i); |
| 109 } | |
| 110 | |
| 111 inline bool G1CollectedHeap::isMarkedPrev(oop obj) const { | |
| 112 return _cm->prevMarkBitMap()->isMarked((HeapWord *)obj); | |
| 113 } | |
| 114 | |
| 115 inline bool G1CollectedHeap::isMarkedNext(oop obj) const { | |
| 116 return _cm->nextMarkBitMap()->isMarked((HeapWord *)obj); | |
| 117 } | |
| 1972 | 118 |
| 119 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_INLINE_HPP |