Tue, 11 May 2010 14:35:43 -0700
6931180: Migration to recent versions of MS Platform SDK
6951582: Build problems on win64
Summary: Changes to enable building JDK7 with Microsoft Visual Studio 2010
Reviewed-by: ohair, art, ccheung, dcubed
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2005 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_allocation.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | void* CHeapObj::operator new(size_t size){ |
duke@435 | 29 | return (void *) AllocateHeap(size, "CHeapObj-new"); |
duke@435 | 30 | } |
duke@435 | 31 | |
duke@435 | 32 | void CHeapObj::operator delete(void* p){ |
duke@435 | 33 | FreeHeap(p); |
duke@435 | 34 | } |
duke@435 | 35 | |
duke@435 | 36 | void* StackObj::operator new(size_t size) { ShouldNotCallThis(); return 0; }; |
duke@435 | 37 | void StackObj::operator delete(void* p) { ShouldNotCallThis(); }; |
duke@435 | 38 | void* _ValueObj::operator new(size_t size) { ShouldNotCallThis(); return 0; }; |
duke@435 | 39 | void _ValueObj::operator delete(void* p) { ShouldNotCallThis(); }; |
duke@435 | 40 | |
duke@435 | 41 | void* ResourceObj::operator new(size_t size, allocation_type type) { |
duke@435 | 42 | address res; |
duke@435 | 43 | switch (type) { |
duke@435 | 44 | case C_HEAP: |
duke@435 | 45 | res = (address)AllocateHeap(size, "C_Heap: ResourceOBJ"); |
duke@435 | 46 | break; |
duke@435 | 47 | case RESOURCE_AREA: |
duke@435 | 48 | res = (address)operator new(size); |
duke@435 | 49 | break; |
duke@435 | 50 | default: |
duke@435 | 51 | ShouldNotReachHere(); |
duke@435 | 52 | } |
duke@435 | 53 | // Set allocation type in the resource object for assertion checks. |
duke@435 | 54 | DEBUG_ONLY(((ResourceObj *)res)->_allocation = type;) |
duke@435 | 55 | return res; |
duke@435 | 56 | } |
duke@435 | 57 | |
duke@435 | 58 | void ResourceObj::operator delete(void* p) { |
duke@435 | 59 | assert(((ResourceObj *)p)->allocated_on_C_heap(), |
duke@435 | 60 | "delete only allowed for C_HEAP objects"); |
duke@435 | 61 | FreeHeap(p); |
duke@435 | 62 | } |
duke@435 | 63 | |
duke@435 | 64 | void trace_heap_malloc(size_t size, const char* name, void* p) { |
duke@435 | 65 | // A lock is not needed here - tty uses a lock internally |
duke@435 | 66 | tty->print_cr("Heap malloc " INTPTR_FORMAT " %7d %s", p, size, name == NULL ? "" : name); |
duke@435 | 67 | } |
duke@435 | 68 | |
duke@435 | 69 | |
duke@435 | 70 | void trace_heap_free(void* p) { |
duke@435 | 71 | // A lock is not needed here - tty uses a lock internally |
duke@435 | 72 | tty->print_cr("Heap free " INTPTR_FORMAT, p); |
duke@435 | 73 | } |
duke@435 | 74 | |
duke@435 | 75 | bool warn_new_operator = false; // see vm_main |
duke@435 | 76 | |
duke@435 | 77 | //-------------------------------------------------------------------------------------- |
duke@435 | 78 | // ChunkPool implementation |
duke@435 | 79 | |
duke@435 | 80 | // MT-safe pool of chunks to reduce malloc/free thrashing |
duke@435 | 81 | // NB: not using Mutex because pools are used before Threads are initialized |
duke@435 | 82 | class ChunkPool { |
duke@435 | 83 | Chunk* _first; // first cached Chunk; its first word points to next chunk |
duke@435 | 84 | size_t _num_chunks; // number of unused chunks in pool |
duke@435 | 85 | size_t _num_used; // number of chunks currently checked out |
duke@435 | 86 | const size_t _size; // size of each chunk (must be uniform) |
duke@435 | 87 | |
duke@435 | 88 | // Our three static pools |
duke@435 | 89 | static ChunkPool* _large_pool; |
duke@435 | 90 | static ChunkPool* _medium_pool; |
duke@435 | 91 | static ChunkPool* _small_pool; |
duke@435 | 92 | |
duke@435 | 93 | // return first element or null |
duke@435 | 94 | void* get_first() { |
duke@435 | 95 | Chunk* c = _first; |
duke@435 | 96 | if (_first) { |
duke@435 | 97 | _first = _first->next(); |
duke@435 | 98 | _num_chunks--; |
duke@435 | 99 | } |
duke@435 | 100 | return c; |
duke@435 | 101 | } |
duke@435 | 102 | |
duke@435 | 103 | public: |
duke@435 | 104 | // All chunks in a ChunkPool has the same size |
duke@435 | 105 | ChunkPool(size_t size) : _size(size) { _first = NULL; _num_chunks = _num_used = 0; } |
duke@435 | 106 | |
duke@435 | 107 | // Allocate a new chunk from the pool (might expand the pool) |
duke@435 | 108 | void* allocate(size_t bytes) { |
duke@435 | 109 | assert(bytes == _size, "bad size"); |
duke@435 | 110 | void* p = NULL; |
duke@435 | 111 | { ThreadCritical tc; |
duke@435 | 112 | _num_used++; |
duke@435 | 113 | p = get_first(); |
duke@435 | 114 | if (p == NULL) p = os::malloc(bytes); |
duke@435 | 115 | } |
duke@435 | 116 | if (p == NULL) |
duke@435 | 117 | vm_exit_out_of_memory(bytes, "ChunkPool::allocate"); |
duke@435 | 118 | |
duke@435 | 119 | return p; |
duke@435 | 120 | } |
duke@435 | 121 | |
duke@435 | 122 | // Return a chunk to the pool |
duke@435 | 123 | void free(Chunk* chunk) { |
duke@435 | 124 | assert(chunk->length() + Chunk::aligned_overhead_size() == _size, "bad size"); |
duke@435 | 125 | ThreadCritical tc; |
duke@435 | 126 | _num_used--; |
duke@435 | 127 | |
duke@435 | 128 | // Add chunk to list |
duke@435 | 129 | chunk->set_next(_first); |
duke@435 | 130 | _first = chunk; |
duke@435 | 131 | _num_chunks++; |
duke@435 | 132 | } |
duke@435 | 133 | |
duke@435 | 134 | // Prune the pool |
duke@435 | 135 | void free_all_but(size_t n) { |
duke@435 | 136 | // if we have more than n chunks, free all of them |
duke@435 | 137 | ThreadCritical tc; |
duke@435 | 138 | if (_num_chunks > n) { |
duke@435 | 139 | // free chunks at end of queue, for better locality |
duke@435 | 140 | Chunk* cur = _first; |
duke@435 | 141 | for (size_t i = 0; i < (n - 1) && cur != NULL; i++) cur = cur->next(); |
duke@435 | 142 | |
duke@435 | 143 | if (cur != NULL) { |
duke@435 | 144 | Chunk* next = cur->next(); |
duke@435 | 145 | cur->set_next(NULL); |
duke@435 | 146 | cur = next; |
duke@435 | 147 | |
duke@435 | 148 | // Free all remaining chunks |
duke@435 | 149 | while(cur != NULL) { |
duke@435 | 150 | next = cur->next(); |
duke@435 | 151 | os::free(cur); |
duke@435 | 152 | _num_chunks--; |
duke@435 | 153 | cur = next; |
duke@435 | 154 | } |
duke@435 | 155 | } |
duke@435 | 156 | } |
duke@435 | 157 | } |
duke@435 | 158 | |
duke@435 | 159 | // Accessors to preallocated pool's |
duke@435 | 160 | static ChunkPool* large_pool() { assert(_large_pool != NULL, "must be initialized"); return _large_pool; } |
duke@435 | 161 | static ChunkPool* medium_pool() { assert(_medium_pool != NULL, "must be initialized"); return _medium_pool; } |
duke@435 | 162 | static ChunkPool* small_pool() { assert(_small_pool != NULL, "must be initialized"); return _small_pool; } |
duke@435 | 163 | |
duke@435 | 164 | static void initialize() { |
duke@435 | 165 | _large_pool = new ChunkPool(Chunk::size + Chunk::aligned_overhead_size()); |
duke@435 | 166 | _medium_pool = new ChunkPool(Chunk::medium_size + Chunk::aligned_overhead_size()); |
duke@435 | 167 | _small_pool = new ChunkPool(Chunk::init_size + Chunk::aligned_overhead_size()); |
duke@435 | 168 | } |
duke@435 | 169 | }; |
duke@435 | 170 | |
duke@435 | 171 | ChunkPool* ChunkPool::_large_pool = NULL; |
duke@435 | 172 | ChunkPool* ChunkPool::_medium_pool = NULL; |
duke@435 | 173 | ChunkPool* ChunkPool::_small_pool = NULL; |
duke@435 | 174 | |
duke@435 | 175 | |
duke@435 | 176 | void chunkpool_init() { |
duke@435 | 177 | ChunkPool::initialize(); |
duke@435 | 178 | } |
duke@435 | 179 | |
duke@435 | 180 | |
duke@435 | 181 | //-------------------------------------------------------------------------------------- |
duke@435 | 182 | // ChunkPoolCleaner implementation |
duke@435 | 183 | |
duke@435 | 184 | class ChunkPoolCleaner : public PeriodicTask { |
duke@435 | 185 | enum { CleaningInterval = 5000, // cleaning interval in ms |
duke@435 | 186 | BlocksToKeep = 5 // # of extra blocks to keep |
duke@435 | 187 | }; |
duke@435 | 188 | |
duke@435 | 189 | public: |
duke@435 | 190 | ChunkPoolCleaner() : PeriodicTask(CleaningInterval) {} |
duke@435 | 191 | void task() { |
duke@435 | 192 | ChunkPool::small_pool()->free_all_but(BlocksToKeep); |
duke@435 | 193 | ChunkPool::medium_pool()->free_all_but(BlocksToKeep); |
duke@435 | 194 | ChunkPool::large_pool()->free_all_but(BlocksToKeep); |
duke@435 | 195 | } |
duke@435 | 196 | }; |
duke@435 | 197 | |
duke@435 | 198 | //-------------------------------------------------------------------------------------- |
duke@435 | 199 | // Chunk implementation |
duke@435 | 200 | |
duke@435 | 201 | void* Chunk::operator new(size_t requested_size, size_t length) { |
duke@435 | 202 | // requested_size is equal to sizeof(Chunk) but in order for the arena |
duke@435 | 203 | // allocations to come out aligned as expected the size must be aligned |
duke@435 | 204 | // to expected arean alignment. |
duke@435 | 205 | // expect requested_size but if sizeof(Chunk) doesn't match isn't proper size we must align it. |
duke@435 | 206 | assert(ARENA_ALIGN(requested_size) == aligned_overhead_size(), "Bad alignment"); |
duke@435 | 207 | size_t bytes = ARENA_ALIGN(requested_size) + length; |
duke@435 | 208 | switch (length) { |
duke@435 | 209 | case Chunk::size: return ChunkPool::large_pool()->allocate(bytes); |
duke@435 | 210 | case Chunk::medium_size: return ChunkPool::medium_pool()->allocate(bytes); |
duke@435 | 211 | case Chunk::init_size: return ChunkPool::small_pool()->allocate(bytes); |
duke@435 | 212 | default: { |
duke@435 | 213 | void *p = os::malloc(bytes); |
duke@435 | 214 | if (p == NULL) |
duke@435 | 215 | vm_exit_out_of_memory(bytes, "Chunk::new"); |
duke@435 | 216 | return p; |
duke@435 | 217 | } |
duke@435 | 218 | } |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | void Chunk::operator delete(void* p) { |
duke@435 | 222 | Chunk* c = (Chunk*)p; |
duke@435 | 223 | switch (c->length()) { |
duke@435 | 224 | case Chunk::size: ChunkPool::large_pool()->free(c); break; |
duke@435 | 225 | case Chunk::medium_size: ChunkPool::medium_pool()->free(c); break; |
duke@435 | 226 | case Chunk::init_size: ChunkPool::small_pool()->free(c); break; |
duke@435 | 227 | default: os::free(c); |
duke@435 | 228 | } |
duke@435 | 229 | } |
duke@435 | 230 | |
duke@435 | 231 | Chunk::Chunk(size_t length) : _len(length) { |
duke@435 | 232 | _next = NULL; // Chain on the linked list |
duke@435 | 233 | } |
duke@435 | 234 | |
duke@435 | 235 | |
duke@435 | 236 | void Chunk::chop() { |
duke@435 | 237 | Chunk *k = this; |
duke@435 | 238 | while( k ) { |
duke@435 | 239 | Chunk *tmp = k->next(); |
duke@435 | 240 | // clear out this chunk (to detect allocation bugs) |
duke@435 | 241 | if (ZapResourceArea) memset(k->bottom(), badResourceValue, k->length()); |
duke@435 | 242 | delete k; // Free chunk (was malloc'd) |
duke@435 | 243 | k = tmp; |
duke@435 | 244 | } |
duke@435 | 245 | } |
duke@435 | 246 | |
duke@435 | 247 | void Chunk::next_chop() { |
duke@435 | 248 | _next->chop(); |
duke@435 | 249 | _next = NULL; |
duke@435 | 250 | } |
duke@435 | 251 | |
duke@435 | 252 | |
duke@435 | 253 | void Chunk::start_chunk_pool_cleaner_task() { |
duke@435 | 254 | #ifdef ASSERT |
duke@435 | 255 | static bool task_created = false; |
duke@435 | 256 | assert(!task_created, "should not start chuck pool cleaner twice"); |
duke@435 | 257 | task_created = true; |
duke@435 | 258 | #endif |
duke@435 | 259 | ChunkPoolCleaner* cleaner = new ChunkPoolCleaner(); |
duke@435 | 260 | cleaner->enroll(); |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | //------------------------------Arena------------------------------------------ |
duke@435 | 264 | |
duke@435 | 265 | Arena::Arena(size_t init_size) { |
duke@435 | 266 | size_t round_size = (sizeof (char *)) - 1; |
duke@435 | 267 | init_size = (init_size+round_size) & ~round_size; |
duke@435 | 268 | _first = _chunk = new (init_size) Chunk(init_size); |
duke@435 | 269 | _hwm = _chunk->bottom(); // Save the cached hwm, max |
duke@435 | 270 | _max = _chunk->top(); |
duke@435 | 271 | set_size_in_bytes(init_size); |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | Arena::Arena() { |
duke@435 | 275 | _first = _chunk = new (Chunk::init_size) Chunk(Chunk::init_size); |
duke@435 | 276 | _hwm = _chunk->bottom(); // Save the cached hwm, max |
duke@435 | 277 | _max = _chunk->top(); |
duke@435 | 278 | set_size_in_bytes(Chunk::init_size); |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | Arena::Arena(Arena *a) : _chunk(a->_chunk), _hwm(a->_hwm), _max(a->_max), _first(a->_first) { |
duke@435 | 282 | set_size_in_bytes(a->size_in_bytes()); |
duke@435 | 283 | } |
duke@435 | 284 | |
duke@435 | 285 | Arena *Arena::move_contents(Arena *copy) { |
duke@435 | 286 | copy->destruct_contents(); |
duke@435 | 287 | copy->_chunk = _chunk; |
duke@435 | 288 | copy->_hwm = _hwm; |
duke@435 | 289 | copy->_max = _max; |
duke@435 | 290 | copy->_first = _first; |
duke@435 | 291 | copy->set_size_in_bytes(size_in_bytes()); |
duke@435 | 292 | // Destroy original arena |
duke@435 | 293 | reset(); |
duke@435 | 294 | return copy; // Return Arena with contents |
duke@435 | 295 | } |
duke@435 | 296 | |
duke@435 | 297 | Arena::~Arena() { |
duke@435 | 298 | destruct_contents(); |
duke@435 | 299 | } |
duke@435 | 300 | |
duke@435 | 301 | // Destroy this arenas contents and reset to empty |
duke@435 | 302 | void Arena::destruct_contents() { |
duke@435 | 303 | if (UseMallocOnly && _first != NULL) { |
duke@435 | 304 | char* end = _first->next() ? _first->top() : _hwm; |
duke@435 | 305 | free_malloced_objects(_first, _first->bottom(), end, _hwm); |
duke@435 | 306 | } |
duke@435 | 307 | _first->chop(); |
duke@435 | 308 | reset(); |
duke@435 | 309 | } |
duke@435 | 310 | |
duke@435 | 311 | |
duke@435 | 312 | // Total of all Chunks in arena |
duke@435 | 313 | size_t Arena::used() const { |
duke@435 | 314 | size_t sum = _chunk->length() - (_max-_hwm); // Size leftover in this Chunk |
duke@435 | 315 | register Chunk *k = _first; |
duke@435 | 316 | while( k != _chunk) { // Whilst have Chunks in a row |
duke@435 | 317 | sum += k->length(); // Total size of this Chunk |
duke@435 | 318 | k = k->next(); // Bump along to next Chunk |
duke@435 | 319 | } |
duke@435 | 320 | return sum; // Return total consumed space. |
duke@435 | 321 | } |
duke@435 | 322 | |
duke@435 | 323 | |
duke@435 | 324 | // Grow a new Chunk |
duke@435 | 325 | void* Arena::grow( size_t x ) { |
duke@435 | 326 | // Get minimal required size. Either real big, or even bigger for giant objs |
duke@435 | 327 | size_t len = MAX2(x, (size_t) Chunk::size); |
duke@435 | 328 | |
duke@435 | 329 | Chunk *k = _chunk; // Get filled-up chunk address |
duke@435 | 330 | _chunk = new (len) Chunk(len); |
duke@435 | 331 | |
duke@435 | 332 | if (_chunk == NULL) |
duke@435 | 333 | vm_exit_out_of_memory(len * Chunk::aligned_overhead_size(), "Arena::grow"); |
duke@435 | 334 | |
duke@435 | 335 | if (k) k->set_next(_chunk); // Append new chunk to end of linked list |
duke@435 | 336 | else _first = _chunk; |
duke@435 | 337 | _hwm = _chunk->bottom(); // Save the cached hwm, max |
duke@435 | 338 | _max = _chunk->top(); |
duke@435 | 339 | set_size_in_bytes(size_in_bytes() + len); |
duke@435 | 340 | void* result = _hwm; |
duke@435 | 341 | _hwm += x; |
duke@435 | 342 | return result; |
duke@435 | 343 | } |
duke@435 | 344 | |
duke@435 | 345 | |
duke@435 | 346 | |
duke@435 | 347 | // Reallocate storage in Arena. |
duke@435 | 348 | void *Arena::Arealloc(void* old_ptr, size_t old_size, size_t new_size) { |
duke@435 | 349 | assert(new_size >= 0, "bad size"); |
duke@435 | 350 | if (new_size == 0) return NULL; |
duke@435 | 351 | #ifdef ASSERT |
duke@435 | 352 | if (UseMallocOnly) { |
duke@435 | 353 | // always allocate a new object (otherwise we'll free this one twice) |
duke@435 | 354 | char* copy = (char*)Amalloc(new_size); |
duke@435 | 355 | size_t n = MIN2(old_size, new_size); |
duke@435 | 356 | if (n > 0) memcpy(copy, old_ptr, n); |
duke@435 | 357 | Afree(old_ptr,old_size); // Mostly done to keep stats accurate |
duke@435 | 358 | return copy; |
duke@435 | 359 | } |
duke@435 | 360 | #endif |
duke@435 | 361 | char *c_old = (char*)old_ptr; // Handy name |
duke@435 | 362 | // Stupid fast special case |
duke@435 | 363 | if( new_size <= old_size ) { // Shrink in-place |
duke@435 | 364 | if( c_old+old_size == _hwm) // Attempt to free the excess bytes |
duke@435 | 365 | _hwm = c_old+new_size; // Adjust hwm |
duke@435 | 366 | return c_old; |
duke@435 | 367 | } |
duke@435 | 368 | |
duke@435 | 369 | // make sure that new_size is legal |
duke@435 | 370 | size_t corrected_new_size = ARENA_ALIGN(new_size); |
duke@435 | 371 | |
duke@435 | 372 | // See if we can resize in-place |
duke@435 | 373 | if( (c_old+old_size == _hwm) && // Adjusting recent thing |
duke@435 | 374 | (c_old+corrected_new_size <= _max) ) { // Still fits where it sits |
duke@435 | 375 | _hwm = c_old+corrected_new_size; // Adjust hwm |
duke@435 | 376 | return c_old; // Return old pointer |
duke@435 | 377 | } |
duke@435 | 378 | |
duke@435 | 379 | // Oops, got to relocate guts |
duke@435 | 380 | void *new_ptr = Amalloc(new_size); |
duke@435 | 381 | memcpy( new_ptr, c_old, old_size ); |
duke@435 | 382 | Afree(c_old,old_size); // Mostly done to keep stats accurate |
duke@435 | 383 | return new_ptr; |
duke@435 | 384 | } |
duke@435 | 385 | |
duke@435 | 386 | |
duke@435 | 387 | // Determine if pointer belongs to this Arena or not. |
duke@435 | 388 | bool Arena::contains( const void *ptr ) const { |
duke@435 | 389 | #ifdef ASSERT |
duke@435 | 390 | if (UseMallocOnly) { |
duke@435 | 391 | // really slow, but not easy to make fast |
duke@435 | 392 | if (_chunk == NULL) return false; |
duke@435 | 393 | char** bottom = (char**)_chunk->bottom(); |
duke@435 | 394 | for (char** p = (char**)_hwm - 1; p >= bottom; p--) { |
duke@435 | 395 | if (*p == ptr) return true; |
duke@435 | 396 | } |
duke@435 | 397 | for (Chunk *c = _first; c != NULL; c = c->next()) { |
duke@435 | 398 | if (c == _chunk) continue; // current chunk has been processed |
duke@435 | 399 | char** bottom = (char**)c->bottom(); |
duke@435 | 400 | for (char** p = (char**)c->top() - 1; p >= bottom; p--) { |
duke@435 | 401 | if (*p == ptr) return true; |
duke@435 | 402 | } |
duke@435 | 403 | } |
duke@435 | 404 | return false; |
duke@435 | 405 | } |
duke@435 | 406 | #endif |
duke@435 | 407 | if( (void*)_chunk->bottom() <= ptr && ptr < (void*)_hwm ) |
duke@435 | 408 | return true; // Check for in this chunk |
duke@435 | 409 | for (Chunk *c = _first; c; c = c->next()) { |
duke@435 | 410 | if (c == _chunk) continue; // current chunk has been processed |
duke@435 | 411 | if ((void*)c->bottom() <= ptr && ptr < (void*)c->top()) { |
duke@435 | 412 | return true; // Check for every chunk in Arena |
duke@435 | 413 | } |
duke@435 | 414 | } |
duke@435 | 415 | return false; // Not in any Chunk, so not in Arena |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | |
duke@435 | 419 | #ifdef ASSERT |
duke@435 | 420 | void* Arena::malloc(size_t size) { |
duke@435 | 421 | assert(UseMallocOnly, "shouldn't call"); |
duke@435 | 422 | // use malloc, but save pointer in res. area for later freeing |
duke@435 | 423 | char** save = (char**)internal_malloc_4(sizeof(char*)); |
duke@435 | 424 | return (*save = (char*)os::malloc(size)); |
duke@435 | 425 | } |
duke@435 | 426 | |
duke@435 | 427 | // for debugging with UseMallocOnly |
duke@435 | 428 | void* Arena::internal_malloc_4(size_t x) { |
duke@435 | 429 | assert( (x&(sizeof(char*)-1)) == 0, "misaligned size" ); |
duke@435 | 430 | if (_hwm + x > _max) { |
duke@435 | 431 | return grow(x); |
duke@435 | 432 | } else { |
duke@435 | 433 | char *old = _hwm; |
duke@435 | 434 | _hwm += x; |
duke@435 | 435 | return old; |
duke@435 | 436 | } |
duke@435 | 437 | } |
duke@435 | 438 | #endif |
duke@435 | 439 | |
duke@435 | 440 | |
duke@435 | 441 | //-------------------------------------------------------------------------------------- |
duke@435 | 442 | // Non-product code |
duke@435 | 443 | |
duke@435 | 444 | #ifndef PRODUCT |
duke@435 | 445 | // The global operator new should never be called since it will usually indicate |
duke@435 | 446 | // a memory leak. Use CHeapObj as the base class of such objects to make it explicit |
duke@435 | 447 | // that they're allocated on the C heap. |
duke@435 | 448 | // Commented out in product version to avoid conflicts with third-party C++ native code. |
duke@435 | 449 | // %% note this is causing a problem on solaris debug build. the global |
duke@435 | 450 | // new is being called from jdk source and causing data corruption. |
duke@435 | 451 | // src/share/native/sun/awt/font/fontmanager/textcache/hsMemory.cpp::hsSoftNew |
duke@435 | 452 | // define CATCH_OPERATOR_NEW_USAGE if you want to use this. |
duke@435 | 453 | #ifdef CATCH_OPERATOR_NEW_USAGE |
duke@435 | 454 | void* operator new(size_t size){ |
duke@435 | 455 | static bool warned = false; |
duke@435 | 456 | if (!warned && warn_new_operator) |
duke@435 | 457 | warning("should not call global (default) operator new"); |
duke@435 | 458 | warned = true; |
duke@435 | 459 | return (void *) AllocateHeap(size, "global operator new"); |
duke@435 | 460 | } |
duke@435 | 461 | #endif |
duke@435 | 462 | |
duke@435 | 463 | void AllocatedObj::print() const { print_on(tty); } |
duke@435 | 464 | void AllocatedObj::print_value() const { print_value_on(tty); } |
duke@435 | 465 | |
duke@435 | 466 | void AllocatedObj::print_on(outputStream* st) const { |
duke@435 | 467 | st->print_cr("AllocatedObj(" INTPTR_FORMAT ")", this); |
duke@435 | 468 | } |
duke@435 | 469 | |
duke@435 | 470 | void AllocatedObj::print_value_on(outputStream* st) const { |
duke@435 | 471 | st->print("AllocatedObj(" INTPTR_FORMAT ")", this); |
duke@435 | 472 | } |
duke@435 | 473 | |
duke@435 | 474 | size_t Arena::_bytes_allocated = 0; |
duke@435 | 475 | |
duke@435 | 476 | AllocStats::AllocStats() { |
duke@435 | 477 | start_mallocs = os::num_mallocs; |
duke@435 | 478 | start_frees = os::num_frees; |
duke@435 | 479 | start_malloc_bytes = os::alloc_bytes; |
duke@435 | 480 | start_res_bytes = Arena::_bytes_allocated; |
duke@435 | 481 | } |
duke@435 | 482 | |
duke@435 | 483 | int AllocStats::num_mallocs() { return os::num_mallocs - start_mallocs; } |
duke@435 | 484 | size_t AllocStats::alloc_bytes() { return os::alloc_bytes - start_malloc_bytes; } |
duke@435 | 485 | size_t AllocStats::resource_bytes() { return Arena::_bytes_allocated - start_res_bytes; } |
duke@435 | 486 | int AllocStats::num_frees() { return os::num_frees - start_frees; } |
duke@435 | 487 | void AllocStats::print() { |
duke@435 | 488 | tty->print("%d mallocs (%ldK), %d frees, %ldK resrc", |
duke@435 | 489 | num_mallocs(), alloc_bytes()/K, num_frees(), resource_bytes()/K); |
duke@435 | 490 | } |
duke@435 | 491 | |
duke@435 | 492 | |
duke@435 | 493 | // debugging code |
duke@435 | 494 | inline void Arena::free_all(char** start, char** end) { |
duke@435 | 495 | for (char** p = start; p < end; p++) if (*p) os::free(*p); |
duke@435 | 496 | } |
duke@435 | 497 | |
duke@435 | 498 | void Arena::free_malloced_objects(Chunk* chunk, char* hwm, char* max, char* hwm2) { |
duke@435 | 499 | assert(UseMallocOnly, "should not call"); |
duke@435 | 500 | // free all objects malloced since resource mark was created; resource area |
duke@435 | 501 | // contains their addresses |
duke@435 | 502 | if (chunk->next()) { |
duke@435 | 503 | // this chunk is full, and some others too |
duke@435 | 504 | for (Chunk* c = chunk->next(); c != NULL; c = c->next()) { |
duke@435 | 505 | char* top = c->top(); |
duke@435 | 506 | if (c->next() == NULL) { |
duke@435 | 507 | top = hwm2; // last junk is only used up to hwm2 |
duke@435 | 508 | assert(c->contains(hwm2), "bad hwm2"); |
duke@435 | 509 | } |
duke@435 | 510 | free_all((char**)c->bottom(), (char**)top); |
duke@435 | 511 | } |
duke@435 | 512 | assert(chunk->contains(hwm), "bad hwm"); |
duke@435 | 513 | assert(chunk->contains(max), "bad max"); |
duke@435 | 514 | free_all((char**)hwm, (char**)max); |
duke@435 | 515 | } else { |
duke@435 | 516 | // this chunk was partially used |
duke@435 | 517 | assert(chunk->contains(hwm), "bad hwm"); |
duke@435 | 518 | assert(chunk->contains(hwm2), "bad hwm2"); |
duke@435 | 519 | free_all((char**)hwm, (char**)hwm2); |
duke@435 | 520 | } |
duke@435 | 521 | } |
duke@435 | 522 | |
duke@435 | 523 | |
duke@435 | 524 | ReallocMark::ReallocMark() { |
duke@435 | 525 | #ifdef ASSERT |
duke@435 | 526 | Thread *thread = ThreadLocalStorage::get_thread_slow(); |
duke@435 | 527 | _nesting = thread->resource_area()->nesting(); |
duke@435 | 528 | #endif |
duke@435 | 529 | } |
duke@435 | 530 | |
duke@435 | 531 | void ReallocMark::check() { |
duke@435 | 532 | #ifdef ASSERT |
duke@435 | 533 | if (_nesting != Thread::current()->resource_area()->nesting()) { |
duke@435 | 534 | fatal("allocation bug: array could grow within nested ResourceMark"); |
duke@435 | 535 | } |
duke@435 | 536 | #endif |
duke@435 | 537 | } |
duke@435 | 538 | |
duke@435 | 539 | #endif // Non-product |