1 // Requries parts of the q3 tools source to compile
3 // Written by: Brad Whitehead (whiteheb@gamerstv.net)
6 #include "dialogs/dialogs-gtk.h"
14 int leafbytes; //leafbytes = ((portalclusters+63)&~63)>>3;
17 // added because int shift = 32; i = 0xFFFFFFFF >> shift;
18 // then i = 0xFFFFFFFF, when it should = 0
19 const unsigned long bitmasks[33] =
22 0x00000001, 0x00000003, 0x00000007, 0x0000000F,
23 0x0000001F, 0x0000003F, 0x0000007F, 0x000000FF,
24 0x000001FF, 0x000003FF, 0x000007FF, 0x00000FFF,
25 0x00001FFF, 0x00003FFF, 0x00007FFF, 0x0000FFFF,
26 0x0001FFFF, 0x0003FFFF, 0x0007FFFF, 0x000FFFFF,
27 0x001FFFFF, 0x003FFFFF, 0x007FFFFF, 0x00FFFFFF,
28 0x01FFFFFF, 0x03FFFFFF, 0x07FFFFFF, 0x0FFFFFFF,
29 0x1FFFFFFF, 0x3FFFFFFF, 0x7FFFFFFF, 0xFFFFFFFF
32 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);
49 node = &dnodes[node->children[0]];
51 if ( node->children[1] < 0 )
52 return -(node->children[1]+1);
54 node = &dnodes[node->children[1]];
59 int bsp_leafnumforcluster(int cluster)
64 for ( i = 0, l = dleafs; i < numleafs; i++, l++ )
65 if ( l->cluster == cluster ) return(i);
69 // leaf1 = origin leaf
70 // leaf2 = leaf to test for
71 /*int bsp_InPVS(int cluster1, int cluster2)
76 vheader = (vis_header *) visBytes;
77 visdata = visBytes + VIS_HEADER_SIZE;
79 return( *( visdata + ( cluster1 * vheader->leafbytes ) + (cluster2 / 8) ) & ( 1 << ( cluster2 % 8 ) ) );
82 void bsp_setbitvectorlength( byte *v, int length_bits, int length_vector )
88 *(v+i) = (byte) bitmasks[length_bits % 8];
90 memset((v+i+1), 0, length_vector-i-1);
94 void bsp_bitvectorsubtract(byte *first, byte *second, byte *out, int length)
99 for ( i = 0; i < length; i++ )
100 *(out+i) = *(first+i) & ~(*(second+i));
103 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)) ) c++;
114 int bsp_countclusters_mask(byte *bitvector, byte *maskvector, int length)
119 for ( i = 0; i < length; i++ )
120 for ( j = 0; j < 8; j++ )
121 if ( (*(bitvector+i) & (1 << j)) && (*(maskvector+i) & (1 << j)) ) c++;
125 void AddCluster(std::list<DWinding*> *pointlist, dleaf_t *cl, bool* repeatlist, vec3_t clr)
129 int* leafsurf = &dleafsurfaces[cl->firstLeafSurface];
130 for(int k = 0; k < cl->numLeafSurfaces; k++, leafsurf++)
132 if(repeatlist[*leafsurf])
135 dsurface_t* surf = &drawSurfaces[*leafsurf];
136 if(surf->surfaceType != MST_PLANAR)
139 qdrawVert_t* vert = &drawVerts[surf->firstVert];
140 if(surf->firstVert + surf->numVerts > numDrawVerts)
141 DoMessageBox("Warning", "Warning", eMB_OK);
144 w->AllocWinding(surf->numVerts);
146 for (int l = 0; l < surf->numVerts; l++, vert++)
148 (w->p[l])[0] = vert->xyz[0];
149 (w->p[l])[1] = vert->xyz[1];
150 (w->p[l])[2] = vert->xyz[2];
156 pointlist->push_back(w);
158 repeatlist[*leafsurf] = true;
167 std::list<DWinding*> *CreateTrace( dleaf_t *leaf, int c, vis_header *header, byte *visdata, byte *seen )
170 int i, j, clusterNum;
171 std::list<DWinding*> *pointlist = new std::list<DWinding*>;
172 bool* repeatlist = new bool[numDrawSurfaces];
183 vec3_t clrGreen = {0.f, 1.f, 0.f};
185 memset(repeatlist, 0, sizeof(bool)*numDrawSurfaces);
187 vis = visdata + ( c * header->leafbytes );
191 AddCluster(pointlist, &(dleafs[bsp_leafnumforcluster( c )]), repeatlist, clrGreen);
193 for ( i = 0; i < header->leafbytes; i++ )
195 for ( j = 0; j < 8; j++ )
197 cl = &(dleafs[bsp_leafnumforcluster( clusterNum )]);
199 if ( ( *(vis + i) & (1 << j) ) && (*(seen+i) & (1 << j)) && (leaf->area == cl->area))
200 AddCluster(pointlist, cl, repeatlist, clrRnd[rand()%5]);
214 setup for CreateTrace
217 std::list<DWinding*> *TraceCluster (int leafnum)
219 byte seen[(MAX_MAP_LEAFS/8) + 1];
224 vheader = (vis_header *) visBytes;
225 visdata = visBytes + sizeof(vis_header);
227 memset(seen, 0xFF, sizeof(seen));
228 bsp_setbitvectorlength(seen, vheader->portalclusters, sizeof(seen));
230 leaf = &(dleafs[leafnum]);
232 return CreateTrace(leaf, leaf->cluster, vheader, visdata, seen);
235 std::list<DWinding *>* BuildTrace(char* filename, vec3_t v_origin)
237 if(!LoadBSPFile(filename))
240 int leafnum = bsp_leafnumfororigin(v_origin);
242 std::list<DWinding*> *pointlist = TraceCluster(leafnum);