mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-11-25 13:00:04 +00:00
d18d0d92e5
* Optimize DefUseManager allocations Saves around 30-35% of compilation time. For inst->use_ids, use a pool linked list instead of allocating vectors for every instruction. For inst->uses, use a "PooledLinkedList"' -- a linked list that has shared storage for all nodes. Neither re-use nodes, instead we do a bulk compaction operation when too much memory is being wasted (tuneable). Includes separate PooledLinkedList templated datastructure, a very special case construct, but split out to make the code a little easier to understand. |
||
---|---|---|
.. | ||
bit_vector_test.cpp | ||
bitutils_test.cpp | ||
CMakeLists.txt | ||
hash_combine_test.cpp | ||
ilist_test.cpp | ||
pooled_linked_list_test.cpp | ||
small_vector_test.cpp |