TreeBuilder.cpp 27 KB

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