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
|
// This may look like C, but it's really -*- C++ -*-
// $Id$
// ***************************************************
// Operations on the generic unbounded sequence class.
// ***************************************************
template <class T> ACE_INLINE
TAO_Unbounded_Sequence<T>::TAO_Unbounded_Sequence (void)
{
}
template <class T> ACE_INLINE T *
TAO_Unbounded_Sequence<T>::get_buffer (CORBA::Boolean orphan)
{
if (orphan == CORBA::B_FALSE)
{
// We retain ownership.
if (this->buffer_ == 0)
this->buffer_ = (void *) new T[this->length_];
}
else // if (orphan == CORBA::B_TRUE)
{
if (this->release_ == CORBA::B_FALSE)
// Oops, it's not our buffer to relinquish...
return 0;
else
{
// We set the state back to default and relinquish
// ownership.
this->maximum_ = 0;
this->length_ = 0;
this->buffer_ = 0;
this->release_ = CORBA::B_FALSE;
}
}
return (T *) this->buffer_;
}
template <class T> ACE_INLINE const T *
TAO_Unbounded_Sequence<T>::get_buffer (void) const
{
return (const T *) this->buffer_;
}
template <class T> ACE_INLINE void
TAO_Unbounded_Sequence<T>::replace (CORBA::ULong max,
CORBA::ULong length,
T *data,
CORBA::Boolean release)
{
this->maximum_ = max;
this->length_ = length;
if (this->buffer_ && this->release_ == CORBA::B_TRUE)
TAO_Unbounded_Sequence<T>::freebuf ((T *) this->buffer_);
this->buffer_ = data;
this->release_ = release;
}
template <class T> ACE_INLINE
TAO_Unbounded_Sequence<T>::TAO_Unbounded_Sequence (CORBA::ULong maximum)
: TAO_Unbounded_Base_Sequence (maximum,
TAO_Unbounded_Sequence<T>::allocbuf (maximum))
{
}
template <class T> ACE_INLINE
TAO_Unbounded_Sequence<T>::TAO_Unbounded_Sequence (CORBA::ULong maximum,
CORBA::ULong length,
T *data,
CORBA::Boolean release)
: TAO_Unbounded_Base_Sequence (maximum, length, data, release)
{
}
template <class T> ACE_INLINE T &
TAO_Unbounded_Sequence<T>::operator[] (CORBA::ULong i)
{
ACE_ASSERT (i < this->maximum_);
T* tmp = ACE_reinterpret_cast(T*,this->buffer_);
return tmp[i];
}
template <class T> ACE_INLINE const T &
TAO_Unbounded_Sequence<T>::operator[] (CORBA::ULong i) const
{
ACE_ASSERT (i < this->maximum_);
T * const tmp = ACE_reinterpret_cast (T* ACE_CAST_CONST, this->buffer_);
return tmp[i];
}
template <class T> ACE_INLINE T *
TAO_Unbounded_Sequence<T>::allocbuf (CORBA::ULong size)
{
return new T[size];
}
template <class T> ACE_INLINE void
TAO_Unbounded_Sequence<T>::freebuf (T *buffer)
{
delete [] buffer;
}
// ***************************************************
// operations on the generic Bounded sequence class
// ***************************************************
template <class T, CORBA::ULong MAX> ACE_INLINE T *
TAO_Bounded_Sequence<T, MAX>::get_buffer (CORBA::Boolean orphan)
{
if (orphan == CORBA::B_FALSE)
{
// We retain ownership.
if (this->buffer_ == 0)
this->buffer_ = (void *) new T[this->maximum_];
}
else // if (orphan == CORBA::B_TRUE)
{
if (this->release_ == CORBA::B_FALSE)
// Oops, it's not our buffer to relinquish...
return 0;
else
{
// We set the state back to default and relinquish
// ownership.
this->maximum_ = 0;
this->length_ = 0;
this->buffer_ = 0;
this->release_ = CORBA::B_FALSE;
}
}
return (T *) this->buffer_;
}
template <class T, CORBA::ULong MAX> ACE_INLINE const T *
TAO_Bounded_Sequence<T, MAX>::get_buffer (void) const
{
return (const T *) this->buffer_;
}
template <class T, CORBA::ULong MAX> ACE_INLINE void
TAO_Bounded_Sequence<T, MAX>::replace (CORBA::ULong max,
CORBA::ULong length,
T *data,
CORBA::Boolean release)
{
this->maximum_ = max;
this->length_ = length;
if (this->buffer_ && this->release_ == CORBA::B_TRUE)
TAO_Bounded_Sequence<T, MAX>::freebuf ((T *) this->buffer_);
this->buffer_ = data;
this->release_ = release;
}
template <class T, CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_Sequence<T, MAX>::TAO_Bounded_Sequence (void)
{
}
template <class T, CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_Sequence<T, MAX>::TAO_Bounded_Sequence (CORBA::ULong length,
T *data,
CORBA::Boolean release)
: TAO_Bounded_Base_Sequence (length, MAX, data, release)
{
}
template <class T, CORBA::ULong MAX> ACE_INLINE T &
TAO_Bounded_Sequence<T, MAX>::operator[] (CORBA::ULong i)
{
ACE_ASSERT (i < this->maximum_);
T *tmp = ACE_reinterpret_cast (T*,this->buffer_);
return tmp[i];
}
template <class T, CORBA::ULong MAX> ACE_INLINE const T &
TAO_Bounded_Sequence<T, MAX>::operator[] (CORBA::ULong i) const
{
ACE_ASSERT (i < this->maximum_);
const T* tmp = ACE_reinterpret_cast (const T*,this->buffer_);
return tmp[i];
}
template <class T, CORBA::ULong MAX> ACE_INLINE T *
TAO_Bounded_Sequence<T, MAX>::allocbuf (CORBA::ULong)
{
return new T[MAX];
}
template <class T, CORBA::ULong MAX> ACE_INLINE void
TAO_Bounded_Sequence<T, MAX>::freebuf (T *buffer)
{
delete [] buffer;
}
// *************************************************************
// Inline operations for class TAO_Object_Manager<T>
// *************************************************************
template <class T> ACE_INLINE
TAO_Object_Manager<T>::~TAO_Object_Manager (void)
{
}
template <class T> ACE_INLINE
TAO_Object_Manager<T>::TAO_Object_Manager (const TAO_Object_Manager &rhs)
: ptr_ (rhs.ptr_),
release_ (rhs.release_)
{
}
template <class T> ACE_INLINE
TAO_Object_Manager<T>::TAO_Object_Manager(T** buffer, CORBA::Boolean release)
: ptr_ (buffer),
release_ (release)
{
}
template <class T> ACE_INLINE
TAO_Object_Manager<T>::operator const T* () const // cast
{
return *this->ptr_;
}
template <class T> ACE_INLINE
TAO_Object_Manager<T>::operator T* &() // cast
{
return *this->ptr_;
}
// *************************************************************
// class TAO_Unbounded_Object_Sequence
// *************************************************************
//default constructor
template <class T> ACE_INLINE
TAO_Unbounded_Object_Sequence<T>::TAO_Unbounded_Object_Sequence (void)
{
}
template <class T> ACE_INLINE
TAO_Unbounded_Object_Sequence<T>::
TAO_Unbounded_Object_Sequence (CORBA::ULong maximum,
CORBA::ULong length,
T* *value,
CORBA::Boolean release)
: TAO_Unbounded_Base_Sequence (maximum, length, value, release)
{
}
template <class T> ACE_INLINE TAO_Object_Manager<T>
TAO_Unbounded_Object_Sequence<T>::operator[] (CORBA::ULong index) const
{
ACE_ASSERT (index < this->maximum_);
T ** const tmp = ACE_reinterpret_cast (T ** ACE_CAST_CONST, this->buffer_);
return TAO_Object_Manager<T> (tmp + index, this->release_);
}
// *************************************************************
// class TAO_Bounded_Object_Sequence
// *************************************************************
template<class T, CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_Object_Sequence<T,MAX>::~TAO_Bounded_Object_Sequence (void)
{
this->_deallocate_buffer ();
}
template <class T, CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_Object_Sequence<T,MAX>::
TAO_Bounded_Object_Sequence (CORBA::ULong length,
T **value,
CORBA::Boolean release)
: TAO_Bounded_Base_Sequence (MAX, length, value, release)
{
}
template <class T, CORBA::ULong MAX> ACE_INLINE TAO_Object_Manager<T>
TAO_Bounded_Object_Sequence<T, MAX>::operator[] (CORBA::ULong index) const
{
ACE_ASSERT (index < this->maximum_);
T **const tmp = ACE_reinterpret_cast (T ** ACE_CAST_CONST, this->buffer_);
return TAO_Object_Manager<T> (tmp + index, this->release_);
}
// *************************************************************
// class TAO_Bounded_String_Sequence
// *************************************************************
template<CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_String_Sequence<MAX>::~TAO_Bounded_String_Sequence (void)
{
this->_deallocate_buffer ();
}
template<CORBA::ULong MAX> ACE_INLINE
TAO_Bounded_String_Sequence<MAX>::
TAO_Bounded_String_Sequence (CORBA::ULong length,
char **value,
CORBA::Boolean release)
: TAO_Bounded_Base_Sequence (MAX, length, value, release)
{
}
template<CORBA::ULong MAX> ACE_INLINE TAO_String_Manager
TAO_Bounded_String_Sequence<MAX>::operator[] (CORBA::ULong index) const
{
ACE_ASSERT (index < this->maximum_);
char **const tmp = ACE_reinterpret_cast (char ** ACE_CAST_CONST,
this->buffer_);
return TAO_String_Manager (tmp + index, this->release_);
}
|
