ElementUtilities.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  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 "../../Include/RmlUi/Core.h"
  29. #include "../../Include/RmlUi/Core/TransformState.h"
  30. #include "../../Include/RmlUi/Core/ElementUtilities.h"
  31. #include <queue>
  32. #include <limits>
  33. #include "LayoutEngine.h"
  34. #include "ElementStyle.h"
  35. namespace Rml {
  36. namespace Core {
  37. // Builds and sets the box for an element.
  38. static void SetBox(Element* element)
  39. {
  40. Element* parent = element->GetParentNode();
  41. RMLUI_ASSERT(parent != nullptr);
  42. Vector2f containing_block = parent->GetBox().GetSize();
  43. containing_block.x -= parent->GetElementScroll()->GetScrollbarSize(ElementScroll::VERTICAL);
  44. containing_block.y -= parent->GetElementScroll()->GetScrollbarSize(ElementScroll::HORIZONTAL);
  45. Box box;
  46. LayoutEngine::BuildBox(box, containing_block, element);
  47. if (element->GetComputedValues().height.type != Style::Height::Auto)
  48. box.SetContent(Vector2f(box.GetSize().x, containing_block.y));
  49. element->SetBox(box);
  50. }
  51. // Positions an element relative to an offset parent.
  52. static void SetElementOffset(Element* element, const Vector2f& offset)
  53. {
  54. Vector2f relative_offset = element->GetParentNode()->GetBox().GetPosition(Box::CONTENT);
  55. relative_offset += offset;
  56. relative_offset.x += element->GetBox().GetEdge(Box::MARGIN, Box::LEFT);
  57. relative_offset.y += element->GetBox().GetEdge(Box::MARGIN, Box::TOP);
  58. element->SetOffset(relative_offset, element->GetParentNode());
  59. }
  60. Element* ElementUtilities::GetElementById(Element* root_element, const String& id)
  61. {
  62. // Breadth first search on elements for the corresponding id
  63. typedef std::queue<Element*> SearchQueue;
  64. SearchQueue search_queue;
  65. search_queue.push(root_element);
  66. while (!search_queue.empty())
  67. {
  68. Element* element = search_queue.front();
  69. search_queue.pop();
  70. if (element->GetId() == id)
  71. {
  72. return element;
  73. }
  74. // Add all children to search
  75. for (int i = 0; i < element->GetNumChildren(); i++)
  76. search_queue.push(element->GetChild(i));
  77. }
  78. return nullptr;
  79. }
  80. void ElementUtilities::GetElementsByTagName(ElementList& elements, Element* root_element, const String& tag)
  81. {
  82. // Breadth first search on elements for the corresponding id
  83. typedef std::queue< Element* > SearchQueue;
  84. SearchQueue search_queue;
  85. for (int i = 0; i < root_element->GetNumChildren(); ++i)
  86. search_queue.push(root_element->GetChild(i));
  87. while (!search_queue.empty())
  88. {
  89. Element* element = search_queue.front();
  90. search_queue.pop();
  91. if (element->GetTagName() == tag)
  92. elements.push_back(element);
  93. // Add all children to search.
  94. for (int i = 0; i < element->GetNumChildren(); i++)
  95. search_queue.push(element->GetChild(i));
  96. }
  97. }
  98. void ElementUtilities::GetElementsByClassName(ElementList& elements, Element* root_element, const String& class_name)
  99. {
  100. // Breadth first search on elements for the corresponding id
  101. typedef std::queue< Element* > SearchQueue;
  102. SearchQueue search_queue;
  103. for (int i = 0; i < root_element->GetNumChildren(); ++i)
  104. search_queue.push(root_element->GetChild(i));
  105. while (!search_queue.empty())
  106. {
  107. Element* element = search_queue.front();
  108. search_queue.pop();
  109. if (element->IsClassSet(class_name))
  110. elements.push_back(element);
  111. // Add all children to search.
  112. for (int i = 0; i < element->GetNumChildren(); i++)
  113. search_queue.push(element->GetChild(i));
  114. }
  115. }
  116. float ElementUtilities::GetDensityIndependentPixelRatio(Element * element)
  117. {
  118. Context* context = element->GetContext();
  119. if (context == nullptr)
  120. return 1.0f;
  121. return context->GetDensityIndependentPixelRatio();
  122. }
  123. // Returns the width of a string rendered within the context of the given element.
  124. int ElementUtilities::GetStringWidth(Element* element, const String& string)
  125. {
  126. FontFaceHandle font_face_handle = element->GetFontFaceHandle();
  127. if (font_face_handle == 0)
  128. return 0;
  129. return GetFontEngineInterface()->GetStringWidth(font_face_handle, string);
  130. }
  131. void ElementUtilities::BindEventAttributes(Element* element)
  132. {
  133. // Check for and instance the on* events
  134. for (const auto& pair: element->GetAttributes())
  135. {
  136. if (pair.first.size() > 2 && pair.first[0] == 'o' && pair.first[1] == 'n')
  137. {
  138. EventListener* listener = Factory::InstanceEventListener(pair.second.Get<String>(), element);
  139. if (listener)
  140. element->AddEventListener(pair.first.substr(2), listener, false);
  141. }
  142. }
  143. }
  144. // Generates the clipping region for an element.
  145. bool ElementUtilities::GetClippingRegion(Vector2i& clip_origin, Vector2i& clip_dimensions, Element* element)
  146. {
  147. clip_origin = Vector2i(-1, -1);
  148. clip_dimensions = Vector2i(-1, -1);
  149. int num_ignored_clips = element->GetClippingIgnoreDepth();
  150. if (num_ignored_clips < 0)
  151. return false;
  152. // Search through the element's ancestors, finding all elements that clip their overflow and have overflow to clip.
  153. // For each that we find, we combine their clipping region with the existing clipping region, and so build up a
  154. // complete clipping region for the element.
  155. Element* clipping_element = element->GetParentNode();
  156. while (clipping_element != nullptr)
  157. {
  158. // Merge the existing clip region with the current clip region if we aren't ignoring clip regions.
  159. if (num_ignored_clips == 0 && clipping_element->IsClippingEnabled())
  160. {
  161. // Ignore nodes that don't clip.
  162. if (clipping_element->GetClientWidth() < clipping_element->GetScrollWidth()
  163. || clipping_element->GetClientHeight() < clipping_element->GetScrollHeight())
  164. {
  165. Vector2f element_origin_f = clipping_element->GetAbsoluteOffset(Box::CONTENT);
  166. Vector2f element_dimensions_f = clipping_element->GetBox().GetSize(Box::CONTENT);
  167. Vector2i element_origin(Math::RealToInteger(element_origin_f.x), Math::RealToInteger(element_origin_f.y));
  168. Vector2i element_dimensions(Math::RealToInteger(element_dimensions_f.x), Math::RealToInteger(element_dimensions_f.y));
  169. if (clip_origin == Vector2i(-1, -1) && clip_dimensions == Vector2i(-1, -1))
  170. {
  171. clip_origin = element_origin;
  172. clip_dimensions = element_dimensions;
  173. }
  174. else
  175. {
  176. Vector2i top_left(Math::Max(clip_origin.x, element_origin.x),
  177. Math::Max(clip_origin.y, element_origin.y));
  178. Vector2i bottom_right(Math::Min(clip_origin.x + clip_dimensions.x, element_origin.x + element_dimensions.x),
  179. Math::Min(clip_origin.y + clip_dimensions.y, element_origin.y + element_dimensions.y));
  180. clip_origin = top_left;
  181. clip_dimensions.x = Math::Max(0, bottom_right.x - top_left.x);
  182. clip_dimensions.y = Math::Max(0, bottom_right.y - top_left.y);
  183. }
  184. }
  185. }
  186. // If this region is meant to clip and we're skipping regions, update the counter.
  187. if (num_ignored_clips > 0)
  188. {
  189. if (clipping_element->IsClippingEnabled())
  190. num_ignored_clips--;
  191. }
  192. // Determine how many clip regions this ancestor ignores, and inherit the value. If this region ignores all
  193. // clipping regions, then we do too.
  194. int clipping_element_ignore_clips = clipping_element->GetClippingIgnoreDepth();
  195. if (clipping_element_ignore_clips < 0)
  196. break;
  197. num_ignored_clips = Math::Max(num_ignored_clips, clipping_element_ignore_clips);
  198. // Climb the tree to this region's parent.
  199. clipping_element = clipping_element->GetParentNode();
  200. }
  201. return clip_dimensions.x >= 0 && clip_dimensions.y >= 0;
  202. }
  203. // Sets the clipping region from an element and its ancestors.
  204. bool ElementUtilities::SetClippingRegion(Element* element, Context* context)
  205. {
  206. Rml::Core::RenderInterface* render_interface = nullptr;
  207. if (element)
  208. {
  209. render_interface = element->GetRenderInterface();
  210. if (!context)
  211. context = element->GetContext();
  212. }
  213. else if (context)
  214. {
  215. render_interface = context->GetRenderInterface();
  216. if (!render_interface)
  217. render_interface = GetRenderInterface();
  218. }
  219. if (!render_interface || !context)
  220. return false;
  221. Vector2i clip_origin = { -1, -1 };
  222. Vector2i clip_dimensions = { -1, -1 };
  223. bool clip = element && GetClippingRegion(clip_origin, clip_dimensions, element);
  224. Vector2i current_origin = { -1, -1 };
  225. Vector2i current_dimensions = { -1, -1 };
  226. bool current_clip = context->GetActiveClipRegion(current_origin, current_dimensions);
  227. if (current_clip != clip || (clip && (clip_origin != current_origin || clip_dimensions != current_dimensions)))
  228. {
  229. context->SetActiveClipRegion(clip_origin, clip_dimensions);
  230. ApplyActiveClipRegion(context, render_interface);
  231. }
  232. return true;
  233. }
  234. void ElementUtilities::ApplyActiveClipRegion(Context* context, RenderInterface* render_interface)
  235. {
  236. if (render_interface == nullptr)
  237. return;
  238. Vector2i origin;
  239. Vector2i dimensions;
  240. bool clip_enabled = context->GetActiveClipRegion(origin, dimensions);
  241. render_interface->EnableScissorRegion(clip_enabled);
  242. if (clip_enabled)
  243. {
  244. render_interface->SetScissorRegion(origin.x, origin.y, dimensions.x, dimensions.y);
  245. }
  246. }
  247. // Formats the contents of an element.
  248. bool ElementUtilities::FormatElement(Element* element, const Vector2f& containing_block)
  249. {
  250. LayoutEngine layout_engine;
  251. return layout_engine.FormatElement(element, containing_block);
  252. }
  253. // Generates the box for an element.
  254. void ElementUtilities::BuildBox(Box& box, const Vector2f& containing_block, Element* element, bool inline_element)
  255. {
  256. LayoutEngine::BuildBox(box, containing_block, element, inline_element);
  257. }
  258. // Sizes an element, and positions it within its parent offset from the borders of its content area.
  259. bool ElementUtilities::PositionElement(Element* element, const Vector2f& offset, PositionAnchor anchor)
  260. {
  261. Element* parent = element->GetParentNode();
  262. if (parent == nullptr)
  263. return false;
  264. SetBox(element);
  265. Vector2f containing_block = element->GetParentNode()->GetBox().GetSize(Box::CONTENT);
  266. Vector2f element_block = element->GetBox().GetSize(Box::MARGIN);
  267. Vector2f resolved_offset = offset;
  268. if (anchor & RIGHT)
  269. resolved_offset.x = containing_block.x - (element_block.x + offset.x);
  270. if (anchor & BOTTOM)
  271. resolved_offset.y = containing_block.y - (element_block.y + offset.y);
  272. SetElementOffset(element, resolved_offset);
  273. return true;
  274. }
  275. bool ElementUtilities::ApplyTransform(Element &element)
  276. {
  277. RenderInterface *render_interface = element.GetRenderInterface();
  278. if (!render_interface)
  279. return false;
  280. struct PreviousMatrix {
  281. const Matrix4f* pointer; // This may be expired, dereferencing not allowed!
  282. Matrix4f value;
  283. };
  284. static SmallUnorderedMap<RenderInterface*, PreviousMatrix> previous_matrix;
  285. auto it = previous_matrix.find(render_interface);
  286. if (it == previous_matrix.end())
  287. it = previous_matrix.emplace(render_interface, PreviousMatrix{ nullptr, Matrix4f::Identity() }).first;
  288. RMLUI_ASSERT(it != previous_matrix.end());
  289. const Matrix4f*& old_transform = it->second.pointer;
  290. const Matrix4f* new_transform = nullptr;
  291. if (const TransformState* state = element.GetTransformState())
  292. new_transform = state->GetTransform();
  293. // Only changed transforms are submitted.
  294. if (old_transform != new_transform)
  295. {
  296. Matrix4f& old_transform_value = it->second.value;
  297. // Do a deep comparison as well to avoid submitting a new transform which is equal.
  298. if(!old_transform || !new_transform || (old_transform_value != *new_transform))
  299. {
  300. render_interface->SetTransform(new_transform);
  301. if(new_transform)
  302. old_transform_value = *new_transform;
  303. }
  304. old_transform = new_transform;
  305. }
  306. return true;
  307. }
  308. }
  309. }