TreeBuilder.cpp 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800
  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/HTMLProgressElement.h>
  25. #include <LibWeb/HTML/HTMLSlotElement.h>
  26. #include <LibWeb/Layout/ListItemBox.h>
  27. #include <LibWeb/Layout/ListItemMarkerBox.h>
  28. #include <LibWeb/Layout/Node.h>
  29. #include <LibWeb/Layout/Progress.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())
  42. return true;
  43. if (!child->is_floating() && !child->is_absolutely_positioned())
  44. return true;
  45. }
  46. return false;
  47. }
  48. static bool has_in_flow_block_children(Layout::Node const& layout_node)
  49. {
  50. if (layout_node.children_are_inline())
  51. return false;
  52. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  53. if (child->is_inline())
  54. continue;
  55. if (!child->is_floating() && !child->is_absolutely_positioned())
  56. return true;
  57. }
  58. return false;
  59. }
  60. // The insertion_parent_for_*() functions maintain the invariant that the in-flow children of
  61. // block-level boxes must be either all block-level or all inline-level.
  62. static Layout::Node& insertion_parent_for_inline_node(Layout::NodeWithStyle& layout_parent)
  63. {
  64. auto last_child_creating_anonymous_wrapper_if_needed = [](auto& layout_parent) -> Layout::Node& {
  65. if (!layout_parent.last_child()
  66. || !layout_parent.last_child()->is_anonymous()
  67. || !layout_parent.last_child()->children_are_inline()
  68. || layout_parent.last_child()->is_generated()) {
  69. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  70. }
  71. return *layout_parent.last_child();
  72. };
  73. if (layout_parent.display().is_inline_outside() && layout_parent.display().is_flow_inside())
  74. return layout_parent;
  75. if (layout_parent.display().is_flex_inside() || layout_parent.display().is_grid_inside())
  76. return last_child_creating_anonymous_wrapper_if_needed(layout_parent);
  77. if (!has_in_flow_block_children(layout_parent) || layout_parent.children_are_inline())
  78. return layout_parent;
  79. // Parent has block-level children, insert into an anonymous wrapper block (and create it first if needed)
  80. return last_child_creating_anonymous_wrapper_if_needed(layout_parent);
  81. }
  82. static Layout::Node& insertion_parent_for_block_node(Layout::NodeWithStyle& layout_parent, Layout::Node& layout_node)
  83. {
  84. if (!has_inline_or_in_flow_block_children(layout_parent)) {
  85. // Parent block has no children, insert this block into parent.
  86. return layout_parent;
  87. }
  88. bool is_out_of_flow = layout_node.is_absolutely_positioned() || layout_node.is_floating();
  89. if (is_out_of_flow
  90. && !layout_parent.display().is_flex_inside()
  91. && !layout_parent.display().is_grid_inside()
  92. && layout_parent.last_child()->is_anonymous()
  93. && layout_parent.last_child()->children_are_inline()) {
  94. // Block is out-of-flow & previous sibling was wrapped in an anonymous block.
  95. // Join the previous sibling inside the anonymous block.
  96. return *layout_parent.last_child();
  97. }
  98. if (!layout_parent.children_are_inline()) {
  99. // Parent block has block-level children, insert this block into parent.
  100. return layout_parent;
  101. }
  102. if (is_out_of_flow) {
  103. // Block is out-of-flow, it can have inline siblings if necessary.
  104. return layout_parent;
  105. }
  106. // Parent block has inline-level children (our siblings).
  107. // First move these siblings into an anonymous wrapper block.
  108. Vector<JS::Handle<Layout::Node>> children;
  109. while (JS::GCPtr<Layout::Node> child = layout_parent.first_child()) {
  110. layout_parent.remove_child(*child);
  111. children.append(*child);
  112. }
  113. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  114. layout_parent.set_children_are_inline(false);
  115. for (auto& child : children) {
  116. layout_parent.last_child()->append_child(*child);
  117. }
  118. layout_parent.last_child()->set_children_are_inline(true);
  119. // Then it's safe to insert this block into parent.
  120. return layout_parent;
  121. }
  122. void TreeBuilder::insert_node_into_inline_or_block_ancestor(Layout::Node& node, CSS::Display display, AppendOrPrepend mode)
  123. {
  124. if (node.display().is_contents())
  125. return;
  126. if (display.is_inline_outside()) {
  127. // Inlines can be inserted into the nearest ancestor.
  128. auto& insertion_point = insertion_parent_for_inline_node(m_ancestor_stack.last());
  129. if (mode == AppendOrPrepend::Prepend)
  130. insertion_point.prepend_child(node);
  131. else
  132. insertion_point.append_child(node);
  133. insertion_point.set_children_are_inline(true);
  134. } else {
  135. // Non-inlines can't be inserted into an inline parent, so find the nearest non-inline ancestor.
  136. auto& nearest_non_inline_ancestor = [&]() -> Layout::NodeWithStyle& {
  137. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  138. if (ancestor->display().is_contents())
  139. continue;
  140. if (!ancestor->display().is_inline_outside())
  141. return ancestor;
  142. if (!ancestor->display().is_flow_inside())
  143. return ancestor;
  144. if (ancestor->dom_node() && is<SVG::SVGForeignObjectElement>(*ancestor->dom_node()))
  145. return ancestor;
  146. }
  147. VERIFY_NOT_REACHED();
  148. }();
  149. auto& insertion_point = insertion_parent_for_block_node(nearest_non_inline_ancestor, node);
  150. if (mode == AppendOrPrepend::Prepend)
  151. insertion_point.prepend_child(node);
  152. else
  153. insertion_point.append_child(node);
  154. // After inserting an in-flow block-level box into a parent, mark the parent as having non-inline children.
  155. if (!node.is_floating() && !node.is_absolutely_positioned())
  156. insertion_point.set_children_are_inline(false);
  157. }
  158. }
  159. ErrorOr<void> TreeBuilder::create_pseudo_element_if_needed(DOM::Element& element, CSS::Selector::PseudoElement pseudo_element, AppendOrPrepend mode)
  160. {
  161. auto& document = element.document();
  162. auto& style_computer = document.style_computer();
  163. auto pseudo_element_style = TRY(style_computer.compute_pseudo_element_style_if_needed(element, pseudo_element));
  164. if (!pseudo_element_style)
  165. return {};
  166. auto initial_quote_nesting_level = m_quote_nesting_level;
  167. auto [pseudo_element_content, final_quote_nesting_level] = pseudo_element_style->content(initial_quote_nesting_level);
  168. m_quote_nesting_level = final_quote_nesting_level;
  169. auto pseudo_element_display = pseudo_element_style->display();
  170. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  171. // We also don't create them if they are `display: none`.
  172. if (pseudo_element_display.is_none()
  173. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  174. || pseudo_element_content.type == CSS::ContentData::Type::None)
  175. return {};
  176. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, *pseudo_element_style, nullptr);
  177. if (!pseudo_element_node)
  178. return {};
  179. auto generated_for = Node::GeneratedFor::NotGenerated;
  180. if (pseudo_element == CSS::Selector::PseudoElement::Before) {
  181. generated_for = Node::GeneratedFor::PseudoBefore;
  182. } else if (pseudo_element == CSS::Selector::PseudoElement::After) {
  183. generated_for = Node::GeneratedFor::PseudoAfter;
  184. } else {
  185. VERIFY_NOT_REACHED();
  186. }
  187. pseudo_element_node->set_generated_for(generated_for, element);
  188. pseudo_element_node->set_initial_quote_nesting_level(initial_quote_nesting_level);
  189. // FIXME: Handle images, and multiple values
  190. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  191. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data);
  192. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  193. text_node->set_generated_for(generated_for, element);
  194. push_parent(verify_cast<NodeWithStyle>(*pseudo_element_node));
  195. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  196. pop_parent();
  197. } else {
  198. TODO();
  199. }
  200. element.set_pseudo_element_node({}, pseudo_element, pseudo_element_node);
  201. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  202. return {};
  203. }
  204. static bool is_ignorable_whitespace(Layout::Node const& node)
  205. {
  206. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().bytes_as_string_view().is_whitespace())
  207. return true;
  208. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  209. bool contains_only_white_space = true;
  210. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  211. if (!text_node.text_for_rendering().bytes_as_string_view().is_whitespace()) {
  212. contains_only_white_space = false;
  213. return IterationDecision::Break;
  214. }
  215. return IterationDecision::Continue;
  216. });
  217. if (contains_only_white_space)
  218. return true;
  219. }
  220. return false;
  221. }
  222. i32 TreeBuilder::calculate_list_item_index(DOM::Node& dom_node)
  223. {
  224. if (is<HTML::HTMLLIElement>(dom_node)) {
  225. auto& li = static_cast<HTML::HTMLLIElement&>(dom_node);
  226. if (li.value() != 0)
  227. return li.value();
  228. }
  229. if (dom_node.previous_sibling() != nullptr) {
  230. DOM::Node* current = dom_node.previous_sibling();
  231. while (current != nullptr) {
  232. if (is<HTML::HTMLLIElement>(*current))
  233. return calculate_list_item_index(*current) + 1;
  234. current = current->previous_sibling();
  235. }
  236. }
  237. if (is<HTML::HTMLOListElement>(*dom_node.parent())) {
  238. auto& ol = static_cast<HTML::HTMLOListElement&>(*dom_node.parent());
  239. return ol.start();
  240. }
  241. return 1;
  242. }
  243. ErrorOr<void> TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  244. {
  245. JS::GCPtr<Layout::Node> layout_node;
  246. Optional<TemporaryChange<bool>> has_svg_root_change;
  247. ScopeGuard remove_stale_layout_node_guard = [&] {
  248. // If we didn't create a layout node for this DOM node,
  249. // go through the DOM tree and remove any old layout nodes since they are now all stale.
  250. if (!layout_node) {
  251. dom_node.for_each_in_inclusive_subtree([&](auto& node) {
  252. node.detach_layout_node({});
  253. if (is<DOM::Element>(node))
  254. static_cast<DOM::Element&>(node).clear_pseudo_element_nodes({});
  255. return IterationDecision::Continue;
  256. });
  257. }
  258. };
  259. if (dom_node.is_svg_container()) {
  260. has_svg_root_change.emplace(context.has_svg_root, true);
  261. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  262. return {};
  263. }
  264. auto& document = dom_node.document();
  265. auto& style_computer = document.style_computer();
  266. RefPtr<CSS::StyleProperties> style;
  267. CSS::Display display;
  268. if (is<DOM::Element>(dom_node)) {
  269. auto& element = static_cast<DOM::Element&>(dom_node);
  270. // Special path for ::placeholder, which corresponds to a synthetic DOM element inside the <input> UA shadow root.
  271. // FIXME: This is very hackish. Find a better way to architect this.
  272. if (element.pseudo_element() == CSS::Selector::PseudoElement::Placeholder) {
  273. auto& input_element = verify_cast<HTML::HTMLInputElement>(*element.root().parent_or_shadow_host());
  274. style = TRY(style_computer.compute_style(input_element, CSS::Selector::PseudoElement::Placeholder));
  275. if (input_element.placeholder_value().has_value())
  276. display = style->display();
  277. else
  278. display = CSS::Display::from_short(CSS::Display::Short::None);
  279. }
  280. // Common path: this is a regular DOM element. Style should be present already, thanks to Document::update_style().
  281. else {
  282. element.clear_pseudo_element_nodes({});
  283. VERIFY(!element.needs_style_update());
  284. style = element.computed_css_values();
  285. display = style->display();
  286. }
  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::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::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::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. if (is<HTML::HTMLProgressElement>(dom_node)) {
  347. auto& progress = static_cast<HTML::HTMLProgressElement&>(dom_node);
  348. if (!progress.using_system_appearance()) {
  349. auto bar_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressBar));
  350. bar_style->set_property(CSS::PropertyID::Display, CSS::DisplayStyleValue::create(CSS::Display::from_short(CSS::Display::Short::FlowRoot)));
  351. auto value_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressValue));
  352. value_style->set_property(CSS::PropertyID::Display, CSS::DisplayStyleValue::create(CSS::Display::from_short(CSS::Display::Short::Block)));
  353. value_style->set_property(CSS::PropertyID::Width, CSS::PercentageStyleValue::create(CSS::Percentage(progress.position() * 100)));
  354. auto bar_display = bar_style->display();
  355. auto value_display = value_style->display();
  356. auto progress_bar = DOM::Element::create_layout_node_for_display_type(document, bar_display, bar_style, nullptr);
  357. auto progress_value = DOM::Element::create_layout_node_for_display_type(document, value_display, value_style, nullptr);
  358. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  359. push_parent(verify_cast<NodeWithStyle>(*progress_bar));
  360. insert_node_into_inline_or_block_ancestor(*progress_value, value_display, AppendOrPrepend::Append);
  361. pop_parent();
  362. insert_node_into_inline_or_block_ancestor(*progress_bar, bar_display, AppendOrPrepend::Append);
  363. pop_parent();
  364. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressBar, progress_bar);
  365. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressValue, progress_value);
  366. }
  367. }
  368. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  369. // If the computed value of 'inline-size' is 'auto', then the used value is the fit-content inline size.
  370. if (dom_node.is_html_button_element() && dom_node.layout_node()->computed_values().width().is_auto()) {
  371. auto& computed_values = verify_cast<NodeWithStyle>(*dom_node.layout_node()).mutable_computed_values();
  372. computed_values.set_width(CSS::Size::make_fit_content());
  373. }
  374. // https://html.spec.whatwg.org/multipage/rendering.html#button-layout
  375. // If the element is an input element, or if it is a button element and its computed value for
  376. // 'display' is not 'inline-grid', 'grid', 'inline-flex', or 'flex', then the element's box has
  377. // a child anonymous button content box with the following behaviors:
  378. if (dom_node.is_html_button_element() && !display.is_grid_inside() && !display.is_flex_inside()) {
  379. auto& parent = *dom_node.layout_node();
  380. // If the box does not overflow in the vertical axis, then it is centered vertically.
  381. // FIXME: Only apply alignment when box overflows
  382. auto flex_computed_values = parent.computed_values().clone_inherited_values();
  383. auto& mutable_flex_computed_values = static_cast<CSS::MutableComputedValues&>(flex_computed_values);
  384. mutable_flex_computed_values.set_display(CSS::Display { CSS::DisplayOutside::Block, CSS::DisplayInside::Flex });
  385. mutable_flex_computed_values.set_justify_content(CSS::JustifyContent::Center);
  386. mutable_flex_computed_values.set_flex_direction(CSS::FlexDirection::Column);
  387. mutable_flex_computed_values.set_height(CSS::Size::make_percentage(CSS::Percentage(100)));
  388. auto flex_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(flex_computed_values));
  389. auto content_box_computed_values = parent.computed_values().clone_inherited_values();
  390. auto content_box_wrapper = parent.heap().template allocate_without_realm<BlockContainer>(parent.document(), nullptr, move(content_box_computed_values));
  391. content_box_wrapper->set_font(parent.font());
  392. content_box_wrapper->set_line_height(parent.line_height());
  393. content_box_wrapper->set_children_are_inline(parent.children_are_inline());
  394. Vector<JS::Handle<Node>> sequence;
  395. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  396. if (child->is_generated_for_before_pseudo_element())
  397. continue;
  398. sequence.append(*child);
  399. }
  400. for (auto& node : sequence) {
  401. parent.remove_child(*node);
  402. content_box_wrapper->append_child(*node);
  403. }
  404. flex_wrapper->append_child(*content_box_wrapper);
  405. parent.append_child(*flex_wrapper);
  406. parent.set_children_are_inline(false);
  407. }
  408. // Add nodes for the ::after pseudo-element.
  409. if (is<DOM::Element>(dom_node) && layout_node->can_have_children()) {
  410. auto& element = static_cast<DOM::Element&>(dom_node);
  411. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  412. TRY(create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::After, AppendOrPrepend::Append));
  413. pop_parent();
  414. }
  415. return {};
  416. }
  417. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  418. {
  419. VERIFY(dom_node.is_document());
  420. Context context;
  421. m_quote_nesting_level = 0;
  422. MUST(create_layout_tree(dom_node, context)); // FIXME propagate errors
  423. if (auto* root = dom_node.document().layout_node())
  424. fixup_tables(*root);
  425. return move(m_layout_root);
  426. }
  427. template<CSS::DisplayInternal internal, typename Callback>
  428. void TreeBuilder::for_each_in_tree_with_internal_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_internal() && display.internal() == internal)
  433. callback(box);
  434. return IterationDecision::Continue;
  435. });
  436. }
  437. template<CSS::DisplayInside inside, typename Callback>
  438. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  439. {
  440. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  441. auto const display = box.display();
  442. if (display.is_outside_and_inside() && display.inside() == inside)
  443. callback(box);
  444. return IterationDecision::Continue;
  445. });
  446. }
  447. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  448. {
  449. remove_irrelevant_boxes(root);
  450. generate_missing_child_wrappers(root);
  451. auto table_root_boxes = generate_missing_parents(root);
  452. missing_cells_fixup(table_root_boxes);
  453. }
  454. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  455. {
  456. // The following boxes are discarded as if they were display:none:
  457. Vector<JS::Handle<Node>> to_remove;
  458. // Children of a table-column.
  459. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumn>(root, [&](Box& table_column) {
  460. table_column.for_each_child([&](auto& child) {
  461. to_remove.append(child);
  462. });
  463. });
  464. // Children of a table-column-group which are not a table-column.
  465. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableColumnGroup>(root, [&](Box& table_column_group) {
  466. table_column_group.for_each_child([&](auto& child) {
  467. if (!child.display().is_table_column())
  468. to_remove.append(child);
  469. });
  470. });
  471. // FIXME:
  472. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  473. // Anonymous inline boxes which meet all of the following criteria:
  474. // - they contain only white space
  475. // - they are the first and/or last child of a tabular container
  476. // - whose immediate sibling, if any, is a table-non-root box
  477. for (auto& box : to_remove)
  478. box->parent()->remove_child(*box);
  479. }
  480. static bool is_table_track(CSS::Display display)
  481. {
  482. return display.is_table_row() || display.is_table_column();
  483. }
  484. static bool is_table_track_group(CSS::Display display)
  485. {
  486. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  487. // table-header-groups and table-footer-groups.
  488. return display.is_table_row_group()
  489. || display.is_table_header_group()
  490. || display.is_table_footer_group()
  491. || display.is_table_column_group();
  492. }
  493. static bool is_proper_table_child(Node const& node)
  494. {
  495. auto const display = node.display();
  496. return is_table_track_group(display) || is_table_track(display) || display.is_table_caption();
  497. }
  498. static bool is_not_proper_table_child(Node const& node)
  499. {
  500. if (!node.has_style())
  501. return true;
  502. return !is_proper_table_child(node);
  503. }
  504. static bool is_table_row(Node const& node)
  505. {
  506. return node.display().is_table_row();
  507. }
  508. static bool is_not_table_row(Node const& node)
  509. {
  510. if (!node.has_style())
  511. return true;
  512. return !is_table_row(node);
  513. }
  514. static bool is_table_cell(Node const& node)
  515. {
  516. return node.display().is_table_cell();
  517. }
  518. static bool is_not_table_cell(Node const& node)
  519. {
  520. if (!node.has_style())
  521. return true;
  522. return !is_table_cell(node);
  523. }
  524. template<typename Matcher, typename Callback>
  525. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  526. {
  527. Vector<JS::Handle<Node>> sequence;
  528. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  529. for (auto& node : sequence) {
  530. if (!is_ignorable_whitespace(*node))
  531. return false;
  532. }
  533. return true;
  534. };
  535. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  536. if (matcher(*child) || (!sequence.is_empty() && is_ignorable_whitespace(*child))) {
  537. sequence.append(*child);
  538. } else {
  539. if (!sequence.is_empty()) {
  540. if (!sequence_is_all_ignorable_whitespace())
  541. callback(sequence, child);
  542. sequence.clear();
  543. }
  544. }
  545. }
  546. if (!sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  547. callback(sequence, nullptr);
  548. }
  549. template<typename WrapperBoxType>
  550. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling, CSS::Display display)
  551. {
  552. VERIFY(!sequence.is_empty());
  553. auto& parent = *sequence.first()->parent();
  554. auto computed_values = parent.computed_values().clone_inherited_values();
  555. static_cast<CSS::MutableComputedValues&>(computed_values).set_display(display);
  556. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  557. for (auto& child : sequence) {
  558. parent.remove_child(*child);
  559. wrapper->append_child(*child);
  560. }
  561. wrapper->set_children_are_inline(parent.children_are_inline());
  562. wrapper->set_line_height(parent.line_height());
  563. wrapper->set_font(parent.font());
  564. if (nearest_sibling)
  565. parent.insert_before(*wrapper, *nearest_sibling);
  566. else
  567. parent.append_child(*wrapper);
  568. }
  569. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  570. {
  571. // 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.
  572. for_each_in_tree_with_inside_display<CSS::DisplayInside::Table>(root, [&](auto& parent) {
  573. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  574. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  575. });
  576. });
  577. // 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.
  578. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRowGroup>(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. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  584. // table-header-groups and table-footer-groups.
  585. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableHeaderGroup>(root, [&](auto& parent) {
  586. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  587. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  588. });
  589. });
  590. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableFooterGroup>(root, [&](auto& parent) {
  591. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  592. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  593. });
  594. });
  595. // 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
  596. for_each_in_tree_with_internal_display<CSS::DisplayInternal::TableRow>(root, [&](auto& parent) {
  597. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  598. wrap_in_anonymous<BlockContainer>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableCell });
  599. });
  600. });
  601. }
  602. Vector<JS::Handle<Box>> TreeBuilder::generate_missing_parents(NodeWithStyle& root)
  603. {
  604. Vector<JS::Handle<Box>> table_roots_to_wrap;
  605. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& parent) {
  606. // An anonymous table-row box must be generated around each sequence of consecutive table-cell boxes whose parent is not a table-row.
  607. if (is_not_table_row(parent)) {
  608. for_each_sequence_of_consecutive_children_matching(parent, is_table_cell, [&](auto& sequence, auto nearest_sibling) {
  609. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display { CSS::DisplayInternal::TableRow });
  610. });
  611. }
  612. // A table-row is misparented if its parent is neither a table-row-group nor a table-root box.
  613. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  614. for_each_sequence_of_consecutive_children_matching(parent, is_table_row, [&](auto& sequence, auto nearest_sibling) {
  615. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  616. });
  617. }
  618. // A table-row-group, table-column-group, or table-caption box is misparented if its parent is not a table-root box.
  619. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  620. for_each_sequence_of_consecutive_children_matching(parent, is_proper_table_child, [&](auto& sequence, auto nearest_sibling) {
  621. wrap_in_anonymous<Box>(sequence, nearest_sibling, CSS::Display::from_short(parent.display().is_inline_outside() ? CSS::Display::Short::InlineTable : CSS::Display::Short::Table));
  622. });
  623. }
  624. // An anonymous table-wrapper box must be generated around each table-root.
  625. if (parent.display().is_table_inside()) {
  626. table_roots_to_wrap.append(parent);
  627. }
  628. return IterationDecision::Continue;
  629. });
  630. for (auto& table_box : table_roots_to_wrap) {
  631. auto* nearest_sibling = table_box->next_sibling();
  632. auto& parent = *table_box->parent();
  633. CSS::ComputedValues wrapper_computed_values = table_box->computed_values().clone_inherited_values();
  634. table_box->transfer_table_box_computed_values_to_wrapper_computed_values(wrapper_computed_values);
  635. auto wrapper = parent.heap().allocate_without_realm<TableWrapper>(parent.document(), nullptr, move(wrapper_computed_values));
  636. parent.remove_child(*table_box);
  637. wrapper->append_child(*table_box);
  638. wrapper->set_font(parent.font());
  639. wrapper->set_line_height(parent.line_height());
  640. if (nearest_sibling)
  641. parent.insert_before(*wrapper, *nearest_sibling);
  642. else
  643. parent.append_child(*wrapper);
  644. }
  645. return table_roots_to_wrap;
  646. }
  647. template<typename Matcher, typename Callback>
  648. static void for_each_child_box_matching(Box& parent, Matcher matcher, Callback callback)
  649. {
  650. parent.for_each_child_of_type<Box>([&](Box& child_box) {
  651. if (matcher(child_box))
  652. callback(child_box);
  653. });
  654. }
  655. static void fixup_row(Box& row_box, TableGrid const& table_grid, size_t row_index)
  656. {
  657. bool missing_cells_run_has_started = false;
  658. for (size_t column_index = 0; column_index < table_grid.column_count(); ++column_index) {
  659. if (table_grid.occupancy_grid().contains({ column_index, row_index })) {
  660. VERIFY(!missing_cells_run_has_started);
  661. continue;
  662. }
  663. missing_cells_run_has_started = true;
  664. auto row_computed_values = row_box.computed_values().clone_inherited_values();
  665. auto& cell_computed_values = static_cast<CSS::MutableComputedValues&>(row_computed_values);
  666. cell_computed_values.set_display(Web::CSS::Display { CSS::DisplayInternal::TableCell });
  667. // Ensure that the cell (with zero content height) will have the same height as the row by setting vertical-align to middle.
  668. cell_computed_values.set_vertical_align(CSS::VerticalAlign::Middle);
  669. auto cell_box = row_box.heap().template allocate_without_realm<BlockContainer>(row_box.document(), nullptr, cell_computed_values);
  670. cell_box->set_font(row_box.font());
  671. cell_box->set_line_height(row_box.line_height());
  672. row_box.append_child(cell_box);
  673. }
  674. }
  675. void TreeBuilder::missing_cells_fixup(Vector<JS::Handle<Box>> const& table_root_boxes)
  676. {
  677. // Implements https://www.w3.org/TR/css-tables-3/#missing-cells-fixup.
  678. for (auto& table_box : table_root_boxes) {
  679. auto table_grid = TableGrid::calculate_row_column_grid(*table_box);
  680. size_t row_index = 0;
  681. for_each_child_box_matching(*table_box, TableGrid::is_table_row_group, [&](auto& row_group_box) {
  682. for_each_child_box_matching(row_group_box, is_table_row, [&](auto& row_box) {
  683. fixup_row(row_box, table_grid, row_index);
  684. ++row_index;
  685. return IterationDecision::Continue;
  686. });
  687. });
  688. for_each_child_box_matching(*table_box, is_table_row, [&](auto& row_box) {
  689. fixup_row(row_box, table_grid, row_index);
  690. ++row_index;
  691. return IterationDecision::Continue;
  692. });
  693. }
  694. }
  695. }