/usr/include/ns3.27/ns3/int64x64-double.h is in libns3-dev 3.27+dfsg-1.
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 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2010 INRIA
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "ns3/core-config.h"
#if !defined(INT64X64_DOUBLE_H) && (defined (INT64X64_USE_DOUBLE) || defined(PYTHON_SCAN))
#define INT64X64_DOUBLE_H
#include <stdint.h>
#include <cmath> // pow
#include <utility> // pair
/**
* \file
* \ingroup highprec
* Declaration and implementation of the ns3::int64x64_t type
* using the double type.
*/
namespace ns3 {
/**
* \internal
* The implementation documented here uses native long double.
*/
class int64x64_t
{
/// Mask for fraction part
static const uint64_t HP_MASK_LO = 0xffffffffffffffffULL;
/**
* Floating point value of HP_MASK_LO + 1
* We really want:
* \code
* static const long double HP_MAX_64 = std:pow (2.0L, 64);
* \endcode
* but we can't call functions in const definitions,
* We could make this a static and initialize in int64x64-double.cc or
* int64x64.cc, but this requires handling static initialization order
* when most of the implementation is inline. Instead, we resort to
* this define.
*/
#define HP_MAX_64 (std::pow (2.0L, 64))
public:
/**
* Type tag for the underlying implementation.
*
* A few testcases are are sensitive to implementation,
* specifically the double implementation. To handle this,
* we expose the underlying implementation type here.
*/
enum impl_type {
int128_impl, //!< Native int128_t implementation.
cairo_impl, //!< cairo wideint implementation
ld_impl, //!< long double implementation
};
/// Type tag for this implementation.
static const enum impl_type implementation = ld_impl;
/// Default constructor
inline int64x64_t ()
: _v (0) {}
/**@{*/
/**
* Construct from a floating point value.
*
* \param [in] v Floating value to represent
*/
inline int64x64_t (double v)
: _v (v) {}
inline int64x64_t (long double v)
: _v (v) {}
/**@}*/
/**@{*/
/**
* Construct from an integral type.
*
* \param [in] v Integer value to represent
*/
inline int64x64_t (int v)
: _v (v) {}
inline int64x64_t (long int v)
: _v (v) {}
inline int64x64_t (long long int v)
: _v (v) {}
inline int64x64_t (unsigned int v)
: _v (v) {}
inline int64x64_t (unsigned long int v)
: _v (v) {}
inline int64x64_t (unsigned long long int v)
: _v (v) {}
/**@}*/
/**
* Construct from explicit high and low values.
*
* \param [in] hi Integer portion.
* \param [in] lo Fractional portion, already scaled to HP_MAX_64.
*/
explicit inline int64x64_t (int64_t hi, uint64_t lo)
{
const bool negative = hi < 0;
const long double fhi = negative ? -hi : hi;
const long double flo = lo / HP_MAX_64;
_v = negative ? - fhi : fhi;
_v += flo;
// _v = negative ? -_v : _v;
}
/**
* Copy constructor.
*
* \param [in] o Value to copy.
*/
inline int64x64_t (const int64x64_t & o)
: _v (o._v) {}
/**
* Assignment.
*
* \param [in] o Value to assign to this int64x64_t.
*/
inline int64x64_t & operator = (const int64x64_t & o)
{
_v = o._v;
return *this;
}
/**
* Get this value as a double.
*
* \return This value in floating form.
*/
inline double GetDouble (void) const
{
return (double)_v;
}
private:
/**
* Get the high and low portions of this value.
*
* \return A pair of the high and low words
*/
std::pair<int64_t, uint64_t> GetHighLow (void) const
{
const bool negative = _v < 0;
const long double v = negative ? -_v : _v;
long double fhi;
long double flo = std::modf (v, &fhi);
// Add 0.5 to round, which improves the last count
// This breaks these tests:
// TestSuite devices-mesh-dot11s-regression
// TestSuite devices-mesh-flame-regression
// TestSuite routing-aodv-regression
// TestSuite routing-olsr-regression
// Setting round = 0; breaks:
// TestSuite int64x64
const long double round = 0.5;
flo = flo * HP_MAX_64 + round;
int64_t hi = fhi;
uint64_t lo = flo;
if (flo >= HP_MAX_64)
{
// conversion to uint64 rolled over
++hi;
}
if (negative)
{
lo = ~lo;
hi = ~hi;
if (++lo == 0)
{
++hi;
}
}
return std::make_pair (hi, lo);
}
public:
/**
* Get the integer portion.
*
* \return The integer portion of this value.
*/
inline int64_t GetHigh (void) const
{
return GetHighLow ().first;
}
/**
* Get the fractional portion of this value, unscaled.
*
* \return The fractional portion, unscaled, as an integer.
*/
inline uint64_t GetLow (void) const
{
return GetHighLow ().second;
}
/**
* Multiply this value by a Q0.128 value, presumably representing an inverse,
* completing a division operation.
*
* \param [in] o The inverse operand.
*
* \note There is no difference between Q64.64 and Q0.128 in this implementation,
* so this function is a simple multiply.
*/
inline void MulByInvert (const int64x64_t & o)
{
_v *= o._v;
}
/**
* Compute the inverse of an integer value.
*
* \param [in] v The value to compute the inverse of.
* \return The inverse.
*/
static inline int64x64_t Invert (uint64_t v)
{
int64x64_t tmp ((long double)1 / v);
return tmp;
}
private:
friend bool operator == (const int64x64_t & lhs, const int64x64_t & rhs);
friend bool operator < (const int64x64_t & lhs, const int64x64_t & rhs);
friend bool operator > (const int64x64_t & lhs, const int64x64_t & rhs);
friend int64x64_t & operator += ( int64x64_t & lhs, const int64x64_t & rhs);
friend int64x64_t & operator -= ( int64x64_t & lhs, const int64x64_t & rhs);
friend int64x64_t & operator *= ( int64x64_t & lhs, const int64x64_t & rhs);
friend int64x64_t & operator /= ( int64x64_t & lhs, const int64x64_t & rhs);
friend int64x64_t operator - (const int64x64_t & lhs);
friend int64x64_t operator ! (const int64x64_t & lhs);
long double _v; //!< The Q64.64 value.
}; // class int64x64_t
/**
* \ingroup highprec
* Equality operator.
*/
inline bool operator == (const int64x64_t & lhs, const int64x64_t & rhs)
{
return lhs._v == rhs._v;
}
/**
* \ingroup highprec
* Less than operator
*/
inline bool operator < (const int64x64_t & lhs, const int64x64_t & rhs)
{
return lhs._v < rhs._v;
}
/**
* \ingroup highprec
* Greater operator
*/
inline bool operator > (const int64x64_t & lhs, const int64x64_t & rhs)
{
return lhs._v > rhs._v;
}
/**
* \ingroup highprec
* Compound addition operator
*/
inline int64x64_t & operator += (int64x64_t & lhs, const int64x64_t & rhs)
{
lhs._v += rhs._v;
return lhs;
}
/**
* \ingroup highprec
* Compound subtraction operator
*/
inline int64x64_t & operator -= (int64x64_t & lhs, const int64x64_t & rhs)
{
lhs._v -= rhs._v;
return lhs;
}
/**
* \ingroup highprec
* Compound multiplication operator
*/
inline int64x64_t & operator *= (int64x64_t & lhs, const int64x64_t & rhs)
{
lhs._v *= rhs._v;
return lhs;
}
/**
* \ingroup highprec
* Compound division operator
*/
inline int64x64_t & operator /= (int64x64_t & lhs, const int64x64_t & rhs)
{
lhs._v /= rhs._v;
return lhs;
}
/**
* \ingroup highprec
* Unary plus operator
*/
inline int64x64_t operator + (const int64x64_t & lhs)
{
return lhs;
}
/**
* \ingroup highprec
* Unary negation operator (change sign operator)
*/
inline int64x64_t operator - (const int64x64_t & lhs)
{
return int64x64_t (-lhs._v);
}
/**
* \ingroup highprec
* Logical not operator
*/
inline int64x64_t operator ! (const int64x64_t & lhs)
{
return int64x64_t (!lhs._v);
}
} // namespace ns3
#endif /* INT64X64_DOUBLE_H */
|