TreeBuilder.cpp 28 KB

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