summaryrefslogtreecommitdiff
path: root/ACE/ace/Activation_Queue.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'ACE/ace/Activation_Queue.cpp')
-rw-r--r--ACE/ace/Activation_Queue.cpp135
1 files changed, 135 insertions, 0 deletions
diff --git a/ACE/ace/Activation_Queue.cpp b/ACE/ace/Activation_Queue.cpp
new file mode 100644
index 00000000000..0bad62f3911
--- /dev/null
+++ b/ACE/ace/Activation_Queue.cpp
@@ -0,0 +1,135 @@
+#include "ace/Activation_Queue.h"
+
+#if !defined (__ACE_INLINE__)
+#include "ace/Activation_Queue.inl"
+#endif /* __ACE_INLINE__ */
+
+#include "ace/Log_Msg.h"
+#include "ace/Method_Request.h"
+#include "ace/Malloc_Base.h"
+#include "ace/Time_Value.h"
+
+ACE_RCSID (ace,
+ Activation_Queue,
+ "$Id$")
+
+ACE_BEGIN_VERSIONED_NAMESPACE_DECL
+
+void
+ACE_Activation_Queue::dump (void) const
+{
+#if defined (ACE_HAS_DUMP)
+ ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
+ ACE_DEBUG ((LM_DEBUG,
+ ACE_LIB_TEXT ("delete_queue_ = %d\n"),
+ this->delete_queue_));
+ ACE_DEBUG ((LM_INFO, ACE_LIB_TEXT ("queue_: \n")));
+ if (this->queue_)
+ this->queue_->dump();
+ else
+ ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT ("(NULL)\n")));
+ ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
+#endif /* ACE_HAS_DUMP */
+}
+
+ACE_Activation_Queue::ACE_Activation_Queue (ACE_Message_Queue<ACE_SYNCH> *new_queue,
+ ACE_Allocator *alloc,
+ ACE_Allocator *db_alloc)
+ : delete_queue_ (0)
+ , allocator_(alloc)
+ , data_block_allocator_(db_alloc)
+{
+ if (this->allocator_ == 0)
+ this->allocator_ = ACE_Allocator::instance ();
+
+ if (new_queue)
+ this->queue_ = new_queue;
+ else
+ {
+ ACE_NEW (this->queue_,
+ ACE_Message_Queue<ACE_SYNCH>);
+ this->delete_queue_ = 1;
+ }
+}
+
+void
+ACE_Activation_Queue::queue (ACE_Message_Queue<ACE_SYNCH> *q)
+{
+ // Destroy the internal queue if one exist.
+ if (this->delete_queue_ != 0)
+ {
+ // Destroy the current queue.
+ delete this->queue_;
+
+ // Set the flag to false. NOTE that the delete_queue_ flag is a
+ // flag used to only indicate whether or not if an internal
+ // ACE_Message_Queue has been created, therefore, it will not
+ // affect the user if the user decided to replace the queue with
+ // their own queue no matter how many time they call on this
+ // function.
+ this->delete_queue_ = 0;
+ }
+
+ queue_ = q;
+}
+
+ACE_Activation_Queue::~ACE_Activation_Queue (void)
+{
+ if (this->delete_queue_ != 0)
+ delete this->queue_;
+}
+
+ACE_Method_Request *
+ACE_Activation_Queue::dequeue (ACE_Time_Value *tv)
+{
+ ACE_Message_Block *mb = 0;
+
+ // Dequeue the message.
+ if (this->queue_->dequeue_head (mb, tv) != -1)
+ {
+ // Get the next <Method_Request>.
+ ACE_Method_Request *mr =
+ reinterpret_cast<ACE_Method_Request *> (mb->base ());
+ // Delete the message block.
+ mb->release ();
+ return mr;
+ }
+ else
+ return 0;
+}
+
+int
+ACE_Activation_Queue::enqueue (ACE_Method_Request *mr,
+ ACE_Time_Value *tv)
+{
+ ACE_Message_Block *mb = 0;
+
+ // We pass sizeof (*mr) here so that flow control will work
+ // correctly. Since we also pass <mr> note that no unnecessary
+ // memory is actually allocated -- just the size field is set.
+ ACE_NEW_MALLOC_RETURN (mb,
+ static_cast<ACE_Message_Block *> (this->allocator_->malloc (sizeof (ACE_Message_Block))),
+ ACE_Message_Block (sizeof (*mr), // size
+ ACE_Message_Block::MB_DATA, // type
+ 0, // cont
+ (char *) mr, // data
+ 0, // allocator
+ 0, // locking strategy
+ mr->priority (), // priority
+ ACE_Time_Value::zero, // execution time
+ ACE_Time_Value::max_time, // absolute time of deadline
+ this->data_block_allocator_, // data_block allocator
+ this->allocator_), // message_block allocator
+ -1);
+
+ // Enqueue in priority order.
+ int const result = this->queue_->enqueue_prio (mb, tv);
+
+ // Free ACE_Message_Block if enqueue_prio failed.
+ if (result == -1)
+ ACE_DES_FREE (mb, this->allocator_->free, ACE_Message_Block);
+
+ return result;
+}
+
+ACE_END_VERSIONED_NAMESPACE_DECL