Mirror of github.com/cira0100/Eglantine-public nx2, a fork of Djihads80/Eglantine. https://git.cirakg.xyz/eglantine-cirakg/atom?h=nx2 2021-02-13T05:17:22+00:00 2021-02-13T05:17:22+00:00 ReinUsesLisp reinuseslisp@airmail.cc 2021-01-16T23:48:58+00:00 urn:sha1:2dfce2fca60c8775be55cf86e8f8a5eddd5e8832 Reimplement the buffer cache using cached bindings and page level granularity for modification tracking. This also drops the usage of shared pointers and virtual functions from the cache. - Bindings are cached, allowing to skip work when the game changes few bits between draws. - OpenGL Assembly shaders no longer copy when a region has been modified from the GPU to emulate constant buffers, instead GL_EXT_memory_object is used to alias sub-buffers within the same allocation. - OpenGL Assembly shaders stream constant buffer data using glProgramBufferParametersIuivNV, from NV_parameter_buffer_object. In theory this should save one hash table resolve inside the driver compared to glBufferSubData. - A new OpenGL stream buffer is implemented based on fences for drivers that are not Nvidia's proprietary, due to their low performance on partial glBufferSubData calls synchronized with 3D rendering (that some games use a lot). - Most optimizations are shared between APIs now, allowing Vulkan to cache more bindings than before, skipping unnecesarry work. This commit adds the necessary infrastructure to use Vulkan object from OpenGL. Overall, it improves performance and fixes some bugs present on the old cache. There are still some edge cases hit by some games that harm performance on some vendors, this are planned to be fixed in later commits. 2020-12-06T23:37:23+00:00 comex comexk@gmail.com 2020-11-14T23:33:40+00:00 urn:sha1:ef14bbc69d7c7093496a84ea4bdd1dc83f7d5cab Clang complains about `new_chunk`'s constructor using the then-uninitialized `first_chunk` (even though it's just to get a pointer into it). 2020-05-21T19:44:00+00:00 ReinUsesLisp reinuseslisp@airmail.cc 2020-05-21T04:06:40+00:00 urn:sha1:f8678b635a04663cbd09fbe1800540a33b3d27ab Drop the std::list hack to allocate memory indefinitely. Instead use a custom allocator that keeps references valid until destruction. This allocates fixed chunks of memory and puts pointers in a free list. When an allocation is no longer used put it back to the free list, this doesn't heap allocate because std::vector doesn't change the capacity. If the free list is empty, allocate a new chunk. 2020-05-21T19:44:00+00:00 ReinUsesLisp reinuseslisp@airmail.cc 2020-05-17T19:56:08+00:00 urn:sha1:7a45f9735749c7d2c0b13e22080c9e1a5ed7ca38 Instead of using boost::icl::interval_map for caching, use boost::intrusive::set. interval_map is intended as a container where the keys can overlap with one another; we don't need this for caching buffers and a std::set-like data structure that allows us to search with lower_bound is enough. 2020-05-21T19:02:54+00:00 ReinUsesLisp reinuseslisp@airmail.cc 2020-05-16T21:07:03+00:00 urn:sha1:c7f9bceb8082c7112ecdf7472cdd12b50c2c8182 Removing shared pointers is a first step to be able to use intrusive objects and keep allocations close to one another in memory. 2020-05-21T19:02:20+00:00 ReinUsesLisp reinuseslisp@airmail.cc 2020-05-16T20:08:33+00:00 urn:sha1:3460d01352000068450da29f0f45114cade7f9a8 Minor style changes. Mostly done so I avoid editing it while doing other changes. 2020-04-22T15:36:07+00:00 Fernando Sahmkow fsahmkow27@gmail.com 2020-02-16T14:08:07+00:00 urn:sha1:de53bc96c0d4b1406a9447368bc05d6bef007eb0 2020-04-06T13:23:06+00:00 Fernando Sahmkow fsahmkow27@gmail.com 2020-04-05T21:23:49+00:00 urn:sha1:3728c7160f198c5dbc74584545fb29f874fac6ad 2019-08-21T16:14:25+00:00 Fernando Sahmkow fsahmkow27@gmail.com 2019-07-20T15:42:53+00:00 urn:sha1:4d5e3ee41cc3580e61f9a0ec67e45774661e6616 2019-08-21T16:14:24+00:00 Fernando Sahmkow fsahmkow27@gmail.com 2019-07-20T01:07:28+00:00 urn:sha1:2ecf0de6659dea3a0bfa5f7ff9ce3f319a7f928e