1
/* $Id: high_precision.h 3553 2011-05-05 06:14:19Z nanang $ */
3
* Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
4
* Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
6
* This program is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License
17
* along with this program; if not, write to the Free Software
18
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
#ifndef __PJ_COMPAT_HIGH_PRECISION_H__
21
#define __PJ_COMPAT_HIGH_PRECISION_H__
24
#if defined(PJ_HAS_FLOATING_POINT) && PJ_HAS_FLOATING_POINT != 0
26
* The first choice for high precision math is to use double.
29
typedef double pj_highprec_t;
31
# define PJ_HIGHPREC_VALUE_IS_ZERO(a) (a==0)
32
# define pj_highprec_mod(a,b) (a=fmod(a,b))
34
#elif defined(PJ_LINUX_KERNEL) && PJ_LINUX_KERNEL != 0
36
# include <asm/div64.h>
38
typedef pj_int64_t pj_highprec_t;
40
# define pj_highprec_div(a1,a2) do_div(a1,a2)
41
# define pj_highprec_mod(a1,a2) (a1=do_mod(a1, a2))
43
PJ_INLINE(pj_int64_t) do_mod( pj_int64_t a1, pj_int64_t a2)
49
#elif defined(PJ_HAS_INT64) && PJ_HAS_INT64 != 0
51
* Next choice is to use 64-bit arithmatics.
53
typedef pj_int64_t pj_highprec_t;
56
# warning "High precision math is not available"
59
* Last, fallback to 32-bit arithmetics.
61
typedef pj_int32_t pj_highprec_t;
66
* @def pj_highprec_mul
67
* pj_highprec_mul(a1, a2) - High Precision Multiplication
68
* Multiply a1 and a2, and store the result in a1.
70
#ifndef pj_highprec_mul
71
# define pj_highprec_mul(a1,a2) (a1 = a1 * a2)
75
* @def pj_highprec_div
76
* pj_highprec_div(a1, a2) - High Precision Division
77
* Divide a2 from a1, and store the result in a1.
79
#ifndef pj_highprec_div
80
# define pj_highprec_div(a1,a2) (a1 = a1 / a2)
84
* @def pj_highprec_mod
85
* pj_highprec_mod(a1, a2) - High Precision Modulus
86
* Get the modulus a2 from a1, and store the result in a1.
88
#ifndef pj_highprec_mod
89
# define pj_highprec_mod(a1,a2) (a1 = a1 % a2)
94
* @def PJ_HIGHPREC_VALUE_IS_ZERO(a)
95
* Test if the specified high precision value is zero.
97
#ifndef PJ_HIGHPREC_VALUE_IS_ZERO
98
# define PJ_HIGHPREC_VALUE_IS_ZERO(a) (a==0)
102
#endif /* __PJ_COMPAT_HIGH_PRECISION_H__ */