2015-05-03 22:32:37 +03:00
|
|
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
2013-05-02 02:50:08 +04:00
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this file,
|
|
|
|
* You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
|
|
|
|
#include "ChildIterator.h"
|
2013-12-02 14:26:12 +04:00
|
|
|
#include "nsContentUtils.h"
|
2019-01-02 16:05:23 +03:00
|
|
|
#include "mozilla/dom/Document.h"
|
2017-12-04 11:06:37 +03:00
|
|
|
#include "mozilla/dom/HTMLSlotElement.h"
|
2013-07-02 02:09:37 +04:00
|
|
|
#include "mozilla/dom/XBLChildrenElement.h"
|
2013-12-21 10:43:58 +04:00
|
|
|
#include "mozilla/dom/ShadowRoot.h"
|
2014-07-16 22:41:57 +04:00
|
|
|
#include "nsIAnonymousContentCreator.h"
|
|
|
|
#include "nsIFrame.h"
|
2016-08-11 02:56:33 +03:00
|
|
|
#include "nsCSSAnonBoxes.h"
|
2013-05-02 02:50:08 +04:00
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
namespace dom {
|
|
|
|
|
2017-12-04 11:06:37 +03:00
|
|
|
ExplicitChildIterator::ExplicitChildIterator(const nsIContent* aParent,
|
|
|
|
bool aStartAtBeginning)
|
|
|
|
: mParent(aParent),
|
|
|
|
mChild(nullptr),
|
|
|
|
mDefaultChild(nullptr),
|
|
|
|
mIsFirst(aStartAtBeginning),
|
|
|
|
mIndexInInserted(0) {
|
2018-11-15 09:51:07 +03:00
|
|
|
mParentAsSlot = HTMLSlotElement::FromNode(mParent);
|
2017-12-04 11:06:37 +03:00
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
nsIContent* ExplicitChildIterator::GetNextChild() {
|
|
|
|
// If we're already in the inserted-children array, look there first
|
|
|
|
if (mIndexInInserted) {
|
|
|
|
MOZ_ASSERT(mChild);
|
|
|
|
MOZ_ASSERT(!mDefaultChild);
|
|
|
|
|
2017-12-04 11:06:37 +03:00
|
|
|
if (mParentAsSlot) {
|
|
|
|
const nsTArray<RefPtr<nsINode>>& assignedNodes =
|
|
|
|
mParentAsSlot->AssignedNodes();
|
|
|
|
|
|
|
|
mChild = (mIndexInInserted < assignedNodes.Length())
|
|
|
|
? assignedNodes[mIndexInInserted++]->AsContent()
|
|
|
|
: nullptr;
|
2019-02-14 13:14:33 +03:00
|
|
|
if (!mChild) {
|
|
|
|
mIndexInInserted = 0;
|
|
|
|
}
|
2017-12-04 11:06:37 +03:00
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
|
2017-12-21 00:45:19 +03:00
|
|
|
MOZ_ASSERT(mChild->IsActiveChildrenElement());
|
|
|
|
auto* childrenElement = static_cast<XBLChildrenElement*>(mChild);
|
|
|
|
if (mIndexInInserted < childrenElement->InsertedChildrenLength()) {
|
|
|
|
return childrenElement->InsertedChild(mIndexInInserted++);
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
mIndexInInserted = 0;
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
|
|
} else if (mDefaultChild) {
|
|
|
|
// If we're already in default content, check if there are more nodes there
|
|
|
|
MOZ_ASSERT(mChild);
|
2017-12-21 00:45:19 +03:00
|
|
|
MOZ_ASSERT(mChild->IsActiveChildrenElement());
|
2013-05-02 02:50:08 +04:00
|
|
|
|
|
|
|
mDefaultChild = mDefaultChild->GetNextSibling();
|
|
|
|
if (mDefaultChild) {
|
|
|
|
return mDefaultChild;
|
|
|
|
}
|
|
|
|
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
|
|
} else if (mIsFirst) { // at the beginning of the child list
|
2017-12-04 11:06:37 +03:00
|
|
|
// For slot parent, iterate over assigned nodes if not empty, otherwise
|
|
|
|
// fall through and iterate over direct children (fallback content).
|
|
|
|
if (mParentAsSlot) {
|
|
|
|
const nsTArray<RefPtr<nsINode>>& assignedNodes =
|
|
|
|
mParentAsSlot->AssignedNodes();
|
|
|
|
if (!assignedNodes.IsEmpty()) {
|
|
|
|
mIndexInInserted = 1;
|
|
|
|
mChild = assignedNodes[0]->AsContent();
|
|
|
|
mIsFirst = false;
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
mChild = mParent->GetFirstChild();
|
|
|
|
mIsFirst = false;
|
|
|
|
} else if (mChild) { // in the middle of the child list
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
|
|
}
|
|
|
|
|
2013-12-02 14:26:12 +04:00
|
|
|
// Iterate until we find a non-insertion point, or an insertion point with
|
|
|
|
// content.
|
2013-12-21 10:43:58 +04:00
|
|
|
while (mChild) {
|
2017-12-21 00:45:19 +03:00
|
|
|
if (mChild->IsActiveChildrenElement()) {
|
2013-12-21 10:43:58 +04:00
|
|
|
// If the current child being iterated is a content insertion point
|
|
|
|
// then the iterator needs to return the nodes distributed into
|
|
|
|
// the content insertion point.
|
2017-12-21 00:45:19 +03:00
|
|
|
auto* childrenElement = static_cast<XBLChildrenElement*>(mChild);
|
|
|
|
if (childrenElement->HasInsertedChildren()) {
|
2013-12-21 10:43:58 +04:00
|
|
|
// Iterate through elements projected on insertion point.
|
|
|
|
mIndexInInserted = 1;
|
2017-12-21 00:45:19 +03:00
|
|
|
return childrenElement->InsertedChild(0);
|
2013-12-21 10:43:58 +04:00
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
|
2013-12-21 10:43:58 +04:00
|
|
|
// Insertion points inside fallback/default content
|
|
|
|
// are considered inactive and do not get assigned nodes.
|
|
|
|
mDefaultChild = mChild->GetFirstChild();
|
|
|
|
if (mDefaultChild) {
|
|
|
|
return mDefaultChild;
|
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
|
2013-12-21 10:43:58 +04:00
|
|
|
// If we have an insertion point with no assigned nodes and
|
|
|
|
// no default content, move on to the next node.
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
|
|
} else {
|
|
|
|
// mChild is not an insertion point, thus it is the next node to
|
|
|
|
// return from this iterator.
|
|
|
|
break;
|
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
|
2014-07-16 22:41:57 +04:00
|
|
|
void FlattenedChildIterator::Init(bool aIgnoreXBL) {
|
|
|
|
if (aIgnoreXBL) {
|
2018-02-25 20:55:29 +03:00
|
|
|
mXBLInvolved = Some(false);
|
2014-07-16 22:41:57 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2018-02-25 19:31:06 +03:00
|
|
|
// TODO(emilio): I think it probably makes sense to only allow constructing
|
|
|
|
// FlattenedChildIterators with Element.
|
|
|
|
if (mParent->IsElement()) {
|
|
|
|
if (ShadowRoot* shadow = mParent->AsElement()->GetShadowRoot()) {
|
|
|
|
mParent = shadow;
|
2018-02-25 20:55:29 +03:00
|
|
|
mXBLInvolved = Some(true);
|
2018-02-25 19:31:06 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
nsXBLBinding* binding =
|
2014-07-16 22:41:57 +04:00
|
|
|
mParent->OwnerDoc()->BindingManager()->GetBindingWithContent(mParent);
|
2013-05-02 02:50:08 +04:00
|
|
|
|
|
|
|
if (binding) {
|
2017-09-08 15:59:04 +03:00
|
|
|
MOZ_ASSERT(binding->GetAnonymousContent());
|
|
|
|
mParent = binding->GetAnonymousContent();
|
2018-02-25 20:55:29 +03:00
|
|
|
mXBLInvolved = Some(true);
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
2018-02-25 20:55:29 +03:00
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
|
2018-02-25 20:55:29 +03:00
|
|
|
bool FlattenedChildIterator::ComputeWhetherXBLIsInvolved() const {
|
|
|
|
MOZ_ASSERT(mXBLInvolved.isNothing());
|
|
|
|
// We set mXBLInvolved to true if either the node we're iterating has a
|
|
|
|
// binding with content attached to it (in which case it is handled in Init),
|
2018-06-02 10:35:19 +03:00
|
|
|
// the node is generated XBL content and has an <xbl:children> child, or the
|
|
|
|
// node is a <slot> element.
|
2018-02-25 20:55:29 +03:00
|
|
|
if (!mParent->GetBindingParent()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-06-02 10:35:19 +03:00
|
|
|
if (mParentAsSlot) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-02-25 20:55:29 +03:00
|
|
|
for (nsIContent* child = mParent->GetFirstChild(); child;
|
|
|
|
child = child->GetNextSibling()) {
|
|
|
|
if (child->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
|
|
|
|
MOZ_ASSERT(child->GetBindingParent());
|
|
|
|
return true;
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
}
|
2018-02-25 20:55:29 +03:00
|
|
|
|
|
|
|
return false;
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
|
2017-11-01 20:56:13 +03:00
|
|
|
bool ExplicitChildIterator::Seek(const nsIContent* aChildToFind) {
|
2015-09-09 04:23:55 +03:00
|
|
|
if (aChildToFind->GetParent() == mParent &&
|
|
|
|
!aChildToFind->IsRootOfAnonymousSubtree()) {
|
|
|
|
// Fast path: just point ourselves to aChildToFind, which is a
|
|
|
|
// normal DOM child of ours.
|
2017-11-01 20:56:13 +03:00
|
|
|
mChild = const_cast<nsIContent*>(aChildToFind);
|
2015-09-09 04:23:55 +03:00
|
|
|
mIndexInInserted = 0;
|
|
|
|
mDefaultChild = nullptr;
|
|
|
|
mIsFirst = false;
|
2017-12-21 00:45:19 +03:00
|
|
|
MOZ_ASSERT(!mChild->IsActiveChildrenElement());
|
2016-02-11 16:22:39 +03:00
|
|
|
return true;
|
2015-09-09 04:23:55 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Can we add more fast paths here based on whether the parent of aChildToFind
|
|
|
|
// is a shadow insertion point or content insertion point?
|
|
|
|
|
|
|
|
// Slow path: just walk all our kids.
|
2016-02-11 16:22:39 +03:00
|
|
|
return Seek(aChildToFind, nullptr);
|
2015-09-09 04:23:55 +03:00
|
|
|
}
|
|
|
|
|
2016-03-08 23:54:46 +03:00
|
|
|
nsIContent* ExplicitChildIterator::Get() const {
|
2013-05-02 02:50:08 +04:00
|
|
|
MOZ_ASSERT(!mIsFirst);
|
|
|
|
|
2017-12-04 11:06:37 +03:00
|
|
|
// When mParentAsSlot is set, mChild is always set to the current child. It
|
|
|
|
// does not matter whether mChild is an assigned node or a fallback content.
|
|
|
|
if (mParentAsSlot) {
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
if (mIndexInInserted) {
|
2017-12-21 00:45:19 +03:00
|
|
|
MOZ_ASSERT(mChild->IsActiveChildrenElement());
|
|
|
|
auto* childrenElement = static_cast<XBLChildrenElement*>(mChild);
|
|
|
|
return childrenElement->InsertedChild(mIndexInInserted - 1);
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
2017-09-25 18:09:26 +03:00
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
return mDefaultChild ? mDefaultChild : mChild;
|
|
|
|
}
|
|
|
|
|
2013-12-21 10:43:58 +04:00
|
|
|
nsIContent* ExplicitChildIterator::GetPreviousChild() {
|
2013-05-02 02:50:08 +04:00
|
|
|
// If we're already in the inserted-children array, look there first
|
|
|
|
if (mIndexInInserted) {
|
2017-12-04 11:06:37 +03:00
|
|
|
if (mParentAsSlot) {
|
|
|
|
const nsTArray<RefPtr<nsINode>>& assignedNodes =
|
|
|
|
mParentAsSlot->AssignedNodes();
|
|
|
|
|
|
|
|
mChild = (--mIndexInInserted)
|
|
|
|
? assignedNodes[mIndexInInserted - 1]->AsContent()
|
|
|
|
: nullptr;
|
|
|
|
|
|
|
|
if (!mChild) {
|
|
|
|
mIsFirst = true;
|
|
|
|
}
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
// NB: mIndexInInserted points one past the last returned child so we need
|
|
|
|
// to look *two* indices back in order to return the previous child.
|
2017-12-21 00:45:19 +03:00
|
|
|
MOZ_ASSERT(mChild->IsActiveChildrenElement());
|
|
|
|
auto* childrenElement = static_cast<XBLChildrenElement*>(mChild);
|
2013-05-02 02:50:08 +04:00
|
|
|
if (--mIndexInInserted) {
|
2017-12-21 00:45:19 +03:00
|
|
|
return childrenElement->InsertedChild(mIndexInInserted - 1);
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
|
|
} else if (mDefaultChild) {
|
|
|
|
// If we're already in default content, check if there are more nodes there
|
|
|
|
mDefaultChild = mDefaultChild->GetPreviousSibling();
|
|
|
|
if (mDefaultChild) {
|
|
|
|
return mDefaultChild;
|
|
|
|
}
|
|
|
|
|
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
|
|
} else if (mIsFirst) { // at the beginning of the child list
|
|
|
|
return nullptr;
|
|
|
|
} else if (mChild) { // in the middle of the child list
|
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
|
|
} else { // at the end of the child list
|
2017-12-04 11:06:37 +03:00
|
|
|
// For slot parent, iterate over assigned nodes if not empty, otherwise
|
|
|
|
// fall through and iterate over direct children (fallback content).
|
|
|
|
if (mParentAsSlot) {
|
|
|
|
const nsTArray<RefPtr<nsINode>>& assignedNodes =
|
|
|
|
mParentAsSlot->AssignedNodes();
|
|
|
|
if (!assignedNodes.IsEmpty()) {
|
|
|
|
mIndexInInserted = assignedNodes.Length();
|
|
|
|
mChild = assignedNodes[mIndexInInserted - 1]->AsContent();
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
mChild = mParent->GetLastChild();
|
|
|
|
}
|
|
|
|
|
2013-12-02 14:26:12 +04:00
|
|
|
// Iterate until we find a non-insertion point, or an insertion point with
|
|
|
|
// content.
|
2013-12-21 10:43:58 +04:00
|
|
|
while (mChild) {
|
2017-12-21 00:45:19 +03:00
|
|
|
if (mChild->IsActiveChildrenElement()) {
|
2013-12-21 10:43:58 +04:00
|
|
|
// If the current child being iterated is a content insertion point
|
|
|
|
// then the iterator needs to return the nodes distributed into
|
|
|
|
// the content insertion point.
|
2017-12-21 00:45:19 +03:00
|
|
|
auto* childrenElement = static_cast<XBLChildrenElement*>(mChild);
|
|
|
|
if (childrenElement->HasInsertedChildren()) {
|
|
|
|
mIndexInInserted = childrenElement->InsertedChildrenLength();
|
|
|
|
return childrenElement->InsertedChild(mIndexInInserted - 1);
|
2013-12-21 10:43:58 +04:00
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
|
2013-12-21 10:43:58 +04:00
|
|
|
mDefaultChild = mChild->GetLastChild();
|
|
|
|
if (mDefaultChild) {
|
|
|
|
return mDefaultChild;
|
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
|
2013-12-21 10:43:58 +04:00
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
|
|
} else {
|
|
|
|
// mChild is not an insertion point, thus it is the next node to
|
|
|
|
// return from this iterator.
|
|
|
|
break;
|
|
|
|
}
|
2013-05-02 02:50:08 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!mChild) {
|
|
|
|
mIsFirst = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return mChild;
|
|
|
|
}
|
|
|
|
|
2016-03-08 23:54:46 +03:00
|
|
|
nsIContent* AllChildrenIterator::Get() const {
|
|
|
|
switch (mPhase) {
|
2019-03-25 01:13:53 +03:00
|
|
|
case eAtMarkerKid: {
|
|
|
|
Element* marker = nsLayoutUtils::GetMarkerPseudo(mOriginalContent);
|
|
|
|
MOZ_ASSERT(marker, "No content marker frame at eAtMarkerKid phase");
|
|
|
|
return marker;
|
|
|
|
}
|
|
|
|
|
2016-03-08 23:54:46 +03:00
|
|
|
case eAtBeforeKid: {
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* before = nsLayoutUtils::GetBeforePseudo(mOriginalContent);
|
|
|
|
MOZ_ASSERT(before, "No content before frame at eAtBeforeKid phase");
|
|
|
|
return before;
|
2016-03-08 23:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
case eAtExplicitKids:
|
|
|
|
return ExplicitChildIterator::Get();
|
|
|
|
|
|
|
|
case eAtAnonKids:
|
|
|
|
return mAnonKids[mAnonKidsIdx];
|
|
|
|
|
|
|
|
case eAtAfterKid: {
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* after = nsLayoutUtils::GetAfterPseudo(mOriginalContent);
|
|
|
|
MOZ_ASSERT(after, "No content after frame at eAtAfterKid phase");
|
|
|
|
return after;
|
2016-03-08 23:54:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-11-01 20:56:13 +03:00
|
|
|
bool AllChildrenIterator::Seek(const nsIContent* aChildToFind) {
|
2019-03-25 01:13:53 +03:00
|
|
|
if (mPhase == eAtBegin || mPhase == eAtMarkerKid) {
|
|
|
|
mPhase = eAtBeforeKid;
|
|
|
|
Element* markerPseudo = nsLayoutUtils::GetMarkerPseudo(mOriginalContent);
|
|
|
|
if (markerPseudo && markerPseudo == aChildToFind) {
|
|
|
|
mPhase = eAtMarkerKid;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (mPhase == eAtBeforeKid) {
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtExplicitKids;
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* beforePseudo = nsLayoutUtils::GetBeforePseudo(mOriginalContent);
|
|
|
|
if (beforePseudo && beforePseudo == aChildToFind) {
|
|
|
|
mPhase = eAtBeforeKid;
|
|
|
|
return true;
|
2016-02-11 16:22:39 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mPhase == eAtExplicitKids) {
|
2016-02-11 16:22:39 +03:00
|
|
|
if (ExplicitChildIterator::Seek(aChildToFind)) {
|
|
|
|
return true;
|
|
|
|
}
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtAnonKids;
|
2016-02-11 16:22:39 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
nsIContent* child = nullptr;
|
|
|
|
do {
|
|
|
|
child = GetNextChild();
|
|
|
|
} while (child && child != aChildToFind);
|
|
|
|
|
|
|
|
return child == aChildToFind;
|
|
|
|
}
|
|
|
|
|
2016-08-24 04:19:10 +03:00
|
|
|
void AllChildrenIterator::AppendNativeAnonymousChildren() {
|
2017-06-18 20:36:32 +03:00
|
|
|
nsContentUtils::AppendNativeAnonymousChildren(mOriginalContent, mAnonKids,
|
|
|
|
mFlags);
|
2016-08-24 04:19:10 +03:00
|
|
|
}
|
|
|
|
|
2014-07-16 22:41:57 +04:00
|
|
|
nsIContent* AllChildrenIterator::GetNextChild() {
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mPhase == eAtBegin) {
|
2019-03-25 01:13:53 +03:00
|
|
|
Element* markerContent = nsLayoutUtils::GetMarkerPseudo(mOriginalContent);
|
|
|
|
if (markerContent) {
|
|
|
|
mPhase = eAtMarkerKid;
|
|
|
|
return markerContent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mPhase == eAtBegin || mPhase == eAtMarkerKid) {
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtExplicitKids;
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* beforeContent = nsLayoutUtils::GetBeforePseudo(mOriginalContent);
|
|
|
|
if (beforeContent) {
|
|
|
|
mPhase = eAtBeforeKid;
|
|
|
|
return beforeContent;
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mPhase == eAtBeforeKid) {
|
|
|
|
// Advance into our explicit kids.
|
|
|
|
mPhase = eAtExplicitKids;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mPhase == eAtExplicitKids) {
|
2014-07-16 22:41:57 +04:00
|
|
|
nsIContent* kid = ExplicitChildIterator::GetNextChild();
|
|
|
|
if (kid) {
|
|
|
|
return kid;
|
|
|
|
}
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtAnonKids;
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mPhase == eAtAnonKids) {
|
2014-07-16 22:41:57 +04:00
|
|
|
if (mAnonKids.IsEmpty()) {
|
2016-03-06 00:11:21 +03:00
|
|
|
MOZ_ASSERT(mAnonKidsIdx == UINT32_MAX);
|
2016-08-24 04:19:10 +03:00
|
|
|
AppendNativeAnonymousChildren();
|
2016-03-06 00:11:21 +03:00
|
|
|
mAnonKidsIdx = 0;
|
|
|
|
} else {
|
|
|
|
if (mAnonKidsIdx == UINT32_MAX) {
|
|
|
|
mAnonKidsIdx = 0;
|
|
|
|
} else {
|
|
|
|
mAnonKidsIdx++;
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
2016-03-06 00:11:21 +03:00
|
|
|
}
|
2014-07-16 22:41:57 +04:00
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mAnonKidsIdx < mAnonKids.Length()) {
|
|
|
|
return mAnonKids[mAnonKidsIdx];
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
|
|
|
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* afterContent = nsLayoutUtils::GetAfterPseudo(mOriginalContent);
|
|
|
|
if (afterContent) {
|
|
|
|
mPhase = eAtAfterKid;
|
|
|
|
return afterContent;
|
2016-03-06 00:11:21 +03:00
|
|
|
}
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtEnd;
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsIContent* AllChildrenIterator::GetPreviousChild() {
|
|
|
|
if (mPhase == eAtEnd) {
|
|
|
|
MOZ_ASSERT(mAnonKidsIdx == mAnonKids.Length());
|
|
|
|
mPhase = eAtAnonKids;
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* afterContent = nsLayoutUtils::GetAfterPseudo(mOriginalContent);
|
|
|
|
if (afterContent) {
|
|
|
|
mPhase = eAtAfterKid;
|
|
|
|
return afterContent;
|
2014-07-16 22:41:57 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
if (mPhase == eAtAfterKid) {
|
|
|
|
mPhase = eAtAnonKids;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mPhase == eAtAnonKids) {
|
|
|
|
if (mAnonKids.IsEmpty()) {
|
2016-08-24 04:19:10 +03:00
|
|
|
AppendNativeAnonymousChildren();
|
|
|
|
mAnonKidsIdx = mAnonKids.Length();
|
2016-03-06 00:11:21 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// If 0 then it turns into UINT32_MAX, which indicates the iterator is
|
|
|
|
// before the anonymous children.
|
|
|
|
--mAnonKidsIdx;
|
|
|
|
if (mAnonKidsIdx < mAnonKids.Length()) {
|
|
|
|
return mAnonKids[mAnonKidsIdx];
|
|
|
|
}
|
|
|
|
mPhase = eAtExplicitKids;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mPhase == eAtExplicitKids) {
|
|
|
|
nsIContent* kid = ExplicitChildIterator::GetPreviousChild();
|
|
|
|
if (kid) {
|
|
|
|
return kid;
|
|
|
|
}
|
|
|
|
|
2017-04-19 13:53:57 +03:00
|
|
|
Element* beforeContent = nsLayoutUtils::GetBeforePseudo(mOriginalContent);
|
|
|
|
if (beforeContent) {
|
|
|
|
mPhase = eAtBeforeKid;
|
|
|
|
return beforeContent;
|
2016-03-06 00:11:21 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-03-25 01:13:53 +03:00
|
|
|
if (mPhase == eAtExplicitKids || mPhase == eAtBeforeKid) {
|
|
|
|
Element* markerContent = nsLayoutUtils::GetMarkerPseudo(mOriginalContent);
|
|
|
|
if (markerContent) {
|
|
|
|
mPhase = eAtMarkerKid;
|
|
|
|
return markerContent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-06 00:11:21 +03:00
|
|
|
mPhase = eAtBegin;
|
2014-07-16 22:41:57 +04:00
|
|
|
return nullptr;
|
|
|
|
}
|
2015-07-13 18:25:42 +03:00
|
|
|
|
2013-05-02 02:50:08 +04:00
|
|
|
} // namespace dom
|
|
|
|
} // namespace mozilla
|