2 Copyright (C) 1999-2006 Id Software, Inc. and contributors.
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
29 void GetLeafNums( void );
31 //=============================================================================
34 dmodel_t dmodels[MAX_MAP_MODELS];
37 byte dvisdata[MAX_MAP_VISIBILITY];
38 dvis_t *dvis = (dvis_t *)dvisdata;
41 byte dlightdata[MAX_MAP_LIGHTING];
44 char dentdata[MAX_MAP_ENTSTRING];
47 dleaf_t dleafs[MAX_MAP_LEAFS];
50 dplane_t dplanes[MAX_MAP_PLANES];
53 dvertex_t dvertexes[MAX_MAP_VERTS];
56 dnode_t dnodes[MAX_MAP_NODES];
59 texinfo_t texinfo[MAX_MAP_TEXINFO];
62 dface_t dfaces[MAX_MAP_FACES];
65 dedge_t dedges[MAX_MAP_EDGES];
68 unsigned short dleaffaces[MAX_MAP_LEAFFACES];
71 unsigned short dleafbrushes[MAX_MAP_LEAFBRUSHES];
74 int dsurfedges[MAX_MAP_SURFEDGES];
77 dbrush_t dbrushes[MAX_MAP_BRUSHES];
80 dbrushside_t dbrushsides[MAX_MAP_BRUSHSIDES];
83 darea_t dareas[MAX_MAP_AREAS];
86 dareaportal_t dareaportals[MAX_MAP_AREAPORTALS];
96 int CompressVis( byte *vis, byte *dest ){
103 // visrow = (r_numvisleafs + 7)>>3;
104 visrow = ( dvis->numclusters + 7 ) >> 3;
106 for ( j = 0 ; j < visrow ; j++ )
114 for ( j++; j < visrow ; j++ )
115 if ( vis[j] || rep == 255 ) {
125 return dest_p - dest;
134 void DecompressVis( byte *in, byte *decompressed ){
139 // row = (r_numvisleafs+7)>>3;
140 row = ( dvis->numclusters + 7 ) >> 3;
152 Error( "DecompressVis: 0 repeat" );
160 } while ( out - decompressed < row );
163 //=============================================================================
169 Byte swaps all data in a bsp file.
172 void SwapBSPFile( qboolean todisk ){
178 for ( i = 0 ; i < nummodels ; i++ )
182 d->firstface = LittleLong( d->firstface );
183 d->numfaces = LittleLong( d->numfaces );
184 d->headnode = LittleLong( d->headnode );
186 for ( j = 0 ; j < 3 ; j++ )
188 d->mins[j] = LittleFloat( d->mins[j] );
189 d->maxs[j] = LittleFloat( d->maxs[j] );
190 d->origin[j] = LittleFloat( d->origin[j] );
197 for ( i = 0 ; i < numvertexes ; i++ )
199 for ( j = 0 ; j < 3 ; j++ )
200 dvertexes[i].point[j] = LittleFloat( dvertexes[i].point[j] );
206 for ( i = 0 ; i < numplanes ; i++ )
208 for ( j = 0 ; j < 3 ; j++ )
209 dplanes[i].normal[j] = LittleFloat( dplanes[i].normal[j] );
210 dplanes[i].dist = LittleFloat( dplanes[i].dist );
211 dplanes[i].type = LittleLong( dplanes[i].type );
217 for ( i = 0 ; i < numtexinfo ; i++ )
219 for ( j = 0 ; j < 8 ; j++ )
220 texinfo[i].vecs[0][j] = LittleFloat( texinfo[i].vecs[0][j] );
221 texinfo[i].flags = LittleLong( texinfo[i].flags );
222 texinfo[i].value = LittleLong( texinfo[i].value );
223 texinfo[i].nexttexinfo = LittleLong( texinfo[i].nexttexinfo );
229 for ( i = 0 ; i < numfaces ; i++ )
231 dfaces[i].texinfo = LittleShort( dfaces[i].texinfo );
232 dfaces[i].planenum = LittleShort( dfaces[i].planenum );
233 dfaces[i].side = LittleShort( dfaces[i].side );
234 dfaces[i].lighting.c = LittleLong( dfaces[i].lighting.c );
235 dfaces[i].lightofs = LittleLong( dfaces[i].lightofs );
236 dfaces[i].firstedge = LittleLong( dfaces[i].firstedge );
237 dfaces[i].numedges = LittleShort( dfaces[i].numedges );
243 for ( i = 0 ; i < numnodes ; i++ )
245 dnodes[i].planenum = LittleLong( dnodes[i].planenum );
246 for ( j = 0 ; j < 3 ; j++ )
248 dnodes[i].mins[j] = LittleShort( dnodes[i].mins[j] );
249 dnodes[i].maxs[j] = LittleShort( dnodes[i].maxs[j] );
251 dnodes[i].children[0] = LittleLong( dnodes[i].children[0] );
252 dnodes[i].children[1] = LittleLong( dnodes[i].children[1] );
253 dnodes[i].firstface = LittleShort( dnodes[i].firstface );
254 dnodes[i].numfaces = LittleShort( dnodes[i].numfaces );
260 for ( i = 0 ; i < numleafs ; i++ )
262 dleafs[i].contents = LittleLong( dleafs[i].contents );
263 dleafs[i].cluster = LittleShort( dleafs[i].cluster );
264 dleafs[i].area = LittleShort( dleafs[i].area );
265 for ( j = 0 ; j < 3 ; j++ )
267 dleafs[i].mins[j] = LittleShort( dleafs[i].mins[j] );
268 dleafs[i].maxs[j] = LittleShort( dleafs[i].maxs[j] );
271 dleafs[i].firstleafface = LittleShort( dleafs[i].firstleafface );
272 dleafs[i].numleaffaces = LittleShort( dleafs[i].numleaffaces );
273 dleafs[i].firstleafbrush = LittleShort( dleafs[i].firstleafbrush );
274 dleafs[i].numleafbrushes = LittleShort( dleafs[i].numleafbrushes );
280 for ( i = 0 ; i < numleaffaces ; i++ )
281 dleaffaces[i] = LittleShort( dleaffaces[i] );
286 for ( i = 0 ; i < numleafbrushes ; i++ )
287 dleafbrushes[i] = LittleShort( dleafbrushes[i] );
292 for ( i = 0 ; i < numsurfedges ; i++ )
293 dsurfedges[i] = LittleLong( dsurfedges[i] );
298 for ( i = 0 ; i < numedges ; i++ )
300 dedges[i].v[0] = LittleShort( dedges[i].v[0] );
301 dedges[i].v[1] = LittleShort( dedges[i].v[1] );
307 for ( i = 0 ; i < numbrushes ; i++ )
309 dbrushes[i].firstside = LittleLong( dbrushes[i].firstside );
310 dbrushes[i].numsides = LittleLong( dbrushes[i].numsides );
311 dbrushes[i].contents = LittleLong( dbrushes[i].contents );
317 for ( i = 0 ; i < numareas ; i++ )
319 dareas[i].numareaportals = LittleLong( dareas[i].numareaportals );
320 dareas[i].firstareaportal = LittleLong( dareas[i].firstareaportal );
326 for ( i = 0 ; i < numareaportals ; i++ )
328 dareaportals[i].portalnum = LittleLong( dareaportals[i].portalnum );
329 dareaportals[i].otherarea = LittleLong( dareaportals[i].otherarea );
335 for ( i = 0 ; i < numbrushsides ; i++ )
337 dbrushsides[i].planenum = LittleShort( dbrushsides[i].planenum );
338 dbrushsides[i].texinfo = LittleShort( dbrushsides[i].texinfo );
345 j = dvis->numclusters;
348 j = LittleLong( dvis->numclusters );
350 dvis->numclusters = LittleLong( dvis->numclusters );
351 for ( i = 0 ; i < j ; i++ )
353 dvis->bitofs[i][0] = LittleLong( dvis->bitofs[i][0] );
354 dvis->bitofs[i][1] = LittleLong( dvis->bitofs[i][1] );
361 int CopyLump( int lump, void *dest, int size ){
364 length = header->lumps[lump].filelen;
365 ofs = header->lumps[lump].fileofs;
367 if ( length % size ) {
368 Error( "LoadBSPFile: odd lump size" );
371 memcpy( dest, (byte *)header + ofs, length );
373 return length / size;
381 void LoadBSPFile( char *filename ){
385 // load the file header
387 LoadFile( filename, (void **)&header );
390 for ( i = 0 ; i < sizeof( dheader_t ) / 4 ; i++ )
391 ( (int *)header )[i] = LittleLong( ( (int *)header )[i] );
393 if ( header->ident != IDBSPHEADER ) {
394 Error( "%s is not a IBSP file", filename );
396 if ( header->version != BSPVERSION ) {
397 Error( "%s is version %i, not %i", filename, header->version, BSPVERSION );
400 nummodels = CopyLump( LUMP_MODELS, dmodels, sizeof( dmodel_t ) );
401 numvertexes = CopyLump( LUMP_VERTEXES, dvertexes, sizeof( dvertex_t ) );
402 numplanes = CopyLump( LUMP_PLANES, dplanes, sizeof( dplane_t ) );
403 numleafs = CopyLump( LUMP_LEAFS, dleafs, sizeof( dleaf_t ) );
404 numnodes = CopyLump( LUMP_NODES, dnodes, sizeof( dnode_t ) );
405 numtexinfo = CopyLump( LUMP_TEXINFO, texinfo, sizeof( texinfo_t ) );
406 numfaces = CopyLump( LUMP_FACES, dfaces, sizeof( dface_t ) );
407 numleaffaces = CopyLump( LUMP_LEAFFACES, dleaffaces, sizeof( dleaffaces[0] ) );
408 numleafbrushes = CopyLump( LUMP_LEAFBRUSHES, dleafbrushes, sizeof( dleafbrushes[0] ) );
409 numsurfedges = CopyLump( LUMP_SURFEDGES, dsurfedges, sizeof( dsurfedges[0] ) );
410 numedges = CopyLump( LUMP_EDGES, dedges, sizeof( dedge_t ) );
411 numbrushes = CopyLump( LUMP_BRUSHES, dbrushes, sizeof( dbrush_t ) );
412 numbrushsides = CopyLump( LUMP_BRUSHSIDES, dbrushsides, sizeof( dbrushside_t ) );
413 numareas = CopyLump( LUMP_AREAS, dareas, sizeof( darea_t ) );
414 numareaportals = CopyLump( LUMP_AREAPORTALS, dareaportals, sizeof( dareaportal_t ) );
416 visdatasize = CopyLump( LUMP_VISIBILITY, dvisdata, 1 );
417 lightdatasize = CopyLump( LUMP_LIGHTING, dlightdata, 1 );
418 entdatasize = CopyLump( LUMP_ENTITIES, dentdata, 1 );
420 CopyLump( LUMP_POP, dpop, 1 );
422 free( header ); // everything has been copied out
427 SwapBSPFile( false );
435 Only loads the texinfo lump, so qdata can scan for textures
438 void LoadBSPFileTexinfo( char *filename ){
443 header = malloc( sizeof( dheader_t ) );
445 f = fopen( filename, "rb" );
446 fread( header, sizeof( dheader_t ), 1, f );
449 for ( i = 0 ; i < sizeof( dheader_t ) / 4 ; i++ )
450 ( (int *)header )[i] = LittleLong( ( (int *)header )[i] );
452 if ( header->ident != IDBSPHEADER ) {
453 Error( "%s is not a IBSP file", filename );
455 if ( header->version != BSPVERSION ) {
456 Error( "%s is version %i, not %i", filename, header->version, BSPVERSION );
460 length = header->lumps[LUMP_TEXINFO].filelen;
461 ofs = header->lumps[LUMP_TEXINFO].fileofs;
463 fseek( f, ofs, SEEK_SET );
464 fread( texinfo, length, 1, f );
467 numtexinfo = length / sizeof( texinfo_t );
469 free( header ); // everything has been copied out
471 SwapBSPFile( false );
475 //============================================================================
480 void AddLump( int lumpnum, void *data, int len ){
483 lump = &header->lumps[lumpnum];
485 lump->fileofs = LittleLong( ftell( wadfile ) );
486 lump->filelen = LittleLong( len );
487 SafeWrite( wadfile, data, ( len + 3 ) & ~3 );
494 Swaps the bsp file in place, so it should not be referenced again
497 void WriteBSPFile( char *filename ){
499 memset( header, 0, sizeof( dheader_t ) );
503 header->ident = LittleLong( IDBSPHEADER );
504 header->version = LittleLong( BSPVERSION );
506 wadfile = SafeOpenWrite( filename );
507 SafeWrite( wadfile, header, sizeof( dheader_t ) ); // overwritten later
509 AddLump( LUMP_PLANES, dplanes, numplanes * sizeof( dplane_t ) );
510 AddLump( LUMP_LEAFS, dleafs, numleafs * sizeof( dleaf_t ) );
511 AddLump( LUMP_VERTEXES, dvertexes, numvertexes * sizeof( dvertex_t ) );
512 AddLump( LUMP_NODES, dnodes, numnodes * sizeof( dnode_t ) );
513 AddLump( LUMP_TEXINFO, texinfo, numtexinfo * sizeof( texinfo_t ) );
514 AddLump( LUMP_FACES, dfaces, numfaces * sizeof( dface_t ) );
515 AddLump( LUMP_BRUSHES, dbrushes, numbrushes * sizeof( dbrush_t ) );
516 AddLump( LUMP_BRUSHSIDES, dbrushsides, numbrushsides * sizeof( dbrushside_t ) );
517 AddLump( LUMP_LEAFFACES, dleaffaces, numleaffaces * sizeof( dleaffaces[0] ) );
518 AddLump( LUMP_LEAFBRUSHES, dleafbrushes, numleafbrushes * sizeof( dleafbrushes[0] ) );
519 AddLump( LUMP_SURFEDGES, dsurfedges, numsurfedges * sizeof( dsurfedges[0] ) );
520 AddLump( LUMP_EDGES, dedges, numedges * sizeof( dedge_t ) );
521 AddLump( LUMP_MODELS, dmodels, nummodels * sizeof( dmodel_t ) );
522 AddLump( LUMP_AREAS, dareas, numareas * sizeof( darea_t ) );
523 AddLump( LUMP_AREAPORTALS, dareaportals, numareaportals * sizeof( dareaportal_t ) );
525 AddLump( LUMP_LIGHTING, dlightdata, lightdatasize );
526 AddLump( LUMP_VISIBILITY, dvisdata, visdatasize );
527 AddLump( LUMP_ENTITIES, dentdata, entdatasize );
528 AddLump( LUMP_POP, dpop, sizeof( dpop ) );
530 fseek( wadfile, 0, SEEK_SET );
531 SafeWrite( wadfile, header, sizeof( dheader_t ) );
535 //============================================================================
541 Dumps info about current file
544 void PrintBSPFileSizes( void ){
545 if ( !num_entities ) {
549 printf( "%5i models %7i\n"
550 ,nummodels, (int)( nummodels * sizeof( dmodel_t ) ) );
551 printf( "%5i brushes %7i\n"
552 ,numbrushes, (int)( numbrushes * sizeof( dbrush_t ) ) );
553 printf( "%5i brushsides %7i\n"
554 ,numbrushsides, (int)( numbrushsides * sizeof( dbrushside_t ) ) );
555 printf( "%5i planes %7i\n"
556 ,numplanes, (int)( numplanes * sizeof( dplane_t ) ) );
557 printf( "%5i texinfo %7i\n"
558 ,numtexinfo, (int)( numtexinfo * sizeof( texinfo_t ) ) );
559 printf( "%5i entdata %7i\n", num_entities, entdatasize );
563 printf( "%5i vertexes %7i\n"
564 ,numvertexes, (int)( numvertexes * sizeof( dvertex_t ) ) );
565 printf( "%5i nodes %7i\n"
566 ,numnodes, (int)( numnodes * sizeof( dnode_t ) ) );
567 printf( "%5i faces %7i\n"
568 ,numfaces, (int)( numfaces * sizeof( dface_t ) ) );
569 printf( "%5i leafs %7i\n"
570 ,numleafs, (int)( numleafs * sizeof( dleaf_t ) ) );
571 printf( "%5i leaffaces %7i\n"
572 ,numleaffaces, (int)( numleaffaces * sizeof( dleaffaces[0] ) ) );
573 printf( "%5i leafbrushes %7i\n"
574 ,numleafbrushes, (int)( numleafbrushes * sizeof( dleafbrushes[0] ) ) );
575 printf( "%5i surfedges %7i\n"
576 ,numsurfedges, (int)( numsurfedges * sizeof( dsurfedges[0] ) ) );
577 printf( "%5i edges %7i\n"
578 ,numedges, (int)( numedges * sizeof( dedge_t ) ) );
579 printf( " lightdata %7i\n", lightdatasize );
580 printf( " visdata %7i\n", visdatasize );
584 //============================================
587 entity_t entities[MAX_MAP_ENTITIES];
589 void StripTrailing( char *e ){
592 s = e + strlen( e ) - 1;
593 while ( s >= e && *s <= 32 )
605 epair_t *ParseEpair( void ){
608 e = malloc( sizeof( epair_t ) );
609 memset( e, 0, sizeof( epair_t ) );
611 if ( strlen( token ) >= MAX_KEY - 1 ) {
612 Error( "ParseEpar: token too long" );
614 e->key = copystring( token );
615 GetScriptToken( false );
616 if ( strlen( token ) >= MAX_VALUE - 1 ) {
617 Error( "ParseEpar: token too long" );
619 e->value = copystring( token );
621 // strip trailing spaces
622 StripTrailing( e->key );
623 StripTrailing( e->value );
634 qboolean ParseEntity( void ){
638 if ( !GetScriptToken( true ) ) {
642 if ( strcmp( token, "{" ) ) {
643 Error( "ParseEntity: { not found" );
646 if ( num_entities == MAX_MAP_ENTITIES ) {
647 Error( "num_entities == MAX_MAP_ENTITIES" );
650 mapent = &entities[num_entities];
655 if ( !GetScriptToken( true ) ) {
656 Error( "ParseEntity: EOF without closing brace" );
658 if ( !strcmp( token, "}" ) ) {
662 e->next = mapent->epairs;
673 Parses the dentdata string into entities
676 void ParseEntities( void ){
678 ParseFromMemory( dentdata, entdatasize );
680 while ( ParseEntity() )
690 Generates the dentdata string from all the entities
693 void UnparseEntities( void ){
698 char key[1024], value[1024];
704 for ( i = 0 ; i < num_entities ; i++ )
706 ep = entities[i].epairs;
708 continue; // ent got removed
714 for ( ep = entities[i].epairs ; ep ; ep = ep->next )
716 strcpy( key, ep->key );
717 StripTrailing( key );
718 strcpy( value, ep->value );
719 StripTrailing( value );
721 sprintf( line, "\"%s\" \"%s\"\n", key, value );
723 end += strlen( line );
728 if ( end > buf + MAX_MAP_ENTSTRING ) {
729 Error( "Entity text too long" );
732 entdatasize = end - buf + 1;
735 void PrintEntity( entity_t *ent ){
738 printf( "------- entity %p -------\n", ent );
739 for ( ep = ent->epairs ; ep ; ep = ep->next )
741 printf( "%s = %s\n", ep->key, ep->value );
746 void SetKeyValue( entity_t *ent, char *key, char *value ){
749 for ( ep = ent->epairs ; ep ; ep = ep->next )
750 if ( !strcmp( ep->key, key ) ) {
752 ep->value = copystring( value );
755 ep = malloc( sizeof( *ep ) );
757 Error( "SetKeyValue MALLOC failed! Could not allocate %s bytes.", sizeof( *ep ) );
759 ep->next = ent->epairs;
761 ep->key = copystring( key );
762 ep->value = copystring( value );
765 char *ValueForKey( entity_t *ent, char *key ){
768 for ( ep = ent->epairs ; ep ; ep = ep->next )
769 if ( !strcmp( ep->key, key ) ) {
775 vec_t FloatForKey( entity_t *ent, char *key ){
778 k = ValueForKey( ent, key );
782 void GetVectorForKey( entity_t *ent, char *key, vec3_t vec ){
786 k = ValueForKey( ent, key );
787 // scanf into doubles, then assign, so it is vec_t size independent
789 sscanf( k, "%lf %lf %lf", &v1, &v2, &v3 );