TreeBuilder.cpp 28 KB

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