StyleSheetNode.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346
  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. bool StyleSheetNode::MergeHierarchy(StyleSheetNode* node, int specificity_offset)
  79. {
  80. // Merge the other node's properties into ours.
  81. properties.Merge(node->properties, specificity_offset);
  82. for (const auto& other_child : node->children)
  83. {
  84. StyleSheetNode* local_node = GetOrCreateChildNode(*other_child);
  85. local_node->MergeHierarchy(other_child.get(), specificity_offset);
  86. }
  87. return true;
  88. }
  89. // Builds up a style sheet's index recursively.
  90. void StyleSheetNode::BuildIndex(StyleSheet::NodeIndex& styled_node_index)
  91. {
  92. // If this has properties defined, then we insert it into the styled node index.
  93. if(properties.GetNumProperties() > 0)
  94. {
  95. // The keys of the node index is a hashed combination of tag and id. These are used for fast lookup of applicable nodes.
  96. size_t node_hash = StyleSheet::NodeHash(tag, id);
  97. StyleSheet::NodeList& nodes = styled_node_index[node_hash];
  98. auto it = std::find(nodes.begin(), nodes.end(), this);
  99. if(it == nodes.end())
  100. nodes.push_back(this);
  101. }
  102. for (auto& child : children)
  103. {
  104. child->BuildIndex(styled_node_index);
  105. }
  106. }
  107. // Builds up a style sheet's index recursively.
  108. void StyleSheetNode::OptimizeProperties(const StyleSheet& style_sheet)
  109. {
  110. // Turn any decorator and font-effect properties from String to DecoratorList / FontEffectList.
  111. // This is essentially an optimization, it will work fine to skip this step and let ElementStyle::ComputeValues() do all the work.
  112. // However, when we do it here, we only need to do it once.
  113. if (properties.GetNumProperties() > 0)
  114. {
  115. // Decorators
  116. if (const Property* property = properties.GetProperty(PropertyId::Decorator))
  117. {
  118. if (property->unit == Property::STRING)
  119. {
  120. const String string_value = property->Get<String>();
  121. if (DecoratorsPtr decorators = style_sheet.InstanceDecoratorsFromString(string_value, property->source))
  122. {
  123. Property new_property = *property;
  124. new_property.value = std::move(decorators);
  125. new_property.unit = Property::DECORATOR;
  126. properties.SetProperty(PropertyId::Decorator, new_property);
  127. }
  128. }
  129. }
  130. // Font-effects
  131. if (const Property* property = properties.GetProperty(PropertyId::FontEffect))
  132. {
  133. if (property->unit == Property::STRING)
  134. {
  135. const String string_value = property->Get<String>();
  136. FontEffectsPtr font_effects = style_sheet.InstanceFontEffectsFromString(string_value, property->source);
  137. Property new_property = *property;
  138. new_property.value = std::move(font_effects);
  139. new_property.unit = Property::FONTEFFECT;
  140. properties.SetProperty(PropertyId::FontEffect, new_property);
  141. }
  142. }
  143. }
  144. for (const auto& child : children)
  145. {
  146. child->OptimizeProperties(style_sheet);
  147. }
  148. }
  149. bool StyleSheetNode::SetStructurallyVolatileRecursive(bool ancestor_is_structural_pseudo_class)
  150. {
  151. // If any ancestor or descendant is a structural pseudo class, then we are structurally volatile.
  152. bool self_is_structural_pseudo_class = (!structural_selectors.empty());
  153. // Check our children for structural pseudo-classes.
  154. bool descendant_is_structural_pseudo_class = false;
  155. for (auto& child : children)
  156. {
  157. if (child->SetStructurallyVolatileRecursive(self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class))
  158. descendant_is_structural_pseudo_class = true;
  159. }
  160. is_structurally_volatile = (self_is_structural_pseudo_class || ancestor_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  161. return (self_is_structural_pseudo_class || descendant_is_structural_pseudo_class);
  162. }
  163. 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
  164. {
  165. if (tag != _tag)
  166. return false;
  167. if (id != _id)
  168. return false;
  169. if (class_names != _class_names)
  170. return false;
  171. if (pseudo_class_names != _pseudo_class_names)
  172. return false;
  173. if (structural_selectors != _structural_selectors)
  174. return false;
  175. if (child_combinator != _child_combinator)
  176. return false;
  177. return true;
  178. }
  179. // Returns the specificity of this node.
  180. int StyleSheetNode::GetSpecificity() const
  181. {
  182. return specificity;
  183. }
  184. // Imports properties from a single rule definition (ie, with a shared specificity) into the node's
  185. // properties.
  186. void StyleSheetNode::ImportProperties(const PropertyDictionary& _properties, int rule_specificity)
  187. {
  188. properties.Import(_properties, specificity + rule_specificity);
  189. }
  190. // Returns the node's default properties.
  191. const PropertyDictionary& StyleSheetNode::GetProperties() const
  192. {
  193. return properties;
  194. }
  195. inline bool StyleSheetNode::Match(const Element* element) const
  196. {
  197. if (!tag.empty() && tag != element->GetTagName())
  198. return false;
  199. if (!id.empty() && id != element->GetId())
  200. return false;
  201. if (!MatchClassPseudoClass(element))
  202. return false;
  203. if (!MatchStructuralSelector(element))
  204. return false;
  205. return true;
  206. }
  207. inline bool StyleSheetNode::MatchClassPseudoClass(const Element* element) const
  208. {
  209. for (auto& name : class_names)
  210. {
  211. if (!element->IsClassSet(name))
  212. return false;
  213. }
  214. for (auto& name : pseudo_class_names)
  215. {
  216. if (!element->IsPseudoClassSet(name))
  217. return false;
  218. }
  219. return true;
  220. }
  221. inline bool StyleSheetNode::MatchStructuralSelector(const Element* element) const
  222. {
  223. for (auto& node_selector : structural_selectors)
  224. {
  225. if (!node_selector.selector->IsApplicable(element, node_selector.a, node_selector.b))
  226. return false;
  227. }
  228. return true;
  229. }
  230. // Returns true if this node is applicable to the given element, given its IDs, classes and heritage.
  231. bool StyleSheetNode::IsApplicable(const Element* const in_element, bool skip_id_tag) const
  232. {
  233. // Determine whether the element matches the current node and its entire lineage. The entire hierarchy of
  234. // the element's document will be considered during the match as necessary.
  235. if (skip_id_tag)
  236. {
  237. // Id and tag have already been checked, only check class and pseudo class.
  238. if (!MatchClassPseudoClass(in_element))
  239. return false;
  240. }
  241. else
  242. {
  243. // Id and tag have not already been matched, match everything.
  244. if (!Match(in_element))
  245. return false;
  246. }
  247. const Element* element = in_element;
  248. // Walk up through all our parent nodes, each one of them must be matched by some ancestor element.
  249. for(const StyleSheetNode* node = parent; node && node->parent; node = node->parent)
  250. {
  251. // Try a match on every element ancestor. If it succeeds, we continue on to the next node.
  252. for(element = element->GetParentNode(); element; element = element->GetParentNode())
  253. {
  254. if (node->Match(element))
  255. break;
  256. // If we have a child combinator on the node, we must match this first ancestor.
  257. else if (node->child_combinator)
  258. return false;
  259. }
  260. // We have run out of element ancestors before we matched every node. Bail out.
  261. if (!element)
  262. return false;
  263. }
  264. // Finally, check the structural selector requirements last as they can be quite slow.
  265. if (!MatchStructuralSelector(in_element))
  266. return false;
  267. return true;
  268. }
  269. bool StyleSheetNode::IsStructurallyVolatile() const
  270. {
  271. return is_structurally_volatile;
  272. }
  273. void StyleSheetNode::CalculateAndSetSpecificity()
  274. {
  275. // Calculate the specificity of just this node; tags are worth 10,000, IDs 1,000,000 and other specifiers (classes
  276. // and pseudo-classes) 100,000.
  277. specificity = 0;
  278. if (!tag.empty())
  279. specificity += 10'000;
  280. if (!id.empty())
  281. specificity += 1'000'000;
  282. specificity += 100'000*(int)class_names.size();
  283. specificity += 100'000*(int)pseudo_class_names.size();
  284. specificity += 100'000*(int)structural_selectors.size();
  285. // Add our parent's specificity onto ours.
  286. if (parent)
  287. specificity += parent->specificity;
  288. }
  289. } // namespace Rml