98 lines
3.4 KiB
C
98 lines
3.4 KiB
C
/*
|
|
Copyright (C) 1996-2001 Id Software, Inc.
|
|
Copyright (C) 2002-2009 John Fitzgibbons and others
|
|
Copyright (C) 2007-2008 Kristian Duske
|
|
Copyright (C) 2010-2014 QuakeSpasm developers
|
|
|
|
This program 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.
|
|
|
|
This program 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 this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
|
|
|
#ifndef spingle__mathlib_h
|
|
#define spingle__mathlib_h
|
|
|
|
// mathlib.h
|
|
|
|
#include <math.h>
|
|
|
|
#define PI 3.14159265358979323846
|
|
#define PI_DIV_180 (PI / 180.0) //johnfitz
|
|
|
|
struct mplane_s;
|
|
|
|
extern vec3_t vec3_origin;
|
|
|
|
#define Q_rint(x) ((x) > 0 ? (int32_t)((x) + 0.5) : (int32_t)((x) - 0.5))
|
|
|
|
#define DotProduct(x,y) (x[0]*y[0]+x[1]*y[1]+x[2]*y[2])
|
|
#define DoublePrecisionDotProduct(x,y) ((double)x[0]*y[0]+(double)x[1]*y[1]+(double)x[2]*y[2])
|
|
#define VectorSubtract(a,b,c) {c[0]=a[0]-b[0];c[1]=a[1]-b[1];c[2]=a[2]-b[2];}
|
|
#define VectorAdd(a,b,c) {c[0]=a[0]+b[0];c[1]=a[1]+b[1];c[2]=a[2]+b[2];}
|
|
#define VectorCopy(a,b) {b[0]=a[0];b[1]=a[1];b[2]=a[2];}
|
|
|
|
//johnfitz -- courtesy of lordhavoc
|
|
// QuakeSpasm: To avoid strict aliasing violations, use a float/int32_t union instead of type punning.
|
|
#define VectorNormalizeFast(_v)\
|
|
{\
|
|
union { float f; int32_t i; } _y, _number;\
|
|
_number.f = DotProduct(_v, _v);\
|
|
if (_number.f != 0.0)\
|
|
{\
|
|
_y.i = 0x5f3759df - (_number.i >> 1);\
|
|
_y.f = _y.f * (1.5f - (_number.f * 0.5f * _y.f * _y.f));\
|
|
VectorScale(_v, _y.f, _v);\
|
|
}\
|
|
}
|
|
|
|
void TurnVector(vec3_t out, const vec3_t forward, const vec3_t side, float angle); //johnfitz
|
|
void VectorAngles(const vec3_t forward, vec3_t angles); //johnfitz
|
|
|
|
void VectorMA(vec3_t veca, float scale, vec3_t vecb, vec3_t vecc);
|
|
|
|
vec_t _DotProduct(vec3_t v1, vec3_t v2);
|
|
void _VectorSubtract(vec3_t veca, vec3_t vecb, vec3_t out);
|
|
void _VectorAdd(vec3_t veca, vec3_t vecb, vec3_t out);
|
|
void _VectorCopy(vec3_t in, vec3_t out);
|
|
|
|
int32_t VectorCompare(vec3_t v1, vec3_t v2);
|
|
vec_t VectorLength(vec3_t v);
|
|
void CrossProduct(vec3_t v1, vec3_t v2, vec3_t cross);
|
|
float VectorNormalize(vec3_t v); // returns vector length
|
|
void VectorInverse(vec3_t v);
|
|
void VectorScale(vec3_t in, vec_t scale, vec3_t out);
|
|
int32_t Q_log2(int32_t val);
|
|
|
|
void R_ConcatRotations(float in1[3][3], float in2[3][3], float out[3][3]);
|
|
void R_ConcatTransforms(float in1[3][4], float in2[3][4], float out[3][4]);
|
|
|
|
void FloorDivMod(double numer, double denom, int32_t *quotient,
|
|
int32_t *rem);
|
|
int32_t GreatestCommonDivisor(int32_t i1, int32_t i2);
|
|
|
|
void AngleVectors(vec3_t angles, vec3_t forward, vec3_t right, vec3_t up);
|
|
int32_t BoxOnPlaneSide(vec3_t emins, vec3_t emaxs, struct mplane_s *plane);
|
|
float anglemod(float a);
|
|
|
|
|
|
#define BOX_ON_PLANE_SIDE(emins, emaxs, p) \
|
|
(((p)->type < 3) \
|
|
? (((p)->dist <= (emins)[(p)->type]) \
|
|
? 1 \
|
|
: (((p)->dist >= (emaxs)[(p)->type]) ? 2 : 3)) \
|
|
: BoxOnPlaneSide((emins), (emaxs), (p)))
|
|
|
|
#endif
|