f7e62a8cd6
Adds support for client-side Thinkers, Actors, and ACS scripts (ACS uses the existing CLIENTSIDE keyword). These will tick regardless of the network state allowing for localized client handling and are put in their own separate lists so they can't be accidentally accessed by server code. They currently aren't serialized since this would have no meaning for other clients in the game that would get saved. Other logic like the menu, console, HUD, and particles have also been moved to client-side ticking to prevent them from becoming locked up by poor network conditions. Additionally, screenshotting and the automap are now handled immediately instead of having to wait for any game tick to run first, making them free of net lag.
800 lines
18 KiB
C++
800 lines
18 KiB
C++
/*
|
|
** dobject.cpp
|
|
** Implements the base class DObject, which most other classes derive from
|
|
**
|
|
**---------------------------------------------------------------------------
|
|
** Copyright 1998-2006 Randy Heit
|
|
** All rights reserved.
|
|
**
|
|
** Redistribution and use in source and binary forms, with or without
|
|
** modification, are permitted provided that the following conditions
|
|
** are met:
|
|
**
|
|
** 1. Redistributions of source code must retain the above copyright
|
|
** notice, this list of conditions and the following disclaimer.
|
|
** 2. Redistributions in binary form must reproduce the above copyright
|
|
** notice, this list of conditions and the following disclaimer in the
|
|
** documentation and/or other materials provided with the distribution.
|
|
** 3. The name of the author may not be used to endorse or promote products
|
|
** derived from this software without specific prior written permission.
|
|
**
|
|
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
** IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
** OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
** IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
** INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
** NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
** THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
**---------------------------------------------------------------------------
|
|
**
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "dobject.h"
|
|
#include "cmdlib.h"
|
|
#include "c_dispatch.h"
|
|
#include "serializer.h"
|
|
#include "vm.h"
|
|
#include "types.h"
|
|
#include "i_time.h"
|
|
#include "printf.h"
|
|
#include "maps.h"
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
ClassReg DObject::RegistrationInfo =
|
|
{
|
|
nullptr, // MyClass
|
|
"DObject", // Name
|
|
nullptr, // ParentType
|
|
nullptr,
|
|
nullptr, // Pointers
|
|
&DObject::InPlaceConstructor, // ConstructNative
|
|
nullptr,
|
|
sizeof(DObject), // SizeOf
|
|
};
|
|
_DECLARE_TI(DObject)
|
|
|
|
// This bit is needed in the playsim - but give it a less crappy name.
|
|
DEFINE_FIELD_BIT(DObject,ObjectFlags, bDestroyed, OF_EuthanizeMe)
|
|
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
CCMD (dumpclasses)
|
|
{
|
|
// This is by no means speed-optimized. But it's an informational console
|
|
// command that will be executed infrequently, so I don't mind.
|
|
struct DumpInfo
|
|
{
|
|
const PClass *Type;
|
|
DumpInfo *Next;
|
|
DumpInfo *Children;
|
|
|
|
static DumpInfo *FindType (DumpInfo *root, const PClass *type)
|
|
{
|
|
if (root == NULL)
|
|
{
|
|
return root;
|
|
}
|
|
if (root->Type == type)
|
|
{
|
|
return root;
|
|
}
|
|
if (root->Next != NULL)
|
|
{
|
|
return FindType (root->Next, type);
|
|
}
|
|
if (root->Children != NULL)
|
|
{
|
|
return FindType (root->Children, type);
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static DumpInfo *AddType (DumpInfo **root, const PClass *type)
|
|
{
|
|
DumpInfo *info, *parentInfo;
|
|
|
|
if (*root == NULL)
|
|
{
|
|
info = new DumpInfo;
|
|
info->Type = type;
|
|
info->Next = NULL;
|
|
info->Children = *root;
|
|
*root = info;
|
|
return info;
|
|
}
|
|
if (type->ParentClass == (*root)->Type)
|
|
{
|
|
parentInfo = *root;
|
|
}
|
|
else if (type == (*root)->Type)
|
|
{
|
|
return *root;
|
|
}
|
|
else
|
|
{
|
|
parentInfo = FindType (*root, type->ParentClass);
|
|
if (parentInfo == NULL)
|
|
{
|
|
parentInfo = AddType (root, type->ParentClass);
|
|
}
|
|
}
|
|
// Has this type already been added?
|
|
for (info = parentInfo->Children; info != NULL; info = info->Next)
|
|
{
|
|
if (info->Type == type)
|
|
{
|
|
return info;
|
|
}
|
|
}
|
|
info = new DumpInfo;
|
|
info->Type = type;
|
|
info->Next = parentInfo->Children;
|
|
info->Children = NULL;
|
|
parentInfo->Children = info;
|
|
return info;
|
|
}
|
|
|
|
static void PrintTree (DumpInfo *root, int level)
|
|
{
|
|
Printf ("%*c%s\n", level, ' ', root->Type->TypeName.GetChars());
|
|
if (root->Children != NULL)
|
|
{
|
|
PrintTree (root->Children, level + 2);
|
|
}
|
|
if (root->Next != NULL)
|
|
{
|
|
PrintTree (root->Next, level);
|
|
}
|
|
}
|
|
|
|
static void FreeTree (DumpInfo *root)
|
|
{
|
|
if (root->Children != NULL)
|
|
{
|
|
FreeTree (root->Children);
|
|
}
|
|
if (root->Next != NULL)
|
|
{
|
|
FreeTree (root->Next);
|
|
}
|
|
delete root;
|
|
}
|
|
};
|
|
|
|
unsigned int i;
|
|
int shown, omitted;
|
|
DumpInfo *tree = NULL;
|
|
const PClass *root = NULL;
|
|
|
|
if (argv.argc() > 1)
|
|
{
|
|
root = PClass::FindClass (argv[1]);
|
|
if (root == NULL)
|
|
{
|
|
Printf ("Class '%s' not found\n", argv[1]);
|
|
return;
|
|
}
|
|
}
|
|
|
|
shown = omitted = 0;
|
|
DumpInfo::AddType (&tree, root != NULL ? root : RUNTIME_CLASS(DObject));
|
|
for (i = 0; i < PClass::AllClasses.Size(); i++)
|
|
{
|
|
PClass *cls = PClass::AllClasses[i];
|
|
if (root == NULL || cls == root || cls->IsDescendantOf(root))
|
|
{
|
|
DumpInfo::AddType (&tree, cls);
|
|
// Printf (" %s\n", PClass::m_Types[i]->Name + 1);
|
|
shown++;
|
|
}
|
|
else
|
|
{
|
|
omitted++;
|
|
}
|
|
}
|
|
DumpInfo::PrintTree (tree, 2);
|
|
DumpInfo::FreeTree (tree);
|
|
Printf ("%d classes shown, %d omitted\n", shown, omitted);
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void DObject::InPlaceConstructor (void *mem)
|
|
{
|
|
new ((EInPlace *)mem) DObject;
|
|
}
|
|
|
|
DObject::DObject ()
|
|
: Class(0), ObjectFlags(0)
|
|
{
|
|
ObjectFlags = GC::CurrentWhite & OF_WhiteBits;
|
|
ObjNext = GC::Root;
|
|
GCNext = nullptr;
|
|
GC::Root = this;
|
|
}
|
|
|
|
DObject::DObject (PClass *inClass)
|
|
: Class(inClass), ObjectFlags(0)
|
|
{
|
|
ObjectFlags = GC::CurrentWhite & OF_WhiteBits;
|
|
ObjNext = GC::Root;
|
|
GCNext = nullptr;
|
|
GC::Root = this;
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
DObject::~DObject ()
|
|
{
|
|
if (!PClass::bShutdown)
|
|
{
|
|
PClass *type = GetClass();
|
|
if (!(ObjectFlags & OF_Cleanup) && !PClass::bShutdown)
|
|
{
|
|
if (!(ObjectFlags & (OF_YesReallyDelete|OF_Released)))
|
|
{
|
|
Printf("Warning: '%s' is freed outside the GC process.\n",
|
|
type != NULL ? type->TypeName.GetChars() : "==some object==");
|
|
}
|
|
|
|
if (!(ObjectFlags & OF_Released))
|
|
{
|
|
// Find all pointers that reference this object and NULL them.
|
|
Release();
|
|
}
|
|
}
|
|
|
|
if (nullptr != type)
|
|
{
|
|
type->DestroySpecials(this);
|
|
}
|
|
}
|
|
}
|
|
|
|
void DObject::Release()
|
|
{
|
|
DObject **probe;
|
|
|
|
// Unlink this object from the GC list.
|
|
for (probe = &GC::Root; *probe != NULL; probe = &((*probe)->ObjNext))
|
|
{
|
|
if (*probe == this)
|
|
{
|
|
*probe = ObjNext;
|
|
if (&ObjNext == GC::SweepPos)
|
|
{
|
|
GC::SweepPos = probe;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
// If it's gray, also unlink it from the gray list.
|
|
if (this->IsGray())
|
|
{
|
|
for (probe = &GC::Gray; *probe != NULL; probe = &((*probe)->GCNext))
|
|
{
|
|
if (*probe == this)
|
|
{
|
|
*probe = GCNext;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
ObjNext = nullptr;
|
|
GCNext = nullptr;
|
|
ObjectFlags |= OF_Released;
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void DObject::Destroy ()
|
|
{
|
|
RemoveFromNetwork();
|
|
|
|
// We cannot call the VM during shutdown because all the needed data has been or is in the process of being deleted.
|
|
if (PClass::bVMOperational)
|
|
{
|
|
IFVIRTUAL(DObject, OnDestroy)
|
|
{
|
|
VMValue params[1] = { (DObject*)this };
|
|
VMCall(func, params, 1, nullptr, 0);
|
|
}
|
|
}
|
|
OnDestroy();
|
|
ObjectFlags = (ObjectFlags & ~OF_Fixed) | OF_EuthanizeMe;
|
|
GC::WriteBarrier(this);
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION(DObject, Destroy)
|
|
{
|
|
PARAM_SELF_PROLOGUE(DObject);
|
|
self->Destroy();
|
|
return 0;
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
template<typename M>
|
|
static void PropagateMarkMap(M *map)
|
|
{
|
|
TMapIterator<typename M::KeyType,DObject*> it(*map);
|
|
typename M::Pair * p;
|
|
while(it.NextPair(p))
|
|
{
|
|
GC::Mark(&p->Value);
|
|
}
|
|
}
|
|
|
|
size_t DObject::PropagateMark()
|
|
{
|
|
const PClass *info = GetClass();
|
|
if (!PClass::bShutdown)
|
|
{
|
|
if (info->FlatPointers == nullptr)
|
|
{
|
|
info->BuildFlatPointers();
|
|
assert(info->FlatPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->FlatPointersSize; i++)
|
|
{
|
|
GC::Mark((DObject **)((uint8_t *)this + info->FlatPointers[i].first));
|
|
}
|
|
|
|
if (info->ArrayPointers == nullptr)
|
|
{
|
|
info->BuildArrayPointers();
|
|
assert(info->ArrayPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->ArrayPointersSize; i++)
|
|
{
|
|
auto aray = (TArray<DObject*>*)((uint8_t *)this + info->ArrayPointers[i].first);
|
|
for (auto &p : *aray)
|
|
{
|
|
GC::Mark(&p);
|
|
}
|
|
}
|
|
|
|
if (info->MapPointers == nullptr)
|
|
{
|
|
info->BuildMapPointers();
|
|
assert(info->MapPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->MapPointersSize; i++)
|
|
{
|
|
PMap * type = static_cast<PMap*>(info->MapPointers[i].second);
|
|
if(type->KeyType->RegType == REGT_STRING)
|
|
{ // FString,DObject*
|
|
PropagateMarkMap((ZSMap<FString,DObject*>*)((uint8_t *)this + info->MapPointers[i].first));
|
|
}
|
|
else
|
|
{ // uint32_t,DObject*
|
|
PropagateMarkMap((ZSMap<uint32_t,DObject*>*)((uint8_t *)this + info->MapPointers[i].first));
|
|
}
|
|
}
|
|
return info->Size;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
template<typename M>
|
|
static void MapPointerSubstitution(M *map, size_t &changed, DObject *old, DObject *notOld, const bool shouldSwap)
|
|
{
|
|
TMapIterator<typename M::KeyType, DObject*> it(*map);
|
|
typename M::Pair * p;
|
|
while(it.NextPair(p))
|
|
{
|
|
if (p->Value == old)
|
|
{
|
|
if (shouldSwap)
|
|
{
|
|
p->Value = notOld;
|
|
changed++;
|
|
}
|
|
else if (p->Value != nullptr)
|
|
{
|
|
p->Value = nullptr;
|
|
changed++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
size_t DObject::PointerSubstitution (DObject *old, DObject *notOld, bool nullOnFail)
|
|
{
|
|
const PClass *info = GetClass();
|
|
size_t changed = 0;
|
|
if (info->FlatPointers == nullptr)
|
|
{
|
|
info->BuildFlatPointers();
|
|
assert(info->FlatPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->FlatPointersSize; i++)
|
|
{
|
|
size_t offset = info->FlatPointers[i].first;
|
|
auto& obj = *(DObject**)((uint8_t*)this + offset);
|
|
|
|
if (obj == old)
|
|
{
|
|
// If a pointer's type is null, that means it's native and anything native is safe to swap
|
|
// around due to its inherit type expansiveness.
|
|
if (info->FlatPointers[i].second == nullptr || notOld->IsKindOf(info->FlatPointers[i].second->PointedClass()))
|
|
{
|
|
obj = notOld;
|
|
changed++;
|
|
}
|
|
else if (nullOnFail && obj != nullptr)
|
|
{
|
|
obj = nullptr;
|
|
changed++;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (info->ArrayPointers == nullptr)
|
|
{
|
|
info->BuildArrayPointers();
|
|
assert(info->ArrayPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->ArrayPointersSize; i++)
|
|
{
|
|
const bool isType = notOld->IsKindOf(static_cast<PObjectPointer*>(info->ArrayPointers[i].second->ElementType)->PointedClass());
|
|
|
|
if (!isType && !nullOnFail)
|
|
continue;
|
|
|
|
auto aray = (TArray<DObject*>*)((uint8_t*)this + info->ArrayPointers[i].first);
|
|
for (auto &p : *aray)
|
|
{
|
|
if (p == old)
|
|
{
|
|
if (isType)
|
|
{
|
|
p = notOld;
|
|
changed++;
|
|
}
|
|
else if (p != nullptr)
|
|
{
|
|
p = nullptr;
|
|
changed++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (info->MapPointers == nullptr)
|
|
{
|
|
info->BuildMapPointers();
|
|
assert(info->MapPointers);
|
|
}
|
|
|
|
for(size_t i = 0; i < info->MapPointersSize; i++)
|
|
{
|
|
PMap * type = static_cast<PMap*>(info->MapPointers[i].second);
|
|
|
|
const bool isType = notOld->IsKindOf(static_cast<PObjectPointer*>(type->ValueType)->PointedClass());
|
|
if (!isType && !nullOnFail)
|
|
continue;
|
|
|
|
if(type->KeyType->RegType == REGT_STRING)
|
|
{ // FString,DObject*
|
|
MapPointerSubstitution((ZSMap<FString,DObject*>*)((uint8_t *)this + info->MapPointers[i].first), changed, old, notOld, isType);
|
|
}
|
|
else
|
|
{ // uint32_t,DObject*
|
|
MapPointerSubstitution((ZSMap<uint32_t,DObject*>*)((uint8_t *)this + info->MapPointers[i].first), changed, old, notOld, isType);
|
|
}
|
|
}
|
|
|
|
return changed;
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void DObject::SerializeUserVars(FSerializer &arc)
|
|
{
|
|
if (arc.isWriting())
|
|
{
|
|
// Write all fields that aren't serialized by native code.
|
|
GetClass()->WriteAllFields(arc, this);
|
|
}
|
|
else
|
|
{
|
|
GetClass()->ReadAllFields(arc, this);
|
|
}
|
|
}
|
|
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void DObject::Serialize(FSerializer &arc)
|
|
{
|
|
const auto SerializeFlag = [&](const char *const name, const EObjectFlags flag)
|
|
{
|
|
int value = ObjectFlags & flag;
|
|
int defaultvalue = 0;
|
|
arc(name, value, defaultvalue);
|
|
if (arc.isReading())
|
|
{
|
|
ObjectFlags |= value;
|
|
}
|
|
};
|
|
|
|
SerializeFlag("justspawned", OF_JustSpawned);
|
|
SerializeFlag("spawned", OF_Spawned);
|
|
SerializeFlag("networked", OF_Networked);
|
|
SerializeFlag("clientside", OF_ClientSide);
|
|
|
|
ObjectFlags |= OF_SerialSuccess;
|
|
|
|
if (arc.isReading() && (ObjectFlags & OF_Networked))
|
|
{
|
|
ClearNetworkID();
|
|
EnableNetworking(true);
|
|
}
|
|
}
|
|
|
|
void DObject::CheckIfSerialized () const
|
|
{
|
|
if (!(ObjectFlags & OF_SerialSuccess))
|
|
{
|
|
I_Error (
|
|
"BUG: %s::Serialize\n"
|
|
"(or one of its superclasses) needs to call\n"
|
|
"Super::Serialize\n",
|
|
StaticType()->TypeName.GetChars());
|
|
}
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION(DObject, MSTime)
|
|
{
|
|
ACTION_RETURN_INT((uint32_t)I_msTime());
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION_NATIVE(DObject, MSTimef, I_msTimeF)
|
|
{
|
|
ACTION_RETURN_FLOAT(I_msTimeF());
|
|
}
|
|
|
|
void *DObject::ScriptVar(FName field, PType *type)
|
|
{
|
|
auto cls = GetClass();
|
|
auto sym = dyn_cast<PField>(cls->FindSymbol(field, true));
|
|
if (sym && (sym->Type == type || type == nullptr))
|
|
{
|
|
if (!(sym->Flags & VARF_Meta))
|
|
{
|
|
return (((char*)this) + sym->Offset);
|
|
}
|
|
else
|
|
{
|
|
return (cls->Meta + sym->Offset);
|
|
}
|
|
}
|
|
// This is only for internal use so I_Error is fine.
|
|
I_Error("Variable %s not found in %s\n", field.GetChars(), cls->TypeName.GetChars());
|
|
}
|
|
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void NetworkEntityManager::InitializeNetworkEntities()
|
|
{
|
|
if (!s_netEntities.Size())
|
|
s_netEntities.AppendFill(nullptr, NetIDStart); // Allocate the first 0-8 slots for the world and clients.
|
|
}
|
|
|
|
// Clients need special handling since they always go in slots 1 - MAXPLAYERS.
|
|
void NetworkEntityManager::SetClientNetworkEntity(DObject* mo, const unsigned int playNum)
|
|
{
|
|
// If resurrecting, we need to swap the corpse's position with the new pawn's
|
|
// position so it's no longer considered the client's body.
|
|
const uint32_t id = ClientNetIDStart + playNum;
|
|
DObject* const oldBody = s_netEntities[id];
|
|
if (oldBody != nullptr)
|
|
{
|
|
if (oldBody == mo)
|
|
return;
|
|
|
|
const uint32_t curID = mo->GetNetworkID();
|
|
|
|
s_netEntities[curID] = oldBody;
|
|
oldBody->ClearNetworkID();
|
|
oldBody->SetNetworkID(curID);
|
|
|
|
mo->ClearNetworkID();
|
|
}
|
|
else
|
|
{
|
|
RemoveNetworkEntity(mo); // Free up its current id.
|
|
}
|
|
|
|
s_netEntities[id] = mo;
|
|
mo->SetNetworkID(id);
|
|
}
|
|
|
|
void NetworkEntityManager::AddNetworkEntity(DObject* const ent)
|
|
{
|
|
if (ent->IsNetworked() || ent->IsClientside())
|
|
return;
|
|
|
|
// Slot 0 is reserved for the world.
|
|
// Clients go in the first 1 - MAXPLAYERS slots
|
|
// Everything else is first come first serve.
|
|
uint32_t id = WorldNetID;
|
|
if (s_openNetIDs.Size())
|
|
{
|
|
s_openNetIDs.Pop(id);
|
|
s_netEntities[id] = ent;
|
|
}
|
|
else
|
|
{
|
|
id = s_netEntities.Push(ent);
|
|
}
|
|
|
|
ent->SetNetworkID(id);
|
|
}
|
|
|
|
void NetworkEntityManager::RemoveNetworkEntity(DObject* const ent)
|
|
{
|
|
if (!ent->IsNetworked())
|
|
return;
|
|
|
|
const uint32_t id = ent->GetNetworkID();
|
|
if (id == WorldNetID)
|
|
return;
|
|
|
|
assert(s_netEntities[id] == ent);
|
|
if (id >= NetIDStart)
|
|
s_openNetIDs.Push(id);
|
|
s_netEntities[id] = nullptr;
|
|
ent->ClearNetworkID();
|
|
}
|
|
|
|
DObject* NetworkEntityManager::GetNetworkEntity(const uint32_t id)
|
|
{
|
|
if (id == WorldNetID || id >= s_netEntities.Size())
|
|
return nullptr;
|
|
|
|
return s_netEntities[id];
|
|
}
|
|
|
|
//==========================================================================
|
|
//
|
|
//
|
|
//
|
|
//==========================================================================
|
|
|
|
void DObject::SetNetworkID(const uint32_t id)
|
|
{
|
|
if (!IsNetworked())
|
|
{
|
|
ObjectFlags |= OF_Networked;
|
|
_networkID = id;
|
|
}
|
|
}
|
|
|
|
void DObject::ClearNetworkID()
|
|
{
|
|
ObjectFlags &= ~OF_Networked;
|
|
_networkID = NetworkEntityManager::WorldNetID;
|
|
}
|
|
|
|
void DObject::EnableNetworking(const bool enable)
|
|
{
|
|
if (enable)
|
|
NetworkEntityManager::AddNetworkEntity(this);
|
|
else
|
|
NetworkEntityManager::RemoveNetworkEntity(this);
|
|
}
|
|
|
|
void DObject::RemoveFromNetwork()
|
|
{
|
|
NetworkEntityManager::RemoveNetworkEntity(this);
|
|
}
|
|
|
|
static unsigned int GetNetworkID(DObject* const self)
|
|
{
|
|
return self->GetNetworkID();
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION_NATIVE(DObject, GetNetworkID, GetNetworkID)
|
|
{
|
|
PARAM_SELF_PROLOGUE(DObject);
|
|
|
|
ACTION_RETURN_INT(self->GetNetworkID());
|
|
}
|
|
|
|
static int IsClientside(DObject* self)
|
|
{
|
|
return self->IsClientside();
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION_NATIVE(DObject, IsClientside, IsClientside)
|
|
{
|
|
PARAM_SELF_PROLOGUE(DObject);
|
|
|
|
ACTION_RETURN_BOOL(self->IsClientside());
|
|
}
|
|
|
|
static void EnableNetworking(DObject* const self, const bool enable)
|
|
{
|
|
self->EnableNetworking(enable);
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION_NATIVE(DObject, EnableNetworking, EnableNetworking)
|
|
{
|
|
PARAM_SELF_PROLOGUE(DObject);
|
|
PARAM_BOOL(enable);
|
|
|
|
self->EnableNetworking(enable);
|
|
return 0;
|
|
}
|
|
|
|
static DObject* GetNetworkEntity(const unsigned int id)
|
|
{
|
|
return NetworkEntityManager::GetNetworkEntity(id);
|
|
}
|
|
|
|
DEFINE_ACTION_FUNCTION_NATIVE(DObject, GetNetworkEntity, GetNetworkEntity)
|
|
{
|
|
PARAM_PROLOGUE;
|
|
PARAM_UINT(id);
|
|
|
|
ACTION_RETURN_OBJECT(NetworkEntityManager::GetNetworkEntity(id));
|
|
}
|
|
|