qf/quakeforge
0
0
Fork 0
mirror of https://git.code.sf.net/p/quake/quakeforge synced 2025-01-17 22:50:51 +00:00
Code Issues Projects Releases Packages Wiki Activity

small bit of cleanup

Browse source
This commit is contained in:
Bill Currie 2002-11-08 17:13:23 +00:00
parent 3d44623b57
commit a5ead00f8e
1 changed files with 50 additions and 42 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

92
libs/util/bspfile.c
View file

@ -30,17 +30,13 @@ static const char rcsid[] =
#ifdef HAVE_CONFIG_H #ifdef HAVE_CONFIG_H
# include "config.h" # include "config.h"
#endif #endif
#ifdef HAVE_IO_H
# include <io.h>
#endif
#ifdef HAVE_STRING_H #ifdef HAVE_STRING_H
# include <string.h> # include <string.h>
#endif #endif
#ifdef HAVE_STRINGS_H
# include <strings.h>
#endif
#include <ctype.h>
#include <dirent.h>
#include <fcntl.h>
#include <stdarg.h>
#include <stdlib.h> #include <stdlib.h>
#include "QF/bspfile.h" #include "QF/bspfile.h"
@ -76,67 +72,74 @@ swap_bsp (bsp_t *bsp, int todisk)
// vertexes // vertexes
for (i=0 ; i<bsp->numvertexes ; i++) { for (i=0 ; i<bsp->numvertexes ; i++) {
dvertex_t *vertex = &bsp->vertexes[i];
for (j=0 ; j<3 ; j++) for (j=0 ; j<3 ; j++)
bsp->vertexes[i].point[j] = LittleFloat (bsp->vertexes[i].point[j]); vertex->point[j] = LittleFloat (vertex->point[j]);
} }
// planes // planes
for (i=0 ; i<bsp->numplanes ; i++) { for (i=0 ; i<bsp->numplanes ; i++) {
dplane_t *plane = &bsp->planes[i];
for (j=0 ; j<3 ; j++) for (j=0 ; j<3 ; j++)
bsp->planes[i].normal[j] = LittleFloat (bsp->planes[i].normal[j]); plane->normal[j] = LittleFloat (plane->normal[j]);
bsp->planes[i].dist = LittleFloat (bsp->planes[i].dist); plane->dist = LittleFloat (plane->dist);
bsp->planes[i].type = LittleLong (bsp->planes[i].type); plane->type = LittleLong (plane->type);
} }
// texinfos // texinfos
for (i=0 ; i<bsp->numtexinfo ; i++) { for (i=0 ; i<bsp->numtexinfo ; i++) {
texinfo_t *texinfo = &bsp->texinfo[i];
for (j=0 ; j<8 ; j++) for (j=0 ; j<8 ; j++)
bsp->texinfo[i].vecs[0][j] = LittleFloat (bsp->texinfo[i].vecs[0][j]); texinfo->vecs[0][j] = LittleFloat (texinfo->vecs[0][j]);
bsp->texinfo[i].miptex = LittleLong (bsp->texinfo[i].miptex); texinfo->miptex = LittleLong (texinfo->miptex);
bsp->texinfo[i].flags = LittleLong (bsp->texinfo[i].flags); texinfo->flags = LittleLong (texinfo->flags);
} }
// faces // faces
for (i=0 ; i<bsp->numfaces ; i++) { for (i=0 ; i<bsp->numfaces ; i++) {
bsp->faces[i].texinfo = LittleShort (bsp->faces[i].texinfo); dface_t *face = &bsp->faces[i];
bsp->faces[i].planenum = LittleShort (bsp->faces[i].planenum); face->texinfo = LittleShort (face->texinfo);
bsp->faces[i].side = LittleShort (bsp->faces[i].side); face->planenum = LittleShort (face->planenum);
bsp->faces[i].lightofs = LittleLong (bsp->faces[i].lightofs); face->side = LittleShort (face->side);
bsp->faces[i].firstedge = LittleLong (bsp->faces[i].firstedge); face->lightofs = LittleLong (face->lightofs);
bsp->faces[i].numedges = LittleShort (bsp->faces[i].numedges); face->firstedge = LittleLong (face->firstedge);
face->numedges = LittleShort (face->numedges);
} }
// nodes // nodes
for (i=0 ; i<bsp->numnodes ; i++) { for (i=0 ; i<bsp->numnodes ; i++) {
bsp->nodes[i].planenum = LittleLong (bsp->nodes[i].planenum); dnode_t *node = &bsp->nodes[i];
node->planenum = LittleLong (node->planenum);
for (j=0 ; j<3 ; j++) { for (j=0 ; j<3 ; j++) {
bsp->nodes[i].mins[j] = LittleShort (bsp->nodes[i].mins[j]); node->mins[j] = LittleShort (node->mins[j]);
bsp->nodes[i].maxs[j] = LittleShort (bsp->nodes[i].maxs[j]); node->maxs[j] = LittleShort (node->maxs[j]);
} }
bsp->nodes[i].children[0] = LittleShort (bsp->nodes[i].children[0]); node->children[0] = LittleShort (node->children[0]);
bsp->nodes[i].children[1] = LittleShort (bsp->nodes[i].children[1]); node->children[1] = LittleShort (node->children[1]);
bsp->nodes[i].firstface = LittleShort (bsp->nodes[i].firstface); node->firstface = LittleShort (node->firstface);
bsp->nodes[i].numfaces = LittleShort (bsp->nodes[i].numfaces); node->numfaces = LittleShort (node->numfaces);
} }
// leafs // leafs
for (i=0 ; i<bsp->numleafs ; i++) { for (i=0 ; i<bsp->numleafs ; i++) {
bsp->leafs[i].contents = LittleLong (bsp->leafs[i].contents); dleaf_t *leaf = &bsp->leafs[i];
leaf->contents = LittleLong (leaf->contents);
for (j=0 ; j<3 ; j++) { for (j=0 ; j<3 ; j++) {
bsp->leafs[i].mins[j] = LittleShort (bsp->leafs[i].mins[j]); leaf->mins[j] = LittleShort (leaf->mins[j]);
bsp->leafs[i].maxs[j] = LittleShort (bsp->leafs[i].maxs[j]); leaf->maxs[j] = LittleShort (leaf->maxs[j]);
} }
bsp->leafs[i].firstmarksurface = LittleShort (bsp->leafs[i].firstmarksurface); leaf->firstmarksurface = LittleShort (leaf->firstmarksurface);
bsp->leafs[i].nummarksurfaces = LittleShort (bsp->leafs[i].nummarksurfaces); leaf->nummarksurfaces = LittleShort (leaf->nummarksurfaces);
bsp->leafs[i].visofs = LittleLong (bsp->leafs[i].visofs); leaf->visofs = LittleLong (leaf->visofs);
} }
// clipnodes // clipnodes
for (i=0 ; i<bsp->numclipnodes ; i++) { for (i=0 ; i<bsp->numclipnodes ; i++) {
bsp->clipnodes[i].planenum = LittleLong (bsp->clipnodes[i].planenum); dclipnode_t *clipnode = &bsp->clipnodes[i];
bsp->clipnodes[i].children[0] = LittleShort (bsp->clipnodes[i].children[0]); clipnode->planenum = LittleLong (clipnode->planenum);
bsp->clipnodes[i].children[1] = LittleShort (bsp->clipnodes[i].children[1]); clipnode->children[0] = LittleShort (clipnode->children[0]);
clipnode->children[1] = LittleShort (clipnode->children[1]);
} }
// miptex // miptex
@ -152,17 +155,22 @@ swap_bsp (bsp_t *bsp, int todisk)
} }
// marksurfaces // marksurfaces
for (i=0 ; i<bsp->nummarksurfaces ; i++) for (i=0 ; i<bsp->nummarksurfaces ; i++) {
bsp->marksurfaces[i] = LittleShort (bsp->marksurfaces[i]); unsigned short *marksurface = &bsp->marksurfaces[i];
*marksurface = LittleShort (*marksurface);
}
// surfedges // surfedges
for (i=0 ; i<bsp->numsurfedges ; i++) for (i=0 ; i<bsp->numsurfedges ; i++) {
bsp->surfedges[i] = LittleLong (bsp->surfedges[i]); int *surfedge = &bsp->surfedges[i];
*surfedge = LittleLong (*surfedge);
}
// edges // edges
for (i=0 ; i<bsp->numedges ; i++) { for (i=0 ; i<bsp->numedges ; i++) {
bsp->edges[i].v[0] = LittleShort (bsp->edges[i].v[0]); dedge_t *edge = &bsp->edges[i];
bsp->edges[i].v[1] = LittleShort (bsp->edges[i].v[1]); edge->v[0] = LittleShort (edge->v[0]);
edge->v[1] = LittleShort (edge->v[1]);
} }
} }