TreeBuilder.cpp 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779
  1. /*
  2. * Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022-2023, Sam Atkins <atkinssj@serenityos.org>
  4. * Copyright (c) 2022, MacDue <macdue@dueutil.tech>
  5. *
  6. * SPDX-License-Identifier: BSD-2-Clause
  7. */
  8. #include <AK/Error.h>
  9. #include <AK/Optional.h>
  10. #include <AK/TemporaryChange.h>
  11. #include <LibWeb/CSS/StyleComputer.h>
  12. #include <LibWeb/CSS/StyleValues/DisplayStyleValue.h>
  13. #include <LibWeb/CSS/StyleValues/IdentifierStyleValue.h>
  14. #include <LibWeb/CSS/StyleValues/PercentageStyleValue.h>
  15. #include <LibWeb/DOM/Document.h>
  16. #include <LibWeb/DOM/Element.h>
  17. #include <LibWeb/DOM/ParentNode.h>
  18. #include <LibWeb/DOM/ShadowRoot.h>
  19. #include <LibWeb/Dump.h>
  20. #include <LibWeb/HTML/HTMLButtonElement.h>
  21. #include <LibWeb/HTML/HTMLInputElement.h>
  22. #include <LibWeb/HTML/HTMLLIElement.h>
  23. #include <LibWeb/HTML/HTMLOListElement.h>
  24. #include <LibWeb/HTML/HTMLSlotElement.h>
  25. #include <LibWeb/Layout/ListItemBox.h>
  26. #include <LibWeb/Layout/ListItemMarkerBox.h>
  27. #include <LibWeb/Layout/Node.h>
  28. #include <LibWeb/Layout/SVGMaskBox.h>
  29. #include <LibWeb/Layout/TableGrid.h>
  30. #include <LibWeb/Layout/TableWrapper.h>
  31. #include <LibWeb/Layout/TextNode.h>
  32. #include <LibWeb/Layout/TreeBuilder.h>
  33. #include <LibWeb/Layout/Viewport.h>
  34. #include <LibWeb/SVG/SVGForeignObjectElement.h>
  35. namespace Web::Layout {
  36. TreeBuilder::TreeBuilder() = default;
  37. static bool has_inline_or_in_flow_block_children(Layout::Node const& layout_node)
  38. {
  39. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  40. if (child->is_inline())
  41. return true;
  42. if (!child->is_floating() && !child->is_absolutely_positioned())
  43. return true;
  44. }
  45. return false;
  46. }
  47. static bool has_in_flow_block_children(Layout::Node const& layout_node)
  48. {
  49. if (layout_node.children_are_inline())
  50. return false;
  51. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  52. if (child->is_inline())
  53. continue;
  54. if (!child->is_floating() && !child->is_absolutely_positioned())
  55. return true;
  56. }
  57. return false;
  58. }
  59. // The insertion_parent_for_*() functions maintain the invariant that the in-flow children of
  60. // block-level boxes must be either all block-level or all inline-level.
  61. static Layout::Node& insertion_parent_for_inline_node(Layout::NodeWithStyle& layout_parent)
  62. {
  63. auto last_child_creating_anonymous_wrapper_if_needed = [](auto& layout_parent) -> Layout::Node& {
  64. if (!layout_parent.last_child()
  65. || !layout_parent.last_child()->is_anonymous()
  66. || !layout_parent.last_child()->children_are_inline()
  67. || layout_parent.last_child()->is_generated()) {
  68. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  69. }
  70. return *layout_parent.last_child();
  71. };
  72. if (layout_parent.display().is_inline_outside() && layout_parent.display().is_flow_inside())
  73. return layout_parent;
  74. if (layout_parent.display().is_flex_inside() || layout_parent.display().is_grid_inside())
  75. return last_child_creating_anonymous_wrapper_if_needed(layout_parent);
  76. if (!has_in_flow_block_children(layout_parent) || layout_parent.children_are_inline())
  77. return layout_parent;
  78. // Parent has block-level children, insert into an anonymous wrapper block (and create it first if needed)
  79. return last_child_creating_anonymous_wrapper_if_needed(layout_parent);
  80. }
  81. static Layout::Node& insertion_parent_for_block_node(Layout::NodeWithStyle& layout_parent, Layout::Node& layout_node)
  82. {
  83. if (!has_inline_or_in_flow_block_children(layout_parent)) {
  84. // Parent block has no children, insert this block into parent.
  85. return layout_parent;
  86. }
  87. bool is_out_of_flow = layout_node.is_absolutely_positioned() || layout_node.is_floating();
  88. if (is_out_of_flow
  89. && !layout_parent.display().is_flex_inside()
  90. && !layout_parent.display().is_grid_inside()
  91. && layout_parent.last_child()->is_anonymous()
  92. && layout_parent.last_child()->children_are_inline()) {
  93. // Block is out-of-flow & previous sibling was wrapped in an anonymous block.
  94. // Join the previous sibling inside the anonymous block.
  95. return *layout_parent.last_child();
  96. }
  97. if (!layout_parent.children_are_inline()) {
  98. // Parent block has block-level children, insert this block into parent.
  99. return layout_parent;
  100. }
  101. if (is_out_of_flow) {
  102. // Block is out-of-flow, it can have inline siblings if necessary.
  103. return layout_parent;
  104. }
  105. // Parent block has inline-level children (our siblings).
  106. // First move these siblings into an anonymous wrapper block.
  107. Vector<JS::Handle<Layout::Node>> children;
  108. {
  109. JS::GCPtr<Layout::Node> next;
  110. for (JS::GCPtr<Layout::Node> child = layout_parent.first_child(); child; child = next) {
  111. next = child->next_sibling();
  112. // NOTE: We let out-of-flow children stay in the parent, to preserve tree structure.
  113. if (child->is_floating() || child->is_absolutely_positioned())
  114. continue;
  115. layout_parent.remove_child(*child);
  116. children.append(*child);
  117. }
  118. }
  119. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  120. layout_parent.set_children_are_inline(false);
  121. for (auto& child : children) {
  122. layout_parent.last_child()->append_child(*child);
  123. }
  124. layout_parent.last_child()->set_children_are_inline(true);
  125. // Then it's safe to insert this block into parent.
  126. return layout_parent;
  127. }
  128. void TreeBuilder::insert_node_into_inline_or_block_ancestor(Layout::Node& node, CSS::Display display, AppendOrPrepend mode)
  129. {
  130. if (node.display().is_contents())
  131. return;
  132. if (display.is_inline_outside()) {
  133. // Inlines can be inserted into the nearest ancestor without "display: contents".
  134. auto& nearest_ancestor_without_display_contents = [&]() -> Layout::NodeWithStyle& {
  135. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  136. if (!ancestor->display().is_contents())
  137. return ancestor;
  138. }
  139. VERIFY_NOT_REACHED();
  140. }();
  141. auto& insertion_point = insertion_parent_for_inline_node(nearest_ancestor_without_display_contents);
  142. if (mode == AppendOrPrepend::Prepend)
  143. insertion_point.prepend_child(node);
  144. else
  145. insertion_point.append_child(node);
  146. insertion_point.set_children_are_inline(true);
  147. } else {
  148. // Non-inlines can't be inserted into an inline parent, so find the nearest non-inline ancestor.
  149. auto& nearest_non_inline_ancestor = [&]() -> Layout::NodeWithStyle& {
  150. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  151. if (ancestor->display().is_contents())
  152. continue;
  153. if (!ancestor->display().is_inline_outside())
  154. return ancestor;
  155. if (!ancestor->display().is_flow_inside())
  156. return ancestor;
  157. if (ancestor->dom_node() && is<SVG::SVGForeignObjectElement>(*ancestor->dom_node()))
  158. return ancestor;
  159. }
  160. VERIFY_NOT_REACHED();
  161. }();
  162. auto& insertion_point = insertion_parent_for_block_node(nearest_non_inline_ancestor, node);
  163. if (mode == AppendOrPrepend::Prepend)
  164. insertion_point.prepend_child(node);
  165. else
  166. insertion_point.append_child(node);
  167. // After inserting an in-flow block-level box into a parent, mark the parent as having non-inline children.
  168. if (!node.is_floating() && !node.is_absolutely_positioned())
  169. insertion_point.set_children_are_inline(false);
  170. }
  171. }
  172. void TreeBuilder::create_pseudo_element_if_needed(DOM::Element& element, CSS::Selector::PseudoElement::Type pseudo_element, AppendOrPrepend mode)
  173. {
  174. auto& document = element.document();
  175. auto& style_computer = document.style_computer();
  176. auto pseudo_element_style = style_computer.compute_pseudo_element_style_if_needed(element, pseudo_element);
  177. if (!pseudo_element_style)
  178. return;
  179. auto initial_quote_nesting_level = m_quote_nesting_level;
  180. auto [pseudo_element_content, final_quote_nesting_level] = pseudo_element_style->content(initial_quote_nesting_level);
  181. m_quote_nesting_level = final_quote_nesting_level;
  182. auto pseudo_element_display = pseudo_element_style->display();
  183. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  184. // We also don't create them if they are `display: none`.
  185. if (pseudo_element_display.is_none()
  186. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  187. || pseudo_element_content.type == CSS::ContentData::Type::None)
  188. return;
  189. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, *pseudo_element_style, nullptr);
  190. if (!pseudo_element_node)
  191. return;
  192. auto generated_for = Node::GeneratedFor::NotGenerated;
  193. if (pseudo_element == CSS::Selector::PseudoElement::Type::Before) {
  194. generated_for = Node::GeneratedFor::PseudoBefore;
  195. } else if (pseudo_element == CSS::Selector::PseudoElement::Type::After) {
  196. generated_for = Node::GeneratedFor::PseudoAfter;
  197. } else {
  198. VERIFY_NOT_REACHED();
  199. }
  200. pseudo_element_node->set_generated_for(generated_for, element);
  201. pseudo_element_node->set_initial_quote_nesting_level(initial_quote_nesting_level);
  202. // FIXME: Handle images, and multiple values
  203. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  204. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data);
  205. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  206. text_node->set_generated_for(generated_for, element);
  207. push_parent(verify_cast<NodeWithStyle>(*pseudo_element_node));
  208. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  209. pop_parent();
  210. } else {
  211. TODO();
  212. }
  213. element.set_pseudo_element_node({}, pseudo_element, pseudo_element_node);
  214. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  215. }
  216. static bool is_ignorable_whitespace(Layout::Node const& node)
  217. {
  218. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().bytes_as_string_view().is_whitespace())
  219. return true;
  220. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  221. bool contains_only_white_space = true;
  222. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  223. if (!text_node.text_for_rendering().bytes_as_string_view().is_whitespace()) {
  224. contains_only_white_space = false;
  225. return IterationDecision::Break;
  226. }
  227. return IterationDecision::Continue;
  228. });
  229. if (contains_only_white_space)
  230. return true;
  231. }
  232. return false;
  233. }
  234. i32 TreeBuilder::calculate_list_item_index(DOM::Node& dom_node)
  235. {
  236. if (is<HTML::HTMLLIElement>(dom_node)) {
  237. auto& li = static_cast<HTML::HTMLLIElement&>(dom_node);
  238. if (li.value() != 0)
  239. return li.value();
  240. }
  241. if (dom_node.previous_sibling() != nullptr) {
  242. DOM::Node* current = dom_node.previous_sibling();
  243. while (current != nullptr) {
  244. if (is<HTML::HTMLLIElement>(*current))
  245. return calculate_list_item_index(*current) + 1;
  246. current = current->previous_sibling();
  247. }
  248. }
  249. if (is<HTML::HTMLOListElement>(*dom_node.parent())) {
  250. auto& ol = static_cast<HTML::HTMLOListElement&>(*dom_node.parent());
  251. return ol.start();
  252. }
  253. return 1;
  254. }
  255. void TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  256. {
  257. JS::GCPtr<Layout::Node> layout_node;
  258. Optional<TemporaryChange<bool>> has_svg_root_change;
  259. ScopeGuard remove_stale_layout_node_guard = [&] {
  260. // If we didn't create a layout node for this DOM node,
  261. // go through the DOM tree and remove any old layout & paint nodes since they are now all stale.
  262. if (!layout_node) {
  263. dom_node.for_each_in_inclusive_subtree([&](auto& node) {
  264. node.detach_layout_node({});
  265. node.set_paintable(nullptr);
  266. if (is<DOM::Element>(node))
  267. static_cast<DOM::Element&>(node).clear_pseudo_element_nodes({});
  268. return IterationDecision::Continue;
  269. });
  270. }
  271. };
  272. if (dom_node.is_svg_container()) {
  273. has_svg_root_change.emplace(context.has_svg_root, true);
  274. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  275. return;
  276. }
  277. auto& document = dom_node.document();
  278. auto& style_computer = document.style_computer();
  279. RefPtr<CSS::StyleProperties> style;
  280. CSS::Display display;
  281. if (is<DOM::Element>(dom_node)) {
  282. auto& element = static_cast<DOM::Element&>(dom_node);
  283. element.clear_pseudo_element_nodes({});
  284. VERIFY(!element.needs_style_update());
  285. style = element.computed_css_values();
  286. display = style->display();
  287. if (display.is_none())
  288. return;
  289. layout_node = element.create_layout_node(*style);
  290. } else if (is<DOM::Document>(dom_node)) {
  291. style = style_computer.create_document_style();
  292. display = style->display();
  293. layout_node = document.heap().allocate_without_realm<Layout::Viewport>(static_cast<DOM::Document&>(dom_node), *style);
  294. } else if (is<DOM::Text>(dom_node)) {
  295. layout_node = document.heap().allocate_without_realm<Layout::TextNode>(document, static_cast<DOM::Text&>(dom_node));
  296. display = CSS::Display(CSS::DisplayOutside::Inline, CSS::DisplayInside::Flow);
  297. }
  298. if (context.layout_svg_mask && is<SVG::SVGMaskElement>(dom_node)) {
  299. layout_node = document.heap().allocate_without_realm<Layout::SVGMaskBox>(document, static_cast<SVG::SVGMaskElement&>(dom_node), *style);
  300. // We're here if our parent is a use of an SVG mask, but we don't want to lay out any <mask> elements that could be a child of this mask.
  301. context.layout_svg_mask = false;
  302. }
  303. if (!layout_node)
  304. return;
  305. if (!dom_node.parent_or_shadow_host()) {
  306. m_layout_root = layout_node;
  307. } else if (layout_node->is_svg_box()) {
  308. m_ancestor_stack.last()->append_child(*layout_node);
  309. } else {
  310. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  311. }
  312. auto* shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root_internal() : nullptr;
  313. // Add node for the ::before pseudo-element.
  314. if (is<DOM::Element>(dom_node) && layout_node->can_have_children()) {
  315. auto& element = static_cast<DOM::Element&>(dom_node);
  316. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  317. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Type::Before, AppendOrPrepend::Prepend);
  318. pop_parent();
  319. }
  320. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children()) {
  321. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  322. if (shadow_root) {
  323. for (auto* node = shadow_root->first_child(); node; node = node->next_sibling()) {
  324. create_layout_tree(*node, context);
  325. }
  326. } else {
  327. // This is the same as verify_cast<DOM::ParentNode>(dom_node).for_each_child
  328. for (auto* node = verify_cast<DOM::ParentNode>(dom_node).first_child(); node; node = node->next_sibling())
  329. create_layout_tree(*node, context);
  330. }
  331. pop_parent();
  332. }
  333. if (is<ListItemBox>(*layout_node)) {
  334. auto& element = static_cast<DOM::Element&>(dom_node);
  335. auto marker_style = style_computer.compute_style(element, CSS::Selector::PseudoElement::Type::Marker);
  336. auto list_item_marker = document.heap().allocate_without_realm<ListItemMarkerBox>(document, layout_node->computed_values().list_style_type(), layout_node->computed_values().list_style_position(), calculate_list_item_index(dom_node), *marker_style);
  337. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  338. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Type::Marker, list_item_marker);
  339. layout_node->append_child(*list_item_marker);
  340. }
  341. if (is<HTML::HTMLSlotElement>(dom_node)) {
  342. auto slottables = static_cast<HTML::HTMLSlotElement&>(dom_node).assigned_nodes_internal();
  343. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  344. for (auto const& slottable : slottables)
  345. slottable.visit([&](auto& node) { create_layout_tree(node, context); });
  346. pop_parent();
  347. }
  348. if (is<SVG::SVGGraphicsElement>(dom_node)) {
  349. auto& graphics_element = static_cast<SVG::SVGGraphicsElement&>(dom_node);
  350. // Create the layout tree for the SVG mask as a child of the masked element. Note: This will create
  351. // a new subtree for each use of the mask (so there's not a 1-to-1 mapping from DOM node to mask
  352. // layout node). Each use of a mask may be laid out differently so this duplication is necessary.
  353. if (auto mask = graphics_element.mask()) {
  354. TemporaryChange<bool> layout_mask(context.layout_svg_mask, true);
  355. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  356. create_layout_tree(const_cast<SVG::SVGMaskElement&>(*mask), context);
  357. pop_parent();
  358. }
  359. }
  360. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  361. // If the computed value of 'inline-size' is 'auto', then the used value is the fit-content inline size.
  362. if (dom_node.is_html_button_element() && dom_node.layout_node()->computed_values().width().is_auto()) {
  363. auto& computed_values = verify_cast<NodeWithStyle>(*dom_node.layout_node()).mutable_computed_values();
  364. computed_values.set_width(CSS::Size::make_fit_content());
  365. }
  366. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  367. // If the element is an input element, or if it is a button element and its computed value for
  368. // 'display' is not 'inline-grid', 'grid', 'inline-flex', or 'flex', then the element's box has
  369. // a child anonymous button content box with the following behaviors:
  370. if (dom_node.is_html_button_element() && !display.is_grid_inside() && !display.is_flex_inside()) {
  371. auto& parent = *dom_node.layout_node();
  372. // If the box does not overflow in the vertical axis, then it is centered vertically.
  373. // FIXME: Only apply alignment when box overflows
  374. auto flex_computed_values = parent.computed_values().clone_inherited_values();
  375. auto& mutable_flex_computed_values = static_cast<CSS::MutableComputedValues&>(*flex_computed_values);
  376. mutable_flex_computed_values.set_display(CSS::Display { CSS::DisplayOutside::Block, CSS::DisplayInside::Flex });
  377. mutable_flex_computed_values.set_justify_content(CSS::JustifyContent::Center);
  378. mutable_flex_computed_values.set_flex_direction(CSS::FlexDirection::Column);
  379. mutable_flex_computed_values.set_height(CSS::Size::make_percentage(CSS::Percentage(100)));
  380. mutable_flex_computed_values.set_min_height(parent.computed_values().min_height());
  381. auto flex_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(flex_computed_values));
  382. auto content_box_computed_values = parent.computed_values().clone_inherited_values();
  383. auto content_box_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(content_box_computed_values));
  384. content_box_wrapper->set_children_are_inline(parent.children_are_inline());
  385. Vector<JS::Handle<Node>> sequence;
  386. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  387. if (child->is_generated_for_before_pseudo_element())
  388. continue;
  389. sequence.append(*child);
  390. }
  391. for (auto& node : sequence) {
  392. parent.remove_child(*node);
  393. content_box_wrapper->append_child(*node);
  394. }
  395. flex_wrapper->append_child(*content_box_wrapper);
  396. parent.append_child(*flex_wrapper);
  397. parent.set_children_are_inline(false);
  398. }
  399. // Add nodes for the ::after pseudo-element.
  400. if (is<DOM::Element>(dom_node) && layout_node->can_have_children()) {
  401. auto& element = static_cast<DOM::Element&>(dom_node);
  402. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  403. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Type::After, AppendOrPrepend::Append);
  404. pop_parent();
  405. }
  406. }
  407. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  408. {
  409. VERIFY(dom_node.is_document());
  410. Context context;
  411. m_quote_nesting_level = 0;
  412. create_layout_tree(dom_node, context);
  413. if (auto* root = dom_node.document().layout_node())
  414. fixup_tables(*root);
  415. return move(m_layout_root);
  416. }
  417. template<CSS::DisplayInternal internal, typename Callback>
  418. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  419. {
  420. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  421. auto const display = box.display();
  422. if (display.is_internal() && display.internal() == internal)
  423. callback(box);
  424. return IterationDecision::Continue;
  425. });
  426. }
  427. template<CSS::DisplayInside inside, typename Callback>
  428. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  429. {
  430. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  431. auto const display = box.display();
  432. if (display.is_outside_and_inside() && display.inside() == inside)
  433. callback(box);
  434. return IterationDecision::Continue;
  435. });
  436. }
  437. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  438. {
  439. remove_irrelevant_boxes(root);
  440. generate_missing_child_wrappers(root);
  441. auto table_root_boxes = generate_missing_parents(root);
  442. missing_cells_fixup(table_root_boxes);
  443. }
  444. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  445. {
  446. // The following boxes are discarded as if they were display:none:
  447. Vector<JS::Handle<Node>> to_remove;
  448. // Children of a table-column.
  449. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumn>(root, [&](Box& table_column) {
  450. table_column.for_each_child([&](auto& child) {
  451. to_remove.append(child);
  452. });
  453. });
  454. // Children of a table-column-group which are not a table-column.
  455. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumnGroup>(root, [&](Box& table_column_group) {
  456. table_column_group.for_each_child([&](auto& child) {
  457. if (!child.display().is_table_column())
  458. to_remove.append(child);
  459. });
  460. });
  461. // FIXME:
  462. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  463. // Anonymous inline boxes which meet all of the following criteria:
  464. // - they contain only white space
  465. // - they are the first and/or last child of a tabular container
  466. // - whose immediate sibling, if any, is a table-non-root box
  467. for (auto& box : to_remove)
  468. box->parent()->remove_child(*box);
  469. }
  470. static bool is_table_track(CSS::Display display)
  471. {
  472. return display.is_table_row() || display.is_table_column();
  473. }
  474. static bool is_table_track_group(CSS::Display display)
  475. {
  476. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  477. // table-header-groups and table-footer-groups.
  478. return display.is_table_row_group()
  479. || display.is_table_header_group()
  480. || display.is_table_footer_group()
  481. || display.is_table_column_group();
  482. }
  483. static bool is_proper_table_child(Node const& node)
  484. {
  485. auto const display = node.display();
  486. return is_table_track_group(display) || is_table_track(display) || display.is_table_caption();
  487. }
  488. static bool is_not_proper_table_child(Node const& node)
  489. {
  490. if (!node.has_style())
  491. return true;
  492. return !is_proper_table_child(node);
  493. }
  494. static bool is_table_row(Node const& node)
  495. {
  496. return node.display().is_table_row();
  497. }
  498. static bool is_not_table_row(Node const& node)
  499. {
  500. if (!node.has_style())
  501. return true;
  502. return !is_table_row(node);
  503. }
  504. static bool is_table_cell(Node const& node)
  505. {
  506. return node.display().is_table_cell();
  507. }
  508. static bool is_not_table_cell(Node const& node)
  509. {
  510. if (!node.has_style())
  511. return true;
  512. return !is_table_cell(node);
  513. }
  514. template<typename Matcher, typename Callback>
  515. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  516. {
  517. Vector<JS::Handle<Node>> sequence;
  518. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  519. for (auto& node : sequence) {
  520. if (!is_ignorable_whitespace(*node))
  521. return false;
  522. }
  523. return true;
  524. };
  525. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  526. if (matcher(*child) || (!sequence.is_empty() && is_ignorable_whitespace(*child))) {
  527. sequence.append(*child);
  528. } else {
  529. if (!sequence.is_empty()) {
  530. if (!sequence_is_all_ignorable_whitespace())
  531. callback(sequence, child);
  532. sequence.clear();
  533. }
  534. }
  535. }
  536. if (!sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  537. callback(sequence, nullptr);
  538. }
  539. template<typename WrapperBoxType>
  540. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling, CSS::Display display)
  541. {
  542. VERIFY(!sequence.is_empty());
  543. auto& parent = *sequence.first()->parent();
  544. auto computed_values = parent.computed_values().clone_inherited_values();
  545. static_cast<CSS::MutableComputedValues&>(*computed_values).set_display(display);
  546. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  547. for (auto& child : sequence) {
  548. parent.remove_child(*child);
  549. wrapper->append_child(*child);
  550. }
  551. wrapper->set_children_are_inline(parent.children_are_inline());
  552. if (nearest_sibling)
  553. parent.insert_before(*wrapper, *nearest_sibling);
  554. else
  555. parent.append_child(*wrapper);
  556. }
  557. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  558. {
  559. // An anonymous table-row box must be generated around each sequence of consecutive children of a table-root box which are not proper table child boxes.
  560. for_each_in_tree_with_inside_display<CSS::DisplayInside::Table>(root, [&](auto& parent) {
  561. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  562. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  563. });
  564. });
  565. // An anonymous table-row box must be generated around each sequence of consecutive children of a table-row-group box which are not table-row boxes.
  566. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRowGroup>(root, [&](auto& parent) {
  567. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  568. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  569. });
  570. });
  571. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  572. // table-header-groups and table-footer-groups.
  573. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableHeaderGroup>(root, [&](auto& parent) {
  574. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  575. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  576. });
  577. });
  578. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableFooterGroup>(root, [&](auto& parent) {
  579. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  580. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  581. });
  582. });
  583. // An anonymous table-cell box must be generated around each sequence of consecutive children of a table-row box which are not table-cell boxes. !Testcase
  584. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRow>(root, [&](auto& parent) {
  585. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  586. wrap_in_anonymous<BlockContainer>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableCell });
  587. });
  588. });
  589. }
  590. Vector<JS::Handle<Box>> TreeBuilder::generate_missing_parents(NodeWithStyle& root)
  591. {
  592. Vector<JS::Handle<Box>> table_roots_to_wrap;
  593. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& parent) {
  594. // An anonymous table-row box must be generated around each sequence of consecutive table-cell boxes whose parent is not a table-row.
  595. if (is_not_table_row(parent)) {
  596. for_each_sequence_of_consecutive_children_matching(parent, is_table_cell, [&](auto& sequence, auto nearest_sibling) {
  597. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  598. });
  599. }
  600. // A table-row is misparented if its parent is neither a table-row-group nor a table-root box.
  601. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  602. for_each_sequence_of_consecutive_children_matching(parent, is_table_row, [&](auto& sequence, auto nearest_sibling) {
  603. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  604. });
  605. }
  606. // A table-row-group, table-column-group, or table-caption box is misparented if its parent is not a table-root box.
  607. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  608. for_each_sequence_of_consecutive_children_matching(parent, is_proper_table_child, [&](auto& sequence, auto nearest_sibling) {
  609. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  610. });
  611. }
  612. // An anonymous table-wrapper box must be generated around each table-root.
  613. if (parent.display().is_table_inside()) {
  614. table_roots_to_wrap.append(parent);
  615. }
  616. return IterationDecision::Continue;
  617. });
  618. for (auto& table_box : table_roots_to_wrap) {
  619. auto* nearest_sibling = table_box->next_sibling();
  620. auto& parent = *table_box->parent();
  621. auto wrapper_computed_values = table_box->computed_values().clone_inherited_values();
  622. table_box->transfer_table_box_computed_values_to_wrapper_computed_values(*wrapper_computed_values);
  623. auto wrapper = parent.heap().allocate_without_realm<TableWrapper>(parent.document(), nullptr, move(wrapper_computed_values));
  624. parent.remove_child(*table_box);
  625. wrapper->append_child(*table_box);
  626. if (nearest_sibling)
  627. parent.insert_before(*wrapper, *nearest_sibling);
  628. else
  629. parent.append_child(*wrapper);
  630. }
  631. return table_roots_to_wrap;
  632. }
  633. template<typename Matcher, typename Callback>
  634. static void for_each_child_box_matching(Box& parent, Matcher matcher, Callback callback)
  635. {
  636. parent.for_each_child_of_type<Box>([&](Box& child_box) {
  637. if (matcher(child_box))
  638. callback(child_box);
  639. });
  640. }
  641. static void fixup_row(Box& row_box, TableGrid const& table_grid, size_t row_index)
  642. {
  643. for (size_t column_index = 0; column_index < table_grid.column_count(); ++column_index) {
  644. if (table_grid.occupancy_grid().contains({ column_index, row_index }))
  645. continue;
  646. auto computed_values = row_box.computed_values().clone_inherited_values();
  647. auto& mutable_computed_values = static_cast<CSS::MutableComputedValues&>(*computed_values);
  648. mutable_computed_values.set_display(Web::CSS::Display { CSS::DisplayInternal::TableCell });
  649. // Ensure that the cell (with zero content height) will have the same height as the row by setting vertical-align to middle.
  650. mutable_computed_values.set_vertical_align(CSS::VerticalAlign::Middle);
  651. auto cell_box = row_box.heap().template allocate_without_realm<BlockContainer>(row_box.document(), nullptr, move(computed_values));
  652. row_box.append_child(cell_box);
  653. }
  654. }
  655. void TreeBuilder::missing_cells_fixup(Vector<JS::Handle<Box>> const& table_root_boxes)
  656. {
  657. // Implements https://www.w3.org/TR/css-tables-3/#missing-cells-fixup.
  658. for (auto& table_box : table_root_boxes) {
  659. auto table_grid = TableGrid::calculate_row_column_grid(*table_box);
  660. size_t row_index = 0;
  661. for_each_child_box_matching(*table_box, TableGrid::is_table_row_group, [&](auto& row_group_box) {
  662. for_each_child_box_matching(row_group_box, is_table_row, [&](auto& row_box) {
  663. fixup_row(row_box, table_grid, row_index);
  664. ++row_index;
  665. return IterationDecision::Continue;
  666. });
  667. });
  668. for_each_child_box_matching(*table_box, is_table_row, [&](auto& row_box) {
  669. fixup_row(row_box, table_grid, row_index);
  670. ++row_index;
  671. return IterationDecision::Continue;
  672. });
  673. }
  674. }
  675. }