зеркало из https://github.com/mozilla/gecko-dev.git
Bug 1159042 - p4. Make mDirtyRoots manage roots in preferred depth order - r=dbaron
When popping a dirty root, take the shallowest one first (so we reflow from outer frames first, to avoid potential duplicate reflow of inner frames). Prevent duplicate roots (to be reworked in a future bug). Differential Revision: https://phabricator.services.mozilla.com/D9490 --HG-- extra : moz-landing-system : lando
This commit is contained in:
Родитель
c2742fa954
Коммит
16349625aa
|
@ -567,20 +567,35 @@ class MOZ_STACK_CLASS AutoPointerEventTargetUpdater final {
|
|||
nsIContent** mTargetContent;
|
||||
};
|
||||
|
||||
void nsIPresShell::DirtyRootsList::AppendElement(nsIFrame* aFrame) {
|
||||
mList.AppendElement(aFrame);
|
||||
void nsIPresShell::DirtyRootsList::Add(nsIFrame* aFrame) {
|
||||
// Is this root already scheduled for reflow?
|
||||
// FIXME: This could possibly be changed to a uniqueness assertion, with some
|
||||
// work in ResizeReflowIgnoreOverride (and maybe others?)
|
||||
if (mList.Contains(aFrame)) {
|
||||
// We don't expect frame to change depths.
|
||||
MOZ_ASSERT(aFrame->GetDepthInFrameTree() ==
|
||||
mList[mList.IndexOf(aFrame)].mDepth);
|
||||
return;
|
||||
}
|
||||
|
||||
mList.InsertElementSorted(
|
||||
FrameAndDepth{aFrame, aFrame->GetDepthInFrameTree()},
|
||||
FrameAndDepth::CompareByReverseDepth{});
|
||||
}
|
||||
|
||||
void nsIPresShell::DirtyRootsList::RemoveElement(nsIFrame* aFrame) {
|
||||
void nsIPresShell::DirtyRootsList::Remove(nsIFrame* aFrame) {
|
||||
mList.RemoveElement(aFrame);
|
||||
}
|
||||
|
||||
void nsIPresShell::DirtyRootsList::RemoveElements(nsIFrame* aFrame) {
|
||||
mList.RemoveElementsBy([&](nsIFrame* aRoot) { return aRoot == aFrame; });
|
||||
}
|
||||
|
||||
void nsIPresShell::DirtyRootsList::RemoveElementAt(size_t aIndex) {
|
||||
return mList.RemoveElementAt(aIndex);
|
||||
nsIFrame* nsIPresShell::DirtyRootsList::PopShallowestRoot() {
|
||||
// List is sorted in order of decreasing depth, so there are no deeper
|
||||
// frames than the last one.
|
||||
const FrameAndDepth& lastFAD = mList.LastElement();
|
||||
nsIFrame* frame = lastFAD.mFrame;
|
||||
// We don't expect frame to change depths.
|
||||
MOZ_ASSERT(frame->GetDepthInFrameTree() == lastFAD.mDepth);
|
||||
mList.RemoveLastElement();
|
||||
return frame;
|
||||
}
|
||||
|
||||
void nsIPresShell::DirtyRootsList::Clear() { mList.Clear(); }
|
||||
|
@ -591,7 +606,24 @@ bool nsIPresShell::DirtyRootsList::Contains(nsIFrame* aFrame) const {
|
|||
|
||||
bool nsIPresShell::DirtyRootsList::IsEmpty() const { return mList.IsEmpty(); }
|
||||
|
||||
size_t nsIPresShell::DirtyRootsList::Length() const { return mList.Length(); }
|
||||
bool nsIPresShell::DirtyRootsList::FrameIsAncestorOfDirtyRoot(
|
||||
nsIFrame* aFrame) const {
|
||||
MOZ_ASSERT(aFrame);
|
||||
|
||||
// Look for a path from any dirty roots to aFrame, following GetParent().
|
||||
// This check mirrors what FrameNeedsReflow() would have done if the reflow
|
||||
// root didn't get in the way.
|
||||
for (nsIFrame* dirtyFrame : mList) {
|
||||
do {
|
||||
if (dirtyFrame == aFrame) {
|
||||
return true;
|
||||
}
|
||||
dirtyFrame = dirtyFrame->GetParent();
|
||||
} while (dirtyFrame);
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
bool PresShell::sDisableNonTestMouseEvents = false;
|
||||
|
||||
|
@ -1936,7 +1968,7 @@ nsresult PresShell::ResizeReflowIgnoreOverride(nscoord aWidth, nscoord aHeight,
|
|||
AUTO_LAYOUT_PHASE_ENTRY_POINT(GetPresContext(), Reflow);
|
||||
nsViewManager::AutoDisableRefresh refreshBlocker(viewManager);
|
||||
|
||||
mDirtyRoots.RemoveElement(rootFrame);
|
||||
mDirtyRoots.Remove(rootFrame);
|
||||
DoReflow(rootFrame, true, nullptr);
|
||||
|
||||
if (shrinkToFit) {
|
||||
|
@ -2066,7 +2098,7 @@ void PresShell::NotifyDestroyingFrame(nsIFrame* aFrame) {
|
|||
|
||||
mFrameConstructor->NotifyDestroyingFrame(aFrame);
|
||||
|
||||
mDirtyRoots.RemoveElements(aFrame);
|
||||
mDirtyRoots.Remove(aFrame);
|
||||
|
||||
// Remove frame properties
|
||||
aFrame->DeleteAllProperties();
|
||||
|
@ -2644,7 +2676,7 @@ void PresShell::FrameNeedsReflow(nsIFrame* aFrame,
|
|||
if (FRAME_IS_REFLOW_ROOT(f) || !f->GetParent()) {
|
||||
// we've hit a reflow root or the root frame
|
||||
if (!wasDirty) {
|
||||
mDirtyRoots.AppendElement(f);
|
||||
mDirtyRoots.Add(f);
|
||||
SetNeedLayoutFlush();
|
||||
}
|
||||
#ifdef DEBUG
|
||||
|
@ -4297,22 +4329,7 @@ void PresShell::NotifyCounterStylesAreDirty() {
|
|||
}
|
||||
|
||||
bool nsIPresShell::FrameIsAncestorOfDirtyRoot(nsIFrame* aFrame) const {
|
||||
MOZ_ASSERT(aFrame);
|
||||
|
||||
// Look for a path from any dirty roots to aFrame, following GetParent().
|
||||
// This check mirrors what FrameNeedsReflow() would have done if the reflow
|
||||
// root didn't get in the way.
|
||||
for (nsIFrame* dirtyFrame : mDirtyRoots) {
|
||||
while (dirtyFrame) {
|
||||
if (dirtyFrame == aFrame) {
|
||||
return true;
|
||||
}
|
||||
|
||||
dirtyFrame = dirtyFrame->GetParent();
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
return mDirtyRoots.FrameIsAncestorOfDirtyRoot(aFrame);
|
||||
}
|
||||
|
||||
void PresShell::ReconstructFrames() {
|
||||
|
@ -8575,7 +8592,7 @@ bool PresShell::DoReflow(nsIFrame* target, bool aInterruptible,
|
|||
}
|
||||
|
||||
NS_ASSERTION(NS_SUBTREE_DIRTY(target), "Why is the target not dirty?");
|
||||
mDirtyRoots.AppendElement(target);
|
||||
mDirtyRoots.Add(target);
|
||||
SetNeedLayoutFlush();
|
||||
|
||||
// Clear mFramesToDirty after we've done the NS_SUBTREE_DIRTY(target)
|
||||
|
@ -8667,9 +8684,7 @@ bool PresShell::ProcessReflowCommands(bool aInterruptible) {
|
|||
|
||||
do {
|
||||
// Send an incremental reflow notification to the target frame.
|
||||
int32_t idx = mDirtyRoots.Length() - 1;
|
||||
nsIFrame* target = mDirtyRoots[idx];
|
||||
mDirtyRoots.RemoveElementAt(idx);
|
||||
nsIFrame* target = mDirtyRoots.PopShallowestRoot();
|
||||
|
||||
if (!NS_SUBTREE_DIRTY(target)) {
|
||||
// It's not dirty anymore, which probably means the notification
|
||||
|
|
|
@ -1743,22 +1743,44 @@ class nsIPresShell : public nsStubDocumentObserver {
|
|||
|
||||
class DirtyRootsList {
|
||||
public:
|
||||
void AppendElement(nsIFrame* aFrame);
|
||||
void RemoveElement(nsIFrame* aFrame);
|
||||
void RemoveElements(nsIFrame* aFrame);
|
||||
void RemoveElementAt(size_t aIndex);
|
||||
// Add a dirty root.
|
||||
void Add(nsIFrame* aFrame);
|
||||
// Remove this frame if present.
|
||||
void Remove(nsIFrame* aFrame);
|
||||
// Remove and return one of the shallowest dirty roots from the list.
|
||||
// (If two roots are at the same depth, order is indeterminate.)
|
||||
nsIFrame* PopShallowestRoot();
|
||||
// Remove all dirty roots.
|
||||
void Clear();
|
||||
// Is this frame one of the dirty roots?
|
||||
bool Contains(nsIFrame* aFrame) const;
|
||||
// Are there no dirty roots?
|
||||
bool IsEmpty() const;
|
||||
size_t Length() const;
|
||||
auto begin() const { return mList.begin(); }
|
||||
auto begin() { return mList.begin(); }
|
||||
auto end() const { return mList.end(); }
|
||||
auto end() { return mList.end(); }
|
||||
auto& operator[](size_t i) { return mList[i]; }
|
||||
// Is the given frame an ancestor of any dirty root?
|
||||
bool FrameIsAncestorOfDirtyRoot(nsIFrame* aFrame) const;
|
||||
|
||||
private:
|
||||
nsTArray<nsIFrame*> mList;
|
||||
struct FrameAndDepth {
|
||||
nsIFrame* mFrame;
|
||||
const uint32_t mDepth;
|
||||
|
||||
// Easy conversion to nsIFrame*, as it's the most likely need.
|
||||
operator nsIFrame*() const { return mFrame; }
|
||||
|
||||
// Used to sort by reverse depths, i.e., deeper < shallower.
|
||||
class CompareByReverseDepth {
|
||||
public:
|
||||
bool Equals(const FrameAndDepth& aA, const FrameAndDepth& aB) const {
|
||||
return aA.mDepth == aB.mDepth;
|
||||
}
|
||||
bool LessThan(const FrameAndDepth& aA, const FrameAndDepth& aB) const {
|
||||
// Reverse depth! So '>' instead of '<'.
|
||||
return aA.mDepth > aB.mDepth;
|
||||
}
|
||||
};
|
||||
};
|
||||
// List of all known dirty roots, sorted by decreasing depths.
|
||||
nsTArray<FrameAndDepth> mList;
|
||||
};
|
||||
|
||||
// Reflow roots that need to be reflowed.
|
||||
|
|
Загрузка…
Ссылка в новой задаче