|
| 1 | +use benches::bench; |
| 2 | +use bevy_math::{prelude::*, VectorSpace}; |
1 | 3 | use core::hint::black_box; |
| 4 | +use criterion::{ |
| 5 | + criterion_group, measurement::Measurement, BatchSize, BenchmarkGroup, BenchmarkId, Criterion, |
| 6 | +}; |
2 | 7 |
|
3 | | -use criterion::{criterion_group, Criterion}; |
| 8 | +criterion_group!(benches, segment_ease, curve_position, curve_iter_positions); |
4 | 9 |
|
5 | | -use bevy_math::prelude::*; |
| 10 | +fn segment_ease(c: &mut Criterion) { |
| 11 | + let segment = black_box(CubicSegment::new_bezier(vec2(0.25, 0.1), vec2(0.25, 1.0))); |
6 | 12 |
|
7 | | -fn easing(c: &mut Criterion) { |
8 | | - let cubic_bezier = CubicSegment::new_bezier(vec2(0.25, 0.1), vec2(0.25, 1.0)); |
9 | | - c.bench_function("easing_1000", |b| { |
10 | | - b.iter(|| { |
11 | | - (0..1000).map(|i| i as f32 / 1000.0).for_each(|t| { |
12 | | - black_box(cubic_bezier.ease(black_box(t))); |
13 | | - }); |
14 | | - }); |
| 13 | + c.bench_function(bench!("segment_ease"), |b| { |
| 14 | + let mut t = 0; |
| 15 | + |
| 16 | + b.iter_batched( |
| 17 | + || { |
| 18 | + // Increment `t` by 1, but use modulo to constrain it to `0..=1000`. |
| 19 | + t = (t + 1) % 1001; |
| 20 | + |
| 21 | + // Return time as a decimal between 0 and 1, inclusive. |
| 22 | + t as f32 / 1000.0 |
| 23 | + }, |
| 24 | + |t| segment.ease(t), |
| 25 | + BatchSize::SmallInput, |
| 26 | + ); |
15 | 27 | }); |
16 | 28 | } |
17 | 29 |
|
18 | | -fn cubic_2d(c: &mut Criterion) { |
19 | | - let bezier = CubicBezier::new([[ |
| 30 | +fn curve_position(c: &mut Criterion) { |
| 31 | + /// A helper function that benchmarks calling [`CubicCurve::position()`] over a generic [`VectorSpace`]. |
| 32 | + fn bench_curve<M: Measurement, P: VectorSpace>( |
| 33 | + group: &mut BenchmarkGroup<M>, |
| 34 | + name: &str, |
| 35 | + curve: CubicCurve<P>, |
| 36 | + ) { |
| 37 | + group.bench_with_input(BenchmarkId::from_parameter(name), &curve, |b, curve| { |
| 38 | + b.iter(|| curve.position(black_box(0.5))); |
| 39 | + }); |
| 40 | + } |
| 41 | + |
| 42 | + let mut group = c.benchmark_group(bench!("curve_position")); |
| 43 | + |
| 44 | + let bezier_2 = CubicBezier::new([[ |
20 | 45 | vec2(0.0, 0.0), |
21 | 46 | vec2(0.0, 1.0), |
22 | 47 | vec2(1.0, 0.0), |
23 | 48 | vec2(1.0, 1.0), |
24 | 49 | ]]) |
25 | 50 | .to_curve() |
26 | | - .expect("Unable to build a curve from this data"); |
27 | | - c.bench_function("cubic_position_Vec2", |b| { |
28 | | - b.iter(|| black_box(bezier.position(black_box(0.5)))); |
29 | | - }); |
30 | | -} |
| 51 | + .unwrap(); |
31 | 52 |
|
32 | | -fn cubic(c: &mut Criterion) { |
33 | | - let bezier = CubicBezier::new([[ |
34 | | - vec3a(0.0, 0.0, 0.0), |
35 | | - vec3a(0.0, 1.0, 0.0), |
36 | | - vec3a(1.0, 0.0, 0.0), |
37 | | - vec3a(1.0, 1.0, 1.0), |
38 | | - ]]) |
39 | | - .to_curve() |
40 | | - .expect("Unable to build a curve from this data"); |
41 | | - c.bench_function("cubic_position_Vec3A", |b| { |
42 | | - b.iter(|| black_box(bezier.position(black_box(0.5)))); |
43 | | - }); |
44 | | -} |
| 53 | + bench_curve(&mut group, "vec2", bezier_2); |
45 | 54 |
|
46 | | -fn cubic_vec3(c: &mut Criterion) { |
47 | | - let bezier = CubicBezier::new([[ |
| 55 | + let bezier_3 = CubicBezier::new([[ |
48 | 56 | vec3(0.0, 0.0, 0.0), |
49 | 57 | vec3(0.0, 1.0, 0.0), |
50 | 58 | vec3(1.0, 0.0, 0.0), |
51 | 59 | vec3(1.0, 1.0, 1.0), |
52 | 60 | ]]) |
53 | 61 | .to_curve() |
54 | | - .expect("Unable to build a curve from this data"); |
55 | | - c.bench_function("cubic_position_Vec3", |b| { |
56 | | - b.iter(|| black_box(bezier.position(black_box(0.5)))); |
57 | | - }); |
58 | | -} |
| 62 | + .unwrap(); |
59 | 63 |
|
60 | | -fn build_pos_cubic(c: &mut Criterion) { |
61 | | - let bezier = CubicBezier::new([[ |
| 64 | + bench_curve(&mut group, "vec3", bezier_3); |
| 65 | + |
| 66 | + let bezier_3a = CubicBezier::new([[ |
62 | 67 | vec3a(0.0, 0.0, 0.0), |
63 | 68 | vec3a(0.0, 1.0, 0.0), |
64 | 69 | vec3a(1.0, 0.0, 0.0), |
65 | 70 | vec3a(1.0, 1.0, 1.0), |
66 | 71 | ]]) |
67 | 72 | .to_curve() |
68 | | - .expect("Unable to build a curve from this data"); |
69 | | - c.bench_function("build_pos_cubic_100_points", |b| { |
70 | | - b.iter(|| black_box(bezier.iter_positions(black_box(100)).collect::<Vec<_>>())); |
71 | | - }); |
| 73 | + .unwrap(); |
| 74 | + |
| 75 | + bench_curve(&mut group, "vec3a", bezier_3a); |
| 76 | + |
| 77 | + group.finish(); |
72 | 78 | } |
73 | 79 |
|
74 | | -fn build_accel_cubic(c: &mut Criterion) { |
| 80 | +fn curve_iter_positions(c: &mut Criterion) { |
75 | 81 | let bezier = CubicBezier::new([[ |
76 | 82 | vec3a(0.0, 0.0, 0.0), |
77 | 83 | vec3a(0.0, 1.0, 0.0), |
78 | 84 | vec3a(1.0, 0.0, 0.0), |
79 | 85 | vec3a(1.0, 1.0, 1.0), |
80 | 86 | ]]) |
81 | 87 | .to_curve() |
82 | | - .expect("Unable to build a curve from this data"); |
83 | | - c.bench_function("build_accel_cubic_100_points", |b| { |
84 | | - b.iter(|| black_box(bezier.iter_positions(black_box(100)).collect::<Vec<_>>())); |
| 88 | + .unwrap(); |
| 89 | + |
| 90 | + c.bench_function(bench!("curve_iter_positions"), |b| { |
| 91 | + b.iter(|| { |
| 92 | + for x in bezier.iter_positions(black_box(100)) { |
| 93 | + // Discard `x`, since we just care about `iter_positions()` being consumed, but make |
| 94 | + // the compiler believe `x` is being used so it doesn't eliminate the iterator. |
| 95 | + black_box(x); |
| 96 | + } |
| 97 | + }); |
85 | 98 | }); |
86 | 99 | } |
87 | | - |
88 | | -criterion_group!( |
89 | | - benches, |
90 | | - easing, |
91 | | - cubic_2d, |
92 | | - cubic_vec3, |
93 | | - cubic, |
94 | | - build_pos_cubic, |
95 | | - build_accel_cubic, |
96 | | -); |
|
0 commit comments