diff options
| author | River Riddle <riddleriver@gmail.com> | 2021-02-23 14:22:23 -0800 |
|---|---|---|
| committer | River Riddle <riddleriver@gmail.com> | 2021-02-23 14:36:45 -0800 |
| commit | 65a3197a8fa2e5d1deb8707bda13ebd21e1dedb3 (patch) | |
| tree | fae54fe858dd7ace80ac5ad30055fdf593dbba7d /llvm/lib/IR/Module.cpp | |
| parent | 8fa2bbaed9252b217105ea332be8a0a85492099b (diff) | |
| download | llvm-65a3197a8fa2e5d1deb8707bda13ebd21e1dedb3.zip llvm-65a3197a8fa2e5d1deb8707bda13ebd21e1dedb3.tar.gz llvm-65a3197a8fa2e5d1deb8707bda13ebd21e1dedb3.tar.bz2 | |
[mlir] Refactor InterfaceMap to use a sorted vector of interfaces, as opposed to a DenseMap
A majority of operations have a very small number of interfaces, which means that the cost of using a hash map is generally larger for interface lookups than just a binary search. In the future when there are a number of operations with large amounts of interfaces, we can switch to a hybrid approach that optimizes lookups based on the number of interfaces. For now, however, a binary search is the best approach.
This dropped compile time on a largish TF MLIR module by 20%(half a second).
Differential Revision: https://reviews.llvm.org/D96085
Diffstat (limited to 'llvm/lib/IR/Module.cpp')
0 files changed, 0 insertions, 0 deletions