/usr/include/kea/util/buffer.h is in kea-dev 1.1.0-1build2.
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 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 | // Copyright (C) 2009-2015 Internet Systems Consortium, Inc. ("ISC")
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
#ifndef BUFFER_H
#define BUFFER_H 1
#include <stdlib.h>
#include <cstring>
#include <vector>
#include <stdint.h>
#include <exceptions/exceptions.h>
#include <boost/shared_ptr.hpp>
namespace isc {
namespace util {
///
/// \brief A standard DNS module exception that is thrown if an out-of-range
/// buffer operation is being performed.
///
class InvalidBufferPosition : public Exception {
public:
InvalidBufferPosition(const char* file, size_t line, const char* what) :
isc::Exception(file, line, what) {}
};
///\brief The \c InputBuffer class is a buffer abstraction for manipulating
/// read-only data.
///
/// The main purpose of this class is to provide a safe placeholder for
/// examining wire-format data received from a network.
///
/// Applications normally use this class only in a limited situation: as an
/// interface between legacy I/O operation (such as receiving data from a BSD
/// socket) and the rest of the Kea DNS library. One common usage of this
/// class for an application would therefore be something like this:
///
/// \code unsigned char buf[1024];
/// struct sockaddr addr;
/// socklen_t addrlen = sizeof(addr);
/// int cc = recvfrom(s, buf, sizeof(buf), 0, &addr, &addrlen);
/// InputBuffer buffer(buf, cc);
/// // pass the buffer to a DNS message object to parse the message \endcode
///
/// Other Kea DNS classes will then use methods of this class to get access
/// to the data, but the application normally doesn't have to care about the
/// details.
///
/// An \c InputBuffer object internally holds a reference to the given data,
/// rather than make a local copy of the data. Also, it does not have an
/// ownership of the given data. It is application's responsibility to ensure
/// the data remains valid throughout the lifetime of the \c InputBuffer
/// object. Likewise, this object generally assumes the data isn't modified
/// throughout its lifetime; if the application modifies the data while this
/// object retains a reference to it, the result is undefined. The application
/// will also be responsible for releasing the data when it's not needed if it
/// was dynamically acquired.
///
/// This is a deliberate design choice: although it's safer to make a local
/// copy of the given data on construction, it would cause unacceptable
/// performance overhead, especially considering that a DNS message can be
/// as large as a few KB. Alternatively, we could allow the object to allocate
/// memory internally and expose it to the application to store network data
/// in it. This is also a bad design, however, in that we would effectively
/// break the abstraction employed in the class, and do so by publishing
/// "read-only" stuff as a writable memory region. Since there doesn't seem to
/// be a perfect solution, we have adopted what we thought a "least bad" one.
///
/// Methods for reading data from the buffer generally work like an input
/// stream: it begins with the head of the data, and once some length of data
/// is read from the buffer, the next read operation will take place from the
/// head of the unread data. An object of this class internally holds (a
/// notion of) where the next read operation should start. We call it the
/// <em>read position</em> in this document.
class InputBuffer {
public:
///
/// \name Constructors and Destructor
//@{
/// \brief Constructor from variable length of data.
///
/// It is caller's responsibility to ensure that the data is valid as long
/// as the buffer exists.
/// \param data A pointer to the data stored in the buffer.
/// \param len The length of the data in bytes.
InputBuffer(const void* data, size_t len) :
position_(0), data_(static_cast<const uint8_t*>(data)), len_(len) {}
//@}
///
/// \name Getter Methods
//@{
/// \brief Return the length of the data stored in the buffer.
size_t getLength() const { return (len_); }
/// \brief Return the current read position.
size_t getPosition() const { return (position_); }
//@}
///
/// \name Setter Methods
///
//@{
/// \brief Set the read position of the buffer to the given value.
///
/// The new position must be in the valid range of the buffer; otherwise
/// an exception of class \c isc::dns::InvalidBufferPosition will be thrown.
/// \param position The new position (offset from the beginning of the
/// buffer).
void setPosition(size_t position) {
if (position > len_) {
throwError("position is too large");
}
position_ = position;
}
//@}
///
/// \name Methods for reading data from the buffer.
//@{
/// \brief Read an unsigned 8-bit integer from the buffer and return it.
///
/// If the remaining length of the buffer is smaller than 8-bit, an
/// exception of class \c isc::dns::InvalidBufferPosition will be thrown.
uint8_t readUint8() {
if (position_ + sizeof(uint8_t) > len_) {
throwError("read beyond end of buffer");
}
return (data_[position_++]);
}
/// \brief Read an unsigned 16-bit integer in network byte order from the
/// buffer, convert it to host byte order, and return it.
///
/// If the remaining length of the buffer is smaller than 16-bit, an
/// exception of class \c isc::dns::InvalidBufferPosition will be thrown.
uint16_t readUint16() {
uint16_t data;
const uint8_t* cp;
if (position_ + sizeof(data) > len_) {
throwError("read beyond end of buffer");
}
cp = &data_[position_];
data = ((unsigned int)(cp[0])) << 8;
data |= ((unsigned int)(cp[1]));
position_ += sizeof(data);
return (data);
}
/// \brief Read an unsigned 32-bit integer in network byte order from the
/// buffer, convert it to host byte order, and return it.
///
/// If the remaining length of the buffer is smaller than 32-bit, an
/// exception of class \c isc::dns::InvalidBufferPosition will be thrown.
uint32_t readUint32() {
uint32_t data;
const uint8_t* cp;
if (position_ + sizeof(data) > len_) {
throwError("read beyond end of buffer");
}
cp = &data_[position_];
data = ((unsigned int)(cp[0])) << 24;
data |= ((unsigned int)(cp[1])) << 16;
data |= ((unsigned int)(cp[2])) << 8;
data |= ((unsigned int)(cp[3]));
position_ += sizeof(data);
return (data);
}
/// \brief Read data of the specified length from the buffer and copy it to
/// the caller supplied buffer.
///
/// The data is copied as stored in the buffer; no conversion is performed.
/// If the remaining length of the buffer is smaller than the specified
/// length, an exception of class \c isc::dns::InvalidBufferPosition will
/// be thrown.
void readData(void* data, size_t len) {
if (position_ + len > len_) {
throwError("read beyond end of buffer");
}
static_cast<void>(std::memmove(data, &data_[position_], len));
position_ += len;
}
//@}
/// @brief Read specified number of bytes as a vector.
///
/// If specified buffer is too short, it will be expanded
/// using vector::resize() method.
///
/// @param data Reference to a buffer (data will be stored there).
/// @param len Size specified number of bytes to read in a vector.
///
void readVector(std::vector<uint8_t>& data, size_t len) {
if (position_ + len > len_) {
throwError("read beyond end of buffer");
}
data.resize(len);
readData(&data[0], len);
}
private:
/// \brief A common helper to throw an exception on invalid operation.
///
/// Experiments showed that throwing from each method makes the buffer
/// operation slower, so we consolidate it here, and let the methods
/// call this.
static void throwError(const char* msg) {
isc_throw(InvalidBufferPosition, msg);
}
size_t position_;
// XXX: The following must be private, but for a short term workaround with
// Boost.Python binding, we changed it to protected. We should soon
// revisit it.
protected:
const uint8_t* data_;
size_t len_;
};
///
///\brief The \c OutputBuffer class is a buffer abstraction for manipulating
/// mutable data.
///
/// The main purpose of this class is to provide a safe workplace for
/// constructing wire-format data to be sent out to a network. Here,
/// <em>safe</em> means that it automatically allocates necessary memory and
/// avoid buffer overrun.
///
/// Like for the \c InputBuffer class, applications normally use this class only
/// in a limited situation. One common usage of this class for an application
/// would be something like this:
///
/// \code OutputBuffer buffer(4096); // give a sufficiently large initial size
/// // pass the buffer to a DNS message object to construct a wire-format
/// // DNS message.
/// struct sockaddr to;
/// sendto(s, buffer.getData(), buffer.getLength(), 0, &to, sizeof(to));
/// \endcode
///
/// where the \c getData() method gives a reference to the internal memory
/// region stored in the \c buffer object. This is a suboptimal design in that
/// it exposes an encapsulated "handle" of an object to its user.
/// Unfortunately, there is no easy way to avoid this without involving
/// expensive data copy if we want to use this object with a legacy API such as
/// a BSD socket interface. And, indeed, this is one major purpose for this
/// object. Applications should use this method only under such a special
/// circumstance. It should also be noted that the memory region returned by
/// \c getData() may be invalidated after a subsequent write operation.
///
/// An \c OutputBuffer class object automatically extends its memory region when
/// data is written beyond the end of the current buffer. However, it will
/// involve performance overhead such as reallocating more memory and copying
/// data. It is therefore recommended to construct the buffer object with a
/// sufficiently large initial size.
/// The \c getCapacity() method provides the current maximum size of data
/// (including the portion already written) that can be written into the buffer
/// without causing memory reallocation.
///
/// Methods for writing data into the buffer generally work like an output
/// stream: it begins with the head of the buffer, and once some length of data
/// is written into the buffer, the next write operation will take place from
/// the end of the buffer. Other methods to emulate "random access" are also
/// provided (e.g., \c writeUint16At()). The normal write operations are
/// normally exception-free as this class automatically extends the buffer
/// when necessary. However, in extreme cases such as an attempt of writing
/// multi-GB data, a separate exception (e.g., \c std::bad_alloc) may be thrown
/// by the system. This also applies to the constructor with a very large
/// initial size.
///
/// Note to developers: it may make more sense to introduce an abstract base
/// class for the \c OutputBuffer and define the simple implementation as a
/// a concrete derived class. That way we can provide flexibility for future
/// extension such as more efficient buffer implementation or allowing users
/// to have their own customized version without modifying the source code.
/// We in fact considered that option, but at the moment chose the simpler
/// approach with a single concrete class because it may make the
/// implementation unnecessarily complicated while we were still not certain
/// if we really want that flexibility. We may revisit the class design as
/// we see more applications of the class. The same considerations apply to
/// the \c InputBuffer and \c MessageRenderer classes.
class OutputBuffer {
public:
///
/// \name Constructors and Destructor
///
//@{
/// \brief Constructor from the initial size of the buffer.
///
/// \param len The initial length of the buffer in bytes.
OutputBuffer(size_t len) :
buffer_(NULL),
size_(0),
allocated_(len)
{
// We use malloc and free instead of C++ new[] and delete[].
// This way we can use realloc, which may in fact do it without a copy.
if (allocated_ != 0) {
buffer_ = static_cast<uint8_t*>(malloc(allocated_));
if (buffer_ == NULL) {
throw std::bad_alloc();
}
}
}
/// \brief Copy constructor
///
/// \param other Source object from which to make a copy.
///
/// \note It is assumed that the source object is consistent, i.e.
/// size_ <= allocated_, and that if allocated_ is greater than zero,
/// buffer_ points to valid memory.
OutputBuffer(const OutputBuffer& other) :
buffer_(NULL),
size_(other.size_),
allocated_(other.allocated_)
{
if (allocated_ != 0) {
buffer_ = static_cast<uint8_t*>(malloc(allocated_));
if (buffer_ == NULL) {
throw std::bad_alloc();
}
static_cast<void>(std::memmove(buffer_, other.buffer_, other.size_));
}
}
/// \brief Destructor
~ OutputBuffer() {
free(buffer_);
}
//@}
/// \brief Assignment operator
///
/// \param other Object to copy into "this".
///
/// \note It is assumed that the source object is consistent, i.e.
/// size_ <= allocated_, and that if allocated_ is greater than zero,
/// buffer_ points to valid memory.
OutputBuffer& operator =(const OutputBuffer& other) {
if (this != &other) {
// Not self-assignment.
if (other.allocated_ != 0) {
// There is something in the source object, so allocate memory
// and copy it. The pointer to the allocated memory is placed
// in a temporary variable so that if the allocation fails and
// an exception is thrown, the destination object ("this") is
// unchanged.
uint8_t* newbuff = static_cast<uint8_t*>(malloc(other.allocated_));
if (newbuff == NULL) {
throw std::bad_alloc();
}
// Memory allocated, update the source object and copy data
// across.
free(buffer_);
buffer_ = newbuff;
static_cast<void>(std::memmove(buffer_, other.buffer_, other.size_));
} else {
// Nothing allocated in the source object, so zero the buffer
// in the destination.
free(buffer_);
buffer_ = NULL;
}
// Update the other member variables.
size_ = other.size_;
allocated_ = other.allocated_;
}
return (*this);
}
///
/// \name Getter Methods
///
//@{
/// \brief Return the current capacity of the buffer.
size_t getCapacity() const { return (allocated_); }
/// \brief Return a pointer to the head of the data stored in the buffer.
///
/// The caller can assume that the subsequent \c getLength() bytes are
/// identical to the stored data of the buffer.
///
/// Note: The pointer returned by this method may be invalidated after a
/// subsequent write operation.
const void* getData() const { return (buffer_); }
/// \brief Return the length of data written in the buffer.
size_t getLength() const { return (size_); }
/// \brief Return the value of the buffer at the specified position.
///
/// \c pos must specify the valid position of the buffer; otherwise an
/// exception class of \c InvalidBufferPosition will be thrown.
///
/// \param pos The position in the buffer to be returned.
uint8_t operator[](size_t pos) const {
assert (pos < size_);
return (buffer_[pos]);
}
//@}
///
/// \name Methods for writing data into the buffer.
///
//@{
/// \brief Insert a specified length of gap at the end of the buffer.
///
/// The caller should not assume any particular value to be inserted.
/// This method is provided as a shortcut to make a hole in the buffer
/// that is to be filled in later, e.g, by \ref writeUint16At().
/// \param len The length of the gap to be inserted in bytes.
void skip(size_t len) {
ensureAllocated(size_ + len);
size_ += len;
}
/// \brief Trim the specified length of data from the end of the buffer.
///
/// The specified length must not exceed the current data size of the
/// buffer; otherwise an exception of class \c isc::OutOfRange will
/// be thrown.
///
/// \param len The length of data that should be trimmed.
void trim(size_t len) {
if (len > size_) {
isc_throw(OutOfRange, "trimming too large from output buffer");
}
size_ -= len;
}
/// \brief Clear buffer content.
///
/// This method can be used to re-initialize and reuse the buffer without
/// constructing a new one. Note it must keep current content.
void clear() { size_ = 0; }
/// \brief Wipe buffer content.
///
/// This method is the destructive alternative to clear().
void wipe() {
if (buffer_ != NULL) {
static_cast<void>(std::memset(buffer_, 0, allocated_));
}
size_ = 0;
}
/// \brief Write an unsigned 8-bit integer into the buffer.
///
/// \param data The 8-bit integer to be written into the buffer.
void writeUint8(uint8_t data) {
ensureAllocated(size_ + 1);
buffer_[size_ ++] = data;
}
/// \brief Write an unsigned 8-bit integer into the buffer.
///
/// The position must be lower than the size of the buffer,
/// otherwise an exception of class \c isc::dns::InvalidBufferPosition
/// will be thrown.
///
/// \param data The 8-bit integer to be written into the buffer.
/// \param pos The position in the buffer to write the data.
void writeUint8At(uint8_t data, size_t pos) {
if (pos + sizeof(data) > size_) {
isc_throw(InvalidBufferPosition, "write at invalid position");
}
buffer_[pos] = data;
}
/// \brief Write an unsigned 16-bit integer in host byte order into the
/// buffer in network byte order.
///
/// \param data The 16-bit integer to be written into the buffer.
void writeUint16(uint16_t data) {
ensureAllocated(size_ + sizeof(data));
buffer_[size_ ++] = static_cast<uint8_t>((data & 0xff00U) >> 8);
buffer_[size_ ++] = static_cast<uint8_t>(data & 0x00ffU);
}
/// \brief Write an unsigned 16-bit integer in host byte order at the
/// specified position of the buffer in network byte order.
///
/// The buffer must have a sufficient room to store the given data at the
/// given position, that is, <code>pos + 2 < getLength()</code>;
/// otherwise an exception of class \c isc::dns::InvalidBufferPosition will
/// be thrown.
/// Note also that this method never extends the buffer.
///
/// \param data The 16-bit integer to be written into the buffer.
/// \param pos The beginning position in the buffer to write the data.
void writeUint16At(uint16_t data, size_t pos) {
if (pos + sizeof(data) > size_) {
isc_throw(InvalidBufferPosition, "write at invalid position");
}
buffer_[pos] = static_cast<uint8_t>((data & 0xff00U) >> 8);
buffer_[pos + 1] = static_cast<uint8_t>(data & 0x00ffU);
}
/// \brief Write an unsigned 32-bit integer in host byte order
/// into the buffer in network byte order.
///
/// \param data The 32-bit integer to be written into the buffer.
void writeUint32(uint32_t data) {
ensureAllocated(size_ + sizeof(data));
buffer_[size_ ++] = static_cast<uint8_t>((data & 0xff000000) >> 24);
buffer_[size_ ++] = static_cast<uint8_t>((data & 0x00ff0000) >> 16);
buffer_[size_ ++] = static_cast<uint8_t>((data & 0x0000ff00) >> 8);
buffer_[size_ ++] = static_cast<uint8_t>(data & 0x000000ff);
}
/// \brief Copy an arbitrary length of data into the buffer.
///
/// No conversion on the copied data is performed.
///
/// \param data A pointer to the data to be copied into the buffer.
/// \param len The length of the data in bytes.
void writeData(const void *data, size_t len) {
ensureAllocated(size_ + len);
static_cast<void>(std::memmove(buffer_ + size_, data, len));
size_ += len;
}
//@}
private:
/// The actual data
uint8_t* buffer_;
/// How many bytes are used
size_t size_;
/// How many bytes do we have preallocated (eg. the capacity)
size_t allocated_;
/// \brief Ensure buffer is appropriate size
///
/// Checks that the buffer equal to or larger than the size given as
/// argument and extends it to at least that size if not.
///
/// \param needed_size The number of bytes required in the buffer
void ensureAllocated(size_t needed_size) {
if (allocated_ < needed_size) {
// Guess some bigger size
size_t new_size = (allocated_ == 0) ? 1024 : allocated_;
while (new_size < needed_size) {
new_size *= 2;
}
// Allocate bigger space. Note that buffer_ may be NULL,
// in which case realloc acts as malloc.
uint8_t* new_buffer_(static_cast<uint8_t*>(realloc(buffer_,
new_size)));
if (new_buffer_ == NULL) {
// If it fails, the original block is left intact by it
throw std::bad_alloc();
}
buffer_ = new_buffer_;
allocated_ = new_size;
}
}
};
/// \brief Pointer-like types pointing to \c InputBuffer or \c OutputBuffer
///
/// These types are expected to be used as an argument in asynchronous
/// callback functions. The internal reference-counting will ensure that
/// that ongoing state information will not be lost if the object
/// that originated the asynchronous call falls out of scope.
typedef boost::shared_ptr<InputBuffer> InputBufferPtr;
typedef boost::shared_ptr<OutputBuffer> OutputBufferPtr;
} // namespace util
} // namespace isc
#endif // BUFFER_H
// Local Variables:
// mode: c++
// End:
|