1 /* 2 * Copyright (c) 1997, 2005, 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 */ 24 25 // Explicit C-heap memory management 26 27 void trace_heap_malloc(size_t size, const char* name, void *p); 28 void trace_heap_free(void *p); 29 30 31 // allocate using malloc; will fail if no memory available 32 inline char* AllocateHeap(size_t size, const char* name = NULL) { 33 char* p = (char*) os::malloc(size); 34 #ifdef ASSERT 35 if (PrintMallocFree) trace_heap_malloc(size, name, p); 36 #else 37 Unused_Variable(name); 38 #endif 39 if (p == NULL) vm_exit_out_of_memory(size, name); 40 return p; 41 } 42 43 inline char* ReallocateHeap(char *old, size_t size, const char* name = NULL) { 44 char* p = (char*) os::realloc(old,size); 45 #ifdef ASSERT 46 if (PrintMallocFree) trace_heap_malloc(size, name, p); 47 #else 48 Unused_Variable(name); 49 #endif 50 if (p == NULL) vm_exit_out_of_memory(size, name); 51 return p; 52 } 53 54 inline void FreeHeap(void* p) { 55 #ifdef ASSERT 56 if (PrintMallocFree) trace_heap_free(p); 57 #endif 58 os::free(p); 59 }