mirror of
https://github.com/roytam1/palemoon27.git
synced 2026-05-26 14:30:27 +00:00
8f529f64f5
- Bug 932865 - Add ThreadHangStats for collecting background hang telemetry; r=vladan (2f08a076b)
- Bug 932865 - Add way for telemetry to iterate over active threads; r=froydnj (535615d3d)
- Bug 1128768: Part 3 - Update BHR to allow for hang annotations; r=vladan (0b880a667)
- Bug 935092 - Add ThreadStackHelper to get a thread's pesudo-stack; r=BenWa (1422cfe4d)
- Bug 942488 - Don't report pseudo-stacks without SPS profiler. r=nchen (e160a7a08)
- Bug 946817 - Don't assert mPseudoStack on B2G. r=BenWa (9f846df3b)
- Bug 951431 - Don't get stacks during profiler runs on Linux; r=BenWa (15036e907)
- Bug 978262 - Ignore duplicate frames when getting BHR stack. r=froydnj (964721b1b)
- Bug 985155 - Add signal trampoline on ARM Linux to work around kernel bug. r=snorp (cb8a7846c)
- Bug 995730 - Convert xpcom/threads/ to Gecko style. r=froydnj (fe150404e)
- Bug 1013326 - Distinguish chrome and content scripts in pseudostack; r=snorp (81273c977)
- Bug 1023461 - Remove temporary stack buffer in ThreadStackHelper; r=snorp (cf5a717c2)
- Bug 1023461 - Record filename and line number for chrome JS entries; r=snorp (10c89808f)
- Bug 1022456 - Fix modelines in xpcom/{base,glue,io,string,threads}/. (48dbc0416)
- Bug 1016441 - Switch to using real-time signal in ThreadStackHelper; (2c5f818be)
- Bug 1016629 - b. Use RAII class to assign mStackToFill; r=snorp (769eae130)
- Bug 1016629 - c. Add define for ThreadStackHelper pseudostack support; r=snorp (67def0d2f)
- Bug 1016629 - d. Add and implement GetNativeStack method in ThreadStackHelper; r=snorp r=jseward (46c52f2be)
- Bug 1016629 - e. Implement platform-specific code for filling in context; r=snorp r=jseward (e6a66858b)
- Bug 1016629 - g. Avoid ASan flag when copying stack; r=snorp (0159628b5)
- Bug 1045176 - Unbreak build on non-SPS platforms after bug 1016629. (f1d60d838)
- Bug 1047123 - ThreadStackHelper should use UniquePtr<uint8_t[]>, not ScopedDeleteArray. r=jchen (0e4af313c)
- Bug 1049161 - Fix ThreadStackHelper thread handle permissions on Windows; r=snorp (c05172b1c)
- Bug 1050185 - Make ThreadStackHelper::FillThreadContext Valgrind-friendly. r=nchen (368725774)
- Bug 1050440 - Remove repeated js::RunScript frames in ThreadStackHelper (2a79600b3)
- Bug 1046841 - Fix more style violations in previously touched .cpp files in xpcom/. r=froydnj (02afe2493)
- Bug 1069694 - Remove or move around functions in OldDebugAPI. r=shu (177197302)
- Bug 1069694 - Remove OldDebugAPI from the browser. r=shu (b8c917d42)
- Bug 1100911 - For MacOS builds running on Valgrind, make ThreadStackHelper::GetStack be a no-op. r=nchen. (d99c02e16)
- Bug 1091758 - Report full paths for most chrome scripts; r=snorp (2b72e7878)
- Bug 1109291 - Include better paths for hanging chrome scripts in profile extensions directory; r=snorp r=bsmedberg (1997b9532)
- Bug 1113416 - Don't read stack labels inside hang monitor sighandler; r=nfroyd r=snorp (9688f6069)
- bug 1146027 - more final r=froydnj (7b0f295e5)
- Bug 1164090 - Check for Windows path separator in BHR file name; r=snorp (f014b4d78)
- Bug 1169034 - include <cstdlib> in ThreadStackHelper.cpp to declare correct overload for std::abs; r=jseward (874d4447e)
- Bug 1182996 - Fix and add missing namespace comments. rs=ehsan (054fc00b2)
- Bug 932865 - Collect thread hang stats in BackgroundHangMonitor; (ac80c8e9f)
- minor anticipated fixes to get it compiling (2bd701d15)
351 lines
11 KiB
C++
351 lines
11 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* vim: set ts=2 sw=2 et tw=80: */
|
|
/* 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"
|
|
#include "nsContentUtils.h"
|
|
#include "mozilla/dom/XBLChildrenElement.h"
|
|
#include "mozilla/dom/HTMLContentElement.h"
|
|
#include "mozilla/dom/HTMLShadowElement.h"
|
|
#include "mozilla/dom/ShadowRoot.h"
|
|
#include "nsIAnonymousContentCreator.h"
|
|
#include "nsIFrame.h"
|
|
|
|
namespace mozilla {
|
|
namespace dom {
|
|
|
|
class MatchedNodes {
|
|
public:
|
|
explicit MatchedNodes(HTMLContentElement* aInsertionPoint)
|
|
: mIsContentElement(true), mContentElement(aInsertionPoint) {}
|
|
|
|
explicit MatchedNodes(XBLChildrenElement* aInsertionPoint)
|
|
: mIsContentElement(false), mChildrenElement(aInsertionPoint) {}
|
|
|
|
uint32_t Length() const
|
|
{
|
|
return mIsContentElement ? mContentElement->MatchedNodes().Length()
|
|
: mChildrenElement->InsertedChildrenLength();
|
|
}
|
|
|
|
nsIContent* operator[](int32_t aIndex) const
|
|
{
|
|
return mIsContentElement ? mContentElement->MatchedNodes()[aIndex]
|
|
: mChildrenElement->InsertedChild(aIndex);
|
|
}
|
|
|
|
bool IsEmpty() const
|
|
{
|
|
return mIsContentElement ? mContentElement->MatchedNodes().IsEmpty()
|
|
: !mChildrenElement->HasInsertedChildren();
|
|
}
|
|
protected:
|
|
bool mIsContentElement;
|
|
union {
|
|
HTMLContentElement* mContentElement;
|
|
XBLChildrenElement* mChildrenElement;
|
|
};
|
|
};
|
|
|
|
static inline MatchedNodes
|
|
GetMatchedNodesForPoint(nsIContent* aContent)
|
|
{
|
|
if (aContent->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
|
|
// XBL case
|
|
return MatchedNodes(static_cast<XBLChildrenElement*>(aContent));
|
|
}
|
|
|
|
// Web components case
|
|
MOZ_ASSERT(aContent->IsHTMLElement(nsGkAtoms::content));
|
|
return MatchedNodes(static_cast<HTMLContentElement*>(aContent));
|
|
}
|
|
|
|
nsIContent*
|
|
ExplicitChildIterator::GetNextChild()
|
|
{
|
|
// If we're already in the inserted-children array, look there first
|
|
if (mIndexInInserted) {
|
|
MOZ_ASSERT(mChild);
|
|
MOZ_ASSERT(nsContentUtils::IsContentInsertionPoint(mChild));
|
|
MOZ_ASSERT(!mDefaultChild);
|
|
|
|
MatchedNodes assignedChildren = GetMatchedNodesForPoint(mChild);
|
|
if (mIndexInInserted < assignedChildren.Length()) {
|
|
return assignedChildren[mIndexInInserted++];
|
|
}
|
|
mIndexInInserted = 0;
|
|
mChild = mChild->GetNextSibling();
|
|
} else if (mShadowIterator) {
|
|
// If we're inside of a <shadow> element, look through the
|
|
// explicit children of the projected ShadowRoot via
|
|
// the mShadowIterator.
|
|
nsIContent* nextChild = mShadowIterator->GetNextChild();
|
|
if (nextChild) {
|
|
return nextChild;
|
|
}
|
|
|
|
mShadowIterator = nullptr;
|
|
mChild = mChild->GetNextSibling();
|
|
} else if (mDefaultChild) {
|
|
// If we're already in default content, check if there are more nodes there
|
|
MOZ_ASSERT(mChild);
|
|
MOZ_ASSERT(nsContentUtils::IsContentInsertionPoint(mChild));
|
|
|
|
mDefaultChild = mDefaultChild->GetNextSibling();
|
|
if (mDefaultChild) {
|
|
return mDefaultChild;
|
|
}
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
} else if (mIsFirst) { // at the beginning of the child list
|
|
mChild = mParent->GetFirstChild();
|
|
mIsFirst = false;
|
|
} else if (mChild) { // in the middle of the child list
|
|
mChild = mChild->GetNextSibling();
|
|
}
|
|
|
|
// Iterate until we find a non-insertion point, or an insertion point with
|
|
// content.
|
|
while (mChild) {
|
|
// If the current child being iterated is a shadow insertion point then
|
|
// the iterator needs to go into the projected ShadowRoot.
|
|
if (ShadowRoot::IsShadowInsertionPoint(mChild)) {
|
|
// Look for the next child in the projected ShadowRoot for the <shadow>
|
|
// element.
|
|
HTMLShadowElement* shadowElem = static_cast<HTMLShadowElement*>(mChild);
|
|
ShadowRoot* projectedShadow = shadowElem->GetOlderShadowRoot();
|
|
if (projectedShadow) {
|
|
mShadowIterator = new ExplicitChildIterator(projectedShadow);
|
|
nsIContent* nextChild = mShadowIterator->GetNextChild();
|
|
if (nextChild) {
|
|
return nextChild;
|
|
}
|
|
mShadowIterator = nullptr;
|
|
}
|
|
mChild = mChild->GetNextSibling();
|
|
} else if (nsContentUtils::IsContentInsertionPoint(mChild)) {
|
|
// 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.
|
|
MatchedNodes assignedChildren = GetMatchedNodesForPoint(mChild);
|
|
if (!assignedChildren.IsEmpty()) {
|
|
// Iterate through elements projected on insertion point.
|
|
mIndexInInserted = 1;
|
|
return assignedChildren[0];
|
|
}
|
|
|
|
// Insertion points inside fallback/default content
|
|
// are considered inactive and do not get assigned nodes.
|
|
mDefaultChild = mChild->GetFirstChild();
|
|
if (mDefaultChild) {
|
|
return mDefaultChild;
|
|
}
|
|
|
|
// 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;
|
|
}
|
|
}
|
|
|
|
return mChild;
|
|
}
|
|
|
|
void
|
|
FlattenedChildIterator::Init(bool aIgnoreXBL)
|
|
{
|
|
if (aIgnoreXBL) {
|
|
return;
|
|
}
|
|
|
|
nsXBLBinding* binding =
|
|
mParent->OwnerDoc()->BindingManager()->GetBindingWithContent(mParent);
|
|
|
|
if (binding) {
|
|
nsIContent* anon = binding->GetAnonymousContent();
|
|
if (anon) {
|
|
mParent = anon;
|
|
mXBLInvolved = true;
|
|
}
|
|
}
|
|
|
|
// We set mXBLInvolved to true if either:
|
|
// - The node we're iterating has a binding with content attached to it.
|
|
// - The node is generated XBL content and has an <xbl:children> child.
|
|
if (!mXBLInvolved && mParent->GetBindingParent()) {
|
|
for (nsIContent* child = mParent->GetFirstChild();
|
|
child;
|
|
child = child->GetNextSibling()) {
|
|
if (child->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
|
|
MOZ_ASSERT(child->GetBindingParent());
|
|
mXBLInvolved = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
nsIContent*
|
|
ExplicitChildIterator::Get()
|
|
{
|
|
MOZ_ASSERT(!mIsFirst);
|
|
|
|
if (mIndexInInserted) {
|
|
MatchedNodes assignedChildren = GetMatchedNodesForPoint(mChild);
|
|
return assignedChildren[mIndexInInserted - 1];
|
|
} else if (mShadowIterator) {
|
|
return mShadowIterator->Get();
|
|
}
|
|
return mDefaultChild ? mDefaultChild : mChild;
|
|
}
|
|
|
|
nsIContent*
|
|
ExplicitChildIterator::GetPreviousChild()
|
|
{
|
|
// If we're already in the inserted-children array, look there first
|
|
if (mIndexInInserted) {
|
|
// NB: mIndexInInserted points one past the last returned child so we need
|
|
// to look *two* indices back in order to return the previous child.
|
|
MatchedNodes assignedChildren = GetMatchedNodesForPoint(mChild);
|
|
if (--mIndexInInserted) {
|
|
return assignedChildren[mIndexInInserted - 1];
|
|
}
|
|
mChild = mChild->GetPreviousSibling();
|
|
} else if (mShadowIterator) {
|
|
nsIContent* previousChild = mShadowIterator->GetPreviousChild();
|
|
if (previousChild) {
|
|
return previousChild;
|
|
}
|
|
mShadowIterator = nullptr;
|
|
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
|
|
mChild = mParent->GetLastChild();
|
|
}
|
|
|
|
// Iterate until we find a non-insertion point, or an insertion point with
|
|
// content.
|
|
while (mChild) {
|
|
if (ShadowRoot::IsShadowInsertionPoint(mChild)) {
|
|
// If the current child being iterated is a shadow insertion point then
|
|
// the iterator needs to go into the projected ShadowRoot.
|
|
HTMLShadowElement* shadowElem = static_cast<HTMLShadowElement*>(mChild);
|
|
ShadowRoot* projectedShadow = shadowElem->GetOlderShadowRoot();
|
|
if (projectedShadow) {
|
|
// Create a ExplicitChildIterator that begins iterating from the end.
|
|
mShadowIterator = new ExplicitChildIterator(projectedShadow, false);
|
|
nsIContent* previousChild = mShadowIterator->GetPreviousChild();
|
|
if (previousChild) {
|
|
return previousChild;
|
|
}
|
|
mShadowIterator = nullptr;
|
|
}
|
|
mChild = mChild->GetPreviousSibling();
|
|
} else if (nsContentUtils::IsContentInsertionPoint(mChild)) {
|
|
// 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.
|
|
MatchedNodes assignedChildren = GetMatchedNodesForPoint(mChild);
|
|
if (!assignedChildren.IsEmpty()) {
|
|
mIndexInInserted = assignedChildren.Length();
|
|
return assignedChildren[mIndexInInserted - 1];
|
|
}
|
|
|
|
mDefaultChild = mChild->GetLastChild();
|
|
if (mDefaultChild) {
|
|
return mDefaultChild;
|
|
}
|
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
} else {
|
|
// mChild is not an insertion point, thus it is the next node to
|
|
// return from this iterator.
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!mChild) {
|
|
mIsFirst = true;
|
|
}
|
|
|
|
return mChild;
|
|
}
|
|
|
|
nsIContent*
|
|
AllChildrenIterator::GetNextChild()
|
|
{
|
|
if (mPhase == eNeedBeforeKid) {
|
|
mPhase = eNeedExplicitKids;
|
|
nsIFrame* frame = mOriginalContent->GetPrimaryFrame();
|
|
if (frame) {
|
|
nsIFrame* beforeFrame = nsLayoutUtils::GetBeforeFrame(frame);
|
|
if (beforeFrame) {
|
|
return beforeFrame->GetContent();
|
|
}
|
|
}
|
|
}
|
|
|
|
if (mPhase == eNeedExplicitKids) {
|
|
nsIContent* kid = ExplicitChildIterator::GetNextChild();
|
|
if (kid) {
|
|
return kid;
|
|
}
|
|
|
|
mPhase = eNeedAnonKids;
|
|
}
|
|
|
|
if (mPhase == eNeedAnonKids) {
|
|
if (mAnonKids.IsEmpty()) {
|
|
nsIAnonymousContentCreator* ac =
|
|
do_QueryFrame(mOriginalContent->GetPrimaryFrame());
|
|
if (ac) {
|
|
ac->AppendAnonymousContentTo(mAnonKids, mFlags);
|
|
}
|
|
}
|
|
|
|
if (!mAnonKids.IsEmpty()) {
|
|
nsIContent* nextKid = mAnonKids[0];
|
|
mAnonKids.RemoveElementAt(0);
|
|
if (mAnonKids.IsEmpty()) {
|
|
mPhase = eNeedAfterKid;
|
|
}
|
|
|
|
return nextKid;
|
|
}
|
|
|
|
mPhase = eNeedAfterKid;
|
|
}
|
|
|
|
if (mPhase == eNeedAfterKid) {
|
|
mPhase = eDone;
|
|
nsIFrame* frame = mOriginalContent->GetPrimaryFrame();
|
|
if (frame) {
|
|
nsIFrame* afterFrame = nsLayoutUtils::GetAfterFrame(frame);
|
|
if (afterFrame) {
|
|
return afterFrame->GetContent();
|
|
}
|
|
}
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
} // namespace dom
|
|
} // namespace mozilla
|