Thu, 27 May 2010 19:08:38 -0700
6941466: Oracle rebranding changes for Hotspot repositories
Summary: Change all the Sun copyrights to Oracle copyright
Reviewed-by: ohair
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1997, 2005, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #define ARENA_ALIGN_M1 (((size_t)(ARENA_AMALLOC_ALIGNMENT)) - 1) |
duke@435 | 26 | #define ARENA_ALIGN_MASK (~((size_t)ARENA_ALIGN_M1)) |
duke@435 | 27 | #define ARENA_ALIGN(x) ((((size_t)(x)) + ARENA_ALIGN_M1) & ARENA_ALIGN_MASK) |
duke@435 | 28 | |
duke@435 | 29 | // All classes in the virtual machine must be subclassed |
duke@435 | 30 | // by one of the following allocation classes: |
duke@435 | 31 | // |
duke@435 | 32 | // For objects allocated in the resource area (see resourceArea.hpp). |
duke@435 | 33 | // - ResourceObj |
duke@435 | 34 | // |
duke@435 | 35 | // For objects allocated in the C-heap (managed by: free & malloc). |
duke@435 | 36 | // - CHeapObj |
duke@435 | 37 | // |
duke@435 | 38 | // For objects allocated on the stack. |
duke@435 | 39 | // - StackObj |
duke@435 | 40 | // |
duke@435 | 41 | // For embedded objects. |
duke@435 | 42 | // - ValueObj |
duke@435 | 43 | // |
duke@435 | 44 | // For classes used as name spaces. |
duke@435 | 45 | // - AllStatic |
duke@435 | 46 | // |
duke@435 | 47 | // The printable subclasses are used for debugging and define virtual |
duke@435 | 48 | // member functions for printing. Classes that avoid allocating the |
duke@435 | 49 | // vtbl entries in the objects should therefore not be the printable |
duke@435 | 50 | // subclasses. |
duke@435 | 51 | // |
duke@435 | 52 | // The following macros and function should be used to allocate memory |
duke@435 | 53 | // directly in the resource area or in the C-heap: |
duke@435 | 54 | // |
duke@435 | 55 | // NEW_RESOURCE_ARRAY(type,size) |
duke@435 | 56 | // NEW_RESOURCE_OBJ(type) |
duke@435 | 57 | // NEW_C_HEAP_ARRAY(type,size) |
duke@435 | 58 | // NEW_C_HEAP_OBJ(type) |
duke@435 | 59 | // char* AllocateHeap(size_t size, const char* name); |
duke@435 | 60 | // void FreeHeap(void* p); |
duke@435 | 61 | // |
duke@435 | 62 | // C-heap allocation can be traced using +PrintHeapAllocation. |
duke@435 | 63 | // malloc and free should therefore never called directly. |
duke@435 | 64 | |
duke@435 | 65 | // Base class for objects allocated in the C-heap. |
duke@435 | 66 | |
duke@435 | 67 | // In non product mode we introduce a super class for all allocation classes |
duke@435 | 68 | // that supports printing. |
duke@435 | 69 | // We avoid the superclass in product mode since some C++ compilers add |
duke@435 | 70 | // a word overhead for empty super classes. |
duke@435 | 71 | |
duke@435 | 72 | #ifdef PRODUCT |
duke@435 | 73 | #define ALLOCATION_SUPER_CLASS_SPEC |
duke@435 | 74 | #else |
duke@435 | 75 | #define ALLOCATION_SUPER_CLASS_SPEC : public AllocatedObj |
duke@435 | 76 | class AllocatedObj { |
duke@435 | 77 | public: |
duke@435 | 78 | // Printing support |
duke@435 | 79 | void print() const; |
duke@435 | 80 | void print_value() const; |
duke@435 | 81 | |
duke@435 | 82 | virtual void print_on(outputStream* st) const; |
duke@435 | 83 | virtual void print_value_on(outputStream* st) const; |
duke@435 | 84 | }; |
duke@435 | 85 | #endif |
duke@435 | 86 | |
duke@435 | 87 | class CHeapObj ALLOCATION_SUPER_CLASS_SPEC { |
duke@435 | 88 | public: |
duke@435 | 89 | void* operator new(size_t size); |
duke@435 | 90 | void operator delete(void* p); |
duke@435 | 91 | void* new_array(size_t size); |
duke@435 | 92 | }; |
duke@435 | 93 | |
duke@435 | 94 | // Base class for objects allocated on the stack only. |
duke@435 | 95 | // Calling new or delete will result in fatal error. |
duke@435 | 96 | |
duke@435 | 97 | class StackObj ALLOCATION_SUPER_CLASS_SPEC { |
duke@435 | 98 | public: |
duke@435 | 99 | void* operator new(size_t size); |
duke@435 | 100 | void operator delete(void* p); |
duke@435 | 101 | }; |
duke@435 | 102 | |
duke@435 | 103 | // Base class for objects used as value objects. |
duke@435 | 104 | // Calling new or delete will result in fatal error. |
duke@435 | 105 | // |
duke@435 | 106 | // Portability note: Certain compilers (e.g. gcc) will |
duke@435 | 107 | // always make classes bigger if it has a superclass, even |
duke@435 | 108 | // if the superclass does not have any virtual methods or |
duke@435 | 109 | // instance fields. The HotSpot implementation relies on this |
duke@435 | 110 | // not to happen. So never make a ValueObj class a direct subclass |
duke@435 | 111 | // of this object, but use the VALUE_OBJ_CLASS_SPEC class instead, e.g., |
duke@435 | 112 | // like this: |
duke@435 | 113 | // |
duke@435 | 114 | // class A VALUE_OBJ_CLASS_SPEC { |
duke@435 | 115 | // ... |
duke@435 | 116 | // } |
duke@435 | 117 | // |
duke@435 | 118 | // With gcc and possible other compilers the VALUE_OBJ_CLASS_SPEC can |
duke@435 | 119 | // be defined as a an empty string "". |
duke@435 | 120 | // |
duke@435 | 121 | class _ValueObj { |
duke@435 | 122 | public: |
duke@435 | 123 | void* operator new(size_t size); |
duke@435 | 124 | void operator delete(void* p); |
duke@435 | 125 | }; |
duke@435 | 126 | |
duke@435 | 127 | // Base class for classes that constitute name spaces. |
duke@435 | 128 | |
duke@435 | 129 | class AllStatic { |
duke@435 | 130 | public: |
duke@435 | 131 | AllStatic() { ShouldNotCallThis(); } |
duke@435 | 132 | ~AllStatic() { ShouldNotCallThis(); } |
duke@435 | 133 | }; |
duke@435 | 134 | |
duke@435 | 135 | |
duke@435 | 136 | //------------------------------Chunk------------------------------------------ |
duke@435 | 137 | // Linked list of raw memory chunks |
duke@435 | 138 | class Chunk: public CHeapObj { |
duke@435 | 139 | protected: |
duke@435 | 140 | Chunk* _next; // Next Chunk in list |
duke@435 | 141 | const size_t _len; // Size of this Chunk |
duke@435 | 142 | public: |
duke@435 | 143 | void* operator new(size_t size, size_t length); |
duke@435 | 144 | void operator delete(void* p); |
duke@435 | 145 | Chunk(size_t length); |
duke@435 | 146 | |
duke@435 | 147 | enum { |
duke@435 | 148 | // default sizes; make them slightly smaller than 2**k to guard against |
duke@435 | 149 | // buddy-system style malloc implementations |
duke@435 | 150 | #ifdef _LP64 |
duke@435 | 151 | slack = 40, // [RGV] Not sure if this is right, but make it |
duke@435 | 152 | // a multiple of 8. |
duke@435 | 153 | #else |
duke@435 | 154 | slack = 20, // suspected sizeof(Chunk) + internal malloc headers |
duke@435 | 155 | #endif |
duke@435 | 156 | |
duke@435 | 157 | init_size = 1*K - slack, // Size of first chunk |
duke@435 | 158 | medium_size= 10*K - slack, // Size of medium-sized chunk |
duke@435 | 159 | size = 32*K - slack, // Default size of an Arena chunk (following the first) |
duke@435 | 160 | non_pool_size = init_size + 32 // An initial size which is not one of above |
duke@435 | 161 | }; |
duke@435 | 162 | |
duke@435 | 163 | void chop(); // Chop this chunk |
duke@435 | 164 | void next_chop(); // Chop next chunk |
duke@435 | 165 | static size_t aligned_overhead_size(void) { return ARENA_ALIGN(sizeof(Chunk)); } |
duke@435 | 166 | |
duke@435 | 167 | size_t length() const { return _len; } |
duke@435 | 168 | Chunk* next() const { return _next; } |
duke@435 | 169 | void set_next(Chunk* n) { _next = n; } |
duke@435 | 170 | // Boundaries of data area (possibly unused) |
duke@435 | 171 | char* bottom() const { return ((char*) this) + aligned_overhead_size(); } |
duke@435 | 172 | char* top() const { return bottom() + _len; } |
duke@435 | 173 | bool contains(char* p) const { return bottom() <= p && p <= top(); } |
duke@435 | 174 | |
duke@435 | 175 | // Start the chunk_pool cleaner task |
duke@435 | 176 | static void start_chunk_pool_cleaner_task(); |
duke@435 | 177 | }; |
duke@435 | 178 | |
duke@435 | 179 | |
duke@435 | 180 | //------------------------------Arena------------------------------------------ |
duke@435 | 181 | // Fast allocation of memory |
duke@435 | 182 | class Arena: public CHeapObj { |
duke@435 | 183 | protected: |
duke@435 | 184 | friend class ResourceMark; |
duke@435 | 185 | friend class HandleMark; |
duke@435 | 186 | friend class NoHandleMark; |
duke@435 | 187 | Chunk *_first; // First chunk |
duke@435 | 188 | Chunk *_chunk; // current chunk |
duke@435 | 189 | char *_hwm, *_max; // High water mark and max in current chunk |
duke@435 | 190 | void* grow(size_t x); // Get a new Chunk of at least size x |
duke@435 | 191 | NOT_PRODUCT(size_t _size_in_bytes;) // Size of arena (used for memory usage tracing) |
duke@435 | 192 | NOT_PRODUCT(static size_t _bytes_allocated;) // total #bytes allocated since start |
duke@435 | 193 | friend class AllocStats; |
duke@435 | 194 | debug_only(void* malloc(size_t size);) |
duke@435 | 195 | debug_only(void* internal_malloc_4(size_t x);) |
duke@435 | 196 | public: |
duke@435 | 197 | Arena(); |
duke@435 | 198 | Arena(size_t init_size); |
duke@435 | 199 | Arena(Arena *old); |
duke@435 | 200 | ~Arena(); |
duke@435 | 201 | void destruct_contents(); |
duke@435 | 202 | char* hwm() const { return _hwm; } |
duke@435 | 203 | |
duke@435 | 204 | // Fast allocate in the arena. Common case is: pointer test + increment. |
duke@435 | 205 | void* Amalloc(size_t x) { |
duke@435 | 206 | assert(is_power_of_2(ARENA_AMALLOC_ALIGNMENT) , "should be a power of 2"); |
duke@435 | 207 | x = ARENA_ALIGN(x); |
duke@435 | 208 | debug_only(if (UseMallocOnly) return malloc(x);) |
duke@435 | 209 | NOT_PRODUCT(_bytes_allocated += x); |
duke@435 | 210 | if (_hwm + x > _max) { |
duke@435 | 211 | return grow(x); |
duke@435 | 212 | } else { |
duke@435 | 213 | char *old = _hwm; |
duke@435 | 214 | _hwm += x; |
duke@435 | 215 | return old; |
duke@435 | 216 | } |
duke@435 | 217 | } |
duke@435 | 218 | // Further assume size is padded out to words |
duke@435 | 219 | void *Amalloc_4(size_t x) { |
duke@435 | 220 | assert( (x&(sizeof(char*)-1)) == 0, "misaligned size" ); |
duke@435 | 221 | debug_only(if (UseMallocOnly) return malloc(x);) |
duke@435 | 222 | NOT_PRODUCT(_bytes_allocated += x); |
duke@435 | 223 | if (_hwm + x > _max) { |
duke@435 | 224 | return grow(x); |
duke@435 | 225 | } else { |
duke@435 | 226 | char *old = _hwm; |
duke@435 | 227 | _hwm += x; |
duke@435 | 228 | return old; |
duke@435 | 229 | } |
duke@435 | 230 | } |
duke@435 | 231 | |
duke@435 | 232 | // Allocate with 'double' alignment. It is 8 bytes on sparc. |
duke@435 | 233 | // In other cases Amalloc_D() should be the same as Amalloc_4(). |
duke@435 | 234 | void* Amalloc_D(size_t x) { |
duke@435 | 235 | assert( (x&(sizeof(char*)-1)) == 0, "misaligned size" ); |
duke@435 | 236 | debug_only(if (UseMallocOnly) return malloc(x);) |
duke@435 | 237 | #if defined(SPARC) && !defined(_LP64) |
duke@435 | 238 | #define DALIGN_M1 7 |
duke@435 | 239 | size_t delta = (((size_t)_hwm + DALIGN_M1) & ~DALIGN_M1) - (size_t)_hwm; |
duke@435 | 240 | x += delta; |
duke@435 | 241 | #endif |
duke@435 | 242 | NOT_PRODUCT(_bytes_allocated += x); |
duke@435 | 243 | if (_hwm + x > _max) { |
duke@435 | 244 | return grow(x); // grow() returns a result aligned >= 8 bytes. |
duke@435 | 245 | } else { |
duke@435 | 246 | char *old = _hwm; |
duke@435 | 247 | _hwm += x; |
duke@435 | 248 | #if defined(SPARC) && !defined(_LP64) |
duke@435 | 249 | old += delta; // align to 8-bytes |
duke@435 | 250 | #endif |
duke@435 | 251 | return old; |
duke@435 | 252 | } |
duke@435 | 253 | } |
duke@435 | 254 | |
duke@435 | 255 | // Fast delete in area. Common case is: NOP (except for storage reclaimed) |
duke@435 | 256 | void Afree(void *ptr, size_t size) { |
duke@435 | 257 | #ifdef ASSERT |
duke@435 | 258 | if (ZapResourceArea) memset(ptr, badResourceValue, size); // zap freed memory |
duke@435 | 259 | if (UseMallocOnly) return; |
duke@435 | 260 | #endif |
duke@435 | 261 | if (((char*)ptr) + size == _hwm) _hwm = (char*)ptr; |
duke@435 | 262 | } |
duke@435 | 263 | |
duke@435 | 264 | void *Arealloc( void *old_ptr, size_t old_size, size_t new_size ); |
duke@435 | 265 | |
duke@435 | 266 | // Move contents of this arena into an empty arena |
duke@435 | 267 | Arena *move_contents(Arena *empty_arena); |
duke@435 | 268 | |
duke@435 | 269 | // Determine if pointer belongs to this Arena or not. |
duke@435 | 270 | bool contains( const void *ptr ) const; |
duke@435 | 271 | |
duke@435 | 272 | // Total of all chunks in use (not thread-safe) |
duke@435 | 273 | size_t used() const; |
duke@435 | 274 | |
duke@435 | 275 | // Total # of bytes used |
duke@435 | 276 | size_t size_in_bytes() const NOT_PRODUCT({ return _size_in_bytes; }) PRODUCT_RETURN0; |
duke@435 | 277 | void set_size_in_bytes(size_t size) NOT_PRODUCT({ _size_in_bytes = size; }) PRODUCT_RETURN; |
duke@435 | 278 | static void free_malloced_objects(Chunk* chunk, char* hwm, char* max, char* hwm2) PRODUCT_RETURN; |
duke@435 | 279 | static void free_all(char** start, char** end) PRODUCT_RETURN; |
duke@435 | 280 | |
duke@435 | 281 | private: |
duke@435 | 282 | // Reset this Arena to empty, access will trigger grow if necessary |
duke@435 | 283 | void reset(void) { |
duke@435 | 284 | _first = _chunk = NULL; |
duke@435 | 285 | _hwm = _max = NULL; |
duke@435 | 286 | } |
duke@435 | 287 | }; |
duke@435 | 288 | |
duke@435 | 289 | // One of the following macros must be used when allocating |
duke@435 | 290 | // an array or object from an arena |
duke@435 | 291 | #define NEW_ARENA_ARRAY(arena, type, size)\ |
duke@435 | 292 | (type*) arena->Amalloc((size) * sizeof(type)) |
duke@435 | 293 | |
duke@435 | 294 | #define REALLOC_ARENA_ARRAY(arena, type, old, old_size, new_size)\ |
duke@435 | 295 | (type*) arena->Arealloc((char*)(old), (old_size) * sizeof(type), (new_size) * sizeof(type) ) |
duke@435 | 296 | |
duke@435 | 297 | #define FREE_ARENA_ARRAY(arena, type, old, size)\ |
duke@435 | 298 | arena->Afree((char*)(old), (size) * sizeof(type)) |
duke@435 | 299 | |
duke@435 | 300 | #define NEW_ARENA_OBJ(arena, type)\ |
duke@435 | 301 | NEW_ARENA_ARRAY(arena, type, 1) |
duke@435 | 302 | |
duke@435 | 303 | |
duke@435 | 304 | //%note allocation_1 |
duke@435 | 305 | extern char* resource_allocate_bytes(size_t size); |
duke@435 | 306 | extern char* resource_allocate_bytes(Thread* thread, size_t size); |
duke@435 | 307 | extern char* resource_reallocate_bytes( char *old, size_t old_size, size_t new_size); |
duke@435 | 308 | extern void resource_free_bytes( char *old, size_t size ); |
duke@435 | 309 | |
duke@435 | 310 | //---------------------------------------------------------------------- |
duke@435 | 311 | // Base class for objects allocated in the resource area per default. |
duke@435 | 312 | // Optionally, objects may be allocated on the C heap with |
duke@435 | 313 | // new(ResourceObj::C_HEAP) Foo(...) or in an Arena with new (&arena) |
duke@435 | 314 | // ResourceObj's can be allocated within other objects, but don't use |
duke@435 | 315 | // new or delete (allocation_type is unknown). If new is used to allocate, |
duke@435 | 316 | // use delete to deallocate. |
duke@435 | 317 | class ResourceObj ALLOCATION_SUPER_CLASS_SPEC { |
duke@435 | 318 | public: |
duke@435 | 319 | enum allocation_type { UNKNOWN = 0, C_HEAP, RESOURCE_AREA, ARENA }; |
duke@435 | 320 | #ifdef ASSERT |
duke@435 | 321 | private: |
duke@435 | 322 | allocation_type _allocation; |
duke@435 | 323 | public: |
duke@435 | 324 | bool allocated_on_C_heap() { return _allocation == C_HEAP; } |
duke@435 | 325 | #endif // ASSERT |
duke@435 | 326 | |
duke@435 | 327 | public: |
duke@435 | 328 | void* operator new(size_t size, allocation_type type); |
duke@435 | 329 | void* operator new(size_t size, Arena *arena) { |
duke@435 | 330 | address res = (address)arena->Amalloc(size); |
duke@435 | 331 | // Set allocation type in the resource object |
duke@435 | 332 | DEBUG_ONLY(((ResourceObj *)res)->_allocation = ARENA;) |
duke@435 | 333 | return res; |
duke@435 | 334 | } |
duke@435 | 335 | void* operator new(size_t size) { |
duke@435 | 336 | address res = (address)resource_allocate_bytes(size); |
duke@435 | 337 | // Set allocation type in the resource object |
duke@435 | 338 | DEBUG_ONLY(((ResourceObj *)res)->_allocation = RESOURCE_AREA;) |
duke@435 | 339 | return res; |
duke@435 | 340 | } |
ysr@777 | 341 | void* operator new(size_t size, void* where, allocation_type type) { |
ysr@777 | 342 | void* res = where; |
ysr@777 | 343 | // Set allocation type in the resource object |
ysr@777 | 344 | DEBUG_ONLY(((ResourceObj *)res)->_allocation = type;) |
ysr@777 | 345 | return res; |
ysr@777 | 346 | } |
duke@435 | 347 | void operator delete(void* p); |
duke@435 | 348 | }; |
duke@435 | 349 | |
duke@435 | 350 | // One of the following macros must be used when allocating an array |
duke@435 | 351 | // or object to determine whether it should reside in the C heap on in |
duke@435 | 352 | // the resource area. |
duke@435 | 353 | |
duke@435 | 354 | #define NEW_RESOURCE_ARRAY(type, size)\ |
duke@435 | 355 | (type*) resource_allocate_bytes((size) * sizeof(type)) |
duke@435 | 356 | |
duke@435 | 357 | #define NEW_RESOURCE_ARRAY_IN_THREAD(thread, type, size)\ |
duke@435 | 358 | (type*) resource_allocate_bytes(thread, (size) * sizeof(type)) |
duke@435 | 359 | |
duke@435 | 360 | #define REALLOC_RESOURCE_ARRAY(type, old, old_size, new_size)\ |
duke@435 | 361 | (type*) resource_reallocate_bytes((char*)(old), (old_size) * sizeof(type), (new_size) * sizeof(type) ) |
duke@435 | 362 | |
duke@435 | 363 | #define FREE_RESOURCE_ARRAY(type, old, size)\ |
duke@435 | 364 | resource_free_bytes((char*)(old), (size) * sizeof(type)) |
duke@435 | 365 | |
duke@435 | 366 | #define FREE_FAST(old)\ |
duke@435 | 367 | /* nop */ |
duke@435 | 368 | |
duke@435 | 369 | #define NEW_RESOURCE_OBJ(type)\ |
duke@435 | 370 | NEW_RESOURCE_ARRAY(type, 1) |
duke@435 | 371 | |
duke@435 | 372 | #define NEW_C_HEAP_ARRAY(type, size)\ |
duke@435 | 373 | (type*) (AllocateHeap((size) * sizeof(type), XSTR(type) " in " __FILE__)) |
duke@435 | 374 | |
duke@435 | 375 | #define REALLOC_C_HEAP_ARRAY(type, old, size)\ |
duke@435 | 376 | (type*) (ReallocateHeap((char*)old, (size) * sizeof(type), XSTR(type) " in " __FILE__)) |
duke@435 | 377 | |
duke@435 | 378 | #define FREE_C_HEAP_ARRAY(type,old) \ |
duke@435 | 379 | FreeHeap((char*)(old)) |
duke@435 | 380 | |
duke@435 | 381 | #define NEW_C_HEAP_OBJ(type)\ |
duke@435 | 382 | NEW_C_HEAP_ARRAY(type, 1) |
duke@435 | 383 | |
duke@435 | 384 | extern bool warn_new_operator; |
duke@435 | 385 | |
duke@435 | 386 | // for statistics |
duke@435 | 387 | #ifndef PRODUCT |
duke@435 | 388 | class AllocStats : StackObj { |
duke@435 | 389 | int start_mallocs, start_frees; |
duke@435 | 390 | size_t start_malloc_bytes, start_res_bytes; |
duke@435 | 391 | public: |
duke@435 | 392 | AllocStats(); |
duke@435 | 393 | |
duke@435 | 394 | int num_mallocs(); // since creation of receiver |
duke@435 | 395 | size_t alloc_bytes(); |
duke@435 | 396 | size_t resource_bytes(); |
duke@435 | 397 | int num_frees(); |
duke@435 | 398 | void print(); |
duke@435 | 399 | }; |
duke@435 | 400 | #endif |
duke@435 | 401 | |
duke@435 | 402 | |
duke@435 | 403 | //------------------------------ReallocMark--------------------------------- |
duke@435 | 404 | // Code which uses REALLOC_RESOURCE_ARRAY should check an associated |
duke@435 | 405 | // ReallocMark, which is declared in the same scope as the reallocated |
duke@435 | 406 | // pointer. Any operation that could __potentially__ cause a reallocation |
duke@435 | 407 | // should check the ReallocMark. |
duke@435 | 408 | class ReallocMark: public StackObj { |
duke@435 | 409 | protected: |
duke@435 | 410 | NOT_PRODUCT(int _nesting;) |
duke@435 | 411 | |
duke@435 | 412 | public: |
duke@435 | 413 | ReallocMark() PRODUCT_RETURN; |
duke@435 | 414 | void check() PRODUCT_RETURN; |
duke@435 | 415 | }; |