DaniPopes:less-criterion-black-box - Branch - CodSpeedHQ/codspeed-rust

chore: remove unnecessary black_box in criterion

#98Merged

Comparing

DaniPopes:less-criterion-black-box

(

b71c93b

) with

main

(

6178dd1

)

-3%

Improvements: 8

Regressions: 1

Untouched: 154

This report only contains results for the Wall Time instrument. To view results for the CPU Simulation instrument, click here.

Benchmarks

Failed

n_queens_solver[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

Regression

-3%

9.3 µs9.6 µs

Improved

sleep_100ns

crates/divan_compat/examples/benches/time_scale.rs

×2.2

57.6 µs26 µs

large_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup

+27%

14 ns11 ns

sleep_1us

crates/divan_compat/examples/benches/time_scale.rs

+22%

52.3 µs42.7 µs

sleep_100us

crates/divan_compat/examples/benches/time_scale.rs

+17%

157.4 µs134 µs

from_elem_decimal[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+14%

240 ns210 ns

permutations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+4%

801 µs771.8 µs

permutations[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+4%

2.4 µs2.3 µs

generate_gray_code[2]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+3%

240 ns233 ns

Passed

small_drop

crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop

N/A

< 1 ns< 1 ns

iter_batched_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

permutations[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+3%

719 ns701 ns

from_elem[8192]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+2%

493 ns484 ns

from_elem[4096]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+2%

336 ns330 ns

from_elem[16384]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+2%

835 ns821 ns

from_elem[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

+1%

82 ns81 ns

build_vec

crates/criterion_compat/benches/criterion_example.rs::benches::b

205 ns204 ns

from_elem[2048]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

240 ns239 ns

Recursive

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

52.3 µs52.3 µs

Auto

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

3 ns3 ns

small_setup

crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup

1 ns1 ns

from_elem_decimal[1024]

crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem

81 ns81 ns

Iterative[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

21 ns21 ns

fibonacci_custom_measurement

crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles

421 ns421 ns

Iterative[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

22 ns22 ns

sleep_50ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

50.1 ms50.1 ms

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime

N/A

< 1 ns< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::nested::bench

N/A

< 1 ns< 1 ns

"*benchmark/" '

crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"

N/A

< 1 ns< 1 ns

Linear

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

3 ns3 ns

sleep_1ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

1.1 ms1.1 ms

Recursive[21]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

-1%

84.7 µs85.2 µs

bench_explicit_measurement

crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group

N/A

< 1 ns< 1 ns

iter_with_large_drop

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

with_input[5]

crates/criterion_compat/benches/test_benches.rs::benches::bench

N/A

< 1 ns< 1 ns

iter_batched_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_ref_small_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_batched_ref_large_input

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup

+3%

40 ns39 ns

iter_batched_ref_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

40 ns40 ns

iter_batched_per_iteration

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

40 ns40 ns

iter_with_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

40 ns40 ns

sleep_10ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

10.1 ms10.1 ms

Recursive[20]

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3

52.3 µs52.4 µs

iter_with_large_setup

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

Iterative

crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci

21 ns21 ns

sum_fold

crates/criterion_compat/benches/criterion_example.rs::benches::a

304 ns304 ns

large_drop

crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop

-2%

169.8 µs173.9 µs

iter

crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead

N/A

< 1 ns< 1 ns

graph_coloring[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+3%

1.3 µs1.3 µs

generate_combinations[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

4.1 µs4 µs

generate_gray_code[1]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+2%

133 ns130 ns

rat_in_maze[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

809 ns791 ns

recursive_memoized[BTreeMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

+2%

2.9 µs2.8 µs

hamiltonian_cycle[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

725 ns710 ns

generate_combinations[9]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

4.3 µs4.2 µs

hamiltonian_cycle[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

651 ns639 ns

hamiltonian_cycle[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

561 ns551 ns

generate_parentheses[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+2%

21.9 µs21.6 µs

add_two_integers[(1024, -1024)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+2%

67 ns66 ns

generate_combinations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

1.3 µs1.3 µs

generate_gray_code[4]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+1%

905 ns893 ns

generate_gray_code[5]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+1%

1.9 µs1.9 µs

print_env_hello

crates/divan_compat/examples/benches/env.rs

+1%

1.9 µs1.9 µs

recursive_memoized[BTreeMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

+1%

513 ns507 ns

graph_coloring[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

1.1 µs1 µs

recursive_memoized[BTreeMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

+1%

184 ns182 ns

generate_parentheses[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

6.8 µs6.8 µs

generate_parentheses[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

2.4 µs2.3 µs

rat_in_maze[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

929 ns920 ns

permutations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

10.7 µs10.6 µs

hamiltonian_cycle[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

792 ns785 ns

rat_in_maze[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

713 ns707 ns

generate_parentheses[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

68.8 µs68.3 µs

n_queens_solver[4]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

+1%

1.6 µs1.6 µs

generate_gray_code[3]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

+1%

456 ns453 ns

n_queens_solver[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

23.1 µs23 µs

recursive_memoized[HashMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

3.3 µs3.3 µs

recursive_memoized[BTreeMap<u64, u64>, 20]

crates/divan_compat/examples/benches/math.rs::fibonacci

1.7 µs1.7 µs

n_queens_solver[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

532.7 µs531 µs

knight_tour[8]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

293.2 ms292.3 ms

recursive_memoized[HashMap<u64, u64>, 30]

crates/divan_compat/examples/benches/math.rs::fibonacci

5.7 µs5.7 µs

knight_tour[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

300.2 µs299.6 µs

sleep_1ns

crates/divan_compat/examples/benches/time_scale.rs

57.4 µs57.3 µs

recursive[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

47.3 µs47.3 µs

knight_tour[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

249.1 ms249 ms

sort

crates/divan_compat/examples/benches/sort.rs::sorted

137.2 µs137.2 µs

sleep_1ms

crates/divan_compat/examples/benches/time_scale.rs

1.1 ms1.1 ms

sleep_1ms

crates/divan_compat/benches/sleep_benches.rs

1.1 ms1.1 ms

sleep_10ms

crates/divan_compat/benches/sleep_benches.rs

10.1 ms10.1 ms

sleep_50ms

crates/divan_compat/benches/sleep_benches.rs

50.1 ms50.1 ms

generate_combinations[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

791 ns791 ns

iterative[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

51 ns51 ns

instant

crates/divan_compat/examples/benches/time.rs::now

39 ns39 ns

subset_sum[12]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

1.9 µs1.9 µs

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::now

3 ns3 ns

add_two_integers[(42, 13)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

6 ns6 ns

count_set_bits[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

13 ns13 ns

instant

crates/divan_compat/examples/benches/time.rs::duration_since

10 ns10 ns

subset_sum[16]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

3.9 µs3.9 µs

mul

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

subset_sum[18]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

4 µs4 µs

add

crates/divan_compat/examples/benches/math.rs

2 ns2 ns

count_set_bits[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

13 ns13 ns

recursive_memoized[HashMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

15 ns15 ns

find_highest_set_bit[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

div

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

count_set_bits[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

13 ns13 ns

system_time

crates/divan_compat/examples/benches/time.rs::now

39 ns39 ns

sort_unstable

crates/divan_compat/examples/benches/sort.rs::sorted

130.5 µs130.5 µs

iterative[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

1 ns1 ns

recursive_memoized[HashMap<u64, u64>, 10]

crates/divan_compat/examples/benches/math.rs::fibonacci

1.5 µs1.5 µs

iterative[20]

crates/divan_compat/examples/benches/math.rs::fibonacci

40 ns40 ns

add_two_integers[(255, 255)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

6 ns6 ns

count_set_bits[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

13 ns13 ns

find_highest_set_bit[42]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

count_set_bits[255]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

13 ns13 ns

rem

crates/divan_compat/examples/benches/math.rs

3 ns3 ns

add_two_integers[(65535, -65535)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

75 ns75 ns

recursive[0]

crates/divan_compat/examples/benches/math.rs::fibonacci

1 ns1 ns

generate_combinations[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

2 µs2 µs

add_two_integers[(0, 0)]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

find_highest_set_bit[65535]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

recursive_memoized[HashMap<u64, u64>, 5]

crates/divan_compat/examples/benches/math.rs::fibonacci

575 ns575 ns

recursive_memoized[BTreeMap<u64, u64>, 0]

crates/divan_compat/examples/benches/math.rs::fibonacci

14 ns14 ns

tsc (aarch64)

crates/divan_compat/examples/benches/time.rs::duration_since

N/A

< 1 ns< 1 ns

system_time

crates/divan_compat/examples/benches/time.rs::duration_since

13 ns13 ns

find_highest_set_bit[0]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

iterative[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

7 ns7 ns

find_highest_set_bit[1024]

crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation

5 ns5 ns

recursive[5]

crates/divan_compat/examples/benches/math.rs::fibonacci

31 ns31 ns

subset_sum[10]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

980 ns980 ns

iterative[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

16 ns16 ns

bench_array2[1]

crates/divan_compat/benches/basic_example.rs::const_bench

2 ns2 ns

bench_array2[42]

crates/divan_compat/benches/basic_example.rs::const_bench

51 ns51 ns

bench_array1[1]

crates/divan_compat/benches/basic_example.rs::const_bench

2 ns2 ns

bench_array1[4]

crates/divan_compat/benches/basic_example.rs::const_bench

3 ns3 ns

init_array[42]

crates/divan_compat/benches/basic_example.rs::const_bench

51 ns51 ns

bench_array2[10]

crates/divan_compat/benches/basic_example.rs::const_bench

10 ns10 ns

bench_array2[4]

crates/divan_compat/benches/basic_example.rs::const_bench

3 ns3 ns

init_array[4]

crates/divan_compat/benches/basic_example.rs::const_bench

3 ns3 ns

bench_array1[10]

crates/divan_compat/benches/basic_example.rs::const_bench

10 ns10 ns

mut_borrow

crates/divan_compat/benches/basic_example.rs

7 ns7 ns

fibo_50

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

bench_array1[42]

crates/divan_compat/benches/basic_example.rs::const_bench

51 ns51 ns

fibo_10

crates/divan_compat/benches/basic_example.rs

2 ns2 ns

sleep_100ms

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

sleep_100ms

crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks

100.1 ms100.1 ms

Flat

crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode

10.1 ms10.1 ms

sleep_100ms_with_custom_sample

crates/divan_compat/benches/sleep_benches.rs

100.1 ms100.1 ms

knight_tour[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

8.6 ms8.6 ms

sort

crates/divan_compat/examples/benches/sort.rs::random

4.8 ms4.9 ms

sort_unstable

crates/divan_compat/examples/benches/sort.rs::random

3.3 ms3.3 ms

n_queens_solver[7]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

126.6 µs126.8 µs

recursive[30]

crates/divan_compat/examples/benches/math.rs::fibonacci

5.8 ms5.8 ms

sudoku

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

108.3 µs108.6 µs

subset_sum[14]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

2 µs2 µs

graph_coloring[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

1.1 µs1.2 µs

permutations[6]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-1%

65.8 µs66.6 µs

rat_in_maze[5]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-2%

587 ns599 ns

init_array[1000]

crates/divan_compat/benches/basic_example.rs::const_bench

-2%

1.7 µs1.8 µs

recursive[10]

crates/divan_compat/examples/benches/math.rs::fibonacci

-2%

383 ns391 ns

graph_coloring[3]

crates/divan_compat/examples/benches/the_algorithms.rs::backtracking

-3%

1.2 µs1.2 µs

Commits

Click on a commit to change the comparison range

Base

main

6178dd1

-3.01%

chore: remove unnecessary black_box in divan and bencher compat layers Apply the same optimization from PR 98 to both divan and bencher compat layers: - Remove black_box around routine calls during measurement - Only apply black_box to outputs after measurement ends - Reduces stack usage and eliminates unnecessary memory operations - Improves benchmark performance by avoiding artificial overhead 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>

b71c93b

4 months ago

by art049

Home Terms Privacy Docs