quakeforge/tools/qfbsp/source/map.c

/*
	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 the Free Software
	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

	See file, 'COPYING', for details.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif

static __attribute__ ((unused)) const char rcsid[] =
	"$Id$";

#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STRINGS_H
# include <strings.h>
#endif
#include <stdlib.h>

#include "QF/dstring.h"
#include "QF/quakefs.h"
#include "QF/sys.h"

#include "bsp5.h"

int         nummapbrushes;
mbrush_t    mapbrushes[MAX_MAP_BRUSHES];

int         num_entities;
entity_t    entities[MAX_MAP_ENTITIES];

int         nummiptex;
char        miptex[MAX_MAP_TEXINFO][16];


int
FindMiptex (const char *name)
{
	int         i;

	for (i = 0; i < nummiptex; i++) {
		if (!strcmp (name, miptex[i]))
			return i;
	}
	if (nummiptex == MAX_MAP_TEXINFO)
		Sys_Error ("nummiptex == MAX_MAP_TEXINFO");
	strcpy (miptex[i], name);
	nummiptex++;
	return i;
}

/*
	FindTexinfo

	Returns a global texinfo number
*/
static int
FindTexinfo (texinfo_t *t)
{
	int         i, j;
	texinfo_t  *tex;

	// set the special flag
	if (miptex[t->miptex][0] == '*'
		|| !strncasecmp (miptex[t->miptex], "sky", 3))
		t->flags |= TEX_SPECIAL;

	tex = bsp->texinfo;
	for (i = 0; i < bsp->numtexinfo; i++, tex++) {
		if (t->miptex != tex->miptex)
			continue;
		if (t->flags != tex->flags)
			continue;

		for (j = 0; j < 8; j++)
			if (t->vecs[0][j] != tex->vecs[0][j])
				break;
		if (j != 8)
			continue;

		return i;
	}

	// allocate a new texture
	BSP_AddTexinfo (bsp, t);

	return i;
}

#define	MAXTOKEN	128

char        token[MAXTOKEN];
qboolean    unget;
char       *script_p;
int         scriptline;

static void
StartTokenParsing (char *data)
{
	scriptline = 1;
	script_p = data;
	unget = false;
}

static qboolean
GetToken (qboolean crossline)
{
	char       *token_p;

	if (unget)							// is a token allready waiting?
		return true;

	// skip space
  skipspace:
	while (*script_p <= 32) {
		if (!*script_p) {
			if (!crossline)
				Sys_Error ("Line %i is incomplete", scriptline);
			return false;
		}
		if (*script_p++ == '\n') {
			if (!crossline)
				Sys_Error ("Line %i is incomplete", scriptline);
			scriptline++;
		}
	}

	if (script_p[0] == '/' && script_p[1] == '/') {		// comment field
		if (!crossline)
			Sys_Error ("Line %i is incomplete\n", scriptline);
		while (*script_p++ != '\n')
			if (!*script_p) {
				if (!crossline)
					Sys_Error ("Line %i is incomplete", scriptline);
				return false;
			}
		goto skipspace;
	}

	// copy token
	token_p = token;

	if (*script_p == '"') {
		script_p++;
		while (*script_p != '"') {
			if (!*script_p)
				Sys_Error ("EOF inside quoted token");
			*token_p++ = *script_p++;
			if (token_p > &token[MAXTOKEN - 1])
				Sys_Error ("Token too large on line %i", scriptline);
		}
		script_p++;
	} else
		while (*script_p > 32) {
			*token_p++ = *script_p++;
			if (token_p > &token[MAXTOKEN - 1])
				Sys_Error ("Token too large on line %i", scriptline);
		}

	*token_p = 0;

	return true;
}

entity_t   *mapent;

static void
ParseEpair (void)
{
	epair_t    *e;

	e = malloc (sizeof (epair_t));
	memset (e, 0, sizeof (epair_t));
	e->next = mapent->epairs;
	mapent->epairs = e;

	if (strlen (token) >= MAX_KEY - 1)
		Sys_Error ("ParseEpar: token too long");
	e->key = strdup (token);
	GetToken (false);
	if (strlen (token) >= MAX_VALUE - 1)
		Sys_Error ("ParseEpar: token too long");
	e->value = strdup (token);
}

vec3_t      baseaxis[18] = {
	{0, 0, 1}, {1, 0, 0}, {0, -1, 0},	// floor
	{0, 0, -1}, {1, 0, 0}, {0, -1, 0},	// ceiling
	{1, 0, 0}, {0, 1, 0}, {0, 0, -1},	// west wall
	{-1, 0, 0}, {0, 1, 0}, {0, 0, -1},	// east wall
	{0, 1, 0}, {1, 0, 0}, {0, 0, -1},	// south wall
	{0, -1, 0}, {1, 0, 0}, {0, 0, -1}	// north wall
};

static void
TextureAxisFromPlane (plane_t *pln, vec3_t xv, vec3_t yv)
{
	float       dot, best;
	int         bestaxis, i;

	best = 0;
	bestaxis = 0;

	for (i = 0; i < 6; i++) {
		dot = DotProduct (pln->normal, baseaxis[i * 3]);
		if (dot > best) {
			best = dot;
			bestaxis = i;
		}
	}

	VectorCopy (baseaxis[bestaxis * 3 + 1], xv);
	VectorCopy (baseaxis[bestaxis * 3 + 2], yv);
}

static void
ParseBrush (void)
{
	float       shift[2], rotate, scale[2];
	int         i, j;
	mbrush_t   *b;
	mface_t    *f, *f2;
	texinfo_t   tx;
	vec3_t      planepts[3];
	vec3_t      t1, t2, t3;
	vec_t       d;

	b = &mapbrushes[nummapbrushes];
	nummapbrushes++;
	b->next = mapent->brushes;
	mapent->brushes = b;

	do {
		if (!GetToken (true))
			break;
		if (!strcmp (token, "}"))
			break;

		// read the three point plane definition
		for (i = 0; i < 3; i++) {
			if (i != 0)
				GetToken (true);
			if (strcmp (token, "("))
				Sys_Error ("parsing brush");

			for (j = 0; j < 3; j++) {
				GetToken (false);
				planepts[i][j] = atoi (token);
			}

			GetToken (false);
			if (strcmp (token, ")"))
				Sys_Error ("parsing brush");
		}

		// read the texturedef
		memset (&tx, 0, sizeof (tx));
		GetToken (false);
		tx.miptex = FindMiptex (token);
		GetToken (false);
		shift[0] = atoi (token);
		GetToken (false);
		shift[1] = atoi (token);
		GetToken (false);
		rotate = atoi (token);
		GetToken (false);
		scale[0] = atof (token);
		GetToken (false);
		scale[1] = atof (token);

		// if the three points are all on a previous plane, it is a duplicate
		// plane
		for (f2 = b->faces; f2; f2 = f2->next) {
			for (i = 0; i < 3; i++) {
				d = DotProduct (planepts[i], f2->plane.normal)
					- f2->plane.dist;
				if (d < -ON_EPSILON || d > ON_EPSILON)
					break;
			}
			if (i == 3)
				break;
		}
		if (f2) {
			printf ("WARNING: brush with duplicate plane\n");
			continue;
		}

		f = malloc (sizeof (mface_t));
		f->next = b->faces;
		b->faces = f;

		// convert to a vector / dist plane
		for (j = 0; j < 3; j++) {
			t1[j] = planepts[0][j] - planepts[1][j];
			t2[j] = planepts[2][j] - planepts[1][j];
			t3[j] = planepts[1][j];
		}

		CrossProduct (t1, t2, f->plane.normal);
		if (_VectorCompare (f->plane.normal, vec3_origin)) {
			printf ("WARNING: brush plane with no normal\n");
			b->faces = f->next;
			free (f);
			break;
		}
		_VectorNormalize (f->plane.normal);
		f->plane.dist = DotProduct (t3, f->plane.normal);

		// fake proper texture vectors from QuakeEd style
		{
			float       ang, sinv, cosv, ns, nt;
			int         sv, tv;
			vec3_t      vecs[2];

			TextureAxisFromPlane (&f->plane, vecs[0], vecs[1]);

			if (!scale[0])
				scale[0] = 1;
			if (!scale[1])
				scale[1] = 1;

			// rotate axis
			if (rotate == 0) {
				sinv = 0;
				cosv = 1;
			} else if (rotate == 90) {
				sinv = 1;
				cosv = 0;
			} else if (rotate == 180) {
				sinv = 0;
				cosv = -1;
			} else if (rotate == 270) {
				sinv = -1;
				cosv = 0;
			} else {
				ang = rotate / 180 * M_PI;
				sinv = sin (ang);
				cosv = cos (ang);
			}

			if (vecs[0][0])
				sv = 0;
			else if (vecs[0][1])
				sv = 1;
			else
				sv = 2;

			if (vecs[1][0])
				tv = 0;
			else if (vecs[1][1])
				tv = 1;
			else
				tv = 2;

			for (i = 0; i < 2; i++) {
				ns = cosv * vecs[i][sv] - sinv * vecs[i][tv];
				nt = sinv * vecs[i][sv] + cosv * vecs[i][tv];
				vecs[i][sv] = ns;
				vecs[i][tv] = nt;
			}

			for (i = 0; i < 2; i++)
				for (j = 0; j < 3; j++)
					tx.vecs[i][j] = vecs[i][j] / scale[i];

			tx.vecs[0][3] = shift[0];
			tx.vecs[1][3] = shift[1];
		}

		// unique the texinfo
		f->texinfo = FindTexinfo (&tx);
	} while (1);
}

static qboolean
ParseEntity (void)
{
	if (!GetToken (true))
		return false;

	if (strcmp (token, "{"))
		Sys_Error ("ParseEntity: { not found");

	if (num_entities == MAX_MAP_ENTITIES)
		Sys_Error ("num_entities == MAX_MAP_ENTITIES");

	mapent = &entities[num_entities];
	num_entities++;

	do {
		if (!GetToken (true))
			Sys_Error ("ParseEntity: EOF without closing brace");
		if (!strcmp (token, "}"))
			break;
		if (!strcmp (token, "{"))
			ParseBrush ();
		else
			ParseEpair ();
	} while (1);

	GetVectorForKey (mapent, "origin", mapent->origin);
	return true;
}

void
LoadMapFile (const char *filename)
{
	char       *buf;
	QFile      *file;

	file = Qopen (filename, "rt");
	buf = malloc (Qfilesize (file) + 1);
	buf[Qfilesize (file)] = 0;
	Qread (file, buf, Qfilesize (file));
	Qclose (file);

	StartTokenParsing (buf);

	num_entities = 0;

	while (ParseEntity ()) {
	}

	free (buf);

	qprintf ("--- LoadMapFile ---\n");
	qprintf ("%s\n", filename);
	qprintf ("%5i brushes\n", nummapbrushes);
	qprintf ("%5i entities\n", num_entities);
	qprintf ("%5i miptex\n", nummiptex);
	qprintf ("%5i texinfo\n", bsp->numtexinfo);
}

void
PrintEntity (entity_t *ent)
{
	epair_t    *ep;

	for (ep = ent->epairs; ep; ep = ep->next)
		printf ("%20s : %s\n", ep->key, ep->value);
}


const char *
ValueForKey (entity_t *ent, const char *key)
{
	epair_t    *ep;

	for (ep = ent->epairs; ep; ep = ep->next)
		if (!strcmp (ep->key, key))
			return ep->value;
	return "";
}

void
SetKeyValue (entity_t *ent, const char *key, const char *value)
{
	epair_t    *ep;

	for (ep = ent->epairs; ep; ep = ep->next)
		if (!strcmp (ep->key, key)) {
			free (ep->value);
			ep->value = strdup (value);
			return;
		}
	ep = malloc (sizeof (*ep));
	ep->next = ent->epairs;
	ent->epairs = ep;
	ep->key = strdup (key);
	ep->value = strdup (value);
}

float
FloatForKey (entity_t *ent, const char *key)
{
	const char *k;

	k = ValueForKey (ent, key);
	return atof (k);
}

void
GetVectorForKey (entity_t *ent, const char *key, vec3_t vec)
{
	const char *k;
	double      v1, v2, v3;

	k = ValueForKey (ent, key);
	v1 = v2 = v3 = 0;
	// scanf into doubles, then assign, so it is vec_t size independent
	sscanf (k, "%lf %lf %lf", &v1, &v2, &v3);
	vec[0] = v1;
	vec[1] = v2;
	vec[2] = v3;
}

void
WriteEntitiesToString (void)
{
	dstring_t  *buf;
	char        line[128];
	epair_t    *ep;
	int         i;

	buf = dstring_newstr ();

	for (i = 0; i < num_entities; i++) {
		ep = entities[i].epairs;
		if (!ep)
			continue;					// ent got removed

		dstring_appendstr (buf, "{\n");

		for (ep = entities[i].epairs; ep; ep = ep->next) {
			sprintf (line, "\"%s\" \"%s\"\n", ep->key, ep->value);
			dstring_appendstr (buf, line);
		}
		dstring_appendstr (buf, "}\n");
	}
	BSP_AddEntities (bsp, buf->str, buf->size);
}