a245384bde33b5a40b8e96cff154f797161c8d45
[divverent/darkplaces.git] / model_brush.c
1 /*
2 Copyright (C) 1996-1997 Id Software, Inc.
3
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12
13 See the GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
18
19 */
20
21 #include "quakedef.h"
22 #include "image.h"
23 #include "r_shadow.h"
24 #include "polygon.h"
25 #include "curves.h"
26 #include "wad.h"
27
28
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
32 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
33 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
47 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
48 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
49
50 static texture_t mod_q1bsp_texture_solid;
51 static texture_t mod_q1bsp_texture_sky;
52 static texture_t mod_q1bsp_texture_lava;
53 static texture_t mod_q1bsp_texture_slime;
54 static texture_t mod_q1bsp_texture_water;
55
56 void Mod_BrushInit(void)
57 {
58 //      Cvar_RegisterVariable(&r_subdivide_size);
59         Cvar_RegisterVariable(&r_novis);
60         Cvar_RegisterVariable(&r_picmipworld);
61         Cvar_RegisterVariable(&r_nosurftextures);
62         Cvar_RegisterVariable(&r_subdivisions_tolerance);
63         Cvar_RegisterVariable(&r_subdivisions_mintess);
64         Cvar_RegisterVariable(&r_subdivisions_maxtess);
65         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
66         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
67         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
68         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
69         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
70         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
71         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
72         Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
73         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
74         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
75         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
76         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
77         Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
78
79         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
80         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
81         mod_q1bsp_texture_solid.surfaceflags = 0;
82         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
83
84         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
85         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
86         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
87         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
88
89         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
90         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
91         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
92         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
93
94         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
95         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
96         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
97         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
98
99         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
100         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
101         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
102         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
103 }
104
105 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
106 {
107         mnode_t *node;
108
109         if (model == NULL)
110                 return NULL;
111
112         // LordHavoc: modified to start at first clip node,
113         // in other words: first node of the (sub)model
114         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
115         while (node->plane)
116                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
117
118         return (mleaf_t *)node;
119 }
120
121 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
122 {
123         int i;
124         mleaf_t *leaf;
125         leaf = Mod_Q1BSP_PointInLeaf(model, p);
126         if (leaf)
127         {
128                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
129                 if (i)
130                 {
131                         memcpy(out, leaf->ambient_sound_level, i);
132                         out += i;
133                         outsize -= i;
134                 }
135         }
136         if (outsize)
137                 memset(out, 0, outsize);
138 }
139
140 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
141 {
142         int numclusters = 0;
143         int nodestackindex = 0;
144         mnode_t *node, *nodestack[1024];
145         if (!model->brush.num_pvsclusters)
146                 return -1;
147         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
148         for (;;)
149         {
150 #if 1
151                 if (node->plane)
152                 {
153                         // node - recurse down the BSP tree
154                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
155                         if (sides < 3)
156                         {
157                                 if (sides == 0)
158                                         return -1; // ERROR: NAN bounding box!
159                                 // box is on one side of plane, take that path
160                                 node = node->children[sides-1];
161                         }
162                         else
163                         {
164                                 // box crosses plane, take one path and remember the other
165                                 if (nodestackindex < 1024)
166                                         nodestack[nodestackindex++] = node->children[0];
167                                 node = node->children[1];
168                         }
169                         continue;
170                 }
171                 else
172                 {
173                         // leaf - add clusterindex to list
174                         if (numclusters < maxclusters)
175                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
176                         numclusters++;
177                 }
178 #else
179                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
180                 {
181                         if (node->plane)
182                         {
183                                 if (nodestackindex < 1024)
184                                         nodestack[nodestackindex++] = node->children[0];
185                                 node = node->children[1];
186                                 continue;
187                         }
188                         else
189                         {
190                                 // leaf - add clusterindex to list
191                                 if (numclusters < maxclusters)
192                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
193                                 numclusters++;
194                         }
195                 }
196 #endif
197                 // try another path we didn't take earlier
198                 if (nodestackindex == 0)
199                         break;
200                 node = nodestack[--nodestackindex];
201         }
202         // return number of clusters found (even if more than the maxclusters)
203         return numclusters;
204 }
205
206 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
207 {
208         int nodestackindex = 0;
209         mnode_t *node, *nodestack[1024];
210         if (!model->brush.num_pvsclusters)
211                 return true;
212         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
213         for (;;)
214         {
215 #if 1
216                 if (node->plane)
217                 {
218                         // node - recurse down the BSP tree
219                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
220                         if (sides < 3)
221                         {
222                                 if (sides == 0)
223                                         return -1; // ERROR: NAN bounding box!
224                                 // box is on one side of plane, take that path
225                                 node = node->children[sides-1];
226                         }
227                         else
228                         {
229                                 // box crosses plane, take one path and remember the other
230                                 if (nodestackindex < 1024)
231                                         nodestack[nodestackindex++] = node->children[0];
232                                 node = node->children[1];
233                         }
234                         continue;
235                 }
236                 else
237                 {
238                         // leaf - check cluster bit
239                         int clusterindex = ((mleaf_t *)node)->clusterindex;
240                         if (CHECKPVSBIT(pvs, clusterindex))
241                         {
242                                 // it is visible, return immediately with the news
243                                 return true;
244                         }
245                 }
246 #else
247                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
248                 {
249                         if (node->plane)
250                         {
251                                 if (nodestackindex < 1024)
252                                         nodestack[nodestackindex++] = node->children[0];
253                                 node = node->children[1];
254                                 continue;
255                         }
256                         else
257                         {
258                                 // leaf - check cluster bit
259                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
260                                 if (CHECKPVSBIT(pvs, clusterindex))
261                                 {
262                                         // it is visible, return immediately with the news
263                                         return true;
264                                 }
265                         }
266                 }
267 #endif
268                 // nothing to see here, try another path we didn't take earlier
269                 if (nodestackindex == 0)
270                         break;
271                 node = nodestack[--nodestackindex];
272         }
273         // it is not visible
274         return false;
275 }
276
277 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
278 {
279         int nodestackindex = 0;
280         mnode_t *node, *nodestack[1024];
281         if (!model->brush.num_leafs)
282                 return true;
283         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
284         for (;;)
285         {
286 #if 1
287                 if (node->plane)
288                 {
289                         // node - recurse down the BSP tree
290                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
291                         if (sides < 3)
292                         {
293                                 if (sides == 0)
294                                         return -1; // ERROR: NAN bounding box!
295                                 // box is on one side of plane, take that path
296                                 node = node->children[sides-1];
297                         }
298                         else
299                         {
300                                 // box crosses plane, take one path and remember the other
301                                 if (nodestackindex < 1024)
302                                         nodestack[nodestackindex++] = node->children[0];
303                                 node = node->children[1];
304                         }
305                         continue;
306                 }
307                 else
308                 {
309                         // leaf - check cluster bit
310                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
311                         if (CHECKPVSBIT(pvs, clusterindex))
312                         {
313                                 // it is visible, return immediately with the news
314                                 return true;
315                         }
316                 }
317 #else
318                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
319                 {
320                         if (node->plane)
321                         {
322                                 if (nodestackindex < 1024)
323                                         nodestack[nodestackindex++] = node->children[0];
324                                 node = node->children[1];
325                                 continue;
326                         }
327                         else
328                         {
329                                 // leaf - check cluster bit
330                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
331                                 if (CHECKPVSBIT(pvs, clusterindex))
332                                 {
333                                         // it is visible, return immediately with the news
334                                         return true;
335                                 }
336                         }
337                 }
338 #endif
339                 // nothing to see here, try another path we didn't take earlier
340                 if (nodestackindex == 0)
341                         break;
342                 node = nodestack[--nodestackindex];
343         }
344         // it is not visible
345         return false;
346 }
347
348 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
349 {
350         int nodestackindex = 0;
351         mnode_t *node, *nodestack[1024];
352         if (!model->brush.num_leafs)
353                 return true;
354         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
355         for (;;)
356         {
357 #if 1
358                 if (node->plane)
359                 {
360                         // node - recurse down the BSP tree
361                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
362                         if (sides < 3)
363                         {
364                                 if (sides == 0)
365                                         return -1; // ERROR: NAN bounding box!
366                                 // box is on one side of plane, take that path
367                                 node = node->children[sides-1];
368                         }
369                         else
370                         {
371                                 // box crosses plane, take one path and remember the other
372                                 if (nodestackindex < 1024)
373                                         nodestack[nodestackindex++] = node->children[0];
374                                 node = node->children[1];
375                         }
376                         continue;
377                 }
378                 else
379                 {
380                         // leaf - check if it is visible
381                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
382                         {
383                                 // it is visible, return immediately with the news
384                                 return true;
385                         }
386                 }
387 #else
388                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
389                 {
390                         if (node->plane)
391                         {
392                                 if (nodestackindex < 1024)
393                                         nodestack[nodestackindex++] = node->children[0];
394                                 node = node->children[1];
395                                 continue;
396                         }
397                         else
398                         {
399                                 // leaf - check if it is visible
400                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
401                                 {
402                                         // it is visible, return immediately with the news
403                                         return true;
404                                 }
405                         }
406                 }
407 #endif
408                 // nothing to see here, try another path we didn't take earlier
409                 if (nodestackindex == 0)
410                         break;
411                 node = nodestack[--nodestackindex];
412         }
413         // it is not visible
414         return false;
415 }
416
417 typedef struct findnonsolidlocationinfo_s
418 {
419         vec3_t center;
420         vec3_t absmin, absmax;
421         vec_t radius;
422         vec3_t nudge;
423         vec_t bestdist;
424         dp_model_t *model;
425 }
426 findnonsolidlocationinfo_t;
427
428 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
429 {
430         int i, *tri;
431         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
432
433         tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434         VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
435         VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
436         VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
437         VectorSubtract(vert[1], vert[0], edge[0]);
438         VectorSubtract(vert[2], vert[1], edge[1]);
439         CrossProduct(edge[1], edge[0], facenormal);
440         if (facenormal[0] || facenormal[1] || facenormal[2])
441         {
442                 VectorNormalize(facenormal);
443                 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
444                 if (f <= info->bestdist && f >= -info->bestdist)
445                 {
446                         VectorSubtract(vert[0], vert[2], edge[2]);
447                         VectorNormalize(edge[0]);
448                         VectorNormalize(edge[1]);
449                         VectorNormalize(edge[2]);
450                         CrossProduct(facenormal, edge[0], edgenormal[0]);
451                         CrossProduct(facenormal, edge[1], edgenormal[1]);
452                         CrossProduct(facenormal, edge[2], edgenormal[2]);
453                         // face distance
454                         if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
455                                         && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
456                                         && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
457                         {
458                                 // we got lucky, the center is within the face
459                                 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
460                                 if (dist < 0)
461                                 {
462                                         dist = -dist;
463                                         if (info->bestdist > dist)
464                                         {
465                                                 info->bestdist = dist;
466                                                 VectorScale(facenormal, (info->radius - -dist), info->nudge);
467                                         }
468                                 }
469                                 else
470                                 {
471                                         if (info->bestdist > dist)
472                                         {
473                                                 info->bestdist = dist;
474                                                 VectorScale(facenormal, (info->radius - dist), info->nudge);
475                                         }
476                                 }
477                         }
478                         else
479                         {
480                                 // check which edge or vertex the center is nearest
481                                 for (i = 0;i < 3;i++)
482                                 {
483                                         f = DotProduct(info->center, edge[i]);
484                                         if (f >= DotProduct(vert[0], edge[i])
485                                                         && f <= DotProduct(vert[1], edge[i]))
486                                         {
487                                                 // on edge
488                                                 VectorMA(info->center, -f, edge[i], point);
489                                                 dist = sqrt(DotProduct(point, point));
490                                                 if (info->bestdist > dist)
491                                                 {
492                                                         info->bestdist = dist;
493                                                         VectorScale(point, (info->radius / dist), info->nudge);
494                                                 }
495                                                 // skip both vertex checks
496                                                 // (both are further away than this edge)
497                                                 i++;
498                                         }
499                                         else
500                                         {
501                                                 // not on edge, check first vertex of edge
502                                                 VectorSubtract(info->center, vert[i], point);
503                                                 dist = sqrt(DotProduct(point, point));
504                                                 if (info->bestdist > dist)
505                                                 {
506                                                         info->bestdist = dist;
507                                                         VectorScale(point, (info->radius / dist), info->nudge);
508                                                 }
509                                         }
510                                 }
511                         }
512                 }
513         }
514 }
515
516 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
517 {
518         int surfacenum, k, *mark;
519         msurface_t *surface;
520         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
521         {
522                 surface = info->model->data_surfaces + *mark;
523                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
524                 {
525                         if(surface->num_bboxstride)
526                         {
527                                 int i, cnt, tri;
528                                 cnt = (surface->num_triangles + surface->num_bboxstride - 1) / surface->num_bboxstride;
529                                 for(i = 0; i < cnt; ++i)
530                                 {
531                                         if(BoxesOverlap(surface->data_bbox6f + i * 6, surface->data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
532                                         {
533                                                 for(k = 0; k < surface->num_bboxstride; ++k)
534                                                 {
535                                                         tri = i * surface->num_bboxstride + k;
536                                                         if(tri >= surface->num_triangles)
537                                                                 break;
538                                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
539                                                 }
540                                         }
541                                 }
542                         }
543                         else
544                         {
545                                 for (k = 0;k < surface->num_triangles;k++)
546                                 {
547                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
548                                 }
549                         }
550                 }
551         }
552 }
553
554 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
555 {
556         if (node->plane)
557         {
558                 float f = PlaneDiff(info->center, node->plane);
559                 if (f >= -info->bestdist)
560                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
561                 if (f <= info->bestdist)
562                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
563         }
564         else
565         {
566                 if (((mleaf_t *)node)->numleafsurfaces)
567                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
568         }
569 }
570
571 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
572 {
573         int i;
574         findnonsolidlocationinfo_t info;
575         if (model == NULL)
576         {
577                 VectorCopy(in, out);
578                 return;
579         }
580         VectorCopy(in, info.center);
581         info.radius = radius;
582         info.model = model;
583         i = 0;
584         do
585         {
586                 VectorClear(info.nudge);
587                 info.bestdist = radius;
588                 VectorCopy(info.center, info.absmin);
589                 VectorCopy(info.center, info.absmax);
590                 info.absmin[0] -= info.radius + 1;
591                 info.absmin[1] -= info.radius + 1;
592                 info.absmin[2] -= info.radius + 1;
593                 info.absmax[0] += info.radius + 1;
594                 info.absmax[1] += info.radius + 1;
595                 info.absmax[2] += info.radius + 1;
596                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
597                 VectorAdd(info.center, info.nudge, info.center);
598         }
599         while (info.bestdist < radius && ++i < 10);
600         VectorCopy(info.center, out);
601 }
602
603 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
604 {
605         switch(nativecontents)
606         {
607                 case CONTENTS_EMPTY:
608                         return 0;
609                 case CONTENTS_SOLID:
610                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
611                 case CONTENTS_WATER:
612                         return SUPERCONTENTS_WATER;
613                 case CONTENTS_SLIME:
614                         return SUPERCONTENTS_SLIME;
615                 case CONTENTS_LAVA:
616                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
617                 case CONTENTS_SKY:
618                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
619         }
620         return 0;
621 }
622
623 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
624 {
625         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
626                 return CONTENTS_SOLID;
627         if (supercontents & SUPERCONTENTS_SKY)
628                 return CONTENTS_SKY;
629         if (supercontents & SUPERCONTENTS_LAVA)
630                 return CONTENTS_LAVA;
631         if (supercontents & SUPERCONTENTS_SLIME)
632                 return CONTENTS_SLIME;
633         if (supercontents & SUPERCONTENTS_WATER)
634                 return CONTENTS_WATER;
635         return CONTENTS_EMPTY;
636 }
637
638 typedef struct RecursiveHullCheckTraceInfo_s
639 {
640         // the hull we're tracing through
641         const hull_t *hull;
642
643         // the trace structure to fill in
644         trace_t *trace;
645
646         // start, end, and end - start (in model space)
647         double start[3];
648         double end[3];
649         double dist[3];
650 }
651 RecursiveHullCheckTraceInfo_t;
652
653 // 1/32 epsilon to keep floating point happy
654 #define DIST_EPSILON (0.03125)
655
656 #define HULLCHECKSTATE_EMPTY 0
657 #define HULLCHECKSTATE_SOLID 1
658 #define HULLCHECKSTATE_DONE 2
659
660 extern cvar_t collision_prefernudgedfraction;
661 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
662 {
663         // status variables, these don't need to be saved on the stack when
664         // recursing...  but are because this should be thread-safe
665         // (note: tracing against a bbox is not thread-safe, yet)
666         int ret;
667         mplane_t *plane;
668         double t1, t2;
669
670         // variables that need to be stored on the stack when recursing
671         mclipnode_t *node;
672         int side;
673         double midf, mid[3];
674
675         // LordHavoc: a goto!  everyone flee in terror... :)
676 loc0:
677         // check for empty
678         if (num < 0)
679         {
680                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
681                 if (!t->trace->startfound)
682                 {
683                         t->trace->startfound = true;
684                         t->trace->startsupercontents |= num;
685                 }
686                 if (num & SUPERCONTENTS_LIQUIDSMASK)
687                         t->trace->inwater = true;
688                 if (num == 0)
689                         t->trace->inopen = true;
690                 if (num & SUPERCONTENTS_SOLID)
691                         t->trace->hittexture = &mod_q1bsp_texture_solid;
692                 else if (num & SUPERCONTENTS_SKY)
693                         t->trace->hittexture = &mod_q1bsp_texture_sky;
694                 else if (num & SUPERCONTENTS_LAVA)
695                         t->trace->hittexture = &mod_q1bsp_texture_lava;
696                 else if (num & SUPERCONTENTS_SLIME)
697                         t->trace->hittexture = &mod_q1bsp_texture_slime;
698                 else
699                         t->trace->hittexture = &mod_q1bsp_texture_water;
700                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
701                 t->trace->hitsupercontents = num;
702                 if (num & t->trace->hitsupercontentsmask)
703                 {
704                         // if the first leaf is solid, set startsolid
705                         if (t->trace->allsolid)
706                                 t->trace->startsolid = true;
707 #if COLLISIONPARANOID >= 3
708                         Con_Print("S");
709 #endif
710                         return HULLCHECKSTATE_SOLID;
711                 }
712                 else
713                 {
714                         t->trace->allsolid = false;
715 #if COLLISIONPARANOID >= 3
716                         Con_Print("E");
717 #endif
718                         return HULLCHECKSTATE_EMPTY;
719                 }
720         }
721
722         // find the point distances
723         node = t->hull->clipnodes + num;
724
725         plane = t->hull->planes + node->planenum;
726         if (plane->type < 3)
727         {
728                 t1 = p1[plane->type] - plane->dist;
729                 t2 = p2[plane->type] - plane->dist;
730         }
731         else
732         {
733                 t1 = DotProduct (plane->normal, p1) - plane->dist;
734                 t2 = DotProduct (plane->normal, p2) - plane->dist;
735         }
736
737         if (t1 < 0)
738         {
739                 if (t2 < 0)
740                 {
741 #if COLLISIONPARANOID >= 3
742                         Con_Print("<");
743 #endif
744                         num = node->children[1];
745                         goto loc0;
746                 }
747                 side = 1;
748         }
749         else
750         {
751                 if (t2 >= 0)
752                 {
753 #if COLLISIONPARANOID >= 3
754                         Con_Print(">");
755 #endif
756                         num = node->children[0];
757                         goto loc0;
758                 }
759                 side = 0;
760         }
761
762         // the line intersects, find intersection point
763         // LordHavoc: this uses the original trace for maximum accuracy
764 #if COLLISIONPARANOID >= 3
765         Con_Print("M");
766 #endif
767         if (plane->type < 3)
768         {
769                 t1 = t->start[plane->type] - plane->dist;
770                 t2 = t->end[plane->type] - plane->dist;
771         }
772         else
773         {
774                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
775                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
776         }
777
778         midf = t1 / (t1 - t2);
779         midf = bound(p1f, midf, p2f);
780         VectorMA(t->start, midf, t->dist, mid);
781
782         // recurse both sides, front side first
783         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
784         // if this side is not empty, return what it is (solid or done)
785         if (ret != HULLCHECKSTATE_EMPTY)
786                 return ret;
787
788         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
789         // if other side is not solid, return what it is (empty or done)
790         if (ret != HULLCHECKSTATE_SOLID)
791                 return ret;
792
793         // front is air and back is solid, this is the impact point...
794         if (side)
795         {
796                 t->trace->plane.dist = -plane->dist;
797                 VectorNegate (plane->normal, t->trace->plane.normal);
798         }
799         else
800         {
801                 t->trace->plane.dist = plane->dist;
802                 VectorCopy (plane->normal, t->trace->plane.normal);
803         }
804
805         // calculate the true fraction
806         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
807         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
808         midf = t1 / (t1 - t2);
809         t->trace->realfraction = bound(0, midf, 1);
810
811         // calculate the return fraction which is nudged off the surface a bit
812         midf = (t1 - DIST_EPSILON) / (t1 - t2);
813         t->trace->fraction = bound(0, midf, 1);
814
815         if (collision_prefernudgedfraction.integer)
816                 t->trace->realfraction = t->trace->fraction;
817
818 #if COLLISIONPARANOID >= 3
819         Con_Print("D");
820 #endif
821         return HULLCHECKSTATE_DONE;
822 }
823
824 //#if COLLISIONPARANOID < 2
825 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
826 {
827         mplane_t *plane;
828         mclipnode_t *nodes = t->hull->clipnodes;
829         mplane_t *planes = t->hull->planes;
830         vec3_t point;
831         VectorCopy(t->start, point);
832         while (num >= 0)
833         {
834                 plane = planes + nodes[num].planenum;
835                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
836         }
837         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
838         t->trace->startsupercontents |= num;
839         if (num & SUPERCONTENTS_LIQUIDSMASK)
840                 t->trace->inwater = true;
841         if (num == 0)
842                 t->trace->inopen = true;
843         if (num & t->trace->hitsupercontentsmask)
844         {
845                 t->trace->allsolid = t->trace->startsolid = true;
846                 return HULLCHECKSTATE_SOLID;
847         }
848         else
849         {
850                 t->trace->allsolid = t->trace->startsolid = false;
851                 return HULLCHECKSTATE_EMPTY;
852         }
853 }
854 //#endif
855
856 static void Mod_Q1BSP_TracePoint(struct model_s *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
857 {
858         RecursiveHullCheckTraceInfo_t rhc;
859
860         memset(&rhc, 0, sizeof(rhc));
861         memset(trace, 0, sizeof(trace_t));
862         rhc.trace = trace;
863         rhc.trace->fraction = 1;
864         rhc.trace->realfraction = 1;
865         rhc.trace->allsolid = true;
866         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
867         VectorCopy(start, rhc.start);
868         VectorCopy(start, rhc.end);
869         Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
870 }
871
872 static void Mod_Q1BSP_TraceLine(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
873 {
874         RecursiveHullCheckTraceInfo_t rhc;
875
876         if (VectorCompare(start, end))
877         {
878                 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
879                 return;
880         }
881
882         memset(&rhc, 0, sizeof(rhc));
883         memset(trace, 0, sizeof(trace_t));
884         rhc.trace = trace;
885         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
886         rhc.trace->fraction = 1;
887         rhc.trace->realfraction = 1;
888         rhc.trace->allsolid = true;
889         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
890         VectorCopy(start, rhc.start);
891         VectorCopy(end, rhc.end);
892         VectorSubtract(rhc.end, rhc.start, rhc.dist);
893 #if COLLISIONPARANOID >= 2
894         Con_Printf("t(%f %f %f,%f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2]);
895         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
896         {
897
898                 double test[3];
899                 trace_t testtrace;
900                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
901                 memset(&testtrace, 0, sizeof(trace_t));
902                 rhc.trace = &testtrace;
903                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
904                 rhc.trace->fraction = 1;
905                 rhc.trace->realfraction = 1;
906                 rhc.trace->allsolid = true;
907                 VectorCopy(test, rhc.start);
908                 VectorCopy(test, rhc.end);
909                 VectorClear(rhc.dist);
910                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
911                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
912                 if (!trace->startsolid && testtrace.startsolid)
913                         Con_Printf(" - ended in solid!\n");
914         }
915         Con_Print("\n");
916 #else
917         if (VectorLength2(rhc.dist))
918                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
919         else
920                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
921 #endif
922 }
923
924 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
925 {
926         // this function currently only supports same size start and end
927         double boxsize[3];
928         RecursiveHullCheckTraceInfo_t rhc;
929
930         if (VectorCompare(boxmins, boxmaxs))
931         {
932                 if (VectorCompare(start, end))
933                         Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
934                 else
935                         Mod_Q1BSP_TraceLine(model, frame, trace, start, end, hitsupercontentsmask);
936                 return;
937         }
938
939         memset(&rhc, 0, sizeof(rhc));
940         memset(trace, 0, sizeof(trace_t));
941         rhc.trace = trace;
942         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
943         rhc.trace->fraction = 1;
944         rhc.trace->realfraction = 1;
945         rhc.trace->allsolid = true;
946         VectorSubtract(boxmaxs, boxmins, boxsize);
947         if (boxsize[0] < 3)
948                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
949         else if (model->brush.ishlbsp)
950         {
951                 // LordHavoc: this has to have a minor tolerance (the .1) because of
952                 // minor float precision errors from the box being transformed around
953                 if (boxsize[0] < 32.1)
954                 {
955                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
956                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
957                         else
958                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
959                 }
960                 else
961                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
962         }
963         else
964         {
965                 // LordHavoc: this has to have a minor tolerance (the .1) because of
966                 // minor float precision errors from the box being transformed around
967                 if (boxsize[0] < 32.1)
968                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
969                 else
970                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
971         }
972         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
973         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
974         VectorSubtract(rhc.end, rhc.start, rhc.dist);
975 #if COLLISIONPARANOID >= 2
976         Con_Printf("t(%f %f %f,%f %f %f,%i %f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2], rhc.hull - model->brushq1.hulls, rhc.hull->clip_mins[0], rhc.hull->clip_mins[1], rhc.hull->clip_mins[2]);
977         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
978         {
979
980                 double test[3];
981                 trace_t testtrace;
982                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
983                 memset(&testtrace, 0, sizeof(trace_t));
984                 rhc.trace = &testtrace;
985                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
986                 rhc.trace->fraction = 1;
987                 rhc.trace->realfraction = 1;
988                 rhc.trace->allsolid = true;
989                 VectorCopy(test, rhc.start);
990                 VectorCopy(test, rhc.end);
991                 VectorClear(rhc.dist);
992                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
993                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
994                 if (!trace->startsolid && testtrace.startsolid)
995                         Con_Printf(" - ended in solid!\n");
996         }
997         Con_Print("\n");
998 #else
999         if (VectorLength2(rhc.dist))
1000                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1001         else
1002                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1003 #endif
1004 }
1005
1006 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1007 {
1008         int num = model->brushq1.hulls[0].firstclipnode;
1009         mplane_t *plane;
1010         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1011         mplane_t *planes = model->brushq1.hulls[0].planes;
1012         while (num >= 0)
1013         {
1014                 plane = planes + nodes[num].planenum;
1015                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1016         }
1017         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1018 }
1019
1020 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1021 {
1022 #if 1
1023         colbrushf_t cbox;
1024         colplanef_t cbox_planes[6];
1025         cbox.supercontents = boxsupercontents;
1026         cbox.numplanes = 6;
1027         cbox.numpoints = 0;
1028         cbox.numtriangles = 0;
1029         cbox.planes = cbox_planes;
1030         cbox.points = NULL;
1031         cbox.elements = NULL;
1032         cbox.markframe = 0;
1033         cbox.mins[0] = 0;
1034         cbox.mins[1] = 0;
1035         cbox.mins[2] = 0;
1036         cbox.maxs[0] = 0;
1037         cbox.maxs[1] = 0;
1038         cbox.maxs[2] = 0;
1039         cbox_planes[0].normal[0] =  1;cbox_planes[0].normal[1] =  0;cbox_planes[0].normal[2] =  0;cbox_planes[0].dist = cmaxs[0] - mins[0];
1040         cbox_planes[1].normal[0] = -1;cbox_planes[1].normal[1] =  0;cbox_planes[1].normal[2] =  0;cbox_planes[1].dist = maxs[0] - cmins[0];
1041         cbox_planes[2].normal[0] =  0;cbox_planes[2].normal[1] =  1;cbox_planes[2].normal[2] =  0;cbox_planes[2].dist = cmaxs[1] - mins[1];
1042         cbox_planes[3].normal[0] =  0;cbox_planes[3].normal[1] = -1;cbox_planes[3].normal[2] =  0;cbox_planes[3].dist = maxs[1] - cmins[1];
1043         cbox_planes[4].normal[0] =  0;cbox_planes[4].normal[1] =  0;cbox_planes[4].normal[2] =  1;cbox_planes[4].dist = cmaxs[2] - mins[2];
1044         cbox_planes[5].normal[0] =  0;cbox_planes[5].normal[1] =  0;cbox_planes[5].normal[2] = -1;cbox_planes[5].dist = maxs[2] - cmins[2];
1045         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1046         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1047         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1048         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1049         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1050         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1051         memset(trace, 0, sizeof(trace_t));
1052         trace->hitsupercontentsmask = hitsupercontentsmask;
1053         trace->fraction = 1;
1054         trace->realfraction = 1;
1055         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1056 #else
1057         RecursiveHullCheckTraceInfo_t rhc;
1058         static hull_t box_hull;
1059         static mclipnode_t box_clipnodes[6];
1060         static mplane_t box_planes[6];
1061         // fill in a default trace
1062         memset(&rhc, 0, sizeof(rhc));
1063         memset(trace, 0, sizeof(trace_t));
1064         //To keep everything totally uniform, bounding boxes are turned into small
1065         //BSP trees instead of being compared directly.
1066         // create a temp hull from bounding box sizes
1067         box_planes[0].dist = cmaxs[0] - mins[0];
1068         box_planes[1].dist = cmins[0] - maxs[0];
1069         box_planes[2].dist = cmaxs[1] - mins[1];
1070         box_planes[3].dist = cmins[1] - maxs[1];
1071         box_planes[4].dist = cmaxs[2] - mins[2];
1072         box_planes[5].dist = cmins[2] - maxs[2];
1073 #if COLLISIONPARANOID >= 3
1074         Con_Printf("box_planes %f:%f %f:%f %f:%f\ncbox %f %f %f:%f %f %f\nbox %f %f %f:%f %f %f\n", box_planes[0].dist, box_planes[1].dist, box_planes[2].dist, box_planes[3].dist, box_planes[4].dist, box_planes[5].dist, cmins[0], cmins[1], cmins[2], cmaxs[0], cmaxs[1], cmaxs[2], mins[0], mins[1], mins[2], maxs[0], maxs[1], maxs[2]);
1075 #endif
1076
1077         if (box_hull.clipnodes == NULL)
1078         {
1079                 int i, side;
1080
1081                 //Set up the planes and clipnodes so that the six floats of a bounding box
1082                 //can just be stored out and get a proper hull_t structure.
1083
1084                 box_hull.clipnodes = box_clipnodes;
1085                 box_hull.planes = box_planes;
1086                 box_hull.firstclipnode = 0;
1087                 box_hull.lastclipnode = 5;
1088
1089                 for (i = 0;i < 6;i++)
1090                 {
1091                         box_clipnodes[i].planenum = i;
1092
1093                         side = i&1;
1094
1095                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1096                         if (i != 5)
1097                                 box_clipnodes[i].children[side^1] = i + 1;
1098                         else
1099                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1100
1101                         box_planes[i].type = i>>1;
1102                         box_planes[i].normal[i>>1] = 1;
1103                 }
1104         }
1105
1106         // trace a line through the generated clipping hull
1107         //rhc.boxsupercontents = boxsupercontents;
1108         rhc.hull = &box_hull;
1109         rhc.trace = trace;
1110         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1111         rhc.trace->fraction = 1;
1112         rhc.trace->realfraction = 1;
1113         rhc.trace->allsolid = true;
1114         VectorCopy(start, rhc.start);
1115         VectorCopy(end, rhc.end);
1116         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1117         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1118         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1119         if (rhc.trace->startsupercontents)
1120                 rhc.trace->startsupercontents = boxsupercontents;
1121 #endif
1122 }
1123
1124 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1125 {
1126         memset(trace, 0, sizeof(trace_t));
1127         trace->fraction = 1;
1128         trace->realfraction = 1;
1129         if (BoxesOverlap(start, start, cmins, cmaxs))
1130         {
1131                 trace->startsupercontents |= boxsupercontents;
1132                 if (hitsupercontentsmask & boxsupercontents)
1133                 {
1134                         trace->startsolid = true;
1135                         trace->allsolid = true;
1136                 }
1137         }
1138 }
1139
1140 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1141 {
1142         trace_t trace;
1143         model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1144         return trace.fraction == 1;
1145 }
1146
1147 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(dp_model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
1148 {
1149         int side;
1150         float front, back;
1151         float mid, distz = endz - startz;
1152
1153 loc0:
1154         if (!node->plane)
1155                 return false;           // didn't hit anything
1156
1157         switch (node->plane->type)
1158         {
1159         case PLANE_X:
1160                 node = node->children[x < node->plane->dist];
1161                 goto loc0;
1162         case PLANE_Y:
1163                 node = node->children[y < node->plane->dist];
1164                 goto loc0;
1165         case PLANE_Z:
1166                 side = startz < node->plane->dist;
1167                 if ((endz < node->plane->dist) == side)
1168                 {
1169                         node = node->children[side];
1170                         goto loc0;
1171                 }
1172                 // found an intersection
1173                 mid = node->plane->dist;
1174                 break;
1175         default:
1176                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1177                 front += startz * node->plane->normal[2];
1178                 back += endz * node->plane->normal[2];
1179                 side = front < node->plane->dist;
1180                 if ((back < node->plane->dist) == side)
1181                 {
1182                         node = node->children[side];
1183                         goto loc0;
1184                 }
1185                 // found an intersection
1186                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1187                 break;
1188         }
1189
1190         // go down front side
1191         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1192                 return true;    // hit something
1193         else
1194         {
1195                 // check for impact on this node
1196                 if (node->numsurfaces)
1197                 {
1198                         int i, dsi, dti, lmwidth, lmheight;
1199                         float ds, dt;
1200                         msurface_t *surface;
1201                         unsigned char *lightmap;
1202                         int maps, line3, size3;
1203                         float dsfrac;
1204                         float dtfrac;
1205                         float scale, w, w00, w01, w10, w11;
1206
1207                         surface = model->data_surfaces + node->firstsurface;
1208                         for (i = 0;i < node->numsurfaces;i++, surface++)
1209                         {
1210                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1211                                         continue;       // no lightmaps
1212
1213                                 // location we want to sample in the lightmap
1214                                 ds = ((x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0]) * 0.0625f;
1215                                 dt = ((x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1]) * 0.0625f;
1216
1217                                 // check the bounds
1218                                 dsi = (int)ds;
1219                                 dti = (int)dt;
1220                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1221                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1222
1223                                 // is it in bounds?
1224                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1225                                 {
1226                                         // calculate bilinear interpolation factors
1227                                         // and also multiply by fixedpoint conversion factors
1228                                         dsfrac = ds - dsi;
1229                                         dtfrac = dt - dti;
1230                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1231                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1232                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1233                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1234
1235                                         // values for pointer math
1236                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1237                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1238
1239                                         // look up the pixel
1240                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1241
1242                                         // bilinear filter each lightmap style, and sum them
1243                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1244                                         {
1245                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1246                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1247                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1248                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1249                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1250                                                 lightmap += size3;
1251                                         }
1252
1253                                         return true; // success
1254                                 }
1255                         }
1256                 }
1257
1258                 // go down back side
1259                 node = node->children[side ^ 1];
1260                 startz = mid;
1261                 distz = endz - startz;
1262                 goto loc0;
1263         }
1264 }
1265
1266 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1267 {
1268         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1269         VectorSet(diffusenormal, 0, 0, 1);
1270
1271         if (!model->brushq1.lightdata)
1272         {
1273                 VectorSet(ambientcolor, 1, 1, 1);
1274                 VectorSet(diffusecolor, 0, 0, 0);
1275                 return;
1276         }
1277
1278         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1279 }
1280
1281 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1282 {
1283         int c;
1284         unsigned char *outstart = out;
1285         while (out < outend)
1286         {
1287                 if (in == inend)
1288                 {
1289                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1290                         return;
1291                 }
1292                 c = *in++;
1293                 if (c)
1294                         *out++ = c;
1295                 else
1296                 {
1297                         if (in == inend)
1298                         {
1299                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1300                                 return;
1301                         }
1302                         for (c = *in++;c > 0;c--)
1303                         {
1304                                 if (out == outend)
1305                                 {
1306                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1307                                         return;
1308                                 }
1309                                 *out++ = 0;
1310                         }
1311                 }
1312         }
1313 }
1314
1315 /*
1316 =============
1317 R_Q1BSP_LoadSplitSky
1318
1319 A sky texture is 256*128, with the right side being a masked overlay
1320 ==============
1321 */
1322 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1323 {
1324         int i, j;
1325         unsigned solidpixels[128*128], alphapixels[128*128];
1326
1327         // allocate a texture pool if we need it
1328         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1329                 loadmodel->texturepool = R_AllocTexturePool();
1330
1331         if (bytesperpixel == 4)
1332         {
1333                 for (i = 0;i < 128;i++)
1334                 {
1335                         for (j = 0;j < 128;j++)
1336                         {
1337                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1338                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1339                         }
1340                 }
1341         }
1342         else
1343         {
1344                 // make an average value for the back to avoid
1345                 // a fringe on the top level
1346                 int p, r, g, b;
1347                 union
1348                 {
1349                         unsigned int i;
1350                         unsigned char b[4];
1351                 }
1352                 bgra;
1353                 r = g = b = 0;
1354                 for (i = 0;i < 128;i++)
1355                 {
1356                         for (j = 0;j < 128;j++)
1357                         {
1358                                 p = src[i*256 + j + 128];
1359                                 r += palette_rgb[p][0];
1360                                 g += palette_rgb[p][1];
1361                                 b += palette_rgb[p][2];
1362                         }
1363                 }
1364                 bgra.b[2] = r/(128*128);
1365                 bgra.b[1] = g/(128*128);
1366                 bgra.b[0] = b/(128*128);
1367                 bgra.b[3] = 0;
1368                 for (i = 0;i < 128;i++)
1369                 {
1370                         for (j = 0;j < 128;j++)
1371                         {
1372                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1373                                 p = src[i*256 + j];
1374                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1375                         }
1376                 }
1377         }
1378
1379         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1380         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1381 }
1382
1383 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1384 {
1385         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1386         skinframe_t *skinframe;
1387         miptex_t *dmiptex;
1388         texture_t *tx, *tx2, *anims[10], *altanims[10];
1389         dmiptexlump_t *m;
1390         unsigned char *data, *mtdata;
1391         const char *s;
1392         char mapname[MAX_QPATH], name[MAX_QPATH];
1393         unsigned char zero[4];
1394
1395         memset(zero, 0, sizeof(zero));
1396
1397         loadmodel->data_textures = NULL;
1398
1399         // add two slots for notexture walls and notexture liquids
1400         if (l->filelen)
1401         {
1402                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1403                 m->nummiptex = LittleLong (m->nummiptex);
1404                 loadmodel->num_textures = m->nummiptex + 2;
1405                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1406         }
1407         else
1408         {
1409                 m = NULL;
1410                 loadmodel->num_textures = 2;
1411                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1412         }
1413
1414         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1415
1416         // fill out all slots with notexture
1417         if (cls.state != ca_dedicated)
1418                 skinframe = R_SkinFrame_LoadMissing();
1419         else
1420                 skinframe = NULL;
1421         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1422         {
1423                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1424                 tx->width = 16;
1425                 tx->height = 16;
1426                 if (cls.state != ca_dedicated)
1427                 {
1428                         tx->numskinframes = 1;
1429                         tx->skinframerate = 1;
1430                         tx->skinframes[0] = skinframe;
1431                         tx->currentskinframe = tx->skinframes[0];
1432                 }
1433                 tx->basematerialflags = MATERIALFLAG_WALL;
1434                 if (i == loadmodel->num_textures - 1)
1435                 {
1436                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1437                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1438                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1439                 }
1440                 else
1441                 {
1442                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1443                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1444                 }
1445                 tx->currentframe = tx;
1446
1447                 // clear water settings
1448                 tx->reflectmin = 0;
1449                 tx->reflectmax = 1;
1450                 tx->refractfactor = 1;
1451                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1452                 tx->reflectfactor = 1;
1453                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1454                 tx->r_water_wateralpha = 1;
1455         }
1456
1457         if (!m)
1458         {
1459                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1460                 return;
1461         }
1462
1463         s = loadmodel->name;
1464         if (!strncasecmp(s, "maps/", 5))
1465                 s += 5;
1466         FS_StripExtension(s, mapname, sizeof(mapname));
1467
1468         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1469         dofs = m->dataofs;
1470         // LordHavoc: mostly rewritten map texture loader
1471         for (i = 0;i < m->nummiptex;i++)
1472         {
1473                 dofs[i] = LittleLong(dofs[i]);
1474                 if (r_nosurftextures.integer)
1475                         continue;
1476                 if (dofs[i] == -1)
1477                 {
1478                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1479                         continue;
1480                 }
1481                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1482
1483                 // copy name, but only up to 16 characters
1484                 // (the output buffer can hold more than this, but the input buffer is
1485                 //  only 16)
1486                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1487                         name[j] = dmiptex->name[j];
1488                 name[j] = 0;
1489
1490                 if (!name[0])
1491                 {
1492                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1493                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1494                 }
1495
1496                 mtwidth = LittleLong(dmiptex->width);
1497                 mtheight = LittleLong(dmiptex->height);
1498                 mtdata = NULL;
1499                 j = LittleLong(dmiptex->offsets[0]);
1500                 if (j)
1501                 {
1502                         // texture included
1503                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1504                         {
1505                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1506                                 continue;
1507                         }
1508                         mtdata = (unsigned char *)dmiptex + j;
1509                 }
1510
1511                 if ((mtwidth & 15) || (mtheight & 15))
1512                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1513
1514                 // LordHavoc: force all names to lowercase
1515                 for (j = 0;name[j];j++)
1516                         if (name[j] >= 'A' && name[j] <= 'Z')
1517                                 name[j] += 'a' - 'A';
1518
1519                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1520                         continue;
1521
1522                 tx = loadmodel->data_textures + i;
1523                 strlcpy(tx->name, name, sizeof(tx->name));
1524                 tx->width = mtwidth;
1525                 tx->height = mtheight;
1526
1527                 if (tx->name[0] == '*')
1528                 {
1529                         if (!strncmp(tx->name, "*lava", 5))
1530                         {
1531                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1532                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1533                         }
1534                         else if (!strncmp(tx->name, "*slime", 6))
1535                         {
1536                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1537                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1538                         }
1539                         else
1540                         {
1541                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1542                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1543                         }
1544                 }
1545                 else if (!strncmp(tx->name, "sky", 3))
1546                 {
1547                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1548                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1549                 }
1550                 else
1551                 {
1552                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1553                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1554                 }
1555
1556                 if (cls.state != ca_dedicated)
1557                 {
1558                         // LordHavoc: HL sky textures are entirely different than quake
1559                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1560                         {
1561                                 data = loadimagepixelsbgra(tx->name, false, false);
1562                                 if (data && image_width == 256 && image_height == 128)
1563                                 {
1564                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1565                                         Mem_Free(data);
1566                                 }
1567                                 else if (mtdata != NULL)
1568                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1569                         }
1570                         else
1571                         {
1572                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1573                                 if (!skinframe)
1574                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1575                                 if (!skinframe)
1576                                 {
1577                                         // did not find external texture, load it from the bsp or wad3
1578                                         if (loadmodel->brush.ishlbsp)
1579                                         {
1580                                                 // internal texture overrides wad
1581                                                 unsigned char *pixels, *freepixels;
1582                                                 pixels = freepixels = NULL;
1583                                                 if (mtdata)
1584                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1585                                                 if (pixels == NULL)
1586                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1587                                                 if (pixels != NULL)
1588                                                 {
1589                                                         tx->width = image_width;
1590                                                         tx->height = image_height;
1591                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1592                                                 }
1593                                                 if (freepixels)
1594                                                         Mem_Free(freepixels);
1595                                         }
1596                                         else if (mtdata) // texture included
1597                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1598                                 }
1599                                 // if skinframe is still NULL the "missing" texture will be used
1600                                 if (skinframe)
1601                                         tx->skinframes[0] = skinframe;
1602                         }
1603
1604                         tx->basematerialflags = MATERIALFLAG_WALL;
1605                         if (tx->name[0] == '*')
1606                         {
1607                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1608                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1609                                 {
1610                                         // replace the texture with transparent black
1611                                         Vector4Set(zero, 128, 128, 128, 128);
1612                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1613                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1614                                 }
1615                                 else if (!strncmp(tx->name,"*lava",5)
1616                                  || !strncmp(tx->name,"*teleport",9)
1617                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1618                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1619                                 else
1620                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1621                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1622                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1623                         }
1624                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1625                         {
1626                                 // replace the texture with black
1627                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1628                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1629                         }
1630                         else if (!strncmp(tx->name, "sky", 3))
1631                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1632                         else if (!strcmp(tx->name, "caulk"))
1633                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1634                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1635                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1636
1637                         // start out with no animation
1638                         tx->currentframe = tx;
1639                         tx->currentskinframe = tx->skinframes[0];
1640                 }
1641         }
1642
1643         // sequence the animations
1644         for (i = 0;i < m->nummiptex;i++)
1645         {
1646                 tx = loadmodel->data_textures + i;
1647                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1648                         continue;
1649                 if (tx->anim_total[0] || tx->anim_total[1])
1650                         continue;       // already sequenced
1651
1652                 // find the number of frames in the animation
1653                 memset(anims, 0, sizeof(anims));
1654                 memset(altanims, 0, sizeof(altanims));
1655
1656                 for (j = i;j < m->nummiptex;j++)
1657                 {
1658                         tx2 = loadmodel->data_textures + j;
1659                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1660                                 continue;
1661
1662                         num = tx2->name[1];
1663                         if (num >= '0' && num <= '9')
1664                                 anims[num - '0'] = tx2;
1665                         else if (num >= 'a' && num <= 'j')
1666                                 altanims[num - 'a'] = tx2;
1667                         else
1668                                 Con_Printf("Bad animating texture %s\n", tx->name);
1669                 }
1670
1671                 max = altmax = 0;
1672                 for (j = 0;j < 10;j++)
1673                 {
1674                         if (anims[j])
1675                                 max = j + 1;
1676                         if (altanims[j])
1677                                 altmax = j + 1;
1678                 }
1679                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1680
1681                 incomplete = false;
1682                 for (j = 0;j < max;j++)
1683                 {
1684                         if (!anims[j])
1685                         {
1686                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1687                                 incomplete = true;
1688                         }
1689                 }
1690                 for (j = 0;j < altmax;j++)
1691                 {
1692                         if (!altanims[j])
1693                         {
1694                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1695                                 incomplete = true;
1696                         }
1697                 }
1698                 if (incomplete)
1699                         continue;
1700
1701                 if (altmax < 1)
1702                 {
1703                         // if there is no alternate animation, duplicate the primary
1704                         // animation into the alternate
1705                         altmax = max;
1706                         for (k = 0;k < 10;k++)
1707                                 altanims[k] = anims[k];
1708                 }
1709
1710                 // link together the primary animation
1711                 for (j = 0;j < max;j++)
1712                 {
1713                         tx2 = anims[j];
1714                         tx2->animated = true;
1715                         tx2->anim_total[0] = max;
1716                         tx2->anim_total[1] = altmax;
1717                         for (k = 0;k < 10;k++)
1718                         {
1719                                 tx2->anim_frames[0][k] = anims[k];
1720                                 tx2->anim_frames[1][k] = altanims[k];
1721                         }
1722                 }
1723
1724                 // if there really is an alternate anim...
1725                 if (anims[0] != altanims[0])
1726                 {
1727                         // link together the alternate animation
1728                         for (j = 0;j < altmax;j++)
1729                         {
1730                                 tx2 = altanims[j];
1731                                 tx2->animated = true;
1732                                 // the primary/alternate are reversed here
1733                                 tx2->anim_total[0] = altmax;
1734                                 tx2->anim_total[1] = max;
1735                                 for (k = 0;k < 10;k++)
1736                                 {
1737                                         tx2->anim_frames[0][k] = altanims[k];
1738                                         tx2->anim_frames[1][k] = anims[k];
1739                                 }
1740                         }
1741                 }
1742         }
1743 }
1744
1745 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1746 {
1747         int i;
1748         unsigned char *in, *out, *data, d;
1749         char litfilename[MAX_QPATH];
1750         char dlitfilename[MAX_QPATH];
1751         fs_offset_t filesize;
1752         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1753         {
1754                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1755                 for (i=0; i<l->filelen; i++)
1756                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1757         }
1758         else // LordHavoc: bsp version 29 (normal white lighting)
1759         {
1760                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1761                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1762                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1763                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1764                 strlcat (litfilename, ".lit", sizeof (litfilename));
1765                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1766                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1767                 if (data)
1768                 {
1769                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1770                         {
1771                                 i = LittleLong(((int *)data)[1]);
1772                                 if (i == 1)
1773                                 {
1774                                         if (developer_loading.integer)
1775                                                 Con_Printf("loaded %s\n", litfilename);
1776                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1777                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1778                                         Mem_Free(data);
1779                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1780                                         if (data)
1781                                         {
1782                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1783                                                 {
1784                                                         i = LittleLong(((int *)data)[1]);
1785                                                         if (i == 1)
1786                                                         {
1787                                                                 if (developer_loading.integer)
1788                                                                         Con_Printf("loaded %s\n", dlitfilename);
1789                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1790                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1791                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1792                                                                 loadmodel->brushq3.deluxemapping = true;
1793                                                         }
1794                                                 }
1795                                                 Mem_Free(data);
1796                                                 data = NULL;
1797                                         }
1798                                         return;
1799                                 }
1800                                 else
1801                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1802                         }
1803                         else if (filesize == 8)
1804                                 Con_Print("Empty .lit file, ignoring\n");
1805                         else
1806                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1807                         if (data)
1808                         {
1809                                 Mem_Free(data);
1810                                 data = NULL;
1811                         }
1812                 }
1813                 // LordHavoc: oh well, expand the white lighting data
1814                 if (!l->filelen)
1815                         return;
1816                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1817                 in = mod_base + l->fileofs;
1818                 out = loadmodel->brushq1.lightdata;
1819                 for (i = 0;i < l->filelen;i++)
1820                 {
1821                         d = *in++;
1822                         *out++ = d;
1823                         *out++ = d;
1824                         *out++ = d;
1825                 }
1826         }
1827 }
1828
1829 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1830 {
1831         loadmodel->brushq1.num_compressedpvs = 0;
1832         loadmodel->brushq1.data_compressedpvs = NULL;
1833         if (!l->filelen)
1834                 return;
1835         loadmodel->brushq1.num_compressedpvs = l->filelen;
1836         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1837         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1838 }
1839
1840 // used only for HalfLife maps
1841 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1842 {
1843         char key[128], value[4096];
1844         int i, j, k;
1845         if (!data)
1846                 return;
1847         if (!COM_ParseToken_Simple(&data, false, false))
1848                 return; // error
1849         if (com_token[0] != '{')
1850                 return; // error
1851         while (1)
1852         {
1853                 if (!COM_ParseToken_Simple(&data, false, false))
1854                         return; // error
1855                 if (com_token[0] == '}')
1856                         break; // end of worldspawn
1857                 if (com_token[0] == '_')
1858                         strlcpy(key, com_token + 1, sizeof(key));
1859                 else
1860                         strlcpy(key, com_token, sizeof(key));
1861                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1862                         key[strlen(key)-1] = 0;
1863                 if (!COM_ParseToken_Simple(&data, false, false))
1864                         return; // error
1865                 dpsnprintf(value, sizeof(value), "%s", com_token);
1866                 if (!strcmp("wad", key)) // for HalfLife maps
1867                 {
1868                         if (loadmodel->brush.ishlbsp)
1869                         {
1870                                 j = 0;
1871                                 for (i = 0;i < (int)sizeof(value);i++)
1872                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1873                                                 break;
1874                                 if (value[i])
1875                                 {
1876                                         for (;i < (int)sizeof(value);i++)
1877                                         {
1878                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1879                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1880                                                         j = i+1;
1881                                                 else if (value[i] == ';' || value[i] == 0)
1882                                                 {
1883                                                         k = value[i];
1884                                                         value[i] = 0;
1885                                                         W_LoadTextureWadFile(&value[j], false);
1886                                                         j = i+1;
1887                                                         if (!k)
1888                                                                 break;
1889                                                 }
1890                                         }
1891                                 }
1892                         }
1893                 }
1894         }
1895 }
1896
1897 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1898 {
1899         loadmodel->brush.entities = NULL;
1900         if (!l->filelen)
1901                 return;
1902         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1903         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1904         loadmodel->brush.entities[l->filelen] = 0;
1905         if (loadmodel->brush.ishlbsp)
1906                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1907 }
1908
1909
1910 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1911 {
1912         dvertex_t       *in;
1913         mvertex_t       *out;
1914         int                     i, count;
1915
1916         in = (dvertex_t *)(mod_base + l->fileofs);
1917         if (l->filelen % sizeof(*in))
1918                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1919         count = l->filelen / sizeof(*in);
1920         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1921
1922         loadmodel->brushq1.vertexes = out;
1923         loadmodel->brushq1.numvertexes = count;
1924
1925         for ( i=0 ; i<count ; i++, in++, out++)
1926         {
1927                 out->position[0] = LittleFloat(in->point[0]);
1928                 out->position[1] = LittleFloat(in->point[1]);
1929                 out->position[2] = LittleFloat(in->point[2]);
1930         }
1931 }
1932
1933 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1934 // can be used for this
1935 // REMOVEME
1936 int SB_ReadInt (unsigned char **buffer)
1937 {
1938         int     i;
1939         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1940         (*buffer) += 4;
1941         return i;
1942 }
1943
1944 // REMOVEME
1945 float SB_ReadFloat (unsigned char **buffer)
1946 {
1947         union
1948         {
1949                 int             i;
1950                 float   f;
1951         } u;
1952
1953         u.i = SB_ReadInt (buffer);
1954         return u.f;
1955 }
1956
1957 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1958 {
1959         unsigned char           *index;
1960         dmodel_t        *out;
1961         int                     i, j, count;
1962
1963         index = (unsigned char *)(mod_base + l->fileofs);
1964         if (l->filelen % (48+4*hullinfo->filehulls))
1965                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1966
1967         count = l->filelen / (48+4*hullinfo->filehulls);
1968         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1969
1970         loadmodel->brushq1.submodels = out;
1971         loadmodel->brush.numsubmodels = count;
1972
1973         for (i = 0; i < count; i++, out++)
1974         {
1975         // spread out the mins / maxs by a pixel
1976                 out->mins[0] = SB_ReadFloat (&index) - 1;
1977                 out->mins[1] = SB_ReadFloat (&index) - 1;
1978                 out->mins[2] = SB_ReadFloat (&index) - 1;
1979                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1980                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1981                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1982                 out->origin[0] = SB_ReadFloat (&index);
1983                 out->origin[1] = SB_ReadFloat (&index);
1984                 out->origin[2] = SB_ReadFloat (&index);
1985                 for (j = 0; j < hullinfo->filehulls; j++)
1986                         out->headnode[j] = SB_ReadInt (&index);
1987                 out->visleafs = SB_ReadInt (&index);
1988                 out->firstface = SB_ReadInt (&index);
1989                 out->numfaces = SB_ReadInt (&index);
1990         }
1991 }
1992
1993 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1994 {
1995         dedge_t *in;
1996         medge_t *out;
1997         int     i, count;
1998
1999         in = (dedge_t *)(mod_base + l->fileofs);
2000         if (l->filelen % sizeof(*in))
2001                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2002         count = l->filelen / sizeof(*in);
2003         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2004
2005         loadmodel->brushq1.edges = out;
2006         loadmodel->brushq1.numedges = count;
2007
2008         for ( i=0 ; i<count ; i++, in++, out++)
2009         {
2010                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2011                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2012                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2013                 {
2014                         Con_Printf("Mod_Q1BSP_LoadEdges: %s has invalid vertex indices in edge %i (vertices %i %i >= numvertices %i)\n", loadmodel->name, i, out->v[0], out->v[1], loadmodel->brushq1.numvertexes);
2015                         if(!loadmodel->brushq1.numvertexes)
2016                                 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2017                                 
2018                         out->v[0] = 0;
2019                         out->v[1] = 0;
2020                 }
2021         }
2022 }
2023
2024 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2025 {
2026         texinfo_t *in;
2027         mtexinfo_t *out;
2028         int i, j, k, count, miptex;
2029
2030         in = (texinfo_t *)(mod_base + l->fileofs);
2031         if (l->filelen % sizeof(*in))
2032                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2033         count = l->filelen / sizeof(*in);
2034         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2035
2036         loadmodel->brushq1.texinfo = out;
2037         loadmodel->brushq1.numtexinfo = count;
2038
2039         for (i = 0;i < count;i++, in++, out++)
2040         {
2041                 for (k = 0;k < 2;k++)
2042                         for (j = 0;j < 4;j++)
2043                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2044
2045                 miptex = LittleLong(in->miptex);
2046                 out->flags = LittleLong(in->flags);
2047
2048                 out->texture = NULL;
2049                 if (loadmodel->data_textures)
2050                 {
2051                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2052                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2053                         else
2054                                 out->texture = loadmodel->data_textures + miptex;
2055                 }
2056                 if (out->flags & TEX_SPECIAL)
2057                 {
2058                         // if texture chosen is NULL or the shader needs a lightmap,
2059                         // force to notexture water shader
2060                         if (out->texture == NULL)
2061                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2062                 }
2063                 else
2064                 {
2065                         // if texture chosen is NULL, force to notexture
2066                         if (out->texture == NULL)
2067                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2068                 }
2069         }
2070 }
2071
2072 #if 0
2073 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2074 {
2075         int             i, j;
2076         float   *v;
2077
2078         mins[0] = mins[1] = mins[2] = 9999;
2079         maxs[0] = maxs[1] = maxs[2] = -9999;
2080         v = verts;
2081         for (i = 0;i < numverts;i++)
2082         {
2083                 for (j = 0;j < 3;j++, v++)
2084                 {
2085                         if (*v < mins[j])
2086                                 mins[j] = *v;
2087                         if (*v > maxs[j])
2088                                 maxs[j] = *v;
2089                 }
2090         }
2091 }
2092
2093 #define MAX_SUBDIVPOLYTRIANGLES 4096
2094 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2095
2096 static int subdivpolyverts, subdivpolytriangles;
2097 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2098 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2099
2100 static int subdivpolylookupvert(vec3_t v)
2101 {
2102         int i;
2103         for (i = 0;i < subdivpolyverts;i++)
2104                 if (subdivpolyvert[i][0] == v[0]
2105                  && subdivpolyvert[i][1] == v[1]
2106                  && subdivpolyvert[i][2] == v[2])
2107                         return i;
2108         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2109                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2110         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2111         return subdivpolyverts++;
2112 }
2113
2114 static void SubdividePolygon(int numverts, float *verts)
2115 {
2116         int             i, i1, i2, i3, f, b, c, p;
2117         vec3_t  mins, maxs, front[256], back[256];
2118         float   m, *pv, *cv, dist[256], frac;
2119
2120         if (numverts > 250)
2121                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2122
2123         BoundPoly(numverts, verts, mins, maxs);
2124
2125         for (i = 0;i < 3;i++)
2126         {
2127                 m = (mins[i] + maxs[i]) * 0.5;
2128                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2129                 if (maxs[i] - m < 8)
2130                         continue;
2131                 if (m - mins[i] < 8)
2132                         continue;
2133
2134                 // cut it
2135                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2136                         dist[c] = cv[i] - m;
2137
2138                 f = b = 0;
2139                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2140                 {
2141                         if (dist[p] >= 0)
2142                         {
2143                                 VectorCopy(pv, front[f]);
2144                                 f++;
2145                         }
2146                         if (dist[p] <= 0)
2147                         {
2148                                 VectorCopy(pv, back[b]);
2149                                 b++;
2150                         }
2151                         if (dist[p] == 0 || dist[c] == 0)
2152                                 continue;
2153                         if ((dist[p] > 0) != (dist[c] > 0) )
2154                         {
2155                                 // clip point
2156                                 frac = dist[p] / (dist[p] - dist[c]);
2157                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2158                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2159                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2160                                 f++;
2161                                 b++;
2162                         }
2163                 }
2164
2165                 SubdividePolygon(f, front[0]);
2166                 SubdividePolygon(b, back[0]);
2167                 return;
2168         }
2169
2170         i1 = subdivpolylookupvert(verts);
2171         i2 = subdivpolylookupvert(verts + 3);
2172         for (i = 2;i < numverts;i++)
2173         {
2174                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2175                 {
2176                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2177                         return;
2178                 }
2179
2180                 i3 = subdivpolylookupvert(verts + i * 3);
2181                 subdivpolyindex[subdivpolytriangles][0] = i1;
2182                 subdivpolyindex[subdivpolytriangles][1] = i2;
2183                 subdivpolyindex[subdivpolytriangles][2] = i3;
2184                 i2 = i3;
2185                 subdivpolytriangles++;
2186         }
2187 }
2188
2189 //Breaks a polygon up along axial 64 unit
2190 //boundaries so that turbulent and sky warps
2191 //can be done reasonably.
2192 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2193 {
2194         int i, j;
2195         surfvertex_t *v;
2196         surfmesh_t *mesh;
2197
2198         subdivpolytriangles = 0;
2199         subdivpolyverts = 0;
2200         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2201         if (subdivpolytriangles < 1)
2202                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2203
2204         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2205         mesh->num_vertices = subdivpolyverts;
2206         mesh->num_triangles = subdivpolytriangles;
2207         mesh->vertex = (surfvertex_t *)(mesh + 1);
2208         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2209         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2210
2211         for (i = 0;i < mesh->num_triangles;i++)
2212                 for (j = 0;j < 3;j++)
2213                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2214
2215         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2216         {
2217                 VectorCopy(subdivpolyvert[i], v->v);
2218                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2219                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2220         }
2221 }
2222 #endif
2223
2224 /* Maximum size of a single LM */
2225 #define MAX_SINGLE_LM_SIZE    256
2226
2227 struct alloc_lm_row
2228 {
2229         int rowY;
2230         int currentX;
2231 };
2232
2233 struct alloc_lm_state
2234 {
2235         int currentY;
2236         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2237 };
2238
2239 static void init_alloc_lm_state (struct alloc_lm_state* state)
2240 {
2241         int r;
2242
2243         state->currentY = 0;
2244         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2245         {
2246           state->rows[r].currentX = 0;
2247           state->rows[r].rowY = -1;
2248         }
2249 }
2250
2251 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2252 {
2253         struct alloc_lm_row* row;
2254         int r;
2255
2256         row = &(state->rows[blockheight]);
2257         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2258         {
2259                 if (state->currentY + blockheight <= totalheight)
2260                 {
2261                         row->rowY = state->currentY;
2262                         row->currentX = 0;
2263                         state->currentY += blockheight;
2264                 }
2265                 else
2266                 {
2267                         /* See if we can stuff the block into a higher row */
2268                         row = NULL;
2269                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2270                         {
2271                                 if ((state->rows[r].rowY >= 0)
2272                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2273                                 {
2274                                         row = &(state->rows[r]);
2275                                         break;
2276                                 }
2277                         }
2278                         if (row == NULL) return false;
2279                 }
2280         }
2281         *outy = row->rowY;
2282         *outx = row->currentX;
2283         row->currentX += blockwidth;
2284
2285         return true;
2286 }
2287
2288 extern cvar_t gl_max_size;
2289 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2290 {
2291         dface_t *in;
2292         msurface_t *surface;
2293         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2294         float texmins[2], texmaxs[2], val;
2295         rtexture_t *lightmaptexture, *deluxemaptexture;
2296
2297         in = (dface_t *)(mod_base + l->fileofs);
2298         if (l->filelen % sizeof(*in))
2299                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2300         count = l->filelen / sizeof(*in);
2301         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2302         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2303
2304         loadmodel->num_surfaces = count;
2305
2306         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2307
2308         totalverts = 0;
2309         totaltris = 0;
2310         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2311         {
2312                 numedges = (unsigned short)LittleShort(in->numedges);
2313                 totalverts += numedges;
2314                 totaltris += numedges - 2;
2315         }
2316
2317         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2318
2319         lightmaptexture = NULL;
2320         deluxemaptexture = r_texture_blanknormalmap;
2321         lightmapnumber = 1;
2322         lightmapsize = max(256, gl_max_size.integer);
2323         totallightmapsamples = 0;
2324
2325         totalverts = 0;
2326         totaltris = 0;
2327         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2328         {
2329                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2330
2331                 // FIXME: validate edges, texinfo, etc?
2332                 firstedge = LittleLong(in->firstedge);
2333                 numedges = (unsigned short)LittleShort(in->numedges);
2334                 if ((unsigned int) firstedge > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) firstedge + (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges)
2335                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2336                 i = (unsigned short)LittleShort(in->texinfo);
2337                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2338                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2339                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2340                 surface->texture = surface->lightmapinfo->texinfo->texture;
2341
2342                 planenum = (unsigned short)LittleShort(in->planenum);
2343                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2344                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2345
2346                 //surface->flags = surface->texture->flags;
2347                 //if (LittleShort(in->side))
2348                 //      surface->flags |= SURF_PLANEBACK;
2349                 //surface->plane = loadmodel->brush.data_planes + planenum;
2350
2351                 surface->num_firstvertex = totalverts;
2352                 surface->num_vertices = numedges;
2353                 surface->num_firsttriangle = totaltris;
2354                 surface->num_triangles = numedges - 2;
2355                 totalverts += numedges;
2356                 totaltris += numedges - 2;
2357
2358                 // convert edges back to a normal polygon
2359                 for (i = 0;i < surface->num_vertices;i++)
2360                 {
2361                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2362                         float s, t;
2363                         // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2364                         if (lindex >= 0)
2365                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2366                         else
2367                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2368                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2369                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2370                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2371                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2372                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2373                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2374                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2375                 }
2376
2377                 for (i = 0;i < surface->num_triangles;i++)
2378                 {
2379                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2380                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2381                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2382                 }
2383
2384                 // compile additional data about the surface geometry
2385                 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2386                 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2387                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2388
2389                 // generate surface extents information
2390                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2391                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2392                 for (i = 1;i < surface->num_vertices;i++)
2393                 {
2394                         for (j = 0;j < 2;j++)
2395                         {
2396                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2397                                 texmins[j] = min(texmins[j], val);
2398                                 texmaxs[j] = max(texmaxs[j], val);
2399                         }
2400                 }
2401                 for (i = 0;i < 2;i++)
2402                 {
2403                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2404                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2405                 }
2406
2407                 smax = surface->lightmapinfo->extents[0] >> 4;
2408                 tmax = surface->lightmapinfo->extents[1] >> 4;
2409                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2410                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2411
2412                 // lighting info
2413                 for (i = 0;i < MAXLIGHTMAPS;i++)
2414                         surface->lightmapinfo->styles[i] = in->styles[i];
2415                 surface->lightmaptexture = NULL;
2416                 surface->deluxemaptexture = r_texture_blanknormalmap;
2417                 i = LittleLong(in->lightofs);
2418                 if (i == -1)
2419                 {
2420                         surface->lightmapinfo->samples = NULL;
2421 #if 0
2422                         // give non-lightmapped water a 1x white lightmap
2423                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2424                         {
2425                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2426                                 surface->lightmapinfo->styles[0] = 0;
2427                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2428                         }
2429 #endif
2430                 }
2431                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2432                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2433                 else // LordHavoc: white lighting (bsp version 29)
2434                 {
2435                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2436                         if (loadmodel->brushq1.nmaplightdata)
2437                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2438                 }
2439
2440                 // check if we should apply a lightmap to this
2441                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2442                 {
2443                         if (ssize > 256 || tsize > 256)
2444                                 Host_Error("Bad surface extents");
2445
2446                         if (lightmapsize < ssize)
2447                                 lightmapsize = ssize;
2448                         if (lightmapsize < tsize)
2449                                 lightmapsize = tsize;
2450
2451                         totallightmapsamples += ssize*tsize;
2452
2453                         // force lightmap upload on first time seeing the surface
2454                         //
2455                         // additionally this is used by the later code to see if a
2456                         // lightmap is needed on this surface (rather than duplicating the
2457                         // logic above)
2458                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2459                 }
2460         }
2461
2462         // small maps (such as ammo boxes especially) don't need big lightmap
2463         // textures, so this code tries to guess a good size based on
2464         // totallightmapsamples (size of the lightmaps lump basically), as well as
2465         // trying to max out the gl_max_size if there is a lot of lightmap data to
2466         // store
2467         // additionally, never choose a lightmapsize that is smaller than the
2468         // largest surface encountered (as it would fail)
2469         i = lightmapsize;
2470         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2471                 ;
2472
2473         // now that we've decided the lightmap texture size, we can do the rest
2474         if (cls.state != ca_dedicated)
2475         {
2476                 int stainmapsize = 0;
2477                 struct alloc_lm_state allocState;
2478
2479                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2480                 {
2481                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2482                         float u, v, ubase, vbase, uscale, vscale;
2483
2484                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2485                                 continue;
2486
2487                         smax = surface->lightmapinfo->extents[0] >> 4;
2488                         tmax = surface->lightmapinfo->extents[1] >> 4;
2489                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2490                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2491                         stainmapsize += ssize * tsize * 3;
2492
2493                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2494                         {
2495                                 // allocate a texture pool if we need it
2496                                 if (loadmodel->texturepool == NULL)
2497                                         loadmodel->texturepool = R_AllocTexturePool();
2498                                 // could not find room, make a new lightmap
2499                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2500                                 if (loadmodel->brushq1.nmaplightdata)
2501                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2502                                 lightmapnumber++;
2503                                 init_alloc_lm_state (&allocState);
2504                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2505                         }
2506                         surface->lightmaptexture = lightmaptexture;
2507                         surface->deluxemaptexture = deluxemaptexture;
2508                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2509                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2510
2511                         uscale = 1.0f / (float)lightmapsize;
2512                         vscale = 1.0f / (float)lightmapsize;
2513                         ubase = lightmapx * uscale;
2514                         vbase = lightmapy * vscale;
2515
2516                         for (i = 0;i < surface->num_vertices;i++)
2517                         {
2518                                 u = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2519                                 v = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2520                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2521                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2522                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2523                                 iu = (int) u;
2524                                 iv = (int) v;
2525                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2526                         }
2527                 }
2528
2529                 if (cl_stainmaps.integer)
2530                 {
2531                         // allocate stainmaps for permanent marks on walls and clear white
2532                         unsigned char *stainsamples = NULL;
2533                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2534                         memset(stainsamples, 255, stainmapsize);
2535                         // assign pointers
2536                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2537                         {
2538                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2539                                         continue;
2540                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2541                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2542                                 surface->lightmapinfo->stainsamples = stainsamples;
2543                                 stainsamples += ssize * tsize * 3;
2544                         }
2545                 }
2546         }
2547
2548         // generate ushort elements array if possible
2549         if (loadmodel->surfmesh.data_element3s)
2550                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2551                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2552 }
2553
2554 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2555 {
2556         //if (node->parent)
2557         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2558         node->parent = parent;
2559         if (node->plane)
2560         {
2561                 // this is a node, recurse to children
2562                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2563                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2564                 // combine supercontents of children
2565                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2566         }
2567         else
2568         {
2569                 int j;
2570                 mleaf_t *leaf = (mleaf_t *)node;
2571                 // if this is a leaf, calculate supercontents mask from all collidable
2572                 // primitives in the leaf (brushes and collision surfaces)
2573                 // also flag if the leaf contains any collision surfaces
2574                 leaf->combinedsupercontents = 0;
2575                 // combine the supercontents values of all brushes in this leaf
2576                 for (j = 0;j < leaf->numleafbrushes;j++)
2577                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2578                 // check if this leaf contains any collision surfaces (q3 patches)
2579                 for (j = 0;j < leaf->numleafsurfaces;j++)
2580                 {
2581                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2582                         if (surface->num_collisiontriangles)
2583                         {
2584                                 leaf->containscollisionsurfaces = true;
2585                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2586                         }
2587                 }
2588         }
2589 }
2590
2591 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2592 {
2593         int                     i, j, count, p;
2594         dnode_t         *in;
2595         mnode_t         *out;
2596
2597         in = (dnode_t *)(mod_base + l->fileofs);
2598         if (l->filelen % sizeof(*in))
2599                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2600         count = l->filelen / sizeof(*in);
2601         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2602
2603         loadmodel->brush.data_nodes = out;
2604         loadmodel->brush.num_nodes = count;
2605
2606         for ( i=0 ; i<count ; i++, in++, out++)
2607         {
2608                 for (j=0 ; j<3 ; j++)
2609                 {
2610                         out->mins[j] = LittleShort(in->mins[j]);
2611                         out->maxs[j] = LittleShort(in->maxs[j]);
2612                 }
2613
2614                 p = LittleLong(in->planenum);
2615                 out->plane = loadmodel->brush.data_planes + p;
2616
2617                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2618                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2619
2620                 for (j=0 ; j<2 ; j++)
2621                 {
2622                         // LordHavoc: this code supports broken bsp files produced by
2623                         // arguire qbsp which can produce more than 32768 nodes, any value
2624                         // below count is assumed to be a node number, any other value is
2625                         // assumed to be a leaf number
2626                         p = (unsigned short)LittleShort(in->children[j]);
2627                         if (p < count)
2628                         {
2629                                 if (p < loadmodel->brush.num_nodes)
2630                                         out->children[j] = loadmodel->brush.data_nodes + p;
2631                                 else
2632                                 {
2633                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2634                                         // map it to the solid leaf
2635                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2636                                 }
2637                         }
2638                         else
2639                         {
2640                                 // note this uses 65535 intentionally, -1 is leaf 0
2641                                 p = 65535 - p;
2642                                 if (p < loadmodel->brush.num_leafs)
2643                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2644                                 else
2645                                 {
2646                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2647                                         // map it to the solid leaf
2648                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2649                                 }
2650                         }
2651                 }
2652         }
2653
2654         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2655 }
2656
2657 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2658 {
2659         dleaf_t *in;
2660         mleaf_t *out;
2661         int i, j, count, p;
2662
2663         in = (dleaf_t *)(mod_base + l->fileofs);
2664         if (l->filelen % sizeof(*in))
2665                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2666         count = l->filelen / sizeof(*in);
2667         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2668
2669         loadmodel->brush.data_leafs = out;
2670         loadmodel->brush.num_leafs = count;
2671         // get visleafs from the submodel data
2672         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2673         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2674         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2675         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2676
2677         for ( i=0 ; i<count ; i++, in++, out++)
2678         {
2679                 for (j=0 ; j<3 ; j++)
2680                 {
2681                         out->mins[j] = LittleShort(in->mins[j]);
2682                         out->maxs[j] = LittleShort(in->maxs[j]);
2683                 }
2684
2685                 // FIXME: this function could really benefit from some error checking
2686
2687                 out->contents = LittleLong(in->contents);
2688
2689                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2690                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2691                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2692                 {
2693                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2694                         out->firstleafsurface = NULL;
2695                         out->numleafsurfaces = 0;
2696                 }
2697
2698                 out->clusterindex = i - 1;
2699                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2700                         out->clusterindex = -1;
2701
2702                 p = LittleLong(in->visofs);
2703                 // ignore visofs errors on leaf 0 (solid)
2704                 if (p >= 0 && out->clusterindex >= 0)
2705                 {
2706                         if (p >= loadmodel->brushq1.num_compressedpvs)
2707                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2708                         else
2709                                 Mod_Q1BSP_DecompressVis(loadmodel->brushq1.data_compressedpvs + p, loadmodel->brushq1.data_compressedpvs + loadmodel->brushq1.num_compressedpvs, loadmodel->brush.data_pvsclusters + out->clusterindex * loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.data_pvsclusters + (out->clusterindex + 1) * loadmodel->brush.num_pvsclusterbytes);
2710                 }
2711
2712                 for (j = 0;j < 4;j++)
2713                         out->ambient_sound_level[j] = in->ambient_level[j];
2714
2715                 // FIXME: Insert caustics here
2716         }
2717 }
2718
2719 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2720 {
2721         int i, j;
2722         mleaf_t *leaf;
2723         const unsigned char *pvs;
2724         // if there's no vis data, assume supported (because everything is visible all the time)
2725         if (!loadmodel->brush.data_pvsclusters)
2726                 return true;
2727         // check all liquid leafs to see if they can see into empty leafs, if any
2728         // can we can assume this map supports r_wateralpha
2729         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2730         {
2731                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2732                 {
2733                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2734                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2735                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2736                                         return true;
2737                 }
2738         }
2739         return false;
2740 }
2741
2742 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2743 {
2744         dclipnode_t *in;
2745         mclipnode_t *out;
2746         int                     i, count;
2747         hull_t          *hull;
2748
2749         in = (dclipnode_t *)(mod_base + l->fileofs);
2750         if (l->filelen % sizeof(*in))
2751                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2752         count = l->filelen / sizeof(*in);
2753         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2754
2755         loadmodel->brushq1.clipnodes = out;
2756         loadmodel->brushq1.numclipnodes = count;
2757
2758         for (i = 1; i < MAX_MAP_HULLS; i++)
2759         {
2760                 hull = &loadmodel->brushq1.hulls[i];
2761                 hull->clipnodes = out;
2762                 hull->firstclipnode = 0;
2763                 hull->lastclipnode = count-1;
2764                 hull->planes = loadmodel->brush.data_planes;
2765                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2766                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2767                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2768                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2769                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2770                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2771                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2772         }
2773
2774         for (i=0 ; i<count ; i++, out++, in++)
2775         {
2776                 out->planenum = LittleLong(in->planenum);
2777                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2778                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2779                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2780                 if (out->children[0] >= count)
2781                         out->children[0] -= 65536;
2782                 if (out->children[1] >= count)
2783                         out->children[1] -= 65536;
2784                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2785                         Host_Error("Corrupt clipping hull(out of range planenum)");
2786         }
2787 }
2788
2789 //Duplicate the drawing hull structure as a clipping hull
2790 static void Mod_Q1BSP_MakeHull0(void)
2791 {
2792         mnode_t         *in;
2793         mclipnode_t *out;
2794         int                     i;
2795         hull_t          *hull;
2796
2797         hull = &loadmodel->brushq1.hulls[0];
2798
2799         in = loadmodel->brush.data_nodes;
2800         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2801
2802         hull->clipnodes = out;
2803         hull->firstclipnode = 0;
2804         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2805         hull->planes = loadmodel->brush.data_planes;
2806
2807         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2808         {
2809                 out->planenum = in->plane - loadmodel->brush.data_planes;
2810                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2811                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2812         }
2813 }
2814
2815 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2816 {
2817         int i, j;
2818         short *in;
2819
2820         in = (short *)(mod_base + l->fileofs);
2821         if (l->filelen % sizeof(*in))
2822                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2823         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2824         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2825
2826         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2827         {
2828                 j = (unsigned short) LittleShort(in[i]);
2829                 if (j >= loadmodel->num_surfaces)
2830                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2831                 loadmodel->brush.data_leafsurfaces[i] = j;
2832         }
2833 }
2834
2835 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2836 {
2837         int             i;
2838         int             *in;
2839
2840         in = (int *)(mod_base + l->fileofs);
2841         if (l->filelen % sizeof(*in))
2842                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2843         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2844         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2845
2846         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2847                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2848 }
2849
2850
2851 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2852 {
2853         int                     i;
2854         mplane_t        *out;
2855         dplane_t        *in;
2856
2857         in = (dplane_t *)(mod_base + l->fileofs);
2858         if (l->filelen % sizeof(*in))
2859                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2860
2861         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2862         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2863
2864         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2865         {
2866                 out->normal[0] = LittleFloat(in->normal[0]);
2867                 out->normal[1] = LittleFloat(in->normal[1]);
2868                 out->normal[2] = LittleFloat(in->normal[2]);
2869                 out->dist = LittleFloat(in->dist);
2870
2871                 PlaneClassify(out);
2872         }
2873 }
2874
2875 static void Mod_Q1BSP_LoadMapBrushes(void)
2876 {
2877 #if 0
2878 // unfinished
2879         int submodel, numbrushes;
2880         qboolean firstbrush;
2881         char *text, *maptext;
2882         char mapfilename[MAX_QPATH];
2883         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2884         strlcat (mapfilename, ".map", sizeof (mapfilename));
2885         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2886         if (!maptext)
2887                 return;
2888         text = maptext;
2889         if (!COM_ParseToken_Simple(&data, false, false))
2890                 return; // error
2891         submodel = 0;
2892         for (;;)
2893         {
2894                 if (!COM_ParseToken_Simple(&data, false, false))
2895                         break;
2896                 if (com_token[0] != '{')
2897                         return; // error
2898                 // entity
2899                 firstbrush = true;
2900                 numbrushes = 0;
2901                 maxbrushes = 256;
2902                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2903                 for (;;)
2904                 {
2905                         if (!COM_ParseToken_Simple(&data, false, false))
2906                                 return; // error
2907                         if (com_token[0] == '}')
2908                                 break; // end of entity
2909                         if (com_token[0] == '{')
2910                         {
2911                                 // brush
2912                                 if (firstbrush)
2913                                 {
2914                                         if (submodel)
2915                                         {
2916                                                 if (submodel > loadmodel->brush.numsubmodels)
2917                                                 {
2918                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2919                                                         model = NULL;
2920                                                 }
2921                                                 else
2922                                                         model = loadmodel->brush.submodels[submodel];
2923                                         }
2924                                         else
2925                                                 model = loadmodel;
2926                                 }
2927                                 for (;;)
2928                                 {
2929                                         if (!COM_ParseToken_Simple(&data, false, false))
2930                                                 return; // error
2931                                         if (com_token[0] == '}')
2932                                                 break; // end of brush
2933                                         // each brush face should be this format:
2934                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2935                                         // FIXME: support hl .map format
2936                                         for (pointnum = 0;pointnum < 3;pointnum++)
2937                                         {
2938                                                 COM_ParseToken_Simple(&data, false, false);
2939                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2940                                                 {
2941                                                         COM_ParseToken_Simple(&data, false, false);
2942                                                         point[pointnum][componentnum] = atof(com_token);
2943                                                 }
2944                                                 COM_ParseToken_Simple(&data, false, false);
2945                                         }
2946                                         COM_ParseToken_Simple(&data, false, false);
2947                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2948                                         COM_ParseToken_Simple(&data, false, false);
2949                                         //scroll_s = atof(com_token);
2950                                         COM_ParseToken_Simple(&data, false, false);
2951                                         //scroll_t = atof(com_token);
2952                                         COM_ParseToken_Simple(&data, false, false);
2953                                         //rotate = atof(com_token);
2954                                         COM_ParseToken_Simple(&data, false, false);
2955                                         //scale_s = atof(com_token);
2956                                         COM_ParseToken_Simple(&data, false, false);
2957                                         //scale_t = atof(com_token);
2958                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2959                                         VectorNormalizeDouble(planenormal);
2960                                         planedist = DotProduct(point[0], planenormal);
2961                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2962                                 }
2963                                 continue;
2964                         }
2965                 }
2966         }
2967 #endif
2968 }
2969
2970
2971 #define MAX_PORTALPOINTS 64
2972
2973 typedef struct portal_s
2974 {
2975         mplane_t plane;
2976         mnode_t *nodes[2];              // [0] = front side of plane
2977         struct portal_s *next[2];
2978         int numpoints;
2979         double points[3*MAX_PORTALPOINTS];
2980         struct portal_s *chain; // all portals are linked into a list
2981 }
2982 portal_t;
2983
2984 static portal_t *portalchain;
2985
2986 /*
2987 ===========
2988 AllocPortal
2989 ===========
2990 */
2991 static portal_t *AllocPortal(void)
2992 {
2993         portal_t *p;
2994         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2995         p->chain = portalchain;
2996         portalchain = p;
2997         return p;
2998 }
2999
3000 static void FreePortal(portal_t *p)
3001 {
3002         Mem_Free(p);
3003 }
3004
3005 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3006 {
3007         // process only nodes (leafs already had their box calculated)
3008         if (!node->plane)
3009                 return;
3010
3011         // calculate children first
3012         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3013         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3014
3015         // make combined bounding box from children
3016         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3017         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3018         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3019         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3020         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3021         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3022 }
3023
3024 static void Mod_Q1BSP_FinalizePortals(void)
3025 {
3026         int i, j, numportals, numpoints;
3027         portal_t *p, *pnext;
3028         mportal_t *portal;
3029         mvertex_t *point;
3030         mleaf_t *leaf, *endleaf;
3031
3032         // tally up portal and point counts and recalculate bounding boxes for all
3033         // leafs (because qbsp is very sloppy)
3034         leaf = loadmodel->brush.data_leafs;
3035         endleaf = leaf + loadmodel->brush.num_leafs;
3036         for (;leaf < endleaf;leaf++)
3037         {
3038                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
3039                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3040         }
3041         p = portalchain;
3042         numportals = 0;
3043         numpoints = 0;
3044         while (p)
3045         {
3046                 // note: this check must match the one below or it will usually corrupt memory
3047                 // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
3048                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3049                 {
3050                         numportals += 2;
3051                         numpoints += p->numpoints * 2;
3052                 }
3053                 p = p->chain;
3054         }
3055         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3056         loadmodel->brush.num_portals = numportals;
3057         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3058         loadmodel->brush.num_portalpoints = numpoints;
3059         // clear all leaf portal chains
3060         for (i = 0;i < loadmodel->brush.num_leafs;i++)
3061                 loadmodel->brush.data_leafs[i].portals = NULL;
3062         // process all portals in the global portal chain, while freeing them
3063         portal = loadmodel->brush.data_portals;
3064         point = loadmodel->brush.data_portalpoints;
3065         p = portalchain;
3066         portalchain = NULL;
3067         while (p)
3068         {
3069                 pnext = p->chain;
3070
3071                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3072                 {
3073                         // note: this check must match the one above or it will usually corrupt memory
3074                         // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
3075                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3076                         {
3077                                 // first make the back to front portal(forward portal)
3078                                 portal->points = point;
3079                                 portal->numpoints = p->numpoints;
3080                                 portal->plane.dist = p->plane.dist;
3081                                 VectorCopy(p->plane.normal, portal->plane.normal);
3082                                 portal->here = (mleaf_t *)p->nodes[1];
3083                                 portal->past = (mleaf_t *)p->nodes[0];
3084                                 // copy points
3085                                 for (j = 0;j < portal->numpoints;j++)
3086                                 {
3087                                         VectorCopy(p->points + j*3, point->position);
3088                                         point++;
3089                                 }
3090                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3091                                 PlaneClassify(&portal->plane);
3092
3093                                 // link into leaf's portal chain
3094                                 portal->next = portal->here->portals;
3095                                 portal->here->portals = portal;
3096
3097                                 // advance to next portal
3098                                 portal++;
3099
3100                                 // then make the front to back portal(backward portal)
3101                                 portal->points = point;
3102                                 portal->numpoints = p->numpoints;
3103                                 portal->plane.dist = -p->plane.dist;
3104                                 VectorNegate(p->plane.normal, portal->plane.normal);
3105                                 portal->here = (mleaf_t *)p->nodes[0];
3106                                 portal->past = (mleaf_t *)p->nodes[1];
3107                                 // copy points
3108                                 for (j = portal->numpoints - 1;j >= 0;j--)
3109                                 {
3110                                         VectorCopy(p->points + j*3, point->position);
3111                                         point++;
3112                                 }
3113                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3114                                 PlaneClassify(&portal->plane);
3115
3116                                 // link into leaf's portal chain
3117                                 portal->next = portal->here->portals;
3118                                 portal->here->portals = portal;
3119
3120                                 // advance to next portal
3121                                 portal++;
3122                         }
3123                         // add the portal's polygon points to the leaf bounding boxes
3124                         for (i = 0;i < 2;i++)
3125                         {
3126                                 leaf = (mleaf_t *)p->nodes[i];
3127                                 for (j = 0;j < p->numpoints;j++)
3128                                 {
3129                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3130                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3131                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3132                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3133                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3134                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3135                                 }
3136                         }
3137                 }
3138                 FreePortal(p);
3139                 p = pnext;
3140         }
3141         // now recalculate the node bounding boxes from the leafs
3142         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3143 }
3144
3145 /*
3146 =============
3147 AddPortalToNodes
3148 =============
3149 */
3150 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3151 {
3152         if (!front)
3153                 Host_Error("AddPortalToNodes: NULL front node");
3154         if (!back)
3155                 Host_Error("AddPortalToNodes: NULL back node");
3156         if (p->nodes[0] || p->nodes[1])
3157                 Host_Error("AddPortalToNodes: already included");
3158         // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
3159
3160         p->nodes[0] = front;
3161         p->next[0] = (portal_t *)front->portals;
3162         front->portals = (mportal_t *)p;
3163
3164         p->nodes[1] = back;
3165         p->next[1] = (portal_t *)back->portals;
3166         back->portals = (mportal_t *)p;
3167 }
3168
3169 /*
3170 =============
3171 RemovePortalFromNode
3172 =============
3173 */
3174 static void RemovePortalFromNodes(portal_t *portal)
3175 {
3176         int i;
3177         mnode_t *node;
3178         void **portalpointer;
3179         portal_t *t;
3180         for (i = 0;i < 2;i++)
3181         {
3182                 node = portal->nodes[i];
3183
3184                 portalpointer = (void **) &node->portals;
3185                 while (1)
3186                 {
3187                         t = (portal_t *)*portalpointer;
3188                         if (!t)
3189                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3190
3191                         if (t == portal)
3192                         {
3193                                 if (portal->nodes[0] == node)
3194                                 {
3195                                         *portalpointer = portal->next[0];
3196                                         portal->nodes[0] = NULL;
3197                                 }
3198                                 else if (portal->nodes[1] == node)
3199                                 {
3200                                         *portalpointer = portal->next[1];
3201                                         portal->nodes[1] = NULL;
3202                                 }
3203                                 else
3204                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3205                                 break;
3206                         }
3207
3208                         if (t->nodes[0] == node)
3209                                 portalpointer = (void **) &t->next[0];
3210                         else if (t->nodes[1] == node)
3211                                 portalpointer = (void **) &t->next[1];
3212                         else
3213                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3214                 }
3215         }
3216 }
3217
3218 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3219 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3220 {
3221         int i, side;
3222         mnode_t *front, *back, *other_node;
3223         mplane_t clipplane, *plane;
3224         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3225         int numfrontpoints, numbackpoints;
3226         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3227
3228         // if a leaf, we're done
3229         if (!node->plane)
3230                 return;
3231
3232         plane = node->plane;
3233
3234         front = node->children[0];
3235         back = node->children[1];
3236         if (front == back)
3237                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3238
3239         // create the new portal by generating a polygon for the node plane,
3240         // and clipping it by all of the other portals(which came from nodes above this one)
3241         nodeportal = AllocPortal();
3242         nodeportal->plane = *plane;
3243
3244         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3245         PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
3246         nodeportal->numpoints = 4;
3247         side = 0;       // shut up compiler warning
3248         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3249         {
3250                 clipplane = portal->plane;
3251                 if (portal->nodes[0] == portal->nodes[1])
3252                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3253                 if (portal->nodes[0] == node)
3254                         side = 0;
3255                 else if (portal->nodes[1] == node)
3256                 {
3257                         clipplane.dist = -clipplane.dist;
3258                         VectorNegate(clipplane.normal, clipplane.normal);
3259                         side = 1;
3260                 }
3261                 else
3262                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3263
3264                 for (i = 0;i < nodeportal->numpoints*3;i++)
3265                         frontpoints[i] = nodeportal->points[i];
3266                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3267                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3268                         break;
3269         }
3270
3271         if (nodeportal->numpoints < 3)
3272         {
3273                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3274                 nodeportal->numpoints = 0;
3275         }
3276         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3277         {
3278                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3279                 nodeportal->numpoints = 0;
3280         }
3281
3282         AddPortalToNodes(nodeportal, front, back);
3283
3284         // split the portals of this node along this node's plane and assign them to the children of this node
3285         // (migrating the portals downward through the tree)
3286         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3287         {
3288                 if (portal->nodes[0] == portal->nodes[1])
3289                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3290                 if (portal->nodes[0] == node)
3291                         side = 0;
3292                 else if (portal->nodes[1] == node)
3293                         side = 1;
3294                 else
3295                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3296                 nextportal = portal->next[side];
3297                 if (!portal->numpoints)
3298                         continue;
3299
3300                 other_node = portal->nodes[!side];
3301                 RemovePortalFromNodes(portal);
3302
3303                 // cut the portal into two portals, one on each side of the node plane
3304                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3305
3306                 if (!numfrontpoints)
3307                 {
3308                         if (side == 0)
3309                                 AddPortalToNodes(portal, back, other_node);
3310                         else
3311                                 AddPortalToNodes(portal, other_node, back);
3312                         continue;
3313                 }
3314                 if (!numbackpoints)
3315                 {
3316                         if (side == 0)
3317                                 AddPortalToNodes(portal, front, other_node);
3318                         else
3319                                 AddPortalToNodes(portal, other_node, front);
3320                         continue;
3321                 }
3322
3323                 // the portal is split
3324                 splitportal = AllocPortal();
3325                 temp = splitportal->chain;
3326                 *splitportal = *portal;
3327                 splitportal->chain = temp;
3328                 for (i = 0;i < numbackpoints*3;i++)
3329                         splitportal->points[i] = backpoints[i];
3330                 splitportal->numpoints = numbackpoints;
3331                 for (i = 0;i < numfrontpoints*3;i++)
3332                         portal->points[i] = frontpoints[i];
3333                 portal->numpoints = numfrontpoints;
3334
3335                 if (side == 0)
3336                 {
3337                         AddPortalToNodes(portal, front, other_node);
3338                         AddPortalToNodes(splitportal, back, other_node);
3339                 }
3340                 else
3341                 {
3342                         AddPortalToNodes(portal, other_node, front);
3343                         AddPortalToNodes(splitportal, other_node, back);
3344                 }
3345         }
3346
3347         Mod_Q1BSP_RecursiveNodePortals(front);
3348         Mod_Q1BSP_RecursiveNodePortals(back);
3349 }
3350
3351 static void Mod_Q1BSP_MakePortals(void)
3352 {
3353         portalchain = NULL;
3354         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3355         Mod_Q1BSP_FinalizePortals();
3356 }
3357
3358 //Returns PVS data for a given point
3359 //(note: can return NULL)
3360 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3361 {
3362         mnode_t *node;
3363         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3364         while (node->plane)
3365                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];