/usr/include/bm/bmsse4.h is in bmagic 3.7.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 | #ifndef BMSSE4__H__INCLUDED__
#define BMSSE4__H__INCLUDED__
/*
Copyright(c) 2009 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
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.
For more information please visit: http://bmagic.sourceforge.net
*/
// Header implements processor specific intrinsics declarations for SSE2
// instruction set
#include<mmintrin.h>
#include<emmintrin.h>
#include<smmintrin.h>
#include "bmdef.h"
#include "bmsse_util.h"
namespace bm
{
/** @defgroup SSE4 Processor specific optimizations for SSE4.2 instructions
* @ingroup bmagic
*/
/*!
SSE4.2 optimized bitcounting .
@ingroup SSE4
*/
inline
bm::id_t sse4_bit_count(const __m128i* block, const __m128i* block_end)
{
bm::id_t count = 0;
#ifdef BM64_SSE4
do
{
__m128i tmp0 = _mm_load_si128(block);
count += _mm_popcnt_u64(_mm_extract_epi64(tmp0, 0)) +
_mm_popcnt_u64(_mm_extract_epi64(tmp0, 1));
__m128i tmp1 = _mm_load_si128(block+1);
count += _mm_popcnt_u64(_mm_extract_epi64(tmp1, 0)) +
_mm_popcnt_u64(_mm_extract_epi64(tmp1, 1));
block +=2;
} while (block < block_end);
#else
do
{
const unsigned* b = (unsigned*) block;
count += _mm_popcnt_u32(b[0]) +
_mm_popcnt_u32(b[1]) +
_mm_popcnt_u32(b[2]) +
_mm_popcnt_u32(b[3]);
} while (++block < block_end);
#endif
return count;
}
/*!
\internal
*/
BMFORCEINLINE
unsigned op_xor(unsigned a, unsigned b)
{
unsigned ret = (a ^ b);
return ret;
}
/*!
\internal
*/
BMFORCEINLINE
unsigned op_or(unsigned a, unsigned b)
{
return (a | b);
}
/*!
\internal
*/
BMFORCEINLINE
unsigned op_and(unsigned a, unsigned b)
{
return (a & b);
}
template<class Func>
bm::id_t sse4_bit_count_op(const __m128i* BMRESTRICT block,
const __m128i* BMRESTRICT block_end,
const __m128i* BMRESTRICT mask_block,
Func sse2_func)
{
bm::id_t count = 0;
#ifdef BM64_SSE4
do
{
__m128i tmp0 = _mm_load_si128(block);
__m128i tmp1 = _mm_load_si128(mask_block);
__m128i b = sse2_func(tmp0, tmp1);
count += _mm_popcnt_u64(_mm_extract_epi64(b, 0));
count += _mm_popcnt_u64(_mm_extract_epi64(b, 1));
++block; ++mask_block;
} while (block < block_end);
#else
do
{
__m128i tmp0 = _mm_load_si128(block);
__m128i tmp1 = _mm_load_si128(mask_block);
__m128i b = sse2_func(tmp0, tmp1);
count += _mm_popcnt_u32(_mm_extract_epi32(b, 0));
count += _mm_popcnt_u32(_mm_extract_epi32(b, 1));
count += _mm_popcnt_u32(_mm_extract_epi32(b, 2));
count += _mm_popcnt_u32(_mm_extract_epi32(b, 3));
++block; ++mask_block;
} while (block < block_end);
#endif
return count;
}
/*
template<class Func>
bm::id_t sse4_bit_count_op2(const __m128i* BMRESTRICT block,
const __m128i* BMRESTRICT block_end,
const __m128i* BMRESTRICT mask_block,
Func op_func)
{
bm::id_t count = 0;
#ifdef BM64_SSE4
do
{
unsigned *r1 = (unsigned*) block;
unsigned *r2 = (unsigned*) mask_block;
count += _mm_popcnt_u32(op_func(r1[0], r2[0]));
count += _mm_popcnt_u32(op_func(r1[1], r2[1]));
count += _mm_popcnt_u32(op_func(r1[2], r2[2]));
count += _mm_popcnt_u32(op_func(r1[3], r2[3]));
++mask_block;
} while (++block < block_end);
#else
do
{
unsigned *r1 = (unsigned*) block;
unsigned *r2 = (unsigned*) mask_block;
count += _mm_popcnt_u32(op_func(r1[0], r2[0]));
count += _mm_popcnt_u32(op_func(r1[1], r2[1]));
count += _mm_popcnt_u32(op_func(r1[2], r2[2]));
count += _mm_popcnt_u32(op_func(r1[3], r2[3]));
++mask_block;
} while (++block < block_end);
#endif
return count;
}
*/
#define VECT_XOR_ARR_2_MASK(dst, src, src_end, mask)\
sse2_xor_arr_2_mask((__m128i*)(dst), (__m128i*)(src), (__m128i*)(src_end), mask)
#define VECT_ANDNOT_ARR_2_MASK(dst, src, src_end, mask)\
sse2_andnot_arr_2_mask((__m128i*)(dst), (__m128i*)(src), (__m128i*)(src_end), mask)
#define VECT_BITCOUNT(first, last) \
sse4_bit_count((__m128i*) (first), (__m128i*) (last))
#define VECT_BITCOUNT_AND(first, last, mask) \
sse4_bit_count_op((__m128i*) (first), (__m128i*) (last), (__m128i*) (mask), sse2_and)
#define VECT_BITCOUNT_OR(first, last, mask) \
sse4_bit_count_op((__m128i*) (first), (__m128i*) (last), (__m128i*) (mask), sse2_or)
#define VECT_BITCOUNT_XOR(first, last, mask) \
sse4_bit_count_op((__m128i*) (first), (__m128i*) (last), (__m128i*) (mask), sse2_xor)
#define VECT_BITCOUNT_SUB(first, last, mask) \
sse4_bit_count_op((__m128i*) (first), (__m128i*) (last), (__m128i*) (mask), sse2_sub)
#define VECT_INVERT_ARR(first, last) \
sse2_invert_arr(first, last);
#define VECT_AND_ARR(dst, src, src_end) \
sse2_and_arr((__m128i*) dst, (__m128i*) (src), (__m128i*) (src_end))
#define VECT_OR_ARR(dst, src, src_end) \
sse2_or_arr((__m128i*) dst, (__m128i*) (src), (__m128i*) (src_end))
#define VECT_SUB_ARR(dst, src, src_end) \
sse2_sub_arr((__m128i*) dst, (__m128i*) (src), (__m128i*) (src_end))
#define VECT_XOR_ARR(dst, src, src_end) \
sse2_xor_arr((__m128i*) dst, (__m128i*) (src), (__m128i*) (src_end))
#define VECT_COPY_BLOCK(dst, src, src_end) \
sse2_copy_block((__m128i*) dst, (__m128i*) (src), (__m128i*) (src_end))
#define VECT_SET_BLOCK(dst, dst_end, value) \
sse2_set_block((__m128i*) dst, (__m128i*) (dst_end), (value))
/*!
SSE4.2 optimized bitcounting and number of GAPs
@ingroup SSE4
*/
inline
bm::id_t sse4_bit_block_calc_count_change(const __m128i* BMRESTRICT block,
const __m128i* BMRESTRICT block_end,
unsigned* BMRESTRICT bit_count)
{
// __m128i mask1 = _mm_set_epi32(0x1, 0x1, 0x1, 0x1);
register int count = (block_end - block)*4;
register bm::word_t w0, w_prev;
const int w_shift = sizeof(w0) * 8 - 1;
bool first_word = true;
*bit_count = 0;
// first word
{
bm::word_t w;
const bm::word_t* blk = (const bm::word_t*) block;
w = w0 = blk[0];
*bit_count += _mm_popcnt_u32(w);
w ^= (w >> 1);
count += _mm_popcnt_u32(w);
count -= (w_prev = (w0 >> w_shift));
}
do
{
__m128i b = _mm_load_si128(block);
__m128i tmp2 = _mm_xor_si128(b, _mm_srli_epi32(b, 1)); // tmp2=(b >> 1) ^ b;
__m128i tmp3 = _mm_srli_epi32(b, w_shift); // tmp3 = w0 >> w_shift
// __m128i tmp4 = _mm_and_si128(b, mask1); // tmp4 = w0 & 1
// ---------------------------------------------------------------------
{
if (first_word)
{
first_word = false;
}
else
{
w0 = _mm_extract_epi32(b, 0);
if (w0)
{
*bit_count += _mm_popcnt_u32(w0);
count += _mm_popcnt_u32(_mm_extract_epi32(tmp2, 0));
count -= !(w_prev ^ (w0 & 1));
count -= w_prev = _mm_extract_epi32(tmp3, 0);
}
else
{
count -= !w_prev; w_prev ^= w_prev;
}
}
w0 = _mm_extract_epi32(b, 1);
if (w0)
{
*bit_count += _mm_popcnt_u32(w0);
count += _mm_popcnt_u32(_mm_extract_epi32(tmp2, 1));
count -= !(w_prev ^ (w0 & 1));
count -= w_prev = _mm_extract_epi32(tmp3, 1);
}
else
{
count -= !w_prev; w_prev ^= w_prev;
}
w0 = _mm_extract_epi32(b, 2);
if (w0)
{
*bit_count += _mm_popcnt_u32(w0);
count += _mm_popcnt_u32(_mm_extract_epi32(tmp2, 2));
count -= !(w_prev ^ (w0 & 1));
count -= w_prev = _mm_extract_epi32(tmp3, 2);
}
else
{
count -= !w_prev; w_prev ^= w_prev;
}
w0 = _mm_extract_epi32(b, 3);
if (w0)
{
*bit_count += _mm_popcnt_u32(w0);
count += _mm_popcnt_u32(_mm_extract_epi32(tmp2, 3));
count -= !(w_prev ^ (w0 & 1));
count -= w_prev = _mm_extract_epi32(tmp3, 3);
}
else
{
count -= !w_prev; w_prev ^= w_prev;
}
}
} while (++block < block_end);
return count;
}
} // namespace
#endif
|