DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
/* -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: t; tab-width: 4 -*- */
/* ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is [Open Source Virtual Machine.].
 *
 * The Initial Developer of the Original Code is
 * Adobe System Incorporated.
 * Portions created by the Initial Developer are Copyright (C) 2004-2006
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *   Adobe AS3 Team
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU General Public License Version 2 or later (the "GPL"), or
 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */

#include "MMgc.h"

#define MMGC_SCALAR_GUARD		0xafafafafU
#define MMGC_NORM_ARRAY_GUARD	0xbfbf0001U
#define MMGC_PRIM_ARRAY_GUARD	(MMGC_NORM_ARRAY_GUARD + 1)	// Code depends on this fact

namespace MMgc
{
#ifdef MMGC_USE_SYSTEM_MALLOC
	
	void *SystemNew(size_t size, FixedMallocOpts opts)
	{
		void *space = VMPI_alloc(size);
		if (space == NULL)
		{
			if (opts & MMgc::kCanFail)
				return NULL;

			int attempt = 0;
			do {
				GCHeap::GetGCHeap()->SystemOOMEvent(size, attempt++);
				space = VMPI_alloc(size);
			} while (space == NULL);
		}
#ifdef MMGC_MEMORY_PROFILER
		GCHeap* heap = GCHeap::GetGCHeap();
		if (heap)
			heap->TrackSystemAlloc(space, size);
#endif
		if (opts & MMgc::kZero)
			VMPI_memset(space, 0, size);
		return space;
	}

	void SystemDelete(void *p)
	{
#ifdef MMGC_MEMORY_PROFILER
		if (p) {
			// heap can be NULL during OOM shutdown
			GCHeap* heap = GCHeap::GetGCHeap();
			if (heap)
				heap->TrackSystemFree(p);
		}
#endif
		VMPI_free(p);
	}
	
#endif // MMGC_USE_SYSTEM_MALLOC

	void *AllocCall(size_t s, FixedMallocOpts opts) 
	{ 
		return AllocCallInline(s, opts);
	}
	
	void DeleteCall( void* p )
	{
		DeleteCallInline(p);
	}
};

#ifdef MMGC_OVERRIDE_GLOBAL_NEW

// Nothing; it's all inline in GCGlobalNew.h

#else

void* operator new(size_t size, MMgc::NewDummyOperand /*ignored*/) MMGC_NEW_THROWS_CLAUSE
{
	return MMgc::NewTaggedScalar(size);
}

void* operator new(size_t size, MMgc::NewDummyOperand /*ignored*/, MMgc::FixedMallocOpts opts) MMGC_NEW_THROWS_CLAUSE
{
	return MMgc::NewTaggedScalar(size, opts);
}

namespace MMgc
{
	// Return NULL iff ((opts & kCanFail) != 0)
	REALLY_INLINE void *TaggedAlloc(size_t size, FixedMallocOpts opts, uint32_t guard)
	{
		(void)guard;

#ifdef MMGC_DELETE_DEBUGGING
		// Store a guard cookie preceding the object so that we can see if it is
		// released with a proper delete (scalar/array)
		size = GCHeap::CheckForAllocSizeOverflow(size, MMGC_GUARDCOOKIE_SIZE);
#endif //MMGC_DELETE_DEBUGGING

		char* mem = (char*)AllocCallInline(size, opts);

#ifdef MMGC_DELETE_DEBUGGING
		if (mem != NULL)
		{
			*(uint32_t*)(void*)mem = guard;
			mem += MMGC_GUARDCOOKIE_SIZE;
		}
#endif // MMGC_DELETE_DEBUGGING

		return mem;
	}

	REALLY_INLINE void* NewTaggedScalar(size_t size, FixedMallocOpts opts)
	{
		GCAssertMsg(GCHeap::GetGCHeap()->StackEnteredCheck() || (opts&kCanFail) != 0, "MMGC_ENTER macro must exist on the stack");
		
		return TaggedAlloc(size, opts, MMGC_SCALAR_GUARD);
	}

	void* NewTaggedArray(size_t count, size_t elsize, FixedMallocOpts opts, bool isPrimitive) 
	{
		GCAssertMsg(GCHeap::GetGCHeap()->StackEnteredCheck() || (opts&kCanFail) != 0, "MMGC_ENTER macro must exist on the stack");

		size_t size = GCHeap::CheckForCallocSizeOverflow(count, elsize);
		if(!isPrimitive)
			size = GCHeap::CheckForAllocSizeOverflow(size, MMGC_ARRAYHEADER_SIZE);
	
		void *p = TaggedAlloc(size, opts, MMGC_NORM_ARRAY_GUARD + uint32_t(isPrimitive));

		if (!isPrimitive && p != NULL)
		{
			*(size_t*)p = count;
			p = (char*)p + MMGC_ARRAYHEADER_SIZE;
		}
		
		return p;
	}

#ifdef MMGC_DELETE_DEBUGGING
	// Helper functions to check the guard.
	// The guard is an uin32_t stored in locations preceding the object.
	
	// The solaris compiler does not allow these to be both static and REALLY_INLINE,
	// so choose the latter over the former.
	
	REALLY_INLINE bool CheckForAllocationGuard(void* mem, uint32_t guard)
	{
		return (*(uint32_t*)(void *)((char*)mem - MMGC_GUARDCOOKIE_SIZE) == guard);
	}

	REALLY_INLINE bool IsScalarAllocation(void* p)
	{
		return CheckForAllocationGuard(p, MMGC_SCALAR_GUARD);
	}

	REALLY_INLINE bool IsArrayAllocation(void* p, bool primitive)
	{
		// Check if we have array guard right before the pointer.
		uint32_t guard = MMGC_NORM_ARRAY_GUARD + uint32_t(primitive);
		return CheckForAllocationGuard(p, guard)									// simple array
			|| CheckForAllocationGuard((char*)p - MMGC_ARRAYHEADER_SIZE, guard);	// array with header
	}

	REALLY_INLINE bool IsGCHeapAllocation(void* p)
	{
		return (GCHeap::GetGCHeap() && GCHeap::GetGCHeap()->IsAddressInHeap(p));
	}

	void VerifyTaggedScalar(void* p)
	{
		if (!IsScalarAllocation(p))
		{
			if (IsArrayAllocation(p, true) || IsArrayAllocation(p, false))
			{
				GCAssertMsg(0, "Trying to release array pointer with scalar destructor! Check the allocation and free calls for this object!");
			}
			else if (!IsGCHeapAllocation(p))
			{
				GCAssertMsg(0, "Trying to release system memory with scalar deletefunc! Check the allocation and free calls for this object!");
			}
			else
			{
				GCAssertMsg(0, "Trying to release funky memory with scalar deletefunc! Check the allocation and free calls for this object!");
			}
		}
	}

	void VerifyTaggedArray(void* p, bool primitive)
	{
		if (!IsArrayAllocation(p, primitive))
		{
			if (IsArrayAllocation(p, !primitive))
			{
				GCAssertMsg(0, "Trying to release array pointer with different type destructor! Check the allocation and free calls for this object!");
			}
			if (IsScalarAllocation(p))
			{
				GCAssertMsg(0, "Trying to release scalar pointer with vector destructor! Check the allocation and free calls for this object!");
			}
			else if (!IsGCHeapAllocation(p))
			{
				GCAssertMsg(0, "Trying to release system pointer with vector deletefunc! Check the allocation and free calls for this object!");
			}
			else
			{
				GCAssertMsg(0, "Trying to release funky memory with vector deletefunc! Check the allocation and free calls for this object!");
			}
		}
	}

	// Functions to actually release the memory through FixedMalloc.
	// Non-debug versions of these functions are always inlined.
	
	void DeleteTaggedScalar( void* p )
	{
#ifdef MMGC_DELETE_DEBUGGING
		// we need to adjust the pointer to release also the guard.
		p = (char*)p - MMGC_GUARDCOOKIE_SIZE;
#endif //MMGC_DELETE_DEBUGGING

		DeleteCallInline(p);
	}

	void DeleteTaggedArrayWithHeader( void* p )
	{
		if( p )
		{
#ifdef MMGC_DELETE_DEBUGGING
			p = ((char*)p - (MMGC_ARRAYHEADER_SIZE + MMGC_GUARDCOOKIE_SIZE));
#else
			p = ((char*)p - MMGC_ARRAYHEADER_SIZE);
#endif //MMGC_DELETE_DEBUGGING
			DeleteCallInline(p);
		}
	}

	void DeleteTaggedScalarChecked(void* p)
	{
		if( p ) 
		{
#ifdef MMGC_DELETE_DEBUGGING
			VerifyTaggedScalar( p );
#endif
			DeleteTaggedScalar( p ); 
		}	
	}

	void DeleteTaggedArrayWithHeaderChecked(void* p, bool primitive)
	{
		(void)primitive;
		if(p) 
		{
#ifdef MMGC_DELETE_DEBUGGING
			VerifyTaggedArray( p, primitive );
#endif
			// not using DeleteTaggedArrayWithHeader, that's for non-Simple case with count cookie
			DeleteTaggedScalar( p );
		}
	}

#endif //MMGC_DELETE_DEBUGGING
	

} // namespace MMgc

#endif // MMGC_OVERRIDE_GLOBAL_NEW