mirror of
https://github.com/flutter/flutter.git
synced 2026-02-20 02:29:02 +08:00
We now only preserve the whitespace inside a <t> element inside the parser. This removes the known n^2 from reattaching whitespace which should make parsing and appending nodes faster. I also removed the dead WhitespaceMode code from the parser, and made the dom-seralizer.sky auto indent the markup so the test output would be readable. R=abarth@chromium.org Review URL: https://codereview.chromium.org/867963006
134 lines
3.4 KiB
C++
134 lines
3.4 KiB
C++
/*
|
|
* Copyright (C) 2010 Google, Inc. All Rights Reserved.
|
|
* Copyright (C) 2011 Apple Inc. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY GOOGLE INC. ``AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE INC. OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
|
|
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "sky/engine/config.h"
|
|
#include "sky/engine/core/html/parser/HTMLElementStack.h"
|
|
|
|
#include "sky/engine/core/dom/Element.h"
|
|
#include "sky/engine/core/html/HTMLElement.h"
|
|
|
|
namespace blink {
|
|
|
|
HTMLElementStack::ElementRecord::ElementRecord(PassRefPtr<ContainerNode> node, PassOwnPtr<ElementRecord> next)
|
|
: m_node(node)
|
|
, m_next(next)
|
|
{
|
|
ASSERT(m_node);
|
|
}
|
|
|
|
HTMLElementStack::ElementRecord::~ElementRecord()
|
|
{
|
|
}
|
|
|
|
HTMLElementStack::HTMLElementStack()
|
|
: m_rootNode(nullptr)
|
|
, m_stackDepth(0)
|
|
, m_preserveWhiteSpaceCount(0)
|
|
{
|
|
}
|
|
|
|
HTMLElementStack::~HTMLElementStack()
|
|
{
|
|
}
|
|
|
|
void HTMLElementStack::popAll()
|
|
{
|
|
m_rootNode = nullptr;
|
|
m_stackDepth = 0;
|
|
m_preserveWhiteSpaceCount = 0;
|
|
while (m_top)
|
|
m_top = m_top->releaseNext();
|
|
}
|
|
|
|
void HTMLElementStack::pop()
|
|
{
|
|
popCommon();
|
|
}
|
|
|
|
void HTMLElementStack::popUntil(Element* element)
|
|
{
|
|
while (top() != element)
|
|
pop();
|
|
}
|
|
|
|
void HTMLElementStack::popUntilPopped(Element* element)
|
|
{
|
|
popUntil(element);
|
|
pop();
|
|
}
|
|
|
|
void HTMLElementStack::pushRootNode(PassRefPtr<ContainerNode> root)
|
|
{
|
|
ASSERT(!m_top);
|
|
ASSERT(!m_rootNode);
|
|
m_rootNode = root.get();
|
|
pushCommon(root);
|
|
}
|
|
|
|
void HTMLElementStack::push(PassRefPtr<ContainerNode> node)
|
|
{
|
|
ASSERT(m_rootNode);
|
|
pushCommon(node);
|
|
}
|
|
|
|
HTMLElementStack::ElementRecord* HTMLElementStack::topRecord() const
|
|
{
|
|
ASSERT(m_top);
|
|
return m_top.get();
|
|
}
|
|
|
|
void HTMLElementStack::pushCommon(PassRefPtr<ContainerNode> node)
|
|
{
|
|
ASSERT(m_rootNode);
|
|
|
|
if (isHTMLTElement(node))
|
|
++m_preserveWhiteSpaceCount;
|
|
m_stackDepth++;
|
|
m_top = adoptPtr(new ElementRecord(node, m_top.release()));
|
|
}
|
|
|
|
void HTMLElementStack::popCommon()
|
|
{
|
|
if (isHTMLTElement(topNode())) {
|
|
ASSERT(m_preserveWhiteSpaceCount);
|
|
--m_preserveWhiteSpaceCount;
|
|
}
|
|
m_top = m_top->releaseNext();
|
|
m_stackDepth--;
|
|
}
|
|
|
|
#ifndef NDEBUG
|
|
|
|
void HTMLElementStack::show()
|
|
{
|
|
for (ElementRecord* record = m_top.get(); record; record = record->next())
|
|
record->element()->showNode();
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|