Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
tree: 70951bc71b
Fetching contributors…

Octocat-spinner-32-eaf2f5

Cannot retrieve contributors at this time

file 487 lines (384 sloc) 10.728 kb
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486
/*
===========================================================================

Return to Castle Wolfenstein single player GPL Source Code
Copyright (C) 1999-2010 id Software LLC, a ZeniMax Media company.

This file is part of the Return to Castle Wolfenstein single player GPL Source Code (“RTCW SP Source Code”).

RTCW SP Source Code is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

RTCW SP Source Code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with RTCW SP Source Code. If not, see <http://www.gnu.org/licenses/>.

In addition, the RTCW SP Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the RTCW SP Source Code. If not, please request a copy in writing from id Software at the address below.

If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA.

===========================================================================
*/

#include "cm_local.h"


/*
==================
CM_PointLeafnum_r

==================
*/
int CM_PointLeafnum_r( const vec3_t p, int num ) {
float d;
cNode_t *node;
cplane_t *plane;

while ( num >= 0 )
{
node = cm.nodes + num;
plane = node->plane;

if ( plane->type < 3 ) {
d = p[plane->type] - plane->dist;
} else {
d = DotProduct( plane->normal, p ) - plane->dist;
}
if ( d < 0 ) {
num = node->children[1];
} else {
num = node->children[0];
}
}

c_pointcontents++; // optimize counter

return -1 - num;
}

int CM_PointLeafnum( const vec3_t p ) {
if ( !cm.numNodes ) { // map not loaded
return 0;
}
return CM_PointLeafnum_r( p, 0 );
}


/*
======================================================================

LEAF LISTING

======================================================================
*/


void CM_StoreLeafs( leafList_t *ll, int nodenum ) {
int leafNum;

leafNum = -1 - nodenum;

// store the lastLeaf even if the list is overflowed
if ( cm.leafs[ leafNum ].cluster != -1 ) {
ll->lastLeaf = leafNum;
}

if ( ll->count >= ll->maxcount ) {
ll->overflowed = qtrue;
return;
}
ll->list[ ll->count++ ] = leafNum;
}

void CM_StoreBrushes( leafList_t *ll, int nodenum ) {
int i, k;
int leafnum;
int brushnum;
cLeaf_t *leaf;
cbrush_t *b;

leafnum = -1 - nodenum;

leaf = &cm.leafs[leafnum];

for ( k = 0 ; k < leaf->numLeafBrushes ; k++ ) {
brushnum = cm.leafbrushes[leaf->firstLeafBrush + k];
b = &cm.brushes[brushnum];
if ( b->checkcount == cm.checkcount ) {
continue; // already checked this brush in another leaf
}
b->checkcount = cm.checkcount;
for ( i = 0 ; i < 3 ; i++ ) {
if ( b->bounds[0][i] >= ll->bounds[1][i] || b->bounds[1][i] <= ll->bounds[0][i] ) {
break;
}
}
if ( i != 3 ) {
continue;
}
if ( ll->count >= ll->maxcount ) {
ll->overflowed = qtrue;
return;
}
( (cbrush_t **)ll->list )[ ll->count++ ] = b;
}
#if 0
// store patches?
for ( k = 0 ; k < leaf->numLeafSurfaces ; k++ ) {
patch = cm.surfaces[ cm.leafsurfaces[ leaf->firstleafsurface + k ] ];
if ( !patch ) {
continue;
}
}
#endif
}

/*
=============
CM_BoxLeafnums

Fills in a list of all the leafs touched
=============
*/
void CM_BoxLeafnums_r( leafList_t *ll, int nodenum ) {
cplane_t *plane;
cNode_t *node;
int s;

while ( 1 ) {
if ( nodenum < 0 ) {
ll->storeLeafs( ll, nodenum );
return;
}

node = &cm.nodes[nodenum];
plane = node->plane;
s = BoxOnPlaneSide( ll->bounds[0], ll->bounds[1], plane );
if ( s == 1 ) {
nodenum = node->children[0];
} else if ( s == 2 ) {
nodenum = node->children[1];
} else {
// go down both
CM_BoxLeafnums_r( ll, node->children[0] );
nodenum = node->children[1];
}

}
}

/*
==================
CM_BoxLeafnums
==================
*/
int CM_BoxLeafnums( const vec3_t mins, const vec3_t maxs, int *list, int listsize, int *lastLeaf ) {
leafList_t ll;

cm.checkcount++;

VectorCopy( mins, ll.bounds[0] );
VectorCopy( maxs, ll.bounds[1] );
ll.count = 0;
ll.maxcount = listsize;
ll.list = list;
ll.storeLeafs = CM_StoreLeafs;
ll.lastLeaf = 0;
ll.overflowed = qfalse;

CM_BoxLeafnums_r( &ll, 0 );

*lastLeaf = ll.lastLeaf;
return ll.count;
}

/*
==================
CM_BoxBrushes
==================
*/
int CM_BoxBrushes( const vec3_t mins, const vec3_t maxs, cbrush_t **list, int listsize ) {
leafList_t ll;

cm.checkcount++;

VectorCopy( mins, ll.bounds[0] );
VectorCopy( maxs, ll.bounds[1] );
ll.count = 0;
ll.maxcount = listsize;
ll.list = (void *)list;
ll.storeLeafs = CM_StoreBrushes;
ll.lastLeaf = 0;
ll.overflowed = qfalse;

CM_BoxLeafnums_r( &ll, 0 );

return ll.count;
}


//====================================================================


/*
==================
CM_PointContents

==================
*/
int CM_PointContents( const vec3_t p, clipHandle_t model ) {
int leafnum;
int i, k;
int brushnum;
cLeaf_t *leaf;
cbrush_t *b;
int contents;
float d;
cmodel_t *clipm;

if ( !cm.numNodes ) { // map not loaded
return 0;
}

if ( model ) {
clipm = CM_ClipHandleToModel( model );
leaf = &clipm->leaf;
} else {
leafnum = CM_PointLeafnum_r( p, 0 );
leaf = &cm.leafs[leafnum];
}

contents = 0;
for ( k = 0 ; k < leaf->numLeafBrushes ; k++ ) {
brushnum = cm.leafbrushes[leaf->firstLeafBrush + k];
b = &cm.brushes[brushnum];

// see if the point is in the brush
for ( i = 0 ; i < b->numsides ; i++ ) {
d = DotProduct( p, b->sides[i].plane->normal );
// FIXME test for Cash
// if ( d >= b->sides[i].plane->dist ) {
if ( d > b->sides[i].plane->dist ) {
break;
}
}

if ( i == b->numsides ) {
contents |= b->contents;
}
}

return contents;
}

/*
==================
CM_TransformedPointContents

Handles offseting and rotation of the end points for moving and
rotating entities
==================
*/
int CM_TransformedPointContents( const vec3_t p, clipHandle_t model, const vec3_t origin, const vec3_t angles ) {
vec3_t p_l;
vec3_t temp;
vec3_t forward, right, up;

// subtract origin offset
VectorSubtract( p, origin, p_l );

// rotate start and end into the models frame of reference
if ( model != BOX_MODEL_HANDLE &&
( angles[0] || angles[1] || angles[2] ) ) {
AngleVectors( angles, forward, right, up );

VectorCopy( p_l, temp );
p_l[0] = DotProduct( temp, forward );
p_l[1] = -DotProduct( temp, right );
p_l[2] = DotProduct( temp, up );
}

return CM_PointContents( p_l, model );
}



/*
===============================================================================

PVS

===============================================================================
*/

byte *CM_ClusterPVS( int cluster ) {
if ( cluster < 0 || cluster >= cm.numClusters || !cm.vised ) {
return cm.visibility;
}

return cm.visibility + cluster * cm.clusterBytes;
}



/*
===============================================================================

AREAPORTALS

===============================================================================
*/

void CM_FloodArea_r( int areaNum, int floodnum ) {
int i;
cArea_t *area;
int *con;

area = &cm.areas[ areaNum ];

if ( area->floodvalid == cm.floodvalid ) {
if ( area->floodnum == floodnum ) {
return;
}
Com_Error( ERR_DROP, "FloodArea_r: reflooded" );
}

area->floodnum = floodnum;
area->floodvalid = cm.floodvalid;
con = cm.areaPortals + areaNum * cm.numAreas;
for ( i = 0 ; i < cm.numAreas ; i++ ) {
if ( con[i] > 0 ) {
CM_FloodArea_r( i, floodnum );
}
}
}

/*
====================
CM_FloodAreaConnections

====================
*/
void CM_FloodAreaConnections( void ) {
int i;
cArea_t *area;
int floodnum;

// all current floods are now invalid
cm.floodvalid++;
floodnum = 0;

area = cm.areas; // Ridah, optimization
for ( i = 0 ; i < cm.numAreas ; i++, area++ ) {
if ( area->floodvalid == cm.floodvalid ) {
continue; // already flooded into
}
floodnum++;
CM_FloodArea_r( i, floodnum );
}

}

/*
====================
CM_AdjustAreaPortalState

====================
*/
void CM_AdjustAreaPortalState( int area1, int area2, qboolean open ) {
if ( area1 < 0 || area2 < 0 ) {
return;
}

if ( area1 >= cm.numAreas || area2 >= cm.numAreas ) {
Com_Error( ERR_DROP, "CM_ChangeAreaPortalState: bad area number" );
}

if ( open ) {
cm.areaPortals[ area1 * cm.numAreas + area2 ]++;
cm.areaPortals[ area2 * cm.numAreas + area1 ]++;
} else if ( cm.areaPortals[ area2 * cm.numAreas + area1 ] ) { // Ridah, fixes loadgame issue
cm.areaPortals[ area1 * cm.numAreas + area2 ]--;
cm.areaPortals[ area2 * cm.numAreas + area1 ]--;
if ( cm.areaPortals[ area2 * cm.numAreas + area1 ] < 0 ) {
Com_Error( ERR_DROP, "CM_AdjustAreaPortalState: negative reference count" );
}
}

CM_FloodAreaConnections();
}

/*
====================
CM_AreasConnected

====================
*/
qboolean CM_AreasConnected( int area1, int area2 ) {
#ifndef BSPC
if ( cm_noAreas->integer ) {
return qtrue;
}
#endif

if ( area1 < 0 || area2 < 0 ) {
return qfalse;
}

if ( area1 >= cm.numAreas || area2 >= cm.numAreas ) {
Com_Error( ERR_DROP, "area >= cm.numAreas" );
}

if ( cm.areas[area1].floodnum == cm.areas[area2].floodnum ) {
return qtrue;
}
return qfalse;
}


/*
=================
CM_WriteAreaBits

Writes a bit vector of all the areas
that are in the same flood as the area parameter
Returns the number of bytes needed to hold all the bits.

The bits are OR'd in, so you can CM_WriteAreaBits from multiple
viewpoints and get the union of all visible areas.

This is used to cull non-visible entities from snapshots
=================
*/
int CM_WriteAreaBits( byte *buffer, int area ) {
int i;
int floodnum;
int bytes;

bytes = ( cm.numAreas + 7 ) >> 3;

#ifndef BSPC
if ( cm_noAreas->integer || area == -1 )
#else
if ( area == -1 )
#endif
{ // for debugging, send everything
Com_Memset( buffer, 255, bytes );
} else
{
floodnum = cm.areas[area].floodnum;
for ( i = 0 ; i < cm.numAreas ; i++ )
{
if ( cm.areas[i].floodnum == floodnum || area == -1 ) {
buffer[i >> 3] |= 1 << ( i & 7 );
}
}
}

return bytes;
}

Something went wrong with that request. Please try again.