/*
    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.
*/

#ifndef __BSPFILE_H__
#define __BSPFILE_H__

#include <string>

#include <stdint.h>

#ifdef __cplusplus
extern "C" {
#endif

#define BSPVERSION     29
#define BSPHLVERSION   30
#define BSP2RMQVERSION (('B' << 24) | ('S' << 16) | ('P' << 8) | '2')
#define BSP2VERSION    ('B' | ('S' << 8) | ('P' << 16) | ('2' << 24))

typedef struct {
    int32_t fileofs;
    int32_t filelen;
} lump_t;

#define LUMP_ENTITIES      0
#define LUMP_PLANES        1
#define LUMP_TEXTURES      2
#define LUMP_VERTEXES      3
#define LUMP_VISIBILITY    4
#define LUMP_NODES         5
#define LUMP_TEXINFO       6
#define LUMP_FACES         7
#define LUMP_LIGHTING      8
#define LUMP_CLIPNODES     9
#define LUMP_LEAFS        10
#define LUMP_MARKSURFACES 11
#define LUMP_EDGES        12
#define LUMP_SURFEDGES    13
#define LUMP_MODELS       14

#define BSP_LUMPS         15

//these are private to the qbsp
#define BSPX_LMSHIFT      15
#define BSPX_LUMPS        16

typedef struct {
        char id[4]; //'BSPX'
        uint32_t numlumps;
} bspx_header_t;
typedef struct {
        char lumpname[24];
        uint32_t fileofs;
        uint32_t filelen;
} bspx_lump_t;

typedef struct {
#define MAX_MAP_HULLS_Q1 4
    float mins[3], maxs[3];
    float origin[3];
    int32_t headnode[MAX_MAP_HULLS_Q1]; /* 4 for backward compat, only 3 hulls exist */
    int32_t visleafs;           /* not including the solid leaf 0 */
    int32_t firstface, numfaces;
} dmodelq1_t;
typedef struct {
#define MAX_MAP_HULLS_H2 8
    float mins[3], maxs[3];
    float origin[3];
    int32_t headnode[MAX_MAP_HULLS_H2]; /* hexen2 only uses 6 */
    int32_t visleafs;           /* not including the solid leaf 0 */
    int32_t firstface, numfaces;
} dmodelh2_t;
typedef dmodelh2_t dmodel_t;

typedef struct {
    int32_t version;
    lump_t lumps[BSP_LUMPS];
} dheader_t;

typedef struct {
    int32_t nummiptex;
    int32_t dataofs[];          /* [nummiptex] */
} dmiptexlump_t;

typedef std::string miptex_t;

typedef struct {
    float point[3];
} dvertex_t;

typedef struct {
    float normal[3];
    float dist;
    int32_t type;
} dplane_t;

typedef struct {
    int32_t planenum;
    int16_t children[2];        /* negative numbers are -(leafs+1), not nodes */
    int16_t mins[3];            /* for sphere culling */
    int16_t maxs[3];
    uint16_t firstface;
    uint16_t numfaces;          /* counting both sides */
} bsp29_dnode_t;

typedef struct {
    int32_t planenum;
    int32_t children[2];        /* negative numbers are -(leafs+1), not nodes */
    int16_t mins[3];            /* for sphere culling */
    int16_t maxs[3];
    uint32_t firstface;
    uint32_t numfaces;          /* counting both sides */
} bsp2rmq_dnode_t;

typedef struct {
    int32_t planenum;
    int32_t children[2];        /* negative numbers are -(leafs+1), not nodes */
    float mins[3];              /* for sphere culling */
    float maxs[3];
    uint32_t firstface;
    uint32_t numfaces;          /* counting both sides */
} bsp2_dnode_t;

/*
 * Note that children are interpreted as unsigned values now, so that we can
 * handle > 32k clipnodes. Values > 0xFFF0 can be assumed to be CONTENTS
 * values and can be read as the signed value to be compatible with the above
 * (i.e. simply subtract 65536).
 */
typedef struct {
    int32_t planenum;
    uint16_t children[2];       /* "negative" numbers are contents */
} bsp29_dclipnode_t;

typedef struct {
    int32_t planenum;
    int32_t children[2];        /* negative numbers are contents */
} bsp2_dclipnode_t;

typedef struct texinfo_s {
    float vecs[2][4];           /* [s/t][xyz offset] */
    int32_t miptex;
    int32_t flags;
} texinfo_t;

/*
 * Note that edge 0 is never used, because negative edge nums are used for
 * counterclockwise use of the edge in a face.
 */
typedef struct {
    uint16_t v[2];              /* vertex numbers */
} bsp29_dedge_t;

typedef struct {
    uint32_t v[2];              /* vertex numbers */
} bsp2_dedge_t;

#define MAXLIGHTMAPS 4
typedef struct {
    int16_t planenum;
    int16_t side;

    int32_t firstedge;          /* we must support > 64k edges */
    int16_t numedges;
    int16_t texinfo;

    /* lighting info */
    uint8_t styles[MAXLIGHTMAPS];
    int32_t lightofs;           /* start of [numstyles*surfsize] samples */
} bsp29_dface_t;

typedef struct {
    int32_t planenum;
    int32_t side;

    int32_t firstedge;          /* we must support > 64k edges */
    int32_t numedges;
    int32_t texinfo;

    /* lighting info */
    uint8_t styles[MAXLIGHTMAPS];
    int32_t lightofs;           /* start of [numstyles*surfsize] samples */
} bsp2_dface_t;

/* Ambient sounds */
#define AMBIENT_WATER   0
#define AMBIENT_SKY     1
#define AMBIENT_SLIME   2
#define AMBIENT_LAVA    3
#define NUM_AMBIENTS    4

/*
 * leaf 0 is the generic CONTENTS_SOLID leaf, used for all solid areas
 * all other leafs need visibility info
 */
typedef struct {
    int32_t contents;
    int32_t visofs;             /* -1 = no visibility info */
    int16_t mins[3];            /* for frustum culling */
    int16_t maxs[3];
    uint16_t firstmarksurface;
    uint16_t nummarksurfaces;
    uint8_t ambient_level[NUM_AMBIENTS];
} bsp29_dleaf_t;

typedef struct {
    int32_t contents;
    int32_t visofs;             /* -1 = no visibility info */
    int16_t mins[3];            /* for frustum culling */
    int16_t maxs[3];
    uint32_t firstmarksurface;
    uint32_t nummarksurfaces;
    uint8_t ambient_level[NUM_AMBIENTS];
} bsp2rmq_dleaf_t;

typedef struct {
    int32_t contents;
    int32_t visofs;             /* -1 = no visibility info */
    float mins[3];              /* for frustum culling */
    float maxs[3];
    uint32_t firstmarksurface;
    uint32_t nummarksurfaces;
    uint8_t ambient_level[NUM_AMBIENTS];
} bsp2_dleaf_t;

void LoadBSPFile(void);
void WriteBSPFile(void);
void PrintBSPFileSizes(void);
void BSPX_AddLump(const char *xname, const void *xdata, size_t xsize);

#ifdef __cplusplus
}
#endif
    
#endif /* __BSPFILE_H__ */