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
|
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Mozilla Transaction Manager.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corp.
* Portions created by the Initial Developer are Copyright (C) 2003
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* John Gaunt <jgaunt@netscape.com>
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#include <stdlib.h>
#include "tmVector.h"
#ifdef VBOX_USE_IPRT_IN_XPCOM
# include <iprt/mem.h>
#endif
////////////////////////////////////////////////////////////////////////////
// Constructor(s) & Destructor
// can not be responsible for reclaiming memory pointed to by the void*s in
// the collection - how would we reclaim, don't know how they were allocated
tmVector::~tmVector() {
if (mElements)
#ifdef VBOX_USE_IPRT_IN_XPCOM
RTMemFree((void*)mElements);
#else
free((void*)mElements);
#endif
}
///////////////////////////////////////////////////////////////////////////////
// Public Member Functions
nsresult
tmVector::Init() {
#ifdef VBOX_USE_IPRT_IN_XPCOM
mElements = (void**) RTMemAllocZ (mCapacity * sizeof(void*));
#else
mElements = (void**) calloc (mCapacity, sizeof(void*));
#endif
if (!mElements)
return NS_ERROR_OUT_OF_MEMORY;
return NS_OK;
}
///////////////////////////////////////////////////////////////////////////////
// mutators
PRInt32
tmVector::Append(void *aElement){
PR_ASSERT(aElement);
// make sure there is room
if (mNext == mCapacity)
if (NS_FAILED(Grow()))
return -1;
// put the element in the array
mElements[mNext] = aElement;
mCount++;
// encapsulates the index into a success value
return mNext++; // post increment.
}
void
tmVector::Remove(void *aElement) {
PR_ASSERT(aElement);
for (PRUint32 index = 0; index < mNext; index++) {
if (mElements[index] == aElement) {
mElements[index] = nsnull;
mCount--;
if (index == mNext-1) { // if we removed the last element
mNext--;
// don't test for success of the shrink
Shrink();
}
}
}
}
void
tmVector::RemoveAt(PRUint32 aIndex) {
PR_ASSERT(aIndex < mNext);
// remove the element if it isn't already nsnull
if (mElements[aIndex] != nsnull) {
mElements[aIndex] = nsnull;
mCount--;
if (aIndex == mNext-1) { // if we removed the last element
mNext--;
// don't test for success of the shrink
Shrink();
}
}
}
//void*
//tmVector::operator[](int index) {
// if (index < mNext && index >= 0)
// return mElements[index];
// return nsnull;
//}
// Does not delete any of the data, merely removes references to them
void
tmVector::Clear(){
memset(mElements, 0, mCapacity);
mCount = 0;
mNext = 0;
}
//////////////////////////////////////////////////////////////////////////////
// Protected Member Functions
// increases the capacity by the growth increment
nsresult
tmVector::Grow() {
PRUint32 newcap = mCapacity + GROWTH_INC;
#ifdef VBOX_USE_IPRT_IN_XPCOM
mElements = (void**) RTMemRealloc(mElements, (newcap * sizeof(void*)));
#else
mElements = (void**) realloc(mElements, (newcap * sizeof(void*)));
#endif
if (mElements) {
mCapacity = newcap;
return NS_OK;
}
return NS_ERROR_FAILURE;
}
// reduces the capacity by the growth increment. leaves room
// for one more add before needing to Grow().
nsresult
tmVector::Shrink() {
PRUint32 newcap = mCapacity - GROWTH_INC;
if (mNext < newcap) {
#ifdef VBOX_USE_IPRT_IN_XPCOM
mElements = (void**) RTMemRealloc(mElements, newcap * sizeof(void*));
#else
mElements = (void**) realloc(mElements, newcap * sizeof(void*));
#endif
if (!mElements)
return NS_ERROR_OUT_OF_MEMORY;
mCapacity = newcap;
}
return NS_OK;
}
|
