1 // Requries parts of the q3 tools source to compile
3 // Written by: Brad Whitehead (whiteheb@gamerstv.net)
6 #include "dialogs/dialogs-gtk.h"
15 int leafbytes; //leafbytes = ((portalclusters+63)&~63)>>3;
18 // added because int shift = 32; i = 0xFFFFFFFF >> shift;
19 // then i = 0xFFFFFFFF, when it should = 0
20 const unsigned long bitmasks[33] =
23 0x00000001, 0x00000003, 0x00000007, 0x0000000F,
24 0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
25 0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
26 0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
27 0x0001FFFF, 0x0003FFFF, 0x0007FFFF, 0x000FFFFF,
28 0x001FFFFF, 0x003FFFFF, 0x007FFFFF, 0x00FFFFFF,
29 0x01FFFFFF, 0x03FFFFFF, 0x07FFFFFF, 0x0FFFFFFF,
30 0x1FFFFFFF, 0x3FFFFFFF, 0x7FFFFFFF, 0xFFFFFFFF
33 int bsp_leafnumfororigin( vec3_t origin ){
38 // TODO: check if origin is in the map??
43 plane = &dplanes[node->planeNum];
44 d = DotProduct( origin, plane->normal ) - plane->dist;
46 if ( node->children[0] < 0 ) {
47 return -( node->children[0] + 1 );
50 node = &dnodes[node->children[0]];
54 if ( node->children[1] < 0 ) {
55 return -( node->children[1] + 1 );
58 node = &dnodes[node->children[1]];
64 int bsp_leafnumforcluster( int cluster ){
68 for ( i = 0, l = dleafs; i < numleafs; i++, l++ )
69 if ( l->cluster == cluster ) {
75 // leaf1 = origin leaf
76 // leaf2 = leaf to test for
77 /*int bsp_InPVS(int cluster1, int cluster2)
82 vheader = (vis_header *) visBytes;
83 visdata = visBytes + VIS_HEADER_SIZE;
85 return( *( visdata + ( cluster1 * vheader->leafbytes ) + (cluster2 / 8) ) & ( 1 << ( cluster2 % 8 ) ) );
88 void bsp_setbitvectorlength( byte *v, int length_bits, int length_vector ){
93 *( v + i ) = (byte) bitmasks[length_bits % 8];
95 memset( ( v + i + 1 ), 0, length_vector - i - 1 );
99 void bsp_bitvectorsubtract( byte *first, byte *second, byte *out, int length ){
103 for ( i = 0; i < length; i++ )
104 *( out + i ) = *( first + i ) & ~( *( second + i ) );
107 int bsp_countclusters( byte *bitvector, int length ){
111 for ( i = 0; i < length; i++ )
112 for ( j = 0; j < 8; j++ )
113 if ( ( *( bitvector + i ) & ( 1 << j ) ) ) {
119 int bsp_countclusters_mask( byte *bitvector, byte *maskvector, int length ){
123 for ( i = 0; i < length; i++ )
124 for ( j = 0; j < 8; j++ )
125 if ( ( *( bitvector + i ) & ( 1 << j ) ) && ( *( maskvector + i ) & ( 1 << j ) ) ) {
131 void AddCluster( std::list<DWinding*> *pointlist, dleaf_t *cl, bool* repeatlist, vec3_t clr ){
134 int* leafsurf = &dleafsurfaces[cl->firstLeafSurface];
135 for ( int k = 0; k < cl->numLeafSurfaces; k++, leafsurf++ )
137 if ( repeatlist[*leafsurf] ) {
141 dsurface_t* surf = &drawSurfaces[*leafsurf];
142 if ( surf->surfaceType != MST_PLANAR ) {
146 qdrawVert_t* vert = &drawVerts[surf->firstVert];
147 if ( surf->firstVert + surf->numVerts > numDrawVerts ) {
148 DoMessageBox( "Warning", "Warning", eMB_OK );
152 w->AllocWinding( surf->numVerts );
154 for ( int l = 0; l < surf->numVerts; l++, vert++ )
156 ( w->p[l] )[0] = vert->xyz[0];
157 ( w->p[l] )[1] = vert->xyz[1];
158 ( w->p[l] )[2] = vert->xyz[2];
164 pointlist->push_back( w );
166 repeatlist[*leafsurf] = true;
175 std::list<DWinding*> *CreateTrace( dleaf_t *leaf, int c, vis_header *header, byte *visdata, byte *seen ){
177 int i, j, clusterNum;
178 std::list<DWinding*> *pointlist = new std::list<DWinding*>;
179 bool* repeatlist = new bool[numDrawSurfaces];
190 vec3_t clrGreen = {0.f, 1.f, 0.f};
192 memset( repeatlist, 0, sizeof( bool ) * numDrawSurfaces );
194 vis = visdata + ( c * header->leafbytes );
198 AddCluster( pointlist, &( dleafs[bsp_leafnumforcluster( c )] ), repeatlist, clrGreen );
200 for ( i = 0; i < header->leafbytes; i++ )
202 for ( j = 0; j < 8; j++ )
204 cl = &( dleafs[bsp_leafnumforcluster( clusterNum )] );
206 if ( ( *( vis + i ) & ( 1 << j ) ) && ( *( seen + i ) & ( 1 << j ) ) && ( leaf->area == cl->area ) ) {
207 AddCluster( pointlist, cl, repeatlist, clrRnd[rand() % 5] );
222 setup for CreateTrace
225 std::list<DWinding*> *TraceCluster( int leafnum ){
226 byte seen[( MAX_MAP_LEAFS / 8 ) + 1];
231 vheader = (vis_header *) visBytes;
232 visdata = visBytes + sizeof( vis_header );
234 memset( seen, 0xFF, sizeof( seen ) );
235 bsp_setbitvectorlength( seen, vheader->portalclusters, sizeof( seen ) );
237 leaf = &( dleafs[leafnum] );
239 return CreateTrace( leaf, leaf->cluster, vheader, visdata, seen );
242 std::list<DWinding *>* BuildTrace( char* filename, vec3_t v_origin ){
243 if ( !LoadBSPFile( filename ) ) {
247 int leafnum = bsp_leafnumfororigin( v_origin );
249 std::list<DWinding*> *pointlist = TraceCluster( leafnum );