From: lkcl <lkcl@web>
Date: Mon, 11 Oct 2021 14:17:42 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~3654
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=916dda5e498d67b623c79a441ad01b50b61bb6c8;p=libreriscv.git

---

diff --git a/3d_gpu/architecture/dynamic_simd/eq.mdwn b/3d_gpu/architecture/dynamic_simd/eq.mdwn
index afee600f8..040cc2f15 100644
--- a/3d_gpu/architecture/dynamic_simd/eq.mdwn
+++ b/3d_gpu/architecture/dynamic_simd/eq.mdwn
@@ -8,6 +8,10 @@ is compared (eq'd), then, depending on the partitions, those partial
 results are ANDed together, on the basis that these chains will tell
 if *all* bits in a particular partition are equal.
 
+The end result is the *appearance* of having performed larger dynamic
+partitioned equality (==) operator comparisons, but actually those
+larger comparisons were constructed from smaller parts.
+
 Examples:
 
 * p2p1p0 all zeros indicates that the partitions are all closed, turning our 4 input byte-level compares into a 32-bit compare.  by ANDing all 4 byte-level compares we get a 32-bit result