dep/ACE_wrappers/ace/Intrusive_List.cpp

   1 // $Id: Intrusive_List.cpp 80826 2008-03-04 14:51:23Z wotte $
   2
   3 #ifndef ACE_INTRUSIVE_LIST_CPP
   4 #define ACE_INTRUSIVE_LIST_CPP
   5
   6 #include "ace/Intrusive_List.h"
   7
   8 #if !defined (ACE_LACKS_PRAGMA_ONCE)
   9 # pragma once
  10 #endif /* ACE_LACKS_PRAGMA_ONCE */
  11
  12 #if !defined (__ACE_INLINE__)
  13 #include "ace/Intrusive_List.inl"
  14 #endif /* __ACE_INLINE__ */
  15
  16 ACE_BEGIN_VERSIONED_NAMESPACE_DECL
  17
  18 template <class T>
  19 ACE_Intrusive_List<T>::ACE_Intrusive_List (void)
  20   : head_ (0)
  21   , tail_ (0)
  22 {
  23 }
  24
  25 template<class T>
  26 ACE_Intrusive_List<T>::~ACE_Intrusive_List (void)
  27 {
  28 }
  29
  30 template<class T> void
  31 ACE_Intrusive_List<T>::push_back (T *node)
  32 {
  33   if (this->tail_ == 0)
  34     {
  35       this->tail_ = node;
  36       this->head_ = node;
  37       node->next (0);
  38       node->prev (0);
  39       return;
  40     }
  41
  42   this->tail_->next (node);
  43   node->prev (this->tail_);
  44   node->next (0);
  45   this->tail_ = node;
  46 }
  47
  48 template<class T> void
  49 ACE_Intrusive_List<T>::push_front (T *node)
  50 {
  51   if (this->head_ == 0)
  52     {
  53       this->tail_ = node;
  54       this->head_ = node;
  55       node->next (0);
  56       node->prev (0);
  57       return;
  58     }
  59
  60   this->head_->prev (node);
  61   node->next (this->head_);
  62   node->prev (0);
  63   this->head_ = node;
  64 }
  65
  66 template<class T> T *
  67 ACE_Intrusive_List<T>::pop_front (void)
  68 {
  69   T *node = this->head_;
  70   if (node == 0)
  71     return 0;
  72   this->unsafe_remove (node);
  73   return node;
  74 }
  75
  76 template<class T> T *
  77 ACE_Intrusive_List<T>::pop_back (void)
  78 {
  79   T *node = this->tail_;
  80   if (node == 0)
  81     return 0;
  82   this->unsafe_remove (node);
  83   return node;
  84 }
  85
  86 template<class T> void
  87 ACE_Intrusive_List<T>::remove (T *node)
  88 {
  89   for (T *i = this->head_; i != 0; i = i->next ())
  90     {
  91       if (node == i)
  92         {
  93           this->unsafe_remove (node);
  94           return;
  95         }
  96     }
  97 }
  98
  99 template<class T> void
 100 ACE_Intrusive_List<T>::unsafe_remove (T *node)
 101 {
 102   if (node->prev () != 0)
 103     node->prev ()->next (node->next ());
 104   else
 105     this->head_ = node->next ();
 106
 107   if (node->next () != 0)
 108     node->next ()->prev (node->prev ());
 109   else
 110     this->tail_ = node->prev ();
 111
 112   node->next (0);
 113   node->prev (0);
 114 }
 115
 116 #if 0
 117 template<class T> void
 118 ACE_Intrusive_List_Node<T>::check_invariants (void)
 119 {
 120   ACE_ASSERT ((this->next () == 0) || (this->next ()->prev () == this));
 121   ACE_ASSERT ((this->prev () == 0) || (this->prev ()->next () == this));
 122 }
 123
 124 template<class T> void
 125 ACE_Intrusive_List<T>::check_invariants (void)
 126 {
 127   ACE_ASSERT ((this->tail_ == 0) || (this->tail_->next () == 0));
 128   ACE_ASSERT ((this->head_ == 0) || (this->head_->prev () == 0));
 129   ACE_ASSERT (!((this->head_ == 0) ^ (this->tail_ == 0)));
 130
 131   int found_tail = 0;
 132   for (T *i = this->head_; i != 0; i = i->next ())
 133     {
 134       if (i == this->tail_)
 135         found_tail = 1;
 136       i->check_invariants ();
 137     }
 138   ACE_ASSERT (this->tail_ == 0 || found_tail == 1);
 139
 140   int found_head = 0;
 141   for (T *j = this->tail_; j != 0; j = j->prev ())
 142     {
 143       if (j == this->head_)
 144         found_head = 1;
 145       j->check_invariants ();
 146     }
 147   ACE_ASSERT (this->head_ == 0 || found_head == 1);
 148 }
 149 #endif /* 0 */
 150
 151 ACE_END_VERSIONED_NAMESPACE_DECL
 152
 153 #endif /* ACE_INTRUSIVE_LIST_CPP */