mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-11-22 11:40:05 +00:00
a123632ed9
Incrementally compute the hash instead of collecting words Avoids allocating temporary space in a std::vector and std::u32string, and making three passes over all the hashed data. Switch to using std::vector to prevent processing duplicates instead of std::unordered_set: avoids an allocation/deletion every call to ComputeHashValue, and ends up faster due to much better cache behaviour and smaller constant-factor when searching the (generally very small) list. In my test case, made Type::HashValue go from 7.5% of compilation time to .5% |
||
|---|---|---|
| .. | ||
| bit_vector_test.cpp | ||
| bitutils_test.cpp | ||
| CMakeLists.txt | ||
| hash_combine_test.cpp | ||
| ilist_test.cpp | ||
| small_vector_test.cpp | ||