org.enhydra.apache.xerces.utils.CharDataChunk Maven / Gradle / Ivy
The newest version!
/*
* The Apache Software License, Version 1.1
*
*
* Copyright (c) 1999 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 [email protected].
*
* 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) 1999, International
* Business Machines, Inc., http://www.apache.org. For more
* information on the Apache Software Foundation, please see
* true if we cleared the previous chunk pointer;
* otherwise false if the pointer is already null.
*/
public boolean clearPreviousChunk() {
if (fPreviousChunk != null) {
fPreviousChunk.clearNextChunk();
fPreviousChunk.removeRef();
fPreviousChunk = null;
return true;
}
return false;
}
/**
* Release the reference to this chunk held by the reader that allocated
* this instance. Called at end of input to release the last chunk in the
* list used by the reader.
*/
public void releaseChunk() {
removeRef();
}
/**
* Add a range from this chunk to the StringPool
*
* @param offset the offset of the first character to be added
* @param length the number of characters to add
* @return the StringPool handle that was added.
*/
public int addString(int offset, int length) {
int chunk = offset >> CHUNK_SHIFT;
if (chunk != fChunk) {
if (fPreviousChunk == null)
throw new RuntimeException(new ImplementationMessages().createMessage(null, ImplementationMessages.INT_PCN, 0, null));
return fPreviousChunk.addString(offset, length);
}
int lastChunk = (offset + length - 1) >> CHUNK_SHIFT;
if (chunk == lastChunk) {
addRef();
return fStringPool.addString(this, offset & CHUNK_MASK, length);
}
String str = toString(offset & CHUNK_MASK, length);
return fStringPool.addString(str);
}
/**
* Add a range from this chunk to the StringPool as a symbol
*
* @param offset the offset of the first character to be added
* @param length the number of characters to add
* @param hashcode hashcode to match to ensure uniqueness
* @return the StringPool handle that was added.
*/
public int addSymbol(int offset, int length, int hashcode) {
int chunk = offset >> CHUNK_SHIFT;
if (chunk != fChunk) {
if (fPreviousChunk == null)
throw new RuntimeException(new ImplementationMessages().createMessage(null, ImplementationMessages.INT_PCN, 0, null));
return fPreviousChunk.addSymbol(offset, length, hashcode);
}
int lastChunk = (offset + length - 1) >> CHUNK_SHIFT;
int index = offset & CHUNK_MASK;
if (chunk == lastChunk) {
if (hashcode == 0)
hashcode = StringHasher.hashChars(fData, index, length);
int symbol = fStringPool.lookupSymbol(this, offset & CHUNK_MASK, length, hashcode);
if (symbol == -1) {
String str = toString(offset & CHUNK_MASK, length);
symbol = fStringPool.addNewSymbol(str, hashcode);
}
return symbol;
}
String str = toString(offset & CHUNK_MASK, length);
return fStringPool.addSymbol(str);
}
/**
* Append data from a CharBuffer to this chunk.
*
* @param charBuffer the buffer to be appended.
* @param offset the offset of the first character to be appended.
* @param length the number of characters to append.
*/
public void append(XMLEntityHandler.CharBuffer charBuffer, int offset, int length) {
//
// Setup for the operation.
//
CharDataChunk dataChunk = chunkFor(offset);
int index = offset & CHUNK_MASK;
int nbytes = (index + length <= CHUNK_SIZE) ? length : CHUNK_SIZE - index;
//
// Visit each Chunk in turn until we are done.
//
while (true) {
charBuffer.append(dataChunk.fData, index, nbytes);
length -= nbytes;
if (length == 0)
break;
dataChunk = dataChunk.fNextChunk;
index = 0;
nbytes = length <= CHUNK_SIZE ? length : CHUNK_SIZE;
}
}
//
// StringProducer interfaces
//
/**
* Return a range of characters as a String.
*
* @param offset the offset of the first character to convert.
* @param length the number of characters to convert.
* @return the String
*/
public String toString(int offset, int length) {
if (offset + length <= CHUNK_SIZE) {
//
// All the chars are in the same chunk
//
return new String(fData, offset, length);
}
//
// The data is spread across chunks, so we need to build it in pieces.
//
StringBuffer sb = new StringBuffer(length);
//
// Copy the partial data from the first chunk.
//
int nbytes = CHUNK_SIZE - offset;
sb.append(fData, offset, nbytes);
length -= nbytes;
//
// Use each chunk in turn until we are done.
//
CharDataChunk aChunk = fNextChunk;
do {
nbytes = length <= CHUNK_SIZE ? length : CHUNK_SIZE;
sb.append(aChunk.fData, 0, nbytes);
length -= nbytes;
aChunk = aChunk.fNextChunk;
} while (length > 0);
String retval = sb.toString();
sb = null; // REVISIT - does this help gc ?
return retval;
}
/**
* Release a string from this chunk
*
* @param offset the offset of the first character to be released
* @param length the number of characters to release.
*/
public void releaseString(int offset, int length) {
removeRef();
}
/**
* Compare a range in this chunk and a range in a character array for equality
*
* @param offset the offset of the first character in the range in this chunk
* @param length the number of characters in the range to compare
* @param strChars the character array to compare
* @param strOffset the offset of the first character in the range in strChars
* @param strLength the number of characters to release.
* @return true if the ranges are character-wise equal, otherwise false.
*/
public boolean equalsString(int offset, int length, char[] strChars, int strOffset, int strLength) {
if (length != strLength)
return false;
if (offset + length <= CHUNK_SIZE) {
//
// All the chars are in the same chunk
//
for (int i = 0; i < length; i++) {
if (fData[offset++] != strChars[strOffset++])
return false;
}
return true;
}
//
// Compare the partial data from the first chunk.
//
int nbytes = CHUNK_SIZE - offset;
length -= nbytes;
while (nbytes-- > 0) {
if (fData[offset++] != strChars[strOffset++])
return false;
}
//
// Check each chunk in turn until we are done.
//
CharDataChunk aChunk = fNextChunk;
do {
offset = 0;
nbytes = length <= CHUNK_SIZE ? length : CHUNK_SIZE;
length -= nbytes;
while (nbytes-- > 0) {
if (aChunk.fData[offset++] != strChars[strOffset++])
return false;
}
aChunk = aChunk.fNextChunk;
} while (length > 0);
return true;
}
//
// Private methods
//
//
// Constructor for factory method.
//
private CharDataChunk() {}
//
//
//
private void addRef() {
fRefCount++;
}
//
//
//
private void removeRef() {
fRefCount--;
if (fRefCount == 0) {
fStringPool = null;
fChunk = -1;
fPreviousChunk = null;
synchronized (CharDataChunk.class) {
/*** Only keep one free chunk at a time! ***
fNextChunk = fgFreeChunks;
/***/
fNextChunk = null;
fgFreeChunks = this;
}
}
}
//
//
//
private void clearNextChunk() {
if (fNextChunk != null)
fNextChunk.removeRef();
fNextChunk = null;
}
//
//
//
private void setNextChunk(CharDataChunk nextChunk) {
if (fNextChunk != null) {
throw new RuntimeException("CharDataChunk::setNextChunk");
}
nextChunk.addRef();
fNextChunk = nextChunk;
}
//
// Private instance variables.
//
private StringPool fStringPool;
private int fRefCount;
private int fChunk;
private char[] fData = null;
private CharDataChunk fNextChunk;
private CharDataChunk fPreviousChunk;
private static CharDataChunk fgFreeChunks = null;
}