/usr/include/stxxl/bits/common/utils.h is in libstxxl-dev 1.4.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 | /***************************************************************************
* include/stxxl/bits/common/utils.h
*
* Part of the STXXL. See http://stxxl.sourceforge.net
*
* Copyright (C) 2002-2006 Roman Dementiev <dementiev@mpi-sb.mpg.de>
* Copyright (C) 2007-2009 Andreas Beckmann <beckmann@cs.uni-frankfurt.de>
* Copyright (C) 2008 Johannes Singler <singler@ira.uka.de>
* Copyright (C) 2013 Timo Bingmann <tb@panthema.net>
*
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
**************************************************************************/
#ifndef STXXL_COMMON_UTILS_HEADER
#define STXXL_COMMON_UTILS_HEADER
#include <vector>
#include <string>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <sstream>
#include <limits>
#include <stxxl/bits/config.h>
#include <stxxl/bits/namespace.h>
#include <stxxl/bits/common/types.h>
#include <stxxl/bits/compat/type_traits.h>
#include <stxxl/bits/msvc_compatibility.h>
STXXL_BEGIN_NAMESPACE
////////////////////////////////////////////////////////////////////////////
#if defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 7)))
# define STXXL_ATTRIBUTE_UNUSED __attribute__ ((unused))
#else
# define STXXL_ATTRIBUTE_UNUSED
#endif
////////////////////////////////////////////////////////////////////////////
#if defined(__GXX_EXPERIMENTAL_CXX0X__)
#define STXXL_STATIC_ASSERT(x) static_assert(x, #x)
#else
#define STXXL_STATIC_ASSERT(x) { typedef int static_assert_dummy_type[(x) ? 1 : -1] STXXL_ATTRIBUTE_UNUSED; }
#endif
////////////////////////////////////////////////////////////////////////////
//! Split a string by given separator string. Returns a vector of strings with
//! at least min_fields and at most limit_fields
static inline std::vector<std::string>
split(const std::string& str, const std::string& sep,
unsigned int min_fields = 0,
unsigned int limit_fields = std::numeric_limits<unsigned int>::max())
{
std::vector<std::string> result;
if (str.empty()) {
result.resize(min_fields);
return result;
}
std::string::size_type CurPos(0), LastPos(0);
while (1)
{
if (result.size() + 1 == limit_fields)
break;
CurPos = str.find(sep, LastPos);
if (CurPos == std::string::npos)
break;
result.push_back(
str.substr(LastPos,
std::string::size_type(CurPos - LastPos))
);
LastPos = CurPos + sep.size();
}
std::string sub = str.substr(LastPos);
result.push_back(sub);
if (result.size() < min_fields)
result.resize(min_fields);
return result;
}
////////////////////////////////////////////////////////////////////////////
//! Format any ostream-able type into a string
template <typename Type>
std::string to_str(const Type& t)
{
std::ostringstream oss;
oss << t;
return oss.str();
}
////////////////////////////////////////////////////////////////////////////
//! Parse a string like "343KB" or "44 GiB" into the corresponding size in
//! bytes. Returns the number of bytes and sets ok = true if the string could
//! be parsed correctly. If no units indicator is given, use def_unit in
//! k/m/g/t/p (powers of ten) or in K/M/G/T/P (power of two).
bool parse_SI_IEC_size(const std::string& str, uint64& size, char def_unit = 0);
//! Format a byte size using SI (K, M, G, T) suffixes (powers of ten). Returns
//! "123 M" or similar.
std::string format_SI_size(uint64 number);
//! Format a byte size using IEC (Ki, Mi, Gi, Ti) suffixes (powers of
//! two). Returns "123 Ki" or similar.
std::string format_IEC_size(uint64 number);
////////////////////////////////////////////////////////////////////////////
inline stxxl::int64 atoi64(const char* s)
{
#if STXXL_MSVC
return _atoi64(s);
#else
return atoll(s);
#endif
}
////////////////////////////////////////////////////////////////////////////
inline stxxl::uint64 atouint64(const char* s)
{
#if STXXL_MSVC
return _strtoui64(s, NULL, 10);
#else
return strtoull(s, NULL, 10);
#endif
}
////////////////////////////////////////////////////////////////////////////
template <typename Tp>
inline const Tp&
STXXL_MIN(const Tp& a, const Tp& b)
{
return std::min<Tp>(a, b);
}
template <typename Tp>
inline const Tp&
STXXL_MAX(const Tp& a, const Tp& b)
{
return std::max<Tp>(a, b);
}
////////////////////////////////////////////////////////////////////////////
//! calculate the log2 floor of an integral type using math.h
template <typename Integral>
inline Integral log2_ceil(Integral i)
{
return Integral(ceil(log2(i)));
}
//! calculate the log2 ceiling of an integral type using math.h
template <typename Integral>
inline Integral log2_floor(Integral i)
{
return Integral(log2(i));
}
////////////////////////////////////////////////////////////////////////////
//! calculate the log2 floor of an integer type (by repeated bit shifts)
template <typename IntegerType>
unsigned int ilog2_floor(IntegerType i)
{
unsigned int p = 0;
while (i >= 256) i >>= 8, p += 8;
while (i >>= 1) ++p;
return p;
}
//! calculate the log2 ceiling of an integer type (by repeated bit shifts)
template <typename IntegerType>
unsigned int ilog2_ceil(const IntegerType& i)
{
if (i <= 1) return 0;
return ilog2_floor(i - 1) + 1;
}
////////////////////////////////////////////////////////////////////////////
template <typename Integral, typename Integral2>
inline
typename compat::remove_const<Integral>::type
div_ceil(Integral __n, Integral2 __d)
{
#if 0 // ambiguous overload for std::div(unsigned_anything, unsigned_anything)
typedef __typeof__ (std::div(__n, __d)) div_type;
div_type result = std::div(__n, __d);
return result.quot + (result.rem != 0);
#else
return __n / __d + ((__n % __d) != 0);
#endif
}
////////////////////////////////////////////////////////////////////////////
#ifdef __GNUC__
#define HAVE_BUILTIN_EXPECT
#endif
#ifdef HAVE_BUILTIN_EXPECT
#define LIKELY(c) __builtin_expect((c), 1)
#else
#define LIKELY(c) c
#endif
#ifdef HAVE_BUILTIN_EXPECT
#define UNLIKELY(c) __builtin_expect((c), 0)
#else
#define UNLIKELY(c) c
#endif
////////////////////////////////////////////////////////////////////////////
inline uint64 longhash1(uint64 key_)
{
key_ += ~(key_ << 32);
key_ ^= (key_ >> 22);
key_ += ~(key_ << 13);
key_ ^= (key_ >> 8);
key_ += (key_ << 3);
key_ ^= (key_ >> 15);
key_ += ~(key_ << 27);
key_ ^= (key_ >> 31);
return key_;
}
////////////////////////////////////////////////////////////////////////////
template <class T>
inline void swap_1D_arrays(T* a, T* b, unsigned_type size)
{
for (unsigned_type i = 0; i < size; ++i)
std::swap(a[i], b[i]);
}
////////////////////////////////////////////////////////////////////////////
//! round n up to next larger multiple of 2^power. example: (48,4) = 64, (48,3) = 48.
template <typename Integral>
inline Integral round_up_to_power_of_two(Integral n, unsigned_type power)
{
Integral pot = Integral(1) << power, // = 0..0 1 0^power
mask = pot - 1; // = 0..0 0 1^power
if (n & mask) // n not divisible by pot
return (n & ~mask) + pot;
else
return n;
}
////////////////////////////////////////////////////////////////////////////
template <class Container>
inline typename Container::value_type pop(Container& c)
{
typename Container::value_type r = c.top();
c.pop();
return r;
}
template <class Container>
inline typename Container::value_type pop_front(Container& c)
{
typename Container::value_type r = c.front();
c.pop_front();
return r;
}
template <class Container>
inline typename Container::value_type pop_back(Container& c)
{
typename Container::value_type r = c.back();
c.pop_back();
return r;
}
template <class Container>
inline typename Container::value_type pop_begin(Container& c)
{
typename Container::value_type r = *c.begin();
c.erase(c.begin());
return r;
}
////////////////////////////////////////////////////////////////////////////
STXXL_END_NAMESPACE
#endif // !STXXL_COMMON_UTILS_HEADER
// vim: et:ts=4:sw=4
|