TreeBuilder.cpp 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635
  1. /*
  2. * Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022-2023, Sam Atkins <atkinssj@serenityos.org>
  4. * Copyright (c) 2022, MacDue <macdue@dueutil.tech>
  5. *
  6. * SPDX-License-Identifier: BSD-2-Clause
  7. */
  8. #include <AK/Error.h>
  9. #include <AK/Optional.h>
  10. #include <AK/TemporaryChange.h>
  11. #include <LibWeb/CSS/StyleValues/DisplayStyleValue.h>
  12. #include <LibWeb/CSS/StyleValues/IdentifierStyleValue.h>
  13. #include <LibWeb/CSS/StyleValues/PercentageStyleValue.h>
  14. #include <LibWeb/DOM/Document.h>
  15. #include <LibWeb/DOM/Element.h>
  16. #include <LibWeb/DOM/ParentNode.h>
  17. #include <LibWeb/DOM/ShadowRoot.h>
  18. #include <LibWeb/Dump.h>
  19. #include <LibWeb/HTML/HTMLInputElement.h>
  20. #include <LibWeb/HTML/HTMLProgressElement.h>
  21. #include <LibWeb/Layout/ListItemBox.h>
  22. #include <LibWeb/Layout/ListItemMarkerBox.h>
  23. #include <LibWeb/Layout/Node.h>
  24. #include <LibWeb/Layout/Progress.h>
  25. #include <LibWeb/Layout/TableBox.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()) {
  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. // If the parent doesn't have a layout node, we don't need one either.
  185. if (dom_node.parent_or_shadow_host() && !dom_node.parent_or_shadow_host()->layout_node())
  186. return {};
  187. Optional<TemporaryChange<bool>> has_svg_root_change;
  188. if (dom_node.is_svg_container()) {
  189. has_svg_root_change.emplace(context.has_svg_root, true);
  190. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  191. return {};
  192. }
  193. auto& document = dom_node.document();
  194. auto& style_computer = document.style_computer();
  195. JS::GCPtr<Layout::Node> layout_node;
  196. RefPtr<CSS::StyleProperties> style;
  197. CSS::Display display;
  198. if (is<DOM::Element>(dom_node)) {
  199. auto& element = static_cast<DOM::Element&>(dom_node);
  200. element.clear_pseudo_element_nodes({});
  201. VERIFY(!element.needs_style_update());
  202. style = element.computed_css_values();
  203. display = style->display();
  204. if (display.is_none())
  205. return {};
  206. layout_node = element.create_layout_node(*style);
  207. } else if (is<DOM::Document>(dom_node)) {
  208. style = style_computer.create_document_style();
  209. display = style->display();
  210. layout_node = document.heap().allocate_without_realm<Layout::Viewport>(static_cast<DOM::Document&>(dom_node), *style);
  211. } else if (is<DOM::Text>(dom_node)) {
  212. layout_node = document.heap().allocate_without_realm<Layout::TextNode>(document, static_cast<DOM::Text&>(dom_node));
  213. display = CSS::Display(CSS::Display::Outside::Inline, CSS::Display::Inside::Flow);
  214. } else if (is<DOM::ShadowRoot>(dom_node)) {
  215. layout_node = document.heap().allocate_without_realm<Layout::BlockContainer>(document, &static_cast<DOM::ShadowRoot&>(dom_node), CSS::ComputedValues {});
  216. display = CSS::Display(CSS::Display::Outside::Block, CSS::Display::Inside::FlowRoot);
  217. }
  218. if (!layout_node)
  219. return {};
  220. if (!dom_node.parent_or_shadow_host()) {
  221. m_layout_root = layout_node;
  222. } else if (layout_node->is_svg_box()) {
  223. m_ancestor_stack.last()->append_child(*layout_node);
  224. } else {
  225. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  226. }
  227. auto* shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root_internal() : nullptr;
  228. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children()) {
  229. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  230. if (shadow_root)
  231. TRY(create_layout_tree(*shadow_root, context));
  232. // This is the same as verify_cast<DOM::ParentNode>(dom_node).for_each_child
  233. for (auto* node = verify_cast<DOM::ParentNode>(dom_node).first_child(); node; node = node->next_sibling())
  234. TRY(create_layout_tree(*node, context));
  235. pop_parent();
  236. }
  237. // Add nodes for the ::before and ::after pseudo-elements.
  238. if (is<DOM::Element>(dom_node)) {
  239. auto& element = static_cast<DOM::Element&>(dom_node);
  240. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  241. TRY(create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Before, AppendOrPrepend::Prepend));
  242. TRY(create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::After, AppendOrPrepend::Append));
  243. pop_parent();
  244. }
  245. if (is<ListItemBox>(*layout_node)) {
  246. auto& element = static_cast<DOM::Element&>(dom_node);
  247. int child_index = layout_node->parent()->index_of_child<ListItemBox>(*layout_node).value();
  248. auto marker_style = TRY(style_computer.compute_style(element, CSS::Selector::PseudoElement::Marker));
  249. auto list_item_marker = document.heap().allocate_without_realm<ListItemMarkerBox>(document, layout_node->computed_values().list_style_type(), child_index + 1, *marker_style);
  250. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  251. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Marker, list_item_marker);
  252. layout_node->append_child(*list_item_marker);
  253. }
  254. if (is<HTML::HTMLProgressElement>(dom_node)) {
  255. auto& progress = static_cast<HTML::HTMLProgressElement&>(dom_node);
  256. if (!progress.using_system_appearance()) {
  257. auto bar_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressBar));
  258. bar_style->set_property(CSS::PropertyID::Display, CSS::DisplayStyleValue::create(CSS::Display::from_short(CSS::Display::Short::FlowRoot)));
  259. auto value_style = TRY(style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressValue));
  260. value_style->set_property(CSS::PropertyID::Display, CSS::DisplayStyleValue::create(CSS::Display::from_short(CSS::Display::Short::Block)));
  261. auto position = progress.position();
  262. value_style->set_property(CSS::PropertyID::Width, CSS::PercentageStyleValue::create(CSS::Percentage(position >= 0 ? round_to<int>(100 * position) : 0)));
  263. auto bar_display = bar_style->display();
  264. auto value_display = value_style->display();
  265. auto progress_bar = DOM::Element::create_layout_node_for_display_type(document, bar_display, bar_style, nullptr);
  266. auto progress_value = DOM::Element::create_layout_node_for_display_type(document, value_display, value_style, nullptr);
  267. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  268. push_parent(verify_cast<NodeWithStyle>(*progress_bar));
  269. insert_node_into_inline_or_block_ancestor(*progress_value, value_display, AppendOrPrepend::Append);
  270. pop_parent();
  271. insert_node_into_inline_or_block_ancestor(*progress_bar, bar_display, AppendOrPrepend::Append);
  272. pop_parent();
  273. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressBar, progress_bar);
  274. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressValue, progress_value);
  275. }
  276. }
  277. if (is<HTML::HTMLInputElement>(dom_node)) {
  278. auto& input_element = static_cast<HTML::HTMLInputElement&>(dom_node);
  279. if (auto placeholder_value = input_element.placeholder_value(); placeholder_value.has_value()) {
  280. auto placeholder_style = TRY(style_computer.compute_style(input_element, CSS::Selector::PseudoElement::Placeholder));
  281. auto placeholder = DOM::Element::create_layout_node_for_display_type(document, placeholder_style->display(), placeholder_style, nullptr);
  282. auto text = document.heap().allocate<DOM::Text>(document.realm(), document, *placeholder_value).release_allocated_value_but_fixme_should_propagate_errors();
  283. auto text_node = document.heap().allocate_without_realm<Layout::TextNode>(document, *text);
  284. text_node->set_generated(true);
  285. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  286. push_parent(verify_cast<NodeWithStyle>(*placeholder));
  287. insert_node_into_inline_or_block_ancestor(*text_node, text_node->display(), AppendOrPrepend::Append);
  288. pop_parent();
  289. insert_node_into_inline_or_block_ancestor(*placeholder, placeholder->display(), AppendOrPrepend::Append);
  290. pop_parent();
  291. input_element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Placeholder, placeholder);
  292. }
  293. }
  294. return {};
  295. }
  296. JS::GCPtr<Layout::Node> TreeBuilder::build(DOM::Node& dom_node)
  297. {
  298. VERIFY(dom_node.is_document());
  299. Context context;
  300. MUST(create_layout_tree(dom_node, context)); // FIXME propagate errors
  301. if (auto* root = dom_node.document().layout_node())
  302. fixup_tables(*root);
  303. return move(m_layout_root);
  304. }
  305. template<CSS::Display::Internal internal, typename Callback>
  306. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  307. {
  308. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  309. auto const display = box.display();
  310. if (display.is_internal() && display.internal() == internal)
  311. callback(box);
  312. return IterationDecision::Continue;
  313. });
  314. }
  315. template<CSS::Display::Inside inside, typename Callback>
  316. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  317. {
  318. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  319. auto const display = box.display();
  320. if (display.is_outside_and_inside() && display.inside() == inside)
  321. callback(box);
  322. return IterationDecision::Continue;
  323. });
  324. }
  325. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  326. {
  327. remove_irrelevant_boxes(root);
  328. generate_missing_child_wrappers(root);
  329. generate_missing_parents(root);
  330. }
  331. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  332. {
  333. // The following boxes are discarded as if they were display:none:
  334. Vector<JS::Handle<Node>> to_remove;
  335. // Children of a table-column.
  336. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumn>(root, [&](Box& table_column) {
  337. table_column.for_each_child([&](auto& child) {
  338. to_remove.append(child);
  339. });
  340. });
  341. // Children of a table-column-group which are not a table-column.
  342. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumnGroup>(root, [&](Box& table_column_group) {
  343. table_column_group.for_each_child([&](auto& child) {
  344. if (child.display().is_table_column())
  345. to_remove.append(child);
  346. });
  347. });
  348. // FIXME:
  349. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  350. // Anonymous inline boxes which meet all of the following criteria:
  351. // - they contain only white space
  352. // - they are the first and/or last child of a tabular container
  353. // - whose immediate sibling, if any, is a table-non-root box
  354. for (auto& box : to_remove)
  355. box->parent()->remove_child(*box);
  356. }
  357. static bool is_table_track(CSS::Display display)
  358. {
  359. return display.is_table_row() || display.is_table_column();
  360. }
  361. static bool is_table_track_group(CSS::Display display)
  362. {
  363. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  364. // table-header-groups and table-footer-groups.
  365. return display.is_table_row_group()
  366. || display.is_table_header_group()
  367. || display.is_table_footer_group()
  368. || display.is_table_column_group();
  369. }
  370. static bool is_proper_table_child(Node const& node)
  371. {
  372. auto const display = node.display();
  373. return is_table_track_group(display) || is_table_track(display) || display.is_table_caption();
  374. }
  375. static bool is_not_proper_table_child(Node const& node)
  376. {
  377. if (!node.has_style())
  378. return true;
  379. return !is_proper_table_child(node);
  380. }
  381. static bool is_table_row(Node const& node)
  382. {
  383. return node.display().is_table_row();
  384. }
  385. static bool is_not_table_row(Node const& node)
  386. {
  387. if (!node.has_style())
  388. return true;
  389. return !is_table_row(node);
  390. }
  391. static bool is_table_cell(Node const& node)
  392. {
  393. return node.display().is_table_cell();
  394. }
  395. static bool is_not_table_cell(Node const& node)
  396. {
  397. if (!node.has_style())
  398. return true;
  399. return !is_table_cell(node);
  400. }
  401. static bool is_ignorable_whitespace(Layout::Node const& node)
  402. {
  403. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().is_whitespace())
  404. return true;
  405. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  406. bool contains_only_white_space = true;
  407. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  408. if (!text_node.text_for_rendering().is_whitespace()) {
  409. contains_only_white_space = false;
  410. return IterationDecision::Break;
  411. }
  412. return IterationDecision::Continue;
  413. });
  414. if (contains_only_white_space)
  415. return true;
  416. }
  417. return false;
  418. }
  419. template<typename Matcher, typename Callback>
  420. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  421. {
  422. Vector<JS::Handle<Node>> sequence;
  423. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  424. for (auto& node : sequence) {
  425. if (!is_ignorable_whitespace(*node))
  426. return false;
  427. }
  428. return true;
  429. };
  430. for (auto child = parent.first_child(); child; child = child->next_sibling()) {
  431. if (matcher(*child) || (!sequence.is_empty() && is_ignorable_whitespace(*child))) {
  432. sequence.append(*child);
  433. } else {
  434. if (!sequence.is_empty()) {
  435. if (!sequence_is_all_ignorable_whitespace())
  436. callback(sequence, child);
  437. sequence.clear();
  438. }
  439. }
  440. }
  441. if (!sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  442. callback(sequence, nullptr);
  443. }
  444. template<typename WrapperBoxType>
  445. static void wrap_in_anonymous(Vector<JS::Handle<Node>>& sequence, Node* nearest_sibling)
  446. {
  447. VERIFY(!sequence.is_empty());
  448. auto& parent = *sequence.first()->parent();
  449. auto computed_values = parent.computed_values().clone_inherited_values();
  450. static_cast<CSS::MutableComputedValues&>(computed_values).set_display(WrapperBoxType::static_display(parent.display().is_inline_outside()));
  451. auto wrapper = parent.heap().template allocate_without_realm<WrapperBoxType>(parent.document(), nullptr, move(computed_values));
  452. for (auto& child : sequence) {
  453. parent.remove_child(*child);
  454. wrapper->append_child(*child);
  455. }
  456. if (nearest_sibling)
  457. parent.insert_before(*wrapper, *nearest_sibling);
  458. else
  459. parent.append_child(*wrapper);
  460. }
  461. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  462. {
  463. // 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.
  464. for_each_in_tree_with_inside_display<CSS::Display::Inside::Table>(root, [&](auto& parent) {
  465. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  466. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  467. });
  468. });
  469. // 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.
  470. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRowGroup>(root, [&](auto& parent) {
  471. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  472. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  473. });
  474. });
  475. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  476. // table-header-groups and table-footer-groups.
  477. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableHeaderGroup>(root, [&](auto& parent) {
  478. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  479. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  480. });
  481. });
  482. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableFooterGroup>(root, [&](auto& parent) {
  483. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  484. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  485. });
  486. });
  487. // 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
  488. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRow>(root, [&](auto& parent) {
  489. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  490. wrap_in_anonymous<TableCellBox>(sequence, nearest_sibling);
  491. });
  492. });
  493. }
  494. void TreeBuilder::generate_missing_parents(NodeWithStyle& root)
  495. {
  496. Vector<JS::Handle<TableBox>> table_roots_to_wrap;
  497. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& parent) {
  498. // An anonymous table-row box must be generated around each sequence of consecutive table-cell boxes whose parent is not a table-row.
  499. if (is_not_table_row(parent)) {
  500. for_each_sequence_of_consecutive_children_matching(parent, is_table_cell, [&](auto& sequence, auto nearest_sibling) {
  501. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  502. });
  503. }
  504. // A table-row is misparented if its parent is neither a table-row-group nor 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_table_row, [&](auto& sequence, auto nearest_sibling) {
  507. wrap_in_anonymous<TableBox>(sequence, nearest_sibling);
  508. });
  509. }
  510. // A table-row-group, table-column-group, or table-caption box is misparented if its parent is not a table-root box.
  511. if (!parent.display().is_table_inside() && !is_proper_table_child(parent)) {
  512. for_each_sequence_of_consecutive_children_matching(parent, is_proper_table_child, [&](auto& sequence, auto nearest_sibling) {
  513. wrap_in_anonymous<TableBox>(sequence, nearest_sibling);
  514. });
  515. }
  516. // An anonymous table-wrapper box must be generated around each table-root.
  517. if (parent.display().is_table_inside()) {
  518. table_roots_to_wrap.append(static_cast<TableBox&>(parent));
  519. }
  520. return IterationDecision::Continue;
  521. });
  522. for (auto& table_box : table_roots_to_wrap) {
  523. auto* nearest_sibling = table_box->next_sibling();
  524. auto& parent = *table_box->parent();
  525. CSS::ComputedValues wrapper_computed_values;
  526. // 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;
  527. // all other values of non-inheritable properties are used on the table box and not the table wrapper box.
  528. // (Where the table element's values are not used on the table and table wrapper boxes, the initial values are used instead.)
  529. auto& mutable_wrapper_computed_values = static_cast<CSS::MutableComputedValues&>(wrapper_computed_values);
  530. if (table_box->display().is_inline_outside())
  531. mutable_wrapper_computed_values.set_display(CSS::Display::from_short(CSS::Display::Short::InlineBlock));
  532. else
  533. mutable_wrapper_computed_values.set_display(CSS::Display::from_short(CSS::Display::Short::FlowRoot));
  534. mutable_wrapper_computed_values.set_position(table_box->computed_values().position());
  535. mutable_wrapper_computed_values.set_inset(table_box->computed_values().inset());
  536. mutable_wrapper_computed_values.set_float(table_box->computed_values().float_());
  537. mutable_wrapper_computed_values.set_clear(table_box->computed_values().clear());
  538. mutable_wrapper_computed_values.set_margin(table_box->computed_values().margin());
  539. table_box->reset_table_box_computed_values_used_by_wrapper_to_init_values();
  540. auto wrapper = parent.heap().allocate_without_realm<TableWrapper>(parent.document(), nullptr, move(wrapper_computed_values));
  541. parent.remove_child(*table_box);
  542. wrapper->append_child(*table_box);
  543. if (nearest_sibling)
  544. parent.insert_before(*wrapper, *nearest_sibling);
  545. else
  546. parent.append_child(*wrapper);
  547. }
  548. }
  549. }