aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/Frontend/CompilerInvocation.cpp
diff options
context:
space:
mode:
authorKostya Kortchinsky <kostyak@google.com>2017-12-04 18:56:38 +0000
committerKostya Kortchinsky <kostyak@google.com>2017-12-04 18:56:38 +0000
commitd4a774d57f343c3650c1b3879bbac6667724d48f (patch)
tree63efc5f5d8b75175c68166ec930fbe6602b765bc /clang/lib/Frontend/CompilerInvocation.cpp
parent237e264497823b6cc7b07b211b08e13bb3db6184 (diff)
downloadllvm-d4a774d57f343c3650c1b3879bbac6667724d48f.zip
llvm-d4a774d57f343c3650c1b3879bbac6667724d48f.tar.gz
llvm-d4a774d57f343c3650c1b3879bbac6667724d48f.tar.bz2
[sanitizer] 64-bit allocator's PopulateFreeArray partial refactor
Summary: This is an attempt at making `PopulateFreeArray` less obscure, more consistent, and a tiny bit faster in some circumstances: - use more consistent variable names, that work both for the user & the metadata portions of the code; the purpose of the code is mostly the same for both regions, so it makes sense that the code should be mostly similar as well; - replace the while sum loops with a single `RoundUpTo`; - mask most of the metadata computations behind kMetadataSize, allowing some blocks to be completely optimized out if not use metadata; - `const` the constant variables; - add a `LIKELY` as the branch it applies to will almost always be taken. Reviewers: alekseyshl, flowerhack Reviewed By: alekseyshl Subscribers: kubamracek, llvm-commits Differential Revision: https://reviews.llvm.org/D40754 llvm-svn: 319673
Diffstat (limited to 'clang/lib/Frontend/CompilerInvocation.cpp')
0 files changed, 0 insertions, 0 deletions