OAM项目中用到的源代码

/* * Copyright 2001-2002,2004 The Apache Software Foundation. * * Licensed 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: DOMDeepNodeListPool.c,v 1.11 2004/09/08 13:55:51 peiyongz Exp $ */ // --------------------------------------------------------------------------- // Include // --------------------------------------------------------------------------- #include <xercesc/util/XercesDefs.hpp> #if defined(XERCES_TMPLSINC) #include <xercesc/dom/impl/DOMDeepNodeListPool.hpp> #endif XERCES_CPP_NAMESPACE_BEGIN // --------------------------------------------------------------------------- // DOMDeepNodeListPool: Constructors and Destructor // --------------------------------------------------------------------------- template <class TVal> DOMDeepNodeListPool<TVal>::DOMDeepNodeListPool( const XMLSize_t modulus , const bool adoptElems , const XMLSize_t initSize) : fAdoptedElems(adoptElems) , fBucketList(0) , fHashModulus(modulus) , fHash(0) , fIdPtrs(0) , fIdPtrsCount(initSize) , fIdCounter(0) , fMemoryManager(XMLPlatformUtils::fgMemoryManager) { initialize(modulus); // create default hasher #if defined (XML_GCC_VERSION) && (XML_GCC_VERSION < 29600) fHash = new HashPtr(); #else fHash = new (fMemoryManager) HashPtr(); #endif // // 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 = (TVal**) fMemoryManager->allocate(fIdPtrsCount * sizeof(TVal*));//new TVal*[fIdPtrsCount]; fIdPtrs[0] = 0; } template <class TVal> DOMDeepNodeListPool<TVal>::DOMDeepNodeListPool( const XMLSize_t modulus , const bool adoptElems , HashBase* hashBase , const XMLSize_t initSize) : fAdoptedElems(adoptElems) , fBucketList(0) , fHashModulus(modulus) , fHash(0) , fIdPtrs(0) , fIdPtrsCount(initSize) , fIdCounter(0) , fMemoryManager(XMLPlatformUtils::fgMemoryManager) { initialize(modulus); // set hasher fHash = hashBase; // // 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 = (TVal**) fMemoryManager->allocate(fIdPtrsCount * sizeof(TVal*));//new TVal*[fIdPtrsCount]; fIdPtrs[0] = 0; } template <class TVal> DOMDeepNodeListPool<TVal>::DOMDeepNodeListPool( const XMLSize_t modulus , const XMLSize_t initSize) : fAdoptedElems(true) , fBucketList(0) , fHashModulus(modulus) , fHash(0) , fIdPtrs(0) , fIdPtrsCount(initSize) , fIdCounter(0) , fMemoryManager(XMLPlatformUtils::fgMemoryManager) { initialize(modulus); // create default hasher fHash = new (fMemoryManager) HashPtr(); // // 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 = (TVal**) fMemoryManager->allocate(fIdPtrsCount * sizeof(TVal*));//new TVal*[fIdPtrsCount]; fIdPtrs[0] = 0; } template <class TVal> void DOMDeepNodeListPool<TVal>::initialize(const XMLSize_t modulus) { if (modulus == 0) ThrowXMLwithMemMgr(IllegalArgumentException, XMLExcepts::HshTbl_ZeroModulus, fMemoryManager); // Allocate the bucket list and zero them fBucketList = (DOMDeepNodeListPoolTableBucketElem<TVal>**) fMemoryManager->allocate ( fHashModulus * sizeof(DOMDeepNodeListPoolTableBucketElem<TVal>*) );//new DOMDeepNodeListPoolTableBucketElem<TVal>*[fHashModulus]; for (XMLSize_t index = 0; index < fHashModulus; index++) fBucketList[index] = 0; } template <class TVal> DOMDeepNodeListPool<TVal>::~DOMDeepNodeListPool() { removeAll(); // Then delete the bucket list & hasher & id pointers list fMemoryManager->deallocate(fIdPtrs);//delete [] fIdPtrs; fMemoryManager->deallocate(fBucketList);//delete [] fBucketList; delete fHash; } // --------------------------------------------------------------------------- // DOMDeepNodeListPool: Element management // --------------------------------------------------------------------------- template <class TVal> bool DOMDeepNodeListPool<TVal>::isEmpty() const { // Just check the bucket list for non-empty elements for (XMLSize_t buckInd = 0; buckInd < fHashModulus; buckInd++) { if (fBucketList[buckInd] != 0) return false; } return true; } template <class TVal> bool DOMDeepNodeListPool<TVal>::containsKey( const void* const key1 , const XMLCh* const key2 , const XMLCh* const key3) const { XMLSize_t hashVal; const DOMDeepNodeListPoolTableBucketElem<TVal>* findIt = findBucketElem(key1, key2, key3, hashVal); return (findIt != 0); } template <class TVal> void DOMDeepNodeListPool<TVal>::removeAll() { // Clean up the buckets first for (XMLSize_t buckInd = 0; buckInd < fHashModulus; buckInd++) { // Get the bucket list head for this entry DOMDeepNodeListPoolTableBucketElem<TVal>* curElem = fBucketList[buckInd]; DOMDeepNodeListPoolTableBucketElem<TVal>* nextElem; while (curElem) { // Save the next element before we hose this one nextElem = curElem->fNext; // If we adopted the data, then delete it too // (Note: the userdata hash table instance has data type of void *. // This will generate compiler warnings here on some platforms, but they // can be ignored since fAdoptedElements is false. if (fAdoptedElems) delete curElem->fData; // Then delete the current element and move forward fMemoryManager->deallocate(curElem->fKey2);//delete [] curElem->fKey2; fMemoryManager->deallocate(curElem->fKey3);//delete [] curElem->fKey3; delete curElem; curElem = nextElem; } // Clean out this entry fBucketList[buckInd] = 0; } // Reset the id counter fIdCounter = 0; } template <class TVal> void DOMDeepNodeListPool<TVal>::cleanup() { removeAll(); // Then delete the bucket list & hasher & id pointers list fMemoryManager->deallocate(fIdPtrs);//delete [] fIdPtrs; fMemoryManager->deallocate(fBucketList);//delete [] fBucketList; delete fHash; } // --------------------------------------------------------------------------- // DOMDeepNodeListPool: Getters // --------------------------------------------------------------------------- template <class TVal> TVal* DOMDeepNodeListPool<TVal>::getByKey(const void* const key1, const XMLCh* const key2, const XMLCh* const key3) { XMLSize_t hashVal; DOMDeepNodeList