mirror of
https://github.com/id-Software/DOOM-3-BFG.git
synced 2025-02-28 22:51:25 +00:00
113 lines
3.2 KiB
C++
113 lines
3.2 KiB
C++
/*
|
|
===========================================================================
|
|
|
|
Doom 3 GPL Source Code
|
|
Copyright (C) 1999-2011 id Software LLC, a ZeniMax Media company.
|
|
|
|
This file is part of the Doom 3 GPL Source Code (?Doom 3 Source Code?).
|
|
|
|
Doom 3 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.
|
|
|
|
Doom 3 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 Doom 3 Source Code. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
In addition, the Doom 3 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 Doom 3 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 "precompiled.h"
|
|
#pragma hdrstop
|
|
|
|
#include "dmap.h"
|
|
|
|
/*
|
|
==============================================================================
|
|
|
|
LEAF FILE GENERATION
|
|
|
|
Save out name.line for qe3 to read
|
|
==============================================================================
|
|
*/
|
|
|
|
|
|
/*
|
|
=============
|
|
LeakFile
|
|
|
|
Finds the shortest possible chain of portals
|
|
that leads from the outside leaf to a specifically
|
|
occupied leaf
|
|
=============
|
|
*/
|
|
void LeakFile( tree_t* tree )
|
|
{
|
|
idVec3 mid;
|
|
FILE* linefile;
|
|
idStr filename;
|
|
idStr ospath;
|
|
node_t* node;
|
|
int count;
|
|
|
|
if( !tree->outside_node.occupied )
|
|
return;
|
|
|
|
common->Printf( "--- LeakFile ---\n" );
|
|
|
|
//
|
|
// write the points to the file
|
|
//
|
|
sprintf( filename, "%s.lin", dmapGlobals.mapFileBase );
|
|
ospath = fileSystem->RelativePathToOSPath( filename );
|
|
linefile = fopen( ospath, "w" );
|
|
if( !linefile )
|
|
{
|
|
common->Error( "Couldn't open %s\n", filename.c_str() );
|
|
}
|
|
|
|
count = 0;
|
|
node = &tree->outside_node;
|
|
while( node->occupied > 1 )
|
|
{
|
|
int next;
|
|
uPortal_t* p, *nextportal = NULL;
|
|
node_t* nextnode = NULL;
|
|
int s;
|
|
|
|
// find the best portal exit
|
|
next = node->occupied;
|
|
for( p = node->portals ; p ; p = p->next[!s] )
|
|
{
|
|
s = ( p->nodes[0] == node );
|
|
if( p->nodes[s]->occupied
|
|
&& p->nodes[s]->occupied < next )
|
|
{
|
|
nextportal = p;
|
|
nextnode = p->nodes[s];
|
|
next = nextnode->occupied;
|
|
}
|
|
}
|
|
node = nextnode;
|
|
mid = nextportal->winding->GetCenter();
|
|
fprintf( linefile, "%f %f %f\n", mid[0], mid[1], mid[2] );
|
|
count++;
|
|
}
|
|
// add the occupant center
|
|
node->occupant->mapEntity->epairs.GetVector( "origin", "", mid );
|
|
|
|
fprintf( linefile, "%f %f %f\n", mid[0], mid[1], mid[2] );
|
|
common->Printf( "%5i point linefile\n", count + 1 );
|
|
|
|
fclose( linefile );
|
|
}
|
|
|