OpenDDS::DCPS::BuildChainVisitor Class Reference

#include <BuildChainVisitor.h>

Inheritance diagram for OpenDDS::DCPS::BuildChainVisitor:

[legend]Collaboration diagram for OpenDDS::DCPS::BuildChainVisitor:

[legend]List of all members.

Public Member Functions
	BuildChainVisitor ()
virtual	~BuildChainVisitor ()
virtual int	visit_element (TransportQueueElement *element)
ACE_Message_Block *	chain ()
Private Attributes
ACE_Message_Block *	head_
ACE_Message_Block *	tail_

---

Detailed Description

Definition at line 23 of file BuildChainVisitor.h.

---

Constructor & Destructor Documentation

ACE_INLINE OpenDDS::DCPS::BuildChainVisitor::BuildChainVisitor

(

)

Definition at line 11 of file BuildChainVisitor.inl.

References DBG_ENTRY_LVL.

  : head_(0),
    tail_(0)
{
  DBG_ENTRY_LVL("BuildChainVisitor","BuildChainVisitor",6);
}

OpenDDS::DCPS::BuildChainVisitor::~BuildChainVisitor

(

)

[virtual]

Definition at line 16 of file BuildChainVisitor.cpp.

References DBG_ENTRY_LVL.

{
  DBG_ENTRY_LVL("BuildChainVisitor","~BuildChainVisitor",6);
}

---

Member Function Documentation

ACE_INLINE ACE_Message_Block * OpenDDS::DCPS::BuildChainVisitor::chain

(

)

Accessor to extract the chain, leaving the head_ and tail_ set to 0 as a result.

Definition at line 20 of file BuildChainVisitor.inl.

References DBG_ENTRY_LVL, head_, and tail_.

Referenced by OpenDDS::DCPS::TransportSendStrategy::prepare_packet().

{
  DBG_ENTRY_LVL("BuildChainVisitor","chain",6);

  ACE_Message_Block* head = this->head_;
  this->head_ = this->tail_ = 0;
  return head;
}

int OpenDDS::DCPS::BuildChainVisitor::visit_element

(

TransportQueueElement *

element

)

[virtual]

Definition at line 22 of file BuildChainVisitor.cpp.

References DBG_ENTRY_LVL, head_, OpenDDS::DCPS::TransportQueueElement::msg(), and tail_.

{
  DBG_ENTRY_LVL("BuildChainVisitor","visit_element",6);

  if (this->head_ == 0) {
    // This is the first element that we have visited.
    this->head_ = element->msg()->duplicate();
    this->tail_ = this->head_;

    while (this->tail_->cont() != 0) {
      this->tail_ = this->tail_->cont();
    }

  } else {
    // This is not the first element that we have visited.
    this->tail_->cont(element->msg()->duplicate());

    while (this->tail_->cont() != 0) {
      this->tail_ = this->tail_->cont();
    }
  }

  // Visit entire queue.
  return 1;
}

---

Member Data Documentation

ACE_Message_Block* OpenDDS::DCPS::BuildChainVisitor::head_ [private]

Definition at line 37 of file BuildChainVisitor.h.

Referenced by chain(), and visit_element().

ACE_Message_Block* OpenDDS::DCPS::BuildChainVisitor::tail_ [private]

Definition at line 38 of file BuildChainVisitor.h.

Referenced by chain(), and visit_element().

---

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

• BuildChainVisitor.h
• BuildChainVisitor.cpp
• BuildChainVisitor.inl

---