#ifndef ContainerNode_h
#define ContainerNode_h
#include "bindings/v8/ExceptionStatePlaceholder.h"
#include "core/dom/Node.h"
#include "wtf/OwnPtr.h"
#include "wtf/Vector.h"
namespace WebCore {
class ExceptionState;
class FloatPoint;
class HTMLCollection;
namespace Private {
template<class GenericNode, class GenericNodeContainer>
void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer&);
}
class NoEventDispatchAssertion {
public:
NoEventDispatchAssertion()
{
#ifndef NDEBUG
if (!isMainThread())
return;
s_count++;
#endif
}
~NoEventDispatchAssertion()
{
#ifndef NDEBUG
if (!isMainThread())
return;
ASSERT(s_count);
s_count--;
#endif
}
#ifndef NDEBUG
static bool isEventDispatchForbidden()
{
if (!isMainThread())
return false;
return s_count;
}
#endif
private:
#ifndef NDEBUG
static unsigned s_count;
#endif
};
enum DynamicRestyleFlags {
ChildrenAffectedByFocus = 1 << 0,
ChildrenAffectedByHover = 1 << 1,
ChildrenAffectedByActive = 1 << 2,
ChildrenAffectedByDrag = 1 << 3,
ChildrenAffectedByFirstChildRules = 1 << 4,
ChildrenAffectedByLastChildRules = 1 << 5,
ChildrenAffectedByDirectAdjacentRules = 1 << 6,
ChildrenAffectedByIndirectAdjacentRules = 1 << 7,
ChildrenAffectedByForwardPositionalRules = 1 << 8,
ChildrenAffectedByBackwardPositionalRules = 1 << 9,
NumberOfDynamicRestyleFlags = 10,
};
class ContainerNode : public Node {
public:
virtual ~ContainerNode();
Node* firstChild() const { return m_firstChild; }
Node* lastChild() const { return m_lastChild; }
bool hasChildren() const { return m_firstChild; }
bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling(); }
bool hasOneTextChild() const { return hasOneChild() && m_firstChild->isTextNode(); }
bool hasChildCount(unsigned) const;
PassRefPtr<HTMLCollection> children();
unsigned countChildren() const;
Node* traverseToChildAt(unsigned index) const;
PassRefPtr<Element> querySelector(const AtomicString& selectors, ExceptionState&);
PassRefPtr<NodeList> querySelectorAll(const AtomicString& selectors, ExceptionState&);
void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION);
void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState& = ASSERT_NO_EXCEPTION);
void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION);
void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCEPTION);
PassRefPtr<HTMLCollection> getElementsByTagName(const AtomicString&);
PassRefPtr<HTMLCollection> getElementsByTagNameNS(const AtomicString& namespaceURI, const AtomicString& localName);
PassRefPtr<NodeList> getElementsByName(const AtomicString& elementName);
PassRefPtr<HTMLCollection> getElementsByClassName(const AtomicString& classNames);
PassRefPtr<RadioNodeList> radioNodeList(const AtomicString&, bool onlyMatchImgElements = false);
void parserAppendChild(PassRefPtr<Node>);
void parserRemoveChild(Node&);
void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild);
void parserTakeAllChildrenFrom(ContainerNode&);
void removeChildren();
void cloneChildNodes(ContainerNode* clone);
virtual void attach(const AttachContext& = AttachContext()) OVERRIDE;
virtual void detach(const AttachContext& = AttachContext()) OVERRIDE;
virtual LayoutRect boundingBox() const OVERRIDE FINAL;
virtual void setFocus(bool) OVERRIDE;
void focusStateChanged();
virtual void setActive(bool = true) OVERRIDE;
virtual void setHovered(bool = true) OVERRIDE;
bool childrenAffectedByFocus() const { return hasRestyleFlag(ChildrenAffectedByFocus); }
void setChildrenAffectedByFocus() { setRestyleFlag(ChildrenAffectedByFocus); }
bool childrenAffectedByHover() const { return hasRestyleFlag(ChildrenAffectedByHover); }
void setChildrenAffectedByHover() { setRestyleFlag(ChildrenAffectedByHover); }
bool childrenAffectedByActive() const { return hasRestyleFlag(ChildrenAffectedByActive); }
void setChildrenAffectedByActive() { setRestyleFlag(ChildrenAffectedByActive); }
bool childrenAffectedByDrag() const { return hasRestyleFlag(ChildrenAffectedByDrag); }
void setChildrenAffectedByDrag() { setRestyleFlag(ChildrenAffectedByDrag); }
bool childrenAffectedByPositionalRules() const { return hasRestyleFlag(ChildrenAffectedByForwardPositionalRules) || hasRestyleFlag(ChildrenAffectedByBackwardPositionalRules); }
bool childrenAffectedByFirstChildRules() const { return hasRestyleFlag(ChildrenAffectedByFirstChildRules); }
void setChildrenAffectedByFirstChildRules() { setRestyleFlag(ChildrenAffectedByFirstChildRules); }
bool childrenAffectedByLastChildRules() const { return hasRestyleFlag(ChildrenAffectedByLastChildRules); }
void setChildrenAffectedByLastChildRules() { setRestyleFlag(ChildrenAffectedByLastChildRules); }
bool childrenAffectedByDirectAdjacentRules() const { return hasRestyleFlag(ChildrenAffectedByDirectAdjacentRules); }
void setChildrenAffectedByDirectAdjacentRules() { setRestyleFlag(ChildrenAffectedByDirectAdjacentRules); }
bool childrenAffectedByIndirectAdjacentRules() const { return hasRestyleFlag(ChildrenAffectedByIndirectAdjacentRules); }
void setChildrenAffectedByIndirectAdjacentRules() { setRestyleFlag(ChildrenAffectedByIndirectAdjacentRules); }
bool childrenAffectedByForwardPositionalRules() const { return hasRestyleFlag(ChildrenAffectedByForwardPositionalRules); }
void setChildrenAffectedByForwardPositionalRules() { setRestyleFlag(ChildrenAffectedByForwardPositionalRules); }
bool childrenAffectedByBackwardPositionalRules() const { return hasRestyleFlag(ChildrenAffectedByBackwardPositionalRules); }
void setChildrenAffectedByBackwardPositionalRules() { setRestyleFlag(ChildrenAffectedByBackwardPositionalRules); }
void checkForChildrenAdjacentRuleChanges();
bool childrenSupportStyleSharing() const { return !hasRestyleFlags(); }
virtual void childrenChanged(bool createdByParser = false, Node* beforeChange = 0, Node* afterChange = 0, int childCountDelta = 0);
void disconnectDescendantFrames();
protected:
ContainerNode(TreeScope*, ConstructionType = CreateContainer);
template<class GenericNode, class GenericNodeContainer>
friend void appendChildToContainer(GenericNode& child, GenericNodeContainer&);
template<class GenericNode, class GenericNodeContainer>
friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer&);
void removeDetachedChildren();
void setFirstChild(Node* child) { m_firstChild = child; }
void setLastChild(Node* child) { m_lastChild = child; }
private:
void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);
void insertBeforeCommon(Node& nextChild, Node& oldChild);
void updateTreeAfterInsertion(Node& child);
void willRemoveChildren();
void willRemoveChild(Node& child);
bool hasRestyleFlag(DynamicRestyleFlags mask) const { return hasRareData() && hasRestyleFlagInternal(mask); }
bool hasRestyleFlags() const { return hasRareData() && hasRestyleFlagsInternal(); }
void setRestyleFlag(DynamicRestyleFlags);
bool hasRestyleFlagInternal(DynamicRestyleFlags) const;
bool hasRestyleFlagsInternal() const;
inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, ExceptionState&) const;
inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, ExceptionState&) const;
inline bool containsConsideringHostElements(const Node&) const;
inline bool isChildTypeAllowed(const Node& child) const;
void attachChildren(const AttachContext& = AttachContext());
void detachChildren(const AttachContext& = AttachContext());
bool getUpperLeftCorner(FloatPoint&) const;
bool getLowerRightCorner(FloatPoint&) const;
Node* m_firstChild;
Node* m_lastChild;
};
#ifndef NDEBUG
bool childAttachedAllowedWhenAttachingChildren(ContainerNode*);
#endif
DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode());
inline bool ContainerNode::hasChildCount(unsigned count) const
{
Node* child = m_firstChild;
while (count && child) {
child = child->nextSibling();
--count;
}
return !count && !child;
}
inline ContainerNode::ContainerNode(TreeScope* treeScope, ConstructionType type)
: Node(treeScope, type)
, m_firstChild(0)
, m_lastChild(0)
{
}
inline void ContainerNode::attachChildren(const AttachContext& context)
{
AttachContext childrenContext(context);
childrenContext.resolvedStyle = 0;
for (Node* child = firstChild(); child; child = child->nextSibling()) {
ASSERT(child->needsAttach() || childAttachedAllowedWhenAttachingChildren(this));
if (child->needsAttach())
child->attach(childrenContext);
}
}
inline void ContainerNode::detachChildren(const AttachContext& context)
{
AttachContext childrenContext(context);
childrenContext.resolvedStyle = 0;
for (Node* child = firstChild(); child; child = child->nextSibling())
child->detach(childrenContext);
}
inline unsigned Node::countChildren() const
{
if (!isContainerNode())
return 0;
return toContainerNode(this)->countChildren();
}
inline Node* Node::traverseToChildAt(unsigned index) const
{
if (!isContainerNode())
return 0;
return toContainerNode(this)->traverseToChildAt(index);
}
inline Node* Node::firstChild() const
{
if (!isContainerNode())
return 0;
return toContainerNode(this)->firstChild();
}
inline Node* Node::lastChild() const
{
if (!isContainerNode())
return 0;
return toContainerNode(this)->lastChild();
}
inline Node& Node::highestAncestor() const
{
Node* node = const_cast<Node*>(this);
Node* highest = node;
for (; node; node = node->parentNode())
highest = node;
return *highest;
}
inline ContainerNode* Node::parentElementOrShadowRoot() const
{
ContainerNode* parent = parentNode();
return parent && (parent->isElementNode() || parent->isShadowRoot()) ? parent : 0;
}
const int initialNodeVectorSize = 11;
typedef Vector<RefPtr<Node>, initialNodeVectorSize> NodeVector;
inline void getChildNodes(Node& node, NodeVector& nodes)
{
ASSERT(!nodes.size());
for (Node* child = node.firstChild(); child; child = child->nextSibling())
nodes.append(child);
}
class ChildNodesLazySnapshot {
WTF_MAKE_NONCOPYABLE(ChildNodesLazySnapshot);
WTF_MAKE_FAST_ALLOCATED;
public:
explicit ChildNodesLazySnapshot(Node& parentNode)
: m_currentNode(parentNode.firstChild())
, m_currentIndex(0)
{
m_nextSnapshot = latestSnapshot;
latestSnapshot = this;
}
~ChildNodesLazySnapshot()
{
latestSnapshot = m_nextSnapshot;
}
PassRefPtr<Node> nextNode()
{
if (LIKELY(!hasSnapshot())) {
RefPtr<Node> node = m_currentNode;
if (node)
m_currentNode = node->nextSibling();
return node.release();
}
Vector<RefPtr<Node> >& nodeVector = *m_childNodes;
if (m_currentIndex >= nodeVector.size())
return nullptr;
return nodeVector[m_currentIndex++];
}
void takeSnapshot()
{
if (hasSnapshot())
return;
m_childNodes = adoptPtr(new Vector<RefPtr<Node> >());
Node* node = m_currentNode.get();
while (node) {
m_childNodes->append(node);
node = node->nextSibling();
}
}
ChildNodesLazySnapshot* nextSnapshot() { return m_nextSnapshot; }
bool hasSnapshot() { return !!m_childNodes.get(); }
static void takeChildNodesLazySnapshot()
{
ChildNodesLazySnapshot* snapshot = latestSnapshot;
while (snapshot && !snapshot->hasSnapshot()) {
snapshot->takeSnapshot();
snapshot = snapshot->nextSnapshot();
}
}
private:
static ChildNodesLazySnapshot* latestSnapshot;
RefPtr<Node> m_currentNode;
unsigned m_currentIndex;
OwnPtr<Vector<RefPtr<Node> > > m_childNodes;
ChildNodesLazySnapshot* m_nextSnapshot;
};
}
#endif