130 lines
5.4 KiB
C++
130 lines
5.4 KiB
C++
/*
|
|
* Copyright (C) 2012 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 APPLE 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 APPLE 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 "config.h"
|
|
#include "SimplifyMarkupCommand.h"
|
|
|
|
#include "NodeRenderStyle.h"
|
|
#include "NodeTraversal.h"
|
|
#include "RenderInline.h"
|
|
#include "RenderObject.h"
|
|
#include "RenderStyle.h"
|
|
|
|
namespace WebCore {
|
|
|
|
SimplifyMarkupCommand::SimplifyMarkupCommand(Document& document, Node* firstNode, Node* nodeAfterLast)
|
|
: CompositeEditCommand(document)
|
|
, m_firstNode(firstNode)
|
|
, m_nodeAfterLast(nodeAfterLast)
|
|
{
|
|
}
|
|
|
|
void SimplifyMarkupCommand::doApply()
|
|
{
|
|
Node* rootNode = m_firstNode->parentNode();
|
|
Vector<Ref<Node>> nodesToRemove;
|
|
|
|
document().updateLayoutIgnorePendingStylesheets();
|
|
|
|
// Walk through the inserted nodes, to see if there are elements that could be removed
|
|
// without affecting the style. The goal is to produce leaner markup even when starting
|
|
// from a verbose fragment.
|
|
// We look at inline elements as well as non top level divs that don't have attributes.
|
|
for (Node* node = m_firstNode.get(); node && node != m_nodeAfterLast; node = NodeTraversal::next(*node)) {
|
|
if (node->firstChild() || (node->isTextNode() && node->nextSibling()))
|
|
continue;
|
|
|
|
Node* startingNode = node->parentNode();
|
|
auto* startingStyle = startingNode->renderStyle();
|
|
if (!startingStyle)
|
|
continue;
|
|
Node* currentNode = startingNode;
|
|
Node* topNodeWithStartingStyle = nullptr;
|
|
while (currentNode != rootNode) {
|
|
if (currentNode->parentNode() != rootNode && isRemovableBlock(currentNode))
|
|
nodesToRemove.append(*currentNode);
|
|
|
|
currentNode = currentNode->parentNode();
|
|
if (!currentNode)
|
|
break;
|
|
|
|
auto* renderer = currentNode->renderer();
|
|
if (!is<RenderInline>(renderer) || downcast<RenderInline>(*renderer).alwaysCreateLineBoxes())
|
|
continue;
|
|
|
|
if (currentNode->firstChild() != currentNode->lastChild()) {
|
|
topNodeWithStartingStyle = nullptr;
|
|
break;
|
|
}
|
|
|
|
OptionSet<StyleDifferenceContextSensitiveProperty> contextSensitiveProperties;
|
|
if (currentNode->renderStyle()->diff(*startingStyle, contextSensitiveProperties) == StyleDifference::Equal)
|
|
topNodeWithStartingStyle = currentNode;
|
|
|
|
}
|
|
if (topNodeWithStartingStyle) {
|
|
for (Node* node = startingNode; node && node != topNodeWithStartingStyle; node = node->parentNode())
|
|
nodesToRemove.append(*node);
|
|
}
|
|
}
|
|
|
|
// we perform all the DOM mutations at once.
|
|
for (size_t i = 0; i < nodesToRemove.size(); ++i) {
|
|
// FIXME: We can do better by directly moving children from nodesToRemove[i].
|
|
int numPrunedAncestors = pruneSubsequentAncestorsToRemove(nodesToRemove, i);
|
|
if (numPrunedAncestors < 0)
|
|
continue;
|
|
removeNodePreservingChildren(nodesToRemove[i], AssumeContentIsAlwaysEditable);
|
|
i += numPrunedAncestors;
|
|
}
|
|
}
|
|
|
|
int SimplifyMarkupCommand::pruneSubsequentAncestorsToRemove(Vector<Ref<Node>>& nodesToRemove, size_t startNodeIndex)
|
|
{
|
|
size_t pastLastNodeToRemove = startNodeIndex + 1;
|
|
for (; pastLastNodeToRemove < nodesToRemove.size(); ++pastLastNodeToRemove) {
|
|
if (nodesToRemove[pastLastNodeToRemove - 1]->parentNode() != nodesToRemove[pastLastNodeToRemove].ptr())
|
|
break;
|
|
if (nodesToRemove[pastLastNodeToRemove]->firstChild() != nodesToRemove[pastLastNodeToRemove]->lastChild())
|
|
break;
|
|
}
|
|
|
|
Node* highestAncestorToRemove = nodesToRemove[pastLastNodeToRemove - 1].ptr();
|
|
RefPtr<ContainerNode> parent = highestAncestorToRemove->parentNode();
|
|
if (!parent) // Parent has already been removed.
|
|
return -1;
|
|
|
|
if (pastLastNodeToRemove == startNodeIndex + 1)
|
|
return 0;
|
|
|
|
removeNode(nodesToRemove[startNodeIndex], AssumeContentIsAlwaysEditable);
|
|
insertNodeBefore(nodesToRemove[startNodeIndex].copyRef(), *highestAncestorToRemove, AssumeContentIsAlwaysEditable);
|
|
removeNode(*highestAncestorToRemove, AssumeContentIsAlwaysEditable);
|
|
|
|
return pastLastNodeToRemove - startNodeIndex - 1;
|
|
}
|
|
|
|
} // namespace WebCore
|