1 /* -------------------------------------------------------------------------------
3 Copyright (C) 1999-2007 id Software, Inc. and contributors.
4 For a list of contributors, see the accompanying CONTRIBUTORS file.
6 This file is part of GtkRadiant.
8 GtkRadiant is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 GtkRadiant is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GtkRadiant; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 ----------------------------------------------------------------------------------
24 This code has been altered significantly from its original form, to support
25 several games based on the Quake III Arena engine, in the form of "Q3Map2."
27 ------------------------------------------------------------------------------- */
41 /* ydnar: to fix broken portal windings */
42 extern qboolean FixWinding( winding_t *w );
55 portal_t *AllocPortal( void ){
58 if ( numthreads == 1 ) {
61 if ( c_active_portals > c_peak_portals ) {
62 c_peak_portals = c_active_portals;
65 p = safe_malloc( sizeof( portal_t ) );
66 memset( p, 0, sizeof( portal_t ) );
71 void FreePortal( portal_t *p ){
73 FreeWinding( p->winding );
75 if ( numthreads == 1 ) {
85 returns true if the portal has non-opaque leafs on both sides
88 qboolean PortalPassable( portal_t *p ){
89 /* is this to global outside leaf? */
94 /* this should never happen */
95 if ( p->nodes[ 0 ]->planenum != PLANENUM_LEAF ||
96 p->nodes[ 1 ]->planenum != PLANENUM_LEAF ) {
97 Error( "Portal_EntityFlood: not a leaf" );
100 /* ydnar: added antiportal to supress portal generation for visibility blocking */
101 if ( p->compileFlags & C_ANTIPORTAL ) {
105 /* both leaves on either side of the portal must be passable */
106 if ( p->nodes[ 0 ]->opaque == qfalse && p->nodes[ 1 ]->opaque == qfalse ) {
110 /* otherwise this isn't a passable portal */
118 int c_badportals; /* ydnar */
125 void AddPortalToNodes( portal_t *p, node_t *front, node_t *back ){
126 if ( p->nodes[0] || p->nodes[1] ) {
127 Error( "AddPortalToNode: allready included" );
131 p->next[0] = front->portals;
135 p->next[1] = back->portals;
145 void RemovePortalFromNode( portal_t *portal, node_t *l ){
148 // remove reference to the current portal
154 Error( "RemovePortalFromNode: portal not in leaf" );
161 if ( t->nodes[0] == l ) {
164 else if ( t->nodes[1] == l ) {
168 Error( "RemovePortalFromNode: portal not bounding leaf" );
172 if ( portal->nodes[0] == l ) {
173 *pp = portal->next[0];
174 portal->nodes[0] = NULL;
176 else if ( portal->nodes[1] == l ) {
177 *pp = portal->next[1];
178 portal->nodes[1] = NULL;
182 //============================================================================
184 void PrintPortal( portal_t *p ){
189 for ( i = 0 ; i < w->numpoints ; i++ )
190 Sys_Printf( "(%5.0f,%5.0f,%5.0f)\n",w->p[i][0]
191 , w->p[i][1], w->p[i][2] );
198 The created portals will face the global outside_node
202 void MakeHeadnodePortals( tree_t *tree ){
205 portal_t *p, *portals[6];
206 plane_t bplanes[6], *pl;
209 node = tree->headnode;
211 // pad with some space so there will never be null volume leafs
212 for ( i = 0 ; i < 3 ; i++ )
214 bounds[0][i] = tree->mins[i] - SIDESPACE;
215 bounds[1][i] = tree->maxs[i] + SIDESPACE;
216 if ( bounds[0][i] >= bounds[1][i] ) {
217 Error( "Backwards tree volume" );
221 tree->outside_node.planenum = PLANENUM_LEAF;
222 tree->outside_node.brushlist = NULL;
223 tree->outside_node.portals = NULL;
224 tree->outside_node.opaque = qfalse;
226 for ( i = 0 ; i < 3 ; i++ )
227 for ( j = 0 ; j < 2 ; j++ )
235 memset( pl, 0, sizeof( *pl ) );
238 pl->dist = -bounds[j][i];
243 pl->dist = bounds[j][i];
246 p->winding = BaseWindingForPlane( pl->normal, pl->dist );
247 AddPortalToNodes( p, node, &tree->outside_node );
250 // clip the basewindings by all the other planes
251 for ( i = 0 ; i < 6 ; i++ )
253 for ( j = 0 ; j < 6 ; j++ )
258 ChopWindingInPlace( &portals[i]->winding, bplanes[j].normal, bplanes[j].dist, ON_EPSILON );
263 //===================================================
271 #define BASE_WINDING_EPSILON 0.001
272 #define SPLIT_WINDING_EPSILON 0.001
274 winding_t *BaseWindingForNode( node_t *node ){
281 w = BaseWindingForPlane( mapplanes[node->planenum].normal
282 , mapplanes[node->planenum].dist );
284 // clip by all the parents
285 for ( n = node->parent ; n && w ; )
287 plane = &mapplanes[n->planenum];
289 if ( n->children[0] == node ) { // take front
290 ChopWindingInPlace( &w, plane->normal, plane->dist, BASE_WINDING_EPSILON );
294 VectorSubtract( vec3_origin, plane->normal, normal );
296 ChopWindingInPlace( &w, normal, dist, BASE_WINDING_EPSILON );
305 //============================================================
311 create the new portal by taking the full plane winding for the cutting plane
312 and clipping it by all of parents of this node
315 void MakeNodePortal( node_t *node ){
316 portal_t *new_portal, *p;
322 w = BaseWindingForNode( node );
324 // clip the portal by all the other portals in the node
325 for ( p = node->portals ; p && w; p = p->next[side] )
327 if ( p->nodes[0] == node ) {
329 VectorCopy( p->plane.normal, normal );
330 dist = p->plane.dist;
332 else if ( p->nodes[1] == node ) {
334 VectorSubtract( vec3_origin, p->plane.normal, normal );
335 dist = -p->plane.dist;
338 Error( "CutNodePortals_r: mislinked portal" );
341 ChopWindingInPlace( &w, normal, dist, CLIP_EPSILON );
349 /* ydnar: adding this here to fix degenerate windings */
351 if ( FixWinding( w ) == qfalse ) {
358 if ( WindingIsTiny( w ) ) {
364 new_portal = AllocPortal();
365 new_portal->plane = mapplanes[node->planenum];
366 new_portal->onnode = node;
367 new_portal->winding = w;
368 new_portal->compileFlags = node->compileFlags;
369 AddPortalToNodes( new_portal, node->children[0], node->children[1] );
377 Move or split the portals that bound node so that the node's
378 children have portals instead of node.
381 void SplitNodePortals( node_t *node ){
382 portal_t *p, *next_portal, *new_portal;
383 node_t *f, *b, *other_node;
386 winding_t *frontwinding, *backwinding;
388 plane = &mapplanes[node->planenum];
389 f = node->children[0];
390 b = node->children[1];
392 for ( p = node->portals ; p ; p = next_portal )
394 if ( p->nodes[0] == node ) {
397 else if ( p->nodes[1] == node ) {
401 Error( "SplitNodePortals: mislinked portal" );
403 next_portal = p->next[side];
405 other_node = p->nodes[!side];
406 RemovePortalFromNode( p, p->nodes[0] );
407 RemovePortalFromNode( p, p->nodes[1] );
410 // cut the portal into two portals, one on each side of the cut plane
412 /* not strict, we want to always keep one of them even if coplanar */
413 ClipWindingEpsilon( p->winding, plane->normal, plane->dist,
414 SPLIT_WINDING_EPSILON, &frontwinding, &backwinding );
416 if ( frontwinding && WindingIsTiny( frontwinding ) ) {
417 if ( !f->tinyportals ) {
418 VectorCopy( frontwinding->p[0], f->referencepoint );
421 if ( !other_node->tinyportals ) {
422 VectorCopy( frontwinding->p[0], other_node->referencepoint );
424 other_node->tinyportals++;
426 FreeWinding( frontwinding );
431 if ( backwinding && WindingIsTiny( backwinding ) ) {
432 if ( !b->tinyportals ) {
433 VectorCopy( backwinding->p[0], b->referencepoint );
436 if ( !other_node->tinyportals ) {
437 VectorCopy( backwinding->p[0], other_node->referencepoint );
439 other_node->tinyportals++;
441 FreeWinding( backwinding );
446 if ( !frontwinding && !backwinding ) { // tiny windings on both sides
450 if ( !frontwinding ) {
451 FreeWinding( backwinding );
453 AddPortalToNodes( p, b, other_node );
456 AddPortalToNodes( p, other_node, b );
460 if ( !backwinding ) {
461 FreeWinding( frontwinding );
463 AddPortalToNodes( p, f, other_node );
466 AddPortalToNodes( p, other_node, f );
471 // the winding is split
472 new_portal = AllocPortal();
474 new_portal->winding = backwinding;
475 FreeWinding( p->winding );
476 p->winding = frontwinding;
479 AddPortalToNodes( p, f, other_node );
480 AddPortalToNodes( new_portal, b, other_node );
484 AddPortalToNodes( p, other_node, f );
485 AddPortalToNodes( new_portal, other_node, b );
489 node->portals = NULL;
498 void CalcNodeBounds( node_t *node ){
503 // calc mins/maxs for both leafs and nodes
504 ClearBounds( node->mins, node->maxs );
505 for ( p = node->portals ; p ; p = p->next[s] )
507 s = ( p->nodes[1] == node );
508 for ( i = 0 ; i < p->winding->numpoints ; i++ )
509 AddPointToBounds( p->winding->p[i], node->mins, node->maxs );
518 void MakeTreePortals_r( node_t *node ){
521 CalcNodeBounds( node );
522 if ( node->mins[0] >= node->maxs[0] ) {
523 Sys_FPrintf( SYS_WRN, "WARNING: node without a volume\n" );
524 Sys_Printf( "node has %d tiny portals\n", node->tinyportals );
525 Sys_Printf( "node reference point %1.2f %1.2f %1.2f\n", node->referencepoint[0],
526 node->referencepoint[1],
527 node->referencepoint[2] );
530 for ( i = 0 ; i < 3 ; i++ )
532 if ( node->mins[i] < MIN_WORLD_COORD || node->maxs[i] > MAX_WORLD_COORD ) {
533 if ( node->portals && node->portals->winding ) {
534 xml_Winding( "WARNING: Node With Unbounded Volume", node->portals->winding->p, node->portals->winding->numpoints, qfalse );
540 if ( node->planenum == PLANENUM_LEAF ) {
544 MakeNodePortal( node );
545 SplitNodePortals( node );
547 MakeTreePortals_r( node->children[0] );
548 MakeTreePortals_r( node->children[1] );
556 void MakeTreePortals( tree_t *tree ){
557 Sys_FPrintf( SYS_VRB, "--- MakeTreePortals ---\n" );
558 MakeHeadnodePortals( tree );
559 MakeTreePortals_r( tree->headnode );
560 Sys_FPrintf( SYS_VRB, "%9d tiny portals\n", c_tinyportals );
561 Sys_FPrintf( SYS_VRB, "%9d bad portals\n", c_badportals ); /* ydnar */
565 =========================================================
569 =========================================================
580 void FloodPortals_r( node_t *node, int dist, qboolean skybox ){
586 node->skybox = skybox;
589 if ( node->opaque ) {
593 if ( node->occupied ) {
594 if ( node->occupied > dist ) {
595 /* reduce distance! */
596 /* for better leak line */
597 /* note: node->occupied will also be true for all further nodes, then */
598 node->occupied = dist;
599 for ( p = node->portals; p; p = p->next[ s ] )
601 s = ( p->nodes[ 1 ] == node );
602 FloodPortals_r( p->nodes[ !s ], dist + 1, skybox );
609 node->occupied = dist;
611 for ( p = node->portals; p; p = p->next[ s ] )
613 s = ( p->nodes[ 1 ] == node );
614 FloodPortals_r( p->nodes[ !s ], dist + 1, skybox );
626 qboolean PlaceOccupant( node_t *headnode, vec3_t origin, entity_t *occupant, qboolean skybox ){
632 // find the leaf to start in
634 while ( node->planenum != PLANENUM_LEAF )
636 plane = &mapplanes[ node->planenum ];
637 d = DotProduct( origin, plane->normal ) - plane->dist;
639 node = node->children[ 0 ];
642 node = node->children[ 1 ];
646 if ( node->opaque ) {
649 node->occupant = occupant;
650 node->skybox = skybox;
652 FloodPortals_r( node, 1, skybox );
661 Marks all nodes that can be reached by entites
665 int FloodEntities( tree_t *tree ){
667 vec3_t origin, offset, scale, angles;
668 qboolean r, inside, skybox, found;
670 entity_t *e, *tripped;
675 headnode = tree->headnode;
676 Sys_FPrintf( SYS_VRB,"--- FloodEntities ---\n" );
678 tree->outside_node.occupied = 0;
682 for ( i = 1; i < numEntities; i++ )
688 found = GetVectorForKey( e, "origin", origin );
690 /* as a special case, allow origin-less entities */
695 /* also allow bmodel entities outside, as they could be on a moving path that will go into the map */
696 if ( e->brushes != NULL || e->patches != NULL ) {
700 /* handle skybox entities */
701 value = ValueForKey( e, "classname" );
702 if ( !Q_stricmp( value, "_skybox" ) ) {
704 skyboxPresent = qtrue;
707 VectorScale( origin, -1.0f, offset );
710 VectorSet( scale, 64.0f, 64.0f, 64.0f );
711 value = ValueForKey( e, "_scale" );
712 if ( value[ 0 ] != '\0' ) {
713 s = sscanf( value, "%f %f %f", &scale[ 0 ], &scale[ 1 ], &scale[ 2 ] );
715 scale[ 1 ] = scale[ 0 ];
716 scale[ 2 ] = scale[ 0 ];
720 /* get "angle" (yaw) or "angles" (pitch yaw roll) */
721 VectorClear( angles );
722 angles[ 2 ] = FloatForKey( e, "angle" );
723 value = ValueForKey( e, "angles" );
724 if ( value[ 0 ] != '\0' ) {
725 sscanf( value, "%f %f %f", &angles[ 1 ], &angles[ 2 ], &angles[ 0 ] );
728 /* set transform matrix (thanks spog) */
729 m4x4_identity( skyboxTransform );
730 m4x4_pivoted_transform_by_vec3( skyboxTransform, offset, angles, eXYZ, scale, origin );
736 /* nudge off floor */
741 //% origin[ 2 ] += 4096;
744 r = PlaceOccupant( headnode, origin, e, skybox );
749 Sys_Printf( "Entity %i, Brush %i: Entity in solid\n", e->mapEntityNum, 0 );
751 else if ( tree->outside_node.occupied ) {
752 if ( !tripped || tree->outside_node.occupied < tripcount ) {
754 tripcount = tree->outside_node.occupied;
760 xml_Select( "Entity leaked", e->mapEntityNum, 0, qfalse );
763 Sys_FPrintf( SYS_VRB, "%9d flooded leafs\n", c_floodedleafs );
766 Sys_FPrintf( SYS_VRB, "no entities in open -- no filling\n" );
767 return FLOODENTITIES_EMPTY;
769 if ( tree->outside_node.occupied ) {
770 Sys_FPrintf( SYS_VRB, "entity reached from outside -- leak detected\n" );
771 return FLOODENTITIES_LEAKED;
774 return FLOODENTITIES_GOOD;
778 =========================================================
782 =========================================================
791 floods through leaf portals to tag leafs with an area
794 void FloodAreas_r( node_t *node ){
800 if ( node->areaportal ) {
801 if ( node->area == -1 ) {
802 node->area = c_areas;
805 /* this node is part of an area portal brush */
806 b = node->brushlist->original;
808 /* if the current area has already touched this portal, we are done */
809 if ( b->portalareas[ 0 ] == c_areas || b->portalareas[ 1 ] == c_areas ) {
813 // note the current area as bounding the portal
814 if ( b->portalareas[ 1 ] != -1 ) {
815 Sys_FPrintf( SYS_WRN, "WARNING: areaportal brush %i touches > 2 areas\n", b->brushNum );
818 if ( b->portalareas[ 0 ] != -1 ) {
819 b->portalareas[ 1 ] = c_areas;
822 b->portalareas[ 0 ] = c_areas;
828 if ( node->area != -1 ) {
831 if ( node->cluster == -1 ) {
835 node->area = c_areas;
837 /* ydnar: skybox nodes set the skybox area */
838 if ( node->skybox ) {
839 skyboxArea = c_areas;
842 for ( p = node->portals; p; p = p->next[ s ] )
844 s = ( p->nodes[1] == node );
846 /* ydnar: allow areaportal portals to block area flow */
847 if ( p->compileFlags & C_AREAPORTAL ) {
851 if ( !PortalPassable( p ) ) {
855 FloodAreas_r( p->nodes[ !s ] );
863 Just decend the tree, and for each node that hasn't had an
864 area set, flood fill out from there
867 void FindAreas_r( node_t *node ){
868 if ( node->planenum != PLANENUM_LEAF ) {
869 FindAreas_r( node->children[ 0 ] );
870 FindAreas_r( node->children[ 1 ] );
874 if ( node->opaque || node->areaportal || node->area != -1 ) {
878 FloodAreas_r( node );
887 void CheckAreas_r( node_t *node ){
890 if ( node->planenum != PLANENUM_LEAF ) {
891 CheckAreas_r( node->children[0] );
892 CheckAreas_r( node->children[1] );
896 if ( node->opaque ) {
900 if ( node->cluster != -1 ) {
901 if ( node->area == -1 ) {
902 Sys_FPrintf( SYS_WRN, "WARNING: cluster %d has area set to -1\n", node->cluster );
905 if ( node->areaportal ) {
906 b = node->brushlist->original;
908 // check if the areaportal touches two areas
909 if ( b->portalareas[0] == -1 || b->portalareas[1] == -1 ) {
910 Sys_FPrintf( SYS_WRN, "WARNING: areaportal brush %i doesn't touch two areas\n", b->brushNum );
918 FloodSkyboxArea_r() - ydnar
919 sets all nodes with the skybox area to skybox
922 void FloodSkyboxArea_r( node_t *node ){
923 if ( skyboxArea < 0 ) {
927 if ( node->planenum != PLANENUM_LEAF ) {
928 FloodSkyboxArea_r( node->children[ 0 ] );
929 FloodSkyboxArea_r( node->children[ 1 ] );
933 if ( node->opaque || node->area != skyboxArea ) {
937 node->skybox = qtrue;
944 mark each leaf with an area, bounded by C_AREAPORTAL
947 void FloodAreas( tree_t *tree ){
948 Sys_FPrintf( SYS_VRB,"--- FloodAreas ---\n" );
949 FindAreas_r( tree->headnode );
951 /* ydnar: flood all skybox nodes */
952 FloodSkyboxArea_r( tree->headnode );
954 /* check for areaportal brushes that don't touch two areas */
955 /* ydnar: fix this rather than just silence the warnings */
956 //% CheckAreas_r( tree->headnode );
958 Sys_FPrintf( SYS_VRB, "%9d areas\n", c_areas );
963 //======================================================
969 void FillOutside_r( node_t *node ){
970 if ( node->planenum != PLANENUM_LEAF ) {
971 FillOutside_r( node->children[0] );
972 FillOutside_r( node->children[1] );
976 // anything not reachable by an entity
977 // can be filled away
978 if ( !node->occupied ) {
979 if ( !node->opaque ) {
981 node->opaque = qtrue;
997 Fill all nodes that can't be reached by entities
1000 void FillOutside( node_t *headnode ){
1004 Sys_FPrintf( SYS_VRB,"--- FillOutside ---\n" );
1005 FillOutside_r( headnode );
1006 Sys_FPrintf( SYS_VRB,"%9d solid leafs\n", c_solid );
1007 Sys_Printf( "%9d leafs filled\n", c_outside );
1008 Sys_FPrintf( SYS_VRB, "%9d inside leafs\n", c_inside );
1012 //==============================================================