StyleSheetNode.cpp 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316
  1. /*
  2. * This source file is part of RmlUi, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://github.com/mikke89/RmlUi
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. * Copyright (c) 2019 The RmlUi Team, and contributors
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. *
  27. */
  28. #include "StyleSheetNode.h"
  29. #include "../../Include/RmlUi/Core/Element.h"
  30. #include "../../Include/RmlUi/Core/Profiling.h"
  31. #include "StyleSheetFactory.h"
  32. #include "StyleSheetNodeSelector.h"
  33. #include <algorithm>
  34. namespace Rml {
  35. StyleSheetNode::StyleSheetNode()
  36. {
  37. CalculateAndSetSpecificity();
  38. }
  39. StyleSheetNode::StyleSheetNode(StyleSheetNode* parent, const String& tag, const String& id, const StringList& classes, const StringList& pseudo_classes, const StructuralSelectorList& structural_selectors, bool child_combinator)
  40. : parent(parent), tag(tag), id(id), class_names(classes), pseudo_class_names(pseudo_classes), structural_selectors(structural_selectors), child_combinator(child_combinator)
  41. {
  42. CalculateAndSetSpecificity();
  43. }
  44. StyleSheetNode::StyleSheetNode(StyleSheetNode* parent, String&& tag, String&& id, StringList&& classes, StringList&& pseudo_classes, StructuralSelectorList&& structural_selectors, bool child_combinator)
  45. : parent(parent), tag(std::move(tag)), id(std::move(id)), class_names(std::move(classes)), pseudo_class_names(std::move(pseudo_classes)), structural_selectors(std::move(structural_selectors)), child_combinator(child_combinator)
  46. {
  47. CalculateAndSetSpecificity();
  48. }
  49. StyleSheetNode* StyleSheetNode::GetOrCreateChildNode(const StyleSheetNode& other)
  50. {
  51. // See if we match the target child
  52. for (const auto& child : children)
  53. {
  54. if (child->EqualRequirements(other.tag, other.id, other.class_names, other.pseudo_class_names, other.structural_selectors, other.child_combinator))
  55. return child.get();
  56. }
  57. // We don't, so create a new child
  58. auto child = MakeUnique<StyleSheetNode>(this, other.tag, other.id, other.class_names, other.pseudo_class_names, other.structural_selectors, other.child_combinator);
  59. StyleSheetNode* result = child.get();
  60. children.push_back(std::move(child));
  61. return result;
  62. }
  63. StyleSheetNode* StyleSheetNode::GetOrCreateChildNode(String&& tag, String&& id, StringList&& classes, StringList&& pseudo_classes, StructuralSelectorList&& structural_pseudo_classes, bool child_combinator)
  64. {
  65. // See if we match an existing child
  66. for (const auto& child : children)
  67. {
  68. if (child->EqualRequirements(tag, id, classes, pseudo_classes, structural_pseudo_classes, child_combinator))
  69. return child.get();
  70. }
  71. // We don't, so create a new child
  72. auto child = MakeUnique<StyleSheetNode>(this, std::move(tag), std::move(id), std::move(classes), std::move(pseudo_classes), std::move(structural_pseudo_classes), child_combinator);
  73. StyleSheetNode* result = child.get();
  74. children.push_back(std::move(child));
  75. return result;
  76. }
  77. // Merges an entire tree hierarchy into our hierarchy.
  78. void StyleSheetNode::MergeHierarchy(StyleSheetNode* node, int specificity_offset)
  79. {
  80. RMLUI_ZoneScoped;
  81. // Merge the other node's properties into ours.
  82. properties.Merge(node->properties, specificity_offset);
  83. for (const auto& other_child : node->children)
  84. {
  85. StyleSheetNode* local_node = GetOrCreateChildNode(*other_child);
  86. local_node->MergeHierarchy(other_child.get(), specificity_offset);
  87. }
  88. }
  89. UniquePtr<StyleSheetNode> StyleSheetNode::DeepCopy(StyleSheetNode* in_parent) const
  90. {
  91. RMLUI_ZoneScoped;
  92. auto node = MakeUnique<StyleSheetNode>(in_parent, tag, id, class_names, pseudo_class_names, structural_selectors, child_combinator);
  93. node->properties = properties;
  94. node->children.resize(children.size());
  95. for (size_t i = 0; i < children.size(); i++)
  96. {
  97. node->children[i] = children[i]->DeepCopy(node.get());
  98. }
  99. return node;
  100. }
  101. // Builds up a style sheet's index recursively.
  102. void StyleSheetNode::BuildIndex(StyleSheet::NodeIndex& styled_node_index) const
  103. {
  104. // If this has properties defined, then we insert it into the styled node index.
  105. if(properties.GetNumProperties() > 0)
  106. {
  107. // The keys of the node index is a hashed combination of tag and id. These are used for fast lookup of applicable nodes.
  108. size_t node_hash = StyleSheet::NodeHash(tag, id);
  109. StyleSheet::NodeList& nodes = styled_node_index[node_hash];
  110. auto it = std::find(nodes.begin(), nodes.end(), this);
  111. if(it == nodes.end())
  112. nodes.push_back(this);
  113. }
  114. for (auto& child : children)
  115. {
  116. child->BuildIndex(styled_node_index);
  117. }
  118. }
  119. bool StyleSheetNode::SetStructurallyVolatileRecursive(bool ancestor_is_structural_pseudo_class)
  120. {
  121. // If any ancestor or descendant is a structural pseudo class, then we are structurally volatile.
  122. bool self_is_structural_pseudo_class = (!structural_selectors.empty());
  123. // Check our children for structural pseudo-classes.
  124. bool descendant_is_structural_pseudo_class = false;
  125. for (auto& child : children)
  126. {
  127. if (child->SetStructurallyVolatileRecursive(self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class))
  128. descendant_is_structural_pseudo_class = true;
  129. }
  130. is_structurally_volatile = (self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  131. return (self_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  132. }
  133. bool StyleSheetNode::EqualRequirements(const String& _tag, const String& _id, const StringList& _class_names, const StringList& _pseudo_class_names, const StructuralSelectorList& _structural_selectors, bool _child_combinator) const
  134. {
  135. if (tag != _tag)
  136. return false;
  137. if (id != _id)
  138. return false;
  139. if (class_names != _class_names)
  140. return false;
  141. if (pseudo_class_names != _pseudo_class_names)
  142. return false;
  143. if (structural_selectors != _structural_selectors)
  144. return false;
  145. if (child_combinator != _child_combinator)
  146. return false;
  147. return true;
  148. }
  149. // Returns the specificity of this node.
  150. int StyleSheetNode::GetSpecificity() const
  151. {
  152. return specificity;
  153. }
  154. // Imports properties from a single rule definition (ie, with a shared specificity) into the node's
  155. // properties.
  156. void StyleSheetNode::ImportProperties(const PropertyDictionary& _properties, int rule_specificity)
  157. {
  158. properties.Import(_properties, specificity + rule_specificity);
  159. }
  160. // Returns the node's default properties.
  161. const PropertyDictionary& StyleSheetNode::GetProperties() const
  162. {
  163. return properties;
  164. }
  165. inline bool StyleSheetNode::Match(const Element* element) const
  166. {
  167. if (!tag.empty() && tag != element->GetTagName())
  168. return false;
  169. if (!id.empty() && id != element->GetId())
  170. return false;
  171. if (!MatchClassPseudoClass(element))
  172. return false;
  173. if (!MatchStructuralSelector(element))
  174. return false;
  175. return true;
  176. }
  177. inline bool StyleSheetNode::MatchClassPseudoClass(const Element* element) const
  178. {
  179. for (auto& name : class_names)
  180. {
  181. if (!element->IsClassSet(name))
  182. return false;
  183. }
  184. for (auto& name : pseudo_class_names)
  185. {
  186. if (!element->IsPseudoClassSet(name))
  187. return false;
  188. }
  189. return true;
  190. }
  191. inline bool StyleSheetNode::MatchStructuralSelector(const Element* element) const
  192. {
  193. for (auto& node_selector : structural_selectors)
  194. {
  195. if (!node_selector.selector->IsApplicable(element, node_selector.a, node_selector.b))
  196. return false;
  197. }
  198. return true;
  199. }
  200. // Returns true if this node is applicable to the given element, given its IDs, classes and heritage.
  201. bool StyleSheetNode::IsApplicable(const Element* const in_element, bool skip_id_tag) const
  202. {
  203. // Determine whether the element matches the current node and its entire lineage. The entire hierarchy of
  204. // the element's document will be considered during the match as necessary.
  205. if (skip_id_tag)
  206. {
  207. // Id and tag have already been checked, only check class and pseudo class.
  208. if (!MatchClassPseudoClass(in_element))
  209. return false;
  210. }
  211. else
  212. {
  213. // Id and tag have not already been matched, match everything.
  214. if (!Match(in_element))
  215. return false;
  216. }
  217. const Element* element = in_element;
  218. // Walk up through all our parent nodes, each one of them must be matched by some ancestor element.
  219. for(const StyleSheetNode* node = parent; node && node->parent; node = node->parent)
  220. {
  221. // Try a match on every element ancestor. If it succeeds, we continue on to the next node.
  222. for(element = element->GetParentNode(); element; element = element->GetParentNode())
  223. {
  224. if (node->Match(element))
  225. break;
  226. // If we have a child combinator on the node, we must match this first ancestor.
  227. else if (node->child_combinator)
  228. return false;
  229. }
  230. // We have run out of element ancestors before we matched every node. Bail out.
  231. if (!element)
  232. return false;
  233. }
  234. // Finally, check the structural selector requirements last as they can be quite slow.
  235. if (!MatchStructuralSelector(in_element))
  236. return false;
  237. return true;
  238. }
  239. bool StyleSheetNode::IsStructurallyVolatile() const
  240. {
  241. return is_structurally_volatile;
  242. }
  243. void StyleSheetNode::CalculateAndSetSpecificity()
  244. {
  245. // Calculate the specificity of just this node; tags are worth 10,000, IDs 1,000,000 and other specifiers (classes
  246. // and pseudo-classes) 100,000.
  247. specificity = 0;
  248. if (!tag.empty())
  249. specificity += 10'000;
  250. if (!id.empty())
  251. specificity += 1'000'000;
  252. specificity += 100'000*(int)class_names.size();
  253. specificity += 100'000*(int)pseudo_class_names.size();
  254. specificity += 100'000*(int)structural_selectors.size();
  255. // Add our parent's specificity onto ours.
  256. if (parent)
  257. specificity += parent->specificity;
  258. }
  259. } // namespace Rml