| /** |
| * This file is part of the DOM implementation for KDE. |
| * |
| * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| * (C) 2001 Dirk Mueller (mueller@kde.org) |
| * Copyright (C) 2004, 2005, 2006 Apple Computer, Inc. |
| * |
| * This library is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Library General Public |
| * License as published by the Free Software Foundation; either |
| * version 2 of the License, or (at your option) any later version. |
| * |
| * This library is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Library General Public License for more details. |
| * |
| * You should have received a copy of the GNU Library General Public License |
| * along with this library; see the file COPYING.LIB. If not, write to |
| * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| * Boston, MA 02111-1307, USA. |
| */ |
| |
| #include "config.h" |
| #include "Node.h" |
| |
| #include "AtomicString.h" |
| #include "ChildNodeList.h" |
| #include "DOMImplementation.h" |
| #include "Document.h" |
| #include "ExceptionCode.h" |
| #include "Frame.h" |
| #include "FrameView.h" |
| #include "Text.h" |
| #include "htmlediting.h" |
| #include "htmlnames.h" |
| #include "kjs_binding.h" |
| #include "RenderObject.h" |
| #include <kxmlcore/Assertions.h> |
| #include <qtextstream.h> |
| |
| namespace WebCore { |
| |
| using namespace HTMLNames; |
| |
| /** |
| * NodeList which lists all Nodes in a document with a given tag name |
| */ |
| class TagNodeList : public NodeList |
| { |
| public: |
| TagNodeList(Node *n, const AtomicString& namespaceURI, const AtomicString& localName); |
| |
| // DOM methods overridden from parent classes |
| virtual unsigned length() const; |
| virtual Node *item (unsigned index) const; |
| |
| // Other methods (not part of DOM) |
| |
| protected: |
| virtual bool nodeMatches(Node *testNode) const; |
| |
| AtomicString m_namespaceURI; |
| AtomicString m_localName; |
| }; |
| |
| TagNodeList::TagNodeList(Node *n, const AtomicString& namespaceURI, const AtomicString& localName) |
| : NodeList(n), |
| m_namespaceURI(namespaceURI), |
| m_localName(localName) |
| { |
| } |
| |
| unsigned TagNodeList::length() const |
| { |
| return recursiveLength(); |
| } |
| |
| Node *TagNodeList::item(unsigned index) const |
| { |
| return recursiveItem(index); |
| } |
| |
| bool TagNodeList::nodeMatches(Node *testNode) const |
| { |
| if (!testNode->isElementNode()) |
| return false; |
| |
| if (m_namespaceURI != starAtom && m_namespaceURI != testNode->namespaceURI()) |
| return false; |
| |
| return m_localName == starAtom || m_localName == testNode->localName(); |
| } |
| |
| |
| #ifndef NDEBUG |
| struct NodeImplCounter { |
| static int count; |
| ~NodeImplCounter() { if (count != 0) fprintf(stderr, "LEAK: %d Node\n", count); } |
| }; |
| int NodeImplCounter::count = 0; |
| static NodeImplCounter nodeImplCounter; |
| |
| int gEventDispatchForbidden = 0; |
| #endif NDEBUG |
| |
| Node::Node(Document *doc) |
| : document(doc), |
| m_previous(0), |
| m_next(0), |
| m_renderer(0), |
| m_nodeLists(0), |
| m_tabIndex(0), |
| m_hasId(false), |
| m_hasClass(false), |
| m_hasStyle(false), |
| m_attached(false), |
| m_changed(false), |
| m_hasChangedChild(false), |
| m_inDocument(false), |
| m_isLink(false), |
| m_specified(false), |
| m_focused(false), |
| m_active(false), |
| m_hovered(false), |
| m_inActiveChain(false), |
| m_styleElement(false), |
| m_implicit(false), |
| m_inDetach(false) |
| { |
| #ifndef NDEBUG |
| ++NodeImplCounter::count; |
| #endif |
| } |
| |
| void Node::setDocument(Document *doc) |
| { |
| if (inDocument()) |
| return; |
| |
| document = doc; |
| } |
| |
| Node::~Node() |
| { |
| #ifndef NDEBUG |
| --NodeImplCounter::count; |
| #endif |
| if (renderer()) |
| detach(); |
| delete m_nodeLists; |
| if (m_previous) |
| m_previous->setNextSibling(0); |
| if (m_next) |
| m_next->setPreviousSibling(0); |
| } |
| |
| String Node::nodeValue() const |
| { |
| return String(); |
| } |
| |
| void Node::setNodeValue( const String &/*_nodeValue*/, ExceptionCode& ec) |
| { |
| // NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly |
| if (isReadOnly()) { |
| ec = NO_MODIFICATION_ALLOWED_ERR; |
| return; |
| } |
| |
| // be default nodeValue is null, so setting it has no effect |
| } |
| |
| PassRefPtr<NodeList> Node::childNodes() |
| { |
| return new ChildNodeList(this); |
| } |
| |
| Node *Node::firstChild() const |
| { |
| return 0; |
| } |
| |
| Node *Node::lastChild() const |
| { |
| return 0; |
| } |
| |
| Node *Node::lastDescendant() const |
| { |
| Node *n = const_cast<Node *>(this); |
| while (n && n->lastChild()) |
| n = n->lastChild(); |
| return n; |
| } |
| |
| bool Node::insertBefore(PassRefPtr<Node>, Node*, ExceptionCode& ec) |
| { |
| ec = HIERARCHY_REQUEST_ERR; |
| return false; |
| } |
| |
| bool Node::replaceChild(PassRefPtr<Node>, Node*, ExceptionCode& ec) |
| { |
| ec = HIERARCHY_REQUEST_ERR; |
| return false; |
| } |
| |
| bool Node::removeChild(Node*, ExceptionCode& ec) |
| { |
| ec = NOT_FOUND_ERR; |
| return false; |
| } |
| |
| bool Node::appendChild(PassRefPtr<Node>, ExceptionCode& ec) |
| { |
| ec = HIERARCHY_REQUEST_ERR; |
| return false; |
| } |
| |
| void Node::remove(ExceptionCode& ec) |
| { |
| ref(); |
| if (Node *p = parentNode()) |
| p->removeChild(this, ec); |
| else |
| ec = HIERARCHY_REQUEST_ERR; |
| deref(); |
| } |
| |
| bool Node::hasChildNodes( ) const |
| { |
| return false; |
| } |
| |
| void Node::normalize () |
| { |
| ExceptionCode ec = 0; |
| Node *child = firstChild(); |
| |
| if (isElementNode()) { |
| // Normalize any attribute children we might have |
| Element *element = static_cast<Element *>(this); |
| NamedAttrMap *attrMap = element->attributes(); |
| |
| if (attrMap) { |
| unsigned numAttrs = attrMap->length(); |
| |
| for (unsigned i = 0; i < numAttrs; i++) { |
| Attribute *attribute = attrMap->attributeItem(i); |
| Attr *attr = attribute->attr(); |
| |
| if (attr) |
| attr->normalize(); |
| } |
| } |
| } |
| |
| // Recursively go through the subtree beneath us, normalizing all nodes. In the case |
| // where there are two adjacent text nodes, they are merged together |
| while (child) { |
| Node *nextChild = child->nextSibling(); |
| |
| if (nextChild && child->nodeType() == TEXT_NODE && nextChild->nodeType() == TEXT_NODE) { |
| // Current child and the next one are both text nodes... merge them |
| Text *currentText = static_cast<Text*>(child); |
| Text *nextText = static_cast<Text*>(nextChild); |
| |
| currentText->appendData(nextText->data(),ec); |
| if (ec) |
| return; |
| |
| nextChild->remove(ec); |
| if (ec) |
| return; |
| } |
| else { |
| child->normalize(); |
| child = nextChild; |
| } |
| } |
| |
| // Check if we have a single empty text node left and remove it if so |
| child = firstChild(); |
| if (child && !child->nextSibling() && child->isTextNode()) { |
| Text *text = static_cast<Text*>(child); |
| if (text->data().isEmpty()) |
| child->remove(ec); |
| } |
| } |
| |
| const AtomicString& Node::prefix() const |
| { |
| // For nodes other than elements and attributes, the prefix is always null |
| return nullAtom; |
| } |
| |
| void Node::setPrefix(const AtomicString &/*_prefix*/, ExceptionCode& ec) |
| { |
| // The spec says that for nodes other than elements and attributes, prefix is always null. |
| // It does not say what to do when the user tries to set the prefix on another type of |
| // node, however mozilla throws a NAMESPACE_ERR exception |
| ec = NAMESPACE_ERR; |
| } |
| |
| const AtomicString& Node::localName() const |
| { |
| return emptyAtom; |
| } |
| |
| const AtomicString& Node::namespaceURI() const |
| { |
| return nullAtom; |
| } |
| |
| ContainerNode* Node::addChild(PassRefPtr<Node>) |
| { |
| return 0; |
| } |
| |
| bool Node::isContentEditable() const |
| { |
| return parent() && parent()->isContentEditable(); |
| } |
| |
| IntRect Node::getRect() const |
| { |
| int _x, _y; |
| if (renderer() && renderer()->absolutePosition(_x, _y)) |
| return IntRect( _x, _y, renderer()->width(), renderer()->height() + renderer()->borderTopExtra() + renderer()->borderBottomExtra()); |
| |
| return IntRect(); |
| } |
| |
| void Node::setChanged(bool b) |
| { |
| if (b && !attached()) // changed compared to what? |
| return; |
| |
| m_changed = b; |
| if ( b ) { |
| Node *p = parentNode(); |
| while ( p ) { |
| p->setHasChangedChild( true ); |
| p = p->parentNode(); |
| } |
| getDocument()->setDocumentChanged(true); |
| } |
| } |
| |
| bool Node::isFocusable() const |
| { |
| return false; |
| } |
| |
| bool Node::isKeyboardFocusable() const |
| { |
| return isFocusable(); |
| } |
| |
| bool Node::isMouseFocusable() const |
| { |
| return isFocusable(); |
| } |
| |
| unsigned Node::nodeIndex() const |
| { |
| Node *_tempNode = previousSibling(); |
| unsigned count=0; |
| for( count=0; _tempNode; count++ ) |
| _tempNode = _tempNode->previousSibling(); |
| return count; |
| } |
| |
| void Node::registerNodeList(NodeList* list) |
| { |
| if (!m_nodeLists) |
| m_nodeLists = new NodeListSet; |
| m_nodeLists->add(list); |
| } |
| |
| void Node::unregisterNodeList(NodeList* list) |
| { |
| if (!m_nodeLists) |
| return; |
| m_nodeLists->remove(list); |
| } |
| |
| void Node::notifyLocalNodeListsAttributeChanged() |
| { |
| if (!m_nodeLists) |
| return; |
| |
| NodeListSet::iterator end = m_nodeLists->end(); |
| for (NodeListSet::iterator i = m_nodeLists->begin(); i != end; ++i) |
| (*i)->rootNodeAttributeChanged(); |
| } |
| |
| void Node::notifyNodeListsAttributeChanged() |
| { |
| for (Node *n = this; n; n = n->parentNode()) |
| n->notifyLocalNodeListsAttributeChanged(); |
| } |
| |
| void Node::notifyLocalNodeListsChildrenChanged() |
| { |
| if (!m_nodeLists) |
| return; |
| |
| NodeListSet::iterator end = m_nodeLists->end(); |
| for (NodeListSet::iterator i = m_nodeLists->begin(); i != end; ++i) |
| (*i)->rootNodeChildrenChanged(); |
| } |
| |
| void Node::notifyNodeListsChildrenChanged() |
| { |
| for (Node *n = this; n; n = n->parentNode()) |
| n->notifyLocalNodeListsChildrenChanged(); |
| } |
| |
| unsigned Node::childNodeCount() const |
| { |
| return 0; |
| } |
| |
| Node *Node::childNode(unsigned /*index*/) const |
| { |
| return 0; |
| } |
| |
| Node *Node::traverseNextNode(const Node *stayWithin) const |
| { |
| if (firstChild()) { |
| assert(!stayWithin || firstChild()->isAncestor(stayWithin)); |
| return firstChild(); |
| } |
| if (this == stayWithin) |
| return 0; |
| if (nextSibling()) { |
| assert(!stayWithin || nextSibling()->isAncestor(stayWithin)); |
| return nextSibling(); |
| } |
| const Node *n = this; |
| while (n && !n->nextSibling() && (!stayWithin || n->parentNode() != stayWithin)) |
| n = n->parentNode(); |
| if (n) { |
| assert(!stayWithin || !n->nextSibling() || n->nextSibling()->isAncestor(stayWithin)); |
| return n->nextSibling(); |
| } |
| return 0; |
| } |
| |
| Node *Node::traverseNextSibling(const Node *stayWithin) const |
| { |
| if (this == stayWithin) |
| return 0; |
| if (nextSibling()) { |
| assert(!stayWithin || nextSibling()->isAncestor(stayWithin)); |
| return nextSibling(); |
| } |
| const Node *n = this; |
| while (n && !n->nextSibling() && (!stayWithin || n->parentNode() != stayWithin)) |
| n = n->parentNode(); |
| if (n) { |
| assert(!stayWithin || !n->nextSibling() || n->nextSibling()->isAncestor(stayWithin)); |
| return n->nextSibling(); |
| } |
| return 0; |
| } |
| |
| Node *Node::traversePreviousNode() const |
| { |
| if (previousSibling()) { |
| Node *n = previousSibling(); |
| while (n->lastChild()) |
| n = n->lastChild(); |
| return n; |
| } |
| |
| return parentNode(); |
| } |
| |
| Node *Node::traversePreviousNodePostOrder(const Node *stayWithin) const |
| { |
| if (lastChild()) { |
| assert(!stayWithin || lastChild()->isAncestor(stayWithin)); |
| return lastChild(); |
| } |
| if (this == stayWithin) |
| return 0; |
| if (previousSibling()) { |
| assert(!stayWithin || previousSibling()->isAncestor(stayWithin)); |
| return previousSibling(); |
| } |
| const Node *n = this; |
| while (n && !n->previousSibling() && (!stayWithin || n->parentNode() != stayWithin)) |
| n = n->parentNode(); |
| if (n) { |
| assert(!stayWithin || !n->previousSibling() || n->previousSibling()->isAncestor(stayWithin)); |
| return n->previousSibling(); |
| } |
| return 0; |
| } |
| |
| void Node::checkSetPrefix(const AtomicString &_prefix, ExceptionCode& ec) |
| { |
| // Perform error checking as required by spec for setting Node.prefix. Used by |
| // Element::setPrefix() and Attr::setPrefix() |
| |
| // FIXME: Implement support for INVALID_CHARACTER_ERR: Raised if the specified prefix contains an illegal character. |
| |
| // NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly. |
| if (isReadOnly()) { |
| ec = NO_MODIFICATION_ALLOWED_ERR; |
| return; |
| } |
| |
| // FIXME: Implement NAMESPACE_ERR: - Raised if the specified prefix is malformed |
| // We have to comment this out, since it's used for attributes and tag names, and we've only |
| // switched one over. |
| /* |
| // - if the namespaceURI of this node is null, |
| // - if the specified prefix is "xml" and the namespaceURI of this node is different from |
| // "http://www.w3.org/XML/1998/namespace", |
| // - if this node is an attribute and the specified prefix is "xmlns" and |
| // the namespaceURI of this node is different from "http://www.w3.org/2000/xmlns/", |
| // - or if this node is an attribute and the qualifiedName of this node is "xmlns" [Namespaces]. |
| if ((namespacePart(id()) == noNamespace && id() > ID_LAST_TAG) || |
| (_prefix == "xml" && String(getDocument()->namespaceURI(id())) != "http://www.w3.org/XML/1998/namespace")) { |
| ec = NAMESPACE_ERR; |
| return; |
| }*/ |
| } |
| |
| void Node::checkAddChild(Node *newChild, ExceptionCode& ec) |
| { |
| // Perform error checking as required by spec for adding a new child. Used by |
| // appendChild(), replaceChild() and insertBefore() |
| |
| // Not mentioned in spec: throw NOT_FOUND_ERR if newChild is null |
| if (!newChild) { |
| ec = NOT_FOUND_ERR; |
| return; |
| } |
| |
| // NO_MODIFICATION_ALLOWED_ERR: Raised if this node is readonly |
| if (isReadOnly()) { |
| ec = NO_MODIFICATION_ALLOWED_ERR; |
| return; |
| } |
| |
| bool shouldAdoptChild = false; |
| |
| // WRONG_DOCUMENT_ERR: Raised if newChild was created from a different document than the one that |
| // created this node. |
| // We assume that if newChild is a DocumentFragment, all children are created from the same document |
| // as the fragment itself (otherwise they could not have been added as children) |
| if (newChild->getDocument() != getDocument()) { |
| // but if the child is not in a document yet then loosen the |
| // restriction, so that e.g. creating an element with the Option() |
| // constructor and then adding it to a different document works, |
| // as it does in Mozilla and Mac IE. |
| if (!newChild->inDocument()) { |
| shouldAdoptChild = true; |
| } else { |
| ec = WRONG_DOCUMENT_ERR; |
| return; |
| } |
| } |
| |
| // HIERARCHY_REQUEST_ERR: Raised if this node is of a type that does not allow children of the type of the |
| // newChild node, or if the node to append is one of this node's ancestors. |
| |
| // check for ancestor/same node |
| if (newChild == this || isAncestor(newChild)) { |
| ec = HIERARCHY_REQUEST_ERR; |
| return; |
| } |
| |
| if (newChild->nodeType() != DOCUMENT_FRAGMENT_NODE) { |
| if (!childTypeAllowed(newChild->nodeType())) { |
| ec = HIERARCHY_REQUEST_ERR; |
| return; |
| } |
| } |
| else { |
| for (Node *n = newChild->firstChild(); n; n = n->nextSibling()) { |
| if (!childTypeAllowed(n->nodeType())) { |
| ec = HIERARCHY_REQUEST_ERR; |
| return; |
| } |
| } |
| } |
| |
| // change the document pointer of newChild and all of its children to be the new document |
| if (shouldAdoptChild) { |
| for (Node* node = newChild; node; node = node->traverseNextNode(newChild)) { |
| KJS::ScriptInterpreter::updateDOMNodeDocument(node, node->getDocument(), getDocument()); |
| node->setDocument(getDocument()); |
| } |
| } |
| } |
| |
| bool Node::isAncestor(const Node *other) const |
| { |
| // Return true if other is an ancestor of this, otherwise false |
| if (!other) |
| return false; |
| for (const Node *n = parentNode(); n; n = n->parentNode()) { |
| if (n == other) |
| return true; |
| } |
| return false; |
| } |
| |
| bool Node::childAllowed( Node *newChild ) |
| { |
| return childTypeAllowed(newChild->nodeType()); |
| } |
| |
| Node::StyleChange Node::diff( WebCore::RenderStyle *s1, WebCore::RenderStyle *s2 ) const |
| { |
| // FIXME: The behavior of this function is just totally wrong. It doesn't handle |
| // explicit inheritance of non-inherited properties and so you end up not re-resolving |
| // style in cases where you need to. |
| StyleChange ch = NoInherit; |
| EDisplay display1 = s1 ? s1->display() : NONE; |
| bool fl1 = s1 ? s1->hasPseudoStyle(RenderStyle::FIRST_LETTER) : false; |
| EDisplay display2 = s2 ? s2->display() : NONE; |
| bool fl2 = s2 ? s2->hasPseudoStyle(RenderStyle::FIRST_LETTER) : false; |
| if (display1 != display2 || fl1 != fl2) |
| ch = Detach; |
| else if ( !s1 || !s2 ) |
| ch = Inherit; |
| else if ( *s1 == *s2 ) |
| ch = NoChange; |
| else if ( s1->inheritedNotEqual( s2 ) ) |
| ch = Inherit; |
| return ch; |
| } |
| |
| #ifndef NDEBUG |
| void Node::dump(QTextStream *stream, DeprecatedString ind) const |
| { |
| // ### implement dump() for all appropriate subclasses |
| |
| if (m_hasId) { *stream << " hasId"; } |
| if (m_hasClass) { *stream << " hasClass"; } |
| if (m_hasStyle) { *stream << " hasStyle"; } |
| if (m_specified) { *stream << " specified"; } |
| if (m_focused) { *stream << " focused"; } |
| if (m_active) { *stream << " active"; } |
| if (m_styleElement) { *stream << " styleElement"; } |
| if (m_implicit) { *stream << " implicit"; } |
| |
| *stream << " tabIndex=" << m_tabIndex; |
| *stream << endl; |
| |
| Node *child = firstChild(); |
| while(child) { |
| *stream << ind << child->nodeName().deprecatedString().ascii() << ": "; |
| child->dump(stream,ind+" "); |
| child = child->nextSibling(); |
| } |
| } |
| #endif |
| |
| void Node::attach() |
| { |
| assert(!attached()); |
| assert(!renderer() || (renderer()->style() && renderer()->parent())); |
| getDocument()->incDOMTreeVersion(); |
| m_attached = true; |
| } |
| |
| void Node::willRemove() |
| { |
| } |
| |
| void Node::detach() |
| { |
| m_inDetach = true; |
| // assert(m_attached); |
| |
| if (renderer()) |
| renderer()->destroy(); |
| setRenderer(0); |
| |
| Document* doc = getDocument(); |
| if (m_hovered) |
| doc->hoveredNodeDetached(this); |
| if (m_inActiveChain) |
| doc->activeChainNodeDetached(this); |
| doc->incDOMTreeVersion(); |
| |
| m_active = false; |
| m_hovered = false; |
| m_inActiveChain = false; |
| m_attached = false; |
| m_inDetach = false; |
| } |
| |
| bool Node::maintainsState() |
| { |
| return false; |
| } |
| |
| DeprecatedString Node::state() |
| { |
| return DeprecatedString::null; |
| } |
| |
| void Node::restoreState(DeprecatedStringList &/*states*/) |
| { |
| } |
| |
| void Node::insertedIntoDocument() |
| { |
| setInDocument(true); |
| insertedIntoTree(false); |
| } |
| |
| void Node::removedFromDocument() |
| { |
| setInDocument(false); |
| removedFromTree(false); |
| } |
| |
| void Node::childrenChanged() |
| { |
| } |
| |
| bool Node::isReadOnly() |
| { |
| // Entity & Entity Reference nodes and their descendants are read-only |
| Node *n = this; |
| while (n) { |
| if (n->nodeType() == ENTITY_NODE || n->nodeType() == ENTITY_REFERENCE_NODE) |
| return true; |
| n = n->parentNode(); |
| } |
| return false; |
| } |
| |
| Node *Node::previousEditable() const |
| { |
| Node *node = previousLeafNode(); |
| while (node) { |
| if (node->isContentEditable()) |
| return node; |
| node = node->previousLeafNode(); |
| } |
| return 0; |
| } |
| |
| // Offset specifies the child node to start at. If it is past |
| // the last child, it specifies to start at next sibling. |
| Node *Node::nextEditable(int offset) const |
| { |
| assert(offset>=0); |
| Node *node; |
| if (hasChildNodes()) |
| node = (offset >= (int)childNodeCount()) ? nextSibling() : childNode(offset)->nextLeafNode(); |
| else |
| node = nextLeafNode(); |
| while (node) { |
| if (node->isContentEditable()) |
| return node; |
| node = node->nextLeafNode(); |
| } |
| return 0; |
| } |
| |
| Node *Node::nextEditable() const |
| { |
| Node *node = nextLeafNode(); |
| while (node) { |
| if (node->isContentEditable()) |
| return node; |
| node = node->nextLeafNode(); |
| } |
| return 0; |
| } |
| |
| RenderObject * Node::previousRenderer() |
| { |
| for (Node *n = previousSibling(); n; n = n->previousSibling()) { |
| if (n->renderer()) |
| return n->renderer(); |
| } |
| return 0; |
| } |
| |
| RenderObject * Node::nextRenderer() |
| { |
| // Avoid an O(n^2) problem with this function by not checking for nextRenderer() when the parent element hasn't even |
| // been attached yet. |
| if (parent() && !parent()->attached()) |
| return 0; |
| |
| for (Node *n = nextSibling(); n; n = n->nextSibling()) { |
| if (n->renderer()) |
| return n->renderer(); |
| } |
| return 0; |
| } |
| |
| // FIXME: This code is used by editing. Seems like it could move over there and not pollute Node. |
| Node *Node::previousNodeConsideringAtomicNodes() const |
| { |
| if (previousSibling()) { |
| Node *n = previousSibling(); |
| while (!isAtomicNode(n) && n->lastChild()) |
| n = n->lastChild(); |
| return n; |
| } |
| else if (parentNode()) { |
| return parentNode(); |
| } |
| else { |
| return 0; |
| } |
| } |
| |
| Node *Node::nextNodeConsideringAtomicNodes() const |
| { |
| if (!isAtomicNode(this) && firstChild()) |
| return firstChild(); |
| if (nextSibling()) |
| return nextSibling(); |
| const Node *n = this; |
| while (n && !n->nextSibling()) |
| n = n->parentNode(); |
| if (n) |
| return n->nextSibling(); |
| return 0; |
| } |
| |
| Node *Node::previousLeafNode() const |
| { |
| Node *node = previousNodeConsideringAtomicNodes(); |
| while (node) { |
| if (isAtomicNode(node)) |
| return node; |
| node = node->previousNodeConsideringAtomicNodes(); |
| } |
| return 0; |
| } |
| |
| Node *Node::nextLeafNode() const |
| { |
| Node *node = nextNodeConsideringAtomicNodes(); |
| while (node) { |
| if (isAtomicNode(node)) |
| return node; |
| node = node->nextNodeConsideringAtomicNodes(); |
| } |
| return 0; |
| } |
| |
| void Node::createRendererIfNeeded() |
| { |
| if (!getDocument()->shouldCreateRenderers()) |
| return; |
| |
| assert(!attached()); |
| assert(!renderer()); |
| |
| Node *parent = parentNode(); |
| assert(parent); |
| |
| RenderObject *parentRenderer = parent->renderer(); |
| if (parentRenderer && parentRenderer->canHaveChildren() |
| #if SVG_SUPPORT |
| && parent->childShouldCreateRenderer(this) |
| #endif |
| ) { |
| RenderStyle* style = styleForRenderer(parentRenderer); |
| style->ref(); |
| #ifndef KHTML_NO_XBL |
| bool resolveStyle = false; |
| if (getDocument()->bindingManager()->loadBindings(this, style->bindingURIs(), true, &resolveStyle) && |
| rendererIsNeeded(style)) { |
| if (resolveStyle) { |
| style->deref(); |
| style = styleForRenderer(parentRenderer); |
| } |
| #else |
| if (rendererIsNeeded(style)) { |
| #endif |
| setRenderer(createRenderer(getDocument()->renderArena(), style)); |
| if (renderer()) { |
| renderer()->setStyle(style); |
| parentRenderer->addChild(renderer(), nextRenderer()); |
| } |
| #ifndef KHTML_NO_XBL |
| } // avoid confusing the change log code parser by having two close braces to match the two open braces above |
| #else |
| } |
| #endif |
| style->deref(getDocument()->renderArena()); |
| } |
| } |
| |
| RenderStyle *Node::styleForRenderer(RenderObject *parent) |
| { |
| return parent->style(); |
| } |
| |
| bool Node::rendererIsNeeded(RenderStyle *style) |
| { |
| return (getDocument()->documentElement() == this) || (style->display() != NONE); |
| } |
| |
| RenderObject *Node::createRenderer(RenderArena *arena, RenderStyle *style) |
| { |
| assert(false); |
| return 0; |
| } |
| |
| int Node::maxOffset() const |
| { |
| return 1; |
| } |
| |
| // FIXME: Shouldn't these functions be in the editing code? Code that asks questions about HTML in the core DOM class |
| // is obviously misplaced. |
| int Node::caretMinOffset() const |
| { |
| return renderer() ? renderer()->caretMinOffset() : 0; |
| } |
| |
| int Node::caretMaxOffset() const |
| { |
| return renderer() ? renderer()->caretMaxOffset() : 1; |
| } |
| |
| unsigned Node::caretMaxRenderedOffset() const |
| { |
| return renderer() ? renderer()->caretMaxRenderedOffset() : 1; |
| } |
| |
| int Node::previousOffset (int current) const |
| { |
| return renderer() ? renderer()->previousOffset(current) : current - 1; |
| } |
| |
| int Node::nextOffset (int current) const |
| { |
| return renderer() ? renderer()->nextOffset(current) : current + 1; |
| } |
| |
| bool Node::isBlockFlow() const |
| { |
| return renderer() && renderer()->isBlockFlow(); |
| } |
| |
| bool Node::isBlockFlowOrBlockTable() const |
| { |
| return renderer() && (renderer()->isBlockFlow() || renderer()->isTable() && !renderer()->isInline()); |
| } |
| |
| bool Node::isEditableBlock() const |
| { |
| return isContentEditable() && isBlockFlow(); |
| } |
| |
| Element *Node::enclosingBlockFlowOrTableElement() const |
| { |
| Node *n = const_cast<Node *>(this); |
| if (isBlockFlowOrBlockTable()) |
| return static_cast<Element *>(n); |
| |
| while (1) { |
| n = n->parentNode(); |
| if (!n) |
| break; |
| if (n->isBlockFlowOrBlockTable() || n->hasTagName(bodyTag)) |
| return static_cast<Element *>(n); |
| } |
| return 0; |
| } |
| |
| Element *Node::enclosingBlockFlowElement() const |
| { |
| Node *n = const_cast<Node *>(this); |
| if (isBlockFlow()) |
| return static_cast<Element *>(n); |
| |
| while (1) { |
| n = n->parentNode(); |
| if (!n) |
| break; |
| if (n->isBlockFlow() || n->hasTagName(bodyTag)) |
| return static_cast<Element *>(n); |
| } |
| return 0; |
| } |
| |
| Element *Node::enclosingInlineElement() const |
| { |
| Node *n = const_cast<Node *>(this); |
| Node *p; |
| |
| while (1) { |
| p = n->parentNode(); |
| if (!p || p->isBlockFlow() || p->hasTagName(bodyTag)) |
| return static_cast<Element *>(n); |
| // Also stop if any previous sibling is a block |
| for (Node *sibling = n->previousSibling(); sibling; sibling = sibling->previousSibling()) { |
| if (sibling->isBlockFlow()) |
| return static_cast<Element *>(n); |
| } |
| n = p; |
| } |
| ASSERT_NOT_REACHED(); |
| return 0; |
| } |
| |
| Element *Node::rootEditableElement() const |
| { |
| if (!isContentEditable()) |
| return 0; |
| |
| Node *n = const_cast<Node *>(this); |
| if (n->hasTagName(bodyTag)) |
| return static_cast<Element *>(n); |
| |
| Node *result = n->isEditableBlock() ? n : 0; |
| while (1) { |
| n = n->parentNode(); |
| if (!n || !n->isContentEditable()) |
| break; |
| if (n->hasTagName(bodyTag)) { |
| result = n; |
| break; |
| } |
| if (n->isBlockFlow()) |
| result = n; |
| } |
| return static_cast<Element *>(result); |
| } |
| |
| bool Node::inSameRootEditableElement(Node *n) |
| { |
| return n ? rootEditableElement() == n->rootEditableElement() : false; |
| } |
| |
| bool Node::inSameContainingBlockFlowElement(Node *n) |
| { |
| return n ? enclosingBlockFlowElement() == n->enclosingBlockFlowElement() : false; |
| } |
| |
| // FIXME: End of obviously misplaced HTML editing functions. Try to move these out of Node. |
| |
| PassRefPtr<NodeList> Node::getElementsByTagName(const String& name) |
| { |
| return getElementsByTagNameNS("*", name); |
| } |
| |
| PassRefPtr<NodeList> Node::getElementsByTagNameNS(const String &namespaceURI, const String &localName) |
| { |
| if (namespaceURI.isNull() || localName.isNull()) |
| return 0; // FIXME: Who relies on getting 0 instead of a node list in this case? |
| |
| String name = localName; |
| if (getDocument()->isHTMLDocument()) |
| name = localName.lower(); |
| return new TagNodeList(this, AtomicString(namespaceURI), AtomicString(name)); |
| } |
| |
| bool Node::isSupported(const String &feature, const String &version) |
| { |
| return DOMImplementation::instance()->hasFeature(feature, version); |
| } |
| |
| Document *Node::ownerDocument() const |
| { |
| Document *doc = getDocument(); |
| return doc == this ? 0 : doc; |
| } |
| |
| bool Node::hasAttributes() const |
| { |
| return false; |
| } |
| |
| NamedAttrMap *Node::attributes() const |
| { |
| return 0; |
| } |
| |
| bool Node::isEqualNode(Node *other) const |
| { |
| if (!other) |
| return false; |
| |
| if (nodeType() != other->nodeType()) |
| return false; |
| |
| if (nodeName() != other->nodeName()) |
| return false; |
| |
| if (localName() != other->localName()) |
| return false; |
| |
| if (namespaceURI() != other->namespaceURI()) |
| return false; |
| |
| if (prefix() != other->prefix()) |
| return false; |
| |
| if (nodeValue() != other->nodeValue()) |
| return false; |
| |
| NamedAttrMap *attrs = attributes(); |
| NamedAttrMap *otherAttrs = other->attributes(); |
| |
| if (!attrs && otherAttrs) |
| return false; |
| |
| if (attrs && !attrs->mapsEquivalent(otherAttrs)) |
| return false; |
| |
| Node *child = firstChild(); |
| Node *otherChild = other->firstChild(); |
| |
| while (child) { |
| if (!child->isEqualNode(otherChild)) |
| return false; |
| |
| child = child->nextSibling(); |
| otherChild = otherChild->nextSibling(); |
| } |
| |
| if (otherChild) |
| return false; |
| |
| // FIXME: For DocumentType nodes we should check equality on |
| // the entities and notations NamedNodeMaps as well. |
| |
| return true; |
| } |
| |
| bool Node::isDefaultNamespace(const String &namespaceURI) const |
| { |
| // Implemented according to |
| // http://www.w3.org/TR/2004/REC-DOM-Level-3-Core-20040407/namespaces-algorithms.html#isDefaultNamespaceAlgo |
| |
| switch (nodeType()) { |
| case ELEMENT_NODE: { |
| const Element *elem = static_cast<const Element *>(this); |
| |
| if (elem->prefix().isNull()) |
| return elem->namespaceURI() == namespaceURI; |
| |
| if (elem->hasAttributes()) { |
| NamedAttrMap *attrs = elem->attributes(); |
| |
| for (unsigned i = 0; i < attrs->length(); i++) { |
| Attribute *attr = attrs->attributeItem(i); |
| |
| if (attr->localName() == "xmlns") |
| return attr->value() == namespaceURI; |
| } |
| } |
| |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->isDefaultNamespace(namespaceURI); |
| |
| return false; |
| } |
| case DOCUMENT_NODE: |
| return static_cast <const Document *>(this)->documentElement()->isDefaultNamespace(namespaceURI); |
| case ENTITY_NODE: |
| case NOTATION_NODE: |
| case DOCUMENT_TYPE_NODE: |
| case DOCUMENT_FRAGMENT_NODE: |
| return false; |
| case ATTRIBUTE_NODE: { |
| const Attr *attr = static_cast<const Attr *>(this); |
| if (attr->ownerElement()) |
| return attr->ownerElement()->isDefaultNamespace(namespaceURI); |
| return false; |
| } |
| default: |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->isDefaultNamespace(namespaceURI); |
| return false; |
| } |
| } |
| |
| String Node::lookupPrefix(const String &namespaceURI) const |
| { |
| // Implemented according to |
| // http://www.w3.org/TR/2004/REC-DOM-Level-3-Core-20040407/namespaces-algorithms.html#lookupNamespacePrefixAlgo |
| |
| if (namespaceURI.isEmpty()) |
| return String(); |
| |
| switch (nodeType()) { |
| case ELEMENT_NODE: |
| return lookupNamespacePrefix(namespaceURI, static_cast<const Element *>(this)); |
| case DOCUMENT_NODE: |
| return static_cast<const Document *>(this)->documentElement()->lookupPrefix(namespaceURI); |
| case ENTITY_NODE: |
| case NOTATION_NODE: |
| case DOCUMENT_FRAGMENT_NODE: |
| case DOCUMENT_TYPE_NODE: |
| return String(); |
| case ATTRIBUTE_NODE: { |
| const Attr *attr = static_cast<const Attr *>(this); |
| if (attr->ownerElement()) |
| return attr->ownerElement()->lookupPrefix(namespaceURI); |
| return String(); |
| } |
| default: |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->lookupPrefix(namespaceURI); |
| return String(); |
| } |
| } |
| |
| String Node::lookupNamespaceURI(const String &prefix) const |
| { |
| // Implemented according to |
| // http://www.w3.org/TR/2004/REC-DOM-Level-3-Core-20040407/namespaces-algorithms.html#lookupNamespaceURIAlgo |
| |
| if (!prefix.isNull() && prefix.isEmpty()) |
| return String(); |
| |
| switch (nodeType()) { |
| case ELEMENT_NODE: { |
| const Element *elem = static_cast<const Element *>(this); |
| |
| if (!elem->namespaceURI().isNull() && elem->prefix() == prefix) |
| return elem->namespaceURI(); |
| |
| if (elem->hasAttributes()) { |
| NamedAttrMap *attrs = elem->attributes(); |
| |
| for (unsigned i = 0; i < attrs->length(); i++) { |
| Attribute *attr = attrs->attributeItem(i); |
| |
| if (attr->prefix() == "xmlns" && attr->localName() == prefix) { |
| if (!attr->value().isEmpty()) |
| return attr->value(); |
| |
| return String(); |
| } else if (attr->localName() == "xmlns" && prefix.isNull()) { |
| if (!attr->value().isEmpty()) |
| return attr->value(); |
| |
| return String(); |
| } |
| } |
| } |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->lookupNamespaceURI(prefix); |
| return String(); |
| } |
| case DOCUMENT_NODE: |
| return static_cast<const Document *>(this)->documentElement()->lookupNamespaceURI(prefix); |
| case ENTITY_NODE: |
| case NOTATION_NODE: |
| case DOCUMENT_TYPE_NODE: |
| case DOCUMENT_FRAGMENT_NODE: |
| return String(); |
| case ATTRIBUTE_NODE: { |
| const Attr *attr = static_cast<const Attr *>(this); |
| |
| if (attr->ownerElement()) |
| return attr->ownerElement()->lookupNamespaceURI(prefix); |
| else |
| return String(); |
| } |
| default: |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->lookupNamespaceURI(prefix); |
| return String(); |
| } |
| } |
| |
| String Node::lookupNamespacePrefix(const String &_namespaceURI, const Element *originalElement) const |
| { |
| if (_namespaceURI.isNull()) |
| return String(); |
| |
| if (originalElement->lookupNamespaceURI(prefix()) == _namespaceURI) |
| return prefix(); |
| |
| if (hasAttributes()) { |
| NamedAttrMap *attrs = attributes(); |
| |
| for (unsigned i = 0; i < attrs->length(); i++) { |
| Attribute *attr = attrs->attributeItem(i); |
| |
| if (attr->prefix() == "xmlns" && |
| attr->value() == _namespaceURI && |
| originalElement->lookupNamespaceURI(attr->localName()) == _namespaceURI) |
| return attr->localName(); |
| } |
| } |
| |
| if (Element* ancestor = ancestorElement()) |
| return ancestor->lookupNamespacePrefix(_namespaceURI, originalElement); |
| return String(); |
| } |
| |
| String Node::textContent() const |
| { |
| switch (nodeType()) { |
| case TEXT_NODE: |
| case CDATA_SECTION_NODE: |
| case COMMENT_NODE: |
| case PROCESSING_INSTRUCTION_NODE: |
| return nodeValue(); |
| |
| case ELEMENT_NODE: |
| case ATTRIBUTE_NODE: |
| case ENTITY_NODE: |
| case ENTITY_REFERENCE_NODE: |
| case DOCUMENT_FRAGMENT_NODE: { |
| String s = ""; |
| |
| for (Node *child = firstChild(); child; child = child->nextSibling()) { |
| if (child->nodeType() == COMMENT_NODE || child->nodeType() == PROCESSING_INSTRUCTION_NODE) |
| continue; |
| |
| s += child->textContent(); |
| } |
| |
| return s; |
| } |
| |
| case DOCUMENT_NODE: |
| case DOCUMENT_TYPE_NODE: |
| case NOTATION_NODE: |
| default: |
| return String(); |
| } |
| } |
| |
| void Node::setTextContent(const String &text, ExceptionCode& ec) |
| { |
| switch (nodeType()) { |
| case TEXT_NODE: |
| case CDATA_SECTION_NODE: |
| case COMMENT_NODE: |
| case PROCESSING_INSTRUCTION_NODE: |
| setNodeValue(text, ec); |
| break; |
| case ELEMENT_NODE: |
| case ATTRIBUTE_NODE: |
| case ENTITY_NODE: |
| case ENTITY_REFERENCE_NODE: |
| case DOCUMENT_FRAGMENT_NODE: { |
| ContainerNode *container = static_cast<ContainerNode *>(this); |
| |
| container->removeChildren(); |
| |
| if (!text.isEmpty()) |
| appendChild(getDocument()->createTextNode(text), ec); |
| break; |
| } |
| case DOCUMENT_NODE: |
| case DOCUMENT_TYPE_NODE: |
| case NOTATION_NODE: |
| default: |
| // Do nothing |
| break; |
| } |
| } |
| |
| Element* Node::ancestorElement() const |
| { |
| // In theory, there can be EntityReference nodes between elements, but this is currently not supported. |
| for (Node* n = parentNode(); n; n = n->parentNode()) { |
| if (n->isElementNode()) |
| return static_cast<Element*>(n); |
| } |
| return 0; |
| } |
| |
| bool Node::offsetInCharacters() const |
| { |
| return false; |
| } |
| |
| #ifndef NDEBUG |
| |
| static void appendAttributeDesc(const Node *node, String &string, const QualifiedName& name, DeprecatedString attrDesc) |
| { |
| if (node->isElementNode()) { |
| String attr = static_cast<const Element *>(node)->getAttribute(name); |
| if (!attr.isEmpty()) { |
| string += attrDesc; |
| string += attr; |
| } |
| } |
| } |
| |
| void Node::showNode(const char *prefix) const |
| { |
| if (!prefix) |
| prefix = ""; |
| if (isTextNode()) { |
| DeprecatedString value = nodeValue().deprecatedString(); |
| value.replace('\\', "\\\\"); |
| value.replace('\n', "\\n"); |
| fprintf(stderr, "%s%s\t%p \"%s\"\n", prefix, nodeName().deprecatedString().utf8().data(), this, value.utf8().data()); |
| } else { |
| String attrs = ""; |
| appendAttributeDesc(this, attrs, classAttr, " CLASS="); |
| appendAttributeDesc(this, attrs, styleAttr, " STYLE="); |
| fprintf(stderr, "%s%s\t%p%s\n", prefix, nodeName().deprecatedString().utf8().data(), this, attrs.deprecatedString().ascii()); |
| } |
| } |
| |
| void Node::showTree() const |
| { |
| showTreeAndMark((Node *)this, "*", NULL, NULL); |
| } |
| |
| void showTree(const Node *node) |
| { |
| if (node) |
| node->showTree(); |
| } |
| |
| void Node::showTreeAndMark(Node * markedNode1, const char * markedLabel1, Node * markedNode2, const char * markedLabel2) const |
| { |
| Node *rootNode; |
| Node *node = (Node *)this; |
| while (node->parentNode() && !node->hasTagName(bodyTag)) |
| node = node->parentNode(); |
| rootNode = node; |
| |
| for (node = rootNode; node; node = node->traverseNextNode()) { |
| Node *tmpNode; |
| |
| if (node == markedNode1) |
| fprintf(stderr, "%s", markedLabel1); |
| if (node == markedNode2) |
| fprintf(stderr, "%s", markedLabel2); |
| |
| for (tmpNode = node; tmpNode && tmpNode != rootNode; tmpNode = tmpNode->parentNode()) |
| fprintf(stderr, "\t"); |
| node->showNode(0); |
| } |
| } |
| |
| void Node::formatForDebugger(char *buffer, unsigned length) const |
| { |
| String result; |
| String s; |
| |
| s = nodeName(); |
| if (s.length() == 0) |
| result += "<none>"; |
| else |
| result += s; |
| |
| strncpy(buffer, result.deprecatedString().latin1(), length - 1); |
| } |
| |
| #endif |
| |
| } |
