-/*\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 "cmdlib.h"\r
-#include "mathlib.h"\r
-#include "bspfile.h"\r
-#include "scriplib.h"\r
-#include "inout.h"\r
-\r
-void GetLeafNums (void);\r
-\r
-//=============================================================================\r
-\r
-int nummodels;\r
-dmodel_t dmodels[MAX_MAP_MODELS];\r
-\r
-int visdatasize;\r
-byte dvisdata[MAX_MAP_VISIBILITY];\r
-dvis_t *dvis = (dvis_t *)dvisdata;\r
-\r
-int lightdatasize;\r
-byte dlightdata[MAX_MAP_LIGHTING];\r
-\r
-int entdatasize;\r
-char dentdata[MAX_MAP_ENTSTRING];\r
-\r
-int numleafs;\r
-dleaf_t dleafs[MAX_MAP_LEAFS];\r
-\r
-int numplanes;\r
-dplane_t dplanes[MAX_MAP_PLANES];\r
-\r
-int numvertexes;\r
-dvertex_t dvertexes[MAX_MAP_VERTS];\r
-\r
-int numnodes;\r
-dnode_t dnodes[MAX_MAP_NODES];\r
-\r
-int numtexinfo;\r
-texinfo_t texinfo[MAX_MAP_TEXINFO];\r
-\r
-int numfaces;\r
-dface_t dfaces[MAX_MAP_FACES];\r
-\r
-int numedges;\r
-dedge_t dedges[MAX_MAP_EDGES];\r
-\r
-int numleaffaces;\r
-unsigned short dleaffaces[MAX_MAP_LEAFFACES];\r
-\r
-int numleafbrushes;\r
-unsigned short dleafbrushes[MAX_MAP_LEAFBRUSHES];\r
-\r
-int numsurfedges;\r
-int dsurfedges[MAX_MAP_SURFEDGES];\r
-\r
-int numbrushes;\r
-dbrush_t dbrushes[MAX_MAP_BRUSHES];\r
-\r
-int numbrushsides;\r
-dbrushside_t dbrushsides[MAX_MAP_BRUSHSIDES];\r
-\r
-int numareas;\r
-darea_t dareas[MAX_MAP_AREAS];\r
-\r
-int numareaportals;\r
-dareaportal_t dareaportals[MAX_MAP_AREAPORTALS];\r
-\r
-byte dpop[256];\r
-\r
-/*\r
-===============\r
-CompressVis\r
-\r
-===============\r
-*/\r
-int CompressVis (byte *vis, byte *dest)\r
-{\r
- int j;\r
- int rep;\r
- int visrow;\r
- byte *dest_p;\r
- \r
- dest_p = dest;\r
-// visrow = (r_numvisleafs + 7)>>3;\r
- visrow = (dvis->numclusters + 7)>>3;\r
- \r
- for (j=0 ; j<visrow ; j++)\r
- {\r
- *dest_p++ = vis[j];\r
- if (vis[j])\r
- continue;\r
-\r
- rep = 1;\r
- for ( j++; j<visrow ; j++)\r
- if (vis[j] || rep == 255)\r
- break;\r
- else\r
- rep++;\r
- *dest_p++ = rep;\r
- j--;\r
- }\r
- \r
- return dest_p - dest;\r
-}\r
-\r
-\r
-/*\r
-===================\r
-DecompressVis\r
-===================\r
-*/\r
-void DecompressVis (byte *in, byte *decompressed)\r
-{\r
- int c;\r
- byte *out;\r
- int row;\r
-\r
-// row = (r_numvisleafs+7)>>3; \r
- row = (dvis->numclusters+7)>>3; \r
- out = decompressed;\r
-\r
- do\r
- {\r
- if (*in)\r
- {\r
- *out++ = *in++;\r
- continue;\r
- }\r
- \r
- c = in[1];\r
- if (!c)\r
- Error ("DecompressVis: 0 repeat");\r
- in += 2;\r
- while (c)\r
- {\r
- *out++ = 0;\r
- c--;\r
- }\r
- } while (out - decompressed < row);\r
-}\r
-\r
-//=============================================================================\r
-\r
-/*\r
-=============\r
-SwapBSPFile\r
-\r
-Byte swaps all data in a bsp file.\r
-=============\r
-*/\r
-void SwapBSPFile (qboolean todisk)\r
-{\r
- int i, j;\r
- dmodel_t *d;\r
-\r
- \r
-// models \r
- for (i=0 ; i<nummodels ; i++)\r
- {\r
- d = &dmodels[i];\r
-\r
- d->firstface = LittleLong (d->firstface);\r
- d->numfaces = LittleLong (d->numfaces);\r
- d->headnode = LittleLong (d->headnode);\r
- \r
- for (j=0 ; j<3 ; j++)\r
- {\r
- d->mins[j] = LittleFloat(d->mins[j]);\r
- d->maxs[j] = LittleFloat(d->maxs[j]);\r
- d->origin[j] = LittleFloat(d->origin[j]);\r
- }\r
- }\r
-\r
-//\r
-// vertexes\r
-//\r
- for (i=0 ; i<numvertexes ; i++)\r
- {\r
- for (j=0 ; j<3 ; j++)\r
- dvertexes[i].point[j] = LittleFloat (dvertexes[i].point[j]);\r
- }\r
- \r
-//\r
-// planes\r
-// \r
- for (i=0 ; i<numplanes ; i++)\r
- {\r
- for (j=0 ; j<3 ; j++)\r
- dplanes[i].normal[j] = LittleFloat (dplanes[i].normal[j]);\r
- dplanes[i].dist = LittleFloat (dplanes[i].dist);\r
- dplanes[i].type = LittleLong (dplanes[i].type);\r
- }\r
- \r
-//\r
-// texinfos\r
-// \r
- for (i=0 ; i<numtexinfo ; i++)\r
- {\r
- for (j=0 ; j<8 ; j++)\r
- texinfo[i].vecs[0][j] = LittleFloat (texinfo[i].vecs[0][j]);\r
- texinfo[i].flags = LittleLong (texinfo[i].flags);\r
- texinfo[i].value = LittleLong (texinfo[i].value);\r
- texinfo[i].nexttexinfo = LittleLong (texinfo[i].nexttexinfo);\r
- }\r
- \r
-//\r
-// faces\r
-//\r
- for (i=0 ; i<numfaces ; i++)\r
- {\r
- dfaces[i].texinfo = LittleShort (dfaces[i].texinfo);\r
- dfaces[i].planenum = LittleShort (dfaces[i].planenum);\r
- dfaces[i].side = LittleShort (dfaces[i].side);\r
- dfaces[i].lightofs = LittleLong (dfaces[i].lightofs);\r
- dfaces[i].firstedge = LittleLong (dfaces[i].firstedge);\r
- dfaces[i].numedges = LittleShort (dfaces[i].numedges);\r
- }\r
-\r
-//\r
-// nodes\r
-//\r
- for (i=0 ; i<numnodes ; i++)\r
- {\r
- dnodes[i].planenum = LittleLong (dnodes[i].planenum);\r
- for (j=0 ; j<3 ; j++)\r
- {\r
- dnodes[i].mins[j] = LittleShort (dnodes[i].mins[j]);\r
- dnodes[i].maxs[j] = LittleShort (dnodes[i].maxs[j]);\r
- }\r
- dnodes[i].children[0] = LittleLong (dnodes[i].children[0]);\r
- dnodes[i].children[1] = LittleLong (dnodes[i].children[1]);\r
- dnodes[i].firstface = LittleShort (dnodes[i].firstface);\r
- dnodes[i].numfaces = LittleShort (dnodes[i].numfaces);\r
- }\r
-\r
-//\r
-// leafs\r
-//\r
- for (i=0 ; i<numleafs ; i++)\r
- {\r
- dleafs[i].contents = LittleLong (dleafs[i].contents);\r
- dleafs[i].cluster = LittleShort (dleafs[i].cluster);\r
- dleafs[i].area = LittleShort (dleafs[i].area);\r
- for (j=0 ; j<3 ; j++)\r
- {\r
- dleafs[i].mins[j] = LittleShort (dleafs[i].mins[j]);\r
- dleafs[i].maxs[j] = LittleShort (dleafs[i].maxs[j]);\r
- }\r
-\r
- dleafs[i].firstleafface = LittleShort (dleafs[i].firstleafface);\r
- dleafs[i].numleaffaces = LittleShort (dleafs[i].numleaffaces);\r
- dleafs[i].firstleafbrush = LittleShort (dleafs[i].firstleafbrush);\r
- dleafs[i].numleafbrushes = LittleShort (dleafs[i].numleafbrushes);\r
- }\r
-\r
-//\r
-// leaffaces\r
-//\r
- for (i=0 ; i<numleaffaces ; i++)\r
- dleaffaces[i] = LittleShort (dleaffaces[i]);\r
-\r
-//\r
-// leafbrushes\r
-//\r
- for (i=0 ; i<numleafbrushes ; i++)\r
- dleafbrushes[i] = LittleShort (dleafbrushes[i]);\r
-\r
-//\r
-// surfedges\r
-//\r
- for (i=0 ; i<numsurfedges ; i++)\r
- dsurfedges[i] = LittleLong (dsurfedges[i]);\r
-\r
-//\r
-// edges\r
-//\r
- for (i=0 ; i<numedges ; i++)\r
- {\r
- dedges[i].v[0] = LittleShort (dedges[i].v[0]);\r
- dedges[i].v[1] = LittleShort (dedges[i].v[1]);\r
- }\r
-\r
-//\r
-// brushes\r
-//\r
- for (i=0 ; i<numbrushes ; i++)\r
- {\r
- dbrushes[i].firstside = LittleLong (dbrushes[i].firstside);\r
- dbrushes[i].numsides = LittleLong (dbrushes[i].numsides);\r
- dbrushes[i].contents = LittleLong (dbrushes[i].contents);\r
- }\r
-\r
-//\r
-// areas\r
-//\r
- for (i=0 ; i<numareas ; i++)\r
- {\r
- dareas[i].numareaportals = LittleLong (dareas[i].numareaportals);\r
- dareas[i].firstareaportal = LittleLong (dareas[i].firstareaportal);\r
- }\r
-\r
-//\r
-// areasportals\r
-//\r
- for (i=0 ; i<numareaportals ; i++)\r
- {\r
- dareaportals[i].portalnum = LittleLong (dareaportals[i].portalnum);\r
- dareaportals[i].otherarea = LittleLong (dareaportals[i].otherarea);\r
- }\r
-\r
-//\r
-// brushsides\r
-//\r
- for (i=0 ; i<numbrushsides ; i++)\r
- {\r
- dbrushsides[i].planenum = LittleShort (dbrushsides[i].planenum);\r
- dbrushsides[i].texinfo = LittleShort (dbrushsides[i].texinfo);\r
- }\r
-\r
-//\r
-// visibility\r
-//\r
- if (todisk)\r
- j = dvis->numclusters;\r
- else\r
- j = LittleLong(dvis->numclusters);\r
- dvis->numclusters = LittleLong (dvis->numclusters);\r
- for (i=0 ; i<j ; i++)\r
- {\r
- dvis->bitofs[i][0] = LittleLong (dvis->bitofs[i][0]);\r
- dvis->bitofs[i][1] = LittleLong (dvis->bitofs[i][1]);\r
- }\r
-}\r
-\r
-\r
-dheader_t *header;\r
-\r
-int CopyLump (int lump, void *dest, int size)\r
-{\r
- int length, ofs;\r
-\r
- length = header->lumps[lump].filelen;\r
- ofs = header->lumps[lump].fileofs;\r
- \r
- if (length % size)\r
- Error ("LoadBSPFile: odd lump size");\r
- \r
- memcpy (dest, (byte *)header + ofs, length);\r
-\r
- return length / size;\r
-}\r
-\r
-/*\r
-=============\r
-LoadBSPFile\r
-=============\r
-*/\r
-void LoadBSPFile (char *filename)\r
-{\r
- int i;\r
- \r
-//\r
-// load the file header\r
-//\r
- LoadFile (filename, (void **)&header);\r
-\r
-// swap the header\r
- for (i=0 ; i< sizeof(dheader_t)/4 ; i++)\r
- ((int *)header)[i] = LittleLong ( ((int *)header)[i]);\r
-\r
- if (header->ident != IDBSPHEADER)\r
- Error ("%s is not a IBSP file", filename);\r
- if (header->version != BSPVERSION)\r
- Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);\r
-\r
- nummodels = CopyLump (LUMP_MODELS, dmodels, sizeof(dmodel_t));\r
- numvertexes = CopyLump (LUMP_VERTEXES, dvertexes, sizeof(dvertex_t));\r
- numplanes = CopyLump (LUMP_PLANES, dplanes, sizeof(dplane_t));\r
- numleafs = CopyLump (LUMP_LEAFS, dleafs, sizeof(dleaf_t));\r
- numnodes = CopyLump (LUMP_NODES, dnodes, sizeof(dnode_t));\r
- numtexinfo = CopyLump (LUMP_TEXINFO, texinfo, sizeof(texinfo_t));\r
- numfaces = CopyLump (LUMP_FACES, dfaces, sizeof(dface_t));\r
- numleaffaces = CopyLump (LUMP_LEAFFACES, dleaffaces, sizeof(dleaffaces[0]));\r
- numleafbrushes = CopyLump (LUMP_LEAFBRUSHES, dleafbrushes, sizeof(dleafbrushes[0]));\r
- numsurfedges = CopyLump (LUMP_SURFEDGES, dsurfedges, sizeof(dsurfedges[0]));\r
- numedges = CopyLump (LUMP_EDGES, dedges, sizeof(dedge_t));\r
- numbrushes = CopyLump (LUMP_BRUSHES, dbrushes, sizeof(dbrush_t));\r
- numbrushsides = CopyLump (LUMP_BRUSHSIDES, dbrushsides, sizeof(dbrushside_t));\r
- numareas = CopyLump (LUMP_AREAS, dareas, sizeof(darea_t));\r
- numareaportals = CopyLump (LUMP_AREAPORTALS, dareaportals, sizeof(dareaportal_t));\r
-\r
- visdatasize = CopyLump (LUMP_VISIBILITY, dvisdata, 1);\r
- lightdatasize = CopyLump (LUMP_LIGHTING, dlightdata, 1);\r
- entdatasize = CopyLump (LUMP_ENTITIES, dentdata, 1);\r
-\r
- CopyLump (LUMP_POP, dpop, 1);\r
-\r
- free (header); // everything has been copied out\r
- \r
-//\r
-// swap everything\r
-// \r
- SwapBSPFile (false);\r
-}\r
-\r
-\r
-/*\r
-=============\r
-LoadBSPFileTexinfo\r
-\r
-Only loads the texinfo lump, so qdata can scan for textures\r
-=============\r
-*/\r
-void LoadBSPFileTexinfo (char *filename)\r
-{\r
- int i;\r
- FILE *f;\r
- int length, ofs;\r
-\r
- header = malloc(sizeof(dheader_t));\r
-\r
- f = fopen (filename, "rb");\r
- fread (header, sizeof(dheader_t), 1, f);\r
-\r
-// swap the header\r
- for (i=0 ; i< sizeof(dheader_t)/4 ; i++)\r
- ((int *)header)[i] = LittleLong ( ((int *)header)[i]);\r
-\r
- if (header->ident != IDBSPHEADER)\r
- Error ("%s is not a IBSP file", filename);\r
- if (header->version != BSPVERSION)\r
- Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);\r
-\r
-\r
- length = header->lumps[LUMP_TEXINFO].filelen;\r
- ofs = header->lumps[LUMP_TEXINFO].fileofs;\r
-\r
- fseek (f, ofs, SEEK_SET);\r
- fread (texinfo, length, 1, f);\r
- fclose (f);\r
-\r
- numtexinfo = length / sizeof(texinfo_t);\r
-\r
- free (header); // everything has been copied out\r
- \r
- SwapBSPFile (false);\r
-}\r
-\r
-\r
-//============================================================================\r
-\r
-FILE *wadfile;\r
-dheader_t outheader;\r
-\r
-void AddLump (int lumpnum, void *data, int len)\r
-{\r
- lump_t *lump;\r
-\r
- lump = &header->lumps[lumpnum];\r
- \r
- lump->fileofs = LittleLong( ftell(wadfile) );\r
- lump->filelen = LittleLong(len);\r
- SafeWrite (wadfile, data, (len+3)&~3);\r
-}\r
-\r
-/*\r
-=============\r
-WriteBSPFile\r
-\r
-Swaps the bsp file in place, so it should not be referenced again\r
-=============\r
-*/\r
-void WriteBSPFile (char *filename)\r
-{ \r
- header = &outheader;\r
- memset (header, 0, sizeof(dheader_t));\r
- \r
- SwapBSPFile (true);\r
-\r
- header->ident = LittleLong (IDBSPHEADER);\r
- header->version = LittleLong (BSPVERSION);\r
- \r
- wadfile = SafeOpenWrite (filename);\r
- SafeWrite (wadfile, header, sizeof(dheader_t)); // overwritten later\r
-\r
- AddLump (LUMP_PLANES, dplanes, numplanes*sizeof(dplane_t));\r
- AddLump (LUMP_LEAFS, dleafs, numleafs*sizeof(dleaf_t));\r
- AddLump (LUMP_VERTEXES, dvertexes, numvertexes*sizeof(dvertex_t));\r
- AddLump (LUMP_NODES, dnodes, numnodes*sizeof(dnode_t));\r
- AddLump (LUMP_TEXINFO, texinfo, numtexinfo*sizeof(texinfo_t));\r
- AddLump (LUMP_FACES, dfaces, numfaces*sizeof(dface_t));\r
- AddLump (LUMP_BRUSHES, dbrushes, numbrushes*sizeof(dbrush_t));\r
- AddLump (LUMP_BRUSHSIDES, dbrushsides, numbrushsides*sizeof(dbrushside_t));\r
- AddLump (LUMP_LEAFFACES, dleaffaces, numleaffaces*sizeof(dleaffaces[0]));\r
- AddLump (LUMP_LEAFBRUSHES, dleafbrushes, numleafbrushes*sizeof(dleafbrushes[0]));\r
- AddLump (LUMP_SURFEDGES, dsurfedges, numsurfedges*sizeof(dsurfedges[0]));\r
- AddLump (LUMP_EDGES, dedges, numedges*sizeof(dedge_t));\r
- AddLump (LUMP_MODELS, dmodels, nummodels*sizeof(dmodel_t));\r
- AddLump (LUMP_AREAS, dareas, numareas*sizeof(darea_t));\r
- AddLump (LUMP_AREAPORTALS, dareaportals, numareaportals*sizeof(dareaportal_t));\r
-\r
- AddLump (LUMP_LIGHTING, dlightdata, lightdatasize);\r
- AddLump (LUMP_VISIBILITY, dvisdata, visdatasize);\r
- AddLump (LUMP_ENTITIES, dentdata, entdatasize);\r
- AddLump (LUMP_POP, dpop, sizeof(dpop));\r
- \r
- fseek (wadfile, 0, SEEK_SET);\r
- SafeWrite (wadfile, header, sizeof(dheader_t));\r
- fclose (wadfile); \r
-}\r
-\r
-//============================================================================\r
-\r
-/*\r
-=============\r
-PrintBSPFileSizes\r
-\r
-Dumps info about current file\r
-=============\r
-*/\r
-void PrintBSPFileSizes (void)\r
-{\r
- if (!num_entities)\r
- ParseEntities ();\r
-\r
- printf ("%5i models %7i\n"\r
- ,nummodels, (int)(nummodels*sizeof(dmodel_t)));\r
- printf ("%5i brushes %7i\n"\r
- ,numbrushes, (int)(numbrushes*sizeof(dbrush_t)));\r
- printf ("%5i brushsides %7i\n"\r
- ,numbrushsides, (int)(numbrushsides*sizeof(dbrushside_t)));\r
- printf ("%5i planes %7i\n"\r
- ,numplanes, (int)(numplanes*sizeof(dplane_t)));\r
- printf ("%5i texinfo %7i\n"\r
- ,numtexinfo, (int)(numtexinfo*sizeof(texinfo_t)));\r
- printf ("%5i entdata %7i\n", num_entities, entdatasize);\r
-\r
- printf ("\n");\r
-\r
- printf ("%5i vertexes %7i\n"\r
- ,numvertexes, (int)(numvertexes*sizeof(dvertex_t)));\r
- printf ("%5i nodes %7i\n"\r
- ,numnodes, (int)(numnodes*sizeof(dnode_t)));\r
- printf ("%5i faces %7i\n"\r
- ,numfaces, (int)(numfaces*sizeof(dface_t)));\r
- printf ("%5i leafs %7i\n"\r
- ,numleafs, (int)(numleafs*sizeof(dleaf_t)));\r
- printf ("%5i leaffaces %7i\n"\r
- ,numleaffaces, (int)(numleaffaces*sizeof(dleaffaces[0])));\r
- printf ("%5i leafbrushes %7i\n"\r
- ,numleafbrushes, (int)(numleafbrushes*sizeof(dleafbrushes[0])));\r
- printf ("%5i surfedges %7i\n"\r
- ,numsurfedges, (int)(numsurfedges*sizeof(dsurfedges[0])));\r
- printf ("%5i edges %7i\n"\r
- ,numedges, (int)(numedges*sizeof(dedge_t)));\r
- printf (" lightdata %7i\n", lightdatasize);\r
- printf (" visdata %7i\n", visdatasize);\r
-}\r
-\r
-\r
-//============================================\r
-\r
-int num_entities;\r
-entity_t entities[MAX_MAP_ENTITIES];\r
-\r
-void StripTrailing (char *e)\r
-{\r
- char *s;\r
-\r
- s = e + strlen(e)-1;\r
- while (s >= e && *s <= 32)\r
- {\r
- *s = 0;\r
- s--;\r
- }\r
-}\r
-\r
-/*\r
-=================\r
-ParseEpair\r
-=================\r
-*/\r
-epair_t *ParseEpair (void)\r
-{\r
- epair_t *e;\r
-\r
- e = malloc (sizeof(epair_t));\r
- memset (e, 0, sizeof(epair_t));\r
- \r
- if (strlen(token) >= MAX_KEY-1)\r
- Error ("ParseEpar: token too long");\r
- e->key = copystring(token);\r
- GetToken (false);\r
- if (strlen(token) >= MAX_VALUE-1)\r
- Error ("ParseEpar: token too long");\r
- e->value = copystring(token);\r
-\r
- // strip trailing spaces\r
- StripTrailing (e->key);\r
- StripTrailing (e->value);\r
-\r
- return e;\r
-}\r
-\r
-\r
-/*\r
-================\r
-ParseEntity\r
-================\r
-*/\r
-qboolean ParseEntity (void)\r
-{\r
- epair_t *e;\r
- entity_t *mapent;\r
-\r
- if (!GetToken (true))\r
- return false;\r
-\r
- if (strcmp (token, "{") )\r
- Error ("ParseEntity: { not found");\r
- \r
- if (num_entities == MAX_MAP_ENTITIES)\r
- Error ("num_entities == MAX_MAP_ENTITIES");\r
-\r
- mapent = &entities[num_entities];\r
- num_entities++;\r
-\r
- do\r
- {\r
- if (!GetToken (true))\r
- Error ("ParseEntity: EOF without closing brace");\r
- if (!strcmp (token, "}") )\r
- break;\r
- e = ParseEpair ();\r
- e->next = mapent->epairs;\r
- mapent->epairs = e;\r
- } while (1);\r
- \r
- return true;\r
-}\r
-\r
-/*\r
-================\r
-ParseEntities\r
-\r
-Parses the dentdata string into entities\r
-================\r
-*/\r
-void ParseEntities (void)\r
-{\r
- num_entities = 0;\r
- ParseFromMemory (dentdata, entdatasize);\r
-\r
- while (ParseEntity ())\r
- {\r
- } \r
-}\r
-\r
-\r
-/*\r
-================\r
-UnparseEntities\r
-\r
-Generates the dentdata string from all the entities\r
-================\r
-*/\r
-void UnparseEntities (void)\r
-{\r
- char *buf, *end;\r
- epair_t *ep;\r
- char line[2048];\r
- int i;\r
- char key[1024], value[1024];\r
-\r
- buf = dentdata;\r
- end = buf;\r
- *end = 0;\r
- \r
- for (i=0 ; i<num_entities ; i++)\r
- {\r
- ep = entities[i].epairs;\r
- if (!ep)\r
- continue; // ent got removed\r
- \r
- strcat (end,"{\n");\r
- end += 2;\r
- \r
- for (ep = entities[i].epairs ; ep ; ep=ep->next)\r
- {\r
- strcpy (key, ep->key);\r
- StripTrailing (key);\r
- strcpy (value, ep->value);\r
- StripTrailing (value);\r
- \r
- sprintf (line, "\"%s\" \"%s\"\n", key, value);\r
- strcat (end, line);\r
- end += strlen(line);\r
- }\r
- strcat (end,"}\n");\r
- end += 2;\r
-\r
- if (end > buf + MAX_MAP_ENTSTRING)\r
- Error ("Entity text too long");\r
- }\r
- entdatasize = end - buf + 1;\r
-}\r
-\r
-void PrintEntity (entity_t *ent)\r
-{\r
- epair_t *ep;\r
- \r
- printf ("------- entity %p -------\n", ent);\r
- for (ep=ent->epairs ; ep ; ep=ep->next)\r
- {\r
- printf ("%s = %s\n", ep->key, ep->value);\r
- }\r
-\r
-}\r
-\r
-void SetKeyValue (entity_t *ent, char *key, char *value)\r
-{\r
- epair_t *ep;\r
- \r
- for (ep=ent->epairs ; ep ; ep=ep->next)\r
- if (!strcmp (ep->key, key) )\r
- {\r
- free (ep->value);\r
- ep->value = copystring(value);\r
- return;\r
- }\r
- ep = malloc (sizeof(*ep));\r
- ep->next = ent->epairs;\r
- ent->epairs = ep;\r
- ep->key = copystring(key);\r
- ep->value = copystring(value);\r
-}\r
-\r
-char *ValueForKey (entity_t *ent, char *key)\r
-{\r
- epair_t *ep;\r
- \r
- for (ep=ent->epairs ; ep ; ep=ep->next)\r
- if (!strcmp (ep->key, key) )\r
- return ep->value;\r
- return "";\r
-}\r
-\r
-vec_t FloatForKey (entity_t *ent, char *key)\r
-{\r
- char *k;\r
- \r
- k = ValueForKey (ent, key);\r
- return atof(k);\r
-}\r
-\r
-void GetVectorForKey (entity_t *ent, char *key, vec3_t vec)\r
-{\r
- char *k;\r
- double v1, v2, v3;\r
-\r
- k = ValueForKey (ent, key);\r
-// scanf into doubles, then assign, so it is vec_t size independent\r
- v1 = v2 = v3 = 0;\r
- sscanf (k, "%lf %lf %lf", &v1, &v2, &v3);\r
- vec[0] = v1;\r
- vec[1] = v2;\r
- vec[2] = v3;\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 "cmdlib.h"
+#include "mathlib.h"
+#include "bspfile.h"
+#include "scriplib.h"
+#include "inout.h"
+
+void GetLeafNums (void);
+
+//=============================================================================
+
+int nummodels;
+dmodel_t dmodels[MAX_MAP_MODELS];
+
+int visdatasize;
+byte dvisdata[MAX_MAP_VISIBILITY];
+dvis_t *dvis = (dvis_t *)dvisdata;
+
+int lightdatasize;
+byte dlightdata[MAX_MAP_LIGHTING];
+
+int entdatasize;
+char dentdata[MAX_MAP_ENTSTRING];
+
+int numleafs;
+dleaf_t dleafs[MAX_MAP_LEAFS];
+
+int numplanes;
+dplane_t dplanes[MAX_MAP_PLANES];
+
+int numvertexes;
+dvertex_t dvertexes[MAX_MAP_VERTS];
+
+int numnodes;
+dnode_t dnodes[MAX_MAP_NODES];
+
+int numtexinfo;
+texinfo_t texinfo[MAX_MAP_TEXINFO];
+
+int numfaces;
+dface_t dfaces[MAX_MAP_FACES];
+
+int numedges;
+dedge_t dedges[MAX_MAP_EDGES];
+
+int numleaffaces;
+unsigned short dleaffaces[MAX_MAP_LEAFFACES];
+
+int numleafbrushes;
+unsigned short dleafbrushes[MAX_MAP_LEAFBRUSHES];
+
+int numsurfedges;
+int dsurfedges[MAX_MAP_SURFEDGES];
+
+int numbrushes;
+dbrush_t dbrushes[MAX_MAP_BRUSHES];
+
+int numbrushsides;
+dbrushside_t dbrushsides[MAX_MAP_BRUSHSIDES];
+
+int numareas;
+darea_t dareas[MAX_MAP_AREAS];
+
+int numareaportals;
+dareaportal_t dareaportals[MAX_MAP_AREAPORTALS];
+
+byte dpop[256];
+
+/*
+===============
+CompressVis
+
+===============
+*/
+int CompressVis (byte *vis, byte *dest)
+{
+ int j;
+ int rep;
+ int visrow;
+ byte *dest_p;
+
+ dest_p = dest;
+// visrow = (r_numvisleafs + 7)>>3;
+ visrow = (dvis->numclusters + 7)>>3;
+
+ for (j=0 ; j<visrow ; j++)
+ {
+ *dest_p++ = vis[j];
+ if (vis[j])
+ continue;
+
+ rep = 1;
+ for ( j++; j<visrow ; j++)
+ if (vis[j] || rep == 255)
+ break;
+ else
+ rep++;
+ *dest_p++ = rep;
+ j--;
+ }
+
+ return dest_p - dest;
+}
+
+
+/*
+===================
+DecompressVis
+===================
+*/
+void DecompressVis (byte *in, byte *decompressed)
+{
+ int c;
+ byte *out;
+ int row;
+
+// row = (r_numvisleafs+7)>>3;
+ row = (dvis->numclusters+7)>>3;
+ out = decompressed;
+
+ do
+ {
+ if (*in)
+ {
+ *out++ = *in++;
+ continue;
+ }
+
+ c = in[1];
+ if (!c)
+ Error ("DecompressVis: 0 repeat");
+ in += 2;
+ while (c)
+ {
+ *out++ = 0;
+ c--;
+ }
+ } while (out - decompressed < row);
+}
+
+//=============================================================================
+
+/*
+=============
+SwapBSPFile
+
+Byte swaps all data in a bsp file.
+=============
+*/
+void SwapBSPFile (qboolean todisk)
+{
+ int i, j;
+ dmodel_t *d;
+
+
+// models
+ for (i=0 ; i<nummodels ; i++)
+ {
+ d = &dmodels[i];
+
+ d->firstface = LittleLong (d->firstface);
+ d->numfaces = LittleLong (d->numfaces);
+ d->headnode = LittleLong (d->headnode);
+
+ 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<numvertexes ; i++)
+ {
+ for (j=0 ; j<3 ; j++)
+ dvertexes[i].point[j] = LittleFloat (dvertexes[i].point[j]);
+ }
+
+//
+// planes
+//
+ for (i=0 ; i<numplanes ; i++)
+ {
+ for (j=0 ; j<3 ; j++)
+ dplanes[i].normal[j] = LittleFloat (dplanes[i].normal[j]);
+ dplanes[i].dist = LittleFloat (dplanes[i].dist);
+ dplanes[i].type = LittleLong (dplanes[i].type);
+ }
+
+//
+// texinfos
+//
+ for (i=0 ; i<numtexinfo ; i++)
+ {
+ for (j=0 ; j<8 ; j++)
+ texinfo[i].vecs[0][j] = LittleFloat (texinfo[i].vecs[0][j]);
+ texinfo[i].flags = LittleLong (texinfo[i].flags);
+ texinfo[i].value = LittleLong (texinfo[i].value);
+ texinfo[i].nexttexinfo = LittleLong (texinfo[i].nexttexinfo);
+ }
+
+//
+// faces
+//
+ for (i=0 ; i<numfaces ; i++)
+ {
+ dfaces[i].texinfo = LittleShort (dfaces[i].texinfo);
+ dfaces[i].planenum = LittleShort (dfaces[i].planenum);
+ dfaces[i].side = LittleShort (dfaces[i].side);
+ dfaces[i].lightofs = LittleLong (dfaces[i].lightofs);
+ dfaces[i].firstedge = LittleLong (dfaces[i].firstedge);
+ dfaces[i].numedges = LittleShort (dfaces[i].numedges);
+ }
+
+//
+// nodes
+//
+ for (i=0 ; i<numnodes ; i++)
+ {
+ dnodes[i].planenum = LittleLong (dnodes[i].planenum);
+ for (j=0 ; j<3 ; j++)
+ {
+ dnodes[i].mins[j] = LittleShort (dnodes[i].mins[j]);
+ dnodes[i].maxs[j] = LittleShort (dnodes[i].maxs[j]);
+ }
+ dnodes[i].children[0] = LittleLong (dnodes[i].children[0]);
+ dnodes[i].children[1] = LittleLong (dnodes[i].children[1]);
+ dnodes[i].firstface = LittleShort (dnodes[i].firstface);
+ dnodes[i].numfaces = LittleShort (dnodes[i].numfaces);
+ }
+
+//
+// leafs
+//
+ for (i=0 ; i<numleafs ; i++)
+ {
+ dleafs[i].contents = LittleLong (dleafs[i].contents);
+ dleafs[i].cluster = LittleShort (dleafs[i].cluster);
+ dleafs[i].area = LittleShort (dleafs[i].area);
+ for (j=0 ; j<3 ; j++)
+ {
+ dleafs[i].mins[j] = LittleShort (dleafs[i].mins[j]);
+ dleafs[i].maxs[j] = LittleShort (dleafs[i].maxs[j]);
+ }
+
+ dleafs[i].firstleafface = LittleShort (dleafs[i].firstleafface);
+ dleafs[i].numleaffaces = LittleShort (dleafs[i].numleaffaces);
+ dleafs[i].firstleafbrush = LittleShort (dleafs[i].firstleafbrush);
+ dleafs[i].numleafbrushes = LittleShort (dleafs[i].numleafbrushes);
+ }
+
+//
+// leaffaces
+//
+ for (i=0 ; i<numleaffaces ; i++)
+ dleaffaces[i] = LittleShort (dleaffaces[i]);
+
+//
+// leafbrushes
+//
+ for (i=0 ; i<numleafbrushes ; i++)
+ dleafbrushes[i] = LittleShort (dleafbrushes[i]);
+
+//
+// surfedges
+//
+ for (i=0 ; i<numsurfedges ; i++)
+ dsurfedges[i] = LittleLong (dsurfedges[i]);
+
+//
+// edges
+//
+ for (i=0 ; i<numedges ; i++)
+ {
+ dedges[i].v[0] = LittleShort (dedges[i].v[0]);
+ dedges[i].v[1] = LittleShort (dedges[i].v[1]);
+ }
+
+//
+// brushes
+//
+ for (i=0 ; i<numbrushes ; i++)
+ {
+ dbrushes[i].firstside = LittleLong (dbrushes[i].firstside);
+ dbrushes[i].numsides = LittleLong (dbrushes[i].numsides);
+ dbrushes[i].contents = LittleLong (dbrushes[i].contents);
+ }
+
+//
+// areas
+//
+ for (i=0 ; i<numareas ; i++)
+ {
+ dareas[i].numareaportals = LittleLong (dareas[i].numareaportals);
+ dareas[i].firstareaportal = LittleLong (dareas[i].firstareaportal);
+ }
+
+//
+// areasportals
+//
+ for (i=0 ; i<numareaportals ; i++)
+ {
+ dareaportals[i].portalnum = LittleLong (dareaportals[i].portalnum);
+ dareaportals[i].otherarea = LittleLong (dareaportals[i].otherarea);
+ }
+
+//
+// brushsides
+//
+ for (i=0 ; i<numbrushsides ; i++)
+ {
+ dbrushsides[i].planenum = LittleShort (dbrushsides[i].planenum);
+ dbrushsides[i].texinfo = LittleShort (dbrushsides[i].texinfo);
+ }
+
+//
+// visibility
+//
+ if (todisk)
+ j = dvis->numclusters;
+ else
+ j = LittleLong(dvis->numclusters);
+ dvis->numclusters = LittleLong (dvis->numclusters);
+ for (i=0 ; i<j ; i++)
+ {
+ dvis->bitofs[i][0] = LittleLong (dvis->bitofs[i][0]);
+ dvis->bitofs[i][1] = LittleLong (dvis->bitofs[i][1]);
+ }
+}
+
+
+dheader_t *header;
+
+int CopyLump (int lump, void *dest, int size)
+{
+ int length, ofs;
+
+ length = header->lumps[lump].filelen;
+ ofs = header->lumps[lump].fileofs;
+
+ if (length % size)
+ Error ("LoadBSPFile: odd lump size");
+
+ memcpy (dest, (byte *)header + ofs, length);
+
+ return length / size;
+}
+
+/*
+=============
+LoadBSPFile
+=============
+*/
+void LoadBSPFile (char *filename)
+{
+ int i;
+
+//
+// load the file header
+//
+ LoadFile (filename, (void **)&header);
+
+// swap the header
+ for (i=0 ; i< sizeof(dheader_t)/4 ; i++)
+ ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
+
+ if (header->ident != IDBSPHEADER)
+ Error ("%s is not a IBSP file", filename);
+ if (header->version != BSPVERSION)
+ Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);
+
+ nummodels = CopyLump (LUMP_MODELS, dmodels, sizeof(dmodel_t));
+ numvertexes = CopyLump (LUMP_VERTEXES, dvertexes, sizeof(dvertex_t));
+ numplanes = CopyLump (LUMP_PLANES, dplanes, sizeof(dplane_t));
+ numleafs = CopyLump (LUMP_LEAFS, dleafs, sizeof(dleaf_t));
+ numnodes = CopyLump (LUMP_NODES, dnodes, sizeof(dnode_t));
+ numtexinfo = CopyLump (LUMP_TEXINFO, texinfo, sizeof(texinfo_t));
+ numfaces = CopyLump (LUMP_FACES, dfaces, sizeof(dface_t));
+ numleaffaces = CopyLump (LUMP_LEAFFACES, dleaffaces, sizeof(dleaffaces[0]));
+ numleafbrushes = CopyLump (LUMP_LEAFBRUSHES, dleafbrushes, sizeof(dleafbrushes[0]));
+ numsurfedges = CopyLump (LUMP_SURFEDGES, dsurfedges, sizeof(dsurfedges[0]));
+ numedges = CopyLump (LUMP_EDGES, dedges, sizeof(dedge_t));
+ numbrushes = CopyLump (LUMP_BRUSHES, dbrushes, sizeof(dbrush_t));
+ numbrushsides = CopyLump (LUMP_BRUSHSIDES, dbrushsides, sizeof(dbrushside_t));
+ numareas = CopyLump (LUMP_AREAS, dareas, sizeof(darea_t));
+ numareaportals = CopyLump (LUMP_AREAPORTALS, dareaportals, sizeof(dareaportal_t));
+
+ visdatasize = CopyLump (LUMP_VISIBILITY, dvisdata, 1);
+ lightdatasize = CopyLump (LUMP_LIGHTING, dlightdata, 1);
+ entdatasize = CopyLump (LUMP_ENTITIES, dentdata, 1);
+
+ CopyLump (LUMP_POP, dpop, 1);
+
+ free (header); // everything has been copied out
+
+//
+// swap everything
+//
+ SwapBSPFile (false);
+}
+
+
+/*
+=============
+LoadBSPFileTexinfo
+
+Only loads the texinfo lump, so qdata can scan for textures
+=============
+*/
+void LoadBSPFileTexinfo (char *filename)
+{
+ int i;
+ FILE *f;
+ int length, ofs;
+
+ header = malloc(sizeof(dheader_t));
+
+ f = fopen (filename, "rb");
+ fread (header, sizeof(dheader_t), 1, f);
+
+// swap the header
+ for (i=0 ; i< sizeof(dheader_t)/4 ; i++)
+ ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
+
+ if (header->ident != IDBSPHEADER)
+ Error ("%s is not a IBSP file", filename);
+ if (header->version != BSPVERSION)
+ Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);
+
+
+ length = header->lumps[LUMP_TEXINFO].filelen;
+ ofs = header->lumps[LUMP_TEXINFO].fileofs;
+
+ fseek (f, ofs, SEEK_SET);
+ fread (texinfo, length, 1, f);
+ fclose (f);
+
+ numtexinfo = length / sizeof(texinfo_t);
+
+ free (header); // everything has been copied out
+
+ SwapBSPFile (false);
+}
+
+
+//============================================================================
+
+FILE *wadfile;
+dheader_t outheader;
+
+void AddLump (int lumpnum, void *data, int len)
+{
+ lump_t *lump;
+
+ lump = &header->lumps[lumpnum];
+
+ lump->fileofs = LittleLong( ftell(wadfile) );
+ lump->filelen = LittleLong(len);
+ SafeWrite (wadfile, data, (len+3)&~3);
+}
+
+/*
+=============
+WriteBSPFile
+
+Swaps the bsp file in place, so it should not be referenced again
+=============
+*/
+void WriteBSPFile (char *filename)
+{
+ header = &outheader;
+ memset (header, 0, sizeof(dheader_t));
+
+ SwapBSPFile (true);
+
+ header->ident = LittleLong (IDBSPHEADER);
+ header->version = LittleLong (BSPVERSION);
+
+ wadfile = SafeOpenWrite (filename);
+ SafeWrite (wadfile, header, sizeof(dheader_t)); // overwritten later
+
+ AddLump (LUMP_PLANES, dplanes, numplanes*sizeof(dplane_t));
+ AddLump (LUMP_LEAFS, dleafs, numleafs*sizeof(dleaf_t));
+ AddLump (LUMP_VERTEXES, dvertexes, numvertexes*sizeof(dvertex_t));
+ AddLump (LUMP_NODES, dnodes, numnodes*sizeof(dnode_t));
+ AddLump (LUMP_TEXINFO, texinfo, numtexinfo*sizeof(texinfo_t));
+ AddLump (LUMP_FACES, dfaces, numfaces*sizeof(dface_t));
+ AddLump (LUMP_BRUSHES, dbrushes, numbrushes*sizeof(dbrush_t));
+ AddLump (LUMP_BRUSHSIDES, dbrushsides, numbrushsides*sizeof(dbrushside_t));
+ AddLump (LUMP_LEAFFACES, dleaffaces, numleaffaces*sizeof(dleaffaces[0]));
+ AddLump (LUMP_LEAFBRUSHES, dleafbrushes, numleafbrushes*sizeof(dleafbrushes[0]));
+ AddLump (LUMP_SURFEDGES, dsurfedges, numsurfedges*sizeof(dsurfedges[0]));
+ AddLump (LUMP_EDGES, dedges, numedges*sizeof(dedge_t));
+ AddLump (LUMP_MODELS, dmodels, nummodels*sizeof(dmodel_t));
+ AddLump (LUMP_AREAS, dareas, numareas*sizeof(darea_t));
+ AddLump (LUMP_AREAPORTALS, dareaportals, numareaportals*sizeof(dareaportal_t));
+
+ AddLump (LUMP_LIGHTING, dlightdata, lightdatasize);
+ AddLump (LUMP_VISIBILITY, dvisdata, visdatasize);
+ AddLump (LUMP_ENTITIES, dentdata, entdatasize);
+ AddLump (LUMP_POP, dpop, sizeof(dpop));
+
+ fseek (wadfile, 0, SEEK_SET);
+ SafeWrite (wadfile, header, sizeof(dheader_t));
+ fclose (wadfile);
+}
+
+//============================================================================
+
+/*
+=============
+PrintBSPFileSizes
+
+Dumps info about current file
+=============
+*/
+void PrintBSPFileSizes (void)
+{
+ if (!num_entities)
+ ParseEntities ();
+
+ printf ("%5i models %7i\n"
+ ,nummodels, (int)(nummodels*sizeof(dmodel_t)));
+ printf ("%5i brushes %7i\n"
+ ,numbrushes, (int)(numbrushes*sizeof(dbrush_t)));
+ printf ("%5i brushsides %7i\n"
+ ,numbrushsides, (int)(numbrushsides*sizeof(dbrushside_t)));
+ printf ("%5i planes %7i\n"
+ ,numplanes, (int)(numplanes*sizeof(dplane_t)));
+ printf ("%5i texinfo %7i\n"
+ ,numtexinfo, (int)(numtexinfo*sizeof(texinfo_t)));
+ printf ("%5i entdata %7i\n", num_entities, entdatasize);
+
+ printf ("\n");
+
+ printf ("%5i vertexes %7i\n"
+ ,numvertexes, (int)(numvertexes*sizeof(dvertex_t)));
+ printf ("%5i nodes %7i\n"
+ ,numnodes, (int)(numnodes*sizeof(dnode_t)));
+ printf ("%5i faces %7i\n"
+ ,numfaces, (int)(numfaces*sizeof(dface_t)));
+ printf ("%5i leafs %7i\n"
+ ,numleafs, (int)(numleafs*sizeof(dleaf_t)));
+ printf ("%5i leaffaces %7i\n"
+ ,numleaffaces, (int)(numleaffaces*sizeof(dleaffaces[0])));
+ printf ("%5i leafbrushes %7i\n"
+ ,numleafbrushes, (int)(numleafbrushes*sizeof(dleafbrushes[0])));
+ printf ("%5i surfedges %7i\n"
+ ,numsurfedges, (int)(numsurfedges*sizeof(dsurfedges[0])));
+ printf ("%5i edges %7i\n"
+ ,numedges, (int)(numedges*sizeof(dedge_t)));
+ printf (" lightdata %7i\n", lightdatasize);
+ printf (" visdata %7i\n", visdatasize);
+}
+
+
+//============================================
+
+int num_entities;
+entity_t entities[MAX_MAP_ENTITIES];
+
+void StripTrailing (char *e)
+{
+ char *s;
+
+ s = e + strlen(e)-1;
+ while (s >= e && *s <= 32)
+ {
+ *s = 0;
+ s--;
+ }
+}
+
+/*
+=================
+ParseEpair
+=================
+*/
+epair_t *ParseEpair (void)
+{
+ epair_t *e;
+
+ e = malloc (sizeof(epair_t));
+ memset (e, 0, sizeof(epair_t));
+
+ if (strlen(token) >= MAX_KEY-1)
+ Error ("ParseEpar: token too long");
+ e->key = copystring(token);
+ GetToken (false);
+ if (strlen(token) >= MAX_VALUE-1)
+ Error ("ParseEpar: token too long");
+ e->value = copystring(token);
+
+ // strip trailing spaces
+ StripTrailing (e->key);
+ StripTrailing (e->value);
+
+ return e;
+}
+
+
+/*
+================
+ParseEntity
+================
+*/
+qboolean ParseEntity (void)
+{
+ epair_t *e;
+ entity_t *mapent;
+
+ if (!GetToken (true))
+ return false;
+
+ if (strcmp (token, "{") )
+ Error ("ParseEntity: { not found");
+
+ if (num_entities == MAX_MAP_ENTITIES)
+ Error ("num_entities == MAX_MAP_ENTITIES");
+
+ mapent = &entities[num_entities];
+ num_entities++;
+
+ do
+ {
+ if (!GetToken (true))
+ Error ("ParseEntity: EOF without closing brace");
+ if (!strcmp (token, "}") )
+ break;
+ e = ParseEpair ();
+ e->next = mapent->epairs;
+ mapent->epairs = e;
+ } while (1);
+
+ return true;
+}
+
+/*
+================
+ParseEntities
+
+Parses the dentdata string into entities
+================
+*/
+void ParseEntities (void)
+{
+ num_entities = 0;
+ ParseFromMemory (dentdata, entdatasize);
+
+ while (ParseEntity ())
+ {
+ }
+}
+
+
+/*
+================
+UnparseEntities
+
+Generates the dentdata string from all the entities
+================
+*/
+void UnparseEntities (void)
+{
+ char *buf, *end;
+ epair_t *ep;
+ char line[2048];
+ int i;
+ char key[1024], value[1024];
+
+ buf = dentdata;
+ end = buf;
+ *end = 0;
+
+ for (i=0 ; i<num_entities ; i++)
+ {
+ ep = entities[i].epairs;
+ if (!ep)
+ continue; // ent got removed
+
+ strcat (end,"{\n");
+ end += 2;
+
+ for (ep = entities[i].epairs ; ep ; ep=ep->next)
+ {
+ strcpy (key, ep->key);
+ StripTrailing (key);
+ strcpy (value, ep->value);
+ StripTrailing (value);
+
+ sprintf (line, "\"%s\" \"%s\"\n", key, value);
+ strcat (end, line);
+ end += strlen(line);
+ }
+ strcat (end,"}\n");
+ end += 2;
+
+ if (end > buf + MAX_MAP_ENTSTRING)
+ Error ("Entity text too long");
+ }
+ entdatasize = end - buf + 1;
+}
+
+void PrintEntity (entity_t *ent)
+{
+ epair_t *ep;
+
+ printf ("------- entity %p -------\n", ent);
+ for (ep=ent->epairs ; ep ; ep=ep->next)
+ {
+ printf ("%s = %s\n", ep->key, ep->value);
+ }
+
+}
+
+void SetKeyValue (entity_t *ent, char *key, char *value)
+{
+ epair_t *ep;
+
+ for (ep=ent->epairs ; ep ; ep=ep->next)
+ if (!strcmp (ep->key, key) )
+ {
+ free (ep->value);
+ ep->value = copystring(value);
+ return;
+ }
+ ep = malloc (sizeof(*ep));
+ ep->next = ent->epairs;
+ ent->epairs = ep;
+ ep->key = copystring(key);
+ ep->value = copystring(value);
+}
+
+char *ValueForKey (entity_t *ent, char *key)
+{
+ epair_t *ep;
+
+ for (ep=ent->epairs ; ep ; ep=ep->next)
+ if (!strcmp (ep->key, key) )
+ return ep->value;
+ return "";
+}
+
+vec_t FloatForKey (entity_t *ent, char *key)
+{
+ char *k;
+
+ k = ValueForKey (ent, key);
+ return atof(k);
+}
+
+void GetVectorForKey (entity_t *ent, char *key, vec3_t vec)
+{
+ char *k;
+ double v1, v2, v3;
+
+ k = ValueForKey (ent, key);
+// scanf into doubles, then assign, so it is vec_t size independent
+ v1 = v2 = v3 = 0;
+ sscanf (k, "%lf %lf %lf", &v1, &v2, &v3);
+ vec[0] = v1;
+ vec[1] = v2;
+ vec[2] = v3;
+}
+
+
projects / xonotic / netradiant.git / blobdiff