tools/include/linux/log2.h

   1 /* Integer base 2 logarithm calculation
   2  *
   3  * Copyright (C) 2006 Red Hat, Inc. All Rights Reserved.
   4  * Written by David Howells (dhowells@redhat.com)
   5  *
   6  * This program is free software; you can redistribute it and/or
   7  * modify it under the terms of the GNU General Public License
   8  * as published by the Free Software Foundation; either version
   9  * 2 of the License, or (at your option) any later version.
  10  */
  11
  12 #ifndef _TOOLS_LINUX_LOG2_H
  13 #define _TOOLS_LINUX_LOG2_H
  14
  15 #include <linux/bitops.h>
  16 #include <linux/types.h>
  17
  18 /*
  19  * non-constant log of base 2 calculators
  20  * - the arch may override these in asm/bitops.h if they can be implemented
  21  *   more efficiently than using fls() and fls64()
  22  * - the arch is not required to handle n==0 if implementing the fallback
  23  */
  24 static inline __attribute__((const))
  25 int __ilog2_u32(u32 n)
  26 {
  27         return fls(n) - 1;
  28 }
  29
  30 static inline __attribute__((const))
  31 int __ilog2_u64(u64 n)
  32 {
  33         return fls64(n) - 1;
  34 }
  35
  36 /*
  37  *  Determine whether some value is a power of two, where zero is
  38  * *not* considered a power of two.
  39  */
  40
  41 static inline __attribute__((const))
  42 bool is_power_of_2(unsigned long n)
  43 {
  44         return (n != 0 && ((n & (n - 1)) == 0));
  45 }
  46
  47 /*
  48  * round up to nearest power of two
  49  */
  50 static inline __attribute__((const))
  51 unsigned long __roundup_pow_of_two(unsigned long n)
  52 {
  53         return 1UL << fls_long(n - 1);
  54 }
  55
  56 /*
  57  * round down to nearest power of two
  58  */
  59 static inline __attribute__((const))
  60 unsigned long __rounddown_pow_of_two(unsigned long n)
  61 {
  62         return 1UL << (fls_long(n) - 1);
  63 }
  64
  65 /**
  66  * ilog2 - log of base 2 of 32-bit or a 64-bit unsigned value
  67  * @n - parameter
  68  *
  69  * constant-capable log of base 2 calculation
  70  * - this can be used to initialise global variables from constant data, hence
  71  *   the massive ternary operator construction
  72  *
  73  * selects the appropriately-sized optimised version depending on sizeof(n)
  74  */
  75 #define ilog2(n)                                \
  76 (                                               \
  77         __builtin_constant_p(n) ? (             \
  78                 (n) < 2 ? 0 :                   \
  79                 (n) & (1ULL << 63) ? 63 :       \
  80                 (n) & (1ULL << 62) ? 62 :       \
  81                 (n) & (1ULL << 61) ? 61 :       \
  82                 (n) & (1ULL << 60) ? 60 :       \
  83                 (n) & (1ULL << 59) ? 59 :       \
  84                 (n) & (1ULL << 58) ? 58 :       \
  85                 (n) & (1ULL << 57) ? 57 :       \
  86                 (n) & (1ULL << 56) ? 56 :       \
  87                 (n) & (1ULL << 55) ? 55 :       \
  88                 (n) & (1ULL << 54) ? 54 :       \
  89                 (n) & (1ULL << 53) ? 53 :       \
  90                 (n) & (1ULL << 52) ? 52 :       \
  91                 (n) & (1ULL << 51) ? 51 :       \
  92                 (n) & (1ULL << 50) ? 50 :       \
  93                 (n) & (1ULL << 49) ? 49 :       \
  94                 (n) & (1ULL << 48) ? 48 :       \
  95                 (n) & (1ULL << 47) ? 47 :       \
  96                 (n) & (1ULL << 46) ? 46 :       \
  97                 (n) & (1ULL << 45) ? 45 :       \
  98                 (n) & (1ULL << 44) ? 44 :       \
  99                 (n) & (1ULL << 43) ? 43 :       \
 100                 (n) & (1ULL << 42) ? 42 :       \
 101                 (n) & (1ULL << 41) ? 41 :       \
 102                 (n) & (1ULL << 40) ? 40 :       \
 103                 (n) & (1ULL << 39) ? 39 :       \
 104                 (n) & (1ULL << 38) ? 38 :       \
 105                 (n) & (1ULL << 37) ? 37 :       \
 106                 (n) & (1ULL << 36) ? 36 :       \
 107                 (n) & (1ULL << 35) ? 35 :       \
 108                 (n) & (1ULL << 34) ? 34 :       \
 109                 (n) & (1ULL << 33) ? 33 :       \
 110                 (n) & (1ULL << 32) ? 32 :       \
 111                 (n) & (1ULL << 31) ? 31 :       \
 112                 (n) & (1ULL << 30) ? 30 :       \
 113                 (n) & (1ULL << 29) ? 29 :       \
 114                 (n) & (1ULL << 28) ? 28 :       \
 115                 (n) & (1ULL << 27) ? 27 :       \
 116                 (n) & (1ULL << 26) ? 26 :       \
 117                 (n) & (1ULL << 25) ? 25 :       \
 118                 (n) & (1ULL << 24) ? 24 :       \
 119                 (n) & (1ULL << 23) ? 23 :       \
 120                 (n) & (1ULL << 22) ? 22 :       \
 121                 (n) & (1ULL << 21) ? 21 :       \
 122                 (n) & (1ULL << 20) ? 20 :       \
 123                 (n) & (1ULL << 19) ? 19 :       \
 124                 (n) & (1ULL << 18) ? 18 :       \
 125                 (n) & (1ULL << 17) ? 17 :       \
 126                 (n) & (1ULL << 16) ? 16 :       \
 127                 (n) & (1ULL << 15) ? 15 :       \
 128                 (n) & (1ULL << 14) ? 14 :       \
 129                 (n) & (1ULL << 13) ? 13 :       \
 130                 (n) & (1ULL << 12) ? 12 :       \
 131                 (n) & (1ULL << 11) ? 11 :       \
 132                 (n) & (1ULL << 10) ? 10 :       \
 133                 (n) & (1ULL <<  9) ?  9 :       \
 134                 (n) & (1ULL <<  8) ?  8 :       \
 135                 (n) & (1ULL <<  7) ?  7 :       \
 136                 (n) & (1ULL <<  6) ?  6 :       \
 137                 (n) & (1ULL <<  5) ?  5 :       \
 138                 (n) & (1ULL <<  4) ?  4 :       \
 139                 (n) & (1ULL <<  3) ?  3 :       \
 140                 (n) & (1ULL <<  2) ?  2 :       \
 141                 1 ) :                           \
 142         (sizeof(n) <= 4) ?                      \
 143         __ilog2_u32(n) :                        \
 144         __ilog2_u64(n)                          \
 145  )
 146
 147 /**
 148  * roundup_pow_of_two - round the given value up to nearest power of two
 149  * @n - parameter
 150  *
 151  * round the given value up to the nearest power of two
 152  * - the result is undefined when n == 0
 153  * - this can be used to initialise global variables from constant data
 154  */
 155 #define roundup_pow_of_two(n)                   \
 156 (                                               \
 157         __builtin_constant_p(n) ? (             \
 158                 (n == 1) ? 1 :                  \
 159                 (1UL << (ilog2((n) - 1) + 1))   \
 160                                    ) :          \
 161         __roundup_pow_of_two(n)                 \
 162  )
 163
 164 /**
 165  * rounddown_pow_of_two - round the given value down to nearest power of two
 166  * @n - parameter
 167  *
 168  * round the given value down to the nearest power of two
 169  * - the result is undefined when n == 0
 170  * - this can be used to initialise global variables from constant data
 171  */
 172 #define rounddown_pow_of_two(n)                 \
 173 (                                               \
 174         __builtin_constant_p(n) ? (             \
 175                 (1UL << ilog2(n))) :            \
 176         __rounddown_pow_of_two(n)               \
 177  )
 178
 179 #endif /* _TOOLS_LINUX_LOG2_H */