TreeBuilder.cpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502
  1. /*
  2. * Copyright (c) 2018-2022, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022, Sam Atkins <atkinssj@serenityos.org>
  4. * Copyright (c) 2022, MacDue <macdue@dueutil.tech>
  5. *
  6. * SPDX-License-Identifier: BSD-2-Clause
  7. */
  8. #include <AK/Optional.h>
  9. #include <AK/TemporaryChange.h>
  10. #include <LibWeb/DOM/Document.h>
  11. #include <LibWeb/DOM/Element.h>
  12. #include <LibWeb/DOM/ParentNode.h>
  13. #include <LibWeb/DOM/ShadowRoot.h>
  14. #include <LibWeb/Dump.h>
  15. #include <LibWeb/HTML/HTMLProgressElement.h>
  16. #include <LibWeb/Layout/InitialContainingBlock.h>
  17. #include <LibWeb/Layout/ListItemBox.h>
  18. #include <LibWeb/Layout/ListItemMarkerBox.h>
  19. #include <LibWeb/Layout/Node.h>
  20. #include <LibWeb/Layout/Progress.h>
  21. #include <LibWeb/Layout/TableBox.h>
  22. #include <LibWeb/Layout/TableCellBox.h>
  23. #include <LibWeb/Layout/TableRowBox.h>
  24. #include <LibWeb/Layout/TextNode.h>
  25. #include <LibWeb/Layout/TreeBuilder.h>
  26. namespace Web::Layout {
  27. TreeBuilder::TreeBuilder() = default;
  28. static bool has_inline_or_in_flow_block_children(Layout::Node const& layout_node)
  29. {
  30. for (auto const* child = layout_node.first_child(); child; child = child->next_sibling()) {
  31. if (child->is_inline())
  32. return true;
  33. if (!child->is_floating() && !child->is_absolutely_positioned())
  34. return true;
  35. }
  36. return false;
  37. }
  38. static bool has_in_flow_block_children(Layout::Node const& layout_node)
  39. {
  40. if (layout_node.children_are_inline())
  41. return false;
  42. for (auto const* child = layout_node.first_child(); child; child = child->next_sibling()) {
  43. if (child->is_inline())
  44. continue;
  45. if (!child->is_floating() && !child->is_absolutely_positioned())
  46. return true;
  47. }
  48. return false;
  49. }
  50. // The insertion_parent_for_*() functions maintain the invariant that the in-flow children of
  51. // block-level boxes must be either all block-level or all inline-level.
  52. static Layout::Node& insertion_parent_for_inline_node(Layout::NodeWithStyle& layout_parent)
  53. {
  54. if (layout_parent.is_inline() && !layout_parent.is_inline_block())
  55. return layout_parent;
  56. if (layout_parent.display().is_flex_inside()) {
  57. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  58. return *layout_parent.last_child();
  59. }
  60. if (!has_in_flow_block_children(layout_parent) || layout_parent.children_are_inline())
  61. return layout_parent;
  62. // Parent has block-level children, insert into an anonymous wrapper block (and create it first if needed)
  63. if (!layout_parent.last_child()->is_anonymous() || !layout_parent.last_child()->children_are_inline()) {
  64. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  65. }
  66. return *layout_parent.last_child();
  67. }
  68. static Layout::Node& insertion_parent_for_block_node(Layout::NodeWithStyle& layout_parent, Layout::Node& layout_node)
  69. {
  70. if (!has_inline_or_in_flow_block_children(layout_parent)) {
  71. // Parent block has no children, insert this block into parent.
  72. return layout_parent;
  73. }
  74. if (!layout_parent.children_are_inline()) {
  75. // Parent block has block-level children, insert this block into parent.
  76. return layout_parent;
  77. }
  78. if (layout_node.is_floating() || layout_node.is_absolutely_positioned()) {
  79. // Block is out-of-flow, it can have inline siblings if necessary.
  80. return layout_parent;
  81. }
  82. // Parent block has inline-level children (our siblings).
  83. // First move these siblings into an anonymous wrapper block.
  84. NonnullRefPtrVector<Layout::Node> children;
  85. while (RefPtr<Layout::Node> child = layout_parent.first_child()) {
  86. layout_parent.remove_child(*child);
  87. children.append(child.release_nonnull());
  88. }
  89. layout_parent.append_child(layout_parent.create_anonymous_wrapper());
  90. layout_parent.set_children_are_inline(false);
  91. for (auto& child : children) {
  92. layout_parent.last_child()->append_child(child);
  93. }
  94. layout_parent.last_child()->set_children_are_inline(true);
  95. // Then it's safe to insert this block into parent.
  96. return layout_parent;
  97. }
  98. void TreeBuilder::insert_node_into_inline_or_block_ancestor(Layout::Node& node, CSS::Display display, AppendOrPrepend mode)
  99. {
  100. if (display.is_inline_outside() && !(display.is_flow_root_inside() && m_ancestor_stack.last().display().is_flex_inside())) {
  101. // Inlines can be inserted into the nearest ancestor.
  102. auto& insertion_point = insertion_parent_for_inline_node(m_ancestor_stack.last());
  103. if (mode == AppendOrPrepend::Prepend)
  104. insertion_point.prepend_child(node);
  105. else
  106. insertion_point.append_child(node);
  107. insertion_point.set_children_are_inline(true);
  108. } else {
  109. // Non-inlines can't be inserted into an inline parent, so find the nearest non-inline ancestor.
  110. auto& nearest_non_inline_ancestor = [&]() -> Layout::NodeWithStyle& {
  111. for (auto& ancestor : m_ancestor_stack.in_reverse()) {
  112. if (!ancestor.is_inline() || ancestor.is_inline_block())
  113. return ancestor;
  114. }
  115. VERIFY_NOT_REACHED();
  116. }();
  117. auto& insertion_point = insertion_parent_for_block_node(nearest_non_inline_ancestor, node);
  118. if (mode == AppendOrPrepend::Prepend)
  119. insertion_point.prepend_child(node);
  120. else
  121. insertion_point.append_child(node);
  122. // After inserting an in-flow block-level box into a parent, mark the parent as having non-inline children.
  123. if (!node.is_floating() && !node.is_absolutely_positioned())
  124. insertion_point.set_children_are_inline(false);
  125. }
  126. }
  127. void TreeBuilder::create_pseudo_element_if_needed(DOM::Element& element, CSS::Selector::PseudoElement pseudo_element, AppendOrPrepend mode)
  128. {
  129. auto& document = element.document();
  130. auto& style_computer = document.style_computer();
  131. auto pseudo_element_style = style_computer.compute_style(element, pseudo_element);
  132. auto pseudo_element_content = pseudo_element_style->content();
  133. auto pseudo_element_display = pseudo_element_style->display();
  134. // ::before and ::after only exist if they have content. `content: normal` computes to `none` for them.
  135. // We also don't create them if they are `display: none`.
  136. if (pseudo_element_display.is_none()
  137. || pseudo_element_content.type == CSS::ContentData::Type::Normal
  138. || pseudo_element_content.type == CSS::ContentData::Type::None)
  139. return;
  140. auto pseudo_element_node = DOM::Element::create_layout_node_for_display_type(document, pseudo_element_display, pseudo_element_style, nullptr);
  141. if (!pseudo_element_node)
  142. return;
  143. pseudo_element_node->set_generated(true);
  144. // FIXME: Handle images, and multiple values
  145. if (pseudo_element_content.type == CSS::ContentData::Type::String) {
  146. auto* text = document.heap().allocate<DOM::Text>(document.realm(), document, pseudo_element_content.data);
  147. auto text_node = adopt_ref(*new TextNode(document, *text));
  148. push_parent(verify_cast<NodeWithStyle>(*pseudo_element_node));
  149. insert_node_into_inline_or_block_ancestor(text_node, pseudo_element_display, AppendOrPrepend::Append);
  150. pop_parent();
  151. } else {
  152. TODO();
  153. }
  154. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Before, pseudo_element_node);
  155. insert_node_into_inline_or_block_ancestor(*pseudo_element_node, pseudo_element_display, mode);
  156. }
  157. void TreeBuilder::create_layout_tree(DOM::Node& dom_node, TreeBuilder::Context& context)
  158. {
  159. // If the parent doesn't have a layout node, we don't need one either.
  160. if (dom_node.parent_or_shadow_host() && !dom_node.parent_or_shadow_host()->layout_node())
  161. return;
  162. Optional<TemporaryChange<bool>> has_svg_root_change;
  163. if (dom_node.is_svg_container()) {
  164. has_svg_root_change.emplace(context.has_svg_root, true);
  165. } else if (dom_node.requires_svg_container() && !context.has_svg_root) {
  166. return;
  167. }
  168. auto& document = dom_node.document();
  169. auto& style_computer = document.style_computer();
  170. RefPtr<Layout::Node> layout_node;
  171. RefPtr<CSS::StyleProperties> style;
  172. CSS::Display display;
  173. if (is<DOM::Element>(dom_node)) {
  174. auto& element = static_cast<DOM::Element&>(dom_node);
  175. element.clear_pseudo_element_nodes({});
  176. VERIFY(!element.needs_style_update());
  177. style = element.computed_css_values();
  178. display = style->display();
  179. if (display.is_none())
  180. return;
  181. layout_node = element.create_layout_node(*style);
  182. } else if (is<DOM::Document>(dom_node)) {
  183. style = style_computer.create_document_style();
  184. display = style->display();
  185. layout_node = adopt_ref(*new Layout::InitialContainingBlock(static_cast<DOM::Document&>(dom_node), *style));
  186. } else if (is<DOM::Text>(dom_node)) {
  187. layout_node = adopt_ref(*new Layout::TextNode(document, static_cast<DOM::Text&>(dom_node)));
  188. display = CSS::Display(CSS::Display::Outside::Inline, CSS::Display::Inside::Flow);
  189. } else if (is<DOM::ShadowRoot>(dom_node)) {
  190. layout_node = adopt_ref(*new Layout::BlockContainer(document, &static_cast<DOM::ShadowRoot&>(dom_node), CSS::ComputedValues {}));
  191. display = CSS::Display(CSS::Display::Outside::Block, CSS::Display::Inside::FlowRoot);
  192. }
  193. if (!layout_node)
  194. return;
  195. if (!dom_node.parent_or_shadow_host()) {
  196. m_layout_root = layout_node;
  197. } else if (layout_node->is_svg_box()) {
  198. m_ancestor_stack.last().append_child(*layout_node);
  199. } else {
  200. insert_node_into_inline_or_block_ancestor(*layout_node, display, AppendOrPrepend::Append);
  201. }
  202. auto* shadow_root = is<DOM::Element>(dom_node) ? verify_cast<DOM::Element>(dom_node).shadow_root() : nullptr;
  203. if ((dom_node.has_children() || shadow_root) && layout_node->can_have_children()) {
  204. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  205. if (shadow_root)
  206. create_layout_tree(*shadow_root, context);
  207. verify_cast<DOM::ParentNode>(dom_node).for_each_child([&](auto& dom_child) {
  208. create_layout_tree(dom_child, context);
  209. });
  210. pop_parent();
  211. }
  212. // Add nodes for the ::before and ::after pseudo-elements.
  213. if (is<DOM::Element>(dom_node)) {
  214. auto& element = static_cast<DOM::Element&>(dom_node);
  215. push_parent(verify_cast<NodeWithStyle>(*layout_node));
  216. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::Before, AppendOrPrepend::Prepend);
  217. create_pseudo_element_if_needed(element, CSS::Selector::PseudoElement::After, AppendOrPrepend::Append);
  218. pop_parent();
  219. }
  220. if (is<ListItemBox>(*layout_node)) {
  221. auto& element = static_cast<DOM::Element&>(dom_node);
  222. int child_index = layout_node->parent()->index_of_child<ListItemBox>(*layout_node).value();
  223. auto marker_style = style_computer.compute_style(element, CSS::Selector::PseudoElement::Marker);
  224. auto list_item_marker = adopt_ref(*new ListItemMarkerBox(document, layout_node->computed_values().list_style_type(), child_index + 1, *marker_style));
  225. static_cast<ListItemBox&>(*layout_node).set_marker(list_item_marker);
  226. element.set_pseudo_element_node({}, CSS::Selector::PseudoElement::Marker, list_item_marker);
  227. layout_node->append_child(move(list_item_marker));
  228. }
  229. if (is<HTML::HTMLProgressElement>(dom_node)) {
  230. auto& progress = static_cast<HTML::HTMLProgressElement&>(dom_node);
  231. if (!progress.using_system_appearance()) {
  232. auto bar_style = style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressBar);
  233. auto value_style = style_computer.compute_style(progress, CSS::Selector::PseudoElement::ProgressValue);
  234. auto position = progress.position();
  235. value_style->set_property(CSS::PropertyID::Width, CSS::PercentageStyleValue::create(CSS::Percentage(position >= 0 ? round_to<int>(100 * position) : 0)));
  236. auto progress_bar = adopt_ref(*new Layout::BlockContainer(document, nullptr, bar_style));
  237. auto progress_value = adopt_ref(*new Layout::BlockContainer(document, nullptr, value_style));
  238. progress_bar->append_child(*progress_value);
  239. layout_node->append_child(*progress_bar);
  240. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressBar, progress_bar);
  241. progress.set_pseudo_element_node({}, CSS::Selector::PseudoElement::ProgressValue, progress_value);
  242. }
  243. }
  244. }
  245. RefPtr<Node> TreeBuilder::build(DOM::Node& dom_node)
  246. {
  247. VERIFY(dom_node.is_document());
  248. Context context;
  249. create_layout_tree(dom_node, context);
  250. if (auto* root = dom_node.document().layout_node())
  251. fixup_tables(*root);
  252. return move(m_layout_root);
  253. }
  254. template<CSS::Display::Internal internal, typename Callback>
  255. void TreeBuilder::for_each_in_tree_with_internal_display(NodeWithStyle& root, Callback callback)
  256. {
  257. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  258. auto const display = box.display();
  259. if (display.is_internal() && display.internal() == internal)
  260. callback(box);
  261. return IterationDecision::Continue;
  262. });
  263. }
  264. template<CSS::Display::Inside inside, typename Callback>
  265. void TreeBuilder::for_each_in_tree_with_inside_display(NodeWithStyle& root, Callback callback)
  266. {
  267. root.for_each_in_inclusive_subtree_of_type<Box>([&](auto& box) {
  268. auto const display = box.display();
  269. if (display.is_outside_and_inside() && display.inside() == inside)
  270. callback(box);
  271. return IterationDecision::Continue;
  272. });
  273. }
  274. void TreeBuilder::fixup_tables(NodeWithStyle& root)
  275. {
  276. remove_irrelevant_boxes(root);
  277. generate_missing_child_wrappers(root);
  278. generate_missing_parents(root);
  279. }
  280. void TreeBuilder::remove_irrelevant_boxes(NodeWithStyle& root)
  281. {
  282. // The following boxes are discarded as if they were display:none:
  283. NonnullRefPtrVector<Node> to_remove;
  284. // Children of a table-column.
  285. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumn>(root, [&](Box& table_column) {
  286. table_column.for_each_child([&](auto& child) {
  287. to_remove.append(child);
  288. });
  289. });
  290. // Children of a table-column-group which are not a table-column.
  291. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableColumnGroup>(root, [&](Box& table_column_group) {
  292. table_column_group.for_each_child([&](auto& child) {
  293. if (child.display().is_table_column())
  294. to_remove.append(child);
  295. });
  296. });
  297. // FIXME:
  298. // Anonymous inline boxes which contain only white space and are between two immediate siblings each of which is a table-non-root box.
  299. // Anonymous inline boxes which meet all of the following criteria:
  300. // - they contain only white space
  301. // - they are the first and/or last child of a tabular container
  302. // - whose immediate sibling, if any, is a table-non-root box
  303. for (auto& box : to_remove)
  304. box.parent()->remove_child(box);
  305. }
  306. static bool is_table_track(CSS::Display display)
  307. {
  308. return display.is_table_row() || display.is_table_column();
  309. }
  310. static bool is_table_track_group(CSS::Display display)
  311. {
  312. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  313. // table-header-groups and table-footer-groups.
  314. return display.is_table_row_group()
  315. || display.is_table_header_group()
  316. || display.is_table_footer_group()
  317. || display.is_table_column_group();
  318. }
  319. static bool is_not_proper_table_child(Node const& node)
  320. {
  321. if (!node.has_style())
  322. return true;
  323. auto const display = node.display();
  324. return !is_table_track_group(display) && !is_table_track(display) && !display.is_table_caption();
  325. }
  326. static bool is_not_table_row(Node const& node)
  327. {
  328. if (!node.has_style())
  329. return true;
  330. auto const display = node.display();
  331. return !display.is_table_row();
  332. }
  333. static bool is_not_table_cell(Node const& node)
  334. {
  335. if (!node.has_style())
  336. return true;
  337. auto const display = node.display();
  338. return !display.is_table_cell();
  339. }
  340. static bool is_ignorable_whitespace(Layout::Node const& node)
  341. {
  342. if (node.is_text_node() && static_cast<TextNode const&>(node).text_for_rendering().is_whitespace())
  343. return true;
  344. if (node.is_anonymous() && node.is_block_container() && static_cast<BlockContainer const&>(node).children_are_inline()) {
  345. bool contains_only_white_space = true;
  346. node.for_each_in_inclusive_subtree_of_type<TextNode>([&contains_only_white_space](auto& text_node) {
  347. if (!text_node.text_for_rendering().is_whitespace()) {
  348. contains_only_white_space = false;
  349. return IterationDecision::Break;
  350. }
  351. return IterationDecision::Continue;
  352. });
  353. if (contains_only_white_space)
  354. return true;
  355. }
  356. return false;
  357. }
  358. template<typename Matcher, typename Callback>
  359. static void for_each_sequence_of_consecutive_children_matching(NodeWithStyle& parent, Matcher matcher, Callback callback)
  360. {
  361. NonnullRefPtrVector<Node> sequence;
  362. auto sequence_is_all_ignorable_whitespace = [&]() -> bool {
  363. for (auto& node : sequence) {
  364. if (!is_ignorable_whitespace(node))
  365. return false;
  366. }
  367. return true;
  368. };
  369. Node* next_sibling = nullptr;
  370. for (auto* child = parent.first_child(); child; child = next_sibling) {
  371. next_sibling = child->next_sibling();
  372. if (matcher(*child)) {
  373. sequence.append(*child);
  374. } else {
  375. if (!sequence.is_empty()) {
  376. if (!sequence_is_all_ignorable_whitespace())
  377. callback(sequence, next_sibling);
  378. sequence.clear();
  379. }
  380. }
  381. }
  382. if (sequence.is_empty() && !sequence_is_all_ignorable_whitespace())
  383. callback(sequence, nullptr);
  384. }
  385. template<typename WrapperBoxType>
  386. static void wrap_in_anonymous(NonnullRefPtrVector<Node>& sequence, Node* nearest_sibling)
  387. {
  388. VERIFY(!sequence.is_empty());
  389. auto& parent = *sequence.first().parent();
  390. auto computed_values = parent.computed_values().clone_inherited_values();
  391. static_cast<CSS::MutableComputedValues&>(computed_values).set_display(WrapperBoxType::static_display());
  392. auto wrapper = adopt_ref(*new WrapperBoxType(parent.document(), nullptr, move(computed_values)));
  393. for (auto& child : sequence) {
  394. parent.remove_child(child);
  395. wrapper->append_child(child);
  396. }
  397. if (nearest_sibling)
  398. parent.insert_before(move(wrapper), *nearest_sibling);
  399. else
  400. parent.append_child(move(wrapper));
  401. }
  402. void TreeBuilder::generate_missing_child_wrappers(NodeWithStyle& root)
  403. {
  404. // 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.
  405. for_each_in_tree_with_inside_display<CSS::Display::Inside::Table>(root, [&](auto& parent) {
  406. for_each_sequence_of_consecutive_children_matching(parent, is_not_proper_table_child, [&](auto sequence, auto nearest_sibling) {
  407. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  408. });
  409. });
  410. // 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.
  411. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRowGroup>(root, [&](auto& parent) {
  412. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  413. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  414. });
  415. });
  416. // Unless explicitly mentioned otherwise, mentions of table-row-groups in this spec also encompass the specialized
  417. // table-header-groups and table-footer-groups.
  418. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableHeaderGroup>(root, [&](auto& parent) {
  419. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  420. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  421. });
  422. });
  423. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableFooterGroup>(root, [&](auto& parent) {
  424. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_row, [&](auto& sequence, auto nearest_sibling) {
  425. wrap_in_anonymous<TableRowBox>(sequence, nearest_sibling);
  426. });
  427. });
  428. // 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
  429. for_each_in_tree_with_internal_display<CSS::Display::Internal::TableRow>(root, [&](auto& parent) {
  430. for_each_sequence_of_consecutive_children_matching(parent, is_not_table_cell, [&](auto& sequence, auto nearest_sibling) {
  431. wrap_in_anonymous<TableCellBox>(sequence, nearest_sibling);
  432. });
  433. });
  434. }
  435. void TreeBuilder::generate_missing_parents(NodeWithStyle&)
  436. {
  437. // FIXME: Implement.
  438. }
  439. }