aboutsummaryrefslogtreecommitdiff
path: root/llvm/tools/llvm-readobj/llvm-readobj.cpp
diff options
context:
space:
mode:
authorAdam Nemet <anemet@apple.com>2015-07-08 22:58:48 +0000
committerAdam Nemet <anemet@apple.com>2015-07-08 22:58:48 +0000
commit424edc6c806ca76c470135489f518ff3bbf466c3 (patch)
treefcf8f4d0cd73eebf64a20f9c8da199988536df24 /llvm/tools/llvm-readobj/llvm-readobj.cpp
parent7f1e1f0f8ef438c631633290e348c4a6f51de0fa (diff)
downloadllvm-424edc6c806ca76c470135489f518ff3bbf466c3.zip
llvm-424edc6c806ca76c470135489f518ff3bbf466c3.tar.gz
llvm-424edc6c806ca76c470135489f518ff3bbf466c3.tar.bz2
[LAA] Revert a small part of r239295
This commit ([LAA] Fix estimation of number of memchecks) regressed the logic a bit. We shouldn't quit the analysis if we encounter a pointer without known bounds *unless* we actually need to emit a memcheck for it. The original code was using NumComparisons which is now computed differently. Instead I compute NeedRTCheck from NumReadPtrChecks and NumWritePtrChecks. As side note, I find the separation of NeedRTCheck and CanDoRT confusing, so I will try to merge them in a follow-up patch. llvm-svn: 241756
Diffstat (limited to 'llvm/tools/llvm-readobj/llvm-readobj.cpp')
0 files changed, 0 insertions, 0 deletions