TreeBuilder.cpp 27 KB

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