Archive/openmohaa
0
0
Fork 0
mirror of https://github.com/openmoh/openmohaa.git synced 2025-05-10 12:36:38 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

Formatted navigate source files

Browse source
This commit is contained in:
smallmodel 2023-10-22 21:06:43 +02:00
parent 4a9f9a45c2
commit b996918d3b
No known key found for this signature in database
GPG key ID: 9F2D623CEDF08512
2 changed files with 2738 additions and 3294 deletions
Download patch file Download diff file Expand all files Collapse all files

3009
code/fgame/navigate.cpp
View file

File diff suppressed because it is too large Load diff

317
code/fgame/navigate.h
View file

@ -1,6 +1,6 @@
/* /*
=========================================================================== ===========================================================================
Copyright (C) 2015 the OpenMoHAA team Copyright (C) 2023 the OpenMoHAA team
This file is part of OpenMoHAA source code. This file is part of OpenMoHAA source code.
@ -25,8 +25,7 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
// is currently unfinished. // is currently unfinished.
// //
#ifndef __NAVIGATE_H__ #pragma once
#define __NAVIGATE_H__
#include "g_local.h" #include "g_local.h"
#include "class.h" #include "class.h"
@ -37,7 +36,6 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
#include "sentient.h" #include "sentient.h"
#include "../qcommon/qfiles.h" #include "../qcommon/qfiles.h"
extern Event EV_AI_SavePaths; extern Event EV_AI_SavePaths;
extern Event EV_AI_SaveNodes; extern Event EV_AI_SaveNodes;
extern Event EV_AI_LoadNodes; extern Event EV_AI_LoadNodes;
@ -71,14 +69,15 @@ class PathNode;
#define NUM_WIDTH_VALUES 16 #define NUM_WIDTH_VALUES 16
#define WIDTH_STEP 8 #define WIDTH_STEP 8
#define MAX_WIDTH ( WIDTH_STEP * NUM_WIDTH_VALUES ) #define MAX_WIDTH (WIDTH_STEP * NUM_WIDTH_VALUES)
#define MAX_HEIGHT 128 #define MAX_HEIGHT 128
#define CHECK_PATH( path, width, height ) \ #define CHECK_PATH(path, width, height) \
( ( ( ( width ) >= MAX_WIDTH ) || ( ( width ) < 0 ) ) ? false : \ ((((width) >= MAX_WIDTH) || ((width) < 0)) ? false \
( ( int )( path )->maxheight[ ( ( width ) / WIDTH_STEP ) - 1 ] < ( int )( height ) ) ) : ((int)(path)->maxheight[((width) / WIDTH_STEP) - 1] < (int)(height)))
class pathway_ref { class pathway_ref
{
public: public:
short int from; short int from;
short int to; short int to;
@ -89,34 +88,36 @@ typedef struct {
short int node; short int node;
short int fallheight; short int fallheight;
float dist; float dist;
float dir[ 2 ]; float dir[2];
float pos1[ 3 ]; float pos1[3];
float pos2[ 3 ]; float pos2[3];
} pathway_t; } pathway_t;
class PathInfo { class PathInfo
{
public: public:
bool bAccurate; bool bAccurate;
float point[ 3 ]; float point[3];
float dist; float dist;
float dir[ 2 ]; float dir[2];
public: public:
void Archive( Archiver& arc ); void Archive(Archiver& arc);
}; };
inline void PathInfo::Archive inline void PathInfo::Archive(Archiver& arc)
(
Archiver& arc
)
{ {
arc.ArchiveBool( &bAccurate ); arc.ArchiveBool(&bAccurate);
arc.ArchiveVec3( point ); arc.ArchiveVec3(point);
arc.ArchiveFloat( &dist ); arc.ArchiveFloat(&dist);
arc.ArchiveVec2( dir ); arc.ArchiveVec2(dir);
} }
typedef enum { NOT_IN_LIST, IN_OPEN, IN_CLOSED } pathlist_t; typedef enum {
NOT_IN_LIST,
IN_OPEN,
IN_CLOSED
} pathlist_t;
#define PATH_DONT_LINK 1 #define PATH_DONT_LINK 1
#define AI_DUCK 2 #define AI_DUCK 2
@ -127,21 +128,21 @@ typedef enum { NOT_IN_LIST, IN_OPEN, IN_CLOSED } pathlist_t;
#define AI_SNIPER 64 #define AI_SNIPER 64
#define AI_CRATE 128 #define AI_CRATE 128
#define AI_COVERFLAGS (AI_CRATE|AI_SNIPER|AI_CORNER_RIGHT|AI_CORNER_LEFT|AI_CONCEALMENT|AI_COVER) #define AI_COVERFLAGS (AI_CRATE | AI_SNIPER | AI_CORNER_RIGHT | AI_CORNER_LEFT | AI_CONCEALMENT | AI_COVER)
#define AI_COVERFLAGS2 (AI_SNIPER|AI_CORNER_RIGHT|AI_CORNER_LEFT|AI_CONCEALMENT) #define AI_COVERFLAGS2 (AI_SNIPER | AI_CORNER_RIGHT | AI_CORNER_LEFT | AI_CONCEALMENT)
#define AI_COVERFLAGS3 (AI_SNIPER|AI_CORNER_RIGHT|AI_CORNER_LEFT|AI_CONCEALMENT|AI_DUCK|AI_CONCEALMENT) #define AI_COVERFLAGS3 (AI_SNIPER | AI_CORNER_RIGHT | AI_CORNER_LEFT | AI_CONCEALMENT | AI_DUCK | AI_CONCEALMENT)
#define AI_SNIPERFLAGS (AI_SNIPER|AI_CORNER_RIGHT|AI_CORNER_LEFT|AI_COVER) #define AI_SNIPERFLAGS (AI_SNIPER | AI_CORNER_RIGHT | AI_CORNER_LEFT | AI_COVER)
#define AI_CRATEFLAGS (AI_CRATE|AI_CORNER_LEFT|AI_CORNER_RIGHT|AI_CONCEALMENT|AI_COVER|AI_DUCK) #define AI_CRATEFLAGS (AI_CRATE | AI_CORNER_LEFT | AI_CORNER_RIGHT | AI_CONCEALMENT | AI_COVER | AI_DUCK)
#define AI_COVER_LEFT_FLAGS (AI_CRATE|AI_SNIPER|AI_CORNER_LEFT|AI_CONCEALMENT|AI_DUCK) #define AI_COVER_LEFT_FLAGS (AI_CRATE | AI_SNIPER | AI_CORNER_LEFT | AI_CONCEALMENT | AI_DUCK)
#define AI_COVER_RIGHT_FLAGS (AI_CRATE|AI_SNIPER|AI_CORNER_RIGHT|AI_CONCEALMENT|AI_DUCK) #define AI_COVER_RIGHT_FLAGS (AI_CRATE | AI_SNIPER | AI_CORNER_RIGHT | AI_CONCEALMENT | AI_DUCK)
#define AI_ALL (AI_DUCK|AI_COVER|AI_CONCEALMENT|AI_CORNER_LEFT|AI_CORNER_RIGHT|AI_SNIPER|AI_CRATE) #define AI_ALL (AI_DUCK | AI_COVER | AI_CONCEALMENT | AI_CORNER_LEFT | AI_CORNER_RIGHT | AI_SNIPER | AI_CRATE)
void DrawNode( int iNodeCount ); void DrawNode(int iNodeCount);
void DrawAllConnections( void ); void DrawAllConnections(void);
class PathNode : public SimpleEntity class PathNode : public SimpleEntity
{ {
public: public:
int findCount; int findCount;
pathway_t *Child; pathway_t *Child;
int numChildren; int numChildren;
@ -156,7 +157,7 @@ class PathNode : public SimpleEntity
short int pathway; short int pathway;
vec_t *m_PathPos; vec_t *m_PathPos;
float dist; float dist;
float dir[ 2 ]; float dir[2];
int nodeflags; int nodeflags;
SafePtr<Entity> pLastClaimer; SafePtr<Entity> pLastClaimer;
int iAvailableTime; int iAvailableTime;
@ -164,55 +165,55 @@ class PathNode : public SimpleEntity
short int m_Depth; short int m_Depth;
friend class PathSearch; friend class PathSearch;
friend void DrawAllConnections( void ); friend void DrawAllConnections(void);
private: private:
void ConnectTo( PathNode *node ); void ConnectTo(PathNode *node);
void SetNodeFlags( Event *ev ); void SetNodeFlags(Event *ev);
void Remove( Event *ev ); void Remove(Event *ev);
public: public:
CLASS_PROTOTYPE( PathNode ); CLASS_PROTOTYPE(PathNode);
void *operator new( size_t size ); void *operator new(size_t size);
void operator delete( void *ptr ); void operator delete(void *ptr);
PathNode(); PathNode();
virtual ~PathNode(); virtual ~PathNode();
void Archive( Archiver& arc ) override; void Archive(Archiver& arc) override;
void ArchiveDynamic( Archiver& arc ); void ArchiveDynamic(Archiver& arc);
void ArchiveStatic( Archiver& arc ); void ArchiveStatic(Archiver& arc);
bool CheckPathTo( PathNode *node ); bool CheckPathTo(PathNode *node);
void CheckPathToDefault( PathNode *node, pathway_t *pathway ); void CheckPathToDefault(PathNode *node, pathway_t *pathway);
qboolean LadderTo( PathNode *node, pathway_t *pathway ); qboolean LadderTo(PathNode *node, pathway_t *pathway);
void DrawConnections( void ); void DrawConnections(void);
void Claim( Entity *pClaimer ); void Claim(Entity *pClaimer);
void Relinquish( void ); void Relinquish(void);
Entity *GetClaimHolder( void ) const; Entity *GetClaimHolder(void) const;
bool IsClaimedByOther( Entity *pPossibleClaimer ) const; bool IsClaimedByOther(Entity *pPossibleClaimer) const;
void MarkTemporarilyBad( void ); void MarkTemporarilyBad(void);
void ConnectChild( int i ); void ConnectChild(int i);
void DisconnectChild( int i ); void DisconnectChild(int i);
const_str GetSpecialAttack( class Actor *pActor ); const_str GetSpecialAttack(class Actor *pActor);
void IsTouching( Event *ev ); void IsTouching(Event *ev);
qboolean IsTouching( Entity *e1 ); qboolean IsTouching(Entity *e1);
void setOriginEvent( Vector org ) override; void setOriginEvent(Vector org) override;
};
};
typedef SafePtr<PathNode> PathNodePtr; typedef SafePtr<PathNode> PathNodePtr;
class nodeinfo { class nodeinfo
{
public: public:
PathNode *pNode; PathNode *pNode;
float fDistSquared; float fDistSquared;
}; };
#define PATHMAP_CELLSIZE 256 #define PATHMAP_CELLSIZE 256
#define PATHMAP_GRIDSIZE ( MAX_MAP_BOUNDS * 2 / PATHMAP_CELLSIZE ) #define PATHMAP_GRIDSIZE (MAX_MAP_BOUNDS * 2 / PATHMAP_CELLSIZE)
#define PATHMAP_NODES 128 // 128 - sizeof( int ) / sizeof( short ) #define PATHMAP_NODES 128 // 128 - sizeof( int ) / sizeof( short )
@ -230,8 +231,8 @@ public:
MapCell(); MapCell();
~MapCell(); ~MapCell();
qboolean AddNode( PathNode *node ); qboolean AddNode(PathNode *node);
int NumNodes( void ); int NumNodes(void);
}; };
class PathSearch : public Listener class PathSearch : public Listener
@ -239,7 +240,7 @@ class PathSearch : public Listener
friend class PathNode; friend class PathNode;
private: private:
static MapCell PathMap[ PATHMAP_GRIDSIZE ][ PATHMAP_GRIDSIZE ]; static MapCell PathMap[PATHMAP_GRIDSIZE][PATHMAP_GRIDSIZE];
static PathNode *open; static PathNode *open;
static int findFrame; static int findFrame;
static qboolean m_bNodesloaded; static qboolean m_bNodesloaded;
@ -247,73 +248,94 @@ private:
static int m_LoadIndex; static int m_LoadIndex;
public: public:
static PathNode *pathnodes[ 4096 ]; static PathNode *pathnodes[4096];
static int nodecount; static int nodecount;
static float total_dist; static float total_dist;
static const char *last_error; static const char *last_error;
private: private:
static void LoadAddToGrid( int x, int y ); static void LoadAddToGrid(int x, int y);
static void LoadAddToGrid2( PathNode *node, int x, int y ); static void LoadAddToGrid2(PathNode *node, int x, int y);
static void AddToGrid( PathNode *node, int x, int y ); static void AddToGrid(PathNode *node, int x, int y);
static bool Connect( PathNode *node, int x, int y ); static bool Connect(PathNode *node, int x, int y);
static int NodeCoordinate( float coord ); static int NodeCoordinate(float coord);
static int GridCoordinate( float coord ); static int GridCoordinate(float coord);
static qboolean ArchiveSaveNodes( void ); static qboolean ArchiveSaveNodes(void);
static void ArchiveLoadNodes( void ); static void ArchiveLoadNodes(void);
static void Init( void ); static void Init(void);
public: public:
CLASS_PROTOTYPE( PathSearch ); CLASS_PROTOTYPE(PathSearch);
PathSearch(); PathSearch();
virtual ~PathSearch(); virtual ~PathSearch();
static void ArchiveStaticLoad( Archiver& arc ); static void ArchiveStaticLoad(Archiver &arc);
static void ArchiveStaticSave( Archiver& arc ); static void ArchiveStaticSave(Archiver &arc);
static bool ArchiveDynamic( Archiver& arc ); static bool ArchiveDynamic(Archiver &arc);
static void AddNode( PathNode *node ); static void AddNode(PathNode *node);
static void Connect( PathNode *node ); static void Connect(PathNode *node);
static void UpdateNode( PathNode *node ); static void UpdateNode(PathNode *node);
static MapCell *GetNodesInCell( int x, int y ); static MapCell *GetNodesInCell(int x, int y);
static MapCell *GetNodesInCell( float *pos ); static MapCell *GetNodesInCell(float *pos);
static class PathNode *DebugNearestStartNode( float *pos, Entity *ent = NULL ); static class PathNode *DebugNearestStartNode(float *pos, Entity *ent = NULL);
static class PathNode *NearestStartNode( float *pos, class SimpleActor *ent ); static class PathNode *NearestStartNode(float *pos, class SimpleActor *ent);
static class PathNode *NearestEndNode( float *pos ); static class PathNode *NearestEndNode(float *pos);
static int DebugNearestNodeList( float *pos, PathNode **nodelist, int iMaxNodes ); static int DebugNearestNodeList(float *pos, PathNode **nodelist, int iMaxNodes);
static int DebugNearestNodeList2( float *pos, PathNode **nodelist, int iMaxNodes ); static int DebugNearestNodeList2(float *pos, PathNode **nodelist, int iMaxNodes);
static void ShowNodes( void ); static void ShowNodes(void);
static void LoadNodes( void ); static void LoadNodes(void);
static void CreatePaths( void ); static void CreatePaths(void);
static void *AllocPathNode( void ); static void *AllocPathNode(void);
static void FreePathNode( void * ); static void FreePathNode(void *);
static void ResetNodes( void ); static void ResetNodes(void);
static void UpdatePathwaysForBadPlace(const Vector& origin, float radius, int dir, int team); static void UpdatePathwaysForBadPlace(const Vector &origin, float radius, int dir, int team);
static PathInfo *GeneratePath( PathInfo *path ); static PathInfo *GeneratePath(PathInfo *path);
static PathInfo *GeneratePathNear( PathInfo *path ); static PathInfo *GeneratePathNear(PathInfo *path);
static PathInfo *GeneratePathAway( PathInfo *path ); static PathInfo *GeneratePathAway(PathInfo *path);
static class PathNode *GetSpawnNode( ClassDef *cls ); static class PathNode *GetSpawnNode(ClassDef *cls);
static int FindPath( float *start, float *end, Entity *ent, float maxPath, float *vLeashHome, float fLeashDistSquared, int fallheight ); static int FindPath(
static int FindPathAway( float *start, float *avoid, float *vPreferredDir, Entity *ent, float fMinSafeDist, float *vLeashHome, float fLeashDistSquared, int fallheight ); float *start, float *end, Entity *ent, float maxPath, float *vLeashHome, float fLeashDistSquared, int fallheight
static int FindPathNear( float *start, float *end, Entity *ent, float maxPath, float fRadiusSquared, float *vLeashHome, float fLeashDistSquared, int fallheight ); );
static class PathNode *FindCornerNodeForWall( float *start, float *end, class SimpleActor *ent, float maxPath, float *plane ); static int FindPathAway(
static class PathNode *FindCornerNodeForExactPath( class SimpleActor *self, Sentient *enemy, float fMaxPath ); float *start,
static int FindPotentialCover( class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy, PathNode **ppFoundNodes, int iMaxFind ); float *avoid,
static void PlayerCover( class Player *pPlayer ); float *vPreferredDir,
static class PathNode *FindNearestCover( class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy ); Entity *ent,
static class PathNode *FindNearestSniperNode( class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy ); float fMinSafeDist,
float *vLeashHome,
float fLeashDistSquared,
int fallheight
);
static int FindPathNear(
float *start,
float *end,
Entity *ent,
float maxPath,
float fRadiusSquared,
float *vLeashHome,
float fLeashDistSquared,
int fallheight
);
static class PathNode *
FindCornerNodeForWall(float *start, float *end, class SimpleActor *ent, float maxPath, float *plane);
static class PathNode *FindCornerNodeForExactPath(class SimpleActor *self, Sentient *enemy, float fMaxPath);
static int
FindPotentialCover(class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy, PathNode **ppFoundNodes, int iMaxFind);
static void PlayerCover(class Player *pPlayer);
static class PathNode *FindNearestCover(class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy);
static class PathNode *FindNearestSniperNode(class SimpleActor *pEnt, Vector& vPos, Entity *pEnemy);
private: private:
static int NearestNodeSetup( vec3_t pos, MapCell *cell, int *nodes, vec3_t *deltas ); static int NearestNodeSetup(vec3_t pos, MapCell *cell, int *nodes, vec3_t *deltas);
}; };
extern PathSearch PathManager; extern PathSearch PathManager;
PathNode *AI_FindNode( const char *name ); PathNode *AI_FindNode(const char *name);
void AI_AddNode( PathNode *node ); void AI_AddNode(PathNode *node);
void AI_RemoveNode( PathNode *node ); void AI_RemoveNode(PathNode *node);
void AI_ResetNodes( void ); void AI_ResetNodes(void);
class AttractiveNode : public SimpleArchivedEntity class AttractiveNode : public SimpleArchivedEntity
{ {
@ -328,45 +350,40 @@ public:
int m_iTeam; int m_iTeam;
private: private:
// Container< SafePtr< Sentient > > m_pSentList; // Container< SafePtr< Sentient > > m_pSentList;
public: public:
CLASS_PROTOTYPE( AttractiveNode ); CLASS_PROTOTYPE(AttractiveNode);
AttractiveNode(); AttractiveNode();
~AttractiveNode(); ~AttractiveNode();
bool CheckTeam( Sentient *sent ); bool CheckTeam(Sentient *sent);
void setMaxDist( float dist ); void setMaxDist(float dist);
void GetPriority( Event *ev ); void GetPriority(Event *ev);
void SetPriority( Event *ev ); void SetPriority(Event *ev);
void GetDistance( Event *ev ); void GetDistance(Event *ev);
void SetDistance( Event *ev ); void SetDistance(Event *ev);
void GetStayTime( Event *ev ); void GetStayTime(Event *ev);
void SetStayTime( Event *ev ); void SetStayTime(Event *ev);
void GetRespawnTime( Event *ev ); void GetRespawnTime(Event *ev);
void SetRespawnTime( Event *ev ); void SetRespawnTime(Event *ev);
void GetTeam( Event *ev ); void GetTeam(Event *ev);
void SetTeam( Event *ev ); void SetTeam(Event *ev);
void SetUse( Event *ev ); void SetUse(Event *ev);
void Archive( Archiver& arc ) override; void Archive(Archiver& arc) override;
}; };
typedef SafePtr< AttractiveNode > AttractiveNodePtr; typedef SafePtr<AttractiveNode> AttractiveNodePtr;
inline void AttractiveNode::Archive inline void AttractiveNode::Archive(Archiver& arc)
(
Archiver& arc
)
{ {
arc.ArchiveInteger( &m_iPriority ); arc.ArchiveInteger(&m_iPriority);
arc.ArchiveBool( &m_bUse ); arc.ArchiveBool(&m_bUse);
arc.ArchiveFloat( &m_fMaxStayTime ); arc.ArchiveFloat(&m_fMaxStayTime);
arc.ArchiveFloat( &m_fMaxDistanceSquared ); arc.ArchiveFloat(&m_fMaxDistanceSquared);
} }
extern Container< AttractiveNode * > attractiveNodes; extern Container<AttractiveNode *> attractiveNodes;
#endif