1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
/*
* Copyright (C) 1999-2000 Michael H. Schimek
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/* $Id: math.h,v 1.5 2005/01/08 14:54:19 mschimek Exp $ */
#ifndef MATH_H
#define MATH_H
#include <math.h>
#ifndef MIN
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#endif
#ifndef MAX
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#endif
#define swap(a, b) \
do { \
__typeof__ (a) _t = (b); \
(b) = (a); \
(a) = _t; \
} while (0)
static inline int
saturate(int val, int min, int max)
{
#ifdef __i686__
/* 2 x cmp cmov, typ. both evaluated */
if (val < min)
val = min;
if (val > max)
val = max;
#else
/* 1-2 branches */
if (val < min)
val = min;
else if (val > max)
val = max;
#endif
return val;
}
static inline unsigned int
nbabs(register int n)
{
register int t = n;
t >>= 31;
n ^= t;
n -= t;
return n;
}
#ifndef acount
#define acount(array) (sizeof(array)/sizeof(array[0]))
#endif
#endif /* MATH_H */
|
