OpenDDS::DCPS::InstanceDataSampleList Class Reference

#include <InstanceDataSampleList.h>

Collaboration diagram for OpenDDS::DCPS::InstanceDataSampleList:

[legend]

List of all members.

Public Member Functions
	InstanceDataSampleList ()
	~InstanceDataSampleList ()
void	reset ()
	Reset to initial state.
ssize_t	size () const
DataSampleElement *	head () const
DataSampleElement *	tail () const
void	enqueue_tail (const DataSampleElement *element)
bool	dequeue_head (DataSampleElement *&stale)
bool	dequeue (const DataSampleElement *stale)
Static Public Member Functions
static bool	on_some_list (const DataSampleElement *iter)
static DataSampleElement *	next (const DataSampleElement *iter)
static DataSampleElement *	prev (const DataSampleElement *iter)
Protected Attributes
DataSampleElement *	head_
	The first element of the list.
DataSampleElement *	tail_
	The last element of the list.
ssize_t	size_
	Number of elements in the list.

---

Detailed Description

A list of DataSampleElement pointers to be queued by the order the samples are written to the instance (within PRESENTAION.access_scope==INSTANCE). It is mainly used on the send side to count the depth of instance data and to allow the removal of elements by instance. Manages DataSampleElement's next_instance_sample pointer

Definition at line 34 of file InstanceDataSampleList.h.

---

Constructor & Destructor Documentation

ACE_INLINE OpenDDS::DCPS::InstanceDataSampleList::InstanceDataSampleList

(

)

Definition at line 16 of file InstanceDataSampleList.inl.

  : head_(0),
    tail_(0),
    size_(0)
{
}

OpenDDS::DCPS::InstanceDataSampleList::~InstanceDataSampleList

(

)

[inline]

Definition at line 38 of file InstanceDataSampleList.h.

{}

---

Member Function Documentation

bool OpenDDS::DCPS::InstanceDataSampleList::dequeue

(

const DataSampleElement *

stale

)

Definition at line 33 of file InstanceDataSampleList.cpp.

References dequeue_head(), head_, OpenDDS::DCPS::DataSampleElement::next_instance_sample_, OpenDDS::DCPS::DataSampleElement::previous_instance_sample_, size_, and tail_.

Referenced by OpenDDS::DCPS::WriteDataContainer::remove_excess_durable().

{
  if (head_ == 0) {
    return false;
  }

  if (stale == head_) {
    DataSampleElement* tmp;
    return dequeue_head(tmp);
  }

  if (stale == tail_) {
    tail_ = tail_->previous_instance_sample_;
    tail_->next_instance_sample_ = 0;

  } else {
    stale->previous_instance_sample_->next_instance_sample_ =
      stale->next_instance_sample_;
    stale->next_instance_sample_->previous_instance_sample_ =
      stale->previous_instance_sample_;
  }

  stale->next_instance_sample_ = stale->previous_instance_sample_ = 0;
  --size_;
  return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ACE_INLINE bool OpenDDS::DCPS::InstanceDataSampleList::dequeue_head

(

DataSampleElement *&

stale

)

Definition at line 92 of file InstanceDataSampleList.inl.

References head_, OpenDDS::DCPS::DataSampleElement::next_instance_sample_, OpenDDS::DCPS::DataSampleElement::previous_instance_sample_, size_, and tail_.

Referenced by dequeue(), and OpenDDS::DCPS::WriteDataContainer::remove_oldest_sample().

{
  //
  // Remove the oldest sample from the instance list.
  //
  stale = head_;

  if (head_ == 0) {
    // try to dequeue empty instance list.
    return false;

  } else {
    --size_;
    head_ = head_->next_instance_sample_;

    if (head_ == 0) {
      tail_ = 0;
    } else {
      head_->previous_instance_sample_ = 0;
    }

    stale->next_instance_sample_ = 0;
    return true;
  }
}

Here is the caller graph for this function:

ACE_INLINE void OpenDDS::DCPS::InstanceDataSampleList::enqueue_tail

(

const DataSampleElement *

element

)

Definition at line 67 of file InstanceDataSampleList.inl.

References head_, OpenDDS::DCPS::DataSampleElement::next_instance_sample_, OpenDDS::DCPS::DataSampleElement::previous_instance_sample_, size_, and tail_.

Referenced by OpenDDS::DCPS::WriteDataContainer::enqueue().

{
  // const_cast here so that higher layers don't need to pass around so many
  // non-const pointers to DataSampleElement.  Ideally the design would be
  // changed to accommodate const-correctness throughout.
  DataSampleElement* mSample = const_cast<DataSampleElement*>(sample);

  mSample->next_instance_sample_ = 0;

  ++size_;

  if (head_ == 0) {
    // First sample on queue.
    head_ = tail_ = mSample;

  } else {
    // Another sample on an existing queue.
    tail_->next_instance_sample_ = mSample;
    mSample->previous_instance_sample_ = tail_;
    tail_ = mSample;
  }
}

Here is the caller graph for this function:

ACE_INLINE DataSampleElement * OpenDDS::DCPS::InstanceDataSampleList::head

(

void

)

const

Definition at line 39 of file InstanceDataSampleList.inl.

References head_.

{
  return head_;
}

ACE_INLINE DataSampleElement * OpenDDS::DCPS::InstanceDataSampleList::next

(

const DataSampleElement *

iter

)

[static]

Definition at line 53 of file InstanceDataSampleList.inl.

References OpenDDS::DCPS::DataSampleElement::next_instance_sample_.

{
  return iter->next_instance_sample_;
}

bool OpenDDS::DCPS::InstanceDataSampleList::on_some_list

(

const DataSampleElement *

iter

)

[static]

Definition at line 26 of file InstanceDataSampleList.cpp.

References OpenDDS::DCPS::DataSampleElement::handle_, OpenDDS::DCPS::DataSampleElement::next_instance_sample_, and OpenDDS::DCPS::DataSampleElement::previous_instance_sample_.

Referenced by OpenDDS::DCPS::WriteDataContainer::data_delivered().

{
  return iter->next_instance_sample_ || iter->previous_instance_sample_
    || (iter->handle_ && iter->handle_->samples_.head_ == iter);
}

Here is the caller graph for this function:

ACE_INLINE DataSampleElement * OpenDDS::DCPS::InstanceDataSampleList::prev

(

const DataSampleElement *

iter

)

[static]

Definition at line 60 of file InstanceDataSampleList.inl.

References OpenDDS::DCPS::DataSampleElement::previous_instance_sample_.

Referenced by OpenDDS::DCPS::WriteDataContainer::remove_excess_durable().

{
  return iter->previous_instance_sample_;
}

Here is the caller graph for this function:

ACE_INLINE void OpenDDS::DCPS::InstanceDataSampleList::reset

(

void

)

Reset to initial state.

Definition at line 24 of file InstanceDataSampleList.inl.

References head_, size_, and tail_.

{
  head_ = tail_ = 0;
  size_ = 0;
}

ACE_INLINE ssize_t OpenDDS::DCPS::InstanceDataSampleList::size

(

void

)

const

Definition at line 32 of file InstanceDataSampleList.inl.

References size_.

Referenced by OpenDDS::DCPS::WriteDataContainer::dispose().

{
  return size_;
}

Here is the caller graph for this function:

ACE_INLINE DataSampleElement * OpenDDS::DCPS::InstanceDataSampleList::tail

(

void

)

const

Definition at line 46 of file InstanceDataSampleList.inl.

References tail_.

Referenced by OpenDDS::DCPS::WriteDataContainer::remove_excess_durable().

{
  return tail_;
}

Here is the caller graph for this function:

---

Member Data Documentation

DataSampleElement* OpenDDS::DCPS::InstanceDataSampleList::head_ [protected]

The first element of the list.

Definition at line 60 of file InstanceDataSampleList.h.

Referenced by dequeue(), dequeue_head(), enqueue_tail(), head(), and reset().

ssize_t OpenDDS::DCPS::InstanceDataSampleList::size_ [protected]

Number of elements in the list.

Definition at line 66 of file InstanceDataSampleList.h.

Referenced by dequeue(), dequeue_head(), enqueue_tail(), reset(), and size().

DataSampleElement* OpenDDS::DCPS::InstanceDataSampleList::tail_ [protected]

The last element of the list.

Definition at line 63 of file InstanceDataSampleList.h.

Referenced by dequeue(), dequeue_head(), enqueue_tail(), reset(), and tail().

---

The documentation for this class was generated from the following files:

• InstanceDataSampleList.h
• InstanceDataSampleList.cpp
• InstanceDataSampleList.inl