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

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

This file is part of the Return to Castle Wolfenstein multiplayer GPL Source Code (RTCW MP Source Code).  

RTCW MP 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 MP 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 MP Source Code.  If not, see <http://www.gnu.org/licenses/>.

In addition, the RTCW MP 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 MP 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 "qbsp.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 ) {
	vec3_t mid;
	FILE    *linefile;
	char filename[1024];
	node_t  *node;
	int count;

	if ( !tree->outside_node.occupied ) {
		return;
	}

	qprintf( "--- LeakFile ---\n" );

	//
	// write the points to the file
	//
	sprintf( filename, "%s.lin", source );
	qprintf( "%s\n", filename );
	linefile = fopen( filename, "w" );
	if ( !linefile ) {
		Error( "Couldn't open %s\n", filename );
	}

	count = 0;
	node = &tree->outside_node;
	while ( node->occupied > 1 )
	{
		int next;
		portal_t    *p, *nextportal;
		node_t      *nextnode;
		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;
		WindingCenter( nextportal->winding, mid );
		fprintf( linefile, "%f %f %f\n", mid[0], mid[1], mid[2] );
		count++;
	}
	// add the occupant center
	GetVectorForKey( node->occupant, "origin", mid );

	fprintf( linefile, "%f %f %f\n", mid[0], mid[1], mid[2] );
	qprintf( "%5i point linefile\n", count + 1 );

	fclose( linefile );
}

