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_brush)
 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->needload = true;
 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->needload = true;
 293         if (mod->needload || checkdisk)
 294         {
 295                 if (checkdisk && !mod->needload)
 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->needload = true;
 303                 }
 304         }
 305         if (!mod->needload)
 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         // load the model
 312         mod->isworldmodel = isworldmodel;
 313         mod->used = true;
 314         mod->crc = crc;
 315         // errors can prevent the corresponding mod->needload = false;
 316         mod->needload = true;
 317
 318         // default model radius and bounding box (mainly for missing models)
 319         mod->radius = 16;
 320         VectorSet(mod->normalmins, -mod->radius, -mod->radius, -mod->radius);
 321         VectorSet(mod->normalmaxs, mod->radius, mod->radius, mod->radius);
 322         VectorSet(mod->yawmins, -mod->radius, -mod->radius, -mod->radius);
 323         VectorSet(mod->yawmaxs, mod->radius, mod->radius, mod->radius);
 324         VectorSet(mod->rotatedmins, -mod->radius, -mod->radius, -mod->radius);
 325         VectorSet(mod->rotatedmaxs, mod->radius, mod->radius, mod->radius);
 326
 327         // all models use memory, so allocate a memory pool
 328         mod->mempool = Mem_AllocPool(mod->name, 0, NULL);
 329         // all models load textures, so allocate a texture pool
 330         if (cls.state != ca_dedicated)
 331                 mod->texturepool = R_AllocTexturePool();
 332
 333         if (buf)
 334         {
 335                 num = LittleLong(*((int *)buf));
 336                 // call the apropriate loader
 337                 loadmodel = mod;
 338                      if (!memcmp(buf, "IDPO", 4)) Mod_IDP0_Load(mod, buf);
 339                 else if (!memcmp(buf, "IDP2", 4)) Mod_IDP2_Load(mod, buf);
 340                 else if (!memcmp(buf, "IDP3", 4)) Mod_IDP3_Load(mod, buf);
 341                 else if (!memcmp(buf, "IDSP", 4)) Mod_IDSP_Load(mod, buf);
 342                 else if (!memcmp(buf, "IBSP", 4)) Mod_IBSP_Load(mod, buf);
 343                 else if (!memcmp(buf, "ZYMOTICMODEL", 12)) Mod_ZYMOTICMODEL_Load(mod, buf);
 344                 else if (strlen(mod->name) >= 4 && !strcmp(mod->name - 4, ".map")) Mod_MAP_Load(mod, buf);
 345                 else if (num == BSPVERSION || num == 30) Mod_Q1BSP_Load(mod, buf);
 346                 else Host_Error("Mod_LoadModel: model \"%s\" is of unknown/unsupported type\n", mod->name);
 347                 Mem_Free(buf);
 348         }
 349         else if (crash)
 350         {
 351                 // LordHavoc: Sys_Error was *ANNOYING*
 352                 Con_Printf ("Mod_LoadModel: %s not found", mod->name);
 353         }
 354
 355         // no errors occurred
 356         mod->needload = false;
 357         return mod;
 358 }
 359
 360 void Mod_CheckLoaded(model_t *mod)
 361 {
 362         if (mod)
 363         {
 364                 if (mod->needload)
 365                         Mod_LoadModel(mod, true, true, mod->isworldmodel);
 366                 else
 367                 {
 368                         //if (mod->type == mod_invalid)
 369                         //      Host_Error("Mod_CheckLoaded: invalid model\n");
 370                         mod->used = true;
 371                         return;
 372                 }
 373         }
 374 }
 375
 376 /*
 377 ===================
 378 Mod_ClearAll
 379 ===================
 380 */
 381 void Mod_ClearAll(void)
 382 {
 383 }
 384
 385 void Mod_ClearUsed(void)
 386 {
 387         int i;
 388         model_t *mod;
 389
 390         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
 391                 if (mod->name[0])
 392                         mod->used = false;
 393 }
 394
 395 void Mod_PurgeUnused(void)
 396 {
 397         int i;
 398         model_t *mod;
 399
 400         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
 401                 if (mod->name[0])
 402                         if (!mod->used)
 403                                 Mod_FreeModel(mod);
 404 }
 405
 406 void Mod_LoadModels(void)
 407 {
 408         int i;
 409         model_t *mod;
 410
 411         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
 412                 if (mod->name[0])
 413                         if (mod->used)
 414                                 Mod_CheckLoaded(mod);
 415 }
 416
 417 /*
 418 ==================
 419 Mod_FindName
 420
 421 ==================
 422 */
 423 model_t *Mod_FindName(const char *name)
 424 {
 425         int i;
 426         model_t *mod, *freemod;
 427
 428         if (!name[0])
 429                 Host_Error ("Mod_ForName: NULL name");
 430
 431 // search the currently loaded models
 432         freemod = NULL;
 433         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
 434         {
 435                 if (mod->name[0])
 436                 {
 437                         if (!strcmp (mod->name, name))
 438                         {
 439                                 mod->used = true;
 440                                 return mod;
 441                         }
 442                 }
 443                 else if (freemod == NULL)
 444                         freemod = mod;
 445         }
 446
 447         if (freemod)
 448         {
 449                 mod = freemod;
 450                 strcpy (mod->name, name);
 451                 mod->needload = true;
 452                 mod->used = true;
 453                 return mod;
 454         }
 455
 456         Host_Error ("Mod_FindName: ran out of models\n");
 457         return NULL;
 458 }
 459
 460 /*
 461 ==================
 462 Mod_TouchModel
 463
 464 ==================
 465 */
 466 void Mod_TouchModel(const char *name)
 467 {
 468         model_t *mod;
 469
 470         mod = Mod_FindName(name);
 471         mod->used = true;
 472 }
 473
 474 /*
 475 ==================
 476 Mod_ForName
 477
 478 Loads in a model for the given name
 479 ==================
 480 */
 481 model_t *Mod_ForName(const char *name, qboolean crash, qboolean checkdisk, qboolean isworldmodel)
 482 {
 483         return Mod_LoadModel(Mod_FindName(name), crash, checkdisk, isworldmodel);
 484 }
 485
 486 qbyte *mod_base;
 487
 488
 489 //=============================================================================
 490
 491 /*
 492 ================
 493 Mod_Print
 494 ================
 495 */
 496 static void Mod_Print(void)
 497 {
 498         int             i;
 499         model_t *mod;
 500
 501         Con_Print("Loaded models:\n");
 502         for (i = 0, mod = mod_known;i < MAX_MOD_KNOWN;i++, mod++)
 503                 if (mod->name[0])
 504                         Con_Printf("%4iK %s\n", mod->mempool ? (mod->mempool->totalsize + 1023) / 1024 : 0, mod->name);
 505 }
 506
 507 /*
 508 ================
 509 Mod_Precache
 510 ================
 511 */
 512 static void Mod_Precache(void)
 513 {
 514         if (Cmd_Argc() == 2)
 515                 Mod_ForName(Cmd_Argv(1), false, true, cl.worldmodel && !strcasecmp(Cmd_Argv(1), cl.worldmodel->name));
 516         else
 517                 Con_Print("usage: modelprecache <filename>\n");
 518 }
 519
 520 int Mod_BuildVertexRemapTableFromElements(int numelements, const int *elements, int numvertices, int *remapvertices)
 521 {
 522         int i, count;
 523         qbyte *used;
 524         used = Mem_Alloc(tempmempool, numvertices);
 525         memset(used, 0, numvertices);
 526         for (i = 0;i < numelements;i++)
 527                 used[elements[i]] = 1;
 528         for (i = 0, count = 0;i < numvertices;i++)
 529                 remapvertices[i] = used[i] ? count++ : -1;
 530         Mem_Free(used);
 531         return count;
 532 }
 533
 534 #if 1
 535 // fast way, using an edge hash
 536 #define TRIANGLEEDGEHASH 1024
 537 void Mod_BuildTriangleNeighbors(int *neighbors, const int *elements, int numtriangles)
 538 {
 539         int i, j, p, e1, e2, *n, hashindex, count, match;
 540         const int *e;
 541         typedef struct edgehashentry_s
 542         {
 543                 struct edgehashentry_s *next;
 544                 int triangle;
 545                 int element[2];
 546         }
 547         edgehashentry_t;
 548         edgehashentry_t *edgehash[TRIANGLEEDGEHASH], *edgehashentries, edgehashentriesbuffer[TRIANGLEEDGEHASH*3], *hash;
 549         memset(edgehash, 0, sizeof(edgehash));
 550         edgehashentries = edgehashentriesbuffer;
 551         // if there are too many triangles for the stack array, allocate larger buffer
 552         if (numtriangles > TRIANGLEEDGEHASH)
 553                 edgehashentries = Mem_Alloc(tempmempool, numtriangles * 3 * sizeof(edgehashentry_t));
 554         // find neighboring triangles
 555         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
 556         {
 557                 for (j = 0, p = 2;j < 3;p = j, j++)
 558                 {
 559                         e1 = e[p];
 560                         e2 = e[j];
 561                         // this hash index works for both forward and backward edges
 562                         hashindex = (unsigned int)(e1 + e2) % TRIANGLEEDGEHASH;
 563                         hash = edgehashentries + i * 3 + j;
 564                         hash->next = edgehash[hashindex];
 565                         edgehash[hashindex] = hash;
 566                         hash->triangle = i;
 567                         hash->element[0] = e1;
 568                         hash->element[1] = e2;
 569                 }
 570         }
 571         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
 572         {
 573                 for (j = 0, p = 2;j < 3;p = j, j++)
 574                 {
 575                         e1 = e[p];
 576                         e2 = e[j];
 577                         // this hash index works for both forward and backward edges
 578                         hashindex = (unsigned int)(e1 + e2) % TRIANGLEEDGEHASH;
 579                         count = 0;
 580                         match = -1;
 581                         for (hash = edgehash[hashindex];hash;hash = hash->next)
 582                         {
 583                                 if (hash->element[0] == e2 && hash->element[1] == e1)
 584                                 {
 585                                         if (hash->triangle != i)
 586                                                 match = hash->triangle;
 587                                         count++;
 588                                 }
 589                                 else if ((hash->element[0] == e1 && hash->element[1] == e2))
 590                                         count++;
 591                         }
 592                         // detect edges shared by three triangles and make them seams
 593                         if (count > 2)
 594                                 match = -1;
 595                         n[p] = match;
 596                 }
 597         }
 598         // free the allocated buffer
 599         if (edgehashentries != edgehashentriesbuffer)
 600                 Mem_Free(edgehashentries);
 601 }
 602 #else
 603 // very slow but simple way
 604 static int Mod_FindTriangleWithEdge(const int *elements, int numtriangles, int start, int end, int ignore)
 605 {
 606         int i, match, count;
 607         count = 0;
 608         match = -1;
 609         for (i = 0;i < numtriangles;i++, elements += 3)
 610         {
 611                      if ((elements[0] == start && elements[1] == end)
 612                       || (elements[1] == start && elements[2] == end)
 613                       || (elements[2] == start && elements[0] == end))
 614                 {
 615                         if (i != ignore)
 616                                 match = i;
 617                         count++;
 618                 }
 619                 else if ((elements[1] == start && elements[0] == end)
 620                       || (elements[2] == start && elements[1] == end)
 621                       || (elements[0] == start && elements[2] == end))
 622                         count++;
 623         }
 624         // detect edges shared by three triangles and make them seams
 625         if (count > 2)
 626                 match = -1;
 627         return match;
 628 }
 629
 630 void Mod_BuildTriangleNeighbors(int *neighbors, const int *elements, int numtriangles)
 631 {
 632         int i, *n;
 633         const int *e;
 634         for (i = 0, e = elements, n = neighbors;i < numtriangles;i++, e += 3, n += 3)
 635         {
 636                 n[0] = Mod_FindTriangleWithEdge(elements, numtriangles, e[1], e[0], i);
 637                 n[1] = Mod_FindTriangleWithEdge(elements, numtriangles, e[2], e[1], i);
 638                 n[2] = Mod_FindTriangleWithEdge(elements, numtriangles, e[0], e[2], i);
 639         }
 640 }
 641 #endif
 642
 643 void Mod_ValidateElements(const int *elements, int numtriangles, int numverts, const char *filename, int fileline)
 644 {
 645         int i;
 646         for (i = 0;i < numtriangles * 3;i++)
 647                 if ((unsigned int)elements[i] >= (unsigned int)numverts)
 648                         Con_Printf("Mod_ValidateElements: out of bounds element detected at %s:%d\n", filename, fileline);
 649 }
 650
 651 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)
 652 {
 653         float f, tangentcross[3], v10[3], v20[3], tc10[2], tc20[2];
 654         // 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
 655         // 12 add, 28 subtract, 57 multiply, 3 divide, 3 sqrt, 4 compare, 50% chance of 6 negates
 656
 657         // 18 multiply, 19 subtract
 658         VectorSubtract(v1, v0, v10);
 659         VectorSubtract(v2, v0, v20);
 660         normal3f[0] = v10[1] * v20[2] - v10[2] * v20[1];
 661         normal3f[1] = v10[2] * v20[0] - v10[0] * v20[2];
 662         normal3f[2] = v10[0] * v20[1] - v10[1] * v20[0];
 663         tc10[1] = tc1[1] - tc0[1];
 664         tc20[1] = tc2[1] - tc0[1];
 665         svector3f[0] = tc10[1] * v20[0] - tc20[1] * v10[0];
 666         svector3f[1] = tc10[1] * v20[1] - tc20[1] * v10[1];
 667         svector3f[2] = tc10[1] * v20[2] - tc20[1] * v10[2];
 668         tc10[0] = tc1[0] - tc0[0];
 669         tc20[0] = tc2[0] - tc0[0];
 670         tvector3f[0] = tc10[0] * v20[0] - tc20[0] * v10[0];
 671         tvector3f[1] = tc10[0] * v20[1] - tc20[0] * v10[1];
 672         tvector3f[2] = tc10[0] * v20[2] - tc20[0] * v10[2];
 673         // 1 sqrt, 1 divide, 6 multiply, 2 add, 1 compare
 674         VectorNormalize(normal3f);
 675         // 12 multiply, 4 add, 6 subtract
 676         f = DotProduct(svector3f, normal3f);
 677         svector3f[0] -= f * normal3f[0];
 678         svector3f[1] -= f * normal3f[1];
 679         svector3f[2] -= f * normal3f[2];
 680         f = DotProduct(tvector3f, normal3f);
 681         tvector3f[0] -= f * normal3f[0];
 682         tvector3f[1] -= f * normal3f[1];
 683         tvector3f[2] -= f * normal3f[2];
 684         // 2 sqrt, 2 divide, 12 multiply, 4 add, 2 compare
 685         VectorNormalize(svector3f);
 686         VectorNormalize(tvector3f);
 687         // if texture is mapped the wrong way (counterclockwise), the tangents
 688         // have to be flipped, this is detected by calculating a normal from the
 689         // two tangents, and seeing if it is opposite the surface normal
 690         // 9 multiply, 2 add, 3 subtract, 1 compare, 50% chance of: 6 negates
 691         CrossProduct(tvector3f, svector3f, tangentcross);
 692         if (DotProduct(tangentcross, normal3f) < 0)
 693         {
 694                 VectorNegate(svector3f, svector3f);
 695                 VectorNegate(tvector3f, tvector3f);
 696         }
 697 }
 698
 699 // warning: this is an expensive function!
 700 void Mod_BuildTextureVectorsAndNormals(int numverts, int numtriangles, const float *vertex3f, const float *texcoord2f, const int *elements, float *svector3f, float *tvector3f, float *normal3f)
 701 {
 702         int i, tnum;
 703         float sdir[3], tdir[3], normal[3], *v;
 704         const int *e;
 705         // clear the vectors
 706         if (svector3f)
 707                 memset(svector3f, 0, numverts * sizeof(float[3]));
 708         if (tvector3f)
 709                 memset(tvector3f, 0, numverts * sizeof(float[3]));
 710         if (normal3f)
 711                 memset(normal3f, 0, numverts * sizeof(float[3]));
 712         // process each vertex of each triangle and accumulate the results
 713         for (tnum = 0, e = elements;tnum < numtriangles;tnum++, e += 3)
 714         {
 715                 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);
 716                 if (svector3f)
 717                 {
 718                         for (i = 0;i < 3;i++)
 719                         {
 720                                 svector3f[e[i]*3  ] += sdir[0];
 721                                 svector3f[e[i]*3+1] += sdir[1];
 722                                 svector3f[e[i]*3+2] += sdir[2];
 723                         }
 724                 }
 725                 if (tvector3f)
 726                 {
 727                         for (i = 0;i < 3;i++)
 728                         {
 729                                 tvector3f[e[i]*3  ] += tdir[0];
 730                                 tvector3f[e[i]*3+1] += tdir[1];
 731                                 tvector3f[e[i]*3+2] += tdir[2];
 732                         }
 733                 }
 734                 if (normal3f)
 735                 {
 736                         for (i = 0;i < 3;i++)
 737                         {
 738                                 normal3f[e[i]*3  ] += normal[0];
 739                                 normal3f[e[i]*3+1] += normal[1];
 740                                 normal3f[e[i]*3+2] += normal[2];
 741                         }
 742                 }
 743         }
 744         // now we could divide the vectors by the number of averaged values on
 745         // each vertex...  but instead normalize them
 746         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
 747         if (svector3f)
 748                 for (i = 0, v = svector3f;i < numverts;i++, v += 3)
 749                         VectorNormalize(v);
 750         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
 751         if (tvector3f)
 752                 for (i = 0, v = tvector3f;i < numverts;i++, v += 3)
 753                         VectorNormalize(v);
 754         // 4 assignments, 1 divide, 1 sqrt, 2 adds, 6 multiplies
 755         if (normal3f)
 756                 for (i = 0, v = normal3f;i < numverts;i++, v += 3)
 757                         VectorNormalize(v);
 758 }
 759
 760 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)
 761 {
 762         shadowmesh_t *newmesh;
 763         qbyte *data;
 764         int size;
 765         size = sizeof(shadowmesh_t);
 766         size += maxverts * sizeof(float[3]);
 767         if (light)
 768                 size += maxverts * sizeof(float[11]);
 769         size += maxtriangles * sizeof(int[3]);
 770         if (neighbors)
 771                 size += maxtriangles * sizeof(int[3]);
 772         if (expandable)
 773                 size += SHADOWMESHVERTEXHASH * sizeof(shadowmeshvertexhash_t *) + maxverts * sizeof(shadowmeshvertexhash_t);
 774         data = Mem_Alloc(mempool, size);
 775         newmesh = (void *)data;data += sizeof(*newmesh);
 776         newmesh->map_diffuse = map_diffuse;
 777         newmesh->map_specular = map_specular;
 778         newmesh->map_normal = map_normal;
 779         newmesh->maxverts = maxverts;
 780         newmesh->maxtriangles = maxtriangles;
 781         newmesh->numverts = 0;
 782         newmesh->numtriangles = 0;
 783
 784         newmesh->vertex3f = (void *)data;data += maxverts * sizeof(float[3]);
 785         if (light)
 786         {
 787                 newmesh->svector3f = (void *)data;data += maxverts * sizeof(float[3]);
 788                 newmesh->tvector3f = (void *)data;data += maxverts * sizeof(float[3]);
 789                 newmesh->normal3f = (void *)data;data += maxverts * sizeof(float[3]);
 790                 newmesh->texcoord2f = (void *)data;data += maxverts * sizeof(float[2]);
 791         }
 792         newmesh->element3i = (void *)data;data += maxtriangles * sizeof(int[3]);
 793         if (neighbors)
 794         {
 795                 newmesh->neighbor3i = (void *)data;data += maxtriangles * sizeof(int[3]);
 796         }
 797         if (expandable)
 798         {
 799                 newmesh->vertexhashtable = (void *)data;data += SHADOWMESHVERTEXHASH * sizeof(shadowmeshvertexhash_t *);
 800                 newmesh->vertexhashentries = (void *)data;data += maxverts * sizeof(shadowmeshvertexhash_t);
 801         }
 802         return newmesh;
 803 }
 804
 805 shadowmesh_t *Mod_ShadowMesh_ReAlloc(mempool_t *mempool, shadowmesh_t *oldmesh, int light, int neighbors)
 806 {
 807         shadowmesh_t *newmesh;
 808         newmesh = Mod_ShadowMesh_Alloc(mempool, oldmesh->numverts, oldmesh->numtriangles, oldmesh->map_diffuse, oldmesh->map_specular, oldmesh->map_normal, light, neighbors, false);
 809         newmesh->numverts = oldmesh->numverts;
 810         newmesh->numtriangles = oldmesh->numtriangles;
 811
 812         memcpy(newmesh->vertex3f, oldmesh->vertex3f, oldmesh->numverts * sizeof(float[3]));
 813         if (newmesh->svector3f && oldmesh->svector3f)
 814         {
 815                 memcpy(newmesh->svector3f, oldmesh->svector3f, oldmesh->numverts * sizeof(float[3]));
 816                 memcpy(newmesh->tvector3f, oldmesh->tvector3f, oldmesh->numverts * sizeof(float[3]));
 817                 memcpy(newmesh->normal3f, oldmesh->normal3f, oldmesh->numverts * sizeof(float[3]));
 818                 memcpy(newmesh->texcoord2f, oldmesh->texcoord2f, oldmesh->numverts * sizeof(float[2]));
 819         }
 820         memcpy(newmesh->element3i, oldmesh->element3i, oldmesh->numtriangles * sizeof(int[3]));
 821         if (newmesh->neighbor3i && oldmesh->neighbor3i)
 822                 memcpy(newmesh->neighbor3i, oldmesh->neighbor3i, oldmesh->numtriangles * sizeof(int[3]));
 823         return newmesh;
 824 }
 825
 826 int Mod_ShadowMesh_AddVertex(shadowmesh_t *mesh, float *vertex14f)
 827 {
 828         int hashindex, vnum;
 829         shadowmeshvertexhash_t *hash;
 830         // this uses prime numbers intentionally
 831         hashindex = (unsigned int) (vertex14f[0] * 3 + vertex14f[1] * 5 + vertex14f[2] * 7) % SHADOWMESHVERTEXHASH;
 832         for (hash = mesh->vertexhashtable[hashindex];hash;hash = hash->next)
 833         {
 834                 vnum = (hash - mesh->vertexhashentries);
 835                 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]))
 836                  && (mesh->svector3f == NULL || (mesh->svector3f[vnum * 3 + 0] == vertex14f[3] && mesh->svector3f[vnum * 3 + 1] == vertex14f[4] && mesh->svector3f[vnum * 3 + 2] == vertex14f[5]))
 837                  && (mesh->tvector3f == NULL || (mesh->tvector3f[vnum * 3 + 0] == vertex14f[6] && mesh->tvector3f[vnum * 3 + 1] == vertex14f[7] && mesh->tvector3f[vnum * 3 + 2] == vertex14f[8]))
 838                  && (mesh->normal3f == NULL || (mesh->normal3f[vnum * 3 + 0] == vertex14f[9] && mesh->normal3f[vnum * 3 + 1] == vertex14f[10] && mesh->normal3f[vnum * 3 + 2] == vertex14f[11]))
 839                  && (mesh->texcoord2f == NULL || (mesh->texcoord2f[vnum * 2 + 0] == vertex14f[12] && mesh->texcoord2f[vnum * 2 + 1] == vertex14f[13])))
 840                         return hash - mesh->vertexhashentries;
 841         }
 842         vnum = mesh->numverts++;
 843         hash = mesh->vertexhashentries + vnum;
 844         hash->next = mesh->vertexhashtable[hashindex];
 845         mesh->vertexhashtable[hashindex] = hash;
 846         if (mesh->vertex3f) {mesh->vertex3f[vnum * 3 + 0] = vertex14f[0];mesh->vertex3f[vnum * 3 + 1] = vertex14f[1];mesh->vertex3f[vnum * 3 + 2] = vertex14f[2];}
 847         if (mesh->svector3f) {mesh->svector3f[vnum * 3 + 0] = vertex14f[3];mesh->svector3f[vnum * 3 + 1] = vertex14f[4];mesh->svector3f[vnum * 3 + 2] = vertex14f[5];}
 848         if (mesh->tvector3f) {mesh->tvector3f[vnum * 3 + 0] = vertex14f[6];mesh->tvector3f[vnum * 3 + 1] = vertex14f[7];mesh->tvector3f[vnum * 3 + 2] = vertex14f[8];}
 849         if (mesh->normal3f) {mesh->normal3f[vnum * 3 + 0] = vertex14f[9];mesh->normal3f[vnum * 3 + 1] = vertex14f[10];mesh->normal3f[vnum * 3 + 2] = vertex14f[11];}
 850         if (mesh->texcoord2f) {mesh->texcoord2f[vnum * 2 + 0] = vertex14f[12];mesh->texcoord2f[vnum * 2 + 1] = vertex14f[13];}
 851         return vnum;
 852 }
 853
 854 void Mod_ShadowMesh_AddTriangle(mempool_t *mempool, shadowmesh_t *mesh, rtexture_t *map_diffuse, rtexture_t *map_specular, rtexture_t *map_normal, float *vertex14f)
 855 {
 856         if (mesh->numtriangles == 0)
 857         {
 858                 // set the properties on this empty mesh to be more favorable...
 859                 // (note: this case only occurs for the first triangle added to a new mesh chain)
 860                 mesh->map_diffuse = map_diffuse;
 861                 mesh->map_specular = map_specular;
 862                 mesh->map_normal = map_normal;
 863         }
 864         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)
 865         {
 866                 if (mesh->next == NULL)
 867                         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);
 868                 mesh = mesh->next;
 869         }
 870         mesh->element3i[mesh->numtriangles * 3 + 0] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 0);
 871         mesh->element3i[mesh->numtriangles * 3 + 1] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 1);
 872         mesh->element3i[mesh->numtriangles * 3 + 2] = Mod_ShadowMesh_AddVertex(mesh, vertex14f + 14 * 2);
 873         mesh->numtriangles++;
 874 }
 875
 876 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)
 877 {
 878         int i, j, e;
 879         float vbuf[3*14], *v;
 880         memset(vbuf, 0, sizeof(vbuf));
 881         for (i = 0;i < numtris;i++)
 882         {
 883                 for (j = 0, v = vbuf;j < 3;j++, v += 14)
 884                 {
 885                         e = *element3i++;
 886                         if (vertex3f)
 887                         {
 888                                 v[0] = vertex3f[e * 3 + 0];
 889                                 v[1] = vertex3f[e * 3 + 1];
 890                                 v[2] = vertex3f[e * 3 + 2];
 891                         }
 892                         if (svector3f)
 893                         {
 894                                 v[3] = svector3f[e * 3 + 0];
 895                                 v[4] = svector3f[e * 3 + 1];
 896                                 v[5] = svector3f[e * 3 + 2];
 897                         }
 898                         if (tvector3f)
 899                         {
 900                                 v[6] = tvector3f[e * 3 + 0];
 901                                 v[7] = tvector3f[e * 3 + 1];
 902                                 v[8] = tvector3f[e * 3 + 2];
 903                         }
 904                         if (normal3f)
 905                         {
 906                                 v[9] = normal3f[e * 3 + 0];
 907                                 v[10] = normal3f[e * 3 + 1];
 908                                 v[11] = normal3f[e * 3 + 2];
 909                         }
 910                         if (texcoord2f)
 911                         {
 912                                 v[12] = texcoord2f[e * 2 + 0];
 913                                 v[13] = texcoord2f[e * 2 + 1];
 914                         }
 915                 }
 916                 Mod_ShadowMesh_AddTriangle(mempool, mesh, map_diffuse, map_specular, map_normal, vbuf);
 917         }
 918 }
 919
 920 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)
 921 {
 922         return Mod_ShadowMesh_Alloc(mempool, maxverts, maxtriangles, map_diffuse, map_specular, map_normal, light, neighbors, expandable);
 923 }
 924
 925 shadowmesh_t *Mod_ShadowMesh_Finish(mempool_t *mempool, shadowmesh_t *firstmesh, int light, int neighbors)
 926 {
 927         shadowmesh_t *mesh, *newmesh, *nextmesh;
 928         // reallocate meshs to conserve space
 929         for (mesh = firstmesh, firstmesh = NULL;mesh;mesh = nextmesh)
 930         {
 931                 nextmesh = mesh->next;
 932                 if (mesh->numverts >= 3 && mesh->numtriangles >= 1)
 933                 {
 934                         newmesh = Mod_ShadowMesh_ReAlloc(mempool, mesh, light, neighbors);
 935                         newmesh->next = firstmesh;
 936                         firstmesh = newmesh;
 937                 }
 938                 Mem_Free(mesh);
 939         }
 940         return firstmesh;
 941 }
 942
 943 void Mod_ShadowMesh_CalcBBox(shadowmesh_t *firstmesh, vec3_t mins, vec3_t maxs, vec3_t center, float *radius)
 944 {
 945         int i;
 946         shadowmesh_t *mesh;
 947         vec3_t nmins, nmaxs, ncenter, temp;
 948         float nradius2, dist2, *v;
 949         // calculate bbox
 950         for (mesh = firstmesh;mesh;mesh = mesh->next)
 951         {
 952                 if (mesh == firstmesh)
 953                 {
 954                         VectorCopy(mesh->vertex3f, nmins);
 955                         VectorCopy(mesh->vertex3f, nmaxs);
 956                 }
 957                 for (i = 0, v = mesh->vertex3f;i < mesh->numverts;i++, v += 3)
 958                 {
 959                         if (nmins[0] > v[0]) nmins[0] = v[0];if (nmaxs[0] < v[0]) nmaxs[0] = v[0];
 960                         if (nmins[1] > v[1]) nmins[1] = v[1];if (nmaxs[1] < v[1]) nmaxs[1] = v[1];
 961                         if (nmins[2] > v[2]) nmins[2] = v[2];if (nmaxs[2] < v[2]) nmaxs[2] = v[2];
 962                 }
 963         }
 964         // calculate center and radius
 965         ncenter[0] = (nmins[0] + nmaxs[0]) * 0.5f;
 966         ncenter[1] = (nmins[1] + nmaxs[1]) * 0.5f;
 967         ncenter[2] = (nmins[2] + nmaxs[2]) * 0.5f;
 968         nradius2 = 0;
 969         for (mesh = firstmesh;mesh;mesh = mesh->next)
 970         {
 971                 for (i = 0, v = mesh->vertex3f;i < mesh->numverts;i++, v += 3)
 972                 {
 973                         VectorSubtract(v, ncenter, temp);
 974                         dist2 = DotProduct(temp, temp);
 975                         if (nradius2 < dist2)
 976                                 nradius2 = dist2;
 977                 }
 978         }
 979         // return data
 980         if (mins)
 981                 VectorCopy(nmins, mins);
 982         if (maxs)
 983                 VectorCopy(nmaxs, maxs);
 984         if (center)
 985                 VectorCopy(ncenter, center);
 986         if (radius)
 987                 *radius = sqrt(nradius2);
 988 }
 989
 990 void Mod_ShadowMesh_Free(shadowmesh_t *mesh)
 991 {
 992         shadowmesh_t *nextmesh;
 993         for (;mesh;mesh = nextmesh)
 994         {
 995                 nextmesh = mesh->next;
 996                 Mem_Free(mesh);
 997         }
 998 }
 999
1000 static rtexture_t *GL_TextureForSkinLayer(const qbyte *in, int width, int height, const char *name, const unsigned int *palette, int textureflags)
1001 {
1002         int i;
1003         for (i = 0;i < width*height;i++)
1004                 if (((qbyte *)&palette[in[i]])[3] > 0)
1005                         return R_LoadTexture2D (loadmodel->texturepool, name, width, height, in, TEXTYPE_PALETTE, textureflags, palette);
1006         return NULL;
1007 }
1008
1009 static int detailtexturecycle = 0;
1010 int Mod_LoadSkinFrame(skinframe_t *skinframe, char *basename, int textureflags, int loadpantsandshirt, int usedetailtexture, int loadglowtexture)
1011 {
1012         imageskin_t s;
1013         memset(skinframe, 0, sizeof(*skinframe));
1014         if (!image_loadskin(&s, basename))
1015                 return false;
1016         if (usedetailtexture)
1017                 skinframe->detail = mod_shared_detailtextures[(detailtexturecycle++) % NUM_DETAILTEXTURES];
1018         skinframe->base = R_LoadTexture2D (loadmodel->texturepool, basename, s.basepixels_width, s.basepixels_height, s.basepixels, TEXTYPE_RGBA, textureflags, NULL);
1019         if (s.nmappixels != NULL)
1020                 skinframe->nmap = R_LoadTexture2D (loadmodel->texturepool, va("%s_nmap", basename), s.nmappixels_width, s.nmappixels_height, s.nmappixels, TEXTYPE_RGBA, textureflags, NULL);
1021         if (s.glosspixels != NULL)
1022                 skinframe->gloss = R_LoadTexture2D (loadmodel->texturepool, va("%s_gloss", basename), s.glosspixels_width, s.glosspixels_height, s.glosspixels, TEXTYPE_RGBA, textureflags, NULL);
1023         if (s.glowpixels != NULL && loadglowtexture)
1024                 skinframe->glow = R_LoadTexture2D (loadmodel->texturepool, va("%s_glow", basename), s.glowpixels_width, s.glowpixels_height, s.glowpixels, TEXTYPE_RGBA, textureflags, NULL);
1025         if (s.maskpixels != NULL)
1026                 skinframe->fog = R_LoadTexture2D (loadmodel->texturepool, va("%s_mask", basename), s.maskpixels_width, s.maskpixels_height, s.maskpixels, TEXTYPE_RGBA, textureflags, NULL);
1027         if (loadpantsandshirt)
1028         {
1029                 if (s.pantspixels != NULL)
1030                         skinframe->pants = R_LoadTexture2D (loadmodel->texturepool, va("%s_pants", basename), s.pantspixels_width, s.pantspixels_height, s.pantspixels, TEXTYPE_RGBA, textureflags, NULL);
1031                 if (s.shirtpixels != NULL)
1032                         skinframe->shirt = R_LoadTexture2D (loadmodel->texturepool, va("%s_shirt", basename), s.shirtpixels_width, s.shirtpixels_height, s.shirtpixels, TEXTYPE_RGBA, textureflags, NULL);
1033         }
1034         image_freeskin(&s);
1035         return true;
1036 }
1037
1038 int Mod_LoadSkinFrame_Internal(skinframe_t *skinframe, char *basename, int textureflags, int loadpantsandshirt, int usedetailtexture, int loadglowtexture, qbyte *skindata, int width, int height)
1039 {
1040         qbyte *temp1, *temp2;
1041         memset(skinframe, 0, sizeof(*skinframe));
1042         if (!skindata)
1043                 return false;
1044         if (usedetailtexture)
1045                 skinframe->detail = mod_shared_detailtextures[(detailtexturecycle++) % NUM_DETAILTEXTURES];
1046         if (r_shadow_bumpscale_basetexture.value > 0)
1047         {
1048                 temp1 = Mem_Alloc(loadmodel->mempool, width * height * 8);
1049                 temp2 = temp1 + width * height * 4;
1050                 Image_Copy8bitRGBA(skindata, temp1, width * height, palette_nofullbrights);
1051                 Image_HeightmapToNormalmap(temp1, temp2, width, height, false, r_shadow_bumpscale_basetexture.value);
1052                 skinframe->nmap = R_LoadTexture2D(loadmodel->texturepool, va("%s_nmap", basename), width, height, temp2, TEXTYPE_RGBA, textureflags, NULL);
1053                 Mem_Free(temp1);
1054         }
1055         if (loadglowtexture)
1056         {
1057                 skinframe->glow = GL_TextureForSkinLayer(skindata, width, height, va("%s_glow", basename), palette_onlyfullbrights, textureflags); // glow
1058                 skinframe->base = skinframe->merged = GL_TextureForSkinLayer(skindata, width, height, va("%s_merged", basename), palette_nofullbrights, textureflags); // all but fullbrights
1059                 if (loadpantsandshirt)
1060                 {
1061                         skinframe->pants = GL_TextureForSkinLayer(skindata, width, height, va("%s_pants", basename), palette_pantsaswhite, textureflags); // pants
1062                         skinframe->shirt = GL_TextureForSkinLayer(skindata, width, height, va("%s_shirt", basename), palette_shirtaswhite, textureflags); // shirt
1063                         if (skinframe->pants || skinframe->shirt)
1064                                 skinframe->base = GL_TextureForSkinLayer(skindata, width, height, va("%s_nospecial", basename), palette_nocolormapnofullbrights, textureflags); // no special colors
1065                 }
1066         }
1067         else
1068         {
1069                 skinframe->base = skinframe->merged = GL_TextureForSkinLayer(skindata, width, height, va("%s_merged", basename), palette_complete, textureflags); // all
1070                 if (loadpantsandshirt)
1071                 {
1072                         skinframe->pants = GL_TextureForSkinLayer(skindata, width, height, va("%s_pants", basename), palette_pantsaswhite, textureflags); // pants
1073                         skinframe->shirt = GL_TextureForSkinLayer(skindata, width, height, va("%s_shirt", basename), palette_shirtaswhite, textureflags); // shirt
1074                         if (skinframe->pants || skinframe->shirt)
1075                                 skinframe->base = GL_TextureForSkinLayer(skindata, width, height, va("%s_nospecial", basename), palette_nocolormap, textureflags); // no pants or shirt
1076                 }
1077         }
1078         return true;
1079 }
1080
1081 void Mod_GetTerrainVertex3fTexCoord2fFromRGBA(const qbyte *imagepixels, int imagewidth, int imageheight, int ix, int iy, float *vertex3f, float *texcoord2f, matrix4x4_t *pixelstepmatrix, matrix4x4_t *pixeltexturestepmatrix)
1082 {
1083         float v[3], tc[3];
1084         v[0] = ix;
1085         v[1] = iy;
1086         if (ix >= 0 && iy >= 0 && ix < imagewidth && iy < imageheight)
1087                 v[2] = (imagepixels[((iy*imagewidth)+ix)*4+0] + imagepixels[((iy*imagewidth)+ix)*4+1] + imagepixels[((iy*imagewidth)+ix)*4+2]) * (1.0f / 765.0f);
1088         else
1089                 v[2] = 0;
1090         Matrix4x4_Transform(pixelstepmatrix, v, vertex3f);
1091         Matrix4x4_Transform(pixeltexturestepmatrix, v, tc);
1092         texcoord2f[0] = tc[0];
1093         texcoord2f[1] = tc[1];
1094 }
1095
1096 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)
1097 {
1098         float vup[3], vdown[3], vleft[3], vright[3];
1099         float tcup[3], tcdown[3], tcleft[3], tcright[3];
1100         float sv[3], tv[3], nl[3];
1101         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy, vertex3f, texcoord2f, pixelstepmatrix, pixeltexturestepmatrix);
1102         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy - 1, vup, tcup, pixelstepmatrix, pixeltexturestepmatrix);
1103         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix, iy + 1, vdown, tcdown, pixelstepmatrix, pixeltexturestepmatrix);
1104         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix - 1, iy, vleft, tcleft, pixelstepmatrix, pixeltexturestepmatrix);
1105         Mod_GetTerrainVertex3fTexCoord2fFromRGBA(imagepixels, imagewidth, imageheight, ix + 1, iy, vright, tcright, pixelstepmatrix, pixeltexturestepmatrix);
1106         Mod_BuildBumpVectors(vertex3f, vup, vright, texcoord2f, tcup, tcright, svector3f, tvector3f, normal3f);
1107         Mod_BuildBumpVectors(vertex3f, vright, vdown, texcoord2f, tcright, tcdown, sv, tv, nl);
1108         VectorAdd(svector3f, sv, svector3f);
1109         VectorAdd(tvector3f, tv, tvector3f);
1110         VectorAdd(normal3f, nl, normal3f);
1111         Mod_BuildBumpVectors(vertex3f, vdown, vleft, texcoord2f, tcdown, tcleft, sv, tv, nl);
1112         VectorAdd(svector3f, sv, svector3f);
1113         VectorAdd(tvector3f, tv, tvector3f);
1114         VectorAdd(normal3f, nl, normal3f);
1115         Mod_BuildBumpVectors(vertex3f, vleft, vup, texcoord2f, tcleft, tcup, sv, tv, nl);
1116         VectorAdd(svector3f, sv, svector3f);
1117         VectorAdd(tvector3f, tv, tvector3f);
1118         VectorAdd(normal3f, nl, normal3f);
1119 }
1120
1121 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)
1122 {
1123         int x, y, ix, iy, *e;
1124         e = element3i;
1125         for (y = 0;y < height;y++)
1126         {
1127                 for (x = 0;x < width;x++)
1128                 {
1129                         e[0] = (y + 1) * (width + 1) + (x + 0);
1130                         e[1] = (y + 0) * (width + 1) + (x + 0);
1131                         e[2] = (y + 1) * (width + 1) + (x + 1);
1132                         e[3] = (y + 0) * (width + 1) + (x + 0);
1133                         e[4] = (y + 0) * (width + 1) + (x + 1);
1134                         e[5] = (y + 1) * (width + 1) + (x + 1);
1135                         e += 6;
1136                 }
1137         }
1138         Mod_BuildTriangleNeighbors(neighbor3i, element3i, width*height*2);
1139         for (y = 0, iy = y1;y < height + 1;y++, iy++)
1140                 for (x = 0, ix = x1;x < width + 1;x++, ix++, vertex3f += 3, texcoord2f += 2, svector3f += 3, tvector3f += 3, normal3f += 3)
1141                         Mod_GetTerrainVertexFromRGBA(imagepixels, imagewidth, imageheight, ix, iy, vertex3f, texcoord2f, svector3f, tvector3f, normal3f, pixelstepmatrix, pixeltexturestepmatrix);
1142 }
1143
1144 skinfile_t *Mod_LoadSkinFiles(void)
1145 {
1146         int i, words, numtags, line, tagsetsused = false, wordsoverflow;
1147         char *text;
1148         const char *data;
1149         skinfile_t *skinfile = NULL, *first = NULL;
1150         skinfileitem_t *skinfileitem;
1151         char word[10][MAX_QPATH];
1152         overridetagnameset_t tagsets[MAX_SKINS];
1153         overridetagname_t tags[256];
1154
1155 /*
1156 sample file:
1157 U_bodyBox,models/players/Legoman/BikerA2.tga
1158 U_RArm,models/players/Legoman/BikerA1.tga
1159 U_LArm,models/players/Legoman/BikerA1.tga
1160 U_armor,common/nodraw
1161 U_sword,common/nodraw
1162 U_shield,common/nodraw
1163 U_homb,common/nodraw
1164 U_backpack,common/nodraw
1165 U_colcha,common/nodraw
1166 tag_head,
1167 tag_weapon,
1168 tag_torso,
1169 */
1170         memset(tagsets, 0, sizeof(tagsets));
1171         memset(word, 0, sizeof(word));
1172         for (i = 0;i < MAX_SKINS && (data = text = FS_LoadFile(va("%s_%i.skin", loadmodel->name, i), tempmempool, true));i++)
1173         {
1174                 numtags = 0;
1175
1176                 // If it's the first file we parse
1177                 if (skinfile == NULL)
1178                 {
1179                         skinfile = Mem_Alloc(tempmempool, sizeof(skinfile_t));
1180                         first = skinfile;
1181                 }
1182                 else
1183                 {
1184                         skinfile->next = Mem_Alloc(tempmempool, sizeof(skinfile_t));
1185                         skinfile = skinfile->next;
1186                 }
1187                 skinfile->next = NULL;
1188
1189                 for(line = 0;;line++)
1190                 {
1191                         // parse line
1192                         if (!COM_ParseToken(&data, true))
1193                                 break;
1194                         if (!strcmp(com_token, "\n"))
1195                                 continue;
1196                         words = 0;
1197                         wordsoverflow = false;
1198                         do
1199                         {
1200                                 if (words < 10)
1201                                         strlcpy(word[words++], com_token, sizeof (word[0]));
1202                                 else
1203                                         wordsoverflow = true;
1204                         }
1205                         while (COM_ParseToken(&data, true) && strcmp(com_token, "\n"));
1206                         if (wordsoverflow)
1207                         {
1208                                 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);
1209                                 continue;
1210                         }
1211                         // words is always >= 1
1212                         if (!strcmp(word[0], "replace"))
1213                         {
1214                                 if (words == 3)
1215                                 {
1216                                         Con_DPrintf("Mod_LoadSkinFiles: parsed mesh \"%s\" shader replacement \"%s\"\n", word[1], word[2]);
1217                                         skinfileitem = Mem_Alloc(tempmempool, sizeof(skinfileitem_t));
1218                                         skinfileitem->next = skinfile->items;
1219                                         skinfile->items = skinfileitem;
1220                                         strlcpy (skinfileitem->name, word[1], sizeof (skinfileitem->name));
1221                                         strlcpy (skinfileitem->replacement, word[2], sizeof (skinfileitem->replacement));
1222                                 }
1223                                 else
1224                                         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]);
1225                         }
1226                         else if (words == 2 && !strcmp(word[1], ","))
1227                         {
1228                                 // tag name, like "tag_weapon,"
1229                                 Con_DPrintf("Mod_LoadSkinFiles: parsed tag #%i \"%s\"\n", numtags, word[0]);
1230                                 memset(tags + numtags, 0, sizeof(tags[numtags]));
1231                                 strlcpy (tags[numtags].name, word[0], sizeof (tags[numtags].name));
1232                                 numtags++;
1233                         }
1234                         else if (words == 3 && !strcmp(word[1], ","))
1235                         {
1236                                 // mesh shader name, like "U_RArm,models/players/Legoman/BikerA1.tga"
1237                                 Con_DPrintf("Mod_LoadSkinFiles: parsed mesh \"%s\" shader replacement \"%s\"\n", word[0], word[2]);
1238                                 skinfileitem = Mem_Alloc(tempmempool, sizeof(skinfileitem_t));
1239                                 skinfileitem->next = skinfile->items;
1240                                 skinfile->items = skinfileitem;
1241                                 strlcpy (skinfileitem->name, word[0], sizeof (skinfileitem->name));
1242                                 strlcpy (skinfileitem->replacement, word[2], sizeof (skinfileitem->replacement));
1243                         }
1244                         else
1245                                 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);
1246                 }
1247                 Mem_Free(text);
1248
1249                 if (numtags)
1250                 {
1251                         overridetagnameset_t *t;
1252                         t = tagsets + i;
1253                         t->num_overridetagnames = numtags;
1254                         t->data_overridetagnames = Mem_Alloc(loadmodel->mempool, t->num_overridetagnames * sizeof(overridetagname_t));
1255                         memcpy(t->data_overridetagnames, tags, t->num_overridetagnames * sizeof(overridetagname_t));
1256                         tagsetsused = true;
1257                 }
1258         }
1259         if (tagsetsused)
1260         {
1261                 loadmodel->data_overridetagnamesforskin = Mem_Alloc(loadmodel->mempool, i * sizeof(overridetagnameset_t));
1262                 memcpy(loadmodel->data_overridetagnamesforskin, tagsets, i * sizeof(overridetagnameset_t));
1263         }
1264         if (i)
1265                 loadmodel->numskins = i;
1266         return first;
1267 }
1268
1269 void Mod_FreeSkinFiles(skinfile_t *skinfile)
1270 {
1271         skinfile_t *next;
1272         skinfileitem_t *skinfileitem, *nextitem;
1273         for (;skinfile;skinfile = next)
1274         {
1275                 next = skinfile->next;
1276                 for (skinfileitem = skinfile->items;skinfileitem;skinfileitem = nextitem)
1277                 {
1278                         nextitem = skinfileitem->next;
1279                         Mem_Free(skinfileitem);
1280                 }
1281                 Mem_Free(skinfile);
1282         }
1283 }
1284
1285 int Mod_CountSkinFiles(skinfile_t *skinfile)
1286 {
1287         int i;
1288         for (i = 0;skinfile;skinfile = skinfile->next, i++);
1289         return i;
1290 }
1291
1292 int Mod_RemoveDegenerateTriangles(int numtriangles, const int *inelement3i, int *outelement3i, const float *vertex3f)
1293 {
1294         int i, outtriangles;
1295         float d, edgedir[3], temp[3];
1296         // a degenerate triangle is one with no width (thickness, surface area)
1297         // these are characterized by having all 3 points colinear (along a line)
1298         // or having two points identical
1299         for (i = 0, outtriangles = 0;i < numtriangles;i++, inelement3i += 3)
1300         {
1301                 // calculate first edge
1302                 VectorSubtract(vertex3f + inelement3i[1] * 3, vertex3f + inelement3i[0] * 3, edgedir);
1303                 if (VectorLength2(edgedir) < 0.0001f)
1304                         continue; // degenerate first edge (no length)
1305                 VectorNormalize(edgedir);
1306                 // check if third point is on the edge (colinear)
1307                 d = -DotProduct(vertex3f + inelement3i[2] * 3, edgedir);
1308                 VectorMA(vertex3f + inelement3i[2] * 3, d, edgedir, temp);
1309                 if (VectorLength2(temp) < 0.0001f)
1310                         continue; // third point colinear with first edge
1311                 // valid triangle (no colinear points, no duplicate points)
1312                 VectorCopy(inelement3i, outelement3i);
1313                 outelement3i += 3;
1314                 outtriangles++;
1315         }
1316         return outtriangles;
1317 }
1318