{"header":{"message":"Added q2tools-220 from git","description":null,"timestamp":"2023-09-21T22:41:53.779574554Z","authors":[{}]},"hash":"BEU5APLPKXWD7RKKWDR6ACTC7KIVWPV4F62OLQPLCLKPRIWBUZ2QC","authors":[{"key":"GPeTJGuaAryfKVDHpJLoiRAiv9jDq5aAapfNcWjYu16v"}],"deps":{"hashes":[["BEU5APLPKXWD7RKKWDR6ACTC7KIVWPV4F62OLQPLCLKPRIWBUZ2QC","Added q2tools-220 from git"],["AA",null],["XUGFJVFEZPC3CCIFBIGADUC7TOYF5LN2OZ4UWKC4KMFVA7VSDUHQC","update miniaudio and fix issue with sound starting up"],["7KS22PCEQW4NFNBIGVRIPLZ4VZL4W7WPNPGA7B23CYUIXZB37IBQC","adding source from our Quake-2 github with linux stub"],["Q7P6NO6DTAU3Z7JQ6HNQIQPGWPQHW37RRI5A5HDJYNC7IJCQ4XSQC","initial with alias and tabula"]],"deps":["XUGFJVFEZPC3CCIFBIGADUC7TOYF5LN2OZ4UWKC4KMFVA7VSDUHQC"],"known":["7KS22PCEQW4NFNBIGVRIPLZ4VZL4W7WPNPGA7B23CYUIXZB37IBQC"]},"hunks":[{"FileDel":{"deleted_names":[{"basename":"tools","metadata":576}],"del":{"EdgeMap":{"edges":[{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":1},"to":{"change":3,"start":376261,"end":376277},"introduced_by":3},{"previous":"BLOCK | FOLDER","flag":"BLOCK | FOLDER | DELETED","from":{"change":3,"pos":376277},"to":{"change":3,"start":376260,"end":376260},"introduced_by":3}],"inode":{"change":3,"pos":376260}}},"content_edges":null,"content":[]}},{"FileAdd":{"meta":{"basename":"tools","metadata":576},"context":[{"change":3,"pos":1}],"contents":[]}},{"FileAdd":{"meta":{"basename":"main.c","metadata":0},"context":[{"change":0,"pos":17}],"contents":[{"Add":"#include \"common/cmdlib.h\""},{"Add":"#include \"common/mathlib.h\""},{"Add":"#include \"common/qfiles.h\""},{"Add":"#include \"common/threads.h\""},{"Add":""},{"Add":"static char * help_string ="},{"Add":" \"4bld supporting v38 and v220 map formats plus QBSP extended limits.\\n\""},{"Add":" \"Usage: 4bld [options] [mapfile | bspfile]\\n\\n\""},{"Add":" \" -moddir [path]: Set a mod directory. Default is parent dir of map file.\\n\""},{"Add":" \" -basedir [path]: Set the directory for assets not in moddir. Default is moddir.\\n\""},{"Add":" \" -gamedir [path]: Set game directory, the folder with game executable.\\n\""},{"Add":" \" -threads #: number of CPU threads to use\\n\""},{"Add":" \"BSP pass:\\n\""},{"Add":" \" -bsp: enable bsp pass, requires a .map file as input\\n\""},{"Add":" \" -chop #: Subdivide size.\\n\""},{"Add":" \" Default: 240 Range: 32-1024\\n\""},{"Add":" \" -choplight #: Subdivide size for surface lights.\\n\""},{"Add":" \" Default: 240 Range: 32-1024\\n\""},{"Add":" \" -largebounds or -lb: Increase max map size for supporting engines.\\n\""},{"Add":" \" -micro #: Minimum microbrush size. Default: 0.02\\n\""},{"Add":" \" Suggested range: 0.02 - 1.0\\n\""},{"Add":" \" -nosubdiv: Disable subdivision.\\n\""},{"Add":" \" -qbsp: Greatly expanded map and entity limits for supporting engines.\\n\""},{"Add":" \"VIS pass:\\n\""},{"Add":" \" -vis: enable vis pass, requires a .bsp file as input or bsp pass enabled\\n\""},{"Add":" \" -fast: fast single vis pass\""},{"Add":" \"RAD pass:\\n\""},{"Add":" \" -rad: enable rad pass, requires a .bsp file as input or bsp and vis passes enabled\\n\""},{"Add":" \" -ambient #\\n\""},{"Add":" \" -bounce #\\n\""},{"Add":" \" -dice\\n\""},{"Add":" \" -direct #\\n\""},{"Add":" \" -entity #\\n\""},{"Add":" \" -extra\\n\""},{"Add":" \" -maxdata #\\n\""},{"Add":" \" -maxlight #\\n\""},{"Add":" \" -noedgefix\\n\""},{"Add":" \" -nudge #\\n\""},{"Add":" \" -saturate #\\n\""},{"Add":" \" -scale #\\n\""},{"Add":" \" -smooth #\\n\""},{"Add":" \" -subdiv\\n\""},{"Add":" \" -sunradscale #\\n\""},{"Add":" \"Debugging tools:\\n\""},{"Add":" \" -block # #: Division tree block size, square\\n\""},{"Add":" \" -blocks # # # #: Div tree block size, rectangular\\n\""},{"Add":" \" -blocksize: map cube size for processing. Default: 1024\\n\""},{"Add":" \" -fulldetail: Change most brushes to detail.\\n\""},{"Add":" \" -leaktest: Perform leak test only.\\n\""},{"Add":" \" -nocsg: No constructive solid geometry.\\n\""},{"Add":" \" -nodetail: No detail brushes.\\n\""},{"Add":" \" -nomerge: Don't merge visible faces per node.\\n\""},{"Add":" \" -noorigfix: Disable texture fix for origin offsets.\\n\""},{"Add":" \" -noprune: Disable node pruning.\\n\""},{"Add":" \" -noshare: Don't look for shared edges on save.\\n\""},{"Add":" \" -noskipfix: Do not automatically set skip contents to zero.\\n\""},{"Add":" \" -notjunc: Disable edge cleanup.\\n\""},{"Add":" \" -nowater: Ignore warp surfaces.\\n\""},{"Add":" \" -noweld: Disable vertex welding.\\n\""},{"Add":" \" -onlyents: Grab the entites and resave.\\n\""},{"Add":" \" -v: Display more verbose output.\\n\""},{"Add":" \" -dump\\n\""},{"Add":" \" -noblock\\n\""},{"Add":" \" -nopvs\\n\""},{"Add":" \" -savetrace\\n\""},{"Add":" \" -tmpin\\n\""},{"Add":" \" -tmpout\\n\""},{"Add":" ;"},{"Add":""},{"Add":"extern qboolean origfix;"},{"Add":"extern qboolean noweld;"},{"Add":"extern qboolean nocsg;"},{"Add":"extern qboolean noshare;"},{"Add":"extern qboolean notjunc;"},{"Add":"extern qboolean nowater;"},{"Add":"extern qboolean noprune;"},{"Add":"extern qboolean nomerge;"},{"Add":"extern qboolean nosubdiv;"},{"Add":"extern qboolean nodetail;"},{"Add":"extern qboolean fulldetail;"},{"Add":"extern qboolean onlyents;"},{"Add":"extern float microvolume;"},{"Add":"extern qboolean leaktest;"},{"Add":"extern qboolean use_qbsp;"},{"Add":"extern int32_t max_entities;"},{"Add":"extern int32_t max_bounds;"},{"Add":"extern int32_t block_size;"},{"Add":"extern qboolean noskipfix;"},{"Add":"extern float subdivide_size;"},{"Add":"extern float sublight_size;"},{"Add":"extern int32_t block_xl;"},{"Add":"extern int32_t block_yl;"},{"Add":"extern int32_t block_xh;"},{"Add":"extern int32_t block_yh;"},{"Add":"extern char inbase[32];"},{"Add":"extern char outbase[32];"},{"Add":""},{"Add":"extern qboolean fastvis;"},{"Add":""},{"Add":"extern qboolean nosort;"},{"Add":"extern qboolean dumppatches;"},{"Add":"extern int32_t numbounce;"},{"Add":"extern qboolean extrasamples;"},{"Add":"extern qboolean noedgefix;"},{"Add":"extern int32_t maxdata;"},{"Add":"extern float lightscale;"},{"Add":"extern float sunradscale;"},{"Add":"extern float patch_cutoff;"},{"Add":"extern float direct_scale;"},{"Add":"extern float entity_scale;"},{"Add":"extern qboolean noblock;"},{"Add":"extern float smoothing_value;"},{"Add":"extern float sample_nudge;"},{"Add":"extern float ambient;"},{"Add":"extern qboolean save_trace;"},{"Add":"extern float maxlight;"},{"Add":"extern qboolean dicepatches;"},{"Add":"extern float saturation;"},{"Add":"extern qboolean nopvs;"},{"Add":""},{"Add":"void BSP_ProcessArgument(const char * arg);"},{"Add":"void VIS_ProcessArgument(const char * arg);"},{"Add":"void RAD_ProcessArgument(const char * arg);"},{"Add":""},{"Add":"int main(int argc, char *argv []) {"},{"Add":" char tgamedir[1024] = \"\";"},{"Add":" char tbasedir[1024] = \"\";"},{"Add":" char tmoddir[1024] = \"\";"},{"Add":""},{"Add":" qboolean do_bsp = false;"},{"Add":" qboolean do_vis = false;"},{"Add":" qboolean do_rad = false;"},{"Add":""},{"Add":" ThreadSetDefault();"},{"Add":""},{"Add":" int32_t i;"},{"Add":" for (i = 1; i < argc; i++) {"},{"Add":" if (!strcmp(argv[i], \"-bsp\")) {"},{"Add":" do_bsp = true;"},{"Add":" } else if (!strcmp(argv[i], \"-vis\")) {"},{"Add":" do_vis = true;"},{"Add":" } else if (!strcmp(argv[i], \"-rad\")) {"},{"Add":" do_rad = true;"},{"Add":" } else if (!strcmp(argv[i], \"-noorigfix\")) {"},{"Add":" printf(\"origfix = false\\n\");"},{"Add":" origfix = false;"},{"Add":" } else if (!strcmp(argv[i], \"-v\")) {"},{"Add":" printf(\"verbose = true\\n\");"},{"Add":" verbose = true;"},{"Add":" } else if (!strcmp(argv[i], \"-help\")) {"},{"Add":" printf(\"%s\\n\", help_string);"},{"Add":" exit(1);"},{"Add":" } else if (!strcmp(argv[i],\"-threads\")) {"},{"Add":" numthreads = atoi(argv[i+1]);"},{"Add":" printf(\"threads = %i\\n\", numthreads);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-noweld\")) {"},{"Add":" printf(\"noweld = true\\n\");"},{"Add":" noweld = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nocsg\")) {"},{"Add":" printf(\"nocsg = true\\n\");"},{"Add":" nocsg = true;"},{"Add":" } else if (!strcmp(argv[i], \"-noshare\")) {"},{"Add":" printf(\"noshare = true\\n\");"},{"Add":" noshare = true;"},{"Add":" } else if (!strcmp(argv[i], \"-notjunc\")) {"},{"Add":" printf(\"notjunc = true\\n\");"},{"Add":" notjunc = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nowater\")) {"},{"Add":" printf(\"nowater = true\\n\");"},{"Add":" nowater = true;"},{"Add":" } else if (!strcmp(argv[i], \"-noprune\")) {"},{"Add":" printf(\"noprune = true\\n\");"},{"Add":" noprune = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nomerge\")) {"},{"Add":" printf(\"nomerge = true\\n\");"},{"Add":" nomerge = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nosubdiv\")) {"},{"Add":" printf(\"nosubdiv = true\\n\");"},{"Add":" nosubdiv = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nodetail\")) {"},{"Add":" printf(\"nodetail = true\\n\");"},{"Add":" nodetail = true;"},{"Add":" } else if (!strcmp(argv[i], \"-fulldetail\")) {"},{"Add":" printf(\"fulldetail = true\\n\");"},{"Add":" fulldetail = true;"},{"Add":" } else if (!strcmp(argv[i], \"-onlyents\")) {"},{"Add":" printf(\"onlyents = true\\n\");"},{"Add":" onlyents = true;"},{"Add":" } else if (!strcmp(argv[i], \"-micro\")) {"},{"Add":" microvolume = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-leaktest\")) {"},{"Add":" printf(\"leaktest = true\\n\");"},{"Add":" leaktest = true;"},{"Add":" } else if (!strcmp(argv[i], \"-qbsp\")) {"},{"Add":" // qb: qbsp"},{"Add":" printf(\"use_qbsp = true\\n\");"},{"Add":" use_qbsp = true;"},{"Add":" max_entities = MAX_MAP_ENTITIES_QBSP;"},{"Add":" max_bounds = MAX_MAP_SIZE;"},{"Add":" block_size = MAX_BLOCK_SIZE; // qb: otherwise limits map range"},{"Add":" } else if (!strcmp(argv[i], \"-noskipfix\")) {"},{"Add":" printf(\"noskipfix = true\\n\");"},{"Add":" noskipfix = true;"},{"Add":" } else if (!strcmp(argv[i], \"-largebounds\") || !strcmp(argv[i], \"-lb\")) {"},{"Add":" // qb: from kmqbsp3- Knightmare added"},{"Add":" if (use_qbsp) {"},{"Add":" printf(\"[-largebounds is not required with -qbsp]\\n\");"},{"Add":" } else {"},{"Add":" max_bounds = MAX_MAP_SIZE;"},{"Add":" block_size = MAX_BLOCK_SIZE; // qb: otherwise limits map range"},{"Add":" printf(\"largebounds: using max bound size of %i\\n\", MAX_MAP_SIZE);"},{"Add":" }"},{"Add":" }"},{"Add":" // qb: set gamedir, moddir, and basedir"},{"Add":" else if (!strcmp(argv[i], \"-gamedir\")) {"},{"Add":" strcpy(tgamedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-moddir\")) {"},{"Add":" strcpy(tmoddir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-basedir\")) {"},{"Add":" strcpy(tbasedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if((!strcmp(argv[i], \"-chop\")) || (!strcmp(argv[i], \"-subdiv\"))) {"},{"Add":" subdivide_size = atof(argv[i + 1]);"},{"Add":" if (subdivide_size < 32) {"},{"Add":" subdivide_size = 32;"},{"Add":" printf(\"subdivide_size set to minimum size: 32\\n\");"},{"Add":" }"},{"Add":" if (subdivide_size > 1024) {"},{"Add":" subdivide_size = 1024;"},{"Add":" printf(\"subdivide_size set to maximum size: 1024\\n\");"},{"Add":" }"},{"Add":" printf(\"subdivide_size = %f\\n\", subdivide_size);"},{"Add":" i++;"},{"Add":" } else if((!strcmp(argv[i], \"-choplight\")) || (!strcmp(argv[i], \"-choplights\")) || (!strcmp(argv[i], \"-subdivlight\"))) {"},{"Add":" // qb: chop surf lights independently"},{"Add":" sublight_size = atof(argv[i + 1]);"},{"Add":" if (sublight_size < 32) {"},{"Add":" sublight_size = 32;"},{"Add":" printf(\"sublight_size set to minimum size: 32\\n\");"},{"Add":" }"},{"Add":" if (sublight_size > 1024) {"},{"Add":" sublight_size = 1024;"},{"Add":" printf(\"sublight_size set to maximum size: 1024\\n\");"},{"Add":" }"},{"Add":" printf(\"sublight_size = %f\\n\", sublight_size);"},{"Add":" i++;"},{"Add":" } else if(!strcmp(argv[i], \"-blocksize\")) {"},{"Add":" block_size = atof(argv[i + 1]);"},{"Add":" if (block_size < 128) {"},{"Add":" block_size = 128;"},{"Add":" printf(\"block_size set to minimum size: 128\\n\");"},{"Add":" }"},{"Add":" if (block_size > MAX_BLOCK_SIZE) {"},{"Add":" block_size = MAX_BLOCK_SIZE;"},{"Add":" printf(\"block_size set to minimum size: MAX_BLOCK_SIZE\\n\");"},{"Add":" }"},{"Add":" printf(\"blocksize: %i\\n\", block_size);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-block\")) {"},{"Add":" block_xl = block_yl = atoi(argv[i + 1]); // qb: fixed... has it always been wrong? was xl = xh and yl = yh"},{"Add":" block_xh = block_yh = atoi(argv[i + 2]);"},{"Add":" printf(\"block: %i,%i\\n\", block_xl, block_xh);"},{"Add":" i += 2;"},{"Add":" } else if (!strcmp(argv[i], \"-blocks\")) {"},{"Add":" block_xl = atoi(argv[i + 1]);"},{"Add":" block_yl = atoi(argv[i + 2]);"},{"Add":" block_xh = atoi(argv[i + 3]);"},{"Add":" block_yh = atoi(argv[i + 4]);"},{"Add":" printf(\"blocks: %i,%i to %i,%i\\n\","},{"Add":" block_xl, block_yl, block_xh, block_yh);"},{"Add":" i += 4;"},{"Add":" } else if (!strcmp(argv[i], \"-tmpin\"))"},{"Add":" strcpy(inbase, \"/tmp\");"},{"Add":" else if (!strcmp(argv[i], \"-tmpout\"))"},{"Add":" strcpy(outbase, \"/tmp\");"},{"Add":" else if (!strcmp(argv[i], \"-fast\")) {"},{"Add":" printf(\"fastvis = true\\n\");"},{"Add":" fastvis = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nosort\")) {"},{"Add":" printf(\"nosort = true\\n\");"},{"Add":" nosort = true;"},{"Add":" } else if (!strcmp(argv[i], \"-dump\")) {"},{"Add":" printf(\"dicepatches = true\\n\");"},{"Add":" dumppatches = true;"},{"Add":" } else if (!strcmp(argv[i], \"-bounce\")) {"},{"Add":" numbounce = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-extra\")) {"},{"Add":" extrasamples = true;"},{"Add":" printf(\"extrasamples = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-noedgefix\")) {"},{"Add":" // qb: light warp surfaces"},{"Add":" noedgefix = true;"},{"Add":" printf(\"no edge fix = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-dice\")) {"},{"Add":" dicepatches = true;"},{"Add":" printf(\"dicepatches = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-threads\")) {"},{"Add":" numthreads = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-maxdata\")) { // qb: allows increase for some engines"},{"Add":" maxdata = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" if (maxdata > DEFAULT_MAP_LIGHTING) {"},{"Add":" printf(\"lighting maxdata (%i) exceeds typical limit (%i).\\n\", maxdata, DEFAULT_MAP_LIGHTING);"},{"Add":" }"},{"Add":" } else if (!strcmp(argv[i], \"-scale\")) {"},{"Add":" lightscale = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-sunradscale\")) {"},{"Add":" sunradscale = atof(argv[i + 1]);"},{"Add":" if (sunradscale < 0) {"},{"Add":" sunradscale = 0;"},{"Add":" printf(\"sunradscale set to minimum: 0\\n\");"},{"Add":" }"},{"Add":" printf(\"sunradscale = %f\\n\", sunradscale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-saturation\")) {"},{"Add":" saturation = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-radmin\")) {"},{"Add":" patch_cutoff = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-direct\")) {"},{"Add":" direct_scale *= atof(argv[i + 1]);"},{"Add":" // printf (\"direct light scaling at %f\\n\", direct_scale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-entity\")) {"},{"Add":" entity_scale *= atof(argv[i + 1]);"},{"Add":" // printf (\"entity light scaling at %f\\n\", entity_scale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-nopvs\")) {"},{"Add":" nopvs = true;"},{"Add":" printf(\"nopvs = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-noblock\")) {"},{"Add":" noblock = true;"},{"Add":" printf(\"noblock = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-smooth\")) {"},{"Add":" // qb: limit range"},{"Add":" smoothing_value = BOUND(0, atof(argv[i + 1]), 90);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-nudge\")) {"},{"Add":" sample_nudge = atof(argv[i + 1]);"},{"Add":" // qb: nah, go crazy. sample_nudge = BOUND(0, sample_nudge, 1.0);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-ambient\")) {"},{"Add":" ambient = BOUND(0, atof(argv[i + 1]), 255);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-savetrace\")) {"},{"Add":" save_trace = true;"},{"Add":" printf(\"savetrace = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-maxlight\")) {"},{"Add":" maxlight = BOUND(0, atof(argv[i + 1]), 255);"},{"Add":" } else"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" for(; i < argc; i++) {"},{"Add":" size_t input_length = strlen(argv[i]);"},{"Add":""},{"Add":" qboolean is_map = strcmp(argv[i] + input_length - 4, \".map\") == 0;"},{"Add":""},{"Add":" if(do_bsp) {"},{"Add":" if(!is_map)"},{"Add":" Error(\"bsp operation requires a map file input.\");"},{"Add":" } else if(do_vis || do_rad) {"},{"Add":" if(is_map)"},{"Add":" Error(\"bsp operation requires a bsp file input.\");"},{"Add":" } else {"},{"Add":" Error(\"no operations chosen to be performed on input.\");"},{"Add":" }"},{"Add":""},{"Add":" SetQdirFromPath(argv[i]);"},{"Add":""},{"Add":" if (strcmp(tmoddir, \"\")) {"},{"Add":" strcpy(moddir, tmoddir);"},{"Add":" Q_pathslash(moddir);"},{"Add":" strcpy(basedir, moddir);"},{"Add":" }"},{"Add":" if (strcmp(tbasedir, \"\")) {"},{"Add":" strcpy(basedir, tbasedir);"},{"Add":" Q_pathslash(basedir);"},{"Add":" if (!strcmp(tmoddir, \"\"))"},{"Add":" strcpy(moddir, basedir);"},{"Add":" }"},{"Add":" if (strcmp(tgamedir, \"\")) {"},{"Add":" strcpy(gamedir, tgamedir);"},{"Add":" Q_pathslash(gamedir);"},{"Add":" }"},{"Add":""},{"Add":" // qb: display dirs"},{"Add":" printf(\"moddir = %s\\n\", moddir);"},{"Add":" printf(\"basedir = %s\\n\", basedir);"},{"Add":" printf(\"gamedir = %s\\n\", gamedir);"},{"Add":""},{"Add":" if(do_bsp) {"},{"Add":" int32_t old_numthreads = numthreads;"},{"Add":" // qb: below is from original source release. On Windows, multi threads cause false leak errors."},{"Add":" numthreads = 1; // multiple threads aren't helping..."},{"Add":" BSP_ProcessArgument(argv[i]);"},{"Add":" numthreads = old_numthreads;"},{"Add":" }"},{"Add":" if(do_vis || (do_bsp && do_rad && is_map)) {"},{"Add":" VIS_ProcessArgument(argv[i]);"},{"Add":" }"},{"Add":" if(do_rad) {"},{"Add":" RAD_ProcessArgument(argv[i]);"},{"Add":" }"},{"Add":" }"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"common","metadata":576},"context":[{"change":0,"pos":17}],"contents":[]}},{"FileAdd":{"meta":{"basename":"trilib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"//"},{"Add":"// trilib.c: library for loading triangles from an Alias triangle file"},{"Add":"//"},{"Add":""},{"Add":"#include "},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":"#include \"4data.h\""},{"Add":""},{"Add":"// on disk representation of a face"},{"Add":""},{"Add":"#define FLOAT_START BOGUS_RANGE"},{"Add":"#define FLOAT_END -FLOAT_START"},{"Add":"#define MAGIC 123322"},{"Add":""},{"Add":"//#define NOISY 1"},{"Add":""},{"Add":"typedef struct {"},{"Add":" float v[3];"},{"Add":"} vector;"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" vector n; /* normal */"},{"Add":" vector p; /* point */"},{"Add":" vector c; /* color */"},{"Add":" float u; /* u */"},{"Add":" float v; /* v */"},{"Add":"} aliaspoint_t;"},{"Add":""},{"Add":"typedef struct {"},{"Add":" aliaspoint_t pt[3];"},{"Add":"} tf_triangle;"},{"Add":""},{"Add":"void ByteSwapTri(tf_triangle *tri) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < sizeof(tf_triangle) / 4; i++) {"},{"Add":" ((int32_t *)tri)[i] = BigLong(((int32_t *)tri)[i]);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void LoadTriangleList(char *filename, triangle_t **pptri, int32_t *numtriangles) {"},{"Add":" FILE *input;"},{"Add":" float start;"},{"Add":" char name[256], tex[256];"},{"Add":" int32_t i, count, magic;"},{"Add":" tf_triangle tri;"},{"Add":" triangle_t *ptri;"},{"Add":" int32_t iLevel;"},{"Add":" int32_t exitpattern;"},{"Add":" float t;"},{"Add":""},{"Add":" t = -FLOAT_START;"},{"Add":" *((uint8_t *)&exitpattern + 0) = *((uint8_t *)&t + 3);"},{"Add":" *((uint8_t *)&exitpattern + 1) = *((uint8_t *)&t + 2);"},{"Add":" *((uint8_t *)&exitpattern + 2) = *((uint8_t *)&t + 1);"},{"Add":" *((uint8_t *)&exitpattern + 3) = *((uint8_t *)&t + 0);"},{"Add":""},{"Add":" if ((input = fopen(filename, \"rb\")) == 0)"},{"Add":" Error(\"reader: could not open file '%s'\", filename);"},{"Add":""},{"Add":" iLevel = 0;"},{"Add":""},{"Add":" fread(&magic, sizeof(int32_t), 1, input);"},{"Add":" if (BigLong(magic) != MAGIC)"},{"Add":" Error(\"%s is not a Alias object separated triangle file, magic number is wrong.\", filename);"},{"Add":""},{"Add":" ptri = malloc(MAXTRIANGLES * sizeof(triangle_t));"},{"Add":""},{"Add":" *pptri = ptri;"},{"Add":""},{"Add":" while (feof(input) == 0) {"},{"Add":" if (fread(&start, sizeof(float), 1, input) < 1)"},{"Add":" break;"},{"Add":" *(int32_t *)&start = BigLong(*(int32_t *)&start);"},{"Add":" if (*(int32_t *)&start != exitpattern) {"},{"Add":" if (start == FLOAT_START) {"},{"Add":" /* Start of an object or group of objects. */"},{"Add":" i = -1;"},{"Add":" do {"},{"Add":" /* There are probably better ways to read a string from */"},{"Add":" /* a file, but this does allow you to do error checking */"},{"Add":" /* (which I'm not doing) on a per character basis. */"},{"Add":" ++i;"},{"Add":" fread(&(name[i]), sizeof(char), 1, input);"},{"Add":" } while (name[i] != '\\0');"},{"Add":""},{"Add":" //\t\t\t\tindent();"},{"Add":" //\t\t\t\tfprintf(stdout,\"OBJECT START: %s\\n\",name);"},{"Add":" fread(&count, sizeof(int32_t), 1, input);"},{"Add":" count = BigLong(count);"},{"Add":" ++iLevel;"},{"Add":" if (count != 0) {"},{"Add":" //\t\t\t\t\tindent();"},{"Add":" //\t\t\t\t\tfprintf(stdout,\"NUMBER OF TRIANGLES: %d\\n\",count);"},{"Add":""},{"Add":" i = -1;"},{"Add":" do {"},{"Add":" ++i;"},{"Add":" fread(&(tex[i]), sizeof(char), 1, input);"},{"Add":" } while (tex[i] != '\\0');"},{"Add":""},{"Add":" //\t\t\t\t\tindent();"},{"Add":" //\t\t\t\t\tfprintf(stdout,\" Object texture name: '%s'\\n\",tex);"},{"Add":" }"},{"Add":""},{"Add":" /* Else (count == 0) this is the start of a group, and */"},{"Add":" /* no texture name is present. */"},{"Add":" } else if (start == FLOAT_END) {"},{"Add":" /* End of an object or group. Yes, the name should be */"},{"Add":" /* obvious from context, but it is in here just to be */"},{"Add":" /* safe and to provide a little extra information for */"},{"Add":" /* those who do not wish to write a recursive reader. */"},{"Add":" /* Mia culpa. */"},{"Add":" --iLevel;"},{"Add":" i = -1;"},{"Add":" do {"},{"Add":" ++i;"},{"Add":" fread(&(name[i]), sizeof(char), 1, input);"},{"Add":" } while (name[i] != '\\0');"},{"Add":""},{"Add":" //\t\t\t\tindent();"},{"Add":" //\t\t\t\tfprintf(stdout,\"OBJECT END: %s\\n\",name);"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // read the triangles"},{"Add":" //"},{"Add":" for (i = 0; i < count; ++i) {"},{"Add":" int32_t j;"},{"Add":""},{"Add":" fread(&tri, sizeof(tf_triangle), 1, input);"},{"Add":" ByteSwapTri(&tri);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" int32_t k;"},{"Add":""},{"Add":" for (k = 0; k < 3; k++) {"},{"Add":" ptri->verts[j][k] = tri.pt[j].p.v[k];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" ptri++;"},{"Add":""},{"Add":" if ((ptri - *pptri) >= MAXTRIANGLES)"},{"Add":" Error(\"Error: too many triangles; increase MAXTRIANGLES\\n\");"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" *numtriangles = ptri - *pptri;"},{"Add":""},{"Add":" fclose(input);"},{"Add":" free(ptri); // qb: stop mem leak"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"threads.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"threads.h\""},{"Add":""},{"Add":"#define MAX_THREADS 64"},{"Add":""},{"Add":"int32_t dispatch;"},{"Add":"int32_t workcount;"},{"Add":"int32_t oldf;"},{"Add":"qboolean pacifier;"},{"Add":""},{"Add":"qboolean threaded;"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"GetThreadWork"},{"Add":""},{"Add":"============="},{"Add":"*/"},{"Add":"int32_t GetThreadWork(void) {"},{"Add":" int32_t r;"},{"Add":" int32_t f;"},{"Add":""},{"Add":" ThreadLock();"},{"Add":""},{"Add":" if (dispatch == workcount) {"},{"Add":" ThreadUnlock();"},{"Add":" return -1;"},{"Add":" }"},{"Add":""},{"Add":" f = 10 * dispatch / workcount;"},{"Add":" if (f != oldf) {"},{"Add":" oldf = f;"},{"Add":" if (pacifier) {"},{"Add":" printf(\"%i...\", f);"},{"Add":" fflush(stdout);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" r = dispatch;"},{"Add":" dispatch++;"},{"Add":" ThreadUnlock();"},{"Add":""},{"Add":" return r;"},{"Add":"}"},{"Add":""},{"Add":"void (*workfunction)(int32_t);"},{"Add":""},{"Add":"void ThreadWorkerFunction(int32_t threadnum) {"},{"Add":" int32_t work;"},{"Add":""},{"Add":" while (1) {"},{"Add":" work = GetThreadWork();"},{"Add":" if (work == -1)"},{"Add":" break;"},{"Add":" // printf (\"thread %i, work %i\\n\", threadnum, work);"},{"Add":" workfunction(work);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void RunThreadsOnIndividual(int32_t workcnt, qboolean showpacifier, void (*func)(int32_t)) {"},{"Add":" if (numthreads == -1)"},{"Add":" ThreadSetDefault();"},{"Add":" workfunction = func;"},{"Add":" RunThreadsOn(workcnt, showpacifier, ThreadWorkerFunction);"},{"Add":"}"},{"Add":""},{"Add":"#ifdef USE_PTHREADS"},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":""},{"Add":"#define USED"},{"Add":""},{"Add":"#include "},{"Add":""},{"Add":"int32_t numthreads = -1;"},{"Add":"CRITICAL_SECTION crit;"},{"Add":"static int32_t enter;"},{"Add":""},{"Add":"void ThreadSetDefault(void) {"},{"Add":" SYSTEM_INFO info;"},{"Add":""},{"Add":" if (numthreads == -1) // not set manually"},{"Add":" {"},{"Add":" GetSystemInfo(&info);"},{"Add":" numthreads = info.dwNumberOfProcessors;"},{"Add":" if (numthreads < 1 || numthreads > 32)"},{"Add":" numthreads = 1;"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"%i threads\\n\", numthreads);"},{"Add":"}"},{"Add":""},{"Add":"void ThreadLock(void) {"},{"Add":" if (!threaded)"},{"Add":" return;"},{"Add":" EnterCriticalSection(&crit);"},{"Add":" if (enter)"},{"Add":" Error(\"Recursive ThreadLock\\n\");"},{"Add":" enter = 1;"},{"Add":"}"},{"Add":""},{"Add":"void ThreadUnlock(void) {"},{"Add":" if (!threaded)"},{"Add":" return;"},{"Add":" if (!enter)"},{"Add":" Error(\"ThreadUnlock without lock\\n\");"},{"Add":" enter = 0;"},{"Add":" LeaveCriticalSection(&crit);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"RunThreadsOn"},{"Add":"============="},{"Add":"*/"},{"Add":"void RunThreadsOn(int32_t workcnt, qboolean showpacifier, void (*func)(int32_t)) {"},{"Add":" int32_t threadid[MAX_THREADS];"},{"Add":" HANDLE threadhandle[MAX_THREADS];"},{"Add":" int32_t i;"},{"Add":" int32_t start, end;"},{"Add":""},{"Add":" start = I_FloatTime();"},{"Add":" dispatch = 0;"},{"Add":" workcount = workcnt;"},{"Add":" oldf = -1;"},{"Add":" pacifier = showpacifier;"},{"Add":" threaded = true;"},{"Add":""},{"Add":" //"},{"Add":" // run threads in parallel"},{"Add":" //"},{"Add":" InitializeCriticalSection(&crit);"},{"Add":""},{"Add":" if (numthreads == 1) { // use same thread"},{"Add":" func(0);"},{"Add":" } else {"},{"Add":" for (i = 0; i < numthreads; i++) {"},{"Add":" threadhandle[i] = CreateThread("},{"Add":" NULL, // LPSECURITY_ATTRIBUTES lpsa,"},{"Add":" 0, // DWORD cbStack,"},{"Add":" (LPTHREAD_START_ROUTINE)func, // LPTHREAD_START_ROUTINE lpStartAddr,"},{"Add":" (LPVOID)i, // LPVOID lpvThreadParm,"},{"Add":" 0, // DWORD fdwCreate,"},{"Add":" &threadid[i]);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numthreads; i++)"},{"Add":" WaitForSingleObject(threadhandle[i], INFINITE);"},{"Add":" }"},{"Add":" DeleteCriticalSection(&crit);"},{"Add":""},{"Add":" threaded = false;"},{"Add":" end = I_FloatTime();"},{"Add":" if (pacifier)"},{"Add":" printf(\" (%i)\\n\", end - start);"},{"Add":"}"},{"Add":""},{"Add":"#else"},{"Add":"#define USED"},{"Add":""},{"Add":"int32_t numthreads = 4;"},{"Add":""},{"Add":"void ThreadSetDefault(void) {"},{"Add":" if (numthreads == -1) // not set manually"},{"Add":" {"},{"Add":" numthreads = 4;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"#include "},{"Add":""},{"Add":"pthread_mutex_t *my_mutex;"},{"Add":""},{"Add":"void ThreadLock(void) {"},{"Add":" if (my_mutex)"},{"Add":" pthread_mutex_lock(my_mutex);"},{"Add":"}"},{"Add":""},{"Add":"void ThreadUnlock(void) {"},{"Add":" if (my_mutex)"},{"Add":" pthread_mutex_unlock(my_mutex);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"RunThreadsOn"},{"Add":"============="},{"Add":"*/"},{"Add":"void RunThreadsOn(int32_t workcnt, qboolean showpacifier, void (*func)(int32_t)) {"},{"Add":" int32_t i;"},{"Add":" pthread_t work_threads[MAX_THREADS];"},{"Add":" void *status;"},{"Add":" pthread_attr_t attrib;"},{"Add":" pthread_mutexattr_t mattrib;"},{"Add":" int32_t start, end;"},{"Add":""},{"Add":" start = I_FloatTime();"},{"Add":" dispatch = 0;"},{"Add":" workcount = workcnt;"},{"Add":" oldf = -1;"},{"Add":" pacifier = showpacifier;"},{"Add":" threaded = true;"},{"Add":""},{"Add":" if (pacifier)"},{"Add":" setbuf(stdout, NULL);"},{"Add":""},{"Add":" if (!my_mutex) {"},{"Add":" my_mutex = malloc(sizeof(*my_mutex));"},{"Add":" if (pthread_mutexattr_init(&mattrib) == -1)"},{"Add":" Error(\"pthread_mutex_attr_create failed\");"},{"Add":" if (pthread_mutex_init(my_mutex, &mattrib) == -1)"},{"Add":" Error(\"pthread_mutex_init failed\");"},{"Add":" }"},{"Add":""},{"Add":" if (pthread_attr_init(&attrib) == -1)"},{"Add":" Error(\"pthread_attr_create failed\");"},{"Add":" if (pthread_attr_setstacksize(&attrib, 0x1000000) == -1)"},{"Add":" Error(\"pthread_attr_setstacksize failed\");"},{"Add":""},{"Add":" for (i = 0; i < numthreads; i++) {"},{"Add":" if (pthread_create(&work_threads[i], &attrib, (void *)func, &i) == -1)"},{"Add":" Error(\"pthread_create failed\");"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numthreads; i++) {"},{"Add":" if (pthread_join(work_threads[i], &status) == -1)"},{"Add":" Error(\"pthread_join failed\");"},{"Add":" }"},{"Add":""},{"Add":" threaded = false;"},{"Add":" end = I_FloatTime();"},{"Add":" if (pacifier)"},{"Add":" printf(\" (%i)\\n\", end - start);"},{"Add":"}"},{"Add":""},{"Add":"#endif"},{"Add":"#endif"},{"Add":""},{"Add":"/*"},{"Add":"======================================================================="},{"Add":""},{"Add":" SINGLE THREAD"},{"Add":""},{"Add":"======================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#ifndef USED"},{"Add":""},{"Add":"int32_t numthreads = 1;"},{"Add":""},{"Add":"void ThreadSetDefault(void) {"},{"Add":" numthreads = 1;"},{"Add":"}"},{"Add":""},{"Add":"void ThreadLock(void) {"},{"Add":"}"},{"Add":""},{"Add":"void ThreadUnlock(void) {"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"RunThreadsOn"},{"Add":"============="},{"Add":"*/"},{"Add":"void RunThreadsOn(int32_t workcnt, qboolean showpacifier, void (*func)(int32_t)) {"},{"Add":" int32_t start, end;"},{"Add":""},{"Add":" dispatch = 0;"},{"Add":" workcount = workcnt;"},{"Add":" oldf = -1;"},{"Add":" pacifier = showpacifier;"},{"Add":" start = I_FloatTime();"},{"Add":"#ifdef NeXT"},{"Add":" if (pacifier)"},{"Add":" setbuf(stdout, NULL);"},{"Add":"#endif"},{"Add":" func(0);"},{"Add":""},{"Add":" end = I_FloatTime();"},{"Add":" if (pacifier)"},{"Add":" printf(\" (%i)\\n\", end - start);"},{"Add":"}"},{"Add":""},{"Add":"#endif"}]}},{"FileAdd":{"meta":{"basename":"scriplib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"// scriplib.c"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"scriplib.h\""},{"Add":""},{"Add":"/*"},{"Add":"============================================================================="},{"Add":""},{"Add":" PARSING STUFF"},{"Add":""},{"Add":"============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" char filename[1024];"},{"Add":" char *buffer, *script_p, *end_p;"},{"Add":" int32_t line;"},{"Add":"} script_t;"},{"Add":""},{"Add":"#define MAX_INCLUDES 8"},{"Add":"script_t scriptstack[MAX_INCLUDES];"},{"Add":"script_t *script;"},{"Add":"int32_t scriptline;"},{"Add":""},{"Add":"char token[MAXTOKEN];"},{"Add":"qboolean endofscript;"},{"Add":"qboolean tokenready; // only true if UnGetToken was just called"},{"Add":""},{"Add":"// qb: brush info from AA tools"},{"Add":"char brush_info[2000] = \"No brushes processed yet. Look near beginning of map\";"},{"Add":"static int32_t brush_begin = 1;"},{"Add":""},{"Add":"void MarkBrushBegin() {"},{"Add":" brush_begin = 1;"},{"Add":"}"},{"Add":""},{"Add":"void TestBrushBegin() {"},{"Add":" if (!brush_begin)"},{"Add":" return;"},{"Add":""},{"Add":" brush_begin = 0;"},{"Add":""},{"Add":" sprintf(brush_info, \"Line %d, file %s\", script->line, script->filename);"},{"Add":"}"},{"Add":"/*"},{"Add":"=============="},{"Add":"AddScriptToStack"},{"Add":"=============="},{"Add":"*/"},{"Add":"void AddScriptToStack(char *filename) {"},{"Add":" int32_t size;"},{"Add":""},{"Add":" script++;"},{"Add":" if (script == &scriptstack[MAX_INCLUDES])"},{"Add":" Error(\"script file exceeded MAX_INCLUDES\");"},{"Add":" strcpy(script->filename, ExpandPath(filename));"},{"Add":""},{"Add":" size = LoadFile(script->filename, (void **)&script->buffer);"},{"Add":""},{"Add":" printf(\"entering %s\\n\", script->filename);"},{"Add":""},{"Add":" script->line = 1;"},{"Add":""},{"Add":" script->script_p = script->buffer;"},{"Add":" script->end_p = script->buffer + size;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"LoadScriptFile"},{"Add":"=============="},{"Add":"*/"},{"Add":"void LoadScriptFile(char *filename) {"},{"Add":" script = scriptstack;"},{"Add":" AddScriptToStack(filename);"},{"Add":""},{"Add":" endofscript = false;"},{"Add":" tokenready = false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"ParseFromMemory"},{"Add":"=============="},{"Add":"*/"},{"Add":"void ParseFromMemory(char *buffer, int32_t size) {"},{"Add":" script = scriptstack;"},{"Add":" script++;"},{"Add":" if (script == &scriptstack[MAX_INCLUDES])"},{"Add":" Error(\"script file exceeded MAX_INCLUDES\");"},{"Add":" strcpy(script->filename, \"memory buffer\");"},{"Add":""},{"Add":" script->buffer = buffer;"},{"Add":" script->line = 1;"},{"Add":" script->script_p = script->buffer;"},{"Add":" script->end_p = script->buffer + size;"},{"Add":""},{"Add":" endofscript = false;"},{"Add":" tokenready = false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"UnGetToken"},{"Add":""},{"Add":"Signals that the current token was not used, and should be reported"},{"Add":"for the next GetToken. Note that"},{"Add":""},{"Add":"GetToken (true);"},{"Add":"UnGetToken ();"},{"Add":"GetToken (false);"},{"Add":""},{"Add":"could cross a line boundary."},{"Add":"=============="},{"Add":"*/"},{"Add":"void UnGetToken(void) {"},{"Add":" tokenready = true;"},{"Add":"}"},{"Add":""},{"Add":"qboolean EndOfScript(qboolean crossline) {"},{"Add":" if (!crossline)"},{"Add":" Error(\"Line %i is incomplete\\n\", scriptline);"},{"Add":""},{"Add":" if (!strcmp(script->filename, \"memory buffer\")) {"},{"Add":" endofscript = true;"},{"Add":" return false;"},{"Add":" }"},{"Add":""},{"Add":" free(script->buffer);"},{"Add":" if (script == scriptstack + 1) {"},{"Add":" endofscript = true;"},{"Add":" return false;"},{"Add":" }"},{"Add":" script--;"},{"Add":" scriptline = script->line;"},{"Add":" printf(\"returning to %s\\n\", script->filename);"},{"Add":" return GetToken(crossline);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"GetToken"},{"Add":"=============="},{"Add":"*/"},{"Add":"qboolean GetToken(qboolean crossline) {"},{"Add":" char *token_p;"},{"Add":""},{"Add":" if (tokenready) // is a token allready waiting?"},{"Add":" {"},{"Add":" tokenready = false;"},{"Add":" return true;"},{"Add":" }"},{"Add":""},{"Add":" if (script->script_p >= script->end_p)"},{"Add":" return EndOfScript(crossline);"},{"Add":""},{"Add":" TestBrushBegin();"},{"Add":"//"},{"Add":"// skip space"},{"Add":"//"},{"Add":"skipspace:"},{"Add":" while (*script->script_p <= 32) {"},{"Add":" if (script->script_p >= script->end_p)"},{"Add":" return EndOfScript(crossline);"},{"Add":" if (*script->script_p++ == '\\n') {"},{"Add":" if (!crossline)"},{"Add":" Error(\"Line %i is incomplete\\n\", scriptline);"},{"Add":" scriptline = script->line++;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (script->script_p >= script->end_p)"},{"Add":" return EndOfScript(crossline);"},{"Add":""},{"Add":" // ; # // comments"},{"Add":" if (*script->script_p == ';' || *script->script_p == '#' || (script->script_p[0] == '/' && script->script_p[1] == '/')) {"},{"Add":" if (!crossline)"},{"Add":" Error(\"Line %i is incomplete\\n\", scriptline);"},{"Add":" while (*script->script_p++ != '\\n')"},{"Add":" if (script->script_p >= script->end_p)"},{"Add":" return EndOfScript(crossline);"},{"Add":" scriptline = script->line++;"},{"Add":" goto skipspace;"},{"Add":" }"},{"Add":""},{"Add":" // /* */ comments"},{"Add":" if (script->script_p[0] == '/' && script->script_p[1] == '*') {"},{"Add":" if (!crossline)"},{"Add":" Error(\"Line %i is incomplete\\n\", scriptline);"},{"Add":" script->script_p += 2;"},{"Add":" while (script->script_p[0] != '*' && script->script_p[1] != '/') {"},{"Add":" if (script->script_p[0] == '\\n')"},{"Add":" scriptline = script->line++;"},{"Add":" script->script_p++;"},{"Add":" if (script->script_p >= script->end_p)"},{"Add":" return EndOfScript(crossline);"},{"Add":" }"},{"Add":" script->script_p += 2;"},{"Add":" goto skipspace;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // copy token"},{"Add":" //"},{"Add":" token_p = token;"},{"Add":""},{"Add":" if (*script->script_p == '\"') {"},{"Add":" // quoted token"},{"Add":" script->script_p++;"},{"Add":" while (*script->script_p != '\"') {"},{"Add":" *token_p++ = *script->script_p++;"},{"Add":" if (script->script_p == script->end_p)"},{"Add":" break;"},{"Add":" if (token_p == &token[MAXTOKEN])"},{"Add":" Error(\"Token too large on line %i\\n\", scriptline);"},{"Add":" }"},{"Add":" script->script_p++;"},{"Add":" } else // regular token"},{"Add":" while (*script->script_p > 32 && *script->script_p != ';') {"},{"Add":" *token_p++ = *script->script_p++;"},{"Add":" if (script->script_p == script->end_p)"},{"Add":" break;"},{"Add":" if (token_p == &token[MAXTOKEN])"},{"Add":" Error(\"Token too large on line %i\\n\", scriptline);"},{"Add":" }"},{"Add":""},{"Add":" *token_p = 0;"},{"Add":""},{"Add":" if (!strcmp(token, \"$include\")) {"},{"Add":" GetToken(false);"},{"Add":" AddScriptToStack(token);"},{"Add":" return GetToken(crossline);"},{"Add":" }"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"TokenAvailable"},{"Add":""},{"Add":"Returns true if there is another token on the line"},{"Add":"=============="},{"Add":"*/"},{"Add":"qboolean TokenAvailable(void) {"},{"Add":" char *search_p;"},{"Add":""},{"Add":" search_p = script->script_p;"},{"Add":""},{"Add":" if (search_p >= script->end_p)"},{"Add":" return false;"},{"Add":""},{"Add":" while (*search_p <= 32) {"},{"Add":" if (*search_p == '\\n')"},{"Add":" return false;"},{"Add":" search_p++;"},{"Add":" if (search_p == script->end_p)"},{"Add":" return false;"},{"Add":" }"},{"Add":""},{"Add":" if (*search_p == ';')"},{"Add":" return false;"},{"Add":""},{"Add":" return true;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"polylib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":"#include \"polylib.h\""},{"Add":""},{"Add":"extern int32_t numthreads;"},{"Add":""},{"Add":"// counters are only bumped when running single threaded,"},{"Add":"// because they are an awefull coherence problem"},{"Add":"int32_t c_active_windings;"},{"Add":"int32_t c_peak_windings;"},{"Add":"int32_t c_winding_allocs;"},{"Add":"int32_t c_winding_points;"},{"Add":""},{"Add":"void pw(winding_t *w) {"},{"Add":" int32_t i;"},{"Add":" for (i = 0; i < w->numpoints; i++)"},{"Add":" printf(\"(%5.1f, %5.1f, %5.1f)\\n\", w->p[i][0], w->p[i][1], w->p[i][2]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"AllocWinding"},{"Add":"============="},{"Add":"*/"},{"Add":"winding_t *AllocWinding(int32_t points) {"},{"Add":" winding_t *w;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" if (numthreads == 1) {"},{"Add":" c_winding_allocs++;"},{"Add":" c_winding_points += points;"},{"Add":" c_active_windings++;"},{"Add":" if (c_active_windings > c_peak_windings)"},{"Add":" c_peak_windings = c_active_windings;"},{"Add":" }"},{"Add":" s = sizeof(vec_t) * 3 * points + sizeof(int32_t);"},{"Add":" w = malloc(s);"},{"Add":" memset(w, 0, s);"},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"void FreeWinding(winding_t *w) {"},{"Add":" if (*(unsigned *)w == 0xdeaddead)"},{"Add":" Error(\"FreeWinding: freed a freed winding\");"},{"Add":" *(unsigned *)w = 0xdeaddead;"},{"Add":""},{"Add":" if (numthreads == 1)"},{"Add":" c_active_windings--;"},{"Add":" free(w);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"RemoveColinearPoints"},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t c_removed;"},{"Add":""},{"Add":"void RemoveColinearPoints(winding_t *w) {"},{"Add":" int32_t i, j, k;"},{"Add":" vec3_t v1, v2;"},{"Add":" int32_t nump;"},{"Add":" vec3_t p[MAX_POINTS_ON_WINDING];"},{"Add":""},{"Add":" nump = 0;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" j = (i + 1) % w->numpoints;"},{"Add":" k = (i + w->numpoints - 1) % w->numpoints;"},{"Add":" VectorSubtract(w->p[j], w->p[i], v1);"},{"Add":" VectorSubtract(w->p[i], w->p[k], v2);"},{"Add":" VectorNormalize(v1, v1);"},{"Add":" VectorNormalize(v2, v2);"},{"Add":" if (DotProduct(v1, v2) < 0.999) {"},{"Add":" VectorCopy(w->p[i], p[nump]);"},{"Add":" nump++;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (nump == w->numpoints)"},{"Add":" return;"},{"Add":""},{"Add":" if (numthreads == 1)"},{"Add":" c_removed += w->numpoints - nump;"},{"Add":" w->numpoints = nump;"},{"Add":" memcpy(w->p, p, nump * sizeof(p[0]));"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"WindingPlane"},{"Add":"============"},{"Add":"*/"},{"Add":"void WindingPlane(winding_t *w, vec3_t normal, vec_t *dist) {"},{"Add":" vec3_t v1, v2;"},{"Add":""},{"Add":" VectorSubtract(w->p[1], w->p[0], v1);"},{"Add":" VectorSubtract(w->p[2], w->p[0], v2);"},{"Add":" CrossProduct(v2, v1, normal);"},{"Add":" VectorNormalize(normal, normal);"},{"Add":" *dist = DotProduct(w->p[0], normal);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"WindingArea"},{"Add":"============="},{"Add":"*/"},{"Add":"vec_t WindingArea(winding_t *w) {"},{"Add":" int32_t i;"},{"Add":" vec3_t d1, d2, cross;"},{"Add":" vec_t total;"},{"Add":""},{"Add":" total = 0;"},{"Add":" for (i = 2; i < w->numpoints; i++) {"},{"Add":" VectorSubtract(w->p[i - 1], w->p[0], d1);"},{"Add":" VectorSubtract(w->p[i], w->p[0], d2);"},{"Add":" CrossProduct(d1, d2, cross);"},{"Add":" total += 0.5 * VectorLength(cross);"},{"Add":" }"},{"Add":" return total;"},{"Add":"}"},{"Add":""},{"Add":"void WindingBounds(winding_t *w, vec3_t mins, vec3_t maxs) {"},{"Add":" vec_t v;"},{"Add":" int32_t i, j;"},{"Add":""},{"Add":" mins[0] = mins[1] = mins[2] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = maxs[2] = -BOGUS_RANGE;"},{"Add":""},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" v = w->p[i][j];"},{"Add":" if (v < mins[j])"},{"Add":" mins[j] = v;"},{"Add":" if (v > maxs[j])"},{"Add":" maxs[j] = v;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"WindingCenter"},{"Add":"============="},{"Add":"*/"},{"Add":"void WindingCenter(winding_t *w, vec3_t center) {"},{"Add":" int32_t i;"},{"Add":" float scale;"},{"Add":""},{"Add":" VectorCopy(vec3_origin, center);"},{"Add":" for (i = 0; i < w->numpoints; i++)"},{"Add":" VectorAdd(w->p[i], center, center);"},{"Add":""},{"Add":" scale = 1.0 / w->numpoints;"},{"Add":" VectorScale(center, scale, center);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"BaseWindingForPlane"},{"Add":"================="},{"Add":"*/"},{"Add":"winding_t *BaseWindingForPlane(vec3_t normal, vec_t dist) {"},{"Add":" int32_t i, x;"},{"Add":" vec_t max, v;"},{"Add":" vec3_t org, vright, vup;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" // find the major axis"},{"Add":""},{"Add":" max = -BOGUS_RANGE;"},{"Add":" x = -1;"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" v = fabs(normal[i]);"},{"Add":" if (v > max) {"},{"Add":" x = i;"},{"Add":" max = v;"},{"Add":" }"},{"Add":" }"},{"Add":" if (x == -1)"},{"Add":" Error(\"BaseWindingForPlane: no axis found\");"},{"Add":""},{"Add":" VectorCopy(vec3_origin, vup);"},{"Add":" switch (x) {"},{"Add":" case 0:"},{"Add":" case 1:"},{"Add":" vup[2] = 1;"},{"Add":" break;"},{"Add":" case 2:"},{"Add":" vup[0] = 1;"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" v = DotProduct(vup, normal);"},{"Add":" VectorMA(vup, -v, normal, vup);"},{"Add":" VectorNormalize(vup, vup);"},{"Add":""},{"Add":" VectorScale(normal, dist, org);"},{"Add":""},{"Add":" CrossProduct(vup, normal, vright);"},{"Add":""},{"Add":" VectorScale(vup, BOGUS_RANGE, vup);"},{"Add":" VectorScale(vright, BOGUS_RANGE, vright);"},{"Add":""},{"Add":" // project a really big\taxis aligned box onto the plane"},{"Add":" w = AllocWinding(4);"},{"Add":""},{"Add":" VectorSubtract(org, vright, w->p[0]);"},{"Add":" VectorAdd(w->p[0], vup, w->p[0]);"},{"Add":""},{"Add":" VectorAdd(org, vright, w->p[1]);"},{"Add":" VectorAdd(w->p[1], vup, w->p[1]);"},{"Add":""},{"Add":" VectorAdd(org, vright, w->p[2]);"},{"Add":" VectorSubtract(w->p[2], vup, w->p[2]);"},{"Add":""},{"Add":" VectorSubtract(org, vright, w->p[3]);"},{"Add":" VectorSubtract(w->p[3], vup, w->p[3]);"},{"Add":""},{"Add":" w->numpoints = 4;"},{"Add":""},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"CopyWinding"},{"Add":"=================="},{"Add":"*/"},{"Add":"winding_t *CopyWinding(const winding_t *w) {"},{"Add":" int32_t size;"},{"Add":" winding_t *c;"},{"Add":""},{"Add":" c = AllocWinding(w->numpoints);"},{"Add":" size = (intptr_t)((winding_t *)0)->p[w->numpoints];"},{"Add":" memcpy(c, w, size);"},{"Add":" return c;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"ReverseWinding"},{"Add":"=================="},{"Add":"*/"},{"Add":"winding_t *ReverseWinding(winding_t *w) {"},{"Add":" int32_t i;"},{"Add":" winding_t *c;"},{"Add":""},{"Add":" c = AllocWinding(w->numpoints);"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" VectorCopy(w->p[w->numpoints - 1 - i], c->p[i]);"},{"Add":" }"},{"Add":" c->numpoints = w->numpoints;"},{"Add":" return c;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"ClipWindingEpsilon"},{"Add":"============="},{"Add":"*/"},{"Add":"void ClipWindingEpsilon("},{"Add":" const winding_t *in,"},{"Add":" const vec3_t normal,"},{"Add":" const vec_t dist,"},{"Add":" const vec_t epsilon,"},{"Add":" winding_t **front, winding_t **back) {"},{"Add":" vec_t dists[MAX_POINTS_ON_WINDING + 4];"},{"Add":" int32_t sides[MAX_POINTS_ON_WINDING + 4];"},{"Add":" int32_t counts[3];"},{"Add":" static vec_t dot; // VC 4.2 optimizer bug if not static"},{"Add":" int32_t i, j;"},{"Add":" vec_t *p1, *p2;"},{"Add":" vec3_t mid;"},{"Add":" winding_t *f, *b;"},{"Add":" int32_t maxpts;"},{"Add":""},{"Add":" counts[0] = counts[1] = counts[2] = 0;"},{"Add":" sides[0] = dists[0] = 0;"},{"Add":""},{"Add":" // determine sides for each point"},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" dot = DotProduct(in->p[i], normal);"},{"Add":" dot -= dist;"},{"Add":" dists[i] = dot;"},{"Add":" if (dot > epsilon)"},{"Add":" sides[i] = SIDE_FRONT;"},{"Add":" else if (dot < -epsilon)"},{"Add":" sides[i] = SIDE_BACK;"},{"Add":" else"},{"Add":" sides[i] = SIDE_ON;"},{"Add":" counts[sides[i]]++;"},{"Add":" }"},{"Add":" sides[i] = sides[0];"},{"Add":" dists[i] = dists[0];"},{"Add":""},{"Add":" *front = *back = NULL;"},{"Add":""},{"Add":" if (!counts[0]) {"},{"Add":" *back = CopyWinding(in);"},{"Add":" return;"},{"Add":" }"},{"Add":" if (!counts[1]) {"},{"Add":" *front = CopyWinding(in);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" maxpts = in->numpoints + 4; // cant use counts[0]+2 because of fp grouping errors"},{"Add":""},{"Add":" *front = f = AllocWinding(maxpts);"},{"Add":" *back = b = AllocWinding(maxpts);"},{"Add":""},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" p1 = ((winding_t *)in)->p[i];"},{"Add":""},{"Add":" if (sides[i] == SIDE_ON) {"},{"Add":" VectorCopy(p1, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" VectorCopy(p1, b->p[b->numpoints]);"},{"Add":" b->numpoints++;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i] == SIDE_FRONT) {"},{"Add":" VectorCopy(p1, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" }"},{"Add":" if (sides[i] == SIDE_BACK) {"},{"Add":" VectorCopy(p1, b->p[b->numpoints]);"},{"Add":" b->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i + 1] == SIDE_ON || sides[i + 1] == sides[i])"},{"Add":" continue;"},{"Add":""},{"Add":" // generate a split point"},{"Add":" p2 = ((winding_t *)in)->p[(i + 1) % in->numpoints];"},{"Add":""},{"Add":" dot = dists[i] / (dists[i] - dists[i + 1]);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" // avoid round off error when possible"},{"Add":" if (normal[j] == 1)"},{"Add":" mid[j] = dist;"},{"Add":" else if (normal[j] == -1)"},{"Add":" mid[j] = -dist;"},{"Add":" else"},{"Add":" mid[j] = p1[j] + dot * (p2[j] - p1[j]);"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(mid, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" VectorCopy(mid, b->p[b->numpoints]);"},{"Add":" b->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" if (f->numpoints > maxpts || b->numpoints > maxpts)"},{"Add":" Error(\"ClipWinding: points exceeded estimate\");"},{"Add":" if (f->numpoints > MAX_POINTS_ON_WINDING || b->numpoints > MAX_POINTS_ON_WINDING)"},{"Add":" Error(\"ClipWinding: MAX_POINTS_ON_WINDING\");"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"ChopWindingInPlace"},{"Add":"============="},{"Add":"*/"},{"Add":"void ChopWindingInPlace(winding_t **inout, vec3_t normal, vec_t dist, vec_t epsilon) {"},{"Add":" winding_t *in;"},{"Add":" vec_t dists[MAX_POINTS_ON_WINDING + 4];"},{"Add":" int32_t sides[MAX_POINTS_ON_WINDING + 4];"},{"Add":" int32_t counts[3];"},{"Add":" static vec_t dot; // VC 4.2 optimizer bug if not static"},{"Add":" int32_t i, j;"},{"Add":" vec_t *p1, *p2;"},{"Add":" vec3_t mid;"},{"Add":" winding_t *f;"},{"Add":" int32_t maxpts;"},{"Add":""},{"Add":" in = *inout;"},{"Add":" counts[0] = counts[1] = counts[2] = 0;"},{"Add":""},{"Add":" // determine sides for each point"},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" dot = DotProduct(in->p[i], normal);"},{"Add":" dot -= dist;"},{"Add":" dists[i] = dot;"},{"Add":" if (dot > epsilon)"},{"Add":" sides[i] = SIDE_FRONT;"},{"Add":" else if (dot < -epsilon)"},{"Add":" sides[i] = SIDE_BACK;"},{"Add":" else {"},{"Add":" sides[i] = SIDE_ON;"},{"Add":" }"},{"Add":" counts[sides[i]]++;"},{"Add":" }"},{"Add":" sides[i] = sides[0];"},{"Add":" dists[i] = dists[0];"},{"Add":""},{"Add":" if (!counts[0]) {"},{"Add":" FreeWinding(in);"},{"Add":" *inout = NULL;"},{"Add":" return;"},{"Add":" }"},{"Add":" if (!counts[1])"},{"Add":" return; // inout stays the same"},{"Add":""},{"Add":" maxpts = in->numpoints + 4; // can't use counts[0]+2 because of fp grouping errors"},{"Add":""},{"Add":" f = AllocWinding(maxpts);"},{"Add":""},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" p1 = in->p[i];"},{"Add":""},{"Add":" if (sides[i] == SIDE_ON) {"},{"Add":" VectorCopy(p1, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i] == SIDE_FRONT) {"},{"Add":" VectorCopy(p1, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i + 1] == SIDE_ON || sides[i + 1] == sides[i])"},{"Add":" continue;"},{"Add":""},{"Add":" // generate a split point"},{"Add":" p2 = in->p[(i + 1) % in->numpoints];"},{"Add":""},{"Add":" dot = dists[i] / (dists[i] - dists[i + 1]);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" // avoid round off error when possible"},{"Add":" if (normal[j] >= 1)"},{"Add":" mid[j] = dist;"},{"Add":" else if (normal[j] <= -1)"},{"Add":" mid[j] = -dist;"},{"Add":" else"},{"Add":" mid[j] = p1[j] + dot * (p2[j] - p1[j]);"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(mid, f->p[f->numpoints]);"},{"Add":" f->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" if (f->numpoints > maxpts)"},{"Add":" Error(\"ClipWinding: points exceeded estimate\");"},{"Add":" if (f->numpoints > MAX_POINTS_ON_WINDING)"},{"Add":" Error(\"ClipWinding: MAX_POINTS_ON_WINDING\");"},{"Add":""},{"Add":" FreeWinding(in);"},{"Add":" *inout = f;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"ChopWinding"},{"Add":""},{"Add":"Returns the fragment of in that is on the front side"},{"Add":"of the cliping plane. The original is freed."},{"Add":"================="},{"Add":"*/"},{"Add":"winding_t *ChopWinding(winding_t *in, vec3_t normal, vec_t dist) {"},{"Add":" winding_t *f, *b;"},{"Add":""},{"Add":" ClipWindingEpsilon(in, normal, dist, ON_EPSILON, &f, &b);"},{"Add":" FreeWinding(in);"},{"Add":" if (b)"},{"Add":" FreeWinding(b);"},{"Add":" return f;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"CheckWinding"},{"Add":""},{"Add":"================="},{"Add":"*/"},{"Add":"void CheckWinding(winding_t *w) {"},{"Add":" int32_t i, j;"},{"Add":" vec_t *p1, *p2;"},{"Add":" vec_t d, edgedist;"},{"Add":" vec3_t dir, edgenormal, facenormal;"},{"Add":" vec_t area;"},{"Add":" vec_t facedist;"},{"Add":""},{"Add":" if (w->numpoints < 3)"},{"Add":" Error(\"CheckWinding: %i points\", w->numpoints);"},{"Add":""},{"Add":" area = WindingArea(w);"},{"Add":" if (area < 1)"},{"Add":" Error(\"CheckWinding: %f area\", area);"},{"Add":""},{"Add":" WindingPlane(w, facenormal, &facedist);"},{"Add":""},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" p1 = w->p[i];"},{"Add":""},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" if (p1[j] > BOGUS_RANGE || p1[j] < -BOGUS_RANGE)"},{"Add":" Error(\"CheckFace: BUGUS_RANGE: %f\", p1[j]);"},{"Add":""},{"Add":" j = i + 1 == w->numpoints ? 0 : i + 1;"},{"Add":""},{"Add":" // check the point is on the face plane"},{"Add":" d = DotProduct(p1, facenormal) - facedist;"},{"Add":" if (d < -ON_EPSILON || d > ON_EPSILON)"},{"Add":" Error(\"CheckWinding: point off plane\");"},{"Add":""},{"Add":" // check the edge isnt degenerate"},{"Add":" p2 = w->p[j];"},{"Add":" VectorSubtract(p2, p1, dir);"},{"Add":""},{"Add":" if (VectorLength(dir) < ON_EPSILON)"},{"Add":" Error(\"CheckWinding: degenerate edge\");"},{"Add":""},{"Add":" CrossProduct(facenormal, dir, edgenormal);"},{"Add":" VectorNormalize(edgenormal, edgenormal);"},{"Add":" edgedist = DotProduct(p1, edgenormal);"},{"Add":" edgedist += ON_EPSILON;"},{"Add":""},{"Add":" // all other points must be on front side"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" if (j == i)"},{"Add":" continue;"},{"Add":" d = DotProduct(w->p[j], edgenormal);"},{"Add":" if (d > edgedist)"},{"Add":" Error(\"CheckWinding: non-convex\");"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"WindingOnPlaneSide"},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t WindingOnPlaneSide(winding_t *w, vec3_t normal, vec_t dist) {"},{"Add":" qboolean front, back;"},{"Add":" int32_t i;"},{"Add":" vec_t d;"},{"Add":""},{"Add":" front = false;"},{"Add":" back = false;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" d = DotProduct(w->p[i], normal) - dist;"},{"Add":" if (d < -ON_EPSILON) {"},{"Add":" if (front)"},{"Add":" return SIDE_CROSS;"},{"Add":" back = true;"},{"Add":" continue;"},{"Add":" }"},{"Add":" if (d > ON_EPSILON) {"},{"Add":" if (back)"},{"Add":" return SIDE_CROSS;"},{"Add":" front = true;"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (back)"},{"Add":" return SIDE_BACK;"},{"Add":" if (front)"},{"Add":" return SIDE_FRONT;"},{"Add":" return SIDE_ON;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"mdfour.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":" mdfour.c"},{"Add":""},{"Add":" An implementation of MD4 designed for use in the samba SMB"},{"Add":" authentication protocol"},{"Add":""},{"Add":" Copyright (C) 1997-1998 Andrew Tridgell"},{"Add":""},{"Add":" This program is free software; you can redistribute it and/or"},{"Add":" modify it under the terms of the GNU General Public License"},{"Add":" as published by the Free Software Foundation; either version 2"},{"Add":" of the License, or (at your option) any later version."},{"Add":""},{"Add":" This program is distributed in the hope that it will be useful,"},{"Add":" but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."},{"Add":""},{"Add":" See the GNU General Public License for more details."},{"Add":""},{"Add":" You should have received a copy of the GNU General Public License"},{"Add":" along with this program; if not, write to:"},{"Add":""},{"Add":" Free Software Foundation, Inc."},{"Add":" 59 Temple Place - Suite 330"},{"Add":" Boston, MA 02111-1307, USA"},{"Add":""},{"Add":"*/"},{"Add":"#include "},{"Add":"#include /* XoXus: needed for memset call */"},{"Add":"#include \"mdfour.h\""},{"Add":""},{"Add":"/* NOTE: This code makes no attempt to be fast!"},{"Add":""},{"Add":" It assumes that a int32_t is at least 32 bits long"},{"Add":"*/"},{"Add":""},{"Add":"static struct mdfour *m;"},{"Add":""},{"Add":"#define F(X, Y, Z) (((X) & (Y)) | ((~(X)) & (Z)))"},{"Add":"#define G(X, Y, Z) (((X) & (Y)) | ((X) & (Z)) | ((Y) & (Z)))"},{"Add":"#define H(X, Y, Z) ((X) ^ (Y) ^ (Z))"},{"Add":"#ifdef LARGE_INT32"},{"Add":"#define lshift(x, s) ((((x) << (s)) & 0xFFFFFFFF) | (((x) >> (32 - (s))) & 0xFFFFFFFF))"},{"Add":"#else"},{"Add":"#define lshift(x, s) (((x) << (s)) | ((x) >> (32 - (s))))"},{"Add":"#endif"},{"Add":""},{"Add":"#define ROUND1(a, b, c, d, k, s) a = lshift(a + F(b, c, d) + X[k], s)"},{"Add":"#define ROUND2(a, b, c, d, k, s) a = lshift(a + G(b, c, d) + X[k] + 0x5A827999, s)"},{"Add":"#define ROUND3(a, b, c, d, k, s) a = lshift(a + H(b, c, d) + X[k] + 0x6ED9EBA1, s)"},{"Add":""},{"Add":"/* this applies md4 to 64 byte chunks */"},{"Add":"static void mdfour64(uint32_t *M) {"},{"Add":" int32_t j;"},{"Add":" uint32_t AA, BB, CC, DD;"},{"Add":" uint32_t X[16];"},{"Add":" uint32_t A, B, C, D;"},{"Add":""},{"Add":" for (j = 0; j < 16; j++)"},{"Add":" X[j] = M[j];"},{"Add":""},{"Add":" A = m->A;"},{"Add":" B = m->B;"},{"Add":" C = m->C;"},{"Add":" D = m->D;"},{"Add":" AA = A;"},{"Add":" BB = B;"},{"Add":" CC = C;"},{"Add":" DD = D;"},{"Add":""},{"Add":" ROUND1(A, B, C, D, 0, 3);"},{"Add":" ROUND1(D, A, B, C, 1, 7);"},{"Add":" ROUND1(C, D, A, B, 2, 11);"},{"Add":" ROUND1(B, C, D, A, 3, 19);"},{"Add":" ROUND1(A, B, C, D, 4, 3);"},{"Add":" ROUND1(D, A, B, C, 5, 7);"},{"Add":" ROUND1(C, D, A, B, 6, 11);"},{"Add":" ROUND1(B, C, D, A, 7, 19);"},{"Add":" ROUND1(A, B, C, D, 8, 3);"},{"Add":" ROUND1(D, A, B, C, 9, 7);"},{"Add":" ROUND1(C, D, A, B, 10, 11);"},{"Add":" ROUND1(B, C, D, A, 11, 19);"},{"Add":" ROUND1(A, B, C, D, 12, 3);"},{"Add":" ROUND1(D, A, B, C, 13, 7);"},{"Add":" ROUND1(C, D, A, B, 14, 11);"},{"Add":" ROUND1(B, C, D, A, 15, 19);"},{"Add":""},{"Add":" ROUND2(A, B, C, D, 0, 3);"},{"Add":" ROUND2(D, A, B, C, 4, 5);"},{"Add":" ROUND2(C, D, A, B, 8, 9);"},{"Add":" ROUND2(B, C, D, A, 12, 13);"},{"Add":" ROUND2(A, B, C, D, 1, 3);"},{"Add":" ROUND2(D, A, B, C, 5, 5);"},{"Add":" ROUND2(C, D, A, B, 9, 9);"},{"Add":" ROUND2(B, C, D, A, 13, 13);"},{"Add":" ROUND2(A, B, C, D, 2, 3);"},{"Add":" ROUND2(D, A, B, C, 6, 5);"},{"Add":" ROUND2(C, D, A, B, 10, 9);"},{"Add":" ROUND2(B, C, D, A, 14, 13);"},{"Add":" ROUND2(A, B, C, D, 3, 3);"},{"Add":" ROUND2(D, A, B, C, 7, 5);"},{"Add":" ROUND2(C, D, A, B, 11, 9);"},{"Add":" ROUND2(B, C, D, A, 15, 13);"},{"Add":""},{"Add":" ROUND3(A, B, C, D, 0, 3);"},{"Add":" ROUND3(D, A, B, C, 8, 9);"},{"Add":" ROUND3(C, D, A, B, 4, 11);"},{"Add":" ROUND3(B, C, D, A, 12, 15);"},{"Add":" ROUND3(A, B, C, D, 2, 3);"},{"Add":" ROUND3(D, A, B, C, 10, 9);"},{"Add":" ROUND3(C, D, A, B, 6, 11);"},{"Add":" ROUND3(B, C, D, A, 14, 15);"},{"Add":" ROUND3(A, B, C, D, 1, 3);"},{"Add":" ROUND3(D, A, B, C, 9, 9);"},{"Add":" ROUND3(C, D, A, B, 5, 11);"},{"Add":" ROUND3(B, C, D, A, 13, 15);"},{"Add":" ROUND3(A, B, C, D, 3, 3);"},{"Add":" ROUND3(D, A, B, C, 11, 9);"},{"Add":" ROUND3(C, D, A, B, 7, 11);"},{"Add":" ROUND3(B, C, D, A, 15, 15);"},{"Add":""},{"Add":" A += AA;"},{"Add":" B += BB;"},{"Add":" C += CC;"},{"Add":" D += DD;"},{"Add":""},{"Add":"#ifdef LARGE_INT32"},{"Add":" A &= 0xFFFFFFFF;"},{"Add":" B &= 0xFFFFFFFF;"},{"Add":" C &= 0xFFFFFFFF;"},{"Add":" D &= 0xFFFFFFFF;"},{"Add":"#endif"},{"Add":""},{"Add":" for (j = 0; j < 16; j++)"},{"Add":" X[j] = 0;"},{"Add":""},{"Add":" m->A = A;"},{"Add":" m->B = B;"},{"Add":" m->C = C;"},{"Add":" m->D = D;"},{"Add":"}"},{"Add":""},{"Add":"static void copy64(uint32_t *M, uint8_t *in) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < 16; i++)"},{"Add":" M[i] = (in[i * 4 + 3] << 24) | (in[i * 4 + 2] << 16) |"},{"Add":" (in[i * 4 + 1] << 8) | (in[i * 4 + 0] << 0);"},{"Add":"}"},{"Add":""},{"Add":"static void copy4(uint8_t *out, uint32_t x) {"},{"Add":" out[0] = x & 0xFF;"},{"Add":" out[1] = (x >> 8) & 0xFF;"},{"Add":" out[2] = (x >> 16) & 0xFF;"},{"Add":" out[3] = (x >> 24) & 0xFF;"},{"Add":"}"},{"Add":""},{"Add":"void mdfour_begin(struct mdfour *md) {"},{"Add":" md->A = 0x67452301;"},{"Add":" md->B = 0xefcdab89;"},{"Add":" md->C = 0x98badcfe;"},{"Add":" md->D = 0x10325476;"},{"Add":" md->totalN = 0;"},{"Add":"}"},{"Add":""},{"Add":"static void mdfour_tail(uint8_t *in, int32_t n) {"},{"Add":" uint8_t buf[128];"},{"Add":" uint32_t M[16];"},{"Add":" uint32_t b;"},{"Add":""},{"Add":" m->totalN += n;"},{"Add":""},{"Add":" b = m->totalN * 8;"},{"Add":""},{"Add":" memset(buf, 0, 128);"},{"Add":" if (n)"},{"Add":" memcpy(buf, in, n);"},{"Add":" buf[n] = 0x80;"},{"Add":""},{"Add":" if (n <= 55) {"},{"Add":" copy4(buf + 56, b);"},{"Add":" copy64(M, buf);"},{"Add":" mdfour64(M);"},{"Add":" } else {"},{"Add":" copy4(buf + 120, b);"},{"Add":" copy64(M, buf);"},{"Add":" mdfour64(M);"},{"Add":" copy64(M, buf + 64);"},{"Add":" mdfour64(M);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void mdfour_update(struct mdfour *md, uint8_t *in, int32_t n) {"},{"Add":" uint32_t M[16];"},{"Add":""},{"Add":" if (n == 0)"},{"Add":" mdfour_tail(in, n);"},{"Add":""},{"Add":" m = md;"},{"Add":""},{"Add":" while (n >= 64) {"},{"Add":" copy64(M, in);"},{"Add":" mdfour64(M);"},{"Add":" in += 64;"},{"Add":" n -= 64;"},{"Add":" m->totalN += 64;"},{"Add":" }"},{"Add":""},{"Add":" mdfour_tail(in, n);"},{"Add":"}"},{"Add":""},{"Add":"void mdfour_result(struct mdfour *md, uint8_t *out) {"},{"Add":" m = md;"},{"Add":""},{"Add":" copy4(out, m->A);"},{"Add":" copy4(out + 4, m->B);"},{"Add":" copy4(out + 8, m->C);"},{"Add":" copy4(out + 12, m->D);"},{"Add":"}"},{"Add":""},{"Add":"void mdfour(uint8_t *out, uint8_t *in, int32_t n) {"},{"Add":" struct mdfour md;"},{"Add":" mdfour_begin(&md);"},{"Add":" mdfour_update(&md, in, n);"},{"Add":" mdfour_result(&md, out);"},{"Add":"}"},{"Add":""},{"Add":"///////////////////////////////////////////////////////////////"},{"Add":"//\tMD4-based checksum utility functions"},{"Add":"//"},{"Add":"//\tCopyright (C) 2000 Jeff Teunissen "},{"Add":"//"},{"Add":"//\tAuthor: Jeff Teunissen\t"},{"Add":"//\tDate: 01 Jan 2000"},{"Add":""},{"Add":"unsigned Com_BlockChecksum(void *buffer, int32_t length) {"},{"Add":" int32_t digest[4];"},{"Add":" unsigned val;"},{"Add":""},{"Add":" mdfour((uint8_t *)digest, (uint8_t *)buffer, length);"},{"Add":""},{"Add":" val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];"},{"Add":""},{"Add":" return val;"},{"Add":"}"},{"Add":""},{"Add":"void Com_BlockFullChecksum(void *buffer, int32_t len, uint8_t *outbuf) {"},{"Add":" mdfour(outbuf, (uint8_t *)buffer, len);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"mathlib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"// mathlib.c -- math primitives"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":""},{"Add":"vec3_t vec3_origin = {0, 0, 0};"},{"Add":""},{"Add":"// qb: inline math from AA tools"},{"Add":"#ifndef MATH_INLINE"},{"Add":""},{"Add":"double VectorLength(vec3_t v) {"},{"Add":" int32_t i;"},{"Add":" double length;"},{"Add":""},{"Add":" length = 0;"},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" length += v[i] * v[i];"},{"Add":" length = sqrt(length); // FIXME"},{"Add":""},{"Add":" return length;"},{"Add":"}"},{"Add":""},{"Add":"qboolean VectorCompare(vec3_t v1, vec3_t v2) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" if (fabs(v1[i] - v2[i]) > EQUAL_EPSILON)"},{"Add":" return false;"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"vec_t Q_rint(vec_t in) {"},{"Add":" return floor(in + 0.5);"},{"Add":"}"},{"Add":""},{"Add":"void VectorMA(vec3_t va, double scale, vec3_t vb, vec3_t vc) {"},{"Add":" vc[0] = va[0] + scale * vb[0];"},{"Add":" vc[1] = va[1] + scale * vb[1];"},{"Add":" vc[2] = va[2] + scale * vb[2];"},{"Add":"}"},{"Add":""},{"Add":"void CrossProduct(vec3_t v1, vec3_t v2, vec3_t cross) {"},{"Add":" cross[0] = v1[1] * v2[2] - v1[2] * v2[1];"},{"Add":" cross[1] = v1[2] * v2[0] - v1[0] * v2[2];"},{"Add":" cross[2] = v1[0] * v2[1] - v1[1] * v2[0];"},{"Add":"}"},{"Add":""},{"Add":"vec_t _DotProduct(vec3_t v1, vec3_t v2) {"},{"Add":" return v1[0] * v2[0] + v1[1] * v2[1] + v1[2] * v2[2];"},{"Add":"}"},{"Add":""},{"Add":"void _VectorSubtract(vec3_t va, vec3_t vb, vec3_t out) {"},{"Add":" out[0] = va[0] - vb[0];"},{"Add":" out[1] = va[1] - vb[1];"},{"Add":" out[2] = va[2] - vb[2];"},{"Add":"}"},{"Add":""},{"Add":"void _VectorAdd(vec3_t va, vec3_t vb, vec3_t out) {"},{"Add":" out[0] = va[0] + vb[0];"},{"Add":" out[1] = va[1] + vb[1];"},{"Add":" out[2] = va[2] + vb[2];"},{"Add":"}"},{"Add":""},{"Add":"void _VectorCopy(vec3_t in, vec3_t out) {"},{"Add":" out[0] = in[0];"},{"Add":" out[1] = in[1];"},{"Add":" out[2] = in[2];"},{"Add":"}"},{"Add":""},{"Add":"void _VectorScale(vec3_t v, vec_t scale, vec3_t out) {"},{"Add":" out[0] = v[0] * scale;"},{"Add":" out[1] = v[1] * scale;"},{"Add":" out[2] = v[2] * scale;"},{"Add":"}"},{"Add":""},{"Add":"vec_t VectorNormalize(vec3_t in, vec3_t out) {"},{"Add":" vec_t length, ilength;"},{"Add":""},{"Add":" length = sqrt(in[0] * in[0] + in[1] * in[1] + in[2] * in[2]);"},{"Add":" if (length == 0) {"},{"Add":" VectorClear(out);"},{"Add":" return 0;"},{"Add":" }"},{"Add":""},{"Add":" ilength = 1.0 / length;"},{"Add":" out[0] = in[0] * ilength;"},{"Add":" out[1] = in[1] * ilength;"},{"Add":" out[2] = in[2] * ilength;"},{"Add":""},{"Add":" return length;"},{"Add":"}"},{"Add":""},{"Add":"vec_t ColorNormalize(vec3_t in, vec3_t out) {"},{"Add":" float max, scale;"},{"Add":""},{"Add":" max = in[0];"},{"Add":" if (in[1] > max)"},{"Add":" max = in[1];"},{"Add":" if (in[2] > max)"},{"Add":" max = in[2];"},{"Add":""},{"Add":" if (max == 0)"},{"Add":" return 0;"},{"Add":""},{"Add":" scale = 1.0 / max;"},{"Add":""},{"Add":" VectorScale(in, scale, out);"},{"Add":""},{"Add":" return max;"},{"Add":"}"},{"Add":""},{"Add":"void VectorInverse(vec3_t v) {"},{"Add":" v[0] = -v[0];"},{"Add":" v[1] = -v[1];"},{"Add":" v[2] = -v[2];"},{"Add":"}"},{"Add":""},{"Add":"void ClearBounds(vec3_t mins, vec3_t maxs) {"},{"Add":" mins[0] = mins[1] = mins[2] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = maxs[2] = -BOGUS_RANGE;"},{"Add":"}"},{"Add":""},{"Add":"void AddPointToBounds(vec3_t v, vec3_t mins, vec3_t maxs) {"},{"Add":" int32_t i;"},{"Add":" vec_t val;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" val = v[i];"},{"Add":" if (val < mins[i])"},{"Add":" mins[i] = val;"},{"Add":" if (val > maxs[i])"},{"Add":" maxs[i] = val;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"// qb: from AA tools"},{"Add":"qboolean RayPlaneIntersect(vec3_t p_n, vec_t p_d, vec3_t l_o, vec3_t l_n,"},{"Add":" vec3_t res) {"},{"Add":" float dot, t;"},{"Add":""},{"Add":" dot = DotProduct(p_n, l_n);"},{"Add":""},{"Add":" if (dot > -0.001)"},{"Add":" return false;"},{"Add":""},{"Add":" t = (p_d - (l_o[0] * p_n[0]) - (l_o[1] * p_n[1]) - (l_o[2] * p_n[2])) / dot;"},{"Add":""},{"Add":" res[0] = l_o[0] + (t * l_n[0]);"},{"Add":" res[1] = l_o[1] + (t * l_n[1]);"},{"Add":" res[2] = l_o[2] + (t * l_n[2]);"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":"#endif"}]}},{"FileAdd":{"meta":{"basename":"llwolib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"//"},{"Add":"// llwolib.c: library for loading triangles from a Lightwave triangle file"},{"Add":"//"},{"Add":""},{"Add":"#include "},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":"#include \"4data.h\""},{"Add":""},{"Add":"#define MAXPOINTS 2000"},{"Add":"#define MAXPOLYS 2000"},{"Add":""},{"Add":"struct {"},{"Add":" float p[3];"},{"Add":"} pnt[MAXPOINTS];"},{"Add":"struct {"},{"Add":" short pl[3];"},{"Add":"} ply[MAXPOLYS];"},{"Add":""},{"Add":"char trashcan[10000];"},{"Add":"char buffer[1000];"},{"Add":"long counter;"},{"Add":"union {"},{"Add":" char c[4];"},{"Add":" float f;"},{"Add":" long l;"},{"Add":"} buffer4;"},{"Add":"union {"},{"Add":" char c[2];"},{"Add":" short i;"},{"Add":"} buffer2;"},{"Add":""},{"Add":"FILE *lwo;"},{"Add":"short numpoints, numpolys;"},{"Add":""},{"Add":"long lflip(long x) {"},{"Add":" union {"},{"Add":" char b[4];"},{"Add":" long l;"},{"Add":" } in, out;"},{"Add":""},{"Add":" in.l = x;"},{"Add":" out.b[0] = in.b[3];"},{"Add":" out.b[1] = in.b[2];"},{"Add":" out.b[2] = in.b[1];"},{"Add":" out.b[3] = in.b[0];"},{"Add":""},{"Add":" return out.l;"},{"Add":"}"},{"Add":""},{"Add":"float fflip(float x) {"},{"Add":" union {"},{"Add":" char b[4];"},{"Add":" float l;"},{"Add":" } in, out;"},{"Add":""},{"Add":" in.l = x;"},{"Add":" out.b[0] = in.b[3];"},{"Add":" out.b[1] = in.b[2];"},{"Add":" out.b[2] = in.b[1];"},{"Add":" out.b[3] = in.b[0];"},{"Add":""},{"Add":" return out.l;"},{"Add":"}"},{"Add":""},{"Add":"int sflip(short x) {"},{"Add":" union {"},{"Add":" char b[2];"},{"Add":" short i;"},{"Add":" } in, out;"},{"Add":""},{"Add":" in.i = x;"},{"Add":" out.b[0] = in.b[1];"},{"Add":" out.b[1] = in.b[0];"},{"Add":""},{"Add":" return out.i;"},{"Add":"}"},{"Add":""},{"Add":"void skipchunk() {"},{"Add":" long chunksize;"},{"Add":""},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" counter -= 8;"},{"Add":" chunksize = lflip(buffer4.l);"},{"Add":" fread(trashcan, chunksize, 1, lwo);"},{"Add":" counter -= chunksize;"},{"Add":"};"},{"Add":""},{"Add":"void getpoints() {"},{"Add":" long chunksize;"},{"Add":" short i, j;"},{"Add":""},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" counter -= 8;"},{"Add":" chunksize = lflip(buffer4.l);"},{"Add":" counter -= chunksize;"},{"Add":" numpoints = chunksize / 12;"},{"Add":" if (numpoints > MAXPOINTS) {"},{"Add":" fprintf(stderr, \"reader: Too many points!!!\");"},{"Add":" exit(0);"},{"Add":" }"},{"Add":" for (i = 0; i < numpoints; i++) {"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" pnt[i].p[j] = fflip(buffer4.f);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void getpolys() {"},{"Add":" short temp, i, j;"},{"Add":" short polypoints;"},{"Add":" long chunksize;"},{"Add":""},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" counter -= 8;"},{"Add":" chunksize = lflip(buffer4.l);"},{"Add":" counter -= chunksize;"},{"Add":" numpolys = 0;"},{"Add":" for (i = 0; i < chunksize;) {"},{"Add":" fread(buffer2.c, 2, 1, lwo);"},{"Add":" polypoints = sflip(buffer2.i);"},{"Add":" if (polypoints != 3) {"},{"Add":" fprintf(stderr, \"reader: Not a triangle!!!\");"},{"Add":" exit(0);"},{"Add":" }"},{"Add":" i += 10;"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" fread(buffer2.c, 2, 1, lwo);"},{"Add":" temp = sflip(buffer2.i);"},{"Add":" ply[numpolys].pl[j] = temp;"},{"Add":" }"},{"Add":" fread(buffer2.c, 2, 1, lwo);"},{"Add":" numpolys++;"},{"Add":" if (numpolys > MAXPOLYS) {"},{"Add":" fprintf(stderr, \"reader: Too many polygons!!!\\n\");"},{"Add":" exit(0);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void LoadLWOTriangleList(char *filename, triangle_t **pptri, int32_t *numtriangles) {"},{"Add":" int32_t i, j;"},{"Add":" triangle_t *ptri;"},{"Add":""},{"Add":" if ((lwo = fopen(filename, \"rb\")) == 0) {"},{"Add":" fprintf(stderr, \"reader: could not open file '%s'\\n\", filename);"},{"Add":" exit(0);"},{"Add":" }"},{"Add":""},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" counter = lflip(buffer4.l) - 4;"},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" while (counter > 0) {"},{"Add":" fread(buffer4.c, 4, 1, lwo);"},{"Add":" if (!strncmp(buffer4.c, \"PNTS\", 4)) {"},{"Add":" getpoints();"},{"Add":" } else {"},{"Add":" if (!strncmp(buffer4.c, \"POLS\", 4)) {"},{"Add":" getpolys();"},{"Add":" } else {"},{"Add":" skipchunk();"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" fclose(lwo);"},{"Add":""},{"Add":" ptri = malloc(MAXTRIANGLES * sizeof(triangle_t));"},{"Add":" *pptri = ptri;"},{"Add":""},{"Add":" for (i = 0; i < numpolys; i++) {"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" ptri[i].verts[j][0] = pnt[ply[i].pl[j]].p[0];"},{"Add":" ptri[i].verts[j][1] = pnt[ply[i].pl[j]].p[2];"},{"Add":" ptri[i].verts[j][2] = pnt[ply[i].pl[j]].p[1];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" *numtriangles = numpolys;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"lbmlib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"// lbmlib.c"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"lbmlib.h\""},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":" LBM STUFF"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"typedef uint8_t UBYTE;"},{"Add":"// conflicts with windows typedef short\t\t\tWORD;"},{"Add":"typedef uint16_t UWORD;"},{"Add":"typedef long LONG;"},{"Add":""},{"Add":"typedef enum { ms_none, ms_mask, ms_transcolor, ms_lasso } mask_t;"},{"Add":""},{"Add":"typedef enum { cm_none, cm_rle1 } compress_t;"},{"Add":""},{"Add":"typedef struct {"},{"Add":" UWORD w, h;"},{"Add":" short x, y;"},{"Add":" UBYTE nPlanes;"},{"Add":" UBYTE masking;"},{"Add":" UBYTE compression;"},{"Add":" UBYTE pad1;"},{"Add":" UWORD transparentColor;"},{"Add":" UBYTE xAspect, yAspect;"},{"Add":" short pageWidth, pageHeight;"},{"Add":"} bmhd_t;"},{"Add":""},{"Add":"extern bmhd_t bmhd; // will be in native byte order"},{"Add":""},{"Add":"#define FORMID ('F' + ('O' << 8) + ((int32_t)'R' << 16) + ((int32_t)'M' << 24))"},{"Add":"#define ILBMID ('I' + ('L' << 8) + ((int32_t)'B' << 16) + ((int32_t)'M' << 24))"},{"Add":"#define PBMID ('P' + ('B' << 8) + ((int32_t)'M' << 16) + ((int32_t)' ' << 24))"},{"Add":"#define BMHDID ('B' + ('M' << 8) + ((int32_t)'H' << 16) + ((int32_t)'D' << 24))"},{"Add":"#define BODYID ('B' + ('O' << 8) + ((int32_t)'D' << 16) + ((int32_t)'Y' << 24))"},{"Add":"#define CMAPID ('C' + ('M' << 8) + ((int32_t)'A' << 16) + ((int32_t)'P' << 24))"},{"Add":""},{"Add":"bmhd_t bmhd;"},{"Add":""},{"Add":"int32_t Align(int32_t l) {"},{"Add":" if(l & 1)"},{"Add":" return l + 1;"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"LBMRLEdecompress"},{"Add":""},{"Add":"Source must be evenly aligned!"},{"Add":"================"},{"Add":"*/"},{"Add":"byte *LBMRLEDecompress(byte *source, byte *unpacked, int32_t bpwidth) {"},{"Add":" int32_t count;"},{"Add":" byte b, rept;"},{"Add":""},{"Add":" count = 0;"},{"Add":""},{"Add":" do {"},{"Add":" rept = *source++;"},{"Add":""},{"Add":" if(rept > 0x80) {"},{"Add":" rept = (rept ^ 0xff) + 2;"},{"Add":" b = *source++;"},{"Add":" memset(unpacked, b, rept);"},{"Add":" unpacked += rept;"},{"Add":" } else if(rept < 0x80) {"},{"Add":" rept++;"},{"Add":" memcpy(unpacked, source, rept);"},{"Add":" unpacked += rept;"},{"Add":" source += rept;"},{"Add":" } else"},{"Add":" rept = 0; // rept of 0x80 is NOP"},{"Add":""},{"Add":" count += rept;"},{"Add":""},{"Add":" } while(count < bpwidth);"},{"Add":""},{"Add":" if(count > bpwidth)"},{"Add":" Error(\"Decompression exceeded width!\\n\");"},{"Add":""},{"Add":" return source;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"LoadLBM"},{"Add":"================="},{"Add":"*/"},{"Add":"void LoadLBM(char *filename, byte **picture, byte **palette) {"},{"Add":" byte *LBMbuffer, *picbuffer, *cmapbuffer;"},{"Add":" int32_t y;"},{"Add":" byte *LBM_P, *LBMEND_P;"},{"Add":" byte *pic_p;"},{"Add":" byte *body_p;"},{"Add":""},{"Add":" int32_t formtype, formlength;"},{"Add":" int32_t chunktype, chunklength;"},{"Add":""},{"Add":" // qiet compiler warnings"},{"Add":" picbuffer = NULL;"},{"Add":" cmapbuffer = NULL;"},{"Add":""},{"Add":" //"},{"Add":" // load the LBM"},{"Add":" //"},{"Add":" LoadFile(filename, (void **)&LBMbuffer);"},{"Add":""},{"Add":" //"},{"Add":" // parse the LBM header"},{"Add":" //"},{"Add":" LBM_P = LBMbuffer;"},{"Add":" if(*(int32_t *)LBMbuffer != LittleLong(FORMID))"},{"Add":" Error(\"No FORM ID at start of file!\\n\");"},{"Add":""},{"Add":" LBM_P += 4;"},{"Add":" formlength = BigLong(*(int32_t *)LBM_P);"},{"Add":" LBM_P += 4;"},{"Add":" LBMEND_P = LBM_P + Align(formlength);"},{"Add":""},{"Add":" formtype = LittleLong(*(int32_t *)LBM_P);"},{"Add":""},{"Add":" if(formtype != ILBMID && formtype != PBMID)"},{"Add":" Error(\"Unrecognized form type: %c%c%c%c\\n\", formtype & 0xff, (formtype >> 8) & 0xff, (formtype >> 16) & 0xff,"},{"Add":" (formtype >> 24) & 0xff);"},{"Add":""},{"Add":" LBM_P += 4;"},{"Add":""},{"Add":" //"},{"Add":" // parse chunks"},{"Add":" //"},{"Add":""},{"Add":" while(LBM_P < LBMEND_P) {"},{"Add":" chunktype = LBM_P[0] + (LBM_P[1] << 8) + (LBM_P[2] << 16) + (LBM_P[3] << 24);"},{"Add":" LBM_P += 4;"},{"Add":" chunklength = LBM_P[3] + (LBM_P[2] << 8) + (LBM_P[1] << 16) + (LBM_P[0] << 24);"},{"Add":" LBM_P += 4;"},{"Add":""},{"Add":" switch(chunktype) {"},{"Add":" case BMHDID:"},{"Add":" memcpy(&bmhd, LBM_P, sizeof(bmhd));"},{"Add":" bmhd.w = BigShort(bmhd.w);"},{"Add":" bmhd.h = BigShort(bmhd.h);"},{"Add":" bmhd.x = BigShort(bmhd.x);"},{"Add":" bmhd.y = BigShort(bmhd.y);"},{"Add":" bmhd.pageWidth = BigShort(bmhd.pageWidth);"},{"Add":" bmhd.pageHeight = BigShort(bmhd.pageHeight);"},{"Add":" break;"},{"Add":""},{"Add":" case CMAPID:"},{"Add":" cmapbuffer = malloc(768);"},{"Add":" memset(cmapbuffer, 0, 768);"},{"Add":" memcpy(cmapbuffer, LBM_P, chunklength);"},{"Add":" break;"},{"Add":""},{"Add":" case BODYID:"},{"Add":" body_p = LBM_P;"},{"Add":""},{"Add":" pic_p = picbuffer = malloc(bmhd.w * bmhd.h);"},{"Add":" if(formtype == PBMID) {"},{"Add":" //"},{"Add":" // unpack PBM"},{"Add":" //"},{"Add":" for(y = 0; y < bmhd.h; y++, pic_p += bmhd.w) {"},{"Add":" if(bmhd.compression == cm_rle1)"},{"Add":" body_p = LBMRLEDecompress((byte *)body_p, pic_p, bmhd.w);"},{"Add":" else if(bmhd.compression == cm_none) {"},{"Add":" memcpy(pic_p, body_p, bmhd.w);"},{"Add":" body_p += Align(bmhd.w);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" } else {"},{"Add":" //"},{"Add":" // unpack ILBM"},{"Add":" //"},{"Add":" Error(\"%s is an interlaced LBM, not packed\", filename);"},{"Add":" }"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" LBM_P += Align(chunklength);"},{"Add":" }"},{"Add":""},{"Add":" free(LBMbuffer);"},{"Add":""},{"Add":" *picture = picbuffer;"},{"Add":""},{"Add":" if(palette)"},{"Add":" *palette = cmapbuffer;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":" WRITE LBM"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"WriteLBMfile"},{"Add":"=============="},{"Add":"*/"},{"Add":"void WriteLBMfile(char *filename, byte *data, int32_t width, int32_t height, byte *palette) {"},{"Add":" byte *lbm, *lbmptr;"},{"Add":" int32_t *formlength, *bmhdlength, *cmaplength, *bodylength;"},{"Add":" int32_t length;"},{"Add":" bmhd_t basebmhd;"},{"Add":""},{"Add":" lbm = lbmptr = malloc(width * height + 1000);"},{"Add":" if(!lbm)"},{"Add":" return; // qb: NULL if width or height is zero."},{"Add":""},{"Add":" //"},{"Add":" // start FORM"},{"Add":" //"},{"Add":" *lbmptr++ = 'F';"},{"Add":" *lbmptr++ = 'O';"},{"Add":" *lbmptr++ = 'R';"},{"Add":" *lbmptr++ = 'M';"},{"Add":""},{"Add":" formlength = (int32_t *)lbmptr;"},{"Add":" lbmptr += 4; // leave space for length"},{"Add":""},{"Add":" *lbmptr++ = 'P';"},{"Add":" *lbmptr++ = 'B';"},{"Add":" *lbmptr++ = 'M';"},{"Add":" *lbmptr++ = ' ';"},{"Add":""},{"Add":" //"},{"Add":" // write BMHD"},{"Add":" //"},{"Add":" *lbmptr++ = 'B';"},{"Add":" *lbmptr++ = 'M';"},{"Add":" *lbmptr++ = 'H';"},{"Add":" *lbmptr++ = 'D';"},{"Add":""},{"Add":" bmhdlength = (int32_t *)lbmptr;"},{"Add":" lbmptr += 4; // leave space for length"},{"Add":""},{"Add":" memset(&basebmhd, 0, sizeof(basebmhd));"},{"Add":" basebmhd.w = BigShort((short)width);"},{"Add":" basebmhd.h = BigShort((short)height);"},{"Add":" basebmhd.nPlanes = BigShort(8);"},{"Add":" basebmhd.xAspect = BigShort(5);"},{"Add":" basebmhd.yAspect = BigShort(6);"},{"Add":" basebmhd.pageWidth = BigShort((short)width);"},{"Add":" basebmhd.pageHeight = BigShort((short)height);"},{"Add":""},{"Add":" memcpy(lbmptr, &basebmhd, sizeof(basebmhd));"},{"Add":" lbmptr += sizeof(basebmhd);"},{"Add":""},{"Add":" length = lbmptr - (byte *)bmhdlength - 4;"},{"Add":" *bmhdlength = BigLong(length);"},{"Add":" if(length & 1)"},{"Add":" *lbmptr++ = 0; // pad chunk to even offset"},{"Add":""},{"Add":" //"},{"Add":" // write CMAP"},{"Add":" //"},{"Add":" *lbmptr++ = 'C';"},{"Add":" *lbmptr++ = 'M';"},{"Add":" *lbmptr++ = 'A';"},{"Add":" *lbmptr++ = 'P';"},{"Add":""},{"Add":" cmaplength = (int32_t *)lbmptr;"},{"Add":" lbmptr += 4; // leave space for length"},{"Add":""},{"Add":" memcpy(lbmptr, palette, 768);"},{"Add":" lbmptr += 768;"},{"Add":""},{"Add":" length = lbmptr - (byte *)cmaplength - 4;"},{"Add":" *cmaplength = BigLong(length);"},{"Add":" if(length & 1)"},{"Add":" *lbmptr++ = 0; // pad chunk to even offset"},{"Add":""},{"Add":" //"},{"Add":" // write BODY"},{"Add":" //"},{"Add":" *lbmptr++ = 'B';"},{"Add":" *lbmptr++ = 'O';"},{"Add":" *lbmptr++ = 'D';"},{"Add":" *lbmptr++ = 'Y';"},{"Add":""},{"Add":" bodylength = (int32_t *)lbmptr;"},{"Add":" lbmptr += 4; // leave space for length"},{"Add":""},{"Add":" memcpy(lbmptr, data, width * height);"},{"Add":" lbmptr += width * height;"},{"Add":""},{"Add":" length = lbmptr - (byte *)bodylength - 4;"},{"Add":" *bodylength = BigLong(length);"},{"Add":" if(length & 1)"},{"Add":" *lbmptr++ = 0; // pad chunk to even offset"},{"Add":""},{"Add":" //"},{"Add":" // done"},{"Add":" //"},{"Add":" length = lbmptr - (byte *)formlength - 4;"},{"Add":" *formlength = BigLong(length);"},{"Add":" if(length & 1)"},{"Add":" *lbmptr++ = 0; // pad chunk to even offset"},{"Add":""},{"Add":" //"},{"Add":" // write output file"},{"Add":" //"},{"Add":" SaveFile(filename, lbm, lbmptr - lbm);"},{"Add":" free(lbm);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":"LOAD PCX"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"typedef struct {"},{"Add":" char manufacturer;"},{"Add":" char version;"},{"Add":" char encoding;"},{"Add":" char bits_per_pixel;"},{"Add":" uint16_t xmin, ymin, xmax, ymax;"},{"Add":" uint16_t hres, vres;"},{"Add":" uint8_t palette[48];"},{"Add":" char reserved;"},{"Add":" char color_planes;"},{"Add":" uint16_t bytes_per_line;"},{"Add":" uint16_t palette_type;"},{"Add":" char filler[58];"},{"Add":" uint8_t data; // unbounded"},{"Add":"} pcx_t;"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"LoadPCX"},{"Add":"=============="},{"Add":"*/"},{"Add":"void LoadPCX(char *filename, byte **pic, byte **palette, int32_t *width, int32_t *height) {"},{"Add":" byte *raw;"},{"Add":" pcx_t *pcx;"},{"Add":" int32_t x, y;"},{"Add":" int32_t len;"},{"Add":" int32_t dataByte, runLength;"},{"Add":" byte *out, *pix;"},{"Add":""},{"Add":" //"},{"Add":" // load the file"},{"Add":" //"},{"Add":" len = LoadFile(filename, (void **)&raw);"},{"Add":""},{"Add":" //"},{"Add":" // parse the PCX file"},{"Add":" //"},{"Add":" pcx = (pcx_t *)raw;"},{"Add":" raw = &pcx->data;"},{"Add":""},{"Add":" pcx->xmin = LittleShort(pcx->xmin);"},{"Add":" pcx->ymin = LittleShort(pcx->ymin);"},{"Add":" pcx->xmax = LittleShort(pcx->xmax);"},{"Add":" pcx->ymax = LittleShort(pcx->ymax);"},{"Add":" pcx->hres = LittleShort(pcx->hres);"},{"Add":" pcx->vres = LittleShort(pcx->vres);"},{"Add":" pcx->bytes_per_line = LittleShort(pcx->bytes_per_line);"},{"Add":" pcx->palette_type = LittleShort(pcx->palette_type);"},{"Add":""},{"Add":" if(pcx->manufacturer != 0x0a || pcx->version != 5 || pcx->encoding != 1 || pcx->bits_per_pixel != 8 ||"},{"Add":" pcx->xmax >= 640 || pcx->ymax >= 480)"},{"Add":" Error(\"Bad pcx file %s\", filename);"},{"Add":""},{"Add":" if(palette) {"},{"Add":" *palette = malloc(768);"},{"Add":" memcpy(*palette, (byte *)pcx + len - 768, 768);"},{"Add":" }"},{"Add":""},{"Add":" if(width)"},{"Add":" *width = pcx->xmax + 1;"},{"Add":" if(height)"},{"Add":" *height = pcx->ymax + 1;"},{"Add":""},{"Add":" if(!pic)"},{"Add":" return;"},{"Add":""},{"Add":" out = malloc((pcx->ymax + 1) * (pcx->xmax + 1));"},{"Add":" if(!out)"},{"Add":" Error(\"Skin_Cache: couldn't allocate\");"},{"Add":""},{"Add":" *pic = out;"},{"Add":""},{"Add":" pix = out;"},{"Add":""},{"Add":" for(y = 0; y <= pcx->ymax; y++, pix += pcx->xmax + 1) {"},{"Add":" for(x = 0; x <= pcx->xmax;) {"},{"Add":" dataByte = *raw++;"},{"Add":""},{"Add":" if((dataByte & 0xC0) == 0xC0) {"},{"Add":" runLength = dataByte & 0x3F;"},{"Add":" dataByte = *raw++;"},{"Add":" } else"},{"Add":" runLength = 1;"},{"Add":""},{"Add":" while(runLength-- > 0)"},{"Add":" pix[x++] = dataByte;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if(raw - (byte *)pcx > len)"},{"Add":" Error(\"PCX file %s was malformed\", filename);"},{"Add":""},{"Add":" free(pcx);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"WritePCXfile"},{"Add":"=============="},{"Add":"*/"},{"Add":"void WritePCXfile(char *filename, byte *data, int32_t width, int32_t height, byte *palette) {"},{"Add":" int32_t i, j, length;"},{"Add":" pcx_t *pcx;"},{"Add":" byte *pack;"},{"Add":""},{"Add":" pcx = malloc(width * height * 2 + 1000);"},{"Add":" memset(pcx, 0, sizeof(*pcx));"},{"Add":""},{"Add":" pcx->manufacturer = 0x0a; // PCX id"},{"Add":" pcx->version = 5; // 256 color"},{"Add":" pcx->encoding = 1; // uncompressed"},{"Add":" pcx->bits_per_pixel = 8; // 256 color"},{"Add":" pcx->xmin = 0;"},{"Add":" pcx->ymin = 0;"},{"Add":" pcx->xmax = LittleShort((short)(width - 1));"},{"Add":" pcx->ymax = LittleShort((short)(height - 1));"},{"Add":" pcx->hres = LittleShort((short)width);"},{"Add":" pcx->vres = LittleShort((short)height);"},{"Add":" pcx->color_planes = 1; // chunky image"},{"Add":" pcx->bytes_per_line = LittleShort((short)width);"},{"Add":" pcx->palette_type = LittleShort(2); // not a grey scale"},{"Add":""},{"Add":" // pack the image"},{"Add":" pack = &pcx->data;"},{"Add":""},{"Add":" for(i = 0; i < height; i++) {"},{"Add":" for(j = 0; j < width; j++) {"},{"Add":" if((*data & 0xc0) != 0xc0)"},{"Add":" *pack++ = *data++;"},{"Add":" else {"},{"Add":" *pack++ = 0xc1;"},{"Add":" *pack++ = *data++;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // write the palette"},{"Add":" *pack++ = 0x0c; // palette ID byte"},{"Add":" for(i = 0; i < 768; i++)"},{"Add":" *pack++ = *palette++;"},{"Add":""},{"Add":" // write output file"},{"Add":" length = pack - (byte *)pcx;"},{"Add":" SaveFile(filename, pcx, length);"},{"Add":""},{"Add":" free(pcx);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":"LOAD IMAGE"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"Load256Image"},{"Add":""},{"Add":"Will load either an lbm or pcx, depending on extension."},{"Add":"Any of the return pointers can be NULL if you don't want them."},{"Add":"=============="},{"Add":"*/"},{"Add":"void Load256Image(char *name, byte **pixels, byte **palette, int32_t *width, int32_t *height) {"},{"Add":" char ext[128];"},{"Add":""},{"Add":" ExtractFileExtension(name, ext);"},{"Add":" if(!Q_strcasecmp(ext, \"lbm\")) {"},{"Add":" LoadLBM(name, pixels, palette);"},{"Add":" if(width)"},{"Add":" *width = bmhd.w;"},{"Add":" if(height)"},{"Add":" *height = bmhd.h;"},{"Add":" } else if(!Q_strcasecmp(ext, \"pcx\")) {"},{"Add":" LoadPCX(name, pixels, palette, width, height);"},{"Add":" } else"},{"Add":" Error(\"%s doesn't have a known image extension\", name);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"Save256Image"},{"Add":""},{"Add":"Will save either an lbm or pcx, depending on extension."},{"Add":"=============="},{"Add":"*/"},{"Add":"void Save256Image(char *name, byte *pixels, byte *palette, int32_t width, int32_t height) {"},{"Add":" char ext[128];"},{"Add":""},{"Add":" ExtractFileExtension(name, ext);"},{"Add":" if(!Q_strcasecmp(ext, \"lbm\")) {"},{"Add":" WriteLBMfile(name, pixels, width, height, palette);"},{"Add":" } else if(!Q_strcasecmp(ext, \"pcx\")) {"},{"Add":" WritePCXfile(name, pixels, width, height, palette);"},{"Add":" } else"},{"Add":" Error(\"%s doesn't have a known image extension\", name);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":"TARGA IMAGE"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"typedef struct _TargaHeader {"},{"Add":" uint8_t id_length, colormap_type, image_type;"},{"Add":" uint16_t colormap_index, colormap_length;"},{"Add":" uint8_t colormap_size;"},{"Add":" uint16_t x_origin, y_origin, width, height;"},{"Add":" uint8_t pixel_size, attributes;"},{"Add":"} TargaHeader;"},{"Add":""},{"Add":"int32_t fgetLittleShort(FILE *f) {"},{"Add":" byte b1, b2;"},{"Add":""},{"Add":" b1 = fgetc(f);"},{"Add":" b2 = fgetc(f);"},{"Add":""},{"Add":" return (short)(b1 + b2 * 256);"},{"Add":"}"},{"Add":""},{"Add":"int32_t fgetLittleLong(FILE *f) {"},{"Add":" byte b1, b2, b3, b4;"},{"Add":""},{"Add":" b1 = fgetc(f);"},{"Add":" b2 = fgetc(f);"},{"Add":" b3 = fgetc(f);"},{"Add":" b4 = fgetc(f);"},{"Add":""},{"Add":" return b1 + (b2 << 8) + (b3 << 16) + (b4 << 24);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"LoadTGA"},{"Add":"============="},{"Add":"*/"},{"Add":"void LoadTGA(char *name, byte **pixels, int32_t *width, int32_t *height) {"},{"Add":" int32_t columns, rows, numPixels;"},{"Add":" byte *pixbuf;"},{"Add":" int32_t row, column;"},{"Add":" FILE *fin;"},{"Add":" byte *targa_rgba;"},{"Add":" TargaHeader targa_header;"},{"Add":""},{"Add":" fin = fopen(name, \"rb\");"},{"Add":" if(!fin)"},{"Add":" Error(\"Couldn't read %s\", name);"},{"Add":""},{"Add":" targa_header.id_length = fgetc(fin);"},{"Add":" targa_header.colormap_type = fgetc(fin);"},{"Add":" targa_header.image_type = fgetc(fin);"},{"Add":""},{"Add":" targa_header.colormap_index = fgetLittleShort(fin);"},{"Add":" targa_header.colormap_length = fgetLittleShort(fin);"},{"Add":" targa_header.colormap_size = fgetc(fin);"},{"Add":" targa_header.x_origin = fgetLittleShort(fin);"},{"Add":" targa_header.y_origin = fgetLittleShort(fin);"},{"Add":" targa_header.width = fgetLittleShort(fin);"},{"Add":" targa_header.height = fgetLittleShort(fin);"},{"Add":" targa_header.pixel_size = fgetc(fin);"},{"Add":" targa_header.attributes = fgetc(fin);"},{"Add":""},{"Add":" if(targa_header.image_type != 2 && targa_header.image_type != 10)"},{"Add":" Error(\"LoadTGA %s: Only type 2 and 10 targa RGB images supported\\n\", name);"},{"Add":""},{"Add":" if(targa_header.colormap_type != 0 || (targa_header.pixel_size != 32 && targa_header.pixel_size != 24))"},{"Add":" Error(\"LoadTGA %s: Only 32 or 24 bit images supported (no colormaps)\\n\", name);"},{"Add":""},{"Add":" columns = targa_header.width;"},{"Add":" rows = targa_header.height;"},{"Add":" numPixels = columns * rows;"},{"Add":""},{"Add":" if(width)"},{"Add":" *width = columns;"},{"Add":" if(height)"},{"Add":" *height = rows;"},{"Add":" targa_rgba = malloc(numPixels * 4);"},{"Add":" *pixels = targa_rgba;"},{"Add":""},{"Add":" if(targa_header.id_length != 0)"},{"Add":" fseek(fin, targa_header.id_length, SEEK_CUR); // skip TARGA image comment"},{"Add":""},{"Add":" if(targa_header.image_type == 2) { // Uncompressed, RGB images"},{"Add":" for(row = rows - 1; row >= 0; row--) {"},{"Add":" pixbuf = targa_rgba + row * columns * 4;"},{"Add":" for(column = 0; column < columns; column++) {"},{"Add":" uint8_t red, green, blue, alphabyte;"},{"Add":" switch(targa_header.pixel_size) {"},{"Add":" case 24:"},{"Add":""},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" *pixbuf++ = red;"},{"Add":" *pixbuf++ = green;"},{"Add":" *pixbuf++ = blue;"},{"Add":" *pixbuf++ = 255;"},{"Add":" break;"},{"Add":" case 32:"},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" alphabyte = getc(fin);"},{"Add":" *pixbuf++ = red;"},{"Add":" *pixbuf++ = green;"},{"Add":" *pixbuf++ = blue;"},{"Add":" *pixbuf++ = alphabyte;"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" } else if(targa_header.image_type == 10) { // Runlength encoded RGB images"},{"Add":" // qb: set defaults. from AAtools"},{"Add":" uint8_t red = 255, green = 255, blue = 255, alphabyte = 255, packetHeader, packetSize, j;"},{"Add":" for(row = rows - 1; row >= 0; row--) {"},{"Add":" pixbuf = targa_rgba + row * columns * 4;"},{"Add":" for(column = 0; column < columns;) {"},{"Add":" packetHeader = getc(fin);"},{"Add":" packetSize = 1 + (packetHeader & 0x7f);"},{"Add":" if(packetHeader & 0x80) { // run-length packet"},{"Add":" switch(targa_header.pixel_size) {"},{"Add":" case 24:"},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" alphabyte = 255;"},{"Add":" break;"},{"Add":" case 32:"},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" alphabyte = getc(fin);"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" for(j = 0; j < packetSize; j++) {"},{"Add":" *pixbuf++ = red;"},{"Add":" *pixbuf++ = green;"},{"Add":" *pixbuf++ = blue;"},{"Add":" *pixbuf++ = alphabyte;"},{"Add":" column++;"},{"Add":" if(column == columns) { // run spans across rows"},{"Add":" column = 0;"},{"Add":" if(row > 0)"},{"Add":" row--;"},{"Add":" else"},{"Add":" goto breakOut;"},{"Add":" pixbuf = targa_rgba + row * columns * 4;"},{"Add":" }"},{"Add":" }"},{"Add":" } else { // non run-length packet"},{"Add":" for(j = 0; j < packetSize; j++) {"},{"Add":" switch(targa_header.pixel_size) {"},{"Add":" case 24:"},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" *pixbuf++ = red;"},{"Add":" *pixbuf++ = green;"},{"Add":" *pixbuf++ = blue;"},{"Add":" *pixbuf++ = 255;"},{"Add":" break;"},{"Add":" case 32:"},{"Add":" blue = getc(fin);"},{"Add":" green = getc(fin);"},{"Add":" red = getc(fin);"},{"Add":" alphabyte = getc(fin);"},{"Add":" *pixbuf++ = red;"},{"Add":" *pixbuf++ = green;"},{"Add":" *pixbuf++ = blue;"},{"Add":" *pixbuf++ = alphabyte;"},{"Add":" break;"},{"Add":" }"},{"Add":" column++;"},{"Add":" if(column == columns) { // pixel packet run spans across rows"},{"Add":" column = 0;"},{"Add":" if(row > 0)"},{"Add":" row--;"},{"Add":" else"},{"Add":" goto breakOut;"},{"Add":" pixbuf = targa_rgba + row * columns * 4;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" breakOut:;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" fclose(fin);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"l3dslib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"//"},{"Add":"// l3dslib.c: library for loading triangles from an Alias triangle file"},{"Add":"//"},{"Add":""},{"Add":"#include "},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":"#include \"4data.h\""},{"Add":""},{"Add":"#define MAIN3DS 0x4D4D"},{"Add":"#define EDIT3DS 0x3D3D // this is the start of the editor config"},{"Add":"#define EDIT_OBJECT 0x4000"},{"Add":"#define OBJ_TRIMESH 0x4100"},{"Add":"#define TRI_VERTEXL 0x4110"},{"Add":"#define TRI_FACEL1 0x4120"},{"Add":""},{"Add":"#define MAXVERTS 2000"},{"Add":""},{"Add":"typedef struct {"},{"Add":" int32_t v[4];"},{"Add":"} tri;"},{"Add":""},{"Add":"float fverts[MAXVERTS][3];"},{"Add":"tri tris[MAXTRIANGLES];"},{"Add":""},{"Add":"int32_t bytesread, level, numtris, totaltris;"},{"Add":"int32_t vertsfound, trisfound;"},{"Add":""},{"Add":"triangle_t *ptri;"},{"Add":""},{"Add":"// Alias stores triangles as 3 explicit vertices in .tri files, so even though we"},{"Add":"// start out with a vertex pool and vertex indices for triangles, we have to convert"},{"Add":"// to raw, explicit triangles"},{"Add":"void StoreAliasTriangles(void) {"},{"Add":" int32_t i, j, k;"},{"Add":""},{"Add":" if ((totaltris + numtris) > MAXTRIANGLES)"},{"Add":" Error(\"Error: Too many triangles\");"},{"Add":""},{"Add":" for (i = 0; i < numtris; i++) {"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" for (k = 0; k < 3; k++) {"},{"Add":" ptri[i + totaltris].verts[j][k] = fverts[tris[i].v[j]][k];"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" totaltris += numtris;"},{"Add":" numtris = 0;"},{"Add":" vertsfound = 0;"},{"Add":" trisfound = 0;"},{"Add":"}"},{"Add":""},{"Add":"int32_t ParseVertexL(FILE *input) {"},{"Add":" int32_t i, j, startbytesread, numverts;"},{"Add":" uint16_t tshort;"},{"Add":""},{"Add":" if (vertsfound)"},{"Add":" Error(\"Error: Multiple vertex chunks\");"},{"Add":""},{"Add":" vertsfound = 1;"},{"Add":" startbytesread = bytesread;"},{"Add":""},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&tshort, sizeof(tshort), 1, input);"},{"Add":" bytesread += sizeof(tshort);"},{"Add":" numverts = (int32_t)tshort;"},{"Add":""},{"Add":" if (numverts > MAXVERTS)"},{"Add":" Error(\"Error: Too many vertices\");"},{"Add":""},{"Add":" for (i = 0; i < numverts; i++) {"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&fverts[i][j], sizeof(float), 1, input);"},{"Add":" bytesread += sizeof(float);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (vertsfound && trisfound)"},{"Add":" StoreAliasTriangles();"},{"Add":""},{"Add":" return bytesread - startbytesread;"},{"Add":"}"},{"Add":""},{"Add":"int32_t ParseFaceL1(FILE *input) {"},{"Add":""},{"Add":" int32_t i, j, startbytesread;"},{"Add":" uint16_t tshort;"},{"Add":""},{"Add":" if (trisfound)"},{"Add":" Error(\"Error: Multiple face chunks\");"},{"Add":""},{"Add":" trisfound = 1;"},{"Add":" startbytesread = bytesread;"},{"Add":""},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&tshort, sizeof(tshort), 1, input);"},{"Add":" bytesread += sizeof(tshort);"},{"Add":" numtris = (int32_t)tshort;"},{"Add":""},{"Add":" if (numtris > MAXTRIANGLES)"},{"Add":" Error(\"Error: Too many triangles\");"},{"Add":""},{"Add":" for (i = 0; i < numtris; i++) {"},{"Add":" for (j = 0; j < 4; j++) {"},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&tshort, sizeof(tshort), 1, input);"},{"Add":" bytesread += sizeof(tshort);"},{"Add":" tris[i].v[j] = (int32_t)tshort;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (vertsfound && trisfound)"},{"Add":" StoreAliasTriangles();"},{"Add":""},{"Add":" return bytesread - startbytesread;"},{"Add":"}"},{"Add":""},{"Add":"int32_t ParseChunk(FILE *input) {"},{"Add":"#define CHUNK_SIZE 4096"},{"Add":" char temp[CHUNK_SIZE];"},{"Add":" uint16_t type;"},{"Add":" int32_t i, length, w, t, retval;"},{"Add":""},{"Add":" level++;"},{"Add":" retval = 0;"},{"Add":""},{"Add":" // chunk type"},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&type, sizeof(type), 1, input);"},{"Add":" bytesread += sizeof(type);"},{"Add":""},{"Add":" // chunk length"},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&length, sizeof(length), 1, input);"},{"Add":" bytesread += sizeof(length);"},{"Add":" w = length - 6;"},{"Add":""},{"Add":" // process chunk if we care about it, otherwise skip it"},{"Add":" switch (type) {"},{"Add":" case TRI_VERTEXL:"},{"Add":" w -= ParseVertexL(input);"},{"Add":" goto ParseSubchunk;"},{"Add":""},{"Add":" case TRI_FACEL1:"},{"Add":" w -= ParseFaceL1(input);"},{"Add":" goto ParseSubchunk;"},{"Add":""},{"Add":" case EDIT_OBJECT:"},{"Add":" // read the name"},{"Add":" i = 0;"},{"Add":""},{"Add":" do {"},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&temp[i], 1, 1, input);"},{"Add":" i++;"},{"Add":" w--;"},{"Add":" bytesread++;"},{"Add":" } while (temp[i - 1]);"},{"Add":""},{"Add":" case MAIN3DS:"},{"Add":" case OBJ_TRIMESH:"},{"Add":" case EDIT3DS:"},{"Add":" // parse through subchunks"},{"Add":" ParseSubchunk:"},{"Add":" while (w > 0) {"},{"Add":" w -= ParseChunk(input);"},{"Add":" }"},{"Add":""},{"Add":" retval = length;"},{"Add":" goto Done;"},{"Add":""},{"Add":" default:"},{"Add":" // skip other chunks"},{"Add":" while (w > 0) {"},{"Add":" t = w;"},{"Add":""},{"Add":" if (t > CHUNK_SIZE)"},{"Add":" t = CHUNK_SIZE;"},{"Add":""},{"Add":" if (feof(input))"},{"Add":" Error(\"Error: unexpected end of file\");"},{"Add":""},{"Add":" fread(&temp, t, 1, input);"},{"Add":" bytesread += t;"},{"Add":""},{"Add":" w -= t;"},{"Add":" }"},{"Add":""},{"Add":" retval = length;"},{"Add":" goto Done;"},{"Add":" }"},{"Add":""},{"Add":"Done:"},{"Add":" level--;"},{"Add":" return retval;"},{"Add":"}"},{"Add":""},{"Add":"void Load3DSTriangleList(char *filename, triangle_t **pptri, int32_t *numtriangles) {"},{"Add":" FILE *input;"},{"Add":" int16_t tshort;"},{"Add":""},{"Add":" bytesread = 0;"},{"Add":" level = 0;"},{"Add":" numtris = 0;"},{"Add":" totaltris = 0;"},{"Add":" vertsfound = 0;"},{"Add":" trisfound = 0;"},{"Add":""},{"Add":" if ((input = fopen(filename, \"rb\")) == 0) {"},{"Add":" fprintf(stderr, \"reader: could not open file '%s'\\n\", filename);"},{"Add":" exit(0);"},{"Add":" }"},{"Add":""},{"Add":" fread(&tshort, sizeof(tshort), 1, input);"},{"Add":""},{"Add":" // should only be MAIN3DS, but some files seem to start with EDIT3DS, with"},{"Add":" // no MAIN3DS"},{"Add":" if ((tshort != MAIN3DS) && (tshort != EDIT3DS)) {"},{"Add":" fprintf(stderr, \"File is not a 3DS file.\\n\");"},{"Add":" exit(0);"},{"Add":" }"},{"Add":""},{"Add":" // back to top of file so we can parse the first chunk descriptor"},{"Add":" fseek(input, 0, SEEK_SET);"},{"Add":""},{"Add":" ptri = malloc(MAXTRIANGLES * sizeof(triangle_t));"},{"Add":""},{"Add":" *pptri = ptri;"},{"Add":""},{"Add":" // parse through looking for the relevant chunk tree (MAIN3DS | EDIT3DS | EDIT_OBJECT |"},{"Add":" // OBJ_TRIMESH | {TRI_VERTEXL, TRI_FACEL1}) and skipping other chunks"},{"Add":" ParseChunk(input);"},{"Add":""},{"Add":" if (vertsfound || trisfound)"},{"Add":" Error(\"Incomplete triangle set\");"},{"Add":""},{"Add":" *numtriangles = totaltris;"},{"Add":""},{"Add":" fclose(input);"},{"Add":" free(ptri); // qb: stop mem leak"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"cmdlib.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"// cmdlib.c"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include "},{"Add":"#include "},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":"#include "},{"Add":"#endif"},{"Add":""},{"Add":"#ifdef NeXT"},{"Add":"#include "},{"Add":"#endif"},{"Add":""},{"Add":"#ifdef __unix__"},{"Add":"#include "},{"Add":"#endif"},{"Add":"#define PATHSEPERATOR '/'"},{"Add":""},{"Add":"// set these before calling CheckParm"},{"Add":"int32_t myargc;"},{"Add":"char **myargv;"},{"Add":""},{"Add":"char com_token[1024];"},{"Add":"qboolean com_eof;"},{"Add":""},{"Add":"qboolean archive;"},{"Add":"char archivedir[1024];"},{"Add":""},{"Add":"char inbase[32];"},{"Add":"char outbase[32];"},{"Add":"char source[1024];"},{"Add":""},{"Add":"/*"},{"Add":"==================="},{"Add":"ExpandWildcards"},{"Add":""},{"Add":"Mimic unix command line expansion"},{"Add":"==================="},{"Add":"*/"},{"Add":"#define MAX_EX_ARGC 1024"},{"Add":"int32_t ex_argc;"},{"Add":"char *ex_argv[MAX_EX_ARGC];"},{"Add":"#ifdef _WIN32"},{"Add":"#include \"io.h\""},{"Add":"void ExpandWildcards(int32_t *argc, char ***argv) {"},{"Add":" struct _finddata_t fileinfo;"},{"Add":" int32_t handle;"},{"Add":" int32_t i;"},{"Add":" char filename[1024];"},{"Add":" char filebase[1024];"},{"Add":" char *path;"},{"Add":""},{"Add":" ex_argc = 0;"},{"Add":" for (i = 0; i < *argc; i++) {"},{"Add":" path = (*argv)[i];"},{"Add":" if (path[0] == '-' || (!strstr(path, \"*\") && !strstr(path, \"?\"))) {"},{"Add":" ex_argv[ex_argc++] = path;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" handle = _findfirst(path, &fileinfo);"},{"Add":" if (handle == -1)"},{"Add":" return;"},{"Add":""},{"Add":" ExtractFilePath(path, filebase);"},{"Add":""},{"Add":" do {"},{"Add":" sprintf(filename, \"%s%s\", filebase, fileinfo.name);"},{"Add":" ex_argv[ex_argc++] = copystring(filename);"},{"Add":" } while (_findnext(handle, &fileinfo) != -1);"},{"Add":""},{"Add":" _findclose(handle);"},{"Add":" }"},{"Add":""},{"Add":" *argc = ex_argc;"},{"Add":" *argv = ex_argv;"},{"Add":"}"},{"Add":"#else"},{"Add":"void ExpandWildcards(int32_t *argc, char ***argv) {"},{"Add":"}"},{"Add":"#endif"},{"Add":""},{"Add":"#ifdef WIN_ERROR"},{"Add":"#include "},{"Add":"/*"},{"Add":"================="},{"Add":"Error"},{"Add":""},{"Add":"For abnormal program terminations in windowed apps"},{"Add":"================="},{"Add":"*/"},{"Add":"void Error(char *error, ...) {"},{"Add":" va_list argptr;"},{"Add":" char text[1024];"},{"Add":" char text2[1024];"},{"Add":" int32_t err;"},{"Add":""},{"Add":" err = GetLastError();"},{"Add":""},{"Add":" va_start(argptr, error);"},{"Add":" vsprintf(text, error, argptr);"},{"Add":" va_end(argptr);"},{"Add":""},{"Add":" sprintf(text2, \"%s\\nGetLastError() = %i\", text, err);"},{"Add":" MessageBox(NULL, text2, \"Error\", 0 /* MB_OK */);"},{"Add":""},{"Add":" exit(1);"},{"Add":"}"},{"Add":""},{"Add":"#else"},{"Add":"/*"},{"Add":"================="},{"Add":"Error"},{"Add":""},{"Add":"For abnormal program terminations in console apps"},{"Add":"================="},{"Add":"*/"},{"Add":"void Error(char *error, ...) {"},{"Add":" va_list argptr;"},{"Add":""},{"Add":" printf(\"\\n************ ERROR ************\\n\");"},{"Add":""},{"Add":" va_start(argptr, error);"},{"Add":" vprintf(error, argptr);"},{"Add":" va_end(argptr);"},{"Add":" printf(\"\\n\");"},{"Add":""},{"Add":" exit(1);"},{"Add":"}"},{"Add":"#endif"},{"Add":""},{"Add":"// only qprintf if in verbose mode"},{"Add":"qboolean verbose = false;"},{"Add":"void qprintf(char *format, ...) {"},{"Add":" va_list argptr;"},{"Add":""},{"Add":" if (!verbose)"},{"Add":" return;"},{"Add":""},{"Add":" va_start(argptr, format);"},{"Add":" vprintf(format, argptr);"},{"Add":" va_end(argptr);"},{"Add":" fflush(stdout);"},{"Add":"}"},{"Add":""},{"Add":"// qb: similar to AAtools, except basedir defaults to moddir"},{"Add":"/*"},{"Add":" * Path determination"},{"Add":" *"},{"Add":" * assumes"},{"Add":" * moddir is parent of whatever directory contains the .map/.bsp"},{"Add":" * basedir is moddir"},{"Add":" * gamedir is parent of moddir"},{"Add":" * qdir is parent of gamedir"},{"Add":" */"},{"Add":"char qdir[1024] = \"\";"},{"Add":"char gamedir[1024] = \"\";"},{"Add":"char moddir[1024] = \"\";"},{"Add":"char basedir[1024] = \"\";"},{"Add":""},{"Add":"void SetQdirFromPath(char *path) {"},{"Add":" char cwd_map[512];"},{"Add":" char *lastslash;"},{"Add":""},{"Add":" memset(cwd_map, 0, sizeof(cwd_map));"},{"Add":" strncpy(cwd_map, path, sizeof(cwd_map) - 1);"},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":" lastslash = strrchr(cwd_map, '\\\\');"},{"Add":" // I believe Win32 can use either slash type. -Max"},{"Add":" if (lastslash == NULL)"},{"Add":"#endif"},{"Add":" lastslash = strrchr(cwd_map, '/');"},{"Add":""},{"Add":" if (lastslash == NULL) {"},{"Add":" // no slashes: CWD"},{"Add":" Q_getwd(cwd_map); // appends path separator"},{"Add":" } else {"},{"Add":" // get rid of everything after last path separator"},{"Add":" lastslash++;"},{"Add":" *lastslash = '\\0';"},{"Add":" }"},{"Add":""},{"Add":" strcpy(moddir, cwd_map);"},{"Add":"#ifdef WIN32"},{"Add":" strcat(moddir, \"..\\\\\");"},{"Add":"#else"},{"Add":" strcat(moddir, \"../\");"},{"Add":"#endif"},{"Add":""},{"Add":" strcpy(basedir, moddir);"},{"Add":""},{"Add":" strcpy(gamedir, moddir);"},{"Add":"#ifdef WIN32"},{"Add":" strcat(gamedir, \"..\\\\\");"},{"Add":"#else"},{"Add":" strcat(gamedir, \"../\");"},{"Add":"#endif"},{"Add":""},{"Add":" strcpy(qdir, gamedir);"},{"Add":"#ifdef WIN32"},{"Add":" strcat(qdir, \"..\\\\\");"},{"Add":"#else"},{"Add":" strcat(qdir, \"../\");"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"char *ExpandArg(const char *path) {"},{"Add":" static char full[1024];"},{"Add":""},{"Add":" if (path[0] != '/' && path[0] != '\\\\' && path[1] != ':') {"},{"Add":" Q_getwd(full);"},{"Add":" strcat(full, path);"},{"Add":" } else"},{"Add":" strcpy(full, path);"},{"Add":" return full;"},{"Add":"}"},{"Add":""},{"Add":"char *ExpandPath(char *path) {"},{"Add":" static char full[1024];"},{"Add":" if (!qdir[0])"},{"Add":" Error(\"ExpandPath called without qdir set\");"},{"Add":" if (path[0] == '/' || path[0] == '\\\\' || path[1] == ':')"},{"Add":" return path;"},{"Add":" sprintf(full, \"%s%s\", qdir, path);"},{"Add":" return full;"},{"Add":"}"},{"Add":""},{"Add":"char *ExpandPathAndArchive(char *path) {"},{"Add":" char *expanded;"},{"Add":" char archivename[2060];"},{"Add":""},{"Add":" expanded = ExpandPath(path);"},{"Add":""},{"Add":" if (archive) {"},{"Add":" sprintf(archivename, \"%s/%s\", archivedir, path);"},{"Add":" QCopyFile(expanded, archivename);"},{"Add":" }"},{"Add":" return expanded;"},{"Add":"}"},{"Add":""},{"Add":"char *copystring(char *s) {"},{"Add":" char *b;"},{"Add":" b = malloc(strlen(s) + 1);"},{"Add":" strcpy(b, s);"},{"Add":" return b;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"I_FloatTime"},{"Add":"================"},{"Add":"*/"},{"Add":"double I_FloatTime(void) {"},{"Add":" time_t t;"},{"Add":""},{"Add":" time(&t);"},{"Add":""},{"Add":" return t;"},{"Add":"#if 0"},{"Add":"\t// more precise, less portable"},{"Add":"\tstruct timeval tp;"},{"Add":"\tstruct timezone tzp;"},{"Add":"\tstatic int32_t\t\tsecbase;"},{"Add":""},{"Add":"\tgettimeofday(&tp, &tzp);"},{"Add":""},{"Add":"\tif (!secbase)"},{"Add":"\t{"},{"Add":"\t\tsecbase = tp.tv_sec;"},{"Add":"\t\treturn tp.tv_usec / 1000000.0;"},{"Add":"\t}"},{"Add":""},{"Add":"\treturn (tp.tv_sec - secbase) + tp.tv_usec / 1000000.0;"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"void Q_pathslash(char *out) { // qb: added"},{"Add":" qboolean lastslash;"},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":" lastslash = (*out && out[strlen(out + 1)] == '\\\\');"},{"Add":" // I believe Win32 can use either slash type. -Max"},{"Add":" if (!lastslash)"},{"Add":"#endif"},{"Add":" lastslash = (*out && out[strlen(out + 1)] == '/');"},{"Add":" if (!lastslash)"},{"Add":"#ifdef WIN32"},{"Add":" strcat(out, \"\\\\\");"},{"Add":"#else"},{"Add":" strcat(out, \"/\");"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"void Q_getwd(char *out) {"},{"Add":"#ifdef WIN32"},{"Add":" if (!_getcwd(out, 256))"},{"Add":" Error(\"_getcwd failed\");"},{"Add":" strcat(out, \"\\\\\");"},{"Add":"#else"},{"Add":" if (!getcwd(out, 256)) // qb: was getwd(out)"},{"Add":" Error(\"getcwd failed\");"},{"Add":" strcat(out, \"/\");"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"void Q_mkdir(char *path) {"},{"Add":"#ifdef WIN32"},{"Add":" if (_mkdir(path) != -1)"},{"Add":" return;"},{"Add":"#else"},{"Add":" if (mkdir(path, 0777) != -1)"},{"Add":" return;"},{"Add":"#endif"},{"Add":" if (errno != EEXIST)"},{"Add":" Error(\"mkdir %s: %s\", path, strerror(errno));"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"FileTime"},{"Add":""},{"Add":"returns -1 if not present"},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t FileTime(char *path) {"},{"Add":" struct stat buf;"},{"Add":""},{"Add":" if (stat(path, &buf) == -1)"},{"Add":" return -1;"},{"Add":""},{"Add":" return buf.st_mtime;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"COM_Parse"},{"Add":""},{"Add":"Parse a token out of a string"},{"Add":"=============="},{"Add":"*/"},{"Add":"char *COM_Parse(char *data) {"},{"Add":" int32_t c;"},{"Add":" int32_t len;"},{"Add":""},{"Add":" len = 0;"},{"Add":" com_token[0] = 0;"},{"Add":""},{"Add":" if (!data)"},{"Add":" return NULL;"},{"Add":""},{"Add":" // skip whitespace"},{"Add":"skipwhite:"},{"Add":" while ((c = *data) <= ' ') {"},{"Add":" if (c == 0) {"},{"Add":" com_eof = true;"},{"Add":" return NULL; // end of file;"},{"Add":" }"},{"Add":" data++;"},{"Add":" }"},{"Add":""},{"Add":" // skip // comments"},{"Add":" if (c == '/' && data[1] == '/') {"},{"Add":" while (*data && *data != '\\n')"},{"Add":" data++;"},{"Add":" goto skipwhite;"},{"Add":" }"},{"Add":""},{"Add":" // handle quoted strings specially"},{"Add":" if (c == '\\\"') {"},{"Add":" data++;"},{"Add":" do {"},{"Add":" c = *data++;"},{"Add":" if (c == '\\\"') {"},{"Add":" com_token[len] = 0;"},{"Add":" return data;"},{"Add":" }"},{"Add":" com_token[len] = c;"},{"Add":" len++;"},{"Add":" } while (1);"},{"Add":" }"},{"Add":""},{"Add":" // parse single characters"},{"Add":" if (c == '{' || c == '}' || c == ')' || c == '(' || c == '\\'' || c == ':') {"},{"Add":" com_token[len] = c;"},{"Add":" len++;"},{"Add":" com_token[len] = 0;"},{"Add":" return data + 1;"},{"Add":" }"},{"Add":""},{"Add":" // parse a regular word"},{"Add":" do {"},{"Add":" com_token[len] = c;"},{"Add":" data++;"},{"Add":" len++;"},{"Add":" c = *data;"},{"Add":" if (c == '{' || c == '}' || c == ')' || c == '(' || c == '\\'' || c == ':')"},{"Add":" break;"},{"Add":" } while (c > 32);"},{"Add":""},{"Add":" com_token[len] = 0;"},{"Add":" return data;"},{"Add":"}"},{"Add":""},{"Add":"int32_t Q_strncasecmp(char *s1, char *s2, int32_t n) {"},{"Add":" int32_t c1, c2;"},{"Add":""},{"Add":" do {"},{"Add":" c1 = *s1++;"},{"Add":" c2 = *s2++;"},{"Add":""},{"Add":" if (!n--)"},{"Add":" return 0; // strings are equal until end point"},{"Add":""},{"Add":" if (c1 != c2) {"},{"Add":" if (c1 >= 'a' && c1 <= 'z')"},{"Add":" c1 -= ('a' - 'A');"},{"Add":" if (c2 >= 'a' && c2 <= 'z')"},{"Add":" c2 -= ('a' - 'A');"},{"Add":" if (c1 != c2)"},{"Add":" return -1; // strings not equal"},{"Add":" }"},{"Add":" } while (c1);"},{"Add":""},{"Add":" return 0; // strings are equal"},{"Add":"}"},{"Add":""},{"Add":"int32_t Q_strcasecmp(char *s1, char *s2) {"},{"Add":" return Q_strncasecmp(s1, s2, 99999);"},{"Add":"}"},{"Add":""},{"Add":"char *strtoupper(char *start) {"},{"Add":" char *in;"},{"Add":" in = start;"},{"Add":" while (*in) {"},{"Add":" *in = toupper(*in);"},{"Add":" in++;"},{"Add":" }"},{"Add":" return start;"},{"Add":"}"},{"Add":""},{"Add":"char *strlower(char *start) {"},{"Add":" char *in;"},{"Add":" in = start;"},{"Add":" while (*in) {"},{"Add":" *in = tolower(*in);"},{"Add":" in++;"},{"Add":" }"},{"Add":" return start;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================="},{"Add":""},{"Add":"MISC FUNCTIONS"},{"Add":""},{"Add":"============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"CheckParm"},{"Add":""},{"Add":"Checks for the given parameter in the program's command line arguments"},{"Add":"Returns the argument number (1 to argc-1) or 0 if not present"},{"Add":"================="},{"Add":"*/"},{"Add":"int32_t CheckParm(char *check) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 1; i < myargc; i++) {"},{"Add":" if (!Q_strcasecmp(check, myargv[i]))"},{"Add":" return i;"},{"Add":" }"},{"Add":""},{"Add":" return 0;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"Q_filelength"},{"Add":"================"},{"Add":"*/"},{"Add":"int32_t Q_filelength(FILE *f) {"},{"Add":" int32_t pos;"},{"Add":" int32_t end;"},{"Add":""},{"Add":" pos = ftell(f);"},{"Add":" fseek(f, 0, SEEK_END);"},{"Add":" end = ftell(f);"},{"Add":" fseek(f, pos, SEEK_SET);"},{"Add":""},{"Add":" return end;"},{"Add":"}"},{"Add":""},{"Add":"FILE *SafeOpenWrite(char *filename) {"},{"Add":" FILE *f;"},{"Add":""},{"Add":" f = fopen(filename, \"wb\");"},{"Add":""},{"Add":" if (!f)"},{"Add":" Error(\"Error opening %s: %s\", filename, strerror(errno));"},{"Add":""},{"Add":" return f;"},{"Add":"}"},{"Add":""},{"Add":"FILE *SafeOpenRead(char *filename) {"},{"Add":" FILE *f;"},{"Add":""},{"Add":" f = fopen(filename, \"rb\");"},{"Add":""},{"Add":" if (!f)"},{"Add":" Error(\"Error opening %s: %s\", filename, strerror(errno));"},{"Add":""},{"Add":" return f;"},{"Add":"}"},{"Add":""},{"Add":"void SafeRead(FILE *f, void *buffer, int32_t count) {"},{"Add":" if (fread(buffer, 1, count, f) != (size_t)count)"},{"Add":" Error(\"File read failure\");"},{"Add":"}"},{"Add":""},{"Add":"void SafeWrite(FILE *f, void *buffer, int32_t count) {"},{"Add":" if (fwrite(buffer, 1, count, f) != (size_t)count)"},{"Add":" Error(\"File write failure\");"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"FileExists"},{"Add":"=============="},{"Add":"*/"},{"Add":"qboolean FileExists(char *filename) {"},{"Add":" FILE *f;"},{"Add":""},{"Add":" f = fopen(filename, \"r\");"},{"Add":" if (!f)"},{"Add":" return false;"},{"Add":" fclose(f);"},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"LoadFile"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t LoadFile(char *filename, void **bufferptr) {"},{"Add":" FILE *f;"},{"Add":" int32_t length;"},{"Add":" void *buffer;"},{"Add":""},{"Add":" f = SafeOpenRead(filename);"},{"Add":" length = Q_filelength(f);"},{"Add":" buffer = malloc(length + 1);"},{"Add":" ((char *)buffer)[length] = 0;"},{"Add":" SafeRead(f, buffer, length);"},{"Add":" fclose(f);"},{"Add":""},{"Add":" *bufferptr = buffer;"},{"Add":" return length;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"TryLoadFile"},{"Add":""},{"Add":"Allows failure"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t TryLoadFile(char *filename, void **bufferptr, int32_t print_error) {"},{"Add":" FILE *f;"},{"Add":" int32_t length;"},{"Add":" void *buffer;"},{"Add":""},{"Add":" *bufferptr = NULL;"},{"Add":""},{"Add":" f = fopen(filename, \"rb\");"},{"Add":""},{"Add":" if (!f) // qb: print error - GDD tools"},{"Add":" {"},{"Add":" if (print_error)"},{"Add":" printf(\" File %s failed to open\\n\", filename);"},{"Add":""},{"Add":" return -1;"},{"Add":" }"},{"Add":""},{"Add":" length = Q_filelength(f);"},{"Add":" buffer = malloc(length + 1);"},{"Add":" ((char *)buffer)[length] = 0;"},{"Add":" SafeRead(f, buffer, length);"},{"Add":" fclose(f);"},{"Add":""},{"Add":" *bufferptr = buffer;"},{"Add":" return length;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"TryLoadFileFromPak //qb: GDD tools"},{"Add":""},{"Add":"Allows failure"},{"Add":"=============="},{"Add":"*/"},{"Add":"typedef struct"},{"Add":"{"},{"Add":" uint8_t magic[4]; // Name of the new WAD format"},{"Add":" long diroffset; // Position of WAD directory from start of file"},{"Add":" long dirsize; // Number of entries * 0x40 (64 char)"},{"Add":""},{"Add":" uint8_t bogus[50];"},{"Add":"} pakheader_t;"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" uint8_t filename[0x38]; // Name of the file, Unix style, with extension,"},{"Add":" // 56 chars, padded with '\\0'."},{"Add":" long offset; // Position of the entry in PACK file"},{"Add":" long size; // Size of the entry in PACK file"},{"Add":"} pakentry_t;"},{"Add":""},{"Add":"int32_t TryLoadFileFromPak(char *filename, void **bufferptr, char *gd) {"},{"Add":" FILE *f;"},{"Add":" int32_t n, i, ret_len;"},{"Add":" long dir_ents;"},{"Add":" void *buffer;"},{"Add":" pakheader_t pak_header;"},{"Add":" pakentry_t *pak_entry;"},{"Add":" char file[1024];"},{"Add":""},{"Add":" for (n = 0; filename[n] != 0; n++) {"},{"Add":" if (filename[n] == '\\\\')"},{"Add":" filename[n] = '/';"},{"Add":" }"},{"Add":""},{"Add":" *bufferptr = NULL;"},{"Add":""},{"Add":" ret_len = -1;"},{"Add":""},{"Add":" for (n = 0;; n++) {"},{"Add":" if (ret_len != -1)"},{"Add":" break;"},{"Add":""},{"Add":" sprintf(file, \"%spak%d.pak\", gd, n);"},{"Add":""},{"Add":" f = fopen(file, \"rb\");"},{"Add":""},{"Add":" if (!f) {"},{"Add":" // if(errno == ENOENT) jit"},{"Add":" return -1;"},{"Add":""},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" SafeRead(f, &pak_header, sizeof(pakheader_t));"},{"Add":""},{"Add":" dir_ents = pak_header.dirsize / sizeof(pakentry_t);"},{"Add":""},{"Add":" pak_entry = malloc(pak_header.dirsize);"},{"Add":""},{"Add":" if (pak_entry != NULL) {"},{"Add":" if (!fseek(f, pak_header.diroffset, SEEK_SET)) {"},{"Add":" memset(pak_entry, 0, pak_header.dirsize);"},{"Add":""},{"Add":" SafeRead(f, pak_entry, pak_header.dirsize);"},{"Add":""},{"Add":" for (i = 0; i < dir_ents; i++) {"},{"Add":" for (n = 0; pak_entry[i].filename[n] != 0; n++) {"},{"Add":" if (pak_entry[i].filename[n] == '\\\\')"},{"Add":" pak_entry[i].filename[n] = '/';"},{"Add":" }"},{"Add":""},{"Add":" if (!Q_strncasecmp((char *)pak_entry[i].filename, filename, 56)) {"},{"Add":" if (!fseek(f, pak_entry[i].offset, SEEK_SET)) {"},{"Add":" buffer = malloc(pak_entry[i].size + 1);"},{"Add":" ((char *)buffer)[pak_entry[i].size] = 0;"},{"Add":" SafeRead(f, buffer, pak_entry[i].size);"},{"Add":" *bufferptr = buffer;"},{"Add":""},{"Add":" ret_len = pak_entry[i].size;"},{"Add":" }"},{"Add":""},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (pak_entry != NULL)"},{"Add":" free(pak_entry);"},{"Add":""},{"Add":" fclose(f);"},{"Add":" }"},{"Add":""},{"Add":" return ret_len;"},{"Add":"}"},{"Add":"/*"},{"Add":" */"},{"Add":"/*"},{"Add":"=============="},{"Add":"SaveFile"},{"Add":"=============="},{"Add":"*/"},{"Add":"void SaveFile(char *filename, void *buffer, int32_t count) {"},{"Add":" FILE *f;"},{"Add":""},{"Add":" f = SafeOpenWrite(filename);"},{"Add":" SafeWrite(f, buffer, count);"},{"Add":" fclose(f);"},{"Add":"}"},{"Add":""},{"Add":"void DefaultExtension(char *path, char *extension) {"},{"Add":" char *src;"},{"Add":" //"},{"Add":" // if path doesnt have a .EXT, append extension"},{"Add":" // (extension should include the .)"},{"Add":" //"},{"Add":" src = path + strlen(path) - 1;"},{"Add":""},{"Add":" while (*src != PATHSEPERATOR && src != path) {"},{"Add":" if (*src == '.')"},{"Add":" return; // it has an extension"},{"Add":" src--;"},{"Add":" }"},{"Add":""},{"Add":" strcat(path, extension);"},{"Add":"}"},{"Add":""},{"Add":"void DefaultPath(char *path, char *basepath) {"},{"Add":" char temp[128];"},{"Add":""},{"Add":" if (path[0] == PATHSEPERATOR)"},{"Add":" return; // absolute path location"},{"Add":" strcpy(temp, path);"},{"Add":" strcpy(path, basepath);"},{"Add":" strcat(path, temp);"},{"Add":"}"},{"Add":""},{"Add":"void StripFilename(char *path) {"},{"Add":" int32_t length;"},{"Add":""},{"Add":" length = strlen(path) - 1;"},{"Add":" while (length > 0 && path[length] != PATHSEPERATOR)"},{"Add":" length--;"},{"Add":" path[length] = 0;"},{"Add":"}"},{"Add":""},{"Add":"void StripExtension(char *path) {"},{"Add":" int32_t length;"},{"Add":""},{"Add":" length = strlen(path) - 1;"},{"Add":" while (length > 0 && path[length] != '.') {"},{"Add":" length--;"},{"Add":" if (path[length] == '/' || path[length] == '\\\\')"},{"Add":" return; // no extension"},{"Add":" }"},{"Add":" if (length)"},{"Add":" path[length] = 0;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"===================="},{"Add":"Extract file parts"},{"Add":"===================="},{"Add":"*/"},{"Add":"// FIXME: should include the slash, otherwise"},{"Add":"// backing to an empty path will be wrong when appending a slash"},{"Add":"void ExtractFilePath(char *path, char *dest) {"},{"Add":" char *src;"},{"Add":""},{"Add":" src = path + strlen(path) - 1;"},{"Add":""},{"Add":" //"},{"Add":" // back up until a \\ or the start"},{"Add":" //"},{"Add":" while (src != path && *(src - 1) != '\\\\' && *(src - 1) != '/')"},{"Add":" src--;"},{"Add":""},{"Add":" memcpy(dest, path, src - path);"},{"Add":" dest[src - path] = 0;"},{"Add":"}"},{"Add":""},{"Add":"void ExtractFileBase(char *path, char *dest) {"},{"Add":" char *src;"},{"Add":""},{"Add":" src = path + strlen(path) - 1;"},{"Add":""},{"Add":" //"},{"Add":" // back up until a \\ or the start"},{"Add":" //"},{"Add":" while (src != path && *(src - 1) != PATHSEPERATOR)"},{"Add":" src--;"},{"Add":""},{"Add":" while (*src && *src != '.') {"},{"Add":" *dest++ = *src++;"},{"Add":" }"},{"Add":" *dest = 0;"},{"Add":"}"},{"Add":""},{"Add":"void ExtractFileExtension(char *path, char *dest) {"},{"Add":" char *src;"},{"Add":""},{"Add":" src = path + strlen(path) - 1;"},{"Add":""},{"Add":" //"},{"Add":" // back up until a . or the start"},{"Add":" //"},{"Add":" while (src != path && *(src - 1) != '.')"},{"Add":" src--;"},{"Add":" if (src == path) {"},{"Add":" *dest = 0; // no extension"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" strcpy(dest, src);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"ParseNum / ParseHex"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t ParseHex(char *hex) {"},{"Add":" char *str;"},{"Add":" int32_t num;"},{"Add":""},{"Add":" num = 0;"},{"Add":" str = hex;"},{"Add":""},{"Add":" while (*str) {"},{"Add":" num <<= 4;"},{"Add":" if (*str >= '0' && *str <= '9')"},{"Add":" num += *str - '0';"},{"Add":" else if (*str >= 'a' && *str <= 'f')"},{"Add":" num += 10 + *str - 'a';"},{"Add":" else if (*str >= 'A' && *str <= 'F')"},{"Add":" num += 10 + *str - 'A';"},{"Add":" else"},{"Add":" Error(\"Bad hex number: %s\", hex);"},{"Add":" str++;"},{"Add":" }"},{"Add":""},{"Add":" return num;"},{"Add":"}"},{"Add":""},{"Add":"int32_t ParseNum(char *str) {"},{"Add":" if (str[0] == '$')"},{"Add":" return ParseHex(str + 1);"},{"Add":" if (str[0] == '0' && str[1] == 'x')"},{"Add":" return ParseHex(str + 2);"},{"Add":" return atol(str);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============================================================================"},{"Add":""},{"Add":"BYTE ORDER FUNCTIONS"},{"Add":""},{"Add":"============================================================================"},{"Add":"*/"},{"Add":""},{"Add":"#ifdef _SGI_SOURCE"},{"Add":"#define __BIG_ENDIAN__"},{"Add":"#endif"},{"Add":""},{"Add":"#ifdef __BIG_ENDIAN__"},{"Add":""},{"Add":"short LittleShort(short l) {"},{"Add":" byte b1, b2;"},{"Add":""},{"Add":" b1 = l & 255;"},{"Add":" b2 = (l >> 8) & 255;"},{"Add":""},{"Add":" return (b1 << 8) + b2;"},{"Add":"}"},{"Add":""},{"Add":"short BigShort(short l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"int32_t LittleLong(int32_t l) {"},{"Add":" byte b1, b2, b3, b4;"},{"Add":""},{"Add":" b1 = l & 255;"},{"Add":" b2 = (l >> 8) & 255;"},{"Add":" b3 = (l >> 16) & 255;"},{"Add":" b4 = (l >> 24) & 255;"},{"Add":""},{"Add":" return ((int32_t)b1 << 24) + ((int32_t)b2 << 16) + ((int32_t)b3 << 8) + b4;"},{"Add":"}"},{"Add":""},{"Add":"int32_t BigLong(int32_t l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"float LittleFloat(float l) {"},{"Add":" union {"},{"Add":" byte b[4];"},{"Add":" float f;"},{"Add":" } in, out;"},{"Add":""},{"Add":" in.f = l;"},{"Add":" out.b[0] = in.b[3];"},{"Add":" out.b[1] = in.b[2];"},{"Add":" out.b[2] = in.b[1];"},{"Add":" out.b[3] = in.b[0];"},{"Add":""},{"Add":" return out.f;"},{"Add":"}"},{"Add":""},{"Add":"float BigFloat(float l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"#else"},{"Add":""},{"Add":"short BigShort(short l) {"},{"Add":" byte b1, b2;"},{"Add":""},{"Add":" b1 = l & 255;"},{"Add":" b2 = (l >> 8) & 255;"},{"Add":""},{"Add":" return (b1 << 8) + b2;"},{"Add":"}"},{"Add":""},{"Add":"short LittleShort(short l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"int32_t BigLong(int32_t l) {"},{"Add":" byte b1, b2, b3, b4;"},{"Add":""},{"Add":" b1 = l & 255;"},{"Add":" b2 = (l >> 8) & 255;"},{"Add":" b3 = (l >> 16) & 255;"},{"Add":" b4 = (l >> 24) & 255;"},{"Add":""},{"Add":" return ((int32_t)b1 << 24) + ((int32_t)b2 << 16) + ((int32_t)b3 << 8) + b4;"},{"Add":"}"},{"Add":""},{"Add":"int32_t LittleLong(int32_t l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"float BigFloat(float l) {"},{"Add":" union {"},{"Add":" byte b[4];"},{"Add":" float f;"},{"Add":" } in, out;"},{"Add":""},{"Add":" in.f = l;"},{"Add":" out.b[0] = in.b[3];"},{"Add":" out.b[1] = in.b[2];"},{"Add":" out.b[2] = in.b[1];"},{"Add":" out.b[3] = in.b[0];"},{"Add":""},{"Add":" return out.f;"},{"Add":"}"},{"Add":""},{"Add":"float LittleFloat(float l) {"},{"Add":" return l;"},{"Add":"}"},{"Add":""},{"Add":"#endif"},{"Add":""},{"Add":"//======================================================="},{"Add":""},{"Add":"// FIXME: byte swap?"},{"Add":""},{"Add":"// this is a 16 bit, non-reflected CRC using the polynomial 0x1021"},{"Add":"// and the initial and final xor values shown below... in other words, the"},{"Add":"// CCITT standard CRC used by XMODEM"},{"Add":""},{"Add":"#define CRC_INIT_VALUE 0xffff"},{"Add":"#define CRC_XOR_VALUE 0x0000"},{"Add":""},{"Add":"static uint16_t crctable[256] ="},{"Add":" {"},{"Add":" 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7,"},{"Add":" 0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef,"},{"Add":" 0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6,"},{"Add":" 0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, 0xf3ff, 0xe3de,"},{"Add":" 0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485,"},{"Add":" 0xa56a, 0xb54b, 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d,"},{"Add":" 0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,"},{"Add":" 0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc,"},{"Add":" 0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823,"},{"Add":" 0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b,"},{"Add":" 0x5af5, 0x4ad4, 0x7ab7, 0x6a96, 0x1a71, 0x0a50, 0x3a33, 0x2a12,"},{"Add":" 0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a,"},{"Add":" 0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41,"},{"Add":" 0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,"},{"Add":" 0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70,"},{"Add":" 0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, 0x9f59, 0x8f78,"},{"Add":" 0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f,"},{"Add":" 0x1080, 0x00a1, 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067,"},{"Add":" 0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e,"},{"Add":" 0x02b1, 0x1290, 0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256,"},{"Add":" 0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,"},{"Add":" 0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,"},{"Add":" 0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e, 0xc71d, 0xd73c,"},{"Add":" 0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634,"},{"Add":" 0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, 0xb98a, 0xa9ab,"},{"Add":" 0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3,"},{"Add":" 0xcb7d, 0xdb5c, 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a,"},{"Add":" 0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,"},{"Add":" 0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9,"},{"Add":" 0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1,"},{"Add":" 0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8,"},{"Add":" 0x6e17, 0x7e36, 0x4e55, 0x5e74, 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0};"},{"Add":""},{"Add":"void CRC_Init(uint16_t *crcvalue) {"},{"Add":" *crcvalue = CRC_INIT_VALUE;"},{"Add":"}"},{"Add":""},{"Add":"void CRC_ProcessByte(uint16_t *crcvalue, byte data) {"},{"Add":" *crcvalue = (*crcvalue << 8) ^ crctable[(*crcvalue >> 8) ^ data];"},{"Add":"}"},{"Add":""},{"Add":"uint16_t CRC_Value(uint16_t crcvalue) {"},{"Add":" return crcvalue ^ CRC_XOR_VALUE;"},{"Add":"}"},{"Add":"//============================================================================="},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"CreatePath"},{"Add":"============"},{"Add":"*/"},{"Add":"void CreatePath(char *path) {"},{"Add":" char *ofs, c;"},{"Add":""},{"Add":" if (path[1] == ':')"},{"Add":" path += 2;"},{"Add":""},{"Add":" for (ofs = path + 1; *ofs; ofs++) {"},{"Add":" c = *ofs;"},{"Add":" if (c == '/' || c == '\\\\') { // create the directory"},{"Add":" *ofs = 0;"},{"Add":" Q_mkdir(path);"},{"Add":" *ofs = c;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"QCopyFile"},{"Add":""},{"Add":"Used to archive source files"},{"Add":"============"},{"Add":"*/"},{"Add":"void QCopyFile(char *from, char *to) {"},{"Add":" void *buffer;"},{"Add":" int32_t length;"},{"Add":""},{"Add":" length = LoadFile(from, &buffer);"},{"Add":" CreatePath(to);"},{"Add":" SaveFile(to, buffer, length);"},{"Add":" free(buffer);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"bspfile.c","metadata":0},"context":[{"change":0,"pos":15571}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"cmdlib.h\""},{"Add":"#include \"mathlib.h\""},{"Add":"#include \"bspfile.h\""},{"Add":"#include \"scriplib.h\""},{"Add":""},{"Add":"qboolean use_qbsp = false; // qb: huge map support"},{"Add":"qboolean noskipfix = false; // qb: warn about SURF_SKIP contents rather than silently changing to zero"},{"Add":""},{"Add":"void GetLeafNums(void);"},{"Add":""},{"Add":"//============================================================================="},{"Add":""},{"Add":"// qb: add qbsp types"},{"Add":""},{"Add":"int32_t nummodels;"},{"Add":"dmodel_t * dmodels;//[MAX_MAP_MODELS_QBSP];"},{"Add":""},{"Add":"int32_t visdatasize;"},{"Add":"byte * dvisdata;//[MAX_MAP_VISIBILITY_QBSP];"},{"Add":"dvis_t *dvis;// = (dvis_t *)dvisdata;"},{"Add":""},{"Add":"int32_t lightdatasize;"},{"Add":"byte * dlightdata;//[MAX_MAP_LIGHTING_QBSP];"},{"Add":""},{"Add":"int32_t entdatasize;"},{"Add":"char * dentdata;//[MAX_MAP_ENTSTRING_QBSP];"},{"Add":""},{"Add":"int32_t numleafs;"},{"Add":"dleaf_t * dleafs;//[MAX_MAP_LEAFS];"},{"Add":"dleaf_tx * dleafsX;//[MAX_MAP_LEAFS_QBSP];"},{"Add":""},{"Add":"int32_t numplanes;"},{"Add":"dplane_t * dplanes;//[MAX_MAP_PLANES_QBSP];"},{"Add":""},{"Add":"int32_t numvertexes;"},{"Add":"dvertex_t * dvertexes;//[MAX_MAP_VERTS_QBSP];"},{"Add":""},{"Add":"int32_t numnodes;"},{"Add":"dnode_t * dnodes;//[MAX_MAP_NODES];"},{"Add":"dnode_tx * dnodesX;//[MAX_MAP_NODES_QBSP];"},{"Add":""},{"Add":"int32_t numtexinfo;"},{"Add":"texinfo_t * texinfo;//[MAX_MAP_TEXINFO_QBSP];"},{"Add":""},{"Add":"int32_t numfaces;"},{"Add":"dface_t * dfaces;//[MAX_MAP_FACES];"},{"Add":"dface_tx * dfacesX;//[MAX_MAP_FACES_QBSP];"},{"Add":""},{"Add":"int32_t numedges;"},{"Add":"dedge_t * dedges;//[MAX_MAP_EDGES];"},{"Add":"dedge_tx * dedgesX;//[MAX_MAP_EDGES_QBSP];"},{"Add":""},{"Add":"int32_t numleaffaces;"},{"Add":"uint16_t * dleaffaces;//[MAX_MAP_LEAFFACES];"},{"Add":"uint32_t * dleaffacesX;//[MAX_MAP_LEAFFACES_QBSP];"},{"Add":""},{"Add":"int32_t numleafbrushes;"},{"Add":"uint16_t * dleafbrushes;//[MAX_MAP_LEAFBRUSHES];"},{"Add":"uint32_t * dleafbrushesX;//[MAX_MAP_LEAFBRUSHES_QBSP];"},{"Add":""},{"Add":"int32_t numsurfedges;"},{"Add":"int32_t * dsurfedges;//[MAX_MAP_SURFEDGES_QBSP];"},{"Add":""},{"Add":"int32_t numbrushes;"},{"Add":"dbrush_t * dbrushes;//[MAX_MAP_BRUSHES_QBSP];"},{"Add":""},{"Add":"int32_t numbrushsides;"},{"Add":"dbrushside_t * dbrushsides;//[MAX_MAP_BRUSHSIDES];"},{"Add":"dbrushside_tx * dbrushsidesX;//[MAX_MAP_BRUSHSIDES_QBSP];"},{"Add":""},{"Add":"int32_t numareas;"},{"Add":"darea_t * dareas;//[MAX_MAP_AREAS];"},{"Add":""},{"Add":"int32_t numareaportals;"},{"Add":"dareaportal_t * dareaportals;//[MAX_MAP_AREAPORTALS];"},{"Add":""},{"Add":"byte dpop[256];"},{"Add":""},{"Add":"void InitBSPFile(void) {"},{"Add":" static qboolean init = false;"},{"Add":" if(!init) {"},{"Add":" init = true;"},{"Add":" dmodels = (dmodel_t*)malloc(sizeof(*dmodels) * MAX_MAP_MODELS_QBSP);"},{"Add":" dvisdata = (byte*)malloc(sizeof(*dvisdata) * MAX_MAP_VISIBILITY_QBSP);"},{"Add":" dvis = (dvis_t *)dvisdata;"},{"Add":" dlightdata = (byte*)malloc(sizeof(*dlightdata) * MAX_MAP_LIGHTING_QBSP);"},{"Add":" dentdata = (char*)malloc(sizeof(*dentdata) * MAX_MAP_ENTSTRING_QBSP);"},{"Add":" dleafs = (dleaf_t*)malloc(sizeof(*dleafs) * MAX_MAP_LEAFS);"},{"Add":" dleafsX = (dleaf_tx*)malloc(sizeof(*dleafsX) * MAX_MAP_LEAFS_QBSP);"},{"Add":" dplanes = (dplane_t*)malloc(sizeof(*dplanes) * MAX_MAP_PLANES_QBSP);"},{"Add":" dvertexes = (dvertex_t*)malloc(sizeof(*dvertexes) * MAX_MAP_VERTS_QBSP);"},{"Add":" dnodes = (dnode_t*)malloc(sizeof(*dnodes) * MAX_MAP_NODES);"},{"Add":" dnodesX = (dnode_tx*)malloc(sizeof(*dnodesX) * MAX_MAP_NODES_QBSP);"},{"Add":" texinfo = (texinfo_t*)malloc(sizeof(*texinfo) * MAX_MAP_TEXINFO_QBSP);"},{"Add":" dfaces = (dface_t*)malloc(sizeof(*dfaces) * MAX_MAP_FACES);"},{"Add":" dfacesX = (dface_tx*)malloc(sizeof(*dfacesX) * MAX_MAP_FACES_QBSP);"},{"Add":" dedges = (dedge_t*)malloc(sizeof(*dedges) * MAX_MAP_EDGES);"},{"Add":" dedgesX = (dedge_tx*)malloc(sizeof(*dedgesX) * MAX_MAP_EDGES_QBSP);"},{"Add":" dleaffaces = (uint16_t*)malloc(sizeof(*dleaffaces) * MAX_MAP_LEAFFACES);"},{"Add":" dleaffacesX = (uint32_t*)malloc(sizeof(*dleaffacesX) * MAX_MAP_LEAFFACES_QBSP);"},{"Add":" dleafbrushes = (uint16_t*)malloc(sizeof(*dleafbrushes) * MAX_MAP_LEAFBRUSHES);"},{"Add":" dleafbrushesX = (uint32_t*)malloc(sizeof(*dleafbrushesX) * MAX_MAP_LEAFBRUSHES_QBSP);"},{"Add":" dsurfedges = (int32_t*)malloc(sizeof(*dsurfedges) * MAX_MAP_SURFEDGES_QBSP);"},{"Add":" dbrushes = (dbrush_t*)malloc(sizeof(*dbrushes) * MAX_MAP_BRUSHES_QBSP);"},{"Add":" dbrushsides = (dbrushside_t*)malloc(sizeof(*dbrushsides) * MAX_MAP_BRUSHSIDES);"},{"Add":" dbrushsidesX = (dbrushside_tx*)malloc(sizeof(*dbrushsidesX) * MAX_MAP_BRUSHSIDES_QBSP);"},{"Add":" dareas = (darea_t*)malloc(sizeof(*dareas) * MAX_MAP_AREAS);"},{"Add":" dareaportals = (dareaportal_t*)malloc(sizeof(*dareaportals) * MAX_MAP_AREAPORTALS);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"CompressVis"},{"Add":""},{"Add":"==============="},{"Add":"*/"},{"Add":"int32_t CompressVis(byte *vis, byte *dest) {"},{"Add":" int32_t j;"},{"Add":" int32_t rep;"},{"Add":" int32_t visrow;"},{"Add":" byte *dest_p;"},{"Add":""},{"Add":" dest_p = dest;"},{"Add":" //\tvisrow = (r_numvisleafs + 7)>>3;"},{"Add":" visrow = (dvis->numclusters + 7) >> 3;"},{"Add":""},{"Add":" for (j = 0; j < visrow; j++) {"},{"Add":" *dest_p++ = vis[j];"},{"Add":" if (vis[j])"},{"Add":" continue;"},{"Add":""},{"Add":" rep = 1;"},{"Add":" for (j++; j < visrow; j++)"},{"Add":" if (vis[j] || rep == 255)"},{"Add":" break;"},{"Add":" else"},{"Add":" rep++;"},{"Add":" *dest_p++ = rep;"},{"Add":" j--;"},{"Add":" }"},{"Add":""},{"Add":" return dest_p - dest;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==================="},{"Add":"DecompressVis"},{"Add":"==================="},{"Add":"*/"},{"Add":"void DecompressVis(byte *in, byte *decompressed) {"},{"Add":" int32_t c;"},{"Add":" byte *out;"},{"Add":" int32_t row;"},{"Add":""},{"Add":" //\trow = (r_numvisleafs+7)>>3;"},{"Add":" row = (dvis->numclusters + 7) >> 3;"},{"Add":" out = decompressed;"},{"Add":""},{"Add":" do {"},{"Add":" if (*in) {"},{"Add":" *out++ = *in++;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" c = in[1];"},{"Add":" if (!c)"},{"Add":" Error(\"DecompressVis: 0 repeat\");"},{"Add":" in += 2;"},{"Add":" while (c) {"},{"Add":" *out++ = 0;"},{"Add":" c--;"},{"Add":" }"},{"Add":" } while (out - decompressed < row);"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================="},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"SwapBSPFile"},{"Add":""},{"Add":"Byte swaps all data in a bsp file."},{"Add":"============="},{"Add":"*/"},{"Add":"void SwapBSPFile(qboolean todisk) {"},{"Add":" int32_t i, j;"},{"Add":" dmodel_t *d;"},{"Add":""},{"Add":" // models"},{"Add":" for (i = 0; i < nummodels; i++) {"},{"Add":" d = &dmodels[i];"},{"Add":""},{"Add":" d->firstface = LittleLong(d->firstface);"},{"Add":" d->numfaces = LittleLong(d->numfaces);"},{"Add":" d->headnode = LittleLong(d->headnode);"},{"Add":""},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" d->mins[j] = LittleFloat(d->mins[j]);"},{"Add":" d->maxs[j] = LittleFloat(d->maxs[j]);"},{"Add":" d->origin[j] = LittleFloat(d->origin[j]);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // vertexes"},{"Add":" //"},{"Add":" for (i = 0; i < numvertexes; i++) {"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" dvertexes[i].point[j] = LittleFloat(dvertexes[i].point[j]);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // planes"},{"Add":" //"},{"Add":" for (i = 0; i < numplanes; i++) {"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" dplanes[i].normal[j] = LittleFloat(dplanes[i].normal[j]);"},{"Add":" dplanes[i].dist = LittleFloat(dplanes[i].dist);"},{"Add":" dplanes[i].type = LittleLong(dplanes[i].type);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // texinfos"},{"Add":" //"},{"Add":" for (i = 0; i < numtexinfo; i++) {"},{"Add":" texinfo[i].flags = LittleLong(texinfo[i].flags);"},{"Add":" texinfo[i].value = LittleLong(texinfo[i].value);"},{"Add":" texinfo[i].nexttexinfo = LittleLong(texinfo[i].nexttexinfo);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // faces nodes leafs brushsides leafbrushes leaffaces"},{"Add":" //"},{"Add":" if (use_qbsp) {"},{"Add":" for (i = 0; i < numfaces; i++) {"},{"Add":" dfacesX[i].texinfo = LittleLong(dfacesX[i].texinfo);"},{"Add":" dfacesX[i].planenum = LittleLong(dfacesX[i].planenum);"},{"Add":" dfacesX[i].side = LittleLong(dfacesX[i].side);"},{"Add":" dfacesX[i].lightofs = LittleLong(dfacesX[i].lightofs);"},{"Add":" dfacesX[i].firstedge = LittleLong(dfacesX[i].firstedge);"},{"Add":" dfacesX[i].numedges = LittleLong(dfacesX[i].numedges);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numnodes; i++) {"},{"Add":" dnodesX[i].planenum = LittleLong(dnodesX[i].planenum);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" dnodesX[i].mins[j] = LittleFloat(dnodesX[i].mins[j]);"},{"Add":" dnodesX[i].maxs[j] = LittleFloat(dnodesX[i].maxs[j]);"},{"Add":" }"},{"Add":" dnodesX[i].children[0] = LittleLong(dnodesX[i].children[0]);"},{"Add":" dnodesX[i].children[1] = LittleLong(dnodesX[i].children[1]);"},{"Add":" dnodesX[i].firstface = LittleLong(dnodesX[i].firstface);"},{"Add":" dnodesX[i].numfaces = LittleLong(dnodesX[i].numfaces);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numleafs; i++) {"},{"Add":" dleafsX[i].contents = LittleLong(dleafsX[i].contents);"},{"Add":" dleafsX[i].cluster = LittleLong(dleafsX[i].cluster);"},{"Add":" dleafsX[i].area = LittleLong(dleafsX[i].area);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" dleafsX[i].mins[j] = LittleFloat(dleafsX[i].mins[j]);"},{"Add":" dleafsX[i].maxs[j] = LittleFloat(dleafsX[i].maxs[j]);"},{"Add":" }"},{"Add":" dleafsX[i].firstleafface = LittleLong(dleafsX[i].firstleafface);"},{"Add":" dleafsX[i].numleaffaces = LittleLong(dleafsX[i].numleaffaces);"},{"Add":" dleafsX[i].firstleafbrush = LittleLong(dleafsX[i].firstleafbrush);"},{"Add":" dleafsX[i].numleafbrushes = LittleLong(dleafsX[i].numleafbrushes);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numbrushsides; i++) {"},{"Add":" dbrushsidesX[i].planenum = LittleLong(dbrushsidesX[i].planenum);"},{"Add":" dbrushsidesX[i].texinfo = LittleLong(dbrushsidesX[i].texinfo);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numleafbrushes; i++)"},{"Add":" dleafbrushesX[i] = LittleLong(dleafbrushesX[i]);"},{"Add":""},{"Add":" for (i = 0; i < numleaffaces; i++)"},{"Add":" dleaffacesX[i] = LittleLong(dleaffacesX[i]);"},{"Add":""},{"Add":" } else {"},{"Add":" for (i = 0; i < numfaces; i++) {"},{"Add":" dfaces[i].texinfo = LittleShort(dfaces[i].texinfo);"},{"Add":" dfaces[i].planenum = LittleShort(dfaces[i].planenum);"},{"Add":" dfaces[i].side = LittleShort(dfaces[i].side);"},{"Add":" dfaces[i].lightofs = LittleLong(dfaces[i].lightofs);"},{"Add":" dfaces[i].firstedge = LittleLong(dfaces[i].firstedge);"},{"Add":" dfaces[i].numedges = LittleShort(dfaces[i].numedges);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numnodes; i++) {"},{"Add":" dnodes[i].planenum = LittleLong(dnodes[i].planenum);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" dnodes[i].mins[j] = LittleShort(dnodes[i].mins[j]);"},{"Add":" dnodes[i].maxs[j] = LittleShort(dnodes[i].maxs[j]);"},{"Add":" }"},{"Add":" dnodes[i].children[0] = LittleLong(dnodes[i].children[0]);"},{"Add":" dnodes[i].children[1] = LittleLong(dnodes[i].children[1]);"},{"Add":" dnodes[i].firstface = LittleShort(dnodes[i].firstface);"},{"Add":" dnodes[i].numfaces = LittleShort(dnodes[i].numfaces);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numleafs; i++) {"},{"Add":" dleafs[i].contents = LittleLong(dleafs[i].contents);"},{"Add":" dleafs[i].cluster = LittleShort(dleafs[i].cluster);"},{"Add":" dleafs[i].area = LittleShort(dleafs[i].area);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" dleafs[i].mins[j] = LittleShort(dleafs[i].mins[j]);"},{"Add":" dleafs[i].maxs[j] = LittleShort(dleafs[i].maxs[j]);"},{"Add":" }"},{"Add":" dleafs[i].firstleafface = LittleShort(dleafs[i].firstleafface);"},{"Add":" dleafs[i].numleaffaces = LittleShort(dleafs[i].numleaffaces);"},{"Add":" dleafs[i].firstleafbrush = LittleShort(dleafs[i].firstleafbrush);"},{"Add":" dleafs[i].numleafbrushes = LittleShort(dleafs[i].numleafbrushes);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numbrushsides; i++) {"},{"Add":" dbrushsides[i].planenum = LittleShort(dbrushsides[i].planenum);"},{"Add":" dbrushsides[i].texinfo = LittleShort(dbrushsides[i].texinfo);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < numleafbrushes; i++)"},{"Add":" dleafbrushes[i] = LittleShort(dleafbrushes[i]);"},{"Add":""},{"Add":" for (i = 0; i < numleaffaces; i++)"},{"Add":" dleaffaces[i] = LittleShort(dleaffaces[i]);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // surfedges"},{"Add":" //"},{"Add":" for (i = 0; i < numsurfedges; i++)"},{"Add":" dsurfedges[i] = LittleLong(dsurfedges[i]);"},{"Add":""},{"Add":" //"},{"Add":" // edges"},{"Add":" //"},{"Add":" if (use_qbsp)"},{"Add":" for (i = 0; i < numedges; i++) {"},{"Add":" dedgesX[i].v[0] = LittleLong(dedgesX[i].v[0]);"},{"Add":" dedgesX[i].v[1] = LittleLong(dedgesX[i].v[1]);"},{"Add":" }"},{"Add":" else"},{"Add":" for (i = 0; i < numedges; i++) {"},{"Add":" dedges[i].v[0] = LittleShort(dedges[i].v[0]);"},{"Add":" dedges[i].v[1] = LittleShort(dedges[i].v[1]);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // brushes"},{"Add":" //"},{"Add":" for (i = 0; i < numbrushes; i++) {"},{"Add":" dbrushes[i].firstside = LittleLong(dbrushes[i].firstside);"},{"Add":" dbrushes[i].numsides = LittleLong(dbrushes[i].numsides);"},{"Add":" dbrushes[i].contents = LittleLong(dbrushes[i].contents);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // areas"},{"Add":" //"},{"Add":" for (i = 0; i < numareas; i++) {"},{"Add":" dareas[i].numareaportals = LittleLong(dareas[i].numareaportals);"},{"Add":" dareas[i].firstareaportal = LittleLong(dareas[i].firstareaportal);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // areasportals"},{"Add":" //"},{"Add":" for (i = 0; i < numareaportals; i++) {"},{"Add":" dareaportals[i].portalnum = LittleLong(dareaportals[i].portalnum);"},{"Add":" dareaportals[i].otherarea = LittleLong(dareaportals[i].otherarea);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // visibility"},{"Add":" //"},{"Add":" if (todisk)"},{"Add":" j = dvis->numclusters;"},{"Add":" else"},{"Add":" j = LittleLong(dvis->numclusters);"},{"Add":" dvis->numclusters = LittleLong(dvis->numclusters);"},{"Add":" for (i = 0; i < j; i++) {"},{"Add":" dvis->bitofs[i][0] = LittleLong(dvis->bitofs[i][0]);"},{"Add":" dvis->bitofs[i][1] = LittleLong(dvis->bitofs[i][1]);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"dheader_t *header;"},{"Add":""},{"Add":"int32_t CopyLump(int32_t lump, void *dest, int32_t size) {"},{"Add":" int32_t length, ofs;"},{"Add":""},{"Add":" length = header->lumps[lump].filelen;"},{"Add":" ofs = header->lumps[lump].fileofs;"},{"Add":""},{"Add":" if (length % size)"},{"Add":" Error(\"LoadBSPFile: odd lump size (length: %i size: %i remainder: %i)\", length, size, length % size);"},{"Add":""},{"Add":" memcpy(dest, (byte *)header + ofs, length);"},{"Add":""},{"Add":" return length / size;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"LoadBSPFile"},{"Add":"============="},{"Add":"*/"},{"Add":"void LoadBSPFile(char *filename) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" InitBSPFile();"},{"Add":""},{"Add":" //"},{"Add":" // load the file header"},{"Add":" //"},{"Add":" LoadFile(filename, (void **)&header);"},{"Add":""},{"Add":" // swap the header"},{"Add":" for (i = 0; i < sizeof(dheader_t) / 4; i++)"},{"Add":" ((int32_t *)header)[i] = LittleLong(((int32_t *)header)[i]);"},{"Add":""},{"Add":" // qb: qbsp"},{"Add":" use_qbsp = false;"},{"Add":""},{"Add":" switch (header->ident) {"},{"Add":" case IDBSPHEADER:"},{"Add":" break;"},{"Add":" case QBSPHEADER:"},{"Add":" use_qbsp = true;"},{"Add":" printf(\"using QBSP extended limits \\n\");"},{"Add":" break;"},{"Add":" default:"},{"Add":" Error(\"%s is not a recognized BSP file (IBSP or QBSP).\","},{"Add":" filename);"},{"Add":" }"},{"Add":" if (header->version != BSPVERSION)"},{"Add":" Error(\"%s is version %i, not %i\", filename, header->version, BSPVERSION);"},{"Add":""},{"Add":" nummodels = CopyLump(LUMP_MODELS, dmodels, sizeof(dmodel_t));"},{"Add":" numvertexes = CopyLump(LUMP_VERTEXES, dvertexes, sizeof(dvertex_t));"},{"Add":" numplanes = CopyLump(LUMP_PLANES, dplanes, sizeof(dplane_t));"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" numleafs = CopyLump(LUMP_LEAFS, dleafsX, sizeof(dleaf_tx));"},{"Add":" numnodes = CopyLump(LUMP_NODES, dnodesX, sizeof(dnode_tx));"},{"Add":" numtexinfo = CopyLump(LUMP_TEXINFO, texinfo, sizeof(texinfo_t));"},{"Add":" numfaces = CopyLump(LUMP_FACES, dfacesX, sizeof(dface_tx));"},{"Add":" numleaffaces = CopyLump(LUMP_LEAFFACES, dleaffacesX, sizeof(dleaffacesX[0]));"},{"Add":" numleafbrushes = CopyLump(LUMP_LEAFBRUSHES, dleafbrushesX, sizeof(dleafbrushesX[0]));"},{"Add":" } else {"},{"Add":" numleafs = CopyLump(LUMP_LEAFS, dleafs, sizeof(dleaf_t));"},{"Add":" numnodes = CopyLump(LUMP_NODES, dnodes, sizeof(dnode_t));"},{"Add":" numtexinfo = CopyLump(LUMP_TEXINFO, texinfo, sizeof(texinfo_t));"},{"Add":" numfaces = CopyLump(LUMP_FACES, dfaces, sizeof(dface_t));"},{"Add":" numleaffaces = CopyLump(LUMP_LEAFFACES, dleaffaces, sizeof(dleaffaces[0]));"},{"Add":" numleafbrushes = CopyLump(LUMP_LEAFBRUSHES, dleafbrushes, sizeof(dleafbrushes[0]));"},{"Add":" }"},{"Add":""},{"Add":" numsurfedges = CopyLump(LUMP_SURFEDGES, dsurfedges, sizeof(dsurfedges[0]));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" numedges = CopyLump(LUMP_EDGES, dedgesX, sizeof(dedge_tx));"},{"Add":" else"},{"Add":" numedges = CopyLump(LUMP_EDGES, dedges, sizeof(dedge_t));"},{"Add":""},{"Add":" numbrushes = CopyLump(LUMP_BRUSHES, dbrushes, sizeof(dbrush_t));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" numbrushsides = CopyLump(LUMP_BRUSHSIDES, dbrushsidesX, sizeof(dbrushside_tx));"},{"Add":" else"},{"Add":" numbrushsides = CopyLump(LUMP_BRUSHSIDES, dbrushsides, sizeof(dbrushside_t));"},{"Add":""},{"Add":" numareas = CopyLump(LUMP_AREAS, dareas, sizeof(darea_t));"},{"Add":" numareaportals = CopyLump(LUMP_AREAPORTALS, dareaportals, sizeof(dareaportal_t));"},{"Add":""},{"Add":" visdatasize = CopyLump(LUMP_VISIBILITY, dvisdata, 1);"},{"Add":" lightdatasize = CopyLump(LUMP_LIGHTING, dlightdata, 1);"},{"Add":" entdatasize = CopyLump(LUMP_ENTITIES, dentdata, 1);"},{"Add":""},{"Add":" CopyLump(LUMP_POP, dpop, 1);"},{"Add":""},{"Add":" free(header); // everything has been copied out"},{"Add":""},{"Add":" //"},{"Add":" // swap everything"},{"Add":" //"},{"Add":" SwapBSPFile(false);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"LoadBSPFileTexinfo"},{"Add":""},{"Add":"Only loads the texinfo lump, so 4data can scan for textures"},{"Add":"============="},{"Add":"*/"},{"Add":"void LoadBSPFileTexinfo(char *filename) {"},{"Add":" int32_t i;"},{"Add":" FILE *f;"},{"Add":" int32_t length, ofs;"},{"Add":""},{"Add":" header = malloc(sizeof(dheader_t));"},{"Add":""},{"Add":" f = fopen(filename, \"rb\");"},{"Add":" if (!fread(header, sizeof(dheader_t), 1, f))"},{"Add":" Error(\"Texinfo header read error\");"},{"Add":""},{"Add":" // swap the header"},{"Add":" for (i = 0; i < sizeof(dheader_t) / 4; i++)"},{"Add":" ((int32_t *)header)[i] = LittleLong(((int32_t *)header)[i]);"},{"Add":""},{"Add":" if (header->ident != IDBSPHEADER && header->ident != QBSPHEADER)"},{"Add":" Error(\"%s is not an IBSP or QBSP file\", filename);"},{"Add":" if (header->version != BSPVERSION)"},{"Add":" Error(\"%s is version %i, not %i\", filename, header->version, BSPVERSION);"},{"Add":""},{"Add":" length = header->lumps[LUMP_TEXINFO].filelen;"},{"Add":" ofs = header->lumps[LUMP_TEXINFO].fileofs;"},{"Add":""},{"Add":" fseek(f, ofs, SEEK_SET);"},{"Add":" if (!fread(texinfo, length, 1, f))"},{"Add":" Error(\"Texinfo lump read error\");"},{"Add":" fclose(f);"},{"Add":""},{"Add":" numtexinfo = length / sizeof(texinfo_t);"},{"Add":""},{"Add":" free(header); // everything has been copied out"},{"Add":""},{"Add":" SwapBSPFile(false);"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================"},{"Add":""},{"Add":"FILE *wadfile;"},{"Add":"dheader_t outheader;"},{"Add":""},{"Add":"void AddLump(int32_t lumpnum, void *data, int32_t len) {"},{"Add":" lump_t *lump;"},{"Add":""},{"Add":" lump = &header->lumps[lumpnum];"},{"Add":""},{"Add":" lump->fileofs = LittleLong(ftell(wadfile));"},{"Add":" lump->filelen = LittleLong(len);"},{"Add":" SafeWrite(wadfile, data, (len + 3) & ~3);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"WriteBSPFile"},{"Add":""},{"Add":"Swaps the bsp file in place, so it should not be referenced again"},{"Add":"============="},{"Add":"*/"},{"Add":"void WriteBSPFile(char *filename) {"},{"Add":""},{"Add":" header = &outheader;"},{"Add":" memset(header, 0, sizeof(dheader_t));"},{"Add":""},{"Add":" SwapBSPFile(true);"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" header->ident = LittleLong(QBSPHEADER);"},{"Add":" else"},{"Add":" header->ident = LittleLong(IDBSPHEADER);"},{"Add":""},{"Add":" header->version = LittleLong(BSPVERSION);"},{"Add":""},{"Add":" wadfile = SafeOpenWrite(filename);"},{"Add":" SafeWrite(wadfile, header, sizeof(dheader_t)); // overwritten later"},{"Add":""},{"Add":" AddLump(LUMP_PLANES, dplanes, numplanes * sizeof(dplane_t));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" AddLump(LUMP_LEAFS, dleafsX, numleafs * sizeof(dleaf_tx));"},{"Add":" else"},{"Add":" AddLump(LUMP_LEAFS, dleafs, numleafs * sizeof(dleaf_t));"},{"Add":""},{"Add":" AddLump(LUMP_VERTEXES, dvertexes, numvertexes * sizeof(dvertex_t));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" AddLump(LUMP_NODES, dnodesX, numnodes * sizeof(dnode_tx));"},{"Add":" else"},{"Add":" AddLump(LUMP_NODES, dnodes, numnodes * sizeof(dnode_t));"},{"Add":""},{"Add":" AddLump(LUMP_TEXINFO, texinfo, numtexinfo * sizeof(texinfo_t));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" AddLump(LUMP_FACES, dfacesX, numfaces * sizeof(dface_tx));"},{"Add":" else"},{"Add":" AddLump(LUMP_FACES, dfaces, numfaces * sizeof(dface_t));"},{"Add":""},{"Add":" AddLump(LUMP_BRUSHES, dbrushes, numbrushes * sizeof(dbrush_t));"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" AddLump(LUMP_BRUSHSIDES, dbrushsidesX, numbrushsides * sizeof(dbrushside_tx));"},{"Add":" AddLump(LUMP_LEAFFACES, dleaffacesX, numleaffaces * sizeof(dleaffacesX[0]));"},{"Add":" AddLump(LUMP_LEAFBRUSHES, dleafbrushesX, numleafbrushes * sizeof(dleafbrushesX[0]));"},{"Add":" } else {"},{"Add":" AddLump(LUMP_BRUSHSIDES, dbrushsides, numbrushsides * sizeof(dbrushside_t));"},{"Add":" AddLump(LUMP_LEAFFACES, dleaffaces, numleaffaces * sizeof(dleaffaces[0]));"},{"Add":" AddLump(LUMP_LEAFBRUSHES, dleafbrushes, numleafbrushes * sizeof(dleafbrushes[0]));"},{"Add":" }"},{"Add":""},{"Add":" AddLump(LUMP_SURFEDGES, dsurfedges, numsurfedges * sizeof(dsurfedges[0]));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" AddLump(LUMP_EDGES, dedgesX, numedges * sizeof(dedge_tx));"},{"Add":" else"},{"Add":" AddLump(LUMP_EDGES, dedges, numedges * sizeof(dedge_t));"},{"Add":""},{"Add":" AddLump(LUMP_MODELS, dmodels, nummodels * sizeof(dmodel_t));"},{"Add":" AddLump(LUMP_AREAS, dareas, numareas * sizeof(darea_t));"},{"Add":" AddLump(LUMP_AREAPORTALS, dareaportals, numareaportals * sizeof(dareaportal_t));"},{"Add":""},{"Add":" AddLump(LUMP_LIGHTING, dlightdata, lightdatasize);"},{"Add":" AddLump(LUMP_VISIBILITY, dvisdata, visdatasize);"},{"Add":" AddLump(LUMP_ENTITIES, dentdata, entdatasize);"},{"Add":" AddLump(LUMP_POP, dpop, sizeof(dpop));"},{"Add":""},{"Add":" fseek(wadfile, 0, SEEK_SET);"},{"Add":" SafeWrite(wadfile, header, sizeof(dheader_t));"},{"Add":" fclose(wadfile);"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"PrintBSPFileSizes"},{"Add":""},{"Add":"Dumps info about current file"},{"Add":"============="},{"Add":"*/"},{"Add":"void PrintBSPFileSizes(void) {"},{"Add":" if (!num_entities)"},{"Add":" ParseEntities();"},{"Add":" printf(\"\\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< FILE STATS >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\");"},{"Add":" printf(\"models: %7i size: %7i\\n\", nummodels, (int32_t)(nummodels * sizeof(dmodel_t)));"},{"Add":" printf(\"brushes: %7i size: %7i\\n\", numbrushes, (int32_t)(numbrushes * sizeof(dbrush_t)));"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" printf(\"brushsides: %7i size: %7i\\n\", numbrushsides, (int32_t)(numbrushsides * sizeof(dbrushside_tx)));"},{"Add":" else"},{"Add":" printf(\"brushsides: %7i size: %7i\\n\", numbrushsides, (int32_t)(numbrushsides * sizeof(dbrushside_t)));"},{"Add":""},{"Add":" printf(\"planes: %7i size: %7i\\n\", numplanes, (int32_t)(numplanes * sizeof(dplane_t)));"},{"Add":" printf(\"texinfo: %7i size: %7i\\n\", numtexinfo, (int32_t)(numtexinfo * sizeof(texinfo_t)));"},{"Add":" printf(\"entdata: %7i size: %7i\\n\", num_entities, entdatasize);"},{"Add":""},{"Add":" printf(\"vertices: %7i size: %7i\\n\", numvertexes, (int32_t)(numvertexes * sizeof(dvertex_t)));"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" printf(\"nodes: %7i size: %7i\\n\", numnodes, (int32_t)(numnodes * sizeof(dnode_tx)));"},{"Add":" printf(\"faces: %7i size: %7i\\n\", numfaces, (int32_t)(numfaces * sizeof(dface_tx)));"},{"Add":" printf(\"leafs: %7i size: %7i\\n\", numleafs, (int32_t)(numleafs * sizeof(dleaf_tx)));"},{"Add":" printf(\"leaffaces: %7i size: %7i\\n\", numleaffaces, (int32_t)(numleaffaces * sizeof(dleaffacesX[0])));"},{"Add":" printf(\"leafbrushes: %7i size: %7i\\n\", numleafbrushes, (int32_t)(numleafbrushes * sizeof(dleafbrushesX[0])));"},{"Add":" printf(\"edges: %7i size: %7i\\n\", numedges, (int32_t)(numedges * sizeof(dedge_tx)));"},{"Add":" } else {"},{"Add":" printf(\"nodes: %7i size: %7i\\n\", numnodes, (int32_t)(numnodes * sizeof(dnode_t)));"},{"Add":" printf(\"faces: %7i size: %7i\\n\", numfaces, (int32_t)(numfaces * sizeof(dface_t)));"},{"Add":" printf(\"leafs: %7i size: %7i\\n\", numleafs, (int32_t)(numleafs * sizeof(dleaf_t)));"},{"Add":" printf(\"leaffaces: %7i size: %7i\\n\", numleaffaces, (int32_t)(numleaffaces * sizeof(dleaffaces[0])));"},{"Add":" printf(\"leafbrushes: %7i size: %7i\\n\", numleafbrushes, (int32_t)(numleafbrushes * sizeof(dleafbrushes[0])));"},{"Add":" printf(\"edges: %7i size: %7i\\n\", numedges, (int32_t)(numedges * sizeof(dedge_t)));"},{"Add":" }"},{"Add":""},{"Add":" printf(\"surfedges: %7i size: %7i\\n\", numsurfedges, (int32_t)(numsurfedges * sizeof(dsurfedges[0])));"},{"Add":" printf(\" lightdata size: %7i\\n\", lightdatasize);"},{"Add":" printf(\" visdata size: %7i\\n\", visdatasize);"},{"Add":"}"},{"Add":""},{"Add":"//============================================"},{"Add":""},{"Add":"int32_t num_entities;"},{"Add":"entity_t entities[MAX_MAP_ENTITIES_QBSP];"},{"Add":""},{"Add":"void StripTrailing(char *e) {"},{"Add":" char *s;"},{"Add":""},{"Add":" s = e + strlen(e) - 1;"},{"Add":" while (s >= e && *s <= 32) {"},{"Add":" *s = 0;"},{"Add":" s--;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"ParseEpair"},{"Add":"================="},{"Add":"*/"},{"Add":"epair_t *ParseEpair(void) {"},{"Add":" epair_t *e;"},{"Add":""},{"Add":" e = malloc(sizeof(epair_t));"},{"Add":" memset(e, 0, sizeof(epair_t));"},{"Add":""},{"Add":" if (strlen(token) >= MAX_KEY - 1)"},{"Add":" Error(\"ParseEpar: token too long\");"},{"Add":" e->key = copystring(token);"},{"Add":" GetToken(false);"},{"Add":" if (strlen(token) >= MAX_VALUE - 1)"},{"Add":" Error(\"ParseEpar: token too long\");"},{"Add":" e->value = copystring(token);"},{"Add":""},{"Add":" // strip trailing spaces"},{"Add":" StripTrailing(e->key);"},{"Add":" StripTrailing(e->value);"},{"Add":""},{"Add":" return e;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"ParseEntity"},{"Add":"================"},{"Add":"*/"},{"Add":"qboolean ParseEntity(void) {"},{"Add":" epair_t *e;"},{"Add":" entity_t *mapent;"},{"Add":""},{"Add":" if (!GetToken(true))"},{"Add":" return false;"},{"Add":""},{"Add":" if (strcmp(token, \"{\"))"},{"Add":" Error(\"ParseEntity: { not found\");"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (num_entities == MAX_MAP_ENTITIES_QBSP)"},{"Add":" Error(\"num_entities == MAX_MAP_ENTITIES_QBSP (%i)\", MAX_MAP_ENTITIES_QBSP);"},{"Add":" } else if (num_entities == MAX_MAP_ENTITIES)"},{"Add":" Error(\"num_entities == MAX_MAP_ENTITIES (%i)\", MAX_MAP_ENTITIES);"},{"Add":""},{"Add":" mapent = &entities[num_entities];"},{"Add":" num_entities++;"},{"Add":""},{"Add":" do {"},{"Add":" if (!GetToken(true))"},{"Add":" Error(\"ParseEntity: EOF without closing brace\");"},{"Add":" if (!strcmp(token, \"}\"))"},{"Add":" break;"},{"Add":" e = ParseEpair();"},{"Add":" e->next = mapent->epairs;"},{"Add":" mapent->epairs = e;"},{"Add":" } while (1);"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"ParseEntities"},{"Add":""},{"Add":"Parses the dentdata string into entities"},{"Add":"================"},{"Add":"*/"},{"Add":"void ParseEntities(void) {"},{"Add":" num_entities = 0;"},{"Add":" ParseFromMemory(dentdata, entdatasize);"},{"Add":""},{"Add":" while (ParseEntity()) {"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"UnparseEntities"},{"Add":""},{"Add":"Generates the dentdata string from all the entities"},{"Add":"================"},{"Add":"*/"},{"Add":"void UnparseEntities(void) {"},{"Add":" char *buf, *end;"},{"Add":" epair_t *ep;"},{"Add":" char line[2060];"},{"Add":" int32_t i;"},{"Add":" char key[1024], value[1024];"},{"Add":""},{"Add":" buf = dentdata;"},{"Add":" end = buf;"},{"Add":" *end = 0;"},{"Add":""},{"Add":" for (i = 0; i < num_entities; i++) {"},{"Add":" ep = entities[i].epairs;"},{"Add":" if (!ep)"},{"Add":" continue; // ent got removed"},{"Add":""},{"Add":" strcat(end, \"{\\n\");"},{"Add":" end += 2;"},{"Add":""},{"Add":" for (ep = entities[i].epairs; ep; ep = ep->next) {"},{"Add":" strcpy(key, ep->key);"},{"Add":" StripTrailing(key);"},{"Add":" strcpy(value, ep->value);"},{"Add":" StripTrailing(value);"},{"Add":""},{"Add":" sprintf(line, \"\\\"%s\\\" \\\"%s\\\"\\n\", key, value);"},{"Add":" strcat(end, line);"},{"Add":" end += strlen(line);"},{"Add":" }"},{"Add":" strcat(end, \"}\\n\");"},{"Add":" end += 2;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (end > buf + MAX_MAP_ENTSTRING_QBSP)"},{"Add":" Error(\"QBSP Entity text too long\");"},{"Add":" } else if (end > buf + MAX_MAP_ENTSTRING)"},{"Add":" Error(\"Entity text too long\");"},{"Add":" }"},{"Add":" entdatasize = end - buf + 1;"},{"Add":"}"},{"Add":""},{"Add":"void PrintEntity(entity_t *ent) {"},{"Add":" epair_t *ep;"},{"Add":""},{"Add":" printf(\"------- entity %p -------\\n\", ent);"},{"Add":" for (ep = ent->epairs; ep; ep = ep->next) {"},{"Add":" printf(\"%s = %s\\n\", ep->key, ep->value);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void SetKeyValue(entity_t *ent, char *key, char *value) {"},{"Add":" epair_t *ep;"},{"Add":""},{"Add":" for (ep = ent->epairs; ep; ep = ep->next)"},{"Add":" if (!strcmp(ep->key, key)) {"},{"Add":" free(ep->value);"},{"Add":" ep->value = copystring(value);"},{"Add":" return;"},{"Add":" }"},{"Add":" ep = malloc(sizeof(*ep));"},{"Add":" if (ep) // qb: gcc -fanalyzer: could be NULL"},{"Add":" {"},{"Add":" ep->next = ent->epairs;"},{"Add":" ent->epairs = ep;"},{"Add":" ep->key = copystring(key);"},{"Add":" ep->value = copystring(value);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"char *ValueForKey(entity_t *ent, char *key) {"},{"Add":" epair_t *ep;"},{"Add":""},{"Add":" for (ep = ent->epairs; ep; ep = ep->next)"},{"Add":" if (!strcmp(ep->key, key))"},{"Add":" return ep->value;"},{"Add":" return \"\";"},{"Add":"}"},{"Add":""},{"Add":"vec_t FloatForKey(entity_t *ent, char *key) {"},{"Add":" char *k;"},{"Add":""},{"Add":" k = ValueForKey(ent, key);"},{"Add":" return atof(k);"},{"Add":"}"},{"Add":""},{"Add":"void GetVectorForKey(entity_t *ent, char *key, vec3_t vec) {"},{"Add":" char *k;"},{"Add":" double v1, v2, v3;"},{"Add":""},{"Add":" k = ValueForKey(ent, key);"},{"Add":" // scanf into doubles, then assign, so it is vec_t size independent"},{"Add":" v1 = v2 = v3 = 0;"},{"Add":" sscanf(k, \"%lf %lf %lf\", &v1, &v2, &v3);"},{"Add":" vec[0] = v1;"},{"Add":" vec[1] = v2;"},{"Add":" vec[2] = v3;"},{"Add":"}"},{"Add":""},{"Add":"void RemoveLastEpair(entity_t *ent) {"},{"Add":" epair_t *e = ent->epairs->next;"},{"Add":""},{"Add":" if (ent->epairs->key)"},{"Add":" free(ent->epairs->key);"},{"Add":" if (ent->epairs->value)"},{"Add":" free(ent->epairs->value);"},{"Add":""},{"Add":" free(ent->epairs);"},{"Add":" ent->epairs = e;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"LICENSE","metadata":0},"context":[{"change":0,"pos":17}],"contents":[{"Add":" GNU GENERAL PUBLIC LICENSE"},{"Add":" Version 2, June 1991"},{"Add":""},{"Add":" Copyright (C) 1989, 1991 Free Software Foundation, Inc.,"},{"Add":" 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA"},{"Add":" Everyone is permitted to copy and distribute verbatim copies"},{"Add":" of this license document, but changing it is not allowed."},{"Add":""},{"Add":" Preamble"},{"Add":""},{"Add":" The licenses for most software are designed to take away your"},{"Add":"freedom to share and change it. By contrast, the GNU General Public"},{"Add":"License is intended to guarantee your freedom to share and change free"},{"Add":"software--to make sure the software is free for all its users. This"},{"Add":"General Public License applies to most of the Free Software"},{"Add":"Foundation's software and to any other program whose authors commit to"},{"Add":"using it. (Some other Free Software Foundation software is covered by"},{"Add":"the GNU Lesser General Public License instead.) You can apply it to"},{"Add":"your programs, too."},{"Add":""},{"Add":" When we speak of free software, we are referring to freedom, not"},{"Add":"price. Our General Public Licenses are designed to make sure that you"},{"Add":"have the freedom to distribute copies of free software (and charge for"},{"Add":"this service if you wish), that you receive source code or can get it"},{"Add":"if you want it, that you can change the software or use pieces of it"},{"Add":"in new free programs; and that you know you can do these things."},{"Add":""},{"Add":" To protect your rights, we need to make restrictions that forbid"},{"Add":"anyone to deny you these rights or to ask you to surrender the rights."},{"Add":"These restrictions translate to certain responsibilities for you if you"},{"Add":"distribute copies of the software, or if you modify it."},{"Add":""},{"Add":" For example, if you distribute copies of such a program, whether"},{"Add":"gratis or for a fee, you must give the recipients all the rights that"},{"Add":"you have. You must make sure that they, too, receive or can get the"},{"Add":"source code. And you must show them these terms so they know their"},{"Add":"rights."},{"Add":""},{"Add":" We protect your rights with two steps: (1) copyright the software, and"},{"Add":"(2) offer you this license which gives you legal permission to copy,"},{"Add":"distribute and/or modify the software."},{"Add":""},{"Add":" Also, for each author's protection and ours, we want to make certain"},{"Add":"that everyone understands that there is no warranty for this free"},{"Add":"software. If the software is modified by someone else and passed on, we"},{"Add":"want its recipients to know that what they have is not the original, so"},{"Add":"that any problems introduced by others will not reflect on the original"},{"Add":"authors' reputations."},{"Add":""},{"Add":" Finally, any free program is threatened constantly by software"},{"Add":"patents. We wish to avoid the danger that redistributors of a free"},{"Add":"program will individually obtain patent licenses, in effect making the"},{"Add":"program proprietary. To prevent this, we have made it clear that any"},{"Add":"patent must be licensed for everyone's free use or not licensed at all."},{"Add":""},{"Add":" The precise terms and conditions for copying, distribution and"},{"Add":"modification follow."},{"Add":""},{"Add":" GNU GENERAL PUBLIC LICENSE"},{"Add":" TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION"},{"Add":""},{"Add":" 0. This License applies to any program or other work which contains"},{"Add":"a notice placed by the copyright holder saying it may be distributed"},{"Add":"under the terms of this General Public License. The \"Program\", below,"},{"Add":"refers to any such program or work, and a \"work based on the Program\""},{"Add":"means either the Program or any derivative work under copyright law:"},{"Add":"that is to say, a work containing the Program or a portion of it,"},{"Add":"either verbatim or with modifications and/or translated into another"},{"Add":"language. (Hereinafter, translation is included without limitation in"},{"Add":"the term \"modification\".) Each licensee is addressed as \"you\"."},{"Add":""},{"Add":"Activities other than copying, distribution and modification are not"},{"Add":"covered by this License; they are outside its scope. The act of"},{"Add":"running the Program is not restricted, and the output from the Program"},{"Add":"is covered only if its contents constitute a work based on the"},{"Add":"Program (independent of having been made by running the Program)."},{"Add":"Whether that is true depends on what the Program does."},{"Add":""},{"Add":" 1. You may copy and distribute verbatim copies of the Program's"},{"Add":"source code as you receive it, in any medium, provided that you"},{"Add":"conspicuously and appropriately publish on each copy an appropriate"},{"Add":"copyright notice and disclaimer of warranty; keep intact all the"},{"Add":"notices that refer to this License and to the absence of any warranty;"},{"Add":"and give any other recipients of the Program a copy of this License"},{"Add":"along with the Program."},{"Add":""},{"Add":"You may charge a fee for the physical act of transferring a copy, and"},{"Add":"you may at your option offer warranty protection in exchange for a fee."},{"Add":""},{"Add":" 2. You may modify your copy or copies of the Program or any portion"},{"Add":"of it, thus forming a work based on the Program, and copy and"},{"Add":"distribute such modifications or work under the terms of Section 1"},{"Add":"above, provided that you also meet all of these conditions:"},{"Add":""},{"Add":" a) You must cause the modified files to carry prominent notices"},{"Add":" stating that you changed the files and the date of any change."},{"Add":""},{"Add":" b) You must cause any work that you distribute or publish, that in"},{"Add":" whole or in part contains or is derived from the Program or any"},{"Add":" part thereof, to be licensed as a whole at no charge to all third"},{"Add":" parties under the terms of this License."},{"Add":""},{"Add":" c) If the modified program normally reads commands interactively"},{"Add":" when run, you must cause it, when started running for such"},{"Add":" interactive use in the most ordinary way, to print or display an"},{"Add":" announcement including an appropriate copyright notice and a"},{"Add":" notice that there is no warranty (or else, saying that you provide"},{"Add":" a warranty) and that users may redistribute the program under"},{"Add":" these conditions, and telling the user how to view a copy of this"},{"Add":" License. (Exception: if the Program itself is interactive but"},{"Add":" does not normally print such an announcement, your work based on"},{"Add":" the Program is not required to print an announcement.)"},{"Add":""},{"Add":"These requirements apply to the modified work as a whole. If"},{"Add":"identifiable sections of that work are not derived from the Program,"},{"Add":"and can be reasonably considered independent and separate works in"},{"Add":"themselves, then this License, and its terms, do not apply to those"},{"Add":"sections when you distribute them as separate works. But when you"},{"Add":"distribute the same sections as part of a whole which is a work based"},{"Add":"on the Program, the distribution of the whole must be on the terms of"},{"Add":"this License, whose permissions for other licensees extend to the"},{"Add":"entire whole, and thus to each and every part regardless of who wrote it."},{"Add":""},{"Add":"Thus, it is not the intent of this section to claim rights or contest"},{"Add":"your rights to work written entirely by you; rather, the intent is to"},{"Add":"exercise the right to control the distribution of derivative or"},{"Add":"collective works based on the Program."},{"Add":""},{"Add":"In addition, mere aggregation of another work not based on the Program"},{"Add":"with the Program (or with a work based on the Program) on a volume of"},{"Add":"a storage or distribution medium does not bring the other work under"},{"Add":"the scope of this License."},{"Add":""},{"Add":" 3. You may copy and distribute the Program (or a work based on it,"},{"Add":"under Section 2) in object code or executable form under the terms of"},{"Add":"Sections 1 and 2 above provided that you also do one of the following:"},{"Add":""},{"Add":" a) Accompany it with the complete corresponding machine-readable"},{"Add":" source code, which must be distributed under the terms of Sections"},{"Add":" 1 and 2 above on a medium customarily used for software interchange; or,"},{"Add":""},{"Add":" b) Accompany it with a written offer, valid for at least three"},{"Add":" years, to give any third party, for a charge no more than your"},{"Add":" cost of physically performing source distribution, a complete"},{"Add":" machine-readable copy of the corresponding source code, to be"},{"Add":" distributed under the terms of Sections 1 and 2 above on a medium"},{"Add":" customarily used for software interchange; or,"},{"Add":""},{"Add":" c) Accompany it with the information you received as to the offer"},{"Add":" to distribute corresponding source code. (This alternative is"},{"Add":" allowed only for noncommercial distribution and only if you"},{"Add":" received the program in object code or executable form with such"},{"Add":" an offer, in accord with Subsection b above.)"},{"Add":""},{"Add":"The source code for a work means the preferred form of the work for"},{"Add":"making modifications to it. For an executable work, complete source"},{"Add":"code means all the source code for all modules it contains, plus any"},{"Add":"associated interface definition files, plus the scripts used to"},{"Add":"control compilation and installation of the executable. However, as a"},{"Add":"special exception, the source code distributed need not include"},{"Add":"anything that is normally distributed (in either source or binary"},{"Add":"form) with the major components (compiler, kernel, and so on) of the"},{"Add":"operating system on which the executable runs, unless that component"},{"Add":"itself accompanies the executable."},{"Add":""},{"Add":"If distribution of executable or object code is made by offering"},{"Add":"access to copy from a designated place, then offering equivalent"},{"Add":"access to copy the source code from the same place counts as"},{"Add":"distribution of the source code, even though third parties are not"},{"Add":"compelled to copy the source along with the object code."},{"Add":""},{"Add":" 4. You may not copy, modify, sublicense, or distribute the Program"},{"Add":"except as expressly provided under this License. Any attempt"},{"Add":"otherwise to copy, modify, sublicense or distribute the Program is"},{"Add":"void, and will automatically terminate your rights under this License."},{"Add":"However, parties who have received copies, or rights, from you under"},{"Add":"this License will not have their licenses terminated so long as such"},{"Add":"parties remain in full compliance."},{"Add":""},{"Add":" 5. You are not required to accept this License, since you have not"},{"Add":"signed it. However, nothing else grants you permission to modify or"},{"Add":"distribute the Program or its derivative works. These actions are"},{"Add":"prohibited by law if you do not accept this License. Therefore, by"},{"Add":"modifying or distributing the Program (or any work based on the"},{"Add":"Program), you indicate your acceptance of this License to do so, and"},{"Add":"all its terms and conditions for copying, distributing or modifying"},{"Add":"the Program or works based on it."},{"Add":""},{"Add":" 6. Each time you redistribute the Program (or any work based on the"},{"Add":"Program), the recipient automatically receives a license from the"},{"Add":"original licensor to copy, distribute or modify the Program subject to"},{"Add":"these terms and conditions. You may not impose any further"},{"Add":"restrictions on the recipients' exercise of the rights granted herein."},{"Add":"You are not responsible for enforcing compliance by third parties to"},{"Add":"this License."},{"Add":""},{"Add":" 7. If, as a consequence of a court judgment or allegation of patent"},{"Add":"infringement or for any other reason (not limited to patent issues),"},{"Add":"conditions are imposed on you (whether by court order, agreement or"},{"Add":"otherwise) that contradict the conditions of this License, they do not"},{"Add":"excuse you from the conditions of this License. If you cannot"},{"Add":"distribute so as to satisfy simultaneously your obligations under this"},{"Add":"License and any other pertinent obligations, then as a consequence you"},{"Add":"may not distribute the Program at all. For example, if a patent"},{"Add":"license would not permit royalty-free redistribution of the Program by"},{"Add":"all those who receive copies directly or indirectly through you, then"},{"Add":"the only way you could satisfy both it and this License would be to"},{"Add":"refrain entirely from distribution of the Program."},{"Add":""},{"Add":"If any portion of this section is held invalid or unenforceable under"},{"Add":"any particular circumstance, the balance of the section is intended to"},{"Add":"apply and the section as a whole is intended to apply in other"},{"Add":"circumstances."},{"Add":""},{"Add":"It is not the purpose of this section to induce you to infringe any"},{"Add":"patents or other property right claims or to contest validity of any"},{"Add":"such claims; this section has the sole purpose of protecting the"},{"Add":"integrity of the free software distribution system, which is"},{"Add":"implemented by public license practices. Many people have made"},{"Add":"generous contributions to the wide range of software distributed"},{"Add":"through that system in reliance on consistent application of that"},{"Add":"system; it is up to the author/donor to decide if he or she is willing"},{"Add":"to distribute software through any other system and a licensee cannot"},{"Add":"impose that choice."},{"Add":""},{"Add":"This section is intended to make thoroughly clear what is believed to"},{"Add":"be a consequence of the rest of this License."},{"Add":""},{"Add":" 8. If the distribution and/or use of the Program is restricted in"},{"Add":"certain countries either by patents or by copyrighted interfaces, the"},{"Add":"original copyright holder who places the Program under this License"},{"Add":"may add an explicit geographical distribution limitation excluding"},{"Add":"those countries, so that distribution is permitted only in or among"},{"Add":"countries not thus excluded. In such case, this License incorporates"},{"Add":"the limitation as if written in the body of this License."},{"Add":""},{"Add":" 9. The Free Software Foundation may publish revised and/or new versions"},{"Add":"of the General Public License from time to time. Such new versions will"},{"Add":"be similar in spirit to the present version, but may differ in detail to"},{"Add":"address new problems or concerns."},{"Add":""},{"Add":"Each version is given a distinguishing version number. If the Program"},{"Add":"specifies a version number of this License which applies to it and \"any"},{"Add":"later version\", you have the option of following the terms and conditions"},{"Add":"either of that version or of any later version published by the Free"},{"Add":"Software Foundation. If the Program does not specify a version number of"},{"Add":"this License, you may choose any version ever published by the Free Software"},{"Add":"Foundation."},{"Add":""},{"Add":" 10. If you wish to incorporate parts of the Program into other free"},{"Add":"programs whose distribution conditions are different, write to the author"},{"Add":"to ask for permission. For software which is copyrighted by the Free"},{"Add":"Software Foundation, write to the Free Software Foundation; we sometimes"},{"Add":"make exceptions for this. Our decision will be guided by the two goals"},{"Add":"of preserving the free status of all derivatives of our free software and"},{"Add":"of promoting the sharing and reuse of software generally."},{"Add":""},{"Add":" NO WARRANTY"},{"Add":""},{"Add":" 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY"},{"Add":"FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN"},{"Add":"OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES"},{"Add":"PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED"},{"Add":"OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF"},{"Add":"MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS"},{"Add":"TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE"},{"Add":"PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,"},{"Add":"REPAIR OR CORRECTION."},{"Add":""},{"Add":" 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING"},{"Add":"WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR"},{"Add":"REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,"},{"Add":"INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING"},{"Add":"OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED"},{"Add":"TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY"},{"Add":"YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER"},{"Add":"PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE"},{"Add":"POSSIBILITY OF SUCH DAMAGES."},{"Add":""},{"Add":" END OF TERMS AND CONDITIONS"},{"Add":""},{"Add":" How to Apply These Terms to Your New Programs"},{"Add":""},{"Add":" If you develop a new program, and you want it to be of the greatest"},{"Add":"possible use to the public, the best way to achieve this is to make it"},{"Add":"free software which everyone can redistribute and change under these terms."},{"Add":""},{"Add":" To do so, attach the following notices to the program. It is safest"},{"Add":"to attach them to the start of each source file to most effectively"},{"Add":"convey the exclusion of warranty; and each file should have at least"},{"Add":"the \"copyright\" line and a pointer to where the full notice is found."},{"Add":""},{"Add":" "},{"Add":" Copyright (C) "},{"Add":""},{"Add":" This program is free software; you can redistribute it and/or modify"},{"Add":" it under the terms of the GNU General Public License as published by"},{"Add":" the Free Software Foundation; either version 2 of the License, or"},{"Add":" (at your option) any later version."},{"Add":""},{"Add":" This program is distributed in the hope that it will be useful,"},{"Add":" but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":" GNU General Public License for more details."},{"Add":""},{"Add":" You should have received a copy of the GNU General Public License along"},{"Add":" with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":" 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":""},{"Add":"Also add information on how to contact you by electronic and paper mail."},{"Add":""},{"Add":"If the program is interactive, make it output a short notice like this"},{"Add":"when it starts in an interactive mode:"},{"Add":""},{"Add":" Gnomovision version 69, Copyright (C) year name of author"},{"Add":" Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'."},{"Add":" This is free software, and you are welcome to redistribute it"},{"Add":" under certain conditions; type `show c' for details."},{"Add":""},{"Add":"The hypothetical commands `show w' and `show c' should show the appropriate"},{"Add":"parts of the General Public License. Of course, the commands you use may"},{"Add":"be called something other than `show w' and `show c'; they could even be"},{"Add":"mouse-clicks or menu items--whatever suits your program."},{"Add":""},{"Add":"You should also get your employer (if you work as a programmer) or your"},{"Add":"school, if any, to sign a \"copyright disclaimer\" for the program, if"},{"Add":"necessary. Here is a sample; alter the names:"},{"Add":""},{"Add":" Yoyodyne, Inc., hereby disclaims all copyright interest in the program"},{"Add":" `Gnomovision' (which makes passes at compilers) written by James Hacker."},{"Add":""},{"Add":" , 1 April 1989"},{"Add":" Ty Coon, President of Vice"},{"Add":""},{"Add":"This General Public License does not permit incorporating your program into"},{"Add":"proprietary programs. If your program is a subroutine library, you may"},{"Add":"consider it more useful to permit linking proprietary applications with the"},{"Add":"library. If this is what you want to do, use the GNU Lesser General"},{"Add":"Public License instead of this License."}]}},{"FileAdd":{"meta":{"basename":"4vis","metadata":576},"context":[{"change":0,"pos":17}],"contents":[]}},{"FileAdd":{"meta":{"basename":"flow.c","metadata":0},"context":[{"change":0,"pos":158138}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":"#include \"vis.h\""},{"Add":""},{"Add":"/*"},{"Add":""},{"Add":" each portal will have a list of all possible to see from first portal"},{"Add":""},{"Add":" if (!thread->portalmightsee[portalnum])"},{"Add":""},{"Add":" portal mightsee"},{"Add":""},{"Add":" for p2 = all other portals in leaf"},{"Add":" get sperating planes"},{"Add":" for all portals that might be seen by p2"},{"Add":" mark as unseen if not present in seperating plane"},{"Add":" flood fill a new mightsee"},{"Add":" save as passagemightsee"},{"Add":""},{"Add":""},{"Add":" void CalcMightSee (leaf_t *leaf,"},{"Add":"*/"},{"Add":""},{"Add":"int32_t CountBits(byte *bits, int32_t numbits) {"},{"Add":" int32_t i;"},{"Add":" int32_t c;"},{"Add":""},{"Add":" c = 0;"},{"Add":" for (i = 0; i < numbits; i++)"},{"Add":" if (bits[i >> 3] & (1 << (i & 7)))"},{"Add":" c++;"},{"Add":""},{"Add":" return c;"},{"Add":"}"},{"Add":""},{"Add":"int32_t c_fullskip;"},{"Add":"int32_t c_portalskip, c_leafskip;"},{"Add":"int32_t c_vistest, c_mighttest;"},{"Add":""},{"Add":"int32_t c_chop, c_nochop;"},{"Add":""},{"Add":"int32_t active;"},{"Add":""},{"Add":"void CheckStack(leaf_t *leaf, threaddata_t *thread) {"},{"Add":" pstack_t *p, *p2;"},{"Add":""},{"Add":" for (p = thread->pstack_head.next; p; p = p->next) {"},{"Add":" //\t\tprintf (\"=\");"},{"Add":" if (p->leaf == leaf)"},{"Add":" Error(\"CheckStack: leaf recursion\");"},{"Add":" for (p2 = thread->pstack_head.next; p2 != p; p2 = p2->next)"},{"Add":" if (p2->leaf == p->leaf)"},{"Add":" Error(\"CheckStack: late leaf recursion\");"},{"Add":" }"},{"Add":" //\tprintf (\"\\n\");"},{"Add":"}"},{"Add":""},{"Add":"winding_t *AllocStackWinding(pstack_t *stack) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (stack->freewindings[i]) {"},{"Add":" stack->freewindings[i] = 0;"},{"Add":" return &stack->windings[i];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" Error(\"AllocStackWinding: failed\");"},{"Add":""},{"Add":" return NULL;"},{"Add":"}"},{"Add":""},{"Add":"void FreeStackWinding(winding_t *w, pstack_t *stack) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" i = w - stack->windings;"},{"Add":""},{"Add":" if (i < 0 || i > 2)"},{"Add":" return; // not from local"},{"Add":""},{"Add":" if (stack->freewindings[i])"},{"Add":" Error(\"FreeStackWinding: allready free\");"},{"Add":" stack->freewindings[i] = 1;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"ChopWinding_flow"},{"Add":""},{"Add":"=============="},{"Add":"*/"},{"Add":"winding_t *ChopWinding_flow(winding_t *in, pstack_t *stack, plane_t *split) // qb: renamed, dupe in polylib.c"},{"Add":"{"},{"Add":" vec_t dists[128];"},{"Add":" int32_t sides[128];"},{"Add":" int32_t counts[3];"},{"Add":" vec_t dot;"},{"Add":" int32_t i, j;"},{"Add":" vec_t *p1, *p2;"},{"Add":" vec3_t mid;"},{"Add":" winding_t *neww;"},{"Add":""},{"Add":" counts[0] = counts[1] = counts[2] = 0;"},{"Add":""},{"Add":" // determine sides for each point"},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" dot = DotProduct(in->points[i], split->normal);"},{"Add":" dot -= split->dist;"},{"Add":" dists[i] = dot;"},{"Add":" if (dot > ON_EPSILON)"},{"Add":" sides[i] = SIDE_FRONT;"},{"Add":" else if (dot < -ON_EPSILON)"},{"Add":" sides[i] = SIDE_BACK;"},{"Add":" else {"},{"Add":" sides[i] = SIDE_ON;"},{"Add":" }"},{"Add":" counts[sides[i]]++;"},{"Add":" }"},{"Add":""},{"Add":" if (!counts[1])"},{"Add":" return in; // completely on front side"},{"Add":""},{"Add":" if (!counts[0]) {"},{"Add":" FreeStackWinding(in, stack);"},{"Add":" return NULL;"},{"Add":" }"},{"Add":""},{"Add":" sides[i] = sides[0];"},{"Add":" dists[i] = dists[0];"},{"Add":""},{"Add":" neww = AllocStackWinding(stack);"},{"Add":""},{"Add":" neww->numpoints = 0;"},{"Add":""},{"Add":" for (i = 0; i < in->numpoints; i++) {"},{"Add":" p1 = in->points[i];"},{"Add":""},{"Add":" if (neww->numpoints == MAX_POINTS_ON_FIXED_WINDING) {"},{"Add":" FreeStackWinding(neww, stack);"},{"Add":" return in; // can't chop -- fall back to original"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i] == SIDE_ON) {"},{"Add":" VectorCopy(p1, neww->points[neww->numpoints]);"},{"Add":" neww->numpoints++;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i] == SIDE_FRONT) {"},{"Add":" VectorCopy(p1, neww->points[neww->numpoints]);"},{"Add":" neww->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" if (sides[i + 1] == SIDE_ON || sides[i + 1] == sides[i])"},{"Add":" continue;"},{"Add":""},{"Add":" if (neww->numpoints == MAX_POINTS_ON_FIXED_WINDING) {"},{"Add":" FreeStackWinding(neww, stack);"},{"Add":" return in; // can't chop -- fall back to original"},{"Add":" }"},{"Add":""},{"Add":" // generate a split point"},{"Add":" p2 = in->points[(i + 1) % in->numpoints];"},{"Add":""},{"Add":" dot = dists[i] / (dists[i] - dists[i + 1]);"},{"Add":" for (j = 0; j < 3; j++) { // avoid round off error when possible"},{"Add":" if (split->normal[j] == 1)"},{"Add":" mid[j] = split->dist;"},{"Add":" else if (split->normal[j] == -1)"},{"Add":" mid[j] = -split->dist;"},{"Add":" else"},{"Add":" mid[j] = p1[j] + dot * (p2[j] - p1[j]);"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(mid, neww->points[neww->numpoints]);"},{"Add":" neww->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" // free the original winding"},{"Add":" FreeStackWinding(in, stack);"},{"Add":""},{"Add":" return neww;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"ClipToSeperators"},{"Add":""},{"Add":"Source, pass, and target are an ordering of portals."},{"Add":""},{"Add":"Generates seperating planes canidates by taking two points from source and one"},{"Add":"point from pass, and clips target by them."},{"Add":""},{"Add":"If target is totally clipped away, that portal can not be seen through."},{"Add":""},{"Add":"Normal clip keeps target on the same side as pass, which is correct if the"},{"Add":"order goes source, pass, target. If the order goes pass, source, target then"},{"Add":"flipclip should be set."},{"Add":"=============="},{"Add":"*/"},{"Add":"winding_t *ClipToSeperators(winding_t *source, winding_t *pass, winding_t *target, qboolean flipclip, pstack_t *stack) {"},{"Add":" int32_t i, j, k, l;"},{"Add":" plane_t plane;"},{"Add":" vec3_t v1, v2;"},{"Add":" float d;"},{"Add":" vec_t length;"},{"Add":" int32_t counts[3];"},{"Add":" qboolean fliptest;"},{"Add":""},{"Add":" // check all combinations"},{"Add":" for (i = 0; i < source->numpoints; i++) {"},{"Add":" l = (i + 1) % source->numpoints;"},{"Add":" VectorSubtract(source->points[l], source->points[i], v1);"},{"Add":""},{"Add":" // fing a vertex of pass that makes a plane that puts all of the"},{"Add":" // vertexes of pass on the front side and all of the vertexes of"},{"Add":" // source on the back side"},{"Add":" for (j = 0; j < pass->numpoints; j++) {"},{"Add":" VectorSubtract(pass->points[j], source->points[i], v2);"},{"Add":""},{"Add":" plane.normal[0] = v1[1] * v2[2] - v1[2] * v2[1];"},{"Add":" plane.normal[1] = v1[2] * v2[0] - v1[0] * v2[2];"},{"Add":" plane.normal[2] = v1[0] * v2[1] - v1[1] * v2[0];"},{"Add":""},{"Add":" // if points don't make a valid plane, skip it"},{"Add":""},{"Add":" length = plane.normal[0] * plane.normal[0] + plane.normal[1] * plane.normal[1] + plane.normal[2] * plane.normal[2];"},{"Add":""},{"Add":" if (length < ON_EPSILON)"},{"Add":" continue;"},{"Add":""},{"Add":" length = 1 / sqrt(length);"},{"Add":""},{"Add":" plane.normal[0] *= length;"},{"Add":" plane.normal[1] *= length;"},{"Add":" plane.normal[2] *= length;"},{"Add":""},{"Add":" plane.dist = DotProduct(pass->points[j], plane.normal);"},{"Add":""},{"Add":" //"},{"Add":" // find out which side of the generated seperating plane has the"},{"Add":" // source portal"},{"Add":" //"},{"Add":"#if 1"},{"Add":" fliptest = false;"},{"Add":" for (k = 0; k < source->numpoints; k++) {"},{"Add":" if (k == i || k == l)"},{"Add":" continue;"},{"Add":" d = DotProduct(source->points[k], plane.normal) - plane.dist;"},{"Add":" if (d < -ON_EPSILON) { // source is on the negative side, so we want all"},{"Add":" // pass and target on the positive side"},{"Add":" fliptest = false;"},{"Add":" break;"},{"Add":" } else if (d > ON_EPSILON) { // source is on the positive side, so we want all"},{"Add":" // pass and target on the negative side"},{"Add":" fliptest = true;"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" if (k == source->numpoints)"},{"Add":" continue; // planar with source portal"},{"Add":"#else"},{"Add":" fliptest = flipclip;"},{"Add":"#endif"},{"Add":" //"},{"Add":" // flip the normal if the source portal is backwards"},{"Add":" //"},{"Add":" if (fliptest) {"},{"Add":" VectorSubtract(vec3_origin, plane.normal, plane.normal);"},{"Add":" plane.dist = -plane.dist;"},{"Add":" }"},{"Add":"#if 1"},{"Add":" //"},{"Add":" // if all of the pass portal points are now on the positive side,"},{"Add":" // this is the seperating plane"},{"Add":" //"},{"Add":" counts[0] = counts[1] = counts[2] = 0;"},{"Add":" for (k = 0; k < pass->numpoints; k++) {"},{"Add":" if (k == j)"},{"Add":" continue;"},{"Add":" d = DotProduct(pass->points[k], plane.normal) - plane.dist;"},{"Add":" if (d < -ON_EPSILON)"},{"Add":" break;"},{"Add":" else if (d > ON_EPSILON)"},{"Add":" counts[0]++;"},{"Add":" else"},{"Add":" counts[2]++;"},{"Add":" }"},{"Add":" if (k != pass->numpoints)"},{"Add":" continue; // points on negative side, not a seperating plane"},{"Add":""},{"Add":" if (!counts[0])"},{"Add":" continue; // planar with seperating plane"},{"Add":"#else"},{"Add":" k = (j + 1) % pass->numpoints;"},{"Add":" d = DotProduct(pass->points[k], plane.normal) - plane.dist;"},{"Add":" if (d < -ON_EPSILON)"},{"Add":" continue;"},{"Add":" k = (j + pass->numpoints - 1) % pass->numpoints;"},{"Add":" d = DotProduct(pass->points[k], plane.normal) - plane.dist;"},{"Add":" if (d < -ON_EPSILON)"},{"Add":" continue;"},{"Add":"#endif"},{"Add":" //"},{"Add":" // flip the normal if we want the back side"},{"Add":" //"},{"Add":" if (flipclip) {"},{"Add":" VectorSubtract(vec3_origin, plane.normal, plane.normal);"},{"Add":" plane.dist = -plane.dist;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // clip target by the seperating plane"},{"Add":" //"},{"Add":" target = ChopWinding_flow(target, stack, &plane);"},{"Add":" if (!target)"},{"Add":" return NULL; // target is not visible"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return target;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"RecursiveLeafFlow"},{"Add":""},{"Add":"Flood fill through the leafs"},{"Add":"If src_portal is NULL, this is the originating leaf"},{"Add":"=================="},{"Add":"*/"},{"Add":"void RecursiveLeafFlow(int32_t leafnum, threaddata_t *thread, pstack_t *prevstack) {"},{"Add":" pstack_t stack;"},{"Add":" portal_t *p;"},{"Add":" plane_t backplane;"},{"Add":" leaf_t *leaf;"},{"Add":" int32_t i, j;"},{"Add":" long *test, *might, *vis, more;"},{"Add":" int32_t pnum;"},{"Add":""},{"Add":" thread->c_chains++;"},{"Add":""},{"Add":" leaf = &leafs[leafnum];"},{"Add":" //\tCheckStack (leaf, thread);"},{"Add":""},{"Add":" prevstack->next = &stack;"},{"Add":""},{"Add":" stack.next = NULL;"},{"Add":" stack.leaf = leaf;"},{"Add":" stack.portal = NULL;"},{"Add":""},{"Add":" might = (long *)stack.mightsee;"},{"Add":" vis = (long *)thread->base->portalvis;"},{"Add":""},{"Add":" // check all portals for flowing into other leafs"},{"Add":" for (i = 0; i < leaf->numportals; i++) {"},{"Add":" p = leaf->portals[i];"},{"Add":" pnum = p - portals;"},{"Add":""},{"Add":" if (!(prevstack->mightsee[pnum >> 3] & (1 << (pnum & 7)))) {"},{"Add":" continue; // can't possibly see it"},{"Add":" }"},{"Add":""},{"Add":" // if the portal can't see anything we haven't allready seen, skip it"},{"Add":" if (p->status == stat_done) {"},{"Add":" test = (long *)p->portalvis;"},{"Add":" } else {"},{"Add":" test = (long *)p->portalflood;"},{"Add":" }"},{"Add":""},{"Add":" more = 0;"},{"Add":" for (j = 0; j < portallongs; j++) {"},{"Add":" might[j] = ((long *)prevstack->mightsee)[j] & test[j];"},{"Add":" more |= (might[j] & ~vis[j]);"},{"Add":" }"},{"Add":""},{"Add":" if (!more &&"},{"Add":" (thread->base->portalvis[pnum >> 3] & (1 << (pnum & 7)))) { // can't see anything new"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" // get plane of portal, point normal into the neighbor leaf"},{"Add":" stack.portalplane = p->plane;"},{"Add":" VectorSubtract(vec3_origin, p->plane.normal, backplane.normal);"},{"Add":" backplane.dist = -p->plane.dist;"},{"Add":""},{"Add":" //\t\tc_portalcheck++;"},{"Add":""},{"Add":" stack.portal = p;"},{"Add":" stack.next = NULL;"},{"Add":" stack.freewindings[0] = 1;"},{"Add":" stack.freewindings[1] = 1;"},{"Add":" stack.freewindings[2] = 1;"},{"Add":""},{"Add":"#if 1"},{"Add":" {"},{"Add":" float d;"},{"Add":""},{"Add":" d = DotProduct(p->origin, thread->pstack_head.portalplane.normal);"},{"Add":" d -= thread->pstack_head.portalplane.dist;"},{"Add":" if (d < -p->radius) {"},{"Add":" continue;"},{"Add":" } else if (d > p->radius) {"},{"Add":" stack.pass = p->winding;"},{"Add":" } else {"},{"Add":" stack.pass = ChopWinding_flow(p->winding, &stack, &thread->pstack_head.portalplane);"},{"Add":" if (!stack.pass)"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":"#else"},{"Add":" stack.pass = ChopWinding_flow(p->winding, &stack, &thread->pstack_head.portalplane);"},{"Add":" if (!stack.pass)"},{"Add":" continue;"},{"Add":"#endif"},{"Add":""},{"Add":"#if 1"},{"Add":" {"},{"Add":" float d;"},{"Add":""},{"Add":" d = DotProduct(thread->base->origin, p->plane.normal);"},{"Add":" d -= p->plane.dist;"},{"Add":" //\tif (d > p->radius) qb: GDD tools fix"},{"Add":" if (d > thread->base->radius) {"},{"Add":" continue;"},{"Add":" }"},{"Add":" //\telse if (d < -p->radius)"},{"Add":" else if (d < -thread->base->radius) {"},{"Add":" stack.source = prevstack->source;"},{"Add":" } else {"},{"Add":" stack.source = ChopWinding_flow(prevstack->source, &stack, &backplane);"},{"Add":" if (!stack.source)"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":"#else"},{"Add":" stack.source = ChopWinding_flow(prevstack->source, &stack, &backplane);"},{"Add":" if (!stack.source)"},{"Add":" continue;"},{"Add":"#endif"},{"Add":""},{"Add":" if (!prevstack->pass) { // the second leaf can only be blocked if coplanar"},{"Add":""},{"Add":" // mark the portal as visible"},{"Add":" thread->base->portalvis[pnum >> 3] |= (1 << (pnum & 7));"},{"Add":""},{"Add":" RecursiveLeafFlow(p->leaf, thread, &stack);"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" stack.pass = ClipToSeperators(stack.source, prevstack->pass, stack.pass, false, &stack);"},{"Add":" if (!stack.pass)"},{"Add":" continue;"},{"Add":""},{"Add":" stack.pass = ClipToSeperators(prevstack->pass, stack.source, stack.pass, true, &stack);"},{"Add":" if (!stack.pass)"},{"Add":" continue;"},{"Add":""},{"Add":" // mark the portal as visible"},{"Add":" thread->base->portalvis[pnum >> 3] |= (1 << (pnum & 7));"},{"Add":""},{"Add":" // flow through it for real"},{"Add":" RecursiveLeafFlow(p->leaf, thread, &stack);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"PortalFlow"},{"Add":""},{"Add":"generates the portalvis bit vector"},{"Add":"==============="},{"Add":"*/"},{"Add":"void PortalFlow(int32_t portalnum) {"},{"Add":" threaddata_t data;"},{"Add":" int32_t i;"},{"Add":" portal_t *p;"},{"Add":" int32_t c_might, c_can;"},{"Add":""},{"Add":" p = sorted_portals[portalnum];"},{"Add":" p->status = stat_working;"},{"Add":""},{"Add":" c_might = CountBits(p->portalflood, numportals * 2);"},{"Add":""},{"Add":" memset(&data, 0, sizeof(data));"},{"Add":" data.base = p;"},{"Add":""},{"Add":" data.pstack_head.portal = p;"},{"Add":" data.pstack_head.source = p->winding;"},{"Add":" data.pstack_head.portalplane = p->plane;"},{"Add":" for (i = 0; i < portallongs; i++)"},{"Add":" ((long *)data.pstack_head.mightsee)[i] = ((long *)p->portalflood)[i];"},{"Add":" RecursiveLeafFlow(p->leaf, &data, &data.pstack_head);"},{"Add":""},{"Add":" p->status = stat_done;"},{"Add":""},{"Add":" c_can = CountBits(p->portalvis, numportals * 2);"},{"Add":""},{"Add":" qprintf(\"portal:%4i mightsee:%4i cansee:%4i (%i chains)\\n\","},{"Add":" (int32_t)(p - portals), c_might, c_can, data.c_chains);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============================================================================="},{"Add":""},{"Add":"This is a rough first-order aproximation that is used to trivially reject some"},{"Add":"of the final calculations."},{"Add":""},{"Add":""},{"Add":"Calculates portalfront and portalflood bit vectors"},{"Add":""},{"Add":"thinking about:"},{"Add":""},{"Add":"typedef struct passage_s"},{"Add":"{"},{"Add":" struct passage_s\t*next;"},{"Add":" struct portal_s\t\t*to;"},{"Add":" stryct sep_s\t\t*seperators;"},{"Add":" byte\t\t\t\t*mightsee;"},{"Add":"} passage_t;"},{"Add":""},{"Add":"typedef struct portal_s"},{"Add":"{"},{"Add":" struct passage_s\t*passages;"},{"Add":" int32_t\t\t\t\t\tleaf;\t\t// leaf portal faces into"},{"Add":"} portal_s;"},{"Add":""},{"Add":"leaf = portal->leaf"},{"Add":"clear"},{"Add":"for all portals"},{"Add":""},{"Add":""},{"Add":"calc portal visibility"},{"Add":" clear bit vector"},{"Add":" for all passages"},{"Add":" passage visibility"},{"Add":""},{"Add":""},{"Add":"for a portal to be visible to a passage, it must be on the front of"},{"Add":"all seperating planes, and both portals must be behind the mew portal"},{"Add":""},{"Add":"==============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"int32_t c_flood, c_vis;"},{"Add":""},{"Add":"char test_leaf[MAX_MAP_LEAFS_QBSP];"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"SimpleFlood"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"void SimpleFlood(portal_t *srcportal, int32_t leafnum) {"},{"Add":" int32_t i;"},{"Add":" leaf_t *leaf;"},{"Add":" portal_t *p;"},{"Add":" int32_t pnum;"},{"Add":""},{"Add":" leaf = &leafs[leafnum];"},{"Add":""},{"Add":" for (i = 0; i < leaf->numportals; i++) {"},{"Add":" p = leaf->portals[i];"},{"Add":" pnum = p - portals;"},{"Add":" if (!(srcportal->portalfront[pnum >> 3] & (1 << (pnum & 7))))"},{"Add":" continue;"},{"Add":""},{"Add":" if (srcportal->portalflood[pnum >> 3] & (1 << (pnum & 7)))"},{"Add":" continue;"},{"Add":""},{"Add":" srcportal->portalflood[pnum >> 3] |= (1 << (pnum & 7));"},{"Add":""},{"Add":" SimpleFlood(srcportal, p->leaf);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"BasePortalVis"},{"Add":"=============="},{"Add":"*/"},{"Add":"void BasePortalVis(int32_t portalnum) {"},{"Add":" int32_t j, k;"},{"Add":" portal_t *tp, *p;"},{"Add":" float d;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" p = portals + portalnum;"},{"Add":""},{"Add":" p->portalfront = malloc(portalbytes);"},{"Add":" memset(p->portalfront, 0, portalbytes);"},{"Add":""},{"Add":" p->portalflood = malloc(portalbytes);"},{"Add":" memset(p->portalflood, 0, portalbytes);"},{"Add":""},{"Add":" p->portalvis = malloc(portalbytes);"},{"Add":" memset(p->portalvis, 0, portalbytes);"},{"Add":""},{"Add":" for (j = 0, tp = portals; j < numportals * 2; j++, tp++) {"},{"Add":" if (j == portalnum)"},{"Add":" continue;"},{"Add":" w = tp->winding;"},{"Add":" for (k = 0; k < w->numpoints; k++) {"},{"Add":" d = DotProduct(w->points[k], p->plane.normal) - p->plane.dist;"},{"Add":" if (d > ON_EPSILON)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (k == w->numpoints)"},{"Add":" continue; // no points on front"},{"Add":""},{"Add":" w = p->winding;"},{"Add":" for (k = 0; k < w->numpoints; k++) {"},{"Add":" d = DotProduct(w->points[k], tp->plane.normal) - tp->plane.dist;"},{"Add":" if (d < -ON_EPSILON)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (k == w->numpoints)"},{"Add":" continue; // no points on front"},{"Add":""},{"Add":" p->portalfront[j >> 3] |= (1 << (j & 7));"},{"Add":" }"},{"Add":""},{"Add":" SimpleFlood(p, p->leaf);"},{"Add":""},{"Add":" p->nummightsee = CountBits(p->portalflood, numportals * 2);"},{"Add":" //\tprintf (\"portal %i: %i mightsee\\n\", portalnum, p->nummightsee);"},{"Add":" c_flood += p->nummightsee;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============================================================================="},{"Add":""},{"Add":"This is a second order aproximation"},{"Add":""},{"Add":"Calculates portalvis bit vector"},{"Add":""},{"Add":"WAAAAAAY too slow."},{"Add":""},{"Add":"==============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"RecursiveLeafBitFlow"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"void RecursiveLeafBitFlow(int32_t leafnum, byte *mightsee, byte *cansee) {"},{"Add":" portal_t *p;"},{"Add":" leaf_t *leaf;"},{"Add":" int32_t i, j;"},{"Add":" long more;"},{"Add":" int32_t pnum;"},{"Add":" byte newmight[MAX_MAP_PORTALS_QBSP / 8];"},{"Add":""},{"Add":" leaf = &leafs[leafnum];"},{"Add":""},{"Add":" // check all portals for flowing into other leafs"},{"Add":" for (i = 0; i < leaf->numportals; i++) {"},{"Add":" p = leaf->portals[i];"},{"Add":" pnum = p - portals;"},{"Add":""},{"Add":" // if some previous portal can't see it, skip"},{"Add":" if (!(mightsee[pnum >> 3] & (1 << (pnum & 7))))"},{"Add":" continue;"},{"Add":""},{"Add":" // if this portal can see some portals we mightsee, recurse"},{"Add":" more = 0;"},{"Add":" for (j = 0; j < portallongs; j++) {"},{"Add":" ((long *)newmight)[j] = ((long *)mightsee)[j] & ((long *)p->portalflood)[j];"},{"Add":" more |= ((long *)newmight)[j] & ~((long *)cansee)[j];"},{"Add":" }"},{"Add":""},{"Add":" if (!more)"},{"Add":" continue; // can't see anything new"},{"Add":""},{"Add":" cansee[pnum >> 3] |= (1 << (pnum & 7));"},{"Add":""},{"Add":" RecursiveLeafBitFlow(p->leaf, newmight, cansee);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"BetterPortalVis"},{"Add":"=============="},{"Add":"*/"},{"Add":"void BetterPortalVis(int32_t portalnum) {"},{"Add":" portal_t *p;"},{"Add":""},{"Add":" p = portals + portalnum;"},{"Add":""},{"Add":" RecursiveLeafBitFlow(p->leaf, p->portalflood, p->portalvis);"},{"Add":""},{"Add":" // build leaf vis information"},{"Add":" p->nummightsee = CountBits(p->portalvis, numportals * 2);"},{"Add":" c_vis += p->nummightsee;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4vis_main.c","metadata":0},"context":[{"change":0,"pos":158138}],"contents":[{"Add":"#include \"stdlib.h\""},{"Add":"#include \"vis.h\""},{"Add":"#include \"threads.h\""},{"Add":""},{"Add":"extern qboolean fastvis;"},{"Add":"extern qboolean nosort;"},{"Add":"extern char inbase[32];"},{"Add":"extern char outbase[32];"},{"Add":""},{"Add":"void VIS_ProcessArgument(const char * arg);"},{"Add":""},{"Add":"int32_t main(int32_t argc, char **argv) {"},{"Add":""},{"Add":" int32_t i;"},{"Add":" char tgamedir[1024] = \"\", tbasedir[1024] = \"\", tmoddir[1024] = \"\";"},{"Add":""},{"Add":" printf(\"\\n\\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4vis >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\");"},{"Add":" printf(\"visibility compiler build \" __DATE__ \"\\n\");"},{"Add":""},{"Add":" verbose = false;"},{"Add":" for (i = 1; i < argc; i++) {"},{"Add":" if (!strcmp(argv[i], \"-threads\")) {"},{"Add":" numthreads = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-help\")) {"},{"Add":" printf(\"usage: 4vis [options] [mapname]\\n\\n\""},{"Add":" \" -fast: uses 'might see' for a quick loose bound\\n\""},{"Add":" \" -threads #: number of CPU threads to use\\n\""},{"Add":" \" -tmpin: read map from 'tmp' folder\\n\""},{"Add":" \" -tmpout: write map to 'tmp' folder\\n\""},{"Add":" \" -moddir [path]: Set a mod directory. Default is parent dir of map file.\\n\""},{"Add":" \" -basedir [path]: Set the directory for assets not in moddir. Default is moddir.\\n\""},{"Add":" \" -gamedir [path]: Set game directory, the folder with game executable.\\n\""},{"Add":" \" -v: extra verbose console output\\n\\n\");"},{"Add":" printf(\"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4vis HELP >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":" exit(1);"},{"Add":" } else if (!strcmp(argv[i], \"-fast\")) {"},{"Add":" printf(\"fastvis = true\\n\");"},{"Add":" fastvis = true;"},{"Add":" } else if (!strcmp(argv[i], \"-v\")) {"},{"Add":" printf(\"verbose = true\\n\");"},{"Add":" verbose = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nosort\")) {"},{"Add":" printf(\"nosort = true\\n\");"},{"Add":" nosort = true;"},{"Add":" }"},{"Add":""},{"Add":" // qb: set gamedir and basedir"},{"Add":" else if (!strcmp(argv[i], \"-gamedir\")) {"},{"Add":" strcpy(tgamedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-basedir\")) {"},{"Add":" strcpy(tbasedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-moddir\")) {"},{"Add":" strcpy(tmoddir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" }"},{"Add":""},{"Add":" else if (!strcmp(argv[i], \"-tmpin\"))"},{"Add":" strcpy(inbase, \"/tmp\");"},{"Add":" else if (!strcmp(argv[i], \"-tmpout\"))"},{"Add":" strcpy(outbase, \"/tmp\");"},{"Add":" else if (argv[i][0] == '-')"},{"Add":" Error(\"Unknown option \\\"%s\\\"\", argv[i]);"},{"Add":" else"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (i != argc - 1) {"},{"Add":" printf(\"usage: 4vis [options] mapfile\\n\""},{"Add":" \" -fast -help -threads #\\n\""},{"Add":" \" -basedir [path] -gamedir [path] \\n\""},{"Add":" \" -tmpin -tmpout -v (verbose)\\n\\n\");"},{"Add":" exit(1);"},{"Add":" }"},{"Add":""},{"Add":" ThreadSetDefault();"},{"Add":""},{"Add":" SetQdirFromPath(argv[i]);"},{"Add":""},{"Add":" if (strcmp(tmoddir, \"\")) {"},{"Add":" strcpy(moddir, tmoddir);"},{"Add":" Q_pathslash(moddir);"},{"Add":" strcpy(basedir, moddir);"},{"Add":" }"},{"Add":" if (strcmp(tbasedir, \"\")) {"},{"Add":" strcpy(basedir, tbasedir);"},{"Add":" Q_pathslash(basedir);"},{"Add":" if (!strcmp(tmoddir, \"\"))"},{"Add":" strcpy(moddir, basedir);"},{"Add":" }"},{"Add":" if (strcmp(tgamedir, \"\")) {"},{"Add":" strcpy(gamedir, tgamedir);"},{"Add":" Q_pathslash(gamedir);"},{"Add":" }"},{"Add":""},{"Add":" // qb: display dirs"},{"Add":" printf(\"moddir = %s\\n\", moddir);"},{"Add":" printf(\"basedir = %s\\n\", basedir);"},{"Add":" printf(\"gamedir = %s\\n\", gamedir);"},{"Add":""},{"Add":" VIS_ProcessArgument(argv[i]);"},{"Add":""},{"Add":" return 0;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4vis.c","metadata":0},"context":[{"change":0,"pos":158138}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"vis.h\""},{"Add":"#include \"threads.h\""},{"Add":"#include \"stdlib.h\""},{"Add":""},{"Add":"extern qboolean use_qbsp;"},{"Add":""},{"Add":"int32_t numportals;"},{"Add":"int32_t portalclusters;"},{"Add":""},{"Add":"portal_t *portals;"},{"Add":"leaf_t *leafs;"},{"Add":""},{"Add":"int32_t c_portaltest, c_portalpass, c_portalcheck;"},{"Add":""},{"Add":"byte *uncompressedvis;"},{"Add":""},{"Add":"byte *vismap, *vismap_p, *vismap_end; // past visfile"},{"Add":"int32_t originalvismapsize;"},{"Add":""},{"Add":"int32_t leafbytes; // (portalclusters+63)>>3"},{"Add":"int32_t leaflongs;"},{"Add":""},{"Add":"int32_t portalbytes, portallongs;"},{"Add":""},{"Add":"qboolean fastvis;"},{"Add":"qboolean nosort;"},{"Add":""},{"Add":"int32_t totalvis;"},{"Add":""},{"Add":"portal_t *sorted_portals[MAX_MAP_PORTALS_QBSP * 2];"},{"Add":""},{"Add":"extern char inbase[32];"},{"Add":"extern char outbase[32];"},{"Add":""},{"Add":"//============================================================================="},{"Add":""},{"Add":"void PlaneFromWinding(winding_t *w, plane_t *plane) {"},{"Add":" vec3_t v1, v2;"},{"Add":""},{"Add":" // calc plane"},{"Add":" VectorSubtract(w->points[2], w->points[1], v1);"},{"Add":" VectorSubtract(w->points[0], w->points[1], v2);"},{"Add":" CrossProduct(v2, v1, plane->normal);"},{"Add":" VectorNormalize(plane->normal, plane->normal);"},{"Add":" plane->dist = DotProduct(w->points[0], plane->normal);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"NewWinding"},{"Add":"=================="},{"Add":"*/"},{"Add":"winding_t *NewWinding(int32_t points) {"},{"Add":" winding_t *w;"},{"Add":" int32_t size;"},{"Add":""},{"Add":" if (points > MAX_POINTS_ON_WINDING)"},{"Add":" Error(\"NewWinding: %i points\", points);"},{"Add":""},{"Add":" size = (intptr_t)((winding_t *)0)->points[points];"},{"Add":" w = malloc(size);"},{"Add":" memset(w, 0, size);"},{"Add":""},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"void prl(leaf_t *l) {"},{"Add":" int32_t i;"},{"Add":" portal_t *p;"},{"Add":" plane_t pl;"},{"Add":""},{"Add":" for (i = 0; i < l->numportals; i++) {"},{"Add":" p = l->portals[i];"},{"Add":" pl = p->plane;"},{"Add":" printf(\"portal %4i to leaf %4i : %7.1f : (%4.1f, %4.1f, %4.1f)\\n\", (int32_t)(p - portals), p->leaf, pl.dist, pl.normal[0], pl.normal[1], pl.normal[2]);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================="},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"SortPortals"},{"Add":""},{"Add":"Sorts the portals from the least complex, so the later ones can reuse"},{"Add":"the earlier information."},{"Add":"============="},{"Add":"*/"},{"Add":"int32_t PComp(const void *a, const void *b) {"},{"Add":" if ((*(portal_t **)a)->nummightsee == (*(portal_t **)b)->nummightsee)"},{"Add":" return 0;"},{"Add":" if ((*(portal_t **)a)->nummightsee < (*(portal_t **)b)->nummightsee)"},{"Add":" return -1;"},{"Add":" return 1;"},{"Add":"}"},{"Add":"void SortPortals(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < numportals * 2; i++)"},{"Add":" sorted_portals[i] = &portals[i];"},{"Add":""},{"Add":" if (nosort)"},{"Add":" return;"},{"Add":" qsort(sorted_portals, numportals * 2, sizeof(sorted_portals[0]), PComp);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"LeafVectorFromPortalVector"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t LeafVectorFromPortalVector(byte *portalbits, byte *leafbits) {"},{"Add":" int32_t i;"},{"Add":" portal_t *p;"},{"Add":" int32_t c_leafs;"},{"Add":""},{"Add":" memset(leafbits, 0, leafbytes);"},{"Add":""},{"Add":" for (i = 0; i < numportals * 2; i++) {"},{"Add":" if (portalbits[i >> 3] & (1 << (i & 7))) {"},{"Add":" p = portals + i;"},{"Add":" leafbits[p->leaf >> 3] |= (1 << (p->leaf & 7));"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" c_leafs = CountBits(leafbits, portalclusters);"},{"Add":""},{"Add":" return c_leafs;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"ClusterMerge"},{"Add":""},{"Add":"Merges the portal visibility for a leaf"},{"Add":"==============="},{"Add":"*/"},{"Add":"void ClusterMerge(int32_t leafnum) {"},{"Add":" leaf_t *leaf;"},{"Add":" byte portalvector[MAX_PORTALS_QBSP / 8];"},{"Add":" byte uncompressed[MAX_MAP_LEAFS_QBSP / 8];"},{"Add":" byte compressed[MAX_MAP_LEAFS_QBSP / 8];"},{"Add":" int32_t i, j;"},{"Add":" int32_t numvis;"},{"Add":" byte *dest;"},{"Add":" portal_t *p;"},{"Add":" int32_t pnum;"},{"Add":""},{"Add":" // OR together all the portalvis bits"},{"Add":""},{"Add":" memset(portalvector, 0, portalbytes);"},{"Add":" leaf = &leafs[leafnum];"},{"Add":""},{"Add":" for (i = 0; i < leaf->numportals; i++) {"},{"Add":" p = leaf->portals[i];"},{"Add":" if (p->status != stat_done)"},{"Add":" Error(\"portal not done\");"},{"Add":" for (j = 0; j < portallongs; j++)"},{"Add":" ((long *)portalvector)[j] |= ((long *)p->portalvis)[j];"},{"Add":" pnum = p - portals;"},{"Add":" portalvector[pnum >> 3] |= 1 << (pnum & 7);"},{"Add":" }"},{"Add":""},{"Add":" // convert portal bits to leaf bits"},{"Add":" numvis = LeafVectorFromPortalVector(portalvector, uncompressed);"},{"Add":""},{"Add":" if (uncompressed[leafnum >> 3] & (1 << (leafnum & 7)))"},{"Add":" printf(\"WARNING: Leaf portals saw into leaf\\n\");"},{"Add":""},{"Add":" uncompressed[leafnum >> 3] |= (1 << (leafnum & 7));"},{"Add":" numvis++; // count the leaf itself"},{"Add":""},{"Add":" // save uncompressed for PHS calculation"},{"Add":" memcpy(uncompressedvis + leafnum * leafbytes, uncompressed, leafbytes);"},{"Add":""},{"Add":" //"},{"Add":" // compress the bit string"},{"Add":" //"},{"Add":" qprintf(\"cluster %4i : %4i visible\\n\", leafnum, numvis);"},{"Add":" totalvis += numvis;"},{"Add":""},{"Add":" i = CompressVis(uncompressed, compressed);"},{"Add":""},{"Add":" dest = vismap_p;"},{"Add":" vismap_p += i;"},{"Add":""},{"Add":" if (vismap_p > vismap_end)"},{"Add":" Error(\"Vismap expansion overflow. Exceeds extended limit\");"},{"Add":""},{"Add":" dvis->bitofs[leafnum][DVIS_PVS] = dest - vismap;"},{"Add":" memcpy(dest, compressed, i);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"CalcPortalVis"},{"Add":"=================="},{"Add":"*/"},{"Add":"void CalcPortalVis(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" // fastvis just uses mightsee for a very loose bound"},{"Add":" if (fastvis) {"},{"Add":" for (i = 0; i < numportals * 2; i++) {"},{"Add":" portals[i].portalvis = portals[i].portalflood;"},{"Add":" portals[i].status = stat_done;"},{"Add":" }"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" RunThreadsOnIndividual(numportals * 2, true, PortalFlow);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"CalcVis"},{"Add":"=================="},{"Add":"*/"},{"Add":"void CalcVis(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" RunThreadsOnIndividual(numportals * 2, true, BasePortalVis);"},{"Add":""},{"Add":" //\tRunThreadsOnIndividual (numportals*2, true, BetterPortalVis);"},{"Add":""},{"Add":" SortPortals();"},{"Add":""},{"Add":" CalcPortalVis();"},{"Add":""},{"Add":" //"},{"Add":" // assemble the leaf vis lists by oring and compressing the portal lists"},{"Add":" //"},{"Add":" for (i = 0; i < portalclusters; i++)"},{"Add":" ClusterMerge(i);"},{"Add":""},{"Add":" printf(\"Average clusters visible: %i\\n\", totalvis / portalclusters);"},{"Add":"}"},{"Add":""},{"Add":"void SetPortalSphere(portal_t *p) {"},{"Add":" int32_t i;"},{"Add":" vec3_t total, dist;"},{"Add":" winding_t *w;"},{"Add":" float r, bestr;"},{"Add":""},{"Add":" w = p->winding;"},{"Add":" VectorCopy(vec3_origin, total);"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" VectorAdd(total, w->points[i], total);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" total[i] /= w->numpoints;"},{"Add":""},{"Add":" bestr = 0;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" VectorSubtract(w->points[i], total, dist);"},{"Add":" r = VectorLength(dist);"},{"Add":" if (r > bestr)"},{"Add":" bestr = r;"},{"Add":" }"},{"Add":" VectorCopy(total, p->origin);"},{"Add":" p->radius = bestr;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"LoadPortals"},{"Add":"============"},{"Add":"*/"},{"Add":"void LoadPortals(char *name) {"},{"Add":" int32_t i, j;"},{"Add":" portal_t *p;"},{"Add":" leaf_t *l;"},{"Add":" char magic[80];"},{"Add":" FILE *f;"},{"Add":" int32_t numpoints;"},{"Add":" winding_t *w;"},{"Add":" int32_t leafnums[2];"},{"Add":" plane_t plane;"},{"Add":""},{"Add":" if (!strcmp(name, \"-\"))"},{"Add":" f = stdin;"},{"Add":" else {"},{"Add":" f = fopen(name, \"r\");"},{"Add":" if (!f)"},{"Add":" Error(\"LoadPortals: couldn't read %s\\n\", name);"},{"Add":" }"},{"Add":""},{"Add":" if (fscanf(f, \"%79s\\n%i\\n%i\\n\", magic, &portalclusters, &numportals) != 3)"},{"Add":" Error(\"LoadPortals: failed to read header\");"},{"Add":" if (strcmp(magic, PORTALFILE))"},{"Add":" Error(\"LoadPortals: not a portal file\");"},{"Add":""},{"Add":" printf(\"%4i portalclusters\\n\", portalclusters);"},{"Add":" printf(\"%4i numportals\\n\", numportals);"},{"Add":""},{"Add":" // these counts should take advantage of 64 bit systems automatically"},{"Add":" leafbytes = ((portalclusters + 63) & ~63) >> 3;"},{"Add":" leaflongs = leafbytes / sizeof(long);"},{"Add":""},{"Add":" portalbytes = ((numportals * 2 + 63) & ~63) >> 3;"},{"Add":" portallongs = portalbytes / sizeof(long);"},{"Add":""},{"Add":" // each file portal is split into two memory portals"},{"Add":" portals = malloc(2 * numportals * sizeof(portal_t));"},{"Add":" memset(portals, 0, 2 * numportals * sizeof(portal_t));"},{"Add":""},{"Add":" leafs = malloc(portalclusters * sizeof(leaf_t));"},{"Add":" memset(leafs, 0, portalclusters * sizeof(leaf_t));"},{"Add":""},{"Add":" originalvismapsize = portalclusters * leafbytes;"},{"Add":" uncompressedvis = malloc(originalvismapsize);"},{"Add":""},{"Add":" vismap = vismap_p = dvisdata;"},{"Add":" dvis->numclusters = portalclusters;"},{"Add":" vismap_p = (byte *)&dvis->bitofs[portalclusters];"},{"Add":""},{"Add":" vismap_end = vismap + MAX_MAP_VISIBILITY_QBSP;"},{"Add":""},{"Add":" for (i = 0, p = portals; i < numportals; i++) {"},{"Add":" if (fscanf(f, \"%i %i %i \", &numpoints, &leafnums[0], &leafnums[1]) != 3)"},{"Add":" Error(\"LoadPortals: reading portal %i\", i);"},{"Add":" if (numpoints > MAX_POINTS_ON_WINDING)"},{"Add":" Error(\"LoadPortals: portal %i has too many points\", i);"},{"Add":" if ((unsigned)leafnums[0] > portalclusters || (unsigned)leafnums[1] > portalclusters)"},{"Add":" Error(\"LoadPortals: reading portal %i\", i);"},{"Add":""},{"Add":" w = p->winding = NewWinding(numpoints);"},{"Add":" w->original = true;"},{"Add":" w->numpoints = numpoints;"},{"Add":""},{"Add":" for (j = 0; j < numpoints; j++) {"},{"Add":" double v[3];"},{"Add":" int32_t k;"},{"Add":""},{"Add":" // scanf into double, then assign to vec_t"},{"Add":" // so we don't care what size vec_t is"},{"Add":" if (fscanf(f, \"(%lf %lf %lf ) \", &v[0], &v[1], &v[2]) != 3)"},{"Add":" Error(\"LoadPortals: reading portal %i\", i);"},{"Add":" for (k = 0; k < 3; k++)"},{"Add":" w->points[j][k] = v[k];"},{"Add":" }"},{"Add":" fscanf(f, \"\\n\");"},{"Add":""},{"Add":" // calc plane"},{"Add":" PlaneFromWinding(w, &plane);"},{"Add":""},{"Add":" // create forward portal"},{"Add":" l = &leafs[leafnums[0]];"},{"Add":" if (l->numportals == MAX_PORTALS_ON_LEAF)"},{"Add":" Error(\"Leaf with too many portals\");"},{"Add":" l->portals[l->numportals] = p;"},{"Add":" l->numportals++;"},{"Add":""},{"Add":" p->winding = w;"},{"Add":" VectorSubtract(vec3_origin, plane.normal, p->plane.normal);"},{"Add":" p->plane.dist = -plane.dist;"},{"Add":" p->leaf = leafnums[1];"},{"Add":" SetPortalSphere(p);"},{"Add":" p++;"},{"Add":""},{"Add":" // create backwards portal"},{"Add":" l = &leafs[leafnums[1]];"},{"Add":" if (l->numportals == MAX_PORTALS_ON_LEAF)"},{"Add":" Error(\"Leaf with too many portals\");"},{"Add":" l->portals[l->numportals] = p;"},{"Add":" l->numportals++;"},{"Add":""},{"Add":" p->winding = NewWinding(w->numpoints);"},{"Add":" p->winding->numpoints = w->numpoints;"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" VectorCopy(w->points[w->numpoints - 1 - j], p->winding->points[j]);"},{"Add":" }"},{"Add":""},{"Add":" p->plane = plane;"},{"Add":" p->leaf = leafnums[0];"},{"Add":" SetPortalSphere(p);"},{"Add":" p++;"},{"Add":" }"},{"Add":""},{"Add":" fclose(f);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CalcPHS"},{"Add":""},{"Add":"Calculate the PHS (Potentially Hearable Set)"},{"Add":"by ORing together all the PVS visible from a leaf"},{"Add":"================"},{"Add":"*/"},{"Add":"void CalcPHS(void) {"},{"Add":" int32_t i, j, k, l, index;"},{"Add":" int32_t bitbyte;"},{"Add":" long *dest, *src;"},{"Add":" byte *scan;"},{"Add":" int32_t count;"},{"Add":" byte uncompressed[MAX_MAP_LEAFS_QBSP / 8];"},{"Add":" byte compressed[MAX_MAP_LEAFS_QBSP / 8];"},{"Add":""},{"Add":" printf(\"Building PHS...\\n\");"},{"Add":""},{"Add":" count = 0;"},{"Add":" for (i = 0; i < portalclusters; i++) {"},{"Add":" scan = uncompressedvis + i * leafbytes;"},{"Add":" memcpy(uncompressed, scan, leafbytes);"},{"Add":" for (j = 0; j < leafbytes; j++) {"},{"Add":" bitbyte = scan[j];"},{"Add":" if (!bitbyte)"},{"Add":" continue;"},{"Add":" for (k = 0; k < 8; k++) {"},{"Add":" if (!(bitbyte & (1 << k)))"},{"Add":" continue;"},{"Add":" // OR this pvs row into the phs"},{"Add":" index = ((j << 3) + k);"},{"Add":" if (index >= portalclusters)"},{"Add":" Error(\"Bad bit in PVS\"); // pad bits should be 0"},{"Add":" src = (long *)(uncompressedvis + index * leafbytes);"},{"Add":" dest = (long *)uncompressed;"},{"Add":" for (l = 0; l < leaflongs; l++)"},{"Add":" ((long *)uncompressed)[l] |= src[l];"},{"Add":" }"},{"Add":" }"},{"Add":" for (j = 0; j < portalclusters; j++)"},{"Add":" if (uncompressed[j >> 3] & (1 << (j & 7)))"},{"Add":" count++;"},{"Add":""},{"Add":" //"},{"Add":" // compress the bit string"},{"Add":" //"},{"Add":" j = CompressVis(uncompressed, compressed);"},{"Add":""},{"Add":" dest = (long *)vismap_p;"},{"Add":" vismap_p += j;"},{"Add":""},{"Add":" if (vismap_p > vismap_end)"},{"Add":" Error(\"Vismap expansion overflow. Exceeds extended limit\");"},{"Add":""},{"Add":" dvis->bitofs[i][DVIS_PHS] = (byte *)dest - vismap;"},{"Add":""},{"Add":" memcpy(dest, compressed, j);"},{"Add":" }"},{"Add":""},{"Add":" printf(\"Average clusters hearable: %i\\n\", count / portalclusters);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==========="},{"Add":"main"},{"Add":"==========="},{"Add":"*/"},{"Add":""},{"Add":"void VIS_ProcessArgument(const char * arg) {"},{"Add":" char portalfile[1024];"},{"Add":" char source[1024];"},{"Add":" char name[1060];"},{"Add":""},{"Add":" strcpy(source, ExpandArg(arg));"},{"Add":" StripExtension(source);"},{"Add":" DefaultExtension(source, \".bsp\");"},{"Add":""},{"Add":" sprintf(name, \"%s%s\", inbase, source);"},{"Add":" printf(\"reading %s\\n\", name);"},{"Add":" LoadBSPFile(name);"},{"Add":" if (numnodes == 0 || numfaces == 0)"},{"Add":" Error(\"Empty map\");"},{"Add":""},{"Add":" sprintf(portalfile, \"%s%s\", inbase, ExpandArg(arg));"},{"Add":" StripExtension(portalfile);"},{"Add":" strcat(portalfile, \".prt\");"},{"Add":""},{"Add":" printf(\"reading %s\\n\", portalfile);"},{"Add":" LoadPortals(portalfile);"},{"Add":""},{"Add":" CalcVis();"},{"Add":""},{"Add":" CalcPHS();"},{"Add":""},{"Add":" visdatasize = vismap_p - dvisdata;"},{"Add":""},{"Add":" printf(\"visdatasize: %i compressed from %i\\n\", visdatasize, originalvismapsize * 2);"},{"Add":""},{"Add":" if (!use_qbsp && vismap_p > (vismap + DEFAULT_MAP_VISIBILITY))"},{"Add":" printf(\"\\nWARNING: visdatasize exceeds default limit of %i\\n\\n\", DEFAULT_MAP_VISIBILITY);"},{"Add":""},{"Add":" sprintf(name, \"%s%s\", outbase, source);"},{"Add":" WriteBSPFile(name);"},{"Add":""},{"Add":" PrintBSPFileSizes();"},{"Add":""},{"Add":" printf(\"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< END 4vis >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4rad","metadata":576},"context":[{"change":0,"pos":17}],"contents":[]}},{"FileAdd":{"meta":{"basename":"trace.c","metadata":0},"context":[{"change":0,"pos":195246}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qrad.h\""},{"Add":"#include "},{"Add":""},{"Add":"typedef struct tnode_s {"},{"Add":" int32_t type;"},{"Add":" vec3_t normal;"},{"Add":" float dist;"},{"Add":" int32_t children[2];"},{"Add":" int32_t children_leaf[2]; // valid if the corresponding child is a leaf"},{"Add":" int32_t pad;"},{"Add":"} tnode_t;"},{"Add":""},{"Add":"tnode_t *tnodes, *tnode_p;"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"MakeTnode"},{"Add":""},{"Add":"Converts the disk node structure into the efficient tracing structure"},{"Add":"=============="},{"Add":"*/"},{"Add":"static int32_t tnode_mask;"},{"Add":"void MakeTnode(int32_t nodenum) {"},{"Add":" tnode_t *t;"},{"Add":" dplane_t *plane;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" t = tnode_p++;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" node = dnodesX + nodenum;"},{"Add":" plane = dplanes + node->planenum;"},{"Add":""},{"Add":" t->type = plane->type;"},{"Add":" VectorCopy(plane->normal, t->normal);"},{"Add":" t->dist = plane->dist;"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" if (node->children[i] < 0) {"},{"Add":" t->children[i] = (dleafsX[-node->children[i] - 1].contents & tnode_mask) | (1 << 31);"},{"Add":" t->children_leaf[i] = -node->children[i] - 1;"},{"Add":" } else {"},{"Add":" t->children[i] = tnode_p - tnodes;"},{"Add":" MakeTnode(node->children[i]);"},{"Add":" }"},{"Add":" }"},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" node = dnodes + nodenum;"},{"Add":" plane = dplanes + node->planenum;"},{"Add":""},{"Add":" t->type = plane->type;"},{"Add":" VectorCopy(plane->normal, t->normal);"},{"Add":" t->dist = plane->dist;"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" if (node->children[i] < 0) {"},{"Add":" t->children[i] = (dleafs[-node->children[i] - 1].contents & tnode_mask) | (1 << 31);"},{"Add":" t->children_leaf[i] = -node->children[i] - 1;"},{"Add":" } else {"},{"Add":" t->children[i] = tnode_p - tnodes;"},{"Add":" MakeTnode(node->children[i]);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MakeTnodes"},{"Add":""},{"Add":"Loads the node structure out of a .bsp file to be used for light occlusion"},{"Add":"============="},{"Add":"*/"},{"Add":"void MakeTnodes(dmodel_t *bm) {"},{"Add":" // 32 byte align the structs"},{"Add":" tnodes = malloc((numnodes + 1) * sizeof(tnode_t));"},{"Add":" tnodes = (tnode_t *)(((intptr_t)tnodes + 31) & ~31);"},{"Add":" tnode_p = tnodes;"},{"Add":" tnode_mask = CONTENTS_SOLID | CONTENTS_WINDOW;"},{"Add":" // TODO: or-in CONTENTS_WINDOW in response to a command-line argument"},{"Add":" MakeTnode(0);"},{"Add":"}"},{"Add":""},{"Add":"//=========================================================="},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"BuildPolygons"},{"Add":""},{"Add":"Applies the same basic algorithm as r_surf.c:BSP_BuildPolygonFromSurface to"},{"Add":"every surface in the BSP, precomputing the xyz and st coordinates of each"},{"Add":"vertex of each polygon. Skip non-translucent surfaces for now."},{"Add":"============="},{"Add":"*/"},{"Add":""},{"Add":"int32_t PointInNodenum(vec3_t point) {"},{"Add":" int32_t nodenum, oldnodenum;"},{"Add":" vec_t dist;"},{"Add":" dplane_t *plane;"},{"Add":""},{"Add":" nodenum = 0;"},{"Add":" if (use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" while (nodenum >= 0) {"},{"Add":" node = &dnodesX[nodenum];"},{"Add":" plane = &dplanes[node->planenum];"},{"Add":" dist = DotProduct(point, plane->normal) - plane->dist;"},{"Add":" oldnodenum = nodenum;"},{"Add":" if (dist > 0)"},{"Add":" nodenum = node->children[0];"},{"Add":" else"},{"Add":" nodenum = node->children[1];"},{"Add":" }"},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" while (nodenum >= 0) {"},{"Add":" node = &dnodes[nodenum];"},{"Add":" plane = &dplanes[node->planenum];"},{"Add":" dist = DotProduct(point, plane->normal) - plane->dist;"},{"Add":" oldnodenum = nodenum;"},{"Add":" if (dist > 0)"},{"Add":" nodenum = node->children[0];"},{"Add":" else"},{"Add":" nodenum = node->children[1];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return oldnodenum;"},{"Add":"}"},{"Add":""},{"Add":"int32_t TestLine_r(int32_t node, vec3_t set_start, vec3_t stop) {"},{"Add":" tnode_t *tnode;"},{"Add":" float front, back;"},{"Add":" vec3_t mid, _start;"},{"Add":" vec_t *start;"},{"Add":" float frac;"},{"Add":" int32_t side;"},{"Add":" int32_t r;"},{"Add":""},{"Add":" start = set_start;"},{"Add":""},{"Add":"re_test:"},{"Add":""},{"Add":" r = 0;"},{"Add":" if (node & (1 << 31)) {"},{"Add":" if ((r = node & ~(1 << 31)) != CONTENTS_WINDOW) {"},{"Add":" return r;"},{"Add":" }"},{"Add":" return 0;"},{"Add":" }"},{"Add":""},{"Add":" tnode = &tnodes[node];"},{"Add":" switch (tnode->type) {"},{"Add":" case PLANE_X:"},{"Add":" front = start[0] - tnode->dist;"},{"Add":" back = stop[0] - tnode->dist;"},{"Add":" break;"},{"Add":" case PLANE_Y:"},{"Add":" front = start[1] - tnode->dist;"},{"Add":" back = stop[1] - tnode->dist;"},{"Add":" break;"},{"Add":" case PLANE_Z:"},{"Add":" front = start[2] - tnode->dist;"},{"Add":" back = stop[2] - tnode->dist;"},{"Add":" break;"},{"Add":" default:"},{"Add":" front = (start[0] * tnode->normal[0] + start[1] * tnode->normal[1] + start[2] * tnode->normal[2]) - tnode->dist;"},{"Add":" back = (stop[0] * tnode->normal[0] + stop[1] * tnode->normal[1] + stop[2] * tnode->normal[2]) - tnode->dist;"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (front >= -ON_EPSILON && back >= -ON_EPSILON) {"},{"Add":" node = tnode->children[0];"},{"Add":" goto re_test;"},{"Add":" }"},{"Add":""},{"Add":" if (front < ON_EPSILON && back < ON_EPSILON) {"},{"Add":" node = tnode->children[1];"},{"Add":" goto re_test;"},{"Add":" }"},{"Add":""},{"Add":" side = front < 0;"},{"Add":""},{"Add":" frac = front / (front - back);"},{"Add":""},{"Add":" mid[0] = start[0] + (stop[0] - start[0]) * frac;"},{"Add":" mid[1] = start[1] + (stop[1] - start[1]) * frac;"},{"Add":" mid[2] = start[2] + (stop[2] - start[2]) * frac;"},{"Add":""},{"Add":" if ((r = TestLine_r(tnode->children[side], start, mid)))"},{"Add":" return r;"},{"Add":" node = tnode->children[!side];"},{"Add":""},{"Add":" start = _start;"},{"Add":" start[0] = mid[0];"},{"Add":" start[1] = mid[1];"},{"Add":" start[2] = mid[2];"},{"Add":""},{"Add":" goto re_test;"},{"Add":"}"},{"Add":""},{"Add":"int32_t TestLine(vec3_t start, vec3_t stop) {"},{"Add":" vec3_t occluded;"},{"Add":" occluded[0] = occluded[1] = occluded[2] = 1.0;"},{"Add":" return TestLine_r(0, start, stop);"},{"Add":"}"},{"Add":""},{"Add":"int32_t TestLine_color(int32_t node, vec3_t start, vec3_t stop, vec3_t occluded) {"},{"Add":" occluded[0] = occluded[1] = occluded[2] = 1.0;"},{"Add":" return TestLine_r(node, start, stop);"},{"Add":"}"},{"Add":"/*"},{"Add":"=============================================================================="},{"Add":""},{"Add":"LINE TRACING"},{"Add":""},{"Add":"The major lighting operation is a point to point visibility test, performed"},{"Add":"by recursive subdivision of the line by the BSP tree."},{"Add":""},{"Add":"=============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" vec3_t backpt;"},{"Add":" int32_t side;"},{"Add":" int32_t node;"},{"Add":"} tracestack_t;"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"TestLine"},{"Add":"=============="},{"Add":"*/"},{"Add":"qboolean _TestLine(vec3_t start, vec3_t stop) {"},{"Add":" int32_t node;"},{"Add":" float front, back;"},{"Add":" tracestack_t *tstack_p;"},{"Add":" int32_t side;"},{"Add":" float frontx, fronty, frontz, backx, backy, backz;"},{"Add":" tracestack_t tracestack[64];"},{"Add":" tnode_t *tnode;"},{"Add":""},{"Add":" frontx = start[0];"},{"Add":" fronty = start[1];"},{"Add":" frontz = start[2];"},{"Add":" backx = stop[0];"},{"Add":" backy = stop[1];"},{"Add":" backz = stop[2];"},{"Add":""},{"Add":" tstack_p = tracestack;"},{"Add":" node = 0;"},{"Add":""},{"Add":" while (1) {"},{"Add":" if (node == CONTENTS_SOLID) {"},{"Add":"#if 0"},{"Add":" float\td1, d2, d3;"},{"Add":""},{"Add":" d1 = backx - frontx;"},{"Add":" d2 = backy - fronty;"},{"Add":" d3 = backz - frontz;"},{"Add":""},{"Add":" if (d1*d1 + d2*d2 + d3*d3 > 1)"},{"Add":"#endif"},{"Add":" return false; // DONE!"},{"Add":" }"},{"Add":""},{"Add":" while (node < 0) {"},{"Add":" // pop up the stack for a back side"},{"Add":" tstack_p--;"},{"Add":" if (tstack_p < tracestack)"},{"Add":" return true;"},{"Add":" node = tstack_p->node;"},{"Add":""},{"Add":" // set the hit point for this plane"},{"Add":""},{"Add":" frontx = backx;"},{"Add":" fronty = backy;"},{"Add":" frontz = backz;"},{"Add":""},{"Add":" // go down the back side"},{"Add":""},{"Add":" backx = tstack_p->backpt[0];"},{"Add":" backy = tstack_p->backpt[1];"},{"Add":" backz = tstack_p->backpt[2];"},{"Add":""},{"Add":" node = tnodes[tstack_p->node].children[!tstack_p->side];"},{"Add":" }"},{"Add":""},{"Add":" tnode = &tnodes[node];"},{"Add":""},{"Add":" switch (tnode->type) {"},{"Add":" case PLANE_X:"},{"Add":" front = frontx - tnode->dist;"},{"Add":" back = backx - tnode->dist;"},{"Add":" break;"},{"Add":" case PLANE_Y:"},{"Add":" front = fronty - tnode->dist;"},{"Add":" back = backy - tnode->dist;"},{"Add":" break;"},{"Add":" case PLANE_Z:"},{"Add":" front = frontz - tnode->dist;"},{"Add":" back = backz - tnode->dist;"},{"Add":" break;"},{"Add":" default:"},{"Add":" front = (frontx * tnode->normal[0] + fronty * tnode->normal[1] + frontz * tnode->normal[2]) - tnode->dist;"},{"Add":" back = (backx * tnode->normal[0] + backy * tnode->normal[1] + backz * tnode->normal[2]) - tnode->dist;"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (front > -ON_EPSILON && back > -ON_EPSILON)"},{"Add":" //\t\tif (front > 0 && back > 0)"},{"Add":" {"},{"Add":" node = tnode->children[0];"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (front < ON_EPSILON && back < ON_EPSILON)"},{"Add":" //\t\tif (front <= 0 && back <= 0)"},{"Add":" {"},{"Add":" node = tnode->children[1];"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" side = front < 0;"},{"Add":""},{"Add":" front = front / (front - back);"},{"Add":""},{"Add":" tstack_p->node = node;"},{"Add":" tstack_p->side = side;"},{"Add":" tstack_p->backpt[0] = backx;"},{"Add":" tstack_p->backpt[1] = backy;"},{"Add":" tstack_p->backpt[2] = backz;"},{"Add":""},{"Add":" tstack_p++;"},{"Add":""},{"Add":" backx = frontx + front * (backx - frontx);"},{"Add":" backy = fronty + front * (backy - fronty);"},{"Add":" backz = frontz + front * (backz - frontz);"},{"Add":""},{"Add":" node = tnode->children[side];"},{"Add":" }"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"patches.c","metadata":0},"context":[{"change":0,"pos":195246}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qrad.h\""},{"Add":""},{"Add":"vec3_t texture_reflectivity[MAX_MAP_TEXINFO_QBSP];"},{"Add":""},{"Add":"int32_t cluster_neg_one = 0;"},{"Add":"int32_t texture_sizes[MAX_MAP_TEXINFO_QBSP][2];"},{"Add":"/*"},{"Add":"==================================================================="},{"Add":""},{"Add":" TEXTURE LIGHT VALUES"},{"Add":""},{"Add":"==================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"======================"},{"Add":"CalcTextureReflectivity"},{"Add":"======================"},{"Add":"*/"},{"Add":"void CalcTextureReflectivity(void) {"},{"Add":" int32_t i, j, k, count;"},{"Add":" int32_t texels, texel;"},{"Add":" qboolean wal_tex;"},{"Add":" float color[3], cur_color[3], tex_a, a;"},{"Add":" char path[1200];"},{"Add":" float *r, *g, *b;"},{"Add":" float c;"},{"Add":" byte *pbuffer = NULL; // mxd. \"potentially uninitialized local pointer variable\" in VS2017 if uninitialized"},{"Add":""},{"Add":" byte *palette_frompak = NULL;"},{"Add":" byte *ptexel;"},{"Add":" byte *palette;"},{"Add":" miptex_t *mt = NULL; // mxd. \"potentially uninitialized local pointer variable\" in VS2017 if uninitialized"},{"Add":" float *fbuffer, *ftexel;"},{"Add":" int32_t width, height;"},{"Add":""},{"Add":" // for TGA RGBA texture images"},{"Add":""},{"Add":" wal_tex = false;"},{"Add":""},{"Add":" // get the game palette"},{"Add":" // qb: looks in moddir then basedir"},{"Add":" sprintf(path, \"%spics/colormap.pcx\", moddir);"},{"Add":" if(FileExists(path)) {"},{"Add":" Load256Image(path, NULL, &palette, NULL, NULL);"},{"Add":" } else {"},{"Add":" sprintf(path, \"%spics/colormap.pcx\", basedir);"},{"Add":" if(FileExists(path)) {"},{"Add":" Load256Image(path, NULL, &palette, NULL, NULL);"},{"Add":" } else if((i = TryLoadFileFromPak(\"pics/colormap.pcx\", (void **)&palette_frompak, moddir)) != -1) {"},{"Add":" // unicat: load from pack files, palette is loaded from the last 768 bytes"},{"Add":" palette = palette_frompak - (i - 768);"},{"Add":" } else {"},{"Add":" Error(\"unable to load pics/colormap.pcx\");"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // always set index 0 even if no textures"},{"Add":" texture_reflectivity[0][0] = 0.5;"},{"Add":" texture_reflectivity[0][1] = 0.5;"},{"Add":" texture_reflectivity[0][2] = 0.5;"},{"Add":""},{"Add":" for(i = 0; i < numtexinfo; i++) {"},{"Add":" // default"},{"Add":" texture_reflectivity[i][0] = 0.5f;"},{"Add":" texture_reflectivity[i][1] = 0.5f;"},{"Add":" texture_reflectivity[i][2] = 0.5f;"},{"Add":""},{"Add":" // see if an earlier texinfo already got the value"},{"Add":" for(j = 0; j < i; j++) {"},{"Add":" if(!strcmp(texinfo[i].texture, texinfo[j].texture)) {"},{"Add":" VectorCopy(texture_reflectivity[j], texture_reflectivity[i]);"},{"Add":" texture_sizes[i][0] = texture_sizes[j][0];"},{"Add":" texture_sizes[i][1] = texture_sizes[j][1];"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" if(j != i)"},{"Add":" continue;"},{"Add":""},{"Add":" // buffer is RGBA (A set to 255 for 24 bit format)"},{"Add":" // qb: looks in moddir then basedir"},{"Add":" sprintf(path, \"%stextures/%s.tga\", moddir, texinfo[i].texture);"},{"Add":" if(FileExists(path)) // LoadTGA expects file to exist"},{"Add":" {"},{"Add":" LoadTGA(path, &pbuffer, &width, &height); // load rgba data"},{"Add":" qprintf(\"load %s\\n\", path);"},{"Add":" } else {"},{"Add":" // look for wal file in moddir"},{"Add":" sprintf(path, \"%stextures/%s.wal\", moddir, texinfo[i].texture);"},{"Add":" qprintf(\"attempting %s\\n\", path);"},{"Add":""},{"Add":" // load the miptex to get the flags and values"},{"Add":" if(FileExists(path)) // qb: linux segfault if not exist"},{"Add":" {"},{"Add":" if(TryLoadFile(path, (void **)&mt, false) != -1)"},{"Add":" wal_tex = true;"},{"Add":" } else {"},{"Add":" // look for TGA in basedir sprintf(path, \"%stextures/%s.tga\", basedir, texinfo[i].texture);"},{"Add":" if(FileExists(path)) {"},{"Add":" LoadTGA(path, &pbuffer, &width, &height); // load rgba data"},{"Add":" qprintf(\"load %s\\n\", path);"},{"Add":" } else {"},{"Add":" // look for wal file in base dir"},{"Add":" sprintf(path, \"%stextures/%s.wal\", basedir, texinfo[i].texture);"},{"Add":" qprintf(\"load %s\\n\", path);"},{"Add":""},{"Add":" // load the miptex to get the flags and values"},{"Add":" if(FileExists(path)) // qb: linux segfault if not exist"},{"Add":" {"},{"Add":" if(TryLoadFile(path, (void **)&mt, false) != -1)"},{"Add":" wal_tex = true;"},{"Add":" } else {"},{"Add":" qprintf(\"NOT FOUND %s\\n\", path);"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // Calculate the \"average color\" for the texture"},{"Add":" //"},{"Add":""},{"Add":" if(wal_tex) {"},{"Add":" texels = LittleLong(mt->width) * LittleLong(mt->height);"},{"Add":" color[0] = color[1] = color[2] = 0;"},{"Add":""},{"Add":" for(j = 0; j < texels; j++) {"},{"Add":" texel = ((byte *)mt)[LittleLong(mt->offsets[0]) + j];"},{"Add":" for(k = 0; k < 3; k++)"},{"Add":" color[k] += palette[texel * 3 + k];"},{"Add":" }"},{"Add":" } else {"},{"Add":" texels = width * height;"},{"Add":" if(texels <= 0) {"},{"Add":" qprintf(\"tex %i (%s) no rgba data (file broken?)\\n\", i, path);"},{"Add":" continue; // empty texture, possible bad file"},{"Add":" }"},{"Add":""},{"Add":" color[0] = color[1] = color[2] = 0.0f;"},{"Add":" ptexel = pbuffer;"},{"Add":" // fbuffer = malloc(texels * 4 * sizeof(float));"},{"Add":" // ftexel = fbuffer;"},{"Add":""},{"Add":" for(count = texels; count--;) {"},{"Add":" cur_color[0] = (float)(*ptexel++); // r"},{"Add":" cur_color[1] = (float)(*ptexel++); // g"},{"Add":" cur_color[2] = (float)(*ptexel++); // b"},{"Add":" tex_a = (float)(*ptexel++);"},{"Add":""},{"Add":" if(texinfo[i].flags & (SURF_WARP | SURF_NODRAW)) {"},{"Add":" a = 0.0;"},{"Add":" } else if((texinfo[i].flags & SURF_TRANS33) && (texinfo[i].flags & SURF_TRANS66)) {"},{"Add":" a = tex_a / 511.0;"},{"Add":" } else if(texinfo[i].flags & SURF_TRANS33) {"},{"Add":" a = tex_a / 765.0;"},{"Add":" } else if(texinfo[i].flags & SURF_TRANS66) {"},{"Add":" a = tex_a / 382.5;"},{"Add":" } else {"},{"Add":" a = 1.0;"},{"Add":" }"},{"Add":""},{"Add":" for(j = 0; j < 3; j++) {"},{"Add":" color[j] += cur_color[j] * a;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" free(pbuffer);"},{"Add":" }"},{"Add":""},{"Add":" for(j = 0; j < 3; j++) {"},{"Add":" // average RGB for the texture to 0.0..1.0 range"},{"Add":" c = color[j] / (float)texels / 255.0f;"},{"Add":" texture_reflectivity[i][j] = c;"},{"Add":" }"},{"Add":""},{"Add":"// reflectivity saturation"},{"Add":"#define Pr .299"},{"Add":"#define Pg .587"},{"Add":"#define Pb .114"},{"Add":""},{"Add":" // public-domain function by Darel Rex Finley"},{"Add":" //"},{"Add":" // The passed-in RGB values can be on any desired scale, such as 0 to"},{"Add":" // to 1, or 0 to 255. (But use the same scale for all three!)"},{"Add":" //"},{"Add":" // The \"saturation\" parameter works like this:"},{"Add":" // 0.0 creates a black-and-white image."},{"Add":" // 0.5 reduces the color saturation by half."},{"Add":" // 1.0 causes no change."},{"Add":" // 2.0 doubles the color saturation."},{"Add":" // Note: A \"change\" value greater than 1.0 may project your RGB values"},{"Add":" // beyond their normal range, in which case you probably should truncate"},{"Add":" // them to the desired range before trying to use them in an image."},{"Add":""},{"Add":" r = &texture_reflectivity[i][0];"},{"Add":" g = &texture_reflectivity[i][1];"},{"Add":" b = &texture_reflectivity[i][2];"},{"Add":""},{"Add":" float P = sqrt((*r) * (*r) * Pr + (*g) * (*g) * Pg + (*b) * (*b) * Pb);"},{"Add":""},{"Add":" *r = BOUND(0, P + (*r - P) * saturation, 255);"},{"Add":" *g = BOUND(0, P + (*g - P) * saturation, 255);"},{"Add":" *b = BOUND(0, P + (*b - P) * saturation, 255);"},{"Add":""},{"Add":" qprintf(\"tex %i (%s) avg rgb [ %f, %f, %f ]\\n\", i, path, texture_reflectivity[i][0], texture_reflectivity[i][1],"},{"Add":" texture_reflectivity[i][2]);"},{"Add":" }"},{"Add":""},{"Add":" if(palette_frompak) {"},{"Add":" free(palette_frompak);"},{"Add":" } else {"},{"Add":" free(palette);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"======================================================================="},{"Add":""},{"Add":"MAKE FACES"},{"Add":""},{"Add":"======================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"WindingFromFace"},{"Add":"============="},{"Add":"*/"},{"Add":"winding_t *WindingFromFaceX(dface_tx *f) {"},{"Add":" int32_t i;"},{"Add":" int32_t se;"},{"Add":" dvertex_t *dv;"},{"Add":" int32_t v;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" w = AllocWinding(f->numedges);"},{"Add":" w->numpoints = f->numedges;"},{"Add":""},{"Add":" for(i = 0; i < f->numedges; i++) {"},{"Add":" se = dsurfedges[f->firstedge + i];"},{"Add":""},{"Add":" if(se < 0)"},{"Add":" v = dedgesX[-se].v[1];"},{"Add":" else"},{"Add":" v = dedgesX[se].v[0];"},{"Add":""},{"Add":" dv = &dvertexes[v];"},{"Add":" VectorCopy(dv->point, w->p[i]);"},{"Add":" }"},{"Add":""},{"Add":" RemoveColinearPoints(w);"},{"Add":""},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"winding_t *WindingFromFace(dface_t *f) {"},{"Add":" int32_t i;"},{"Add":" int32_t se;"},{"Add":" dvertex_t *dv;"},{"Add":" int32_t v;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" w = AllocWinding(f->numedges);"},{"Add":" w->numpoints = f->numedges;"},{"Add":""},{"Add":" for(i = 0; i < f->numedges; i++) {"},{"Add":" se = dsurfedges[f->firstedge + i];"},{"Add":" if(se < 0)"},{"Add":" v = dedges[-se].v[1];"},{"Add":" else"},{"Add":" v = dedges[se].v[0];"},{"Add":""},{"Add":" dv = &dvertexes[v];"},{"Add":" VectorCopy(dv->point, w->p[i]);"},{"Add":" }"},{"Add":""},{"Add":" RemoveColinearPoints(w);"},{"Add":""},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"BaseLightForFace"},{"Add":"============="},{"Add":"*/"},{"Add":"struct SH1 BaseLightForFaceX(dface_tx *f) {"},{"Add":" texinfo_t *tx;"},{"Add":""},{"Add":" //"},{"Add":" // check for light emited by texture"},{"Add":" //"},{"Add":" tx = &texinfo[f->texinfo];"},{"Add":" if(!(tx->flags & SURF_LIGHT) || tx->value == 0) {"},{"Add":" if(tx->flags & SURF_LIGHT) {"},{"Add":" printf(\"Surface light has 0 intensity.\\n\");"},{"Add":" }"},{"Add":" return SH1_Clear();"},{"Add":" }"},{"Add":""},{"Add":" // non-standard use, get a more diffuse baselight from short direction vector"},{"Add":" vec3_t normal, color;"},{"Add":" VectorScale((f->side ? backplanes[f->planenum].normal : dplanes[f->planenum].normal), -0.25, normal);"},{"Add":" VectorScale(texture_reflectivity[f->texinfo], tx->value, color);"},{"Add":""},{"Add":" return SH1_FromDirectionalLight(normal, color);"},{"Add":"}"},{"Add":""},{"Add":"struct SH1 BaseLightForFaceI(dface_t *f) {"},{"Add":" texinfo_t *tx;"},{"Add":""},{"Add":" //"},{"Add":" // check for light emited by texture"},{"Add":" //"},{"Add":" tx = &texinfo[f->texinfo];"},{"Add":" if(!(tx->flags & SURF_LIGHT) || tx->value == 0) {"},{"Add":" if(tx->flags & SURF_LIGHT) {"},{"Add":" printf(\"Surface light has 0 intensity.\\n\");"},{"Add":" }"},{"Add":" return SH1_Clear();"},{"Add":" }"},{"Add":""},{"Add":" // non-standard use, get a more diffuse baselight from short direction vector"},{"Add":" vec3_t normal, color;"},{"Add":" VectorScale(f->side ? backplanes[f->planenum].normal : dplanes[f->planenum].normal, 0.25, normal);"},{"Add":" VectorScale(texture_reflectivity[f->texinfo], tx->value, color);"},{"Add":""},{"Add":" return SH1_FromDirectionalLight(normal, color);"},{"Add":"}"},{"Add":""},{"Add":"qboolean IsSkyX(dface_tx *f) {"},{"Add":" texinfo_t *tx;"},{"Add":""},{"Add":" tx = &texinfo[f->texinfo];"},{"Add":" if(tx->flags & SURF_SKY)"},{"Add":" return true;"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"qboolean IsSkyI(dface_t *f) {"},{"Add":" texinfo_t *tx;"},{"Add":""},{"Add":" tx = &texinfo[f->texinfo];"},{"Add":" if(tx->flags & SURF_SKY)"},{"Add":" return true;"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MakePatchForFace"},{"Add":"============="},{"Add":"*/"},{"Add":"float totalarea;"},{"Add":"void MakePatchForFace(int32_t fn, winding_t *w) {"},{"Add":" float area;"},{"Add":" patch_t *patch;"},{"Add":" dplane_t *pl;"},{"Add":" int32_t i;"},{"Add":" vec3_t color = {1.0f, 1.0f, 1.0f};"},{"Add":""},{"Add":" area = WindingArea(w);"},{"Add":" totalarea += area;"},{"Add":""},{"Add":" patch = &patches[num_patches];"},{"Add":" if(use_qbsp) {"},{"Add":" if(num_patches == MAX_PATCHES_QBSP)"},{"Add":" Error(\"Exceeded MAX_PATCHES_QBSP %i\", MAX_PATCHES_QBSP);"},{"Add":" } else if(num_patches == MAX_PATCHES)"},{"Add":" Error(\"Exceeded MAX_PATCHES %i\", MAX_PATCHES);"},{"Add":" patch->next = face_patches[fn];"},{"Add":" face_patches[fn] = patch;"},{"Add":""},{"Add":" patch->winding = w;"},{"Add":""},{"Add":" if(use_qbsp) {"},{"Add":" dface_tx *f;"},{"Add":" dleaf_tx *leaf;"},{"Add":""},{"Add":" f = &dfacesX[fn];"},{"Add":" if(f->side)"},{"Add":" patch->plane = &backplanes[f->planenum];"},{"Add":" else"},{"Add":" patch->plane = &dplanes[f->planenum];"},{"Add":" if(face_offset[fn][0] || face_offset[fn][1] || face_offset[fn][2]) {"},{"Add":" // origin offset faces must create new planes"},{"Add":" if(use_qbsp) {"},{"Add":" if(numplanes + fakeplanes >= MAX_MAP_PLANES_QBSP)"},{"Add":" Error(\"numplanes + fakeplanes >= MAX_MAP_PLANES_QBSP\");"},{"Add":" } else if(numplanes + fakeplanes >= MAX_MAP_PLANES)"},{"Add":" Error(\"numplanes + fakeplanes >= MAX_MAP_PLANES\");"},{"Add":""},{"Add":" pl = &dplanes[numplanes + fakeplanes];"},{"Add":" fakeplanes++;"},{"Add":""},{"Add":" *pl = *(patch->plane);"},{"Add":" pl->dist += DotProduct(face_offset[fn], pl->normal);"},{"Add":" patch->plane = pl;"},{"Add":" }"},{"Add":""},{"Add":" WindingCenter(w, patch->origin);"},{"Add":" VectorAdd(patch->origin, patch->plane->normal, patch->origin);"},{"Add":" leaf = RadPointInLeafX(patch->origin);"},{"Add":" patch->cluster = leaf->cluster;"},{"Add":""},{"Add":" if(patch->cluster == -1) {"},{"Add":" // qprintf (\"patch->cluster == -1\\n\");"},{"Add":" ++cluster_neg_one;"},{"Add":" }"},{"Add":""},{"Add":" patch->faceNumber = fn; // qb: for patch sorting"},{"Add":" patch->area = area;"},{"Add":" if(patch->area <= 1)"},{"Add":" patch->area = 1;"},{"Add":" patch->sky = IsSkyX(f);"},{"Add":""},{"Add":" VectorCopy(texture_reflectivity[f->texinfo], patch->reflectivity);"},{"Add":""},{"Add":" // non-bmodel patches can emit light"},{"Add":" if(fn < dmodels[0].numfaces) {"},{"Add":" ColorNormalize(patch->reflectivity, color);"},{"Add":""},{"Add":" patch->baselight = SH1_ColorScale(BaseLightForFaceX(f), color);"},{"Add":""},{"Add":" // VectorCopy(patch->baselight, patch->totallight);"},{"Add":" patch->totallight = patch->baselight;"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *f;"},{"Add":" dleaf_t *leaf;"},{"Add":""},{"Add":" f = &dfaces[fn];"},{"Add":" if(f->side)"},{"Add":" patch->plane = &backplanes[f->planenum];"},{"Add":" else"},{"Add":" patch->plane = &dplanes[f->planenum];"},{"Add":" if(face_offset[fn][0] || face_offset[fn][1] || face_offset[fn][2]) {"},{"Add":" // origin offset faces must create new planes"},{"Add":" if(use_qbsp) {"},{"Add":" if(numplanes + fakeplanes >= MAX_MAP_PLANES_QBSP)"},{"Add":" Error(\"numplanes + fakeplanes >= MAX_MAP_PLANES_QBSP\");"},{"Add":" } else if(numplanes + fakeplanes >= MAX_MAP_PLANES)"},{"Add":" Error(\"numplanes + fakeplanes >= MAX_MAP_PLANES\");"},{"Add":""},{"Add":" pl = &dplanes[numplanes + fakeplanes];"},{"Add":" fakeplanes++;"},{"Add":""},{"Add":" *pl = *(patch->plane);"},{"Add":" pl->dist += DotProduct(face_offset[fn], pl->normal);"},{"Add":" patch->plane = pl;"},{"Add":" }"},{"Add":""},{"Add":" WindingCenter(w, patch->origin);"},{"Add":" VectorAdd(patch->origin, patch->plane->normal, patch->origin);"},{"Add":" leaf = RadPointInLeaf(patch->origin);"},{"Add":" patch->cluster = leaf->cluster;"},{"Add":""},{"Add":" if(patch->cluster == -1) {"},{"Add":" // qprintf (\"patch->cluster == -1\\n\");"},{"Add":" ++cluster_neg_one;"},{"Add":" }"},{"Add":""},{"Add":" patch->faceNumber = fn; // qb: for patch sorting"},{"Add":" patch->area = area;"},{"Add":" if(patch->area <= 1)"},{"Add":" patch->area = 1;"},{"Add":" patch->sky = IsSkyI(f);"},{"Add":""},{"Add":" VectorCopy(texture_reflectivity[f->texinfo], patch->reflectivity);"},{"Add":""},{"Add":" // non-bmodel patches can emit light"},{"Add":" if(fn < dmodels[0].numfaces) {"},{"Add":" ColorNormalize(patch->reflectivity, color);"},{"Add":""},{"Add":" patch->baselight = SH1_ColorScale(BaseLightForFaceI(f), color);"},{"Add":""},{"Add":" // VectorCopy(patch->baselight, patch->totallight);"},{"Add":" patch->totallight = patch->baselight;"},{"Add":" }"},{"Add":" }"},{"Add":" num_patches++;"},{"Add":"}"},{"Add":""},{"Add":"entity_t *EntityForModel(int32_t modnum) {"},{"Add":" int32_t i;"},{"Add":" char *s;"},{"Add":" char name[16];"},{"Add":""},{"Add":" sprintf(name, \"*%i\", modnum);"},{"Add":" // search the entities for one using modnum"},{"Add":" for(i = 0; i < num_entities; i++) {"},{"Add":" s = ValueForKey(&entities[i], \"model\");"},{"Add":" if(!strcmp(s, name))"},{"Add":" return &entities[i];"},{"Add":" }"},{"Add":""},{"Add":" return &entities[0];"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MakePatches"},{"Add":"============="},{"Add":"*/"},{"Add":"void MakePatches(void) {"},{"Add":" int32_t i, j, k;"},{"Add":" int32_t fn;"},{"Add":" winding_t *w;"},{"Add":" dmodel_t *mod;"},{"Add":" vec3_t origin;"},{"Add":" entity_t *ent;"},{"Add":""},{"Add":" qprintf(\"%i faces\\n\", numfaces);"},{"Add":""},{"Add":" for(i = 0; i < nummodels; i++) {"},{"Add":" mod = &dmodels[i];"},{"Add":" ent = EntityForModel(i);"},{"Add":" // bmodels with origin brushes need to be offset into their"},{"Add":" // in-use position"},{"Add":" GetVectorForKey(ent, \"origin\", origin);"},{"Add":" // VectorCopy (vec3_origin, origin);"},{"Add":""},{"Add":" for(j = 0; j < mod->numfaces; j++) {"},{"Add":" fn = mod->firstface + j;"},{"Add":" face_entity[fn] = ent;"},{"Add":" VectorCopy(origin, face_offset[fn]);"},{"Add":" if(use_qbsp) {"},{"Add":" dface_tx *f;"},{"Add":" f = &dfacesX[fn];"},{"Add":" w = WindingFromFaceX(f);"},{"Add":" } else {"},{"Add":" dface_t *f;"},{"Add":" f = &dfaces[fn];"},{"Add":" w = WindingFromFace(f);"},{"Add":" }"},{"Add":""},{"Add":" for(k = 0; k < w->numpoints; k++) {"},{"Add":" VectorAdd(w->p[k], origin, w->p[k]);"},{"Add":" }"},{"Add":" MakePatchForFace(fn, w);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"%i sqaure feet\\n\", (int32_t)(totalarea / 64));"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"======================================================================="},{"Add":""},{"Add":"SUBDIVIDE"},{"Add":""},{"Add":"======================================================================="},{"Add":"*/"},{"Add":""},{"Add":"void FinishSplit(patch_t *patch, patch_t *newp) {"},{"Add":" newp->baselight = patch->baselight;"},{"Add":" newp->totallight = patch->totallight;"},{"Add":" VectorCopy(patch->reflectivity, newp->reflectivity);"},{"Add":" newp->plane = patch->plane;"},{"Add":" newp->sky = patch->sky;"},{"Add":""},{"Add":" patch->area = WindingArea(patch->winding);"},{"Add":" newp->area = WindingArea(newp->winding);"},{"Add":""},{"Add":" if(patch->area <= 1)"},{"Add":" patch->area = 1;"},{"Add":" if(newp->area <= 1)"},{"Add":" newp->area = 1;"},{"Add":""},{"Add":" if(use_qbsp) {"},{"Add":" dleaf_tx *leaf;"},{"Add":" WindingCenter(patch->winding, patch->origin);"},{"Add":" VectorAdd(patch->origin, patch->plane->normal, patch->origin);"},{"Add":" leaf = RadPointInLeafX(patch->origin);"},{"Add":" patch->cluster = leaf->cluster;"},{"Add":" if(patch->cluster == -1)"},{"Add":" qprintf(\"patch->cluster == -1\\n\");"},{"Add":""},{"Add":" WindingCenter(newp->winding, newp->origin);"},{"Add":" VectorAdd(newp->origin, newp->plane->normal, newp->origin);"},{"Add":" leaf = RadPointInLeafX(newp->origin);"},{"Add":" newp->cluster = leaf->cluster;"},{"Add":" if(newp->cluster == -1)"},{"Add":" qprintf(\"patch->cluster == -1\\n\");"},{"Add":" } else {"},{"Add":" dleaf_t *leaf;"},{"Add":" WindingCenter(patch->winding, patch->origin);"},{"Add":" VectorAdd(patch->origin, patch->plane->normal, patch->origin);"},{"Add":" leaf = RadPointInLeaf(patch->origin);"},{"Add":" patch->cluster = leaf->cluster;"},{"Add":" if(patch->cluster == -1)"},{"Add":" qprintf(\"patch->cluster == -1\\n\");"},{"Add":""},{"Add":" WindingCenter(newp->winding, newp->origin);"},{"Add":" VectorAdd(newp->origin, newp->plane->normal, newp->origin);"},{"Add":" leaf = RadPointInLeaf(newp->origin);"},{"Add":" newp->cluster = leaf->cluster;"},{"Add":" if(newp->cluster == -1)"},{"Add":" qprintf(\"patch->cluster == -1\\n\");"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"SubdividePatch"},{"Add":""},{"Add":"Chops the patch only if its local bounds exceed the max size"},{"Add":"============="},{"Add":"*/"},{"Add":"void SubdividePatch(patch_t *patch) {"},{"Add":" winding_t *w, *o1, *o2;"},{"Add":" vec3_t mins, maxs, total;"},{"Add":" vec3_t split;"},{"Add":" vec_t dist;"},{"Add":" int32_t i, j;"},{"Add":" vec_t v;"},{"Add":" patch_t *newp;"},{"Add":""},{"Add":" w = patch->winding;"},{"Add":" mins[0] = mins[1] = mins[2] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = maxs[2] = -BOGUS_RANGE;"},{"Add":" for(i = 0; i < w->numpoints; i++) {"},{"Add":" for(j = 0; j < 3; j++) {"},{"Add":" v = w->p[i][j];"},{"Add":" if(v < mins[j])"},{"Add":" mins[j] = v;"},{"Add":" if(v > maxs[j])"},{"Add":" maxs[j] = v;"},{"Add":" }"},{"Add":" }"},{"Add":" VectorSubtract(maxs, mins, total);"},{"Add":" for(i = 0; i < 3; i++)"},{"Add":" if(total[i] > (subdiv + 1))"},{"Add":" break;"},{"Add":" if(i == 3) {"},{"Add":" // no splitting needed"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // split the winding"},{"Add":" //"},{"Add":" VectorCopy(vec3_origin, split);"},{"Add":" split[i] = 1;"},{"Add":" dist = (mins[i] + maxs[i]) * 0.5;"},{"Add":" ClipWindingEpsilon(w, split, dist, ON_EPSILON, &o1, &o2);"},{"Add":""},{"Add":" //"},{"Add":" // create a new patch"},{"Add":" //"},{"Add":" if(use_qbsp) {"},{"Add":" if(num_patches == MAX_PATCHES_QBSP)"},{"Add":" Error(\"Exceeded MAX_PATCHES_QBSP %i\", MAX_PATCHES_QBSP);"},{"Add":" } else if(num_patches == MAX_PATCHES)"},{"Add":" Error(\"Exceeded MAX_PATCHES %i\", MAX_PATCHES);"},{"Add":""},{"Add":" newp = &patches[num_patches];"},{"Add":" num_patches++;"},{"Add":""},{"Add":" newp->next = patch->next;"},{"Add":" patch->next = newp;"},{"Add":""},{"Add":" patch->winding = o1;"},{"Add":" newp->winding = o2;"},{"Add":""},{"Add":" FinishSplit(patch, newp);"},{"Add":""},{"Add":" SubdividePatch(patch);"},{"Add":" SubdividePatch(newp);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"DicePatch"},{"Add":""},{"Add":"Chops the patch by a global grid"},{"Add":"============="},{"Add":"*/"},{"Add":"void DicePatch(patch_t *patch) {"},{"Add":" winding_t *w, *o1, *o2;"},{"Add":" vec3_t mins, maxs;"},{"Add":" vec3_t split;"},{"Add":" vec_t dist;"},{"Add":" int32_t i;"},{"Add":" patch_t *newp;"},{"Add":""},{"Add":" w = patch->winding;"},{"Add":" WindingBounds(w, mins, maxs); // 3D AABB for polygon"},{"Add":" for(i = 0; i < 3; i++)"},{"Add":" if(floor((mins[i] + 1) / subdiv) < floor((maxs[i] - 1) / subdiv))"},{"Add":" break;"},{"Add":" if(i == 3) {"},{"Add":" // no splitting needed"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // split the winding"},{"Add":" //"},{"Add":" VectorCopy(vec3_origin, split);"},{"Add":" split[i] = 1;"},{"Add":" dist = subdiv * (1 + floor((mins[i] + 1) / subdiv));"},{"Add":" ClipWindingEpsilon(w, split, dist, ON_EPSILON, &o1, &o2);"},{"Add":""},{"Add":" //"},{"Add":" // create a new patch"},{"Add":" //"},{"Add":" if(use_qbsp) {"},{"Add":" if(num_patches == MAX_PATCHES_QBSP)"},{"Add":" Error(\"Exceeded MAX_PATCHES_QBSP %i\", MAX_PATCHES_QBSP);"},{"Add":" } else if(num_patches == MAX_PATCHES)"},{"Add":" Error(\"Exceeded MAX_PATCHES %i\", MAX_PATCHES);"},{"Add":" newp = &patches[num_patches];"},{"Add":" num_patches++;"},{"Add":""},{"Add":" newp->next = patch->next;"},{"Add":" patch->next = newp;"},{"Add":""},{"Add":" patch->winding = o1;"},{"Add":" newp->winding = o2;"},{"Add":""},{"Add":" FinishSplit(patch, newp);"},{"Add":""},{"Add":" DicePatch(patch);"},{"Add":" DicePatch(newp);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"SubdividePatches"},{"Add":"============="},{"Add":"*/"},{"Add":"void SubdividePatches(void) {"},{"Add":" int32_t i, num;"},{"Add":""},{"Add":" if(subdiv < 1)"},{"Add":" return;"},{"Add":""},{"Add":" num = num_patches; // because the list will grow"},{"Add":" for(i = 0; i < num; i++) {"},{"Add":" if(dicepatches)"},{"Add":" DicePatch(&patches[i]);"},{"Add":" else"},{"Add":" SubdividePatch(&patches[i]);"},{"Add":" }"},{"Add":" for(i = 0; i < num_patches; i++)"},{"Add":" patches[i].nodenum = PointInNodenum(patches[i].origin);"},{"Add":" printf(\"%i subdiv patches\\n\", num_patches);"},{"Add":" printf(\"-------------------------\\n\");"},{"Add":""},{"Add":" qprintf(\"[? patch->cluster=-1 count is %i ?in solid leaf?]\\n\", cluster_neg_one);"},{"Add":"}"},{"Add":""},{"Add":"//====================================================================="}]}},{"FileAdd":{"meta":{"basename":"lightmap.c","metadata":0},"context":[{"change":0,"pos":195246}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"stddef.h\""},{"Add":"#include \"assert.h\""},{"Add":"#include \"qrad.h\""},{"Add":""},{"Add":"#define MAX_LSTYLES 256"},{"Add":""},{"Add":"#define SINGLEMAP (64 * 64 * 4)"},{"Add":"#define QBSP_SINGLEMAP (256 * 256 * 4) // qb: higher res lightmaps"},{"Add":"typedef struct"},{"Add":"{"},{"Add":" dface_t *faces[2];"},{"Add":" dface_tx *facesX[2];"},{"Add":" qboolean coplanar;"},{"Add":" qboolean smooth;"},{"Add":" vec_t cos_normals_angle;"},{"Add":" vec3_t interface_normal;"},{"Add":" vec3_t vertex_normal[2];"},{"Add":"} edgeshare_t;"},{"Add":""},{"Add":"edgeshare_t edgeshare[MAX_MAP_EDGES_QBSP];"},{"Add":""},{"Add":"int32_t facelinks[MAX_MAP_FACES_QBSP];"},{"Add":"int32_t planelinks[2][MAX_MAP_PLANES_QBSP];"},{"Add":"int32_t maxdata = DEFAULT_MAP_LIGHTING, step = LMSTEP;"},{"Add":"vec3_t face_texnormals[MAX_MAP_FACES_QBSP];"},{"Add":"float sunradscale = 0.5;"},{"Add":"byte *dlightdata_ptr;"},{"Add":""},{"Add":"// qb: quemap- face extents"},{"Add":"typedef struct face_extents_s {"},{"Add":" vec3_t mins, maxs;"},{"Add":" vec3_t center;"},{"Add":" vec_t st_mins[2], st_maxs[2];"},{"Add":"} face_extents_t;"},{"Add":""},{"Add":"static face_extents_t face_extents[MAX_MAP_FACES_QBSP];"},{"Add":""},{"Add":"const dplane_t *getPlaneFromFaceNumber(const uint32_t faceNumber) {"},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *face = &dfacesX[faceNumber];"},{"Add":" if (face->side) {"},{"Add":" return &backplanes[face->planenum];"},{"Add":" } else {"},{"Add":" return &dplanes[face->planenum];"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *face = &dfaces[faceNumber];"},{"Add":" if (face->side) {"},{"Add":" return &backplanes[face->planenum];"},{"Add":" } else {"},{"Add":" return &dplanes[face->planenum];"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"qboolean GetIntertexnormal(int32_t facenum1, int32_t facenum2) {"},{"Add":" vec3_t normal;"},{"Add":" const dplane_t *p1 = getPlaneFromFaceNumber(facenum1);"},{"Add":" const dplane_t *p2 = getPlaneFromFaceNumber(facenum2);"},{"Add":" VectorAdd(face_texnormals[facenum1], face_texnormals[facenum2], normal);"},{"Add":" if (!VectorNormalize(normal, normal) || DotProduct(normal, p1->normal) <= NORMAL_EPSILON || DotProduct(normal, p2->normal) <= NORMAL_EPSILON) {"},{"Add":" return false;"},{"Add":" }"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/**"},{"Add":" * @brief Populates face_extents for all d_bsp_face_t, prior to light creation."},{"Add":" * This is done so that sample positions may be nudged outward along"},{"Add":" * the face normal and towards the face center to help with traces."},{"Add":" */"},{"Add":"void BuildFaceExtents(void) {"},{"Add":" const dvertex_t *v;"},{"Add":" int32_t i, j, k;"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" for (k = 0; k < numfaces; k++) {"},{"Add":""},{"Add":" const dface_tx *s = &dfacesX[k];"},{"Add":" const texinfo_t *tex = &texinfo[s->texinfo];"},{"Add":" const size_t face_index = (ptrdiff_t)(s - dfacesX);"},{"Add":""},{"Add":" vec_t *mins = face_extents[face_index].mins;"},{"Add":" vec_t *maxs = face_extents[face_index].maxs;"},{"Add":""},{"Add":" vec_t *center = face_extents[face_index].center;"},{"Add":""},{"Add":" vec_t *st_mins = face_extents[face_index].st_mins;"},{"Add":" vec_t *st_maxs = face_extents[face_index].st_maxs;"},{"Add":""},{"Add":" mins[0] = mins[1] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = -BOGUS_RANGE;"},{"Add":""},{"Add":" for (i = 0; i < s->numedges; i++) {"},{"Add":" const int32_t e = dsurfedges[s->firstedge + i];"},{"Add":" if (e >= 0) {"},{"Add":" v = dvertexes + dedgesX[e].v[0];"},{"Add":" } else {"},{"Add":" v = dvertexes + dedgesX[-e].v[1];"},{"Add":" }"},{"Add":""},{"Add":" for (j = 0; j < 3; j++) // calculate mins, maxs"},{"Add":" {"},{"Add":" if (v->point[j] > maxs[j]) {"},{"Add":" maxs[j] = v->point[j];"},{"Add":" }"},{"Add":" if (v->point[j] < mins[j]) {"},{"Add":" mins[j] = v->point[j];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" /* qb: from ericw-tools light/ltface.cc:"},{"Add":" * The (long double) casts below are important: The original code"},{"Add":" * was written for x87 floating-point which uses 80-bit floats for"},{"Add":" * intermediate calculations. But if you compile it without the"},{"Add":" * casts for modern x86_64, the compiler will round each"},{"Add":" * intermediate result to a 32-bit float, which introduces extra"},{"Add":" * rounding error."},{"Add":" *"},{"Add":" * This becomes a problem if the rounding error causes the light"},{"Add":" * utilities and the engine to disagree about the lightmap size"},{"Add":" * for some surfaces."},{"Add":" *"},{"Add":" * Casting to (long double) keeps the intermediate values at at"},{"Add":" * least 64 bits of precision, probably 128."},{"Add":" */"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) // calculate st_mins, st_maxs"},{"Add":" {"},{"Add":" // const vec_t val = DotProduct(v->point, tex->vecs[j]) + tex->vecs[j][3];"},{"Add":" const vec_t val = (long double)v->point[0] * tex->vecs[j][0] +"},{"Add":" (long double)v->point[1] * tex->vecs[j][1] +"},{"Add":" (long double)v->point[2] * tex->vecs[j][2] +"},{"Add":" tex->vecs[j][3];"},{"Add":" if (val < st_mins[j]) {"},{"Add":" st_mins[j] = val;"},{"Add":" }"},{"Add":" if (val > st_maxs[j]) {"},{"Add":" st_maxs[j] = val;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) // calculate center"},{"Add":" {"},{"Add":" center[i] = (mins[i] + maxs[i]) / 2.0;"},{"Add":" }"},{"Add":" }"},{"Add":" else // ibsp"},{"Add":" for (k = 0; k < numfaces; k++) {"},{"Add":" const dface_t *s = &dfaces[k];"},{"Add":" const texinfo_t *tex = &texinfo[s->texinfo];"},{"Add":" const size_t face_index = (ptrdiff_t)(s - dfaces);"},{"Add":""},{"Add":" vec_t *mins = face_extents[face_index].mins;"},{"Add":" vec_t *maxs = face_extents[face_index].maxs;"},{"Add":""},{"Add":" vec_t *center = face_extents[face_index].center;"},{"Add":""},{"Add":" vec_t *st_mins = face_extents[face_index].st_mins;"},{"Add":" vec_t *st_maxs = face_extents[face_index].st_maxs;"},{"Add":""},{"Add":" mins[0] = mins[1] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = -BOGUS_RANGE;"},{"Add":""},{"Add":" for (i = 0; i < s->numedges; i++) {"},{"Add":" const int32_t e = dsurfedges[s->firstedge + i];"},{"Add":" if (e >= 0) {"},{"Add":" v = dvertexes + dedges[e].v[0];"},{"Add":" } else {"},{"Add":" v = dvertexes + dedges[-e].v[1];"},{"Add":" }"},{"Add":""},{"Add":" for (j = 0; j < 3; j++) // calculate mins, maxs"},{"Add":" {"},{"Add":" if (v->point[j] > maxs[j]) {"},{"Add":" maxs[j] = v->point[j];"},{"Add":" }"},{"Add":" if (v->point[j] < mins[j]) {"},{"Add":" mins[j] = v->point[j];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) // calculate st_mins, st_maxs"},{"Add":" {"},{"Add":" // const vec_t val = DotProduct(v->point, tex->vecs[j]) + tex->vecs[j][3];"},{"Add":" const vec_t val = (long double)v->point[0] * tex->vecs[j][0] +"},{"Add":" (long double)v->point[1] * tex->vecs[j][1] +"},{"Add":" (long double)v->point[2] * tex->vecs[j][2] +"},{"Add":" tex->vecs[j][3];"},{"Add":" if (val < st_mins[j]) {"},{"Add":" st_mins[j] = val;"},{"Add":" }"},{"Add":" if (val > st_maxs[j]) {"},{"Add":" st_maxs[j] = val;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) // calculate center"},{"Add":" {"},{"Add":" center[i] = (mins[i] + maxs[i]) / 2.0;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":"/*"},{"Add":"============"},{"Add":"LinkPlaneFaces"},{"Add":"============"},{"Add":"*/"},{"Add":"void LinkPlaneFaces(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *f;"},{"Add":" f = dfacesX;"},{"Add":" for (i = 0; i < numfaces; i++, f++) {"},{"Add":" facelinks[i] = planelinks[f->side][f->planenum];"},{"Add":" planelinks[f->side][f->planenum] = i;"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *f;"},{"Add":" f = dfaces;"},{"Add":" for (i = 0; i < numfaces; i++, f++) {"},{"Add":" facelinks[i] = planelinks[f->side][f->planenum];"},{"Add":" planelinks[f->side][f->planenum] = i;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"const dplane_t *getPlaneFromFace(const dface_t *face) {"},{"Add":" if (!face) {"},{"Add":" Error(\"getPlaneFromFace face was NULL\\n\");"},{"Add":" }"},{"Add":""},{"Add":" if (face->side) {"},{"Add":" return &backplanes[face->planenum];"},{"Add":" } else {"},{"Add":" return &dplanes[face->planenum];"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"const dplane_t *getPlaneFromFaceX(const dface_tx *face) {"},{"Add":" if (!face) {"},{"Add":" Error(\"getPlaneFromFaceX face was NULL\\n\");"},{"Add":" }"},{"Add":""},{"Add":" if (face->side) {"},{"Add":" return &backplanes[face->planenum];"},{"Add":" } else {"},{"Add":" return &dplanes[face->planenum];"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"PairEdges"},{"Add":"============"},{"Add":"*/"},{"Add":""},{"Add":"// qb: VHLT"},{"Add":""},{"Add":"int32_t AddFaceForVertexNormalX(const int32_t edgeabs, int32_t edgeabsnext, const int32_t edgeend, int32_t edgeendnext, dface_tx *const f, dface_tx *fnext, vec_t angle, vec3_t normal)"},{"Add":"// Must guarantee these faces will form a loop or a chain, otherwise will result in endless loop."},{"Add":"//"},{"Add":"// e[end]/enext[endnext]"},{"Add":"// *"},{"Add":"// |\\."},{"Add":"// |a\\ fnext"},{"Add":"// | \\,"},{"Add":"// | f \\."},{"Add":"// | \\."},{"Add":"// e enext"},{"Add":"//"},{"Add":"{"},{"Add":" VectorCopy(getPlaneFromFaceX(f)->normal, normal);"},{"Add":" int32_t vnum = dedgesX[edgeabs].v[edgeend];"},{"Add":" int32_t edge = 0, edgenext = 0;"},{"Add":" int32_t i, e, count1, count2;"},{"Add":" vec_t dot;"},{"Add":" for (count1 = count2 = 0, i = 0; i < f->numedges; i++) {"},{"Add":" e = dsurfedges[f->firstedge + i];"},{"Add":" if (dedgesX[abs(e)].v[0] == dedgesX[abs(e)].v[1])"},{"Add":" continue;"},{"Add":" if (abs(e) == edgeabs) {"},{"Add":" edge = e;"},{"Add":" count1++;"},{"Add":" } else if (dedgesX[abs(e)].v[0] == vnum || dedgesX[abs(e)].v[1] == vnum) {"},{"Add":" edgenext = e;"},{"Add":" count2++;"},{"Add":" }"},{"Add":" }"},{"Add":" if (count1 != 1 || count2 != 1) {"},{"Add":" qprintf(\"AddFaceForVertexNormalX bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" int32_t vnum11, vnum12, vnum21, vnum22;"},{"Add":" vec3_t vec1, vec2;"},{"Add":""},{"Add":" vnum11 = dedgesX[abs(edge)].v[edge > 0 ? 0 : 1];"},{"Add":" vnum12 = dedgesX[abs(edge)].v[edge > 0 ? 1 : 0];"},{"Add":" vnum21 = dedgesX[abs(edgenext)].v[edgenext > 0 ? 0 : 1];"},{"Add":" vnum22 = dedgesX[abs(edgenext)].v[edgenext > 0 ? 1 : 0];"},{"Add":""},{"Add":" if (vnum == vnum12 && vnum == vnum21 && vnum != vnum11 && vnum != vnum22) {"},{"Add":" VectorSubtract(dvertexes[vnum11].point, dvertexes[vnum].point, vec1);"},{"Add":" VectorSubtract(dvertexes[vnum22].point, dvertexes[vnum].point, vec2);"},{"Add":" edgeabsnext = abs(edgenext);"},{"Add":" edgeendnext = edgenext > 0 ? 0 : 1;"},{"Add":" } else if (vnum == vnum11 && vnum == vnum22 && vnum != vnum12 && vnum != vnum21) {"},{"Add":" VectorSubtract(dvertexes[vnum12].point, dvertexes[vnum].point, vec1);"},{"Add":" VectorSubtract(dvertexes[vnum21].point, dvertexes[vnum].point, vec2);"},{"Add":" edgeabsnext = abs(edgenext);"},{"Add":" edgeendnext = edgenext > 0 ? 1 : 0;"},{"Add":" } else {"},{"Add":" qprintf(\"AddFaceForVertexNormalX bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" VectorNormalize(vec1, vec1);"},{"Add":" VectorNormalize(vec2, vec2);"},{"Add":" dot = DotProduct(vec1, vec2);"},{"Add":" dot = dot > 1 ? 1 : dot < -1 ? -1"},{"Add":" : dot;"},{"Add":" angle = acos(dot);"},{"Add":" edgeshare_t *es = &edgeshare[edgeabsnext];"},{"Add":" if (!(es->facesX[0] && es->facesX[1]))"},{"Add":" return 1;"},{"Add":" if (es->facesX[0] == f && es->facesX[1] != f)"},{"Add":" fnext = es->facesX[1];"},{"Add":" else if (es->facesX[1] == f && es->facesX[0] != f)"},{"Add":" fnext = es->facesX[0];"},{"Add":" else {"},{"Add":" qprintf(\"AddFaceForVertexNormalX bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" return 0;"},{"Add":"}"},{"Add":""},{"Add":"int32_t AddFaceForVertexNormal(const int32_t edgeabs, int32_t edgeabsnext, const int32_t edgeend, int32_t edgeendnext, dface_t *const f, dface_t *fnext, vec_t angle, vec3_t normal) {"},{"Add":" VectorCopy(getPlaneFromFace(f)->normal, normal);"},{"Add":" int32_t vnum = dedgesX[edgeabs].v[edgeend];"},{"Add":" int32_t edge = 0, edgenext = 0;"},{"Add":" int32_t i, e, count1, count2;"},{"Add":" vec_t dot;"},{"Add":" for (count1 = count2 = 0, i = 0; i < f->numedges; i++) {"},{"Add":" e = dsurfedges[f->firstedge + i];"},{"Add":" if (dedges[abs(e)].v[0] == dedges[abs(e)].v[1])"},{"Add":" continue;"},{"Add":" if (abs(e) == edgeabs) {"},{"Add":" edge = e;"},{"Add":" count1++;"},{"Add":" } else if (dedges[abs(e)].v[0] == vnum || dedges[abs(e)].v[1] == vnum) {"},{"Add":" edgenext = e;"},{"Add":" count2++;"},{"Add":" }"},{"Add":" }"},{"Add":" if (count1 != 1 || count2 != 1) {"},{"Add":" qprintf(\"AddFaceForVertexNormal bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" int32_t vnum11, vnum12, vnum21, vnum22;"},{"Add":" vec3_t vec1, vec2;"},{"Add":""},{"Add":" vnum11 = dedges[abs(edge)].v[edge > 0 ? 0 : 1];"},{"Add":" vnum12 = dedges[abs(edge)].v[edge > 0 ? 1 : 0];"},{"Add":" vnum21 = dedges[abs(edgenext)].v[edgenext > 0 ? 0 : 1];"},{"Add":" vnum22 = dedges[abs(edgenext)].v[edgenext > 0 ? 1 : 0];"},{"Add":""},{"Add":" if (vnum == vnum12 && vnum == vnum21 && vnum != vnum11 && vnum != vnum22) {"},{"Add":" VectorSubtract(dvertexes[vnum11].point, dvertexes[vnum].point, vec1);"},{"Add":" VectorSubtract(dvertexes[vnum22].point, dvertexes[vnum].point, vec2);"},{"Add":" edgeabsnext = abs(edgenext);"},{"Add":" edgeendnext = edgenext > 0 ? 0 : 1;"},{"Add":" } else if (vnum == vnum11 && vnum == vnum22 && vnum != vnum12 && vnum != vnum21) {"},{"Add":" VectorSubtract(dvertexes[vnum12].point, dvertexes[vnum].point, vec1);"},{"Add":" VectorSubtract(dvertexes[vnum21].point, dvertexes[vnum].point, vec2);"},{"Add":" edgeabsnext = abs(edgenext);"},{"Add":" edgeendnext = edgenext > 0 ? 1 : 0;"},{"Add":" } else {"},{"Add":" qprintf(\"AddFaceForVertexNormal bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" VectorNormalize(vec1, vec1);"},{"Add":" VectorNormalize(vec2, vec2);"},{"Add":" dot = DotProduct(vec1, vec2);"},{"Add":" dot = dot > 1 ? 1 : dot < -1 ? -1"},{"Add":" : dot;"},{"Add":" angle = acos(dot);"},{"Add":" edgeshare_t *es = &edgeshare[edgeabsnext];"},{"Add":" if (!(es->faces[0] && es->faces[1]))"},{"Add":" return 1;"},{"Add":" if (es->faces[0] == f && es->faces[1] != f)"},{"Add":" fnext = es->faces[1];"},{"Add":" else if (es->faces[1] == f && es->faces[0] != f)"},{"Add":" fnext = es->faces[0];"},{"Add":" else {"},{"Add":" qprintf(\"AddFaceForVertexNormal bad face: edgeabs=%d edgeend=%d\\n\", edgeabs, edgeend);"},{"Add":" return -1;"},{"Add":" }"},{"Add":" return 0;"},{"Add":"}"},{"Add":""},{"Add":"// ====================================================================================="},{"Add":"// PairEdges"},{"Add":"// ====================================================================================="},{"Add":""},{"Add":"void PairEdges() {"},{"Add":" int32_t i, j, k;"},{"Add":" edgeshare_t *e;"},{"Add":""},{"Add":" memset(&edgeshare, 0, sizeof(edgeshare));"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *f;"},{"Add":" f = dfacesX;"},{"Add":" for (i = 0; i < numfaces; i++, f++) {"},{"Add":" {"},{"Add":" const dplane_t *fp = getPlaneFromFaceX(f);"},{"Add":" vec3_t texnormal;"},{"Add":" const texinfo_t *tex = &texinfo[f->texinfo];"},{"Add":" CrossProduct(tex->vecs[1], tex->vecs[0], texnormal);"},{"Add":" VectorNormalize(texnormal, texnormal);"},{"Add":" if (DotProduct(texnormal, fp->normal) < 0) {"},{"Add":" VectorSubtract(vec3_origin, texnormal, texnormal);"},{"Add":" }"},{"Add":" VectorCopy(texnormal, face_texnormals[i]);"},{"Add":" }"},{"Add":""},{"Add":" for (j = 0; j < f->numedges; j++) {"},{"Add":" k = dsurfedges[f->firstedge + j];"},{"Add":" if (k < 0) {"},{"Add":" e = &edgeshare[-k];"},{"Add":""},{"Add":" assert(e->facesX[1] == NULL);"},{"Add":" e->facesX[1] = f;"},{"Add":" } else {"},{"Add":" e = &edgeshare[k];"},{"Add":""},{"Add":" assert(e->facesX[0] == NULL);"},{"Add":" e->facesX[0] = f;"},{"Add":" }"},{"Add":""},{"Add":" if (e->facesX[0] && e->facesX[1]) {"},{"Add":" // determine if coplanar"},{"Add":" if ((e->facesX[0]->planenum == e->facesX[1]->planenum) && (e->facesX[0]->side == e->facesX[1]->side)) {"},{"Add":" e->coplanar = true;"},{"Add":" VectorCopy(getPlaneFromFaceX(e->facesX[0])->normal, e->interface_normal);"},{"Add":" e->cos_normals_angle = 1.0;"},{"Add":" } else {"},{"Add":" // see if they fall into a \"smoothing group\" based on angle of the normals"},{"Add":" vec3_t normals[2];"},{"Add":""},{"Add":" VectorCopy(getPlaneFromFaceX(e->facesX[0])->normal, normals[0]);"},{"Add":" VectorCopy(getPlaneFromFaceX(e->facesX[1])->normal, normals[1]);"},{"Add":""},{"Add":" e->cos_normals_angle = DotProduct(normals[0], normals[1]);"},{"Add":""},{"Add":" if (e->cos_normals_angle > (1.0 - 0.01)) // qb: get sloppier than 1 - NORMAL_EPSILON"},{"Add":" {"},{"Add":" e->coplanar = true;"},{"Add":" VectorCopy(getPlaneFromFaceX(e->facesX[0])->normal, e->interface_normal);"},{"Add":" e->cos_normals_angle = 1.0;"},{"Add":" } else if (smoothing_threshold > 0.0) {"},{"Add":" if (e->cos_normals_angle >= smoothing_threshold) {"},{"Add":" num_smoothing += 1;"},{"Add":" VectorAdd(normals[0], normals[1], e->interface_normal);"},{"Add":" VectorNormalize(e->interface_normal, e->interface_normal);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!VectorCompare(e->interface_normal, vec3_origin)) {"},{"Add":" e->smooth = true;"},{"Add":" }"},{"Add":" if (!GetIntertexnormal(e->facesX[0] - dfacesX, e->facesX[1] - dfacesX)) {"},{"Add":" // printf (\"!GetIntertexnormal hit.\\n\");"},{"Add":" e->coplanar = false;"},{"Add":" VectorClear(e->interface_normal);"},{"Add":" e->smooth = false;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" } else // ibsp"},{"Add":" {"},{"Add":" dface_t *f;"},{"Add":" f = dfaces;"},{"Add":" for (i = 0; i < numfaces; i++, f++) {"},{"Add":" {"},{"Add":" const dplane_t *fp = getPlaneFromFace(f);"},{"Add":" vec3_t texnormal;"},{"Add":" const texinfo_t *tex = &texinfo[f->texinfo];"},{"Add":" CrossProduct(tex->vecs[1], tex->vecs[0], texnormal);"},{"Add":" VectorNormalize(texnormal, texnormal);"},{"Add":" if (DotProduct(texnormal, fp->normal) < 0) {"},{"Add":" VectorSubtract(vec3_origin, texnormal, texnormal);"},{"Add":" }"},{"Add":" VectorCopy(texnormal, face_texnormals[i]);"},{"Add":" }"},{"Add":""},{"Add":" for (j = 0; j < f->numedges; j++) {"},{"Add":" k = dsurfedges[f->firstedge + j];"},{"Add":" if (k < 0) {"},{"Add":" e = &edgeshare[-k];"},{"Add":""},{"Add":" assert(e->faces[1] == NULL);"},{"Add":" e->faces[1] = f;"},{"Add":" } else {"},{"Add":" e = &edgeshare[k];"},{"Add":""},{"Add":" assert(e->faces[0] == NULL);"},{"Add":" e->faces[0] = f;"},{"Add":" }"},{"Add":""},{"Add":" if (e->faces[0] && e->faces[1]) {"},{"Add":" // determine if coplanar"},{"Add":" if ((e->faces[0]->planenum == e->faces[1]->planenum) && (e->faces[0]->side == e->faces[1]->side)) {"},{"Add":" e->coplanar = true;"},{"Add":" VectorCopy(getPlaneFromFace(e->faces[0])->normal, e->interface_normal);"},{"Add":" e->cos_normals_angle = 1.0;"},{"Add":" } else {"},{"Add":" // see if they fall into a \"smoothing group\" based on angle of the normals"},{"Add":" vec3_t normals[2];"},{"Add":""},{"Add":" VectorCopy(getPlaneFromFace(e->faces[0])->normal, normals[0]);"},{"Add":" VectorCopy(getPlaneFromFace(e->faces[1])->normal, normals[1]);"},{"Add":""},{"Add":" e->cos_normals_angle = DotProduct(normals[0], normals[1]);"},{"Add":""},{"Add":" if (e->cos_normals_angle > (1.0 - 0.01)) // qb: get sloppier than 1 - NORMAL_EPSILON"},{"Add":" {"},{"Add":" e->coplanar = true;"},{"Add":" VectorCopy(getPlaneFromFace(e->faces[0])->normal, e->interface_normal);"},{"Add":" e->cos_normals_angle = 1.0;"},{"Add":" } else if (smoothing_threshold > 0.0) {"},{"Add":" if (e->cos_normals_angle >= smoothing_threshold) {"},{"Add":" num_smoothing += 1;"},{"Add":" VectorAdd(normals[0], normals[1], e->interface_normal);"},{"Add":" VectorNormalize(e->interface_normal, e->interface_normal);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!VectorCompare(e->interface_normal, vec3_origin)) {"},{"Add":" e->smooth = true;"},{"Add":" }"},{"Add":" if (!GetIntertexnormal(e->faces[0] - dfaces, e->faces[1] - dfaces)) {"},{"Add":" // printf (\"!GetIntertexnormal hit.\\n\");"},{"Add":" e->coplanar = false;"},{"Add":" VectorClear(e->interface_normal);"},{"Add":" e->smooth = false;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // qb: VHLT"},{"Add":" {"},{"Add":" int32_t edgeabs, edgeabsnext;"},{"Add":" int32_t edgeend, edgeendnext;"},{"Add":" int32_t d;"},{"Add":" vec_t angle = 0, angles = 0;"},{"Add":" vec3_t normal, normals;"},{"Add":" vec3_t edgenormal;"},{"Add":" int32_t r, count, mme;"},{"Add":" if (use_qbsp)"},{"Add":" mme = MAX_MAP_EDGES_QBSP;"},{"Add":" else"},{"Add":" mme = MAX_MAP_EDGES;"},{"Add":""},{"Add":" for (edgeabs = 0; edgeabs < mme; edgeabs++) {"},{"Add":" e = &edgeshare[edgeabs];"},{"Add":" if (!e->smooth)"},{"Add":" continue;"},{"Add":" VectorCopy(e->interface_normal, edgenormal);"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *f, *fcurrent, *fnext;"},{"Add":""},{"Add":" if (dedgesX[edgeabs].v[0] == dedgesX[edgeabs].v[1]) {"},{"Add":" vec3_t errorpos;"},{"Add":" VectorCopy(dvertexes[dedgesX[edgeabs].v[0]].point, errorpos);"},{"Add":" VectorAdd(errorpos, face_offset[e->facesX[0] - dfacesX], errorpos);"},{"Add":" Error(\"PairEdges: invalid edge at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[0]);"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[1]);"},{"Add":" } else {"},{"Add":" const dplane_t *p0 = getPlaneFromFaceX(e->facesX[0]);"},{"Add":" const dplane_t *p1 = getPlaneFromFaceX(e->facesX[1]);"},{"Add":""},{"Add":" for (edgeend = 0; edgeend < 2; edgeend++) {"},{"Add":" vec3_t errorpos;"},{"Add":" VectorCopy(dvertexes[dedgesX[edgeabs].v[edgeend]].point, errorpos);"},{"Add":" VectorAdd(errorpos, face_offset[e->facesX[0] - dfacesX], errorpos);"},{"Add":" angles = 0;"},{"Add":" VectorClear(normals);"},{"Add":""},{"Add":" for (d = 0; d < 2; d++) {"},{"Add":" f = e->facesX[d];"},{"Add":" count = 0, fnext = f, edgeabsnext = edgeabs, edgeendnext = edgeend;"},{"Add":" while (1) {"},{"Add":" fcurrent = fnext;"},{"Add":" r = AddFaceForVertexNormalX(edgeabsnext, edgeabsnext, edgeendnext, edgeendnext, fcurrent, fnext, angle, normal);"},{"Add":" count++;"},{"Add":" if (r == -1) {"},{"Add":" // qprintf(\"PairEdges: face edges mislink at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" break;"},{"Add":" }"},{"Add":" if (count >= 100) {"},{"Add":" // qprintf(\"PairEdges: faces mislink at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" break;"},{"Add":" }"},{"Add":" if (DotProduct(normal, p0->normal) <= NORMAL_EPSILON || DotProduct(normal, p1->normal) <= NORMAL_EPSILON)"},{"Add":" break;"},{"Add":" if (DotProduct(edgenormal, normal) + NORMAL_EPSILON < smoothing_threshold)"},{"Add":" break;"},{"Add":" if (!GetIntertexnormal(fcurrent - dfacesX, e->facesX[0] - dfacesX) || !GetIntertexnormal(fcurrent - dfacesX, e->facesX[1] - dfacesX))"},{"Add":" break;"},{"Add":" angles += angle;"},{"Add":" VectorMA(normals, angle, normal, normals);"},{"Add":" if (r != 0 || fnext == f)"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (angles < NORMAL_EPSILON) {"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[edgeend]);"},{"Add":" // qprintf(\"PairEdges: no valid faces at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" } else {"},{"Add":" VectorNormalize(normals, e->vertex_normal[edgeend]);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" } else // ibsp"},{"Add":" {"},{"Add":" dface_t *f, *fcurrent, *fnext;"},{"Add":""},{"Add":" if (dedges[edgeabs].v[0] == dedges[edgeabs].v[1]) {"},{"Add":" vec3_t errorpos;"},{"Add":" VectorCopy(dvertexes[dedges[edgeabs].v[0]].point, errorpos);"},{"Add":" VectorAdd(errorpos, face_offset[e->faces[0] - dfaces], errorpos);"},{"Add":" Error(\"PairEdges: invalid edge at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[0]);"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[1]);"},{"Add":" } else {"},{"Add":" const dplane_t *p0 = getPlaneFromFace(e->faces[0]);"},{"Add":" const dplane_t *p1 = getPlaneFromFace(e->faces[1]);"},{"Add":""},{"Add":" for (edgeend = 0; edgeend < 2; edgeend++) {"},{"Add":" vec3_t errorpos;"},{"Add":" VectorCopy(dvertexes[dedges[edgeabs].v[edgeend]].point, errorpos);"},{"Add":" VectorAdd(errorpos, face_offset[e->faces[0] - dfaces], errorpos);"},{"Add":" angles = 0;"},{"Add":" VectorClear(normals);"},{"Add":""},{"Add":" for (d = 0; d < 2; d++) {"},{"Add":" f = e->faces[d];"},{"Add":" count = 0, fnext = f, edgeabsnext = edgeabs, edgeendnext = edgeend;"},{"Add":" while (1) {"},{"Add":" fcurrent = fnext;"},{"Add":" r = AddFaceForVertexNormal(edgeabsnext, edgeabsnext, edgeendnext, edgeendnext, fcurrent, fnext, angle, normal);"},{"Add":" count++;"},{"Add":" if (r == -1) {"},{"Add":" // qprintf(\"PairEdges: face edges mislink at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" break;"},{"Add":" }"},{"Add":" if (count >= 100) {"},{"Add":" // qprintf(\"PairEdges: faces mislink at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" break;"},{"Add":" }"},{"Add":" if (DotProduct(normal, p0->normal) <= NORMAL_EPSILON || DotProduct(normal, p1->normal) <= NORMAL_EPSILON)"},{"Add":" break;"},{"Add":" if (DotProduct(edgenormal, normal) + NORMAL_EPSILON < smoothing_threshold)"},{"Add":" break;"},{"Add":" if (!GetIntertexnormal(fcurrent - dfaces, e->faces[0] - dfaces) || !GetIntertexnormal(fcurrent - dfaces, e->faces[1] - dfaces))"},{"Add":" break;"},{"Add":" angles += angle;"},{"Add":" VectorMA(normals, angle, normal, normals);"},{"Add":" if (r != 0 || fnext == f)"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (angles < NORMAL_EPSILON) {"},{"Add":" VectorCopy(edgenormal, e->vertex_normal[edgeend]);"},{"Add":" // qprintf(\"PairEdges: no valid faces at (%f,%f,%f)\", errorpos[0], errorpos[1], errorpos[2]);"},{"Add":" } else {"},{"Add":" VectorNormalize(normals, e->vertex_normal[edgeend]);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (e->coplanar) {"},{"Add":" if (!VectorCompare(e->vertex_normal[0], e->interface_normal) || !VectorCompare(e->vertex_normal[1], e->interface_normal)) {"},{"Add":" e->coplanar = false;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================================================================="},{"Add":""},{"Add":" POINT TRIANGULATION"},{"Add":""},{"Add":"================================================================="},{"Add":"*/"},{"Add":""},{"Add":"typedef struct triedge_s {"},{"Add":" int32_t p0, p1;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":" struct triangle_s *tri;"},{"Add":"} triedge_t;"},{"Add":""},{"Add":"typedef struct triangle_s {"},{"Add":" triedge_t *edges[3];"},{"Add":"} triangle_t;"},{"Add":""},{"Add":"#define MAX_TRI_POINTS 1024"},{"Add":"#define MAX_TRI_EDGES (MAX_TRI_POINTS * 6)"},{"Add":"#define MAX_TRI_TRIS (MAX_TRI_POINTS * 2)"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" int32_t numpoints;"},{"Add":" int32_t numedges;"},{"Add":" int32_t numtris;"},{"Add":" dplane_t *plane;"},{"Add":" triedge_t *edgematrix[MAX_TRI_POINTS][MAX_TRI_POINTS];"},{"Add":" patch_t *points[MAX_TRI_POINTS];"},{"Add":" triedge_t edges[MAX_TRI_EDGES];"},{"Add":" triangle_t tris[MAX_TRI_TRIS];"},{"Add":"} triangulation_t;"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"AllocTriangulation"},{"Add":"==============="},{"Add":"*/"},{"Add":"triangulation_t *AllocTriangulation(dplane_t *plane) {"},{"Add":" triangulation_t *t;"},{"Add":""},{"Add":" t = malloc(sizeof(triangulation_t));"},{"Add":" t->numpoints = 0;"},{"Add":" t->numedges = 0;"},{"Add":" t->numtris = 0;"},{"Add":""},{"Add":" t->plane = plane;"},{"Add":""},{"Add":" //\tmemset (t->edgematrix, 0, sizeof(t->edgematrix));"},{"Add":""},{"Add":" return t;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"FreeTriangulation"},{"Add":"==============="},{"Add":"*/"},{"Add":"void FreeTriangulation(triangulation_t *tr) {"},{"Add":" free(tr);"},{"Add":"}"},{"Add":""},{"Add":"triedge_t *FindEdge(triangulation_t *trian, int32_t p0, int32_t p1) {"},{"Add":" triedge_t *e, *be;"},{"Add":" vec3_t v1;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" if (trian->edgematrix[p0][p1])"},{"Add":" return trian->edgematrix[p0][p1];"},{"Add":""},{"Add":" if (trian->numedges > MAX_TRI_EDGES - 2)"},{"Add":" Error(\"trian->numedges > MAX_TRI_EDGES-2\");"},{"Add":""},{"Add":" VectorSubtract(trian->points[p1]->origin, trian->points[p0]->origin, v1);"},{"Add":" VectorNormalize(v1, v1);"},{"Add":" CrossProduct(v1, trian->plane->normal, normal);"},{"Add":" dist = DotProduct(trian->points[p0]->origin, normal);"},{"Add":""},{"Add":" e = &trian->edges[trian->numedges];"},{"Add":" e->p0 = p0;"},{"Add":" e->p1 = p1;"},{"Add":" e->tri = NULL;"},{"Add":" VectorCopy(normal, e->normal);"},{"Add":" e->dist = dist;"},{"Add":" trian->numedges++;"},{"Add":" trian->edgematrix[p0][p1] = e;"},{"Add":""},{"Add":" be = &trian->edges[trian->numedges];"},{"Add":" be->p0 = p1;"},{"Add":" be->p1 = p0;"},{"Add":" be->tri = NULL;"},{"Add":" VectorSubtract(vec3_origin, normal, be->normal);"},{"Add":" be->dist = -dist;"},{"Add":" trian->numedges++;"},{"Add":" trian->edgematrix[p1][p0] = be;"},{"Add":""},{"Add":" return e;"},{"Add":"}"},{"Add":""},{"Add":"triangle_t *AllocTriangle(triangulation_t *trian) {"},{"Add":" triangle_t *t;"},{"Add":""},{"Add":" if (trian->numtris >= MAX_TRI_TRIS)"},{"Add":" Error(\"trian->numtris >= MAX_TRI_TRIS\");"},{"Add":""},{"Add":" t = &trian->tris[trian->numtris];"},{"Add":" trian->numtris++;"},{"Add":""},{"Add":" return t;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"TriEdge_r"},{"Add":"============"},{"Add":"*/"},{"Add":"void TriEdge_r(triangulation_t *trian, triedge_t *e) {"},{"Add":" int32_t i, bestp = 0;"},{"Add":" vec3_t v1, v2;"},{"Add":" vec_t *p0, *p1, *p;"},{"Add":" vec_t best, ang;"},{"Add":" triangle_t *nt;"},{"Add":""},{"Add":" if (e->tri)"},{"Add":" return; // allready connected by someone"},{"Add":""},{"Add":" // find the point with the best angle"},{"Add":" p0 = trian->points[e->p0]->origin;"},{"Add":" p1 = trian->points[e->p1]->origin;"},{"Add":" best = 1.1;"},{"Add":" for (i = 0; i < trian->numpoints; i++) {"},{"Add":" p = trian->points[i]->origin;"},{"Add":" // a 0 dist will form a degenerate triangle"},{"Add":" if (DotProduct(p, e->normal) - e->dist < 0)"},{"Add":" continue; // behind edge"},{"Add":" VectorSubtract(p0, p, v1);"},{"Add":" VectorSubtract(p1, p, v2);"},{"Add":" if (!VectorNormalize(v1, v1))"},{"Add":" continue;"},{"Add":" if (!VectorNormalize(v2, v2))"},{"Add":" continue;"},{"Add":" ang = DotProduct(v1, v2);"},{"Add":" if (ang < best) {"},{"Add":" best = ang;"},{"Add":" bestp = i;"},{"Add":" }"},{"Add":" }"},{"Add":" if (best >= 1)"},{"Add":" return; // edge doesn't match anything"},{"Add":""},{"Add":" // make a new triangle"},{"Add":" nt = AllocTriangle(trian);"},{"Add":" nt->edges[0] = e;"},{"Add":" nt->edges[1] = FindEdge(trian, e->p1, bestp);"},{"Add":" nt->edges[2] = FindEdge(trian, bestp, e->p0);"},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" nt->edges[i]->tri = nt;"},{"Add":" TriEdge_r(trian, FindEdge(trian, bestp, e->p1));"},{"Add":" TriEdge_r(trian, FindEdge(trian, e->p0, bestp));"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"TriangulatePoints"},{"Add":"============"},{"Add":"*/"},{"Add":"void TriangulatePoints(triangulation_t *trian) {"},{"Add":" vec_t d, bestd;"},{"Add":" vec3_t v1;"},{"Add":" int32_t bp1 = 0, bp2 = 0, i, j;"},{"Add":" vec_t *p1, *p2;"},{"Add":" triedge_t *e, *e2;"},{"Add":""},{"Add":" if (trian->numpoints < 2)"},{"Add":" return;"},{"Add":""},{"Add":" // find the two closest points"},{"Add":" bestd = BOGUS_RANGE;"},{"Add":" for (i = 0; i < trian->numpoints; i++) {"},{"Add":" p1 = trian->points[i]->origin;"},{"Add":" for (j = i + 1; j < trian->numpoints; j++) {"},{"Add":" p2 = trian->points[j]->origin;"},{"Add":" VectorSubtract(p2, p1, v1);"},{"Add":" d = VectorLength(v1);"},{"Add":" if (d < bestd) {"},{"Add":" bestd = d;"},{"Add":" bp1 = i;"},{"Add":" bp2 = j;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" e = FindEdge(trian, bp1, bp2);"},{"Add":" e2 = FindEdge(trian, bp2, bp1);"},{"Add":" TriEdge_r(trian, e);"},{"Add":" TriEdge_r(trian, e2);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"AddPointToTriangulation"},{"Add":"==============="},{"Add":"*/"},{"Add":"void AddPointToTriangulation(patch_t *patch, triangulation_t *trian) {"},{"Add":" int32_t pnum;"},{"Add":""},{"Add":" pnum = trian->numpoints;"},{"Add":" if (pnum == MAX_TRI_POINTS)"},{"Add":" Error(\"trian->numpoints == MAX_TRI_POINTS\");"},{"Add":" trian->points[pnum] = patch;"},{"Add":" trian->numpoints++;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"LerpTriangle"},{"Add":"==============="},{"Add":"*/"},{"Add":"struct SH1 LerpTriangle(triangulation_t *trian, triangle_t *t, vec3_t point) {"},{"Add":" patch_t *p1 = trian->points[t->edges[0]->p0];"},{"Add":" patch_t *p2 = trian->points[t->edges[1]->p0];"},{"Add":" patch_t *p3 = trian->points[t->edges[2]->p0];"},{"Add":""},{"Add":" float x1 = DotProduct(p3->origin, t->edges[0]->normal) - t->edges[0]->dist;"},{"Add":" float y1 = DotProduct(p2->origin, t->edges[2]->normal) - t->edges[2]->dist;"},{"Add":""},{"Add":" float c2 = (fabs(x1) >= ON_EPSILON) ? (DotProduct(point, t->edges[0]->normal) - t->edges[0]->dist) / x1 : 0;"},{"Add":" float c3 = (fabs(y1) >= ON_EPSILON) ? (DotProduct(point, t->edges[2]->normal) - t->edges[2]->dist) / y1 : 0;"},{"Add":" float c1 = 1.0f - (c2 + c3);"},{"Add":""},{"Add":" return SH1_Add("},{"Add":" SH1_Add("},{"Add":" SH1_Scale(p1->totallight, c1),"},{"Add":" SH1_Scale(p2->totallight, c2)"},{"Add":" ), SH1_Scale(p3->totallight, c3)"},{"Add":" );"},{"Add":"}"},{"Add":""},{"Add":"qboolean PointInTriangle(vec3_t point, triangle_t *t) {"},{"Add":" int32_t i;"},{"Add":" triedge_t *e;"},{"Add":" vec_t d;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" e = t->edges[i];"},{"Add":" d = DotProduct(e->normal, point) - e->dist;"},{"Add":" if (d < 0)"},{"Add":" return false; // not inside"},{"Add":" }"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"SampleTriangulation"},{"Add":"==============="},{"Add":"*/"},{"Add":"struct SH1 SampleTriangulation(vec3_t point, triangulation_t *trian, triangle_t **last_valid) {"},{"Add":" triangle_t *t;"},{"Add":" triedge_t *e;"},{"Add":" vec_t d, best;"},{"Add":" patch_t *p0, *p1;"},{"Add":" vec3_t v1, v2;"},{"Add":" int32_t i, j;"},{"Add":""},{"Add":" if (trian->numpoints == 0) {"},{"Add":" return SH1_Clear();"},{"Add":" }"},{"Add":""},{"Add":" if (trian->numpoints == 1) {"},{"Add":" return trian->points[0]->totallight;"},{"Add":" }"},{"Add":""},{"Add":" // try the last one"},{"Add":" if (*last_valid) {"},{"Add":" if (PointInTriangle(point, *last_valid)) {"},{"Add":" return LerpTriangle(trian, *last_valid, point);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // search for triangles"},{"Add":" for (t = trian->tris, j = 0; j < trian->numtris; t++, j++) {"},{"Add":" if (t == *last_valid)"},{"Add":" continue;"},{"Add":""},{"Add":" if (!PointInTriangle(point, t))"},{"Add":" continue;"},{"Add":""},{"Add":" *last_valid = t;"},{"Add":" return LerpTriangle(trian, t, point);"},{"Add":" }"},{"Add":""},{"Add":" // search for exterior edge"},{"Add":" for (e = trian->edges, j = 0; j < trian->numedges; e++, j++) {"},{"Add":" if (e->tri)"},{"Add":" continue; // not an exterior edge"},{"Add":""},{"Add":" d = DotProduct(point, e->normal) - e->dist;"},{"Add":" if (d < 0)"},{"Add":" continue; // not in front of edge"},{"Add":""},{"Add":" p0 = trian->points[e->p0];"},{"Add":" p1 = trian->points[e->p1];"},{"Add":""},{"Add":" VectorSubtract(p1->origin, p0->origin, v1);"},{"Add":" VectorNormalize(v1, v1);"},{"Add":" VectorSubtract(point, p0->origin, v2);"},{"Add":" d = DotProduct(v2, v1);"},{"Add":" if (d < 0)"},{"Add":" continue;"},{"Add":" if (d > 1)"},{"Add":" continue;"},{"Add":" return SH1_Add(SH1_Scale(p0->totallight, 1.0f - d), SH1_Scale(p1->totallight, d));"},{"Add":" }"},{"Add":""},{"Add":" // search for nearest point"},{"Add":" best = BOGUS_RANGE;"},{"Add":" p1 = NULL;"},{"Add":" for (j = 0; j < trian->numpoints; j++) {"},{"Add":" p0 = trian->points[j];"},{"Add":" VectorSubtract(point, p0->origin, v1);"},{"Add":" d = VectorLength(v1);"},{"Add":" if (d < best) {"},{"Add":" best = d;"},{"Add":" p1 = p0;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!p1)"},{"Add":" Error(\"SampleTriangulation: no points\");"},{"Add":""},{"Add":" return p1->totallight;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================================================================="},{"Add":""},{"Add":" LIGHTMAP SAMPLE GENERATION"},{"Add":""},{"Add":"================================================================="},{"Add":"*/"},{"Add":""},{"Add":"typedef struct"},{"Add":"{"},{"Add":" vec_t facedist;"},{"Add":" vec3_t facenormal;"},{"Add":""},{"Add":" int32_t numsurfpt;"},{"Add":" vec3_t surfpt[QBSP_SINGLEMAP];"},{"Add":""},{"Add":" vec3_t modelorg; // for origined bmodels"},{"Add":""},{"Add":" vec3_t texorg;"},{"Add":" vec3_t worldtotex[2]; // s = (world - texorg) . worldtotex[0]"},{"Add":" vec3_t textoworld[2]; // world = texorg + s * textoworld[0]"},{"Add":""},{"Add":" vec_t exactmins[2], exactmaxs[2];"},{"Add":""},{"Add":" int32_t texmins[2], texsize[2];"},{"Add":" int32_t surfnum;"},{"Add":" dface_t *face;"},{"Add":" dface_tx *faceX;"},{"Add":"} lightinfo_t;"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CalcFaceExtents"},{"Add":""},{"Add":"Fills in s->texmins[] and s->texsize[]"},{"Add":"also sets exactmins[] and exactmaxs[]"},{"Add":"================"},{"Add":"*/"},{"Add":"void CalcFaceExtents(lightinfo_t *l) {"},{"Add":" vec_t mins[2], maxs[2], val;"},{"Add":" int32_t i, j, e, map = SINGLEMAP;"},{"Add":" dvertex_t *v;"},{"Add":" texinfo_t *tex;"},{"Add":" vec3_t vt;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" map = QBSP_SINGLEMAP;"},{"Add":" dface_tx *s;"},{"Add":" s = l->faceX;"},{"Add":""},{"Add":" mins[0] = mins[1] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = -BOGUS_RANGE;"},{"Add":""},{"Add":" tex = &texinfo[s->texinfo];"},{"Add":""},{"Add":" for (i = 0; i < s->numedges; i++) {"},{"Add":" e = dsurfedges[s->firstedge + i];"},{"Add":""},{"Add":" if (e >= 0)"},{"Add":" v = dvertexes + dedgesX[e].v[0];"},{"Add":" else"},{"Add":" v = dvertexes + dedgesX[-e].v[1];"},{"Add":""},{"Add":" //\t\tVectorAdd (v->point, l->modelorg, vt);"},{"Add":" VectorCopy(v->point, vt);"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" val = DotProduct(vt, tex->vecs[j]) + tex->vecs[j][3];"},{"Add":" if (val < mins[j])"},{"Add":" mins[j] = val;"},{"Add":" if (val > maxs[j])"},{"Add":" maxs[j] = val;"},{"Add":" }"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *s;"},{"Add":" s = l->face;"},{"Add":""},{"Add":" mins[0] = mins[1] = BOGUS_RANGE;"},{"Add":" maxs[0] = maxs[1] = -BOGUS_RANGE;"},{"Add":""},{"Add":" tex = &texinfo[s->texinfo];"},{"Add":""},{"Add":" for (i = 0; i < s->numedges; i++) {"},{"Add":" e = dsurfedges[s->firstedge + i];"},{"Add":""},{"Add":" if (e >= 0)"},{"Add":" v = dvertexes + dedges[e].v[0];"},{"Add":" else"},{"Add":" v = dvertexes + dedges[-e].v[1];"},{"Add":""},{"Add":" //\t\tVectorAdd (v->point, l->modelorg, vt);"},{"Add":" VectorCopy(v->point, vt);"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" val = DotProduct(vt, tex->vecs[j]) + tex->vecs[j][3];"},{"Add":" if (val < mins[j])"},{"Add":" mins[j] = val;"},{"Add":" if (val > maxs[j])"},{"Add":" maxs[j] = val;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" l->exactmins[i] = mins[i];"},{"Add":" l->exactmaxs[i] = maxs[i];"},{"Add":""},{"Add":" mins[i] = floor(mins[i] / step);"},{"Add":" maxs[i] = ceil(maxs[i] / step);"},{"Add":""},{"Add":" l->texmins[i] = mins[i];"},{"Add":" l->texsize[i] = maxs[i] - mins[i];"},{"Add":" }"},{"Add":""},{"Add":" if (l->texsize[0] * l->texsize[1] > map / 4) // div 4 for extrasamples"},{"Add":" {"},{"Add":" char s[3] = {'X', 'Y', 'Z'};"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" printf(\"Axis: %c\\n\", s[i]);"},{"Add":""},{"Add":" l->exactmins[i] = mins[i];"},{"Add":" l->exactmaxs[i] = maxs[i];"},{"Add":""},{"Add":" mins[i] = floor(mins[i] / step);"},{"Add":" maxs[i] = ceil(maxs[i] / step);"},{"Add":""},{"Add":" l->texmins[i] = mins[i];"},{"Add":" l->texsize[i] = maxs[i] - mins[i];"},{"Add":""},{"Add":" printf(\" Mins = %10.3f, Maxs = %10.3f, Size = %10.3f\\n\", (double)mins[i], (double)maxs[i], (double)(maxs[i] - mins[i]));"},{"Add":" }"},{"Add":""},{"Add":" Error(\"Surface too large to map\");"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CalcFaceVectors"},{"Add":""},{"Add":"Fills in texorg, worldtotex. and textoworld"},{"Add":"================"},{"Add":"*/"},{"Add":"void CalcFaceVectors(lightinfo_t *l) {"},{"Add":" texinfo_t *tex;"},{"Add":" int32_t i, j;"},{"Add":" vec3_t texnormal;"},{"Add":" vec_t distscale;"},{"Add":" vec_t dist, len;"},{"Add":" int32_t w, h;"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" tex = &texinfo[l->faceX->texinfo];"},{"Add":" else"},{"Add":" tex = &texinfo[l->face->texinfo];"},{"Add":""},{"Add":" // convert from float to double"},{"Add":" for (i = 0; i < 2; i++)"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" l->worldtotex[i][j] = tex->vecs[i][j];"},{"Add":""},{"Add":" // calculate a normal to the texture axis. points can be moved along this"},{"Add":" // without changing their S/T"},{"Add":" texnormal[0] = tex->vecs[1][1] * tex->vecs[0][2] - tex->vecs[1][2] * tex->vecs[0][1];"},{"Add":" texnormal[1] = tex->vecs[1][2] * tex->vecs[0][0] - tex->vecs[1][0] * tex->vecs[0][2];"},{"Add":" texnormal[2] = tex->vecs[1][0] * tex->vecs[0][1] - tex->vecs[1][1] * tex->vecs[0][0];"},{"Add":" VectorNormalize(texnormal, texnormal);"},{"Add":""},{"Add":" // flip it towards plane normal"},{"Add":" distscale = DotProduct(texnormal, l->facenormal);"},{"Add":" if (!distscale) {"},{"Add":" qprintf(\"WARNING: Texture axis perpendicular to face\\n\");"},{"Add":" distscale = 1;"},{"Add":" }"},{"Add":" if (distscale < 0) {"},{"Add":" distscale = -distscale;"},{"Add":" VectorSubtract(vec3_origin, texnormal, texnormal);"},{"Add":" }"},{"Add":""},{"Add":" // distscale is the ratio of the distance along the texture normal to"},{"Add":" // the distance along the plane normal"},{"Add":" distscale = 1 / distscale;"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" len = VectorLength(l->worldtotex[i]);"},{"Add":" dist = DotProduct(l->worldtotex[i], l->facenormal);"},{"Add":" dist *= distscale;"},{"Add":" VectorMA(l->worldtotex[i], -dist, texnormal, l->textoworld[i]);"},{"Add":" VectorScale(l->textoworld[i], (1 / len) * (1 / len), l->textoworld[i]);"},{"Add":" }"},{"Add":""},{"Add":" // calculate texorg on the texture plane"},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" l->texorg[i] = -tex->vecs[0][3] * l->textoworld[0][i] - tex->vecs[1][3] * l->textoworld[1][i];"},{"Add":""},{"Add":" // project back to the face plane"},{"Add":" dist = DotProduct(l->texorg, l->facenormal) - l->facedist - 1;"},{"Add":" dist *= distscale;"},{"Add":" VectorMA(l->texorg, -dist, texnormal, l->texorg);"},{"Add":""},{"Add":" // compensate for org'd bmodels"},{"Add":" VectorAdd(l->texorg, l->modelorg, l->texorg);"},{"Add":""},{"Add":" // total sample count"},{"Add":" h = l->texsize[1] + 1;"},{"Add":" w = l->texsize[0] + 1;"},{"Add":" l->numsurfpt = w * h;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"CalcPoints"},{"Add":""},{"Add":"For each texture aligned grid point, back project onto the plane"},{"Add":"to get the world xyz value of the sample point"},{"Add":"================="},{"Add":"*/"},{"Add":"void CalcPoints(lightinfo_t *l, float sofs, float tofs) {"},{"Add":" int32_t i;"},{"Add":" int32_t s, t, j;"},{"Add":" int32_t w, h;"},{"Add":" vec_t starts, startt, us, ut;"},{"Add":" vec_t *surf;"},{"Add":" vec_t mids, midt;"},{"Add":" vec3_t facemid;"},{"Add":""},{"Add":" surf = l->surfpt[0];"},{"Add":" mids = (l->exactmaxs[0] + l->exactmins[0]) / 2;"},{"Add":" midt = (l->exactmaxs[1] + l->exactmins[1]) / 2;"},{"Add":""},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" facemid[j] = l->texorg[j] + l->textoworld[0][j] * mids + l->textoworld[1][j] * midt;"},{"Add":""},{"Add":" h = l->texsize[1] + 1;"},{"Add":" w = l->texsize[0] + 1;"},{"Add":" l->numsurfpt = w * h;"},{"Add":""},{"Add":" starts = l->texmins[0] * step;"},{"Add":" startt = l->texmins[1] * step;"},{"Add":""},{"Add":" for (t = 0; t < h; t++) {"},{"Add":" for (s = 0; s < w; s++, surf += 3) {"},{"Add":" us = starts + (s + sofs) * step;"},{"Add":" ut = startt + (t + tofs) * step;"},{"Add":""},{"Add":" // if a line can be traced from surf to facemid, the point is good"},{"Add":" for (i = 0; i < 6; i++) {"},{"Add":" // calculate texture point"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" surf[j] = l->texorg[j] + l->textoworld[0][j] * us + l->textoworld[1][j] * ut;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dleaf_tx *leaf;"},{"Add":" leaf = RadPointInLeafX(surf);"},{"Add":" if (leaf->contents != CONTENTS_SOLID) {"},{"Add":" if (!TestLine_r(0, facemid, surf))"},{"Add":" break; // got it"},{"Add":" }"},{"Add":" } else {"},{"Add":" dleaf_t *leaf;"},{"Add":" leaf = RadPointInLeaf(surf);"},{"Add":" if (leaf->contents != CONTENTS_SOLID) {"},{"Add":" if (!TestLine_r(0, facemid, surf))"},{"Add":" break; // got it"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // nudge it"},{"Add":" if (i & 1) {"},{"Add":" if (us > mids) {"},{"Add":" us -= 8;"},{"Add":" if (us < mids)"},{"Add":" us = mids;"},{"Add":" } else {"},{"Add":" us += 8;"},{"Add":" if (us > mids)"},{"Add":" us = mids;"},{"Add":" }"},{"Add":" } else {"},{"Add":" if (ut > midt) {"},{"Add":" ut -= 8;"},{"Add":" if (ut < midt)"},{"Add":" ut = midt;"},{"Add":" } else {"},{"Add":" ut += 8;"},{"Add":" if (ut > midt)"},{"Add":" ut = midt;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//=============================================================="},{"Add":""},{"Add":"#define MAX_STYLES 32"},{"Add":"typedef struct"},{"Add":"{"},{"Add":" int32_t numsamples;"},{"Add":" float *origins;"},{"Add":" int32_t numstyles;"},{"Add":" int32_t stylenums[MAX_STYLES];"},{"Add":" struct SH1 *samples[MAX_STYLES];"},{"Add":"} facelight_t;"},{"Add":""},{"Add":"directlight_t *directlights[MAX_MAP_LEAFS_QBSP];"},{"Add":"facelight_t facelight[MAX_MAP_FACES_QBSP];"},{"Add":"int32_t numdlights;"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"FindTargetEntity"},{"Add":"=================="},{"Add":"*/"},{"Add":"entity_t *FindTargetEntity(char *target) {"},{"Add":" int32_t i;"},{"Add":" char *n;"},{"Add":""},{"Add":" for (i = 0; i < num_entities; i++) {"},{"Add":" n = ValueForKey(&entities[i], \"targetname\");"},{"Add":" if (!strcmp(n, target))"},{"Add":" return &entities[i];"},{"Add":" }"},{"Add":""},{"Add":" return NULL;"},{"Add":"}"},{"Add":""},{"Add":"//#define\tDIRECT_LIGHT\t3000"},{"Add":"#define DIRECT_LIGHT 3"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"CreateDirectLights"},{"Add":"============="},{"Add":"*/"},{"Add":"void CreateDirectLights(void) {"},{"Add":" int32_t i;"},{"Add":" patch_t *p;"},{"Add":" directlight_t *dl;"},{"Add":" dleaf_t *leaf;"},{"Add":" dleaf_tx *leafX;"},{"Add":" int32_t cluster;"},{"Add":" entity_t *e, *e2;"},{"Add":" char *name;"},{"Add":" char *target;"},{"Add":" float angle;"},{"Add":" vec3_t dest;"},{"Add":" char *_color;"},{"Add":" float intensity;"},{"Add":" char *sun_target = NULL;"},{"Add":" char *proc_num;"},{"Add":""},{"Add":" //"},{"Add":" // entities"},{"Add":" //"},{"Add":" for (i = 0; i < num_entities; i++) {"},{"Add":" e = &entities[i];"},{"Add":" name = ValueForKey(e, \"classname\");"},{"Add":" if (strncmp(name, \"light\", 5)) {"},{"Add":" if (!strncmp(name, \"worldspawn\", 10)) {"},{"Add":" sun_target = ValueForKey(e, \"_sun\");"},{"Add":" if (strlen(sun_target) > 0) {"},{"Add":" printf(\"Sun activated.\\n\");"},{"Add":" printf(\"Sky radiosity (sunradscale): %f \\n\", sunradscale);"},{"Add":" sun = true;"},{"Add":" }"},{"Add":""},{"Add":" proc_num = ValueForKey(e, \"_sun_ambient\");"},{"Add":" if (strlen(proc_num) > 0) {"},{"Add":" sun_ambient = atof(proc_num);"},{"Add":" }"},{"Add":""},{"Add":" proc_num = ValueForKey(e, \"_sun_light\");"},{"Add":" if (strlen(proc_num) > 0) {"},{"Add":" sun_main = atof(proc_num);"},{"Add":" }"},{"Add":""},{"Add":" proc_num = ValueForKey(e, \"_sun_color\");"},{"Add":" if (strlen(proc_num) > 0) {"},{"Add":" GetVectorForKey(e, \"_sun_color\", sun_color);"},{"Add":""},{"Add":" sun_alt_color = true;"},{"Add":" ColorNormalize(sun_color, sun_color);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" target = ValueForKey(e, \"target\");"},{"Add":""},{"Add":" if (strlen(target) >= 1 && sun_target && !strcmp(target, sun_target)) // qb: add sun_target check"},{"Add":" {"},{"Add":" vec3_t sun_s, sun_t;"},{"Add":" printf(\"Sun target found.\\n\");"},{"Add":" GetVectorForKey(e, \"origin\", sun_s);"},{"Add":""},{"Add":" e2 = FindTargetEntity(target);"},{"Add":""},{"Add":" if (!e2) {"},{"Add":" printf(\"WARNING: sun missing target, 0,0,0 used\\n\");"},{"Add":""},{"Add":" sun_t[0] = 0;"},{"Add":" sun_t[1] = 0;"},{"Add":" sun_t[2] = 0;"},{"Add":" } else {"},{"Add":" GetVectorForKey(e2, \"origin\", sun_t);"},{"Add":" }"},{"Add":""},{"Add":" VectorSubtract(sun_s, sun_t, sun_pos);"},{"Add":" VectorNormalize(sun_pos, sun_pos);"},{"Add":" printf(\"SUN VECTOR: %f, %f, %f\\n\", sun_pos[0], sun_pos[1], sun_pos[2]);"},{"Add":""},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" numdlights++;"},{"Add":" dl = malloc(sizeof(directlight_t));"},{"Add":" memset(dl, 0, sizeof(*dl));"},{"Add":""},{"Add":" GetVectorForKey(e, \"origin\", dl->origin);"},{"Add":" dl->style = FloatForKey(e, \"_style\");"},{"Add":" if (!dl->style)"},{"Add":" dl->style = FloatForKey(e, \"style\");"},{"Add":" if (dl->style < 0 || dl->style >= MAX_LSTYLES)"},{"Add":" dl->style = 0;"},{"Add":""},{"Add":" dl->nodenum = PointInNodenum(dl->origin);"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" leafX = RadPointInLeafX(dl->origin);"},{"Add":" cluster = leafX->cluster;"},{"Add":" } else {"},{"Add":" leaf = RadPointInLeaf(dl->origin);"},{"Add":" cluster = leaf->cluster;"},{"Add":" }"},{"Add":""},{"Add":" dl->next = directlights[cluster];"},{"Add":" directlights[cluster] = dl;"},{"Add":""},{"Add":" proc_num = ValueForKey(e, \"_wait\");"},{"Add":" if (strlen(proc_num) > 0)"},{"Add":" dl->wait = atof(proc_num);"},{"Add":" else {"},{"Add":" proc_num = ValueForKey(e, \"wait\");"},{"Add":""},{"Add":" if (strlen(proc_num) > 0)"},{"Add":" dl->wait = atof(proc_num);"},{"Add":" else"},{"Add":" dl->wait = 1.0f;"},{"Add":" }"},{"Add":""},{"Add":" if (dl->wait <= EQUAL_EPSILON)"},{"Add":" dl->wait = 1.0f;"},{"Add":""},{"Add":" proc_num = ValueForKey(e, \"_angwait\");"},{"Add":" if (strlen(proc_num) > 0)"},{"Add":" dl->adjangle = atof(proc_num);"},{"Add":" else"},{"Add":" dl->adjangle = 1.0f;"},{"Add":""},{"Add":" // [slipyx] add _falloff"},{"Add":" dl->falloff = atoi(ValueForKey(e, \"_falloff\"));"},{"Add":" if (dl->falloff < 0)"},{"Add":" dl->falloff = 0;"},{"Add":""},{"Add":" intensity = FloatForKey(e, \"light\");"},{"Add":" if (!intensity)"},{"Add":" intensity = FloatForKey(e, \"_light\");"},{"Add":" if (!intensity)"},{"Add":" intensity = 300;"},{"Add":""},{"Add":" _color = ValueForKey(e, \"_color\");"},{"Add":" if (_color && _color[0]) {"},{"Add":" sscanf(_color, \"%f %f %f\", &dl->color.f[0], &dl->color.f[4], &dl->color.f[8]);"},{"Add":" dl->color = SH1_Normalize(dl->color, NULL);"},{"Add":" } else"},{"Add":" dl->color.f[0] = dl->color.f[4] = dl->color.f[8] = 1.0;"},{"Add":""},{"Add":" dl->intensity = intensity * entity_scale;"},{"Add":" dl->type = emit_point;"},{"Add":""},{"Add":" target = ValueForKey(e, \"target\");"},{"Add":""},{"Add":" if (!strcmp(name, \"light_spot\") || target[0]) {"},{"Add":" dl->type = emit_spotlight;"},{"Add":" dl->spotlight.dot = FloatForKey(e, \"_cone\");"},{"Add":" if (!dl->spotlight.dot)"},{"Add":" dl->spotlight.dot = 20; // qb: doubled for new calc"},{"Add":" dl->spotlight.dot = cos(dl->spotlight.dot / 90 * 3.14159); // qb: doubled for new calc"},{"Add":" if (target[0]) {"},{"Add":" // point towards target"},{"Add":" e2 = FindTargetEntity(target);"},{"Add":" if (!e2)"},{"Add":" printf(\"WARNING: light at (%i %i %i) has missing target\\n\","},{"Add":" (int32_t)dl->origin[0], (int32_t)dl->origin[1], (int32_t)dl->origin[2]);"},{"Add":" else {"},{"Add":" GetVectorForKey(e2, \"origin\", dest);"},{"Add":" VectorSubtract(dest, dl->origin, dl->spotlight.normal);"},{"Add":" VectorNormalize(dl->spotlight.normal, dl->spotlight.normal);"},{"Add":" }"},{"Add":" } else {"},{"Add":" // point down angle"},{"Add":" angle = FloatForKey(e, \"angle\");"},{"Add":" if (angle == ANGLE_UP) {"},{"Add":" dl->spotlight.normal[0] = dl->spotlight.normal[1] = 0;"},{"Add":" dl->spotlight.normal[2] = 1;"},{"Add":" } else if (angle == ANGLE_DOWN) {"},{"Add":" dl->spotlight.normal[0] = dl->spotlight.normal[1] = 0;"},{"Add":" dl->spotlight.normal[2] = -1;"},{"Add":" } else {"},{"Add":" dl->spotlight.normal[2] = 0;"},{"Add":" dl->spotlight.normal[0] = cos(angle / 180 * 3.14159);"},{"Add":" dl->spotlight.normal[1] = sin(angle / 180 * 3.14159);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // surfaces"},{"Add":" //"},{"Add":""},{"Add":" for (i = 0, p = patches; i < num_patches; i++, p++) {"},{"Add":" if ((!sun || !p->sky) && p->totallight.f[0] < DIRECT_LIGHT && p->totallight.f[4] < DIRECT_LIGHT && p->totallight.f[8] < DIRECT_LIGHT)"},{"Add":" continue;"},{"Add":""},{"Add":" numdlights++;"},{"Add":" dl = malloc(sizeof(directlight_t));"},{"Add":" memset(dl, 0, sizeof(*dl));"},{"Add":""},{"Add":" VectorCopy(p->origin, dl->origin);"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" leafX = RadPointInLeafX(dl->origin);"},{"Add":" cluster = leafX->cluster;"},{"Add":" dl->leafX = leafX;"},{"Add":" } else {"},{"Add":" leaf = RadPointInLeaf(dl->origin);"},{"Add":" cluster = leaf->cluster;"},{"Add":" dl->leaf = leaf;"},{"Add":" }"},{"Add":" dl->next = directlights[cluster];"},{"Add":" directlights[cluster] = dl;"},{"Add":""},{"Add":" if (sun && p->sky) {"},{"Add":" dl->plane = p->plane;"},{"Add":" dl->type = emit_sky;"},{"Add":" // qb: for sky radiosity, was dl->intensity = 1.0f;"},{"Add":" dl->color = SH1_Normalize(p->totallight, &dl->intensity);"},{"Add":" dl->intensity *= p->area * direct_scale;"},{"Add":" VectorCopy(p->plane->normal, dl->sky.normal);"},{"Add":" } else {"},{"Add":" dl->type = emit_surface;"},{"Add":" dl->color = SH1_Normalize(p->totallight, &dl->intensity);"},{"Add":" dl->intensity *= p->area * direct_scale;"},{"Add":" VectorCopy(p->plane->normal, dl->surface.normal);"},{"Add":" dl->surface.winding = p->winding;"},{"Add":" }"},{"Add":""},{"Add":" p->totallight = SH1_Clear();"},{"Add":" }"},{"Add":""},{"Add":" printf(\"%i direct lights\\n\", numdlights);"},{"Add":"}"},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":"static inline int32_t lowestCommonNode(int32_t nodeNum1, int32_t nodeNum2)"},{"Add":"#else"},{"Add":"static inline int32_t lowestCommonNode(int32_t nodeNum1, int32_t nodeNum2)"},{"Add":"#endif"},{"Add":"{"},{"Add":" int32_t child1, tmp, headNode = 0;"},{"Add":""},{"Add":" if (nodeNum1 > nodeNum2) {"},{"Add":" tmp = nodeNum1;"},{"Add":" nodeNum1 = nodeNum2;"},{"Add":" nodeNum2 = tmp;"},{"Add":" }"},{"Add":""},{"Add":"re_test:"},{"Add":" // headNode is guaranteed to be <= nodeNum1 and nodeNum1 is < nodeNum2"},{"Add":" if (headNode == nodeNum1)"},{"Add":" return headNode;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" child1 = (node = dnodesX + headNode)->children[1];"},{"Add":""},{"Add":" if (nodeNum2 < child1)"},{"Add":" // Both nodeNum1 and nodeNum2 are less than child1."},{"Add":" // In this case, child0 is always a node, not a leaf, so we don't need"},{"Add":" // to check to make sure."},{"Add":" headNode = node->children[0];"},{"Add":" else if (nodeNum1 < child1)"},{"Add":" // Child1 sits between nodeNum1 and nodeNum2."},{"Add":" // This means that headNode is the lowest node which contains both"},{"Add":" // nodeNum1 and nodeNum2."},{"Add":" return headNode;"},{"Add":" else if (child1 > 0)"},{"Add":" // Both nodeNum1 and nodeNum2 are greater than child1."},{"Add":" // If child1 is a node, that means it contains both nodeNum1 and"},{"Add":" // nodeNum2."},{"Add":" headNode = child1;"},{"Add":" else"},{"Add":" // Child1 is a leaf, therefore by process of elimination child0 must be"},{"Add":" // a node and must contain boste nodeNum1 and nodeNum2."},{"Add":" headNode = node->children[0];"},{"Add":" // goto instead of while(1) because it makes the CPU branch predict easier"},{"Add":""},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" child1 = (node = dnodes + headNode)->children[1];"},{"Add":""},{"Add":" if (nodeNum2 < child1)"},{"Add":" headNode = node->children[0];"},{"Add":" else if (nodeNum1 < child1)"},{"Add":" return headNode;"},{"Add":" else if (child1 > 0)"},{"Add":" headNode = child1;"},{"Add":" else"},{"Add":" headNode = node->children[0];"},{"Add":" }"},{"Add":""},{"Add":" goto re_test;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"LightContributionToPoint"},{"Add":"============="},{"Add":"*/"},{"Add":"static struct SH1 LightContributionToPoint(directlight_t *l, vec3_t pos, int32_t nodenum,"},{"Add":" vec3_t normal, // vec3_t color,"},{"Add":" float lightscale2, qboolean *sun_main_once, qboolean *sun_ambient_once) {"},{"Add":" struct SH1 result = SH1_Clear();"},{"Add":""},{"Add":" // check for simple occlusion"},{"Add":" int32_t common_node = lowestCommonNode(nodenum, l->nodenum);"},{"Add":" if(!noblock && TestLine_r(common_node, pos, l->origin))"},{"Add":" return result;"},{"Add":""},{"Add":" float total_scale = lightscale2 * 0.25;"},{"Add":" vec3_t direction, color;"},{"Add":" float distance, source_dot, scale;"},{"Add":""},{"Add":" VectorSubtract(l->origin, pos, direction);"},{"Add":" if(DotProduct(direction, normal) <= EQUAL_EPSILON) {"},{"Add":" if(l->type == emit_sky)"},{"Add":" goto do_sky;"},{"Add":" return result;"},{"Add":" }"},{"Add":""},{"Add":" switch(l->type) {"},{"Add":" case emit_surface:"},{"Add":" case emit_sky: {"},{"Add":" int hits = 0;"},{"Add":" for(int j = 0; j < l->surface.winding->numpoints; j++) {"},{"Add":" VectorSubtract(l->surface.winding->p[j], pos, direction);"},{"Add":" distance = VectorNormalize(direction, direction);"},{"Add":" source_dot = -DotProduct(direction, l->surface.normal);"},{"Add":" if(source_dot <= 0)"},{"Add":" continue;"},{"Add":" scale = l->intensity / (distance * distance);"},{"Add":" SH1_Sample(SH1_Scale(l->color, scale), direction, color);"},{"Add":" result = SH1_Add(result, SH1_FromDirectionalLight(direction, color));"},{"Add":" hits++;"},{"Add":" }"},{"Add":" if(hits == 0)"},{"Add":" return result;"},{"Add":" result = SH1_Scale(result, 1.0f / (float)hits);"},{"Add":" if(l->type == emit_sky) {"},{"Add":" result = SH1_Scale(result, total_scale);"},{"Add":" goto do_sky;"},{"Add":" }"},{"Add":" break;"},{"Add":" }"},{"Add":" case emit_point: {"},{"Add":" distance = VectorNormalize(direction, direction);"},{"Add":" scale = l->falloff == 0 ? (l->intensity - l->wait * distance)"},{"Add":" : l->falloff == 1 ? (l->intensity / distance)"},{"Add":" : (l->intensity / (distance * distance))"},{"Add":" ;"},{"Add":" if(scale < 0)"},{"Add":" return result;"},{"Add":" SH1_Sample(SH1_Scale(l->color, scale), direction, color);"},{"Add":" result = SH1_FromDirectionalLight(direction, color);"},{"Add":" break;"},{"Add":" }"},{"Add":" case emit_spotlight: {"},{"Add":" distance = VectorNormalize(direction, direction);"},{"Add":" source_dot = -DotProduct(direction, l->spotlight.normal);"},{"Add":" if(source_dot <= l->spotlight.dot)"},{"Add":" return result;"},{"Add":" scale = (l->intensity - l->wait * distance) * powf(source_dot, 25) * 15;"},{"Add":" SH1_Sample(SH1_Scale(l->color, scale), direction, color);"},{"Add":" result = SH1_FromDirectionalLight(direction, color);"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" return SH1_Scale(result, total_scale);"},{"Add":"do_sky:"},{"Add":" if(!*sun_ambient_once) {"},{"Add":" // TODO"},{"Add":" }"},{"Add":" if(!*sun_main_once) {"},{"Add":" // TODO"},{"Add":" }"},{"Add":" return result;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"GatherSampleLight"},{"Add":""},{"Add":"Lightscale2 is the normalizer for multisampling, -extra cmd line arg"},{"Add":"============="},{"Add":"*/"},{"Add":"void GatherSampleLight(vec3_t pos, vec3_t normal, struct SH1 **styletable, int32_t offset, int32_t mapsize,"},{"Add":" float lightscale2, qboolean *sun_main_once, qboolean *sun_ambient_once, byte *pvs) {"},{"Add":" int32_t i;"},{"Add":" directlight_t *l;"},{"Add":" int32_t nodenum;"},{"Add":" struct SH1 colors[MAX_LSTYLES];"},{"Add":""},{"Add":" memset(colors, 0, sizeof(colors));"},{"Add":""},{"Add":" // get the PVS for the pos to limit the number of checks"},{"Add":" if(!PvsForOrigin(pos, pvs)) {"},{"Add":" return;"},{"Add":" }"},{"Add":" nodenum = PointInNodenum(pos);"},{"Add":""},{"Add":" for(i = 0; i < dvis->numclusters; i++) {"},{"Add":" if(!(pvs[i >> 3] & (1 << (i & 7))))"},{"Add":" continue;"},{"Add":""},{"Add":" for(l = directlights[i]; l; l = l->next) {"},{"Add":" struct SH1 sh1 ="},{"Add":" LightContributionToPoint(l, pos, nodenum, normal, /* color, */ lightscale2, sun_main_once, sun_ambient_once);"},{"Add":" colors[l->style] = SH1_Add(colors[l->style], sh1);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for(i = 0; i < MAX_LSTYLES; i++) {"},{"Add":" // no contribution"},{"Add":" if(fabs(colors[i].f[0]) <= EQUAL_EPSILON && fabs(colors[i].f[4]) <= EQUAL_EPSILON && fabs(colors[i].f[8]) <= EQUAL_EPSILON)"},{"Add":" continue;"},{"Add":""},{"Add":" // if this style doesn't have a table yet, allocate one"},{"Add":" if(!styletable[i]) {"},{"Add":" styletable[i] = malloc(mapsize);"},{"Add":" memset(styletable[i], 0, mapsize);"},{"Add":" }"},{"Add":""},{"Add":" styletable[i][offset] = SH1_Add(styletable[i][offset], colors[i]);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":""},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"AddSampleToPatch"},{"Add":""},{"Add":"Take the sample's collected light and"},{"Add":"add it back into the apropriate patch"},{"Add":"for the radiosity pass."},{"Add":""},{"Add":"The sample is added to all patches that might include"},{"Add":"any part of it. They are counted and averaged, so it"},{"Add":"doesn't generate extra light."},{"Add":"============="},{"Add":"*/"},{"Add":""},{"Add":"void AddSampleToPatch(vec3_t pos, struct SH1 sh1, int32_t facenum) {"},{"Add":" patch_t *patch;"},{"Add":" vec3_t mins, maxs;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" if (numbounce == 0)"},{"Add":" return;"},{"Add":""},{"Add":" for (patch = face_patches[facenum]; patch; patch = patch->next) {"},{"Add":" // see if the point is in this patch (roughly)"},{"Add":" WindingBounds(patch->winding, mins, maxs);"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (mins[i] > pos[i] + step)"},{"Add":" goto nextpatch;"},{"Add":" if (maxs[i] < pos[i] - step)"},{"Add":" goto nextpatch;"},{"Add":" }"},{"Add":""},{"Add":" // add the sample to the patch"},{"Add":" patch->samples++;"},{"Add":" patch->samplelight = SH1_Add(patch->samplelight, sh1);"},{"Add":" nextpatch:;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"// qb: phong from vluzacn VHLT"},{"Add":"// ====================================================================================="},{"Add":"// GetPhongNormal"},{"Add":"// ====================================================================================="},{"Add":"void GetPhongNormal(int32_t facenum, vec3_t spot, vec3_t phongnormal) {"},{"Add":" int32_t j, ne;"},{"Add":" int32_t s; // split every edge into two parts"},{"Add":" vec3_t facenormal;"},{"Add":""},{"Add":" // Calculate modified point normal for surface"},{"Add":" // Use the edge normals if they are defined. Bend the surface towards the edge normal(s)"},{"Add":" // Crude first attempt: find nearest edge normal and do a simple interpolation with facenormal."},{"Add":" // Second attempt: find edge points+center that bound the point and do a three-point triangulation(baricentric)"},{"Add":" // Better third attempt: generate the point normals for all vertices and do baricentric triangulation."},{"Add":""},{"Add":" const dface_tx *fx = dfacesX + facenum;"},{"Add":" const dface_t *fi = dfaces + facenum;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" const dplane_t *p = getPlaneFromFaceX(fx);"},{"Add":" ne = fx->numedges;"},{"Add":" VectorCopy(p->normal, facenormal);"},{"Add":" } else {"},{"Add":" const dplane_t *p = getPlaneFromFace(fi);"},{"Add":" ne = fi->numedges;"},{"Add":" VectorCopy(p->normal, facenormal);"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(facenormal, phongnormal);"},{"Add":""},{"Add":" for (j = 0; j < ne; j++) {"},{"Add":" vec3_t p1;"},{"Add":" vec3_t p2;"},{"Add":" vec3_t v1;"},{"Add":" vec3_t v2;"},{"Add":" vec3_t vspot;"},{"Add":" unsigned prev_edge;"},{"Add":" unsigned next_edge;"},{"Add":" int32_t e;"},{"Add":" int32_t e1;"},{"Add":" int32_t e2;"},{"Add":" edgeshare_t *es;"},{"Add":" edgeshare_t *es1;"},{"Add":" edgeshare_t *es2;"},{"Add":" float a1;"},{"Add":" float a2;"},{"Add":" float aa;"},{"Add":" float bb;"},{"Add":" float ab;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (j) {"},{"Add":" prev_edge = fx->firstedge + ((j + fx->numedges - 1) % fx->numedges);"},{"Add":" } else {"},{"Add":" prev_edge = fx->firstedge + fx->numedges - 1;"},{"Add":" }"},{"Add":""},{"Add":" if ((j + 1) != fx->numedges) {"},{"Add":" next_edge = fx->firstedge + ((j + 1) % fx->numedges);"},{"Add":" } else {"},{"Add":" next_edge = fx->firstedge;"},{"Add":" }"},{"Add":""},{"Add":" e = dsurfedges[fx->firstedge + j];"},{"Add":" e1 = dsurfedges[prev_edge];"},{"Add":" e2 = dsurfedges[next_edge];"},{"Add":""},{"Add":" es = &edgeshare[abs(e)];"},{"Add":" es1 = &edgeshare[abs(e1)];"},{"Add":" es2 = &edgeshare[abs(e2)];"},{"Add":""},{"Add":" if ((!es->smooth || es->coplanar) && (!es1->smooth || es1->coplanar) && (!es2->smooth || es2->coplanar)) {"},{"Add":" continue;"},{"Add":" }"},{"Add":" if (e > 0) {"},{"Add":" VectorCopy(dvertexes[dedgesX[e].v[0]].point, p1);"},{"Add":" VectorCopy(dvertexes[dedgesX[e].v[1]].point, p2);"},{"Add":" } else {"},{"Add":" VectorCopy(dvertexes[dedgesX[-e].v[1]].point, p1);"},{"Add":" VectorCopy(dvertexes[dedgesX[-e].v[0]].point, p2);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" else {"},{"Add":" if (j) {"},{"Add":" prev_edge = fi->firstedge + ((j + fi->numedges - 1) % fi->numedges);"},{"Add":" } else {"},{"Add":" prev_edge = fi->firstedge + fi->numedges - 1;"},{"Add":" }"},{"Add":""},{"Add":" if ((j + 1) != fi->numedges) {"},{"Add":" next_edge = fi->firstedge + ((j + 1) % fi->numedges);"},{"Add":" } else {"},{"Add":" next_edge = fi->firstedge;"},{"Add":" }"},{"Add":""},{"Add":" e = dsurfedges[fi->firstedge + j];"},{"Add":" e1 = dsurfedges[prev_edge];"},{"Add":" e2 = dsurfedges[next_edge];"},{"Add":""},{"Add":" es = &edgeshare[abs(e)];"},{"Add":" es1 = &edgeshare[abs(e1)];"},{"Add":" es2 = &edgeshare[abs(e2)];"},{"Add":""},{"Add":" if ((!es->smooth || es->coplanar) && (!es1->smooth || es1->coplanar) && (!es2->smooth || es2->coplanar)) {"},{"Add":" continue;"},{"Add":" }"},{"Add":" if (e > 0) {"},{"Add":" VectorCopy(dvertexes[dedges[e].v[0]].point, p1);"},{"Add":" VectorCopy(dvertexes[dedges[e].v[1]].point, p2);"},{"Add":" } else {"},{"Add":" VectorCopy(dvertexes[dedges[-e].v[1]].point, p1);"},{"Add":" VectorCopy(dvertexes[dedges[-e].v[0]].point, p2);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // Adjust for origin-based models"},{"Add":" VectorAdd(p1, face_offset[facenum], p1);"},{"Add":" VectorAdd(p2, face_offset[facenum], p2);"},{"Add":""},{"Add":" for (s = 0; s < 2; s++) {"},{"Add":" vec3_t s1, s2;"},{"Add":" if (s == 0) {"},{"Add":" VectorCopy(p1, s1);"},{"Add":" } else {"},{"Add":" VectorCopy(p2, s1);"},{"Add":" }"},{"Add":""},{"Add":" VectorAdd(p1, p2, s2); // edge center"},{"Add":" VectorScale(s2, 0.5, s2);"},{"Add":""},{"Add":" VectorSubtract(s1, face_extents[facenum].center, v1);"},{"Add":" VectorSubtract(s2, face_extents[facenum].center, v2);"},{"Add":" VectorSubtract(spot, face_extents[facenum].center, vspot);"},{"Add":""},{"Add":" aa = DotProduct(v1, v1);"},{"Add":" bb = DotProduct(v2, v2);"},{"Add":" ab = DotProduct(v1, v2);"},{"Add":" a1 = (bb * DotProduct(v1, vspot) - ab * DotProduct(vspot, v2)) / (aa * bb - ab * ab);"},{"Add":" a2 = (DotProduct(vspot, v2) - a1 * ab) / bb;"},{"Add":""},{"Add":" // Test center to sample vector for inclusion between center to vertex vectors (Use dot product of vectors)"},{"Add":" if (a1 >= -0.01 && a2 >= -0.01) {"},{"Add":" // calculate distance from edge to pos"},{"Add":" vec3_t n1, n2;"},{"Add":" vec3_t temp;"},{"Add":""},{"Add":" if (es->smooth)"},{"Add":" if (s == 0) {"},{"Add":" VectorCopy(es->vertex_normal[e > 0 ? 0 : 1], n1);"},{"Add":" } else {"},{"Add":" VectorCopy(es->vertex_normal[e > 0 ? 1 : 0], n1);"},{"Add":" }"},{"Add":" else if (s == 0 && es1->smooth) {"},{"Add":" VectorCopy(es1->vertex_normal[e1 > 0 ? 1 : 0], n1);"},{"Add":" } else if (s == 1 && es2->smooth) {"},{"Add":" VectorCopy(es2->vertex_normal[e2 > 0 ? 0 : 1], n1);"},{"Add":" } else {"},{"Add":" VectorCopy(facenormal, n1);"},{"Add":" }"},{"Add":""},{"Add":" if (es->smooth) {"},{"Add":" VectorCopy(es->interface_normal, n2);"},{"Add":" } else {"},{"Add":" VectorCopy(facenormal, n2);"},{"Add":" }"},{"Add":""},{"Add":" // Interpolate between the center and edge normals based on sample position"},{"Add":" // VectorScale(facenormal, 1.0 - a1 - a2, phongnormal);"},{"Add":" VectorScale(facenormal, fabs((1.0 - a1) - a2), phongnormal); // qb: eureka... need that fabs()!"},{"Add":" VectorScale(n1, a1, temp);"},{"Add":" VectorAdd(phongnormal, temp, phongnormal);"},{"Add":" VectorScale(n2, a2, temp);"},{"Add":" VectorAdd(phongnormal, temp, phongnormal);"},{"Add":" VectorNormalize(phongnormal, phongnormal);"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/**"},{"Add":" * @brief Move the incoming sample position towards the surface center and along the"},{"Add":" * surface normal to reduce false-positive traces. Test the PVS at the new"},{"Add":" * position, returning true if the new point is valid, false otherwise."},{"Add":" */"},{"Add":"static qboolean NudgeSamplePosition(const vec3_t in, const vec3_t normal, const vec3_t center,"},{"Add":" vec3_t out, byte *pvs) {"},{"Add":" vec3_t dir;"},{"Add":""},{"Add":" VectorCopy(in, out);"},{"Add":""},{"Add":" // move into the level using the normal and surface center"},{"Add":" VectorSubtract(out, center, dir);"},{"Add":" VectorNormalize(dir, dir);"},{"Add":""},{"Add":" VectorMA(out, sample_nudge, dir, out);"},{"Add":" VectorMA(out, sample_nudge, normal, out);"},{"Add":""},{"Add":" return PvsForOrigin(out, pvs);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"BuildFacelights"},{"Add":"============="},{"Add":"*/"},{"Add":"float sampleofs[5][2] ="},{"Add":" {{0, 0}, {-0.25, -0.25}, {0.25, -0.25}, {0.25, 0.25}, {-0.25, 0.25}};"},{"Add":""},{"Add":"void BuildFacelights(int32_t facenum) {"},{"Add":" lightinfo_t * liteinfo;//[5];"},{"Add":" struct SH1 **styletable;//[MAX_LSTYLES];"},{"Add":" int32_t i, j;"},{"Add":" float *spot;"},{"Add":" patch_t *patch;"},{"Add":" int32_t numsamples;"},{"Add":" int32_t tablesize;"},{"Add":" facelight_t *fl;"},{"Add":" qboolean sun_main_once, sun_ambient_once;"},{"Add":" vec_t *center;"},{"Add":" vec3_t pos;"},{"Add":" vec3_t pointnormal;"},{"Add":""},{"Add":" liteinfo = malloc(sizeof(*liteinfo) * 5);"},{"Add":" styletable = malloc(sizeof(*styletable) * MAX_LSTYLES);"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *this_face;"},{"Add":" this_face = &dfacesX[facenum];"},{"Add":""},{"Add":" if (texinfo[this_face->texinfo].flags & (SURF_WARP | SURF_SKY))"},{"Add":" goto cleanup; // non-lit texture"},{"Add":""},{"Add":" memset(styletable, 0, sizeof(*styletable) * MAX_LSTYLES);"},{"Add":""},{"Add":" if (extrasamples) // set with -extra option"},{"Add":" numsamples = 5;"},{"Add":" else"},{"Add":" numsamples = 1;"},{"Add":" for (i = 0; i < numsamples; i++) {"},{"Add":" memset(&liteinfo[i], 0, sizeof(liteinfo[i]));"},{"Add":" liteinfo[i].surfnum = facenum;"},{"Add":" liteinfo[i].faceX = this_face;"},{"Add":" VectorCopy(dplanes[this_face->planenum].normal, liteinfo[i].facenormal);"},{"Add":" liteinfo[i].facedist = dplanes[this_face->planenum].dist;"},{"Add":" if (this_face->side) {"},{"Add":" VectorSubtract(vec3_origin, liteinfo[i].facenormal, liteinfo[i].facenormal);"},{"Add":" liteinfo[i].facedist = -liteinfo[i].facedist;"},{"Add":" }"},{"Add":""},{"Add":" // get the origin offset for rotating bmodels"},{"Add":" VectorCopy(face_offset[facenum], liteinfo[i].modelorg);"},{"Add":""},{"Add":" CalcFaceVectors(&liteinfo[i]);"},{"Add":" CalcFaceExtents(&liteinfo[i]);"},{"Add":" CalcPoints(&liteinfo[i], sampleofs[i][0], sampleofs[i][1]);"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *this_face;"},{"Add":" this_face = &dfaces[facenum];"},{"Add":""},{"Add":" if (texinfo[this_face->texinfo].flags & (SURF_WARP | SURF_SKY))"},{"Add":" goto cleanup; // non-lit texture"},{"Add":""},{"Add":" memset(styletable, 0, sizeof(*styletable) * MAX_LSTYLES);"},{"Add":""},{"Add":" if (extrasamples) // set with -extra option"},{"Add":" numsamples = 5;"},{"Add":" else"},{"Add":" numsamples = 1;"},{"Add":""},{"Add":" for (i = 0; i < numsamples; i++) {"},{"Add":" memset(&liteinfo[i], 0, sizeof(liteinfo[i]));"},{"Add":" liteinfo[i].surfnum = facenum;"},{"Add":" liteinfo[i].face = this_face;"},{"Add":" VectorCopy(dplanes[this_face->planenum].normal, liteinfo[i].facenormal);"},{"Add":" liteinfo[i].facedist = dplanes[this_face->planenum].dist;"},{"Add":" if (this_face->side) {"},{"Add":" VectorSubtract(vec3_origin, liteinfo[i].facenormal, liteinfo[i].facenormal);"},{"Add":" liteinfo[i].facedist = -liteinfo[i].facedist;"},{"Add":" }"},{"Add":""},{"Add":" // get the origin offset for rotating bmodels"},{"Add":" VectorCopy(face_offset[facenum], liteinfo[i].modelorg);"},{"Add":""},{"Add":" CalcFaceVectors(&liteinfo[i]);"},{"Add":" CalcFaceExtents(&liteinfo[i]);"},{"Add":" CalcPoints(&liteinfo[i], sampleofs[i][0], sampleofs[i][1]);"},{"Add":" }"},{"Add":" }"},{"Add":" tablesize = liteinfo[0].numsurfpt * sizeof(struct SH1);"},{"Add":" styletable[0] = malloc(tablesize);"},{"Add":" memset(styletable[0], 0, tablesize);"},{"Add":""},{"Add":" fl = &facelight[facenum];"},{"Add":" fl->numsamples = liteinfo[0].numsurfpt;"},{"Add":" fl->origins = malloc(tablesize);"},{"Add":""},{"Add":" memcpy(fl->origins, liteinfo[0].surfpt, tablesize);"},{"Add":" center = face_extents[facenum].center; // center of the face"},{"Add":""},{"Add":" for (i = 0; i < liteinfo[0].numsurfpt; i++) {"},{"Add":" sun_ambient_once = false;"},{"Add":" sun_main_once = false;"},{"Add":""},{"Add":" for (j = 0; j < numsamples; j++) {"},{"Add":" byte pvs[(MAX_MAP_LEAFS_QBSP + 7) / 8];"},{"Add":""},{"Add":" if (numsamples > 1) {"},{"Add":" if (!NudgeSamplePosition(liteinfo[j].surfpt[i], liteinfo[0].facenormal, center, pos, pvs)) {"},{"Add":" continue; // not a valid point"},{"Add":" }"},{"Add":" } else"},{"Add":""},{"Add":" VectorCopy(liteinfo[j].surfpt[i], pos);"},{"Add":""},{"Add":" if (smoothing_threshold > 0.0)"},{"Add":" GetPhongNormal(facenum, pos, pointnormal); // qb: VHLT"},{"Add":" else"},{"Add":" VectorCopy(liteinfo[0].facenormal, pointnormal);"},{"Add":""},{"Add":" GatherSampleLight(pos, pointnormal, styletable, i, tablesize, 1.0 / numsamples,"},{"Add":" &sun_main_once, &sun_ambient_once, pvs);"},{"Add":" }"},{"Add":""},{"Add":" // contribute the sample to one or more patches"},{"Add":" AddSampleToPatch(liteinfo[0].surfpt[i], styletable[0][i], facenum);"},{"Add":" }"},{"Add":""},{"Add":" // average up the direct light on each patch for radiosity"},{"Add":" for (patch = face_patches[facenum]; patch; patch = patch->next) {"},{"Add":" if (patch->samples) {"},{"Add":" vec3_t normal;"},{"Add":" VectorCopy(patch->plane->normal, normal);"},{"Add":" patch->samplelight = SH1_Reflect(SH1_Scale(patch->samplelight, 1.0f / patch->samples), normal);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < MAX_LSTYLES; i++) {"},{"Add":" if (!styletable[i])"},{"Add":" continue;"},{"Add":" if (fl->numstyles == MAX_STYLES)"},{"Add":" break;"},{"Add":" fl->samples[fl->numstyles] = styletable[i];"},{"Add":" fl->stylenums[fl->numstyles] = i;"},{"Add":" fl->numstyles++;"},{"Add":" }"},{"Add":""},{"Add":" // the light from DIRECT_LIGHTS is sent out, but the"},{"Add":" // texture itself should still be full bright"},{"Add":" if (face_patches[facenum]->baselight.f[0] >= DIRECT_LIGHT ||"},{"Add":" face_patches[facenum]->baselight.f[4] >= DIRECT_LIGHT ||"},{"Add":" face_patches[facenum]->baselight.f[8] >= DIRECT_LIGHT) {"},{"Add":" for (i = 0; i < liteinfo[0].numsurfpt; i++) {"},{"Add":" fl->samples[0][i] = SH1_Add(fl->samples[0][i], face_patches[facenum]->baselight);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":"cleanup:"},{"Add":" free(liteinfo);"},{"Add":" free(styletable);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FinalLightFace"},{"Add":""},{"Add":"Add the indirect lighting on top of the direct"},{"Add":"lighting and save into final map format"},{"Add":"============="},{"Add":"*/"},{"Add":"void FinalLightFace(int32_t facenum) {"},{"Add":" int32_t i, j, st;"},{"Add":" vec3_t lb;"},{"Add":" patch_t *patch;"},{"Add":" triangulation_t *trian = NULL;"},{"Add":" facelight_t *fl;"},{"Add":" float max;"},{"Add":" float newmax;"},{"Add":" byte *dest_rgb0, *dest_r1, *dest_g1, *dest_b1;"},{"Add":" triangle_t *last_valid;"},{"Add":" int32_t pfacenum;"},{"Add":" vec3_t facemins, facemaxs;"},{"Add":""},{"Add":" fl = &facelight[facenum];"},{"Add":""},{"Add":" ThreadLock();"},{"Add":" i = lightdatasize;"},{"Add":" lightdatasize += fl->numstyles * (fl->numsamples * 3 * 4);"},{"Add":""},{"Add":" if (lightdatasize > maxdata) {"},{"Add":" printf(\"face %d of %d\\n\", facenum, numfaces);"},{"Add":" Error(\"lightdatasize %i > maxdata %i\", lightdatasize, maxdata);"},{"Add":" }"},{"Add":" ThreadUnlock();"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" // dface_tx *f;"},{"Add":" // f = &dfacesX[facenum];"},{"Add":""},{"Add":" // if (texinfo[f->texinfo].flags & (SURF_WARP | SURF_SKY))"},{"Add":" // return; // non-lit texture"},{"Add":""},{"Add":" // f->lightofs = i;"},{"Add":" // f->styles[0] = 0;"},{"Add":" // f->styles[1] = f->styles[2] = f->styles[3] = 0xff;"},{"Add":""},{"Add":" // //"},{"Add":" // // set up the triangulation"},{"Add":" // //"},{"Add":" // if (numbounce > 0) {"},{"Add":" // ClearBounds(facemins, facemaxs);"},{"Add":" // for (i = 0; i < f->numedges; i++) {"},{"Add":" // int32_t ednum;"},{"Add":""},{"Add":" // ednum = dsurfedges[f->firstedge + i];"},{"Add":" // if (ednum >= 0)"},{"Add":" // AddPointToBounds(dvertexes[dedgesX[ednum].v[0]].point,"},{"Add":" // facemins, facemaxs);"},{"Add":" // else"},{"Add":" // AddPointToBounds(dvertexes[dedgesX[-ednum].v[1]].point,"},{"Add":" // facemins, facemaxs);"},{"Add":" // }"},{"Add":""},{"Add":" // trian = AllocTriangulation(&dplanes[f->planenum]);"},{"Add":""},{"Add":" // // for all faces on the plane, add the nearby patches"},{"Add":" // // to the triangulation"},{"Add":" // for (pfacenum = planelinks[f->side][f->planenum]; pfacenum; pfacenum = facelinks[pfacenum]) {"},{"Add":" // for (patch = face_patches[pfacenum]; patch; patch = patch->next) {"},{"Add":" // for (i = 0; i < 3; i++) {"},{"Add":" // if (facemins[i] - patch->origin[i] > subdiv * 2)"},{"Add":" // break;"},{"Add":" // if (patch->origin[i] - facemaxs[i] > subdiv * 2)"},{"Add":" // break;"},{"Add":" // }"},{"Add":" // if (i != 3)"},{"Add":" // continue; // not needed for this face"},{"Add":" // AddPointToTriangulation(patch, trian);"},{"Add":" // }"},{"Add":" // }"},{"Add":" // for (i = 0; i < trian->numpoints; i++)"},{"Add":" // memset(trian->edgematrix[i], 0, trian->numpoints * sizeof(trian->edgematrix[0][0]));"},{"Add":" // TriangulatePoints(trian);"},{"Add":" // }"},{"Add":""},{"Add":" // //"},{"Add":" // // sample the triangulation"},{"Add":" // //"},{"Add":""},{"Add":" // dest = &dlightdata_ptr[f->lightofs];"},{"Add":""},{"Add":" // if (fl->numstyles > MAXLIGHTMAPS) {"},{"Add":" // fl->numstyles = MAXLIGHTMAPS;"},{"Add":" // //\tprintf (\"face with too many lightstyles: (%f %f %f)\\n\","},{"Add":" // //\t\tface_patches[facenum]->origin[0],"},{"Add":" // //\t\tface_patches[facenum]->origin[1],"},{"Add":" // //\t\tface_patches[facenum]->origin[2]"},{"Add":" // //\t\t);"},{"Add":" // }"},{"Add":" // for (st = 0; st < fl->numstyles; st++) {"},{"Add":" // last_valid = NULL;"},{"Add":" // f->styles[st] = fl->stylenums[st];"},{"Add":""},{"Add":" // for (j = 0; j < fl->numsamples; j++) {"},{"Add":" // struct SH1 color = fl->samples[st][j];"},{"Add":""},{"Add":" // if (numbounce > 0 && st == 0) {"},{"Add":" // color = SH1_Add(color, SampleTriangulation(fl->origins + j * 3, trian, &last_valid));"},{"Add":" // }"},{"Add":""},{"Add":" // SH1_Sample(color, f->side ? backplanes[f->planenum].normal : dplanes[f->planenum].normal, lb);"},{"Add":""},{"Add":" // /*"},{"Add":" // * to allow experimenting, ambient and lightscale are not limited"},{"Add":" // * to reasonable ranges."},{"Add":" // */"},{"Add":" // if (ambient >= -255.0f && ambient <= 255.0f) {"},{"Add":" // // add fixed white ambient."},{"Add":" // lb[0] += ambient;"},{"Add":" // lb[1] += ambient;"},{"Add":" // lb[2] += ambient;"},{"Add":" // }"},{"Add":" // if (lightscale > 0.0f) {"},{"Add":" // // apply lightscale, scale down or up"},{"Add":" // lb[0] *= lightscale;"},{"Add":" // lb[1] *= lightscale;"},{"Add":" // lb[2] *= lightscale;"},{"Add":" // }"},{"Add":" // // negative values not allowed"},{"Add":" // lb[0] = (lb[0] < 0.0f) ? 0.0f : lb[0];"},{"Add":" // lb[1] = (lb[1] < 0.0f) ? 0.0f : lb[1];"},{"Add":" // lb[2] = (lb[2] < 0.0f) ? 0.0f : lb[2];"},{"Add":""},{"Add":" // /*\t\t\tqprintf(\"{%f %f %f}:\",lb[0],lb[1],lb[2]);*/"},{"Add":""},{"Add":" // // determine max of R,G,B"},{"Add":" // max = lb[0] > lb[1] ? lb[0] : lb[1];"},{"Add":" // max = max > lb[2] ? max : lb[2];"},{"Add":""},{"Add":" // if (max < 1.0f)"},{"Add":" // max = 1.0f;"},{"Add":""},{"Add":" // // note that maxlight based scaling is per-sample based on"},{"Add":" // // highest value of R, G, and B"},{"Add":" // // adjust for -maxlight option"},{"Add":" // newmax = max;"},{"Add":" // if (max > maxlight) {"},{"Add":" // newmax = maxlight;"},{"Add":" // newmax /= max; // scaling factor 0.0..1.0"},{"Add":" // // scale into 0.0..maxlight range"},{"Add":" // lb[0] *= newmax;"},{"Add":" // lb[1] *= newmax;"},{"Add":" // lb[2] *= newmax;"},{"Add":" // }"},{"Add":""},{"Add":" // // and output to 8:8:8 RGB"},{"Add":" // *dest++ = (byte)(lb[0] + 0.5);"},{"Add":" // *dest++ = (byte)(lb[1] + 0.5);"},{"Add":" // *dest++ = (byte)(lb[2] + 0.5);"},{"Add":" // }"},{"Add":" // }"},{"Add":" } else {"},{"Add":" // ibsp"},{"Add":" dface_t *f;"},{"Add":" f = &dfaces[facenum];"},{"Add":""},{"Add":" if (texinfo[f->texinfo].flags & (SURF_WARP | SURF_SKY))"},{"Add":" return; // non-lit texture"},{"Add":""},{"Add":" f->lightofs = i;"},{"Add":" f->styles[0] = 0;"},{"Add":" f->styles[1] = f->styles[2] = f->styles[3] = 0xff;"},{"Add":""},{"Add":" //"},{"Add":" // set up the triangulation"},{"Add":" //"},{"Add":" if (numbounce > 0) {"},{"Add":" ClearBounds(facemins, facemaxs);"},{"Add":" for (i = 0; i < f->numedges; i++) {"},{"Add":" int32_t ednum;"},{"Add":""},{"Add":" ednum = dsurfedges[f->firstedge + i];"},{"Add":" if (ednum >= 0)"},{"Add":" AddPointToBounds(dvertexes[dedges[ednum].v[0]].point,"},{"Add":" facemins, facemaxs);"},{"Add":" else"},{"Add":" AddPointToBounds(dvertexes[dedges[-ednum].v[1]].point,"},{"Add":" facemins, facemaxs);"},{"Add":" }"},{"Add":""},{"Add":" trian = AllocTriangulation(&dplanes[f->planenum]);"},{"Add":""},{"Add":" // for all faces on the plane, add the nearby patches"},{"Add":" // to the triangulation"},{"Add":" for (pfacenum = planelinks[f->side][f->planenum]; pfacenum; pfacenum = facelinks[pfacenum]) {"},{"Add":" for (patch = face_patches[pfacenum]; patch; patch = patch->next) {"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (facemins[i] - patch->origin[i] > subdiv * 2)"},{"Add":" break;"},{"Add":" if (patch->origin[i] - facemaxs[i] > subdiv * 2)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (i != 3)"},{"Add":" continue; // not needed for this face"},{"Add":" AddPointToTriangulation(patch, trian);"},{"Add":" }"},{"Add":" }"},{"Add":" for (i = 0; i < trian->numpoints; i++)"},{"Add":" memset(trian->edgematrix[i], 0, trian->numpoints * sizeof(trian->edgematrix[0][0]));"},{"Add":" TriangulatePoints(trian);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // sample the triangulation"},{"Add":" //"},{"Add":""},{"Add":" dest_rgb0 = &dlightdata_ptr[f->lightofs + (fl->numsamples * 3 * 0)];"},{"Add":" dest_r1 = &dlightdata_ptr[f->lightofs + (fl->numsamples * 3 * 1)];"},{"Add":" dest_g1 = &dlightdata_ptr[f->lightofs + (fl->numsamples * 3 * 2)];"},{"Add":" dest_b1 = &dlightdata_ptr[f->lightofs + (fl->numsamples * 3 * 3)];"},{"Add":""},{"Add":" if (fl->numstyles > MAXLIGHTMAPS) {"},{"Add":" fl->numstyles = MAXLIGHTMAPS;"},{"Add":" //\tprintf (\"face with too many lightstyles: (%f %f %f)\\n\","},{"Add":" //\t\tface_patches[facenum]->origin[0],"},{"Add":" //\t\tface_patches[facenum]->origin[1],"},{"Add":" //\t\tface_patches[facenum]->origin[2]"},{"Add":" //\t\t);"},{"Add":" }"},{"Add":" for (st = 0; st < fl->numstyles; st++) {"},{"Add":" last_valid = NULL;"},{"Add":" f->styles[st] = fl->stylenums[st];"},{"Add":""},{"Add":" for (j = 0; j < fl->numsamples; j++) {"},{"Add":" struct SH1 color = fl->samples[st][j];"},{"Add":""},{"Add":" if (numbounce > 0 && st == 0) {"},{"Add":" color = SH1_Add(color, SampleTriangulation(fl->origins + j * 3, trian, &last_valid));"},{"Add":" }"},{"Add":""},{"Add":" /*"},{"Add":" * to allow experimenting, ambient and lightscale are not limited"},{"Add":" * to reasonable ranges."},{"Add":" */"},{"Add":" if (ambient >= -255.0f && ambient <= 255.0f) {"},{"Add":" // add fixed white ambient."},{"Add":" color.f[0] += ambient;"},{"Add":" color.f[4] += ambient;"},{"Add":" color.f[8] += ambient;"},{"Add":" }"},{"Add":""},{"Add":" if (lightscale > 0.0f) {"},{"Add":" // apply lightscale, scale down or up"},{"Add":" color = SH1_Scale(color, lightscale);"},{"Add":" }"},{"Add":""},{"Add":" float color_max;"},{"Add":" color = SH1_NormalizeMaximum(color, maxlight - 0.5f, &color_max);"},{"Add":""},{"Add":" for(int component = 0; component < 3; component++) {"},{"Add":" if(color.f[component * 4 + 0] > maxlight)"},{"Add":" assert(0);"},{"Add":""},{"Add":" for(int basis = 0; basis < 3; basis++) {"},{"Add":" color.f[component * 4 + basis + 1] *= 0.5f;"},{"Add":" color.f[component * 4 + basis + 1] += 127.0f;"},{"Add":""},{"Add":" if(color.f[component * 4 + basis + 1] > 256)"},{"Add":" assert(0);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // and output to 8:8:8 RGB"},{"Add":" *dest_rgb0++ = (byte)(color.f[0] + 0.5f);"},{"Add":" *dest_r1++ = (byte)(color.f[1] + 0.5f);"},{"Add":" *dest_r1++ = (byte)(color.f[2] + 0.5f);"},{"Add":" *dest_r1++ = (byte)(color.f[3] + 0.5f);"},{"Add":" *dest_rgb0++ = (byte)(color.f[4] + 0.5f);"},{"Add":" *dest_g1++ = (byte)(color.f[5] + 0.5f);"},{"Add":" *dest_g1++ = (byte)(color.f[6] + 0.5f);"},{"Add":" *dest_g1++ = (byte)(color.f[7] + 0.5f);"},{"Add":" *dest_rgb0++ = (byte)(color.f[8] + 0.5f);"},{"Add":" *dest_b1++ = (byte)(color.f[9] + 0.5f);"},{"Add":" *dest_b1++ = (byte)(color.f[10] + 0.5f);"},{"Add":" *dest_b1++ = (byte)(color.f[11] + 0.5f);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (numbounce > 0)"},{"Add":" FreeTriangulation(trian);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4rad_main.c","metadata":0},"context":[{"change":0,"pos":195246}],"contents":[{"Add":"#include \"qrad.h\""},{"Add":""},{"Add":"extern qboolean dumppatches;"},{"Add":"extern qboolean nopvs;"},{"Add":"extern qboolean save_trace;"},{"Add":"extern float patch_cutoff;"},{"Add":"extern char inbase[32];"},{"Add":"extern char outbase[32];"},{"Add":""},{"Add":"void RAD_ProcessArgument(const char * arg);"},{"Add":""},{"Add":"int32_t main(int32_t argc, char **argv) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" char tgamedir[1024] = \"\", tbasedir[1024] = \"\", tmoddir[1024] = \"\";"},{"Add":""},{"Add":" printf(\"\\n\\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4rad >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\");"},{"Add":" printf(\"radiosity compiler build \" __DATE__ \"\\n\");"},{"Add":""},{"Add":" verbose = false;"},{"Add":" numthreads = -1;"},{"Add":" maxdata = DEFAULT_MAP_LIGHTING;"},{"Add":" step = LMSTEP;"},{"Add":""},{"Add":" for (i = 1; i < argc; i++) {"},{"Add":" if (!strcmp(argv[i], \"-dump\"))"},{"Add":" dumppatches = true;"},{"Add":" else if (!strcmp(argv[i], \"-bounce\")) {"},{"Add":" numbounce = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-v\")) {"},{"Add":" verbose = true;"},{"Add":" } else if (!strcmp(argv[i], \"-help\")) {"},{"Add":" printf(\"4rad with automatic phong and QBSP extended limit support.\\n\""},{"Add":" \"Usage: 4rad [options] [mapname]\\n\\n\""},{"Add":" \" -ambient #: Minimum light level.\\n\""},{"Add":" \" range: 0 to 255.\\n\""},{"Add":" \" -moddir [path]: Set a mod directory. Default is parent dir of map file.\\n\""},{"Add":" \" -basedir [path]: Set the directory for assets not in moddir. Default is moddir.\\n\""},{"Add":" \" -gamedir [path]: Set game directory, the folder with game executable.\\n\""},{"Add":" \" -bounce #: Max number of light bounces for radiosity.\\n\""},{"Add":" \" -dice: Subdivide patches with a global grid rather than per patch.\\n\""},{"Add":" \" -direct #: Direct light scale factor.\\n\""},{"Add":" \" -entity #: Entity light scale factor.\\n\""},{"Add":" \" -extra: Use extra samples to smooth lighting.\\n\""},{"Add":" \" -maxdata #: 2097152 is default max. Not needed for QBSP format.\\n\""},{"Add":" \" Increase requires a supporting engine.\\n\""},{"Add":" \" -maxlight #: Maximium light level.\\n\""},{"Add":" \" range: 0 to 255.\\n\""},{"Add":" \" -noedgefix: disable dark edges at sky fix. More of a hack, really.\\n\""},{"Add":" \" -nudge #: Nudge factor for samples. Distance fraction from center.\\n\""},{"Add":" \" -saturate #: Saturation factor of light bounced off surfaces.\\n\""},{"Add":" \" -scale #: Light intensity multiplier.\\n\""},{"Add":" \" -smooth #: Threshold angle (# and 180deg - #) for phong smoothing.\\n\""},{"Add":" \" -subdiv (or -chop) #: Maximum patch size. Default: 64\\n\""},{"Add":" \" -sunradscale #: Sky light intensity scale when sun is active.\\n\""},{"Add":" \" -threads #: Number of CPU cores to use.\\n\""},{"Add":" \"Debugging tools:\\n\""},{"Add":" \" -dump: Dump patches to a text file.\\n\""},{"Add":" \" -noblock: Brushes don't block lighting path.\\n\""},{"Add":" \" -nopvs: Don't do potential visibility set check.\\n\""},{"Add":" \" -savetrace: Test traces and report errors.\\n\""},{"Add":" \" -tmpin: Read from 'tmp' directory.\\n\""},{"Add":" \" -tmpout: Write to 'tmp' directory.\\n\""},{"Add":" \" -v: Verbose output for debugging.\\n\\n\");"},{"Add":" printf(\"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4rad HELP >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":""},{"Add":" exit(1);"},{"Add":" }"},{"Add":""},{"Add":" else if (!strcmp(argv[i], \"-extra\")) {"},{"Add":" extrasamples = true;"},{"Add":" printf(\"extrasamples = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-noedgefix\")) // qb: light warp surfaces"},{"Add":" {"},{"Add":" noedgefix = true;"},{"Add":" printf(\"no edge fix = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-dice\")) {"},{"Add":" dicepatches = true;"},{"Add":" printf(\"dicepatches = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-threads\")) {"},{"Add":" numthreads = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-maxdata\")) { // qb: allows increase for some engines"},{"Add":" maxdata = atoi(argv[i + 1]);"},{"Add":" i++;"},{"Add":" if (maxdata > DEFAULT_MAP_LIGHTING) {"},{"Add":" printf(\"lighting maxdata (%i) exceeds typical limit (%i).\\n\", maxdata, DEFAULT_MAP_LIGHTING);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // qb: set gamedir, moddir, and basedir"},{"Add":" else if (!strcmp(argv[i], \"-gamedir\")) {"},{"Add":" strcpy(tgamedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-basedir\")) {"},{"Add":" strcpy(tbasedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-moddir\")) {"},{"Add":" strcpy(tmoddir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" }"},{"Add":""},{"Add":" else if ((!strcmp(argv[i], \"-chop\")) || (!strcmp(argv[i], \"-subdiv\"))) {"},{"Add":" subdiv = atoi(argv[i + 1]);"},{"Add":" if (subdiv < 16) {"},{"Add":" subdiv = 16;"},{"Add":" printf(\"subdiv set to minimum: 16\\n\");"},{"Add":" } else if (subdiv > 1024) {"},{"Add":" subdiv = 1024;"},{"Add":" printf(\"subdiv set to maximum: 1024\\n\");"},{"Add":" }"},{"Add":" i++;"},{"Add":" }"},{"Add":""},{"Add":" else if (!strcmp(argv[i], \"-scale\")) {"},{"Add":" lightscale = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-sunradscale\")) {"},{"Add":" sunradscale = atof(argv[i + 1]);"},{"Add":" if (sunradscale < 0) {"},{"Add":" sunradscale = 0;"},{"Add":" printf(\"sunradscale set to minimum: 0\\n\");"},{"Add":" }"},{"Add":" printf(\"sunradscale = %f\\n\", sunradscale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-saturation\")) {"},{"Add":" saturation = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-radmin\")) {"},{"Add":" patch_cutoff = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-direct\")) {"},{"Add":" direct_scale *= atof(argv[i + 1]);"},{"Add":" // printf (\"direct light scaling at %f\\n\", direct_scale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-entity\")) {"},{"Add":" entity_scale *= atof(argv[i + 1]);"},{"Add":" // printf (\"entity light scaling at %f\\n\", entity_scale);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-nopvs\")) {"},{"Add":" nopvs = true;"},{"Add":" printf(\"nopvs = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-nopvs\")) {"},{"Add":" nopvs = true;"},{"Add":" printf(\"nopvs = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-noblock\")) {"},{"Add":" noblock = true;"},{"Add":" printf(\"noblock = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-smooth\")) {"},{"Add":""},{"Add":" // qb: limit range"},{"Add":" smoothing_value = BOUND(0, atof(argv[i + 1]), 90);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-nudge\")) {"},{"Add":" sample_nudge = atof(argv[i + 1]);"},{"Add":" // qb: nah, go crazy. sample_nudge = BOUND(0, sample_nudge, 1.0);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-ambient\")) {"},{"Add":" ambient = BOUND(0, atof(argv[i + 1]), 255);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-savetrace\")) {"},{"Add":" save_trace = true;"},{"Add":" printf(\"savetrace = true\\n\");"},{"Add":" } else if (!strcmp(argv[i], \"-maxlight\")) {"},{"Add":" maxlight = BOUND(0, atof(argv[i + 1]), 255);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-tmpin\"))"},{"Add":" strcpy(inbase, \"/tmp\");"},{"Add":" else if (!strcmp(argv[i], \"-tmpout\"))"},{"Add":" strcpy(outbase, \"/tmp\");"},{"Add":" else"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (i != argc - 1) {"},{"Add":" printf(\"Usage: 4rad [options] [mapname]\\n\""},{"Add":" \" -ambient # -bounce #\\n\""},{"Add":" \" -dice -direct # -entity #\\n\""},{"Add":" \" -extra -help -maxdata #\\n\""},{"Add":" \" -maxlight # -noedgefix -nudge #\\n\""},{"Add":" \" -saturate # -scale # -smooth #\\n\""},{"Add":" \" -subdiv -sunradscale # -threads #\\n\""},{"Add":" \" -gamedir [path] -basedir [path] -moddir [path]\\n\""},{"Add":" \"Debugging tools:\\n\""},{"Add":" \" -dump -noblock -nopvs\\n\""},{"Add":" \" -savetrace -tmpin -tmpout\\n\""},{"Add":" \" -v (verbose)\\n\\n\");"},{"Add":" exit(1);"},{"Add":" }"},{"Add":""},{"Add":" printf(\"sample nudge: %f\\n\", sample_nudge);"},{"Add":" printf(\"ambient : %f\\n\", ambient);"},{"Add":" printf(\"scale : %f\\n\", lightscale);"},{"Add":" printf(\"maxlight : %f\\n\", maxlight);"},{"Add":" printf(\"entity : %f\\n\", entity_scale);"},{"Add":" printf(\"direct : %f\\n\", direct_scale);"},{"Add":" printf(\"saturation : %f\\n\", saturation);"},{"Add":" printf(\"bounce : %d\\n\", numbounce);"},{"Add":" printf(\"radmin : %f\\n\", patch_cutoff);"},{"Add":" printf(\"subdiv : %f\\n\", subdiv);"},{"Add":" printf(\"smooth angle: %f\\n\", smoothing_value);"},{"Add":" printf(\"nudge : %f\\n\", sample_nudge);"},{"Add":" printf(\"threads : %d\\n\", numthreads);"},{"Add":""},{"Add":" ThreadSetDefault();"},{"Add":""},{"Add":""},{"Add":" smoothing_threshold = (float)cos(smoothing_value * (Q_PI / 180.0));"},{"Add":""},{"Add":" SetQdirFromPath(argv[i]);"},{"Add":""},{"Add":" if (strcmp(tmoddir, \"\")) {"},{"Add":" strcpy(moddir, tmoddir);"},{"Add":" Q_pathslash(moddir);"},{"Add":" strcpy(basedir, moddir);"},{"Add":" }"},{"Add":" if (strcmp(tbasedir, \"\")) {"},{"Add":" strcpy(basedir, tbasedir);"},{"Add":" Q_pathslash(basedir);"},{"Add":" if (!strcmp(tmoddir, \"\"))"},{"Add":" strcpy(moddir, basedir);"},{"Add":" }"},{"Add":" if (strcmp(tgamedir, \"\")) {"},{"Add":" strcpy(gamedir, tgamedir);"},{"Add":" Q_pathslash(gamedir);"},{"Add":" }"},{"Add":""},{"Add":" // qb: display dirs"},{"Add":" printf(\"moddir = %s\\n\", moddir);"},{"Add":" printf(\"basedir = %s\\n\", basedir);"},{"Add":" printf(\"gamedir = %s\\n\", gamedir);"},{"Add":""},{"Add":" RAD_ProcessArgument(argv[i]);"},{"Add":""},{"Add":" return 0;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4rad.c","metadata":0},"context":[{"change":0,"pos":195246}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qrad.h\""},{"Add":""},{"Add":"/*"},{"Add":""},{"Add":"NOTES"},{"Add":"-----"},{"Add":""},{"Add":"every surface must be divided into at least two patches each axis"},{"Add":""},{"Add":"*/"},{"Add":""},{"Add":"patch_t *face_patches[MAX_MAP_FACES_QBSP];"},{"Add":"entity_t *face_entity[MAX_MAP_FACES_QBSP];"},{"Add":"patch_t *patches; //[MAX_PATCHES_QBSP];"},{"Add":"unsigned num_patches;"},{"Add":"int32_t num_smoothing; // qb: number of phong hits"},{"Add":""},{"Add":"struct SH1 radiosity[MAX_PATCHES_QBSP]; // light leaving a patch"},{"Add":"struct SH1 illumination[MAX_PATCHES_QBSP]; // light arriving at a patch"},{"Add":""},{"Add":"vec3_t face_offset[MAX_MAP_FACES_QBSP]; // for rotating bmodels"},{"Add":"dplane_t backplanes[MAX_MAP_PLANES_QBSP];"},{"Add":""},{"Add":"extern char inbase[32], outbase[32];"},{"Add":""},{"Add":"int32_t fakeplanes; // created planes for origin offset"},{"Add":""},{"Add":"int32_t numbounce = 4; // default was 8"},{"Add":"qboolean noblock = false; // when true, disables occlusion testing on light rays"},{"Add":"qboolean extrasamples = false;"},{"Add":"qboolean dicepatches = false;"},{"Add":"qboolean noedgefix = false;"},{"Add":"int32_t memory = false;"},{"Add":"float patch_cutoff = 0.0f; // set with -radmin 0.0..1.0, see MakeTransfers()"},{"Add":""},{"Add":"float subdiv = 64;"},{"Add":"qboolean dumppatches;"},{"Add":""},{"Add":"void BuildFaceExtents(void); // qb: from quemap"},{"Add":"int32_t TestLine(vec3_t start, vec3_t stop);"},{"Add":"float smoothing_threshold; // qb: phong from VHLT"},{"Add":"float smoothing_value = DEFAULT_SMOOTHING_VALUE;"},{"Add":"float sample_nudge = DEFAULT_NUDGE_VALUE; // qb: adjustable nudge for multisample"},{"Add":""},{"Add":"/*"},{"Add":" * 2010-09 Notes"},{"Add":" * These variables are somewhat confusing. The floating point color values are"},{"Add":" * in the range 0..255 (floating point color should be 0.0 .. 1.0 IMO.)"},{"Add":" * The following may or may not be precisely correct."},{"Add":" * (There are other variables, surface flags, etc., affecting lighting. What"},{"Add":" * they do, or whether they work at all is \"to be determined\")"},{"Add":" *"},{"Add":" * see lightmap.c:FinalLightFace()"},{"Add":" * sequence: ambient is added, lightscale is applied, RGB is \"normalized\" to"},{"Add":" * 0..255 range, grayscale is applied, RGB is clamped to maxlight."},{"Add":" *"},{"Add":" * ambient:"},{"Add":" * set with -ambient option, 0..255 (but only small numbers are useful)"},{"Add":" * adds the same value to R, G & B"},{"Add":" * default is 0"},{"Add":" *"},{"Add":" * lightscale:"},{"Add":" * set with -scale option, 0.0..1.0"},{"Add":" * scales lightmap globally."},{"Add":" *"},{"Add":" * saturation:"},{"Add":" * set with -saturation, 0.0..1.0 //qb: does higher than 1 work?"},{"Add":" * proportionally saturation texture reflectivity"},{"Add":" *"},{"Add":" * direct_scale:"},{"Add":" * set with -direct option, 0.0..1.0"},{"Add":" * controls reflection from emissive surfaces, i.e. brushes with a light value"},{"Add":" * research indicates it is not the usual practice to include this in"},{"Add":" * radiosity, so the default should be 0.0. (Would be nice to have this"},{"Add":" * a per-surface option where surfaces are used like point lights.)"},{"Add":" *"},{"Add":" * entity_scale:"},{"Add":" * set with -entity option, 0.0..1.0"},{"Add":" * controls point light radiosity, i.e. light entities."},{"Add":" * default is 1.0, no attenuation of point lights"},{"Add":" *"},{"Add":" *"},{"Add":" */"},{"Add":"#include "},{"Add":"float ambient = 0.0f;"},{"Add":"float lightscale = 1.0f;"},{"Add":"float maxlight = 255.0f;"},{"Add":"// qboolean nocolor = false;"},{"Add":"float grayscale = 0.0f;"},{"Add":"float saturation = 1.0f; // qb: change desaturate to saturation"},{"Add":"float direct_scale = 1.0f;"},{"Add":"float entity_scale = 1.0f;"},{"Add":""},{"Add":"/*"},{"Add":" * 2010-09 Notes:"},{"Add":" * These are controlled by setting keys in the worldspawn entity. A light"},{"Add":" * entity targeting an info_null entity is used to determine the vector for"},{"Add":" * the sun directional lighting; variable name \"sun_pos\" is a misnomer, i think."},{"Add":" * Example:"},{"Add":" * \"_sun\" \"sun_target\" # activates sun"},{"Add":" * \"_sun_color\" \"1.0 1.0 0.0\" # for yellow, sets sun_alt_color true"},{"Add":" * \"_sun_light\" \"50\" # light value, variable is sun_main"},{"Add":" * \"_sun_ambient\" \"2\" # an ambient light value in the sun color. variable is sun_ambient"},{"Add":" *"},{"Add":" * It might or might not be the case:"},{"Add":" * if there is no info_null for the light entity with the \"sun_target\" to"},{"Add":" * target, then {0,0,0} is used for the target. If _sun_color is not specified"},{"Add":" * in the .map, the color of the light entity is used."},{"Add":" */"},{"Add":"qboolean sun = false;"},{"Add":"qboolean sun_alt_color = false;"},{"Add":"vec3_t sun_pos = {0.0f, 0.0f, 1.0f};"},{"Add":"float sun_main = 250.0f;"},{"Add":"float sun_ambient = 0.0f;"},{"Add":"vec3_t sun_color = {1, 1, 1};"},{"Add":""},{"Add":"qboolean nopvs;"},{"Add":"qboolean save_trace = false;"},{"Add":""},{"Add":"extern char source[1024];"},{"Add":""},{"Add":"/*"},{"Add":"==================================================================="},{"Add":""},{"Add":"MISC"},{"Add":""},{"Add":"==================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MakeBackplanes"},{"Add":"============="},{"Add":"*/"},{"Add":"void MakeBackplanes(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for(i = 0; i < numplanes; i++) {"},{"Add":" backplanes[i].dist = -dplanes[i].dist;"},{"Add":" VectorSubtract(vec3_origin, dplanes[i].normal, backplanes[i].normal);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"int32_t leafparents[MAX_MAP_LEAFS_QBSP];"},{"Add":"int32_t nodeparents[MAX_MAP_NODES_QBSP];"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MakeParents"},{"Add":"============="},{"Add":"*/"},{"Add":"void MakeParents(int32_t nodenum, int32_t parent) {"},{"Add":" int32_t i, j;"},{"Add":""},{"Add":" nodeparents[nodenum] = parent;"},{"Add":""},{"Add":" if(use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" node = &dnodesX[nodenum];"},{"Add":" for(i = 0; i < 2; i++) {"},{"Add":" j = node->children[i];"},{"Add":" if(j < 0)"},{"Add":" leafparents[-j - 1] = nodenum;"},{"Add":" else"},{"Add":" MakeParents(j, nodenum);"},{"Add":" }"},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" node = &dnodes[nodenum];"},{"Add":" for(i = 0; i < 2; i++) {"},{"Add":" j = node->children[i];"},{"Add":" if(j < 0)"},{"Add":" leafparents[-j - 1] = nodenum;"},{"Add":" else"},{"Add":" MakeParents(j, nodenum);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==================================================================="},{"Add":""},{"Add":"TRANSFER SCALES"},{"Add":""},{"Add":"==================================================================="},{"Add":"*/"},{"Add":""},{"Add":"int32_t PointInLeafnum(vec3_t point) {"},{"Add":" int32_t nodenum;"},{"Add":" vec_t dist;"},{"Add":" dplane_t *plane;"},{"Add":""},{"Add":" nodenum = 0;"},{"Add":" if(use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" while(nodenum >= 0) {"},{"Add":" node = &dnodesX[nodenum];"},{"Add":" plane = &dplanes[node->planenum];"},{"Add":" dist = DotProduct(point, plane->normal) - plane->dist;"},{"Add":" if(dist > 0)"},{"Add":" nodenum = node->children[0];"},{"Add":" else"},{"Add":" nodenum = node->children[1];"},{"Add":" }"},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" while(nodenum >= 0) {"},{"Add":" node = &dnodes[nodenum];"},{"Add":" plane = &dplanes[node->planenum];"},{"Add":" dist = DotProduct(point, plane->normal) - plane->dist;"},{"Add":" if(dist > 0)"},{"Add":" nodenum = node->children[0];"},{"Add":" else"},{"Add":" nodenum = node->children[1];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return -nodenum - 1;"},{"Add":"}"},{"Add":""},{"Add":"dleaf_tx *RadPointInLeafX(vec3_t point) {"},{"Add":" int32_t num;"},{"Add":""},{"Add":" num = PointInLeafnum(point);"},{"Add":" return &dleafsX[num];"},{"Add":"}"},{"Add":""},{"Add":"dleaf_t *RadPointInLeaf(vec3_t point) {"},{"Add":" int32_t num;"},{"Add":""},{"Add":" num = PointInLeafnum(point);"},{"Add":" return &dleafs[num];"},{"Add":"}"},{"Add":""},{"Add":"qboolean PvsForOrigin(vec3_t org, byte *pvs) {"},{"Add":" if(!visdatasize) {"},{"Add":" memset(pvs, 255, (numleafs + 7) / 8);"},{"Add":" return true;"},{"Add":" }"},{"Add":""},{"Add":" if(use_qbsp) {"},{"Add":" dleaf_tx *leaf;"},{"Add":" leaf = RadPointInLeafX(org);"},{"Add":" if(leaf->cluster == -1)"},{"Add":" return false; // in solid leaf"},{"Add":" DecompressVis(dvisdata + dvis->bitofs[leaf->cluster][DVIS_PVS], pvs);"},{"Add":" } else {"},{"Add":" dleaf_t *leaf;"},{"Add":" leaf = RadPointInLeaf(org);"},{"Add":" if(leaf->cluster == -1)"},{"Add":" return false; // in solid leaf"},{"Add":" DecompressVis(dvisdata + dvis->bitofs[leaf->cluster][DVIS_PVS], pvs);"},{"Add":" }"},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"typedef struct tnode_s {"},{"Add":" int32_t type;"},{"Add":" vec3_t normal;"},{"Add":" float dist;"},{"Add":" int32_t children[2];"},{"Add":" int32_t pad;"},{"Add":"} tnode_t;"},{"Add":""},{"Add":"extern tnode_t *tnodes;"},{"Add":""},{"Add":"int32_t total_transfer;"},{"Add":""},{"Add":"static long total_mem;"},{"Add":""},{"Add":"static int32_t first_transfer = 1;"},{"Add":""},{"Add":"#define MAX_TRACE_BUF ((MAX_PATCHES_QBSP + 7) / 8)"},{"Add":""},{"Add":"#define TRACE_BYTE(x) (((x) + 7) >> 3)"},{"Add":"#define TRACE_BIT(x) ((x)&0x1F)"},{"Add":""},{"Add":"static byte trace_buf[MAX_TRACE_BUF + 1];"},{"Add":"static byte trace_tmp[MAX_TRACE_BUF + 1];"},{"Add":"static int32_t trace_buf_size;"},{"Add":""},{"Add":"int32_t CompressBytes(int32_t size, byte *source, byte *dest) {"},{"Add":" int32_t j;"},{"Add":" int32_t rep;"},{"Add":" byte *dest_p;"},{"Add":""},{"Add":" dest_p = dest + 1;"},{"Add":""},{"Add":" for(j = 0; j < size; j++) {"},{"Add":" *dest_p++ = source[j];"},{"Add":""},{"Add":" if((dest_p - dest - 1) >= size) {"},{"Add":" memcpy(dest + 1, source, size);"},{"Add":" dest[0] = 0;"},{"Add":" return size + 1;"},{"Add":" }"},{"Add":""},{"Add":" if(source[j])"},{"Add":" continue;"},{"Add":""},{"Add":" rep = 1;"},{"Add":" for(j++; j < size; j++)"},{"Add":" if(source[j] || rep == 255)"},{"Add":" break;"},{"Add":" else"},{"Add":" rep++;"},{"Add":" *dest_p++ = rep;"},{"Add":""},{"Add":" if((dest_p - dest - 1) >= size) {"},{"Add":" memcpy(dest + 1, source, size);"},{"Add":" dest[0] = 0;"},{"Add":" return size + 1;"},{"Add":" }"},{"Add":""},{"Add":" j--;"},{"Add":" }"},{"Add":""},{"Add":" dest[0] = 1;"},{"Add":" return dest_p - dest;"},{"Add":"}"},{"Add":""},{"Add":"void DecompressBytes(int32_t size, byte *in, byte *decompressed) {"},{"Add":" int32_t c;"},{"Add":" byte *out;"},{"Add":""},{"Add":" if(in[0] == 0) // not compressed"},{"Add":" {"},{"Add":" memcpy(decompressed, in + 1, size);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" out = decompressed;"},{"Add":" in++;"},{"Add":""},{"Add":" do {"},{"Add":" if(*in) {"},{"Add":" *out++ = *in++;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" c = in[1];"},{"Add":" if(!c)"},{"Add":" Error(\"DecompressBytes: 0 repeat\");"},{"Add":" in += 2;"},{"Add":" while(c) {"},{"Add":" *out++ = 0;"},{"Add":" c--;"},{"Add":" }"},{"Add":" } while(out - decompressed < size);"},{"Add":"}"},{"Add":""},{"Add":"static int32_t trace_bytes = 0;"},{"Add":""},{"Add":"#ifdef WIN32"},{"Add":"static inline int32_t lowestCommonNode(int32_t nodeNum1, int32_t nodeNum2)"},{"Add":"#else"},{"Add":"static inline int32_t lowestCommonNode(int32_t nodeNum1, int32_t nodeNum2)"},{"Add":"#endif"},{"Add":"{"},{"Add":" int32_t child1, tmp, headNode = 0;"},{"Add":""},{"Add":" if(nodeNum1 > nodeNum2) {"},{"Add":" tmp = nodeNum1;"},{"Add":" nodeNum1 = nodeNum2;"},{"Add":" nodeNum2 = tmp;"},{"Add":" }"},{"Add":""},{"Add":"re_test:"},{"Add":" // headNode is guaranteed to be <= nodeNum1 and nodeNum1 is < nodeNum2"},{"Add":" if(headNode == nodeNum1)"},{"Add":" return headNode;"},{"Add":""},{"Add":" if(use_qbsp) {"},{"Add":" dnode_tx *node;"},{"Add":" child1 = (node = dnodesX + headNode)->children[1];"},{"Add":" if(nodeNum2 < child1)"},{"Add":" // Both nodeNum1 and nodeNum2 are less than child1."},{"Add":" // In this case, child0 is always a node, not a leaf, so we don't need"},{"Add":" // to check to make sure."},{"Add":" headNode = node->children[0];"},{"Add":" else if(nodeNum1 < child1)"},{"Add":" // Child1 sits between nodeNum1 and nodeNum2."},{"Add":" // This means that headNode is the lowest node which contains both"},{"Add":" // nodeNum1 and nodeNum2."},{"Add":" return headNode;"},{"Add":" else if(child1 > 0)"},{"Add":" // Both nodeNum1 and nodeNum2 are greater than child1."},{"Add":" // If child1 is a node, that means it contains both nodeNum1 and"},{"Add":" // nodeNum2."},{"Add":" headNode = child1;"},{"Add":" else"},{"Add":" // Child1 is a leaf, therefore by process of elimination child0 must be"},{"Add":" // a node and must contain boste nodeNum1 and nodeNum2."},{"Add":" headNode = node->children[0];"},{"Add":" // goto instead of while(1) because it makes the CPU branch predict easier"},{"Add":" } else {"},{"Add":" dnode_t *node;"},{"Add":" child1 = (node = dnodes + headNode)->children[1];"},{"Add":" if(nodeNum2 < child1)"},{"Add":" headNode = node->children[0];"},{"Add":" else if(nodeNum1 < child1)"},{"Add":" return headNode;"},{"Add":" else if(child1 > 0)"},{"Add":" headNode = child1;"},{"Add":" else"},{"Add":" headNode = node->children[0];"},{"Add":" }"},{"Add":""},{"Add":" goto re_test;"},{"Add":"}"},{"Add":""},{"Add":"void MakeTransfers(int32_t i) {"},{"Add":" int32_t j;"},{"Add":" vec3_t delta;"},{"Add":" vec_t dist, inv_dist = 0, scale;"},{"Add":" float trans;"},{"Add":" int32_t itrans;"},{"Add":" patch_t *patch, *patch2;"},{"Add":" float total, inv_total;"},{"Add":" dplane_t plane;"},{"Add":" vec3_t origin;"},{"Add":" float *transfers; //[MAX_PATCHES_QBSP];"},{"Add":" int32_t s;"},{"Add":" int32_t itotal;"},{"Add":" byte pvs[(MAX_MAP_LEAFS_QBSP + 7) / 8];"},{"Add":" int32_t cluster;"},{"Add":" int32_t calc_trace, test_trace;"},{"Add":""},{"Add":" patch = patches + i;"},{"Add":" total = 0;"},{"Add":""},{"Add":" VectorCopy(patch->origin, origin);"},{"Add":" plane = *patch->plane;"},{"Add":" if(!PvsForOrigin(patch->origin, pvs))"},{"Add":" return;"},{"Add":""},{"Add":" if(patch->area == 0)"},{"Add":" return;"},{"Add":" // find out which patches will collect light from patch"},{"Add":" patch->numtransfers = 0;"},{"Add":" calc_trace = (save_trace && memory && first_transfer);"},{"Add":" test_trace = (save_trace && memory && !first_transfer);"},{"Add":""},{"Add":" if(calc_trace) {"},{"Add":" memset(trace_buf, 0, trace_buf_size);"},{"Add":" } else if(test_trace) {"},{"Add":" DecompressBytes(trace_buf_size, patch->trace_hit, trace_buf);"},{"Add":" }"},{"Add":""},{"Add":" transfers = malloc(sizeof(*transfers) * num_patches);"},{"Add":""},{"Add":" for(j = 0, patch2 = patches; j < num_patches; j++, patch2++) {"},{"Add":" transfers[j] = 0;"},{"Add":""},{"Add":" if(j == i)"},{"Add":" continue;"},{"Add":""},{"Add":" if(patch2->area == 0)"},{"Add":" continue;"},{"Add":""},{"Add":" // check pvs bit"},{"Add":" if(!nopvs) {"},{"Add":" cluster = patch2->cluster;"},{"Add":" if(cluster == -1)"},{"Add":" continue;"},{"Add":" if(!(pvs[cluster >> 3] & (1 << (cluster & 7))))"},{"Add":" continue; // not in pvs"},{"Add":" }"},{"Add":" if(test_trace && !(trace_buf[TRACE_BYTE(j)] & TRACE_BIT(j)))"},{"Add":" continue;"},{"Add":""},{"Add":" // calculate vector"},{"Add":" VectorSubtract(patch2->origin, origin, delta);"},{"Add":" dist = VectorNormalize(delta, delta);"},{"Add":""},{"Add":" if(dist == 0) {"},{"Add":" continue;"},{"Add":" } else {"},{"Add":" dist = sqrt(dist);"},{"Add":" inv_dist = 1.0f / dist;"},{"Add":" delta[0] *= inv_dist;"},{"Add":" delta[1] *= inv_dist;"},{"Add":" delta[2] *= inv_dist;"},{"Add":" }"},{"Add":""},{"Add":" // relative angles"},{"Add":" float leaving_dot = DotProduct(delta, plane.normal);"},{"Add":" float incoming_dot = -DotProduct(delta, patch2->plane->normal);"},{"Add":" if(leaving_dot * incoming_dot <= 0)"},{"Add":" continue;"},{"Add":""},{"Add":" // check exact transfer"},{"Add":" scale = leaving_dot * incoming_dot;"},{"Add":" trans = scale * patch2->area * inv_dist * inv_dist;"},{"Add":""},{"Add":" if(trans > patch_cutoff) {"},{"Add":" if(!test_trace && !noblock && patch2->nodenum != patch->nodenum &&"},{"Add":" TestLine_r(lowestCommonNode(patch->nodenum, patch2->nodenum), patch->origin, patch2->origin)) {"},{"Add":" transfers[j] = 0;"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" transfers[j] = trans;"},{"Add":""},{"Add":" total += trans;"},{"Add":" patch->numtransfers++;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // copy the transfers out and normalize"},{"Add":" // total should be somewhere near PI if everything went right"},{"Add":" // because partial occlusion isn't accounted for, and nearby"},{"Add":" // patches have underestimated form factors, it will usually"},{"Add":" // be higher than PI"},{"Add":" if(patch->numtransfers) {"},{"Add":" transfer_t *t;"},{"Add":""},{"Add":" if(patch->numtransfers < 0 || patch->numtransfers > MAX_PATCHES_QBSP)"},{"Add":" Error(\"Weird numtransfers\");"},{"Add":" s = patch->numtransfers * sizeof(transfer_t);"},{"Add":" patch->transfers = malloc(s);"},{"Add":" total_mem += s;"},{"Add":" if(!patch->transfers)"},{"Add":" Error(\"Memory allocation failure\");"},{"Add":""},{"Add":" //"},{"Add":" // normalize all transfers so all of the light"},{"Add":" // is transfered to the surroundings"},{"Add":" //"},{"Add":" t = patch->transfers;"},{"Add":" itotal = 0;"},{"Add":" inv_total = 65536.0f / total;"},{"Add":" for(j = 0; j < num_patches; j++) {"},{"Add":" if(transfers[j] <= 0)"},{"Add":" continue;"},{"Add":" itrans = transfers[j] * inv_total;"},{"Add":" itotal += itrans;"},{"Add":" t->transfer = itrans;"},{"Add":" t->patch = j;"},{"Add":" t++;"},{"Add":" if(calc_trace) {"},{"Add":" trace_buf[TRACE_BYTE(j)] |= TRACE_BIT(j);"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if(calc_trace) {"},{"Add":" j = CompressBytes(trace_buf_size, trace_buf, trace_tmp);"},{"Add":" patch->trace_hit = malloc(j);"},{"Add":" memcpy(patch->trace_hit, trace_tmp, j);"},{"Add":""},{"Add":" trace_bytes += j;"},{"Add":" }"},{"Add":""},{"Add":" // don't bother locking around this. not that important."},{"Add":" total_transfer += patch->numtransfers;"},{"Add":""},{"Add":" // cleanup:"},{"Add":" free(transfers);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FreeTransfers"},{"Add":"============="},{"Add":"*/"},{"Add":"void FreeTransfers(void) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for(i = 0; i < num_patches; i++) {"},{"Add":" if(!memory) {"},{"Add":" free(patches[i].transfers);"},{"Add":" patches[i].transfers = NULL;"},{"Add":" } else if(patches[i].trace_hit != NULL) {"},{"Add":" free(patches[i].trace_hit);"},{"Add":" patches[i].trace_hit = NULL;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//==================================================================="},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"WriteWorld"},{"Add":"============="},{"Add":"*/"},{"Add":"void WriteWorld(char *name) {"},{"Add":" int32_t i, j;"},{"Add":" FILE *out;"},{"Add":" patch_t *patch;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" out = fopen(name, \"w\");"},{"Add":" if(!out)"},{"Add":" Error(\"Couldn't open %s\", name);"},{"Add":""},{"Add":" for(j = 0, patch = patches; j < num_patches; j++, patch++) {"},{"Add":" w = patch->winding;"},{"Add":" fprintf(out, \"%i\\n\", w->numpoints);"},{"Add":" for(i = 0; i < w->numpoints; i++) {"},{"Add":" fprintf(out, \"%5.2f %5.2f %5.2f %5.3f %5.3f %5.3f\\n\", w->p[i][0], w->p[i][1], w->p[i][2], patch->totallight.f[0],"},{"Add":" patch->totallight.f[4], patch->totallight.f[8]);"},{"Add":" }"},{"Add":" fprintf(out, \"\\n\");"},{"Add":" }"},{"Add":""},{"Add":" fclose(out);"},{"Add":"}"},{"Add":""},{"Add":"//=============================================================="},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"CollectLight"},{"Add":"============="},{"Add":"*/"},{"Add":"float CollectLight(void) {"},{"Add":" int32_t i, j;"},{"Add":" patch_t *patch;"},{"Add":" vec_t total;"},{"Add":""},{"Add":" total = 0;"},{"Add":""},{"Add":" for(i = 0, patch = patches; i < num_patches; i++, patch++) {"},{"Add":" // skys never collect light, it is just dropped"},{"Add":" if(patch->sky) {"},{"Add":" radiosity[i] = SH1_Clear();"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" vec3_t normal;"},{"Add":" VectorCopy(patch->plane->normal, normal);"},{"Add":""},{"Add":" struct SH1 illum = SH1_Reflect(illumination[i], normal);"},{"Add":""},{"Add":" patch->totallight = SH1_Add(patch->totallight, SH1_Scale(illum, 1.0f / patch->area));"},{"Add":""},{"Add":" radiosity[i] = SH1_ColorScale(illum, patch->reflectivity);"},{"Add":""},{"Add":" total += radiosity[i].f[0] + radiosity[i].f[4] + radiosity[i].f[8];"},{"Add":" }"},{"Add":""},{"Add":" memset(illumination, 0, sizeof(illumination[0]) * num_patches);"},{"Add":""},{"Add":" return total;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"ShootLight"},{"Add":""},{"Add":"Send light out to other patches"},{"Add":" Run multi-threaded"},{"Add":"============="},{"Add":"*/"},{"Add":"int32_t c_progress;"},{"Add":"int32_t p_progress;"},{"Add":"void ShootLight(int32_t patchnum) {"},{"Add":" int32_t k, l;"},{"Add":" transfer_t *trans;"},{"Add":" int32_t num;"},{"Add":" patch_t *patch;"},{"Add":" // vec3_t send;"},{"Add":""},{"Add":" // this is the amount of light we are distributing"},{"Add":" // prescale it so that multiplying by the 16 bit"},{"Add":" // transfer values gives a proper output value"},{"Add":" struct SH1 send = SH1_Scale(radiosity[patchnum], 1.0f / 0x10000);"},{"Add":""},{"Add":" patch = &patches[patchnum];"},{"Add":" if(memory) {"},{"Add":" c_progress = 10 * patchnum / num_patches;"},{"Add":""},{"Add":" if(c_progress != p_progress) {"},{"Add":" printf(\"%i...\", c_progress);"},{"Add":" p_progress = c_progress;"},{"Add":" }"},{"Add":""},{"Add":" MakeTransfers(patchnum);"},{"Add":" }"},{"Add":""},{"Add":" trans = patch->transfers;"},{"Add":" num = patch->numtransfers;"},{"Add":""},{"Add":" for(k = 0; k < num; k++, trans++) {"},{"Add":" vec3_t direction, color;"},{"Add":" VectorSubtract(patches[trans->patch].origin, patch->origin, direction);"},{"Add":" VectorNormalize(direction, direction);"},{"Add":" SH1_Sample(send, direction, color);"},{"Add":" illumination[trans->patch] ="},{"Add":" SH1_Add(illumination[trans->patch], SH1_Scale(SH1_FromDirectionalLight(direction, color), trans->transfer));"},{"Add":" // for (l = 0; l < 3; l++)"},{"Add":" // illumination[trans->patch][l] += send[l] * trans->transfer;"},{"Add":" }"},{"Add":" if(memory) {"},{"Add":" free(patches[patchnum].transfers);"},{"Add":" patches[patchnum].transfers = NULL;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"BounceLight"},{"Add":"============="},{"Add":"*/"},{"Add":"void BounceLight(void) {"},{"Add":" int32_t i, j, start = 0, stop;"},{"Add":" float added;"},{"Add":" char name[64];"},{"Add":" patch_t *p;"},{"Add":""},{"Add":" for(i = 0; i < num_patches; i++) {"},{"Add":" p = &patches[i];"},{"Add":" // for (j = 0; j < 3; j++) {"},{"Add":" //\t\t\tp->totallight[j] = p->samplelight[j];"},{"Add":" // radiosity[i][j] = p->samplelight[j] * p->reflectivity[j] * p->area;"},{"Add":" // }"},{"Add":" radiosity[i] = SH1_Scale(SH1_ColorScale(p->samplelight, p->reflectivity), p->area);"},{"Add":" }"},{"Add":""},{"Add":" if(memory)"},{"Add":" trace_buf_size = (num_patches + 7) / 8;"},{"Add":""},{"Add":" for(i = 0; i < numbounce; i++) {"},{"Add":" if(memory) {"},{"Add":" p_progress = -1;"},{"Add":" start = I_FloatTime();"},{"Add":" printf(\"[%d remaining] \", numbounce - i);"},{"Add":" total_mem = 0;"},{"Add":" }"},{"Add":" RunThreadsOnIndividual(num_patches, false, ShootLight);"},{"Add":" first_transfer = 0;"},{"Add":" if(memory) {"},{"Add":" stop = I_FloatTime();"},{"Add":" printf(\" (%i)\\n\", stop - start);"},{"Add":" }"},{"Add":" added = CollectLight();"},{"Add":""},{"Add":" qprintf(\"bounce:%i added:%f\\n\", i, added);"},{"Add":" if(dumppatches && (i == 0 || i == numbounce - 1)) {"},{"Add":" sprintf(name, \"bounce%i.txt\", i);"},{"Add":" WriteWorld(name);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//=============================================================="},{"Add":""},{"Add":"void CheckPatches(void) {"},{"Add":" int32_t i;"},{"Add":" patch_t *patch;"},{"Add":""},{"Add":" for(i = 0; i < num_patches; i++) {"},{"Add":" patch = &patches[i];"},{"Add":" if(patch->totallight.f[0] < 0 || patch->totallight.f[4] < 0 || patch->totallight.f[8] < 0)"},{"Add":" Error(\"negative patch totallight\\n\");"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"RadWorld"},{"Add":"============="},{"Add":"*/"},{"Add":"void RadWorld(void) {"},{"Add":" if(numnodes == 0 || numfaces == 0)"},{"Add":" Error(\"Empty map\");"},{"Add":" MakeBackplanes();"},{"Add":" MakeParents(0, -1);"},{"Add":" MakeTnodes(&dmodels[0]);"},{"Add":""},{"Add":" // turn each face into a single patch"},{"Add":" MakePatches();"},{"Add":""},{"Add":" // subdivide patches to a maximum dimension"},{"Add":" SubdividePatches();"},{"Add":""},{"Add":" BuildFaceExtents(); // qb: from quetoo"},{"Add":" // create directlights out of patches and lights"},{"Add":" CreateDirectLights();"},{"Add":" PairEdges(); // qb: moved here for phong"},{"Add":""},{"Add":" // build initial facelights"},{"Add":" RunThreadsOnIndividual(numfaces, true, BuildFacelights);"},{"Add":""},{"Add":" if(numbounce > 0) {"},{"Add":" // build transfer lists"},{"Add":" if(!memory) {"},{"Add":" RunThreadsOnIndividual(num_patches, true, MakeTransfers);"},{"Add":" qprintf(\"transfer lists: %5.1f megs\\n\", (float)total_transfer * sizeof(transfer_t) / (1024 * 1024));"},{"Add":" }"},{"Add":" numthreads = 1;"},{"Add":""},{"Add":" // spread light around"},{"Add":" BounceLight();"},{"Add":""},{"Add":" FreeTransfers();"},{"Add":""},{"Add":" CheckPatches();"},{"Add":" } else"},{"Add":" numthreads = 1;"},{"Add":""},{"Add":" if(memory) {"},{"Add":" printf(\"Non-memory conservation would require %4.1f\\n\", (float)(total_mem - trace_bytes) / 1048576.0f);"},{"Add":" printf(\" megabytes more memory then currently used\\n\");"},{"Add":" }"},{"Add":""},{"Add":" // blend bounced light into direct light and save"},{"Add":" LinkPlaneFaces();"},{"Add":""},{"Add":" lightdatasize = 0;"},{"Add":" RunThreadsOnIndividual(numfaces, true, FinalLightFace);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"========"},{"Add":"main"},{"Add":""},{"Add":"light modelfile"},{"Add":"========"},{"Add":"*/"},{"Add":"void RAD_ProcessArgument(const char *arg) {"},{"Add":" double start, end;"},{"Add":" char *name;"},{"Add":" char *tgamedir = \"\";"},{"Add":" char *tbasedir = \"\";"},{"Add":" char *tmoddir = \"\";"},{"Add":""},{"Add":" patches = malloc(sizeof(*patches) * MAX_PATCHES_QBSP);"},{"Add":""},{"Add":" start = I_FloatTime();"},{"Add":""},{"Add":" strcpy(source, ExpandArg(arg));"},{"Add":""},{"Add":" StripExtension(source);"},{"Add":" DefaultExtension(source, \".bsp\");"},{"Add":""},{"Add":" //\tReadLightFile ();"},{"Add":" name = (char *)malloc(strlen(inbase) + strlen(source) + 1);"},{"Add":" sprintf(name, \"%s%s\", inbase, source);"},{"Add":" printf(\"reading %s\\n\", name);"},{"Add":" LoadBSPFile(name);"},{"Add":" dlightdata_ptr = dlightdata;"},{"Add":" if(use_qbsp) {"},{"Add":" maxdata = MAX_MAP_LIGHTING_QBSP;"},{"Add":" step = QBSP_LMSTEP;"},{"Add":" }"},{"Add":" ParseEntities();"},{"Add":" CalcTextureReflectivity();"},{"Add":""},{"Add":" if(!visdatasize) {"},{"Add":" printf(\"No vis information, direct lighting only.\\n\");"},{"Add":" numbounce = 0;"},{"Add":" ambient = 0.1;"},{"Add":" }"},{"Add":""},{"Add":" RadWorld();"},{"Add":""},{"Add":" if(smoothing_threshold > 0.0) {"},{"Add":" printf(\"Smoothing edges found: %i\\n\", num_smoothing);"},{"Add":" }"},{"Add":""},{"Add":" sprintf(name, \"%s%s\", outbase, source);"},{"Add":" printf(\"writing %s\\n\", name);"},{"Add":" WriteBSPFile(name);"},{"Add":""},{"Add":" end = I_FloatTime();"},{"Add":" printf(\"%5.0f seconds elapsed\\n\", end - start);"},{"Add":" printf(\"%i bytes light data used of %i max.\\n\", lightdatasize, maxdata);"},{"Add":""},{"Add":" PrintBSPFileSizes();"},{"Add":" printf(\"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< END 4rad >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":""},{"Add":" free(patches);"},{"Add":" patches = NULL;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4bsp","metadata":576},"context":[{"change":0,"pos":17}],"contents":[]}},{"FileAdd":{"meta":{"basename":"writebsp.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"int32_t c_nofaces;"},{"Add":"int32_t c_facenodes;"},{"Add":""},{"Add":"/*"},{"Add":"========================================================="},{"Add":""},{"Add":"ONLY SAVE OUT PLANES THAT ARE ACTUALLY USED AS NODES"},{"Add":""},{"Add":"========================================================="},{"Add":"*/"},{"Add":""},{"Add":"int32_t planeused[MAX_MAP_PLANES_QBSP];"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"EmitPlanes"},{"Add":""},{"Add":"There is no oportunity to discard planes, because all of the original"},{"Add":"brushes will be saved in the map."},{"Add":"============"},{"Add":"*/"},{"Add":"void EmitPlanes(void) {"},{"Add":" int32_t i;"},{"Add":" dplane_t *dp;"},{"Add":" plane_t *mp;"},{"Add":""},{"Add":" mp = mapplanes;"},{"Add":" for (i = 0; i < nummapplanes; i++, mp++) {"},{"Add":" dp = &dplanes[numplanes];"},{"Add":" VectorCopy(mp->normal, dp->normal);"},{"Add":" dp->dist = mp->dist;"},{"Add":" dp->type = mp->type;"},{"Add":" numplanes++;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//========================================================"},{"Add":""},{"Add":"void EmitMarkFace(dleaf_t *leaf_p, face_t *f) {"},{"Add":" int32_t i;"},{"Add":" int32_t facenum;"},{"Add":""},{"Add":" while (f->merged)"},{"Add":" f = f->merged;"},{"Add":""},{"Add":" if (f->split[0]) {"},{"Add":" EmitMarkFace(leaf_p, f->split[0]);"},{"Add":" EmitMarkFace(leaf_p, f->split[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" facenum = f->outputnumber;"},{"Add":" if (facenum == -1)"},{"Add":" return; // degenerate face"},{"Add":""},{"Add":" if (facenum < 0 || facenum >= numfaces)"},{"Add":" Error(\"Bad leafface\");"},{"Add":" for (i = leaf_p->firstleafface; i < numleaffaces; i++)"},{"Add":" if (dleaffaces[i] == facenum)"},{"Add":" break; // merged out face"},{"Add":" if (i == numleaffaces) {"},{"Add":" if (numleaffaces >= MAX_MAP_LEAFFACES)"},{"Add":" Error(\"MAX_MAP_LEAFFACES\");"},{"Add":""},{"Add":" dleaffaces[numleaffaces] = facenum;"},{"Add":" numleaffaces++;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void EmitMarkFaceX(dleaf_tx *leaf_p, face_t *f) {"},{"Add":" int32_t i;"},{"Add":" int32_t facenum;"},{"Add":""},{"Add":" while (f->merged)"},{"Add":" f = f->merged;"},{"Add":""},{"Add":" if (f->split[0]) {"},{"Add":" EmitMarkFaceX(leaf_p, f->split[0]);"},{"Add":" EmitMarkFaceX(leaf_p, f->split[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" facenum = f->outputnumber;"},{"Add":" if (facenum == -1)"},{"Add":" return; // degenerate face"},{"Add":""},{"Add":" if (facenum < 0 || facenum >= numfaces)"},{"Add":" Error(\"Bad leafface\");"},{"Add":" for (i = leaf_p->firstleafface; i < numleaffaces; i++)"},{"Add":" if (dleaffacesX[i] == facenum)"},{"Add":" break; // merged out face"},{"Add":" if (i == numleaffaces) {"},{"Add":" if (numleaffaces >= MAX_MAP_LEAFFACES_QBSP)"},{"Add":" Error(\"MAX_MAP_LEAFFACES_QBSP\");"},{"Add":""},{"Add":" dleaffacesX[numleaffaces] = facenum;"},{"Add":" numleaffaces++;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"EmitLeaf"},{"Add":"=================="},{"Add":"*/"},{"Add":"void EmitLeaf(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":" face_t *f;"},{"Add":" bspbrush_t *b;"},{"Add":" int32_t i;"},{"Add":" int32_t brushnum;"},{"Add":""},{"Add":" // emit a leaf"},{"Add":" if (use_qbsp) // qb: qbsp"},{"Add":" {"},{"Add":" dleaf_tx *leaf_p;"},{"Add":" if (numleafs >= MAX_MAP_LEAFS_QBSP)"},{"Add":" Error(\"MAX_MAP_LEAFS_QBSP\");"},{"Add":""},{"Add":" leaf_p = &dleafsX[numleafs];"},{"Add":" numleafs++;"},{"Add":""},{"Add":" leaf_p->contents = node->contents;"},{"Add":" leaf_p->cluster = node->cluster;"},{"Add":" leaf_p->area = node->area;"},{"Add":""},{"Add":" //"},{"Add":" // write bounding box info"},{"Add":" //"},{"Add":" VectorCopy(node->mins, leaf_p->mins);"},{"Add":" VectorCopy(node->maxs, leaf_p->maxs);"},{"Add":""},{"Add":" //"},{"Add":" // write the leafbrushes"},{"Add":" //"},{"Add":" leaf_p->firstleafbrush = numleafbrushes;"},{"Add":" for (b = node->brushlist; b; b = b->next) {"},{"Add":" if (numleafbrushes >= MAX_MAP_LEAFBRUSHES_QBSP)"},{"Add":" Error(\"MAX_MAP_LEAFBRUSHES_QBSP\");"},{"Add":""},{"Add":" brushnum = b->original - mapbrushes;"},{"Add":" for (i = leaf_p->firstleafbrush; i < numleafbrushes; i++)"},{"Add":" if (dleafbrushesX[i] == brushnum)"},{"Add":" break;"},{"Add":" if (i == numleafbrushes) {"},{"Add":" dleafbrushesX[numleafbrushes] = brushnum;"},{"Add":" numleafbrushes++;"},{"Add":" }"},{"Add":" }"},{"Add":" leaf_p->numleafbrushes = numleafbrushes - leaf_p->firstleafbrush;"},{"Add":""},{"Add":" //"},{"Add":" // write the leaffaces"},{"Add":" //"},{"Add":" if (leaf_p->contents & CONTENTS_SOLID)"},{"Add":" return; // no leaffaces in solids"},{"Add":""},{"Add":" leaf_p->firstleafface = numleaffaces;"},{"Add":""},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":" f = p->face[s];"},{"Add":" if (!f)"},{"Add":" continue; // not a visible portal"},{"Add":""},{"Add":" EmitMarkFaceX(leaf_p, f);"},{"Add":" }"},{"Add":""},{"Add":" leaf_p->numleaffaces = numleaffaces - leaf_p->firstleafface;"},{"Add":" }"},{"Add":""},{"Add":" else {"},{"Add":" dleaf_t *leaf_p;"},{"Add":" if (numleafs >= MAX_MAP_LEAFS)"},{"Add":" Error(\"MAX_MAP_LEAFS\");"},{"Add":""},{"Add":" leaf_p = &dleafs[numleafs];"},{"Add":" numleafs++;"},{"Add":""},{"Add":" leaf_p->contents = node->contents;"},{"Add":" leaf_p->cluster = node->cluster;"},{"Add":" leaf_p->area = node->area;"},{"Add":""},{"Add":" //"},{"Add":" // write bounding box info"},{"Add":" //"},{"Add":" VectorCopy(node->mins, leaf_p->mins);"},{"Add":" VectorCopy(node->maxs, leaf_p->maxs);"},{"Add":""},{"Add":" //"},{"Add":" // write the leafbrushes"},{"Add":" //"},{"Add":" leaf_p->firstleafbrush = numleafbrushes;"},{"Add":" for (b = node->brushlist; b; b = b->next) {"},{"Add":" if (numleafbrushes >= MAX_MAP_LEAFBRUSHES)"},{"Add":" Error(\"MAX_MAP_LEAFBRUSHES\");"},{"Add":""},{"Add":" brushnum = b->original - mapbrushes;"},{"Add":" for (i = leaf_p->firstleafbrush; i < numleafbrushes; i++)"},{"Add":" if (dleafbrushes[i] == brushnum)"},{"Add":" break;"},{"Add":" if (i == numleafbrushes) {"},{"Add":" dleafbrushes[numleafbrushes] = brushnum;"},{"Add":" numleafbrushes++;"},{"Add":" }"},{"Add":" }"},{"Add":" leaf_p->numleafbrushes = numleafbrushes - leaf_p->firstleafbrush;"},{"Add":""},{"Add":" //"},{"Add":" // write the leaffaces"},{"Add":" //"},{"Add":" if (leaf_p->contents & CONTENTS_SOLID)"},{"Add":" return; // no leaffaces in solids"},{"Add":""},{"Add":" leaf_p->firstleafface = numleaffaces;"},{"Add":""},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":" f = p->face[s];"},{"Add":" if (!f)"},{"Add":" continue; // not a visible portal"},{"Add":""},{"Add":" EmitMarkFace(leaf_p, f);"},{"Add":" }"},{"Add":""},{"Add":" leaf_p->numleaffaces = numleaffaces - leaf_p->firstleafface;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"EmitFace"},{"Add":"=================="},{"Add":"*/"},{"Add":"void EmitFace(face_t *f) {"},{"Add":" int32_t i;"},{"Add":" int32_t e;"},{"Add":""},{"Add":" f->outputnumber = -1;"},{"Add":""},{"Add":" if (f->numpoints < 3) {"},{"Add":" return; // degenerated"},{"Add":" }"},{"Add":" if (f->merged || f->split[0] || f->split[1]) {"},{"Add":" return; // not a final face"},{"Add":" }"},{"Add":""},{"Add":" // save output number so leaffaces can use"},{"Add":" f->outputnumber = numfaces;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dface_tx *df;"},{"Add":" if (numfaces >= MAX_MAP_FACES_QBSP)"},{"Add":" Error(\"numfaces == MAX_MAP_FACES_QBSP\");"},{"Add":" df = &dfacesX[numfaces];"},{"Add":" numfaces++;"},{"Add":""},{"Add":" // planenum is used by qlight, but not the engine"},{"Add":" df->planenum = f->planenum & (~1);"},{"Add":" df->side = f->planenum & 1;"},{"Add":""},{"Add":" df->firstedge = numsurfedges;"},{"Add":" df->numedges = f->numpoints;"},{"Add":" df->texinfo = f->texinfo;"},{"Add":" for (i = 0; i < f->numpoints; i++) {"},{"Add":" e = GetEdge(f->vertexnums[i], f->vertexnums[(i + 1) % f->numpoints], f);"},{"Add":" if (numsurfedges >= MAX_MAP_SURFEDGES_QBSP)"},{"Add":" Error(\"numsurfedges == MAX_MAP_SURFEDGES_QBSP\");"},{"Add":" dsurfedges[numsurfedges] = e;"},{"Add":" numsurfedges++;"},{"Add":" }"},{"Add":" } else {"},{"Add":" dface_t *df;"},{"Add":" if (numfaces >= MAX_MAP_FACES)"},{"Add":" Error(\"numfaces == MAX_MAP_FACES\");"},{"Add":" df = &dfaces[numfaces];"},{"Add":" numfaces++;"},{"Add":""},{"Add":" // planenum is used by qlight, but not the engine"},{"Add":" df->planenum = f->planenum & (~1);"},{"Add":" df->side = f->planenum & 1;"},{"Add":""},{"Add":" df->firstedge = numsurfedges;"},{"Add":" df->numedges = f->numpoints;"},{"Add":" df->texinfo = f->texinfo;"},{"Add":" for (i = 0; i < f->numpoints; i++) {"},{"Add":" e = GetEdge(f->vertexnums[i], f->vertexnums[(i + 1) % f->numpoints], f);"},{"Add":" if (numsurfedges >= MAX_MAP_SURFEDGES)"},{"Add":" Error(\"numsurfedges == MAX_MAP_SURFEDGES\");"},{"Add":" dsurfedges[numsurfedges] = e;"},{"Add":" numsurfedges++;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"EmitDrawingNode_r"},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t EmitDrawNode_r(node_t *node) {"},{"Add":" face_t *f;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF) {"},{"Add":" EmitLeaf(node);"},{"Add":" return -numleafs;"},{"Add":" }"},{"Add":""},{"Add":" // emit a node"},{"Add":" if (use_qbsp) {"},{"Add":" dnode_tx *n;"},{"Add":" if (numnodes == MAX_MAP_NODES_QBSP)"},{"Add":" Error(\"MAX_MAP_NODES_QBSP\");"},{"Add":" n = &dnodesX[numnodes];"},{"Add":" numnodes++;"},{"Add":""},{"Add":" VectorCopy(node->mins, n->mins);"},{"Add":" VectorCopy(node->maxs, n->maxs);"},{"Add":""},{"Add":" planeused[node->planenum]++;"},{"Add":" planeused[node->planenum ^ 1]++;"},{"Add":""},{"Add":" if (node->planenum & 1)"},{"Add":" Error(\"WriteDrawNodes_r: odd planenum\");"},{"Add":" n->planenum = node->planenum;"},{"Add":" n->firstface = numfaces;"},{"Add":""},{"Add":" if (!node->faces)"},{"Add":" c_nofaces++;"},{"Add":" else"},{"Add":" c_facenodes++;"},{"Add":""},{"Add":" for (f = node->faces; f; f = f->next)"},{"Add":" EmitFace(f);"},{"Add":""},{"Add":" n->numfaces = numfaces - n->firstface;"},{"Add":""},{"Add":" // recursively output the other nodes"},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" if (node->children[i]->planenum == PLANENUM_LEAF) {"},{"Add":" n->children[i] = -(numleafs + 1);"},{"Add":" EmitLeaf(node->children[i]);"},{"Add":" } else {"},{"Add":" n->children[i] = numnodes;"},{"Add":" EmitDrawNode_r(node->children[i]);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return n - dnodesX;"},{"Add":" }"},{"Add":""},{"Add":" else // ibsp"},{"Add":" {"},{"Add":" dnode_t *n;"},{"Add":" if (numnodes == MAX_MAP_NODES)"},{"Add":" Error(\"MAX_MAP_NODES\");"},{"Add":" n = &dnodes[numnodes];"},{"Add":" numnodes++;"},{"Add":""},{"Add":" VectorCopy(node->mins, n->mins);"},{"Add":" VectorCopy(node->maxs, n->maxs);"},{"Add":""},{"Add":" planeused[node->planenum]++;"},{"Add":" planeused[node->planenum ^ 1]++;"},{"Add":""},{"Add":" if (node->planenum & 1)"},{"Add":" Error(\"WriteDrawNodes_r: odd planenum\");"},{"Add":" n->planenum = node->planenum;"},{"Add":" n->firstface = numfaces;"},{"Add":""},{"Add":" if (!node->faces)"},{"Add":" c_nofaces++;"},{"Add":" else"},{"Add":" c_facenodes++;"},{"Add":""},{"Add":" for (f = node->faces; f; f = f->next)"},{"Add":" EmitFace(f);"},{"Add":""},{"Add":" n->numfaces = numfaces - n->firstface;"},{"Add":""},{"Add":" // recursively output the other nodes"},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" if (node->children[i]->planenum == PLANENUM_LEAF) {"},{"Add":" n->children[i] = -(numleafs + 1);"},{"Add":" EmitLeaf(node->children[i]);"},{"Add":" } else {"},{"Add":" n->children[i] = numnodes;"},{"Add":" EmitDrawNode_r(node->children[i]);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return n - dnodes;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//========================================================="},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"WriteBSP"},{"Add":"============"},{"Add":"*/"},{"Add":"void WriteBSP(node_t *headnode) {"},{"Add":" int32_t oldfaces;"},{"Add":""},{"Add":" c_nofaces = 0;"},{"Add":" c_facenodes = 0;"},{"Add":""},{"Add":" qprintf(\"--- WriteBSP ---\\n\");"},{"Add":" oldfaces = numfaces;"},{"Add":" dmodels[nummodels].headnode = EmitDrawNode_r(headnode);"},{"Add":" EmitAreaPortals(headnode);"},{"Add":""},{"Add":" qprintf(\"%5i nodes with faces\\n\", c_facenodes);"},{"Add":" qprintf(\"%5i nodes without faces\\n\", c_nofaces);"},{"Add":" qprintf(\"%5i faces\\n\", numfaces - oldfaces);"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================="},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"SetModelNumbers"},{"Add":"============"},{"Add":"*/"},{"Add":"void SetModelNumbers(void) {"},{"Add":" int32_t i;"},{"Add":" int32_t models;"},{"Add":" char value[12];"},{"Add":""},{"Add":" models = 1;"},{"Add":" for (i = 1; i < num_entities; i++) {"},{"Add":" if (entities[i].numbrushes) {"},{"Add":" sprintf(value, \"*%i\", models);"},{"Add":" models++;"},{"Add":" SetKeyValue(&entities[i], \"model\", value);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"SetLightStyles"},{"Add":"============"},{"Add":"*/"},{"Add":"#define MAX_SWITCHED_LIGHTS 32"},{"Add":"void SetLightStyles(void) {"},{"Add":" int32_t stylenum;"},{"Add":" char *t;"},{"Add":" entity_t *e;"},{"Add":" int32_t i, j;"},{"Add":" char value[11];"},{"Add":" char lighttargets[MAX_SWITCHED_LIGHTS][64];"},{"Add":""},{"Add":" // any light that is controlled (has a targetname)"},{"Add":" // must have a unique style number generated for it"},{"Add":""},{"Add":" stylenum = 0;"},{"Add":" for (i = 1; i < num_entities; i++) {"},{"Add":" e = &entities[i];"},{"Add":""},{"Add":" t = ValueForKey(e, \"classname\");"},{"Add":" if (Q_strncasecmp(t, \"light\", 5))"},{"Add":" continue;"},{"Add":" t = ValueForKey(e, \"targetname\");"},{"Add":" if (!t[0])"},{"Add":" continue;"},{"Add":""},{"Add":" // find this targetname"},{"Add":" for (j = 0; j < stylenum; j++)"},{"Add":" if (!strcmp(lighttargets[j], t))"},{"Add":" break;"},{"Add":" if (j == stylenum) {"},{"Add":" if (stylenum == MAX_SWITCHED_LIGHTS)"},{"Add":" Error(\"stylenum == MAX_SWITCHED_LIGHTS\");"},{"Add":" strcpy(lighttargets[j], t);"},{"Add":" stylenum++;"},{"Add":" }"},{"Add":" sprintf(value, \"%i\", 32 + j);"},{"Add":" SetKeyValue(e, \"style\", value);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================="},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"EmitBrushes"},{"Add":"============"},{"Add":"*/"},{"Add":"void EmitBrushes(void) {"},{"Add":" int32_t i, j, bnum, s, x;"},{"Add":" dbrush_t *db;"},{"Add":" mapbrush_t *b;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":" int32_t planenum;"},{"Add":""},{"Add":" numbrushsides = 0;"},{"Add":" numbrushes = nummapbrushes;"},{"Add":""},{"Add":" for (bnum = 0; bnum < nummapbrushes; bnum++) {"},{"Add":" b = &mapbrushes[bnum];"},{"Add":" db = &dbrushes[bnum];"},{"Add":""},{"Add":" db->contents = b->contents;"},{"Add":" db->firstside = numbrushsides;"},{"Add":" db->numsides = b->numsides;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" dbrushside_tx *cp;"},{"Add":" for (j = 0; j < b->numsides; j++) {"},{"Add":" if (numbrushsides == MAX_MAP_BRUSHSIDES_QBSP)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES_QBSP\");"},{"Add":" cp = &dbrushsidesX[numbrushsides];"},{"Add":" numbrushsides++;"},{"Add":" cp->planenum = b->original_sides[j].planenum;"},{"Add":" cp->texinfo = b->original_sides[j].texinfo;"},{"Add":" }"},{"Add":" } else {"},{"Add":" for (j = 0; j < b->numsides; j++) {"},{"Add":" dbrushside_t *cp;"},{"Add":" if (numbrushsides == MAX_MAP_BRUSHSIDES)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES\");"},{"Add":" cp = &dbrushsides[numbrushsides];"},{"Add":" numbrushsides++;"},{"Add":" cp->planenum = b->original_sides[j].planenum;"},{"Add":" cp->texinfo = b->original_sides[j].texinfo;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // add any axis planes not contained in the brush to bevel off corners"},{"Add":" for (x = 0; x < 3; x++)"},{"Add":" for (s = -1; s <= 1; s += 2) {"},{"Add":" // add the plane"},{"Add":" VectorCopy(vec3_origin, normal);"},{"Add":" normal[x] = s;"},{"Add":" if (s == -1)"},{"Add":" dist = -b->mins[x];"},{"Add":" else"},{"Add":" dist = b->maxs[x];"},{"Add":" planenum = FindFloatPlane(normal, dist, b->brushnum);"},{"Add":" for (i = 0; i < b->numsides; i++)"},{"Add":" if (b->original_sides[i].planenum == planenum)"},{"Add":" break;"},{"Add":" if (i == b->numsides) {"},{"Add":" if (use_qbsp) {"},{"Add":" if (numbrushsides >= MAX_MAP_BRUSHSIDES_QBSP)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES_QBSP\");"},{"Add":" dbrushsidesX[numbrushsides].planenum = planenum;"},{"Add":" dbrushsidesX[numbrushsides].texinfo = dbrushsidesX[numbrushsides - 1].texinfo;"},{"Add":""},{"Add":" } else {"},{"Add":" if (numbrushsides >= MAX_MAP_BRUSHSIDES)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES\");"},{"Add":" dbrushsides[numbrushsides].planenum = planenum;"},{"Add":" dbrushsides[numbrushsides].texinfo = dbrushsides[numbrushsides - 1].texinfo;"},{"Add":" }"},{"Add":" numbrushsides++;"},{"Add":" db->numsides++;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================="},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BeginBSPFile"},{"Add":"=================="},{"Add":"*/"},{"Add":"void BeginBSPFile(void) {"},{"Add":" // these values may actually be initialized"},{"Add":" // if the file existed when loaded, so clear them explicitly"},{"Add":" nummodels = 0;"},{"Add":" numfaces = 0;"},{"Add":" numnodes = 0;"},{"Add":" numbrushsides = 0;"},{"Add":" numvertexes = 0;"},{"Add":" numleaffaces = 0;"},{"Add":" numleafbrushes = 0;"},{"Add":" numsurfedges = 0;"},{"Add":""},{"Add":" // edge 0 is not used, because 0 can't be negated"},{"Add":" numedges = 1;"},{"Add":""},{"Add":" // leave vertex 0 as an error"},{"Add":" numvertexes = 1;"},{"Add":""},{"Add":" // leave leaf 0 as an error"},{"Add":" numleafs = 1;"},{"Add":" dleafs[0].contents = CONTENTS_SOLID;"},{"Add":" dleafsX[0].contents = CONTENTS_SOLID;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"EndBSPFile"},{"Add":"============"},{"Add":"*/"},{"Add":"void EndBSPFile(void) {"},{"Add":" char path[1030];"},{"Add":""},{"Add":" EmitBrushes();"},{"Add":" EmitPlanes();"},{"Add":" UnparseEntities();"},{"Add":""},{"Add":" // load the pop"},{"Add":"#if 0"},{"Add":" sprintf (path, \"%s/pics/pop.lmp\", gamedir);"},{"Add":" len = LoadFile (path, &buf);"},{"Add":" memcpy (dpop, buf, sizeof(dpop));"},{"Add":" free (buf);"},{"Add":"#endif"},{"Add":""},{"Add":" // write the map"},{"Add":" sprintf(path, \"%s.bsp\", source);"},{"Add":" WriteBSPFile(path);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BeginModel"},{"Add":"=================="},{"Add":"*/"},{"Add":"int32_t firstmodleaf;"},{"Add":"extern int32_t firstmodeledge;"},{"Add":"extern int32_t firstmodelface;"},{"Add":"void BeginModel(void) {"},{"Add":" dmodel_t *mod;"},{"Add":" int32_t start, end;"},{"Add":" mapbrush_t *b;"},{"Add":" int32_t j;"},{"Add":" entity_t *e;"},{"Add":" vec3_t mins, maxs;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (nummodels == WARN_MAP_MODELS_QBSP)"},{"Add":" printf(\"WARNING: nummodels may exceed protocol limit (%i)\\n\", WARN_MAP_MODELS_QBSP);"},{"Add":" if (nummodels == MAX_MAP_MODELS_QBSP)"},{"Add":" Error(\"nummodels exceeds MAX_MAP_MODELS_QBSP\");"},{"Add":" } else if (nummodels == MAX_MAP_MODELS)"},{"Add":" Error(\"nummodels exceeds MAX_MAP_MODELS\");"},{"Add":""},{"Add":" mod = &dmodels[nummodels];"},{"Add":""},{"Add":" mod->firstface = numfaces;"},{"Add":""},{"Add":" firstmodleaf = numleafs;"},{"Add":" firstmodeledge = numedges;"},{"Add":" firstmodelface = numfaces;"},{"Add":""},{"Add":" //"},{"Add":" // bound the brushes"},{"Add":" //"},{"Add":" e = &entities[entity_num];"},{"Add":""},{"Add":" start = e->firstbrush;"},{"Add":" end = start + e->numbrushes;"},{"Add":" ClearBounds(mins, maxs);"},{"Add":""},{"Add":" for (j = start; j < end; j++) {"},{"Add":" b = &mapbrushes[j];"},{"Add":" if (!b->numsides)"},{"Add":" continue; // not a real brush (origin brush)"},{"Add":" AddPointToBounds(b->mins, mins, maxs);"},{"Add":" AddPointToBounds(b->maxs, mins, maxs);"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(mins, mod->mins);"},{"Add":" VectorCopy(maxs, mod->maxs);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"EndModel"},{"Add":"=================="},{"Add":"*/"},{"Add":"void EndModel(void) {"},{"Add":" dmodel_t *mod;"},{"Add":""},{"Add":" mod = &dmodels[nummodels];"},{"Add":""},{"Add":" mod->numfaces = numfaces - mod->firstface;"},{"Add":""},{"Add":" nummodels++;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"tree.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"extern int32_t c_nodes;"},{"Add":""},{"Add":"void RemovePortalFromNode(portal_t *portal, node_t *l);"},{"Add":""},{"Add":"node_t *NodeForPoint(node_t *node, vec3_t origin) {"},{"Add":" plane_t *plane;"},{"Add":" vec_t d;"},{"Add":""},{"Add":" while (node->planenum != PLANENUM_LEAF) {"},{"Add":" plane = &mapplanes[node->planenum];"},{"Add":" d = DotProduct(origin, plane->normal) - plane->dist;"},{"Add":" if (d >= 0)"},{"Add":" node = node->children[0];"},{"Add":" else"},{"Add":" node = node->children[1];"},{"Add":" }"},{"Add":""},{"Add":" return node;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FreeTreePortals_r"},{"Add":"============="},{"Add":"*/"},{"Add":"void FreeTreePortals_r(node_t *node) {"},{"Add":" portal_t *p, *nextp;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" // free children"},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" FreeTreePortals_r(node->children[0]);"},{"Add":" FreeTreePortals_r(node->children[1]);"},{"Add":" }"},{"Add":""},{"Add":" // free portals"},{"Add":" for (p = node->portals; p; p = nextp) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":" nextp = p->next[s];"},{"Add":""},{"Add":" RemovePortalFromNode(p, p->nodes[!s]);"},{"Add":" FreePortal(p);"},{"Add":" }"},{"Add":" node->portals = NULL;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FreeTree_r"},{"Add":"============="},{"Add":"*/"},{"Add":"void FreeTree_r(node_t *node) {"},{"Add":" face_t *f, *nextf;"},{"Add":""},{"Add":" // free children"},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" FreeTree_r(node->children[0]);"},{"Add":" FreeTree_r(node->children[1]);"},{"Add":" }"},{"Add":""},{"Add":" // free bspbrushes"},{"Add":" FreeBrushList(node->brushlist);"},{"Add":""},{"Add":" // free faces"},{"Add":" for (f = node->faces; f; f = nextf) {"},{"Add":" nextf = f->next;"},{"Add":" FreeFace(f);"},{"Add":" }"},{"Add":""},{"Add":" // free the node"},{"Add":" if (node->volume)"},{"Add":" FreeBrush(node->volume);"},{"Add":""},{"Add":" if (numthreads == 1)"},{"Add":" c_nodes--;"},{"Add":" free(node);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FreeTree"},{"Add":"============="},{"Add":"*/"},{"Add":"void FreeTree(tree_t *tree) {"},{"Add":" FreeTreePortals_r(tree->headnode);"},{"Add":" FreeTree_r(tree->headnode);"},{"Add":" free(tree);"},{"Add":"}"},{"Add":""},{"Add":"//==============================================================="},{"Add":""},{"Add":"void PrintTree_r(node_t *node, int32_t depth) {"},{"Add":" int32_t i;"},{"Add":" plane_t *plane;"},{"Add":" bspbrush_t *bb;"},{"Add":""},{"Add":" for (i = 0; i < depth; i++)"},{"Add":" printf(\" \");"},{"Add":" if (node->planenum == PLANENUM_LEAF) {"},{"Add":" if (!node->brushlist)"},{"Add":" printf(\"NULL\\n\");"},{"Add":" else {"},{"Add":" for (bb = node->brushlist; bb; bb = bb->next)"},{"Add":" printf(\"%i \", bb->original->brushnum);"},{"Add":" printf(\"\\n\");"},{"Add":" }"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" plane = &mapplanes[node->planenum];"},{"Add":" printf(\"#%i (%5.2f %5.2f %5.2f):%5.2f\\n\", node->planenum,"},{"Add":" plane->normal[0], plane->normal[1], plane->normal[2],"},{"Add":" plane->dist);"},{"Add":" PrintTree_r(node->children[0], depth + 1);"},{"Add":" PrintTree_r(node->children[1], depth + 1);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"========================================================="},{"Add":""},{"Add":"NODES THAT DON'T SEPERATE DIFFERENT CONTENTS CAN BE PRUNED"},{"Add":""},{"Add":"========================================================="},{"Add":"*/"},{"Add":""},{"Add":"int32_t c_pruned;"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"PruneNodes_r"},{"Add":"============"},{"Add":"*/"},{"Add":"void PruneNodes_r(node_t *node) {"},{"Add":" bspbrush_t *b, *next;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":" PruneNodes_r(node->children[0]);"},{"Add":" PruneNodes_r(node->children[1]);"},{"Add":""},{"Add":" if ((node->children[0]->contents & CONTENTS_SOLID) && (node->children[1]->contents & CONTENTS_SOLID)) {"},{"Add":" if (node->faces)"},{"Add":" Error(\"node->faces seperating CONTENTS_SOLID\");"},{"Add":" if (node->children[0]->faces || node->children[1]->faces)"},{"Add":" Error(\"!node->faces with children\");"},{"Add":""},{"Add":" // FIXME: free stuff"},{"Add":" node->planenum = PLANENUM_LEAF;"},{"Add":" node->contents = CONTENTS_SOLID;"},{"Add":" node->detail_seperator = false;"},{"Add":""},{"Add":" if (node->brushlist)"},{"Add":" Error(\"PruneNodes: node->brushlist\");"},{"Add":""},{"Add":" // combine brush lists"},{"Add":" node->brushlist = node->children[1]->brushlist;"},{"Add":""},{"Add":" for (b = node->children[0]->brushlist; b; b = next) {"},{"Add":" next = b->next;"},{"Add":" b->next = node->brushlist;"},{"Add":" node->brushlist = b;"},{"Add":" }"},{"Add":""},{"Add":" c_pruned++;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void PruneNodes(node_t *node) {"},{"Add":" qprintf(\"--- PruneNodes ---\\n\");"},{"Add":" c_pruned = 0;"},{"Add":" PruneNodes_r(node);"},{"Add":" qprintf(\"%5i pruned nodes\\n\", c_pruned);"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================="}]}},{"FileAdd":{"meta":{"basename":"textures.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"int32_t nummiptex;"},{"Add":"textureref_t textureref[MAX_MAP_TEXTURES];"},{"Add":""},{"Add":"//=========================================================================="},{"Add":""},{"Add":"int32_t FindMiptex(char *name) {"},{"Add":" int32_t i, mod_fail;"},{"Add":" char path[1080];"},{"Add":" char pakpath[56];"},{"Add":" miptex_t *mt;"},{"Add":""},{"Add":" for (i = 0; i < nummiptex; i++)"},{"Add":" if (!strcmp(name, textureref[i].name)) {"},{"Add":" return i;"},{"Add":" }"},{"Add":" if (nummiptex == MAX_MAP_TEXTURES)"},{"Add":" Error(\"MAX_MAP_TEXTURES\");"},{"Add":" strcpy(textureref[i].name, name);"},{"Add":""},{"Add":" mod_fail = true;"},{"Add":""},{"Add":" sprintf(pakpath, \"textures/%s.wal\", name);"},{"Add":""},{"Add":" if (moddir[0] != 0) {"},{"Add":" sprintf(path, \"%s%s\", moddir, pakpath);"},{"Add":" // load the miptex to get the flags and values"},{"Add":" if (TryLoadFile(path, (void **)&mt, false) != -1 ||"},{"Add":" TryLoadFileFromPak(pakpath, (void **)&mt, moddir) != -1) {"},{"Add":" textureref[i].value = LittleLong(mt->value);"},{"Add":" textureref[i].flags = LittleLong(mt->flags);"},{"Add":" textureref[i].contents = LittleLong(mt->contents);"},{"Add":" strcpy(textureref[i].animname, mt->animname);"},{"Add":" free(mt);"},{"Add":" mod_fail = false;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (mod_fail) {"},{"Add":" // load the miptex to get the flags and values"},{"Add":" sprintf(path, \"%s%s\", basedir, pakpath);"},{"Add":""},{"Add":" if (TryLoadFile(path, (void **)&mt, false) != -1 ||"},{"Add":" TryLoadFileFromPak(pakpath, (void **)&mt, basedir) != -1) {"},{"Add":" textureref[i].value = LittleLong(mt->value);"},{"Add":" textureref[i].flags = LittleLong(mt->flags);"},{"Add":" textureref[i].contents = LittleLong(mt->contents);"},{"Add":" strcpy(textureref[i].animname, mt->animname);"},{"Add":" free(mt);"},{"Add":" mod_fail = false;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (mod_fail)"},{"Add":" printf(\"WARNING: couldn't locate texture %s\\n\", name);"},{"Add":""},{"Add":" nummiptex++;"},{"Add":""},{"Add":" if (textureref[i].animname[0])"},{"Add":" FindMiptex(textureref[i].animname);"},{"Add":""},{"Add":" return i;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"textureAxisFromPlane"},{"Add":"=================="},{"Add":"*/"},{"Add":"vec3_t baseaxis[18] ="},{"Add":" {"},{"Add":" {0, 0, 1}, {1, 0, 0}, {0, -1, 0}, // floor"},{"Add":" {0, 0, -1},"},{"Add":" {1, 0, 0},"},{"Add":" {0, -1, 0}, // ceiling"},{"Add":" {1, 0, 0},"},{"Add":" {0, 1, 0},"},{"Add":" {0, 0, -1}, // west wall"},{"Add":" {-1, 0, 0},"},{"Add":" {0, 1, 0},"},{"Add":" {0, 0, -1}, // east wall"},{"Add":" {0, 1, 0},"},{"Add":" {1, 0, 0},"},{"Add":" {0, 0, -1}, // south wall"},{"Add":" {0, -1, 0},"},{"Add":" {1, 0, 0},"},{"Add":" {0, 0, -1} // north wall"},{"Add":"};"},{"Add":""},{"Add":"void TextureAxisFromPlane(plane_t *pln, vec3_t xv, vec3_t yv) {"},{"Add":" int32_t bestaxis;"},{"Add":" vec_t dot, best;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" best = 0;"},{"Add":" bestaxis = 0;"},{"Add":""},{"Add":" for (i = 0; i < 6; i++) {"},{"Add":" dot = DotProduct(pln->normal, baseaxis[i * 3]);"},{"Add":" if (dot > best) {"},{"Add":" best = dot;"},{"Add":" bestaxis = i;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" VectorCopy(baseaxis[bestaxis * 3 + 1], xv);"},{"Add":" VectorCopy(baseaxis[bestaxis * 3 + 2], yv);"},{"Add":"}"},{"Add":""},{"Add":"static inline void CheckTexinfoCount() // mxd"},{"Add":"{"},{"Add":" if (use_qbsp) {"},{"Add":" if (numtexinfo == MAX_MAP_TEXINFO_QBSP)"},{"Add":" printf(\"WARNING: texinfo count exceeds qbsp limit (%i).\\n\", MAX_MAP_TEXINFO_QBSP);"},{"Add":" } else if (numtexinfo == DEFAULT_MAP_TEXINFO)"},{"Add":" printf(\"WARNING: texinfo count exceeds vanilla limit (%i).\\n\", DEFAULT_MAP_TEXINFO);"},{"Add":" else if (numtexinfo >= MAX_MAP_TEXINFO)"},{"Add":" Error(\"ERROR: texinfo count exceeds extended limit (%i).\\n\", MAX_MAP_TEXINFO);"},{"Add":"}"},{"Add":""},{"Add":"qboolean TexinfosMatch(texinfo_t t1, texinfo_t t2) // mxd"},{"Add":"{"},{"Add":" if (t1.flags != t2.flags || t1.value != t2.value || strcmp(t1.texture, t2.texture))"},{"Add":" return false;"},{"Add":""},{"Add":" for (int32_t j = 0; j < 2; j++)"},{"Add":" for (int32_t k = 0; k < 4; k++)"},{"Add":" if ((int32_t)(t1.vecs[j][k] * 100) != (int32_t)(t2.vecs[j][k] * 100)) // qb: round to two decimal places"},{"Add":" return false;"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"// mxd. Applies origin brush offset to existing v220 texinfo..."},{"Add":"int32_t ApplyTexinfoOffset_UV(int32_t texinfoindex, const brush_texture_t *bt, const vec3_t origin) {"},{"Add":" if ((!origin[0] && !origin[1] && !origin[2]) || texinfoindex < 0)"},{"Add":" return texinfoindex;"},{"Add":""},{"Add":" const texinfo_t otx = texinfo[texinfoindex];"},{"Add":""},{"Add":" // Copy texinfo"},{"Add":" texinfo_t tx;"},{"Add":" memcpy(&tx, &otx, sizeof(tx));"},{"Add":""},{"Add":" // Transform origin to UV space and add it to ST offsets"},{"Add":" tx.vecs[0][3] += origin[0] * tx.vecs[0][0] + origin[1] * tx.vecs[0][1] + origin[2] * tx.vecs[0][2];"},{"Add":" tx.vecs[1][3] += origin[0] * tx.vecs[1][0] + origin[1] * tx.vecs[1][1] + origin[2] * tx.vecs[1][2];"},{"Add":""},{"Add":" // Find or replace texinfo"},{"Add":" texinfo_t *tc = texinfo;"},{"Add":" for (texinfoindex = 0; texinfoindex < numtexinfo; texinfoindex++, tc++)"},{"Add":" if (TexinfosMatch(*tc, tx))"},{"Add":" return texinfoindex;"},{"Add":""},{"Add":" *tc = tx;"},{"Add":" numtexinfo++;"},{"Add":" CheckTexinfoCount();"},{"Add":""},{"Add":" // Repeat for the next animation frame"},{"Add":" const int32_t mt = FindMiptex(tx.texture);"},{"Add":" if (textureref[mt].animname[0]) {"},{"Add":" brush_texture_t anim = *bt;"},{"Add":" strcpy(anim.name, textureref[mt].animname);"},{"Add":" tc->nexttexinfo = ApplyTexinfoOffset_UV(tc->nexttexinfo, &anim, origin);"},{"Add":" } else {"},{"Add":" tc->nexttexinfo = -1;"},{"Add":" }"},{"Add":""},{"Add":" // Return new texinfo index."},{"Add":" return texinfoindex;"},{"Add":"}"},{"Add":""},{"Add":"// DarkEssence: function for new #mapversion with UVaxis"},{"Add":"int32_t TexinfoForBrushTexture_UV(brush_texture_t *bt, vec_t *UVaxis) {"},{"Add":" if (!bt->name[0])"},{"Add":" return 0;"},{"Add":""},{"Add":" texinfo_t tx;"},{"Add":" memset(&tx, 0, sizeof(tx));"},{"Add":" strcpy(tx.texture, bt->name);"},{"Add":""},{"Add":" if (!bt->scale[0])"},{"Add":" bt->scale[0] = 1;"},{"Add":" if (!bt->scale[1])"},{"Add":" bt->scale[1] = 1;"},{"Add":""},{"Add":" for (int32_t i = 0; i < 2; i++)"},{"Add":" for (int32_t j = 0; j < 3; j++)"},{"Add":" tx.vecs[i][j] = UVaxis[i * 3 + j] / bt->scale[i];"},{"Add":""},{"Add":" tx.vecs[0][3] = bt->shift[0];"},{"Add":" tx.vecs[1][3] = bt->shift[1];"},{"Add":" tx.flags = bt->flags;"},{"Add":" tx.value = bt->value;"},{"Add":""},{"Add":" // Find or replace texinfo"},{"Add":" int32_t texinfoindex;"},{"Add":" texinfo_t *tc = texinfo;"},{"Add":" for (texinfoindex = 0; texinfoindex < numtexinfo; texinfoindex++, tc++)"},{"Add":" if (TexinfosMatch(*tc, tx))"},{"Add":" return texinfoindex;"},{"Add":""},{"Add":" *tc = tx;"},{"Add":" numtexinfo++;"},{"Add":" CheckTexinfoCount(); // mxd"},{"Add":""},{"Add":" // Load the next animation"},{"Add":" const int32_t mt = FindMiptex(bt->name);"},{"Add":" if (textureref[mt].animname[0]) {"},{"Add":" brush_texture_t anim = *bt;"},{"Add":" strcpy(anim.name, textureref[mt].animname);"},{"Add":" tc->nexttexinfo = TexinfoForBrushTexture_UV(&anim, UVaxis);"},{"Add":" } else"},{"Add":" tc->nexttexinfo = -1;"},{"Add":""},{"Add":" return texinfoindex;"},{"Add":"}"},{"Add":""},{"Add":"extern qboolean origfix;"},{"Add":""},{"Add":"int32_t TexinfoForBrushTexture(plane_t *plane, brush_texture_t *bt, vec3_t origin) {"},{"Add":" if (!bt->name[0])"},{"Add":" return 0;"},{"Add":""},{"Add":" texinfo_t tx;"},{"Add":" memset(&tx, 0, sizeof(tx));"},{"Add":" strcpy(tx.texture, bt->name);"},{"Add":""},{"Add":" vec3_t vecs[2];"},{"Add":" TextureAxisFromPlane(plane, vecs[0], vecs[1]);"},{"Add":""},{"Add":" /* Originally:"},{"Add":" shift[0] = DotProduct (origin, vecs[0]);"},{"Add":" shift[1] = DotProduct (origin, vecs[1]);"},{"Add":" */"},{"Add":""},{"Add":" if (!bt->scale[0])"},{"Add":" bt->scale[0] = 1;"},{"Add":" if (!bt->scale[1])"},{"Add":" bt->scale[1] = 1;"},{"Add":""},{"Add":" // DWH: Fix for scaled textures using an origin brush"},{"Add":" float shift[2];"},{"Add":" vec3_t scaled_origin;"},{"Add":" if (origfix) {"},{"Add":" VectorScale(origin, 1.0 / bt->scale[0], scaled_origin);"},{"Add":" shift[0] = DotProduct(scaled_origin, vecs[0]);"},{"Add":" VectorScale(origin, 1.0 / bt->scale[1], scaled_origin);"},{"Add":" shift[1] = DotProduct(scaled_origin, vecs[1]);"},{"Add":" } else {"},{"Add":" shift[0] = DotProduct(origin, vecs[0]);"},{"Add":" shift[1] = DotProduct(origin, vecs[1]);"},{"Add":" }"},{"Add":""},{"Add":" // Rotate axis"},{"Add":" vec_t sinv, cosv;"},{"Add":" if (bt->rotate == 0) {"},{"Add":" sinv = 0;"},{"Add":" cosv = 1;"},{"Add":" } else if (bt->rotate == 90) {"},{"Add":" sinv = 1;"},{"Add":" cosv = 0;"},{"Add":" } else if (bt->rotate == 180) {"},{"Add":" sinv = 0;"},{"Add":" cosv = -1;"},{"Add":" } else if (bt->rotate == 270) {"},{"Add":" sinv = -1;"},{"Add":" cosv = 0;"},{"Add":" } else {"},{"Add":" const vec_t ang = bt->rotate / 180 * Q_PI;"},{"Add":" sinv = sin(ang);"},{"Add":" cosv = cos(ang);"},{"Add":" }"},{"Add":""},{"Add":" // DWH: and again..."},{"Add":" if (origfix) {"},{"Add":" const vec_t ns = cosv * shift[0] - sinv * shift[1];"},{"Add":" const vec_t nt = sinv * shift[0] + cosv * shift[1];"},{"Add":" shift[0] = ns;"},{"Add":" shift[1] = nt;"},{"Add":" }"},{"Add":""},{"Add":" int32_t sv, tv;"},{"Add":" if (vecs[0][0])"},{"Add":" sv = 0;"},{"Add":" else if (vecs[0][1])"},{"Add":" sv = 1;"},{"Add":" else"},{"Add":" sv = 2;"},{"Add":""},{"Add":" if (vecs[1][0])"},{"Add":" tv = 0;"},{"Add":" else if (vecs[1][1])"},{"Add":" tv = 1;"},{"Add":" else"},{"Add":" tv = 2;"},{"Add":""},{"Add":" for (int32_t i = 0; i < 2; i++) {"},{"Add":" const vec_t ns = cosv * vecs[i][sv] - sinv * vecs[i][tv];"},{"Add":" const vec_t nt = sinv * vecs[i][sv] + cosv * vecs[i][tv];"},{"Add":" vecs[i][sv] = ns;"},{"Add":" vecs[i][tv] = nt;"},{"Add":" }"},{"Add":""},{"Add":" for (int32_t i = 0; i < 2; i++)"},{"Add":" for (int32_t j = 0; j < 3; j++)"},{"Add":" tx.vecs[i][j] = vecs[i][j] / bt->scale[i];"},{"Add":""},{"Add":" tx.vecs[0][3] = bt->shift[0] + shift[0];"},{"Add":" tx.vecs[1][3] = bt->shift[1] + shift[1];"},{"Add":" tx.flags = bt->flags;"},{"Add":" tx.value = bt->value;"},{"Add":""},{"Add":" // Find or replace texinfo"},{"Add":" int32_t texinfoindex;"},{"Add":" texinfo_t *tc = texinfo;"},{"Add":" for (texinfoindex = 0; texinfoindex < numtexinfo; texinfoindex++, tc++)"},{"Add":" if (TexinfosMatch(*tc, tx))"},{"Add":" return texinfoindex;"},{"Add":""},{"Add":" *tc = tx;"},{"Add":" numtexinfo++;"},{"Add":" CheckTexinfoCount(); // mxd"},{"Add":""},{"Add":" // load the next animation"},{"Add":" const int32_t mt = FindMiptex(bt->name);"},{"Add":" if (textureref[mt].animname[0]) {"},{"Add":" brush_texture_t anim = *bt;"},{"Add":" strcpy(anim.name, textureref[mt].animname);"},{"Add":" tc->nexttexinfo = TexinfoForBrushTexture(plane, &anim, origin);"},{"Add":" } else"},{"Add":" tc->nexttexinfo = -1;"},{"Add":""},{"Add":" return texinfoindex;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"prtfile.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"/*"},{"Add":"=============================================================================="},{"Add":""},{"Add":"PORTAL FILE GENERATION"},{"Add":""},{"Add":"Save out name.prt for qvis to read"},{"Add":"=============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#define PORTALFILE \"PRT1\""},{"Add":""},{"Add":"extern qboolean use_qbsp;"},{"Add":""},{"Add":"FILE *pf;"},{"Add":"int32_t num_visclusters; // clusters the player can be in"},{"Add":"int32_t num_visportals;"},{"Add":""},{"Add":"void WriteFloat(FILE *f, vec_t v) {"},{"Add":" if (fabs(v - Q_rint(v)) < 0.001)"},{"Add":" fprintf(f, \"%i \", (int32_t)Q_rint(v));"},{"Add":" else"},{"Add":" fprintf(f, \"%f \", v);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"WritePortalFile_r"},{"Add":"================="},{"Add":"*/"},{"Add":"void WritePortalFile_r(node_t *node) {"},{"Add":" int32_t i, s;"},{"Add":" portal_t *p;"},{"Add":" winding_t *w;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" // decision node"},{"Add":" if (node->planenum != PLANENUM_LEAF && !node->detail_seperator) {"},{"Add":" WritePortalFile_r(node->children[0]);"},{"Add":" WritePortalFile_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (node->contents & CONTENTS_SOLID)"},{"Add":" return;"},{"Add":""},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" w = p->winding;"},{"Add":" s = (p->nodes[1] == node);"},{"Add":" if (w && p->nodes[0] == node) {"},{"Add":" if (!Portal_VisFlood(p))"},{"Add":" continue;"},{"Add":" // write out to the file"},{"Add":""},{"Add":" // sometimes planes get turned around when they are very near"},{"Add":" // the changeover point between different axis. interpret the"},{"Add":" // plane the same way vis will, and flip the side orders if needed"},{"Add":" // FIXME: is this still relevent?"},{"Add":" WindingPlane(w, normal, &dist);"},{"Add":" if (DotProduct(p->plane.normal, normal) < 0.99) {"},{"Add":" // backwards..."},{"Add":" fprintf(pf, \"%i %i %i \", w->numpoints, p->nodes[1]->cluster, p->nodes[0]->cluster);"},{"Add":" } else"},{"Add":" fprintf(pf, \"%i %i %i \", w->numpoints, p->nodes[0]->cluster, p->nodes[1]->cluster);"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" fprintf(pf, \"(\");"},{"Add":" WriteFloat(pf, w->p[i][0]);"},{"Add":" WriteFloat(pf, w->p[i][1]);"},{"Add":" WriteFloat(pf, w->p[i][2]);"},{"Add":" fprintf(pf, \") \");"},{"Add":" }"},{"Add":" fprintf(pf, \"\\n\");"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"FillLeafNumbers_r"},{"Add":""},{"Add":"All of the leafs under node will have the same cluster"},{"Add":"================"},{"Add":"*/"},{"Add":"void FillLeafNumbers_r(node_t *node, int32_t num) {"},{"Add":" if (node->planenum == PLANENUM_LEAF) {"},{"Add":" if (node->contents & CONTENTS_SOLID)"},{"Add":" node->cluster = -1;"},{"Add":" else"},{"Add":" node->cluster = num;"},{"Add":" return;"},{"Add":" }"},{"Add":" node->cluster = num;"},{"Add":" FillLeafNumbers_r(node->children[0], num);"},{"Add":" FillLeafNumbers_r(node->children[1], num);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"NumberLeafs_r"},{"Add":"================"},{"Add":"*/"},{"Add":"void NumberLeafs_r(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":""},{"Add":" if (node->planenum != PLANENUM_LEAF && !node->detail_seperator) {"},{"Add":" // decision node"},{"Add":" node->cluster = -99;"},{"Add":" NumberLeafs_r(node->children[0]);"},{"Add":" NumberLeafs_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // either a leaf or a detail cluster"},{"Add":""},{"Add":" if (node->contents & CONTENTS_SOLID) {"},{"Add":" // solid block, viewpoint never inside"},{"Add":" node->cluster = -1;"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" FillLeafNumbers_r(node, num_visclusters);"},{"Add":" num_visclusters++;"},{"Add":""},{"Add":" // count the portals"},{"Add":" for (p = node->portals; p;) {"},{"Add":" if (p->nodes[0] == node) // only write out from first leaf"},{"Add":" {"},{"Add":" if (Portal_VisFlood(p))"},{"Add":" num_visportals++;"},{"Add":" p = p->next[0];"},{"Add":" } else"},{"Add":" p = p->next[1];"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CreateVisPortals_r"},{"Add":"================"},{"Add":"*/"},{"Add":"void CreateVisPortals_r(node_t *node) {"},{"Add":" // stop as soon as we get to a detail_seperator, which"},{"Add":" // means that everything below is in a single cluster"},{"Add":" if (node->planenum == PLANENUM_LEAF || node->detail_seperator)"},{"Add":" return;"},{"Add":""},{"Add":" MakeNodePortal(node);"},{"Add":" SplitNodePortals(node);"},{"Add":""},{"Add":" CreateVisPortals_r(node->children[0]);"},{"Add":" CreateVisPortals_r(node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"FinishVisPortals_r"},{"Add":"================"},{"Add":"*/"},{"Add":"void FinishVisPortals2_r(node_t *node) {"},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":""},{"Add":" MakeNodePortal(node);"},{"Add":" SplitNodePortals(node);"},{"Add":""},{"Add":" FinishVisPortals2_r(node->children[0]);"},{"Add":" FinishVisPortals2_r(node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"void FinishVisPortals_r(node_t *node) {"},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":""},{"Add":" if (node->detail_seperator) {"},{"Add":" FinishVisPortals2_r(node);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" FinishVisPortals_r(node->children[0]);"},{"Add":" FinishVisPortals_r(node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"int32_t clusterleaf;"},{"Add":"void SaveClusters_r(node_t *node) {"},{"Add":" if (node->planenum == PLANENUM_LEAF) {"},{"Add":" if (use_qbsp)"},{"Add":" dleafsX[clusterleaf++].cluster = node->cluster;"},{"Add":" else"},{"Add":" dleafs[clusterleaf++].cluster = node->cluster;"},{"Add":""},{"Add":" return;"},{"Add":" }"},{"Add":" SaveClusters_r(node->children[0]);"},{"Add":" SaveClusters_r(node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"WritePortalFile"},{"Add":"================"},{"Add":"*/"},{"Add":"void WritePortalFile(tree_t *tree) {"},{"Add":" char filename[1030];"},{"Add":" node_t *headnode;"},{"Add":""},{"Add":" qprintf(\"--- WritePortalFile ---\\n\");"},{"Add":""},{"Add":" headnode = tree->headnode;"},{"Add":" num_visclusters = 0;"},{"Add":" num_visportals = 0;"},{"Add":""},{"Add":" FreeTreePortals_r(headnode);"},{"Add":""},{"Add":" MakeHeadnodePortals(tree);"},{"Add":""},{"Add":" CreateVisPortals_r(headnode);"},{"Add":""},{"Add":" // set the cluster field in every leaf and count the total number of portals"},{"Add":""},{"Add":" NumberLeafs_r(headnode);"},{"Add":""},{"Add":" // write the file"},{"Add":" sprintf(filename, \"%s.prt\", source);"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" printf(\"\\ntexinfo count: %i of %i maximum\\n\", numtexinfo, MAX_MAP_TEXINFO_QBSP);"},{"Add":" else"},{"Add":" printf(\"\\ntexinfo count: %i of %i maximum\\n\", numtexinfo, MAX_MAP_TEXINFO);"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" printf(\"brushsides count: %i of %i maximum\\n\", nummapbrushsides, MAX_MAP_BRUSHSIDES_QBSP);"},{"Add":" else"},{"Add":" printf(\"brushsides count: %i of %i maximum\\n\", nummapbrushsides, MAX_MAP_BRUSHSIDES);"},{"Add":""},{"Add":" printf(\"writing %s\\n\", filename);"},{"Add":" pf = fopen(filename, \"w\");"},{"Add":" if (!pf)"},{"Add":" Error(\"Error opening %s\", filename);"},{"Add":""},{"Add":" fprintf(pf, \"%s\\n\", PORTALFILE);"},{"Add":" fprintf(pf, \"%i\\n\", num_visclusters);"},{"Add":" fprintf(pf, \"%i\\n\", num_visportals);"},{"Add":""},{"Add":" qprintf(\"%5i visclusters\\n\", num_visclusters);"},{"Add":" qprintf(\"%5i visportals\\n\", num_visportals);"},{"Add":""},{"Add":" WritePortalFile_r(headnode);"},{"Add":""},{"Add":" fclose(pf);"},{"Add":""},{"Add":" // we need to store the clusters out now because ordering"},{"Add":" // issues made us do this after writebsp..."},{"Add":" clusterleaf = 1;"},{"Add":" SaveClusters_r(headnode);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"portals.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"int32_t c_active_portals;"},{"Add":"int32_t c_peak_portals;"},{"Add":"int32_t c_boundary;"},{"Add":"int32_t c_boundary_sides;"},{"Add":""},{"Add":"/*"},{"Add":"==========="},{"Add":"AllocPortal"},{"Add":"==========="},{"Add":"*/"},{"Add":"portal_t *AllocPortal(void) {"},{"Add":" portal_t *p;"},{"Add":""},{"Add":" if (numthreads == 1)"},{"Add":" c_active_portals++;"},{"Add":" if (c_active_portals > c_peak_portals)"},{"Add":" c_peak_portals = c_active_portals;"},{"Add":""},{"Add":" p = malloc(sizeof(portal_t));"},{"Add":" memset(p, 0, sizeof(portal_t));"},{"Add":""},{"Add":" return p;"},{"Add":"}"},{"Add":""},{"Add":"void FreePortal(portal_t *p) {"},{"Add":" if (p->winding)"},{"Add":" FreeWinding(p->winding);"},{"Add":" if (numthreads == 1)"},{"Add":" c_active_portals--;"},{"Add":" free(p);"},{"Add":"}"},{"Add":""},{"Add":"//=============================================================="},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"VisibleContents"},{"Add":""},{"Add":"Returns the single content bit of the"},{"Add":"strongest visible content present"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t VisibleContents(int32_t contents) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 1; i <= LAST_VISIBLE_CONTENTS; i <<= 1)"},{"Add":" if (contents & i)"},{"Add":" return i;"},{"Add":""},{"Add":" return 0;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"ClusterContents"},{"Add":"==============="},{"Add":"*/"},{"Add":"int32_t ClusterContents(node_t *node) {"},{"Add":" int32_t c1, c2, c;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return node->contents;"},{"Add":""},{"Add":" c1 = ClusterContents(node->children[0]);"},{"Add":" c2 = ClusterContents(node->children[1]);"},{"Add":" c = c1 | c2;"},{"Add":""},{"Add":" // a cluster may include some solid detail areas, but"},{"Add":" // still be seen into"},{"Add":" if (!(c1 & CONTENTS_SOLID) || !(c2 & CONTENTS_SOLID))"},{"Add":" c &= ~CONTENTS_SOLID;"},{"Add":" return c;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"Portal_VisFlood"},{"Add":""},{"Add":"Returns true if the portal is empty or translucent, allowing"},{"Add":"the PVS calculation to see through it."},{"Add":"The nodes on either side of the portal may actually be clusters,"},{"Add":"not leafs, so all contents should be ored together"},{"Add":"============="},{"Add":"*/"},{"Add":"qboolean Portal_VisFlood(portal_t *p) {"},{"Add":" int32_t c1, c2;"},{"Add":""},{"Add":" if (!p->onnode)"},{"Add":" return false; // to global outsideleaf"},{"Add":""},{"Add":" c1 = ClusterContents(p->nodes[0]);"},{"Add":" c2 = ClusterContents(p->nodes[1]);"},{"Add":""},{"Add":" if (!VisibleContents(c1 ^ c2))"},{"Add":" return true;"},{"Add":""},{"Add":" if (c1 & (CONTENTS_TRANSLUCENT | CONTENTS_DETAIL))"},{"Add":" c1 = 0;"},{"Add":" if (c2 & (CONTENTS_TRANSLUCENT | CONTENTS_DETAIL))"},{"Add":" c2 = 0;"},{"Add":""},{"Add":" if ((c1 | c2) & CONTENTS_SOLID)"},{"Add":" return false; // can't see through solid"},{"Add":""},{"Add":" if (!(c1 ^ c2))"},{"Add":" return true; // identical on both sides"},{"Add":""},{"Add":" if (!VisibleContents(c1 ^ c2))"},{"Add":" return true;"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"Portal_EntityFlood"},{"Add":""},{"Add":"The entity flood determines which areas are"},{"Add":"\"outside\" on the map, which are then filled in."},{"Add":"Flowing from side s to side !s"},{"Add":"==============="},{"Add":"*/"},{"Add":"qboolean Portal_EntityFlood(portal_t *p, int32_t s) {"},{"Add":" if (p->nodes[0]->planenum != PLANENUM_LEAF || p->nodes[1]->planenum != PLANENUM_LEAF)"},{"Add":" Error(\"Portal_EntityFlood: not a leaf\");"},{"Add":""},{"Add":" // can never cross to a solid"},{"Add":" if ((p->nodes[0]->contents & CONTENTS_SOLID) || (p->nodes[1]->contents & CONTENTS_SOLID))"},{"Add":" return false;"},{"Add":""},{"Add":" // can flood through everything else"},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================="},{"Add":""},{"Add":"int32_t c_tinyportals;"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"AddPortalToNodes"},{"Add":"============="},{"Add":"*/"},{"Add":"void AddPortalToNodes(portal_t *p, node_t *front, node_t *back) {"},{"Add":" if (p->nodes[0] || p->nodes[1])"},{"Add":" Error(\"AddPortalToNode: already included\");"},{"Add":""},{"Add":" p->nodes[0] = front;"},{"Add":" p->next[0] = front->portals;"},{"Add":" front->portals = p;"},{"Add":""},{"Add":" p->nodes[1] = back;"},{"Add":" p->next[1] = back->portals;"},{"Add":" back->portals = p;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"RemovePortalFromNode"},{"Add":"============="},{"Add":"*/"},{"Add":"void RemovePortalFromNode(portal_t *portal, node_t *l) {"},{"Add":" portal_t **pp, *t;"},{"Add":""},{"Add":" // remove reference to the current portal"},{"Add":" pp = &l->portals;"},{"Add":" while (1) {"},{"Add":" t = *pp;"},{"Add":" if (!t)"},{"Add":" Error(\"RemovePortalFromNode: portal not in leaf\");"},{"Add":""},{"Add":" if (t == portal)"},{"Add":" break;"},{"Add":""},{"Add":" if (t->nodes[0] == l)"},{"Add":" pp = &t->next[0];"},{"Add":" else if (t->nodes[1] == l)"},{"Add":" pp = &t->next[1];"},{"Add":" else"},{"Add":" Error(\"RemovePortalFromNode: portal not bounding leaf\");"},{"Add":" }"},{"Add":""},{"Add":" if (portal->nodes[0] == l) {"},{"Add":" *pp = portal->next[0];"},{"Add":" portal->nodes[0] = NULL;"},{"Add":" } else if (portal->nodes[1] == l) {"},{"Add":" *pp = portal->next[1];"},{"Add":" portal->nodes[1] = NULL;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================"},{"Add":""},{"Add":"void PrintPortal(portal_t *p) {"},{"Add":" int32_t i;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" w = p->winding;"},{"Add":" for (i = 0; i < w->numpoints; i++)"},{"Add":" printf(\"(%5.0f,%5.0f,%5.0f)\\n\", w->p[i][0], w->p[i][1], w->p[i][2]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"MakeHeadnodePortals"},{"Add":""},{"Add":"The created portals will face the global outside_node"},{"Add":"================"},{"Add":"*/"},{"Add":"#define SIDESPACE 8"},{"Add":"void MakeHeadnodePortals(tree_t *tree) {"},{"Add":" vec3_t bounds[2];"},{"Add":" int32_t i, j, n;"},{"Add":" portal_t *p, *portals[6];"},{"Add":" plane_t bplanes[6], *pl;"},{"Add":" node_t *node;"},{"Add":""},{"Add":" node = tree->headnode;"},{"Add":""},{"Add":" // pad with some space so there will never be null volume leafs"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" bounds[0][i] = tree->mins[i] - SIDESPACE;"},{"Add":" bounds[1][i] = tree->maxs[i] + SIDESPACE;"},{"Add":" }"},{"Add":""},{"Add":" tree->outside_node.planenum = PLANENUM_LEAF;"},{"Add":" tree->outside_node.brushlist = NULL;"},{"Add":" tree->outside_node.portals = NULL;"},{"Add":" tree->outside_node.contents = 0;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" n = j * 3 + i;"},{"Add":""},{"Add":" p = AllocPortal();"},{"Add":" portals[n] = p;"},{"Add":""},{"Add":" pl = &bplanes[n];"},{"Add":" memset(pl, 0, sizeof(*pl));"},{"Add":" if (j) {"},{"Add":" pl->normal[i] = -1;"},{"Add":" pl->dist = -bounds[j][i];"},{"Add":" } else {"},{"Add":" pl->normal[i] = 1;"},{"Add":" pl->dist = bounds[j][i];"},{"Add":" }"},{"Add":" p->plane = *pl;"},{"Add":" p->winding = BaseWindingForPlane(pl->normal, pl->dist);"},{"Add":" AddPortalToNodes(p, node, &tree->outside_node);"},{"Add":" }"},{"Add":""},{"Add":" // clip the basewindings by all the other planes"},{"Add":" for (i = 0; i < 6; i++) {"},{"Add":" for (j = 0; j < 6; j++) {"},{"Add":" if (j == i)"},{"Add":" continue;"},{"Add":" ChopWindingInPlace(&portals[i]->winding, bplanes[j].normal, bplanes[j].dist, ON_EPSILON);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//==================================================="},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"BaseWindingForNode"},{"Add":"================"},{"Add":"*/"},{"Add":"#define BASE_WINDING_EPSILON 0.001"},{"Add":"#define SPLIT_WINDING_EPSILON 0.001"},{"Add":""},{"Add":"winding_t *BaseWindingForNode(node_t *node) {"},{"Add":" winding_t *w;"},{"Add":" node_t *n;"},{"Add":" plane_t *plane;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" w = BaseWindingForPlane(mapplanes[node->planenum].normal,"},{"Add":" mapplanes[node->planenum].dist);"},{"Add":""},{"Add":" // clip by all the parents"},{"Add":" for (n = node->parent; n && w;) {"},{"Add":" plane = &mapplanes[n->planenum];"},{"Add":""},{"Add":" if (n->children[0] == node) { // take front"},{"Add":" ChopWindingInPlace(&w, plane->normal, plane->dist, BASE_WINDING_EPSILON);"},{"Add":" } else { // take back"},{"Add":" VectorSubtract(vec3_origin, plane->normal, normal);"},{"Add":" dist = -plane->dist;"},{"Add":" ChopWindingInPlace(&w, normal, dist, BASE_WINDING_EPSILON);"},{"Add":" }"},{"Add":" node = n;"},{"Add":" n = n->parent;"},{"Add":" }"},{"Add":""},{"Add":" return w;"},{"Add":"}"},{"Add":""},{"Add":"//============================================================"},{"Add":""},{"Add":"qboolean WindingIsTiny(winding_t *w);"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"MakeNodePortal"},{"Add":""},{"Add":"create the new portal by taking the full plane winding for the cutting plane"},{"Add":"and clipping it by all of parents of this node"},{"Add":"=================="},{"Add":"*/"},{"Add":"void MakeNodePortal(node_t *node) {"},{"Add":" portal_t *new_portal, *p;"},{"Add":" winding_t *w;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist = 0;"},{"Add":" int32_t side = 0;"},{"Add":""},{"Add":" w = BaseWindingForNode(node);"},{"Add":""},{"Add":" // clip the portal by all the other portals in the node"},{"Add":" for (p = node->portals; p && w; p = p->next[side]) {"},{"Add":" if (p->nodes[0] == node) {"},{"Add":" side = 0;"},{"Add":" VectorCopy(p->plane.normal, normal);"},{"Add":" dist = p->plane.dist;"},{"Add":" } else if (p->nodes[1] == node) {"},{"Add":" side = 1;"},{"Add":" VectorSubtract(vec3_origin, p->plane.normal, normal);"},{"Add":" dist = -p->plane.dist;"},{"Add":" } else"},{"Add":" Error(\"CutNodePortals_r: mislinked portal\");"},{"Add":""},{"Add":" ChopWindingInPlace(&w, normal, dist, 0.1);"},{"Add":" }"},{"Add":""},{"Add":" if (!w) {"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (WindingIsTiny(w)) {"},{"Add":" c_tinyportals++;"},{"Add":" FreeWinding(w);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" new_portal = AllocPortal();"},{"Add":" new_portal->plane = mapplanes[node->planenum];"},{"Add":" new_portal->onnode = node;"},{"Add":" new_portal->winding = w;"},{"Add":" AddPortalToNodes(new_portal, node->children[0], node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"SplitNodePortals"},{"Add":""},{"Add":"Move or split the portals that bound node so that the node's"},{"Add":"children have portals instead of node."},{"Add":"=============="},{"Add":"*/"},{"Add":"void SplitNodePortals(node_t *node) {"},{"Add":" portal_t *p, *next_portal, *new_portal;"},{"Add":" node_t *f, *b, *other_node;"},{"Add":" int32_t side = 0;"},{"Add":" plane_t *plane;"},{"Add":" winding_t *frontwinding, *backwinding;"},{"Add":""},{"Add":" plane = &mapplanes[node->planenum];"},{"Add":" f = node->children[0];"},{"Add":" b = node->children[1];"},{"Add":""},{"Add":" for (p = node->portals; p; p = next_portal) {"},{"Add":" if (p->nodes[0] == node)"},{"Add":" side = 0;"},{"Add":" else if (p->nodes[1] == node)"},{"Add":" side = 1;"},{"Add":" else"},{"Add":" Error(\"CutNodePortals_r: mislinked portal\");"},{"Add":" next_portal = p->next[side];"},{"Add":""},{"Add":" other_node = p->nodes[!side];"},{"Add":" RemovePortalFromNode(p, p->nodes[0]);"},{"Add":" RemovePortalFromNode(p, p->nodes[1]);"},{"Add":""},{"Add":" //"},{"Add":" // cut the portal into two portals, one on each side of the cut plane"},{"Add":" //"},{"Add":" ClipWindingEpsilon(p->winding, plane->normal, plane->dist,"},{"Add":" SPLIT_WINDING_EPSILON, &frontwinding, &backwinding);"},{"Add":""},{"Add":" if (frontwinding && WindingIsTiny(frontwinding)) {"},{"Add":" FreeWinding(frontwinding);"},{"Add":" frontwinding = NULL;"},{"Add":" c_tinyportals++;"},{"Add":" }"},{"Add":""},{"Add":" if (backwinding && WindingIsTiny(backwinding)) {"},{"Add":" FreeWinding(backwinding);"},{"Add":" backwinding = NULL;"},{"Add":" c_tinyportals++;"},{"Add":" }"},{"Add":""},{"Add":" if (!frontwinding && !backwinding) { // tiny windings on both sides"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (!frontwinding) {"},{"Add":" FreeWinding(backwinding);"},{"Add":" if (side == 0)"},{"Add":" AddPortalToNodes(p, b, other_node);"},{"Add":" else"},{"Add":" AddPortalToNodes(p, other_node, b);"},{"Add":" continue;"},{"Add":" }"},{"Add":" if (!backwinding) {"},{"Add":" FreeWinding(frontwinding);"},{"Add":" if (side == 0)"},{"Add":" AddPortalToNodes(p, f, other_node);"},{"Add":" else"},{"Add":" AddPortalToNodes(p, other_node, f);"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" // the winding is split"},{"Add":" new_portal = AllocPortal();"},{"Add":" *new_portal = *p;"},{"Add":" new_portal->winding = backwinding;"},{"Add":" FreeWinding(p->winding);"},{"Add":" p->winding = frontwinding;"},{"Add":""},{"Add":" if (side == 0) {"},{"Add":" AddPortalToNodes(p, f, other_node);"},{"Add":" AddPortalToNodes(new_portal, b, other_node);"},{"Add":" } else {"},{"Add":" AddPortalToNodes(p, other_node, f);"},{"Add":" AddPortalToNodes(new_portal, other_node, b);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" node->portals = NULL;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CalcNodeBounds"},{"Add":"================"},{"Add":"*/"},{"Add":"void CalcNodeBounds(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" // calc mins/maxs for both leafs and nodes"},{"Add":" ClearBounds(node->mins, node->maxs);"},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":" for (i = 0; i < p->winding->numpoints; i++)"},{"Add":" AddPointToBounds(p->winding->p[i], node->mins, node->maxs);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"MakeTreePortals_r"},{"Add":"=================="},{"Add":"*/"},{"Add":"void MakeTreePortals_r(node_t *node) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" CalcNodeBounds(node);"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (node->mins[i] < -2 * max_bounds || node->maxs[i] > 2 * max_bounds) {"},{"Add":" printf(\"WARNING: node with unbounded volume\\n\");"},{"Add":" printf(\" Bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" node->mins[0], node->mins[1], node->mins[2], node->maxs[0], node->maxs[1], node->maxs[2]);"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":""},{"Add":" MakeNodePortal(node);"},{"Add":" SplitNodePortals(node);"},{"Add":""},{"Add":" MakeTreePortals_r(node->children[0]);"},{"Add":" MakeTreePortals_r(node->children[1]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"MakeTreePortals"},{"Add":"=================="},{"Add":"*/"},{"Add":"void MakeTreePortals(tree_t *tree) {"},{"Add":" MakeHeadnodePortals(tree);"},{"Add":" MakeTreePortals_r(tree->headnode);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"========================================================="},{"Add":""},{"Add":"FLOOD ENTITIES"},{"Add":""},{"Add":"========================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FloodPortals_r"},{"Add":"============="},{"Add":"*/"},{"Add":"void FloodPortals_r(node_t *node, int32_t dist) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" node->occupied = dist;"},{"Add":""},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":""},{"Add":" if (p->nodes[!s]->occupied)"},{"Add":" continue;"},{"Add":""},{"Add":" if (!Portal_EntityFlood(p, s))"},{"Add":" continue;"},{"Add":""},{"Add":" FloodPortals_r(p->nodes[!s], dist + 1);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"PlaceOccupant"},{"Add":"============="},{"Add":"*/"},{"Add":"qboolean PlaceOccupant(node_t *headnode, vec3_t origin, entity_t *occupant) {"},{"Add":" node_t *node;"},{"Add":" vec_t d;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" // find the leaf to start in"},{"Add":" node = headnode;"},{"Add":" while (node->planenum != PLANENUM_LEAF) {"},{"Add":" plane = &mapplanes[node->planenum];"},{"Add":" d = DotProduct(origin, plane->normal) - plane->dist;"},{"Add":" if (d >= 0)"},{"Add":" node = node->children[0];"},{"Add":" else"},{"Add":" node = node->children[1];"},{"Add":" }"},{"Add":""},{"Add":" if (node->contents == CONTENTS_SOLID)"},{"Add":" return false;"},{"Add":" node->occupant = occupant;"},{"Add":""},{"Add":" FloodPortals_r(node, 1);"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FloodEntities"},{"Add":""},{"Add":"Marks all nodes that can be reached by entites"},{"Add":"============="},{"Add":"*/"},{"Add":"qboolean FloodEntities(tree_t *tree) {"},{"Add":" int32_t i;"},{"Add":" vec3_t origin;"},{"Add":" char *cl;"},{"Add":" qboolean inside;"},{"Add":" node_t *headnode;"},{"Add":""},{"Add":" headnode = tree->headnode;"},{"Add":" qprintf(\"--- FloodEntities ---\\n\");"},{"Add":" inside = false;"},{"Add":" tree->outside_node.occupied = 0;"},{"Add":""},{"Add":" for (i = 1; i < num_entities; i++) {"},{"Add":" GetVectorForKey(&entities[i], \"origin\", origin);"},{"Add":" if (VectorCompare(origin, vec3_origin))"},{"Add":" continue;"},{"Add":""},{"Add":" cl = ValueForKey(&entities[i], \"classname\");"},{"Add":" origin[2] += 1; // so objects on floor are ok"},{"Add":""},{"Add":" // nudge playerstart around if needed so clipping hulls allways"},{"Add":" // have a vlaid point"},{"Add":" if (!strcmp(cl, \"info_player_start\")) {"},{"Add":" int32_t x, y;"},{"Add":""},{"Add":" for (x = -16; x <= 16; x += 16) {"},{"Add":" for (y = -16; y <= 16; y += 16) {"},{"Add":" origin[0] += x;"},{"Add":" origin[1] += y;"},{"Add":" if (PlaceOccupant(headnode, origin, &entities[i])) {"},{"Add":" inside = true;"},{"Add":" goto gotit;"},{"Add":" }"},{"Add":" origin[0] -= x;"},{"Add":" origin[1] -= y;"},{"Add":" }"},{"Add":" }"},{"Add":" gotit:;"},{"Add":" } else {"},{"Add":" if (PlaceOccupant(headnode, origin, &entities[i]))"},{"Add":" inside = true;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!inside) {"},{"Add":" qprintf(\"no entities in open -- no filling\\n\");"},{"Add":" } else if (tree->outside_node.occupied) {"},{"Add":" qprintf(\"entity reached from outside -- no filling\\n\");"},{"Add":" }"},{"Add":""},{"Add":" return (qboolean)(inside && !tree->outside_node.occupied);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"========================================================="},{"Add":""},{"Add":"FLOOD AREAS"},{"Add":""},{"Add":"========================================================="},{"Add":"*/"},{"Add":""},{"Add":"int32_t c_areas;"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FloodAreas_r"},{"Add":"============="},{"Add":"*/"},{"Add":"void FloodAreas_r(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":" bspbrush_t *b;"},{"Add":" entity_t *e;"},{"Add":""},{"Add":" if (node->contents == CONTENTS_AREAPORTAL) {"},{"Add":" // this node is part of an area portal"},{"Add":" b = node->brushlist;"},{"Add":" e = &entities[b->original->entitynum];"},{"Add":""},{"Add":" // if the current area has allready touched this"},{"Add":" // portal, we are done"},{"Add":" if (e->portalareas[0] == c_areas || e->portalareas[1] == c_areas)"},{"Add":" return;"},{"Add":""},{"Add":" // note the current area as bounding the portal"},{"Add":" if (e->portalareas[1]) {"},{"Add":" printf(\"WARNING: areaportal entity %i touches > 2 areas\\n Node Bounds: %g %g %g -> %g %g %g\\n\", b->original->entitynum,"},{"Add":" node->mins[0], node->mins[1], node->mins[2], node->maxs[0], node->maxs[1], node->maxs[2]);"},{"Add":" return;"},{"Add":" }"},{"Add":" if (e->portalareas[0])"},{"Add":" e->portalareas[1] = c_areas;"},{"Add":" else"},{"Add":" e->portalareas[0] = c_areas;"},{"Add":""},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (node->area)"},{"Add":" return; // allready got it"},{"Add":" node->area = c_areas;"},{"Add":""},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":"#if 0"},{"Add":"\t\tif (p->nodes[!s]->occupied)"},{"Add":"\t\t\tcontinue;"},{"Add":"#endif"},{"Add":" if (!Portal_EntityFlood(p, s))"},{"Add":" continue;"},{"Add":""},{"Add":" FloodAreas_r(p->nodes[!s]);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FindAreas_r"},{"Add":""},{"Add":"Just decend the tree, and for each node that hasn't had an"},{"Add":"area set, flood fill out from there"},{"Add":"============="},{"Add":"*/"},{"Add":"void FindAreas_r(node_t *node) {"},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" FindAreas_r(node->children[0]);"},{"Add":" FindAreas_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (node->area)"},{"Add":" return; // allready got it"},{"Add":""},{"Add":" if (node->contents & CONTENTS_SOLID)"},{"Add":" return;"},{"Add":""},{"Add":" if (!node->occupied)"},{"Add":" return; // not reachable by entities"},{"Add":""},{"Add":" // area portals are allways only flooded into, never"},{"Add":" // out of"},{"Add":" if (node->contents == CONTENTS_AREAPORTAL)"},{"Add":" return;"},{"Add":""},{"Add":" c_areas++;"},{"Add":" FloodAreas_r(node);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"SetAreaPortalAreas_r"},{"Add":""},{"Add":"Just decend the tree, and for each node that hasn't had an"},{"Add":"area set, flood fill out from there"},{"Add":"============="},{"Add":"*/"},{"Add":"void SetAreaPortalAreas_r(node_t *node) {"},{"Add":" bspbrush_t *b;"},{"Add":" entity_t *e;"},{"Add":""},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" SetAreaPortalAreas_r(node->children[0]);"},{"Add":" SetAreaPortalAreas_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (node->contents == CONTENTS_AREAPORTAL) {"},{"Add":" if (node->area)"},{"Add":" return; // allready set"},{"Add":""},{"Add":" b = node->brushlist;"},{"Add":" e = &entities[b->original->entitynum];"},{"Add":" node->area = e->portalareas[0];"},{"Add":" if (!e->portalareas[1]) {"},{"Add":" printf(\"WARNING: areaportal entity %i doesn't touch two areas\\n Node Bounds: %g %g %g -> %g %g %g\\n\", b->original->entitynum,"},{"Add":" node->mins[0], node->mins[1], node->mins[2], node->maxs[0], node->maxs[1], node->maxs[2]);"},{"Add":" return;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"EmitAreaPortals"},{"Add":""},{"Add":"============="},{"Add":"*/"},{"Add":"void EmitAreaPortals(node_t *headnode) {"},{"Add":" int32_t i, j;"},{"Add":" entity_t *e;"},{"Add":" dareaportal_t *dp;"},{"Add":""},{"Add":" if (c_areas > MAX_MAP_AREAS)"},{"Add":" Error(\"MAX_MAP_AREAS\");"},{"Add":" numareas = c_areas + 1;"},{"Add":" numareaportals = 1; // leave 0 as an error"},{"Add":""},{"Add":" for (i = 1; i <= c_areas; i++) {"},{"Add":" dareas[i].firstareaportal = numareaportals;"},{"Add":" for (j = 0; j < num_entities; j++) {"},{"Add":" e = &entities[j];"},{"Add":" if (!e->areaportalnum)"},{"Add":" continue;"},{"Add":" dp = &dareaportals[numareaportals];"},{"Add":" if (e->portalareas[0] == i) {"},{"Add":" dp->portalnum = e->areaportalnum;"},{"Add":" dp->otherarea = e->portalareas[1];"},{"Add":" numareaportals++;"},{"Add":" } else if (e->portalareas[1] == i) {"},{"Add":" dp->portalnum = e->areaportalnum;"},{"Add":" dp->otherarea = e->portalareas[0];"},{"Add":" numareaportals++;"},{"Add":" }"},{"Add":" }"},{"Add":" dareas[i].numareaportals = numareaportals - dareas[i].firstareaportal;"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"%5i numareas\\n\", numareas);"},{"Add":" qprintf(\"%5i numareaportals\\n\", numareaportals);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FloodAreas"},{"Add":""},{"Add":"Mark each leaf with an area, bounded by CONTENTS_AREAPORTAL"},{"Add":"============="},{"Add":"*/"},{"Add":"void FloodAreas(tree_t *tree) {"},{"Add":" qprintf(\"--- FloodAreas ---\\n\");"},{"Add":" FindAreas_r(tree->headnode);"},{"Add":" SetAreaPortalAreas_r(tree->headnode);"},{"Add":" qprintf(\"%5i areas\\n\", c_areas);"},{"Add":"}"},{"Add":""},{"Add":"//======================================================"},{"Add":""},{"Add":"int32_t c_outside;"},{"Add":"int32_t c_inside;"},{"Add":"int32_t c_solid;"},{"Add":""},{"Add":"void FillOutside_r(node_t *node) {"},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" FillOutside_r(node->children[0]);"},{"Add":" FillOutside_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // anything not reachable by an entity"},{"Add":" // can be filled away"},{"Add":" if (!node->occupied) {"},{"Add":" if (node->contents != CONTENTS_SOLID) {"},{"Add":" c_outside++;"},{"Add":" node->contents = CONTENTS_SOLID;"},{"Add":" } else"},{"Add":" c_solid++;"},{"Add":" } else"},{"Add":" c_inside++;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FillOutside"},{"Add":""},{"Add":"Fill all nodes that can't be reached by entities"},{"Add":"============="},{"Add":"*/"},{"Add":"void FillOutside(node_t *headnode) {"},{"Add":" c_outside = 0;"},{"Add":" c_inside = 0;"},{"Add":" c_solid = 0;"},{"Add":" qprintf(\"--- FillOutside ---\\n\");"},{"Add":" FillOutside_r(headnode);"},{"Add":" qprintf(\"%5i solid leafs\\n\", c_solid);"},{"Add":" qprintf(\"%5i leafs filled\\n\", c_outside);"},{"Add":" qprintf(\"%5i inside leafs\\n\", c_inside);"},{"Add":"}"},{"Add":""},{"Add":"//=============================================================="},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"FindPortalSide"},{"Add":""},{"Add":"Finds a brush side to use for texturing the given portal"},{"Add":"============"},{"Add":"*/"},{"Add":"void FindPortalSide(portal_t *p) {"},{"Add":" int32_t viscontents;"},{"Add":" bspbrush_t *bb;"},{"Add":" mapbrush_t *brush;"},{"Add":" node_t *n;"},{"Add":" int32_t i, j;"},{"Add":" int32_t planenum;"},{"Add":" side_t *side, *bestside;"},{"Add":" vec_t dot, bestdot;"},{"Add":" plane_t *p1, *p2;"},{"Add":""},{"Add":" // decide which content change is strongest"},{"Add":" // solid > lava > water, etc"},{"Add":" viscontents = VisibleContents(p->nodes[0]->contents ^ p->nodes[1]->contents);"},{"Add":" if (!viscontents)"},{"Add":" return;"},{"Add":""},{"Add":" planenum = p->onnode->planenum;"},{"Add":" bestside = NULL;"},{"Add":" bestdot = 0;"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" n = p->nodes[j];"},{"Add":" p1 = &mapplanes[p->onnode->planenum];"},{"Add":" for (bb = n->brushlist; bb; bb = bb->next) {"},{"Add":" brush = bb->original;"},{"Add":" if (!(brush->contents & viscontents))"},{"Add":" continue;"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" side = &brush->original_sides[i];"},{"Add":" if (side->bevel)"},{"Add":" continue;"},{"Add":" if (side->texinfo == TEXINFO_NODE)"},{"Add":" continue; // non-visible"},{"Add":" if ((side->planenum & ~1) == planenum) { // exact match"},{"Add":" bestside = &brush->original_sides[i];"},{"Add":" goto gotit;"},{"Add":" }"},{"Add":" // see how close the match is"},{"Add":" p2 = &mapplanes[side->planenum & ~1];"},{"Add":" dot = DotProduct(p1->normal, p2->normal);"},{"Add":" if (dot > bestdot) {"},{"Add":" bestdot = dot;"},{"Add":" bestside = side;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":"gotit:"},{"Add":" if (!bestside)"},{"Add":" qprintf(\"WARNING: side not found for portal\\n\");"},{"Add":""},{"Add":" p->sidefound = true;"},{"Add":" p->side = bestside;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"MarkVisibleSides_r"},{"Add":""},{"Add":"==============="},{"Add":"*/"},{"Add":"void MarkVisibleSides_r(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" MarkVisibleSides_r(node->children[0]);"},{"Add":" MarkVisibleSides_r(node->children[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // empty leafs are never boundary leafs"},{"Add":" if (!node->contents)"},{"Add":" return;"},{"Add":""},{"Add":" // see if there is a visible face"},{"Add":" for (p = node->portals; p; p = p->next[!s]) {"},{"Add":" s = (p->nodes[0] == node);"},{"Add":" if (!p->onnode)"},{"Add":" continue; // edge of world"},{"Add":" if (!p->sidefound)"},{"Add":" FindPortalSide(p);"},{"Add":" if (p->side)"},{"Add":" p->side->visible = true;"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"MarkVisibleSides"},{"Add":""},{"Add":"============="},{"Add":"*/"},{"Add":"void MarkVisibleSides(tree_t *tree, int32_t startbrush, int32_t endbrush) {"},{"Add":" int32_t i, j;"},{"Add":" mapbrush_t *mb;"},{"Add":" int32_t numsides;"},{"Add":""},{"Add":" qprintf(\"--- MarkVisibleSides ---\\n\");"},{"Add":""},{"Add":" // clear all the visible flags"},{"Add":" for (i = startbrush; i < endbrush; i++) {"},{"Add":" mb = &mapbrushes[i];"},{"Add":" numsides = mb->numsides;"},{"Add":" for (j = 0; j < numsides; j++)"},{"Add":" mb->original_sides[j].visible = false;"},{"Add":" }"},{"Add":""},{"Add":" // set visible flags on the sides that are used by portals"},{"Add":" MarkVisibleSides_r(tree->headnode);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"map.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"extern qboolean onlyents;"},{"Add":""},{"Add":"int32_t nummapbrushes;"},{"Add":"mapbrush_t mapbrushes[MAX_MAP_BRUSHES_QBSP];"},{"Add":""},{"Add":"int32_t nummapbrushsides;"},{"Add":"side_t brushsides[MAX_MAP_SIDES];"},{"Add":"brush_texture_t side_brushtextures[MAX_MAP_SIDES];"},{"Add":""},{"Add":"int32_t nummapplanes;"},{"Add":"plane_t mapplanes[MAX_MAP_PLANES_QBSP];"},{"Add":""},{"Add":"#define PLANE_HASHES 1024"},{"Add":"plane_t *planehash[PLANE_HASHES];"},{"Add":""},{"Add":"vec3_t map_mins, map_maxs;"},{"Add":""},{"Add":"void TestExpandBrushes(void);"},{"Add":""},{"Add":"int32_t c_boxbevels;"},{"Add":"int32_t c_edgebevels;"},{"Add":""},{"Add":"int32_t c_areaportals;"},{"Add":""},{"Add":"int32_t c_clipbrushes;"},{"Add":""},{"Add":"int32_t g_nMapFileVersion = 0; // DarkEssence: variable for check #mapversion"},{"Add":"// #mapversion in search to find in code"},{"Add":"/*"},{"Add":"============================================================================="},{"Add":""},{"Add":"PLANE FINDING"},{"Add":""},{"Add":"============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"PlaneTypeForNormal"},{"Add":"================="},{"Add":"*/"},{"Add":"int32_t PlaneTypeForNormal(vec3_t normal) {"},{"Add":" vec_t ax, ay, az;"},{"Add":""},{"Add":" // NOTE: should these have an epsilon around 1.0?"},{"Add":" if (normal[0] >= 1.0 || normal[0] <= -1.0)"},{"Add":" return PLANE_X;"},{"Add":" if (normal[1] >= 1.0 || normal[1] <= -1.0)"},{"Add":" return PLANE_Y;"},{"Add":" if (normal[2] >= 1.0 || normal[2] <= -1.0)"},{"Add":" return PLANE_Z;"},{"Add":""},{"Add":" ax = fabs(normal[0]);"},{"Add":" ay = fabs(normal[1]);"},{"Add":" az = fabs(normal[2]);"},{"Add":""},{"Add":" if (ax >= ay && ax >= az)"},{"Add":" return PLANE_ANYX;"},{"Add":" if (ay >= ax && ay >= az)"},{"Add":" return PLANE_ANYY;"},{"Add":" return PLANE_ANYZ;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"PlaneEqual"},{"Add":"================"},{"Add":"*/"},{"Add":""},{"Add":"#define DIST_EPSILON 0.01"},{"Add":"qboolean PlaneEqual(plane_t *p, vec3_t normal, vec_t dist) {"},{"Add":"#if 1"},{"Add":" if ("},{"Add":" fabs(p->normal[0] - normal[0]) < NORMAL_EPSILON && fabs(p->normal[1] - normal[1]) < NORMAL_EPSILON && fabs(p->normal[2] - normal[2]) < NORMAL_EPSILON && fabs(p->dist - dist) < DIST_EPSILON)"},{"Add":" return true;"},{"Add":"#else"},{"Add":" if (p->normal[0] == normal[0] && p->normal[1] == normal[1] && p->normal[2] == normal[2] && p->dist == dist)"},{"Add":" return true;"},{"Add":"#endif"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"AddPlaneToHash"},{"Add":"================"},{"Add":"*/"},{"Add":"void AddPlaneToHash(plane_t *p) {"},{"Add":" int32_t hash;"},{"Add":""},{"Add":" hash = (int32_t)fabs(p->dist) / 8;"},{"Add":" hash &= (PLANE_HASHES - 1);"},{"Add":""},{"Add":" p->hash_chain = planehash[hash];"},{"Add":" planehash[hash] = p;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CreateNewFloatPlane"},{"Add":"================"},{"Add":"*/"},{"Add":"int32_t CreateNewFloatPlane(vec3_t normal, vec_t dist, int32_t bnum) {"},{"Add":" plane_t *p, temp;"},{"Add":""},{"Add":" if (VectorLength(normal) < 0.5)"},{"Add":" Error(\"FloatPlane: bad normal. Brush %i\", bnum); // qb: add brushnum"},{"Add":" // create a new plane"},{"Add":" if (use_qbsp) {"},{"Add":" if (nummapplanes + 2 > MAX_MAP_PLANES_QBSP)"},{"Add":" Error(\"MAX_MAP_PLANES_QBSP\");"},{"Add":" } else if (nummapplanes + 2 > MAX_MAP_PLANES)"},{"Add":" Error(\"MAX_MAP_PLANES\");"},{"Add":""},{"Add":" p = &mapplanes[nummapplanes];"},{"Add":" VectorCopy(normal, p->normal);"},{"Add":" p->dist = dist;"},{"Add":" p->type = (p + 1)->type = PlaneTypeForNormal(p->normal);"},{"Add":""},{"Add":" VectorSubtract(vec3_origin, normal, (p + 1)->normal);"},{"Add":" (p + 1)->dist = -dist;"},{"Add":""},{"Add":" nummapplanes += 2;"},{"Add":""},{"Add":" // allways put axial planes facing positive first"},{"Add":" if (p->type < 3) {"},{"Add":" if (p->normal[0] < 0 || p->normal[1] < 0 || p->normal[2] < 0) {"},{"Add":" // flip order"},{"Add":" temp = *p;"},{"Add":" *p = *(p + 1);"},{"Add":" *(p + 1) = temp;"},{"Add":""},{"Add":" AddPlaneToHash(p);"},{"Add":" AddPlaneToHash(p + 1);"},{"Add":" return nummapplanes - 1;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" AddPlaneToHash(p);"},{"Add":" AddPlaneToHash(p + 1);"},{"Add":" return nummapplanes - 2;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"SnapVector"},{"Add":"=============="},{"Add":"*/"},{"Add":"void SnapVector(vec3_t normal) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (fabs(normal[i] - 1) < NORMAL_EPSILON) {"},{"Add":" VectorClear(normal);"},{"Add":" normal[i] = 1;"},{"Add":" break;"},{"Add":" }"},{"Add":" if (fabs(normal[i] - -1) < NORMAL_EPSILON) {"},{"Add":" VectorClear(normal);"},{"Add":" normal[i] = -1;"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"SnapPlane"},{"Add":"=============="},{"Add":"*/"},{"Add":"void SnapPlane(vec3_t normal, vec_t *dist) {"},{"Add":" SnapVector(normal);"},{"Add":""},{"Add":" if (fabs(*dist - Q_rint(*dist)) < DIST_EPSILON)"},{"Add":" *dist = Q_rint(*dist);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"FindFloatPlane"},{"Add":""},{"Add":"============="},{"Add":"*/"},{"Add":""},{"Add":"int32_t FindFloatPlane(vec3_t normal, vec_t dist, int32_t bnum) {"},{"Add":" int32_t i;"},{"Add":" plane_t *p;"},{"Add":" int32_t hash, h;"},{"Add":""},{"Add":" SnapPlane(normal, &dist);"},{"Add":" hash = (int32_t)fabs(dist) / 8;"},{"Add":" hash &= (PLANE_HASHES - 1);"},{"Add":""},{"Add":" // search the border bins as well"},{"Add":" for (i = -1; i <= 1; i++) {"},{"Add":" h = (hash + i) & (PLANE_HASHES - 1);"},{"Add":" for (p = planehash[h]; p; p = p->hash_chain) {"},{"Add":" if (PlaneEqual(p, normal, dist))"},{"Add":" return p - mapplanes;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return CreateNewFloatPlane(normal, dist, bnum);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"PlaneFromPoints"},{"Add":"================"},{"Add":"*/"},{"Add":"int32_t PlaneFromPoints(vec3_t p0, vec3_t p1, vec3_t p2, mapbrush_t *b) {"},{"Add":" vec3_t t1, t2, normal;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" VectorSubtract(p0, p1, t1);"},{"Add":" VectorSubtract(p2, p1, t2);"},{"Add":" CrossProduct(t1, t2, normal);"},{"Add":" VectorNormalize(normal, normal);"},{"Add":""},{"Add":" dist = DotProduct(p0, normal);"},{"Add":""},{"Add":" return FindFloatPlane(normal, dist, b->brushnum);"},{"Add":"}"},{"Add":""},{"Add":"//===================================================================="},{"Add":""},{"Add":"/*"},{"Add":"==========="},{"Add":"BrushContents"},{"Add":"==========="},{"Add":"*/"},{"Add":"int32_t BrushContents(mapbrush_t *b) {"},{"Add":" int32_t contents;"},{"Add":" side_t *s;"},{"Add":" int32_t i;"},{"Add":" int32_t trans;"},{"Add":""},{"Add":" s = &b->original_sides[0];"},{"Add":" contents = s->contents;"},{"Add":" trans = texinfo[s->texinfo].flags;"},{"Add":" for (i = 1; i < b->numsides; i++, s++) {"},{"Add":" s = &b->original_sides[i];"},{"Add":" trans |= texinfo[s->texinfo].flags;"},{"Add":" if (s->contents != contents) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: mixed face contents\\n\", b->entitynum, b->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // if any side is translucent, mark the contents"},{"Add":" // and change solid to window"},{"Add":" if (trans & (SURF_TRANS33 | SURF_TRANS66)) {"},{"Add":" contents |= CONTENTS_TRANSLUCENT;"},{"Add":" if (contents & CONTENTS_SOLID) {"},{"Add":" contents &= ~CONTENTS_SOLID;"},{"Add":" contents |= CONTENTS_WINDOW;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return contents;"},{"Add":"}"},{"Add":""},{"Add":"//============================================================================"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"AddBrushBevels"},{"Add":""},{"Add":"Adds any additional planes necessary to allow the brush to be expanded"},{"Add":"against axial bounding boxes"},{"Add":"================="},{"Add":"*/"},{"Add":"void AddBrushBevels(mapbrush_t *b) {"},{"Add":" int32_t axis, dir;"},{"Add":" int32_t i, j, k, l, order;"},{"Add":" side_t sidetemp;"},{"Add":" brush_texture_t tdtemp;"},{"Add":" side_t *s, *s2;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":" winding_t *w, *w2;"},{"Add":" vec3_t vec, vec2;"},{"Add":" vec_t d;"},{"Add":""},{"Add":" //"},{"Add":" // add the axial planes"},{"Add":" //"},{"Add":" order = 0;"},{"Add":" for (axis = 0; axis < 3; axis++) {"},{"Add":" for (dir = -1; dir <= 1; dir += 2, order++) {"},{"Add":" // see if the plane is allready present"},{"Add":" for (i = 0, s = b->original_sides; i < b->numsides; i++, s++) {"},{"Add":" if (mapplanes[s->planenum].normal[axis] == dir)"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (i == b->numsides) {"},{"Add":" // add a new side"},{"Add":" if (use_qbsp) {"},{"Add":" if (nummapbrushsides == MAX_MAP_BRUSHSIDES_QBSP)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES_QBSP\");"},{"Add":" } else if (nummapbrushsides == MAX_MAP_BRUSHSIDES)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES\");"},{"Add":" nummapbrushsides++;"},{"Add":" b->numsides++;"},{"Add":" VectorClear(normal);"},{"Add":" normal[axis] = dir;"},{"Add":" if (dir == 1)"},{"Add":" dist = b->maxs[axis];"},{"Add":" else"},{"Add":" dist = -b->mins[axis];"},{"Add":" s->planenum = FindFloatPlane(normal, dist, b->brushnum);"},{"Add":" s->texinfo = b->original_sides[0].texinfo;"},{"Add":" s->contents = b->original_sides[0].contents;"},{"Add":" s->bevel = true;"},{"Add":" c_boxbevels++;"},{"Add":" }"},{"Add":""},{"Add":" // if the plane is not in it canonical order, swap it"},{"Add":" if (i != order) {"},{"Add":" sidetemp = b->original_sides[order];"},{"Add":" b->original_sides[order] = b->original_sides[i];"},{"Add":" b->original_sides[i] = sidetemp;"},{"Add":""},{"Add":" j = b->original_sides - brushsides;"},{"Add":" tdtemp = side_brushtextures[j + order];"},{"Add":" side_brushtextures[j + order] = side_brushtextures[j + i];"},{"Add":" side_brushtextures[j + i] = tdtemp;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // add the edge bevels"},{"Add":" //"},{"Add":" if (b->numsides == 6)"},{"Add":" return; // pure axial"},{"Add":""},{"Add":" // test the non-axial plane edges"},{"Add":" for (i = 6; i < b->numsides; i++) {"},{"Add":" s = b->original_sides + i;"},{"Add":" w = s->winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" k = (j + 1) % w->numpoints;"},{"Add":" VectorSubtract(w->p[j], w->p[k], vec);"},{"Add":" if (VectorNormalize(vec, vec) < 0.5)"},{"Add":" continue;"},{"Add":" SnapVector(vec);"},{"Add":" for (k = 0; k < 3; k++)"},{"Add":" if (vec[k] == -1 || vec[k] == 1)"},{"Add":" break; // axial"},{"Add":" if (k != 3)"},{"Add":" continue; // only test non-axial edges"},{"Add":""},{"Add":" // try the six possible slanted axials from this edge"},{"Add":" for (axis = 0; axis < 3; axis++) {"},{"Add":" for (dir = -1; dir <= 1; dir += 2) {"},{"Add":" // construct a plane"},{"Add":" VectorClear(vec2);"},{"Add":" vec2[axis] = dir;"},{"Add":" CrossProduct(vec, vec2, normal);"},{"Add":" if (VectorNormalize(normal, normal) < 0.5)"},{"Add":" continue;"},{"Add":" dist = DotProduct(w->p[j], normal);"},{"Add":""},{"Add":" // if all the points on all the sides are"},{"Add":" // behind this plane, it is a proper edge bevel"},{"Add":" for (k = 0; k < b->numsides; k++) {"},{"Add":" // if this plane has allready been used, skip it"},{"Add":" if (PlaneEqual(&mapplanes[b->original_sides[k].planenum], normal, dist))"},{"Add":" break;"},{"Add":""},{"Add":" w2 = b->original_sides[k].winding;"},{"Add":" if (!w2)"},{"Add":" continue;"},{"Add":" for (l = 0; l < w2->numpoints; l++) {"},{"Add":" d = DotProduct(w2->p[l], normal) - dist;"},{"Add":" if (d > 0.1)"},{"Add":" break; // point in front"},{"Add":" }"},{"Add":" if (l != w2->numpoints)"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (k != b->numsides)"},{"Add":" continue; // wasn't part of the outer hull"},{"Add":""},{"Add":" // add this plane"},{"Add":" if (use_qbsp) {"},{"Add":" if (nummapbrushsides == MAX_MAP_BRUSHSIDES_QBSP)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES_QBSP\");"},{"Add":" } else if (nummapbrushsides == MAX_MAP_BRUSHSIDES)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES\");"},{"Add":""},{"Add":" nummapbrushsides++;"},{"Add":" s2 = &b->original_sides[b->numsides];"},{"Add":" s2->planenum = FindFloatPlane(normal, dist, b->brushnum);"},{"Add":" s2->texinfo = b->original_sides[0].texinfo;"},{"Add":" s2->contents = b->original_sides[0].contents;"},{"Add":" s2->bevel = true;"},{"Add":" c_edgebevels++;"},{"Add":" b->numsides++;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"MakeBrushWindings"},{"Add":""},{"Add":"makes basewindigs for sides and mins / maxs for the brush"},{"Add":"================"},{"Add":"*/"},{"Add":"void MakeBrushWindings(mapbrush_t *ob) {"},{"Add":" int32_t i, j;"},{"Add":" winding_t *w;"},{"Add":" side_t *side;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" ClearBounds(ob->mins, ob->maxs);"},{"Add":""},{"Add":" for (i = 0; i < ob->numsides; i++) {"},{"Add":" plane = &mapplanes[ob->original_sides[i].planenum];"},{"Add":" w = BaseWindingForPlane(plane->normal, plane->dist);"},{"Add":" for (j = 0; j < ob->numsides && w; j++) {"},{"Add":" if (i == j)"},{"Add":" continue;"},{"Add":" if (ob->original_sides[j].bevel)"},{"Add":" continue;"},{"Add":" plane = &mapplanes[ob->original_sides[j].planenum ^ 1];"},{"Add":" ChopWindingInPlace(&w, plane->normal, plane->dist, 0);"},{"Add":" }"},{"Add":""},{"Add":" side = &ob->original_sides[i];"},{"Add":" side->winding = w;"},{"Add":" if (w) {"},{"Add":" side->visible = true;"},{"Add":" for (j = 0; j < w->numpoints; j++)"},{"Add":" AddPointToBounds(w->p[j], ob->mins, ob->maxs);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (ob->mins[i] < -max_bounds || ob->maxs[i] > max_bounds) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: bounds out of range\\n\", ob->entitynum, ob->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" printf(\"bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" ob->mins[0], ob->mins[1], ob->mins[2], ob->maxs[0], ob->maxs[1], ob->maxs[2]);"},{"Add":" return;"},{"Add":" }"},{"Add":" if (ob->mins[i] > max_bounds || ob->maxs[i] < -max_bounds) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: no visible sides on brush\\n\", ob->entitynum, ob->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" printf(\"bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" ob->mins[0], ob->mins[1], ob->mins[2], ob->maxs[0], ob->maxs[1], ob->maxs[2]);"},{"Add":" return;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"ParseBrush"},{"Add":"================="},{"Add":"*/"},{"Add":"void ParseBrush(entity_t *mapent) {"},{"Add":" mapbrush_t *b;"},{"Add":" int32_t i, j, k;"},{"Add":" int32_t mt;"},{"Add":" side_t *side, *s2;"},{"Add":" int32_t planenum;"},{"Add":" brush_texture_t td;"},{"Add":" vec3_t planepts[3];"},{"Add":" vec_t UVaxis[6]; // DarkEssence: UV axis in 220 #mapversion"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (nummapbrushes == MAX_MAP_BRUSHES_QBSP)"},{"Add":" Error(\"nummapbrushes == MAX_MAP_BRUSHES_QBSP (%i)\", MAX_MAP_BRUSHES_QBSP);"},{"Add":" } else if (nummapbrushes == MAX_MAP_BRUSHES)"},{"Add":" Error(\"nummapbrushes == MAX_MAP_BRUSHES (%i)\", MAX_MAP_BRUSHES);"},{"Add":""},{"Add":" b = &mapbrushes[nummapbrushes];"},{"Add":" b->original_sides = &brushsides[nummapbrushsides];"},{"Add":" b->entitynum = num_entities - 1;"},{"Add":" b->brushnum = nummapbrushes - mapent->firstbrush;"},{"Add":""},{"Add":" do {"},{"Add":" if (!GetToken(true))"},{"Add":" break;"},{"Add":" if (!strcmp(token, \"}\"))"},{"Add":" break;"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (nummapbrushsides == MAX_MAP_BRUSHSIDES_QBSP)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES_QBSP\");"},{"Add":" } else if (nummapbrushsides == MAX_MAP_BRUSHSIDES)"},{"Add":" Error(\"MAX_MAP_BRUSHSIDES\");"},{"Add":" side = &brushsides[nummapbrushsides];"},{"Add":""},{"Add":" // read the three point plane definition"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (i != 0)"},{"Add":" GetToken(true);"},{"Add":" if (strcmp(token, \"(\"))"},{"Add":" Error(\"parsing brush %i\", i + 1);"},{"Add":""},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" GetToken(false);"},{"Add":" planepts[i][j] = atof(token);"},{"Add":" }"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" if (strcmp(token, \")\"))"},{"Add":" Error(\"parsing brush %i\", i + 1);"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // read the texturedef"},{"Add":" //"},{"Add":" GetToken(false);"},{"Add":" if (!strcmp(token, \"__TB_empty\")) {"},{"Add":" printf(\"Face without texture ( %s ) at line %i\\n\", token, scriptline + 1);"},{"Add":" }"},{"Add":" strcpy(td.name, token);"},{"Add":""},{"Add":" // DarkEssence: take parms according to mapversion"},{"Add":" if (g_nMapFileVersion < 220) // old #mapversion"},{"Add":" {"},{"Add":" GetToken(false);"},{"Add":" td.shift[0] = atoi(token);"},{"Add":" GetToken(false);"},{"Add":" td.shift[1] = atoi(token);"},{"Add":" } else // new #mapversion"},{"Add":" {"},{"Add":" GetToken(false);"},{"Add":" if (strcmp(token, \"[\")) {"},{"Add":" Error(\"missing '[ in texturedef\");"},{"Add":" }"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" UVaxis[0] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" UVaxis[1] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" UVaxis[2] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" td.shift[0] = atof(token);"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" if (strcmp(token, \"]\")) {"},{"Add":" Error(\"missing ']' in texturedef\");"},{"Add":" }"},{"Add":""},{"Add":" // texture V axis"},{"Add":" GetToken(false);"},{"Add":" if (strcmp(token, \"[\")) {"},{"Add":" Error(\"missing '[ in texturedef\");"},{"Add":" }"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" UVaxis[3] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" UVaxis[4] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" UVaxis[5] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" td.shift[1] = atof(token);"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" if (strcmp(token, \"]\")) {"},{"Add":" Error(\"missing ']' in texturedef\");"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" GetToken(false);"},{"Add":" td.rotate = atoi(token);"},{"Add":" GetToken(false);"},{"Add":" td.scale[0] = atof(token);"},{"Add":" GetToken(false);"},{"Add":" td.scale[1] = atof(token);"},{"Add":""},{"Add":" // find default flags and values"},{"Add":" mt = FindMiptex(td.name);"},{"Add":" td.flags = textureref[mt].flags;"},{"Add":" td.value = textureref[mt].value;"},{"Add":" side->contents = textureref[mt].contents;"},{"Add":" side->surf = td.flags = textureref[mt].flags;"},{"Add":""},{"Add":" if (TokenAvailable()) {"},{"Add":" GetToken(false);"},{"Add":" side->contents = atoi(token);"},{"Add":" GetToken(false);"},{"Add":" side->surf = td.flags = atoi(token);"},{"Add":" GetToken(false);"},{"Add":" td.value = atoi(token);"},{"Add":" }"},{"Add":""},{"Add":" // translucent objects are automatically classified as detail"},{"Add":" if (side->surf & (SURF_TRANS33 | SURF_TRANS66))"},{"Add":" side->contents |= CONTENTS_DETAIL;"},{"Add":" if (side->contents & (CONTENTS_PLAYERCLIP | CONTENTS_MONSTERCLIP))"},{"Add":" side->contents |= CONTENTS_DETAIL;"},{"Add":" if (fulldetail)"},{"Add":" side->contents &= ~CONTENTS_DETAIL;"},{"Add":" if (!(side->contents & ((LAST_VISIBLE_CONTENTS - 1) | CONTENTS_PLAYERCLIP | CONTENTS_MONSTERCLIP | CONTENTS_MIST)))"},{"Add":" side->contents |= CONTENTS_SOLID;"},{"Add":""},{"Add":" // qb: don't change SURF_SKIP contents"},{"Add":" if (noskipfix) {"},{"Add":" if (side->surf & SURF_HINT) {"},{"Add":" side->contents = 0;"},{"Add":" side->surf &= ~CONTENTS_DETAIL;"},{"Add":" }"},{"Add":" } else {"},{"Add":" // hints and skips have no contents"},{"Add":" if (side->surf & (SURF_HINT | SURF_SKIP)) {"},{"Add":" side->contents = 0;"},{"Add":" side->surf &= ~CONTENTS_DETAIL;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // find the plane number"},{"Add":" //"},{"Add":" planenum = PlaneFromPoints(planepts[0], planepts[1], planepts[2], b);"},{"Add":" if (planenum == -1) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: plane with no normal\\n\", b->entitynum, b->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // see if the plane has been used already"},{"Add":" //"},{"Add":" for (k = 0; k < b->numsides; k++) {"},{"Add":" s2 = b->original_sides + k;"},{"Add":" if (s2->planenum == planenum) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: duplicate plane\\n\", b->entitynum, b->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" break;"},{"Add":" }"},{"Add":" if (s2->planenum == (planenum ^ 1)) {"},{"Add":" printf(\"Entity %i, Brush %i, Line %i: mirrored plane\\n\", b->entitynum, b->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (k != b->numsides)"},{"Add":" continue; // duplicated"},{"Add":""},{"Add":" //"},{"Add":" // keep this side"},{"Add":" //"},{"Add":""},{"Add":" side = b->original_sides + b->numsides;"},{"Add":" side->planenum = planenum;"},{"Add":" if (g_nMapFileVersion < 220) // DarkEssence: texinfo #mapversion"},{"Add":" side->texinfo = TexinfoForBrushTexture(&mapplanes[planenum], &td, vec3_origin);"},{"Add":" else // texinfo for #mapversion 220"},{"Add":" side->texinfo = TexinfoForBrushTexture_UV(&td, UVaxis);"},{"Add":""},{"Add":" // save the td off in case there is an origin brush and we have to recalculate the texinfo"},{"Add":" side_brushtextures[nummapbrushsides] = td;"},{"Add":""},{"Add":" nummapbrushsides++;"},{"Add":" b->numsides++;"},{"Add":" } while (true);"},{"Add":""},{"Add":" // get the content for the entire brush"},{"Add":" b->contents = BrushContents(b);"},{"Add":""},{"Add":" // allow detail brushes to be removed"},{"Add":" if (nodetail && (b->contents & CONTENTS_DETAIL)) {"},{"Add":" b->numsides = 0;"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // allow water brushes to be removed"},{"Add":" if (nowater && (b->contents & (CONTENTS_LAVA | CONTENTS_SLIME | CONTENTS_WATER))) {"},{"Add":" b->numsides = 0;"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // create windings for sides and bounds for brush"},{"Add":" MakeBrushWindings(b);"},{"Add":""},{"Add":" // brushes that will not be visible at all will never be"},{"Add":" // used as bsp splitters"},{"Add":" if (b->contents & (CONTENTS_PLAYERCLIP | CONTENTS_MONSTERCLIP)) {"},{"Add":" c_clipbrushes++;"},{"Add":" for (i = 0; i < b->numsides; i++)"},{"Add":" b->original_sides[i].texinfo = TEXINFO_NODE;"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // origin brushes are removed, but they set the rotation origin for the rest of the brushes in the entity."},{"Add":" // After the entire entity is parsed, the planenums and texinfos will be adjusted for the origin brush"},{"Add":" //"},{"Add":" if (b->contents & CONTENTS_ORIGIN) {"},{"Add":" char string[32];"},{"Add":" vec3_t origin;"},{"Add":""},{"Add":" if (num_entities == 1) {"},{"Add":" Error(\"Entity %i, Brush %i, Line %i: origin brushes not allowed in world\", b->entitynum, b->brushnum, scriptline + 1); // qb: add scriptline"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" VectorAdd(b->mins, b->maxs, origin);"},{"Add":" VectorScale(origin, 0.5, origin);"},{"Add":""},{"Add":" sprintf(string, \"%i %i %i\", (int32_t)origin[0], (int32_t)origin[1], (int32_t)origin[2]);"},{"Add":" SetKeyValue(&entities[b->entitynum], \"origin\", string);"},{"Add":""},{"Add":" VectorCopy(origin, entities[b->entitynum].origin);"},{"Add":""},{"Add":" // don't keep this brush"},{"Add":" b->numsides = 0;"},{"Add":""},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" AddBrushBevels(b);"},{"Add":""},{"Add":" nummapbrushes++;"},{"Add":" mapent->numbrushes++;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"MoveBrushesToWorld"},{"Add":""},{"Add":"Takes all of the brushes from the current entity and"},{"Add":"adds them to the world's brush list."},{"Add":""},{"Add":"Used by func_group and func_areaportal"},{"Add":"================"},{"Add":"*/"},{"Add":"void MoveBrushesToWorld(entity_t *mapent) {"},{"Add":" int32_t newbrushes;"},{"Add":" int32_t worldbrushes;"},{"Add":" mapbrush_t *temp;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" // this is pretty gross, because the brushes are expected to be"},{"Add":" // in linear order for each entity"},{"Add":""},{"Add":" newbrushes = mapent->numbrushes;"},{"Add":" worldbrushes = entities[0].numbrushes;"},{"Add":""},{"Add":" temp = malloc(newbrushes * sizeof(mapbrush_t));"},{"Add":" memcpy(temp, mapbrushes + mapent->firstbrush, newbrushes * sizeof(mapbrush_t));"},{"Add":""},{"Add":"#if 0 // let them keep their original brush numbers"},{"Add":" for (i=0 ; inumbrushes = 0;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"ParseMapEntity"},{"Add":"================"},{"Add":"*/"},{"Add":"qboolean ParseMapEntity(void) {"},{"Add":" mapbrush_t *b;"},{"Add":""},{"Add":" if (!GetToken(true))"},{"Add":" return false;"},{"Add":""},{"Add":" if (strcmp(token, \"{\"))"},{"Add":" Error(\"ParseEntity: { not found\");"},{"Add":""},{"Add":" if (use_qbsp) {"},{"Add":" if (num_entities == WARN_MAP_ENTITIES_QBSP)"},{"Add":" printf(\"WARNING: num_entities may exceed protocol limit (%i)\", WARN_MAP_ENTITIES_QBSP);"},{"Add":" if (num_entities == max_entities)"},{"Add":" Error(\"num_entities exceeds MAX_MAP_ENTITIES_QBSP (%i)\", MAX_MAP_ENTITIES_QBSP);"},{"Add":" } else {"},{"Add":" if (num_entities == DEFAULT_MAP_ENTITIES)"},{"Add":" printf(\"WARNING: num_entities exceeds vanilla limit (%i)\", DEFAULT_MAP_ENTITIES);"},{"Add":" if (num_entities == max_entities) // qb: from kmqbsp3 Knightmare changed- was MAX_MAP_ENTITIES"},{"Add":" Error(\"num_entities exceeds MAX_MAP_ENTITIES (%i)\", MAX_MAP_ENTITIES);"},{"Add":" }"},{"Add":""},{"Add":" entity_t *mapent = &entities[num_entities];"},{"Add":" num_entities++;"},{"Add":" memset(mapent, 0, sizeof(*mapent));"},{"Add":" mapent->firstbrush = nummapbrushes;"},{"Add":" mapent->numbrushes = 0;"},{"Add":" //\tmapent->portalareas[0] = -1;"},{"Add":" //\tmapent->portalareas[1] = -1;"},{"Add":""},{"Add":" do {"},{"Add":" if (!GetToken(true))"},{"Add":" Error(\"ParseEntity: EOF without closing brace\");"},{"Add":" if (!strcmp(token, \"}\"))"},{"Add":" break;"},{"Add":""},{"Add":" if (!strcmp(token, \"{\")) {"},{"Add":" ParseBrush(mapent);"},{"Add":" } else {"},{"Add":" epair_t *e = ParseEpair();"},{"Add":" e->next = mapent->epairs;"},{"Add":" mapent->epairs = e;"},{"Add":""},{"Add":" if (!strcmp(e->key, \"mapversion\")) // DarkEssence: set #mapversion"},{"Add":" {"},{"Add":" g_nMapFileVersion = atoi(e->value); // or keep default value - 0"},{"Add":" RemoveLastEpair(mapent);"},{"Add":" }"},{"Add":" }"},{"Add":" } while (true);"},{"Add":""},{"Add":" GetVectorForKey(mapent, \"origin\", mapent->origin);"},{"Add":""},{"Add":" //"},{"Add":" // if there was an origin brush, offset all of the planes and texinfo"},{"Add":" //"},{"Add":" if (mapent->origin[0] || mapent->origin[1] || mapent->origin[2]) {"},{"Add":" for (int32_t i = 0; i < mapent->numbrushes; i++) {"},{"Add":" b = &mapbrushes[mapent->firstbrush + i];"},{"Add":" for (int32_t j = 0; j < b->numsides; j++) {"},{"Add":" side_t *s = &b->original_sides[j];"},{"Add":" const vec_t newdist = mapplanes[s->planenum].dist - DotProduct(mapplanes[s->planenum].normal, mapent->origin);"},{"Add":" s->planenum = FindFloatPlane(mapplanes[s->planenum].normal, newdist, b->brushnum);"},{"Add":""},{"Add":" if (g_nMapFileVersion < 220) // mxd"},{"Add":" s->texinfo = TexinfoForBrushTexture(&mapplanes[s->planenum], &side_brushtextures[s - brushsides], mapent->origin);"},{"Add":" else"},{"Add":" s->texinfo = ApplyTexinfoOffset_UV(s->texinfo, &side_brushtextures[s - brushsides], mapent->origin);"},{"Add":" }"},{"Add":""},{"Add":" MakeBrushWindings(b);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // group entities are just for editor convenience"},{"Add":" // toss all brushes into the world entity"},{"Add":" if (!strcmp(\"func_group\", ValueForKey(mapent, \"classname\"))) {"},{"Add":" MoveBrushesToWorld(mapent);"},{"Add":" mapent->numbrushes = 0;"},{"Add":" return true;"},{"Add":" }"},{"Add":""},{"Add":" // areaportal entities move their brushes, but don't eliminate"},{"Add":" // the entity"},{"Add":" if (!strcmp(\"func_areaportal\", ValueForKey(mapent, \"classname\"))) {"},{"Add":" char str[128];"},{"Add":""},{"Add":" if (mapent->numbrushes != 1)"},{"Add":" Error(\"Entity %i: func_areaportal can only be a single brush\", num_entities - 1);"},{"Add":""},{"Add":" b = &mapbrushes[nummapbrushes - 1];"},{"Add":" b->contents = CONTENTS_AREAPORTAL;"},{"Add":" c_areaportals++;"},{"Add":" mapent->areaportalnum = c_areaportals;"},{"Add":" // set the portal number as \"style\""},{"Add":" sprintf(str, \"%i\", c_areaportals);"},{"Add":" SetKeyValue(mapent, \"style\", str);"},{"Add":" MoveBrushesToWorld(mapent);"},{"Add":" return true;"},{"Add":" }"},{"Add":""},{"Add":" return true;"},{"Add":"}"},{"Add":""},{"Add":"//==================================================================="},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"LoadMapFile"},{"Add":"================"},{"Add":"*/"},{"Add":"void LoadMapFile(char *filename) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" qprintf(\"--- LoadMapFile ---\\n\");"},{"Add":""},{"Add":" LoadScriptFile(filename);"},{"Add":""},{"Add":" nummapbrushsides = 0;"},{"Add":" num_entities = 0;"},{"Add":""},{"Add":" while (ParseMapEntity()) {"},{"Add":" }"},{"Add":""},{"Add":" ClearBounds(map_mins, map_maxs);"},{"Add":" for (i = 0; i < entities[0].numbrushes; i++) {"},{"Add":" if (mapbrushes[i].mins[0] > max_bounds)"},{"Add":" continue; // no valid points"},{"Add":" AddPointToBounds(mapbrushes[i].mins, map_mins, map_maxs);"},{"Add":" AddPointToBounds(mapbrushes[i].maxs, map_mins, map_maxs);"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"%5i brushes\\n\", nummapbrushes);"},{"Add":" qprintf(\"%5i clipbrushes\\n\", c_clipbrushes);"},{"Add":" qprintf(\"%5i total sides\\n\", nummapbrushsides);"},{"Add":" qprintf(\"%5i boxbevels\\n\", c_boxbevels);"},{"Add":" qprintf(\"%5i edgebevels\\n\", c_edgebevels);"},{"Add":" qprintf(\"%5i entities\\n\", num_entities);"},{"Add":" qprintf(\"%5i planes\\n\", nummapplanes);"},{"Add":" qprintf(\"%5i areaportals\\n\", c_areaportals);"},{"Add":" qprintf(\"size: %5.0f,%5.0f,%5.0f to %5.0f,%5.0f,%5.0f\\n\", map_mins[0], map_mins[1], map_mins[2],"},{"Add":" map_maxs[0], map_maxs[1], map_maxs[2]);"},{"Add":""},{"Add":" //\tTestExpandBrushes ();"},{"Add":"}"},{"Add":""},{"Add":"//===================================================================="},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"TestExpandBrushes"},{"Add":""},{"Add":"Expands all the brush planes and saves a new map out"},{"Add":"================"},{"Add":"*/"},{"Add":"void TestExpandBrushes(void) {"},{"Add":" FILE *f;"},{"Add":" side_t *s;"},{"Add":" int32_t i, j, bn;"},{"Add":" winding_t *w;"},{"Add":" char *name = \"expanded.map\";"},{"Add":" mapbrush_t *brush;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" f = fopen(name, \"wb\");"},{"Add":" if (!f)"},{"Add":" Error(\"Can't write %s\\b\", name);"},{"Add":""},{"Add":" fprintf(f, \"{\\n\\\"classname\\\" \\\"worldspawn\\\"\\n\");"},{"Add":""},{"Add":" for (bn = 0; bn < nummapbrushes; bn++) {"},{"Add":" brush = &mapbrushes[bn];"},{"Add":" fprintf(f, \"{\\n\");"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" s = brush->original_sides + i;"},{"Add":" dist = mapplanes[s->planenum].dist;"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" dist += fabs(16 * mapplanes[s->planenum].normal[j]);"},{"Add":""},{"Add":" w = BaseWindingForPlane(mapplanes[s->planenum].normal, dist);"},{"Add":""},{"Add":" fprintf(f, \"( %g %g %g ) \", w->p[0][0], w->p[0][1], w->p[0][2]);"},{"Add":" fprintf(f, \"( %g %g %g ) \", w->p[1][0], w->p[1][1], w->p[1][2]);"},{"Add":" fprintf(f, \"( %g %g %g ) \", w->p[2][0], w->p[2][1], w->p[2][2]);"},{"Add":""},{"Add":" fprintf(f, \"%s 0 0 0 1 1\\n\", texinfo[s->texinfo].texture);"},{"Add":" FreeWinding(w);"},{"Add":" }"},{"Add":" fprintf(f, \"}\\n\");"},{"Add":" }"},{"Add":" fprintf(f, \"}\\n\");"},{"Add":""},{"Add":" fclose(f);"},{"Add":""},{"Add":" Error(\"can't proceed after expanding brushes\");"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"leakfile.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"/*"},{"Add":"=============================================================================="},{"Add":""},{"Add":"LEAF FILE GENERATION"},{"Add":""},{"Add":"Save out name.line for qe3 to read"},{"Add":"=============================================================================="},{"Add":"*/"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"LeakFile"},{"Add":""},{"Add":"Finds the shortest possible chain of portals"},{"Add":"that leads from the outside leaf to a specifically"},{"Add":"occupied leaf"},{"Add":"============="},{"Add":"*/"},{"Add":"void LeakFile(tree_t *tree) {"},{"Add":" vec3_t mid;"},{"Add":" FILE *linefile;"},{"Add":" char filename[1030];"},{"Add":" node_t *node;"},{"Add":" int32_t count;"},{"Add":""},{"Add":" if (!tree->outside_node.occupied)"},{"Add":" return;"},{"Add":""},{"Add":" qprintf(\"--- LeakFile ---\\n\");"},{"Add":""},{"Add":" //"},{"Add":" // write the points to the file"},{"Add":" //"},{"Add":" sprintf(filename, \"%s.pts\", source);"},{"Add":" linefile = fopen(filename, \"w\");"},{"Add":" if (!linefile)"},{"Add":" Error(\"Couldn't open %s\\n\", filename);"},{"Add":""},{"Add":" count = 0;"},{"Add":" node = &tree->outside_node;"},{"Add":" while (node->occupied > 1) {"},{"Add":" int32_t next;"},{"Add":" portal_t *p, *nextportal = NULL;"},{"Add":" node_t *nextnode = NULL;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" // find the best portal exit"},{"Add":" next = node->occupied;"},{"Add":" for (p = node->portals; p; p = p->next[!s]) {"},{"Add":" s = (p->nodes[0] == node);"},{"Add":" if (p->nodes[s]->occupied && p->nodes[s]->occupied < next) {"},{"Add":" nextportal = p;"},{"Add":" nextnode = p->nodes[s];"},{"Add":" next = nextnode->occupied;"},{"Add":" }"},{"Add":" }"},{"Add":" node = nextnode;"},{"Add":" if (nextportal) // qb: could be NULL"},{"Add":" {"},{"Add":" WindingCenter(nextportal->winding, mid);"},{"Add":" fprintf(linefile, \"%f %f %f\\n\", mid[0], mid[1], mid[2]);"},{"Add":" }"},{"Add":""},{"Add":" count++;"},{"Add":" }"},{"Add":" // add the occupant center"},{"Add":" GetVectorForKey(node->occupant, \"origin\", mid);"},{"Add":""},{"Add":" fprintf(linefile, \"%f %f %f\\n\", mid[0], mid[1], mid[2]);"},{"Add":" qprintf(\"%5i point linefile\\n\", count + 1);"},{"Add":""},{"Add":" fclose(linefile);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"faces.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"/*"},{"Add":""},{"Add":" some faces will be removed before saving, but still form nodes:"},{"Add":""},{"Add":" the insides of sky volumes"},{"Add":" meeting planes of different water current volumes"},{"Add":""},{"Add":"*/"},{"Add":""},{"Add":"#define INTEGRAL_EPSILON 0.01"},{"Add":""},{"Add":"// qb: was 0.5. fix by tapir to 0.1 via jdolan on insideqc."},{"Add":"//qb: update- 0.1 causes gaps. Possibly just needs to be slightly less than OFF_EPSILON"},{"Add":"#define POINT_EPSILON 0.49 "},{"Add":""},{"Add":"#define OFF_EPSILON 0.5"},{"Add":""},{"Add":"extern brush_texture_t side_brushtextures[MAX_MAP_SIDES]; // qb: kmbsp3: caulk"},{"Add":"int32_t c_merge;"},{"Add":"int32_t c_subdivide;"},{"Add":""},{"Add":"int32_t c_totalverts;"},{"Add":"int32_t c_uniqueverts;"},{"Add":"int32_t c_degenerate;"},{"Add":"int32_t c_tjunctions;"},{"Add":"int32_t c_faceoverflows;"},{"Add":"int32_t c_facecollapse;"},{"Add":"int32_t c_badstartverts;"},{"Add":""},{"Add":"#define MAX_SUPERVERTS 512"},{"Add":"int32_t superverts[MAX_SUPERVERTS];"},{"Add":"int32_t numsuperverts;"},{"Add":""},{"Add":"face_t *edgefaces[MAX_MAP_EDGES_QBSP][2];"},{"Add":"int32_t firstmodeledge = 1;"},{"Add":"int32_t firstmodelface;"},{"Add":""},{"Add":"int32_t c_tryedges;"},{"Add":""},{"Add":"vec3_t edge_dir;"},{"Add":"vec3_t edge_start;"},{"Add":"vec_t edge_len;"},{"Add":""},{"Add":"int32_t num_edge_verts;"},{"Add":"int32_t edge_verts[MAX_MAP_VERTS_QBSP];"},{"Add":""},{"Add":"float subdivide_size = 240;"},{"Add":"float sublight_size = 240;"},{"Add":""},{"Add":"face_t *NewFaceFromFace(face_t *f);"},{"Add":""},{"Add":"//==========================================================================="},{"Add":""},{"Add":"typedef struct hashvert_s {"},{"Add":" struct hashvert_s *next;"},{"Add":" int32_t num;"},{"Add":"} hashvert_t;"},{"Add":""},{"Add":"#define HASH_SIZE MAX_POINTS_HASH // qb: per kmbsp3. Was 64"},{"Add":""},{"Add":"int32_t vertexchain[MAX_MAP_VERTS_QBSP]; // the next vertex in a hash chain"},{"Add":"int32_t hashverts[HASH_SIZE * HASH_SIZE]; // a vertex number, or 0 for no verts"},{"Add":""},{"Add":"//============================================================================"},{"Add":""},{"Add":"unsigned HashVec(vec3_t vec) {"},{"Add":" int32_t x, y;"},{"Add":""},{"Add":" x = (max_bounds + (int32_t)(vec[0] + 0.5)) >> 7;"},{"Add":" y = (max_bounds + (int32_t)(vec[1] + 0.5)) >> 7;"},{"Add":" if (x < 0 || x >= HASH_SIZE || y < 0 || y >= HASH_SIZE)"},{"Add":" Error(\"HashVec: point outside valid range\");"},{"Add":""},{"Add":" return y * HASH_SIZE + x;"},{"Add":"}"},{"Add":"vec_t g_min_vertex_diff_sq = BOGUS_RANGE; // jitdebug"},{"Add":"vec3_t g_min_vertex_pos; // jitdebug"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"GetVertex"},{"Add":""},{"Add":"Uses hashing"},{"Add":"============="},{"Add":"*/"},{"Add":"int32_t GetVertexnum(vec3_t in) {"},{"Add":" int32_t h;"},{"Add":" int32_t i;"},{"Add":" float *p;"},{"Add":" vec3_t vert;"},{"Add":" int32_t vnum;"},{"Add":""},{"Add":" c_totalverts++;"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (fabs(in[i] - Q_rint(in[i])) < INTEGRAL_EPSILON)"},{"Add":" vert[i] = Q_rint(in[i]);"},{"Add":" else"},{"Add":" vert[i] = in[i];"},{"Add":" }"},{"Add":""},{"Add":" h = HashVec(vert);"},{"Add":""},{"Add":" for (vnum = hashverts[h]; vnum; vnum = vertexchain[vnum]) {"},{"Add":" vec3_t diff;"},{"Add":" vec_t length_sq; // jit"},{"Add":" p = dvertexes[vnum].point;"},{"Add":" VectorSubtract(p, vert, diff); // jit"},{"Add":" length_sq = VectorLengthSq(diff); // jit"},{"Add":""},{"Add":" if (length_sq < POINT_EPSILON * POINT_EPSILON)"},{"Add":" return vnum;"},{"Add":" if (length_sq < g_min_vertex_diff_sq) // jitdebug"},{"Add":" {"},{"Add":" g_min_vertex_diff_sq = length_sq; // jitdebug"},{"Add":" VectorCopy(p, g_min_vertex_pos);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // emit a vertex"},{"Add":" if (use_qbsp) {"},{"Add":" if (numvertexes == MAX_MAP_VERTS_QBSP)"},{"Add":" Error(\"MAX_MAP_VERTS_QBSP\");"},{"Add":" } else if (numvertexes == MAX_MAP_VERTS)"},{"Add":" Error(\"MAX_MAP_VERTS\");"},{"Add":""},{"Add":" dvertexes[numvertexes].point[0] = vert[0];"},{"Add":" dvertexes[numvertexes].point[1] = vert[1];"},{"Add":" dvertexes[numvertexes].point[2] = vert[2];"},{"Add":""},{"Add":" vertexchain[numvertexes] = hashverts[h];"},{"Add":" hashverts[h] = numvertexes;"},{"Add":""},{"Add":" c_uniqueverts++;"},{"Add":""},{"Add":" numvertexes++;"},{"Add":""},{"Add":" return numvertexes - 1;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"FaceFromSuperverts"},{"Add":""},{"Add":"The faces vertexes have beeb added to the superverts[] array,"},{"Add":"and there may be more there than can be held in a face (MAXEDGES)."},{"Add":""},{"Add":"If less, the faces vertexnums[] will be filled in, otherwise"},{"Add":"face will reference a tree of split[] faces until all of the"},{"Add":"vertexnums can be added."},{"Add":""},{"Add":"superverts[base] will become face->vertexnums[0], and the others"},{"Add":"will be circularly filled in."},{"Add":"=================="},{"Add":"*/"},{"Add":"void FaceFromSuperverts(node_t *node, face_t *f, int32_t base) {"},{"Add":" face_t *newf;"},{"Add":" int32_t remaining;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" remaining = numsuperverts;"},{"Add":" while (remaining > MAXEDGES) {"},{"Add":" // must split into two faces, because of vertex overload"},{"Add":" c_faceoverflows++;"},{"Add":""},{"Add":" newf = f->split[0] = NewFaceFromFace(f);"},{"Add":" newf = f->split[0];"},{"Add":" newf->next = node->faces;"},{"Add":" node->faces = newf;"},{"Add":""},{"Add":" newf->numpoints = MAXEDGES;"},{"Add":" for (i = 0; i < MAXEDGES; i++)"},{"Add":" newf->vertexnums[i] = superverts[(i + base) % numsuperverts];"},{"Add":""},{"Add":" f->split[1] = NewFaceFromFace(f);"},{"Add":" f = f->split[1];"},{"Add":" f->next = node->faces;"},{"Add":" node->faces = f;"},{"Add":""},{"Add":" remaining -= (MAXEDGES - 2);"},{"Add":" base = (base + MAXEDGES - 1) % numsuperverts;"},{"Add":" }"},{"Add":""},{"Add":" // copy the vertexes back to the face"},{"Add":" f->numpoints = remaining;"},{"Add":" for (i = 0; i < remaining; i++)"},{"Add":" f->vertexnums[i] = superverts[(i + base) % numsuperverts];"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"EmitFaceVertexes"},{"Add":"=================="},{"Add":"*/"},{"Add":"void EmitFaceVertexes(node_t *node, face_t *f) {"},{"Add":" winding_t *w;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" if (f->merged || f->split[0] || f->split[1])"},{"Add":" return;"},{"Add":""},{"Add":" w = f->w;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" if (noweld) {"},{"Add":" // make every point unique"},{"Add":" if (use_qbsp) {"},{"Add":" if (numvertexes == MAX_MAP_VERTS_QBSP)"},{"Add":" Error(\"MAX_MAP_VERTS_QBSP\");"},{"Add":" } else if (numvertexes == MAX_MAP_VERTS)"},{"Add":" Error(\"MAX_MAP_VERTS\");"},{"Add":" superverts[i] = numvertexes;"},{"Add":" VectorCopy(w->p[i], dvertexes[numvertexes].point);"},{"Add":" numvertexes++;"},{"Add":" c_uniqueverts++;"},{"Add":" c_totalverts++;"},{"Add":" } else"},{"Add":" superverts[i] = GetVertexnum(w->p[i]);"},{"Add":" }"},{"Add":" numsuperverts = w->numpoints;"},{"Add":""},{"Add":" // this may fragment the face if > MAXEDGES"},{"Add":" FaceFromSuperverts(node, f, 0);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"EmitVertexes_r"},{"Add":"=================="},{"Add":"*/"},{"Add":"void EmitVertexes_r(node_t *node) {"},{"Add":" int32_t i;"},{"Add":" face_t *f;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":""},{"Add":" for (f = node->faces; f; f = f->next) {"},{"Add":" EmitFaceVertexes(node, f);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < 2; i++)"},{"Add":" EmitVertexes_r(node->children[i]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=========="},{"Add":"FindEdgeVerts"},{"Add":""},{"Add":"Uses the hash tables to cut down to a small number"},{"Add":"=========="},{"Add":"*/"},{"Add":"void FindEdgeVerts(vec3_t v1, vec3_t v2) {"},{"Add":" int32_t x1, x2, y1, y2, t;"},{"Add":" int32_t x, y;"},{"Add":" int32_t vnum;"},{"Add":""},{"Add":" x1 = (max_bounds + (int32_t)(v1[0] + 0.5)) >> 7;"},{"Add":" y1 = (max_bounds + (int32_t)(v1[1] + 0.5)) >> 7;"},{"Add":" x2 = (max_bounds + (int32_t)(v2[0] + 0.5)) >> 7;"},{"Add":" y2 = (max_bounds + (int32_t)(v2[1] + 0.5)) >> 7;"},{"Add":""},{"Add":" if (x1 > x2) {"},{"Add":" t = x1;"},{"Add":" x1 = x2;"},{"Add":" x2 = t;"},{"Add":" }"},{"Add":" if (y1 > y2) {"},{"Add":" t = y1;"},{"Add":" y1 = y2;"},{"Add":" y2 = t;"},{"Add":" }"},{"Add":""},{"Add":" num_edge_verts = 0;"},{"Add":" for (x = x1; x <= x2; x++) {"},{"Add":" for (y = y1; y <= y2; y++) {"},{"Add":" for (vnum = hashverts[y * HASH_SIZE + x]; vnum; vnum = vertexchain[vnum]) {"},{"Add":" edge_verts[num_edge_verts++] = vnum;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=========="},{"Add":"TestEdge"},{"Add":""},{"Add":"Can be recursively reentered"},{"Add":"=========="},{"Add":"*/"},{"Add":"void TestEdge(vec_t start, vec_t end, int32_t p1, int32_t p2, int32_t startvert) {"},{"Add":" int32_t j, k;"},{"Add":" vec_t dist;"},{"Add":" vec3_t delta;"},{"Add":" vec3_t exact;"},{"Add":" vec3_t off;"},{"Add":" vec_t error;"},{"Add":" vec3_t p;"},{"Add":""},{"Add":" if (p1 == p2) {"},{"Add":" c_degenerate++;"},{"Add":" return; // degenerate edge"},{"Add":" }"},{"Add":""},{"Add":" for (k = startvert; k < num_edge_verts; k++) {"},{"Add":" j = edge_verts[k];"},{"Add":" if (j == p1 || j == p2)"},{"Add":" continue;"},{"Add":""},{"Add":" VectorCopy(dvertexes[j].point, p);"},{"Add":""},{"Add":" VectorSubtract(p, edge_start, delta);"},{"Add":" dist = DotProduct(delta, edge_dir);"},{"Add":" if (dist <= start || dist >= end)"},{"Add":" continue; // off an end"},{"Add":" VectorMA(edge_start, dist, edge_dir, exact);"},{"Add":" VectorSubtract(p, exact, off);"},{"Add":" error = VectorLength(off);"},{"Add":""},{"Add":" if (fabs(error) > OFF_EPSILON)"},{"Add":" continue; // not on the edge"},{"Add":""},{"Add":" // break the edge"},{"Add":" c_tjunctions++;"},{"Add":" TestEdge(start, dist, p1, j, k + 1);"},{"Add":" TestEdge(dist, end, j, p2, k + 1);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // the edge p1 to p2 is now free of tjunctions"},{"Add":" if (numsuperverts >= MAX_SUPERVERTS)"},{"Add":" Error(\"MAX_SUPERVERTS\");"},{"Add":" superverts[numsuperverts] = p1;"},{"Add":" numsuperverts++;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"FixFaceEdges"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"void FixFaceEdges(node_t *node, face_t *f) {"},{"Add":" int32_t p1, p2;"},{"Add":" int32_t i;"},{"Add":" vec3_t e2;"},{"Add":" vec_t len;"},{"Add":" int32_t count[MAX_SUPERVERTS], start[MAX_SUPERVERTS];"},{"Add":" int32_t base;"},{"Add":""},{"Add":" if (f->merged || f->split[0] || f->split[1])"},{"Add":" return;"},{"Add":""},{"Add":" numsuperverts = 0;"},{"Add":""},{"Add":" for (i = 0; i < f->numpoints; i++) {"},{"Add":" p1 = f->vertexnums[i];"},{"Add":" p2 = f->vertexnums[(i + 1) % f->numpoints];"},{"Add":""},{"Add":" VectorCopy(dvertexes[p1].point, edge_start);"},{"Add":" VectorCopy(dvertexes[p2].point, e2);"},{"Add":""},{"Add":" FindEdgeVerts(edge_start, e2);"},{"Add":""},{"Add":" VectorSubtract(e2, edge_start, edge_dir);"},{"Add":" len = VectorNormalize(edge_dir, edge_dir);"},{"Add":""},{"Add":" start[i] = numsuperverts;"},{"Add":" TestEdge(0, len, p1, p2, 0);"},{"Add":""},{"Add":" count[i] = numsuperverts - start[i];"},{"Add":" }"},{"Add":""},{"Add":" if (numsuperverts < 3) {"},{"Add":" // entire face collapsed"},{"Add":" f->numpoints = 0;"},{"Add":" c_facecollapse++;"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // we want to pick a vertex that doesn't have tjunctions"},{"Add":" // on either side, which can cause artifacts on trifans,"},{"Add":" // especially underwater"},{"Add":" for (i = 0; i < f->numpoints; i++) {"},{"Add":" if (count[i] == 1 && count[(i + f->numpoints - 1) % f->numpoints] == 1)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (i == f->numpoints) {"},{"Add":" f->badstartvert = true;"},{"Add":" c_badstartverts++;"},{"Add":" base = 0;"},{"Add":" } else {"},{"Add":" // rotate the vertex order"},{"Add":" base = start[i];"},{"Add":" }"},{"Add":""},{"Add":" // this may fragment the face if > MAXEDGES"},{"Add":" FaceFromSuperverts(node, f, base);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"FixEdges_r"},{"Add":"=================="},{"Add":"*/"},{"Add":"void FixEdges_r(node_t *node) {"},{"Add":" int32_t i;"},{"Add":" face_t *f;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF)"},{"Add":" return;"},{"Add":""},{"Add":" for (f = node->faces; f; f = f->next)"},{"Add":" FixFaceEdges(node, f);"},{"Add":""},{"Add":" for (i = 0; i < 2; i++)"},{"Add":" FixEdges_r(node->children[i]);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==========="},{"Add":"FixTjuncs"},{"Add":""},{"Add":"==========="},{"Add":"*/"},{"Add":"void FixTjuncs(node_t *headnode) {"},{"Add":" // snap and merge all vertexes"},{"Add":" qprintf(\"---- snap verts ----\\n\");"},{"Add":" memset(hashverts, 0, sizeof(hashverts));"},{"Add":" c_totalverts = 0;"},{"Add":" c_uniqueverts = 0;"},{"Add":" c_faceoverflows = 0;"},{"Add":" EmitVertexes_r(headnode);"},{"Add":" qprintf(\"%i unique from %i\\n\", c_uniqueverts, c_totalverts);"},{"Add":""},{"Add":" // break edges on tjunctions"},{"Add":" qprintf(\"---- tjunc ----\\n\");"},{"Add":" c_tryedges = 0;"},{"Add":" c_degenerate = 0;"},{"Add":" c_facecollapse = 0;"},{"Add":" c_tjunctions = 0;"},{"Add":" if (!notjunc)"},{"Add":" FixEdges_r(headnode);"},{"Add":" qprintf(\"%5i edges degenerated\\n\", c_degenerate);"},{"Add":" qprintf(\"%5i faces degenerated\\n\", c_facecollapse);"},{"Add":" qprintf(\"%5i edges added by tjunctions\\n\", c_tjunctions);"},{"Add":" qprintf(\"%5i faces added by tjunctions\\n\", c_faceoverflows);"},{"Add":" qprintf(\"%5i bad start verts\\n\", c_badstartverts);"},{"Add":"}"},{"Add":""},{"Add":"//========================================================"},{"Add":""},{"Add":"int32_t c_faces;"},{"Add":""},{"Add":"face_t *AllocFace(void) {"},{"Add":" face_t *f;"},{"Add":""},{"Add":" f = malloc(sizeof(face_t));"},{"Add":" memset(f, 0, sizeof(face_t));"},{"Add":" c_faces++;"},{"Add":""},{"Add":" return f;"},{"Add":"}"},{"Add":""},{"Add":"face_t *NewFaceFromFace(face_t *f) {"},{"Add":" face_t *newf;"},{"Add":""},{"Add":" newf = AllocFace();"},{"Add":" *newf = *f;"},{"Add":" newf->merged = NULL;"},{"Add":" newf->split[0] = newf->split[1] = NULL;"},{"Add":" newf->w = NULL;"},{"Add":" return newf;"},{"Add":"}"},{"Add":""},{"Add":"void FreeFace(face_t *f) {"},{"Add":" if (f->w)"},{"Add":" FreeWinding(f->w);"},{"Add":" free(f);"},{"Add":" c_faces--;"},{"Add":"}"},{"Add":""},{"Add":"//========================================================"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"GetEdge"},{"Add":""},{"Add":"Called by writebsp."},{"Add":"Don't allow four way edges"},{"Add":"=================="},{"Add":"*/"},{"Add":"int32_t GetEdge(int32_t v1, int32_t v2, face_t *f) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" c_tryedges++;"},{"Add":""},{"Add":" if (!noshare) {"},{"Add":" if (use_qbsp) {"},{"Add":" dedge_tx *edge;"},{"Add":" for (i = firstmodeledge; i < numedges; i++) {"},{"Add":" edge = &dedgesX[i];"},{"Add":" if (v1 == edge->v[1] && v2 == edge->v[0] && edgefaces[i][0]->contents == f->contents) {"},{"Add":" if (edgefaces[i][1])"},{"Add":" //\t\t\t\tprintf (\"WARNING: multiple backward edge\\n\");"},{"Add":" continue;"},{"Add":" edgefaces[i][1] = f;"},{"Add":" return -i;"},{"Add":" }"},{"Add":" }"},{"Add":" // emit an edge"},{"Add":" if (numedges >= MAX_MAP_EDGES_QBSP)"},{"Add":" Error(\"numedges == MAX_MAP_EDGES_QBSP\");"},{"Add":" edge = &dedgesX[numedges];"},{"Add":" numedges++;"},{"Add":" edge->v[0] = v1;"},{"Add":" edge->v[1] = v2;"},{"Add":" edgefaces[numedges - 1][0] = f;"},{"Add":" } else {"},{"Add":" dedge_t *edge;"},{"Add":" for (i = firstmodeledge; i < numedges; i++) {"},{"Add":" edge = &dedges[i];"},{"Add":" if (v1 == edge->v[1] && v2 == edge->v[0] && edgefaces[i][0]->contents == f->contents) {"},{"Add":" if (edgefaces[i][1])"},{"Add":" //\t\t\t\tprintf (\"WARNING: multiple backward edge\\n\");"},{"Add":" continue;"},{"Add":" edgefaces[i][1] = f;"},{"Add":" return -i;"},{"Add":" }"},{"Add":" }"},{"Add":" // emit an edge"},{"Add":" if (numedges >= MAX_MAP_EDGES)"},{"Add":" Error(\"numedges == MAX_MAP_EDGES\");"},{"Add":" edge = &dedges[numedges];"},{"Add":" numedges++;"},{"Add":" edge->v[0] = v1;"},{"Add":" edge->v[1] = v2;"},{"Add":" edgefaces[numedges - 1][0] = f;"},{"Add":" }"},{"Add":" }"},{"Add":" return numedges - 1;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==========================================================================="},{"Add":""},{"Add":"FACE MERGING"},{"Add":""},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#define CONTINUOUS_EPSILON 0.001"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"TryMergeWinding"},{"Add":""},{"Add":"If two polygons share a common edge and the edges that meet at the"},{"Add":"common points are both inside the other polygons, merge them"},{"Add":""},{"Add":"Returns NULL if the faces couldn't be merged, or the new face."},{"Add":"The originals will NOT be freed."},{"Add":"============="},{"Add":"*/"},{"Add":"winding_t *TryMergeWinding(winding_t *f1, winding_t *f2, vec3_t planenormal) {"},{"Add":" vec_t *p1, *p2, *p3, *p4, *back;"},{"Add":" winding_t *newf;"},{"Add":" int32_t i, j, k, l;"},{"Add":" vec3_t normal, delta;"},{"Add":" vec_t dot;"},{"Add":" qboolean keep1, keep2;"},{"Add":""},{"Add":" //"},{"Add":" // find a common edge"},{"Add":" //"},{"Add":" p1 = p2 = NULL; // stop compiler warning"},{"Add":" j = 0; //"},{"Add":""},{"Add":" for (i = 0; i < f1->numpoints; i++) {"},{"Add":" p1 = f1->p[i];"},{"Add":" p2 = f1->p[(i + 1) % f1->numpoints];"},{"Add":" for (j = 0; j < f2->numpoints; j++) {"},{"Add":" p3 = f2->p[j];"},{"Add":" p4 = f2->p[(j + 1) % f2->numpoints];"},{"Add":" for (k = 0; k < 3; k++) {"},{"Add":" if (fabs(p1[k] - p4[k]) > EQUAL_EPSILON)"},{"Add":" break;"},{"Add":" if (fabs(p2[k] - p3[k]) > EQUAL_EPSILON)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (k == 3)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (j < f2->numpoints)"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (i == f1->numpoints)"},{"Add":" return NULL; // no matching edges"},{"Add":""},{"Add":" //"},{"Add":" // check slope of connected lines"},{"Add":" // if the slopes are colinear, the point can be removed"},{"Add":" //"},{"Add":" back = f1->p[(i + f1->numpoints - 1) % f1->numpoints];"},{"Add":" VectorSubtract(p1, back, delta);"},{"Add":" CrossProduct(planenormal, delta, normal);"},{"Add":" VectorNormalize(normal, normal);"},{"Add":""},{"Add":" back = f2->p[(j + 2) % f2->numpoints];"},{"Add":" VectorSubtract(back, p1, delta);"},{"Add":" dot = DotProduct(delta, normal);"},{"Add":" if (dot > CONTINUOUS_EPSILON)"},{"Add":" return NULL; // not a convex polygon"},{"Add":" keep1 = (qboolean)(dot < -CONTINUOUS_EPSILON);"},{"Add":""},{"Add":" back = f1->p[(i + 2) % f1->numpoints];"},{"Add":" VectorSubtract(back, p2, delta);"},{"Add":" CrossProduct(planenormal, delta, normal);"},{"Add":" VectorNormalize(normal, normal);"},{"Add":""},{"Add":" back = f2->p[(j + f2->numpoints - 1) % f2->numpoints];"},{"Add":" VectorSubtract(back, p2, delta);"},{"Add":" dot = DotProduct(delta, normal);"},{"Add":" if (dot > CONTINUOUS_EPSILON)"},{"Add":" return NULL; // not a convex polygon"},{"Add":" keep2 = (qboolean)(dot < -CONTINUOUS_EPSILON);"},{"Add":""},{"Add":" //"},{"Add":" // build the new polygon"},{"Add":" //"},{"Add":" newf = AllocWinding(f1->numpoints + f2->numpoints);"},{"Add":""},{"Add":" // copy first polygon"},{"Add":" for (k = (i + 1) % f1->numpoints; k != i; k = (k + 1) % f1->numpoints) {"},{"Add":" if (k == (i + 1) % f1->numpoints && !keep2)"},{"Add":" continue;"},{"Add":""},{"Add":" VectorCopy(f1->p[k], newf->p[newf->numpoints]);"},{"Add":" newf->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" // copy second polygon"},{"Add":" for (l = (j + 1) % f2->numpoints; l != j; l = (l + 1) % f2->numpoints) {"},{"Add":" if (l == (j + 1) % f2->numpoints && !keep1)"},{"Add":" continue;"},{"Add":" VectorCopy(f2->p[l], newf->p[newf->numpoints]);"},{"Add":" newf->numpoints++;"},{"Add":" }"},{"Add":""},{"Add":" return newf;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============="},{"Add":"TryMerge"},{"Add":""},{"Add":"If two polygons share a common edge and the edges that meet at the"},{"Add":"common points are both inside the other polygons, merge them"},{"Add":""},{"Add":"Returns NULL if the faces couldn't be merged, or the new face."},{"Add":"The originals will NOT be freed."},{"Add":"============="},{"Add":"*/"},{"Add":"face_t *TryMerge(face_t *f1, face_t *f2, vec3_t planenormal) {"},{"Add":" face_t *newf;"},{"Add":" winding_t *nw;"},{"Add":""},{"Add":" if (!f1->w || !f2->w)"},{"Add":" return NULL;"},{"Add":" if (f1->texinfo != f2->texinfo)"},{"Add":" return NULL;"},{"Add":" if (f1->planenum != f2->planenum) // on front and back sides"},{"Add":" return NULL;"},{"Add":" if (f1->contents != f2->contents)"},{"Add":" return NULL;"},{"Add":""},{"Add":" nw = TryMergeWinding(f1->w, f2->w, planenormal);"},{"Add":" if (!nw)"},{"Add":" return NULL;"},{"Add":""},{"Add":" c_merge++;"},{"Add":" newf = NewFaceFromFace(f1);"},{"Add":" newf->w = nw;"},{"Add":""},{"Add":" f1->merged = newf;"},{"Add":" f2->merged = newf;"},{"Add":""},{"Add":" return newf;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"MergeNodeFaces"},{"Add":"==============="},{"Add":"*/"},{"Add":"void MergeNodeFaces(node_t *node) {"},{"Add":" face_t *f1, *f2, *end;"},{"Add":" face_t *merged;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" merged = NULL;"},{"Add":""},{"Add":" for (f1 = node->faces; f1; f1 = f1->next) {"},{"Add":" if (f1->merged || f1->split[0] || f1->split[1])"},{"Add":" continue;"},{"Add":" for (f2 = node->faces; f2 != f1; f2 = f2->next) {"},{"Add":" if (f2->merged || f2->split[0] || f2->split[1])"},{"Add":" continue;"},{"Add":" plane = &mapplanes[f1->planenum];"},{"Add":" merged = TryMerge(f1, f2, plane->normal);"},{"Add":" if (!merged)"},{"Add":" continue;"},{"Add":""},{"Add":" // add merged to the end of the node face list"},{"Add":" // so it will be checked against all the faces again"},{"Add":" for (end = node->faces; end->next; end = end->next)"},{"Add":" ;"},{"Add":" merged->next = NULL;"},{"Add":" end->next = merged;"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//====================================================================="},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"SubdivideFace"},{"Add":""},{"Add":"Chop up faces that are larger than we want in the surface cache"},{"Add":"==============="},{"Add":"*/"},{"Add":"void SubdivideFace(node_t *node, face_t *f) {"},{"Add":" vec_t mins, maxs;"},{"Add":" vec_t v;"},{"Add":" int32_t axis, i;"},{"Add":" texinfo_t *tex;"},{"Add":" vec3_t temp;"},{"Add":" vec_t dist;"},{"Add":" winding_t *w, *frontw, *backw;"},{"Add":""},{"Add":" if (f->merged)"},{"Add":" return;"},{"Add":""},{"Add":" // special (non-surface cached) faces don't need subdivision"},{"Add":" tex = &texinfo[f->texinfo];"},{"Add":""},{"Add":" if (tex->flags & (SURF_WARP | SURF_SKY)) {"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" for (axis = 0; axis < 2; axis++) {"},{"Add":" while (1) {"},{"Add":" mins = BOGUS_RANGE;"},{"Add":" maxs = -BOGUS_RANGE;"},{"Add":""},{"Add":" VectorCopy(tex->vecs[axis], temp);"},{"Add":" w = f->w;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" v = DotProduct(w->p[i], temp);"},{"Add":" if (v < mins)"},{"Add":" mins = v;"},{"Add":" if (v > maxs)"},{"Add":" maxs = v;"},{"Add":" }"},{"Add":" v = VectorNormalize(temp, temp);"},{"Add":""},{"Add":" if (tex->flags & SURF_LIGHT) {"},{"Add":" if (maxs - mins <= sublight_size) // qb: control surf light chop independently"},{"Add":" break;"},{"Add":" else"},{"Add":" dist = (mins + sublight_size - 16) / v;"},{"Add":""},{"Add":" } else {"},{"Add":" if (maxs - mins <= subdivide_size)"},{"Add":" break;"},{"Add":" else"},{"Add":" dist = (mins + subdivide_size - 16) / v;"},{"Add":" }"},{"Add":""},{"Add":" // split it"},{"Add":" c_subdivide++;"},{"Add":""},{"Add":" ClipWindingEpsilon(w, temp, dist, ON_EPSILON, &frontw, &backw);"},{"Add":" if (!frontw || !backw)"},{"Add":" Error(\"SubdivideFace: didn't split the polygon\\n Node Bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" node->mins[0], node->mins[1], node->mins[2], node->maxs[0], node->maxs[1], node->maxs[2]);"},{"Add":""},{"Add":" f->split[0] = NewFaceFromFace(f);"},{"Add":" f->split[0]->w = frontw;"},{"Add":" f->split[0]->next = node->faces;"},{"Add":" node->faces = f->split[0];"},{"Add":""},{"Add":" f->split[1] = NewFaceFromFace(f);"},{"Add":" f->split[1]->w = backw;"},{"Add":" f->split[1]->next = node->faces;"},{"Add":" node->faces = f->split[1];"},{"Add":""},{"Add":" SubdivideFace(node, f->split[0]);"},{"Add":" SubdivideFace(node, f->split[1]);"},{"Add":" return;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"void SubdivideNodeFaces(node_t *node) {"},{"Add":" face_t *f;"},{"Add":""},{"Add":" for (f = node->faces; f; f = f->next) {"},{"Add":" SubdivideFace(node, f);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================================="},{"Add":""},{"Add":"int32_t c_nodefaces;"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"FaceFromPortal"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"face_t *FaceFromPortal(portal_t *p, int32_t pside) {"},{"Add":" face_t *f;"},{"Add":" side_t *side;"},{"Add":""},{"Add":" side = p->side;"},{"Add":" if (!side)"},{"Add":" return NULL; // portal does not bridge different visible contents"},{"Add":""},{"Add":" // qb: Paril noted SURF_NODRAW was not processed anywhere, pulled here."},{"Add":" // Turns out it was not implemented in original compiler tools or engine."},{"Add":" // SURF_SKY textures are often also flagged nodraw but need to keep those."},{"Add":" if (!strcmp(side_brushtextures[side - brushsides].name, \"common/caulk\") ||"},{"Add":" ((side_brushtextures[side - brushsides].flags & SURF_NODRAW) && !(side_brushtextures[side - brushsides].flags & SURF_SKY)))"},{"Add":" return NULL;"},{"Add":""},{"Add":" f = AllocFace();"},{"Add":""},{"Add":" f->texinfo = side->texinfo;"},{"Add":" f->planenum = (side->planenum & ~1) | pside;"},{"Add":" f->portal = p;"},{"Add":""},{"Add":" if ((p->nodes[pside]->contents & CONTENTS_WINDOW) && VisibleContents(p->nodes[!pside]->contents ^ p->nodes[pside]->contents) == CONTENTS_WINDOW)"},{"Add":" return NULL; // don't show insides of windows"},{"Add":""},{"Add":" if ((p->nodes[pside]->contents & CONTENTS_AUX) && VisibleContents(p->nodes[!pside]->contents ^ p->nodes[pside]->contents) == CONTENTS_AUX)"},{"Add":" return NULL; // qb: don't show insides of CONTENTS_AUX"},{"Add":""},{"Add":" if (pside) {"},{"Add":" f->w = ReverseWinding(p->winding);"},{"Add":" f->contents = p->nodes[1]->contents;"},{"Add":" } else {"},{"Add":" f->w = CopyWinding(p->winding);"},{"Add":" f->contents = p->nodes[0]->contents;"},{"Add":" }"},{"Add":" return f;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"MakeFaces_r"},{"Add":""},{"Add":"If a portal will make a visible face,"},{"Add":"mark the side that originally created it"},{"Add":""},{"Add":" solid / empty : solid"},{"Add":" solid / water : solid"},{"Add":" water / empty : water"},{"Add":" water / water : none"},{"Add":"==============="},{"Add":"*/"},{"Add":"void MakeFaces_r(node_t *node) {"},{"Add":" portal_t *p;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" // recurse down to leafs"},{"Add":" if (node->planenum != PLANENUM_LEAF) {"},{"Add":" MakeFaces_r(node->children[0]);"},{"Add":" MakeFaces_r(node->children[1]);"},{"Add":""},{"Add":" // merge together all visible faces on the node"},{"Add":" if (!nomerge)"},{"Add":" MergeNodeFaces(node);"},{"Add":" if (!nosubdiv)"},{"Add":" SubdivideNodeFaces(node);"},{"Add":""},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // solid leafs never have visible faces"},{"Add":" if (node->contents & CONTENTS_SOLID)"},{"Add":" return;"},{"Add":""},{"Add":" // see which portals are valid"},{"Add":" for (p = node->portals; p; p = p->next[s]) {"},{"Add":" s = (p->nodes[1] == node);"},{"Add":""},{"Add":" p->face[s] = FaceFromPortal(p, s);"},{"Add":" if (p->face[s]) {"},{"Add":" c_nodefaces++;"},{"Add":" p->face[s]->next = p->onnode->faces;"},{"Add":" p->onnode->faces = p->face[s];"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"MakeFaces"},{"Add":"============"},{"Add":"*/"},{"Add":"void MakeFaces(node_t *node) {"},{"Add":" qprintf(\"--- MakeFaces ---\\n\");"},{"Add":" c_merge = 0;"},{"Add":" c_subdivide = 0;"},{"Add":" c_nodefaces = 0;"},{"Add":""},{"Add":" MakeFaces_r(node);"},{"Add":""},{"Add":" qprintf(\"%5i makefaces\\n\", c_nodefaces);"},{"Add":" qprintf(\"%5i merged\\n\", c_merge);"},{"Add":" qprintf(\"%5i subdivided\\n\", c_subdivide);"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"csg.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"/*"},{"Add":""},{"Add":"tag all brushes with original contents"},{"Add":"brushes may contain multiple contents"},{"Add":"there will be no brush overlap after csg phase"},{"Add":""},{"Add":"each side has a count of the other sides it splits"},{"Add":""},{"Add":"the best split will be the one that minimizes the total split counts"},{"Add":"of all remaining sides"},{"Add":""},{"Add":"precalc side on plane table"},{"Add":""},{"Add":"evaluate split side"},{"Add":"{"},{"Add":"cost = 0"},{"Add":"for all sides"},{"Add":" for all sides"},{"Add":" get"},{"Add":" if side splits side and splitside is on same child"},{"Add":" cost++;"},{"Add":"}"},{"Add":""},{"Add":"*/"},{"Add":""},{"Add":"void SplitBrush2(bspbrush_t *brush, int32_t planenum,"},{"Add":" bspbrush_t **front, bspbrush_t **back) {"},{"Add":" SplitBrush(brush, planenum, front, back);"},{"Add":"#if 0"},{"Add":" if (*front && (*front)->sides[(*front)->numsides-1].texinfo == -1)"},{"Add":" (*front)->sides[(*front)->numsides-1].texinfo = (*front)->sides[0].texinfo;\t// not -1"},{"Add":" if (*back && (*back)->sides[(*back)->numsides-1].texinfo == -1)"},{"Add":" (*back)->sides[(*back)->numsides-1].texinfo = (*back)->sides[0].texinfo;\t// not -1"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"SubtractBrush"},{"Add":""},{"Add":"Returns a list of brushes that remain after B is subtracted from A."},{"Add":"May by empty if A is contained inside B."},{"Add":""},{"Add":"The originals are undisturbed."},{"Add":"==============="},{"Add":"*/"},{"Add":"bspbrush_t *SubtractBrush(bspbrush_t *a, bspbrush_t *b) {"},{"Add":" // a - b = out (list)"},{"Add":" int32_t i;"},{"Add":" bspbrush_t *front, *back;"},{"Add":" bspbrush_t *out, *in;"},{"Add":""},{"Add":" in = a;"},{"Add":" out = NULL;"},{"Add":" for (i = 0; i < b->numsides && in; i++) {"},{"Add":" SplitBrush2(in, b->sides[i].planenum, &front, &back);"},{"Add":" if (in != a)"},{"Add":" FreeBrush(in);"},{"Add":" if (front) {"},{"Add":" // add to list"},{"Add":" front->next = out;"},{"Add":" out = front;"},{"Add":" }"},{"Add":" in = back;"},{"Add":" }"},{"Add":" if (in)"},{"Add":" FreeBrush(in);"},{"Add":" else {"},{"Add":" // didn't really intersect"},{"Add":" FreeBrushList(out);"},{"Add":" return a;"},{"Add":" }"},{"Add":" return out;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"IntersectBrush"},{"Add":""},{"Add":"Returns a single brush made up by the intersection of the"},{"Add":"two provided brushes, or NULL if they are disjoint."},{"Add":""},{"Add":"The originals are undisturbed."},{"Add":"==============="},{"Add":"*/"},{"Add":"bspbrush_t *IntersectBrush(bspbrush_t *a, bspbrush_t *b) {"},{"Add":" int32_t i;"},{"Add":" bspbrush_t *front, *back;"},{"Add":" bspbrush_t *in;"},{"Add":""},{"Add":" in = a;"},{"Add":" for (i = 0; i < b->numsides && in; i++) {"},{"Add":" SplitBrush2(in, b->sides[i].planenum, &front, &back);"},{"Add":" if (in != a)"},{"Add":" FreeBrush(in);"},{"Add":" if (front)"},{"Add":" FreeBrush(front);"},{"Add":" in = back;"},{"Add":" }"},{"Add":""},{"Add":" if (in == a)"},{"Add":" return NULL;"},{"Add":""},{"Add":" in->next = NULL;"},{"Add":" return in;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"BrushesDisjoint"},{"Add":""},{"Add":"Returns true if the two brushes definately do not intersect."},{"Add":"There will be false negatives for some non-axial combinations."},{"Add":"==============="},{"Add":"*/"},{"Add":"qboolean BrushesDisjoint(bspbrush_t *a, bspbrush_t *b) {"},{"Add":" int32_t i, j;"},{"Add":""},{"Add":" // check bounding boxes"},{"Add":" for (i = 0; i < 3; i++)"},{"Add":" if (a->mins[i] >= b->maxs[i] || a->maxs[i] <= b->mins[i])"},{"Add":" return true; // bounding boxes don't overlap"},{"Add":""},{"Add":" // check for opposing planes"},{"Add":" for (i = 0; i < a->numsides; i++) {"},{"Add":" for (j = 0; j < b->numsides; j++) {"},{"Add":" if (a->sides[i].planenum =="},{"Add":" (b->sides[j].planenum ^ 1))"},{"Add":" return true; // opposite planes, so not touching"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return false; // might intersect"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"IntersectionContents"},{"Add":""},{"Add":"Returns a content word for the intersection of two brushes."},{"Add":"Some combinations will generate a combination (water + clip),"},{"Add":"but most will be the stronger of the two contents."},{"Add":"==============="},{"Add":"*/"},{"Add":"int32_t IntersectionContents(int32_t c1, int32_t c2) {"},{"Add":" int32_t out;"},{"Add":""},{"Add":" out = c1 | c2;"},{"Add":""},{"Add":" if (out & CONTENTS_SOLID)"},{"Add":" out = CONTENTS_SOLID;"},{"Add":""},{"Add":" return out;"},{"Add":"}"},{"Add":""},{"Add":"int32_t minplanenums[3];"},{"Add":"int32_t maxplanenums[3];"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"ClipBrushToBox"},{"Add":""},{"Add":"Any planes shared with the box edge will be set to no texinfo"},{"Add":"==============="},{"Add":"*/"},{"Add":"bspbrush_t *ClipBrushToBox(bspbrush_t *brush, vec3_t clipmins, vec3_t clipmaxs) {"},{"Add":" int32_t i, j;"},{"Add":" bspbrush_t *front, *back;"},{"Add":" int32_t p;"},{"Add":""},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" if (brush->maxs[j] > clipmaxs[j]) {"},{"Add":" SplitBrush(brush, maxplanenums[j], &front, &back);"},{"Add":" FreeBrush(brush); // AA tools fix"},{"Add":" if (front)"},{"Add":" FreeBrush(front);"},{"Add":" brush = back;"},{"Add":" if (!brush)"},{"Add":" return NULL;"},{"Add":" }"},{"Add":" if (brush->mins[j] < clipmins[j]) {"},{"Add":" SplitBrush(brush, minplanenums[j], &front, &back);"},{"Add":" FreeBrush(brush); // qb: AA tools fix"},{"Add":" if (back)"},{"Add":" FreeBrush(back);"},{"Add":" brush = front;"},{"Add":" if (!brush)"},{"Add":" return NULL;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // remove any colinear faces"},{"Add":""},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" p = brush->sides[i].planenum & ~1;"},{"Add":" if (p == maxplanenums[0] || p == maxplanenums[1] || p == minplanenums[0] || p == minplanenums[1]) {"},{"Add":" brush->sides[i].texinfo = TEXINFO_NODE;"},{"Add":" brush->sides[i].visible = false;"},{"Add":" }"},{"Add":" }"},{"Add":" return brush;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"MakeBspBrushList"},{"Add":"==============="},{"Add":"*/"},{"Add":"bspbrush_t *MakeBspBrushList(int32_t startbrush, int32_t endbrush,"},{"Add":" vec3_t clipmins, vec3_t clipmaxs) {"},{"Add":" mapbrush_t *mb;"},{"Add":" bspbrush_t *brushlist, *newbrush;"},{"Add":" int32_t i, j;"},{"Add":" int32_t c_faces;"},{"Add":" int32_t c_brushes;"},{"Add":" int32_t numsides;"},{"Add":" int32_t vis;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist; // jit (use higher precision, if enabled)"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" VectorClear(normal);"},{"Add":" normal[i] = 1;"},{"Add":" dist = clipmaxs[i];"},{"Add":" maxplanenums[i] = FindFloatPlane(normal, dist, 0);"},{"Add":" dist = clipmins[i];"},{"Add":" minplanenums[i] = FindFloatPlane(normal, dist, 0);"},{"Add":" }"},{"Add":""},{"Add":" brushlist = NULL;"},{"Add":" c_faces = 0;"},{"Add":" c_brushes = 0;"},{"Add":""},{"Add":" for (i = startbrush; i < endbrush; i++) {"},{"Add":" mb = &mapbrushes[i];"},{"Add":""},{"Add":" numsides = mb->numsides;"},{"Add":" if (!numsides)"},{"Add":" continue;"},{"Add":" // make sure the brush has at least one face showing"},{"Add":" vis = 0;"},{"Add":" for (j = 0; j < numsides; j++)"},{"Add":" if (mb->original_sides[j].visible && mb->original_sides[j].winding)"},{"Add":" vis++;"},{"Add":"#if 0"},{"Add":" if (!vis)"},{"Add":" continue;\t// no faces at all"},{"Add":"#endif"},{"Add":" // if the brush is outside the clip area, skip it"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" if (mb->mins[j] >= clipmaxs[j] || mb->maxs[j] <= clipmins[j])"},{"Add":" break;"},{"Add":" if (j != 3)"},{"Add":" continue;"},{"Add":""},{"Add":" //"},{"Add":" // make a copy of the brush"},{"Add":" //"},{"Add":" newbrush = AllocBrush(mb->numsides);"},{"Add":" newbrush->original = mb;"},{"Add":" newbrush->numsides = mb->numsides;"},{"Add":" memcpy(newbrush->sides, mb->original_sides, numsides * sizeof(side_t));"},{"Add":" for (j = 0; j < numsides; j++) {"},{"Add":" if (newbrush->sides[j].winding)"},{"Add":" newbrush->sides[j].winding = CopyWinding(newbrush->sides[j].winding);"},{"Add":" if (newbrush->sides[j].surf & SURF_HINT)"},{"Add":" newbrush->sides[j].visible = true; // hints are always visible"},{"Add":" }"},{"Add":" VectorCopy(mb->mins, newbrush->mins);"},{"Add":" VectorCopy(mb->maxs, newbrush->maxs);"},{"Add":""},{"Add":" //"},{"Add":" // carve off anything outside the clip box"},{"Add":" //"},{"Add":" newbrush = ClipBrushToBox(newbrush, clipmins, clipmaxs);"},{"Add":" if (!newbrush)"},{"Add":" continue;"},{"Add":""},{"Add":" c_faces += vis;"},{"Add":" c_brushes++;"},{"Add":""},{"Add":" newbrush->next = brushlist;"},{"Add":" brushlist = newbrush;"},{"Add":" }"},{"Add":""},{"Add":" return brushlist;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==============="},{"Add":"AddBspBrushListToTail"},{"Add":"==============="},{"Add":"*/"},{"Add":"bspbrush_t *AddBrushListToTail(bspbrush_t *list, bspbrush_t *tail) {"},{"Add":" bspbrush_t *walk, *next;"},{"Add":""},{"Add":" for (walk = list; walk; walk = next) {"},{"Add":" // add to end of list"},{"Add":" next = walk->next;"},{"Add":" walk->next = NULL;"},{"Add":" tail->next = walk;"},{"Add":" tail = walk;"},{"Add":" }"},{"Add":""},{"Add":" return tail;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"==========="},{"Add":"CullList"},{"Add":""},{"Add":"Builds a new list that doesn't hold the given brush"},{"Add":"==========="},{"Add":"*/"},{"Add":"bspbrush_t *CullList(bspbrush_t *list, bspbrush_t *skip1) {"},{"Add":" bspbrush_t *newlist;"},{"Add":" bspbrush_t *next;"},{"Add":""},{"Add":" newlist = NULL;"},{"Add":""},{"Add":" for (; list; list = next) {"},{"Add":" next = list->next;"},{"Add":" if (list == skip1) {"},{"Add":" FreeBrush(list);"},{"Add":" continue;"},{"Add":" }"},{"Add":" list->next = newlist;"},{"Add":" newlist = list;"},{"Add":" }"},{"Add":" return newlist;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"WriteBrushMap"},{"Add":"=================="},{"Add":"*/"},{"Add":"void WriteBrushMap(char *name, bspbrush_t *list) {"},{"Add":" FILE *f;"},{"Add":" side_t *s;"},{"Add":" int32_t i;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" printf(\"\\ntexinfo count: %i of %i maximum\\n\", numtexinfo, MAX_MAP_TEXINFO_QBSP);"},{"Add":" else"},{"Add":" printf(\"\\ntexinfo count: %i of %i maximum\\n\", numtexinfo, MAX_MAP_TEXINFO);"},{"Add":""},{"Add":" if (use_qbsp)"},{"Add":" printf(\"brushsides count: %i of %i maximum\\n\", nummapbrushsides, MAX_MAP_BRUSHSIDES_QBSP);"},{"Add":" else"},{"Add":" printf(\"brushsides count: %i of %i maximum\\n\", nummapbrushsides, MAX_MAP_BRUSHSIDES);"},{"Add":""},{"Add":" printf(\"writing %s\\n\", name);"},{"Add":" f = fopen(name, \"wb\");"},{"Add":" if (!f)"},{"Add":" Error(\"Can't write %s\\b\", name);"},{"Add":""},{"Add":" fprintf(f, \"{\\n\\\"classname\\\" \\\"worldspawn\\\"\\n\");"},{"Add":""},{"Add":" for (; list; list = list->next) {"},{"Add":" fprintf(f, \"{\\n\");"},{"Add":" for (i = 0, s = list->sides; i < list->numsides; i++, s++) {"},{"Add":" w = BaseWindingForPlane(mapplanes[s->planenum].normal, mapplanes[s->planenum].dist);"},{"Add":""},{"Add":" fprintf(f, \"( %i %i %i ) \", (int32_t)w->p[0][0], (int32_t)w->p[0][1], (int32_t)w->p[0][2]);"},{"Add":" fprintf(f, \"( %i %i %i ) \", (int32_t)w->p[1][0], (int32_t)w->p[1][1], (int32_t)w->p[1][2]);"},{"Add":" fprintf(f, \"( %i %i %i ) \", (int32_t)w->p[2][0], (int32_t)w->p[2][1], (int32_t)w->p[2][2]);"},{"Add":""},{"Add":" fprintf(f, \"%s 0 0 0 1 1\\n\", texinfo[s->texinfo].texture);"},{"Add":" FreeWinding(w);"},{"Add":" }"},{"Add":" fprintf(f, \"}\\n\");"},{"Add":" }"},{"Add":" fprintf(f, \"}\\n\");"},{"Add":""},{"Add":" fclose(f);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BrushGE"},{"Add":""},{"Add":"Returns true if b1 is allowed to bite b2"},{"Add":"=================="},{"Add":"*/"},{"Add":"qboolean BrushGE(bspbrush_t *b1, bspbrush_t *b2) {"},{"Add":" // detail brushes never bite structural brushes"},{"Add":" if ((b1->original->contents & CONTENTS_DETAIL) && !(b2->original->contents & CONTENTS_DETAIL))"},{"Add":" return false;"},{"Add":" if (b1->original->contents & CONTENTS_SOLID)"},{"Add":" return true;"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"ChopBrushes"},{"Add":""},{"Add":"Carves any intersecting solid brushes into the minimum number"},{"Add":"of non-intersecting brushes."},{"Add":"================="},{"Add":"*/"},{"Add":"bspbrush_t *ChopBrushes(bspbrush_t *head) {"},{"Add":" bspbrush_t *b1, *b2, *next;"},{"Add":" bspbrush_t *tail;"},{"Add":" bspbrush_t *keep;"},{"Add":" bspbrush_t *sub, *sub2;"},{"Add":" int32_t c1, c2;"},{"Add":""},{"Add":" qprintf(\"---- ChopBrushes ----\\n\");"},{"Add":" qprintf(\"original brushes: %i\\n\", CountBrushList(head));"},{"Add":""},{"Add":" keep = NULL;"},{"Add":""},{"Add":"newlist:"},{"Add":" // find tail"},{"Add":" if (!head)"},{"Add":" return NULL;"},{"Add":" for (tail = head; tail->next; tail = tail->next)"},{"Add":" ;"},{"Add":""},{"Add":" for (b1 = head; b1; b1 = next) {"},{"Add":" next = b1->next;"},{"Add":" for (b2 = b1->next; b2; b2 = b2->next) {"},{"Add":" if (BrushesDisjoint(b1, b2))"},{"Add":" continue;"},{"Add":""},{"Add":" sub = NULL;"},{"Add":" sub2 = NULL;"},{"Add":" c1 = BOGUS_RANGE;"},{"Add":" c2 = BOGUS_RANGE;"},{"Add":""},{"Add":" if (BrushGE(b2, b1)) {"},{"Add":" sub = SubtractBrush(b1, b2);"},{"Add":" if (sub == b1)"},{"Add":" continue; // didn't really intersect"},{"Add":" if (!sub) {"},{"Add":" // b1 is swallowed by b2"},{"Add":" head = CullList(b1, b1);"},{"Add":" goto newlist;"},{"Add":" }"},{"Add":" c1 = CountBrushList(sub);"},{"Add":" }"},{"Add":""},{"Add":" if (BrushGE(b1, b2)) {"},{"Add":" sub2 = SubtractBrush(b2, b1);"},{"Add":" if (sub2 == b2)"},{"Add":" continue; // didn't really intersect"},{"Add":" if (!sub2) {"},{"Add":" // b2 is swallowed by b1"},{"Add":" FreeBrushList(sub);"},{"Add":" head = CullList(b1, b2);"},{"Add":" goto newlist;"},{"Add":" }"},{"Add":" c2 = CountBrushList(sub2);"},{"Add":" }"},{"Add":""},{"Add":" if (!sub && !sub2)"},{"Add":" continue; // neither one can bite"},{"Add":""},{"Add":" // only accept if it didn't fragment"},{"Add":" // (commening this out allows full fragmentation)"},{"Add":" if (c1 > 1 && c2 > 1) {"},{"Add":" if (sub2)"},{"Add":" FreeBrushList(sub2);"},{"Add":" if (sub)"},{"Add":" FreeBrushList(sub);"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" if (c1 < c2) {"},{"Add":" if (sub2)"},{"Add":" FreeBrushList(sub2);"},{"Add":" tail = AddBrushListToTail(sub, tail);"},{"Add":" head = CullList(b1, b1);"},{"Add":" goto newlist;"},{"Add":" } else {"},{"Add":" if (sub)"},{"Add":" FreeBrushList(sub);"},{"Add":" tail = AddBrushListToTail(sub2, tail);"},{"Add":" head = CullList(b1, b2);"},{"Add":" goto newlist;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!b2) {"},{"Add":" // b1 is no longer intersecting anything, so keep it"},{"Add":" b1->next = keep;"},{"Add":" keep = b1;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"output brushes: %i\\n\", CountBrushList(keep));"},{"Add":" return keep;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"InitialBrushList"},{"Add":"================="},{"Add":"*/"},{"Add":"bspbrush_t *InitialBrushList(bspbrush_t *list) {"},{"Add":" bspbrush_t *b;"},{"Add":" bspbrush_t *out, *newb;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" // only return brushes that have visible faces"},{"Add":" out = NULL;"},{"Add":" for (b = list; b; b = b->next) {"},{"Add":"#if 0"},{"Add":" for (i=0 ; inumsides ; i++)"},{"Add":" if (b->sides[i].visible)"},{"Add":" break;"},{"Add":" if (i == b->numsides)"},{"Add":" continue;"},{"Add":"#endif"},{"Add":" newb = CopyBrush(b);"},{"Add":" newb->next = out;"},{"Add":" out = newb;"},{"Add":""},{"Add":" // clear visible, so it must be set by MarkVisibleFaces_r"},{"Add":" // to be used in the optimized list"},{"Add":" for (i = 0; i < b->numsides; i++) {"},{"Add":" newb->sides[i].original = &b->sides[i];"},{"Add":" //\t\t\tnewb->sides[i].visible = true;"},{"Add":" b->sides[i].visible = false;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" return out;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"OptimizedBrushList"},{"Add":"================="},{"Add":"*/"},{"Add":"bspbrush_t *OptimizedBrushList(bspbrush_t *list) {"},{"Add":" bspbrush_t *b;"},{"Add":" bspbrush_t *out, *newb;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" // only return brushes that have visible faces"},{"Add":" out = NULL;"},{"Add":" for (b = list; b; b = b->next) {"},{"Add":" for (i = 0; i < b->numsides; i++)"},{"Add":" if (b->sides[i].visible)"},{"Add":" break;"},{"Add":" if (i == b->numsides)"},{"Add":" continue;"},{"Add":" newb = CopyBrush(b);"},{"Add":" newb->next = out;"},{"Add":" out = newb;"},{"Add":" }"},{"Add":""},{"Add":" return out;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"brushbsp.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"int32_t c_nodes;"},{"Add":"int32_t c_nonvis;"},{"Add":"int32_t c_active_brushes;"},{"Add":""},{"Add":"#define PSIDE_FRONT 1"},{"Add":"#define PSIDE_BACK 2"},{"Add":"#define PSIDE_BOTH (PSIDE_FRONT | PSIDE_BACK)"},{"Add":"#define PSIDE_FACING 4"},{"Add":""},{"Add":"int32_t BrushMostlyOnSide(bspbrush_t *brush, plane_t *plane); // qb: GDD tools"},{"Add":""},{"Add":"void FindBrushInTree(node_t *node, int32_t brushnum) {"},{"Add":" bspbrush_t *b;"},{"Add":""},{"Add":" if (node->planenum == PLANENUM_LEAF) {"},{"Add":" for (b = node->brushlist; b; b = b->next)"},{"Add":" if (b->original->brushnum == brushnum)"},{"Add":" return;"},{"Add":" }"},{"Add":" FindBrushInTree(node->children[0], brushnum);"},{"Add":" FindBrushInTree(node->children[1], brushnum);"},{"Add":"}"},{"Add":""},{"Add":"//=================================================="},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BoundBrush"},{"Add":""},{"Add":"Sets the mins/maxs based on the windings"},{"Add":"=================="},{"Add":"*/"},{"Add":"void BoundBrush(bspbrush_t *brush) {"},{"Add":" int32_t i, j;"},{"Add":" winding_t *w;"},{"Add":""},{"Add":" ClearBounds(brush->mins, brush->maxs);"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" for (j = 0; j < w->numpoints; j++)"},{"Add":" AddPointToBounds(w->p[j], brush->mins, brush->maxs);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"CreateBrushWindings"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"void CreateBrushWindings(bspbrush_t *brush) {"},{"Add":" int32_t i, j;"},{"Add":" winding_t *w;"},{"Add":" side_t *side;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" side = &brush->sides[i];"},{"Add":" plane = &mapplanes[side->planenum];"},{"Add":" w = BaseWindingForPlane(plane->normal, plane->dist);"},{"Add":" for (j = 0; j < brush->numsides && w; j++) {"},{"Add":" if (i == j)"},{"Add":" continue;"},{"Add":" if (brush->sides[j].bevel)"},{"Add":" continue;"},{"Add":" plane = &mapplanes[brush->sides[j].planenum ^ 1];"},{"Add":" ChopWindingInPlace(&w, plane->normal, plane->dist, 0);"},{"Add":" }"},{"Add":""},{"Add":" side->winding = w;"},{"Add":" }"},{"Add":""},{"Add":" BoundBrush(brush);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BrushFromBounds"},{"Add":""},{"Add":"Creates a new axial brush"},{"Add":"=================="},{"Add":"*/"},{"Add":"bspbrush_t *BrushFromBounds(vec3_t mins, vec3_t maxs) {"},{"Add":" bspbrush_t *b;"},{"Add":" int32_t i;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":""},{"Add":" b = AllocBrush(6);"},{"Add":" b->numsides = 6;"},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" VectorClear(normal);"},{"Add":" normal[i] = 1;"},{"Add":" dist = maxs[i];"},{"Add":" b->sides[i].planenum = FindFloatPlane(normal, dist, 0);"},{"Add":""},{"Add":" normal[i] = -1;"},{"Add":" dist = -mins[i];"},{"Add":" b->sides[3 + i].planenum = FindFloatPlane(normal, dist, 0);"},{"Add":" }"},{"Add":""},{"Add":" CreateBrushWindings(b);"},{"Add":""},{"Add":" return b;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BrushVolume"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"vec_t BrushVolume(bspbrush_t *brush) {"},{"Add":" int32_t i;"},{"Add":" winding_t *w;"},{"Add":" vec3_t corner;"},{"Add":" vec_t d, area, volume;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" if (!brush)"},{"Add":" return 0;"},{"Add":""},{"Add":" // grab the first valid point as the corner"},{"Add":""},{"Add":" w = NULL;"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (w)"},{"Add":" break;"},{"Add":" }"},{"Add":" if (!w)"},{"Add":" return 0;"},{"Add":" VectorCopy(w->p[0], corner);"},{"Add":""},{"Add":" // make tetrahedrons to all other faces"},{"Add":""},{"Add":" volume = 0;"},{"Add":" for (; i < brush->numsides; i++) {"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" plane = &mapplanes[brush->sides[i].planenum];"},{"Add":" d = -(DotProduct(corner, plane->normal) - plane->dist);"},{"Add":" area = WindingArea(w);"},{"Add":" volume += d * area;"},{"Add":" }"},{"Add":""},{"Add":" volume /= 3;"},{"Add":" return volume;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"CountBrushList"},{"Add":"================"},{"Add":"*/"},{"Add":"int32_t CountBrushList(bspbrush_t *brushes) {"},{"Add":" int32_t c;"},{"Add":""},{"Add":" c = 0;"},{"Add":" for (; brushes; brushes = brushes->next)"},{"Add":" c++;"},{"Add":" return c;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"AllocTree"},{"Add":"================"},{"Add":"*/"},{"Add":"tree_t *AllocTree(void) {"},{"Add":" tree_t *tree;"},{"Add":""},{"Add":" tree = malloc(sizeof(*tree));"},{"Add":" memset(tree, 0, sizeof(*tree));"},{"Add":" ClearBounds(tree->mins, tree->maxs);"},{"Add":""},{"Add":" return tree;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"AllocNode"},{"Add":"================"},{"Add":"*/"},{"Add":"node_t *AllocNode(void) {"},{"Add":" node_t *node;"},{"Add":""},{"Add":" node = malloc(sizeof(*node));"},{"Add":" memset(node, 0, sizeof(*node));"},{"Add":""},{"Add":" return node;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"AllocBrush"},{"Add":"================"},{"Add":"*/"},{"Add":"bspbrush_t *AllocBrush(int32_t numsides) {"},{"Add":" bspbrush_t *bb;"},{"Add":" int32_t c;"},{"Add":""},{"Add":" c = (intptr_t) & (((bspbrush_t *)0)->sides[numsides]);"},{"Add":" bb = malloc(c);"},{"Add":" memset(bb, 0, c);"},{"Add":" if (numthreads == 1)"},{"Add":" c_active_brushes++;"},{"Add":" return bb;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"FreeBrush"},{"Add":"================"},{"Add":"*/"},{"Add":"void FreeBrush(bspbrush_t *brushes) {"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < brushes->numsides; i++)"},{"Add":" if (brushes->sides[i].winding)"},{"Add":" FreeWinding(brushes->sides[i].winding);"},{"Add":" free(brushes);"},{"Add":" if (numthreads == 1)"},{"Add":" c_active_brushes--;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"FreeBrushList"},{"Add":"================"},{"Add":"*/"},{"Add":"void FreeBrushList(bspbrush_t *brushes) {"},{"Add":" bspbrush_t *next;"},{"Add":""},{"Add":" for (; brushes; brushes = next) {"},{"Add":" next = brushes->next;"},{"Add":""},{"Add":" FreeBrush(brushes);"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"CopyBrush"},{"Add":""},{"Add":"Duplicates the brush, the sides, and the windings"},{"Add":"=================="},{"Add":"*/"},{"Add":"bspbrush_t *CopyBrush(bspbrush_t *brush) {"},{"Add":" bspbrush_t *newbrush;"},{"Add":" int32_t size;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" size = (intptr_t) & (((bspbrush_t *)0)->sides[brush->numsides]);"},{"Add":""},{"Add":" newbrush = AllocBrush(brush->numsides);"},{"Add":" memcpy(newbrush, brush, size);"},{"Add":""},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" if (brush->sides[i].winding)"},{"Add":" newbrush->sides[i].winding = CopyWinding(brush->sides[i].winding);"},{"Add":" }"},{"Add":""},{"Add":" return newbrush;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"PointInLeaf"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"node_t *PointInLeaf(node_t *node, vec3_t point) {"},{"Add":" vec_t d;"},{"Add":" plane_t *plane;"},{"Add":""},{"Add":" while (node->planenum != PLANENUM_LEAF) {"},{"Add":" plane = &mapplanes[node->planenum];"},{"Add":" d = DotProduct(point, plane->normal) - plane->dist;"},{"Add":" if (d > 0)"},{"Add":" node = node->children[0];"},{"Add":" else"},{"Add":" node = node->children[1];"},{"Add":" }"},{"Add":""},{"Add":" return node;"},{"Add":"}"},{"Add":""},{"Add":"//========================================================"},{"Add":""},{"Add":"/*"},{"Add":"=============="},{"Add":"BoxOnPlaneSide"},{"Add":""},{"Add":"Returns PSIDE_FRONT, PSIDE_BACK, or PSIDE_BOTH"},{"Add":"=============="},{"Add":"*/"},{"Add":"int32_t BoxOnPlaneSide(vec3_t mins, vec3_t maxs, plane_t *plane) {"},{"Add":" int32_t side;"},{"Add":" int32_t i;"},{"Add":" vec3_t corners[2];"},{"Add":" vec_t dist1, dist2;"},{"Add":""},{"Add":" // axial planes are easy"},{"Add":" if (plane->type < 3) {"},{"Add":" side = 0;"},{"Add":" if (maxs[plane->type] > plane->dist + PLANESIDE_EPSILON)"},{"Add":" side |= PSIDE_FRONT;"},{"Add":" if (mins[plane->type] < plane->dist - PLANESIDE_EPSILON)"},{"Add":" side |= PSIDE_BACK;"},{"Add":" return side;"},{"Add":" }"},{"Add":""},{"Add":" // create the proper leading and trailing verts for the box"},{"Add":""},{"Add":" for (i = 0; i < 3; i++) {"},{"Add":" if (plane->normal[i] < 0) {"},{"Add":" corners[0][i] = mins[i];"},{"Add":" corners[1][i] = maxs[i];"},{"Add":" } else {"},{"Add":" corners[1][i] = mins[i];"},{"Add":" corners[0][i] = maxs[i];"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" dist1 = DotProduct(plane->normal, corners[0]) - plane->dist;"},{"Add":" dist2 = DotProduct(plane->normal, corners[1]) - plane->dist;"},{"Add":" side = 0;"},{"Add":" if (dist1 >= PLANESIDE_EPSILON)"},{"Add":" side = PSIDE_FRONT;"},{"Add":" if (dist2 < PLANESIDE_EPSILON)"},{"Add":" side |= PSIDE_BACK;"},{"Add":""},{"Add":" return side;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"QuickTestBrushToPlanenum"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t QuickTestBrushToPlanenum(bspbrush_t *brush, int32_t planenum, int32_t *numsplits) {"},{"Add":" int32_t i, num;"},{"Add":" plane_t *plane;"},{"Add":" int32_t s;"},{"Add":""},{"Add":" *numsplits = 0;"},{"Add":""},{"Add":" // if the brush actually uses the planenum,"},{"Add":" // we can tell the side for sure"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" num = brush->sides[i].planenum;"},{"Add":" if (num >= MAX_MAP_PLANES_QBSP)"},{"Add":" Error(\"bad planenum\");"},{"Add":" if (num == planenum)"},{"Add":" return PSIDE_BACK | PSIDE_FACING;"},{"Add":" if (num == (planenum ^ 1))"},{"Add":" return PSIDE_FRONT | PSIDE_FACING;"},{"Add":" }"},{"Add":""},{"Add":" // box on plane side"},{"Add":" plane = &mapplanes[planenum];"},{"Add":" s = BoxOnPlaneSide(brush->mins, brush->maxs, plane);"},{"Add":""},{"Add":" // if both sides, count the visible faces split"},{"Add":" if (s == PSIDE_BOTH) {"},{"Add":" *numsplits += 3;"},{"Add":" }"},{"Add":""},{"Add":" return s;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"TestBrushToPlanenum"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"// qb: GDD tools detailsplit"},{"Add":"int32_t TestBrushToPlanenum(bspbrush_t *brush, int32_t planenum,"},{"Add":" int32_t *numsplits, qboolean *hintsplit, qboolean *detailsplit, int32_t *epsilonbrush) {"},{"Add":" int32_t i, j, num;"},{"Add":" plane_t *plane;"},{"Add":" int32_t s;"},{"Add":" winding_t *w;"},{"Add":" vec_t d, d_front, d_back;"},{"Add":" int32_t front, back;"},{"Add":""},{"Add":" *numsplits = 0;"},{"Add":" *hintsplit = false;"},{"Add":""},{"Add":" // if the brush actually uses the planenum,"},{"Add":" // we can tell the side for sure"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" num = brush->sides[i].planenum;"},{"Add":" if (num >= MAX_MAP_PLANES_QBSP)"},{"Add":" Error(\"bad planenum\");"},{"Add":" if (num == planenum)"},{"Add":" return PSIDE_BACK | PSIDE_FACING;"},{"Add":" if (num == (planenum ^ 1))"},{"Add":" return PSIDE_FRONT | PSIDE_FACING;"},{"Add":" }"},{"Add":""},{"Add":" // box on plane side"},{"Add":" plane = &mapplanes[planenum];"},{"Add":" s = BoxOnPlaneSide(brush->mins, brush->maxs, plane);"},{"Add":""},{"Add":" if (s != PSIDE_BOTH)"},{"Add":" return s;"},{"Add":""},{"Add":" // if both sides, count the visible faces split"},{"Add":" d_front = d_back = 0;"},{"Add":""},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" if (brush->sides[i].texinfo == TEXINFO_NODE)"},{"Add":" continue; // on node, don't worry about splits"},{"Add":" if (!brush->sides[i].visible)"},{"Add":" continue; // we don't care about non-visible"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" front = back = 0;"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" d = DotProduct(w->p[j], plane->normal) - plane->dist;"},{"Add":" if (d > d_front)"},{"Add":" d_front = d;"},{"Add":" if (d < d_back)"},{"Add":" d_back = d;"},{"Add":""},{"Add":" if (d > ON_EPSILON) // qb: was 0.1"},{"Add":" front = 1;"},{"Add":" if (d < -ON_EPSILON) // qb: was -0.1"},{"Add":" back = 1;"},{"Add":" }"},{"Add":" if (front && back) {"},{"Add":" if (!(brush->sides[i].surf & SURF_SKIP)) {"},{"Add":" (*numsplits)++;"},{"Add":" if (brush->sides[i].surf & SURF_HINT)"},{"Add":" *hintsplit = true;"},{"Add":" if (brush->sides[i].contents & CONTENTS_DETAIL)"},{"Add":" *detailsplit = true;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if ((d_front > 0.0 && d_front < 1.0) || (d_back < 0.0 && d_back > -1.0))"},{"Add":" (*epsilonbrush)++;"},{"Add":""},{"Add":"#if 0"},{"Add":" if (*numsplits == 0)"},{"Add":" {"},{"Add":" //\tdidn't really need to be split"},{"Add":" if (front)"},{"Add":" s = PSIDE_FRONT;"},{"Add":" else if (back)"},{"Add":" s = PSIDE_BACK;"},{"Add":" else"},{"Add":" s = 0;"},{"Add":" }"},{"Add":"#endif"},{"Add":""},{"Add":" return s;"},{"Add":"}"},{"Add":""},{"Add":"//========================================================"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"WindingIsTiny"},{"Add":""},{"Add":"Returns true if the winding would be crunched out of"},{"Add":"existance by the vertex snapping."},{"Add":"================"},{"Add":"*/"},{"Add":"#define EDGE_LENGTH 0.2"},{"Add":"qboolean WindingIsTiny(winding_t *w) {"},{"Add":"#if 0"},{"Add":" if (WindingArea (w) < 1)"},{"Add":" return true;"},{"Add":" return false;"},{"Add":"#else"},{"Add":" int32_t i, j;"},{"Add":" vec_t len;"},{"Add":" vec3_t delta;"},{"Add":" int32_t edges;"},{"Add":""},{"Add":" edges = 0;"},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" j = i == w->numpoints - 1 ? 0 : i + 1;"},{"Add":" VectorSubtract(w->p[j], w->p[i], delta);"},{"Add":" len = VectorLength(delta);"},{"Add":" if (len > EDGE_LENGTH) {"},{"Add":" if (++edges == 3)"},{"Add":" return false;"},{"Add":" }"},{"Add":" }"},{"Add":" return true;"},{"Add":"#endif"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"WindingIsHuge"},{"Add":""},{"Add":"Returns true if the winding still has one of the points"},{"Add":"from basewinding for plane"},{"Add":"================"},{"Add":"*/"},{"Add":"qboolean WindingIsHuge(winding_t *w) {"},{"Add":" int32_t i, j;"},{"Add":""},{"Add":" for (i = 0; i < w->numpoints; i++) {"},{"Add":" for (j = 0; j < 3; j++)"},{"Add":" if (w->p[i][j] < -2 * max_bounds || w->p[i][j] > 2 * max_bounds)"},{"Add":" return true;"},{"Add":" }"},{"Add":" return false;"},{"Add":"}"},{"Add":""},{"Add":"//============================================================"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"Leafnode"},{"Add":"================"},{"Add":"*/"},{"Add":"void LeafNode(node_t *node, bspbrush_t *brushes) {"},{"Add":" bspbrush_t *b;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" node->planenum = PLANENUM_LEAF;"},{"Add":" node->contents = 0;"},{"Add":""},{"Add":" for (b = brushes; b; b = b->next) {"},{"Add":" // if the brush is solid and all of its sides are on nodes,"},{"Add":" // it eats everything"},{"Add":" if (b->original->contents & CONTENTS_SOLID) {"},{"Add":" for (i = 0; i < b->numsides; i++)"},{"Add":" if (b->sides[i].texinfo != TEXINFO_NODE)"},{"Add":" break;"},{"Add":" if (i == b->numsides) {"},{"Add":" node->contents = CONTENTS_SOLID;"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":" node->contents |= b->original->contents;"},{"Add":" }"},{"Add":""},{"Add":" node->brushlist = brushes;"},{"Add":"}"},{"Add":""},{"Add":"//============================================================"},{"Add":""},{"Add":"// qb: GDD tools: brush info on error"},{"Add":"void CheckPlaneAgainstParents(int32_t pnum, node_t *node, bspbrush_t *brush) {"},{"Add":" node_t *p;"},{"Add":""},{"Add":" for (p = node->parent; p; p = p->parent) {"},{"Add":" if (p->planenum == pnum) {"},{"Add":" Error(\"Tried parent\\n Brush Bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" brush->mins[0], brush->mins[1], brush->mins[2], brush->maxs[0], brush->maxs[1], brush->maxs[2]);"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"qboolean CheckPlaneAgainstVolume(int32_t pnum, node_t *node) {"},{"Add":" bspbrush_t *front, *back;"},{"Add":" qboolean good;"},{"Add":""},{"Add":" SplitBrush(node->volume, pnum, &front, &back);"},{"Add":""},{"Add":" good = (front && back);"},{"Add":""},{"Add":" if (front)"},{"Add":" FreeBrush(front);"},{"Add":" if (back)"},{"Add":" FreeBrush(back);"},{"Add":""},{"Add":" return good;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"SelectSplitSide"},{"Add":""},{"Add":"Using a hueristic, choses one of the sides out of the brushlist"},{"Add":"to partition the brushes with."},{"Add":"Returns NULL if there are no valid planes to split with.."},{"Add":"================"},{"Add":"*/"},{"Add":"side_t *SelectSplitSide(bspbrush_t *brushes, node_t *node) {"},{"Add":" int32_t value, bestvalue;"},{"Add":" bspbrush_t *brush, *test;"},{"Add":" side_t *side, *bestside;"},{"Add":" int32_t i, j, pass, numpasses;"},{"Add":" int32_t pnum;"},{"Add":" int32_t s;"},{"Add":" int32_t front, back, both, facing, splits;"},{"Add":" int32_t bsplits;"},{"Add":" int32_t epsilonbrush;"},{"Add":" qboolean hintsplit, detailsplit;"},{"Add":""},{"Add":" bestside = NULL;"},{"Add":" bestvalue = -BOGUS_RANGE;"},{"Add":""},{"Add":" // the search order goes: visible-structural, visible-detail,"},{"Add":" // nonvisible-structural, nonvisible-detail."},{"Add":" // If any valid plane is available in a pass, no further"},{"Add":" // passes will be tried."},{"Add":" numpasses = 4;"},{"Add":" for (pass = 0; pass < numpasses; pass++) {"},{"Add":" for (brush = brushes; brush; brush = brush->next) {"},{"Add":" if ((pass & 1) && !(brush->original->contents & CONTENTS_DETAIL))"},{"Add":" continue;"},{"Add":" if (!(pass & 1) && (brush->original->contents & CONTENTS_DETAIL))"},{"Add":" continue;"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" side = brush->sides + i;"},{"Add":" if (side->bevel)"},{"Add":" continue; // never use a bevel as a spliter"},{"Add":" if (!side->winding)"},{"Add":" continue; // nothing visible, so it can't split"},{"Add":" if (side->texinfo == TEXINFO_NODE)"},{"Add":" continue; // allready a node splitter"},{"Add":" if (side->tested)"},{"Add":" continue; // we allready have metrics for this plane"},{"Add":" if (side->surf & SURF_SKIP)"},{"Add":" continue; // skip surfaces are never chosen"},{"Add":" if (side->visible ^ (pass < 2))"},{"Add":" continue; // only check visible faces on first pass"},{"Add":""},{"Add":" pnum = side->planenum;"},{"Add":" pnum &= ~1; // allways use positive facing plane"},{"Add":""},{"Add":" CheckPlaneAgainstParents(pnum, node, brush);"},{"Add":""},{"Add":" if (!CheckPlaneAgainstVolume(pnum, node))"},{"Add":" continue; // would produce a tiny volume"},{"Add":""},{"Add":" front = 0;"},{"Add":" back = 0;"},{"Add":" both = 0;"},{"Add":" facing = 0;"},{"Add":" splits = 0;"},{"Add":" epsilonbrush = 0;"},{"Add":""},{"Add":" for (test = brushes; test; test = test->next) {"},{"Add":" s = TestBrushToPlanenum(test, pnum, &bsplits, &hintsplit, &detailsplit, &epsilonbrush);"},{"Add":""},{"Add":" splits += bsplits;"},{"Add":" if (bsplits && (s & PSIDE_FACING))"},{"Add":" Error(\"PSIDE_FACING with splits\");"},{"Add":""},{"Add":" test->testside = s;"},{"Add":" // if the brush shares this face, don't bother"},{"Add":" // testing that facenum as a splitter again"},{"Add":" if (s & PSIDE_FACING) {"},{"Add":" facing++;"},{"Add":" for (j = 0; j < test->numsides; j++) {"},{"Add":" if ((test->sides[j].planenum & ~1) == pnum)"},{"Add":" test->sides[j].tested = true;"},{"Add":" }"},{"Add":" }"},{"Add":" if (s & PSIDE_FRONT)"},{"Add":" front++;"},{"Add":" if (s & PSIDE_BACK)"},{"Add":" back++;"},{"Add":" if (s == PSIDE_BOTH)"},{"Add":" both++;"},{"Add":" }"},{"Add":""},{"Add":" // give a value estimate for using this plane"},{"Add":""},{"Add":" value = 5 * facing - 5 * splits - abs(front - back);"},{"Add":" //\t\t\t\t\tvalue = -5*splits;"},{"Add":" //\t\t\t\t\tvalue = 5*facing - 5*splits;"},{"Add":" if (mapplanes[pnum].type < 3)"},{"Add":" value += 5; // axial is better"},{"Add":" value -= epsilonbrush * 1000; // avoid!"},{"Add":""},{"Add":" // never split a hint side except with another hint"},{"Add":" if ((hintsplit && !(side->surf & SURF_HINT)) && (!detailsplit || (side->contents & CONTENTS_DETAIL)))"},{"Add":" value = -BOGUS_RANGE;"},{"Add":""},{"Add":" // save off the side test so we don't need"},{"Add":" // to recalculate it when we actually seperate"},{"Add":" // the brushes"},{"Add":" if (value > bestvalue) {"},{"Add":" bestvalue = value;"},{"Add":" bestside = side;"},{"Add":" for (test = brushes; test; test = test->next)"},{"Add":" test->side = test->testside;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // if we found a good plane, don't bother trying any"},{"Add":" // other passes"},{"Add":" if (bestside) {"},{"Add":" if (pass > 1) {"},{"Add":" if (numthreads == 1)"},{"Add":" c_nonvis++;"},{"Add":" }"},{"Add":" if (pass > 0)"},{"Add":" node->detail_seperator = true; // not needed for vis"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" //"},{"Add":" // clear all the tested flags we set"},{"Add":" //"},{"Add":" for (brush = brushes; brush; brush = brush->next) {"},{"Add":" for (i = 0; i < brush->numsides; i++)"},{"Add":" brush->sides[i].tested = false;"},{"Add":" }"},{"Add":""},{"Add":" return bestside;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"=================="},{"Add":"BrushMostlyOnSide"},{"Add":""},{"Add":"=================="},{"Add":"*/"},{"Add":"int32_t BrushMostlyOnSide(bspbrush_t *brush, plane_t *plane) {"},{"Add":" int32_t i, j;"},{"Add":" winding_t *w;"},{"Add":" vec_t d, max;"},{"Add":" int32_t side;"},{"Add":""},{"Add":" max = 0;"},{"Add":" side = PSIDE_FRONT;"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" d = DotProduct(w->p[j], plane->normal) - plane->dist;"},{"Add":" if (d > max) {"},{"Add":" max = d;"},{"Add":" side = PSIDE_FRONT;"},{"Add":" }"},{"Add":" if (-d > max) {"},{"Add":" max = -d;"},{"Add":" side = PSIDE_BACK;"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":" return side;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"SplitBrush"},{"Add":""},{"Add":"Generates two new brushes, leaving the original"},{"Add":"unchanged"},{"Add":"================"},{"Add":"*/"},{"Add":"void SplitBrush(bspbrush_t *brush, int32_t planenum,"},{"Add":" bspbrush_t **front, bspbrush_t **back) {"},{"Add":" bspbrush_t *b[2];"},{"Add":" int32_t i, j;"},{"Add":" winding_t *w, *cw[2], *midwinding;"},{"Add":" plane_t *plane, *plane2;"},{"Add":" side_t *s, *cs;"},{"Add":" vec_t d, d_front, d_back;"},{"Add":""},{"Add":" *front = *back = NULL;"},{"Add":" plane = &mapplanes[planenum];"},{"Add":""},{"Add":" // check all points"},{"Add":" d_front = d_back = 0;"},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" w = brush->sides[i].winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" for (j = 0; j < w->numpoints; j++) {"},{"Add":" d = DotProduct(w->p[j], plane->normal) - plane->dist;"},{"Add":" if (d > 0 && d > d_front)"},{"Add":" d_front = d;"},{"Add":" if (d < 0 && d < d_back)"},{"Add":" d_back = d;"},{"Add":" }"},{"Add":" }"},{"Add":" // If the brush only overaps the plane by .1 units, don't bother splitting it."},{"Add":" if (d_front < ON_EPSILON) // qb: was 0.1"},{"Add":" {"},{"Add":" // only on back"},{"Add":" *back = CopyBrush(brush);"},{"Add":" return;"},{"Add":" }"},{"Add":" if (d_back > -ON_EPSILON) // qb: was -0.1"},{"Add":" {"},{"Add":" // only on front"},{"Add":" *front = CopyBrush(brush);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // create a new winding from the split plane"},{"Add":""},{"Add":" w = BaseWindingForPlane(plane->normal, plane->dist);"},{"Add":" for (i = 0; i < brush->numsides && w; i++) {"},{"Add":" plane2 = &mapplanes[brush->sides[i].planenum ^ 1];"},{"Add":" ChopWindingInPlace(&w, plane2->normal, plane2->dist, 0); // PLANESIDE_EPSILON);"},{"Add":" }"},{"Add":""},{"Add":" if (!w || WindingIsTiny(w)) {"},{"Add":" // the brush isn't really split"},{"Add":" int32_t side;"},{"Add":""},{"Add":" side = BrushMostlyOnSide(brush, plane);"},{"Add":" if (side == PSIDE_FRONT)"},{"Add":" *front = CopyBrush(brush);"},{"Add":" if (side == PSIDE_BACK)"},{"Add":" *back = CopyBrush(brush);"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (WindingIsHuge(w)) {"},{"Add":" qprintf(\"WARNING: huge winding\\n\");"},{"Add":" }"},{"Add":""},{"Add":" midwinding = w;"},{"Add":""},{"Add":" // split it for real"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" b[i] = AllocBrush(brush->numsides + 1);"},{"Add":" b[i]->original = brush->original;"},{"Add":" }"},{"Add":""},{"Add":" // split all the current windings"},{"Add":""},{"Add":" for (i = 0; i < brush->numsides; i++) {"},{"Add":" s = &brush->sides[i];"},{"Add":" w = s->winding;"},{"Add":" if (!w)"},{"Add":" continue;"},{"Add":" ClipWindingEpsilon(w, plane->normal, plane->dist,"},{"Add":" 0 /*PLANESIDE_EPSILON*/, &cw[0], &cw[1]); // qb:reenabling leaves gaps between some planes"},{"Add":" for (j = 0; j < 2; j++) {"},{"Add":" if (!cw[j])"},{"Add":" continue;"},{"Add":"#if 0"},{"Add":" if (WindingIsTiny (cw[j]))"},{"Add":" {"},{"Add":" FreeWinding (cw[j]);"},{"Add":" continue;"},{"Add":" }"},{"Add":"#endif"},{"Add":" cs = &b[j]->sides[b[j]->numsides];"},{"Add":" b[j]->numsides++;"},{"Add":" *cs = *s;"},{"Add":" //\t\t\tcs->planenum = s->planenum;"},{"Add":" //\t\t\tcs->texinfo = s->texinfo;"},{"Add":" //\t\t\tcs->visible = s->visible;"},{"Add":" //\t\t\tcs->original = s->original;"},{"Add":" cs->winding = cw[j];"},{"Add":" cs->tested = false;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // see if we have valid polygons on both sides"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" BoundBrush(b[i]);"},{"Add":" for (j = 0; j < 3; j++) {"},{"Add":" if (b[i]->mins[j] < -max_bounds || b[i]->maxs[j] > max_bounds) {"},{"Add":" qprintf(\"bogus brush after clip\\n\");"},{"Add":" break;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (b[i]->numsides < 3 || j < 3) {"},{"Add":" FreeBrush(b[i]);"},{"Add":" b[i] = NULL;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (!(b[0] && b[1])) {"},{"Add":" if (!b[0] && !b[1])"},{"Add":" qprintf(\"split removed brush\\n\");"},{"Add":" else"},{"Add":" qprintf(\"split not on both sides\\n\");"},{"Add":" if (b[0]) {"},{"Add":" FreeBrush(b[0]);"},{"Add":" *front = CopyBrush(brush);"},{"Add":" }"},{"Add":" if (b[1]) {"},{"Add":" FreeBrush(b[1]);"},{"Add":" *back = CopyBrush(brush);"},{"Add":" }"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" // add the midwinding to both sides"},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" cs = &b[i]->sides[b[i]->numsides];"},{"Add":" b[i]->numsides++;"},{"Add":""},{"Add":" cs->planenum = planenum ^ i ^ 1;"},{"Add":" cs->texinfo = TEXINFO_NODE;"},{"Add":" cs->visible = false;"},{"Add":" cs->tested = false;"},{"Add":" if (i == 0)"},{"Add":" cs->winding = CopyWinding(midwinding);"},{"Add":" else"},{"Add":" cs->winding = midwinding;"},{"Add":" }"},{"Add":""},{"Add":" {"},{"Add":" vec_t v1;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" v1 = BrushVolume(b[i]);"},{"Add":" if (v1 < microvolume) // jit - allow for smaller brush volumes"},{"Add":" {"},{"Add":" FreeBrush(b[i]);"},{"Add":" b[i] = NULL;"},{"Add":" //\t\t\tqprintf (\"tiny volume after clip\\n\");"},{"Add":" }"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" *front = b[0];"},{"Add":" *back = b[1];"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"SplitBrushList"},{"Add":"================"},{"Add":"*/"},{"Add":"void SplitBrushList(bspbrush_t *brushes,"},{"Add":" node_t *node, bspbrush_t **front, bspbrush_t **back) {"},{"Add":" bspbrush_t *brush, *newbrush, *newbrush2;"},{"Add":" side_t *side;"},{"Add":" int32_t sides;"},{"Add":" int32_t i;"},{"Add":""},{"Add":" *front = *back = NULL;"},{"Add":""},{"Add":" for (brush = brushes; brush; brush = brush->next) {"},{"Add":" sides = brush->side;"},{"Add":""},{"Add":" if (sides == PSIDE_BOTH) {"},{"Add":" // split into two brushes"},{"Add":" SplitBrush(brush, node->planenum, &newbrush, &newbrush2);"},{"Add":" if (newbrush) {"},{"Add":" newbrush->next = *front;"},{"Add":" *front = newbrush;"},{"Add":" }"},{"Add":" if (newbrush2) {"},{"Add":" newbrush2->next = *back;"},{"Add":" *back = newbrush2;"},{"Add":" }"},{"Add":" continue;"},{"Add":" }"},{"Add":""},{"Add":" newbrush = CopyBrush(brush);"},{"Add":""},{"Add":" // if the planenum is actualy a part of the brush"},{"Add":" // find the plane and flag it as used so it won't be tried"},{"Add":" // as a splitter again"},{"Add":" if (sides & PSIDE_FACING) {"},{"Add":" for (i = 0; i < newbrush->numsides; i++) {"},{"Add":" side = newbrush->sides + i;"},{"Add":" if ((side->planenum & ~1) == node->planenum)"},{"Add":" side->texinfo = TEXINFO_NODE;"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" if (sides & PSIDE_FRONT) {"},{"Add":" newbrush->next = *front;"},{"Add":" *front = newbrush;"},{"Add":" continue;"},{"Add":" }"},{"Add":" if (sides & PSIDE_BACK) {"},{"Add":" newbrush->next = *back;"},{"Add":" *back = newbrush;"},{"Add":" continue;"},{"Add":" }"},{"Add":" }"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"================"},{"Add":"BuildTree_r"},{"Add":"================"},{"Add":"*/"},{"Add":"node_t *BuildTree_r(node_t *node, bspbrush_t *brushes) {"},{"Add":" node_t *newnode;"},{"Add":" side_t *bestside;"},{"Add":" int32_t i;"},{"Add":" bspbrush_t *children[2];"},{"Add":""},{"Add":" if (numthreads == 1)"},{"Add":" c_nodes++;"},{"Add":""},{"Add":" // find the best plane to use as a splitter"},{"Add":" bestside = SelectSplitSide(brushes, node);"},{"Add":" if (!bestside) {"},{"Add":" // leaf node"},{"Add":" node->side = NULL;"},{"Add":" node->planenum = -1;"},{"Add":" LeafNode(node, brushes);"},{"Add":" return node;"},{"Add":" }"},{"Add":""},{"Add":" // this is a splitplane node"},{"Add":" node->side = bestside;"},{"Add":" node->planenum = bestside->planenum & ~1; // always use front facing"},{"Add":""},{"Add":" SplitBrushList(brushes, node, &children[0], &children[1]);"},{"Add":" FreeBrushList(brushes);"},{"Add":""},{"Add":" // allocate children before recursing"},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" newnode = AllocNode();"},{"Add":" newnode->parent = node;"},{"Add":" node->children[i] = newnode;"},{"Add":" }"},{"Add":""},{"Add":" SplitBrush(node->volume, node->planenum, &node->children[0]->volume,"},{"Add":" &node->children[1]->volume);"},{"Add":""},{"Add":" // recursively process children"},{"Add":" for (i = 0; i < 2; i++) {"},{"Add":" node->children[i] = BuildTree_r(node->children[i], children[i]);"},{"Add":" }"},{"Add":""},{"Add":" return node;"},{"Add":"}"},{"Add":""},{"Add":"//==========================================================="},{"Add":""},{"Add":"/*"},{"Add":"================="},{"Add":"BrushBSP"},{"Add":""},{"Add":"The incoming list will be freed before exiting"},{"Add":"================="},{"Add":"*/"},{"Add":"tree_t *BrushBSP(bspbrush_t *brushlist, vec3_t mins, vec3_t maxs) {"},{"Add":" node_t *node;"},{"Add":" bspbrush_t *b;"},{"Add":" int32_t c_faces, c_nonvisfaces;"},{"Add":" int32_t c_brushes;"},{"Add":" tree_t *tree;"},{"Add":" int32_t i;"},{"Add":" vec_t volume;"},{"Add":""},{"Add":" qprintf(\"--- BrushBSP ---\\n\");"},{"Add":""},{"Add":" tree = AllocTree();"},{"Add":""},{"Add":" c_faces = 0;"},{"Add":" c_nonvisfaces = 0;"},{"Add":" c_brushes = 0;"},{"Add":" for (b = brushlist; b; b = b->next) {"},{"Add":" c_brushes++;"},{"Add":""},{"Add":" volume = BrushVolume(b);"},{"Add":" if (volume < microvolume) {"},{"Add":" printf(\"WARNING: Entity %i, Brush %i, Line %i: microbrush\\n Bounds: %g %g %g -> %g %g %g\\n\","},{"Add":" b->original->entitynum, b->original->brushnum, scriptline + 1, // qb: add scriptline"},{"Add":" b->mins[0], b->mins[1], b->mins[2], b->maxs[0], b->maxs[1], b->maxs[2]);"},{"Add":" }"},{"Add":""},{"Add":" for (i = 0; i < b->numsides; i++) {"},{"Add":" if (b->sides[i].bevel)"},{"Add":" continue;"},{"Add":" if (!b->sides[i].winding)"},{"Add":" continue;"},{"Add":" if (b->sides[i].texinfo == TEXINFO_NODE)"},{"Add":" continue;"},{"Add":" if (b->sides[i].visible)"},{"Add":" c_faces++;"},{"Add":" else"},{"Add":" c_nonvisfaces++;"},{"Add":" }"},{"Add":""},{"Add":" AddPointToBounds(b->mins, tree->mins, tree->maxs);"},{"Add":" AddPointToBounds(b->maxs, tree->mins, tree->maxs);"},{"Add":" }"},{"Add":""},{"Add":" qprintf(\"%5i brushes\\n\", c_brushes);"},{"Add":" qprintf(\"%5i visible faces\\n\", c_faces);"},{"Add":" qprintf(\"%5i nonvisible faces\\n\", c_nonvisfaces);"},{"Add":""},{"Add":" c_nodes = 0;"},{"Add":" c_nonvis = 0;"},{"Add":" node = AllocNode();"},{"Add":""},{"Add":" node->volume = BrushFromBounds(mins, maxs);"},{"Add":""},{"Add":" tree->headnode = node;"},{"Add":""},{"Add":" node = BuildTree_r(node, brushlist);"},{"Add":" qprintf(\"%5i visible nodes\\n\", c_nodes / 2 - c_nonvis);"},{"Add":" qprintf(\"%5i nonvis nodes\\n\", c_nonvis);"},{"Add":" qprintf(\"%5i leafs\\n\", (c_nodes + 1) / 2);"},{"Add":"#if 0"},{"Add":" {"},{"Add":" // debug code"},{"Add":" static node_t\t*tnode;"},{"Add":" vec3_t\tp;"},{"Add":""},{"Add":" p[0] = -1469;"},{"Add":" p[1] = -118;"},{"Add":" p[2] = 119;"},{"Add":" tnode = PointInLeaf (tree->headnode, p);"},{"Add":" printf (\"contents: %i\\n\", tnode->contents);"},{"Add":" p[0] = 0;"},{"Add":" }"},{"Add":"#endif"},{"Add":" return tree;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4bsp_main.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"extern char name[1024];"},{"Add":""},{"Add":"extern qboolean origfix;"},{"Add":"extern qboolean nocsg;"},{"Add":"extern qboolean onlyents;"},{"Add":"extern qboolean leaktest;"},{"Add":"extern int32_t block_size;"},{"Add":"extern float subdivide_size;"},{"Add":"extern float sublight_size;"},{"Add":"extern int32_t block_xl;"},{"Add":"extern int32_t block_yl;"},{"Add":"extern int32_t block_xh;"},{"Add":"extern int32_t block_yh;"},{"Add":""},{"Add":"void BSP_ProcessArgument(const char * arg) ;"},{"Add":""},{"Add":"int32_t main(int32_t argc, char **argv) {"},{"Add":" int32_t i;"},{"Add":" char tgamedir[1024] = \"\", tbasedir[1024] = \"\", tmoddir[1024] = \"\";"},{"Add":""},{"Add":" printf(\"\\n\\n<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4bsp >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\");"},{"Add":" printf(\"BSP compiler build \" __DATE__ \"\\n\");"},{"Add":""},{"Add":" for (i = 1; i < argc; i++) {"},{"Add":" if (!strcmp(argv[i], \"-noorigfix\")) {"},{"Add":" printf(\"origfix = false\\n\");"},{"Add":" origfix = false;"},{"Add":" } else if (!strcmp(argv[i], \"-v\")) {"},{"Add":" printf(\"verbose = true\\n\");"},{"Add":" verbose = true;"},{"Add":" } else if (!strcmp(argv[i], \"-help\")) {"},{"Add":" printf(\"4bsp supporting v38 and v220 map formats plus QBSP extended limits.\\n\""},{"Add":" \"Usage: 4bsp [options] [mapname]\\n\\n\""},{"Add":" \" -chop #: Subdivide size.\\n\""},{"Add":" \" Default: 240 Range: 32-1024\\n\""},{"Add":" \" -choplight #: Subdivide size for surface lights.\\n\""},{"Add":" \" Default: 240 Range: 32-1024\\n\""},{"Add":" \" -largebounds: Increase max map size for supporting engines.\\n\""},{"Add":" \" -micro #: Minimum microbrush size. Default: 0.02\\n\""},{"Add":" \" Suggested range: 0.02 - 1.0\\n\""},{"Add":" \" -nosubdiv: Disable subdivision.\\n\""},{"Add":" \" -qbsp: Greatly expanded map and entity limits for supporting engines.\\n\""},{"Add":" \" -moddir [path]: Set a mod directory. Default is parent dir of map file.\\n\""},{"Add":" \" -basedir [path]: Set the directory for assets not in moddir. Default is moddir.\\n\""},{"Add":" \" -gamedir [path]: Set game directory, the folder with game executable.\\n\""},{"Add":" //\" -threads #: number of CPU threads to use\\n\""},{"Add":" \"Debugging tools:\\n\""},{"Add":" \" -block # #: Division tree block size, square\\n\""},{"Add":" \" -blocks # # # #: Div tree block size, rectangular\\n\""},{"Add":" \" -blocksize: map cube size for processing. Default: 1024\\n\""},{"Add":" \" -fulldetail: Change most brushes to detail.\\n\""},{"Add":" \" -leaktest: Perform leak test only.\\n\""},{"Add":" \" -nocsg: No constructive solid geometry.\\n\""},{"Add":" \" -nodetail: No detail brushes.\\n\""},{"Add":" \" -nomerge: Don't merge visible faces per node.\\n\""},{"Add":" \" -noorigfix: Disable texture fix for origin offsets.\\n\""},{"Add":" \" -noprune: Disable node pruning.\\n\""},{"Add":" \" -noshare: Don't look for shared edges on save.\\n\""},{"Add":" \" -noskipfix: Do not automatically set skip contents to zero.\\n\""},{"Add":" \" -notjunc: Disable edge cleanup.\\n\""},{"Add":" \" -nowater: Ignore warp surfaces.\\n\""},{"Add":" \" -noweld: Disable vertex welding.\\n\""},{"Add":" \" -onlyents: Grab the entites and resave.\\n\""},{"Add":" \" -v: Display more verbose output.\\n\""},{"Add":" \"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< 4bsp HELP >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":""},{"Add":" exit(1);"},{"Add":" }"},{"Add":" /*"},{"Add":" if (!strcmp(argv[i],\"-threads\"))"},{"Add":" {"},{"Add":" numthreads = atoi (argv[i+1]);"},{"Add":" i++;"},{"Add":" }"},{"Add":" */"},{"Add":" else if (!strcmp(argv[i], \"-noweld\")) {"},{"Add":" printf(\"noweld = true\\n\");"},{"Add":" noweld = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nocsg\")) {"},{"Add":" printf(\"nocsg = true\\n\");"},{"Add":" nocsg = true;"},{"Add":" } else if (!strcmp(argv[i], \"-noshare\")) {"},{"Add":" printf(\"noshare = true\\n\");"},{"Add":" noshare = true;"},{"Add":" } else if (!strcmp(argv[i], \"-notjunc\")) {"},{"Add":" printf(\"notjunc = true\\n\");"},{"Add":" notjunc = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nowater\")) {"},{"Add":" printf(\"nowater = true\\n\");"},{"Add":" nowater = true;"},{"Add":" } else if (!strcmp(argv[i], \"-noprune\")) {"},{"Add":" printf(\"noprune = true\\n\");"},{"Add":" noprune = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nomerge\")) {"},{"Add":" printf(\"nomerge = true\\n\");"},{"Add":" nomerge = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nosubdiv\")) {"},{"Add":" printf(\"nosubdiv = true\\n\");"},{"Add":" nosubdiv = true;"},{"Add":" } else if (!strcmp(argv[i], \"-nodetail\")) {"},{"Add":" printf(\"nodetail = true\\n\");"},{"Add":" nodetail = true;"},{"Add":" } else if (!strcmp(argv[i], \"-fulldetail\")) {"},{"Add":" printf(\"fulldetail = true\\n\");"},{"Add":" fulldetail = true;"},{"Add":" } else if (!strcmp(argv[i], \"-onlyents\")) {"},{"Add":" printf(\"onlyents = true\\n\");"},{"Add":" onlyents = true;"},{"Add":" } else if (!strcmp(argv[i], \"-micro\")) {"},{"Add":" microvolume = atof(argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-leaktest\")) {"},{"Add":" printf(\"leaktest = true\\n\");"},{"Add":" leaktest = true;"},{"Add":" }"},{"Add":""},{"Add":" // qb: qbsp"},{"Add":" else if (!strcmp(argv[i], \"-qbsp\")) {"},{"Add":" printf(\"use_qbsp = true\\n\");"},{"Add":" use_qbsp = true;"},{"Add":" max_entities = MAX_MAP_ENTITIES_QBSP;"},{"Add":" max_bounds = MAX_MAP_SIZE;"},{"Add":" block_size = MAX_BLOCK_SIZE; // qb: otherwise limits map range"},{"Add":" } else if (!strcmp(argv[i], \"-noskipfix\")) {"},{"Add":" printf(\"noskipfix = true\\n\");"},{"Add":" noskipfix = true;"},{"Add":""},{"Add":" }"},{"Add":""},{"Add":" // qb: from kmqbsp3- Knightmare added"},{"Add":" else if (!strcmp(argv[i], \"-largebounds\") || !strcmp(argv[i], \"-lb\")) {"},{"Add":" if (use_qbsp) {"},{"Add":" printf(\"[-largebounds is not required with -qbsp]\\n\");"},{"Add":" } else {"},{"Add":" max_bounds = MAX_MAP_SIZE;"},{"Add":" block_size = MAX_BLOCK_SIZE; // qb: otherwise limits map range"},{"Add":" printf(\"largebounds: using max bound size of %i\\n\", MAX_MAP_SIZE);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" // qb: set gamedir, moddir, and basedir"},{"Add":" else if (!strcmp(argv[i], \"-gamedir\")) {"},{"Add":" strcpy(tgamedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-moddir\")) {"},{"Add":" strcpy(tmoddir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-basedir\")) {"},{"Add":" strcpy(tbasedir, argv[i + 1]);"},{"Add":" i++;"},{"Add":" }"},{"Add":""},{"Add":" else if ((!strcmp(argv[i], \"-chop\")) || (!strcmp(argv[i], \"-subdiv\"))) {"},{"Add":" subdivide_size = atof(argv[i + 1]);"},{"Add":" if (subdivide_size < 32) {"},{"Add":" subdivide_size = 32;"},{"Add":" printf(\"subdivide_size set to minimum size: 32\\n\");"},{"Add":" }"},{"Add":" if (subdivide_size > 1024) {"},{"Add":" subdivide_size = 1024;"},{"Add":" printf(\"subdivide_size set to maximum size: 1024\\n\");"},{"Add":" }"},{"Add":" printf(\"subdivide_size = %f\\n\", subdivide_size);"},{"Add":" i++;"},{"Add":" } else if ((!strcmp(argv[i], \"-choplight\")) || (!strcmp(argv[i], \"-choplights\")) || (!strcmp(argv[i], \"-subdivlight\"))) // qb: chop surf lights independently"},{"Add":" {"},{"Add":" sublight_size = atof(argv[i + 1]);"},{"Add":" if (sublight_size < 32) {"},{"Add":" sublight_size = 32;"},{"Add":" printf(\"sublight_size set to minimum size: 32\\n\");"},{"Add":" }"},{"Add":" if (sublight_size > 1024) {"},{"Add":" sublight_size = 1024;"},{"Add":" printf(\"sublight_size set to maximum size: 1024\\n\");"},{"Add":" }"},{"Add":" printf(\"sublight_size = %f\\n\", sublight_size);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-blocksize\")) {"},{"Add":" block_size = atof(argv[i + 1]);"},{"Add":" if (block_size < 128) {"},{"Add":" block_size = 128;"},{"Add":" printf(\"block_size set to minimum size: 128\\n\");"},{"Add":" }"},{"Add":" if (block_size > MAX_BLOCK_SIZE) {"},{"Add":" block_size = MAX_BLOCK_SIZE;"},{"Add":" printf(\"block_size set to minimum size: MAX_BLOCK_SIZE\\n\");"},{"Add":" }"},{"Add":" printf(\"blocksize: %i\\n\", block_size);"},{"Add":" i++;"},{"Add":" } else if (!strcmp(argv[i], \"-block\")) {"},{"Add":" block_xl = block_yl = atoi(argv[i + 1]); // qb: fixed... has it always been wrong? was xl = xh and yl = yh"},{"Add":" block_xh = block_yh = atoi(argv[i + 2]);"},{"Add":" printf(\"block: %i,%i\\n\", block_xl, block_xh);"},{"Add":" i += 2;"},{"Add":" } else if (!strcmp(argv[i], \"-blocks\")) {"},{"Add":" block_xl = atoi(argv[i + 1]);"},{"Add":" block_yl = atoi(argv[i + 2]);"},{"Add":" block_xh = atoi(argv[i + 3]);"},{"Add":" block_yh = atoi(argv[i + 4]);"},{"Add":" printf(\"blocks: %i,%i to %i,%i\\n\","},{"Add":" block_xl, block_yl, block_xh, block_yh);"},{"Add":" i += 4;"},{"Add":" } else"},{"Add":" break;"},{"Add":" }"},{"Add":""},{"Add":" if (i != argc - 1) {"},{"Add":" printf(\"Supporting v38 and v220 map formats plus QBSP extended limits.\\n\""},{"Add":" \"Usage: 4bsp [options] [mapname]\\n\""},{"Add":" \" -chop # -choplight # -help\\n\""},{"Add":" \" -largebounds -micro # -nosubdiv\\n\""},{"Add":" \" -qbsp -gamedir -basedir\\n\""},{"Add":" \"Debugging tools: -block # # -blocks # # # #\\n\""},{"Add":" \" -blocksize # -fulldetail -leaktest\\n\""},{"Add":" \" -nocsg -nodetail -nomerge\\n\""},{"Add":" \" -noorigfix -noprune -noshare\\n\""},{"Add":" \" -noskipfix -notjunc -nowater\\n\""},{"Add":" \" -noweld -onlyents -v (verbose)\\n\\n\");"},{"Add":""},{"Add":" exit(1);"},{"Add":" }"},{"Add":""},{"Add":" ThreadSetDefault();"},{"Add":""},{"Add":" // qb: below is from original source release. On Windows, multi threads cause false leak errors."},{"Add":" numthreads = 1; // multiple threads aren't helping..."},{"Add":""},{"Add":" SetQdirFromPath(argv[i]);"},{"Add":""},{"Add":" if (strcmp(tmoddir, \"\")) {"},{"Add":" strcpy(moddir, tmoddir);"},{"Add":" Q_pathslash(moddir);"},{"Add":" strcpy(basedir, moddir);"},{"Add":" }"},{"Add":" if (strcmp(tbasedir, \"\")) {"},{"Add":" strcpy(basedir, tbasedir);"},{"Add":" Q_pathslash(basedir);"},{"Add":" if (!strcmp(tmoddir, \"\"))"},{"Add":" strcpy(moddir, basedir);"},{"Add":" }"},{"Add":" if (strcmp(tgamedir, \"\")) {"},{"Add":" strcpy(gamedir, tgamedir);"},{"Add":" Q_pathslash(gamedir);"},{"Add":" }"},{"Add":" printf(\"microvolume = %f\\n\\n\", microvolume);"},{"Add":""},{"Add":" // qb: display dirs"},{"Add":" printf(\"moddir = %s\\n\", moddir);"},{"Add":" printf(\"basedir = %s\\n\", basedir);"},{"Add":" printf(\"gamedir = %s\\n\", gamedir);"},{"Add":""},{"Add":" BSP_ProcessArgument(argv[i]);"},{"Add":""},{"Add":" return 0;"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"4bsp.c","metadata":0},"context":[{"change":0,"pos":342949}],"contents":[{"Add":"/*"},{"Add":"==========================================================================="},{"Add":"Copyright (C) 1997-2006 Id Software, Inc."},{"Add":""},{"Add":"This program is free software; you can redistribute it and/or modify"},{"Add":"it under the terms of the GNU General Public License as published by"},{"Add":"the Free Software Foundation; either version 2 of the License, or"},{"Add":"(at your option) any later version."},{"Add":""},{"Add":"This program is distributed in the hope that it will be useful,"},{"Add":"but WITHOUT ANY WARRANTY; without even the implied warranty of"},{"Add":"MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the"},{"Add":"GNU General Public License for more details."},{"Add":""},{"Add":"You should have received a copy of the GNU General Public License along"},{"Add":"with this program; if not, write to the Free Software Foundation, Inc.,"},{"Add":"51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA."},{"Add":"==========================================================================="},{"Add":"*/"},{"Add":""},{"Add":"#include \"qbsp.h\""},{"Add":""},{"Add":"extern float subdivide_size;"},{"Add":"extern float sublight_size;"},{"Add":""},{"Add":"extern char source[1024];"},{"Add":"char name[1024];"},{"Add":""},{"Add":"vec_t microvolume = 0.02f; // jit - was 1.0, but this messes up small brushes"},{"Add":"qboolean noprune = false;"},{"Add":"qboolean glview = false;"},{"Add":"qboolean nodetail = false;"},{"Add":"qboolean fulldetail = false;"},{"Add":"qboolean onlyents = false;"},{"Add":"qboolean nomerge = false;"},{"Add":"qboolean nowater = false;"},{"Add":"qboolean nocsg = false;"},{"Add":"qboolean noweld = false;"},{"Add":"qboolean noshare = false;"},{"Add":"qboolean nosubdiv = false;"},{"Add":"qboolean notjunc = false;"},{"Add":"qboolean leaktest = false;"},{"Add":"qboolean badnormal_check = false;"},{"Add":"qboolean origfix = true; // default to true"},{"Add":""},{"Add":"int32_t block_xl = -8, block_xh = 7, block_yl = -8, block_yh = 7;"},{"Add":""},{"Add":"int32_t entity_num;"},{"Add":""},{"Add":"int32_t max_entities = MAX_MAP_ENTITIES; // qb: from kmqbsp3- Knightmare- adjustable entity limit"},{"Add":"int32_t max_bounds = DEFAULT_MAP_SIZE; // Knightmare- adjustable max bounds"},{"Add":"int32_t block_size = 1024; // Knightmare- adjustable block size"},{"Add":""},{"Add":"node_t *block_nodes[10][10];"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"BlockTree"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"node_t *BlockTree(int32_t xl, int32_t yl, int32_t xh, int32_t yh) {"},{"Add":" node_t *node;"},{"Add":" vec3_t normal;"},{"Add":" vec_t dist;"},{"Add":" int32_t mid;"},{"Add":""},{"Add":" if (xl == xh && yl == yh) {"},{"Add":" node = block_nodes[xl + 5][yl + 5];"},{"Add":" if (!node) {"},{"Add":" // return an empty leaf"},{"Add":" node = AllocNode();"},{"Add":" node->planenum = PLANENUM_LEAF;"},{"Add":" node->contents = 0; // CONTENTS_SOLID;"},{"Add":" return node;"},{"Add":" }"},{"Add":" return node;"},{"Add":" }"},{"Add":""},{"Add":" // create a seperator along the largest axis"},{"Add":" node = AllocNode();"},{"Add":""},{"Add":" if (xh - xl > yh - yl) {"},{"Add":" // split x axis"},{"Add":" mid = xl + (xh - xl) / 2 + 1;"},{"Add":" normal[0] = 1;"},{"Add":" normal[1] = 0;"},{"Add":" normal[2] = 0;"},{"Add":" dist = mid * block_size;"},{"Add":" node->planenum = FindFloatPlane(normal, dist, 0);"},{"Add":" node->children[0] = BlockTree(mid, yl, xh, yh);"},{"Add":" node->children[1] = BlockTree(xl, yl, mid - 1, yh);"},{"Add":" } else {"},{"Add":" mid = yl + (yh - yl) / 2 + 1;"},{"Add":" normal[0] = 0;"},{"Add":" normal[1] = 1;"},{"Add":" normal[2] = 0;"},{"Add":" dist = mid * block_size;"},{"Add":" node->planenum = FindFloatPlane(normal, dist, 0);"},{"Add":" node->children[0] = BlockTree(xl, mid, xh, yh);"},{"Add":" node->children[1] = BlockTree(xl, yl, xh, mid - 1);"},{"Add":" }"},{"Add":""},{"Add":" return node;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"ProcessBlock_Thread"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"int32_t brush_start, brush_end;"},{"Add":"void ProcessBlock_Thread(int32_t blocknum) {"},{"Add":" int32_t xblock, yblock;"},{"Add":" vec3_t mins, maxs;"},{"Add":" bspbrush_t *brushes;"},{"Add":" tree_t *tree;"},{"Add":" node_t *node;"},{"Add":""},{"Add":" yblock = block_yl + blocknum / (block_xh - block_xl + 1);"},{"Add":" xblock = block_xl + blocknum % (block_xh - block_xl + 1);"},{"Add":""},{"Add":" qprintf(\"############### block %2i,%2i ###############\\n\", xblock, yblock);"},{"Add":""},{"Add":" mins[0] = xblock * block_size;"},{"Add":" mins[1] = yblock * block_size;"},{"Add":" mins[2] = -max_bounds; // was -4096"},{"Add":" maxs[0] = (xblock + 1) * block_size;"},{"Add":" maxs[1] = (yblock + 1) * block_size;"},{"Add":" maxs[2] = max_bounds; // was 4096"},{"Add":""},{"Add":" // the makelist and chopbrushes could be cached between the passes..."},{"Add":" brushes = MakeBspBrushList(brush_start, brush_end, mins, maxs);"},{"Add":" if (!brushes) {"},{"Add":" node = AllocNode();"},{"Add":" node->planenum = PLANENUM_LEAF;"},{"Add":" node->contents = CONTENTS_SOLID;"},{"Add":" block_nodes[xblock + 5][yblock + 5] = node;"},{"Add":" return;"},{"Add":" }"},{"Add":""},{"Add":" if (!nocsg)"},{"Add":" brushes = ChopBrushes(brushes);"},{"Add":""},{"Add":" tree = BrushBSP(brushes, mins, maxs);"},{"Add":""},{"Add":" block_nodes[xblock + 5][yblock + 5] = tree->headnode;"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"ProcessWorldModel"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"void ProcessWorldModel(void) {"},{"Add":" entity_t *e;"},{"Add":" tree_t *tree;"},{"Add":" qboolean leaked;"},{"Add":" qboolean optimize;"},{"Add":""},{"Add":" e = &entities[entity_num];"},{"Add":""},{"Add":" brush_start = e->firstbrush;"},{"Add":" brush_end = brush_start + e->numbrushes;"},{"Add":" leaked = false;"},{"Add":""},{"Add":" //"},{"Add":" // perform per-block operations"},{"Add":" //"},{"Add":" if (block_xh * block_size > map_maxs[0])"},{"Add":" block_xh = floor(map_maxs[0] / block_size);"},{"Add":" if ((block_xl + 1) * block_size < map_mins[0])"},{"Add":" block_xl = floor(map_mins[0] / block_size);"},{"Add":" if (block_yh * block_size > map_maxs[1])"},{"Add":" block_yh = floor(map_maxs[1] / block_size);"},{"Add":" if ((block_yl + 1) * block_size < map_mins[1])"},{"Add":" block_yl = floor(map_mins[1] / block_size);"},{"Add":""},{"Add":" if (block_xl < -4)"},{"Add":" block_xl = -4;"},{"Add":" if (block_yl < -4)"},{"Add":" block_yl = -4;"},{"Add":" if (block_xh > 3)"},{"Add":" block_xh = 3;"},{"Add":" if (block_yh > 3)"},{"Add":" block_yh = 3;"},{"Add":""},{"Add":" for (optimize = false; optimize <= true; optimize++) {"},{"Add":" qprintf(\"--------------------------------------------\\n\");"},{"Add":""},{"Add":" RunThreadsOnIndividual((block_xh - block_xl + 1) * (block_yh - block_yl + 1),"},{"Add":" !verbose, ProcessBlock_Thread);"},{"Add":""},{"Add":" //"},{"Add":" // build the division tree"},{"Add":" // oversizing the blocks guarantees that all the boundaries"},{"Add":" // will also get nodes."},{"Add":" //"},{"Add":""},{"Add":" qprintf(\"--------------------------------------------\\n\");"},{"Add":""},{"Add":" tree = AllocTree();"},{"Add":" tree->headnode = BlockTree(block_xl - 1, block_yl - 1, block_xh + 1, block_yh + 1);"},{"Add":""},{"Add":" tree->mins[0] = (block_xl)*block_size;"},{"Add":" tree->mins[1] = (block_yl)*block_size;"},{"Add":" tree->mins[2] = map_mins[2] - 8;"},{"Add":""},{"Add":" tree->maxs[0] = (block_xh + 1) * block_size;"},{"Add":" tree->maxs[1] = (block_yh + 1) * block_size;"},{"Add":" tree->maxs[2] = map_maxs[2] + 8;"},{"Add":""},{"Add":" //"},{"Add":" // perform the global operations"},{"Add":" //"},{"Add":" MakeTreePortals(tree);"},{"Add":""},{"Add":" if (FloodEntities(tree))"},{"Add":" FillOutside(tree->headnode);"},{"Add":" else {"},{"Add":" printf(\"**** leaked ****\\n\");"},{"Add":" leaked = true;"},{"Add":" LeakFile(tree);"},{"Add":" if (leaktest) {"},{"Add":" printf(\"--- MAP LEAKED ---\\n\");"},{"Add":" exit(0);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" MarkVisibleSides(tree, brush_start, brush_end);"},{"Add":" if (leaked)"},{"Add":" break;"},{"Add":" if (!optimize) {"},{"Add":" FreeTree(tree);"},{"Add":" }"},{"Add":" }"},{"Add":""},{"Add":" FloodAreas(tree);"},{"Add":" MakeFaces(tree->headnode);"},{"Add":" FixTjuncs(tree->headnode);"},{"Add":""},{"Add":" if (!noprune)"},{"Add":" PruneNodes(tree->headnode);"},{"Add":""},{"Add":" WriteBSP(tree->headnode);"},{"Add":""},{"Add":" if (!leaked)"},{"Add":" WritePortalFile(tree);"},{"Add":""},{"Add":" FreeTree(tree);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"ProcessSubModel"},{"Add":""},{"Add":"============"},{"Add":"*/"},{"Add":"void ProcessSubModel(void) {"},{"Add":" entity_t *e;"},{"Add":" int32_t start, end;"},{"Add":" tree_t *tree;"},{"Add":" bspbrush_t *list;"},{"Add":" vec3_t mins, maxs;"},{"Add":""},{"Add":" e = &entities[entity_num];"},{"Add":""},{"Add":" start = e->firstbrush;"},{"Add":" end = start + e->numbrushes;"},{"Add":""},{"Add":" mins[0] = mins[1] = mins[2] = -max_bounds;"},{"Add":" maxs[0] = maxs[1] = maxs[2] = max_bounds;"},{"Add":" list = MakeBspBrushList(start, end, mins, maxs);"},{"Add":" if (!nocsg)"},{"Add":" list = ChopBrushes(list);"},{"Add":" tree = BrushBSP(list, mins, maxs);"},{"Add":" MakeTreePortals(tree);"},{"Add":" MarkVisibleSides(tree, start, end);"},{"Add":" MakeFaces(tree->headnode);"},{"Add":" FixTjuncs(tree->headnode);"},{"Add":" WriteBSP(tree->headnode);"},{"Add":" FreeTree(tree);"},{"Add":"}"},{"Add":""},{"Add":"/*"},{"Add":"============"},{"Add":"ProcessModels"},{"Add":"============"},{"Add":"*/"},{"Add":"void ProcessModels(void) {"},{"Add":" BeginBSPFile();"},{"Add":""},{"Add":" for (entity_num = 0; entity_num < num_entities; entity_num++) {"},{"Add":" if (!entities[entity_num].numbrushes)"},{"Add":" continue;"},{"Add":""},{"Add":" qprintf(\"############### model %i ###############\\n\", nummodels);"},{"Add":" BeginModel();"},{"Add":" if (entity_num == 0)"},{"Add":" ProcessWorldModel();"},{"Add":" else"},{"Add":" ProcessSubModel();"},{"Add":" EndModel();"},{"Add":" }"},{"Add":""},{"Add":" EndBSPFile();"},{"Add":"}"},{"Add":""},{"Add":"void BSP_ProcessArgument(const char * arg) {"},{"Add":" char path[2053];"},{"Add":""},{"Add":" strcpy(source, ExpandArg(arg));"},{"Add":" StripExtension(source);"},{"Add":""},{"Add":" // delete portal and line files"},{"Add":" sprintf(path, \"%s.prt\", source);"},{"Add":" remove(path);"},{"Add":" sprintf(path, \"%s.pts\", source);"},{"Add":" remove(path);"},{"Add":""},{"Add":" strcpy(name, ExpandArg(arg));"},{"Add":" DefaultExtension(name, \".map\"); // might be .reg"},{"Add":""},{"Add":" InitBSPFile();"},{"Add":""},{"Add":" //"},{"Add":" // if onlyents, just grab the entites and resave"},{"Add":" //"},{"Add":" if (onlyents) {"},{"Add":" char out[2053];"},{"Add":""},{"Add":" sprintf(out, \"%s.bsp\", source);"},{"Add":" LoadBSPFile(out);"},{"Add":" if (use_qbsp)"},{"Add":" printf(\"use_qbsp = true\\n\");"},{"Add":""},{"Add":" num_entities = 0;"},{"Add":""},{"Add":" LoadMapFile(name);"},{"Add":" SetModelNumbers();"},{"Add":" SetLightStyles();"},{"Add":""},{"Add":" UnparseEntities();"},{"Add":""},{"Add":" WriteBSPFile(out);"},{"Add":" } else {"},{"Add":" extern void ProcessModels();"},{"Add":""},{"Add":" //"},{"Add":" // start from scratch"},{"Add":" //"},{"Add":" LoadMapFile(name);"},{"Add":" SetModelNumbers();"},{"Add":" SetLightStyles();"},{"Add":""},{"Add":" ProcessModels();"},{"Add":" }"},{"Add":""},{"Add":" PrintBSPFileSizes();"},{"Add":" printf(\"<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< END 4bsp >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\\n\\n\");"},{"Add":"}"}]}},{"Edit":{"inode":{"change":3,"pos":1275050},"path":"quake2/ref_gl/gl_particle.c","line":597,"atom":{"NewVertex":{"up_context":[{"change":3,"pos":1302804}],"down_context":[{"change":3,"pos":1302804}],"flag":"BLOCK","start":532407,"end":532417,"inode":{"change":3,"pos":1275050}}},"contents":[{"Add":" if(0) {"}]}},{"Edit":{"inode":{"change":3,"pos":1275050},"path":"quake2/ref_gl/gl_particle.c","line":626,"atom":{"NewVertex":{"up_context":[{"change":3,"pos":1303812}],"down_context":[{"change":3,"pos":1303812}],"flag":"BLOCK","start":532418,"end":532422,"inode":{"change":3,"pos":1275050}}},"contents":[{"Add":" }"}]}},{"Edit":{"inode":{"change":3,"pos":1275050},"path":"quake2/ref_gl/gl_particle.c","line":662,"atom":{"NewVertex":{"up_context":[{"change":3,"pos":1305947}],"down_context":[{"change":3,"pos":1305947}],"flag":"BLOCK","start":532423,"end":532433,"inode":{"change":3,"pos":1275050}}},"contents":[{"Add":" if(0) {"}]}},{"Edit":{"inode":{"change":3,"pos":1275050},"path":"quake2/ref_gl/gl_particle.c","line":711,"atom":{"NewVertex":{"up_context":[{"change":3,"pos":1308399}],"down_context":[{"change":3,"pos":1308399}],"flag":"BLOCK","start":532434,"end":532438,"inode":{"change":3,"pos":1275050}}},"contents":[{"Add":" }"}]}},{"Edit":{"inode":{"change":3,"pos":16094507},"path":"quake2/client/snd_miniaudio_imp.c","line":2,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":16094541},"to":{"change":2,"start":1001284,"end":1001310},"introduced_by":2}],"inode":{"change":3,"pos":16094507}}},"contents":[{"Del":"#define MA_DEBUG_OUTPUT 1\n"}]}},{"Edit":{"inode":{"change":5,"pos":109071895},"path":"configure.sh","line":255,"atom":{"NewVertex":{"up_context":[{"change":3,"pos":16737038}],"down_context":[],"flag":"BLOCK","start":532439,"end":533650,"inode":{"change":5,"pos":109071895}}},"contents":[{"Add":"per_platform executable ___-q2tools \\"},{"Add":" --include-directory quake2/tools/common \\"},{"Add":" --lflag -lm \\"},{"Add":" quake2/tools/main.c \\"},{"Add":" quake2/tools/4bsp/4bsp.c \\"},{"Add":" quake2/tools/4bsp/brushbsp.c \\"},{"Add":" quake2/tools/4bsp/csg.c \\"},{"Add":" quake2/tools/4bsp/faces.c \\"},{"Add":" quake2/tools/4bsp/leakfile.c \\"},{"Add":" quake2/tools/4bsp/map.c \\"},{"Add":" quake2/tools/4bsp/portals.c \\"},{"Add":" quake2/tools/4bsp/prtfile.c \\"},{"Add":" quake2/tools/4bsp/textures.c \\"},{"Add":" quake2/tools/4bsp/tree.c \\"},{"Add":" quake2/tools/4bsp/writebsp.c \\"},{"Add":" quake2/tools/4rad/4rad.c \\"},{"Add":" quake2/tools/4rad/lightmap.c \\"},{"Add":" quake2/tools/4rad/patches.c \\"},{"Add":" quake2/tools/4rad/trace.c \\"},{"Add":" quake2/tools/4vis/4vis.c \\"},{"Add":" quake2/tools/4vis/flow.c \\"},{"Add":" quake2/tools/common/bspfile.c \\"},{"Add":" quake2/tools/common/cmdlib.c \\"},{"Add":" quake2/tools/common/l3dslib.c \\"},{"Add":" quake2/tools/common/lbmlib.c \\"},{"Add":" quake2/tools/common/llwolib.c \\"},{"Add":" quake2/tools/common/mathlib.c \\"},{"Add":" quake2/tools/common/mdfour.c \\"},{"Add":" quake2/tools/common/polylib.c \\"},{"Add":" quake2/tools/common/scriplib.c \\"},{"Add":" quake2/tools/common/threads.c \\"},{"Add":" quake2/tools/common/trilib.c"},{"Add":""},{"Add":" #quake2/tools/4data/4data.c \\"},{"Add":" #quake2/tools/4data/images.c \\"},{"Add":" #quake2/tools/4data/models.c \\"},{"Add":" #quake2/tools/4data/sprites.c \\"},{"Add":" #quake2/tools/4data/tables.c \\"},{"Add":" #quake2/tools/4data/video.c \\"}]}}],"owner":"mystical.unicat","repo":"monorepo","token":"7KWAPPzJ6Scxpn7bPdhkra4VS++dpbZCRJ+wwix8xeY=","login":null}

…

Dependencies

Change contents