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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* ***** END GPL LICENSE BLOCK *****
* */
/** \file blender/blenlib/intern/math_bits_inline.c
* \ingroup bli
*/
#ifndef __MATH_BITS_INLINE_C__
#define __MATH_BITS_INLINE_C__
#include "BLI_math_bits.h"
MINLINE int bitscan_forward_i(int a)
{
BLI_assert(a != 0);
# ifdef _MSC_VER
unsigned long ctz;
_BitScanForward(&ctz, a);
return ctz;
#else
return __builtin_ctz((unsigned int)a);
#endif
}
MINLINE unsigned int bitscan_forward_uint(unsigned int a)
{
return (unsigned int)bitscan_forward_i((int)a);
}
MINLINE int bitscan_reverse_i(int a)
{
BLI_assert(a != 0);
# ifdef _MSC_VER
unsigned long clz;
_BitScanReverse(&clz, a);
return clz;
#else
return __builtin_clz((unsigned int)a);
#endif
}
MINLINE unsigned int bitscan_reverse_uint(unsigned int a)
{
return (unsigned int)bitscan_reverse_i((int)a);
}
MINLINE unsigned int highest_order_bit_uint(unsigned int n)
{
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
return n - (n >> 1);
}
MINLINE unsigned short highest_order_bit_s(unsigned short n)
{
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
return (unsigned short)(n - (n >> 1));
}
#ifndef __GNUC__
MINLINE int count_bits_i(unsigned int i)
{
/* variable-precision SWAR algorithm. */
i = i - ((i >> 1) & 0x55555555);
i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
return (((i + (i >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
}
#endif
MINLINE int float_as_int(float f)
{
union { int i; float f; } u;
u.f = f;
return u.i;
}
MINLINE unsigned int float_as_uint(float f)
{
union { unsigned int i; float f; } u;
u.f = f;
return u.i;
}
MINLINE float int_as_float(int i)
{
union { int i; float f; } u;
u.i = i;
return u.f;
}
MINLINE float uint_as_float(unsigned int i)
{
union { unsigned int i; float f; } u;
u.i = i;
return u.f;
}
MINLINE float xor_fl(float x, int y)
{
return int_as_float(float_as_int(x) ^ y);
}
#endif /* __MATH_BITS_INLINE_C__ */
|