Files
unison/src/network/model/buffer.h

1091 lines
30 KiB
C
Raw Normal View History

2006-11-01 13:11:30 +01:00
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2006-08-29 17:42:13 +02:00
/*
* Copyright (c) 2005,2006,2007 INRIA
2006-08-29 17:42:13 +02:00
*
* 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
*
* Author: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>
*/
#ifndef BUFFER_H
#define BUFFER_H
#include <stdint.h>
#include <vector>
#include <ostream>
2010-07-23 13:39:46 +02:00
#include "ns3/assert.h"
2006-08-29 17:42:13 +02:00
2014-03-13 09:29:47 +01:00
#define BUFFER_FREE_LIST 1
2007-09-11 14:56:10 +02:00
2006-08-29 17:55:34 +02:00
namespace ns3 {
2006-08-29 17:42:13 +02:00
/**
2008-05-29 23:24:10 -07:00
* \ingroup packet
*
2006-08-29 17:42:13 +02:00
* \brief automatically resized byte buffer
*
* This represents a buffer of bytes. Its size is
* automatically adjusted to hold any data prepended
* or appended by the user. Its implementation is optimized
* to ensure that the number of buffer resizes is minimized,
* by creating new Buffers of the maximum size ever used.
* The correct maximum size is learned at runtime during use by
* recording the maximum size of each packet.
*
* \internal
* The implementation of the Buffer class uses a COW (Copy On Write)
* technique to ensure that the underlying data buffer which holds
* the data bytes is shared among a lot of Buffer instances despite
* data being added or removed from them.
*
* When multiple Buffer instances hold a reference to the same
* underlying BufferData object, they must be able to detect when
* the operation they want to perform should trigger a copy of the
* BufferData. If the BufferData::m_count field is one, it means that
* there exist only one instance of Buffer which references the
* BufferData instance so, it is safe to modify it. It is also
* safe to modify the content of a BufferData if the modification
* falls outside of the "dirty area" defined by the BufferData.
* In every other case, the BufferData must be copied before
* being modified.
*
* To understand the way the Buffer::Add and Buffer::Remove methods
* work, you first need to understand the "virtual offsets" used to
* keep track of the content of buffers. Each Buffer instance
* contains real data bytes in its BufferData instance but it also
* contains "virtual zero data" which typically is used to represent
* application-level payload. No memory is allocated to store the
* zero bytes of application-level payload unless the user fragments
* a Buffer: this application-level payload is kept track of with
* a pair of integers which describe where in the buffer content
* the "virtual zero area" starts and ends.
*
* \verbatim
* ***: unused bytes
* xxx: bytes "added" at the front of the zero area
* ...: bytes "added" at the back of the zero area
* 000: virtual zero bytes
*
* Real byte buffer: |********xxxxxxxxxxxx.........*****|
* |--------^ m_start
* |-------------------^ m_zeroAreaStart
* |-----------------------------^ m_end - (m_zeroAreaEnd - m_zeroAreaStart)
2014-03-13 09:29:47 +01:00
* Virtual byte buffer: |xxxxxxxxxxxx0000000000000.........|
* |--------^ m_start
* |--------------------^ m_zeroAreaStart
* |---------------------------------^ m_zeroAreaEnd
* |------------------------------------------^ m_end
* \endverbatim
*
* A simple state invariant is that m_start <= m_zeroStart <= m_zeroEnd <= m_end
2006-08-29 17:42:13 +02:00
*/
class Buffer
{
2006-08-29 17:42:13 +02:00
public:
2006-11-01 13:11:30 +01:00
/**
* \brief iterator in a Buffer instance
*/
class Iterator
{
2010-07-01 12:50:22 +02:00
public:
2010-07-23 13:39:46 +02:00
inline Iterator ();
2010-07-01 12:50:22 +02:00
/**
* go forward by one byte
*/
2010-07-23 13:39:46 +02:00
inline void Next (void);
2010-07-01 12:50:22 +02:00
/**
* go backward by one byte
*/
2010-07-23 13:39:46 +02:00
inline void Prev (void);
2010-07-01 12:50:22 +02:00
/**
* \param delta number of bytes to go forward
*/
2010-07-23 13:39:46 +02:00
inline void Next (uint32_t delta);
2010-07-01 12:50:22 +02:00
/**
* \param delta number of bytes to go backward
*/
2010-07-23 13:39:46 +02:00
inline void Prev (uint32_t delta);
2010-07-01 12:50:22 +02:00
/**
* \param o the second iterator
* \return number of bytes included between the two iterators
*
* This method works only if the two iterators point
* to the same underlying buffer. Debug builds ensure
* this with an assert.
*/
uint32_t GetDistanceFrom (Iterator const &o) const;
/**
* \return true if this iterator points to the end of the byte array.
* false otherwise.
*/
bool IsEnd (void) const;
/**
* \return true if this iterator points to the start of the byte array.
* false otherwise.
*/
bool IsStart (void) const;
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by one byte.
*/
inline void WriteU8 (uint8_t data);
/**
* \param data data to write in buffer
* \param len number of times data must be written in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer len times and advance the iterator position
2010-07-01 12:50:22 +02:00
* by len byte.
*/
inline void WriteU8 (uint8_t data, uint32_t len);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by two bytes. The format of the data written in the byte
* buffer is non-portable. We only ensure that readU16 will
* return exactly what we wrote with writeU16 if the program
* is run on the same machine.
*/
void WriteU16 (uint16_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by four bytes. The format of the data written in the byte
* buffer is non-portable. We only ensure that readU32 will
* return exactly what we wrote with writeU32 if the program
* is run on the same machine.
*/
void WriteU32 (uint32_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by eight bytes. The format of the data written in the byte
* buffer is non-portable. We only ensure that readU64 will
* return exactly what we wrote with writeU64 if the program
* is run on the same machine.
*/
void WriteU64 (uint64_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
* by two bytes. The data is written in least significant byte order and the
2010-07-01 12:50:22 +02:00
* input data is expected to be in host order.
*/
void WriteHtolsbU16 (uint16_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by four bytes. The data is written in least significant byte order and the
* input data is expected to be in host order.
*/
void WriteHtolsbU32 (uint32_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by eight bytes. The data is written in least significant byte order and the
* input data is expected to be in host order.
*/
void WriteHtolsbU64 (uint64_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
* by two bytes. The data is written in network order and the
2010-07-01 12:50:22 +02:00
* input data is expected to be in host order.
*/
inline void WriteHtonU16 (uint16_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by four bytes. The data is written in network order and the
* input data is expected to be in host order.
*/
inline void WriteHtonU32 (uint32_t data);
/**
* \param data data to write in buffer
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by eight bytes. The data is written in network order and the
* input data is expected to be in host order.
*/
void WriteHtonU64 (uint64_t data);
/**
* \param buffer a byte buffer to copy in the internal buffer.
* \param size number of bytes to copy.
*
2015-01-30 16:06:55 -08:00
* Write the data in buffer and advance the iterator position
2010-07-01 12:50:22 +02:00
* by size bytes.
*/
void Write (uint8_t const*buffer, uint32_t size);
/**
* \param start the start of the data to copy
* \param end the end of the data to copy
*
* Write the data delimited by start and end in internal buffer
2015-01-30 16:06:55 -08:00
* and advance the iterator position by the number of bytes
2010-07-01 12:50:22 +02:00
* copied.
* The input interators _must_ not point to the same Buffer as
* we do to avoid overlapping copies. This is enforced
* in debug builds by asserts.
*/
void Write (Iterator start, Iterator end);
/**
* \return the byte read in the buffer.
*
* Read data, but do not advance the Iterator read.
*/
inline uint8_t PeekU8 (void);
2010-07-01 12:50:22 +02:00
/**
* \return the byte read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
*/
inline uint8_t ReadU8 (void);
/**
* \return the two bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
* The data is read in the format written by writeU16.
*/
2010-07-23 13:39:46 +02:00
inline uint16_t ReadU16 (void);
2010-07-01 12:50:22 +02:00
/**
* \return the four bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
* The data is read in the format written by writeU32.
*/
uint32_t ReadU32 (void);
/**
* \return the eight bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
* The data is read in the format written by writeU64.
*/
uint64_t ReadU64 (void);
/**
* \return the two bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in network format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
inline uint16_t ReadNtohU16 (void);
/**
* \return the four bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in network format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
inline uint32_t ReadNtohU32 (void);
/**
* \return the eight bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in network format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
uint64_t ReadNtohU64 (void);
/**
* \return the two bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in least significant byte format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
uint16_t ReadLsbtohU16 (void);
/**
* \return the four bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in least significant byte format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
uint32_t ReadLsbtohU32 (void);
/**
* \return the eight bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in least signficant byte format and returned in host format.
2010-07-01 12:50:22 +02:00
*/
uint64_t ReadLsbtohU64 (void);
/**
* \param buffer buffer to copy data into
* \param size number of bytes to copy
*
* Copy size bytes of data from the internal buffer to the
* input buffer and advance the Iterator by the number of
2010-07-01 12:50:22 +02:00
* bytes read.
*/
void Read (uint8_t *buffer, uint32_t size);
/**
* \param start start iterator of the buffer to copy data into
* \param size number of bytes to copy
*
* Copy size bytes of data from the internal buffer to the input buffer via
* the provided iterator and advance the Iterator by the number of bytes
* read.
*/
inline void Read (Iterator start, uint32_t size);
2010-07-01 12:50:22 +02:00
/**
* \brief Calculate the checksum.
* \param size size of the buffer.
* \return checksum
*/
uint16_t CalculateIpChecksum (uint16_t size);
2010-07-01 12:50:22 +02:00
/**
* \brief Calculate the checksum.
* \param size size of the buffer.
* \param initialChecksum initial value
* \return checksum
*/
uint16_t CalculateIpChecksum (uint16_t size, uint32_t initialChecksum);
2010-07-01 12:50:22 +02:00
/**
* \returns the size of the underlying buffer we are iterating
*/
uint32_t GetSize (void) const;
private:
friend class Buffer;
2014-03-13 09:29:47 +01:00
/**
* Constructor - initializes the iterator to point to the buffer start
*
* \param buffer the buffer this iterator refers to
*/
2010-07-23 13:39:46 +02:00
inline Iterator (Buffer const*buffer);
2014-03-13 09:29:47 +01:00
/**
* Constructor - initializes the iterator to point to the buffer end
*
* \param buffer the buffer this iterator refers to
* \param dummy not used param
*/
inline Iterator (Buffer const*buffer, bool dummy);
/**
* Initializes the iterator values
*
* \param buffer the buffer this iterator refers to
*/
2010-07-23 13:39:46 +02:00
inline void Construct (const Buffer *buffer);
2014-03-13 09:29:47 +01:00
/**
* Checks that the [start, end) is not in the "virtual zero area".
*
* \param start start buffer position
* \param end end buffer position
* \returns true if [start, end) is not in the "virtual zero area".
*/
2010-07-01 12:50:22 +02:00
bool CheckNoZero (uint32_t start, uint32_t end) const;
2014-03-13 09:29:47 +01:00
/**
* Checks that the buffer position is not in the "virtual zero area".
*
* \param i buffer position
* \returns true if not in the "virtual zero area".
*/
2010-07-01 12:50:22 +02:00
bool Check (uint32_t i) const;
2014-03-13 09:29:47 +01:00
/**
* \return the two bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in network format and returned in host format.
2014-03-13 09:29:47 +01:00
*
* \warning this is the slow version, please use ReadNtohU16 (void)
*/
2010-07-01 12:50:22 +02:00
uint16_t SlowReadNtohU16 (void);
2014-03-13 09:29:47 +01:00
/**
* \return the four bytes read in the buffer.
*
* Read data and advance the Iterator by the number of bytes
* read.
2015-01-30 16:06:55 -08:00
* The data is read in network format and returned in host format.
2014-03-13 09:29:47 +01:00
*
* \warning this is the slow version, please use ReadNtohU32 (void)
*/
2010-07-01 12:50:22 +02:00
uint32_t SlowReadNtohU32 (void);
2014-03-13 09:29:47 +01:00
/**
* \brief Returns an appropriate message indicating a read error
* \returns the error message
*/
std::string GetReadErrorMessage (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Returns an appropriate message indicating a write error
*
* The message depends on the actual Buffer::Iterator status.
*
* \returns the error message
*/
std::string GetWriteErrorMessage (void) const;
2007-09-11 14:56:10 +02:00
2014-03-13 09:29:47 +01:00
/**
* offset in virtual bytes from the start of the data buffer to the
* start of the "virtual zero area".
*/
2010-07-01 12:50:22 +02:00
uint32_t m_zeroStart;
2014-03-13 09:29:47 +01:00
/**
* offset in virtual bytes from the start of the data buffer to the
* end of the "virtual zero area".
*/
2010-07-01 12:50:22 +02:00
uint32_t m_zeroEnd;
2014-03-13 09:29:47 +01:00
/**
* offset in virtual bytes from the start of the data buffer to the
* start of the data which can be read by this iterator
*/
2010-07-01 12:50:22 +02:00
uint32_t m_dataStart;
2014-03-13 09:29:47 +01:00
/**
* offset in virtual bytes from the start of the data buffer to the
* end of the data which can be read by this iterator
*/
2010-07-01 12:50:22 +02:00
uint32_t m_dataEnd;
2014-03-13 09:29:47 +01:00
/**
* offset in virtual bytes from the start of the data buffer to the
* current position represented by this iterator.
*/
2010-07-01 12:50:22 +02:00
uint32_t m_current;
2014-03-13 09:29:47 +01:00
/**
* a pointer to the underlying byte buffer. All offsets are relative
* to this pointer.
*/
2010-07-01 12:50:22 +02:00
uint8_t *m_data;
2006-11-01 13:11:30 +01:00
};
/**
* \return the number of bytes stored in this buffer.
*/
2010-03-16 19:25:56 +01:00
inline uint32_t GetSize (void) const;
2006-11-01 13:11:30 +01:00
/**
* \return a pointer to the start of the internal
* byte buffer.
*
* The returned pointer points to an area of
* memory which is ns3::Buffer::GetSize () bytes big.
* Please, try to never ever use this method. It is really
* evil and is present only for a few specific uses.
*/
uint8_t const*PeekData (void) const;
/**
* \param start size to reserve
*
* Add bytes at the start of the Buffer. The
* content of these bytes is undefined but debugging
* builds initialize them to 0x33.
* Any call to this method invalidates any Iterator
* pointing to this Buffer.
*/
2015-08-05 15:20:10 -04:00
void AddAtStart (uint32_t start);
2006-11-01 13:11:30 +01:00
/**
* \param end size to reserve
*
* Add bytes at the end of the Buffer. The
* content of these bytes is undefined but debugging
* builds initialize them to 0x33.
* Any call to this method invalidates any Iterator
* pointing to this Buffer.
*/
2015-08-05 15:20:10 -04:00
void AddAtEnd (uint32_t end);
/**
* \param o the buffer to append to the end of this buffer.
*
* Add bytes at the end of the Buffer.
* Any call to this method invalidates any Iterator
* pointing to this Buffer.
*/
2008-04-24 14:52:59 -07:00
void AddAtEnd (const Buffer &o);
2006-11-01 13:11:30 +01:00
/**
* \param start size to remove
*
* Remove bytes at the start of the Buffer.
* Any call to this method invalidates any Iterator
* pointing to this Buffer.
*/
void RemoveAtStart (uint32_t start);
/**
* \param end size to remove
*
* Remove bytes at the end of the Buffer.
* Any call to this method invalidates any Iterator
* pointing to this Buffer.
*/
void RemoveAtEnd (uint32_t end);
/**
* \param start offset from start of packet
* \param length
*
* \return a fragment of size length starting at offset
* start.
*/
Buffer CreateFragment (uint32_t start, uint32_t length) const;
/**
* \return an Iterator which points to the
* start of this Buffer.
*/
2010-07-23 13:39:46 +02:00
inline Buffer::Iterator Begin (void) const;
2006-11-01 13:11:30 +01:00
/**
* \return an Iterator which points to the
* end of this Buffer.
*/
2010-07-23 13:39:46 +02:00
inline Buffer::Iterator End (void) const;
2006-11-01 13:11:30 +01:00
2014-03-13 09:29:47 +01:00
/**
* \brief Create a full copy of the buffer, including
* all the internal structures.
*
* \returns a copy of the buffer
*/
Buffer CreateFullCopy (void) const;
2010-03-08 21:07:31 -05:00
/**
2014-03-13 09:29:47 +01:00
* \brief Return the number of bytes required for serialization.
* \return the number of bytes.
2010-03-08 21:07:31 -05:00
*/
uint32_t GetSerializedSize (void) const;
/**
* \return zero if buffer not large enough
* \param buffer points to serialization buffer
* \param maxSize max number of bytes to write
*
* This buffer's contents are serialized into the raw
* character buffer parameter. Note: The zero length
* data is not copied entirely. Only the length of
* zero byte data is serialized.
*/
uint32_t Serialize (uint8_t* buffer, uint32_t maxSize) const;
/**
* \return zero if a complete buffer is not deserialized
* \param buffer points to buffer for deserialization
* \param size number of bytes to deserialize
*
* The raw character buffer is deserialized and all the
* data is placed into this buffer.
*/
2010-05-06 14:55:16 -04:00
uint32_t Deserialize (const uint8_t* buffer, uint32_t size);
2010-07-01 12:50:22 +02:00
2014-03-13 09:29:47 +01:00
/**
* \brief Returns the current buffer start offset
* \return the offset
*/
2008-04-24 14:52:59 -07:00
int32_t GetCurrentStartOffset (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Returns the current buffer end offset
* \return the offset
*/
2008-04-24 14:52:59 -07:00
int32_t GetCurrentEndOffset (void) const;
2009-08-13 09:36:16 +02:00
/**
* Copy the specified amount of data from the buffer to the given output stream.
*
* @param os the output stream
* @param size the maximum amount of bytes to copy. If zero, nothing is copied.
*/
void CopyData (std::ostream *os, uint32_t size) const;
2014-03-13 09:29:47 +01:00
/**
* Copy the specified amount of data from the buffer to the given buffer.
*
* @param buffer the output buffer
* @param size the maximum amount of bytes to copy. If zero, nothing is copied.
* @returns the amount of bytes copied
*/
uint32_t CopyData (uint8_t *buffer, uint32_t size) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Copy constructor
* \param o the buffer to copy
*/
2010-07-23 13:39:46 +02:00
inline Buffer (Buffer const &o);
2014-03-13 09:29:47 +01:00
/**
* \brief Assignment operator
* \param o the buffer to copy
* \return a reference to the buffer
*/
Buffer &operator = (Buffer const &o);
Buffer ();
2014-03-13 09:29:47 +01:00
/**
* \brief Constructor
*
* The buffer will be initialized with zeroes up to its size.
*
* \param dataSize the buffer size
*/
Buffer (uint32_t dataSize);
2014-03-13 09:29:47 +01:00
/**
* \brief Constructor
*
* If initialize is set to true, the buffer will be initialized
* with zeroes up to its size.
*
* \param dataSize the buffer size.
* \param initialize initialize the buffer with zeroes.
*/
2010-03-08 21:07:31 -05:00
Buffer (uint32_t dataSize, bool initialize);
~Buffer ();
2006-08-29 17:42:13 +02:00
private:
2010-07-23 13:39:46 +02:00
/**
* This data structure is variable-sized through its last member whose size
* is determined at allocation time and stored in the m_size field.
*
* The so-called "dirty area" describes the area in the buffer which
* has been reserved and used by a user. Multiple Buffer instances
* may reference the same Buffer::Data object instance and may
* reference different parts of the underlying byte buffer. The
* "dirty area" is union of all the areas referenced by the Buffer
* instances which reference the same BufferData instance.
* New user data can be safely written only outside of the "dirty
* area" if the reference count is higher than 1 (that is, if
* more than one Buffer instance references the same BufferData).
*/
struct Data
{
2014-03-13 09:29:47 +01:00
/**
* The reference count of an instance of this data structure.
2010-07-23 13:39:46 +02:00
* Each buffer which references an instance holds a count.
2014-03-13 09:29:47 +01:00
*/
2010-07-23 13:39:46 +02:00
uint32_t m_count;
2014-03-13 09:29:47 +01:00
/**
* the size of the m_data field below.
2010-07-23 13:39:46 +02:00
*/
uint32_t m_size;
2014-03-13 09:29:47 +01:00
/**
* offset from the start of the m_data field below to the
2010-07-23 13:39:46 +02:00
* start of the area in which user bytes were written.
*/
uint32_t m_dirtyStart;
2014-03-13 09:29:47 +01:00
/**
* offset from the start of the m_data field below to the
2010-07-23 13:39:46 +02:00
* end of the area in which user bytes were written.
*/
uint32_t m_dirtyEnd;
2014-03-13 09:29:47 +01:00
/**
* The real data buffer holds _at least_ one byte.
2010-07-23 13:39:46 +02:00
* Its real size is stored in the m_size field.
*/
uint8_t m_data[1];
};
2006-11-01 13:11:30 +01:00
2014-03-13 09:29:47 +01:00
/**
* \brief Transform a "Virtual byte buffer" into a "Real byte buffer"
*/
void TransformIntoRealBuffer (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Checks the internal buffer structures consistency
*
* Used only for debugging purposes.
*
* \returns true if the buffer status is consistent.
*/
2007-09-10 16:45:52 +02:00
bool CheckInternalState (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Initializes the buffer with a number of zeroes.
*
* \param zeroSize the zeroes size
*/
2007-09-10 16:45:52 +02:00
void Initialize (uint32_t zeroSize);
2014-03-13 09:29:47 +01:00
/**
* \brief Get the buffer real size.
* \warning The real size is the actual memory used by the buffer.
* \returns the memory used by the buffer.
*/
2007-09-10 16:45:52 +02:00
uint32_t GetInternalSize (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Get the buffer end position.
* \returns the buffer end index.
*/
2007-09-10 16:45:52 +02:00
uint32_t GetInternalEnd (void) const;
2014-03-13 09:29:47 +01:00
/**
* \brief Recycle the buffer memory
* \param data the buffer data storage
*/
2010-07-23 13:39:46 +02:00
static void Recycle (struct Buffer::Data *data);
2014-03-13 09:29:47 +01:00
/**
* \brief Create a buffer data storage
* \param size the storage size to create
* \returns a pointer to the created buffer storage
*/
2010-07-23 13:39:46 +02:00
static struct Buffer::Data *Create (uint32_t size);
2014-03-13 09:29:47 +01:00
/**
* \brief Allocate a buffer data storage
* \param reqSize the storage size to create
* \returns a pointer to the allocated buffer storage
*/
2010-07-23 13:39:46 +02:00
static struct Buffer::Data *Allocate (uint32_t reqSize);
2014-03-13 09:29:47 +01:00
/**
* \brief Deallocate the buffer memory
* \param data the buffer data storage
*/
2010-07-23 13:39:46 +02:00
static void Deallocate (struct Buffer::Data *data);
2011-05-13 14:57:43 -04:00
2014-03-13 09:29:47 +01:00
struct Data *m_data; //!< the buffer data storage
2006-11-01 13:11:30 +01:00
2014-03-13 09:29:47 +01:00
/**
* keep track of the maximum value of m_zeroAreaStart across
* the lifetime of a Buffer instance. This variable is used
* purely as a source of information for the heuristics which
* decide on the position of the zero area in new buffers.
* It is read from the Buffer destructor to update the global
* heuristic data and these global heuristic data are used from
* the Buffer constructor to choose an initial value for
* m_zeroAreaStart.
*/
2007-09-10 16:45:52 +02:00
uint32_t m_maxZeroAreaStart;
2010-07-23 13:39:46 +02:00
/**
* location in a newly-allocated buffer where you should start
* writing data. i.e., m_start should be initialized to this
* value.
*/
static uint32_t g_recommendedStart;
2014-03-13 09:29:47 +01:00
/**
* offset to the start of the virtual zero area from the start
* of m_data->m_data
*/
2007-09-10 08:54:11 +02:00
uint32_t m_zeroAreaStart;
2014-03-13 09:29:47 +01:00
/**
* offset to the end of the virtual zero area from the start
* of m_data->m_data
*/
2007-09-10 16:45:52 +02:00
uint32_t m_zeroAreaEnd;
2014-03-13 09:29:47 +01:00
/**
* offset to the start of the data referenced by this Buffer
* instance from the start of m_data->m_data
*/
2006-11-01 13:11:30 +01:00
uint32_t m_start;
2014-03-13 09:29:47 +01:00
/**
* offset to the end of the data referenced by this Buffer
* instance from the start of m_data->m_data
*/
2007-09-09 10:38:22 +02:00
uint32_t m_end;
2010-07-23 13:39:46 +02:00
#ifdef BUFFER_FREE_LIST
2014-03-13 09:29:47 +01:00
/// Container for buffer data
2010-07-23 13:39:46 +02:00
typedef std::vector<struct Buffer::Data*> FreeList;
2014-03-13 09:29:47 +01:00
/// Local static destructor structure
2010-07-23 13:39:46 +02:00
struct LocalStaticDestructor
{
~LocalStaticDestructor ();
};
2014-03-13 09:29:47 +01:00
static uint32_t g_maxSize; //!< Max observed data size
static FreeList *g_freeList; //!< Buffer data container
static struct LocalStaticDestructor g_localStaticDestructor; //!< Local static destructor
2010-07-23 13:39:46 +02:00
#endif
2006-08-29 17:42:13 +02:00
};
2007-09-11 14:10:02 +02:00
} // namespace ns3
#include "ns3/assert.h"
#include <cstring>
2007-09-11 14:10:02 +02:00
namespace ns3 {
2010-07-23 13:39:46 +02:00
Buffer::Iterator::Iterator ()
: m_zeroStart (0),
m_zeroEnd (0),
m_dataStart (0),
m_dataEnd (0),
m_current (0),
m_data (0)
{
}
Buffer::Iterator::Iterator (Buffer const*buffer)
{
Construct (buffer);
m_current = m_dataStart;
}
Buffer::Iterator::Iterator (Buffer const*buffer, bool dummy)
{
Construct (buffer);
m_current = m_dataEnd;
}
void
Buffer::Iterator::Construct (const Buffer *buffer)
{
m_zeroStart = buffer->m_zeroAreaStart;
m_zeroEnd = buffer->m_zeroAreaEnd;
m_dataStart = buffer->m_start;
m_dataEnd = buffer->m_end;
m_data = buffer->m_data->m_data;
}
void
Buffer::Iterator::Next (void)
{
NS_ASSERT (m_current + 1 <= m_dataEnd);
m_current++;
}
void
Buffer::Iterator::Prev (void)
{
NS_ASSERT (m_current >= 1);
m_current--;
}
void
Buffer::Iterator::Next (uint32_t delta)
{
NS_ASSERT (m_current + delta <= m_dataEnd);
m_current += delta;
}
void
Buffer::Iterator::Prev (uint32_t delta)
{
NS_ASSERT (m_current >= delta);
m_current -= delta;
}
2007-09-11 14:10:02 +02:00
void
Buffer::Iterator::WriteU8 (uint8_t data)
{
NS_ASSERT_MSG (Check (m_current),
GetWriteErrorMessage ());
2007-09-11 14:10:02 +02:00
if (m_current < m_zeroStart)
{
m_data[m_current] = data;
m_current++;
}
else
{
m_data[m_current - (m_zeroEnd-m_zeroStart)] = data;
2010-07-01 12:50:22 +02:00
m_current++;
2007-09-11 14:10:02 +02:00
}
}
2007-09-11 14:56:10 +02:00
void
Buffer::Iterator::WriteU8 (uint8_t data, uint32_t len)
{
NS_ASSERT_MSG (CheckNoZero (m_current, m_current + len),
GetWriteErrorMessage ());
2007-09-11 14:56:10 +02:00
if (m_current <= m_zeroStart)
{
std::memset (&(m_data[m_current]), data, len);
2007-09-11 14:56:10 +02:00
m_current += len;
}
else
{
uint8_t *buffer = &m_data[m_current - (m_zeroEnd-m_zeroStart)];
std::memset (buffer, data, len);
2007-09-11 14:56:10 +02:00
m_current += len;
}
}
2007-09-11 14:10:02 +02:00
2010-03-20 21:57:51 +01:00
void
Buffer::Iterator::WriteHtonU16 (uint16_t data)
{
NS_ASSERT_MSG (CheckNoZero (m_current, m_current + 2),
GetWriteErrorMessage ());
2010-03-20 21:57:51 +01:00
uint8_t *buffer;
if (m_current + 2 <= m_zeroStart)
{
buffer = &m_data[m_current];
}
else
{
buffer = &m_data[m_current - (m_zeroEnd - m_zeroStart)];
}
buffer[0] = (data >> 8)& 0xff;
buffer[1] = (data >> 0)& 0xff;
m_current+= 2;
}
void
Buffer::Iterator::WriteHtonU32 (uint32_t data)
{
NS_ASSERT_MSG (CheckNoZero (m_current, m_current + 4),
GetWriteErrorMessage ());
2010-03-20 21:57:51 +01:00
uint8_t *buffer;
if (m_current + 4 <= m_zeroStart)
{
buffer = &m_data[m_current];
}
else
{
buffer = &m_data[m_current - (m_zeroEnd - m_zeroStart)];
}
buffer[0] = (data >> 24)& 0xff;
buffer[1] = (data >> 16)& 0xff;
buffer[2] = (data >> 8)& 0xff;
buffer[3] = (data >> 0)& 0xff;
m_current+= 4;
}
uint16_t
Buffer::Iterator::ReadNtohU16 (void)
{
uint8_t *buffer;
if (m_current + 2 <= m_zeroStart)
{
buffer = &m_data[m_current];
}
else if (m_current >= m_zeroEnd)
{
buffer = &m_data[m_current - (m_zeroEnd - m_zeroStart)];
2010-03-20 21:57:51 +01:00
}
else
{
return SlowReadNtohU16 ();
}
uint16_t retval = 0;
retval |= buffer[0];
retval <<= 8;
retval |= buffer[1];
m_current += 2;
return retval;
}
uint32_t
Buffer::Iterator::ReadNtohU32 (void)
{
uint8_t *buffer;
if (m_current + 4 <= m_zeroStart)
{
buffer = &m_data[m_current];
}
else if (m_current >= m_zeroEnd)
{
buffer = &m_data[m_current - (m_zeroEnd - m_zeroStart)];
2010-03-20 21:57:51 +01:00
}
else
{
return SlowReadNtohU32 ();
}
uint32_t retval = 0;
retval |= buffer[0];
retval <<= 8;
retval |= buffer[1];
retval <<= 8;
retval |= buffer[2];
retval <<= 8;
retval |= buffer[3];
m_current += 4;
return retval;
}
2010-07-01 12:50:22 +02:00
uint8_t
Buffer::Iterator::PeekU8 (void)
2007-09-11 15:06:27 +02:00
{
NS_ASSERT_MSG (m_current >= m_dataStart &&
m_current <= m_dataEnd,
GetReadErrorMessage ());
2007-09-11 15:06:27 +02:00
if (m_current < m_zeroStart)
{
uint8_t data = m_data[m_current];
return data;
}
else if (m_current < m_zeroEnd)
{
return 0;
}
else
{
uint8_t data = m_data[m_current - (m_zeroEnd-m_zeroStart)];
return data;
}
}
uint8_t
Buffer::Iterator::ReadU8 (void)
{
uint8_t ret = PeekU8 ();
m_current ++;
return ret;
}
2010-07-23 13:39:46 +02:00
uint16_t
Buffer::Iterator::ReadU16 (void)
{
uint8_t byte0 = ReadU8 ();
uint8_t byte1 = ReadU8 ();
uint16_t data = byte1;
data <<= 8;
data |= byte0;
return data;
}
void
Buffer::Iterator::Read (Buffer::Iterator start, uint32_t size)
{
Buffer::Iterator end = *this;
end.Next (size);
start.Write (*this, end);
}
2010-07-23 13:39:46 +02:00
Buffer::Buffer (Buffer const&o)
: m_data (o.m_data),
m_maxZeroAreaStart (o.m_zeroAreaStart),
m_zeroAreaStart (o.m_zeroAreaStart),
m_zeroAreaEnd (o.m_zeroAreaEnd),
m_start (o.m_start),
m_end (o.m_end)
{
m_data->m_count++;
NS_ASSERT (CheckInternalState ());
}
2010-03-16 19:25:56 +01:00
uint32_t
Buffer::GetSize (void) const
{
return m_end - m_start;
}
2007-09-11 15:06:27 +02:00
2010-07-23 13:39:46 +02:00
Buffer::Iterator
Buffer::Begin (void) const
{
NS_ASSERT (CheckInternalState ());
return Buffer::Iterator (this);
}
Buffer::Iterator
Buffer::End (void) const
{
NS_ASSERT (CheckInternalState ());
return Buffer::Iterator (this, false);
}
} // namespace ns3
2006-08-29 17:42:13 +02:00
#endif /* BUFFER_H */