-/*\r
-Copyright (C) 1999-2007 id Software, Inc. and contributors.\r
-For a list of contributors, see the accompanying CONTRIBUTORS file.\r
-\r
-This file is part of GtkRadiant.\r
-\r
-GtkRadiant is free software; you can redistribute it and/or modify\r
-it under the terms of the GNU General Public License as published by\r
-the Free Software Foundation; either version 2 of the License, or\r
-(at your option) any later version.\r
-\r
-GtkRadiant is distributed in the hope that it will be useful,\r
-but WITHOUT ANY WARRANTY; without even the implied warranty of\r
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
-GNU General Public License for more details.\r
-\r
-You should have received a copy of the GNU General Public License\r
-along with GtkRadiant; if not, write to the Free Software\r
-Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
-*/\r
-\r
-#include "qbsp.h"\r
-\r
-/*\r
-==============================================================================\r
-\r
-LEAF FILE GENERATION\r
-\r
-Save out name.line for qe3 to read\r
-==============================================================================\r
-*/\r
-\r
-\r
-/*\r
-=============\r
-LeakFile\r
-\r
-Finds the shortest possible chain of portals\r
-that leads from the outside leaf to a specifically\r
-occupied leaf\r
-=============\r
-*/\r
-\r
-/*\r
-void LeakFile (tree_t *tree)\r
-{\r
- vec3_t mid;\r
- FILE *linefile;\r
- char filename[1024];\r
- node_t *node;\r
- int count;\r
-\r
- if (!tree->outside_node.occupied)\r
- return;\r
-\r
- Sys_Printf ("--- LeakFile ---\n");\r
-\r
- //\r
- // write the points to the file\r
- //\r
- sprintf (filename, "%s.lin", source);\r
- linefile = fopen (filename, "w");\r
- if (!linefile)\r
- Error ("Couldn't open %s\n", filename);\r
-\r
- count = 0;\r
- node = &tree->outside_node;\r
- while (node->occupied > 1)\r
- {\r
- int next;\r
- portal_t *p, *nextportal;\r
- node_t *nextnode;\r
- int s;\r
-\r
- // find the best portal exit\r
- next = node->occupied;\r
- for (p=node->portals ; p ; p = p->next[!s])\r
- {\r
- s = (p->nodes[0] == node);\r
- if (p->nodes[s]->occupied\r
- && p->nodes[s]->occupied < next)\r
- {\r
- nextportal = p;\r
- nextnode = p->nodes[s];\r
- next = nextnode->occupied;\r
- }\r
- }\r
- node = nextnode;\r
- WindingCenter (nextportal->winding, mid);\r
- fprintf (linefile, "%f %f %f\n", mid[0], mid[1], mid[2]);\r
- count++;\r
- }\r
- // add the occupant center\r
- GetVectorForKey (node->occupant, "origin", mid);\r
-\r
- fprintf (linefile, "%f %f %f\n", mid[0], mid[1], mid[2]);\r
- Sys_Printf ("%5i point linefile\n", count+1);\r
-\r
- fclose (linefile);\r
-}\r
-*/\r
-\r
-/*\r
-=============\r
-LeakFile\r
-\r
-Finds the shortest possible chain of portals\r
-that leads from the outside leaf to a specifically\r
-occupied leaf\r
-\r
-TTimo: builds a polyline xml node\r
-=============\r
-*/\r
-xmlNodePtr LeakFile (tree_t *tree)\r
-{\r
- vec3_t mid;\r
- FILE *linefile;\r
- char filename[1024];\r
- node_t *node;\r
- int count;\r
- xmlNodePtr xml_node, point;\r
-\r
- if (!tree->outside_node.occupied)\r
- return NULL;\r
-\r
- Sys_FPrintf (SYS_VRB,"--- LeakFile ---\n");\r
-\r
- //\r
- // write the points to the file\r
- //\r
- sprintf (filename, "%s.lin", source);\r
- linefile = fopen (filename, "w");\r
- if (!linefile)\r
- Error ("Couldn't open %s\n", filename);\r
-\r
- xml_node = xmlNewNode (NULL, "polyline");\r
-\r
- count = 0;\r
- node = &tree->outside_node;\r
- while (node->occupied > 1)\r
- {\r
- int next;\r
- portal_t *p, *nextportal;\r
- node_t *nextnode;\r
- int s;\r
-\r
- // find the best portal exit\r
- next = node->occupied;\r
- for (p=node->portals ; p ; p = p->next[!s])\r
- {\r
- s = (p->nodes[0] == node);\r
- if (p->nodes[s]->occupied\r
- && p->nodes[s]->occupied < next)\r
- {\r
- nextportal = p;\r
- nextnode = p->nodes[s];\r
- next = nextnode->occupied;\r
- }\r
- }\r
- node = nextnode;\r
- WindingCenter (nextportal->winding, mid);\r
- fprintf (linefile, "%f %f %f\n", mid[0], mid[1], mid[2]);\r
- point = xml_NodeForVec(mid);\r
- xmlAddChild(xml_node, point);\r
- count++;\r
- }\r
- // add the occupant center\r
- GetVectorForKey (node->occupant, "origin", mid);\r
-\r
- fprintf (linefile, "%f %f %f\n", mid[0], mid[1], mid[2]);\r
- point = xml_NodeForVec(mid);\r
- xmlAddChild(xml_node, point);\r
- Sys_FPrintf( SYS_VRB, "%9d point linefile\n", count+1);\r
-\r
- fclose (linefile);\r
- \r
- return xml_node;\r
-}\r
-\r
-\r
+/*
+Copyright (C) 1999-2007 id Software, Inc. and contributors.
+For a list of contributors, see the accompanying CONTRIBUTORS file.
+
+This file is part of GtkRadiant.
+
+GtkRadiant 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 2 of the License, or
+(at your option) any later version.
+
+GtkRadiant 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 GtkRadiant; 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;
+
+ Sys_Printf ("--- 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]);
+ Sys_Printf ("%5i point linefile\n", count+1);
+
+ fclose (linefile);
+}
+*/
+
+/*
+=============
+LeakFile
+
+Finds the shortest possible chain of portals
+that leads from the outside leaf to a specifically
+occupied leaf
+
+TTimo: builds a polyline xml node
+=============
+*/
+xmlNodePtr LeakFile (tree_t *tree)
+{
+ vec3_t mid;
+ FILE *linefile;
+ char filename[1024];
+ node_t *node;
+ int count;
+ xmlNodePtr xml_node, point;
+
+ if (!tree->outside_node.occupied)
+ return NULL;
+
+ Sys_FPrintf (SYS_VRB,"--- 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);
+
+ xml_node = xmlNewNode (NULL, "polyline");
+
+ 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]);
+ point = xml_NodeForVec(mid);
+ xmlAddChild(xml_node, point);
+ count++;
+ }
+ // add the occupant center
+ GetVectorForKey (node->occupant, "origin", mid);
+
+ fprintf (linefile, "%f %f %f\n", mid[0], mid[1], mid[2]);
+ point = xml_NodeForVec(mid);
+ xmlAddChild(xml_node, point);
+ Sys_FPrintf( SYS_VRB, "%9d point linefile\n", count+1);
+
+ fclose (linefile);
+
+ return xml_node;
+}
+
+
projects / xonotic / netradiant.git / blobdiff