Cleanup: Remove cry load dll functions (#5295)
* Removes VTUNE profiler hooks from Cry Signed-off-by: Esteban Papp <81431996+amznestebanpapp@users.noreply.github.com> * Remove cry load dll functions Signed-off-by: Esteban Papp <81431996+amznestebanpapp@users.noreply.github.com> * removes unused restricted section Signed-off-by: Esteban Papp <81431996+amznestebanpapp@users.noreply.github.com>
This commit is contained in:
@@ -96,47 +96,6 @@ unsigned countElements (const std::vector<T>& arrT, const T& x)
|
||||
*/
|
||||
namespace stl
|
||||
{
|
||||
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
// Compare member of class/struct.
|
||||
//
|
||||
// e.g. Sort Vec3s by x component
|
||||
//
|
||||
// std::sort(vec3s.begin(), vec3s.end(), stl::member_compare<Vec3, float, &Vec3::x>());
|
||||
//
|
||||
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
template <typename OWNER_TYPE, typename MEMBER_TYPE, MEMBER_TYPE OWNER_TYPE::* MEMBER_PTR, typename EQUALITY = std::less<MEMBER_TYPE> >
|
||||
struct member_compare
|
||||
{
|
||||
inline bool operator () (const OWNER_TYPE& lhs, const OWNER_TYPE& rhs) const
|
||||
{
|
||||
return EQUALITY()(lhs.*MEMBER_PTR, rhs.*MEMBER_PTR);
|
||||
}
|
||||
};
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
// Compare member of class/struct against parameter.
|
||||
//
|
||||
// e.g. Find Vec3 with x component less than 1.0
|
||||
//
|
||||
// std::find_if(vec3s.begin(), vec3s.end(), stl::member_compare_param<Vec3, float, &Vec3::x>(1.0f));
|
||||
//
|
||||
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
template <typename OWNER_TYPE, typename MEMBER_TYPE, MEMBER_TYPE OWNER_TYPE::* MEMBER_PTR, typename EQUALITY = std::less<MEMBER_TYPE> >
|
||||
struct member_compare_param
|
||||
{
|
||||
inline member_compare_param(const MEMBER_TYPE& _value)
|
||||
: value(_value)
|
||||
{
|
||||
}
|
||||
|
||||
inline bool operator () (const OWNER_TYPE& rhs) const
|
||||
{
|
||||
return EQUALITY()(rhs.*MEMBER_PTR, value);
|
||||
}
|
||||
|
||||
const MEMBER_TYPE& value;
|
||||
};
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Searches the given entry in the map by key, and if there is none, returns the default value
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
@@ -154,48 +113,6 @@ namespace stl
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Inserts and returns a reference to the given value in the map, or returns the current one if it's already there.
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
template <typename Map>
|
||||
inline typename Map::mapped_type& map_insert_or_get(Map& mapKeyToValue, const typename Map::key_type& key, const typename Map::mapped_type& defValue = typename Map::mapped_type())
|
||||
{
|
||||
auto&& iresult = mapKeyToValue.insert(typename Map::value_type(key, defValue));
|
||||
return iresult.first->second;
|
||||
}
|
||||
|
||||
// searches the given entry in the map by key, and if there is none, returns the default value
|
||||
// The values are taken/returned in REFERENCEs rather than values
|
||||
template <typename Key, typename mapped_type, typename Traits, typename Allocator>
|
||||
inline mapped_type& find_in_map_ref(std::map<Key, mapped_type, Traits, Allocator>& mapKeyToValue, const Key& key, mapped_type& valueDefault)
|
||||
{
|
||||
typedef std::map<Key, mapped_type, Traits, Allocator> Map;
|
||||
typename Map::iterator it = mapKeyToValue.find (key);
|
||||
if (it == mapKeyToValue.end())
|
||||
{
|
||||
return valueDefault;
|
||||
}
|
||||
else
|
||||
{
|
||||
return it->second;
|
||||
}
|
||||
}
|
||||
|
||||
template <typename Key, typename mapped_type, typename Traits, typename Allocator>
|
||||
inline const mapped_type& find_in_map_ref(const std::map<Key, mapped_type, Traits, Allocator>& mapKeyToValue, const Key& key, const mapped_type& valueDefault)
|
||||
{
|
||||
typedef std::map<Key, mapped_type, Traits, Allocator> Map;
|
||||
typename Map::const_iterator it = mapKeyToValue.find (key);
|
||||
if (it == mapKeyToValue.end())
|
||||
{
|
||||
return valueDefault;
|
||||
}
|
||||
else
|
||||
{
|
||||
return it->second;
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Fills vector with contents of map.
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
@@ -210,20 +127,6 @@ namespace stl
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Fills vector with contents of set.
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
template <class Set, class Vector>
|
||||
inline void set_to_vector(const Set& theSet, Vector& array)
|
||||
{
|
||||
array.resize(0);
|
||||
array.reserve(theSet.size());
|
||||
for (typename Set::const_iterator it = theSet.begin(); it != theSet.end(); ++it)
|
||||
{
|
||||
array.push_back(*it);
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Find and erase element from container.
|
||||
// @return true if item was find and erased, false if item not found.
|
||||
@@ -312,48 +215,6 @@ namespace stl
|
||||
return false;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Push back to container unique element.
|
||||
// @return true if item added, false overwise.
|
||||
template <class CONTAINER, class PREDICATE, typename VALUE>
|
||||
inline bool push_back_unique_if(CONTAINER& container, const PREDICATE& predicate, const VALUE& value)
|
||||
{
|
||||
typename CONTAINER::iterator end = container.end();
|
||||
|
||||
if (AZStd::find_if(container.begin(), end, predicate) == end)
|
||||
{
|
||||
container.push_back(value);
|
||||
|
||||
return true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Push back to container contents of another container
|
||||
template <class Container, class Iter>
|
||||
inline void push_back_range(Container& container, Iter begin, Iter end)
|
||||
{
|
||||
for (Iter it = begin; it != end; ++it)
|
||||
{
|
||||
container.push_back(*it);
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Push back to container contents of another container, if not already present
|
||||
template <class Container, class Iter>
|
||||
inline void push_back_range_unique(Container& container, Iter begin, Iter end)
|
||||
{
|
||||
for (Iter it = begin; it != end; ++it)
|
||||
{
|
||||
push_back_unique(container, *it);
|
||||
}
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Find element in container.
|
||||
// @return true if item found.
|
||||
@@ -373,107 +234,6 @@ namespace stl
|
||||
return (it == last || value != *it) ? last : it;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Find element in a sorted container using binary search with logarithmic efficiency.
|
||||
// @return true if item was inserted.
|
||||
template <class Container, class Value>
|
||||
inline bool binary_insert_unique(Container& container, const Value& value)
|
||||
{
|
||||
typename Container::iterator it = std::lower_bound(container.begin(), container.end(), value);
|
||||
if (it != container.end())
|
||||
{
|
||||
if (*it == value)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
container.insert(it, value);
|
||||
}
|
||||
else
|
||||
{
|
||||
container.insert(container.end(), value);
|
||||
}
|
||||
return true;
|
||||
}
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Find element in a sorted container using binary search with logarithmic efficiency.
|
||||
// and erases if element found.
|
||||
// @return true if item was erased.
|
||||
template <class Container, class Value>
|
||||
inline bool binary_erase(Container& container, const Value& value)
|
||||
{
|
||||
typename Container::iterator it = std::lower_bound(container.begin(), container.end(), value);
|
||||
if (it != container.end() && *it == value)
|
||||
{
|
||||
container.erase(it);
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
template <typename ItT, typename Func>
|
||||
ItT remove_from_heap(ItT begin, ItT end, ItT at, Func order)
|
||||
{
|
||||
using std::swap;
|
||||
|
||||
--end;
|
||||
if (at == end)
|
||||
{
|
||||
return at;
|
||||
}
|
||||
|
||||
size_t idx = std::distance(begin, at);
|
||||
swap(*end, *at);
|
||||
|
||||
size_t length = std::distance(begin, end);
|
||||
size_t parent, child;
|
||||
|
||||
if (idx > 0 && order(*(begin + idx / 2), *(begin + idx)))
|
||||
{
|
||||
do
|
||||
{
|
||||
parent = idx / 2;
|
||||
swap(*(begin + idx), *(begin + parent));
|
||||
idx = parent;
|
||||
|
||||
if (idx == 0 || order(*(begin + idx), *(begin + idx / 2)))
|
||||
{
|
||||
return end;
|
||||
}
|
||||
}
|
||||
while (true);
|
||||
}
|
||||
else
|
||||
{
|
||||
do
|
||||
{
|
||||
child = idx * 2 + 1;
|
||||
if (child >= length)
|
||||
{
|
||||
return end;
|
||||
}
|
||||
|
||||
ItT left = begin + child;
|
||||
ItT right = begin + child + 1;
|
||||
|
||||
if (right < end && order(*left, *right))
|
||||
{
|
||||
++child;
|
||||
}
|
||||
|
||||
if (order(*(begin + child), *(begin + idx)))
|
||||
{
|
||||
return end;
|
||||
}
|
||||
|
||||
swap(*(begin + child), *(begin + idx));
|
||||
idx = child;
|
||||
}
|
||||
while (true);
|
||||
}
|
||||
|
||||
return end;
|
||||
}
|
||||
|
||||
struct container_object_deleter
|
||||
{
|
||||
template<typename T>
|
||||
@@ -506,18 +266,6 @@ namespace stl
|
||||
return type.c_str();
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Case sensetive less key for any type convertable to const char*.
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
template <class Type>
|
||||
struct less_strcmp
|
||||
{
|
||||
bool operator()(const Type& left, const Type& right) const
|
||||
{
|
||||
return strcmp(constchar_cast(left), constchar_cast(right)) < 0;
|
||||
}
|
||||
};
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
//! Case insensetive less key for any type convertable to const char*.
|
||||
template <class Type>
|
||||
@@ -690,89 +438,4 @@ namespace stl
|
||||
stl::free_container(container);
|
||||
}
|
||||
};
|
||||
|
||||
template <typename T, size_t Length, typename Func>
|
||||
inline void for_each_array(T (&buffer)[Length], Func func)
|
||||
{
|
||||
std::for_each(&buffer[0], &buffer[Length], func);
|
||||
}
|
||||
|
||||
template <typename T, typename D, size_t Length, typename Func>
|
||||
inline void for_each_array(StaticInstance<T, D>(&buffer)[Length], Func func)
|
||||
{
|
||||
for (size_t idx = 0; idx < Length; ++idx)
|
||||
{
|
||||
func(*buffer[idx]);
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void destruct(T* p)
|
||||
{
|
||||
p->~T();
|
||||
}
|
||||
}
|
||||
|
||||
#define DEFINE_INTRUSIVE_LINKED_LIST(Class) \
|
||||
template<> \
|
||||
Class * stl::intrusive_linked_list_node<Class>::m_root_intrusive = nullptr;
|
||||
|
||||
// define the maplikestruct, used to approximate the memory requirements for a map node
|
||||
namespace stl
|
||||
{
|
||||
struct MapLikeStruct
|
||||
{
|
||||
bool color;
|
||||
void* parent;
|
||||
void* left;
|
||||
void* right;
|
||||
};
|
||||
}
|
||||
template <class Map>
|
||||
unsigned sizeOfMap(Map& map)
|
||||
{
|
||||
unsigned size = 0;
|
||||
for (typename Map::iterator it = map.begin(); it != map.end(); it++)
|
||||
{
|
||||
typename Map::mapped_type& T = it->second;
|
||||
size += T.Size();
|
||||
}
|
||||
size += map.size() * sizeof(stl::MapLikeStruct);
|
||||
return size;
|
||||
}
|
||||
template <class Map>
|
||||
unsigned sizeOfMapStr(Map& map)
|
||||
{
|
||||
unsigned size = 0;
|
||||
for (typename Map::iterator it = map.begin(); it != map.end(); it++)
|
||||
{
|
||||
typename Map::mapped_type& T = it->second;
|
||||
size += T.capacity();
|
||||
}
|
||||
size += map.size() * sizeof(stl::MapLikeStruct);
|
||||
return size;
|
||||
}
|
||||
template <class Map>
|
||||
unsigned sizeOfMapP(Map& map)
|
||||
{
|
||||
unsigned size = 0;
|
||||
for (typename Map::iterator it = map.begin(); it != map.end(); it++)
|
||||
{
|
||||
typename Map::mapped_type& T = it->second;
|
||||
size += T->Size();
|
||||
}
|
||||
size += map.size() * sizeof(stl::MapLikeStruct);
|
||||
return size;
|
||||
}
|
||||
template <class Map>
|
||||
unsigned sizeOfMapS(Map& map)
|
||||
{
|
||||
unsigned size = 0;
|
||||
for (typename Map::iterator it = map.begin(); it != map.end(); it++)
|
||||
{
|
||||
typename Map::mapped_type& T = it->second;
|
||||
size += sizeof(T);
|
||||
}
|
||||
size += map.size() * sizeof(stl::MapLikeStruct);
|
||||
return size;
|
||||
}
|
||||
|
||||
@@ -509,8 +509,6 @@ void CSystem::ShutDown()
|
||||
|
||||
ShutdownFileSystem();
|
||||
|
||||
ShutdownModuleLibraries();
|
||||
|
||||
EBUS_EVENT(CrySystemEventBus, OnCrySystemPostShutdown);
|
||||
}
|
||||
|
||||
|
||||
@@ -303,8 +303,6 @@ public:
|
||||
void SetVersionInfo(const char* const szVersion);
|
||||
#endif
|
||||
|
||||
void ShutdownModuleLibraries();
|
||||
|
||||
#if defined(WIN32)
|
||||
friend LRESULT WINAPI WndProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam);
|
||||
#endif
|
||||
@@ -323,8 +321,6 @@ private:
|
||||
// Release all resources.
|
||||
void ShutDown();
|
||||
|
||||
bool LoadEngineDLLs();
|
||||
|
||||
//! @name Initialization routines
|
||||
//@{
|
||||
bool InitConsole();
|
||||
@@ -340,11 +336,8 @@ private:
|
||||
void CreateSystemVars();
|
||||
void CreateAudioVars();
|
||||
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> LoadDLL(const char* dllName);
|
||||
|
||||
void FreeLib(AZStd::unique_ptr<AZ::DynamicModuleHandle>& hLibModule);
|
||||
|
||||
bool UnloadDLL(const char* dllName);
|
||||
void QueryVersionInfo();
|
||||
void LogVersion();
|
||||
void LogBuildInfo();
|
||||
@@ -359,8 +352,6 @@ private:
|
||||
|
||||
void AddCVarGroupDirectory(const AZStd::string& sPath) override;
|
||||
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> LoadDynamiclibrary(const char* dllName) const;
|
||||
|
||||
#if defined(AZ_RESTRICTED_PLATFORM)
|
||||
#define AZ_RESTRICTED_SECTION SYSTEM_H_SECTION_3
|
||||
#include AZ_RESTRICTED_FILE(System_h)
|
||||
@@ -416,9 +407,6 @@ private: // ------------------------------------------------------
|
||||
bool m_bDrawConsole; //!< Set to true if OK to draw the console.
|
||||
bool m_bDrawUI; //!< Set to true if OK to draw UI.
|
||||
|
||||
|
||||
std::map<AZ::Crc32, AZStd::unique_ptr<AZ::DynamicModuleHandle> > m_moduleDLLHandles;
|
||||
|
||||
//! current active process
|
||||
IProcess* m_pProcess;
|
||||
|
||||
|
||||
@@ -12,7 +12,6 @@
|
||||
|
||||
#if defined(AZ_RESTRICTED_PLATFORM) || defined(AZ_TOOLS_EXPAND_FOR_RESTRICTED_PLATFORMS)
|
||||
#undef AZ_RESTRICTED_SECTION
|
||||
#define SYSTEMINIT_CPP_SECTION_1 1
|
||||
#define SYSTEMINIT_CPP_SECTION_2 2
|
||||
#define SYSTEMINIT_CPP_SECTION_3 3
|
||||
#define SYSTEMINIT_CPP_SECTION_4 4
|
||||
@@ -168,30 +167,6 @@ void CryEngineSignalHandler(int signal)
|
||||
|
||||
#define LOCALIZATION_TRANSLATIONS_LIST_FILE_NAME "Libs/Localization/localization.xml"
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
#if defined(WIN32) || defined(LINUX) || defined(APPLE)
|
||||
# define DLL_INITFUNC_RENDERER "PackageRenderConstructor"
|
||||
# define DLL_INITFUNC_SOUND "CreateSoundSystem"
|
||||
# define DLL_INITFUNC_FONT "CreateCryFontInterface"
|
||||
# define DLL_INITFUNC_3DENGINE "CreateCry3DEngine"
|
||||
# define DLL_INITFUNC_UI "CreateLyShineInterface"
|
||||
#define AZ_RESTRICTED_SECTION_IMPLEMENTED
|
||||
#elif defined(AZ_RESTRICTED_PLATFORM)
|
||||
#define AZ_RESTRICTED_SECTION SYSTEMINIT_CPP_SECTION_1
|
||||
#include AZ_RESTRICTED_FILE(SystemInit_cpp)
|
||||
#endif
|
||||
#if defined(AZ_RESTRICTED_SECTION_IMPLEMENTED)
|
||||
#undef AZ_RESTRICTED_SECTION_IMPLEMENTED
|
||||
#else
|
||||
# define DLL_INITFUNC_RENDERER (LPCSTR)1
|
||||
# define DLL_INITFUNC_RENDERER (LPCSTR)1
|
||||
# define DLL_INITFUNC_SOUND (LPCSTR)1
|
||||
# define DLL_INITFUNC_PHYSIC (LPCSTR)1
|
||||
# define DLL_INITFUNC_FONT (LPCSTR)1
|
||||
# define DLL_INITFUNC_3DENGINE (LPCSTR)1
|
||||
# define DLL_INITFUNC_UI (LPCSTR)1
|
||||
#endif
|
||||
|
||||
#define AZ_TRACE_SYSTEM_WINDOW AZ::Debug::Trace::GetDefaultSystemWindow()
|
||||
|
||||
#ifdef WIN32
|
||||
@@ -285,96 +260,6 @@ static void CmdCrashTest(IConsoleCmdArgs* pArgs)
|
||||
}
|
||||
AZ_POP_DISABLE_WARNING
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
struct SysSpecOverrideSink
|
||||
: public ILoadConfigurationEntrySink
|
||||
{
|
||||
virtual void OnLoadConfigurationEntry(const char* szKey, const char* szValue, const char* szGroup)
|
||||
{
|
||||
ICVar* pCvar = gEnv->pConsole->GetCVar(szKey);
|
||||
|
||||
if (pCvar)
|
||||
{
|
||||
const bool wasNotInConfig = ((pCvar->GetFlags() & VF_WASINCONFIG) == 0);
|
||||
bool applyCvar = wasNotInConfig;
|
||||
if (applyCvar == false)
|
||||
{
|
||||
// Special handling for sys_spec_full
|
||||
if (azstricmp(szKey, "sys_spec_full") == 0)
|
||||
{
|
||||
// If it is set to 0 then ignore this request to set to something else
|
||||
// If it is set to 0 then the user wants to changes system spec settings in system.cfg
|
||||
if (pCvar->GetIVal() != 0)
|
||||
{
|
||||
applyCvar = true;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
// This could bypass the restricted cvar checks that exist elsewhere depending on
|
||||
// the calling code so we also need check here before setting.
|
||||
bool isConst = pCvar->IsConstCVar();
|
||||
bool isCheat = ((pCvar->GetFlags() & (VF_CHEAT | VF_CHEAT_NOCHECK | VF_CHEAT_ALWAYS_CHECK)) != 0);
|
||||
bool isReadOnly = ((pCvar->GetFlags() & VF_READONLY) != 0);
|
||||
bool isDeprecated = ((pCvar->GetFlags() & VF_DEPRECATED) != 0);
|
||||
bool allowApplyCvar = true;
|
||||
|
||||
if ((isConst || isCheat || isReadOnly) || isDeprecated)
|
||||
{
|
||||
allowApplyCvar = !isDeprecated && (gEnv->pSystem->IsDevMode()) || (gEnv->IsEditor());
|
||||
}
|
||||
|
||||
if ((allowApplyCvar) || ALLOW_CONST_CVAR_MODIFICATIONS)
|
||||
{
|
||||
applyCvar = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (applyCvar)
|
||||
{
|
||||
pCvar->Set(szValue);
|
||||
}
|
||||
else
|
||||
{
|
||||
CryLogAlways("NOT VF_WASINCONFIG Ignoring cvar '%s' new value '%s' old value '%s' group '%s'", szKey, szValue, pCvar->GetString(), szGroup);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
CryLogAlways("Can't find cvar '%s' value '%s' group '%s'", szKey, szValue, szGroup);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
#if !defined(CONSOLE)
|
||||
struct SysSpecOverrideSinkConsole
|
||||
: public ILoadConfigurationEntrySink
|
||||
{
|
||||
virtual void OnLoadConfigurationEntry(const char* szKey, const char* szValue, const char* szGroup)
|
||||
{
|
||||
// Ignore platform-specific cvars that should just be executed on the console
|
||||
if (azstricmp(szGroup, "Platform") == 0)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
ICVar* pCvar = gEnv->pConsole->GetCVar(szKey);
|
||||
if (pCvar)
|
||||
{
|
||||
pCvar->Set(szValue);
|
||||
}
|
||||
else
|
||||
{
|
||||
// If the cvar doesn't exist, calling this function only saves the value in case it's registered later where
|
||||
// at that point it will be set from the stored value. This is required because otherwise registering the
|
||||
// cvar bypasses any callbacks and uses values directly from the cvar group files.
|
||||
gEnv->pConsole->LoadConfigVar(szKey, szValue);
|
||||
}
|
||||
}
|
||||
};
|
||||
#endif
|
||||
|
||||
static ESystemConfigPlatform GetDevicePlatform()
|
||||
{
|
||||
#if defined(AZ_PLATFORM_WINDOWS) || defined(AZ_PLATFORM_LINUX)
|
||||
@@ -398,98 +283,6 @@ static ESystemConfigPlatform GetDevicePlatform()
|
||||
#endif
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
#if !defined(AZ_MONOLITHIC_BUILD)
|
||||
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> CSystem::LoadDynamiclibrary(const char* dllName) const
|
||||
{
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> handle = AZ::DynamicModuleHandle::Create(dllName);
|
||||
|
||||
bool libraryLoaded = handle->Load(false);
|
||||
// We need to inject the environment first thing so that allocators are available immediately
|
||||
InjectEnvironmentFunction injectEnv = handle->GetFunction<InjectEnvironmentFunction>(INJECT_ENVIRONMENT_FUNCTION);
|
||||
if (injectEnv)
|
||||
{
|
||||
auto env = AZ::Environment::GetInstance();
|
||||
injectEnv(env);
|
||||
}
|
||||
|
||||
if (!libraryLoaded)
|
||||
{
|
||||
handle.release();
|
||||
}
|
||||
return handle;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> CSystem::LoadDLL(const char* dllName)
|
||||
{
|
||||
AZ_TracePrintf(AZ_TRACE_SYSTEM_WINDOW, "Loading DLL: %s", dllName);
|
||||
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> handle = LoadDynamiclibrary(dllName);
|
||||
|
||||
if (!handle)
|
||||
{
|
||||
#if defined(LINUX) || defined(APPLE)
|
||||
AZ_Assert(false, "Error loading dylib: %s, error : %s\n", dllName, dlerror());
|
||||
#else
|
||||
AZ_Assert(false, "Error loading dll: %s, error code %d", dllName, GetLastError());
|
||||
#endif
|
||||
return handle;
|
||||
}
|
||||
|
||||
return handle;
|
||||
}
|
||||
|
||||
// TODO:DLL #endif //#if defined(AZ_HAS_DLL_SUPPORT) && !defined(AZ_MONOLITHIC_BUILD)
|
||||
#endif //if !defined(AZ_MONOLITHIC_BUILD)
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
bool CSystem::LoadEngineDLLs()
|
||||
{
|
||||
return true;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
bool CSystem::UnloadDLL(const char* dllName)
|
||||
{
|
||||
bool isSuccess = false;
|
||||
|
||||
AZ::Crc32 key(dllName);
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle> empty;
|
||||
AZStd::unique_ptr<AZ::DynamicModuleHandle>& hModule = stl::find_in_map_ref(m_moduleDLLHandles, key, empty);
|
||||
if ((hModule) && (hModule->IsLoaded()))
|
||||
{
|
||||
DetachEnvironmentFunction detachEnv = hModule->GetFunction<DetachEnvironmentFunction>(DETACH_ENVIRONMENT_FUNCTION);
|
||||
if (detachEnv)
|
||||
{
|
||||
detachEnv();
|
||||
}
|
||||
|
||||
isSuccess = hModule->Unload();
|
||||
hModule.release();
|
||||
}
|
||||
|
||||
return isSuccess;
|
||||
}
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
void CSystem::ShutdownModuleLibraries()
|
||||
{
|
||||
#if !defined(AZ_MONOLITHIC_BUILD)
|
||||
for (auto iterator = m_moduleDLLHandles.begin(); iterator != m_moduleDLLHandles.end(); ++iterator)
|
||||
{
|
||||
if (iterator->second->IsLoaded())
|
||||
{
|
||||
iterator->second->Unload();
|
||||
}
|
||||
iterator->second.release();
|
||||
}
|
||||
|
||||
m_moduleDLLHandles.clear();
|
||||
|
||||
#endif // !defined(AZ_MONOLITHIC_BUILD)
|
||||
}
|
||||
|
||||
/////////////////////////////////////////////////////////////////////////////////
|
||||
/////////////////////////////////////////////////////////////////////////////////
|
||||
bool CSystem::InitConsole()
|
||||
|
||||
Reference in New Issue
Block a user