2007-03-22 10:30:00 -07:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim: set ts=2 sw=2 et tw=78: */
|
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (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.mozilla.org/MPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
|
|
|
*
|
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
|
|
|
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
|
|
|
//#define __INCREMENTAL 1
|
|
|
|
|
|
|
|
#include "nsScanner.h"
|
|
|
|
#include "nsDebug.h"
|
|
|
|
#include "nsIServiceManager.h"
|
|
|
|
#include "nsICharsetConverterManager.h"
|
|
|
|
#include "nsICharsetAlias.h"
|
|
|
|
#include "nsReadableUtils.h"
|
|
|
|
#include "nsIInputStream.h"
|
|
|
|
#include "nsILocalFile.h"
|
|
|
|
#include "nsNetUtil.h"
|
|
|
|
#include "nsUTF8Utils.h" // for LossyConvertEncoding
|
|
|
|
#include "nsCRT.h"
|
|
|
|
#include "nsParser.h"
|
|
|
|
|
|
|
|
// We replace NUL characters with this character.
|
|
|
|
static PRUnichar sInvalid = UCS2_REPLACEMENT_CHAR;
|
|
|
|
|
|
|
|
nsReadEndCondition::nsReadEndCondition(const PRUnichar* aTerminateChars) :
|
|
|
|
mChars(aTerminateChars), mFilter(PRUnichar(~0)) // All bits set
|
|
|
|
{
|
|
|
|
// Build filter that will be used to filter out characters with
|
|
|
|
// bits that none of the terminal chars have. This works very well
|
|
|
|
// because terminal chars often have only the last 4-6 bits set and
|
|
|
|
// normal ascii letters have bit 7 set. Other letters have even higher
|
|
|
|
// bits set.
|
|
|
|
|
|
|
|
// Calculate filter
|
|
|
|
const PRUnichar *current = aTerminateChars;
|
|
|
|
PRUnichar terminalChar = *current;
|
|
|
|
while (terminalChar) {
|
|
|
|
mFilter &= ~terminalChar;
|
|
|
|
++current;
|
|
|
|
terminalChar = *current;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef __INCREMENTAL
|
|
|
|
const int kBufsize=1;
|
|
|
|
#else
|
|
|
|
const int kBufsize=64;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Use this constructor if you want i/o to be based on
|
|
|
|
* a single string you hand in during construction.
|
|
|
|
* This short cut was added for Javascript.
|
|
|
|
*
|
|
|
|
* @update gess 5/12/98
|
|
|
|
* @param aMode represents the parser mode (nav, other)
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsScanner::nsScanner(const nsAString& anHTMLString, const nsACString& aCharset,
|
|
|
|
PRInt32 aSource)
|
|
|
|
: mParser(nsnull)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(nsScanner);
|
|
|
|
|
|
|
|
mSlidingBuffer = nsnull;
|
|
|
|
mCountRemaining = 0;
|
|
|
|
mFirstNonWhitespacePosition = -1;
|
|
|
|
AppendToBuffer(anHTMLString);
|
|
|
|
mSlidingBuffer->BeginReading(mCurrentPosition);
|
|
|
|
mMarkPosition = mCurrentPosition;
|
|
|
|
mIncremental = PR_FALSE;
|
|
|
|
mUnicodeDecoder = 0;
|
|
|
|
mCharsetSource = kCharsetUninitialized;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Use this constructor if you want i/o to be based on strings
|
|
|
|
* the scanner receives. If you pass a null filename, you
|
|
|
|
* can still provide data to the scanner via append.
|
|
|
|
*
|
|
|
|
* @update gess 5/12/98
|
|
|
|
* @param aFilename --
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsScanner::nsScanner(nsString& aFilename,PRBool aCreateStream,
|
|
|
|
const nsACString& aCharset, PRInt32 aSource)
|
|
|
|
: mFilename(aFilename), mParser(nsnull)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(nsScanner);
|
2007-06-26 17:21:47 -07:00
|
|
|
NS_ASSERTION(!aCreateStream, "This is always true.");
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
mSlidingBuffer = nsnull;
|
|
|
|
|
|
|
|
// XXX This is a big hack. We need to initialize the iterators to something.
|
|
|
|
// What matters is that mCurrentPosition == mEndPosition, so that our methods
|
|
|
|
// believe that we are at EOF (see bug 182067). We null out mCurrentPosition
|
|
|
|
// so that we have some hope of catching null pointer dereferences associated
|
|
|
|
// with this hack. --darin
|
|
|
|
memset(&mCurrentPosition, 0, sizeof(mCurrentPosition));
|
|
|
|
mMarkPosition = mCurrentPosition;
|
|
|
|
mEndPosition = mCurrentPosition;
|
|
|
|
|
|
|
|
mIncremental = PR_TRUE;
|
|
|
|
mFirstNonWhitespacePosition = -1;
|
|
|
|
mCountRemaining = 0;
|
|
|
|
|
|
|
|
mUnicodeDecoder = 0;
|
|
|
|
mCharsetSource = kCharsetUninitialized;
|
|
|
|
SetDocumentCharset(aCharset, aSource);
|
|
|
|
}
|
|
|
|
|
|
|
|
nsresult nsScanner::SetDocumentCharset(const nsACString& aCharset , PRInt32 aSource) {
|
|
|
|
|
|
|
|
nsresult res = NS_OK;
|
|
|
|
|
|
|
|
if( aSource < mCharsetSource) // priority is lower the the current one , just
|
|
|
|
return res;
|
|
|
|
|
2008-01-29 14:12:22 -08:00
|
|
|
nsICharsetAlias* calias = nsParser::GetCharsetAliasService();
|
|
|
|
NS_ASSERTION(calias, "Must have the charset alias service!");
|
|
|
|
|
|
|
|
if (!mCharset.IsEmpty())
|
2007-03-22 10:30:00 -07:00
|
|
|
{
|
2008-01-29 14:12:22 -08:00
|
|
|
PRBool same;
|
2007-03-22 10:30:00 -07:00
|
|
|
res = calias->Equals(aCharset, mCharset, &same);
|
|
|
|
if(NS_SUCCEEDED(res) && same)
|
|
|
|
{
|
|
|
|
return NS_OK; // no difference, don't change it
|
|
|
|
}
|
2008-01-29 14:12:22 -08:00
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2008-01-29 14:12:22 -08:00
|
|
|
// different, need to change it
|
|
|
|
nsCString charsetName;
|
|
|
|
res = calias->GetPreferred(aCharset, charsetName);
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2008-01-29 14:12:22 -08:00
|
|
|
if(NS_FAILED(res) && (mCharsetSource == kCharsetUninitialized))
|
|
|
|
{
|
|
|
|
// failed - unknown alias , fallback to ISO-8859-1
|
|
|
|
mCharset.AssignLiteral("ISO-8859-1");
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
2008-01-29 14:12:22 -08:00
|
|
|
else
|
|
|
|
{
|
|
|
|
mCharset.Assign(charsetName);
|
|
|
|
}
|
|
|
|
|
|
|
|
mCharsetSource = aSource;
|
|
|
|
|
|
|
|
NS_ASSERTION(nsParser::GetCharsetConverterManager(),
|
|
|
|
"Must have the charset converter manager!");
|
|
|
|
|
|
|
|
nsIUnicodeDecoder * decoder = nsnull;
|
|
|
|
res = nsParser::GetCharsetConverterManager()->
|
|
|
|
GetUnicodeDecoderRaw(mCharset.get(), &decoder);
|
|
|
|
if(NS_SUCCEEDED(res) && (nsnull != decoder))
|
|
|
|
{
|
|
|
|
NS_IF_RELEASE(mUnicodeDecoder);
|
|
|
|
|
|
|
|
mUnicodeDecoder = decoder;
|
|
|
|
}
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* default destructor
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsScanner::~nsScanner() {
|
|
|
|
|
|
|
|
if (mSlidingBuffer) {
|
|
|
|
delete mSlidingBuffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
MOZ_COUNT_DTOR(nsScanner);
|
|
|
|
|
|
|
|
NS_IF_RELEASE(mUnicodeDecoder);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Resets current offset position of input stream to marked position.
|
|
|
|
* This allows us to back up to this point if the need should arise,
|
|
|
|
* such as when tokenization gets interrupted.
|
|
|
|
* NOTE: IT IS REALLY BAD FORM TO CALL RELEASE WITHOUT CALLING MARK FIRST!
|
|
|
|
*
|
|
|
|
* @update gess 5/12/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
void nsScanner::RewindToMark(void){
|
|
|
|
if (mSlidingBuffer) {
|
|
|
|
mCountRemaining += (Distance(mMarkPosition, mCurrentPosition));
|
|
|
|
mCurrentPosition = mMarkPosition;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Records current offset position in input stream. This allows us
|
|
|
|
* to back up to this point if the need should arise, such as when
|
|
|
|
* tokenization gets interrupted.
|
|
|
|
*
|
|
|
|
* @update gess 7/29/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
void nsScanner::Mark() {
|
|
|
|
if (mSlidingBuffer) {
|
|
|
|
mSlidingBuffer->DiscardPrefix(mCurrentPosition);
|
|
|
|
mSlidingBuffer->BeginReading(mCurrentPosition);
|
|
|
|
mMarkPosition = mCurrentPosition;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Insert data to our underlying input buffer as
|
|
|
|
* if it were read from an input stream.
|
|
|
|
*
|
|
|
|
* @update harishd 01/12/99
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
PRBool nsScanner::UngetReadable(const nsAString& aBuffer) {
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return PR_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
mSlidingBuffer->UngetReadable(aBuffer,mCurrentPosition);
|
|
|
|
mSlidingBuffer->BeginReading(mCurrentPosition); // Insertion invalidated our iterators
|
|
|
|
mSlidingBuffer->EndReading(mEndPosition);
|
|
|
|
|
|
|
|
PRUint32 length = aBuffer.Length();
|
|
|
|
mCountRemaining += length; // Ref. bug 117441
|
|
|
|
return PR_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Append data to our underlying input buffer as
|
|
|
|
* if it were read from an input stream.
|
|
|
|
*
|
|
|
|
* @update gess4/3/98
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::Append(const nsAString& aBuffer) {
|
|
|
|
AppendToBuffer(aBuffer);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* @update gess 5/21/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::Append(const char* aBuffer, PRUint32 aLen,
|
|
|
|
nsIRequest *aRequest)
|
|
|
|
{
|
|
|
|
nsresult res=NS_OK;
|
|
|
|
PRUnichar *unichars, *start;
|
2007-06-26 17:21:47 -07:00
|
|
|
if (mUnicodeDecoder) {
|
2007-03-22 10:30:00 -07:00
|
|
|
PRInt32 unicharBufLen = 0;
|
|
|
|
mUnicodeDecoder->GetMaxLength(aBuffer, aLen, &unicharBufLen);
|
|
|
|
nsScannerString::Buffer* buffer = nsScannerString::AllocBuffer(unicharBufLen + 1);
|
|
|
|
NS_ENSURE_TRUE(buffer,NS_ERROR_OUT_OF_MEMORY);
|
|
|
|
start = unichars = buffer->DataStart();
|
|
|
|
|
|
|
|
PRInt32 totalChars = 0;
|
|
|
|
PRInt32 unicharLength = unicharBufLen;
|
|
|
|
do {
|
|
|
|
PRInt32 srcLength = aLen;
|
|
|
|
res = mUnicodeDecoder->Convert(aBuffer, &srcLength, unichars, &unicharLength);
|
|
|
|
|
|
|
|
totalChars += unicharLength;
|
|
|
|
// Continuation of failure case
|
|
|
|
if(NS_FAILED(res)) {
|
|
|
|
// if we failed, we consume one byte, replace it with U+FFFD
|
|
|
|
// and try the conversion again.
|
|
|
|
|
|
|
|
// This is only needed because some decoders don't follow the
|
|
|
|
// nsIUnicodeDecoder contract: they return a failure when *aDestLength
|
|
|
|
// is 0 rather than the correct NS_OK_UDEC_MOREOUTPUT. See bug 244177
|
|
|
|
if ((unichars + unicharLength) >= buffer->DataEnd()) {
|
|
|
|
NS_ERROR("Unexpected end of destination buffer");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
unichars[unicharLength++] = (PRUnichar)0xFFFD;
|
|
|
|
unichars = unichars + unicharLength;
|
|
|
|
unicharLength = unicharBufLen - (++totalChars);
|
|
|
|
|
|
|
|
mUnicodeDecoder->Reset();
|
|
|
|
|
|
|
|
if(((PRUint32) (srcLength + 1)) > aLen) {
|
|
|
|
srcLength = aLen;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
++srcLength;
|
|
|
|
}
|
|
|
|
|
|
|
|
aBuffer += srcLength;
|
|
|
|
aLen -= srcLength;
|
|
|
|
}
|
|
|
|
} while (NS_FAILED(res) && (aLen > 0));
|
|
|
|
|
|
|
|
buffer->SetDataLength(totalChars);
|
|
|
|
AppendToBuffer(buffer, aRequest);
|
|
|
|
|
|
|
|
// Don't propagate return code of unicode decoder
|
|
|
|
// since it doesn't reflect on our success or failure
|
|
|
|
// - Ref. bug 87110
|
|
|
|
res = NS_OK;
|
|
|
|
}
|
|
|
|
else {
|
2007-06-26 17:21:47 -07:00
|
|
|
NS_WARNING("No decoder found.");
|
|
|
|
res = NS_ERROR_FAILURE;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* retrieve next char from scanners internal input stream
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return error code reflecting read status
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::GetChar(PRUnichar& aChar) {
|
2007-06-26 17:21:47 -07:00
|
|
|
if (!mSlidingBuffer || mCurrentPosition == mEndPosition) {
|
|
|
|
aChar = 0;
|
2007-03-22 10:30:00 -07:00
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
aChar = *mCurrentPosition++;
|
|
|
|
--mCountRemaining;
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
return NS_OK;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* peek ahead to consume next char from scanner's internal
|
|
|
|
* input buffer
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::Peek(PRUnichar& aChar, PRUint32 aOffset) {
|
2007-06-26 17:21:47 -07:00
|
|
|
aChar = 0;
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
if (!mSlidingBuffer || mCurrentPosition == mEndPosition) {
|
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
if (aOffset > 0) {
|
|
|
|
if (mCountRemaining <= aOffset)
|
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
nsScannerIterator pos = mCurrentPosition;
|
|
|
|
pos.advance(aOffset);
|
|
|
|
aChar=*pos;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
aChar=*mCurrentPosition;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
2007-06-26 17:21:47 -07:00
|
|
|
return NS_OK;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
nsresult nsScanner::Peek(nsAString& aStr, PRInt32 aNumChars, PRInt32 aOffset)
|
|
|
|
{
|
2007-06-26 17:21:47 -07:00
|
|
|
if (!mSlidingBuffer || mCurrentPosition == mEndPosition) {
|
2007-03-22 10:30:00 -07:00
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator start, end;
|
|
|
|
|
|
|
|
start = mCurrentPosition;
|
|
|
|
|
|
|
|
if ((PRInt32)mCountRemaining <= aOffset) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (aOffset > 0) {
|
|
|
|
start.advance(aOffset);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mCountRemaining < PRUint32(aNumChars + aOffset)) {
|
|
|
|
end = mEndPosition;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
end = start;
|
|
|
|
end.advance(aNumChars);
|
|
|
|
}
|
|
|
|
|
|
|
|
CopyUnicodeTo(start, end, aStr);
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Skip whitespace on scanner input stream
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return error status
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::SkipWhitespace(PRInt32& aNewlinesSkipped) {
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar theChar = 0;
|
|
|
|
nsresult result = Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator current = mCurrentPosition;
|
|
|
|
PRBool done = PR_FALSE;
|
|
|
|
PRBool skipped = PR_FALSE;
|
|
|
|
|
|
|
|
while (!done && current != mEndPosition) {
|
|
|
|
switch(theChar) {
|
|
|
|
case '\n':
|
|
|
|
case '\r': ++aNewlinesSkipped;
|
|
|
|
case ' ' :
|
|
|
|
case '\t':
|
|
|
|
{
|
|
|
|
skipped = PR_TRUE;
|
|
|
|
PRUnichar thePrevChar = theChar;
|
|
|
|
theChar = (++current != mEndPosition) ? *current : '\0';
|
|
|
|
if ((thePrevChar == '\r' && theChar == '\n') ||
|
|
|
|
(thePrevChar == '\n' && theChar == '\r')) {
|
|
|
|
theChar = (++current != mEndPosition) ? *current : '\0'; // CRLF == LFCR => LF
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
done = PR_TRUE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (skipped) {
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == mEndPosition) {
|
2007-06-26 17:21:47 -07:00
|
|
|
result = kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Skip over chars as long as they equal given char
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::SkipOver(PRUnichar aSkipChar){
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar ch=0;
|
|
|
|
nsresult result=NS_OK;
|
|
|
|
|
|
|
|
while(NS_OK==result) {
|
|
|
|
result=Peek(ch);
|
|
|
|
if(NS_OK == result) {
|
|
|
|
if(ch!=aSkipChar) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
GetChar(ch);
|
|
|
|
}
|
|
|
|
else break;
|
|
|
|
} //while
|
|
|
|
return result;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
void DoErrTest(nsString& aString) {
|
|
|
|
PRInt32 pos=aString.FindChar(0);
|
|
|
|
if(kNotFound<pos) {
|
|
|
|
if(aString.Length()-1!=pos) {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void DoErrTest(nsCString& aString) {
|
|
|
|
PRInt32 pos=aString.FindChar(0);
|
|
|
|
if(kNotFound<pos) {
|
|
|
|
if(aString.Length()-1!=pos) {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consume characters until you run into space, a '<', a '>', or a '/'.
|
|
|
|
*
|
|
|
|
* @param aString - receives new data from stream
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadTagIdentifier(nsScannerSharedSubstring& aString) {
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
nsScannerIterator current, end;
|
|
|
|
PRBool found=PR_FALSE;
|
|
|
|
|
|
|
|
current = mCurrentPosition;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
// Loop until we find an illegal character. Everything is then appended
|
|
|
|
// later.
|
|
|
|
while(current != end && !found) {
|
|
|
|
theChar=*current;
|
|
|
|
|
|
|
|
switch(theChar) {
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
|
|
|
case ' ' :
|
|
|
|
case '\t':
|
|
|
|
case '\v':
|
|
|
|
case '\f':
|
|
|
|
case '<':
|
|
|
|
case '>':
|
|
|
|
case '/':
|
|
|
|
found = PR_TRUE;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\0':
|
|
|
|
ReplaceCharacter(current, sInvalid);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!found) {
|
|
|
|
++current;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Don't bother appending nothing.
|
|
|
|
if (current != mCurrentPosition) {
|
|
|
|
AppendUnicodeTo(mCurrentPosition, current, aString);
|
|
|
|
}
|
|
|
|
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == end) {
|
2007-06-26 17:21:47 -07:00
|
|
|
result = kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
//DoErrTest(aString);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consume characters until you run into a char that's not valid in an
|
|
|
|
* entity name
|
|
|
|
*
|
|
|
|
* @param aString - receives new data from stream
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadEntityIdentifier(nsString& aString) {
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
nsScannerIterator origin, current, end;
|
|
|
|
PRBool found=PR_FALSE;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = mCurrentPosition;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
while(current != end) {
|
|
|
|
|
|
|
|
theChar=*current;
|
|
|
|
if(theChar) {
|
|
|
|
found=PR_FALSE;
|
|
|
|
switch(theChar) {
|
|
|
|
case '_':
|
|
|
|
case '-':
|
|
|
|
case '.':
|
|
|
|
// Don't allow ':' in entity names. See bug 23791
|
|
|
|
found = PR_TRUE;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
found = ('a'<=theChar && theChar<='z') ||
|
|
|
|
('A'<=theChar && theChar<='Z') ||
|
|
|
|
('0'<=theChar && theChar<='9');
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!found) {
|
|
|
|
AppendUnicodeTo(mCurrentPosition, current, aString);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
++current;
|
|
|
|
}
|
|
|
|
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == end) {
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
//DoErrTest(aString);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consume digits
|
|
|
|
*
|
|
|
|
* @param aString - should contain digits
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadNumber(nsString& aString,PRInt32 aBase) {
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_ASSERTION(aBase == 10 || aBase == 16,"base value not supported");
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
nsScannerIterator origin, current, end;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
PRBool done = PR_FALSE;
|
|
|
|
while(current != end) {
|
|
|
|
theChar=*current;
|
|
|
|
if(theChar) {
|
|
|
|
done = (theChar < '0' || theChar > '9') &&
|
|
|
|
((aBase == 16)? (theChar < 'A' || theChar > 'F') &&
|
|
|
|
(theChar < 'a' || theChar > 'f')
|
|
|
|
:PR_TRUE);
|
|
|
|
if(done) {
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
++current;
|
|
|
|
}
|
|
|
|
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == end) {
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
//DoErrTest(aString);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consume characters until you find the terminal char
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param aString receives new data from stream
|
|
|
|
* @param addTerminal tells us whether to append terminal to aString
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadWhitespace(nsScannerSharedSubstring& aString,
|
|
|
|
PRInt32& aNewlinesSkipped,
|
|
|
|
PRBool& aHaveCR) {
|
|
|
|
|
|
|
|
aHaveCR = PR_FALSE;
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar theChar = 0;
|
|
|
|
nsresult result = Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current, end;
|
|
|
|
PRBool done = PR_FALSE;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
PRBool haveCR = PR_FALSE;
|
|
|
|
|
|
|
|
while(!done && current != end) {
|
|
|
|
switch(theChar) {
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
|
|
|
{
|
|
|
|
++aNewlinesSkipped;
|
|
|
|
PRUnichar thePrevChar = theChar;
|
|
|
|
theChar = (++current != end) ? *current : '\0';
|
|
|
|
if ((thePrevChar == '\r' && theChar == '\n') ||
|
|
|
|
(thePrevChar == '\n' && theChar == '\r')) {
|
|
|
|
theChar = (++current != end) ? *current : '\0'; // CRLF == LFCR => LF
|
|
|
|
haveCR = PR_TRUE;
|
|
|
|
} else if (thePrevChar == '\r') {
|
|
|
|
// Lone CR becomes CRLF; callers should know to remove extra CRs
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
aString.writable().Append(PRUnichar('\n'));
|
|
|
|
origin = current;
|
|
|
|
haveCR = PR_TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ' ' :
|
|
|
|
case '\t':
|
|
|
|
theChar = (++current != end) ? *current : '\0';
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
done = PR_TRUE;
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == end) {
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
2007-06-26 17:21:47 -07:00
|
|
|
result = kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
aHaveCR = haveCR;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
//XXXbz callers of this have to manage their lone '\r' themselves if they want
|
|
|
|
//it to work. Good thing they're all in view-source and it deals.
|
|
|
|
nsresult nsScanner::ReadWhitespace(nsScannerIterator& aStart,
|
|
|
|
nsScannerIterator& aEnd,
|
|
|
|
PRInt32& aNewlinesSkipped) {
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRUnichar theChar = 0;
|
|
|
|
nsresult result = Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current, end;
|
|
|
|
PRBool done = PR_FALSE;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
while(!done && current != end) {
|
|
|
|
switch(theChar) {
|
|
|
|
case '\n':
|
|
|
|
case '\r': ++aNewlinesSkipped;
|
|
|
|
case ' ' :
|
|
|
|
case '\t':
|
|
|
|
{
|
|
|
|
PRUnichar thePrevChar = theChar;
|
|
|
|
theChar = (++current != end) ? *current : '\0';
|
|
|
|
if ((thePrevChar == '\r' && theChar == '\n') ||
|
|
|
|
(thePrevChar == '\n' && theChar == '\r')) {
|
|
|
|
theChar = (++current != end) ? *current : '\0'; // CRLF == LFCR => LF
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
done = PR_TRUE;
|
|
|
|
aStart = origin;
|
|
|
|
aEnd = current;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
SetPosition(current);
|
|
|
|
if (current == end) {
|
|
|
|
aStart = origin;
|
|
|
|
aEnd = current;
|
2007-06-26 17:21:47 -07:00
|
|
|
result = kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consume characters until you encounter one contained in given
|
|
|
|
* input set.
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param aString will contain the result of this method
|
|
|
|
* @param aTerminalSet is an ordered string that contains
|
|
|
|
* the set of INVALID characters
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadUntil(nsAString& aString,
|
|
|
|
const nsReadEndCondition& aEndCondition,
|
|
|
|
PRBool addTerminal)
|
|
|
|
{
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current;
|
|
|
|
const PRUnichar* setstart = aEndCondition.mChars;
|
|
|
|
const PRUnichar* setcurrent;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (current != mEndPosition) {
|
|
|
|
theChar = *current;
|
|
|
|
if (theChar == '\0') {
|
|
|
|
ReplaceCharacter(current, sInvalid);
|
|
|
|
theChar = sInvalid;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Filter out completely wrong characters
|
|
|
|
// Check if all bits are in the required area
|
|
|
|
if(!(theChar & aEndCondition.mFilter)) {
|
|
|
|
// They were. Do a thorough check.
|
|
|
|
|
|
|
|
setcurrent = setstart;
|
|
|
|
while (*setcurrent) {
|
|
|
|
if (*setcurrent == theChar) {
|
|
|
|
if(addTerminal)
|
|
|
|
++current;
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
SetPosition(current);
|
|
|
|
|
|
|
|
//DoErrTest(aString);
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
++setcurrent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
++current;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we are here, we didn't find any terminator in the string and
|
|
|
|
// current = mEndPosition
|
|
|
|
SetPosition(current);
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
nsresult nsScanner::ReadUntil(nsScannerSharedSubstring& aString,
|
|
|
|
const nsReadEndCondition& aEndCondition,
|
|
|
|
PRBool addTerminal)
|
|
|
|
{
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current;
|
|
|
|
const PRUnichar* setstart = aEndCondition.mChars;
|
|
|
|
const PRUnichar* setcurrent;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (current != mEndPosition) {
|
|
|
|
theChar = *current;
|
|
|
|
if (theChar == '\0') {
|
|
|
|
ReplaceCharacter(current, sInvalid);
|
|
|
|
theChar = sInvalid;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Filter out completely wrong characters
|
|
|
|
// Check if all bits are in the required area
|
|
|
|
if(!(theChar & aEndCondition.mFilter)) {
|
|
|
|
// They were. Do a thorough check.
|
|
|
|
|
|
|
|
setcurrent = setstart;
|
|
|
|
while (*setcurrent) {
|
|
|
|
if (*setcurrent == theChar) {
|
|
|
|
if(addTerminal)
|
|
|
|
++current;
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
SetPosition(current);
|
|
|
|
|
|
|
|
//DoErrTest(aString);
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
++setcurrent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
++current;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we are here, we didn't find any terminator in the string and
|
|
|
|
// current = mEndPosition
|
|
|
|
SetPosition(current);
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
nsresult nsScanner::ReadUntil(nsScannerIterator& aStart,
|
|
|
|
nsScannerIterator& aEnd,
|
|
|
|
const nsReadEndCondition &aEndCondition,
|
|
|
|
PRBool addTerminal)
|
|
|
|
{
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current;
|
|
|
|
const PRUnichar* setstart = aEndCondition.mChars;
|
|
|
|
const PRUnichar* setcurrent;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
|
|
|
|
PRUnichar theChar=0;
|
|
|
|
nsresult result=Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
aStart = aEnd = current;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (current != mEndPosition) {
|
|
|
|
if (theChar == '\0') {
|
|
|
|
ReplaceCharacter(current, sInvalid);
|
|
|
|
theChar = sInvalid;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Filter out completely wrong characters
|
|
|
|
// Check if all bits are in the required area
|
|
|
|
if(!(theChar & aEndCondition.mFilter)) {
|
|
|
|
// They were. Do a thorough check.
|
|
|
|
setcurrent = setstart;
|
|
|
|
while (*setcurrent) {
|
|
|
|
if (*setcurrent == theChar) {
|
|
|
|
if(addTerminal)
|
|
|
|
++current;
|
|
|
|
aStart = origin;
|
|
|
|
aEnd = current;
|
|
|
|
SetPosition(current);
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
++setcurrent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
++current;
|
|
|
|
theChar = *current;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we are here, we didn't find any terminator in the string and
|
|
|
|
// current = mEndPosition
|
|
|
|
SetPosition(current);
|
|
|
|
aStart = origin;
|
|
|
|
aEnd = current;
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Consumes chars until you see the given terminalChar
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return error code
|
|
|
|
*/
|
|
|
|
nsresult nsScanner::ReadUntil(nsAString& aString,
|
|
|
|
PRUnichar aTerminalChar,
|
|
|
|
PRBool addTerminal)
|
|
|
|
{
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
return kEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator origin, current;
|
|
|
|
|
|
|
|
origin = mCurrentPosition;
|
|
|
|
current = origin;
|
|
|
|
|
|
|
|
PRUnichar theChar;
|
|
|
|
nsresult result = Peek(theChar);
|
|
|
|
|
|
|
|
if (NS_FAILED(result)) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (current != mEndPosition) {
|
|
|
|
if (theChar == '\0') {
|
|
|
|
ReplaceCharacter(current, sInvalid);
|
|
|
|
theChar = sInvalid;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (aTerminalChar == theChar) {
|
|
|
|
if(addTerminal)
|
|
|
|
++current;
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
SetPosition(current);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
++current;
|
|
|
|
theChar = *current;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we are here, we didn't find any terminator in the string and
|
|
|
|
// current = mEndPosition
|
|
|
|
AppendUnicodeTo(origin, current, aString);
|
|
|
|
SetPosition(current);
|
2007-06-26 17:21:47 -07:00
|
|
|
return kEOF;
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::BindSubstring(nsScannerSubstring& aSubstring, const nsScannerIterator& aStart, const nsScannerIterator& aEnd)
|
|
|
|
{
|
|
|
|
aSubstring.Rebind(*mSlidingBuffer, aStart, aEnd);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::CurrentPosition(nsScannerIterator& aPosition)
|
|
|
|
{
|
|
|
|
aPosition = mCurrentPosition;
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::EndReading(nsScannerIterator& aPosition)
|
|
|
|
{
|
|
|
|
aPosition = mEndPosition;
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::SetPosition(nsScannerIterator& aPosition, PRBool aTerminate, PRBool aReverse)
|
|
|
|
{
|
|
|
|
if (mSlidingBuffer) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
PRUint32 origRemaining = mCountRemaining;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (aReverse) {
|
|
|
|
mCountRemaining += (Distance(aPosition, mCurrentPosition));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
mCountRemaining -= (Distance(mCurrentPosition, aPosition));
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_ASSERTION((mCountRemaining >= origRemaining && aReverse) ||
|
|
|
|
(mCountRemaining <= origRemaining && !aReverse),
|
|
|
|
"Improper use of nsScanner::SetPosition. Make sure to set the"
|
|
|
|
" aReverse parameter correctly");
|
|
|
|
|
|
|
|
mCurrentPosition = aPosition;
|
|
|
|
if (aTerminate && (mCurrentPosition == mEndPosition)) {
|
|
|
|
mMarkPosition = mCurrentPosition;
|
|
|
|
mSlidingBuffer->DiscardPrefix(mCurrentPosition);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::ReplaceCharacter(nsScannerIterator& aPosition,
|
|
|
|
PRUnichar aChar)
|
|
|
|
{
|
|
|
|
if (mSlidingBuffer) {
|
|
|
|
mSlidingBuffer->ReplaceCharacter(aPosition, aChar);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsScanner::AppendToBuffer(nsScannerString::Buffer* aBuf,
|
|
|
|
nsIRequest *aRequest)
|
|
|
|
{
|
|
|
|
if (nsParser::sParserDataListeners && mParser &&
|
|
|
|
NS_FAILED(mParser->DataAdded(Substring(aBuf->DataStart(),
|
|
|
|
aBuf->DataEnd()), aRequest))) {
|
|
|
|
// Don't actually append on failure.
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
mSlidingBuffer = new nsScannerString(aBuf);
|
|
|
|
mSlidingBuffer->BeginReading(mCurrentPosition);
|
|
|
|
mMarkPosition = mCurrentPosition;
|
|
|
|
mSlidingBuffer->EndReading(mEndPosition);
|
|
|
|
mCountRemaining = aBuf->DataLength();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
mSlidingBuffer->AppendBuffer(aBuf);
|
|
|
|
if (mCurrentPosition == mEndPosition) {
|
|
|
|
mSlidingBuffer->BeginReading(mCurrentPosition);
|
|
|
|
}
|
|
|
|
mSlidingBuffer->EndReading(mEndPosition);
|
|
|
|
mCountRemaining += aBuf->DataLength();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mFirstNonWhitespacePosition == -1) {
|
|
|
|
nsScannerIterator iter(mCurrentPosition);
|
|
|
|
nsScannerIterator end(mEndPosition);
|
|
|
|
|
|
|
|
while (iter != end) {
|
|
|
|
if (!nsCRT::IsAsciiSpace(*iter)) {
|
|
|
|
mFirstNonWhitespacePosition = Distance(mCurrentPosition, iter);
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
++iter;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* call this to copy bytes out of the scanner that have not yet been consumed
|
|
|
|
* by the tokenization process.
|
|
|
|
*
|
|
|
|
* @update gess 5/12/98
|
|
|
|
* @param aCopyBuffer is where the scanner buffer will be copied to
|
|
|
|
* @return nada
|
|
|
|
*/
|
|
|
|
void nsScanner::CopyUnusedData(nsString& aCopyBuffer) {
|
|
|
|
if (!mSlidingBuffer) {
|
|
|
|
aCopyBuffer.Truncate();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsScannerIterator start, end;
|
|
|
|
start = mCurrentPosition;
|
|
|
|
end = mEndPosition;
|
|
|
|
|
|
|
|
CopyUnicodeTo(start, end, aCopyBuffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Retrieve the name of the file that the scanner is reading from.
|
|
|
|
* In some cases, it's just a given name, because the scanner isn't
|
|
|
|
* really reading from a file.
|
|
|
|
*
|
|
|
|
* @update gess 5/12/98
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
nsString& nsScanner::GetFilename(void) {
|
|
|
|
return mFilename;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Conduct self test. Actually, selftesting for this class
|
|
|
|
* occurs in the parser selftest.
|
|
|
|
*
|
|
|
|
* @update gess 3/25/98
|
|
|
|
* @param
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
|
|
|
|
void nsScanner::SelfTest(void) {
|
|
|
|
#ifdef _DEBUG
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|