newlines fixed

git-svn-id: svn://svn.icculus.org/quake3/trunk@6 edf5b092-35ff-0310-97b2-ce42778d08ea

1 files changed, 79 insertions, 79 deletions

diff --git a/q3map/leakfile.c b/q3map/leakfile.c
index 101e32d..683c22a 100755
--- a/q3map/leakfile.c
+++ b/q3map/leakfile.c
@@ -19,82 +19,82 @@ along with Foobar; if not, write to the Free Software
 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  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);

-	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);

-}

-

+
+#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);
+	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);
+}
+