now unloads all stale submodels and the old world model before loading the new one...
[divverent/darkplaces.git] / model_shared.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 // models.c -- model loading and caching
21
22 // models are the only shared resource between a client and server running
23 // on the same machine.
24
25 #include "quakedef.h"
26 #include "image.h"
27 #include "r_shadow.h"
28
29 cvar_t r_mipskins = {CVAR_SAVE, "r_mipskins", "0"};
30
31 model_t *loadmodel;
32
33 // LordHavoc: increased from 512 to 2048
34 #define MAX_MOD_KNOWN   2048
35 static model_t mod_known[MAX_MOD_KNOWN];
36
37 rtexturepool_t *mod_shared_texturepool;
38 rtexture_t *r_notexture;
39 rtexture_t *mod_shared_detailtextures[NUM_DETAILTEXTURES];
40 rtexture_t *mod_shared_distorttexture[64];
41
42 void Mod_BuildDetailTextures (void)
43 {
44         int i, x, y, light;
45         float vc[3], vx[3], vy[3], vn[3], lightdir[3];
46 #define DETAILRESOLUTION 256
47         qbyte data[DETAILRESOLUTION][DETAILRESOLUTION][4], noise[DETAILRESOLUTION][DETAILRESOLUTION];
48         lightdir[0] = 0.5;
49         lightdir[1] = 1;
50         lightdir[2] = -0.25;
51         VectorNormalize(lightdir);
52         for (i = 0;i < NUM_DETAILTEXTURES;i++)
53         {
54                 fractalnoise(&noise[0][0], DETAILRESOLUTION, DETAILRESOLUTION >> 4);
55                 for (y = 0;y < DETAILRESOLUTION;y++)
56                 {
57                         for (x = 0;x < DETAILRESOLUTION;x++)
58                         {
59                                 vc[0] = x;
60                                 vc[1] = y;
61                                 vc[2] = noise[y][x] * (1.0f / 32.0f);
62                                 vx[0] = x + 1;
63                                 vx[1] = y;
64                                 vx[2] = noise[y][(x + 1) % DETAILRESOLUTION] * (1.0f / 32.0f);
65                                 vy[0] = x;
66                                 vy[1] = y + 1;
67                                 vy[2] = noise[(y + 1) % DETAILRESOLUTION][x] * (1.0f / 32.0f);
68                                 VectorSubtract(vx, vc, vx);
69                                 VectorSubtract(vy, vc, vy);
70                                 CrossProduct(vx, vy, vn);
71                                 VectorNormalize(vn);
72                                 light = 128 - DotProduct(vn, lightdir) * 128;
73                                 light = bound(0, light, 255);
74                                 data[y][x][0] = data[y][x][1] = data[y][x][2] = light;
75                                 data[y][x][3] = 255;
76                         }
77                 }
78                 mod_shared_detailtextures[i] = R_LoadTexture2D(mod_shared_texturepool, va("detailtexture%i", i), DETAILRESOLUTION, DETAILRESOLUTION, &data[0][0][0], TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_PRECACHE, NULL);
79         }
80 }
81
82 qbyte Mod_MorphDistortTexture (double y0, double y1, double y2, double y3, double morph)
83 {
84         int     value = (int)(((y1 + y3 - (y0 + y2)) * morph * morph * morph) +
85                                 ((2 * (y0 - y1) + y2 - y3) * morph * morph) +
86                                 ((y2 - y0) * morph) +
87                                 (y1));
88
89         if (value > 255)
90                 value = 255;
91         if (value < 0)
92                 value = 0;
93
94         return (qbyte)value;
95 }
96
97 void Mod_BuildDistortTexture (void)
98 {
99         int x, y, i, j;
100 #define DISTORTRESOLUTION 32
101         qbyte data[5][DISTORTRESOLUTION][DISTORTRESOLUTION][2];
102
103         for (i=0; i<4; i++)
104         {
105                 for (y=0; y<DISTORTRESOLUTION; y++)
106                 {
107                         for (x=0; x<DISTORTRESOLUTION; x++)
108                         {
109                                 data[i][y][x][0] = rand () & 255;
110                                 data[i][y][x][1] = rand () & 255;
111                         }
112                 }
113         }
114
115
116         for (i=0; i<4; i++)
117         {
118                 for (j=0; j<16; j++)
119                 {
120                         mod_shared_distorttexture[i*16+j] = NULL;
121                         if (gl_textureshader)
122                         {
123                                 for (y=0; y<DISTORTRESOLUTION; y++)
124                                 {
125                                         for (x=0; x<DISTORTRESOLUTION; x++)
126                                         {
127                                                 data[4][y][x][0] = Mod_MorphDistortTexture (data[(i-1)&3][y][x][0], data[i][y][x][0], data[(i+1)&3][y][x][0], data[(i+2)&3][y][x][0], 0.0625*j);
128                                                 data[4][y][x][1] = Mod_MorphDistortTexture (data[(i-1)&3][y][x][1], data[i][y][x][1], data[(i+1)&3][y][x][1], data[(i+2)&3][y][x][1], 0.0625*j);
129                                         }
130                                 }
131                                 mod_shared_distorttexture[i*16+j] = R_LoadTexture2D(mod_shared_texturepool, va("distorttexture%i", i*16+j), DISTORTRESOLUTION, DISTORTRESOLUTION, &data[4][0][0][0], TEXTYPE_DSDT, TEXF_PRECACHE, NULL);
132                         }
133                 }
134         }
135
136         return;
137 }
138
139 texture_t r_surf_notexture;
140
141 void Mod_SetupNoTexture(void)
142 {
143         int x, y;
144         qbyte pix[16][16][4];
145
146         // this makes a light grey/dark grey checkerboard texture
147         for (y = 0;y < 16;y++)
148         {
149                 for (x = 0;x < 16;x++)
150                 {
151                         if ((y < 8) ^ (x < 8))
152                         {
153                                 pix[y][x][0] = 128;
154                                 pix[y][x][1] = 128;
155                                 pix[y][x][2] = 128;
156                                 pix[y][x][3] = 255;
157                         }
158                         else
159                         {
160                                 pix[y][x][0] = 64;
161                                 pix[y][x][1] = 64;
162                                 pix[y][x][2] = 64;
163                                 pix[y][x][3] = 255;
164                         }
165                 }
166         }
167
168         r_notexture = R_LoadTexture2D(mod_shared_texturepool, "notexture", 16, 16, &pix[0][0][0], TEXTYPE_RGBA, TEXF_MIPMAP, NULL);
169 }
170
171 static void mod_start(void)
172 {
173         int i;
174         for (i = 0;i < MAX_MOD_KNOWN;i++)
175                 if (mod_known[i].name[0])
176                         Mod_UnloadModel(&mod_known[i]);
177         Mod_LoadModels();
178
179         mod_shared_texturepool = R_AllocTexturePool();
180         Mod_SetupNoTexture();
181         Mod_BuildDetailTextures();
182         Mod_BuildDistortTexture();
183 }
184
185 static void mod_shutdown(void)
186 {
187         int i;
188         for (i = 0;i < MAX_MOD_KNOWN;i++)
189                 if (mod_known[i].name[0])
190                         Mod_UnloadModel(&mod_known[i]);
191
192         R_FreeTexturePool(&mod_shared_texturepool);
193 }
194
195 static void mod_newmap(void)
196 {
197         msurface_t *surf;
198         int i, surfnum, ssize, tsize;
199
200         if (!cl_stainmapsclearonload.integer)
201                 return;
202
203         for (i=0; i<MAX_MOD_KNOWN; i++)
204         {
205                 if (mod_known[i].name[0] && mod_known[i].type == mod_brushq1)
206                 {
207                         for (surfnum=0, surf=mod_known[i].brushq1.surfaces; surfnum<mod_known[i].brushq1.numsurfaces;surfnum++, surf++)
208                         {
209                                 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
210                                 {
211                                         ssize = (surf->extents[0] >> 4) + 1;
212                                         tsize = (surf->extents[1] >> 4) + 1;
213                                         
214                                         if (ssize > 256 || tsize > 256)
215                                                 Host_Error("Bad surface extents");
216
217                                         if (surf->stainsamples)
218                                                 memset(surf->stainsamples, 255, ssize * tsize * 3);
219
220                                         surf->cached_dlight = true;
221                                 }
222                         }
223                 }
224         }
225 }
226
227 /*
228 ===============
229 Mod_Init
230 ===============
231 */
232 static void Mod_Print(void);
233 static void Mod_Precache (void);
234 void Mod_Init (void)
235 {
236         Mod_BrushInit();
237         Mod_AliasInit();
238         Mod_SpriteInit();
239
240         Cvar_RegisterVariable(&r_mipskins);
241         Cmd_AddCommand ("modellist", Mod_Print);
242         Cmd_AddCommand ("modelprecache", Mod_Precache);
243 }
244
245 void Mod_RenderInit(void)
246 {
247         R_RegisterModule("Models", mod_start, mod_shutdown, mod_newmap);
248 }
249
250 void Mod_FreeModel (model_t *mod)
251 {
252         R_FreeTexturePool(&mod->texturepool);
253         Mem_FreePool(&mod->mempool);
254
255         // clear the struct to make it available
256         memset(mod, 0, sizeof(model_t));
257 }
258
259 void Mod_UnloadModel (model_t *mod)
260 {
261         char name[MAX_QPATH];
262         qboolean isworldmodel;
263         strcpy(name, mod->name);
264         isworldmodel = mod->isworldmodel;
265         Mod_FreeModel(mod);
266         strcpy(mod->name, name);
267         mod->isworldmodel = isworldmodel;
268         mod->loaded = false;
269 }
270
271 /*
272 ==================
273 Mod_LoadModel
274
275 Loads a model
276 ==================
277 */
278 static model_t *Mod_LoadModel(model_t *mod, qboolean crash, qboolean checkdisk, qboolean isworldmodel)
279 {
280         int num;
281         unsigned int crc;
282         void *buf;
283
284         mod->used = true;
285
286         if (mod->name[0] == '*') // submodel
287                 return mod;
288
289         crc = 0;
290         buf = NULL;
291         if (mod->isworldmodel != isworldmodel)
292                 mod->loaded = false;
293         if (!mod->loaded || checkdisk)
294         {
295                 if (checkdisk && mod->loaded)
296                         Con_DPrintf("checking model %s\n", mod->name);
297                 buf = FS_LoadFile (mod->name, tempmempool, false);
298                 if (buf)
299                 {
300                         crc = CRC_Block(buf, fs_filesize);
301                         if (mod->crc != crc)
302                                 mod->loaded = false;
303                 }
304         }
305         if (mod->loaded)
306                 return mod; // already loaded
307
308         Con_DPrintf("loading model %s\n", mod->name);
309         // LordHavoc: unload the existing model in this slot (if there is one)
310         Mod_UnloadModel(mod);
311         if (isworldmodel)
312         {
313                 // clear out any stale submodels lying around, as well as the old world model itself
314                 int i;
315                 for (i = 0;i < MAX_MOD_KNOWN;i++)
316                         if (mod_known[i].isworldmodel)
317                                 Mod_UnloadModel(mod_known + i);
318         }
319
320         // load the model
321         mod->isworldmodel = isworldmodel;
322         mod->used = true;
323         mod->crc = crc;
324         // errors can prevent the corresponding mod->loaded = true;
325         mod->loaded = false;
326
327         // default model radius and bounding box (mainly for missing models)
328         mod->radius = 16;
329         VectorSet(mod->normalmins, -mod->radius, -mod->radius, -mod->radius);
330         VectorSet(mod->normalmaxs, mod->radius, mod->radius, mod->radius);
331         VectorSet(mod->yawmins, -mod->radius, -mod->radius, -mod->radius);
332         VectorSet(mod->yawmaxs, mod->radius, mod->radius, mod->radius);
333         VectorSet(mod->rotatedmins, -mod->radius, -mod->radius, -mod->radius);
334         VectorSet(mod->rotatedmaxs, mod->radius, mod->radius, mod->radius);
335
336         // all models use memory, so allocate a memory pool
337         mod->mempool = Mem_AllocPool(mod->name, 0, NULL);
338         // all models load textures, so allocate a texture pool
339         if (cls.state != ca_dedicated)
340                 mod->texturepool = R_AllocTexturePool();
341
342         if (buf)
343         {
344                 num = LittleLong(*((int *)buf));
345                 // call the apropriate loader
346                 loadmodel = mod;
347                      if (!memcmp(buf, "IDPO", 4)) Mod_IDP0_Load(mod, buf);
348                 else if (!memcmp(buf, "IDP2", 4)) Mod_IDP2_Load(mod, buf);
349                 else if (!memcmp(buf, "IDP3", 4)) Mod_IDP3_Load(mod, buf);
350                 else if (!memcmp(buf, "IDSP", 4)) Mod_IDSP_Load(mod, buf);
351                 else if (!memcmp(buf, "IBSP", 4)) Mod_IBSP_Load(mod, buf);
352                 else if (!memcmp(buf, "ZYMOTICMODEL", 12)) Mod_ZYMOTICMODEL_Load(mod, buf);
353                 else if (strlen(mod->name) >= 4 && !strcmp(mod->name - 4, ".map")) Mod_MAP_Load(mod, buf);
354                 else if (num == BSPVERSION || num == 30) Mod_Q1BSP_Load(mod, buf);
355                 else Host_Error("Mod_LoadModel: model \"%s\" is of unknown/unsupported type\n", mod->name);
356                 Mem_Free(buf);
357         }
358         else if (crash)
359         {
360                 // LordHavoc: Sys_Error was *ANNOYING*
361                 Con_Printf ("Mod_LoadModel: %s not found\n", mod->name);
362         }
363
364         // no errors occurred
365         mod->loaded = true;
366         return mod;
367 }
368
369 void Mod_CheckLoaded(model_t *mod)
370 {
371         if (mod)
372         {
373                 if (!mod->loaded)
374                         Mod_LoadModel(mod, true, true, mod->isworldmodel);
375                 else
376                 {
377                         //if (mod->type == mod_invalid)
378                         //      Host_Error("Mod_CheckLoaded: invalid model\n");
379                         mod->used = true;
380                         return;
381                 }
382         }
383 }
384
385 /*
386 ===================
387 Mod_ClearAll
388 ===================
389 */
390 void Mod_ClearAll(void)
391 {
392 }
393
394 void Mod_ClearUsed(void)
395 {
396         int i;
397         model_t *mod;
398
399         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
400                 if (mod->name[0])
401                         mod->used = false;
402 }
403
404 void Mod_PurgeUnused(void)
405 {
406         int i;
407         model_t *mod;
408
409         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
410                 if (mod->name[0])
411                         if (!mod->used)
412                                 Mod_FreeModel(mod);
413 }
414
415 void Mod_LoadModels(void)
416 {
417         int i;
418         model_t *mod;
419
420         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
421                 if (mod->name[0])
422                         if (mod->used)
423                                 Mod_CheckLoaded(mod);
424 }
425
426 /*
427 ==================
428 Mod_FindName
429
430 ==================
431 */
432 model_t *Mod_FindName(const char *name)
433 {
434         int i;
435         model_t *mod, *freemod;
436
437         if (!name[0])
438                 Host_Error ("Mod_ForName: NULL name");
439
440 // search the currently loaded models
441         freemod = NULL;
442         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
443         {
444                 if (mod->name[0])
445                 {
446                         if (!strcmp (mod->name, name))
447                         {
448                                 mod->used = true;
449                                 return mod;
450                         }
451                 }
452                 else if (freemod == NULL)
453                         freemod = mod;
454         }
455
456         if (freemod)
457         {
458                 mod = freemod;
459                 strcpy (mod->name, name);
460                 mod->loaded = false;
461                 mod->used = true;
462                 return mod;
463         }
464
465         Host_Error ("Mod_FindName: ran out of models\n");
466         return NULL;
467 }
468
469 /*
470 ==================
471 Mod_ForName
472
473 Loads in a model for the given name
474 ==================
475 */
476 model_t *Mod_ForName(const char *name, qboolean crash, qboolean checkdisk, qboolean isworldmodel)
477 {
478         return Mod_LoadModel(Mod_FindName(name), crash, checkdisk, isworldmodel);
479 }
480
481 qbyte *mod_base;
482
483
484 //=============================================================================
485
486 /*
487 ================
488 Mod_Print
489 ================
490 */
491 static void Mod_Print(void)
492 {
493         int             i;
494         model_t *mod;
495
496         Con_Print("Loaded models:\n");
497         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
498                 if (mod->name[0])
499                         Con_Printf("%4iK %s\n", mod->mempool ? (mod->mempool->totalsize + 1023) / 1024 : 0, mod->name);
500 }
501
502 /*
503 ================
504 Mod_Precache
505 ================
506 */
507 static void Mod_Precache(void)
508 {
509         if (Cmd_Argc() == 2)
510                 Mod_ForName(Cmd_Argv(1), false, true, cl.worldmodel && !strcasecmp(Cmd_Argv(1), cl.worldmodel->name));
511         else
512                 Con_Print("usage: modelprecache <filename>\n");
513 }
514
515 int Mod_BuildVertexRemapTableFromElements(int numelements, const int *elements, int numvertices, int *remapvertices)
516 {
517         int i, count;
518         qbyte *used;
519         used = Mem_Alloc(tempmempool, numvertices);
520         memset(used, 0, numvertices);
521         for (i = 0;i < numelements;i++)
522                 used[elements[i]] = 1;
523         for (i = 0, count = 0;i < numvertices;i++)
524                 remapvertices[i] = used[i] ? count++ : -1;
525         Mem_Free(used);
526         return count;
527 }
528
529 #if 1
530 // fast way, using an edge hash
531 #define TRIANGLEEDGEHASH 16384
532 void Mod_BuildTriangleNeighbors(int *neighbors, const int *elements, int numtriangles)
533 {
534         int i, j, p, e1, e2, *n, hashindex, count, match;
535         const int *e;
536         typedef struct edgehashentry_s
537         {
538                 struct edgehashentry_s *next;
539                 int triangle;
540                 int element[2];
541         }
542         edgehashentry_t;
543         edgehashentry_t *edgehash[TRIANGLEEDGEHASH], *edgehashentries, edgehashentriesbuffer[TRIANGLEEDGEHASH*3], *hash;
544         memset(edgehash, 0, sizeof(edgehash));
545         edgehashentries = edgehashentriesbuffer;
546         // if there are too many triangles for the stack array, allocate larger buffer
547         if (numtriangles > TRIANGLEEDGEHASH)
548                 edgehashentries = Mem_Alloc(tempmempool, numtriangles * 3 * sizeof(edgehashentry_t));
549         // find neighboring triangles
550         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
551         {
552                 for (j = 0, p = 2;j < 3;p = j, j++)
553                 {
554                         e1 = e[p];
555                         e2 = e[j];
556                         // this hash index works for both forward and backward edges
557                         hashindex = (unsigned int)(e1 + e2) % TRIANGLEEDGEHASH;
558                         hash = edgehashentries + i * 3 + j;
559                         hash->next = edgehash[hashindex];
560                         edgehash[hashindex] = hash;
561                         hash->triangle = i;
562                         hash->element[0] = e1;
563                         hash->element[1] = e2;
564                 }
565         }
566         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
567         {
568                 for (j = 0, p = 2;j < 3;p = j, j++)
569                 {
570                         e1 = e[p];
571                         e2 = e[j];
572                         // this hash index works for both forward and backward edges
573                         hashindex = (unsigned int)(e1 + e2) % TRIANGLEEDGEHASH;
574                         count = 0;
575                         match = -1;
576                         for (hash = edgehash[hashindex];hash;hash = hash->next)
577                         {
578                                 if (hash->element[0] == e2 && hash->element[1] == e1)
579                                 {
580                                         if (hash->triangle != i)
581                                                 match = hash->triangle;
582                                         count++;
583                                 }
584                                 else if ((hash->element[0] == e1 && hash->element[1] == e2))
585                                         count++;
586                         }
587                         // detect edges shared by three triangles and make them seams
588                         if (count > 2)
589                                 match = -1;
590                         n[p] = match;
591                 }
592         }
593         // free the allocated buffer
594         if (edgehashentries != edgehashentriesbuffer)
595                 Mem_Free(edgehashentries);
596 }
597 #else
598 // very slow but simple way
599 static int Mod_FindTriangleWithEdge(const int *elements, int numtriangles, int start, int end, int ignore)
600 {
601         int i, match, count;
602         count = 0;
603         match = -1;
604         for (i = 0;i < numtriangles;i++, elements += 3)
605         {
606                      if ((elements[0] == start && elements[1] == end)
607                       || (elements[1] == start && elements[2] == end)
608                       || (elements[2] == start && elements[0] == end))
609                 {
610                         if (i != ignore)
611                                 match = i;
612                         count++;
613                 }
614                 else if ((elements[1] == start && elements[0] == end)
615                       || (elements[2] == start && elements[1] == end)
616                       || (elements[0] == start && elements[2] == end))
617                         count++;
618         }
619         // detect edges shared by three triangles and make them seams
620         if (count > 2)
621                 match = -1;
622         return match;
623 }
624
625 void Mod_BuildTriangleNeighbors(int *neighbors, const int *elements, int numtriangles)
626 {
627         int i, *n;
628         const int *e;
629         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
630         {
631                 n[0] = Mod_FindTriangleWithEdge(elements, numtriangles, e[1], e[0], i);
632                 n[1] = Mod_FindTriangleWithEdge(elements, numtriangles, e[2], e[1], i);
633                 n[2] = Mod_FindTriangleWithEdge(elements, numtriangles, e[0], e[2], i);
634         }
635 }
636 #endif
637
638 void Mod_ValidateElements(const int *elements, int numtriangles, int numverts, const char *filename, int fileline)
639 {
640         int i;
641         for (i = 0;i < numtriangles * 3;i++)
642                 if ((unsigned int)elements[i] >= (unsigned int)numverts)
643                         Con_Printf("Mod_ValidateElements: out of bounds element detected at %s:%d\n", filename, fileline);
644 }
645
646 // warning: this is an expensive function!
647 void Mod_BuildNormals(int numverts, int numtriangles, const float *vertex3f, const int *elements, float *normal3f)
648 {
649         int i, tnum;
650         float normal[3], *v;
651         const int *e;
652         // clear the vectors
653         memset(normal3f, 0, numverts * sizeof(float[3]));
654         // process each vertex of each triangle and accumulate the results
655         for (tnum = 0, e = elements;tnum < numtriangles;tnum++, e += 3)
656         {
657                 TriangleNormal(vertex3f + e[0] * 3, vertex3f + e[1] * 3, vertex3f + e[2] * 3, normal);
658                 VectorNormalize(normal);
659                 v = normal3f + e[0] * 3;
660                 v[0] += normal[0];
661                 v[1] += normal[1];
662                 v[2] += normal[2];
663                 v = normal3f + e[1] * 3;
664                 v[0] += normal[0];
665                 v[1] += normal[1];
666                 v[2] += normal[2];
667                 v = normal3f + e[2] * 3;
668                 v[0] += normal[0];
669                 v[1] += normal[1];
670                 v[2] += normal[2];
671         }
672         // now we could divide the vectors by the number of averaged values on
673         // each vertex...  but instead normalize them
674         for (i = 0, v = normal3f;i < numverts;i++, v += 3)
675                 VectorNormalize(v);
676 }
677
678 void Mod_BuildBumpVectors(const float *v0, const float *v1, const float *v2, const float *tc0, const float *tc1, const float *tc2, float *svector3f, float *tvector3f, float *normal3f)
679 {
680         float f, tangentcross[3], v10[3], v20[3], tc10[2], tc20[2];
681         // 103 add/sub/negate/multiply (1 cycle), 3 divide (20 cycle), 3 sqrt (22 cycle), 4 compare (3 cycle?), total cycles not counting load/store/exchange roughly 241 cycles
682         // 12 add, 28 subtract, 57 multiply, 3 divide, 3 sqrt, 4 compare, 50% chance of 6 negates
683
684         // 6 multiply, 9 subtract
685         VectorSubtract(v1, v0, v10);
686         VectorSubtract(v2, v0, v20);
687         normal3f[0] = v10[1] * v20[2] - v10[2] * v20[1];
688         normal3f[1] = v10[2] * v20[0] - v10[0] * v20[2];
689         normal3f[2] = v10[0] * v20[1] - v10[1] * v20[0];
690         // 1 sqrt, 1 divide, 6 multiply, 2 add, 1 compare
691         VectorNormalize(normal3f);
692         // 12 multiply, 10 subtract
693         tc10[1] = tc1[1] - tc0[1];
694         tc20[1] = tc2[1] - tc0[1];
695         svector3f[0] = tc10[1] * v20[0] - tc20[1] * v10[0];
696         svector3f[1] = tc10[1] * v20[1] - tc20[1] * v10[1];
697         svector3f[2] = tc10[1] * v20[2] - tc20[1] * v10[2];
698         tc10[0] = tc1[0] - tc0[0];
699         tc20[0] = tc2[0] - tc0[0];
700         tvector3f[0] = tc10[0] * v20[0] - tc20[0] * v10[0];
701         tvector3f[1] = tc10[0] * v20[1] - tc20[0] * v10[1];
702         tvector3f[2] = tc10[0] * v20[2] - tc20[0] * v10[2];
703         // 12 multiply, 4 add, 6 subtract
704         f = DotProduct(svector3f, normal3f);
705         svector3f[0] -= f * normal3f[0];
706         svector3f[1] -= f * normal3f[1];
707         svector3f[2] -= f * normal3f[2];
708         f = DotProduct(tvector3f, normal3f);
709         tvector3f[0] -= f * normal3f[0];
710         tvector3f[1] -= f * normal3f[1];
711         tvector3f[2] -= f * normal3f[2];
712         // 2 sqrt, 2 divide, 12 multiply, 4 add, 2 compare
713         VectorNormalize(svector3f);
714         VectorNormalize(tvector3f);
715         // if texture is mapped the wrong way (counterclockwise), the tangents
716         // have to be flipped, this is detected by calculating a normal from the
717         // two tangents, and seeing if it is opposite the surface normal
718         // 9 multiply, 2 add, 3 subtract, 1 compare, 50% chance of: 6 negates
719         CrossProduct(tvector3f, svector3f, tangentcross);
720         if (DotProduct(tangentcross, normal3f) < 0)
721         {
722                 VectorNegate(svector3f, svector3f);
723                 VectorNegate(tvector3f, tvector3f);
724         }
725 }
726
727 // warning: this is a very expensive function!
728 void Mod_BuildTextureVectorsAndNormals(int numverts, int numtriangles, const float *vertex3f, const float *texcoord2f, const int *elements, float *svector3f, float *tvector3f, float *normal3f)
729 {
730         int i, tnum;
731         float sdir[3], tdir[3], normal[3], *v;
732         const int *e;
733         // clear the vectors
734         if (svector3f)
735                 memset(svector3f, 0, numverts * sizeof(float[3]));
736         if (tvector3f)
737                 memset(tvector3f, 0, numverts * sizeof(float[3]));
738         if (normal3f)
739                 memset(normal3f, 0, numverts * sizeof(float[3]));
740         // process each vertex of each triangle and accumulate the results
741         for (tnum = 0, e = elements;tnum < numtriangles;tnum++, e += 3)
742         {
743                 Mod_BuildBumpVectors(vertex3f + e[0] * 3, vertex3f + e[1] * 3, vertex3f + e[2] * 3, texcoord2f + e[0] * 2, texcoord2f + e[1] * 2, texcoord2f + e[2] * 2, sdir, tdir, normal);
744                 if (svector3f)
745                 {
746                         for (i = 0;i < 3;i++)
747                         {
748                                 svector3f[e[i]*3  ] += sdir[0];
749                                 svector3f[e[i]*3+1] += sdir[1];
750                                 svector3f[e[i]*3+2] += sdir[2];
751                         }
752                 }
753                 if (tvector3f)
754                 {
755                         for (i = 0;i < 3;i++)
756                         {
757                                 tvector3f[e[i]*3  ] += tdir[0];
758                                 tvector3f[e[i]*3+1] += tdir[1];
759                                 tvector3f[e[i]*3+2] += tdir[2];
760                         }
761                 }
762                 if (normal3f)
763                 {
764                         for (i = 0;i < 3;i++)
765                         {
766                                 normal3f[e[i]*3  ] += normal[0];
767                                 normal3f[e[i]*3+1] += normal[1];
768                                 normal3f[e[i]*3+2] += normal[2];
769                         }
770                 }
771         }
772         // now we could divide the vectors by the number of averaged values on
773         // each vertex...  but instead normalize them
774         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
775         if (svector3f)
776                 for (i = 0, v = svector3f;i < numverts;i++, v += 3)
777                         VectorNormalize(v);
778         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
779         if (tvector3f)
780                 for (i = 0, v = tvector3f;i < numverts;i++, v += 3)
781                         VectorNormalize(v);
782         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
783         if (normal3f)
784                 for (i = 0, v = normal3f;i < numverts;i++, v += 3)
785                         VectorNormalize(v);
786 }
787
788 shadowmesh_t *Mod_ShadowMesh_Alloc(mempool_t *mempool, int maxverts, int maxtriangles, rtexture_t *map_diffuse, rtexture_t *map_specular, rtexture_t *map_normal, int light, int neighbors, int expandable)
789 {
790         shadowmesh_t *newmesh;
791         qbyte *data;
792         int size;
793         size = sizeof(shadowmesh_t);
794         size += maxverts * sizeof(float[3]);
795         if (light)
796                 size += maxverts * sizeof(float[11]);
797         size += maxtriangles * sizeof(int[3]);
798         if (neighbors)
799                 size += maxtriangles * sizeof(int[3]);
800         if (expandable)
801                 size += SHADOWMESHVERTEXHASH * sizeof(shadowmeshvertexhash_t *) + maxverts * sizeof(shadowmeshvertexhash_t);
802         data = Mem_Alloc(mempool, size);
803         newmesh = (void *)data;data += sizeof(*newmesh);
804         newmesh->map_diffuse = map_diffuse;
805         newmesh->map_specular = map_specular;
806         newmesh->map_normal = map_normal;
807         newmesh->maxverts = maxverts;
808         newmesh->maxtriangles = maxtriangles;
809         newmesh->numverts = 0;
810         newmesh->numtriangles = 0;
811
812         newmesh->vertex3f = (void *)data;data += maxverts * sizeof(float[3]);
813         if (light)
814         {
815                 newmesh->svector3f = (void *)data;data += maxverts * sizeof(float[3]);
816                 newmesh->tvector3f = (void *)data;data += maxverts * sizeof(float[3]);
817                 newmesh->normal3f = (void *)data;data += maxverts * sizeof(float[3]);
818                 newmesh->texcoord2f = (void *)data;data += maxverts * sizeof(float[2]);
819         }
820         newmesh->element3i = (void *)data;data += maxtriangles * sizeof(int[3]);
821         if (neighbors)
822         {
823                 newmesh->neighbor3i = (void *)data;data += maxtriangles * sizeof(int[3]);
824         }
825         if (expandable)
826         {
827                 newmesh->vertexhashtable = (void *)data;data += SHADOWMESHVERTEXHASH * sizeof(shadowmeshvertexhash_t *);
828                 newmesh->vertexhashentries = (void *)data;data += maxverts * sizeof(shadowmeshvertexhash_t);
829         }
830         return newmesh;
831 }
832
833 shadowmesh_t *Mod_ShadowMesh_ReAlloc(mempool_t *mempool, shadowmesh_t *oldmesh, int light, int neighbors)
834 {
835         shadowmesh_t *newmesh;
836         newmesh = Mod_ShadowMesh_Alloc(mempool, oldmesh->numverts, oldmesh->numtriangles, oldmesh->map_diffuse, oldmesh->map_specular, oldmesh->map_normal, light, neighbors, false);
837         newmesh->numverts = oldmesh->numverts;
838         newmesh->numtriangles = oldmesh->numtriangles;
839
840         memcpy(newmesh->vertex3f, oldmesh->vertex3f, oldmesh->numverts * sizeof(float[3]));
841         if (newmesh->svector3f && oldmesh->svector3f)
842         {
843                 memcpy(newmesh->svector3f, oldmesh->svector3f, oldmesh->numverts * sizeof(float[3]));
844                 memcpy(newmesh->tvector3f, oldmesh->tvector3f, oldmesh->numverts * sizeof(float[3]));
845                 memcpy(newmesh->normal3f, oldmesh->normal3f, oldmesh->numverts * sizeof(float[3]));
846                 memcpy(newmesh->texcoord2f, oldmesh->texcoord2f, oldmesh->numverts * sizeof(float[2]));
847         }
848         memcpy(newmesh->element3i, oldmesh->element3i, oldmesh->numtriangles * sizeof(int[3]));
849         if (newmesh->neighbor3i && oldmesh->neighbor3i)
850                 memcpy(newmesh->neighbor3i, oldmesh->neighbor3i, oldmesh->numtriangles * sizeof(int[3]));
851         return newmesh;
852 }
853
854 int Mod_ShadowMesh_AddVertex(shadowmesh_t *mesh, float *vertex14f)
855 {
856         int hashindex, vnum;
857         shadowmeshvertexhash_t *hash;
858         // this uses prime numbers intentionally
859         hashindex = (unsigned int) (vertex14f[0] * 3 + vertex14f[1] * 5 + vertex14f[2] * 7) % SHADOWMESHVERTEXHASH;
860         for (hash = mesh->vertexhashtable[hashindex];hash;hash = hash->next)
861         {
862                 vnum = (hash - mesh->vertexhashentries);
863                 if ((mesh->vertex3f == NULL || (mesh->vertex3f[vnum * 3 + 0] == vertex14f[0] && mesh->vertex3f[vnum * 3 + 1] == vertex14f[1] && mesh->vertex3f[vnum * 3 + 2] == vertex14f[2]))
864                  && (mesh->svector3f == NULL || (mesh->svector3f[vnum * 3 + 0] == vertex14f[3] && mesh->svector3f[vnum * 3 + 1] == vertex14f[4] && mesh->svector3f[vnum * 3 + 2] == vertex14f[5]))
865                  && (mesh->tvector3f == NULL || (mesh->tvector3f[vnum * 3 + 0] == vertex14f[6] && mesh->tvector3f[vnum * 3 + 1] == vertex14f[7] && mesh->tvector3f[vnum * 3 + 2] == vertex14f[8]))
866                  && (mesh->normal3f == NULL || (mesh->normal3f[vnum * 3 + 0] == vertex14f[9] && mesh->normal3f[vnum * 3 + 1] == vertex14f[10] && mesh->normal3f[vnum * 3 + 2] == vertex14f[11]))
867                  && (mesh->texcoord2f == NULL || (mesh->texcoord2f[vnum * 2 + 0] == vertex14f[12] && mesh->texcoord2f[vnum * 2 + 1] == vertex14f[13])))
868                         return hash - mesh->vertexhashentries;
869         }
870         vnum = mesh->numverts++;
871         hash = mesh->vertexhashentries + vnum;
872         hash->next = mesh->vertexhashtable[hashindex];
873         mesh->vertexhashtable[hashindex] = hash;
874         if (mesh->vertex3f) {mesh->vertex3f[vnum * 3 + 0] = vertex14f[0];mesh->vertex3f[vnum * 3 + 1] = vertex14f[1];mesh->vertex3f[vnum * 3 + 2] = vertex14f[2];}
875         if (mesh->svector3f) {mesh->svector3f[vnum * 3 + 0] = vertex14f[3];mesh->svector3f[vnum * 3 + 1] = vertex14f[4];mesh->svector3f[vnum * 3 + 2] = vertex14f[5];}
876         if (mesh->tvector3f) {mesh->tvector3f[vnum * 3 + 0] = vertex14f[6];mesh->tvector3f[vnum * 3 + 1] = vertex14f[7];mesh->tvector3f[vnum * 3 + 2] = vertex14f[8];}
877         if (mesh->normal3f) {mesh->normal3f[vnum * 3 + 0] = vertex14f[9];mesh->normal3f[vnum * 3 + 1] = vertex14f[10];mesh->normal3f[vnum * 3 + 2] = vertex14f[11];}
878         if (mesh->texcoord2f) {mesh->texcoord2f[vnum * 2 + 0] = vertex14f[12];mesh->texcoord2f[vnum * 2 + 1] = vertex14f[13];}
879         return vnum;
880 }
881
882 void Mod_ShadowMesh_AddTriangle(mempool_t *mempool, shadowmesh_t *mesh, rtexture_t *map_diffuse, rtexture_t *map_specular, rtexture_t *map_normal, float *vertex14f)
883 {
884         if (mesh->numtriangles == 0)
885         {
886                 // set the properties on this empty mesh to be more favorable...
887                 // (note: this case only occurs for the first triangle added to a new mesh chain)
888                 mesh->map_diffuse = map_diffuse;
889                 mesh->map_specular = map_specular;
890                 mesh->map_normal = map_normal;
891         }
892         while (mesh->map_diffuse != map_diffuse || mesh->map_specular != map_specular || mesh->map_normal != map_normal || mesh->numverts + 3 > mesh->maxverts || mesh->numtriangles + 1 > mesh->maxtriangles)
893         {
894                 if (mesh->next == NULL)
895                         mesh->next = Mod_ShadowMesh_Alloc(mempool, max(mesh->maxverts, 300), max(mesh->maxtriangles, 100), map_diffuse, map_specular, map_normal, mesh->svector3f != NULL, mesh->neighbor3i != NULL, true);
896                 mesh = mesh->next;
897         }
898         mesh->element3i[mesh->numtriangles * 3 + 0] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 0);
899         mesh->element3i[mesh->numtriangles * 3 + 1] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 1);
900         mesh->element3i[mesh->numtriangles * 3 + 2] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 2);
901         mesh->numtriangles++;
902 }
903
904 void Mod_ShadowMesh_AddMesh(mempool_t *mempool, shadowmesh_t *mesh, rtexture_t *map_diffuse, rtexture_t *map_specular, rtexture_t *map_normal, const float *vertex3f, const float *svector3f, const float *tvector3f, const float *normal3f, const float *texcoord2f, int numtris, const int *element3i)
905 {
906         int i, j, e;
907         float vbuf[3*14], *v;
908         memset(vbuf, 0, sizeof(vbuf));
909         for (i = 0;i < numtris;i++)
910         {
911                 for (j = 0, v = vbuf;j < 3;j++, v += 14)
912                 {
913                         e = *element3i++;
914                         if (vertex3f)
915                         {
916                                 v[0] = vertex3f[e * 3 + 0];
917                                 v[1] = vertex3f[e * 3 + 1];
918                                 v[2] = vertex3f[e * 3 + 2];
919                         }
920                         if (svector3f)
921                         {
922                                 v[3] = svector3f[e * 3 + 0];
923                                 v[4] = svector3f[e * 3 + 1];
924                                 v[5] = svector3f[e * 3 + 2];
925                         }
926                         if (tvector3f)
927                         {
928                                 v[6] = tvector3f[e * 3 + 0];
929                                 v[7] = tvector3f[e * 3 + 1];
930                                 v[8] = tvector3f[e * 3 + 2];
931                         }
932                         if (normal3f)
933                         {
934                                 v[9] = normal3f[e * 3 + 0];
935                                 v[10] = normal3f[e * 3 + 1];
936                                 v[11] = normal3f[e * 3 + 2];
937                         }
938                         if (texcoord2f)
939                         {
940                                 v[12] = texcoord2f[e * 2 + 0];
941                                 v[13] = texcoord2f[e * 2 + 1];
942                         }
943                 }
944                 Mod_ShadowMesh_AddTriangle(mempool, mesh, map_diffuse, map_specular, map_normal, vbuf);
945         }
946 }
947
948 shadowmesh_t *Mod_ShadowMesh_Begin(mempool_t *mempool, int maxverts, int maxtriangles, rtexture_t *map_diffuse, rtexture_t *map_specular, rtexture_t *map_normal, int light, int neighbors, int expandable)
949 {
950         return Mod_ShadowMesh_Alloc(mempool, maxverts, maxtriangles, map_diffuse, map_specular, map_normal, light, neighbors, expandable);
951 }
952
953 shadowmesh_t *Mod_ShadowMesh_Finish(mempool_t *mempool, shadowmesh_t *firstmesh, int light, int neighbors)
954 {
955         shadowmesh_t *mesh, *newmesh, *nextmesh;
956         // reallocate meshs to conserve space
957         for (mesh = firstmesh, firstmesh = NULL;mesh;mesh = nextmesh)
958         {
959                 nextmesh = mesh->next;
960                 if (mesh->numverts >= 3 && mesh->numtriangles >= 1)
961                 {
962                         newmesh = Mod_ShadowMesh_ReAlloc(mempool, mesh, light, neighbors);
963                         newmesh->next = firstmesh;
964                         firstmesh = newmesh;
965                 }
966                 Mem_Free(mesh);
967         }
968         return firstmesh;
969 }
970
971 void Mod_ShadowMesh_CalcBBox(shadowmesh_t *firstmesh, vec3_t mins, vec3_t maxs, vec3_t center, float *radius)
972 {
973         int i;
974         shadowmesh_t *mesh;
975         vec3_t nmins, nmaxs, ncenter, temp;
976         float nradius2, dist2, *v;
977         // calculate bbox
978         for (mesh = firstmesh;mesh;mesh = mesh->next)
979         {
980                 if (mesh == firstmesh)
981                 {
982                         VectorCopy(mesh->vertex3f, nmins);
983                         VectorCopy(mesh->vertex3f, nmaxs);
984                 }
985                 for (i = 0, v = mesh->vertex3f;i < mesh->numverts;i++, v += 3)
986                 {
987                         if (nmins[0] > v[0]) nmins[0] = v[0];if (nmaxs[0] < v[0]) nmaxs[0] = v[0];
988                         if (nmins[1] > v[1]) nmins[1] = v[1];if (nmaxs[1] < v[1]) nmaxs[1] = v[1];
989                         if (nmins[2] > v[2]) nmins[2] = v[2];if (nmaxs[2] < v[2]) nmaxs[2] = v[2];
990                 }
991         }
992         // calculate center and radius
993         ncenter[0] = (nmins[0] + nmaxs[0]) * 0.5f;
994         ncenter[1] = (nmins[1] + nmaxs[1]) * 0.5f;
995         ncenter[2] = (nmins[2] + nmaxs[2]) * 0.5f;
996         nradius2 = 0;
997         for (mesh = firstmesh;mesh;mesh = mesh->next)
998         {
999                 for (i = 0, v = mesh->vertex3f;i < mesh->numverts;i++, v += 3)
1000                 {
1001                         VectorSubtract(v, ncenter, temp);
1002                         dist2 = DotProduct(temp, temp);
1003                         if (nradius2 < dist2)
1004                                 nradius2 = dist2;
1005                 }
1006         }
1007         // return data
1008         if (mins)
1009                 VectorCopy(nmins, mins);
1010         if (maxs)
1011                 VectorCopy(nmaxs, maxs);
1012         if (center)
1013                 VectorCopy(ncenter, center);
1014         if (radius)
1015                 *radius = sqrt(nradius2);
1016 }
1017
1018 void Mod_ShadowMesh_Free(shadowmesh_t *mesh)
1019 {
1020         shadowmesh_t *nextmesh;
1021         for (;mesh;mesh = nextmesh)
1022         {
1023                 nextmesh = mesh->next;
1024                 Mem_Free(mesh);
1025         }
1026 }
1027
1028 static rtexture_t *GL_TextureForSkinLayer(const qbyte *in, int width, int height, const char *name, const unsigned int *palette, int textureflags)
1029 {
1030         int i;
1031         for (i = 0;i < width*height;i++)
1032                 if (((qbyte *)&palette[in[i]])[3] > 0)
1033                         return R_LoadTexture2D (loadmodel->texturepool, name, width, height, in, TEXTYPE_PALETTE, textureflags, palette);
1034         return NULL;
1035 }
1036
1037 static int detailtexturecycle = 0;
1038 int Mod_LoadSkinFrame(skinframe_t *skinframe, char *basename, int textureflags, int loadpantsandshirt, int usedetailtexture, int loadglowtexture)
1039 {
1040         imageskin_t s;
1041         memset(skinframe, 0, sizeof(*skinframe));
1042         if (!image_loadskin(&s, basename))
1043                 return false;
1044         if (usedetailtexture)
1045                 skinframe->detail = mod_shared_detailtextures[(detailtexturecycle++) % NUM_DETAILTEXTURES];
1046         skinframe->base = R_LoadTexture2D (loadmodel->texturepool, basename, s.basepixels_width, s.basepixels_height, s.basepixels, TEXTYPE_RGBA, textureflags, NULL);
1047         if (s.nmappixels != NULL)
1048                 skinframe->nmap = R_LoadTexture2D (loadmodel->texturepool, va("%s_nmap", basename), s.nmappixels_width, s.nmappixels_height, s.nmappixels, TEXTYPE_RGBA, textureflags, NULL);
1049         if (s.glosspixels != NULL)
1050                 skinframe->gloss = R_LoadTexture2D (loadmodel->texturepool, va("%s_gloss", basename), s.glosspixels_width, s.glosspixels_height, s.glosspixels, TEXTYPE_RGBA, textureflags, NULL);
1051         if (s.glowpixels != NULL && loadglowtexture)
1052                 skinframe->glow = R_LoadTexture2D (loadmodel->texturepool, va("%s_glow", basename), s.glowpixels_width, s.glowpixels_height, s.glowpixels, TEXTYPE_RGBA, textureflags, NULL);
1053         if (s.maskpixels != NULL)
1054                 skinframe->fog = R_LoadTexture2D (loadmodel->texturepool, va("%s_mask", basename), s.maskpixels_width, s.maskpixels_height, s.maskpixels, TEXTYPE_RGBA, textureflags, NULL);
1055         if (loadpantsandshirt)
1056         {
1057                 if (s.pantspixels != NULL)
1058                         skinframe->pants = R_LoadTexture2D (loadmodel->texturepool, va("%s_pants", basename), s.pantspixels_width, s.pantspixels_height, s.pantspixels, TEXTYPE_RGBA, textureflags, NULL);
1059                 if (s.shirtpixels != NULL)
1060                         skinframe->shirt = R_LoadTexture2D (loadmodel->texturepool, va("%s_shirt", basename), s.shirtpixels_width, s.shirtpixels_height, s.shirtpixels, TEXTYPE_RGBA, textureflags, NULL);
1061         }
1062         image_freeskin(&s);
1063         return true;
1064 }
1065
1066 int Mod_LoadSkinFrame_Internal(skinframe_t *skinframe, char *basename, int textureflags, int loadpantsandshirt, int usedetailtexture, int loadglowtexture, qbyte *skindata, int width, int height)
1067 {
1068         qbyte *temp1, *temp2;
1069         memset(skinframe, 0, sizeof(*skinframe));
1070         if (!skindata)
1071                 return false;
1072         if (usedetailtexture)
1073                 skinframe->detail = mod_shared_detailtextures[(detailtexturecycle++) % NUM_DETAILTEXTURES];
1074         if (r_shadow_bumpscale_basetexture.value > 0)
1075         {
1076                 temp1 = Mem_Alloc(loadmodel->mempool, width * height * 8);
1077                 temp2 = temp1 + width * height * 4;
1078                 Image_Copy8bitRGBA(skindata, temp1, width * height, palette_nofullbrights);
1079                 Image_HeightmapToNormalmap(temp1, temp2, width, height, false, r_shadow_bumpscale_basetexture.value);
1080                 skinframe->nmap = R_LoadTexture2D(loadmodel->texturepool, va("%s_nmap", basename), width, height, temp2, TEXTYPE_RGBA, textureflags, NULL);
1081                 Mem_Free(temp1);
1082         }
1083         if (loadglowtexture)
1084         {
1085                 skinframe->glow = GL_TextureForSkinLayer(skindata, width, height, va("%s_glow", basename), palette_onlyfullbrights, textureflags); // glow
1086                 skinframe->base = skinframe->merged = GL_TextureForSkinLayer(skindata, width, height, va("%s_merged", basename), palette_nofullbrights, textureflags); // all but fullbrights
1087                 if (loadpantsandshirt)
1088                 {
1089                         skinframe->pants = GL_TextureForSkinLayer(skindata, width, height, va("%s_pants", basename), palette_pantsaswhite, textureflags); // pants
1090                         skinframe->shirt = GL_TextureForSkinLayer(skindata, width, height, va("%s_shirt", basename), palette_shirtaswhite, textureflags); // shirt
1091                         if (skinframe->pants || skinframe->shirt)
1092                                 skinframe->base = GL_TextureForSkinLayer(skindata, width, height, va("%s_nospecial", basename), palette_nocolormapnofullbrights, textureflags); // no special colors
1093                 }
1094         }
1095         else
1096         {
1097                 skinframe->base = skinframe->merged = GL_TextureForSkinLayer(skindata, width, height, va("%s_merged", basename), palette_complete, textureflags); // all
1098                 if (loadpantsandshirt)
1099                 {
1100                         skinframe->pants = GL_TextureForSkinLayer(skindata, width, height, va("%s_pants", basename), palette_pantsaswhite, textureflags); // pants
1101                         skinframe->shirt = GL_TextureForSkinLayer(skindata, width, height, va("%s_shirt", basename), palette_shirtaswhite, textureflags); // shirt
1102                         if (skinframe->pants || skinframe->shirt)
1103                                 skinframe->base = GL_TextureForSkinLayer(skindata, width, height, va("%s_nospecial", basename), palette_nocolormap, textureflags); // no pants or shirt
1104                 }
1105         }
1106         return true;
1107 }
1108
1109 void Mod_GetTerrainVertex3fTexCoord2fFromRGBA(const qbyte *imagepixels, int imagewidth, int imageheight, int ix, int iy, float *vertex3f, float *texcoord2f, matrix4x4_t *pixelstepmatrix, matrix4x4_t *pixeltexturestepmatrix)
1110 {
1111         float v[3], tc[3];
1112         v[0] = ix;
1113         v[1] = iy;
1114         if (ix >= 0 && iy >= 0 && ix < imagewidth && iy < imageheight)
1115                 v[2] = (imagepixels[((iy*imagewidth)+ix)*4+0] + imagepixels[((iy*imagewidth)+ix)*4+1] + imagepixels[((iy*imagewidth)+ix)*4+2]) * (1.0f / 765.0f);
1116         else
1117                 v[2] = 0;
1118         Matrix4x4_Transform(pixelstepmatrix, v, vertex3f);
1119         Matrix4x4_Transform(pixeltexturestepmatrix, v, tc);
1120         texcoord2f[0] = tc[0];
1121         texcoord2f[1] = tc[1];
1122 }
1123
1124 void Mod_GetTerrainVertexFromRGBA(const qbyte *imagepixels, int imagewidth, int imageheight, int ix, int iy, float *vertex3f, float *svector3f, float *tvector3f, float *normal3f, float *texcoord2f, matrix4x4_t *pixelstepmatrix, matrix4x4_t *pixeltexturestepmatrix)
1125 {
1126         float vup[3], vdown[3], vleft[3], vright[3];
1127         float tcup[3], tcdown[3], tcleft[3], tcright[3];
1128         float sv[3], tv[3], nl[3];
1129         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy, vertex3f, texcoord2f, pixelstepmatrix, pixeltexturestepmatrix);
1130         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy - 1, vup, tcup, pixelstepmatrix, pixeltexturestepmatrix);
1131         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy + 1, vdown, tcdown, pixelstepmatrix, pixeltexturestepmatrix);
1132         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix - 1, iy, vleft, tcleft, pixelstepmatrix, pixeltexturestepmatrix);
1133         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix + 1, iy, vright, tcright, pixelstepmatrix, pixeltexturestepmatrix);
1134         Mod_BuildBumpVectors(vertex3f, vup, vright, texcoord2f, tcup, tcright, svector3f, tvector3f, normal3f);
1135         Mod_BuildBumpVectors(vertex3f, vright, vdown, texcoord2f, tcright, tcdown, sv, tv, nl);
1136         VectorAdd(svector3f, sv, svector3f);
1137         VectorAdd(tvector3f, tv, tvector3f);
1138         VectorAdd(normal3f, nl, normal3f);
1139         Mod_BuildBumpVectors(vertex3f, vdown, vleft, texcoord2f, tcdown, tcleft, sv, tv, nl);
1140         VectorAdd(svector3f, sv, svector3f);
1141         VectorAdd(tvector3f, tv, tvector3f);
1142         VectorAdd(normal3f, nl, normal3f);
1143         Mod_BuildBumpVectors(vertex3f, vleft, vup, texcoord2f, tcleft, tcup, sv, tv, nl);
1144         VectorAdd(svector3f, sv, svector3f);
1145         VectorAdd(tvector3f, tv, tvector3f);
1146         VectorAdd(normal3f, nl, normal3f);
1147 }
1148
1149 void Mod_ConstructTerrainPatchFromRGBA(const qbyte *imagepixels, int imagewidth, int imageheight, int x1, int y1, int width, int height, int *element3i, int *neighbor3i, float *vertex3f, float *svector3f, float *tvector3f, float *normal3f, float *texcoord2f, matrix4x4_t *pixelstepmatrix, matrix4x4_t *pixeltexturestepmatrix)
1150 {
1151         int x, y, ix, iy, *e;
1152         e = element3i;
1153         for (y = 0;y < height;y++)
1154         {
1155                 for (x = 0;x < width;x++)
1156                 {
1157                         e[0] = (y + 1) * (width + 1) + (x + 0);
1158                         e[1] = (y + 0) * (width + 1) + (x + 0);
1159                         e[2] = (y + 1) * (width + 1) + (x + 1);
1160                         e[3] = (y + 0) * (width + 1) + (x + 0);
1161                         e[4] = (y + 0) * (width + 1) + (x + 1);
1162                         e[5] = (y + 1) * (width + 1) + (x + 1);
1163                         e += 6;
1164                 }
1165         }
1166         Mod_BuildTriangleNeighbors(neighbor3i, element3i, width*height*2);
1167         for (y = 0, iy = y1;y < height + 1;y++, iy++)
1168                 for (x = 0, ix = x1;x < width + 1;x++, ix++, vertex3f += 3, texcoord2f += 2, svector3f += 3, tvector3f += 3, normal3f += 3)
1169                         Mod_GetTerrainVertexFromRGBA(imagepixels, imagewidth, imageheight, ix, iy, vertex3f, texcoord2f, svector3f, tvector3f, normal3f, pixelstepmatrix, pixeltexturestepmatrix);
1170 }
1171
1172 skinfile_t *Mod_LoadSkinFiles(void)
1173 {
1174         int i, words, numtags, line, tagsetsused = false, wordsoverflow;
1175         char *text;
1176         const char *data;
1177         skinfile_t *skinfile = NULL, *first = NULL;
1178         skinfileitem_t *skinfileitem;
1179         char word[10][MAX_QPATH];
1180         overridetagnameset_t tagsets[MAX_SKINS];
1181         overridetagname_t tags[256];
1182
1183 /*
1184 sample file:
1185 U_bodyBox,models/players/Legoman/BikerA2.tga
1186 U_RArm,models/players/Legoman/BikerA1.tga
1187 U_LArm,models/players/Legoman/BikerA1.tga
1188 U_armor,common/nodraw
1189 U_sword,common/nodraw
1190 U_shield,common/nodraw
1191 U_homb,common/nodraw
1192 U_backpack,common/nodraw
1193 U_colcha,common/nodraw
1194 tag_head,
1195 tag_weapon,
1196 tag_torso,
1197 */
1198         memset(tagsets, 0, sizeof(tagsets));
1199         memset(word, 0, sizeof(word));
1200         for (i = 0;i < MAX_SKINS && (data = text = FS_LoadFile(va("%s_%i.skin", loadmodel->name, i), tempmempool, true));i++)
1201         {
1202                 numtags = 0;
1203
1204                 // If it's the first file we parse
1205                 if (skinfile == NULL)
1206                 {
1207                         skinfile = Mem_Alloc(tempmempool, sizeof(skinfile_t));
1208                         first = skinfile;
1209                 }
1210                 else
1211                 {
1212                         skinfile->next = Mem_Alloc(tempmempool, sizeof(skinfile_t));
1213                         skinfile = skinfile->next;
1214                 }
1215                 skinfile->next = NULL;
1216
1217                 for(line = 0;;line++)
1218                 {
1219                         // parse line
1220                         if (!COM_ParseToken(&data, true))
1221                                 break;
1222                         if (!strcmp(com_token, "\n"))
1223                                 continue;
1224                         words = 0;
1225                         wordsoverflow = false;
1226                         do
1227                         {
1228                                 if (words < 10)
1229                                         strlcpy(word[words++], com_token, sizeof (word[0]));
1230                                 else
1231                                         wordsoverflow = true;
1232                         }
1233                         while (COM_ParseToken(&data, true) && strcmp(com_token, "\n"));
1234                         if (wordsoverflow)
1235                         {
1236                                 Con_Printf("Mod_LoadSkinFiles: parsing error in file \"%s_%i.skin\" on line #%i: line with too many statements, skipping\n", loadmodel->name, i, line);
1237                                 continue;
1238                         }
1239                         // words is always >= 1
1240                         if (!strcmp(word[0], "replace"))
1241                         {
1242                                 if (words == 3)
1243                                 {
1244                                         Con_DPrintf("Mod_LoadSkinFiles: parsed mesh \"%s\" shader replacement \"%s\"\n", word[1], word[2]);
1245                                         skinfileitem = Mem_Alloc(tempmempool, sizeof(skinfileitem_t));
1246                                         skinfileitem->next = skinfile->items;
1247                                         skinfile->items = skinfileitem;
1248                                         strlcpy (skinfileitem->name, word[1], sizeof (skinfileitem->name));
1249                                         strlcpy (skinfileitem->replacement, word[2], sizeof (skinfileitem->replacement));
1250                                 }
1251                                 else
1252                                         Con_Printf("Mod_LoadSkinFiles: parsing error in file \"%s_%i.skin\" on line #%i: wrong number of parameters to command \"%s\", see documentation in DP_GFX_SKINFILES extension in dpextensions.qc\n", loadmodel->name, i, line, word[0]);
1253                         }
1254                         else if (words == 2 && !strcmp(word[1], ","))
1255                         {
1256                                 // tag name, like "tag_weapon,"
1257                                 Con_DPrintf("Mod_LoadSkinFiles: parsed tag #%i \"%s\"\n", numtags, word[0]);
1258                                 memset(tags + numtags, 0, sizeof(tags[numtags]));
1259                                 strlcpy (tags[numtags].name, word[0], sizeof (tags[numtags].name));
1260                                 numtags++;
1261                         }
1262                         else if (words == 3 && !strcmp(word[1], ","))
1263                         {
1264                                 // mesh shader name, like "U_RArm,models/players/Legoman/BikerA1.tga"
1265                                 Con_DPrintf("Mod_LoadSkinFiles: parsed mesh \"%s\" shader replacement \"%s\"\n", word[0], word[2]);
1266                                 skinfileitem = Mem_Alloc(tempmempool, sizeof(skinfileitem_t));
1267                                 skinfileitem->next = skinfile->items;
1268                                 skinfile->items = skinfileitem;
1269                                 strlcpy (skinfileitem->name, word[0], sizeof (skinfileitem->name));
1270                                 strlcpy (skinfileitem->replacement, word[2], sizeof (skinfileitem->replacement));
1271                         }
1272                         else
1273                                 Con_Printf("Mod_LoadSkinFiles: parsing error in file \"%s_%i.skin\" on line #%i: does not look like tag or mesh specification, or replace command, see documentation in DP_GFX_SKINFILES extension in dpextensions.qc\n", loadmodel->name, i, line);
1274                 }
1275                 Mem_Free(text);
1276
1277                 if (numtags)
1278                 {
1279                         overridetagnameset_t *t;
1280                         t = tagsets + i;
1281                         t->num_overridetagnames = numtags;
1282                         t->data_overridetagnames = Mem_Alloc(loadmodel->mempool, t->num_overridetagnames * sizeof(overridetagname_t));
1283                         memcpy(t->data_overridetagnames, tags, t->num_overridetagnames * sizeof(overridetagname_t));
1284                         tagsetsused = true;
1285                 }
1286         }
1287         if (tagsetsused)
1288         {
1289                 loadmodel->data_overridetagnamesforskin = Mem_Alloc(loadmodel->mempool, i * sizeof(overridetagnameset_t));
1290                 memcpy(loadmodel->data_overridetagnamesforskin, tagsets, i * sizeof(overridetagnameset_t));
1291         }
1292         if (i)
1293                 loadmodel->numskins = i;
1294         return first;
1295 }
1296
1297 void Mod_FreeSkinFiles(skinfile_t *skinfile)
1298 {
1299         skinfile_t *next;
1300         skinfileitem_t *skinfileitem, *nextitem;
1301         for (;skinfile;skinfile = next)
1302         {
1303                 next = skinfile->next;
1304                 for (skinfileitem = skinfile->items;skinfileitem;skinfileitem = nextitem)
1305                 {
1306                         nextitem = skinfileitem->next;
1307                         Mem_Free(skinfileitem);
1308                 }
1309                 Mem_Free(skinfile);
1310         }
1311 }
1312
1313 int Mod_CountSkinFiles(skinfile_t *skinfile)
1314 {
1315         int i;
1316         for (i = 0;skinfile;skinfile = skinfile->next, i++);
1317         return i;
1318 }
1319
1320 void Mod_SnapVertices(int numcomponents, int numvertices, float *vertices, float snap)
1321 {
1322         int i;
1323         double isnap = 1.0 / snap;
1324         for (i = 0;i < numvertices*numcomponents;i++)
1325                 vertices[i] = floor(vertices[i]*isnap)*snap;
1326 }
1327
1328 int Mod_RemoveDegenerateTriangles(int numtriangles, const int *inelement3i, int *outelement3i, const float *vertex3f)
1329 {
1330         int i, outtriangles;
1331         float d, edgedir[3], temp[3];
1332         // a degenerate triangle is one with no width (thickness, surface area)
1333         // these are characterized by having all 3 points colinear (along a line)
1334         // or having two points identical
1335         for (i = 0, outtriangles = 0;i < numtriangles;i++, inelement3i += 3)
1336         {
1337                 // calculate first edge
1338                 VectorSubtract(vertex3f + inelement3i[1] * 3, vertex3f + inelement3i[0] * 3, edgedir);
1339                 if (VectorLength2(edgedir) < 0.0001f)
1340                         continue; // degenerate first edge (no length)
1341                 VectorNormalize(edgedir);
1342                 // check if third point is on the edge (colinear)
1343                 d = -DotProduct(vertex3f + inelement3i[2] * 3, edgedir);
1344                 VectorMA(vertex3f + inelement3i[2] * 3, d, edgedir, temp);
1345                 if (VectorLength2(temp) < 0.0001f)
1346                         continue; // third point colinear with first edge
1347                 // valid triangle (no colinear points, no duplicate points)
1348                 VectorCopy(inelement3i, outelement3i);
1349                 outelement3i += 3;
1350                 outtriangles++;
1351         }
1352         return outtriangles;
1353 }
1354