prtfile.c File Reference

#include "qbsp.h"

Include dependency graph for prtfile.c:

Go to the source code of this file.

Defines
#define	PORTALFILE   "PRT1"
Functions
void	CreateVisPortals_r (node_t *node)
void	FillLeafNumbers_r (node_t *node, int num)
void	FinishVisPortals2_r (node_t *node)
void	FinishVisPortals_r (node_t *node)
void	NumberLeafs_r (node_t *node)
void	SaveClusters_r (node_t *node)
void	WriteFloat2 (FILE *f, vec_t v)
void	WritePortalFile (tree_t *tree)
void	WritePortalFile_r (node_t *node)
Variables
int	clusterleaf
int	num_visclusters
int	num_visportals
FILE *	pf

---

Define Documentation

#define PORTALFILE   "PRT1"

Definition at line 35 of file prtfile.c. Referenced by LoadPortals(), VL_LoadPortals(), VS_LoadPortals(), WritePortalFile(), and WritePortals().

---

Function Documentation

void CreateVisPortals_r (  node_t *  node  )

Definition at line 179 of file prtfile.c. References node_s::children, node_s::detail_seperator, MakeNodePortal(), node_t, node_s::planenum, PLANENUM_LEAF, and SplitNodePortals(). Referenced by WritePortalFile(). { // stop as soon as we get to a detail_seperator, which // means that everything below is in a single cluster if (node->planenum == PLANENUM_LEAF || node->detail_seperator ) return; MakeNodePortal (node); SplitNodePortals (node); CreateVisPortals_r (node->children[0]); CreateVisPortals_r (node->children[1]); }

Here is the call graph for this function:

void FillLeafNumbers_r (  node_t *  node, int  num )

Definition at line 115 of file prtfile.c. References node_s::children, node_s::cluster, node_s::contents, node_t, and node_s::planenum. Referenced by NumberLeafs_r(). { if (node->planenum == PLANENUM_LEAF) { if (node->contents & CONTENTS_SOLID) node->cluster = -1; else node->cluster = num; return; } node->cluster = num; FillLeafNumbers_r (node->children[0], num); FillLeafNumbers_r (node->children[1], num); }

void FinishVisPortals2_r (  node_t *  node  )

Definition at line 198 of file prtfile.c. References node_s::children, MakeNodePortal(), node_t, node_s::planenum, and SplitNodePortals(). Referenced by FinishVisPortals_r(). { if (node->planenum == PLANENUM_LEAF) return; MakeNodePortal (node); SplitNodePortals (node); FinishVisPortals2_r (node->children[0]); FinishVisPortals2_r (node->children[1]); }

Here is the call graph for this function:

void FinishVisPortals_r (  node_t *  node  )

Definition at line 210 of file prtfile.c. References node_s::children, node_s::detail_seperator, FinishVisPortals2_r(), node_t, and node_s::planenum. { if (node->planenum == PLANENUM_LEAF) return; if (node->detail_seperator) { FinishVisPortals2_r (node); return; } FinishVisPortals_r (node->children[0]); FinishVisPortals_r (node->children[1]); }

Here is the call graph for this function:

void NumberLeafs_r (  node_t *  node  )

Definition at line 135 of file prtfile.c. References node_s::children, node_s::cluster, node_s::contents, node_s::detail_seperator, FillLeafNumbers_r(), portal_s::next, node_t, portal_s::nodes, num_visclusters, num_visportals, NumberLeafs_r(), p, node_s::planenum, PLANENUM_LEAF, portal_t, Portal_VisFlood(), and node_s::portals. { portal_t *p; if (node->planenum != PLANENUM_LEAF && !node->detail_seperator) { // decision node node->cluster = -99; NumberLeafs_r (node->children[0]); NumberLeafs_r (node->children[1]); return; } // either a leaf or a detail cluster if ( node->contents & CONTENTS_SOLID ) { // solid block, viewpoint never inside node->cluster = -1; return; } FillLeafNumbers_r (node, num_visclusters); num_visclusters++; // count the portals for (p = node->portals ; p ; ) { if (p->nodes[0] == node) // only write out from first leaf { if (Portal_VisFlood (p)) num_visportals++; p = p->next[0]; } else p = p->next[1]; } }

Here is the call graph for this function:

void SaveClusters_r (  node_t *  node  )

Definition at line 227 of file prtfile.c. References node_s::children, node_s::cluster, dleaf_t::cluster, clusterleaf, dleafs, node_t, and node_s::planenum. Referenced by WritePortalFile(). { if (node->planenum == PLANENUM_LEAF) { dleafs[clusterleaf++].cluster = node->cluster; return; } SaveClusters_r (node->children[0]); SaveClusters_r (node->children[1]); }

void WriteFloat2 (  FILE *  f, vec_t  v )

Definition at line 41 of file prtfile.c. References f, fabs(), fprintf(), Q_rint(), and v. Referenced by WritePortalFile_r(). { if ( fabs(v - Q_rint(v)) < 0.001 ) fprintf (f,"%i ",(int)Q_rint(v)); else fprintf (f,"%f ",v); }

Here is the call graph for this function:

void WritePortalFile (  tree_t *  tree  )

Definition at line 243 of file prtfile.c. { char filename[1024]; node_t *headnode; qprintf ("--- WritePortalFile ---\n"); headnode = tree->headnode; num_visclusters = 0; num_visportals = 0; Tree_FreePortals_r (headnode); MakeHeadnodePortals (tree); CreateVisPortals_r (headnode); // set the cluster field in every leaf and count the total number of portals NumberLeafs_r (headnode); // write the file sprintf (filename, "%s.prt", source); printf ("writing %s\n", filename); pf = fopen (filename, "w"); if (!pf) Error ("Error opening %s", filename); fprintf (pf, "%s\n", PORTALFILE); fprintf (pf, "%i\n", num_visclusters); fprintf (pf, "%i\n", num_visportals); qprintf ("%5i visclusters\n", num_visclusters); qprintf ("%5i visportals\n", num_visportals); WritePortalFile_r (headnode); fclose (pf); // we need to store the clusters out now because ordering // issues made us do this after writebsp... clusterleaf = 1; SaveClusters_r (headnode); }

void WritePortalFile_r (  node_t *  node  )

Definition at line 54 of file prtfile.c. References node_s::children, node_s::cluster, node_s::contents, node_s::detail_seperator, DotProduct, fprintf(), i, portal_s::next, node_t, portal_s::nodes, plane_t::normal, winding_t::numpoints, winding_t::p, p, pf, portal_s::plane, node_s::planenum, PLANENUM_LEAF, portal_t, Portal_VisFlood(), node_s::portals, s, vec3_t, vec_t, w, portal_s::winding, WindingPlane(), WriteFloat2(), and WritePortalFile_r(). { int i, s; portal_t *p; winding_t *w; vec3_t normal; vec_t dist; // decision node if (node->planenum != PLANENUM_LEAF && !node->detail_seperator) { WritePortalFile_r (node->children[0]); WritePortalFile_r (node->children[1]); return; } if (node->contents & CONTENTS_SOLID) return; for (p = node->portals ; p ; p=p->next[s]) { w = p->winding; s = (p->nodes[1] == node); if (w && p->nodes[0] == node) { if (!Portal_VisFlood (p)) continue; // write out to the file // sometimes planes get turned around when they are very near // the changeover point between different axis. interpret the // plane the same way vis will, and flip the side orders if needed // FIXME: is this still relevent? WindingPlane (w, normal, &dist); if ( DotProduct (p->plane.normal, normal) < 0.99 ) { // backwards... fprintf (pf,"%i %i %i ",w->numpoints, p->nodes[1]->cluster, p->nodes[0]->cluster); } else fprintf (pf,"%i %i %i ",w->numpoints, p->nodes[0]->cluster, p->nodes[1]->cluster); for (i=0 ; i<w->numpoints ; i++) { fprintf (pf,"("); WriteFloat2 (pf, w->p[i][0]); WriteFloat2 (pf, w->p[i][1]); WriteFloat2 (pf, w->p[i][2]); fprintf (pf,") "); } fprintf (pf,"\n"); } } }

Here is the call graph for this function:

---

Variable Documentation

int clusterleaf

Definition at line 226 of file prtfile.c. Referenced by SaveClusters_r(), and WritePortalFile().

int num_visclusters

Definition at line 38 of file prtfile.c. Referenced by NumberClusters(), NumberLeafs_r(), and WritePortalFile().

int num_visportals

Definition at line 39 of file prtfile.c. Referenced by NumberClusters(), NumberLeafs_r(), and WritePortalFile().

FILE* pf

Definition at line 37 of file prtfile.c. Referenced by CM_GeneratePatchCollide(), CM_PatchCollideFromGrid(), Str::Find(), PointInMoveList(), Terrain_PointInMoveList(), WriteFaceFile_r(), WritePortalFile(), WritePortalFile_r(), and WritePortals().

---