xml/soap/webservice

开发平台：
C/C++

XPathMatcher.cpp：源码内容
							/*
 * The Apache Software License, Version 1.1
 *
 * Copyright (c) 2001 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) 1999, International
 * Business Machines, Inc., http://www.ibm.com .  For more information
 * on the Apache Software Foundation, please see
 * <http://www.apache.org/>.
 */
/*
 * $Log: XPathMatcher.cpp,v $
 * Revision 1.2  2001/11/15 17:10:19  knoaman
 * Particle derivation checking support.
 *
 * Revision 1.1  2001/11/02 14:08:40  knoaman
 * Add support for identity constraints.
 *
 */
// ---------------------------------------------------------------------------
//  Includes
// ---------------------------------------------------------------------------
#include <validators/schema/identity/XPathMatcher.hpp>
#include <validators/schema/identity/XercesXPath.hpp>
#include <validators/schema/SchemaElementDecl.hpp>
#include <validators/schema/SchemaAttDef.hpp>
#include <validators/schema/SchemaSymbols.hpp>
// ---------------------------------------------------------------------------
//  XPathMatcher: Constructors and Destructor
// ---------------------------------------------------------------------------
XPathMatcher::XPathMatcher(XercesXPath* const xpath)
    : fShouldBufferContent(false)
    , fBufferContent(false)
    , fLocationPathSize(0)
    , fMatched(0)
    , fNoMatchDepth(0)
    , fCurrentStep(0)
    , fStepIndexes(0)
    , fLocationPaths(0)
    , fIdentityConstraint(0)
    , fMatchedBuffer(128)
{
    try {
        init(xpath);
    }
    catch(...) {
        cleanUp();
        throw;
    }
}
XPathMatcher::XPathMatcher(XercesXPath* const xpath, 
                           const bool shouldBufferContent,
                           IdentityConstraint* const ic)
    : fShouldBufferContent(shouldBufferContent)
    , fLocationPathSize(0)
    , fMatched(0)
    , fNoMatchDepth(0)
    , fCurrentStep(0)
    , fLocationPaths(0)
    , fIdentityConstraint(ic)
    , fMatchedBuffer(0)
{
    try {
        init(xpath);
    }
    catch(...) {
        cleanUp();
        throw;
    }
}
XPathMatcher::~XPathMatcher()
{
    cleanUp();
}
// ---------------------------------------------------------------------------
//  XPathMatcher: Helper methods
// ---------------------------------------------------------------------------
void XPathMatcher::init(XercesXPath* const xpath) {
    if (xpath) {
        fLocationPaths = xpath->getLocationPaths();
        fLocationPathSize = (fLocationPaths ? fLocationPaths->size() : 0);
        if (fLocationPathSize) {
            fStepIndexes = new RefVectorOf<ValueStackOf<int> >(fLocationPathSize);
            fCurrentStep = new int[fLocationPathSize];
            fNoMatchDepth = new int[fLocationPathSize];
            fMatched = new bool[fLocationPathSize];
            for(unsigned int i=0; i < fLocationPathSize; i++) {
                fStepIndexes->addElement(new ValueStackOf<int>(8));
            }
        }
    }
}
void XPathMatcher::clear() {
        fBufferContent = false;
        fMatchedBuffer.reset();
        for(int i = 0; i < (int) fLocationPathSize; i++)
            fMatched[i] = false;
}
// ---------------------------------------------------------------------------
//  XPathMatcher: XMLDocumentHandler methods
// ---------------------------------------------------------------------------
void XPathMatcher::startDocumentFragment() {
    // reset state
    clear();
    for(unsigned int i = 0; i < fLocationPathSize; i++) {
        fStepIndexes->elementAt(i)->removeAllElements();
        fCurrentStep[i] = 0;
        fNoMatchDepth[i] = 0;
        fMatched[i] = false;
    }
}
void XPathMatcher::startElement(const XMLElementDecl& elemDecl,
                                const unsigned int urlId,
                                const XMLCh* const elemPrefix,
								const RefVectorOf<XMLAttr>& attrList,
                                const unsigned int attrCount) {
    for (int i = 0; i < (int) fLocationPathSize; i++) {
        // push context 
        int startStep = fCurrentStep[i];
        fStepIndexes->elementAt(i)->push(startStep);
        // try next xpath, if not matching
        if (fMatched[i] || fNoMatchDepth[i] > 0) {
            fNoMatchDepth[i]++;
            continue;
        }
        // consume self::node() steps
        XercesLocationPath* locPath = fLocationPaths->elementAt(i);
        int stepSize = locPath->getStepSize();
        while (fCurrentStep[i] < stepSize &&
               locPath->getStep(fCurrentStep[i])->getAxisType() == XercesStep::SELF) {
            fCurrentStep[i]++;
        }
        if (fCurrentStep[i] == stepSize) {
            fMatched[i] = true;
            int j=0;
            for(; j<i && !fMatched[j]; j++);
            if(j==i)
                fBufferContent = fShouldBufferContent;
            continue;
        }
        
        // now if the current step is a descendant step, we let the next
        // step do its thing; if it fails, we reset ourselves
        // to look at this step for next time we're called.
        // so first consume all descendants:
        int descendantStep = fCurrentStep[i];
        while (fCurrentStep[i] < stepSize &&
               locPath->getStep(fCurrentStep[i])->getAxisType() == XercesStep::DESCENDANT) {
            fCurrentStep[i]++;
        }
        if (fCurrentStep[i] == stepSize) {
            fNoMatchDepth[i]++;
            continue;
        }
        // match child::... step, if haven't consumed any self::node()
        if ((fCurrentStep[i] == startStep || fCurrentStep[i] > descendantStep) &&
            locPath->getStep(fCurrentStep[i])->getAxisType() == XercesStep::CHILD) {
            XercesStep* step = locPath->getStep(fCurrentStep[i]);
            XercesNodeTest* nodeTest = step->getNodeTest();
            if (nodeTest->getType() == XercesNodeTest::QNAME) {
                QName elemQName(elemPrefix, elemDecl.getElementName()->getLocalPart(), urlId);
//                if (!(*(nodeTest->getName()) == *(elemDecl.getElementName()))) {
                if (!(*(nodeTest->getName()) == elemQName)) {
                    if(fCurrentStep[i] > descendantStep) {
                        fCurrentStep[i] = descendantStep;
                        continue;
                    }
                    fNoMatchDepth[i]++;
                    continue;
                }
            }
            fCurrentStep[i]++;
        }
        if (fCurrentStep[i] == stepSize) {
            fMatched[i] = true;
            int j=0;
            for(; j<i && !fMatched[j]; j++);
            if(j==i)
                fBufferContent = fShouldBufferContent;
            continue;
        }
        // match attribute::... step
        if (fCurrentStep[i] < stepSize &&
            locPath->getStep(fCurrentStep[i])->getAxisType() == XercesStep::ATTRIBUTE) {
            if (attrCount) {
                XercesNodeTest* nodeTest = locPath->getStep(fCurrentStep[i])->getNodeTest();
                for (unsigned int attrIndex = 0; attrIndex < attrCount; attrIndex++) {
                    const XMLAttr* curDef = attrList.elementAt(attrIndex);
                    if (nodeTest->getType() != XercesNodeTest::QNAME ||
                        (*(nodeTest->getName()) == *(curDef->getAttName()))) {
                        fCurrentStep[i]++;
                        if (fCurrentStep[i] == stepSize) {
                            fMatched[i] = true;
                            int j=0;
                            for(; j<i && !fMatched[j]; j++);
                            if(j == i) {
                                SchemaAttDef* attDef = ((SchemaElementDecl&) elemDecl).getAttDef(curDef->getName(), curDef->getURIId());
                                DatatypeValidator* dv = (attDef) ? attDef->getDatatypeValidator() : 0;
                                matched(curDef->getValue(), dv, false);
                            }
                        }
                        break;
                    }
                }
            }
            if (!fMatched[i]) {
                if(fCurrentStep[i] > descendantStep) {
                    fCurrentStep[i] = descendantStep;
                    continue;
                }
                fNoMatchDepth[i]++;
            }
        }
    }
}
void XPathMatcher::docCharacters(const XMLCh* const chars,
                                 const unsigned int length) {
    // collect match content
    // so long as one of our paths is matching, store the content
    for(int i=0; i < (int) fLocationPathSize; i++) {
        if (fBufferContent && fNoMatchDepth[i] == 0) {
            fMatchedBuffer.append(chars, length);
            break;
        }
    }
}
void XPathMatcher::endElement(const XMLElementDecl& elemDecl) {
    for(int i = 0; i < (int) fLocationPathSize; i++) {
        // don't do anything, if not matching
        if (fNoMatchDepth[i] > 0) {
            fNoMatchDepth[i]--;
        }
        // signal match, if appropriate
        else {
            int j=0;
            for(; j<i && !fMatched[j]; j++);
            if (j < i) 
				continue;
            if (fBufferContent) {
                DatatypeValidator* dv = ((SchemaElementDecl*) &elemDecl)->getDatatypeValidator();
                bool isNillable = (((SchemaElementDecl *) &elemDecl)->getMiscFlags() & SchemaSymbols::NILLABLE) != 0;
                fBufferContent = false;
                matched(fMatchedBuffer.getRawBuffer(), dv, isNillable);
            }
            clear();
        }
        // go back a step
        fCurrentStep[i] = fStepIndexes->elementAt(i)->pop();
    }
}
void XPathMatcher::endDocumentFragment() {
    clear();
}
// ---------------------------------------------------------------------------
//  XPathMatcher: Match methods
// ---------------------------------------------------------------------------
bool XPathMatcher::isMatched() {
    // xpath has been matched if any one of the members of the union have matched.
    for (int i=0; i < (int) fLocationPathSize; i++) {
        if (fMatched[i])
            return true;
    }
    return false;
}
void XPathMatcher::matched(const XMLCh* const content,
                           DatatypeValidator* const dv,
                           const bool isNil) {
    return;
}
/**
  * End of file XPathMatcher.cpp
  */

						