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