This repository has been archived on 2022-06-27. You can view files and clone it, but cannot push or open issues or pull requests.
Xash3DArchive/engine/server/sv_world.c

592 lines
15 KiB
C
Raw Normal View History

2008-11-14 22:00:00 +01:00
//=======================================================================
// Copyright XashXT Group 2008 <20>
// sv_world.c - world query functions
//=======================================================================
2007-06-21 22:00:00 +02:00
2008-06-09 22:00:00 +02:00
#include "common.h"
2007-06-21 22:00:00 +02:00
#include "server.h"
2008-09-09 22:00:00 +02:00
#include "const.h"
2009-11-10 22:00:00 +01:00
#include "pm_defs.h"
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
areanode_t sv_areanodes[AREA_NODES];
int sv_numareanodes;
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
/*
===============
SV_CreateAreaNode
builds a uniformly subdivided tree for the given world size
===============
*/
areanode_t *SV_CreateAreaNode( int depth, vec3_t mins, vec3_t maxs )
{
areanode_t *anode;
2007-06-21 22:00:00 +02:00
vec3_t size;
2008-11-14 22:00:00 +01:00
vec3_t mins1, maxs1;
vec3_t mins2, maxs2;
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
anode = &sv_areanodes[sv_numareanodes++];
2007-06-21 22:00:00 +02:00
2009-11-02 22:00:00 +01:00
ClearLink( &anode->trigger_edicts );
ClearLink( &anode->solid_edicts );
2010-04-01 22:00:00 +02:00
ClearLink( &anode->water_edicts );
2008-11-14 22:00:00 +01:00
2008-01-17 22:00:00 +01:00
if( depth == AREA_DEPTH )
2007-06-21 22:00:00 +02:00
{
anode->axis = -1;
anode->children[0] = anode->children[1] = NULL;
return anode;
}
2008-01-17 22:00:00 +01:00
VectorSubtract( maxs, mins, size );
2008-11-14 22:00:00 +01:00
if( size[0] > size[1] )
anode->axis = 0;
2007-09-16 22:00:00 +02:00
else anode->axis = 1;
2008-11-14 22:00:00 +01:00
2008-01-17 22:00:00 +01:00
anode->dist = 0.5f * (maxs[anode->axis] + mins[anode->axis]);
2008-11-14 22:00:00 +01:00
VectorCopy( mins, mins1 );
VectorCopy( mins, mins2 );
VectorCopy( maxs, maxs1 );
VectorCopy( maxs, maxs2 );
2007-06-21 22:00:00 +02:00
maxs1[anode->axis] = mins2[anode->axis] = anode->dist;
2008-11-14 22:00:00 +01:00
anode->children[0] = SV_CreateAreaNode( depth+1, mins2, maxs2 );
anode->children[1] = SV_CreateAreaNode( depth+1, mins1, maxs1 );
2007-06-21 22:00:00 +02:00
return anode;
}
/*
===============
SV_ClearWorld
===============
*/
2008-09-09 22:00:00 +02:00
void SV_ClearWorld( void )
2007-06-21 22:00:00 +02:00
{
2009-10-28 22:00:00 +01:00
vec3_t mins, maxs;
2009-10-29 22:00:00 +01:00
int worldIndex = 1;
2008-11-14 22:00:00 +01:00
sv_numareanodes = 0;
2009-10-29 22:00:00 +01:00
Mod_GetBounds( worldIndex, mins, maxs );
2008-11-14 22:00:00 +01:00
Mem_Set( sv_areanodes, 0, sizeof( sv_areanodes ));
2009-10-28 22:00:00 +01:00
SV_CreateAreaNode( 0, mins, maxs );
2007-06-21 22:00:00 +02:00
}
2009-11-02 22:00:00 +01:00
/*
====================
SV_TouchLinks
====================
*/
void SV_TouchLinks( edict_t *ent, areanode_t *node )
{
link_t *l, *next;
edict_t *touch;
2010-06-11 22:00:00 +02:00
chull_t *hull;
vec3_t test;
2009-11-02 22:00:00 +01:00
// touch linked edicts
for( l = node->trigger_edicts.next; l != &node->trigger_edicts; l = next )
{
next = l->next;
touch = EDICT_FROM_AREA( l );
if( touch == ent ) continue;
2010-06-11 22:00:00 +02:00
if( touch->free || touch->v.solid != SOLID_TRIGGER ) // disabled ?
2009-11-02 22:00:00 +01:00
continue;
2010-06-11 22:00:00 +02:00
2009-11-02 22:00:00 +01:00
if( !BoundsIntersect( ent->v.absmin, ent->v.absmax, touch->v.absmin, touch->v.absmax ))
continue;
2010-06-11 22:00:00 +02:00
if( CM_GetModelType( touch->v.modelindex ) == mod_brush )
{
hull = CM_HullForBsp( touch, ent->v.mins, ent->v.maxs, test );
// offset the test point appropriately for this hull.
VectorSubtract( ent->v.origin, test, test );
// test hull for intersection with this model
if( CM_HullPointContents( hull, hull->firstclipnode, test ) == CONTENTS_EMPTY )
continue;
}
2009-11-02 22:00:00 +01:00
svgame.dllFuncs.pfnTouch( touch, ent );
if( ent->free ) break; // killtarget issues
}
// recurse down both sides
if( node->axis == -1 ) return;
if( ent->v.absmax[node->axis] > node->dist )
SV_TouchLinks( ent, node->children[0] );
if( ent->v.absmin[node->axis] < node->dist )
SV_TouchLinks( ent, node->children[1] );
}
2007-06-21 22:00:00 +02:00
/*
===============
SV_UnlinkEdict
===============
*/
2008-01-17 22:00:00 +01:00
void SV_UnlinkEdict( edict_t *ent )
2007-06-21 22:00:00 +02:00
{
2008-11-14 22:00:00 +01:00
// not linked in anywhere
2009-11-02 22:00:00 +01:00
if( !ent->pvServerData->area.prev )
return;
2008-01-17 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
RemoveLink( &ent->pvServerData->area );
ent->pvServerData->area.prev = NULL;
ent->pvServerData->area.next = NULL;
2009-11-26 22:00:00 +01:00
ent->pvServerData->linked = false;
2008-01-17 22:00:00 +01:00
}
2007-06-21 22:00:00 +02:00
/*
===============
2008-01-17 22:00:00 +01:00
SV_LinkEntity
2007-06-21 22:00:00 +02:00
===============
*/
2009-11-02 22:00:00 +01:00
void SV_LinkEdict( edict_t *ent, bool touch_triggers )
2007-06-21 22:00:00 +02:00
{
2008-11-14 22:00:00 +01:00
areanode_t *node;
2010-05-22 22:00:00 +02:00
short leafs[MAX_TOTAL_ENT_LEAFS];
2010-05-25 22:00:00 +02:00
int i, j, num_leafs, topNode;
2008-12-26 22:00:00 +01:00
sv_priv_t *sv_ent;
2008-01-17 22:00:00 +01:00
2008-12-26 22:00:00 +01:00
sv_ent = ent->pvServerData;
2007-09-06 22:00:00 +02:00
2009-01-04 22:00:00 +01:00
if( !sv_ent ) return;
2008-11-14 22:00:00 +01:00
if( sv_ent->area.prev ) SV_UnlinkEdict( ent ); // unlink from old position
2008-12-17 22:00:00 +01:00
if( ent == EDICT_NUM( 0 )) return; // don't add the world
2008-12-15 22:00:00 +01:00
if( ent->free ) return;
2007-06-21 22:00:00 +02:00
2009-01-04 22:00:00 +01:00
// trying to classify unclassified edicts
if( sv.state == ss_active && sv_ent->s.ed_type == ED_SPAWNED )
2009-11-28 22:00:00 +01:00
SV_ClassifyEdict( ent, ED_SPAWNED );
2009-01-04 22:00:00 +01:00
2007-06-21 22:00:00 +02:00
// set the abs box
2009-01-02 22:00:00 +01:00
svgame.dllFuncs.pfnSetAbsBox( ent );
2007-06-21 22:00:00 +02:00
2007-08-17 22:00:00 +02:00
// link to PVS leafs
2010-05-22 22:00:00 +02:00
sv_ent->num_leafs = 0;
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
// get all leafs, including solids
2010-05-22 22:00:00 +02:00
num_leafs = CM_BoxLeafnums( ent->v.absmin, ent->v.absmax, leafs, MAX_TOTAL_ENT_LEAFS, &topNode );
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
// if none of the leafs were inside the map, the
// entity is outside the world and can be considered unlinked
if( !num_leafs ) return;
2010-05-22 22:00:00 +02:00
if( num_leafs >= MAX_ENT_LEAFS )
{
// assume we missed some leafs, and mark by headnode
sv_ent->num_leafs = -1;
sv_ent->headnode = topNode;
2007-06-21 22:00:00 +02:00
}
2010-05-22 22:00:00 +02:00
else
2007-06-21 22:00:00 +02:00
{
2010-05-25 22:00:00 +02:00
sv_ent->num_leafs = 0;
for( i = 0; i < num_leafs; i++ )
{
if( leafs[i] == -1 )
continue; // not a visible leaf
for( j = 0; j < i; j++ )
{
if( leafs[j] == leafs[i] )
break;
}
if( j == i )
{
if( sv_ent->num_leafs == MAX_ENT_LEAFS )
{
// assume we missed some leafs, and mark by headNode
sv_ent->num_leafs = -1;
sv_ent->headnode = topNode;
break;
}
sv_ent->leafnums[sv_ent->num_leafs++] = leafs[i];
}
}
2007-06-21 22:00:00 +02:00
}
2009-01-14 22:00:00 +01:00
ent->pvServerData->s.ed_flags |= ESF_LINKEDICT; // change edict state on a client too...
2009-11-02 22:00:00 +01:00
sv_ent->linked = true;
// ignore not solid bodies
2010-04-01 22:00:00 +02:00
if( ent->v.solid == SOLID_NOT && ent->v.skin == CONTENTS_NONE )
2007-11-27 22:00:00 +01:00
return;
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
// find the first node that the ent's box crosses
node = sv_areanodes;
2009-11-02 22:00:00 +01:00
2008-01-17 22:00:00 +01:00
while( 1 )
2007-06-21 22:00:00 +02:00
{
2008-07-30 22:00:00 +02:00
if( node->axis == -1 ) break;
2008-12-15 22:00:00 +01:00
if( ent->v.absmin[node->axis] > node->dist )
2007-06-21 22:00:00 +02:00
node = node->children[0];
2008-12-15 22:00:00 +01:00
else if( ent->v.absmax[node->axis] < node->dist )
2007-06-21 22:00:00 +02:00
node = node->children[1];
2007-08-17 22:00:00 +02:00
else break; // crosses the node
2007-06-21 22:00:00 +02:00
}
2008-11-14 22:00:00 +01:00
// link it in
2008-12-15 22:00:00 +01:00
if( ent->v.solid == SOLID_TRIGGER )
2009-11-02 22:00:00 +01:00
InsertLinkBefore( &sv_ent->area, &node->trigger_edicts, NUM_FOR_EDICT( ent ));
2010-04-01 22:00:00 +02:00
else if( ent->v.solid == SOLID_NOT && ent->v.skin != CONTENTS_NONE )
2010-05-31 22:00:00 +02:00
InsertLinkBefore( &sv_ent->area, &node->water_edicts, NUM_FOR_EDICT( ent ));
else InsertLinkBefore( &sv_ent->area, &node->solid_edicts, NUM_FOR_EDICT( ent ));
2009-11-02 22:00:00 +01:00
if( touch_triggers ) SV_TouchLinks( ent, sv_areanodes );
2007-06-21 22:00:00 +02:00
}
2008-01-17 22:00:00 +01:00
/*
============================================================================
AREA QUERY
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
Fills in a list of all entities who's absmin / absmax intersects the given
bounds. This does NOT mean that they actually touch in the case of bmodels.
============================================================================
*/
2007-06-21 22:00:00 +02:00
/*
====================
SV_AreaEdicts_r
====================
*/
2008-11-14 22:00:00 +01:00
void SV_AreaEdicts_r( areanode_t *node, area_t *ap )
2007-06-21 22:00:00 +02:00
{
2008-11-14 22:00:00 +01:00
link_t *l, *next, *start;
edict_t *check;
int count = 0;
// touch linked edicts
if( ap->type == AREA_SOLID )
start = &node->solid_edicts;
2010-04-01 22:00:00 +02:00
else if( ap->type == AREA_TRIGGERS )
start = &node->trigger_edicts;
else start = &node->water_edicts;
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
for( l = start->next; l != start; l = next )
2007-06-21 22:00:00 +02:00
{
2008-11-14 22:00:00 +01:00
next = l->next;
check = EDICT_FROM_AREA( l );
2007-06-21 22:00:00 +02:00
2010-04-01 22:00:00 +02:00
if( check->v.solid == SOLID_NOT && check->v.skin == CONTENTS_NONE )
continue; // deactivated
2009-07-12 22:00:00 +02:00
if( !BoundsIntersect( check->v.absmin, check->v.absmax, ap->mins, ap->maxs ))
2007-08-17 22:00:00 +02:00
continue; // not touching
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
if( ap->count == ap->maxcount )
2007-06-21 22:00:00 +02:00
{
2008-11-14 22:00:00 +01:00
MsgDev( D_WARN, "SV_AreaEdicts: maxcount hit\n" );
2007-06-21 22:00:00 +02:00
return;
}
2008-11-14 22:00:00 +01:00
ap->list[ap->count] = check;
2008-01-17 22:00:00 +01:00
ap->count++;
2007-06-21 22:00:00 +02:00
}
2008-01-17 22:00:00 +01:00
if( node->axis == -1 ) return; // terminal node
2007-06-21 22:00:00 +02:00
// recurse down both sides
2008-11-14 22:00:00 +01:00
if( ap->maxs[node->axis] > node->dist ) SV_AreaEdicts_r( node->children[0], ap );
if( ap->mins[node->axis] < node->dist ) SV_AreaEdicts_r( node->children[1], ap );
2007-06-21 22:00:00 +02:00
}
/*
================
SV_AreaEdicts
================
*/
2008-11-14 22:00:00 +01:00
int SV_AreaEdicts( const vec3_t mins, const vec3_t maxs, edict_t **list, int maxcount, int areatype )
2007-06-21 22:00:00 +02:00
{
2008-01-17 22:00:00 +01:00
area_t ap;
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
ap.mins = mins;
ap.maxs = maxs;
ap.list = list;
ap.count = 0;
ap.maxcount = maxcount;
2008-11-14 22:00:00 +01:00
ap.type = areatype;
2007-06-21 22:00:00 +02:00
2008-11-14 22:00:00 +01:00
SV_AreaEdicts_r( sv_areanodes, &ap );
2007-06-21 22:00:00 +02:00
2008-01-17 22:00:00 +01:00
return ap.count;
2009-10-28 22:00:00 +01:00
}
/*
====================
2009-11-02 22:00:00 +01:00
SV_ClipToLinks
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
Mins and maxs enclose the entire area swept by the move
2009-10-28 22:00:00 +01:00
====================
*/
2009-11-26 22:00:00 +01:00
static void SV_ClipToLinks( areanode_t *node, moveclip_t *clip )
2009-10-28 22:00:00 +01:00
{
2009-11-02 22:00:00 +01:00
link_t *l, *next;
edict_t *touch;
trace_t trace;
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
// touch linked edicts
for( l = node->solid_edicts.next; l != &node->solid_edicts; l = next )
{
next = l->next;
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
touch = EDICT_FROM_AREA( l );
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
if( touch->v.solid == SOLID_NOT )
continue;
if( touch == clip->passedict )
continue;
if( touch->v.solid == SOLID_TRIGGER )
2010-02-10 22:00:00 +01:00
Host_Error( "trigger in clipping list\n" );
2009-10-28 22:00:00 +01:00
2009-11-16 22:00:00 +01:00
if( clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP )
2009-11-02 22:00:00 +01:00
continue;
2009-10-28 22:00:00 +01:00
2009-11-30 22:00:00 +01:00
// don't clip points against points (they can't collide)
2010-04-18 22:00:00 +02:00
if( VectorCompare( touch->v.mins, touch->v.maxs ) && (clip->type != MOVE_MISSILE || !( touch->v.flags & FL_MONSTER )))
2009-11-30 22:00:00 +01:00
continue;
2009-11-23 22:00:00 +01:00
if( clip->type == MOVE_WORLDONLY )
{
// accept only real bsp models with FL_WORLDBRUSH set
if( CM_GetModelType( touch->v.modelindex ) == mod_brush && touch->v.flags & FL_WORLDBRUSH );
else continue;
}
2009-11-02 22:00:00 +01:00
if( !BoundsIntersect( clip->boxmins, clip->boxmaxs, touch->v.absmin, touch->v.absmax ))
2009-10-28 22:00:00 +01:00
continue;
2009-11-02 22:00:00 +01:00
if( clip->passedict && !VectorIsNull( clip->passedict->v.size ) && VectorIsNull( touch->v.size ))
continue; // points never interact
2009-10-28 22:00:00 +01:00
2010-05-24 22:00:00 +02:00
// monsterclip filter
2010-06-01 22:00:00 +02:00
if( CM_GetModelType( touch->v.modelindex ) == mod_brush && ( touch->v.flags & FL_MONSTERCLIP ))
2010-05-24 22:00:00 +02:00
{
2010-06-01 22:00:00 +02:00
if( clip->passedict && clip->passedict->v.flags & FL_MONSTERCLIP );
else continue;
2010-05-24 22:00:00 +02:00
}
2009-12-03 22:00:00 +01:00
// custom user filter
if( !svgame.dllFuncs.pfnShouldCollide( touch, clip->passedict ))
continue;
2010-05-04 22:00:00 +02:00
if( clip->flags & FMOVE_IGNORE_GLASS && CM_GetModelType( touch->v.modelindex ) == mod_brush )
2009-11-23 22:00:00 +01:00
{
vec3_t point;
2010-06-16 22:00:00 +02:00
// we ignore brushes with rendermode != kRenderNormal
2009-11-23 22:00:00 +01:00
switch( touch->v.rendermode )
{
case kRenderTransTexture:
case kRenderTransAlpha:
case kRenderTransAdd:
if( touch->v.renderamt < 200 )
continue;
// check for translucent contents
if( VectorIsNull( touch->v.origin ))
VectorAverage( touch->v.absmin, touch->v.absmax, point );
else VectorCopy( touch->v.origin, point );
2010-05-22 22:00:00 +02:00
if( SV_PointContents( point ) == CONTENTS_TRANSLUCENT )
continue; // grate detected
2009-11-23 22:00:00 +01:00
default: break;
}
}
2009-11-02 22:00:00 +01:00
// might intersect, so do an exact clip
if( clip->trace.fAllSolid ) return;
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
if( clip->passedict )
{
if( touch->v.owner == clip->passedict )
continue; // don't clip against own missiles
if( clip->passedict->v.owner == touch )
continue; // don't clip against owner
}
2009-10-28 22:00:00 +01:00
2010-05-22 22:00:00 +02:00
if( touch->v.flags & FL_MONSTER )
trace = CM_ClipMove( touch, clip->start, clip->mins2, clip->maxs2, clip->end, clip->flags );
else trace = CM_ClipMove( touch, clip->start, clip->mins, clip->maxs, clip->end, clip->flags );
clip->trace = World_CombineTraces( &clip->trace, &trace, touch );
2009-11-02 22:00:00 +01:00
}
// recurse down both sides
if( node->axis == -1 ) return;
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
if( clip->boxmaxs[node->axis] > node->dist )
SV_ClipToLinks( node->children[0], clip );
if( clip->boxmins[node->axis] < node->dist )
SV_ClipToLinks( node->children[1], clip );
}
2009-10-28 22:00:00 +01:00
/*
==================
2009-11-02 22:00:00 +01:00
SV_Move
2009-10-28 22:00:00 +01:00
==================
*/
2009-11-02 22:00:00 +01:00
trace_t SV_Move( const vec3_t start, vec3_t mins, vec3_t maxs, const vec3_t end, int type, edict_t *e )
2009-10-28 22:00:00 +01:00
{
2009-11-02 22:00:00 +01:00
moveclip_t clip;
2009-11-23 22:00:00 +01:00
int i;
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
Mem_Set( &clip, 0, sizeof( moveclip_t ));
2009-10-28 22:00:00 +01:00
clip.start = start;
2009-11-02 22:00:00 +01:00
clip.end = end;
2009-10-28 22:00:00 +01:00
clip.mins = mins;
clip.maxs = maxs;
2009-11-23 22:00:00 +01:00
clip.type = (type & 0xFF);
clip.flags = (type & 0xFF00);
2009-11-02 22:00:00 +01:00
clip.passedict = e;
2010-04-07 22:00:00 +02:00
2009-11-15 22:00:00 +01:00
// clip to world
2010-05-22 22:00:00 +02:00
clip.trace = CM_ClipMove( EDICT_NUM( 0 ), start, mins, maxs, end, 0 );
2009-11-15 22:00:00 +01:00
2009-11-23 22:00:00 +01:00
if( type == MOVE_MISSILE )
{
for( i = 0; i < 3; i++ )
{
clip.mins2[i] = -15;
clip.maxs2[i] = 15;
}
}
else
{
VectorCopy( mins, clip.mins2 );
VectorCopy( maxs, clip.maxs2 );
}
2009-10-28 22:00:00 +01:00
// create the bounding box of the entire move
2009-11-26 22:00:00 +01:00
World_MoveBounds( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs );
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
// clip to entities
SV_ClipToLinks( sv_areanodes, &clip );
2009-10-28 22:00:00 +01:00
return clip.trace;
}
2009-11-02 22:00:00 +01:00
/*
==================
SV_MoveToss
==================
*/
trace_t SV_MoveToss( edict_t *tossent, edict_t *ignore )
{
float gravity;
vec3_t move, end;
vec3_t original_origin;
vec3_t original_velocity;
vec3_t original_angles;
vec3_t original_avelocity;
trace_t trace;
int i;
VectorCopy( tossent->v.origin, original_origin );
VectorCopy( tossent->v.velocity, original_velocity );
VectorCopy( tossent->v.angles, original_angles );
VectorCopy( tossent->v.avelocity, original_avelocity );
2009-11-26 22:00:00 +01:00
gravity = tossent->v.gravity * svgame.movevars.gravity * 0.05f;
2009-11-02 22:00:00 +01:00
for( i = 0; i < 200; i++ )
{
SV_CheckVelocity( tossent );
tossent->v.velocity[2] -= gravity;
VectorMA( tossent->v.angles, 0.05f, tossent->v.avelocity, tossent->v.angles );
VectorScale( tossent->v.velocity, 0.05f, move );
VectorAdd( tossent->v.origin, move, end );
trace = SV_Move( tossent->v.origin, tossent->v.mins, tossent->v.maxs, end, MOVE_NORMAL, tossent );
VectorCopy( trace.vecEndPos, tossent->v.origin );
if( trace.flFraction < 1.0f ) break;
}
VectorCopy( original_origin, tossent->v.origin );
VectorCopy( original_velocity, tossent->v.velocity );
VectorCopy( original_angles, tossent->v.angles );
VectorCopy( original_avelocity, tossent->v.avelocity );
2009-10-28 22:00:00 +01:00
2009-11-02 22:00:00 +01:00
return trace;
}
2009-10-28 22:00:00 +01:00
/*
=============
SV_PointContents
2009-11-02 22:00:00 +01:00
2009-10-28 22:00:00 +01:00
=============
*/
2010-05-22 22:00:00 +02:00
int SV_TruePointContents( const vec3_t p )
2009-10-28 22:00:00 +01:00
{
2010-05-22 22:00:00 +02:00
int i, num, contents;
edict_t *hit, *touch[MAX_EDICTS];
2009-10-28 22:00:00 +01:00
2009-11-23 22:00:00 +01:00
// sanity check
2010-05-22 22:00:00 +02:00
if( !p ) return CONTENTS_NONE;
2009-11-23 22:00:00 +01:00
2009-10-28 22:00:00 +01:00
// get base contents from world
2010-05-22 22:00:00 +02:00
contents = CM_PointContents( p );
2009-10-28 22:00:00 +01:00
2010-05-22 22:00:00 +02:00
if( contents != CONTENTS_EMPTY )
return contents; // have some world contents
// check contents from all the solid entities
2009-10-28 22:00:00 +01:00
num = SV_AreaEdicts( p, p, touch, MAX_EDICTS, AREA_SOLID );
for( i = 0; i < num; i++ )
{
hit = touch[i];
2010-05-22 22:00:00 +02:00
if( hit->v.solid != SOLID_BSP )
continue; // monsters, players
2009-11-16 22:00:00 +01:00
2010-05-22 22:00:00 +02:00
// solid entity found
return CONTENTS_SOLID;
2009-10-28 22:00:00 +01:00
}
2010-04-01 22:00:00 +02:00
2010-05-22 22:00:00 +02:00
// check contents from all the custom entities
2010-04-07 22:00:00 +02:00
num = SV_AreaEdicts( p, p, touch, MAX_EDICTS, AREA_CUSTOM );
2010-04-01 22:00:00 +02:00
for( i = 0; i < num; i++ )
{
hit = touch[i];
if( hit->v.solid != SOLID_NOT || hit->v.skin == CONTENTS_NONE )
continue; // invalid water ?
2010-05-22 22:00:00 +02:00
// custom contents found
return hit->v.skin;
2010-04-01 22:00:00 +02:00
}
2009-10-28 22:00:00 +01:00
return contents;
2009-11-02 22:00:00 +01:00
}
int SV_PointContents( const vec3_t p )
{
2010-05-22 22:00:00 +02:00
int cont = SV_TruePointContents( p );
if( cont <= CONTENTS_CURRENT_0 && cont >= CONTENTS_CURRENT_DOWN )
cont = CONTENTS_WATER;
return cont;
2009-11-10 22:00:00 +01:00
}
/*
============
SV_TestPlayerPosition
============
*/
2009-11-15 22:00:00 +01:00
edict_t *SV_TestPlayerPosition( const vec3_t origin, edict_t *pass, TraceResult *tr )
2009-11-10 22:00:00 +01:00
{
2009-11-15 22:00:00 +01:00
float *mins, *maxs;
trace_t result;
2009-11-10 22:00:00 +01:00
2009-11-15 22:00:00 +01:00
svgame.pmove->usehull = bound( 0, svgame.pmove->usehull, 3 );
mins = svgame.pmove->player_mins[svgame.pmove->usehull];
maxs = svgame.pmove->player_maxs[svgame.pmove->usehull];
2009-11-10 22:00:00 +01:00
2009-11-15 22:00:00 +01:00
result = SV_Move( origin, mins, maxs, origin, MOVE_NORMAL, pass );
2010-05-22 22:00:00 +02:00
if( tr ) *tr = result;
2009-11-10 22:00:00 +01:00
2010-06-16 22:00:00 +02:00
return result.pHit;
2007-09-17 22:00:00 +02:00
}