/usr/include/libpwiz/libraries/boost_aux/boost/enum/bitfield.hpp is in libpwiz-dev 3.0.9393-1+b2.
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 | ///////////////////////////////////////////////////////////////////////////////
// bitfield.hpp: defines the bitfield_base type
//
// Copyright 2005 Frank Laub
// 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 BOOST_ENUM_BITFIELD_HPP
#define BOOST_ENUM_BITFIELD_HPP
// MS compatible compilers support #pragma once
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif
#include <sstream>
#include <vector>
#include <boost/foreach.hpp>
#include <boost/operators.hpp>
#include <boost/algorithm/string/split.hpp>
#include <boost/algorithm/string/classification.hpp>
namespace boost {
namespace detail {
// Befriending Templates requires the need for all this mess.
// So that we can allow the templated ostream insertion operator to access private members.
template <typename T>
class bitfield_base;
template <typename T>
std::ostream& operator << (std::ostream& os, const bitfield_base<T>& value);
class bitfield_access
{
# if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) \
|| BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
// Tasteless as this may seem, making all members public allows member templates
// to work in the absence of member template friends.
public:
# else
template <typename T>
friend class bitfield_base;
template <typename T>
friend std::ostream& operator << (std::ostream& os, const bitfield_base<T>& value);
#endif
template <typename T>
static const char* names(BOOST_DEDUCED_TYPENAME T::domain index)
{
return T::names(index);
}
template <typename T>
static BOOST_DEDUCED_TYPENAME T::optional_value values(
BOOST_DEDUCED_TYPENAME T::domain index)
{
return T::values(index);
}
template <typename T>
static T get_by_value(BOOST_DEDUCED_TYPENAME T::value_type value)
{
T ret(value, 0);
return ret;
}
private:
// objects of this class are useless
bitfield_access(); //undefined
};
template <typename T>
class bitfield_base
: private boost::bitwise<T>
, private boost::totally_ordered<T>
{
public:
typedef bitfield_base<T> this_type;
typedef size_t index_type;
typedef size_t value_type;
typedef enum_iterator<T> const_iterator;
typedef boost::optional<T> optional;
protected:
bitfield_base(value_type value, int) : m_value(value) {}
public:
bitfield_base() : m_value(0) {}
bitfield_base(index_type index)
{
optional_value value = bitfield_access::values<T>(enum_cast<T>(index));
if(value)
m_value = *value;
}
static const_iterator begin()
{
return const_iterator(0);
}
static const_iterator end()
{
return const_iterator(T::size);
}
static optional get_by_value(value_type value)
{
// make sure that 'value' is valid
optional_value not_mask = bitfield_access::values<T>(T::not_mask);
BOOST_ASSERT(not_mask);
if(value & *not_mask)
return optional();
return bitfield_access::get_by_value<T>(value);
}
static optional get_by_index(index_type index)
{
if(index >= T::size) return optional();
return optional(enum_cast<T>(index));
}
std::string str() const
{
std::stringstream ss;
ss << *this;
return ss.str();
}
value_type value() const
{
return m_value;
}
bool operator == (const this_type& rhs) const
{
return m_value == rhs.m_value;
}
bool operator < (const this_type& rhs) const
{
return m_value < rhs.m_value;
}
T& operator |= (const this_type& rhs)
{
m_value |= rhs.m_value;
return static_cast<T&>(*this);
}
T& operator &= (const this_type& rhs)
{
m_value &= rhs.m_value;
return static_cast<T&>(*this);
}
T& operator ^= (const this_type& rhs)
{
m_value ^= rhs.m_value;
return static_cast<T&>(*this);
}
bool operator[] (index_type pos) const
{
optional element = get_by_index(pos);
if(!element) return false;
return operator[](*element);
}
bool operator[] (const this_type& rhs) const
{
return (m_value & rhs.m_value) != 0;
}
bool set(index_type pos, bool bit = true)
{
if(!bit) return reset(pos);
optional element = get_by_index(pos);
if(!element) return false;
return set(*element, bit);
}
bool set(const this_type& rhs, bool bit = true)
{
if(!bit) return reset(rhs);
value_type new_value = m_value | rhs.m_value;
if(!get_by_value(new_value))
return false;
m_value = new_value;
return true;
}
bool reset(index_type pos)
{
optional element = get_by_index(pos);
if(!element) return false;
return reset(*element);
}
bool reset(const this_type& rhs)
{
value_type new_value = m_value & ~(rhs.m_value);
if(!get_by_value(new_value)) return false;
m_value = new_value;
return true;
}
// TODO: implement me
size_t count() const
{
return 0;
}
// TODO: implement me
bool any() const
{
return false;
}
// TODO: implement me
bool none() const
{
return false;
}
private:
typedef boost::optional<value_type> optional_value;
friend class bitfield_access;
value_type m_value;
};
template <typename T>
std::ostream& operator << (std::ostream& os, const bitfield_base<T>& rhs)
{
typedef BOOST_DEDUCED_TYPENAME T::value_type value_type;
typedef BOOST_DEDUCED_TYPENAME T::index_type index_type;
typedef boost::optional<value_type> optional_value;
value_type remain = rhs.value();
optional_value all_mask = bitfield_access::values<T>(T::all_mask);
if(remain == *all_mask)
{
os << "all_mask";
return os;
}
optional_value not_mask = bitfield_access::values<T>(T::not_mask);
if(remain == *not_mask)
{
os << "not_mask";
return os;
}
// FIXME: there might be a reason the user wants to define the value 0
// or perhaps 0 is never legitimate for their usage
bool isZero = (remain == 0);
bool isFirst = true;
for(index_type i = 0; i < T::size; ++i)
{
optional_value mask = bitfield_access::values<T>(enum_cast<T>(i));
if(*mask == 0 && isZero)
{
const char* name = bitfield_access::names<T>(enum_cast<T>(i));
BOOST_ASSERT(name);
os << name;
return os;
}
else if(remain & *mask)
{
if(isFirst)
isFirst = false;
else
os << '|';
const char* name = bitfield_access::names<T>(enum_cast<T>(i));
BOOST_ASSERT(name);
os << name;
remain &= ~(*mask);
if(remain == 0)
return os;
}
}
if(remain)
{
if(!isFirst)
os << '|';
os.fill('0');
os.width(8);
os << std::hex << remain;
}
else if(isZero)
{
os << "<null>";
}
return os;
}
template <typename T>
std::istream& operator >> (std::istream& is, bitfield_base<T>& rhs)
{
std::string str;
is >> str;
std::vector<std::string> tokens;
boost::algorithm::split(tokens, str, boost::is_any_of("|,"));
BOOST_FOREACH(const std::string& token, tokens)
{
BOOST_DEDUCED_TYPENAME T::optional ret = T::get_by_name(token.c_str());
if(ret)
rhs.set(*ret);
else
{
is.setstate(std::ios::badbit);
break;
}
}
return is;
}
} // detail
} // boost
#endif
|