From: Luke Kenneth Casson Leighton <lkcl@lkcl.net>
Date: Tue, 6 Feb 2024 13:42:44 +0000 (+0000)
Subject: whitespace
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=dd33433cb60076d7b3c01665318fa713f5024536;p=libreriscv.git

whitespace
---

diff --git a/openpower/sv/cookbook/fortran_maxloc.mdwn b/openpower/sv/cookbook/fortran_maxloc.mdwn
index c8c12b775..b06e34b4f 100644
--- a/openpower/sv/cookbook/fortran_maxloc.mdwn
+++ b/openpower/sv/cookbook/fortran_maxloc.mdwn
@@ -27,10 +27,10 @@ int m2(int * const restrict a, int n)
 
 **AVX-512**
 
-An informative article by Vamsi Sripathi of Intel shows the extent of the problem
-faced by SIMD ISAs (in the case below, AVX-512). Significant loop-unrolling is performed
-which leaves blocks that need to be merged: this is carried out with "blending"
-instructions.
+An informative article by Vamsi Sripathi of Intel shows the extent of
+the problem faced by SIMD ISAs (in the case below, AVX-512). Significant
+loop-unrolling is performed which leaves blocks that need to be merged:
+this is carried out with "blending" instructions.
 
 Article:
 <https://www.intel.com/content/www/us/en/developer/articles/technical/optimizing-maxloc-operation-using-avx-512-vector-instructions.html#gs.12t5y0>
@@ -81,9 +81,9 @@ VMIN8(v8, ret_pos, ret);
 
 **Rust Assembler Intrinsics**
 
-An approach by jvdd shows that the two stage approach of "blending" arrays of
-results in a type of parallelised "leaf node depth first" search seems to be
-a common technique.
+An approach by jvdd shows that the two stage approach of "blending"
+arrays of results in a type of parallelised "leaf node depth first"
+search seems to be a common technique.
 
 <https://github.com/jvdd/argminmax/blob/main/src/simd/simd_u64.rs>