blob: 910af84ab26665b6824d54169a53b0744fc39bc6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
#include "Incoming_Message_Queue.h"
#include "ORB_Core.h"
#include "debug.h"
#if !defined (__ACE_INLINE__)
# include "Incoming_Message_Queue.inl"
#endif /* __ACE_INLINE__ */
ACE_RCSID (tao, Incoming_Message_Queue, "$Id$")
TAO_Incoming_Message_Queue::TAO_Incoming_Message_Queue (TAO_ORB_Core *orb_core)
: queued_data_ (0),
size_ (0),
orb_core_ (orb_core)
{
}
TAO_Incoming_Message_Queue::~TAO_Incoming_Message_Queue (void)
{
// Need to delete all the unused data-blocks
}
int
TAO_Incoming_Message_Queue::add_message (ACE_Message_Block *incoming,
ssize_t missing_data,
CORBA::Octet byte_order)
{
// Allocate memory for TAO_Queued_Data
TAO_Queued_Data *qd = this->get_node ();
if (qd == 0)
{
if (TAO_debug_level > 0)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("TAO (%P|%t) Could not make a node \n")));
}
return -1;
}
// Set the data block
qd->msg_block_ = incoming;
// Set the byte_order
qd->byte_order_ = byte_order;
qd->missing_data_ = missing_data;
this->add_node (qd);
// increment the size of the list
++this->size_;
return 1;
}
void
TAO_Incoming_Message_Queue::copy_message (ACE_Message_Block &block)
{
if (this->size_ > 0)
{
size_t n = 0;
if (block.length () <= this->queued_data_->missing_data_)
{
n = block.length ();
}
else
{
n = this->queued_data_->missing_data_;
}
this->queued_data_->msg_block_->copy (block.rd_ptr (),
n);
this->queued_data_->missing_data_ -= n;
}
}
ACE_Message_Block *
TAO_Incoming_Message_Queue::dequeue_head (CORBA::Octet &byte_order)
{
TAO_Queued_Data *tmp =
this->queued_data_->next_;
if (tmp->missing_data_ != 0)
return 0;
ACE_Message_Block *db =
tmp->msg_block_;
this->queued_data_->next_ = tmp->next_;
byte_order = tmp->byte_order_;
delete tmp;
// Decrease the size
--this->size_;
return db;
}
int
TAO_Incoming_Message_Queue::add_node (
TAO_Incoming_Message_Queue::TAO_Queued_Data *nd)
{
if (this->size_ == 0)
{
this->queued_data_ = nd;
this->queued_data_->next_ = this->queued_data_;
}
else
{
nd->next_ = this->queued_data_->next_;
this->queued_data_->next_ = nd;
this->queued_data_ = nd;
}
return 0;
}
|