Mon, 09 Mar 2009 13:28:46 -0700
6814575: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 03/09
Reviewed-by: katleman, tbell, ohair
1 /*
2 * Copyright 2001-2009 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 */
25 // Inline functions for G1CollectedHeap
27 inline HeapRegion*
28 G1CollectedHeap::heap_region_containing(const void* addr) const {
29 HeapRegion* hr = _hrs->addr_to_region(addr);
30 // hr can be null if addr in perm_gen
31 if (hr != NULL && hr->continuesHumongous()) {
32 hr = hr->humongous_start_region();
33 }
34 return hr;
35 }
37 inline HeapRegion*
38 G1CollectedHeap::heap_region_containing_raw(const void* addr) const {
39 assert(_g1_reserved.contains(addr), "invariant");
40 size_t index = ((intptr_t) addr - (intptr_t) _g1_reserved.start())
41 >> HeapRegion::LogOfHRGrainBytes;
42 HeapRegion* res = _hrs->at(index);
43 assert(res == _hrs->addr_to_region(addr), "sanity");
44 return res;
45 }
47 inline bool G1CollectedHeap::obj_in_cs(oop obj) {
48 HeapRegion* r = _hrs->addr_to_region(obj);
49 return r != NULL && r->in_collection_set();
50 }
52 inline HeapWord* G1CollectedHeap::attempt_allocation(size_t word_size,
53 bool permit_collection_pause) {
54 HeapWord* res = NULL;
56 assert( SafepointSynchronize::is_at_safepoint() ||
57 Heap_lock->owned_by_self(), "pre-condition of the call" );
59 if (_cur_alloc_region != NULL) {
61 // If this allocation causes a region to become non empty,
62 // then we need to update our free_regions count.
64 if (_cur_alloc_region->is_empty()) {
65 res = _cur_alloc_region->allocate(word_size);
66 if (res != NULL)
67 _free_regions--;
68 } else {
69 res = _cur_alloc_region->allocate(word_size);
70 }
71 }
72 if (res != NULL) {
73 if (!SafepointSynchronize::is_at_safepoint()) {
74 assert( Heap_lock->owned_by_self(), "invariant" );
75 Heap_lock->unlock();
76 }
77 return res;
78 }
79 // attempt_allocation_slow will also unlock the heap lock when appropriate.
80 return attempt_allocation_slow(word_size, permit_collection_pause);
81 }
83 inline RefToScanQueue* G1CollectedHeap::task_queue(int i) {
84 return _task_queues->queue(i);
85 }
88 inline bool G1CollectedHeap::isMarkedPrev(oop obj) const {
89 return _cm->prevMarkBitMap()->isMarked((HeapWord *)obj);
90 }
92 inline bool G1CollectedHeap::isMarkedNext(oop obj) const {
93 return _cm->nextMarkBitMap()->isMarked((HeapWord *)obj);
94 }