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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
|
#ifndef guard_unbounded_octet_sequence_hpp
#define guard_unbounded_octet_sequence_hpp
/**
* @file
*
* @brief Implement octet sequences
*
* $Id$
*
* @author Johnny Willemsen
*/
#include "tao/orbconf.h"
#include "tao/Unbounded_Value_Sequence_T.h"
#if (TAO_NO_COPY_OCTET_SEQUENCES == 1)
#include "tao/Unbounded_Value_Allocation_Traits_T.h"
#include "tao/Value_Traits_T.h"
#include "tao/Range_Checking_T.h"
#include "tao/Basic_Types.h"
#include "ace/Message_Block.h"
#include "ace/OS_Memory.h"
#include "ace/OS_NS_string.h"
TAO_BEGIN_VERSIONED_NAMESPACE_DECL
namespace TAO
{
template<>
class unbounded_value_sequence<CORBA::Octet>
{
public:
typedef CORBA::Octet value_type;
typedef CORBA::Octet element_type;
typedef CORBA::Octet const const_value_type;
typedef value_type & subscript_type;
typedef value_type const & const_subscript_type;
typedef details::unbounded_value_allocation_traits<value_type,true> allocation_traits;
typedef details::value_traits<value_type,true> element_traits;
typedef details::generic_sequence<value_type, allocation_traits, element_traits> implementation_type;
typedef details::range_checking<value_type,true> range;
inline unbounded_value_sequence<CORBA::Octet>()
: maximum_ (allocation_traits::default_maximum())
, length_ (0)
, buffer_ (allocation_traits::default_buffer_allocation())
, release_ (true)
, mb_ (0)
{}
inline explicit unbounded_value_sequence<CORBA::Octet>(CORBA::ULong maximum)
: maximum_(maximum)
, length_(0)
, buffer_(allocbuf(maximum_))
, release_(true)
, mb_ (0)
{}
inline unbounded_value_sequence<CORBA::Octet>(
CORBA::ULong maximum,
CORBA::ULong length,
value_type * data,
CORBA::Boolean release = false)
: maximum_ (maximum),
length_ (length),
buffer_ (data),
release_ (release),
mb_ (0)
{}
inline ~unbounded_value_sequence<CORBA::Octet>() {
if (mb_)
ACE_Message_Block::release (mb_);
if (release_)
freebuf(buffer_);
}
/// Create a sequence of octets from a single message block (i.e. it
/// ignores any chaining in the meesage block).
inline unbounded_value_sequence<CORBA::Octet> (CORBA::ULong length,
const ACE_Message_Block* mb)
: maximum_ (length)
, length_ (length)
, buffer_ (reinterpret_cast <CORBA::Octet *>(mb->rd_ptr ()))
, release_ (false)
, mb_(0) {
// Get the message block flags.
ACE_Message_Block::Message_Flags const flg = mb->self_flags ();
// If the DONT_DELETE flag is disabled just a duplicate would
// help. If the DONT_DELETE flag is enabled a deep copy is needed as
// the contents would be on stack. Just incrementing the ref count
// on the stack based data block would only crash the program when
// the stack unwinds
if (ACE_BIT_DISABLED (flg,
ACE_Message_Block::DONT_DELETE))
{
this->mb_ = ACE_Message_Block::duplicate (mb);
}
else
{
// As we are in CORBA mode, all the data blocks would be aligned
// on an 8 byte boundary
ACE_Message_Block msgb (*mb,
ACE_CDR::MAX_ALIGNMENT);
// Get the base pointer of the incoming message block
char *start = ACE_ptr_align_binary (mb->base (),
ACE_CDR::MAX_ALIGNMENT);
// Get the read and write displacements in the incoming stream
size_t const rd_pos = mb->rd_ptr () - start;
size_t const wr_pos = mb->wr_ptr () - start;
this->mb_ = ACE_Message_Block::duplicate (&msgb);
this->mb_->rd_ptr (rd_pos);
this->mb_->wr_ptr (wr_pos);
}
}
inline CORBA::ULong maximum() const {
return maximum_;
}
inline CORBA::Boolean release() const {
return release_;
}
inline CORBA::ULong length() const {
return length_;
}
inline void length(CORBA::ULong length) {
if (length <= maximum_ || length <= length_)
{
if (this->mb_ == 0)
{
if (length_ < length)
{
// TODO This code does not provide the strong-exception
// guarantee, but it does provide the weak-exception
// guarantee. The problem would appear when
// initialize_range() raises an exception after several
// elements have been modified. One could argue that
// this problem is irrelevant, as the elements already
// modified are unreachable to conforming applications.
element_traits::initialize_range(
buffer_ + length_, buffer_ + length);
}
length_ = length;
}
else
{
unbounded_value_sequence<CORBA::Octet> tmp(length);
tmp.length_ = length;
element_traits::copy_range(
buffer_, buffer_ + length, tmp.buffer_);
swap(tmp);
}
return;
}
unbounded_value_sequence<CORBA::Octet> tmp(length);
tmp.length_ = length;
element_traits::copy_range(
buffer_, buffer_ + length_, tmp.buffer_);
element_traits::initialize_range(
tmp.buffer_ + length_, tmp.buffer_ + length);
swap(tmp);
}
inline value_type const & operator[](CORBA::ULong i) const {
range::check(i, length_, maximum_, "operator[]() const");
return buffer_[i];
}
inline value_type & operator[](CORBA::ULong i) {
range::check(i, length_, maximum_, "operator[]() non-const");
return buffer_[i];
}
inline void replace(
CORBA::ULong maximum,
CORBA::ULong length,
value_type * data,
CORBA::Boolean release = false) {
unbounded_value_sequence<CORBA::Octet> tmp(maximum, length, data, release);
swap(tmp);
}
inline value_type const * get_buffer() const {
if (buffer_ == 0)
{
buffer_ = allocbuf(maximum_);
}
return buffer_;
}
inline value_type * get_buffer(CORBA::Boolean orphan = false) {
if (orphan && !release_)
{
return 0;
}
if (buffer_ == 0)
{
buffer_ = allocbuf(maximum_);
}
if (!orphan)
{
return buffer_;
}
unbounded_value_sequence<CORBA::Octet> tmp;
swap(tmp);
tmp.release_ = false;
return tmp.buffer_;
}
// moved inside the class to resolve namespace lookup issues.
// This is a replacement for the commented block below.
inline bool operator== (const unbounded_value_sequence<CORBA::Octet> & rhs) const
{
::CORBA::ULong const rlen = rhs.length ();
if (rlen != this->length ())
{
return false;
}
for (::CORBA::ULong i = 0; i < rlen; ++i)
{
if (rhs[i] != this->buffer_[i])
{
return false;
}
}
return true;
}
inline bool operator!= (const unbounded_value_sequence<CORBA::Octet> & rhs) const
{
return !this->operator==(rhs);
}
inline void swap(unbounded_value_sequence & rhs) throw() {
std::swap (mb_, rhs.mb_);
std::swap (maximum_, rhs.maximum_);
std::swap (length_, rhs.length_);
std::swap (buffer_, rhs.buffer_);
std::swap (release_, rhs.release_);
}
static value_type * allocbuf(CORBA::ULong maximum) {
return allocation_traits::allocbuf(maximum);
}
static void freebuf(value_type * buffer) {
allocation_traits::freebuf(buffer);
}
/// Returns the underlying message block, the caller must *not*
/// release the copy.
inline ACE_Message_Block* mb (void) const {
return mb_;
}
/// Replaces the current buffer with <mb>, using only <length> bytes.
/// It takes a duplicate of <mb> so the user still owns it.
inline void replace (CORBA::ULong length, const ACE_Message_Block* mb) {
unbounded_value_sequence<CORBA::Octet> s (length, mb);
swap (s);
}
unbounded_value_sequence<CORBA::Octet> (
const unbounded_value_sequence<CORBA::Octet> &rhs)
: maximum_ (0)
, length_ (0)
, buffer_(0)
, release_(false)
, mb_ (0)
{
unbounded_value_sequence<CORBA::Octet> tmp(rhs.maximum_);
tmp.length_ = rhs.length_;
if (rhs.mb_ == 0)
{
ACE_OS::memcpy (tmp.buffer_,
rhs.buffer_,
rhs.length_);
}
else
{
size_t offset = 0;
for (const ACE_Message_Block *i = rhs.mb_; i != 0; i = i->cont ())
{
ACE_OS::memcpy (tmp.buffer_ + offset,
i->rd_ptr (),
i->length ());
offset += i->length ();
}
}
swap(tmp);
}
unbounded_value_sequence<CORBA::Octet> &
operator= (const unbounded_value_sequence<CORBA::Octet> & rhs)
{
unbounded_value_sequence<CORBA::Octet> tmp(rhs);
swap(tmp);
return * this;
}
private:
/// The maximum number of elements the buffer can contain.
CORBA::ULong maximum_;
/// The current number of elements in the buffer.
CORBA::ULong length_;
/// The buffer with all the elements, casting must be done in derived
/// classes.
mutable value_type * buffer_;
/// If true then the sequence should release the buffer when it is
/// destroyed.
CORBA::Boolean release_;
ACE_Message_Block* mb_;
};
} // namespace TAO
TAO_END_VERSIONED_NAMESPACE_DECL
#endif /* TAO_NO_COPY_OCTET_SEQUENCES == 1 */
#if 0
// This doesn't work for an unexplained reason. At least
// PortableServer::Active_Object_Map.cpp fails to compile.
// But I'm keeping this in for the moment so that it may be
// resurrected if need be
inline
bool
operator== (const TAO_VERSIONED_NAMESPACE_NAME::TAO::unbounded_value_sequence<CORBA::Octet> & lhs,
const TAO_VERSIONED_NAMESPACE_NAME::TAO::unbounded_value_sequence<CORBA::Octet> & rhs)
{
::CORBA::ULong const rlen = rhs.length ();
if (rlen != lhs.length ())
{
return false;
}
for (::CORBA::ULong i = 0; i < rlen; ++i)
{
if (rhs[i] != lhs[i])
{
return false;
}
}
return true;
}
inline
bool
operator!= (const TAO_VERSIONED_NAMESPACE_NAME::TAO::unbounded_value_sequence<CORBA::Octet> & lhs,
const TAO_VERSIONED_NAMESPACE_NAME::TAO::unbounded_value_sequence<CORBA::Octet> & rhs)
{
return !(lhs == rhs);
}
#endif /* 0 */
#endif // guard_unbounded_octet_sequence_hpp
|