File tree 2 files changed +6
-8
lines changed
2 files changed +6
-8
lines changed Original file line number Diff line number Diff line change @@ -206,11 +206,10 @@ impl f32 {
206
206
/// Fused multiply-add. Computes `(self * a) + b` with only one rounding
207
207
/// error, yielding a more accurate result than an unfused multiply-add.
208
208
///
209
- /// Using `mul_add` *can * be more performant than an unfused multiply-add if
209
+ /// Using `mul_add` *may * be more performant than an unfused multiply-add if
210
210
/// the target architecture has a dedicated `fma` CPU instruction. However,
211
- /// this is not always true, and care must be taken not to overload the
212
- /// architecture's available FMA units when using many FMA instructions
213
- /// in a row, which can cause a stall and performance degradation.
211
+ /// this is not always true, and will be heavily dependant on designing
212
+ /// algorithms with specific target hardware in mind.
214
213
///
215
214
/// # Examples
216
215
///
Original file line number Diff line number Diff line change @@ -206,11 +206,10 @@ impl f64 {
206
206
/// Fused multiply-add. Computes `(self * a) + b` with only one rounding
207
207
/// error, yielding a more accurate result than an unfused multiply-add.
208
208
///
209
- /// Using `mul_add` *can * be more performant than an unfused multiply-add if
209
+ /// Using `mul_add` *may * be more performant than an unfused multiply-add if
210
210
/// the target architecture has a dedicated `fma` CPU instruction. However,
211
- /// this is not always true, and care must be taken not to overload the
212
- /// architecture's available FMA units when using many FMA instructions
213
- /// in a row, which can cause a stall and performance degradation.
211
+ /// this is not always true, and will be heavily dependant on designing
212
+ /// algorithms with specific target hardware in mind.
214
213
///
215
214
/// # Examples
216
215
///
You can’t perform that action at this time.
0 commit comments