-/*\r
-Copyright (C) 1999-2007 id Software, Inc. and contributors.\r
-For a list of contributors, see the accompanying CONTRIBUTORS file.\r
-\r
-This file is part of GtkRadiant.\r
-\r
-GtkRadiant is free software; you can redistribute it and/or modify\r
-it under the terms of the GNU General Public License as published by\r
-the Free Software Foundation; either version 2 of the License, or\r
-(at your option) any later version.\r
-\r
-GtkRadiant is distributed in the hope that it will be useful,\r
-but WITHOUT ANY WARRANTY; without even the implied warranty of\r
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
-GNU General Public License for more details.\r
-\r
-You should have received a copy of the GNU General Public License\r
-along with GtkRadiant; if not, write to the Free Software\r
-Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
-*/\r
-\r
-// mathlib.c -- math primitives\r
-\r
-#include "cmdlib.h"\r
-#include "mathlib.h"\r
-\r
-vec3_t vec3_origin = {0,0,0};\r
-\r
-\r
-double VectorLength(vec3_t v)\r
-{\r
- int i;\r
- double length;\r
- \r
- length = 0;\r
- for (i=0 ; i< 3 ; i++)\r
- length += v[i]*v[i];\r
- length = sqrt (length); // FIXME\r
-\r
- return length;\r
-}\r
-\r
-qboolean VectorCompare (vec3_t v1, vec3_t v2)\r
-{\r
- int i;\r
- \r
- for (i=0 ; i<3 ; i++)\r
- if (fabs(v1[i]-v2[i]) > EQUAL_EPSILON)\r
- return false;\r
- \r
- return true;\r
-}\r
-\r
-vec_t Q_rint (vec_t in)\r
-{\r
- return floor (in + 0.5);\r
-}\r
-\r
-void VectorMA (vec3_t va, double scale, vec3_t vb, vec3_t vc)\r
-{\r
- vc[0] = va[0] + scale*vb[0];\r
- vc[1] = va[1] + scale*vb[1];\r
- vc[2] = va[2] + scale*vb[2];\r
-}\r
-\r
-void CrossProduct (vec3_t v1, vec3_t v2, vec3_t cross)\r
-{\r
- cross[0] = v1[1]*v2[2] - v1[2]*v2[1];\r
- cross[1] = v1[2]*v2[0] - v1[0]*v2[2];\r
- cross[2] = v1[0]*v2[1] - v1[1]*v2[0];\r
-}\r
-\r
-vec_t _DotProduct (vec3_t v1, vec3_t v2)\r
-{\r
- return v1[0]*v2[0] + v1[1]*v2[1] + v1[2]*v2[2];\r
-}\r
-\r
-void _VectorSubtract (vec3_t va, vec3_t vb, vec3_t out)\r
-{\r
- out[0] = va[0]-vb[0];\r
- out[1] = va[1]-vb[1];\r
- out[2] = va[2]-vb[2];\r
-}\r
-\r
-void _VectorAdd (vec3_t va, vec3_t vb, vec3_t out)\r
-{\r
- out[0] = va[0]+vb[0];\r
- out[1] = va[1]+vb[1];\r
- out[2] = va[2]+vb[2];\r
-}\r
-\r
-void _VectorCopy (vec3_t in, vec3_t out)\r
-{\r
- out[0] = in[0];\r
- out[1] = in[1];\r
- out[2] = in[2];\r
-}\r
-\r
-void _VectorScale (vec3_t v, vec_t scale, vec3_t out)\r
-{\r
- out[0] = v[0] * scale;\r
- out[1] = v[1] * scale;\r
- out[2] = v[2] * scale;\r
-}\r
-\r
-#pragma optimize("g", off) // went back to turning optimization off,\r
- // the bug_fix thing stopped working\r
-\r
-vec_t VectorNormalize (vec3_t in, vec3_t out)\r
-{\r
- vec_t length, ilength;\r
-\r
- length = sqrt (in[0]*in[0] + in[1]*in[1] + in[2]*in[2]);\r
- if (length == 0)\r
- {\r
- VectorClear (out);\r
- return 0;\r
- }\r
-\r
- ilength = 1.0/length;\r
- out[0] = in[0]*ilength;\r
- out[1] = in[1]*ilength;\r
- out[2] = in[2]*ilength;\r
-\r
- return length;\r
-}\r
-\r
-vec_t ColorNormalize (vec3_t in, vec3_t out)\r
-{\r
- float max, scale;\r
-\r
- max = in[0];\r
- if (in[1] > max)\r
- max = in[1];\r
- if (in[2] > max)\r
- max = in[2];\r
-\r
- if (max == 0)\r
- return 0;\r
-\r
- scale = 1.0 / max;\r
-\r
- VectorScale (in, scale, out);\r
-\r
- return max;\r
-}\r
-\r
-#pragma optimize("", on)\r
-\r
-void VectorInverse (vec3_t v)\r
-{\r
- v[0] = -v[0];\r
- v[1] = -v[1];\r
- v[2] = -v[2];\r
-}\r
-\r
-void ClearBounds (vec3_t mins, vec3_t maxs)\r
-{\r
- mins[0] = mins[1] = mins[2] = 99999;\r
- maxs[0] = maxs[1] = maxs[2] = -99999;\r
-}\r
-\r
-void AddPointToBounds (vec3_t v, vec3_t mins, vec3_t maxs)\r
-{\r
- int i;\r
- vec_t val;\r
-\r
- for (i=0 ; i<3 ; i++)\r
- {\r
- val = v[i];\r
- if (val < mins[i])\r
- mins[i] = val;\r
- if (val > maxs[i])\r
- maxs[i] = val;\r
- }\r
-}\r
+/*
+Copyright (C) 1999-2007 id Software, Inc. and contributors.
+For a list of contributors, see the accompanying CONTRIBUTORS file.
+
+This file is part of GtkRadiant.
+
+GtkRadiant is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
+
+GtkRadiant is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with GtkRadiant; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+*/
+
+// mathlib.c -- math primitives
+
+#include "cmdlib.h"
+#include "mathlib.h"
+
+vec3_t vec3_origin = {0,0,0};
+
+
+double VectorLength(vec3_t v)
+{
+ int i;
+ double length;
+
+ length = 0;
+ for (i=0 ; i< 3 ; i++)
+ length += v[i]*v[i];
+ length = sqrt (length); // FIXME
+
+ return length;
+}
+
+qboolean VectorCompare (vec3_t v1, vec3_t v2)
+{
+ int i;
+
+ for (i=0 ; i<3 ; i++)
+ if (fabs(v1[i]-v2[i]) > EQUAL_EPSILON)
+ return false;
+
+ return true;
+}
+
+vec_t Q_rint (vec_t in)
+{
+ return floor (in + 0.5);
+}
+
+void VectorMA (vec3_t va, double scale, vec3_t vb, vec3_t vc)
+{
+ vc[0] = va[0] + scale*vb[0];
+ vc[1] = va[1] + scale*vb[1];
+ vc[2] = va[2] + scale*vb[2];
+}
+
+void CrossProduct (vec3_t v1, vec3_t v2, vec3_t cross)
+{
+ cross[0] = v1[1]*v2[2] - v1[2]*v2[1];
+ cross[1] = v1[2]*v2[0] - v1[0]*v2[2];
+ cross[2] = v1[0]*v2[1] - v1[1]*v2[0];
+}
+
+vec_t _DotProduct (vec3_t v1, vec3_t v2)
+{
+ return v1[0]*v2[0] + v1[1]*v2[1] + v1[2]*v2[2];
+}
+
+void _VectorSubtract (vec3_t va, vec3_t vb, vec3_t out)
+{
+ out[0] = va[0]-vb[0];
+ out[1] = va[1]-vb[1];
+ out[2] = va[2]-vb[2];
+}
+
+void _VectorAdd (vec3_t va, vec3_t vb, vec3_t out)
+{
+ out[0] = va[0]+vb[0];
+ out[1] = va[1]+vb[1];
+ out[2] = va[2]+vb[2];
+}
+
+void _VectorCopy (vec3_t in, vec3_t out)
+{
+ out[0] = in[0];
+ out[1] = in[1];
+ out[2] = in[2];
+}
+
+void _VectorScale (vec3_t v, vec_t scale, vec3_t out)
+{
+ out[0] = v[0] * scale;
+ out[1] = v[1] * scale;
+ out[2] = v[2] * scale;
+}
+
+#pragma optimize("g", off) // went back to turning optimization off,
+ // the bug_fix thing stopped working
+
+vec_t VectorNormalize (vec3_t in, vec3_t out)
+{
+ vec_t length, ilength;
+
+ length = sqrt (in[0]*in[0] + in[1]*in[1] + in[2]*in[2]);
+ if (length == 0)
+ {
+ VectorClear (out);
+ return 0;
+ }
+
+ ilength = 1.0/length;
+ out[0] = in[0]*ilength;
+ out[1] = in[1]*ilength;
+ out[2] = in[2]*ilength;
+
+ return length;
+}
+
+vec_t ColorNormalize (vec3_t in, vec3_t out)
+{
+ float max, scale;
+
+ max = in[0];
+ if (in[1] > max)
+ max = in[1];
+ if (in[2] > max)
+ max = in[2];
+
+ if (max == 0)
+ return 0;
+
+ scale = 1.0 / max;
+
+ VectorScale (in, scale, out);
+
+ return max;
+}
+
+#pragma optimize("", on)
+
+void VectorInverse (vec3_t v)
+{
+ v[0] = -v[0];
+ v[1] = -v[1];
+ v[2] = -v[2];
+}
+
+void ClearBounds (vec3_t mins, vec3_t maxs)
+{
+ mins[0] = mins[1] = mins[2] = 99999;
+ maxs[0] = maxs[1] = maxs[2] = -99999;
+}
+
+void AddPointToBounds (vec3_t v, vec3_t mins, vec3_t maxs)
+{
+ int i;
+ vec_t val;
+
+ for (i=0 ; i<3 ; i++)
+ {
+ val = v[i];
+ if (val < mins[i])
+ mins[i] = val;
+ if (val > maxs[i])
+ maxs[i] = val;
+ }
+}