/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* ***** 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 TransforMiiX XSLT processor code. * * The Initial Developer of the Original Code is * Netscape Communications Corporation. * Portions created by the Initial Developer are Copyright (C) 2001 * the Initial Developer. All Rights Reserved. * * Contributor(s): * Peter Van der Beken * * Alternatively, the contents of this file may be used under the terms of * either 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 ***** */ #include "nsXPathResult.h" #include "txExprResult.h" #include "txNodeSet.h" #include "nsDOMError.h" #include "nsIContent.h" #include "nsIAttribute.h" #include "nsIDOMClassInfo.h" #include "nsIDOMNode.h" #include "nsIDOMDocument.h" #include "nsDOMString.h" #include "txXPathTreeWalker.h" #include "nsCycleCollectionParticipant.h" nsXPathResult::nsXPathResult() : mDocument(nsnull), mCurrentPos(0), mResultType(ANY_TYPE), mInvalidIteratorState(PR_TRUE), mBooleanResult(PR_FALSE), mNumberResult(0) { } nsXPathResult::nsXPathResult(const nsXPathResult &aResult) : mResult(aResult.mResult), mResultNodes(aResult.mResultNodes), mDocument(aResult.mDocument), mCurrentPos(0), mResultType(aResult.mResultType), mContextNode(aResult.mContextNode), mInvalidIteratorState(aResult.mInvalidIteratorState) { if (mDocument) { mDocument->AddMutationObserver(this); } } nsXPathResult::~nsXPathResult() { RemoveObserver(); } NS_IMPL_CYCLE_COLLECTION_CLASS(nsXPathResult) NS_IMPL_CYCLE_COLLECTION_UNLINK_BEGIN(nsXPathResult) { tmp->RemoveObserver(); } NS_IMPL_CYCLE_COLLECTION_UNLINK_NSCOMPTR(mDocument) NS_IMPL_CYCLE_COLLECTION_UNLINK_END NS_IMPL_CYCLE_COLLECTION_TRAVERSE_BEGIN(nsXPathResult) NS_IMPL_CYCLE_COLLECTION_TRAVERSE_NSCOMPTR(mDocument) NS_IMPL_CYCLE_COLLECTION_TRAVERSE_NSCOMARRAY(mResultNodes) NS_IMPL_CYCLE_COLLECTION_TRAVERSE_END NS_IMPL_CYCLE_COLLECTING_ADDREF_AMBIGUOUS(nsXPathResult, nsIDOMXPathResult) NS_IMPL_CYCLE_COLLECTING_RELEASE_AMBIGUOUS(nsXPathResult, nsIDOMXPathResult) NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(nsXPathResult) NS_INTERFACE_MAP_ENTRY(nsIDOMXPathResult) NS_INTERFACE_MAP_ENTRY(nsIMutationObserver) NS_INTERFACE_MAP_ENTRY(nsIXPathResult) NS_INTERFACE_MAP_ENTRY_AMBIGUOUS(nsISupports, nsIDOMXPathResult) NS_INTERFACE_MAP_ENTRY_CONTENT_CLASSINFO(XPathResult) NS_INTERFACE_MAP_END void nsXPathResult::RemoveObserver() { if (mDocument) { mDocument->RemoveMutationObserver(this); } } NS_IMETHODIMP nsXPathResult::GetResultType(PRUint16 *aResultType) { *aResultType = mResultType; return NS_OK; } NS_IMETHODIMP nsXPathResult::GetNumberValue(double *aNumberValue) { if (mResultType != NUMBER_TYPE) { return NS_ERROR_DOM_TYPE_ERR; } *aNumberValue = mNumberResult; return NS_OK; } NS_IMETHODIMP nsXPathResult::GetStringValue(nsAString &aStringValue) { if (mResultType != STRING_TYPE) { return NS_ERROR_DOM_TYPE_ERR; } aStringValue = mStringResult; return NS_OK; } NS_IMETHODIMP nsXPathResult::GetBooleanValue(PRBool *aBooleanValue) { if (mResultType != BOOLEAN_TYPE) { return NS_ERROR_DOM_TYPE_ERR; } *aBooleanValue = mBooleanResult; return NS_OK; } NS_IMETHODIMP nsXPathResult::GetSingleNodeValue(nsIDOMNode **aSingleNodeValue) { if (!isNode()) { return NS_ERROR_DOM_TYPE_ERR; } if (mResultNodes.Count() > 0) { NS_ADDREF(*aSingleNodeValue = mResultNodes[0]); } else { *aSingleNodeValue = nsnull; } return NS_OK; } NS_IMETHODIMP nsXPathResult::GetInvalidIteratorState(PRBool *aInvalidIteratorState) { *aInvalidIteratorState = isIterator() && mInvalidIteratorState; return NS_OK; } NS_IMETHODIMP nsXPathResult::GetSnapshotLength(PRUint32 *aSnapshotLength) { if (!isSnapshot()) { return NS_ERROR_DOM_TYPE_ERR; } *aSnapshotLength = (PRUint32)mResultNodes.Count(); return NS_OK; } NS_IMETHODIMP nsXPathResult::IterateNext(nsIDOMNode **aResult) { if (!isIterator()) { return NS_ERROR_DOM_TYPE_ERR; } if (mDocument) { mDocument->FlushPendingNotifications(Flush_Content); } if (mInvalidIteratorState) { return NS_ERROR_DOM_INVALID_STATE_ERR; } if (mCurrentPos < (PRUint32)mResultNodes.Count()) { NS_ADDREF(*aResult = mResultNodes[mCurrentPos++]); } else { *aResult = nsnull; } return NS_OK; } NS_IMETHODIMP nsXPathResult::SnapshotItem(PRUint32 aIndex, nsIDOMNode **aResult) { if (!isSnapshot()) { return NS_ERROR_DOM_TYPE_ERR; } NS_IF_ADDREF(*aResult = mResultNodes.SafeObjectAt(aIndex)); return NS_OK; } void nsXPathResult::NodeWillBeDestroyed(const nsINode* aNode) { // Set to null to avoid unregistring unnecessarily mDocument = nsnull; Invalidate(aNode->IsNodeOfType(nsINode::eCONTENT) ? static_cast(aNode) : nsnull); } void nsXPathResult::CharacterDataChanged(nsIDocument* aDocument, nsIContent *aContent, CharacterDataChangeInfo* aInfo) { Invalidate(aContent); } void nsXPathResult::AttributeChanged(nsIDocument* aDocument, nsIContent* aContent, PRInt32 aNameSpaceID, nsIAtom* aAttribute, PRInt32 aModType, PRUint32 aStateMask) { Invalidate(aContent); } void nsXPathResult::ContentAppended(nsIDocument* aDocument, nsIContent* aContainer, PRInt32 aNewIndexInContainer) { Invalidate(aContainer); } void nsXPathResult::ContentInserted(nsIDocument* aDocument, nsIContent* aContainer, nsIContent* aChild, PRInt32 aIndexInContainer) { Invalidate(aContainer); } void nsXPathResult::ContentRemoved(nsIDocument* aDocument, nsIContent* aContainer, nsIContent* aChild, PRInt32 aIndexInContainer) { Invalidate(aContainer); } nsresult nsXPathResult::SetExprResult(txAExprResult* aExprResult, PRUint16 aResultType, nsINode* aContextNode) { if ((isSnapshot(aResultType) || isIterator(aResultType) || isNode(aResultType)) && aExprResult->getResultType() != txAExprResult::NODESET) { // The DOM spec doesn't really say what should happen when reusing an // XPathResult and an error is thrown. Let's not touch the XPathResult // in that case. return NS_ERROR_DOM_TYPE_ERR; } mResultType = aResultType; mContextNode = do_GetWeakReference(aContextNode); if (mDocument) { mDocument->RemoveMutationObserver(this); mDocument = nsnull; } mResultNodes.Clear(); // XXX This will keep the recycler alive, should we clear it? mResult = aExprResult; mBooleanResult = mResult->booleanValue(); mNumberResult = mResult->numberValue(); mResult->stringValue(mStringResult); if (aExprResult && aExprResult->getResultType() == txAExprResult::NODESET) { txNodeSet *nodeSet = static_cast(aExprResult); nsCOMPtr node; PRInt32 i, count = nodeSet->size(); for (i = 0; i < count; ++i) { txXPathNativeNode::getNode(nodeSet->get(i), getter_AddRefs(node)); if (node) { mResultNodes.AppendObject(node); } } if (count > 0) { mResult = nsnull; } } if (!isIterator()) { return NS_OK; } mInvalidIteratorState = PR_FALSE; if (mResultNodes.Count() > 0) { // If we support the document() function in DOM-XPath we need to // observe all documents that we have resultnodes in. nsCOMPtr document; mResultNodes[0]->GetOwnerDocument(getter_AddRefs(document)); if (document) { mDocument = do_QueryInterface(document); } else { mDocument = do_QueryInterface(mResultNodes[0]); } NS_ASSERTION(mDocument, "We need a document!"); if (mDocument) { mDocument->AddMutationObserver(this); } } return NS_OK; } void nsXPathResult::Invalidate(const nsIContent* aChangeRoot) { nsCOMPtr contextNode = do_QueryReferent(mContextNode); if (contextNode && aChangeRoot && aChangeRoot->GetBindingParent()) { // If context node is in anonymous content, changes to // non-anonymous content need to invalidate the XPathResult. If // the changes are happening in a different anonymous trees, no // invalidation should happen. nsIContent* ctxBindingParent = nsnull; if (contextNode->IsNodeOfType(nsINode::eCONTENT)) { ctxBindingParent = static_cast(contextNode.get()) ->GetBindingParent(); } else if (contextNode->IsNodeOfType(nsINode::eATTRIBUTE)) { nsIContent* parent = static_cast(contextNode.get())->GetContent(); if (parent) { ctxBindingParent = parent->GetBindingParent(); } } if (ctxBindingParent != aChangeRoot->GetBindingParent()) { return; } } if (mDocument) { mDocument->RemoveMutationObserver(this); mDocument = nsnull; } mInvalidIteratorState = PR_TRUE; } nsresult nsXPathResult::GetExprResult(txAExprResult** aExprResult) { if (isIterator() && mInvalidIteratorState) { return NS_ERROR_DOM_INVALID_STATE_ERR; } if (mResult) { NS_ADDREF(*aExprResult = mResult); return NS_OK; } if (mResultNodes.Count() == 0) { return NS_ERROR_DOM_INVALID_STATE_ERR; } nsRefPtr nodeSet = new txNodeSet(nsnull); if (!nodeSet) { return NS_ERROR_OUT_OF_MEMORY; } PRUint32 i, count = mResultNodes.Count(); for (i = 0; i < count; ++i) { nsAutoPtr node(txXPathNativeNode::createXPathNode(mResultNodes[i])); if (!node) { return NS_ERROR_OUT_OF_MEMORY; } nodeSet->append(*node); } NS_ADDREF(*aExprResult = nodeSet); return NS_OK; } nsresult nsXPathResult::Clone(nsIXPathResult **aResult) { *aResult = nsnull; if (isIterator() && mInvalidIteratorState) { return NS_ERROR_DOM_INVALID_STATE_ERR; } nsCOMPtr result = new nsXPathResult(*this); if (!result) { return NS_ERROR_OUT_OF_MEMORY; } result.swap(*aResult); return NS_OK; }