TreeBuilder.cpp 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634
  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/StyleValues/IdentifierStyleValue.h>
  12. #include <LibWeb/CSS/StyleValues/PercentageStyleValue.h>
  13. #include <LibWeb/DOM/Document.h>
  14. #include <LibWeb/DOM/Element.h>
  15. #include <LibWeb/DOM/ParentNode.h>
  16. #include <LibWeb/DOM/ShadowRoot.h>
  17. #include <LibWeb/Dump.h>
  18. #include <LibWeb/HTML/HTMLInputElement.h>
  19. #include <LibWeb/HTML/HTMLProgressElement.h>
  20. #include <LibWeb/Layout/ListItemBox.h>
  21. #include <LibWeb/Layout/ListItemMarkerBox.h>
  22. #include <LibWeb/Layout/Node.h>
  23. #include <LibWeb/Layout/Progress.h>
  24. #include <LibWeb/Layout/TableBox.h>
  25. #include <LibWeb/Layout/TableCellBox.h>
  26. #include <LibWeb/Layout/TableRowBox.h>
  27. #include <LibWeb/Layout/TableWrapper.h>
  28. #include <LibWeb/Layout/TextNode.h>
  29. #include <LibWeb/Layout/TreeBuilder.h>
  30. #include <LibWeb/Layout/Viewport.h>
  31. #include <LibWeb/SVG/SVGForeignObjectElement.h>
  32. namespace Web::Layout {
  33. TreeBuilder::TreeBuilder() = default;
  34. static bool has_inline_or_in_flow_block_children(Layout::Node const& layout_node)
  35. {
  36. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  37. if (child->is_inline())
  38. return true;
  39. if (!child->is_floating() && !child->is_absolutely_positioned())
  40. return true;
  41. }
  42. return false;
  43. }
  44. static bool has_in_flow_block_children(Layout::Node const& layout_node)
  45. {
  46. if (layout_node.children_are_inline())
  47. return false;
  48. for (auto child = layout_node.first_child(); child; child = child->next_sibling()) {
  49. if (child->is_inline())
  50. continue;
  51. if (!child->is_floating() && !child->is_absolutely_positioned())
  52. return true;
  53. }
  54. return false;
  55. }
  56. // The insertion_parent_for_*() functions maintain the invariant that the in-flow children of
  57. // block-level boxes must be either all block-level or all inline-level.
  58. static Layout::Node& insertion_parent_for_inline_node(Layout::NodeWithStyle& layout_parent)
  59. {
  60. if (layout_parent.display().is_inline_outside() && layout_parent.display().is_flow_inside())
  61. return layout_parent;
  62. if (layout_parent.display().is_flex_inside()) {
  63. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  64. return *layout_parent.last_child();
  65. }
  66. if (!has_in_flow_block_children(layout_parent) || layout_parent.children_are_inline())
  67. return layout_parent;
  68. // Parent has block-level children, insert into an anonymous wrapper block (and create it first if needed)
  69. if (!layout_parent.last_child()->is_anonymous() || !layout_parent.last_child()->children_are_inline()) {
  70. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  71. }
  72. return *layout_parent.last_child();
  73. }
  74. static Layout::Node& insertion_parent_for_block_node(Layout::NodeWithStyle& layout_parent, Layout::Node& layout_node)
  75. {
  76. if (!has_inline_or_in_flow_block_children(layout_parent)) {
  77. // Parent block has no children, insert this block into parent.
  78. return layout_parent;
  79. }
  80. bool is_out_of_flow = layout_node.is_absolutely_positioned() || layout_node.is_floating();
  81. if (is_out_of_flow
  82. && !layout_parent.display().is_flex_inside()
  83. && !layout_parent.display().is_grid_inside()
  84. && layout_parent.last_child()->is_anonymous()
  85. && layout_parent.last_child()->children_are_inline()) {
  86. // Block is out-of-flow & previous sibling was wrapped in an anonymous block.
  87. // Join the previous sibling inside the anonymous block.
  88. return *layout_parent.last_child();
  89. }
  90. if (!layout_parent.children_are_inline()) {
  91. // Parent block has block-level children, insert this block into parent.
  92. return layout_parent;
  93. }
  94. if (is_out_of_flow) {
  95. // Block is out-of-flow, it can have inline siblings if necessary.
  96. return layout_parent;
  97. }
  98. // Parent block has inline-level children (our siblings).
  99. // First move these siblings into an anonymous wrapper block.
  100. Vector<JS::Handle<Layout::Node>> children;
  101. while (JS::GCPtr<Layout::Node> child = layout_parent.first_child()) {
  102. layout_parent.remove_child(*child);
  103. children.append(*child);
  104. }
  105. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  106. layout_parent.set_children_are_inline(false);
  107. for (auto& child : children) {
  108. layout_parent.last_child()->append_child(*child);
  109. }
  110. layout_parent.last_child()->set_children_are_inline(true);
  111. // Then it's safe to insert this block into parent.
  112. return layout_parent;
  113. }
  114. void TreeBuilder::insert_node_into_inline_or_block_ancestor(Layout::Node& node, CSS::Display display, AppendOrPrepend mode)
  115. {
  116. if (display.is_inline_outside()) {
  117. // Inlines can be inserted into the nearest ancestor.
  118. auto& insertion_point = insertion_parent_for_inline_node(m_ancestor_stack.last());
  119. if (mode == AppendOrPrepend::Prepend)
  120. insertion_point.prepend_child(node);
  121. else
  122. insertion_point.append_child(node);
  123. insertion_point.set_children_are_inline(true);
  124. } else {
  125. // Non-inlines can't be inserted into an inline parent, so find the nearest non-inline ancestor.
  126. auto& nearest_non_inline_ancestor = [&]() -> Layout::NodeWithStyle& {
  127. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  128. if (!ancestor->display().is_inline_outside())
  129. return ancestor;
  130. if (!ancestor->display().is_flow_inside())
  131. return ancestor;
  132. if (ancestor->dom_node() && is<SVG::SVGForeignObjectElement>(*ancestor->dom_node()))
  133. return ancestor;
  134. }
  135. VERIFY_NOT_REACHED();
  136. }();
  137. auto& insertion_point = insertion_parent_for_block_node(nearest_non_inline_ancestor, node);
  138. if (mode == AppendOrPrepend::Prepend)
  139. insertion_point.prepend_child(node);
  140. else
  141. insertion_point.append_child(node);
  142. // After inserting an in-flow block-level box into a parent, mark the parent as having non-inline children.
  143. if (!node.is_floating() && !node.is_absolutely_positioned())
  144. insertion_point.set_children_are_inline(false);
  145. }
  146. }
  147. ErrorOr<void> TreeBuilder::create_pseudo_element_if_needed(DOM::Element& element, CSS::Selector::PseudoElement pseudo_element, AppendOrPrepend mode)
  148. {
  149. auto& document = element.document();
  150. auto& style_computer = document.style_computer();
  151. auto pseudo_element_style = TRY(style_computer.compute_pseudo_element_style_if_needed(element, pseudo_element));
  152. if (!pseudo_element_style)
  153. return {};
  154. auto pseudo_element_content = pseudo_element_style->content();
  155. auto pseudo_element_display = pseudo_element_style->display();
  156. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  157. // We also don't create them if they are `display: none`.
  158. if (pseudo_element_display.is_none()
  159. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  160. || pseudo_element_content.type == CSS::ContentData::Type::None)
  161. return {};
  162. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, *pseudo_element_style, nullptr);
  163. if (!pseudo_element_node)
  164. return {};
  165. pseudo_element_node->set_generated(true);
  166. // FIXME: Handle images, and multiple values
  167. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  168. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data.to_deprecated_string()).release_allocated_value_but_fixme_should_propagate_errors();
  169. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  170. text_node->set_generated(true);
  171. push_parent(verify_cast<NodeWithStyle>(*pseudo_element_node));
  172. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  173. pop_parent();
  174. } else {
  175. TODO();
  176. }
  177. element.set_pseudo_element_node({}, pseudo_element, pseudo_element_node);
  178. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  179. return {};
  180. }
  181. ErrorOr<void> TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  182. {
  183. // If the parent doesn't have a layout node, we don't need one either.
  184. if (dom_node.parent_or_shadow_host() && !dom_node.parent_or_shadow_host()->layout_node())
  185. return {};
  186. Optional<TemporaryChange<bool>> has_svg_root_change;
  187. if (dom_node.is_svg_container()) {
  188. has_svg_root_change.emplace(context.has_svg_root, true);
  189. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  190. return {};
  191. }
  192. auto& document = dom_node.document();
  193. auto& style_computer = document.style_computer();
  194. JS::GCPtr<Layout::Node> layout_node;
  195. RefPtr<CSS::StyleProperties> style;
  196. CSS::Display display;
  197. if (is<DOM::Element>(dom_node)) {
  198. auto& element = static_cast<DOM::Element&>(dom_node);
  199. element.clear_pseudo_element_nodes({});
  200. VERIFY(!element.needs_style_update());
  201. style = element.computed_css_values();
  202. display = style->display();
  203. if (display.is_none())
  204. return {};
  205. layout_node = element.create_layout_node(*style);
  206. } else if (is<DOM::Document>(dom_node)) {
  207. style = style_computer.create_document_style();
  208. display = style->display();
  209. layout_node = document.heap().allocate_without_realm<Layout::Viewport>(static_cast<DOM::Document&>(dom_node), *style);
  210. } else if (is<DOM::Text>(dom_node)) {
  211. layout_node = document.heap().allocate_without_realm<Layout::TextNode>(document, static_cast<DOM::Text&>(dom_node));
  212. display = CSS::Display(CSS::Display::Outside::Inline, CSS::Display::Inside::Flow);
  213. } else if (is<DOM::ShadowRoot>(dom_node)) {
  214. layout_node = document.heap().allocate_without_realm<Layout::BlockContainer>(document, &static_cast<DOM::ShadowRoot&>(dom_node), CSS::ComputedValues {});
  215. display = CSS::Display(CSS::Display::Outside::Block, CSS::Display::Inside::FlowRoot);
  216. }
  217. if (!layout_node)
  218. return {};
  219. if (!dom_node.parent_or_shadow_host()) {
  220. m_layout_root = layout_node;
  221. } else if (layout_node->is_svg_box()) {
  222. m_ancestor_stack.last()->append_child(*layout_node);
  223. } else {
  224. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  225. }
  226. auto* shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root_internal() : nullptr;
  227. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children()) {
  228. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  229. if (shadow_root)
  230. TRY(create_layout_tree(*shadow_root, context));
  231. // This is the same as verify_cast<DOM::ParentNode>(dom_node).for_each_child
  232. for (auto* node = verify_cast<DOM::ParentNode>(dom_node).first_child(); node; node = node->next_sibling())
  233. TRY(create_layout_tree(*node, context));
  234. pop_parent();
  235. }
  236. // Add nodes for the ::before and ::after pseudo-elements.
  237. if (is<DOM::Element>(dom_node)) {
  238. auto& element = static_cast<DOM::Element&>(dom_node);
  239. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  240. TRY(create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Before, AppendOrPrepend::Prepend));
  241. TRY(create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::After, AppendOrPrepend::Append));
  242. pop_parent();
  243. }
  244. if (is<ListItemBox>(*layout_node)) {
  245. auto& element = static_cast<DOM::Element&>(dom_node);
  246. int child_index = layout_node->parent()->index_of_child<ListItemBox>(*layout_node).value();
  247. auto marker_style = TRY(style_computer.compute_style(element, CSS::Selector::PseudoElement::Marker));
  248. auto list_item_marker = document.heap().allocate_without_realm<ListItemMarkerBox>(document, layout_node->computed_values().list_style_type(), child_index + 1, *marker_style);
  249. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  250. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Marker, list_item_marker);
  251. layout_node->append_child(*list_item_marker);
  252. }
  253. if (is<HTML::HTMLProgressElement>(dom_node)) {
  254. auto& progress = static_cast<HTML::HTMLProgressElement&>(dom_node);
  255. if (!progress.using_system_appearance()) {
  256. auto bar_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressBar));
  257. bar_style->set_property(CSS::PropertyID::Display, CSS::IdentifierStyleValue::create(CSS::ValueID::InlineBlock));
  258. auto value_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressValue));
  259. value_style->set_property(CSS::PropertyID::Display, CSS::IdentifierStyleValue::create(CSS::ValueID::Block));
  260. auto position = progress.position();
  261. value_style->set_property(CSS::PropertyID::Width, CSS::PercentageStyleValue::create(CSS::Percentage(position >= 0 ? round_to<int>(100 * position) : 0)));
  262. auto bar_display = bar_style->display();
  263. auto value_display = value_style->display();
  264. auto progress_bar = DOM::Element::create_layout_node_for_display_type(document, bar_display, bar_style, nullptr);
  265. auto progress_value = DOM::Element::create_layout_node_for_display_type(document, value_display, value_style, nullptr);
  266. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  267. push_parent(verify_cast<NodeWithStyle>(*progress_bar));
  268. insert_node_into_inline_or_block_ancestor(*progress_value, value_display, AppendOrPrepend::Append);
  269. pop_parent();
  270. insert_node_into_inline_or_block_ancestor(*progress_bar, bar_display, AppendOrPrepend::Append);
  271. pop_parent();
  272. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressBar, progress_bar);
  273. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressValue, progress_value);
  274. }
  275. }
  276. if (is<HTML::HTMLInputElement>(dom_node)) {
  277. auto& input_element = static_cast<HTML::HTMLInputElement&>(dom_node);
  278. if (auto placeholder_value = input_element.placeholder_value(); placeholder_value.has_value()) {
  279. auto placeholder_style = TRY(style_computer.compute_style(input_element, CSS::Selector::PseudoElement::Placeholder));
  280. auto placeholder = DOM::Element::create_layout_node_for_display_type(document, placeholder_style->display(), placeholder_style, nullptr);
  281. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, *placeholder_value).release_allocated_value_but_fixme_should_propagate_errors();
  282. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  283. text_node->set_generated(true);
  284. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  285. push_parent(verify_cast<NodeWithStyle>(*placeholder));
  286. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  287. pop_parent();
  288. insert_node_into_inline_or_block_ancestor(*placeholder, placeholder->display(), AppendOrPrepend::Append);
  289. pop_parent();
  290. input_element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Placeholder, placeholder);
  291. }
  292. }
  293. return {};
  294. }
  295. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  296. {
  297. VERIFY(dom_node.is_document());
  298. Context context;
  299. MUST(create_layout_tree(dom_node, context)); // FIXME propagate errors
  300. if (auto* root = dom_node.document().layout_node())
  301. fixup_tables(*root);
  302. return move(m_layout_root);
  303. }
  304. template<CSS::Display::Internal internal, typename Callback>
  305. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  306. {
  307. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  308. auto const display = box.display();
  309. if (display.is_internal() && display.internal() == internal)
  310. callback(box);
  311. return IterationDecision::Continue;
  312. });
  313. }
  314. template<CSS::Display::Inside inside, typename Callback>
  315. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  316. {
  317. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  318. auto const display = box.display();
  319. if (display.is_outside_and_inside() && display.inside() == inside)
  320. callback(box);
  321. return IterationDecision::Continue;
  322. });
  323. }
  324. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  325. {
  326. remove_irrelevant_boxes(root);
  327. generate_missing_child_wrappers(root);
  328. generate_missing_parents(root);
  329. }
  330. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  331. {
  332. // The following boxes are discarded as if they were display:none:
  333. Vector<JS::Handle<Node>> to_remove;
  334. // Children of a table-column.
  335. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumn>(root, [&](Box& table_column) {
  336. table_column.for_each_child([&](auto& child) {
  337. to_remove.append(child);
  338. });
  339. });
  340. // Children of a table-column-group which are not a table-column.
  341. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumnGroup>(root, [&](Box& table_column_group) {
  342. table_column_group.for_each_child([&](auto& child) {
  343. if (child.display().is_table_column())
  344. to_remove.append(child);
  345. });
  346. });
  347. // FIXME:
  348. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  349. // Anonymous inline boxes which meet all of the following criteria:
  350. // - they contain only white space
  351. // - they are the first and/or last child of a tabular container
  352. // - whose immediate sibling, if any, is a table-non-root box
  353. for (auto& box : to_remove)
  354. box->parent()->remove_child(*box);
  355. }
  356. static bool is_table_track(CSS::Display display)
  357. {
  358. return display.is_table_row() || display.is_table_column();
  359. }
  360. static bool is_table_track_group(CSS::Display display)
  361. {
  362. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  363. // table-header-groups and table-footer-groups.
  364. return display.is_table_row_group()
  365. || display.is_table_header_group()
  366. || display.is_table_footer_group()
  367. || display.is_table_column_group();
  368. }
  369. static bool is_proper_table_child(Node const& node)
  370. {
  371. auto const display = node.display();
  372. return is_table_track_group(display) || is_table_track(display) || display.is_table_caption();
  373. }
  374. static bool is_not_proper_table_child(Node const& node)
  375. {
  376. if (!node.has_style())
  377. return true;
  378. return !is_proper_table_child(node);
  379. }
  380. static bool is_table_row(Node const& node)
  381. {
  382. return node.display().is_table_row();
  383. }
  384. static bool is_not_table_row(Node const& node)
  385. {
  386. if (!node.has_style())
  387. return true;
  388. return !is_table_row(node);
  389. }
  390. static bool is_table_cell(Node const& node)
  391. {
  392. return node.display().is_table_cell();
  393. }
  394. static bool is_not_table_cell(Node const& node)
  395. {
  396. if (!node.has_style())
  397. return true;
  398. return !is_table_cell(node);
  399. }
  400. static bool is_ignorable_whitespace(Layout::Node const& node)
  401. {
  402. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().is_whitespace())
  403. return true;
  404. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  405. bool contains_only_white_space = true;
  406. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  407. if (!text_node.text_for_rendering().is_whitespace()) {
  408. contains_only_white_space = false;
  409. return IterationDecision::Break;
  410. }
  411. return IterationDecision::Continue;
  412. });
  413. if (contains_only_white_space)
  414. return true;
  415. }
  416. return false;
  417. }
  418. template<typename Matcher, typename Callback>
  419. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  420. {
  421. Vector<JS::Handle<Node>> sequence;
  422. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  423. for (auto& node : sequence) {
  424. if (!is_ignorable_whitespace(*node))
  425. return false;
  426. }
  427. return true;
  428. };
  429. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  430. if (matcher(*child) || (!sequence.is_empty() && is_ignorable_whitespace(*child))) {
  431. sequence.append(*child);
  432. } else {
  433. if (!sequence.is_empty()) {
  434. if (!sequence_is_all_ignorable_whitespace())
  435. callback(sequence, child);
  436. sequence.clear();
  437. }
  438. }
  439. }
  440. if (!sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  441. callback(sequence, nullptr);
  442. }
  443. template<typename WrapperBoxType>
  444. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling)
  445. {
  446. VERIFY(!sequence.is_empty());
  447. auto& parent = *sequence.first()->parent();
  448. auto computed_values = parent.computed_values().clone_inherited_values();
  449. static_cast<CSS::MutableComputedValues&>(computed_values).set_display(WrapperBoxType::static_display(parent.display().is_inline_outside()));
  450. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  451. for (auto& child : sequence) {
  452. parent.remove_child(*child);
  453. wrapper->append_child(*child);
  454. }
  455. if (nearest_sibling)
  456. parent.insert_before(*wrapper, *nearest_sibling);
  457. else
  458. parent.append_child(*wrapper);
  459. }
  460. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  461. {
  462. // 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.
  463. for_each_in_tree_with_inside_display<CSS::Display::Inside::Table>(root, [&](auto& parent) {
  464. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  465. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  466. });
  467. });
  468. // 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.
  469. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRowGroup>(root, [&](auto& parent) {
  470. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  471. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  472. });
  473. });
  474. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  475. // table-header-groups and table-footer-groups.
  476. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableHeaderGroup>(root, [&](auto& parent) {
  477. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  478. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  479. });
  480. });
  481. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableFooterGroup>(root, [&](auto& parent) {
  482. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  483. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  484. });
  485. });
  486. // 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
  487. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRow>(root, [&](auto& parent) {
  488. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  489. wrap_in_anonymous<TableCellBox>(sequence, nearest_sibling);
  490. });
  491. });
  492. }
  493. void TreeBuilder::generate_missing_parents(NodeWithStyle& root)
  494. {
  495. Vector<JS::Handle<TableBox>> table_roots_to_wrap;
  496. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& parent) {
  497. // An anonymous table-row box must be generated around each sequence of consecutive table-cell boxes whose parent is not a table-row.
  498. if (is_not_table_row(parent)) {
  499. for_each_sequence_of_consecutive_children_matching(parent, is_table_cell, [&](auto& sequence, auto nearest_sibling) {
  500. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  501. });
  502. }
  503. // A table-row is misparented if its parent is neither a table-row-group nor a table-root box.
  504. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  505. for_each_sequence_of_consecutive_children_matching(parent, is_table_row, [&](auto& sequence, auto nearest_sibling) {
  506. wrap_in_anonymous<TableBox>(sequence, nearest_sibling);
  507. });
  508. }
  509. // A table-row-group, table-column-group, or table-caption box is misparented if its parent is not a table-root box.
  510. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  511. for_each_sequence_of_consecutive_children_matching(parent, is_proper_table_child, [&](auto& sequence, auto nearest_sibling) {
  512. wrap_in_anonymous<TableBox>(sequence, nearest_sibling);
  513. });
  514. }
  515. // An anonymous table-wrapper box must be generated around each table-root.
  516. if (parent.display().is_table_inside()) {
  517. table_roots_to_wrap.append(static_cast<TableBox&>(parent));
  518. }
  519. return IterationDecision::Continue;
  520. });
  521. for (auto& table_box : table_roots_to_wrap) {
  522. auto* nearest_sibling = table_box->next_sibling();
  523. auto& parent = *table_box->parent();
  524. CSS::ComputedValues wrapper_computed_values;
  525. // The computed values of properties 'position', 'float', 'margin-*', 'top', 'right', 'bottom', and 'left' on the table element are used on the table wrapper box and not the table box;
  526. // all other values of non-inheritable properties are used on the table box and not the table wrapper box.
  527. // (Where the table element's values are not used on the table and table wrapper boxes, the initial values are used instead.)
  528. auto& mutable_wrapper_computed_values = static_cast<CSS::MutableComputedValues&>(wrapper_computed_values);
  529. if (table_box->display().is_inline_outside())
  530. mutable_wrapper_computed_values.set_display(CSS::Display::from_short(CSS::Display::Short::InlineBlock));
  531. else
  532. mutable_wrapper_computed_values.set_display(CSS::Display::from_short(CSS::Display::Short::FlowRoot));
  533. mutable_wrapper_computed_values.set_position(table_box->computed_values().position());
  534. mutable_wrapper_computed_values.set_inset(table_box->computed_values().inset());
  535. mutable_wrapper_computed_values.set_float(table_box->computed_values().float_());
  536. mutable_wrapper_computed_values.set_clear(table_box->computed_values().clear());
  537. mutable_wrapper_computed_values.set_margin(table_box->computed_values().margin());
  538. table_box->reset_table_box_computed_values_used_by_wrapper_to_init_values();
  539. auto wrapper = parent.heap().allocate_without_realm<TableWrapper>(parent.document(), nullptr, move(wrapper_computed_values));
  540. parent.remove_child(*table_box);
  541. wrapper->append_child(*table_box);
  542. if (nearest_sibling)
  543. parent.insert_before(*wrapper, *nearest_sibling);
  544. else
  545. parent.append_child(*wrapper);
  546. }
  547. }
  548. }