TreeBuilder.cpp 28 KB

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