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
|
/* Interval_Info class declaration and implementation.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://bugseng.com/products/ppl/ . */
#ifndef PPL_Interval_Info_defs_hh
#define PPL_Interval_Info_defs_hh 1
#include "Boundary_defs.hh"
#include <iostream>
namespace Parma_Polyhedra_Library {
namespace Interval_NS {
struct Property {
enum Type {
CARDINALITY_0_,
CARDINALITY_1_,
CARDINALITY_IS_
};
typedef bool Value;
static const Value default_value = true;
static const Value unsupported_value = false;
Property(Type t)
: type(t) {
}
Type type;
};
const Property CARDINALITY_0(Property::CARDINALITY_0_);
const Property CARDINALITY_1(Property::CARDINALITY_1_);
const Property CARDINALITY_IS(Property::CARDINALITY_IS_);
template <typename T>
inline void
reset_bits(T& bits) {
bits = 0;
}
template <typename T>
inline void
reset_bit(T& bits, unsigned int bit) {
bits &= ~(static_cast<T>(1) << bit);
}
template <typename T>
inline void
set_bit(T& bits, unsigned int bit, bool value) {
if (value) {
bits |= static_cast<T>(1) << bit;
}
else {
reset_bit(bits, bit);
}
}
template <typename T>
inline bool
get_bit(const T& bits, unsigned int bit) {
return (bits & (static_cast<T>(1) << bit)) != 0;
}
template <typename T>
inline void
set_bits(T& bits, unsigned int start, unsigned int len, T value) {
bits &= ~(((static_cast<T>(1) << len) - 1) << start);
bits |= value << start;
}
template <typename T>
inline T
get_bits(T& bits, unsigned int start, unsigned int len) {
return (bits >> start) & ((static_cast<T>(1) << len) - 1);
}
} // namespace Interval_NS
using namespace Interval_NS;
using namespace Boundary_NS;
template <typename Policy>
class Interval_Info_Null {
public:
const_bool_nodef(may_be_empty, Policy::may_be_empty);
const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
const_bool_nodef(check_inexact, Policy::check_inexact);
const_bool_nodef(store_special, false);
const_bool_nodef(store_open, false);
const_bool_nodef(cache_empty, false);
const_bool_nodef(cache_singleton, false);
Interval_Info_Null() {
}
void clear() {
}
void clear_boundary_properties(Boundary_Type) {
}
template <typename Property>
void set_boundary_property(Boundary_Type, const Property&, typename Property::Value = Property::default_value) {
}
template <typename Property>
typename Property::Value get_boundary_property(Boundary_Type, const Property&) const {
return Property::unsupported_value;
}
template <typename Property>
void set_interval_property(const Property&, typename Property::Value = Property::default_value) {
}
template <typename Property>
typename Property::Value get_interval_property(const Property&) const {
return Property::unsupported_value;
}
//! Swaps \p *this with \p y.
void m_swap(Interval_Info_Null& y);
void ascii_dump(std::ostream& s) const;
bool ascii_load(std::istream& s);
};
template <typename Policy>
class Interval_Info_Null_Open : public Interval_Info_Null<Policy> {
public:
const_bool_nodef(store_open, true);
Interval_Info_Null_Open(bool o)
: open(o) {
}
bool get_boundary_property(Boundary_Type,
const Boundary_NS::Property& p) const {
if (p.type == Boundary_NS::Property::OPEN_) {
return open;
}
else {
return Boundary_NS::Property::unsupported_value;
}
}
void ascii_dump(std::ostream& s) const;
bool ascii_load(std::istream& s);
private:
bool open;
};
template <typename T, typename Policy>
class Interval_Info_Bitset {
public:
const_bool_nodef(may_be_empty, Policy::may_be_empty);
const_bool_nodef(may_contain_infinity, Policy::may_contain_infinity);
const_bool_nodef(check_inexact, Policy::check_inexact);
const_bool_nodef(store_special, Policy::store_special);
const_bool_nodef(store_open, Policy::store_open);
const_bool_nodef(cache_empty, Policy::cache_empty);
const_bool_nodef(cache_singleton, Policy::cache_singleton);
const_int_nodef(lower_special_bit, Policy::next_bit);
const_int_nodef(lower_open_bit, lower_special_bit + (store_special ? 1 : 0));
const_int_nodef(upper_special_bit, lower_open_bit + (store_open ? 1 : 0));
const_int_nodef(upper_open_bit, upper_special_bit + (store_special ? 1 : 0));
const_int_nodef(cardinality_is_bit, upper_open_bit + (store_open ? 1 : 0));
const_int_nodef(cardinality_0_bit, cardinality_is_bit
+ ((cache_empty || cache_singleton) ? 1 : 0));
const_int_nodef(cardinality_1_bit, cardinality_0_bit + (cache_empty ? 1 : 0));
const_int_nodef(next_bit, cardinality_1_bit + (cache_singleton ? 1 : 0));
Interval_Info_Bitset() {
// FIXME: would we have speed benefits with uninitialized info?
// (Dirty_Temp)
clear();
}
void clear() {
reset_bits(bitset);
}
void clear_boundary_properties(Boundary_Type t) {
set_boundary_property(t, SPECIAL, false);
set_boundary_property(t, OPEN, false);
}
void set_boundary_property(Boundary_Type t,
const Boundary_NS::Property& p,
bool value = true) {
switch (p.type) {
case Boundary_NS::Property::SPECIAL_:
if (store_special) {
if (t == LOWER) {
set_bit(bitset, lower_special_bit, value);
}
else {
set_bit(bitset, upper_special_bit, value);
}
}
break;
case Boundary_NS::Property::OPEN_:
if (store_open) {
if (t == LOWER) {
set_bit(bitset, lower_open_bit, value);
}
else {
set_bit(bitset, upper_open_bit, value);
}
}
break;
default:
break;
}
}
bool get_boundary_property(Boundary_Type t, const Boundary_NS::Property& p) const {
switch (p.type) {
case Boundary_NS::Property::SPECIAL_:
if (!store_special) {
return false;
}
if (t == LOWER) {
return get_bit(bitset, lower_special_bit);
}
else {
return get_bit(bitset, upper_special_bit);
}
case Boundary_NS::Property::OPEN_:
if (!store_open) {
return false;
}
else if (t == LOWER) {
return get_bit(bitset, lower_open_bit);
}
else {
return get_bit(bitset, upper_open_bit);
}
default:
return false;
}
}
void set_interval_property(const Interval_NS::Property& p, bool value = true) {
switch (p.type) {
case Interval_NS::Property::CARDINALITY_0_:
if (cache_empty) {
set_bit(bitset, cardinality_0_bit, value);
}
break;
case Interval_NS::Property::CARDINALITY_1_:
if (cache_singleton) {
set_bit(bitset, cardinality_1_bit, value);
}
break;
case Interval_NS::Property::CARDINALITY_IS_:
if (cache_empty || cache_singleton) {
set_bit(bitset, cardinality_is_bit, value);
}
break;
default:
break;
}
}
bool get_interval_property(Interval_NS::Property p) const {
switch (p.type) {
case Interval_NS::Property::CARDINALITY_0_:
return cache_empty && get_bit(bitset, cardinality_0_bit);
case Interval_NS::Property::CARDINALITY_1_:
return cache_singleton && get_bit(bitset, cardinality_1_bit);
case Interval_NS::Property::CARDINALITY_IS_:
return (cache_empty || cache_singleton)
&& get_bit(bitset, cardinality_is_bit);
default:
return false;
}
}
//! Swaps \p *this with \p y.
void m_swap(Interval_Info_Bitset& y);
void ascii_dump(std::ostream& s) const;
bool ascii_load(std::istream& s);
protected:
T bitset;
};
}
#include "Interval_Info_inlines.hh"
#endif // !defined(PPL_Interval_Info_defs_hh)
|