| 1 |
/*! \file BitManipulations.hpp |
| 2 |
\brief to call grpah decomposer : METIS |
| 3 |
\author Xavier Juvigny, ONERA |
| 4 |
\date Jul. 2nd 2012 |
| 5 |
\date Nov. 30th 2016 |
| 6 |
*/ |
| 7 |
|
| 8 |
// This file is part of Dissection |
| 9 |
// |
| 10 |
// Dissection is free software: you can redistribute it and/or modify |
| 11 |
// it under the terms of the GNU General Public License as published by |
| 12 |
// the Free Software Foundation, either version 3 of the License, or |
| 13 |
// (at your option) any later version. |
| 14 |
// |
| 15 |
// Linking Dissection statically or dynamically with other modules is making |
| 16 |
// a combined work based on Disssection. Thus, the terms and conditions of |
| 17 |
// the GNU General Public License cover the whole combination. |
| 18 |
// |
| 19 |
// As a special exception, the copyright holders of Dissection give you |
| 20 |
// permission to combine Dissection program with free software programs or |
| 21 |
// libraries that are released under the GNU LGPL and with independent modules |
| 22 |
// that communicate with Dissection solely through the Dissection-fortran |
| 23 |
// interface. You may copy and distribute such a system following the terms of |
| 24 |
// the GNU GPL for Dissection and the licenses of the other code concerned, |
| 25 |
// provided that you include the source code of that other code when and as |
| 26 |
// the GNU GPL requires distribution of source code and provided that you do |
| 27 |
// not modify the Dissection-fortran interface. |
| 28 |
// |
| 29 |
// Note that people who make modified versions of Dissection are not obligated |
| 30 |
// to grant this special exception for their modified versions; it is their |
| 31 |
// choice whether to do so. The GNU General Public License gives permission to |
| 32 |
// release a modified version without this exception; this exception also makes |
| 33 |
// it possible to release a modified version which carries forward this |
| 34 |
// exception. If you modify the Dissection-fortran interface, this exception |
| 35 |
// does not apply to your modified version of Dissection, and you must remove |
| 36 |
// this exception when you distribute your modified version. |
| 37 |
// |
| 38 |
// This exception is an additional permission under section 7 of the GNU |
| 39 |
// General Public License, version 3 ("GPLv3") |
| 40 |
// |
| 41 |
// Dissection is distributed in the hope that it will be useful, |
| 42 |
// but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 43 |
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 44 |
// GNU General Public License for more details. |
| 45 |
// |
| 46 |
// You should have received a copy of the GNU General Public License |
| 47 |
// along with Dissection. If not, see <http://www.gnu.org/licenses/>. |
| 48 |
// |
| 49 |
|
| 50 |
// ============================================================== |
| 51 |
// == Some function to manipulate easily bits on integers == |
| 52 |
// ============================================================== |
| 53 |
|
| 54 |
#ifndef _DISSECTION_BITTOOLS_BITMANIPULATIONS_HPP_ |
| 55 |
# define _DISSECTION_BITTOOLS_BITMANIPULATIONS_HPP_ |
| 56 |
|
| 57 |
/** @brief Return the highest power of 2 which |
| 58 |
is lesser or equal to x |
| 59 |
*/ |
| 60 |
inline unsigned highestbit(unsigned x) |
| 61 |
{ |
| 62 |
if (0==x) return 0; |
| 63 |
# if defined(USE_X86_ASM) |
| 64 |
__asm__("bsr{l}\t%0, %0\n\t" : "=r" (x) : "0" (x)); |
| 65 |
//x = asm("bsrl %0 %0" : "=r" (x) : "0" (x)); |
| 66 |
return 1U<<(x-1); |
| 67 |
# else |
| 68 |
x |= x>>1; |
| 69 |
x |= x>>2; |
| 70 |
x |= x>>4; |
| 71 |
x |= x>>8; |
| 72 |
x |= x>>16; |
| 73 |
return x ^ (x>>1); |
| 74 |
# endif |
| 75 |
} |
| 76 |
// -------------------------------------------------------------- |
| 77 |
// @brief Return the position of the highest bit of x |
| 78 |
inline unsigned highest_one_idx(unsigned x) |
| 79 |
{ |
| 80 |
# if defined(USE_X86_ASM) |
| 81 |
__asm__("bsr{l}\t%0, %0\n\t" : "=r" (x) : "0" (x)); |
| 82 |
return x; |
| 83 |
# else |
| 84 |
unsigned r = 0; |
| 85 |
if (x & 0xffff0000U) { x >>= 16; r += 16; } |
| 86 |
if (x & 0x0000ff00U) { x >>= 8 ; r += 8; } |
| 87 |
if (x & 0x000000f0U) { x >>= 4 ; r += 4; } |
| 88 |
if (x & 0x0000000cU) { x >>= 2 ; r += 2; } |
| 89 |
if (x & 0x00000002U) { x >>= 1 ; r += 1; } |
| 90 |
return r; |
| 91 |
# endif |
| 92 |
} |
| 93 |
|
| 94 |
#endif |