[[maybe_unused]]

Author: ldionne

libcxx/test/benchmarks/algorithms/nonmodifying/any_all_none_of.bench.cpp

@@ -52,7 +52,7 @@ int main(int argc, char** argv) {
             ValueType y            = random_different_from({x});
             Container c(size, x);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(c);
               auto result = any_of(c.begin(), c.end(), [&](auto element) {
                 benchmark::DoNotOptimize(element);

libcxx/test/benchmarks/algorithms/nonmodifying/contains.bench.cpp

@@ -34,7 +34,7 @@ int main(int argc, char** argv) {
             auto first = c.begin();
             auto last  = c.end();
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(c);
               benchmark::DoNotOptimize(y);
               auto result = std::ranges::contains(first, last, y);

libcxx/test/benchmarks/algorithms/nonmodifying/contains_subrange.bench.cpp

@@ -36,7 +36,7 @@ int main(int argc, char** argv) {
             assert(n > 0);
             Container needle(n, y);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = std::ranges::contains_subrange(haystack, needle);
@@ -106,7 +106,7 @@ int main(int argc, char** argv) {
             Container haystack(size, x);
             Container needle(size, x);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = std::ranges::contains_subrange(haystack, needle);
@@ -137,7 +137,7 @@ int main(int argc, char** argv) {
             Container haystack(size, x);
             Container needle(1, y);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = std::ranges::contains_subrange(haystack, needle);

libcxx/test/benchmarks/algorithms/nonmodifying/equal.bench.cpp

@@ -113,7 +113,7 @@ int main(int argc, char** argv) {
             auto last1  = c1.end();
             auto first2 = aligned ? c2.begin() : c2.begin() + 4;
             auto last2  = aligned ? c2.end() : c2.end() - 4;
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(c1);
               benchmark::DoNotOptimize(c2);
               auto result = equal(first1, last1, first2, last2);

libcxx/test/benchmarks/algorithms/nonmodifying/find_end.bench.cpp

@@ -81,7 +81,7 @@ int main(int argc, char** argv) {
             assert(n > 0);
             Container needle(n, y);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = find_end(haystack.begin(), haystack.end(), needle.begin(), needle.end());
@@ -146,7 +146,7 @@ int main(int argc, char** argv) {
             Container haystack(size, x);
             Container needle(size, x);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = find_end(haystack.begin(), haystack.end(), needle.begin(), needle.end());
@@ -173,7 +173,7 @@ int main(int argc, char** argv) {
             Container haystack(size, x);
             Container needle(1, y);
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = find_end(haystack.begin(), haystack.end(), needle.begin(), needle.end());
@@ -205,7 +205,7 @@ int main(int argc, char** argv) {
             // put the needle at 90% of the haystack
             std::ranges::copy(needle, std::next(haystack.begin(), (9 * size) / 10));
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(haystack);
               benchmark::DoNotOptimize(needle);
               auto result = find_end(haystack.begin(), haystack.end(), needle.begin(), needle.end());

libcxx/test/benchmarks/algorithms/nonmodifying/fold.bench.cpp

@@ -43,7 +43,7 @@ int main(int argc, char** argv) {
               return x + y;
             };
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(c);
               benchmark::DoNotOptimize(init);
               auto result = fold(c.begin(), c.end(), init, f);

libcxx/test/benchmarks/algorithms/nonmodifying/for_each.bench.cpp

@@ -31,7 +31,7 @@ int main(int argc, char** argv) {
             auto first = c.begin();
             auto last  = c.end();
 
-            for (auto _ : st) {
+            for ([[maybe_unused]] auto _ : st) {
               benchmark::DoNotOptimize(c);
               auto result = for_each(first, last, [](int& x) { x = std::clamp(x, 10, 100); });
               benchmark::DoNotOptimize(result);