1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* Copyright (C) 2003-2018 Apple Inc. All rights reserved.
* Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "config.h"
#include "RenderListItem.h"
#include "CSSFontSelector.h"
#include "ElementInlines.h"
#include "ElementTraversal.h"
#include "HTMLNames.h"
#include "HTMLOListElement.h"
#include "HTMLUListElement.h"
#include "PseudoElement.h"
#include "RenderBoxInlines.h"
#include "RenderBoxModelObjectInlines.h"
#include "RenderElementInlines.h"
#include "RenderStyleSetters.h"
#include "RenderTreeBuilder.h"
#include "RenderView.h"
#include "StyleInheritedData.h"
#include "UnicodeBidi.h"
#include <wtf/StackStats.h>
#include <wtf/StdLibExtras.h>
#include <wtf/TZoneMallocInlines.h>
namespace WebCore {
using namespace HTMLNames;
WTF_MAKE_TZONE_OR_ISO_ALLOCATED_IMPL(RenderListItem);
RenderListItem::RenderListItem(Element& element, RenderStyle&& style)
: RenderBlockFlow(Type::ListItem, element, WTFMove(style))
{
ASSERT(isRenderListItem());
setInline(false);
}
RenderListItem::~RenderListItem()
{
// Do not add any code here. Add it to willBeDestroyed() instead.
ASSERT(!m_marker);
}
RenderStyle RenderListItem::computeMarkerStyle() const
{
if (!is<PseudoElement>(element())) {
if (auto markerStyle = getCachedPseudoStyle({ PseudoId::Marker }, &style()))
return RenderStyle::clone(*markerStyle);
}
// The marker always inherits from the list item, regardless of where it might end
// up (e.g., in some deeply nested line box). See CSS3 spec.
auto markerStyle = RenderStyle::create();
markerStyle.inheritFrom(style());
// In the case of a ::before or ::after pseudo-element, we manually apply the properties
// otherwise set in the user-agent stylesheet since we don't support ::before::marker or
// ::after::marker. See bugs.webkit.org/b/218897.
auto fontDescription = style().fontDescription();
fontDescription.setVariantNumericSpacing(FontVariantNumericSpacing::TabularNumbers);
markerStyle.setFontDescription(WTFMove(fontDescription));
markerStyle.setUnicodeBidi(UnicodeBidi::Isolate);
markerStyle.setWhiteSpaceCollapse(WhiteSpaceCollapse::Preserve);
markerStyle.setTextWrapMode(TextWrapMode::NoWrap);
markerStyle.setTextTransform({ });
return markerStyle;
}
bool isHTMLListElement(const Node& node)
{
return is<HTMLUListElement>(node) || is<HTMLOListElement>(node);
}
// Returns the enclosing list with respect to the DOM order.
static Element* enclosingList(const RenderListItem& listItem)
{
auto& element = listItem.element();
auto* pseudoElement = dynamicDowncast<PseudoElement>(element);
auto* parent = pseudoElement ? pseudoElement->hostElement() : element.parentElement();
for (auto* ancestor = parent; ancestor; ancestor = ancestor->parentElement()) {
if (isHTMLListElement(*ancestor) || (ancestor->renderer() && ancestor->renderer()->shouldApplyStyleContainment()))
return ancestor;
}
// If there's no actual list element, then the parent element acts as our
// list for purposes of determining what other list items should be numbered as
// part of the same list.
return parent;
}
static RenderListItem* nextListItemHelper(const Element& list, const Element& element)
{
auto* current = &element;
auto advance = [&] {
if (!current->renderOrDisplayContentsStyle())
current = ElementTraversal::nextIncludingPseudoSkippingChildren(*current, &list);
else
current = ElementTraversal::nextIncludingPseudo(*current, &list);
};
advance();
while (current) {
auto* item = dynamicDowncast<RenderListItem>(current->renderer());
if (!item) {
advance();
continue;
}
auto* otherList = enclosingList(*item);
if (!otherList) {
advance();
continue;
}
// This item is part of our current list, so it's what we're looking for.
if (&list == otherList)
return item;
// We found ourself inside another list; skip the rest of its contents.
current = ElementTraversal::nextIncludingPseudoSkippingChildren(*current, &list);
}
return nullptr;
}
static inline RenderListItem* nextListItem(const Element& list, const RenderListItem& item)
{
return nextListItemHelper(list, item.element());
}
static inline RenderListItem* firstListItem(const Element& list)
{
return nextListItemHelper(list, list);
}
static RenderListItem* previousListItem(const Element& list, const RenderListItem& item)
{
auto* current = &item.element();
auto advance = [&] {
current = ElementTraversal::previousIncludingPseudo(*current, &list);
};
advance();
while (current) {
auto* item = dynamicDowncast<RenderListItem>(current->renderer());
if (!item) {
advance();
continue;
}
auto* otherList = enclosingList(*item);
if (!otherList) {
advance();
continue;
}
// This item is part of our current list, so we found what we're looking for.
if (&list == otherList)
return item;
// We found ourself inside another list; skip the rest of its contents by
// advancing to it. However, since the list itself might be a list item,
// don't advance past it.
current = otherList;
}
return nullptr;
}
void RenderListItem::updateItemValuesForOrderedList(const HTMLOListElement& list)
{
for (auto* listItem = firstListItem(list); listItem; listItem = nextListItem(list, *listItem))
listItem->updateValue();
}
unsigned RenderListItem::itemCountForOrderedList(const HTMLOListElement& list)
{
unsigned itemCount = 0;
for (auto* listItem = firstListItem(list); listItem; listItem = nextListItem(list, *listItem))
++itemCount;
return itemCount;
}
void RenderListItem::updateValueNow() const
{
auto* list = enclosingList(*this);
auto* orderedList = dynamicDowncast<HTMLOListElement>(list);
// The start item is either the closest item before this one in the list that already has a value,
// or the first item in the list if none have before this have values yet.
// FIXME: This should skip over items with counter-reset.
auto* startItem = this;
if (list) {
auto* item = this;
while ((item = previousListItem(*list, *item))) {
startItem = item;
if (item->m_value)
break;
}
}
int defaultIncrement = orderedList && orderedList->isReversed() ? -1 : 1;
auto valueForItem = [&](int previousValue, CounterDirectives& directives) {
if (directives.setValue)
return *directives.setValue;
int increment = directives.incrementValue.value_or(defaultIncrement);
if (directives.resetValue)
return *directives.resetValue + increment;
return previousValue + increment;
};
auto& startValue = startItem->m_value;
if (!startValue) {
// Take in account enclosing list counter-reset.
// FIXME: This can be a lot more simple when lists use presentational hints.
if (list && list->renderer()) {
auto listDirectives = list->renderer()->style().counterDirectives().map.get("list-item"_s);
if (listDirectives.resetValue)
startValue = *listDirectives.resetValue;
else
startValue = orderedList ? orderedList->start() - defaultIncrement : 0;
}
auto directives = startItem->style().counterDirectives().map.get("list-item"_s);
startValue = valueForItem(startValue.value_or(0), directives);
}
int value = *startValue;
for (auto* item = startItem; item != this; ) {
item = nextListItem(*list, *item);
auto directives = item->style().counterDirectives().map.get("list-item"_s);
item->m_value = valueForItem(value, directives);
// counter-reset creates a new nested counter, so it should not be counted towards the current counter.
if (!directives.resetValue)
value = *item->m_value;
}
}
void RenderListItem::updateValue()
{
m_value = std::nullopt;
if (m_marker)
m_marker->setNeedsLayoutAndPrefWidthsRecalc();
}
void RenderListItem::styleDidChange(StyleDifference diff, const RenderStyle* oldStyle)
{
RenderBlockFlow::styleDidChange(diff, oldStyle);
if (diff == StyleDifference::Layout && oldStyle && oldStyle->counterDirectives().map.get("list-item"_s) != style().counterDirectives().map.get("list-item"_s))
counterDirectivesChanged();
}
void RenderListItem::computePreferredLogicalWidths()
{
// FIXME: RenderListMarker::updateInlineMargins() mutates margin style which affects preferred widths.
if (m_marker && m_marker->preferredLogicalWidthsDirty())
m_marker->updateInlineMarginsAndContent();
RenderBlockFlow::computePreferredLogicalWidths();
}
void RenderListItem::paint(PaintInfo& paintInfo, const LayoutPoint& paintOffset)
{
if (!logicalHeight() && hasNonVisibleOverflow())
return;
RenderBlockFlow::paint(paintInfo, paintOffset);
}
String RenderListItem::markerTextWithoutSuffix() const
{
if (!m_marker)
return { };
return m_marker->textWithoutSuffix();
}
String RenderListItem::markerTextWithSuffix() const
{
if (!m_marker)
return { };
return m_marker->textWithSuffix();
}
void RenderListItem::counterDirectivesChanged()
{
if (m_marker)
m_marker->setNeedsLayoutAndPrefWidthsRecalc();
updateValue();
auto* list = enclosingList(*this);
if (!list)
return;
auto* item = this;
while ((item = nextListItem(*list, *item)))
item->updateValue();
}
void RenderListItem::updateListMarkerNumbers()
{
auto* list = enclosingList(*this);
if (!list)
return;
bool isInReversedOrderedList = false;
if (RefPtr orderedList = dynamicDowncast<HTMLOListElement>(*list)) {
orderedList->itemCountChanged();
isInReversedOrderedList = orderedList->isReversed();
}
// If an item has been marked for update before, we know that all following items have, too.
// This gives us the opportunity to stop and avoid marking the same nodes again.
auto* item = this;
auto subsequentListItem = isInReversedOrderedList ? previousListItem : nextListItem;
while ((item = subsequentListItem(*list, *item)) && item->m_value)
item->updateValue();
}
bool RenderListItem::isInReversedOrderedList() const
{
auto* list = dynamicDowncast<HTMLOListElement>(enclosingList(*this));
return list && list->isReversed();
}
} // namespace WebCore
|