carbon-language/carbon-lang
1
0
Fork 0
mirror of https://github.com/carbon-language/carbon-lang.git synced 2026-10-03 06:35:48 +01:00
Code Issues Packages Projects Releases 10 Wiki Activity

Switch CARBON_CHECK to a format string API (#4285)

Browse Source 
This switches `DCHECK` and `FATAL` as well.

The goal is to reduce the code size impact of these assertions so that
we can keep more of them enabled. Currently, the largest cost I see from
`CHECK` is not the actual check or the cold code itself, but actually
the failure to inline trivial functions due to the presence of the cold
code. This means that our goal isn't to reduce apparent code size in the
final binary but the LLVM IR cost assessed for these routines in the
inliner, which closely correlates with code size but is a bit different.

As discussed in #4283, experimentation shows that a single function call
with a minimal number of arguments is the lowest cost model for these.
This is easily achieved with a format-string API that internally uses
`llvm::formatv`. This PR is essentially the `CHECK` version of #4283.

However, the check macros are substantially harder to make work with
both format strings and streaming because they also take a condition.
Also, unexpectedly, I was very successful at devising a regular
expression based automated rewrite from the streaming to the format
string form with only low 10s of manual fixes. This includes compacting
strings broken up across lines, etc. Given how well that went, I've
prepared this PR which just directly switches to the format string API
and migrate everything to use it.

One nice side-effect is that the format string approach ends up greatly
simplifying the implementation here as well.

This is ... *shockingly* effective. Parsing speeds up by more than 3%
with just this change. And checking speeds up by **8%** with this change
alone:
```
BM_CompileAPIFileDenseDecls<Phase::Parse>/256      86.3µs ± 1%  82.9µs ± 1%  -3.94%  (p=0.000 n=17+19)
BM_CompileAPIFileDenseDecls<Phase::Parse>/1024      431µs ± 1%   415µs ± 1%  -3.76%  (p=0.000 n=18+19)
BM_CompileAPIFileDenseDecls<Phase::Parse>/4096     1.77ms ± 1%  1.71ms ± 1%  -3.18%  (p=0.000 n=18+19)
BM_CompileAPIFileDenseDecls<Phase::Parse>/16384    7.44ms ± 1%  7.17ms ± 2%  -3.56%  (p=0.000 n=18+20)
BM_CompileAPIFileDenseDecls<Phase::Parse>/65536    30.7ms ± 1%  29.7ms ± 1%  -3.15%  (p=0.000 n=18+20)
BM_CompileAPIFileDenseDecls<Phase::Parse>/262144    131ms ± 1%   127ms ± 1%  -2.81%  (p=0.000 n=18+18)
BM_CompileAPIFileDenseDecls<Phase::Check>/256       878µs ± 2%   800µs ± 1%  -8.91%  (p=0.000 n=19+20)
BM_CompileAPIFileDenseDecls<Phase::Check>/1024     1.88ms ± 2%  1.72ms ± 1%  -8.56%  (p=0.000 n=19+20)
BM_CompileAPIFileDenseDecls<Phase::Check>/4096     5.78ms ± 2%  5.28ms ± 1%  -8.70%  (p=0.000 n=20+18)
BM_CompileAPIFileDenseDecls<Phase::Check>/16384    21.9ms ± 1%  20.1ms ± 1%  -8.02%  (p=0.000 n=18+20)
BM_CompileAPIFileDenseDecls<Phase::Check>/65536    90.4ms ± 2%  83.1ms ± 1%  -8.04%  (p=0.000 n=19+20)
BM_CompileAPIFileDenseDecls<Phase::Check>/262144    381ms ± 2%   352ms ± 1%  -7.79%  (p=0.000 n=19+19)
```

---------

Co-authored-by: Richard Smith <richard@metafoo.co.uk>
Co-authored-by: josh11b <15258583+josh11b@users.noreply.github.com>
This commit is contained in:
Chandler Carruth
2024-09-12 16:42:08 +00:00
committed by GitHub
co-authored by Richard Smith josh11b
parent 35dfa5f03c
commit 4845f40dff
140 changed files with 1234 additions and 1161 deletions
Download Patch File Download Diff File Expand all files Collapse all files
toolchain/lex/tokenized_buffer_benchmark.cpp
+16 -15
View File
@@ -85,9 +85,10 @@ struct RandomSourceOptions {
string_literal_percent));
CARBON_CHECK(tokens_per_line <= NumTokens);
CARBON_CHECK(NumTokens % tokens_per_line == 0)
<< "Tokens per line of " << tokens_per_line
<< " does not divide the number of tokens " << NumTokens;
CARBON_CHECK(
NumTokens % tokens_per_line == 0,
"Tokens per line of {0} does not divide the number of tokens {1}",
tokens_per_line, NumTokens);
CARBON_CHECK(is_percentage(comment_line_percent));
CARBON_CHECK(is_percentage(blank_line_percent));
@@ -142,10 +143,10 @@ auto RandomSource(RandomSourceOptions options) -> std::string {
int num_symbols = (NumTokens / 100) * options.symbol_percent;
int num_keywords = (NumTokens / 100) * options.keyword_percent;
int num_identifiers = NumTokens - num_symbols - num_keywords;
CARBON_CHECK(num_identifiers == 0 || num_identifiers > 500)
<< "We require at least 500 identifiers as we need to collect a "
"reasonable number of samples to end up with a reasonable "
"distribution of lengths.";
CARBON_CHECK(
num_identifiers == 0 || num_identifiers > 500,
"We require at least 500 identifiers as we need to collect a reasonable "
"number of samples to end up with a reasonable distribution of lengths.");
llvm::SmallVector<llvm::StringRef> ids =
Testing::SourceGen::Global().GetIdentifiers(num_identifiers);
@@ -221,8 +222,8 @@ class LexerBenchHelper {
StreamDiagnosticConsumer consumer(out);
auto buffer = Lex::Lex(value_stores_, source_, consumer);
consumer.Flush();
CARBON_CHECK(buffer.has_errors())
<< "Asked to diagnose errors but none found!";
CARBON_CHECK(buffer.has_errors(),
"Asked to diagnose errors but none found!");
return result;
}
@@ -332,7 +333,7 @@ void BM_ValidIdentifiers(benchmark::State& state) {
LexerBenchHelper helper(source);
for (auto _ : state) {
TokenizedBuffer buffer = helper.Lex();
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());
@@ -370,7 +371,7 @@ void BM_HorizontalWhitespace(benchmark::State& state) {
// Ensure that lexing actually occurs for benchmarking and that it doesn't
// hit errors that would skew the benchmark results.
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());
@@ -388,7 +389,7 @@ void BM_RandomSource(benchmark::State& state) {
// Ensure that lexing actually occurs for benchmarking and that it doesn't
// hit errors that would skew the benchmark results.
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());
@@ -454,7 +455,7 @@ void BM_GroupingSymbols(benchmark::State& state) {
// Ensure that lexing actually occurs for benchmarking and that it doesn't
// hit errors that would skew the benchmark results.
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());
@@ -504,7 +505,7 @@ void BM_BlankLines(benchmark::State& state) {
// Ensure that lexing actually occurs for benchmarking and that it doesn't
// hit errors that would skew the benchmark results.
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());
@@ -539,7 +540,7 @@ void BM_CommentLines(benchmark::State& state) {
// Ensure that lexing actually occurs for benchmarking and that it doesn't
// hit errors that would skew the benchmark results.
CARBON_CHECK(!buffer.has_errors()) << helper.DiagnoseErrors();
CARBON_CHECK(!buffer.has_errors(), "{0}", helper.DiagnoseErrors());
}
state.SetBytesProcessed(state.iterations() * source.size());