Wed, 01 May 2013 14:11:01 +0100
Merge
1 /*
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #ifndef SHARE_VM_MEMORY_ALLOCATION_INLINE_HPP
26 #define SHARE_VM_MEMORY_ALLOCATION_INLINE_HPP
28 #include "runtime/atomic.inline.hpp"
29 #include "runtime/os.hpp"
31 // Explicit C-heap memory management
33 void trace_heap_malloc(size_t size, const char* name, void *p);
34 void trace_heap_free(void *p);
36 #ifndef PRODUCT
37 // Increments unsigned long value for statistics (not atomic on MP).
38 inline void inc_stat_counter(volatile julong* dest, julong add_value) {
39 #if defined(SPARC) || defined(X86)
40 // Sparc and X86 have atomic jlong (8 bytes) instructions
41 julong value = Atomic::load((volatile jlong*)dest);
42 value += add_value;
43 Atomic::store((jlong)value, (volatile jlong*)dest);
44 #else
45 // possible word-tearing during load/store
46 *dest += add_value;
47 #endif
48 }
49 #endif
51 // allocate using malloc; will fail if no memory available
52 inline char* AllocateHeap(size_t size, MEMFLAGS flags, address pc = 0,
53 AllocFailType alloc_failmode = AllocFailStrategy::EXIT_OOM) {
54 if (pc == 0) {
55 pc = CURRENT_PC;
56 }
57 char* p = (char*) os::malloc(size, flags, pc);
58 #ifdef ASSERT
59 if (PrintMallocFree) trace_heap_malloc(size, "AllocateHeap", p);
60 #endif
61 if (p == NULL && alloc_failmode == AllocFailStrategy::EXIT_OOM) vm_exit_out_of_memory(size, "AllocateHeap");
62 return p;
63 }
65 inline char* ReallocateHeap(char *old, size_t size, MEMFLAGS flags,
66 AllocFailType alloc_failmode = AllocFailStrategy::EXIT_OOM) {
67 char* p = (char*) os::realloc(old, size, flags, CURRENT_PC);
68 #ifdef ASSERT
69 if (PrintMallocFree) trace_heap_malloc(size, "ReallocateHeap", p);
70 #endif
71 if (p == NULL && alloc_failmode == AllocFailStrategy::EXIT_OOM) vm_exit_out_of_memory(size, "ReallocateHeap");
72 return p;
73 }
75 inline void FreeHeap(void* p, MEMFLAGS memflags = mtInternal) {
76 #ifdef ASSERT
77 if (PrintMallocFree) trace_heap_free(p);
78 #endif
79 os::free(p, memflags);
80 }
83 template <MEMFLAGS F> void* CHeapObj<F>::operator new(size_t size,
84 address caller_pc){
85 #ifdef ASSERT
86 void* p = (void*)AllocateHeap(size, F, (caller_pc != 0 ? caller_pc : CALLER_PC));
87 if (PrintMallocFree) trace_heap_malloc(size, "CHeapObj-new", p);
88 return p;
89 #else
90 return (void *) AllocateHeap(size, F, (caller_pc != 0 ? caller_pc : CALLER_PC));
91 #endif
92 }
94 template <MEMFLAGS F> void* CHeapObj<F>::operator new (size_t size,
95 const std::nothrow_t& nothrow_constant, address caller_pc) {
96 #ifdef ASSERT
97 void* p = (void*)AllocateHeap(size, F, (caller_pc != 0 ? caller_pc : CALLER_PC),
98 AllocFailStrategy::RETURN_NULL);
99 if (PrintMallocFree) trace_heap_malloc(size, "CHeapObj-new", p);
100 return p;
101 #else
102 return (void *) AllocateHeap(size, F, (caller_pc != 0 ? caller_pc : CALLER_PC),
103 AllocFailStrategy::RETURN_NULL);
104 #endif
105 }
107 template <MEMFLAGS F> void CHeapObj<F>::operator delete(void* p){
108 FreeHeap(p, F);
109 }
111 template <class E, MEMFLAGS F>
112 E* ArrayAllocator<E, F>::allocate(size_t length) {
113 assert(_addr == NULL, "Already in use");
115 _size = sizeof(E) * length;
116 _use_malloc = _size < ArrayAllocatorMallocLimit;
118 if (_use_malloc) {
119 _addr = AllocateHeap(_size, F);
120 if (_addr == NULL && _size >= (size_t)os::vm_allocation_granularity()) {
121 // malloc failed let's try with mmap instead
122 _use_malloc = false;
123 } else {
124 return (E*)_addr;
125 }
126 }
128 int alignment = os::vm_allocation_granularity();
129 _size = align_size_up(_size, alignment);
131 _addr = os::reserve_memory(_size, NULL, alignment);
132 if (_addr == NULL) {
133 vm_exit_out_of_memory(_size, "Allocator (reserve)");
134 }
136 bool success = os::commit_memory(_addr, _size, false /* executable */);
137 if (!success) {
138 vm_exit_out_of_memory(_size, "Allocator (commit)");
139 }
141 return (E*)_addr;
142 }
144 template<class E, MEMFLAGS F>
145 void ArrayAllocator<E, F>::free() {
146 if (_addr != NULL) {
147 if (_use_malloc) {
148 FreeHeap(_addr, F);
149 } else {
150 os::release_memory(_addr, _size);
151 }
152 _addr = NULL;
153 }
154 }
156 #endif // SHARE_VM_MEMORY_ALLOCATION_INLINE_HPP