TreeBuilder.cpp 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840
  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/CSSKeywordValue.h>
  13. #include <LibWeb/CSS/StyleValues/DisplayStyleValue.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/SVGClipBox.h>
  29. #include <LibWeb/Layout/SVGMaskBox.h>
  30. #include <LibWeb/Layout/TableGrid.h>
  31. #include <LibWeb/Layout/TableWrapper.h>
  32. #include <LibWeb/Layout/TextNode.h>
  33. #include <LibWeb/Layout/TreeBuilder.h>
  34. #include <LibWeb/Layout/Viewport.h>
  35. #include <LibWeb/SVG/SVGForeignObjectElement.h>
  36. namespace Web::Layout {
  37. TreeBuilder::TreeBuilder() = default;
  38. static bool has_inline_or_in_flow_block_children(Layout::Node const& layout_node)
  39. {
  40. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  41. if (child->is_inline() || child->is_in_flow())
  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_in_flow())
  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. if (layout_node.is_out_of_flow()
  87. && !layout_parent.display().is_flex_inside()
  88. && !layout_parent.display().is_grid_inside()
  89. && !layout_parent.last_child()->is_generated()
  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 (layout_node.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_out_of_flow())
  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. 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 pseudo_element_style = element.pseudo_element_computed_css_values(pseudo_element);
  175. if (!pseudo_element_style)
  176. return;
  177. auto initial_quote_nesting_level = m_quote_nesting_level;
  178. auto [pseudo_element_content, final_quote_nesting_level] = pseudo_element_style->content(element, initial_quote_nesting_level);
  179. m_quote_nesting_level = final_quote_nesting_level;
  180. auto pseudo_element_display = pseudo_element_style->display();
  181. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  182. // We also don't create them if they are `display: none`.
  183. if (pseudo_element_display.is_none()
  184. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  185. || pseudo_element_content.type == CSS::ContentData::Type::None)
  186. return;
  187. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, *pseudo_element_style, nullptr);
  188. if (!pseudo_element_node)
  189. return;
  190. auto generated_for = Node::GeneratedFor::NotGenerated;
  191. if (pseudo_element == CSS::Selector::PseudoElement::Type::Before) {
  192. generated_for = Node::GeneratedFor::PseudoBefore;
  193. } else if (pseudo_element == CSS::Selector::PseudoElement::Type::After) {
  194. generated_for = Node::GeneratedFor::PseudoAfter;
  195. } else {
  196. VERIFY_NOT_REACHED();
  197. }
  198. pseudo_element_node->set_generated_for(generated_for, element);
  199. pseudo_element_node->set_initial_quote_nesting_level(initial_quote_nesting_level);
  200. // FIXME: Handle images, and multiple values
  201. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  202. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data);
  203. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  204. text_node->set_generated_for(generated_for, element);
  205. push_parent(*pseudo_element_node);
  206. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  207. pop_parent();
  208. } else {
  209. TODO();
  210. }
  211. element.set_pseudo_element_node({}, pseudo_element, pseudo_element_node);
  212. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  213. }
  214. static bool is_ignorable_whitespace(Layout::Node const& node)
  215. {
  216. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().bytes_as_string_view().is_whitespace())
  217. return true;
  218. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  219. bool contains_only_white_space = true;
  220. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  221. if (!text_node.text_for_rendering().bytes_as_string_view().is_whitespace()) {
  222. contains_only_white_space = false;
  223. return TraversalDecision::Break;
  224. }
  225. return TraversalDecision::Continue;
  226. });
  227. if (contains_only_white_space)
  228. return true;
  229. }
  230. return false;
  231. }
  232. i32 TreeBuilder::calculate_list_item_index(DOM::Node& dom_node)
  233. {
  234. if (is<HTML::HTMLLIElement>(dom_node)) {
  235. auto& li = static_cast<HTML::HTMLLIElement&>(dom_node);
  236. if (li.value() != 0)
  237. return li.value();
  238. }
  239. if (dom_node.previous_sibling() != nullptr) {
  240. DOM::Node* current = dom_node.previous_sibling();
  241. while (current != nullptr) {
  242. if (is<HTML::HTMLLIElement>(*current))
  243. return calculate_list_item_index(*current) + 1;
  244. current = current->previous_sibling();
  245. }
  246. }
  247. if (is<HTML::HTMLOListElement>(*dom_node.parent())) {
  248. auto& ol = static_cast<HTML::HTMLOListElement&>(*dom_node.parent());
  249. return ol.start();
  250. }
  251. return 1;
  252. }
  253. void TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  254. {
  255. if (dom_node.is_element()) {
  256. auto& element = static_cast<DOM::Element&>(dom_node);
  257. if (element.in_top_layer() && !context.layout_top_layer)
  258. return;
  259. }
  260. if (dom_node.is_element())
  261. dom_node.document().style_computer().push_ancestor(static_cast<DOM::Element const&>(dom_node));
  262. ScopeGuard pop_ancestor_guard = [&] {
  263. if (dom_node.is_element())
  264. dom_node.document().style_computer().pop_ancestor(static_cast<DOM::Element const&>(dom_node));
  265. };
  266. JS::GCPtr<Layout::Node> layout_node;
  267. Optional<TemporaryChange<bool>> has_svg_root_change;
  268. ScopeGuard remove_stale_layout_node_guard = [&] {
  269. // If we didn't create a layout node for this DOM node,
  270. // go through the DOM tree and remove any old layout & paint nodes since they are now all stale.
  271. if (!layout_node) {
  272. dom_node.for_each_in_inclusive_subtree([&](auto& node) {
  273. node.detach_layout_node({});
  274. node.set_paintable(nullptr);
  275. if (is<DOM::Element>(node))
  276. static_cast<DOM::Element&>(node).clear_pseudo_element_nodes({});
  277. return TraversalDecision::Continue;
  278. });
  279. }
  280. };
  281. if (dom_node.is_svg_container()) {
  282. has_svg_root_change.emplace(context.has_svg_root, true);
  283. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  284. return;
  285. }
  286. auto& document = dom_node.document();
  287. auto& style_computer = document.style_computer();
  288. RefPtr<CSS::StyleProperties> style;
  289. CSS::Display display;
  290. if (is<DOM::Element>(dom_node)) {
  291. auto& element = static_cast<DOM::Element&>(dom_node);
  292. element.clear_pseudo_element_nodes({});
  293. VERIFY(!element.needs_style_update());
  294. style = element.computed_css_values();
  295. element.resolve_counters(*style);
  296. display = style->display();
  297. if (display.is_none())
  298. return;
  299. // TODO: Implement changing element contents with the `content` property.
  300. if (context.layout_svg_mask_or_clip_path) {
  301. if (is<SVG::SVGMaskElement>(dom_node))
  302. layout_node = document.heap().allocate_without_realm<Layout::SVGMaskBox>(document, static_cast<SVG::SVGMaskElement&>(dom_node), *style);
  303. else if (is<SVG::SVGClipPathElement>(dom_node))
  304. layout_node = document.heap().allocate_without_realm<Layout::SVGClipBox>(document, static_cast<SVG::SVGClipPathElement&>(dom_node), *style);
  305. else
  306. VERIFY_NOT_REACHED();
  307. // Only layout direct uses of SVG masks/clipPaths.
  308. context.layout_svg_mask_or_clip_path = false;
  309. } else {
  310. layout_node = element.create_layout_node(*style);
  311. }
  312. } else if (is<DOM::Document>(dom_node)) {
  313. style = style_computer.create_document_style();
  314. display = style->display();
  315. layout_node = document.heap().allocate_without_realm<Layout::Viewport>(static_cast<DOM::Document&>(dom_node), *style);
  316. } else if (is<DOM::Text>(dom_node)) {
  317. layout_node = document.heap().allocate_without_realm<Layout::TextNode>(document, static_cast<DOM::Text&>(dom_node));
  318. display = CSS::Display(CSS::DisplayOutside::Inline, CSS::DisplayInside::Flow);
  319. }
  320. if (!layout_node)
  321. return;
  322. if (!dom_node.parent_or_shadow_host()) {
  323. m_layout_root = layout_node;
  324. } else if (layout_node->is_svg_box()) {
  325. m_ancestor_stack.last()->append_child(*layout_node);
  326. } else {
  327. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  328. }
  329. auto shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root() : nullptr;
  330. auto element_has_content_visibility_hidden = [&dom_node]() {
  331. if (is<DOM::Element>(dom_node)) {
  332. auto& element = static_cast<DOM::Element&>(dom_node);
  333. return element.computed_css_values()->content_visibility() == CSS::ContentVisibility::Hidden;
  334. }
  335. return false;
  336. }();
  337. // Add node for the ::before pseudo-element.
  338. if (is<DOM::Element>(dom_node) && layout_node->can_have_children() && !element_has_content_visibility_hidden) {
  339. auto& element = static_cast<DOM::Element&>(dom_node);
  340. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  341. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Type::Before, AppendOrPrepend::Prepend);
  342. pop_parent();
  343. }
  344. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children() && !element_has_content_visibility_hidden) {
  345. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  346. if (shadow_root) {
  347. for (auto* node = shadow_root->first_child(); node; node = node->next_sibling()) {
  348. create_layout_tree(*node, context);
  349. }
  350. } else {
  351. // This is the same as verify_cast<DOM::ParentNode>(dom_node).for_each_child
  352. for (auto* node = verify_cast<DOM::ParentNode>(dom_node).first_child(); node; node = node->next_sibling())
  353. create_layout_tree(*node, context);
  354. }
  355. if (dom_node.is_document()) {
  356. // Elements in the top layer do not lay out normally based on their position in the document; instead they
  357. // generate boxes as if they were siblings of the root element.
  358. TemporaryChange<bool> layout_mask(context.layout_top_layer, true);
  359. for (auto const& top_layer_element : document.top_layer_elements())
  360. create_layout_tree(top_layer_element, context);
  361. }
  362. pop_parent();
  363. }
  364. if (is<ListItemBox>(*layout_node)) {
  365. auto& element = static_cast<DOM::Element&>(dom_node);
  366. auto marker_style = style_computer.compute_style(element, CSS::Selector::PseudoElement::Type::Marker);
  367. 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);
  368. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  369. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Type::Marker, list_item_marker);
  370. layout_node->append_child(*list_item_marker);
  371. }
  372. if (is<HTML::HTMLSlotElement>(dom_node)) {
  373. auto& slot_element = static_cast<HTML::HTMLSlotElement&>(dom_node);
  374. if (slot_element.computed_css_values()->content_visibility() == CSS::ContentVisibility::Hidden)
  375. return;
  376. auto slottables = slot_element.assigned_nodes_internal();
  377. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  378. for (auto const& slottable : slottables)
  379. slottable.visit([&](auto& node) { create_layout_tree(node, context); });
  380. pop_parent();
  381. }
  382. if (is<SVG::SVGGraphicsElement>(dom_node)) {
  383. auto& graphics_element = static_cast<SVG::SVGGraphicsElement&>(dom_node);
  384. // Create the layout tree for the SVG mask/clip paths as a child of the masked element.
  385. // Note: This will create a new subtree for each use of the mask (so there's not a 1-to-1 mapping
  386. // from DOM node to mask layout node). Each use of a mask may be laid out differently so this
  387. // duplication is necessary.
  388. auto layout_mask_or_clip_path = [&](JS::GCPtr<SVG::SVGElement const> mask_or_clip_path) {
  389. TemporaryChange<bool> layout_mask(context.layout_svg_mask_or_clip_path, true);
  390. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  391. create_layout_tree(const_cast<SVG::SVGElement&>(*mask_or_clip_path), context);
  392. pop_parent();
  393. };
  394. if (auto mask = graphics_element.mask())
  395. layout_mask_or_clip_path(mask);
  396. if (auto clip_path = graphics_element.clip_path())
  397. layout_mask_or_clip_path(clip_path);
  398. }
  399. auto is_button_layout = [&] {
  400. if (dom_node.is_html_button_element())
  401. return true;
  402. if (!dom_node.is_html_input_element())
  403. return false;
  404. // https://html.spec.whatwg.org/multipage/rendering.html#the-input-element-as-a-button
  405. // An input element whose type attribute is in the Submit Button, Reset Button, or Button state, when it generates a CSS box, is expected to depict a button and use button layout
  406. auto const& input_element = static_cast<HTML::HTMLInputElement const&>(dom_node);
  407. if (input_element.is_button())
  408. return true;
  409. return false;
  410. }();
  411. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  412. // If the computed value of 'inline-size' is 'auto', then the used value is the fit-content inline size.
  413. if (is_button_layout && dom_node.layout_node()->computed_values().width().is_auto()) {
  414. auto& computed_values = verify_cast<NodeWithStyle>(*dom_node.layout_node()).mutable_computed_values();
  415. computed_values.set_width(CSS::Size::make_fit_content());
  416. }
  417. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  418. // If the element is an input element, or if it is a button element and its computed value for
  419. // 'display' is not 'inline-grid', 'grid', 'inline-flex', or 'flex', then the element's box has
  420. // a child anonymous button content box with the following behaviors:
  421. if (is_button_layout && !display.is_grid_inside() && !display.is_flex_inside()) {
  422. auto& parent = *dom_node.layout_node();
  423. // If the box does not overflow in the vertical axis, then it is centered vertically.
  424. // FIXME: Only apply alignment when box overflows
  425. auto flex_computed_values = parent.computed_values().clone_inherited_values();
  426. auto& mutable_flex_computed_values = static_cast<CSS::MutableComputedValues&>(*flex_computed_values);
  427. mutable_flex_computed_values.set_display(CSS::Display { CSS::DisplayOutside::Block, CSS::DisplayInside::Flex });
  428. mutable_flex_computed_values.set_justify_content(CSS::JustifyContent::Center);
  429. mutable_flex_computed_values.set_flex_direction(CSS::FlexDirection::Column);
  430. mutable_flex_computed_values.set_height(CSS::Size::make_percentage(CSS::Percentage(100)));
  431. mutable_flex_computed_values.set_min_height(parent.computed_values().min_height());
  432. auto flex_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(flex_computed_values));
  433. auto content_box_computed_values = parent.computed_values().clone_inherited_values();
  434. auto content_box_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(content_box_computed_values));
  435. content_box_wrapper->set_children_are_inline(parent.children_are_inline());
  436. Vector<JS::Handle<Node>> sequence;
  437. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  438. if (child->is_generated_for_before_pseudo_element())
  439. continue;
  440. sequence.append(*child);
  441. }
  442. for (auto& node : sequence) {
  443. parent.remove_child(*node);
  444. content_box_wrapper->append_child(*node);
  445. }
  446. flex_wrapper->append_child(*content_box_wrapper);
  447. parent.append_child(*flex_wrapper);
  448. parent.set_children_are_inline(false);
  449. }
  450. // Add nodes for the ::after pseudo-element.
  451. if (is<DOM::Element>(dom_node) && layout_node->can_have_children() && !element_has_content_visibility_hidden) {
  452. auto& element = static_cast<DOM::Element&>(dom_node);
  453. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  454. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Type::After, AppendOrPrepend::Append);
  455. pop_parent();
  456. }
  457. }
  458. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  459. {
  460. VERIFY(dom_node.is_document());
  461. dom_node.document().style_computer().reset_ancestor_filter();
  462. Context context;
  463. m_quote_nesting_level = 0;
  464. create_layout_tree(dom_node, context);
  465. if (auto* root = dom_node.document().layout_node())
  466. fixup_tables(*root);
  467. return move(m_layout_root);
  468. }
  469. template<CSS::DisplayInternal internal, typename Callback>
  470. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  471. {
  472. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  473. auto const display = box.display();
  474. if (display.is_internal() && display.internal() == internal)
  475. callback(box);
  476. return TraversalDecision::Continue;
  477. });
  478. }
  479. template<CSS::DisplayInside inside, typename Callback>
  480. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  481. {
  482. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  483. auto const display = box.display();
  484. if (display.is_outside_and_inside() && display.inside() == inside)
  485. callback(box);
  486. return TraversalDecision::Continue;
  487. });
  488. }
  489. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  490. {
  491. remove_irrelevant_boxes(root);
  492. generate_missing_child_wrappers(root);
  493. auto table_root_boxes = generate_missing_parents(root);
  494. missing_cells_fixup(table_root_boxes);
  495. }
  496. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  497. {
  498. // The following boxes are discarded as if they were display:none:
  499. Vector<JS::Handle<Node>> to_remove;
  500. // Children of a table-column.
  501. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumn>(root, [&](Box& table_column) {
  502. table_column.for_each_child([&](auto& child) {
  503. to_remove.append(child);
  504. return IterationDecision::Continue;
  505. });
  506. });
  507. // Children of a table-column-group which are not a table-column.
  508. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumnGroup>(root, [&](Box& table_column_group) {
  509. table_column_group.for_each_child([&](auto& child) {
  510. if (!child.display().is_table_column())
  511. to_remove.append(child);
  512. return IterationDecision::Continue;
  513. });
  514. });
  515. // FIXME:
  516. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  517. // Anonymous inline boxes which meet all of the following criteria:
  518. // - they contain only white space
  519. // - they are the first and/or last child of a tabular container
  520. // - whose immediate sibling, if any, is a table-non-root box
  521. for (auto& box : to_remove)
  522. box->parent()->remove_child(*box);
  523. }
  524. static bool is_table_track(CSS::Display display)
  525. {
  526. return display.is_table_row() || display.is_table_column();
  527. }
  528. static bool is_table_track_group(CSS::Display display)
  529. {
  530. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  531. // table-header-groups and table-footer-groups.
  532. return display.is_table_row_group()
  533. || display.is_table_header_group()
  534. || display.is_table_footer_group()
  535. || display.is_table_column_group();
  536. }
  537. static bool is_proper_table_child(Node const& node)
  538. {
  539. auto const display = node.display();
  540. return is_table_track_group(display) || is_table_track(display) || display.is_table_caption();
  541. }
  542. static bool is_not_proper_table_child(Node const& node)
  543. {
  544. if (!node.has_style())
  545. return true;
  546. return !is_proper_table_child(node);
  547. }
  548. static bool is_table_row(Node const& node)
  549. {
  550. return node.display().is_table_row();
  551. }
  552. static bool is_not_table_row(Node const& node)
  553. {
  554. if (!node.has_style())
  555. return true;
  556. return !is_table_row(node);
  557. }
  558. static bool is_table_cell(Node const& node)
  559. {
  560. return node.display().is_table_cell();
  561. }
  562. static bool is_not_table_cell(Node const& node)
  563. {
  564. if (!node.has_style())
  565. return true;
  566. return !is_table_cell(node);
  567. }
  568. template<typename Matcher, typename Callback>
  569. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  570. {
  571. Vector<JS::Handle<Node>> sequence;
  572. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  573. for (auto& node : sequence) {
  574. if (!is_ignorable_whitespace(*node))
  575. return false;
  576. }
  577. return true;
  578. };
  579. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  580. if (matcher(*child) || (!sequence.is_empty() && is_ignorable_whitespace(*child))) {
  581. sequence.append(*child);
  582. } else {
  583. if (!sequence.is_empty()) {
  584. if (!sequence_is_all_ignorable_whitespace())
  585. callback(sequence, child);
  586. sequence.clear();
  587. }
  588. }
  589. }
  590. if (!sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  591. callback(sequence, nullptr);
  592. }
  593. template<typename WrapperBoxType>
  594. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling, CSS::Display display)
  595. {
  596. VERIFY(!sequence.is_empty());
  597. auto& parent = *sequence.first()->parent();
  598. auto computed_values = parent.computed_values().clone_inherited_values();
  599. static_cast<CSS::MutableComputedValues&>(*computed_values).set_display(display);
  600. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  601. for (auto& child : sequence) {
  602. parent.remove_child(*child);
  603. wrapper->append_child(*child);
  604. }
  605. wrapper->set_children_are_inline(parent.children_are_inline());
  606. if (nearest_sibling)
  607. parent.insert_before(*wrapper, *nearest_sibling);
  608. else
  609. parent.append_child(*wrapper);
  610. }
  611. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  612. {
  613. // 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.
  614. for_each_in_tree_with_inside_display<CSS::DisplayInside::Table>(root, [&](auto& parent) {
  615. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  616. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  617. });
  618. });
  619. // 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.
  620. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRowGroup>(root, [&](auto& parent) {
  621. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  622. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  623. });
  624. });
  625. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  626. // table-header-groups and table-footer-groups.
  627. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableHeaderGroup>(root, [&](auto& parent) {
  628. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  629. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  630. });
  631. });
  632. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableFooterGroup>(root, [&](auto& parent) {
  633. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  634. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  635. });
  636. });
  637. // 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
  638. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRow>(root, [&](auto& parent) {
  639. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  640. wrap_in_anonymous<BlockContainer>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableCell });
  641. });
  642. });
  643. }
  644. Vector<JS::Handle<Box>> TreeBuilder::generate_missing_parents(NodeWithStyle& root)
  645. {
  646. Vector<JS::Handle<Box>> table_roots_to_wrap;
  647. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& parent) {
  648. // An anonymous table-row box must be generated around each sequence of consecutive table-cell boxes whose parent is not a table-row.
  649. if (is_not_table_row(parent)) {
  650. for_each_sequence_of_consecutive_children_matching(parent, is_table_cell, [&](auto& sequence, auto nearest_sibling) {
  651. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  652. });
  653. }
  654. // A table-row is misparented if its parent is neither a table-row-group nor a table-root box.
  655. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  656. for_each_sequence_of_consecutive_children_matching(parent, is_table_row, [&](auto& sequence, auto nearest_sibling) {
  657. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  658. });
  659. }
  660. // A table-row-group, table-column-group, or table-caption box is misparented if its parent is not a table-root box.
  661. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  662. for_each_sequence_of_consecutive_children_matching(parent, is_proper_table_child, [&](auto& sequence, auto nearest_sibling) {
  663. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  664. });
  665. }
  666. // An anonymous table-wrapper box must be generated around each table-root.
  667. if (parent.display().is_table_inside()) {
  668. table_roots_to_wrap.append(parent);
  669. }
  670. return TraversalDecision::Continue;
  671. });
  672. for (auto& table_box : table_roots_to_wrap) {
  673. auto* nearest_sibling = table_box->next_sibling();
  674. auto& parent = *table_box->parent();
  675. auto wrapper_computed_values = table_box->computed_values().clone_inherited_values();
  676. table_box->transfer_table_box_computed_values_to_wrapper_computed_values(*wrapper_computed_values);
  677. auto wrapper = parent.heap().allocate_without_realm<TableWrapper>(parent.document(), nullptr, move(wrapper_computed_values));
  678. parent.remove_child(*table_box);
  679. wrapper->append_child(*table_box);
  680. if (nearest_sibling)
  681. parent.insert_before(*wrapper, *nearest_sibling);
  682. else
  683. parent.append_child(*wrapper);
  684. }
  685. return table_roots_to_wrap;
  686. }
  687. template<typename Matcher, typename Callback>
  688. static void for_each_child_box_matching(Box& parent, Matcher matcher, Callback callback)
  689. {
  690. parent.for_each_child_of_type<Box>([&](Box& child_box) {
  691. if (matcher(child_box))
  692. callback(child_box);
  693. return IterationDecision::Continue;
  694. });
  695. }
  696. static void fixup_row(Box& row_box, TableGrid const& table_grid, size_t row_index)
  697. {
  698. for (size_t column_index = 0; column_index < table_grid.column_count(); ++column_index) {
  699. if (table_grid.occupancy_grid().contains({ column_index, row_index }))
  700. continue;
  701. auto computed_values = row_box.computed_values().clone_inherited_values();
  702. auto& mutable_computed_values = static_cast<CSS::MutableComputedValues&>(*computed_values);
  703. mutable_computed_values.set_display(Web::CSS::Display { CSS::DisplayInternal::TableCell });
  704. // Ensure that the cell (with zero content height) will have the same height as the row by setting vertical-align to middle.
  705. mutable_computed_values.set_vertical_align(CSS::VerticalAlign::Middle);
  706. auto cell_box = row_box.heap().template allocate_without_realm<BlockContainer>(row_box.document(), nullptr, move(computed_values));
  707. row_box.append_child(cell_box);
  708. }
  709. }
  710. void TreeBuilder::missing_cells_fixup(Vector<JS::Handle<Box>> const& table_root_boxes)
  711. {
  712. // Implements https://www.w3.org/TR/css-tables-3/#missing-cells-fixup.
  713. for (auto& table_box : table_root_boxes) {
  714. auto table_grid = TableGrid::calculate_row_column_grid(*table_box);
  715. size_t row_index = 0;
  716. for_each_child_box_matching(*table_box, TableGrid::is_table_row_group, [&](auto& row_group_box) {
  717. for_each_child_box_matching(row_group_box, is_table_row, [&](auto& row_box) {
  718. fixup_row(row_box, table_grid, row_index);
  719. ++row_index;
  720. return IterationDecision::Continue;
  721. });
  722. });
  723. for_each_child_box_matching(*table_box, is_table_row, [&](auto& row_box) {
  724. fixup_row(row_box, table_grid, row_index);
  725. ++row_index;
  726. return IterationDecision::Continue;
  727. });
  728. }
  729. }
  730. }