summaryrefslogtreecommitdiff
path: root/compiler/codeGen
diff options
context:
space:
mode:
authorPhuong Trinh <lolotp@fb.com>2019-04-01 20:05:47 +0100
committerMarge Bot <ben+marge-bot@smart-cactus.org>2019-05-30 16:43:31 -0400
commitf81f3964b718eab21f0cfe65067c195f2f2a84bd (patch)
treeb14805c7ea1882f711de92e77fc08e6d6339c205 /compiler/codeGen
parent4ad37a323b9cdb830d718dec08c2960e34410a43 (diff)
downloadhaskell-f81f3964b718eab21f0cfe65067c195f2f2a84bd.tar.gz
Use binary search to speedup checkUnload
We are iterating through all object code for each heap objects when checking whether object code can be unloaded. For large projects in GHCi, this can be very expensive due to the large number of object code that needs to be loaded/unloaded. To speed it up, this arrangess all mapped sections of unloaded object code in a sorted array and use binary search to check if an address location fall on them.
Diffstat (limited to 'compiler/codeGen')
0 files changed, 0 insertions, 0 deletions