SelectorEngine.cpp 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <LibHTML/CSS/SelectorEngine.h>
  27. #include <LibHTML/DOM/Document.h>
  28. #include <LibHTML/DOM/Element.h>
  29. #include <LibHTML/DOM/Text.h>
  30. namespace SelectorEngine {
  31. static bool matches_hover_pseudo_class(const Element& element)
  32. {
  33. auto* hovered_node = element.document().hovered_node();
  34. if (!hovered_node)
  35. return false;
  36. if (&element == hovered_node)
  37. return true;
  38. return element.is_ancestor_of(*hovered_node);
  39. }
  40. bool matches(const Selector::SimpleSelector& component, const Element& element)
  41. {
  42. switch (component.pseudo_class) {
  43. case Selector::SimpleSelector::PseudoClass::None:
  44. break;
  45. case Selector::SimpleSelector::PseudoClass::Link:
  46. if (!element.is_link())
  47. return false;
  48. break;
  49. case Selector::SimpleSelector::PseudoClass::Hover:
  50. if (!matches_hover_pseudo_class(element))
  51. return false;
  52. break;
  53. case Selector::SimpleSelector::PseudoClass::FirstChild:
  54. if (element.previous_element_sibling())
  55. return false;
  56. break;
  57. case Selector::SimpleSelector::PseudoClass::LastChild:
  58. if (element.next_element_sibling())
  59. return false;
  60. break;
  61. case Selector::SimpleSelector::PseudoClass::OnlyChild:
  62. if (element.previous_element_sibling() || element.next_element_sibling())
  63. return false;
  64. break;
  65. case Selector::SimpleSelector::PseudoClass::Empty:
  66. if (element.first_child_of_type<Element>() || element.first_child_of_type<Text>())
  67. return false;
  68. break;
  69. }
  70. switch (component.attribute_match_type) {
  71. case Selector::SimpleSelector::AttributeMatchType::HasAttribute:
  72. if (!element.has_attribute(component.attribute_name))
  73. return false;
  74. break;
  75. case Selector::SimpleSelector::AttributeMatchType::ExactValueMatch:
  76. if (element.attribute(component.attribute_name) != component.attribute_value)
  77. return false;
  78. break;
  79. default:
  80. break;
  81. }
  82. switch (component.type) {
  83. case Selector::SimpleSelector::Type::Universal:
  84. return true;
  85. case Selector::SimpleSelector::Type::Id:
  86. return component.value == element.attribute("id");
  87. case Selector::SimpleSelector::Type::Class:
  88. return element.has_class(component.value);
  89. case Selector::SimpleSelector::Type::TagName:
  90. return component.value == element.tag_name();
  91. default:
  92. ASSERT_NOT_REACHED();
  93. }
  94. }
  95. bool matches(const Selector& selector, int component_list_index, const Element& element)
  96. {
  97. auto& component_list = selector.complex_selectors()[component_list_index];
  98. for (auto& component : component_list.compound_selector) {
  99. if (!matches(component, element))
  100. return false;
  101. }
  102. switch (component_list.relation) {
  103. case Selector::ComplexSelector::Relation::None:
  104. return true;
  105. case Selector::ComplexSelector::Relation::Descendant:
  106. ASSERT(component_list_index != 0);
  107. for (auto* ancestor = element.parent(); ancestor; ancestor = ancestor->parent()) {
  108. if (!is<Element>(*ancestor))
  109. continue;
  110. if (matches(selector, component_list_index - 1, to<Element>(*ancestor)))
  111. return true;
  112. }
  113. return false;
  114. case Selector::ComplexSelector::Relation::ImmediateChild:
  115. ASSERT(component_list_index != 0);
  116. if (!element.parent() || !is<Element>(*element.parent()))
  117. return false;
  118. return matches(selector, component_list_index - 1, to<Element>(*element.parent()));
  119. case Selector::ComplexSelector::Relation::AdjacentSibling:
  120. ASSERT(component_list_index != 0);
  121. if (auto* sibling = element.previous_element_sibling())
  122. return matches(selector, component_list_index - 1, *sibling);
  123. return false;
  124. case Selector::ComplexSelector::Relation::GeneralSibling:
  125. ASSERT(component_list_index != 0);
  126. for (auto* sibling = element.previous_element_sibling(); sibling; sibling = sibling->previous_element_sibling()) {
  127. if (matches(selector, component_list_index - 1, *sibling))
  128. return true;
  129. }
  130. return false;
  131. }
  132. ASSERT_NOT_REACHED();
  133. }
  134. bool matches(const Selector& selector, const Element& element)
  135. {
  136. ASSERT(!selector.complex_selectors().is_empty());
  137. return matches(selector, selector.complex_selectors().size() - 1, element);
  138. }
  139. }