cpu_optimization.rst 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. .. _doc_cpu_optimization:
  2. CPU optimization
  3. ================
  4. Measuring performance
  5. =====================
  6. To know how to speed up our program, we have to know where the "bottlenecks"
  7. are. Bottlenecks are the slowest parts of the program that limit the rate that
  8. everything can progress. This allows us to concentrate our efforts on optimizing
  9. the areas which will give us the greatest speed improvement, instead of spending
  10. a lot of time optimizing functions that will lead to small performance
  11. improvements.
  12. For the CPU, the easiest way to identify bottlenecks is to use a profiler.
  13. CPU profilers
  14. =============
  15. Profilers run alongside your program and take timing measurements to work out
  16. what proportion of time is spent in each function.
  17. The Godot IDE conveniently has a built-in profiler. It does not run every time
  18. you start your project: it must be manually started and stopped. This is
  19. because, like most profilers, recording these timing measurements can
  20. slow down your project significantly.
  21. After profiling, you can look back at the results for a frame.
  22. .. figure:: img/godot_profiler.png
  23. .. figure:: img/godot_profiler.png
  24. :alt: Screenshot of the Godot profiler
  25. Results of a profile of one of the demo projects.
  26. .. note:: We can see the cost of built-in processes such as physics and audio,
  27. as well as seeing the cost of our own scripting functions at the
  28. bottom.
  29. Time spent waiting for various built-in servers may not be counted in
  30. the profilers. This is a known bug.
  31. When a project is running slowly, you will often see an obvious function or
  32. process taking a lot more time than others. This is your primary bottleneck, and
  33. you can usually increase speed by optimizing this area.
  34. For more info about using Godot's built-in profiler, see :ref:`doc_debugger_panel`.
  35. External profilers
  36. ~~~~~~~~~~~~~~~~~~
  37. Although the Godot IDE profiler is very convenient and useful, sometimes you
  38. need more power, and the ability to profile the Godot engine source code itself.
  39. You can use a number of third party profilers to do this including
  40. `Valgrind <https://www.valgrind.org/>`__,
  41. `VerySleepy <http://www.codersnotes.com/sleepy/>`__,
  42. `HotSpot <https://github.com/KDAB/hotspot>`__,
  43. `Visual Studio <https://visualstudio.microsoft.com/>`__ and
  44. `Intel VTune <https://software.intel.com/content/www/us/en/develop/tools/vtune-profiler.html>`__.
  45. .. note:: You will need to compile Godot from source to use a third-party profiler.
  46. This is required to obtain debugging symbols. You can also use a debug
  47. build, however, note that the results of profiling a debug build will
  48. be different to a release build, because debug builds are less
  49. optimized. Bottlenecks are often in a different place in debug builds,
  50. so you should profile release builds whenever possible.
  51. .. figure:: img/valgrind.png
  52. :alt: Screenshot of Callgrind
  53. Example results from Callgrind, which is part of Valgrind.
  54. From the left, Callgrind is listing the percentage of time within a function and
  55. its children (Inclusive), the percentage of time spent within the function
  56. itself, excluding child functions (Self), the number of times the function is
  57. called, the function name, and the file or module.
  58. In this example, we can see nearly all time is spent under the
  59. `Main::iteration()` function. This is the master function in the Godot source
  60. code that is called repeatedly. It causes frames to be drawn, physics ticks to
  61. be simulated, and nodes and scripts to be updated. A large proportion of the
  62. time is spent in the functions to render a canvas (66%), because this example
  63. uses a 2D benchmark. Below this, we see that almost 50% of the time is spent
  64. outside Godot code in ``libglapi`` and ``i965_dri`` (the graphics driver).
  65. This tells us the a large proportion of CPU time is being spent in the
  66. graphics driver.
  67. This is actually an excellent example because, in an ideal world, only a very
  68. small proportion of time would be spent in the graphics driver. This is an
  69. indication that there is a problem with too much communication and work being
  70. done in the graphics API. This specific profiling led to the development of 2D
  71. batching, which greatly speeds up 2D rendering by reducing bottlenecks in this
  72. area.
  73. Manually timing functions
  74. =========================
  75. Another handy technique, especially once you have identified the bottleneck
  76. using a profiler, is to manually time the function or area under test.
  77. The specifics vary depending on the language, but in GDScript, you would do
  78. the following:
  79. ::
  80. var time_start = OS.get_ticks_usec()
  81. # Your function you want to time
  82. update_enemies()
  83. var time_end = OS.get_ticks_usec()
  84. print("update_enemies() took %d microseconds" % time_end - time_start)
  85. When manually timing functions, it is usually a good idea to run the function
  86. many times (1,000 or more times), instead of just once (unless it is a very slow
  87. function). The reason for doing this is that timers often have limited accuracy.
  88. Moreover, CPUs will schedule processes in a haphazard manner. Therefore, an
  89. average over a series of runs is more accurate than a single measurement.
  90. As you attempt to optimize functions, be sure to either repeatedly profile or
  91. time them as you go. This will give you crucial feedback as to whether the
  92. optimization is working (or not).
  93. Caches
  94. ======
  95. CPU caches are something else to be particularly aware of, especially when
  96. comparing timing results of two different versions of a function. The results
  97. can be highly dependent on whether the data is in the CPU cache or not. CPUs
  98. don't load data directly from the system RAM, even though it's huge in
  99. comparison to the CPU cache (several gigabytes instead of a few megabytes). This
  100. is because system RAM is very slow to access. Instead, CPUs load data from a
  101. smaller, faster bank of memory called cache. Loading data from cache is very
  102. fast, but every time you try and load a memory address that is not stored in
  103. cache, the cache must make a trip to main memory and slowly load in some data.
  104. This delay can result in the CPU sitting around idle for a long time, and is
  105. referred to as a "cache miss".
  106. This means that the first time you run a function, it may run slowly because the
  107. data is not in the CPU cache. The second and later times, it may run much faster
  108. because the data is in the cache. Due to this, always use averages when timing,
  109. and be aware of the effects of cache.
  110. Understanding caching is also crucial to CPU optimization. If you have an
  111. algorithm (routine) that loads small bits of data from randomly spread out areas
  112. of main memory, this can result in a lot of cache misses, a lot of the time, the
  113. CPU will be waiting around for data instead of doing any work. Instead, if you
  114. can make your data accesses localised, or even better, access memory in a linear
  115. fashion (like a continuous list), then the cache will work optimally and the CPU
  116. will be able to work as fast as possible.
  117. Godot usually takes care of such low-level details for you. For example, the
  118. Server APIs make sure data is optimized for caching already for things like
  119. rendering and physics. Still, you should be especially aware of caching when
  120. using :ref:`GDNative <toc-tutorials-gdnative>`.
  121. Languages
  122. =========
  123. Godot supports a number of different languages, and it is worth bearing in mind
  124. that there are trade-offs involved. Some languages are designed for ease of use
  125. at the cost of speed, and others are faster but more difficult to work with.
  126. Built-in engine functions run at the same speed regardless of the scripting
  127. language you choose. If your project is making a lot of calculations in its own
  128. code, consider moving those calculations to a faster language.
  129. GDScript
  130. ~~~~~~~~
  131. :ref:`GDScript <toc-learn-scripting-gdscript>` is designed to be easy to use and iterate,
  132. and is ideal for making many types of games. However, in this language, ease of
  133. use is considered more important than performance. If you need to make heavy
  134. calculations, consider moving some of your project to one of the other
  135. languages.
  136. C#
  137. ~~
  138. :ref:`C# <toc-learn-scripting-C#>` is popular and has first-class support in Godot.It
  139. offers a good compromise between speed and ease of use. Beware of possible
  140. garbage collection pauses and leaks that can occur during gameplay, though. A
  141. common approach to workaround issues with garbage collection is to use *object
  142. pooling*, which is outside the scope of this guide.
  143. Other languages
  144. ~~~~~~~~~~~~~~~
  145. Third parties provide support for several other languages, including `Rust
  146. <https://github.com/godot-rust/godot-rust>`_ and `Javascript
  147. <https://github.com/GodotExplorer/ECMAScript>`_.
  148. C++
  149. ~~~
  150. Godot is written in C++. Using C++ will usually result in the fastest code.
  151. However, on a practical level, it is the most difficult to deploy to end users'
  152. machines on different platforms. Options for using C++ include
  153. :ref:`GDNative <toc-tutorials-gdnative>` and
  154. :ref:`custom modules <doc_custom_modules_in_c++>`.
  155. Threads
  156. =======
  157. Consider using threads when making a lot of calculations that can run in
  158. parallel to each other. Modern CPUs have multiple cores, each one capable of
  159. doing a limited amount of work. By spreading work over multiple threads, you can
  160. move further towards peak CPU efficiency.
  161. The disadvantage of threads is that you have to be incredibly careful. As each
  162. CPU core operates independently, they can end up trying to access the same
  163. memory at the same time. One thread can be reading to a variable while another
  164. is writing: this is called a *race condition*. Before you use threads, make sure
  165. you understand the dangers and how to try and prevent these race conditions.
  166. Threads can also make debugging considerably more difficult. The GDScript
  167. debugger doesn't support setting up breakpoints in threads yet.
  168. For more information on threads, see :ref:`doc_using_multiple_threads`.
  169. SceneTree
  170. =========
  171. Although Nodes are an incredibly powerful and versatile concept, be aware that
  172. every node has a cost. Built-in functions such as `_process()` and
  173. `_physics_process()` propagate through the tree. This housekeeping can reduce
  174. performance when you have very large numbers of nodes (usually in the thousands).
  175. Each node is handled individually in the Godot renderer. Therefore, a smaller
  176. number of nodes with more in each can lead to better performance.
  177. One quirk of the :ref:`SceneTree <class_SceneTree>` is that you can sometimes
  178. get much better performance by removing nodes from the SceneTree, rather than by
  179. pausing or hiding them. You don't have to delete a detached node. You can for
  180. example, keep a reference to a node, detach it from the scene tree using
  181. :ref:`Node.remove_child(node) <class_Node_method_remove_child>`, then reattach
  182. it later using :ref:`Node.add_child(node) <class_Node_method_add_child>`.
  183. This can be very useful for adding and removing areas from a game, for example.
  184. You can avoid the SceneTree altogether by using Server APIs. For more
  185. information, see :ref:`doc_using_servers`.
  186. Physics
  187. =======
  188. In some situations, physics can end up becoming a bottleneck. This is
  189. particularly the case with complex worlds and large numbers of physics objects.
  190. Here are some techniques to speed up physics:
  191. - Try using simplified versions of your rendered geometry for collision shapes.
  192. Often, this won't be noticeable for end users, but can greatly increase
  193. performance.
  194. - Try removing objects from physics when they are out of view / outside the
  195. current area, or reusing physics objects (maybe you allow 8 monsters per area,
  196. for example, and reuse these).
  197. Another crucial aspect to physics is the physics tick rate. In some games, you
  198. can greatly reduce the tick rate, and instead of for example, updating physics
  199. 60 times per second, you may update them only 30 or even 20 times per second.
  200. This can greatly reduce the CPU load.
  201. The downside of changing physics tick rate is you can get jerky movement or
  202. jitter when the physics update rate does not match the frames per second
  203. rendered. Also, decreasing the physics tick rate will increase input lag.
  204. It's recommended to stick to the default physics tick rate (60 Hz) in most games
  205. that feature real-time player movement.
  206. The solution to jitter is to use *fixed timestep interpolation*, which involves
  207. smoothing the rendered positions and rotations over multiple frames to match the
  208. physics. You can either implement this yourself or use a
  209. `third-party addon <https://github.com/lawnjelly/smoothing-addon>`__.
  210. Performance-wise, interpolation is a very cheap operation compared to running a
  211. physics tick. It's orders of magnitude faster, so this can be a significant
  212. performance win while also reducing jitter.