quakeforge/libs/util/bspfile.c

303 lines
8.3 KiB
C
Raw Normal View History

/*
bspfile.c
DESCRIPTION
Copyright (C) 1996-1997 Id Software, Inc.
This program 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.
This program 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 this program; if not, write to:
Free Software Foundation, Inc.
59 Temple Place - Suite 330
Boston, MA 02111-1307, USA
*/
static const char rcsid[] =
"$Id$";
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#ifdef HAVE_IO_H
# include <io.h>
#endif
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#include <ctype.h>
#include <dirent.h>
#include <fcntl.h>
#include <stdarg.h>
#include <stdlib.h>
#include "QF/bspfile.h"
#include "QF/qendian.h"
#include "QF/qtypes.h"
#include "QF/quakefs.h"
#include "QF/sys.h"
static void
swap_bsp (bsp_t *bsp, int todisk)
{
int c, i, j;
dmiptexlump_t *mtl;
dmodel_t *d;
// models
for (i=0 ; i<bsp->nummodels ; i++) {
d = &bsp->models[i];
for (j=0 ; j<MAX_MAP_HULLS ; j++)
d->headnode[j] = LittleLong (d->headnode[j]);
d->visleafs = LittleLong (d->visleafs);
d->firstface = LittleLong (d->firstface);
d->numfaces = LittleLong (d->numfaces);
for (j=0 ; j<3 ; j++) {
d->mins[j] = LittleFloat(d->mins[j]);
d->maxs[j] = LittleFloat(d->maxs[j]);
d->origin[j] = LittleFloat(d->origin[j]);
}
}
// vertexes
for (i=0 ; i<bsp->numvertexes ; i++) {
for (j=0 ; j<3 ; j++)
bsp->vertexes[i].point[j] = LittleFloat (bsp->vertexes[i].point[j]);
}
// planes
for (i=0 ; i<bsp->numplanes ; i++) {
for (j=0 ; j<3 ; j++)
bsp->planes[i].normal[j] = LittleFloat (bsp->planes[i].normal[j]);
bsp->planes[i].dist = LittleFloat (bsp->planes[i].dist);
bsp->planes[i].type = LittleLong (bsp->planes[i].type);
}
// texinfos
for (i=0 ; i<bsp->numtexinfo ; i++) {
for (j=0 ; j<8 ; j++)
bsp->texinfo[i].vecs[0][j] = LittleFloat (bsp->texinfo[i].vecs[0][j]);
bsp->texinfo[i].miptex = LittleLong (bsp->texinfo[i].miptex);
bsp->texinfo[i].flags = LittleLong (bsp->texinfo[i].flags);
}
// faces
for (i=0 ; i<bsp->numfaces ; i++) {
bsp->faces[i].texinfo = LittleShort (bsp->faces[i].texinfo);
bsp->faces[i].planenum = LittleShort (bsp->faces[i].planenum);
bsp->faces[i].side = LittleShort (bsp->faces[i].side);
bsp->faces[i].lightofs = LittleLong (bsp->faces[i].lightofs);
bsp->faces[i].firstedge = LittleLong (bsp->faces[i].firstedge);
bsp->faces[i].numedges = LittleShort (bsp->faces[i].numedges);
}
// nodes
for (i=0 ; i<bsp->numnodes ; i++) {
bsp->nodes[i].planenum = LittleLong (bsp->nodes[i].planenum);
for (j=0 ; j<3 ; j++) {
bsp->nodes[i].mins[j] = LittleShort (bsp->nodes[i].mins[j]);
bsp->nodes[i].maxs[j] = LittleShort (bsp->nodes[i].maxs[j]);
}
bsp->nodes[i].children[0] = LittleShort (bsp->nodes[i].children[0]);
bsp->nodes[i].children[1] = LittleShort (bsp->nodes[i].children[1]);
bsp->nodes[i].firstface = LittleShort (bsp->nodes[i].firstface);
bsp->nodes[i].numfaces = LittleShort (bsp->nodes[i].numfaces);
}
// leafs
for (i=0 ; i<bsp->numleafs ; i++) {
bsp->leafs[i].contents = LittleLong (bsp->leafs[i].contents);
for (j=0 ; j<3 ; j++) {
bsp->leafs[i].mins[j] = LittleShort (bsp->leafs[i].mins[j]);
bsp->leafs[i].maxs[j] = LittleShort (bsp->leafs[i].maxs[j]);
}
bsp->leafs[i].firstmarksurface = LittleShort (bsp->leafs[i].firstmarksurface);
bsp->leafs[i].nummarksurfaces = LittleShort (bsp->leafs[i].nummarksurfaces);
bsp->leafs[i].visofs = LittleLong (bsp->leafs[i].visofs);
}
// clipnodes
for (i=0 ; i<bsp->numclipnodes ; i++) {
bsp->clipnodes[i].planenum = LittleLong (bsp->clipnodes[i].planenum);
bsp->clipnodes[i].children[0] = LittleShort (bsp->clipnodes[i].children[0]);
bsp->clipnodes[i].children[1] = LittleShort (bsp->clipnodes[i].children[1]);
}
// miptex
if (bsp->texdatasize) {
mtl = (dmiptexlump_t *)bsp->texdata;
if (todisk)
c = mtl->nummiptex;
else
c = LittleLong(mtl->nummiptex);
mtl->nummiptex = LittleLong (mtl->nummiptex);
for (i=0 ; i<c ; i++)
mtl->dataofs[i] = LittleLong(mtl->dataofs[i]);
}
// marksurfaces
for (i=0 ; i<bsp->nummarksurfaces ; i++)
bsp->marksurfaces[i] = LittleShort (bsp->marksurfaces[i]);
// surfedges
for (i=0 ; i<bsp->numsurfedges ; i++)
bsp->surfedges[i] = LittleLong (bsp->surfedges[i]);
// edges
for (i=0 ; i<bsp->numedges ; i++) {
bsp->edges[i].v[0] = LittleShort (bsp->edges[i].v[0]);
bsp->edges[i].v[1] = LittleShort (bsp->edges[i].v[1]);
}
}
bsp_t *
LoadBSPFile (QFile *file, int size)
{
dheader_t *header;
bsp_t *bsp;
header = malloc (size);
Qread (file, header, size);
if (LittleLong (header->version) != BSPVERSION)
Sys_Error ("version %i, not %i", LittleLong (header->version),
BSPVERSION);
#undef SET_LUMP
#define SET_LUMP(l,n) \
do { \
bsp->num##n = LittleLong (header->lumps[l].filelen); \
bsp->n = malloc (bsp->num##n); \
memcpy (bsp->n, (byte *) header + LittleLong (header->lumps[l].fileofs), \
bsp->num##n); \
bsp->num##n /= sizeof (bsp->n[0]); \
} while (0)
bsp = malloc (sizeof (bsp_t));
SET_LUMP (LUMP_PLANES, planes);
SET_LUMP (LUMP_LEAFS, leafs);
SET_LUMP (LUMP_VERTEXES, vertexes);
SET_LUMP (LUMP_NODES, nodes);
SET_LUMP (LUMP_TEXINFO, texinfo);
SET_LUMP (LUMP_FACES, faces);
SET_LUMP (LUMP_CLIPNODES, clipnodes);
SET_LUMP (LUMP_MARKSURFACES, marksurfaces);
SET_LUMP (LUMP_SURFEDGES, surfedges);
SET_LUMP (LUMP_EDGES, edges);
SET_LUMP (LUMP_MODELS, models);
#undef SET_LUMP
#define SET_LUMP(l,n) \
do { \
bsp->n##size = LittleLong (header->lumps[l].filelen); \
bsp->n = malloc (bsp->n##size); \
memcpy (bsp->n, (byte *) header + LittleLong (header->lumps[l].fileofs), \
bsp->n##size); \
bsp->n##size /= sizeof (bsp->n[0]); \
} while (0)
SET_LUMP (LUMP_LIGHTING, lightdata);
SET_LUMP (LUMP_VISIBILITY, visdata);
SET_LUMP (LUMP_ENTITIES, entdata);
SET_LUMP (LUMP_TEXTURES, texdata);
free (header);
swap_bsp (bsp, 0);
return bsp;
}
/*
WriteBSPFile
Swaps the bsp file in place, so it should not be referenced again
*/
void
WriteBSPFile (bsp_t *bsp, QFile *file)
{
int size;
dheader_t *header;
byte *data;
size = sizeof (dheader_t);
size += bsp->nummodels * sizeof (dmodel_t);
size += bsp->visdatasize;
size += bsp->lightdatasize;
size += bsp->texdatasize;
size += bsp->entdatasize;
size += bsp->numleafs * sizeof (dleaf_t);
size += bsp->numplanes * sizeof (dplane_t);
size += bsp->numvertexes * sizeof (dvertex_t);
size += bsp->numnodes * sizeof (dnode_t);
size += bsp->numtexinfo * sizeof (texinfo_t);
size += bsp->numfaces * sizeof (dface_t);
size += bsp->numclipnodes * sizeof (dclipnode_t);
size += bsp->numedges * sizeof (dedge_t);
size += bsp->nummarksurfaces * sizeof (unsigned short);
size += bsp->numsurfedges * sizeof (int);
header = malloc (size);
memset (header, 0, sizeof (dheader_t));
swap_bsp (bsp, 1);
#undef SET_LUMP
#define SET_LUMP(l,n) \
do { \
bsp->num##n *= sizeof (bsp->n[0]); \
header->lumps[l].fileofs = LittleLong (data - (byte *) header); \
header->lumps[l].filelen = LittleLong (bsp->num##n); \
memcpy (data, bsp->n, bsp->num##n); \
data += bsp->num##n; \
} while (0)
header->version = LittleLong (BSPVERSION);
data = (byte *) &header[1];
SET_LUMP (LUMP_PLANES, planes);
SET_LUMP (LUMP_LEAFS, leafs);
SET_LUMP (LUMP_VERTEXES, vertexes);
SET_LUMP (LUMP_NODES, nodes);
SET_LUMP (LUMP_TEXINFO, texinfo);
SET_LUMP (LUMP_FACES, faces);
SET_LUMP (LUMP_CLIPNODES, clipnodes);
SET_LUMP (LUMP_MARKSURFACES, marksurfaces);
SET_LUMP (LUMP_SURFEDGES, surfedges);
SET_LUMP (LUMP_EDGES, edges);
SET_LUMP (LUMP_MODELS, models);
#undef SET_LUMP
#define SET_LUMP(l,n) \
do { \
bsp->n##size *= sizeof (bsp->n[0]); \
header->lumps[l].fileofs = LittleLong (data - (byte *) header); \
header->lumps[l].filelen = LittleLong (bsp->n##size); \
memcpy (data, bsp->n, bsp->n##size); \
data += bsp->n##size; \
} while (0)
SET_LUMP (LUMP_LIGHTING, lightdata);
SET_LUMP (LUMP_VISIBILITY, visdata);
SET_LUMP (LUMP_ENTITIES, entdata);
SET_LUMP (LUMP_TEXTURES, texdata);
Qwrite (file, header, size);
free (header);
}