1 // Requries parts of the q3 tools source to compile
3 // Written by: Brad Whitehead (whiteheb@gamerstv.net)
6 #include "dialogs/dialogs-gtk.h"
12 int leafbytes; //leafbytes = ((portalclusters+63)&~63)>>3;
15 // added because int shift = 32; i = 0xFFFFFFFF >> shift;
16 // then i = 0xFFFFFFFF, when it should = 0
17 const unsigned long bitmasks[33] =
20 0x00000001, 0x00000003, 0x00000007, 0x0000000F,
21 0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
22 0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
23 0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
24 0x0001FFFF, 0x0003FFFF, 0x0007FFFF, 0x000FFFFF,
25 0x001FFFFF, 0x003FFFFF, 0x007FFFFF, 0x00FFFFFF,
26 0x01FFFFFF, 0x03FFFFFF, 0x07FFFFFF, 0x0FFFFFFF,
27 0x1FFFFFFF, 0x3FFFFFFF, 0x7FFFFFFF, 0xFFFFFFFF
30 int bsp_leafnumfororigin( vec3_t origin ){
35 // TODO: check if origin is in the map??
40 plane = &dplanes[node->planeNum];
41 d = DotProduct( origin, plane->normal ) - plane->dist;
43 if ( node->children[0] < 0 ) {
44 return -( node->children[0] + 1 );
47 node = &dnodes[node->children[0]];
51 if ( node->children[1] < 0 ) {
52 return -( node->children[1] + 1 );
55 node = &dnodes[node->children[1]];
61 int bsp_leafnumforcluster( int cluster ){
65 for ( i = 0, l = dleafs; i < numleafs; i++, l++ )
66 if ( l->cluster == cluster ) {
72 // leaf1 = origin leaf
73 // leaf2 = leaf to test for
74 /*int bsp_InPVS(int cluster1, int cluster2)
79 vheader = (vis_header *) visBytes;
80 visdata = visBytes + VIS_HEADER_SIZE;
82 return( *( visdata + ( cluster1 * vheader->leafbytes ) + (cluster2 / 8) ) & ( 1 << ( cluster2 % 8 ) ) );
85 void bsp_setbitvectorlength( byte *v, int length_bits, int length_vector ){
90 *( v + i ) = (byte) bitmasks[length_bits % 8];
92 memset( ( v + i + 1 ), 0, length_vector - i - 1 );
96 void bsp_bitvectorsubtract( byte *first, byte *second, byte *out, int length ){
100 for ( i = 0; i < length; i++ )
101 *( out + i ) = *( first + i ) & ~( *( second + i ) );
104 int bsp_countclusters( byte *bitvector, int length ){
108 for ( i = 0; i < length; i++ )
109 for ( j = 0; j < 8; j++ )
110 if ( ( *( bitvector + i ) & ( 1 << j ) ) ) {
116 int bsp_countclusters_mask( byte *bitvector, byte *maskvector, int length ){
120 for ( i = 0; i < length; i++ )
121 for ( j = 0; j < 8; j++ )
122 if ( ( *( bitvector + i ) & ( 1 << j ) ) && ( *( maskvector + i ) & ( 1 << j ) ) ) {
128 void AddCluster( list<DWinding*> *pointlist, dleaf_t *cl, qboolean* repeatlist, vec3_t clr ){
131 int* leafsurf = &dleafsurfaces[cl->firstLeafSurface];
132 for ( int k = 0; k < cl->numLeafSurfaces; k++, leafsurf++ )
134 if ( repeatlist[*leafsurf] ) {
138 dsurface_t* surf = &drawSurfaces[*leafsurf];
139 if ( surf->surfaceType != MST_PLANAR ) {
143 qdrawVert_t* vert = &drawVerts[surf->firstVert];
144 if ( surf->firstVert + surf->numVerts > numDrawVerts ) {
145 DoMessageBox( "Warning", "Warning", MB_OK );
149 w->AllocWinding( surf->numVerts );
151 for ( int l = 0; l < surf->numVerts; l++, vert++ )
153 ( w->p[l] )[0] = vert->xyz[0];
154 ( w->p[l] )[1] = vert->xyz[1];
155 ( w->p[l] )[2] = vert->xyz[2];
161 pointlist->push_back( w );
163 repeatlist[*leafsurf] = true;
172 list<DWinding*> *CreateTrace( dleaf_t *leaf, int c, vis_header *header, byte *visdata, byte *seen ){
174 int i, j, clusterNum;
175 list<DWinding*> *pointlist = new list<DWinding*>;
176 qboolean* repeatlist = new qboolean[numDrawSurfaces];
187 vec3_t clrGreen = {0.f, 1.f, 0.f};
189 memset( repeatlist, 0, sizeof( qboolean ) * numDrawSurfaces );
191 vis = visdata + ( c * header->leafbytes );
195 AddCluster( pointlist, &( dleafs[bsp_leafnumforcluster( c )] ), repeatlist, clrGreen );
197 for ( i = 0; i < header->leafbytes; i++ )
199 for ( j = 0; j < 8; j++ )
201 cl = &( dleafs[bsp_leafnumforcluster( clusterNum )] );
203 if ( ( *( vis + i ) & ( 1 << j ) ) && ( *( seen + i ) & ( 1 << j ) ) && ( leaf->area == cl->area ) ) {
204 AddCluster( pointlist, cl, repeatlist, clrRnd[rand() % 5] );
219 setup for CreateTrace
222 list<DWinding*> *TraceCluster( int leafnum ){
223 byte seen[( MAX_MAP_LEAFS / 8 ) + 1];
228 vheader = (vis_header *) visBytes;
229 visdata = visBytes + sizeof( vis_header );
231 memset( seen, 0xFF, sizeof( seen ) );
232 bsp_setbitvectorlength( seen, vheader->portalclusters, sizeof( seen ) );
234 leaf = &( dleafs[leafnum] );
236 return CreateTrace( leaf, leaf->cluster, vheader, visdata, seen );
239 list<DWinding *>* BuildTrace( char* filename, vec3_t v_origin ){
240 if ( !LoadBSPFile( filename ) ) {
244 int leafnum = bsp_leafnumfororigin( v_origin );
246 list<DWinding*> *pointlist = TraceCluster( leafnum );