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
|
/* OpenCL built-in library: popcount()
Copyright (c) 2011 Erik Schnetter <eschnetter@perimeterinstitute.ca>
Perimeter Institute for Theoretical Physics
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include "templates.h"
#if __has_builtin(__builtin_popcount)
#define __builtin_popcounthh(n) __builtin_popcount((int)(n) & 0xff)
#define __builtin_popcounth(n) __builtin_popcount((int)(n) & 0xffff)
#define __builtin_popcountuhh(n) __builtin_popcounthh(n)
#define __builtin_popcountuh(n) __builtin_popcounth(n)
#define __builtin_popcountu(n) __builtin_popcount(n)
#define __builtin_popcountul(n) __builtin_popcountl(n)
#else /* !__has_builtin(__builtin_popcount) */
/* These explicit implementations are taken from
<http://aggregate.org/MAGIC/>:
@techreport{magicalgorithms,
author={Henry Gordon Dietz},
title={{The Aggregate Magic Algorithms}},
institution={University of Kentucky},
howpublished={Aggregate.Org online technical report},
date={2013-03-25},
URL={http://aggregate.org/MAGIC/}
}
*/
#define __builtin_popcount0uhh(n) \
({ \
uchar __n=(n); \
__n -= (__n >> 1) & 0x55U; \
__n = ((__n >> 2) & 0x33U) + (__n & 0x33U); \
__n = ((__n >> 4) + __n) & 0x0fU; \
__n; \
})
#define __builtin_popcount0uh(n) \
({ \
ushort __n=(n); \
__n -= (__n >> 1) & 0x5555U; \
__n = ((__n >> 2) & 0x3333U) + (__n & 0x3333U); \
__n = ((__n >> 4) + __n) & 0x0f0fU; \
__n += __n >> 8; \
__n & 0x001fU; \
})
#define __builtin_popcount0u(n) \
({ \
uint __n=(n); \
__n -= (__n >> 1) & 0x55555555U; \
__n = ((__n >> 2) & 0x33333333U) + (__n & 0x33333333U); \
__n = ((__n >> 4) + __n) & 0x0f0f0f0fU; \
__n += __n >> 8; \
__n += __n >> 16; \
__n & 0x0000003fU; \
})
#define __builtin_popcount0ul(n) \
({ \
ulong __n=(n); \
__n -= (__n >> 1) & 0x5555555555555555UL; \
__n = ((__n >> 2) & 0x3333333333333333UL) + (__n & 0x3333333333333333UL); \
__n = ((__n >> 4) + __n) & 0x0f0f0f0f0f0f0f0fUL; \
__n += __n >> 8; \
__n += __n >> 16; \
__n += __n >> 32; \
__n & 0x000000000000007fUL; \
})
#define __builtin_popcount0hh(n) __builtin_popcount0uhh(n)
#define __builtin_popcount0h(n) __builtin_popcount0uh(n)
#define __builtin_popcount0(n) __builtin_popcount0u(n)
#define __builtin_popcount0l(n) __builtin_popcount0ul(n)
#endif
DEFINE_BUILTIN_G_G(popcount)
|
