mirror of
https://gitea.wildfiregames.com/0ad/0ad
synced 2026-06-16 05:13:58 -07:00
c0ed950657
this snowballed into a massive search+destroy of the hodgepodge of mostly equivalent types we had in use (int, uint, unsigned, unsigned int, i32, u32, ulong, uintN). it is more efficient to use 64-bit types in 64-bit mode, so the preferred default is size_t (for anything remotely resembling a size or index). tile coordinates are ssize_t to allow more efficient conversion to/from floating point. flags are int because we almost never need more than 15 distinct bits, bit test/set is not slower and int is fastest to type. finally, some data that is pretty much directly passed to OpenGL is now typed accordingly. after several hours, the code now requires fewer casts and less guesswork. other changes: - unit and player IDs now have an "invalid id" constant in the respective class to avoid casting and -1 - fix some endian/64-bit bugs in the map (un)packing. added a convenience function to write/read a size_t. - ia32: change CPUID interface to allow passing in ecx (required for cache topology detection, which I need at work). remove some unneeded functions from asm, replace with intrinsics where possible. This was SVN commit r5942.
149 lines
3.9 KiB
C++
149 lines
3.9 KiB
C++
/**
|
|
* =========================================================================
|
|
* File : UnitManager.cpp
|
|
* Project : 0 A.D.
|
|
* Description : Container that owns all units
|
|
* =========================================================================
|
|
*/
|
|
|
|
#include "precompiled.h"
|
|
|
|
#include <float.h>
|
|
|
|
#include "Model.h"
|
|
#include "UnitManager.h"
|
|
#include "Unit.h"
|
|
#include "ObjectManager.h"
|
|
#include "ObjectEntry.h"
|
|
#include "ps/Game.h"
|
|
#include "ps/World.h"
|
|
#include "simulation/Entity.h"
|
|
#include "simulation/LOSManager.h"
|
|
|
|
#include <algorithm>
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// CUnitManager constructor
|
|
CUnitManager::CUnitManager()
|
|
: m_NextID(0)
|
|
{
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// CUnitManager destructor
|
|
CUnitManager::~CUnitManager()
|
|
{
|
|
DeleteAll();
|
|
}
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// AddUnit: add given unit to world
|
|
void CUnitManager::AddUnit(CUnit* unit)
|
|
{
|
|
m_Units.push_back(unit);
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// RemoveUnit: remove given unit from world, but don't delete it
|
|
void CUnitManager::RemoveUnit(CUnit* unit)
|
|
{
|
|
// find entry in list
|
|
typedef std::vector<CUnit*>::iterator Iter;
|
|
Iter i=std::find(m_Units.begin(),m_Units.end(),unit);
|
|
if (i!=m_Units.end()) {
|
|
m_Units.erase(i);
|
|
}
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// DeleteUnit: remove given unit from world and delete it
|
|
void CUnitManager::DeleteUnit(CUnit* unit)
|
|
{
|
|
RemoveUnit(unit);
|
|
delete unit;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// DeleteAll: remove and delete all units
|
|
void CUnitManager::DeleteAll()
|
|
{
|
|
for (size_t i=0;i<m_Units.size();i++) {
|
|
delete m_Units[i];
|
|
}
|
|
m_Units.clear();
|
|
}
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// PickUnit: iterate through units testing given ray against bounds of each
|
|
// unit; return the closest unit, or null if everything missed
|
|
CUnit* CUnitManager::PickUnit(const CVector3D& origin, const CVector3D& dir, bool entitiesOnly) const
|
|
{
|
|
CLOSManager* losMgr = g_Game->GetWorld()->GetLOSManager();
|
|
|
|
// closest object found so far
|
|
CUnit* hit = 0;
|
|
// distance to closest object found so far
|
|
float dist = FLT_MAX;
|
|
// closest approach offset (easier to pick small stuff in forests than standard ScEd style selection)
|
|
float minrel = FLT_MAX;
|
|
|
|
for (size_t i=0; i<m_Units.size(); i++) {
|
|
CUnit* unit = m_Units[i];
|
|
float tmin, tmax;
|
|
|
|
CEntity* ent = unit->GetEntity();
|
|
if( entitiesOnly && !ent )
|
|
continue;
|
|
if( ent && !ent->m_visible )
|
|
continue;
|
|
|
|
if (unit->GetModel()->GetBounds().RayIntersect(origin, dir, tmin, tmax)
|
|
&& losMgr->GetUnitStatus(unit, g_Game->GetLocalPlayer()) != UNIT_HIDDEN)
|
|
{
|
|
// Point of closest approach
|
|
CVector3D obj;
|
|
unit->GetModel()->GetBounds().GetCentre(obj);
|
|
CVector3D delta = obj - origin;
|
|
float distance = delta.Dot(dir);
|
|
CVector3D closest = origin + dir * distance;
|
|
CVector3D offset = obj - closest;
|
|
|
|
float rel = offset.Length();
|
|
if (rel < minrel) {
|
|
hit = unit;
|
|
dist = tmin;
|
|
minrel = rel;
|
|
}
|
|
}
|
|
}
|
|
return hit;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// CreateUnit: create a new unit and add it to the world
|
|
CUnit* CUnitManager::CreateUnit(const CStr& actorName, CEntity* entity, const std::set<CStr>& selections)
|
|
{
|
|
if (! m_ObjectManager)
|
|
return NULL;
|
|
|
|
CUnit* unit = CUnit::Create(actorName, entity, selections, *m_ObjectManager);
|
|
if (unit)
|
|
AddUnit(unit);
|
|
return unit;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
// FindByID
|
|
CUnit* CUnitManager::FindByID(size_t id) const
|
|
{
|
|
if (id == CUnit::invalidId)
|
|
return NULL;
|
|
|
|
for (size_t i = 0; i < m_Units.size(); ++i)
|
|
if (m_Units[i]->GetID() == id)
|
|
return m_Units[i];
|
|
|
|
return NULL;
|
|
}
|