DOMDeepNodeListPool.c
上传用户:zhuqijet
上传日期:2013-06-25
资源大小:10074k
文件大小:17k
- /*
- * The Apache Software License, Version 1.1
- *
- * Copyright (c) 2001-2002 The Apache Software Foundation. All rights
- * reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in
- * the documentation and/or other materials provided with the
- * distribution.
- *
- * 3. The end-user documentation included with the redistribution,
- * if any, must include the following acknowledgment:
- * "This product includes software developed by the
- * Apache Software Foundation (http://www.apache.org/)."
- * Alternately, this acknowledgment may appear in the software itself,
- * if and wherever such third-party acknowledgments normally appear.
- *
- * 4. The names "Xerces" and "Apache Software Foundation" must
- * not be used to endorse or promote products derived from this
- * software without prior written permission. For written
- * permission, please contact apache@apache.org.
- *
- * 5. Products derived from this software may not be called "Apache",
- * nor may "Apache" appear in their name, without prior written
- * permission of the Apache Software Foundation.
- *
- * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
- * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
- * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * ====================================================================
- *
- * This software consists of voluntary contributions made by many
- * individuals on behalf of the Apache Software Foundation, and was
- * originally based on software copyright (c) 2001, International
- * Business Machines, Inc., http://www.ibm.com . For more information
- * on the Apache Software Foundation, please see
- * <http://www.apache.org/>.
- */
- /**
- * $Id: DOMDeepNodeListPool.c,v 1.7 2003/05/21 21:08:03 knoaman 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
- 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>
- DOMDeepNodeListPool<TVal>::DOMDeepNodeListPool( const XMLSize_t modulus
- , const bool adoptElems
- , HashBase* hash
- , 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 = hash;
- //
- // 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)
- ThrowXML(IllegalArgumentException, XMLExcepts::HshTbl_ZeroModulus);
- // 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;
- DOMDeepNodeListPoolTableBucketElem<TVal>* findIt = findBucketElem(key1, key2, key3, hashVal);
- if (!findIt)
- return 0;
- return findIt->fData;
- }
- template <class TVal> const TVal*
- DOMDeepNodeListPool<TVal>::getByKey(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);
- if (!findIt)
- return 0;
- return findIt->fData;
- }
- template <class TVal> TVal*
- DOMDeepNodeListPool<TVal>::getById(const XMLSize_t elemId)
- {
- // If its either zero or beyond our current id, its an error
- if (!elemId || (elemId > fIdCounter))
- ThrowXML(IllegalArgumentException, XMLExcepts::Pool_InvalidId);
- return fIdPtrs[elemId];
- }
- template <class TVal> const TVal*
- DOMDeepNodeListPool<TVal>::getById(const XMLSize_t elemId) const
- {
- // If its either zero or beyond our current id, its an error
- if (!elemId || (elemId > fIdCounter))
- ThrowXML(IllegalArgumentException, XMLExcepts::Pool_InvalidId);
- return fIdPtrs[elemId];
- }
- // ---------------------------------------------------------------------------
- // DOMDeepNodeListPool: Putters
- // ---------------------------------------------------------------------------
- template <class TVal> XMLSize_t
- DOMDeepNodeListPool<TVal>::put(void* key1, XMLCh* key2, XMLCh* key3, TVal* const valueToAdopt)
- {
- // First see if the key exists already
- XMLSize_t hashVal;
- DOMDeepNodeListPoolTableBucketElem<TVal>* newBucket = findBucketElem(key1, key2, key3, hashVal);
- //
- // If so,then update its value. If not, then we need to add it to
- // the right bucket
- //
- if (newBucket)
- {
- if (fAdoptedElems)
- delete newBucket->fData;
- fMemoryManager->deallocate(newBucket->fKey2);//delete[] newBucket->fKey2;
- fMemoryManager->deallocate(newBucket->fKey3);//delete[] newBucket->fKey3;
- newBucket->fData = valueToAdopt;
- newBucket->fKey1 = key1;
- newBucket->fKey2 = XMLString::replicate(key2, fMemoryManager);
- newBucket->fKey3 = XMLString::replicate(key3, fMemoryManager);
- }
- else
- {
- // Revisit: the gcc compiler 2.95.x is generating an
- // internal compiler error message. So we use the default
- // memory manager for now.
- #if defined (XML_GCC_VERSION) && (XML_GCC_VERSION < 29600)
- newBucket = new DOMDeepNodeListPoolTableBucketElem<TVal>
- (
- key1
- , key2
- , key3
- , valueToAdopt
- , fBucketList[hashVal]
- , fMemoryManager
- );
- #else
- newBucket = new (fMemoryManager) DOMDeepNodeListPoolTableBucketElem<TVal>
- (
- key1
- , key2
- , key3
- , valueToAdopt
- , fBucketList[hashVal]
- , fMemoryManager
- );
- #endif
- 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
- XMLSize_t newCount = (XMLSize_t)(fIdPtrsCount * 1.5);
- TVal** newArray = (TVal**) fMemoryManager->allocate
- (
- newCount * sizeof(TVal*)
- );//new TVal*[newCount];
- // Copy over the old contents to the new array
- memcpy(newArray, fIdPtrs, fIdPtrsCount * sizeof(TVal*));
- // Ok, toss the old array and store the new data
- fMemoryManager->deallocate(fIdPtrs); //delete [] fIdPtrs;
- fIdPtrs = newArray;
- fIdPtrsCount = newCount;
- }
- const XMLSize_t retId = ++fIdCounter;
- fIdPtrs[retId] = valueToAdopt;
- // Return the id that we gave to this element
- return retId;
- }
- // ---------------------------------------------------------------------------
- // DOMDeepNodeListPool: Private methods
- // ---------------------------------------------------------------------------
- template <class TVal> DOMDeepNodeListPoolTableBucketElem<TVal>* DOMDeepNodeListPool<TVal>::
- findBucketElem(const void* const key1, const XMLCh* const key2, const XMLCh* const key3, XMLSize_t& hashVal)
- {
- // Hash the key
- hashVal = fHash->getHashVal(key1, fHashModulus);
- if (hashVal > fHashModulus)
- ThrowXML(RuntimeException, XMLExcepts::HshTbl_BadHashFromKey);
- // Search that bucket for the key
- DOMDeepNodeListPoolTableBucketElem<TVal>* curElem = fBucketList[hashVal];
- while (curElem)
- {
- //key2 and key3 are XMLCh*, compareString takes null pointer vs zero len string the same
- //but we need them to be treated as different keys in this case
- if (fHash->equals(key1, curElem->fKey1) && (XMLString::equals(key2, curElem->fKey2)) && (XMLString::equals(key3, curElem->fKey3))) {
- if (!key2 || !curElem->fKey2) {
- if (key2 || curElem->fKey2) {
- curElem = curElem->fNext;
- continue;
- }
- }
- if (!key3 || !curElem->fKey3) {
- if (key3 || curElem->fKey3) {
- curElem = curElem->fNext;
- continue;
- }
- }
- return curElem;
- }
- curElem = curElem->fNext;
- }
- return 0;
- }
- template <class TVal> const DOMDeepNodeListPoolTableBucketElem<TVal>* DOMDeepNodeListPool<TVal>::
- findBucketElem(const void* const key1, const XMLCh* const key2, const XMLCh* const key3, XMLSize_t& hashVal) const
- {
- // Hash the key
- hashVal = fHash->getHashVal(key1, fHashModulus);
- if (hashVal > fHashModulus)
- ThrowXML(RuntimeException, XMLExcepts::HshTbl_BadHashFromKey);
- // Search that bucket for the key
- const DOMDeepNodeListPoolTableBucketElem<TVal>* curElem = fBucketList[hashVal];
- while (curElem)
- {
- //key2 and key3 are XMLCh*, compareString takes null pointer vs zero len string the same
- //but we need them to be treated as different keys in this case
- if (fHash->equals(key1, curElem->fKey1) && (XMLString::equals(key2, curElem->fKey2)) && (XMLString::equals(key3, curElem->fKey3))) {
- if (!key2 || !curElem->fKey2) {
- if (key2 || curElem->fKey2) {
- curElem = curElem->fNext;
- continue;
- }
- }
- if (!key3 || !curElem->fKey3) {
- if (key3 || curElem->fKey3) {
- curElem = curElem->fNext;
- continue;
- }
- }
- return curElem;
- }
- curElem = curElem->fNext;
- }
- return 0;
- }
- XERCES_CPP_NAMESPACE_END