2 Copyright (C) 1999-2007 id Software, Inc. and contributors.
\r
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
\r
5 This file is part of GtkRadiant.
\r
7 GtkRadiant is free software; you can redistribute it and/or modify
\r
8 it under the terms of the GNU General Public License as published by
\r
9 the Free Software Foundation; either version 2 of the License, or
\r
10 (at your option) any later version.
\r
12 GtkRadiant is distributed in the hope that it will be useful,
\r
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
15 GNU General Public License for more details.
\r
17 You should have received a copy of the GNU General Public License
\r
18 along with GtkRadiant; if not, write to the Free Software
\r
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
\r
25 #include "mathlib.h"
\r
26 #include "bspfile.h"
\r
27 #include "scriplib.h"
\r
29 void GetLeafNums (void);
\r
31 //=============================================================================
\r
34 dmodel_t dmodels[MAX_MAP_MODELS];
\r
37 byte dvisdata[MAX_MAP_VISIBILITY];
\r
38 dvis_t *dvis = (dvis_t *)dvisdata;
\r
41 byte dlightdata[MAX_MAP_LIGHTING];
\r
44 char dentdata[MAX_MAP_ENTSTRING];
\r
47 dleaf_t dleafs[MAX_MAP_LEAFS];
\r
50 dplane_t dplanes[MAX_MAP_PLANES];
\r
53 dvertex_t dvertexes[MAX_MAP_VERTS];
\r
56 dnode_t dnodes[MAX_MAP_NODES];
\r
59 texinfo_t texinfo[MAX_MAP_TEXINFO];
\r
62 dface_t dfaces[MAX_MAP_FACES];
\r
65 dedge_t dedges[MAX_MAP_EDGES];
\r
68 unsigned short dleaffaces[MAX_MAP_LEAFFACES];
\r
71 unsigned short dleafbrushes[MAX_MAP_LEAFBRUSHES];
\r
74 int dsurfedges[MAX_MAP_SURFEDGES];
\r
77 dbrush_t dbrushes[MAX_MAP_BRUSHES];
\r
80 dbrushside_t dbrushsides[MAX_MAP_BRUSHSIDES];
\r
83 darea_t dareas[MAX_MAP_AREAS];
\r
86 dareaportal_t dareaportals[MAX_MAP_AREAPORTALS];
\r
96 int CompressVis (byte *vis, byte *dest)
\r
104 // visrow = (r_numvisleafs + 7)>>3;
\r
105 visrow = (dvis->numclusters + 7)>>3;
\r
107 for (j=0 ; j<visrow ; j++)
\r
109 *dest_p++ = vis[j];
\r
114 for ( j++; j<visrow ; j++)
\r
115 if (vis[j] || rep == 255)
\r
123 return dest_p - dest;
\r
128 ===================
\r
130 ===================
\r
132 void DecompressVis (byte *in, byte *decompressed)
\r
138 // row = (r_numvisleafs+7)>>3;
\r
139 row = (dvis->numclusters+7)>>3;
\r
140 out = decompressed;
\r
152 Error ("DecompressVis: 0 repeat");
\r
159 } while (out - decompressed < row);
\r
162 //=============================================================================
\r
168 Byte swaps all data in a bsp file.
\r
171 void SwapBSPFile (qboolean todisk)
\r
178 for (i=0 ; i<nummodels ; i++)
\r
182 d->firstface = LittleLong (d->firstface);
\r
183 d->numfaces = LittleLong (d->numfaces);
\r
184 d->headnode = LittleLong (d->headnode);
\r
186 for (j=0 ; j<3 ; j++)
\r
188 d->mins[j] = LittleFloat(d->mins[j]);
\r
189 d->maxs[j] = LittleFloat(d->maxs[j]);
\r
190 d->origin[j] = LittleFloat(d->origin[j]);
\r
197 for (i=0 ; i<numvertexes ; i++)
\r
199 for (j=0 ; j<3 ; j++)
\r
200 dvertexes[i].point[j] = LittleFloat (dvertexes[i].point[j]);
\r
206 for (i=0 ; i<numplanes ; i++)
\r
208 for (j=0 ; j<3 ; j++)
\r
209 dplanes[i].normal[j] = LittleFloat (dplanes[i].normal[j]);
\r
210 dplanes[i].dist = LittleFloat (dplanes[i].dist);
\r
211 dplanes[i].type = LittleLong (dplanes[i].type);
\r
217 for (i=0 ; i<numtexinfo ; i++)
\r
219 for (j=0 ; j<8 ; j++)
\r
220 texinfo[i].vecs[0][j] = LittleFloat (texinfo[i].vecs[0][j]);
\r
221 texinfo[i].flags = LittleLong (texinfo[i].flags);
\r
222 texinfo[i].value = LittleLong (texinfo[i].value);
\r
223 texinfo[i].nexttexinfo = LittleLong (texinfo[i].nexttexinfo);
\r
229 for (i=0 ; i<numfaces ; i++)
\r
231 dfaces[i].texinfo = LittleShort (dfaces[i].texinfo);
\r
232 dfaces[i].planenum = LittleShort (dfaces[i].planenum);
\r
233 dfaces[i].side = LittleShort (dfaces[i].side);
\r
234 dfaces[i].lighting.c = LittleLong (dfaces[i].lighting.c);
\r
235 dfaces[i].lightofs = LittleLong (dfaces[i].lightofs);
\r
236 dfaces[i].firstedge = LittleLong (dfaces[i].firstedge);
\r
237 dfaces[i].numedges = LittleShort (dfaces[i].numedges);
\r
243 for (i=0 ; i<numnodes ; i++)
\r
245 dnodes[i].planenum = LittleLong (dnodes[i].planenum);
\r
246 for (j=0 ; j<3 ; j++)
\r
248 dnodes[i].mins[j] = LittleShort (dnodes[i].mins[j]);
\r
249 dnodes[i].maxs[j] = LittleShort (dnodes[i].maxs[j]);
\r
251 dnodes[i].children[0] = LittleLong (dnodes[i].children[0]);
\r
252 dnodes[i].children[1] = LittleLong (dnodes[i].children[1]);
\r
253 dnodes[i].firstface = LittleShort (dnodes[i].firstface);
\r
254 dnodes[i].numfaces = LittleShort (dnodes[i].numfaces);
\r
260 for (i=0 ; i<numleafs ; i++)
\r
262 dleafs[i].contents = LittleLong (dleafs[i].contents);
\r
263 dleafs[i].cluster = LittleShort (dleafs[i].cluster);
\r
264 dleafs[i].area = LittleShort (dleafs[i].area);
\r
265 for (j=0 ; j<3 ; j++)
\r
267 dleafs[i].mins[j] = LittleShort (dleafs[i].mins[j]);
\r
268 dleafs[i].maxs[j] = LittleShort (dleafs[i].maxs[j]);
\r
271 dleafs[i].firstleafface = LittleShort (dleafs[i].firstleafface);
\r
272 dleafs[i].numleaffaces = LittleShort (dleafs[i].numleaffaces);
\r
273 dleafs[i].firstleafbrush = LittleShort (dleafs[i].firstleafbrush);
\r
274 dleafs[i].numleafbrushes = LittleShort (dleafs[i].numleafbrushes);
\r
280 for (i=0 ; i<numleaffaces ; i++)
\r
281 dleaffaces[i] = LittleShort (dleaffaces[i]);
\r
286 for (i=0 ; i<numleafbrushes ; i++)
\r
287 dleafbrushes[i] = LittleShort (dleafbrushes[i]);
\r
292 for (i=0 ; i<numsurfedges ; i++)
\r
293 dsurfedges[i] = LittleLong (dsurfedges[i]);
\r
298 for (i=0 ; i<numedges ; i++)
\r
300 dedges[i].v[0] = LittleShort (dedges[i].v[0]);
\r
301 dedges[i].v[1] = LittleShort (dedges[i].v[1]);
\r
307 for (i=0 ; i<numbrushes ; i++)
\r
309 dbrushes[i].firstside = LittleLong (dbrushes[i].firstside);
\r
310 dbrushes[i].numsides = LittleLong (dbrushes[i].numsides);
\r
311 dbrushes[i].contents = LittleLong (dbrushes[i].contents);
\r
317 for (i=0 ; i<numareas ; i++)
\r
319 dareas[i].numareaportals = LittleLong (dareas[i].numareaportals);
\r
320 dareas[i].firstareaportal = LittleLong (dareas[i].firstareaportal);
\r
326 for (i=0 ; i<numareaportals ; i++)
\r
328 dareaportals[i].portalnum = LittleLong (dareaportals[i].portalnum);
\r
329 dareaportals[i].otherarea = LittleLong (dareaportals[i].otherarea);
\r
335 for (i=0 ; i<numbrushsides ; i++)
\r
337 dbrushsides[i].planenum = LittleShort (dbrushsides[i].planenum);
\r
338 dbrushsides[i].texinfo = LittleShort (dbrushsides[i].texinfo);
\r
345 j = dvis->numclusters;
\r
347 j = LittleLong(dvis->numclusters);
\r
348 dvis->numclusters = LittleLong (dvis->numclusters);
\r
349 for (i=0 ; i<j ; i++)
\r
351 dvis->bitofs[i][0] = LittleLong (dvis->bitofs[i][0]);
\r
352 dvis->bitofs[i][1] = LittleLong (dvis->bitofs[i][1]);
\r
359 int CopyLump (int lump, void *dest, int size)
\r
363 length = header->lumps[lump].filelen;
\r
364 ofs = header->lumps[lump].fileofs;
\r
367 Error ("LoadBSPFile: odd lump size");
\r
369 memcpy (dest, (byte *)header + ofs, length);
\r
371 return length / size;
\r
379 void LoadBSPFile (char *filename)
\r
384 // load the file header
\r
386 LoadFile (filename, (void **)&header);
\r
389 for (i=0 ; i< sizeof(dheader_t)/4 ; i++)
\r
390 ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
\r
392 if (header->ident != IDBSPHEADER)
\r
393 Error ("%s is not a IBSP file", filename);
\r
394 if (header->version != BSPVERSION)
\r
395 Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);
\r
397 nummodels = CopyLump (LUMP_MODELS, dmodels, sizeof(dmodel_t));
\r
398 numvertexes = CopyLump (LUMP_VERTEXES, dvertexes, sizeof(dvertex_t));
\r
399 numplanes = CopyLump (LUMP_PLANES, dplanes, sizeof(dplane_t));
\r
400 numleafs = CopyLump (LUMP_LEAFS, dleafs, sizeof(dleaf_t));
\r
401 numnodes = CopyLump (LUMP_NODES, dnodes, sizeof(dnode_t));
\r
402 numtexinfo = CopyLump (LUMP_TEXINFO, texinfo, sizeof(texinfo_t));
\r
403 numfaces = CopyLump (LUMP_FACES, dfaces, sizeof(dface_t));
\r
404 numleaffaces = CopyLump (LUMP_LEAFFACES, dleaffaces, sizeof(dleaffaces[0]));
\r
405 numleafbrushes = CopyLump (LUMP_LEAFBRUSHES, dleafbrushes, sizeof(dleafbrushes[0]));
\r
406 numsurfedges = CopyLump (LUMP_SURFEDGES, dsurfedges, sizeof(dsurfedges[0]));
\r
407 numedges = CopyLump (LUMP_EDGES, dedges, sizeof(dedge_t));
\r
408 numbrushes = CopyLump (LUMP_BRUSHES, dbrushes, sizeof(dbrush_t));
\r
409 numbrushsides = CopyLump (LUMP_BRUSHSIDES, dbrushsides, sizeof(dbrushside_t));
\r
410 numareas = CopyLump (LUMP_AREAS, dareas, sizeof(darea_t));
\r
411 numareaportals = CopyLump (LUMP_AREAPORTALS, dareaportals, sizeof(dareaportal_t));
\r
413 visdatasize = CopyLump (LUMP_VISIBILITY, dvisdata, 1);
\r
414 lightdatasize = CopyLump (LUMP_LIGHTING, dlightdata, 1);
\r
415 entdatasize = CopyLump (LUMP_ENTITIES, dentdata, 1);
\r
417 CopyLump (LUMP_POP, dpop, 1);
\r
419 free (header); // everything has been copied out
\r
424 SwapBSPFile (false);
\r
432 Only loads the texinfo lump, so qdata can scan for textures
\r
435 void LoadBSPFileTexinfo (char *filename)
\r
441 header = malloc(sizeof(dheader_t));
\r
443 f = fopen (filename, "rb");
\r
444 fread (header, sizeof(dheader_t), 1, f);
\r
447 for (i=0 ; i< sizeof(dheader_t)/4 ; i++)
\r
448 ((int *)header)[i] = LittleLong ( ((int *)header)[i]);
\r
450 if (header->ident != IDBSPHEADER)
\r
451 Error ("%s is not a IBSP file", filename);
\r
452 if (header->version != BSPVERSION)
\r
453 Error ("%s is version %i, not %i", filename, header->version, BSPVERSION);
\r
456 length = header->lumps[LUMP_TEXINFO].filelen;
\r
457 ofs = header->lumps[LUMP_TEXINFO].fileofs;
\r
459 fseek (f, ofs, SEEK_SET);
\r
460 fread (texinfo, length, 1, f);
\r
463 numtexinfo = length / sizeof(texinfo_t);
\r
465 free (header); // everything has been copied out
\r
467 SwapBSPFile (false);
\r
471 //============================================================================
\r
474 dheader_t outheader;
\r
476 void AddLump (int lumpnum, void *data, int len)
\r
480 lump = &header->lumps[lumpnum];
\r
482 lump->fileofs = LittleLong( ftell(wadfile) );
\r
483 lump->filelen = LittleLong(len);
\r
484 SafeWrite (wadfile, data, (len+3)&~3);
\r
491 Swaps the bsp file in place, so it should not be referenced again
\r
494 void WriteBSPFile (char *filename)
\r
496 header = &outheader;
\r
497 memset (header, 0, sizeof(dheader_t));
\r
499 SwapBSPFile (true);
\r
501 header->ident = LittleLong (IDBSPHEADER);
\r
502 header->version = LittleLong (BSPVERSION);
\r
504 wadfile = SafeOpenWrite (filename);
\r
505 SafeWrite (wadfile, header, sizeof(dheader_t)); // overwritten later
\r
507 AddLump (LUMP_PLANES, dplanes, numplanes*sizeof(dplane_t));
\r
508 AddLump (LUMP_LEAFS, dleafs, numleafs*sizeof(dleaf_t));
\r
509 AddLump (LUMP_VERTEXES, dvertexes, numvertexes*sizeof(dvertex_t));
\r
510 AddLump (LUMP_NODES, dnodes, numnodes*sizeof(dnode_t));
\r
511 AddLump (LUMP_TEXINFO, texinfo, numtexinfo*sizeof(texinfo_t));
\r
512 AddLump (LUMP_FACES, dfaces, numfaces*sizeof(dface_t));
\r
513 AddLump (LUMP_BRUSHES, dbrushes, numbrushes*sizeof(dbrush_t));
\r
514 AddLump (LUMP_BRUSHSIDES, dbrushsides, numbrushsides*sizeof(dbrushside_t));
\r
515 AddLump (LUMP_LEAFFACES, dleaffaces, numleaffaces*sizeof(dleaffaces[0]));
\r
516 AddLump (LUMP_LEAFBRUSHES, dleafbrushes, numleafbrushes*sizeof(dleafbrushes[0]));
\r
517 AddLump (LUMP_SURFEDGES, dsurfedges, numsurfedges*sizeof(dsurfedges[0]));
\r
518 AddLump (LUMP_EDGES, dedges, numedges*sizeof(dedge_t));
\r
519 AddLump (LUMP_MODELS, dmodels, nummodels*sizeof(dmodel_t));
\r
520 AddLump (LUMP_AREAS, dareas, numareas*sizeof(darea_t));
\r
521 AddLump (LUMP_AREAPORTALS, dareaportals, numareaportals*sizeof(dareaportal_t));
\r
523 AddLump (LUMP_LIGHTING, dlightdata, lightdatasize);
\r
524 AddLump (LUMP_VISIBILITY, dvisdata, visdatasize);
\r
525 AddLump (LUMP_ENTITIES, dentdata, entdatasize);
\r
526 AddLump (LUMP_POP, dpop, sizeof(dpop));
\r
528 fseek (wadfile, 0, SEEK_SET);
\r
529 SafeWrite (wadfile, header, sizeof(dheader_t));
\r
533 //============================================================================
\r
539 Dumps info about current file
\r
542 void PrintBSPFileSizes (void)
\r
547 printf ("%5i models %7i\n"
\r
548 ,nummodels, (int)(nummodels*sizeof(dmodel_t)));
\r
549 printf ("%5i brushes %7i\n"
\r
550 ,numbrushes, (int)(numbrushes*sizeof(dbrush_t)));
\r
551 printf ("%5i brushsides %7i\n"
\r
552 ,numbrushsides, (int)(numbrushsides*sizeof(dbrushside_t)));
\r
553 printf ("%5i planes %7i\n"
\r
554 ,numplanes, (int)(numplanes*sizeof(dplane_t)));
\r
555 printf ("%5i texinfo %7i\n"
\r
556 ,numtexinfo, (int)(numtexinfo*sizeof(texinfo_t)));
\r
557 printf ("%5i entdata %7i\n", num_entities, entdatasize);
\r
561 printf ("%5i vertexes %7i\n"
\r
562 ,numvertexes, (int)(numvertexes*sizeof(dvertex_t)));
\r
563 printf ("%5i nodes %7i\n"
\r
564 ,numnodes, (int)(numnodes*sizeof(dnode_t)));
\r
565 printf ("%5i faces %7i\n"
\r
566 ,numfaces, (int)(numfaces*sizeof(dface_t)));
\r
567 printf ("%5i leafs %7i\n"
\r
568 ,numleafs, (int)(numleafs*sizeof(dleaf_t)));
\r
569 printf ("%5i leaffaces %7i\n"
\r
570 ,numleaffaces, (int)(numleaffaces*sizeof(dleaffaces[0])));
\r
571 printf ("%5i leafbrushes %7i\n"
\r
572 ,numleafbrushes, (int)(numleafbrushes*sizeof(dleafbrushes[0])));
\r
573 printf ("%5i surfedges %7i\n"
\r
574 ,numsurfedges, (int)(numsurfedges*sizeof(dsurfedges[0])));
\r
575 printf ("%5i edges %7i\n"
\r
576 ,numedges, (int)(numedges*sizeof(dedge_t)));
\r
577 printf (" lightdata %7i\n", lightdatasize);
\r
578 printf (" visdata %7i\n", visdatasize);
\r
582 //============================================
\r
585 entity_t entities[MAX_MAP_ENTITIES];
\r
587 void StripTrailing (char *e)
\r
591 s = e + strlen(e)-1;
\r
592 while (s >= e && *s <= 32)
\r
604 epair_t *ParseEpair (void)
\r
608 e = malloc (sizeof(epair_t));
\r
609 memset (e, 0, sizeof(epair_t));
\r
611 if (strlen(token) >= MAX_KEY-1)
\r
612 Error ("ParseEpar: token too long");
\r
613 e->key = copystring(token);
\r
614 GetScriptToken (false);
\r
615 if (strlen(token) >= MAX_VALUE-1)
\r
616 Error ("ParseEpar: token too long");
\r
617 e->value = copystring(token);
\r
619 // strip trailing spaces
\r
620 StripTrailing (e->key);
\r
621 StripTrailing (e->value);
\r
632 qboolean ParseEntity (void)
\r
637 if (!GetScriptToken (true))
\r
640 if (strcmp (token, "{") )
\r
641 Error ("ParseEntity: { not found");
\r
643 if (num_entities == MAX_MAP_ENTITIES)
\r
644 Error ("num_entities == MAX_MAP_ENTITIES");
\r
646 mapent = &entities[num_entities];
\r
651 if (!GetScriptToken (true))
\r
652 Error ("ParseEntity: EOF without closing brace");
\r
653 if (!strcmp (token, "}") )
\r
656 e->next = mapent->epairs;
\r
657 mapent->epairs = e;
\r
667 Parses the dentdata string into entities
\r
670 void ParseEntities (void)
\r
673 ParseFromMemory (dentdata, entdatasize);
\r
675 while (ParseEntity ())
\r
685 Generates the dentdata string from all the entities
\r
688 void UnparseEntities (void)
\r
694 char key[1024], value[1024];
\r
700 for (i=0 ; i<num_entities ; i++)
\r
702 ep = entities[i].epairs;
\r
704 continue; // ent got removed
\r
706 strcat (end,"{\n");
\r
709 for (ep = entities[i].epairs ; ep ; ep=ep->next)
\r
711 strcpy (key, ep->key);
\r
712 StripTrailing (key);
\r
713 strcpy (value, ep->value);
\r
714 StripTrailing (value);
\r
716 sprintf (line, "\"%s\" \"%s\"\n", key, value);
\r
717 strcat (end, line);
\r
718 end += strlen(line);
\r
720 strcat (end,"}\n");
\r
723 if (end > buf + MAX_MAP_ENTSTRING)
\r
724 Error ("Entity text too long");
\r
726 entdatasize = end - buf + 1;
\r
729 void PrintEntity (entity_t *ent)
\r
733 printf ("------- entity %p -------\n", ent);
\r
734 for (ep=ent->epairs ; ep ; ep=ep->next)
\r
736 printf ("%s = %s\n", ep->key, ep->value);
\r
741 void SetKeyValue (entity_t *ent, char *key, char *value)
\r
745 for (ep=ent->epairs ; ep ; ep=ep->next)
\r
746 if (!strcmp (ep->key, key) )
\r
749 ep->value = copystring(value);
\r
752 ep = malloc (sizeof(*ep));
\r
754 Error("SetKeyValue MALLOC failed! Could not allocate %s bytes.", sizeof(*ep));
\r
755 ep->next = ent->epairs;
\r
757 ep->key = copystring(key);
\r
758 ep->value = copystring(value);
\r
761 char *ValueForKey (entity_t *ent, char *key)
\r
765 for (ep=ent->epairs ; ep ; ep=ep->next)
\r
766 if (!strcmp (ep->key, key) )
\r
771 vec_t FloatForKey (entity_t *ent, char *key)
\r
775 k = ValueForKey (ent, key);
\r
779 void GetVectorForKey (entity_t *ent, char *key, vec3_t vec)
\r
784 k = ValueForKey (ent, key);
\r
785 // scanf into doubles, then assign, so it is vec_t size independent
\r
787 sscanf (k, "%lf %lf %lf", &v1, &v2, &v3);
\r