diff options
| author | Adam Balogh <adam.balogh@ericsson.com> | 2019-11-20 09:15:42 +0100 |
|---|---|---|
| committer | Adam Balogh <adam.balogh@ericsson.com> | 2020-02-05 17:59:08 +0100 |
| commit | b198f16e1e1c8ee849008c1b886199eae5bc2e01 (patch) | |
| tree | 6a7ad4478a7acee45e85a07b1921fdb32de4af80 /llvm/lib/Transforms/Utils/LoopUtils.cpp | |
| parent | 307e0d5490a5f2a069a00e4273784d1a2e005ab9 (diff) | |
| download | llvm-b198f16e1e1c8ee849008c1b886199eae5bc2e01.zip llvm-b198f16e1e1c8ee849008c1b886199eae5bc2e01.tar.gz llvm-b198f16e1e1c8ee849008c1b886199eae5bc2e01.tar.bz2 | |
[Analyzer] Model STL Algoirthms to improve the iterator checkers
STL Algorithms are usually implemented in a tricky for performance
reasons which is too complicated for the analyzer. Furthermore inlining
them is costly. Instead of inlining we should model their behavior
according to the specifications.
This patch is the first step towards STL Algorithm modeling. It models
all the `find()`-like functions in a simple way: the result is either
found or not. In the future it can be extended to only return success if
container modeling is also extended in a way the it keeps track of
trivial insertions and deletions.
Differential Revision: https://reviews.llvm.org/D70818
Diffstat (limited to 'llvm/lib/Transforms/Utils/LoopUtils.cpp')
0 files changed, 0 insertions, 0 deletions