2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
23 typedef vec_t vec3_t[3];
24 typedef vec_t vec5_t[5];
28 typedef int fixed16_t;
31 #define M_PI 3.14159265358979323846 // matches value in gcc v2 math.h
36 extern vec3_t vec3_origin;
39 #define IS_NAN(x) (((*(int *)&x)&nanmask)==nanmask)
41 #define bound(min,num,max) (num >= min ? (num < max ? num : max) : min)
43 #define VectorNegate(a,b) {b[0] = -(a[0]);b[1] = -(a[1]);b[2] = -(a[2]);}
44 #define VectorSet(a,b,c,d) {d[0]=(a);d[1]=(b);d[2]=(c);}
45 #define VectorClear(a) {a[0]=a[1]=a[2]=0;}
46 #define DotProduct(x,y) (x[0]*y[0]+x[1]*y[1]+x[2]*y[2])
47 #define VectorSubtract(a,b,c) {c[0]=a[0]-b[0];c[1]=a[1]-b[1];c[2]=a[2]-b[2];}
48 #define VectorAdd(a,b,c) {c[0]=a[0]+b[0];c[1]=a[1]+b[1];c[2]=a[2]+b[2];}
49 #define VectorCopy(a,b) {b[0]=a[0];b[1]=a[1];b[2]=a[2];}
50 #define CrossProduct(v1,v2,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];}
51 #define VectorNormalize(v) {float ilength = 1.0f / (float) sqrt(DotProduct(v,v));v[0] *= ilength;v[1] *= ilength;v[2] *= ilength;}
52 #define VectorNormalize2(v,dest) {float ilength = 1.0f / (float) sqrt(DotProduct(v,v));dest[0] = v[0] * ilength;dest[1] = v[1] * ilength;dest[2] = v[2] * ilength;}
53 #define VectorDistance2(a, b) ((a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]) + (a[2] - b[2]) * (a[2] - b[2]))
54 #define VectorDistance(a, b) (sqrt(VectorDistance2(a,b)))
55 #define VectorLength(a) sqrt(DotProduct(a, a))
58 void VectorMA (vec3_t veca, float scale, vec3_t vecb, vec3_t vecc);
60 vec_t _DotProduct (vec3_t v1, vec3_t v2);
61 void _VectorSubtract (vec3_t veca, vec3_t vecb, vec3_t out);
62 void _VectorAdd (vec3_t veca, vec3_t vecb, vec3_t out);
63 void _VectorCopy (vec3_t in, vec3_t out);
65 int VectorCompare (vec3_t v1, vec3_t v2);
66 vec_t Length (vec3_t v);
67 float VectorNormalizeLength (vec3_t v); // returns vector length
68 float VectorNormalizeLength2 (vec3_t v, vec3_t dest); // returns vector length
69 void VectorInverse (vec3_t v);
70 void VectorScale (vec3_t in, vec_t scale, vec3_t out);
73 void R_ConcatRotations (float in1[3][3], float in2[3][3], float out[3][3]);
74 void R_ConcatTransforms (float in1[3][4], float in2[3][4], float out[3][4]);
76 void FloorDivMod (double numer, double denom, int *quotient, int *rem);
77 int GreatestCommonDivisor (int i1, int i2);
79 void AngleVectors (vec3_t angles, vec3_t forward, vec3_t right, vec3_t up);
80 float anglemod(float a);
83 void BoxOnPlaneSideClassify(struct mplane_s *p);
85 #define BOX_ON_PLANE_SIDE(emins, emaxs, p) \
88 ((p)->dist <= (emins)[(p)->type])? \
92 ((p)->dist >= (emaxs)[(p)->type])?\
99 (p)->BoxOnPlaneSideFunc( (emins), (emaxs), (p)))
101 #define PlaneDist(point,plane) ((plane)->type < 3 ? (point)[(plane)->type] : DotProduct((point), (plane)->normal))
102 #define PlaneDiff(point,plane) (((plane)->type < 3 ? (point)[(plane)->type] : DotProduct((point), (plane)->normal)) - (plane)->dist)
104 #define lhrandom(MIN,MAX) ((rand() & 32767) * (((MAX)-(MIN)) * (1.0f / 32767.0f)) + (MIN))
107 #define min(A,B) (A < B ? A : B)
108 #define max(A,B) (A > B ? A : B)