TreeBuilder.cpp 33 KB

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