mirror of
https://github.com/KhronosGroup/SPIRV-Tools
synced 2024-11-23 04:00:05 +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.cpp | ||
| bit_vector.h | ||
| bitutils.h | ||
| hash_combine.h | ||
| hex_float.h | ||
| ilist_node.h | ||
| ilist.h | ||
| make_unique.h | ||
| parse_number.cpp | ||
| parse_number.h | ||
| pooled_linked_list.h | ||
| small_vector.h | ||
| string_utils.cpp | ||
| string_utils.h | ||
| timer.cpp | ||
| timer.h | ||