mirror of
https://github.com/kevinbentley/Descent3.git
synced 2026-04-05 14:00:03 -04:00
146 lines
3.9 KiB
C++
146 lines
3.9 KiB
C++
/*
|
|
AngelCode Scripting Library
|
|
Copyright (c) 2003-2009 Andreas Jonsson
|
|
|
|
This software is provided 'as-is', without any express or implied
|
|
warranty. In no event will the authors be held liable for any
|
|
damages arising from the use of this software.
|
|
|
|
Permission is granted to anyone to use this software for any
|
|
purpose, including commercial applications, and to alter it and
|
|
redistribute it freely, subject to the following restrictions:
|
|
|
|
1. The origin of this software must not be misrepresented; you
|
|
must not claim that you wrote the original software. If you use
|
|
this software in a product, an acknowledgment in the product
|
|
documentation would be appreciated but is not required.
|
|
|
|
2. Altered source versions must be plainly marked as such, and
|
|
must not be misrepresented as being the original software.
|
|
|
|
3. This notice may not be removed or altered from any source
|
|
distribution.
|
|
|
|
The original version of this library can be located at:
|
|
http://www.angelcode.com/angelscript/
|
|
|
|
Andreas Jonsson
|
|
andreas@angelcode.com
|
|
*/
|
|
|
|
//
|
|
// as_memory.cpp
|
|
//
|
|
// Overload the default memory management functions so that we
|
|
// can let the application decide how to do it.
|
|
//
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "as_config.h"
|
|
#include "as_memory.h"
|
|
#include "as_scriptnode.h"
|
|
#include "as_bytecode.h"
|
|
|
|
BEGIN_AS_NAMESPACE
|
|
|
|
// By default we'll use the standard memory management functions
|
|
asALLOCFUNC_t userAlloc = malloc;
|
|
asFREEFUNC_t userFree = free;
|
|
|
|
extern "C" {
|
|
|
|
int asSetGlobalMemoryFunctions(asALLOCFUNC_t allocFunc, asFREEFUNC_t freeFunc) {
|
|
userAlloc = allocFunc;
|
|
userFree = freeFunc;
|
|
|
|
return 0;
|
|
}
|
|
|
|
int asResetGlobalMemoryFunctions() {
|
|
asThreadCleanup();
|
|
|
|
userAlloc = malloc;
|
|
userFree = free;
|
|
|
|
return 0;
|
|
}
|
|
|
|
} // extern "C"
|
|
|
|
asCMemoryMgr::asCMemoryMgr() {}
|
|
|
|
asCMemoryMgr::~asCMemoryMgr() { FreeUnusedMemory(); }
|
|
|
|
void asCMemoryMgr::FreeUnusedMemory() {
|
|
// It's necessary to protect the scriptNodePool from multiple
|
|
// simultaneous accesses, as the parser is used by several methods
|
|
// that can be executed simultaneously.
|
|
ENTERCRITICALSECTION(cs);
|
|
|
|
int n;
|
|
for (n = 0; n < (signed)scriptNodePool.GetLength(); n++)
|
|
userFree(scriptNodePool[n]);
|
|
scriptNodePool.Allocate(0, false);
|
|
|
|
LEAVECRITICALSECTION(cs);
|
|
|
|
// The engine already protects against multiple threads
|
|
// compiling scripts simultaneously so this pool doesn't have
|
|
// to be protected again.
|
|
for (n = 0; n < (signed)byteInstructionPool.GetLength(); n++)
|
|
userFree(byteInstructionPool[n]);
|
|
byteInstructionPool.Allocate(0, false);
|
|
}
|
|
|
|
void *asCMemoryMgr::AllocScriptNode() {
|
|
ENTERCRITICALSECTION(cs);
|
|
|
|
if (scriptNodePool.GetLength()) {
|
|
void *tRet = scriptNodePool.PopLast();
|
|
LEAVECRITICALSECTION(cs);
|
|
return tRet;
|
|
}
|
|
|
|
LEAVECRITICALSECTION(cs);
|
|
|
|
#if defined(AS_DEBUG)
|
|
return ((asALLOCFUNCDEBUG_t)(userAlloc))(sizeof(asCScriptNode), __FILE__, __LINE__);
|
|
#else
|
|
return userAlloc(sizeof(asCScriptNode));
|
|
#endif
|
|
}
|
|
|
|
void asCMemoryMgr::FreeScriptNode(void *ptr) {
|
|
ENTERCRITICALSECTION(cs);
|
|
|
|
// Pre allocate memory for the array to avoid slow growth
|
|
if (scriptNodePool.GetLength() == 0)
|
|
scriptNodePool.Allocate(100, 0);
|
|
|
|
scriptNodePool.PushLast(ptr);
|
|
|
|
LEAVECRITICALSECTION(cs);
|
|
}
|
|
|
|
void *asCMemoryMgr::AllocByteInstruction() {
|
|
if (byteInstructionPool.GetLength())
|
|
return byteInstructionPool.PopLast();
|
|
|
|
#if defined(AS_DEBUG)
|
|
return ((asALLOCFUNCDEBUG_t)(userAlloc))(sizeof(cByteInstruction), __FILE__, __LINE__);
|
|
#else
|
|
return userAlloc(sizeof(cByteInstruction));
|
|
#endif
|
|
}
|
|
|
|
void asCMemoryMgr::FreeByteInstruction(void *ptr) {
|
|
// Pre allocate memory for the array to avoid slow growth
|
|
if (byteInstructionPool.GetLength() == 0)
|
|
byteInstructionPool.Allocate(100, 0);
|
|
|
|
byteInstructionPool.PushLast(ptr);
|
|
}
|
|
|
|
END_AS_NAMESPACE
|