StyleSheetNode.cpp 11 KB

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