(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index a19e6bdcc6d78a0588578cba4835b33a60716a85..8ddce0c3a91dc595df647e1b7b45cad11754af46 100644 (file)
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -497,7 +497,12 @@ may perform massively-wide DIV/MOD by transparently merging (fusing)
 the Vector element operations together, only inputting a single RC and
 outputting the last RC. Where efficient algorithms such as Goldschmidt
 are deployed internally this could dramatically reduce the cycle completion
-time for massive Vector DIV/MOD.
+time for massive Vector DIV/MOD.  Thus, just as with the other operations
+the apparent limitation of creating chains is overcome: SVP64 is,
+by design, an "expression of intent" where the implementor is free to
+achieve that intent in any way they see fit
+as long as strict precise-aware Program Order is
+preserved (even on the VL for-loops).
 
 Just as with `divdeu` on which this instruction is based an overflow
 detection is required.  When the divisor is too small compared to