DOMStringPool.cpp
上传用户:zhuqijet
上传日期:2013-06-25
资源大小:10074k
文件大小:8k
- /*
- * 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: DOMStringPool.cpp,v 1.5 2002/11/04 15:07:34 tng Exp $
- */
- #include <xercesc/util/XMLString.hpp>
- #include <xercesc/util/PlatformUtils.hpp>
- #include "DOMStringPool.hpp"
- #include "DOMDocumentImpl.hpp"
- XERCES_CPP_NAMESPACE_BEGIN
- //
- // DStringPoolEntry - one of these structs is allocated for each
- // XMLCh String in the pool. Each slot in the
- // hash table array itself is a pointer to the head
- // of a singly-linked list of these structs.
- //
- // Although this struct is delcared with a string length of one,
- // the factory method allocates enough storage to hold the full
- // string length.
- //
- struct DOMStringPoolEntry
- {
- DOMStringPoolEntry *fNext;
- XMLCh fString[1];
- };
- //
- // createSPE - factory method for creating sting pool entry structs.
- // Allocates sufficient storage to hold the entire string
- //
- static DOMStringPoolEntry *createSPE(const XMLCh *str, DOMDocumentImpl *doc)
- {
- // Compute size to allocate. Note that there's 1 char of string declared in the
- // struct, so we don't need to add one again to account for the trailing null.
- //
- size_t sizeToAllocate = sizeof(DOMStringPoolEntry) + XMLString::stringLen(str)*sizeof(XMLCh);
- DOMStringPoolEntry *newSPE = (DOMStringPoolEntry *)doc->allocate(sizeToAllocate);
- newSPE->fNext = 0;
- XMLCh * nonConstStr = (XMLCh *)newSPE->fString;
- XMLString::copyString(nonConstStr, str);
- return newSPE;
- }
- DOMStringPool::DOMStringPool(int hashTableSize, DOMDocumentImpl *doc)
- {
- fDoc = doc; // needed to get access to the doc's storage allocator.
- fHashTableSize = hashTableSize;
- //fHashTable = new (fDoc) DOMStringPoolEntry *[hashTableSize];
- void* p = doc->allocate(sizeof(DOMStringPoolEntry*) * hashTableSize);
- fHashTable = (DOMStringPoolEntry**) p;
- for (int i=0; i<fHashTableSize; i++)
- fHashTable[i] = 0;
- };
- // Destructor. Nothing to do, since storage all belongs to the document.
- //
- DOMStringPool::~DOMStringPool()
- {
- };
- const XMLCh *DOMStringPool::getPooledString(const XMLCh *in)
- {
- DOMStringPoolEntry **pspe;
- DOMStringPoolEntry *spe;
- int inHash = XMLString::hash(in, fHashTableSize);
- pspe = &fHashTable[inHash];
- while (*pspe != 0)
- {
- if (XMLString::equals((*pspe)->fString, in))
- return (*pspe)->fString;
- pspe = &((*pspe)->fNext);
- }
- // This string hasn't been seen before. Add it to the pool.
- *pspe = spe = createSPE(in, fDoc);
- return spe->fString;
- };
- // -----------------------------------------------------------------------
- // DOMBuffer: Constructors
- // -----------------------------------------------------------------------
- DOMBuffer::DOMBuffer(DOMDocumentImpl *doc, int capacity) :
- fBuffer(0)
- , fIndex(0)
- , fCapacity(capacity)
- , fDoc(doc)
- {
- // Buffer is one larger than capacity, to allow for zero term
- fBuffer = (XMLCh*) doc->allocate((fCapacity+1)*sizeof(XMLCh));
- // Keep it null terminated
- fBuffer[0] = XMLCh(0);
- }
- DOMBuffer::DOMBuffer(DOMDocumentImpl *doc, const XMLCh* string) :
- fBuffer(0)
- , fIndex(0)
- , fCapacity(0)
- , fDoc(doc)
- {
- unsigned int actualCount = XMLString::stringLen(string);
- fCapacity = actualCount + 15;
- // Buffer is one larger than capacity, to allow for zero term
- fBuffer = (XMLCh*) doc->allocate((fCapacity+1)*sizeof(XMLCh));
- memcpy(fBuffer, string, actualCount * sizeof(XMLCh));
- fIndex = actualCount;
- // Keep it null terminated
- fBuffer[fIndex] = 0;
- }
- // ---------------------------------------------------------------------------
- // DOMBuffer: Buffer management
- // ---------------------------------------------------------------------------
- void DOMBuffer::append(const XMLCh* const chars, const unsigned int count)
- {
- unsigned int actualCount = count;
- if (!count)
- actualCount = XMLString::stringLen(chars);
- if (fIndex + actualCount >= fCapacity)
- expandCapacity(actualCount);
- memcpy(&fBuffer[fIndex], chars, actualCount * sizeof(XMLCh));
- fIndex += actualCount;
- }
- void DOMBuffer::set(const XMLCh* const chars, const unsigned int count)
- {
- unsigned int actualCount = count;
- if (!count)
- actualCount = XMLString::stringLen(chars);
- fIndex = 0;
- if (fIndex + actualCount >= fCapacity)
- expandCapacity(actualCount);
- memcpy(fBuffer, chars, actualCount * sizeof(XMLCh));
- fIndex = actualCount;
- }
- // ---------------------------------------------------------------------------
- // DOMBuffer: Private helper methods
- // ---------------------------------------------------------------------------
- void DOMBuffer::expandCapacity(const unsigned int extraNeeded)
- {
- //not enough room. Calc new capacity and allocate new buffer
- const unsigned int newCap = (unsigned int)((fIndex + extraNeeded) * 1.25);
- XMLCh* newBuf = (XMLCh*) fDoc->allocate((newCap+1)*sizeof(XMLCh));
- // Copy over the old stuff
- memcpy(newBuf, fBuffer, fCapacity * sizeof(XMLCh));
- // revisit: Leave the old buffer in document heap, yes, this is a leak, but live with it!
- // store new stuff
- fBuffer = newBuf;
- fCapacity = newCap;
- }
- XERCES_CPP_NAMESPACE_END