/usr/include/xercesc/util/NameIdPool.c is in libxerces-c2-dev 2.8.0+deb1-3build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (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.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* $Id: NameIdPool.c 568078 2007-08-21 11:43:25Z amassari $
*/
// ---------------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------------
#if defined(XERCES_TMPLSINC)
#include <xercesc/util/NameIdPool.hpp>
#endif
#include <xercesc/util/IllegalArgumentException.hpp>
#include <xercesc/util/NoSuchElementException.hpp>
#include <xercesc/util/RuntimeException.hpp>
#include <new>
#include <assert.h>
XERCES_CPP_NAMESPACE_BEGIN
// ---------------------------------------------------------------------------
// NameIdPoolBucketElem: Constructors and Destructor
// ---------------------------------------------------------------------------
template <class TElem> NameIdPoolBucketElem<TElem>::
NameIdPoolBucketElem(TElem* const value
, NameIdPoolBucketElem<TElem>* const next) :
fData(value)
, fNext(next)
{
}
template <class TElem> NameIdPoolBucketElem<TElem>::~NameIdPoolBucketElem()
{
// Nothing to do
}
// ---------------------------------------------------------------------------
// NameIdPool: Constructors and Destructor
// ---------------------------------------------------------------------------
template <class TElem>
NameIdPool<TElem>::NameIdPool( const unsigned int hashModulus
, const unsigned int initSize
, MemoryManager* const manager) :
fMemoryManager(manager)
, fBucketList(0)
, fIdPtrs(0)
, fIdPtrsCount(initSize)
, fIdCounter(0)
, fHashModulus(hashModulus)
{
if (!fHashModulus)
ThrowXMLwithMemMgr(IllegalArgumentException, XMLExcepts::Pool_ZeroModulus, fMemoryManager);
// Allocate the bucket list and zero them
fBucketList = (NameIdPoolBucketElem<TElem>**) fMemoryManager->allocate
(
fHashModulus * sizeof(NameIdPoolBucketElem<TElem>*)
); //new NameIdPoolBucketElem<TElem>*[fHashModulus];
memset(fBucketList, 0, sizeof(fBucketList[0]) * fHashModulus);
//
// Allocate the initial id pointers array. We don't have to zero them
// out since the fIdCounter value tells us which ones are valid. The
// zeroth element is never used (and represents an invalid pool id.)
//
if (!fIdPtrsCount)
fIdPtrsCount = 256;
fIdPtrs = (TElem**) fMemoryManager->allocate
(
fIdPtrsCount * sizeof(TElem*)
); //new TElem*[fIdPtrsCount];
fIdPtrs[0] = 0;
}
template <class TElem> NameIdPool<TElem>::~NameIdPool()
{
//
// Delete the id pointers list. The stuff it points to will be cleaned
// up when we clean the bucket lists.
//
fMemoryManager->deallocate(fIdPtrs); //delete [] fIdPtrs;
// Remove all elements then delete the bucket list
removeAll();
fMemoryManager->deallocate(fBucketList); //delete [] fBucketList;
}
// ---------------------------------------------------------------------------
// NameIdPool: Element management
// ---------------------------------------------------------------------------
template <class TElem> bool
NameIdPool<TElem>::containsKey(const XMLCh* const key) const
{
unsigned int hashVal;
const NameIdPoolBucketElem<TElem>* findIt = findBucketElem(key, hashVal);
return (findIt != 0);
}
template <class TElem> void NameIdPool<TElem>::removeAll()
{
if (fIdCounter == 0) return;
// Clean up the buckets first
for (unsigned int buckInd = 0; buckInd < fHashModulus; buckInd++)
{
NameIdPoolBucketElem<TElem>* curElem = fBucketList[buckInd];
NameIdPoolBucketElem<TElem>* nextElem;
while (curElem)
{
// Save the next element before we hose this one
nextElem = curElem->fNext;
delete curElem->fData;
// destructor is empty...
// curElem->~NameIdPoolBucketElem();
fMemoryManager->deallocate(curElem);
curElem = nextElem;
}
// Empty out the bucket
fBucketList[buckInd] = 0;
}
// Reset the id counter
fIdCounter = 0;
}
// ---------------------------------------------------------------------------
// NameIdPool: Getters
// ---------------------------------------------------------------------------
template <class TElem> TElem*
NameIdPool<TElem>::getByKey(const XMLCh* const key)
{
unsigned int hashVal;
NameIdPoolBucketElem<TElem>* findIt = findBucketElem(key, hashVal);
if (!findIt)
return 0;
return findIt->fData;
}
template <class TElem> const TElem*
NameIdPool<TElem>::getByKey(const XMLCh* const key) const
{
unsigned int hashVal;
const NameIdPoolBucketElem<TElem>* findIt = findBucketElem(key, hashVal);
if (!findIt)
return 0;
return findIt->fData;
}
template <class TElem> TElem*
NameIdPool<TElem>::getById(const unsigned int elemId)
{
// If its either zero or beyond our current id, its an error
if (!elemId || (elemId > fIdCounter))
ThrowXMLwithMemMgr(IllegalArgumentException, XMLExcepts::Pool_InvalidId, fMemoryManager);
return fIdPtrs[elemId];
}
template <class TElem>
const TElem* NameIdPool<TElem>::getById(const unsigned int elemId) const
{
// If its either zero or beyond our current id, its an error
if (!elemId || (elemId > fIdCounter))
ThrowXMLwithMemMgr(IllegalArgumentException, XMLExcepts::Pool_InvalidId, fMemoryManager);
return fIdPtrs[elemId];
}
template <class TElem>
MemoryManager* NameIdPool<TElem>::getMemoryManager() const
{
return fMemoryManager;
}
// ---------------------------------------------------------------------------
// NameIdPool: Setters
// ---------------------------------------------------------------------------
template <class TElem>
unsigned int NameIdPool<TElem>::put(TElem* const elemToAdopt)
{
// First see if the key exists already. If so, its an error
unsigned int hashVal;
if (findBucketElem(elemToAdopt->getKey(), hashVal))
{
ThrowXMLwithMemMgr1
(
IllegalArgumentException
, XMLExcepts::Pool_ElemAlreadyExists
, elemToAdopt->getKey()
, fMemoryManager
);
}
// Create a new bucket element and add it to the appropriate list
NameIdPoolBucketElem<TElem>* newBucket =
new (fMemoryManager->allocate(sizeof(NameIdPoolBucketElem<TElem>)))
NameIdPoolBucketElem<TElem>(elemToAdopt,fBucketList[hashVal]);
fBucketList[hashVal] = newBucket;
//
// Give this new one the next available id and add to the pointer list.
// Expand the list if that is now required.
//
if (fIdCounter + 1 == fIdPtrsCount)
{
// Create a new count 1.5 times larger and allocate a new array
unsigned int newCount = (unsigned int)(fIdPtrsCount * 1.5);
TElem** newArray = (TElem**) fMemoryManager->allocate
(
newCount * sizeof(TElem*)
); //new TElem*[newCount];
// Copy over the old contents to the new array
memcpy(newArray, fIdPtrs, fIdPtrsCount * sizeof(TElem*));
// Ok, toss the old array and store the new data
fMemoryManager->deallocate(fIdPtrs); //delete [] fIdPtrs;
fIdPtrs = newArray;
fIdPtrsCount = newCount;
}
const unsigned int retId = ++fIdCounter;
fIdPtrs[retId] = elemToAdopt;
// Set the id on the passed element
elemToAdopt->setId(retId);
// Return the id that we gave to this element
return retId;
}
// ---------------------------------------------------------------------------
// NameIdPool: Private methods
// ---------------------------------------------------------------------------
template <class TElem>
NameIdPoolBucketElem<TElem>* NameIdPool<TElem>::
findBucketElem(const XMLCh* const key, unsigned int& hashVal)
{
// Hash the key
hashVal = XMLString::hash(key, fHashModulus, fMemoryManager);
assert(hashVal < fHashModulus);
// Search that bucket for the key
NameIdPoolBucketElem<TElem>* curElem = fBucketList[hashVal];
while (curElem)
{
if (XMLString::equals(key, curElem->fData->getKey()))
return curElem;
curElem = curElem->fNext;
}
return 0;
}
template <class TElem>
const NameIdPoolBucketElem<TElem>* NameIdPool<TElem>::
findBucketElem(const XMLCh* const key, unsigned int& hashVal) const
{
// Hash the key
hashVal = XMLString::hash(key, fHashModulus, fMemoryManager);
assert(hashVal < fHashModulus);
// Search that bucket for the key
const NameIdPoolBucketElem<TElem>* curElem = fBucketList[hashVal];
while (curElem)
{
if (XMLString::equals(key, curElem->fData->getKey()))
return curElem;
curElem = curElem->fNext;
}
return 0;
}
// ---------------------------------------------------------------------------
// NameIdPoolEnumerator: Constructors and Destructor
// ---------------------------------------------------------------------------
template <class TElem> NameIdPoolEnumerator<TElem>::
NameIdPoolEnumerator(NameIdPool<TElem>* const toEnum
, MemoryManager* const manager) :
XMLEnumerator<TElem>()
, fCurIndex(0)
, fToEnum(toEnum)
, fMemoryManager(manager)
{
Reset();
}
template <class TElem> NameIdPoolEnumerator<TElem>::
NameIdPoolEnumerator(const NameIdPoolEnumerator<TElem>& toCopy) :
XMLEnumerator<TElem>(toCopy)
, XMemory(toCopy)
, fCurIndex(toCopy.fCurIndex)
, fToEnum(toCopy.fToEnum)
, fMemoryManager(toCopy.fMemoryManager)
{
}
template <class TElem> NameIdPoolEnumerator<TElem>::~NameIdPoolEnumerator()
{
// We don't own the pool being enumerated, so no cleanup required
}
// ---------------------------------------------------------------------------
// NameIdPoolEnumerator: Public operators
// ---------------------------------------------------------------------------
template <class TElem> NameIdPoolEnumerator<TElem>& NameIdPoolEnumerator<TElem>::
operator=(const NameIdPoolEnumerator<TElem>& toAssign)
{
if (this == &toAssign)
return *this;
fMemoryManager = toAssign.fMemoryManager;
fCurIndex = toAssign.fCurIndex;
fToEnum = toAssign.fToEnum;
return *this;
}
// ---------------------------------------------------------------------------
// NameIdPoolEnumerator: Enum interface
// ---------------------------------------------------------------------------
template <class TElem> bool NameIdPoolEnumerator<TElem>::
hasMoreElements() const
{
// If our index is zero or past the end, then we are done
if (!fCurIndex || (fCurIndex > fToEnum->fIdCounter))
return false;
return true;
}
template <class TElem> TElem& NameIdPoolEnumerator<TElem>::nextElement()
{
// If our index is zero or past the end, then we are done
if (!fCurIndex || (fCurIndex > fToEnum->fIdCounter))
ThrowXMLwithMemMgr(NoSuchElementException, XMLExcepts::Enum_NoMoreElements, fMemoryManager);
// Return the current element and bump the index
return *fToEnum->fIdPtrs[fCurIndex++];
}
template <class TElem> void NameIdPoolEnumerator<TElem>::Reset()
{
//
// Find the next available bucket element in the pool. We use the id
// array since its very easy to enumerator through by just maintaining
// an index. If the id counter is zero, then its empty and we leave the
// current index to zero.
//
fCurIndex = fToEnum->fIdCounter ? 1:0;
}
template <class TElem> int NameIdPoolEnumerator<TElem>::size() const
{
return fToEnum->fIdCounter;
}
XERCES_CPP_NAMESPACE_END
|