TreeBuilder.cpp 27 KB

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