summaryrefslogtreecommitdiff
path: root/include/llvm/Constant.h
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-10-04 17:48:46 +0000
committerChris Lattner <sabre@nondot.org>2005-10-04 17:48:46 +0000
commita55b30a225a023b6e6315b0c82a4622b457758ab (patch)
tree2c1c45737ba92e64f77b4218fadd85c2ca8209f0 /include/llvm/Constant.h
parentd7a3fc6819c40aab09db86dfae816d1c855335a1 (diff)
downloadllvm-a55b30a225a023b6e6315b0c82a4622b457758ab.tar.gz
llvm-a55b30a225a023b6e6315b0c82a4622b457758ab.tar.bz2
llvm-a55b30a225a023b6e6315b0c82a4622b457758ab.tar.xz
For large constants (e.g. arrays and structs with many elements) just
creating the keys and doing comparisons to index into 'Map' takes a lot of time. For these large constants, keep an inverse map so that 'remove' and move operations are much faster. This speeds up a release build of the bc reader on Eric's nasty python bytecode file from 1:39 to 1:00s. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23624 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Constant.h')
0 files changed, 0 insertions, 0 deletions