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
|
// $Id$
#if !defined (ACE_CORBA_UTILS_C)
#define ACE_CORBA_UTILS_C
#include "CORBA_Utils_T.h"
#include "ace/Log_Msg.h"
#if !defined (__ACE_INLINE__)
#include "CORBA_Utils_T.i"
#endif /* __ACE_INLINE__ */
template <class TYPE>
ACE_CORBA_Sequence<TYPE>::ACE_CORBA_Sequence (const ACE_CORBA_Sequence<TYPE> &source)
: maximum_ (0),
length_ (0),
buffer_ (0),
release_ (0)
{
(*this) = source;
}
template <class TYPE>
ACE_CORBA_Sequence<TYPE>::ACE_CORBA_Sequence (void)
: maximum_ (0),
length_ (0),
buffer_ (0),
release_ (0)
{
}
template <class TYPE>
ACE_CORBA_Sequence<TYPE>::~ACE_CORBA_Sequence (void)
{
if (release_)
{
this->delete_array (buffer_, maximum_);
}
}
template <class TYPE>
ACE_CORBA_Sequence<TYPE>::ACE_CORBA_Sequence (CORBA::ULong max)
: maximum_ (max),
length_ (0),
buffer_ (0),
release_ (0)
{
if (maximum_ > 0)
{
buffer_ = this->new_array (maximum_);
release_ = 1;
}
}
template <class TYPE> TYPE *
ACE_CORBA_Sequence<TYPE>::new_array (size_t len)
{
return new TYPE[len];
}
template <class TYPE> void
ACE_CORBA_Sequence<TYPE>::delete_array (TYPE *buf, size_t)
{
delete [] buf;
}
template <class TYPE>
ACE_CORBA_Sequence<TYPE>::ACE_CORBA_Sequence (CORBA::ULong max,
CORBA::ULong length,
TYPE* data,
CORBA::Boolean release)
: maximum_ (max),
length_ (length),
buffer_ (data),
release_ (release)
{
if ((buffer_ == 0) && (max > 0))
{
// @@ What should we do here?
errno = ENOMEM;
ACE_ERROR ((LM_ERROR, "No memory.\n"));
}
}
// @@ This makes a deep copy, dig?
template <class TYPE> ACE_CORBA_Sequence<TYPE> &
ACE_CORBA_Sequence<TYPE>::operator= (const ACE_CORBA_Sequence<TYPE> &source)
{
if (source.length () > 0)
{
// If our buffer is too small, release it and allocate one just big
// enough. If buffer_ == 0, this works fine.
if (this->maximum () < source.length ())
{
if (release_)
{
this->delete_array (buffer_, maximum_);
}
maximum_ = source.length ();
buffer_ = this->new_array (maximum_);
release_ = 1;
}
// Copy each of the items from the source.
for (CORBA::ULong index=0; index < source.length (); index++)
(*this)[index] = source[index];
this->length (source.length ());
}
return *this;
}
template <class TYPE> void
ACE_CORBA_Sequence<TYPE>::length (CORBA::ULong len)
{
if (len > maximum_)
{
// Allocate the space that we need.
TYPE* tmp = this->new_array (len);
// Copy over the old sequence.
for (int i = 0; i < maximum_; ++i)
{
tmp[i] = buffer_[i];
}
if (release_)
{
this->delete_array (buffer_, maximum_);
}
buffer_ = tmp;
release_ = 1;
maximum_ = len;
// The destructor of -old- will release the old buffer_ if
// necessary.
}
length_ = len;
}
// g++ can't handle these operator [] functions if they're inline
template <class TYPE> TYPE&
ACE_CORBA_Sequence<TYPE>::operator [] (CORBA::ULong i)
{
// @@ Should we do bounds checking?
if (i >= maximum_)
{
ACE_ERROR ((LM_ERROR, "Trying to write past maximum.\n"));
return buffer_[maximum_ - 1];
}
else
return buffer_[i];
}
template <class TYPE> const TYPE&
ACE_CORBA_Sequence<TYPE>::operator [] (CORBA::ULong i) const
{
if (i >= length_)
{
ACE_ERROR ((LM_ERROR, "Trying to read past length.\n"));
return buffer_[length_ - 1];
}
return buffer_[i];
}
// ********************
/*
template <class TYPE> void
dump (const ACE_CORBA_Sequence<TYPE> &seq)
{
for (CORBA::ULong index=0; index < seq.length (); index++)
dump (seq[index]);
}
*/
/*
template <class TYPE> ACE_INLINE void
operator += (ACE_CORBA_Sequence<TYPE> &seq,
const TYPE &item)
{
CORBA::ULong length = seq.length ();
seq.length (length + 1);
seq[length] = item;
}
*/
template <class TYPE> ACE_INLINE void
operator += (ACE_CORBA_Sequence<TYPE> &dest,
const ACE_CORBA_Sequence<TYPE> &source)
{
int old_length = dest.length ();
int new_length = old_length + source.length ();
dest.length (new_length);
int difference = new_length - old_length;
for (int x=0; x < difference; x++)
dest[old_length + x] = source[x];
}
/*
template <class TYPE> ACE_INLINE void
remove_item (TYPE &seq, CORBA::ULong index)
{
int new_length = seq.length () - 1;
// Shift the set back one, starting at <index>.
for (int x = index; x < new_length; x++)
seq[x] = seq[x+1];
// Set the new length.
seq.length (new_length);
}
*/
// ************************************************************
// ************************************************************
// ************************************************************
template<class TYPE>
ACE_CORBA_var<TYPE>::ACE_CORBA_var (const ACE_CORBA_var<TYPE> &source)
{
if (source.me_ != 0)
me_ = (TYPE *) source.me_->_duplicate ();
// CORBA::duplicate (source.me_);
}
template<class TYPE>
ACE_CORBA_var<TYPE>::ACE_CORBA_var (void)
: me_ (0)
{
}
template<class TYPE>
ACE_CORBA_var<TYPE>::ACE_CORBA_var (TYPE *source)
{
me_ = (TYPE *) source->_duplicate ();
// CORBA::duplicate (source);
}
template<class TYPE>
ACE_CORBA_var<TYPE>::~ACE_CORBA_var (void)
{
if (me_ != 0)
me_->_release ();
//CORBA::release (me_);
}
template<class TYPE> ACE_CORBA_var<TYPE> &
ACE_CORBA_var<TYPE>::operator= (TYPE *source)
{
if (me_ != source &&
me_ != 0)
me_->_release ();
//CORBA::release (me_);
me_ = (TYPE *) source->_duplicate ();
// CORBA::duplicate (source);
return *this;
}
template<class TYPE> ACE_CORBA_var<TYPE> &
ACE_CORBA_var<TYPE>::operator= (const ACE_CORBA_var<TYPE> &source)
{
if (me_ != source.me_ &&
me_ != 0)
me_->_release ();
// CORBA::release (me_);
me_ = (TYPE *) source.me_->_duplicate ();
// CORBA::duplicate (source.me_);
return *this;
}
template<class TYPE> TYPE *
ACE_CORBA_var<TYPE>::operator->(void)
{
return me_;
}
template<class TYPE>
ACE_CORBA_var<TYPE>::operator TYPE *(void) const
{
return me_;
}
/*
template<class TYPE>
ACE_CORBA_var<TYPE>::operator TYPE *&(void)
{
return me_;
}
*/
template<class TYPE>
ACE_CORBA_var<TYPE>::operator TYPE &(void) const
{
return *me_;
}
// ************************************************************
// ************************************************************
/*
ACE_CORBA_Object_Ref<IMPL>::ACE_CORBA_Object_Ref (void)
: impl_ (0)
{
}
ACE_CORBA_Object_Ref<IMPL>::ACE_CORBA_Object_Ref (IMPL *impl)
: impl_ (impl)
{
}
ACE_CORBA_Object_Ref<IMPL>::~ACE_CORBA_Object_Ref (void)
: impl_ (0)
{
}
ACE_CORBA_Object_Ref<IMPL> &
ACE_CORBA_Object_Ref<IMPL>::operator= (const ACE_CORBA_Object_Ref<IMPL> &source)
{
return *this;
}
IMPL *
ACE_CORBA_Object_Ref<IMPL>::operator->(void)
{
return impl_;
}
IMPL *
ACE_CORBA_Object_Ref<IMPL>::operator IMPL *(void)
{
return impl_;
}
ACE_CORBA_Object_Ref<IMPL> *
ACE_CORBA_Object_Ref<IMPL>::_duplicate (ACE_CORBA_Object_Ref<IMPL> *source)
{
source->ref_count_++;
return source;
}
*/
#endif /* ACE_CORBA_UTILS_C */
|
