StyleSheetNode.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334
  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. namespace Core {
  36. StyleSheetNode::StyleSheetNode()
  37. {
  38. CalculateAndSetSpecificity();
  39. }
  40. StyleSheetNode::StyleSheetNode(StyleSheetNode* parent, const String& tag, const String& id, const StringList& classes, const StringList& pseudo_classes, const StructuralSelectorList& structural_selectors, bool child_combinator)
  41. : parent(parent), tag(tag), id(id), class_names(classes), pseudo_class_names(pseudo_classes), structural_selectors(structural_selectors), child_combinator(child_combinator)
  42. {
  43. CalculateAndSetSpecificity();
  44. }
  45. StyleSheetNode::StyleSheetNode(StyleSheetNode* parent, String&& tag, String&& id, StringList&& classes, StringList&& pseudo_classes, StructuralSelectorList&& structural_selectors, bool child_combinator)
  46. : 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)
  47. {
  48. CalculateAndSetSpecificity();
  49. }
  50. StyleSheetNode* StyleSheetNode::GetOrCreateChildNode(const StyleSheetNode& other)
  51. {
  52. // See if we match the target child
  53. for (const auto& child : children)
  54. {
  55. if (child->EqualRequirements(other.tag, other.id, other.class_names, other.pseudo_class_names, other.structural_selectors, other.child_combinator))
  56. return child.get();
  57. }
  58. // We don't, so create a new child
  59. auto child = std::make_unique<StyleSheetNode>(this, other.tag, other.id, other.class_names, other.pseudo_class_names, other.structural_selectors, other.child_combinator);
  60. StyleSheetNode* result = child.get();
  61. children.push_back(std::move(child));
  62. return result;
  63. }
  64. StyleSheetNode* StyleSheetNode::GetOrCreateChildNode(String&& tag, String&& id, StringList&& classes, StringList&& pseudo_classes, StructuralSelectorList&& structural_pseudo_classes, bool child_combinator)
  65. {
  66. // See if we match an existing child
  67. for (const auto& child : children)
  68. {
  69. if (child->EqualRequirements(tag, id, classes, pseudo_classes, structural_pseudo_classes, child_combinator))
  70. return child.get();
  71. }
  72. // We don't, so create a new child
  73. auto child = std::make_unique<StyleSheetNode>(this, std::move(tag), std::move(id), std::move(classes), std::move(pseudo_classes), std::move(structural_pseudo_classes), child_combinator);
  74. StyleSheetNode* result = child.get();
  75. children.push_back(std::move(child));
  76. return result;
  77. }
  78. // Merges an entire tree hierarchy into our hierarchy.
  79. bool StyleSheetNode::MergeHierarchy(StyleSheetNode* node, int specificity_offset)
  80. {
  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. return true;
  89. }
  90. // Builds up a style sheet's index recursively.
  91. void StyleSheetNode::BuildIndexAndOptimizeProperties(StyleSheet::NodeIndex& styled_node_index, const StyleSheet& style_sheet)
  92. {
  93. RMLUI_ZoneScoped;
  94. // If this has properties defined, then we insert it into the styled node index.
  95. if(properties.GetNumProperties() > 0)
  96. {
  97. // The keys of the node index is a hashed combination of tag and id. These are used for fast lookup of applicable nodes.
  98. size_t node_hash = StyleSheet::NodeHash(tag, id);
  99. StyleSheet::NodeList& nodes = styled_node_index[node_hash];
  100. auto it = std::find(nodes.begin(), nodes.end(), this);
  101. if(it == nodes.end())
  102. nodes.push_back(this);
  103. }
  104. // Turn any decorator and font-effect properties from String to DecoratorList / FontEffectList.
  105. // This is essentially an optimization, it will work fine to skip this step and let ElementStyle::ComputeValues() do all the work.
  106. // However, when we do it here, we only need to do it once.
  107. // Note, since the user may set a new decorator through its style, we still do the conversion as necessary again in ComputeValues.
  108. if (properties.GetNumProperties() > 0)
  109. {
  110. // Decorators
  111. if (const Property* property = properties.GetProperty(PropertyId::Decorator))
  112. {
  113. if (property->unit == Property::STRING)
  114. {
  115. const String string_value = property->Get<String>();
  116. if(DecoratorsPtr decorators = style_sheet.InstanceDecoratorsFromString(string_value, property->source))
  117. {
  118. Property new_property = *property;
  119. new_property.value = std::move(decorators);
  120. new_property.unit = Property::DECORATOR;
  121. properties.SetProperty(PropertyId::Decorator, new_property);
  122. }
  123. }
  124. }
  125. // Font-effects
  126. if (const Property * property = properties.GetProperty(PropertyId::FontEffect))
  127. {
  128. if (property->unit == Property::STRING)
  129. {
  130. const String string_value = property->Get<String>();
  131. FontEffectsPtr font_effects = style_sheet.InstanceFontEffectsFromString(string_value, property->source);
  132. Property new_property = *property;
  133. new_property.value = std::move(font_effects);
  134. new_property.unit = Property::FONTEFFECT;
  135. properties.SetProperty(PropertyId::FontEffect, new_property);
  136. }
  137. }
  138. }
  139. for (auto& child : children)
  140. {
  141. child->BuildIndexAndOptimizeProperties(styled_node_index, style_sheet);
  142. }
  143. }
  144. bool StyleSheetNode::SetStructurallyVolatileRecursive(bool ancestor_is_structural_pseudo_class)
  145. {
  146. // If any ancestor or descendant is a structural pseudo class, then we are structurally volatile.
  147. bool self_is_structural_pseudo_class = (!structural_selectors.empty());
  148. // Check our children for structural pseudo-classes.
  149. bool descendant_is_structural_pseudo_class = false;
  150. for (auto& child : children)
  151. {
  152. if (child->SetStructurallyVolatileRecursive(self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class))
  153. descendant_is_structural_pseudo_class = true;
  154. }
  155. is_structurally_volatile = (self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  156. return (self_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  157. }
  158. 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
  159. {
  160. if (tag != _tag)
  161. return false;
  162. if (id != _id)
  163. return false;
  164. if (class_names != _class_names)
  165. return false;
  166. if (pseudo_class_names != _pseudo_class_names)
  167. return false;
  168. if (structural_selectors != _structural_selectors)
  169. return false;
  170. if (child_combinator != _child_combinator)
  171. return false;
  172. return true;
  173. }
  174. // Returns the specificity of this node.
  175. int StyleSheetNode::GetSpecificity() const
  176. {
  177. return specificity;
  178. }
  179. // Imports properties from a single rule definition (ie, with a shared specificity) into the node's
  180. // properties.
  181. void StyleSheetNode::ImportProperties(const PropertyDictionary& _properties, int rule_specificity)
  182. {
  183. properties.Import(_properties, specificity + rule_specificity);
  184. }
  185. // Returns the node's default properties.
  186. const PropertyDictionary& StyleSheetNode::GetProperties() const
  187. {
  188. return properties;
  189. }
  190. inline bool StyleSheetNode::Match(const Element* element) const
  191. {
  192. if (!tag.empty() && tag != element->GetTagName())
  193. return false;
  194. if (!id.empty() && id != element->GetId())
  195. return false;
  196. if (!MatchClassPseudoClass(element))
  197. return false;
  198. if (!MatchStructuralSelector(element))
  199. return false;
  200. return true;
  201. }
  202. inline bool StyleSheetNode::MatchClassPseudoClass(const Element* element) const
  203. {
  204. for (auto& name : class_names)
  205. {
  206. if (!element->IsClassSet(name))
  207. return false;
  208. }
  209. for (auto& name : pseudo_class_names)
  210. {
  211. if (!element->IsPseudoClassSet(name))
  212. return false;
  213. }
  214. return true;
  215. }
  216. inline bool StyleSheetNode::MatchStructuralSelector(const Element* element) const
  217. {
  218. for (auto& node_selector : structural_selectors)
  219. {
  220. if (!node_selector.selector->IsApplicable(element, node_selector.a, node_selector.b))
  221. return false;
  222. }
  223. return true;
  224. }
  225. // Returns true if this node is applicable to the given element, given its IDs, classes and heritage.
  226. bool StyleSheetNode::IsApplicable(const Element* const in_element) const
  227. {
  228. // This function is called with an element that matches a style node only with the tag name and id. We have to determine
  229. // here whether or not it also matches the required hierarchy.
  230. // First, check locally for matching class and pseudo class. Id and tag have already been checked in StyleSheet.
  231. if (!MatchClassPseudoClass(in_element))
  232. return false;
  233. const Element* element = in_element;
  234. // Walk up through all our parent nodes, each one of them must be matched by some ancestor element.
  235. for(const StyleSheetNode* node = parent; node && node->parent; node = node->parent)
  236. {
  237. // Try a match on every element ancestor. If it succeeds, we continue on to the next node.
  238. for(element = element->GetParentNode(); element; element = element->GetParentNode())
  239. {
  240. if (node->Match(element))
  241. break;
  242. // If we have a child combinator on the node, we must match this first ancestor.
  243. else if (node->child_combinator)
  244. return false;
  245. }
  246. // We have run out of element ancestors before we matched every node. Bail out.
  247. if (!element)
  248. return false;
  249. }
  250. // Finally, check the structural selector requirements last as they can be quite slow.
  251. if (!MatchStructuralSelector(in_element))
  252. return false;
  253. return true;
  254. }
  255. bool StyleSheetNode::IsStructurallyVolatile() const
  256. {
  257. return is_structurally_volatile;
  258. }
  259. void StyleSheetNode::CalculateAndSetSpecificity()
  260. {
  261. // Calculate the specificity of just this node; tags are worth 10,000, IDs 1,000,000 and other specifiers (classes
  262. // and pseudo-classes) 100,000.
  263. specificity = 0;
  264. if (!tag.empty())
  265. specificity += 10'000;
  266. if (!id.empty())
  267. specificity += 1'000'000;
  268. specificity += 100'000*(int)class_names.size();
  269. specificity += 100'000*(int)pseudo_class_names.size();
  270. specificity += 100'000*(int)structural_selectors.size();
  271. // Add our parent's specificity onto ours.
  272. if (parent)
  273. specificity += parent->specificity;
  274. }
  275. }
  276. }