projects
/
libreriscv.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
b1992b0
)
(no commit message)
author
lkcl
<lkcl@web>
Fri, 29 Apr 2022 11:44:14 +0000
(12:44 +0100)
committer
IkiWiki
<ikiwiki.info>
Fri, 29 Apr 2022 11:44:14 +0000
(12:44 +0100)
openpower/sv/biginteger/analysis.mdwn
patch
|
blob
|
history
diff --git
a/openpower/sv/biginteger/analysis.mdwn
b/openpower/sv/biginteger/analysis.mdwn
index 3024a02e7efea8ca5684b33049c7a3698c1c6376..a19e6bdcc6d78a0588578cba4835b33a60716a85 100644
(file)
--- a/
openpower/sv/biginteger/analysis.mdwn
+++ b/
openpower/sv/biginteger/analysis.mdwn
@@
-492,6
+492,13
@@
allows the instruction to perform full parallel vector div/mod,
or act in loop-back mode for big-int division by a scalar,
or for a single scalar 128/64 div/mod.
or act in loop-back mode for big-int division by a scalar,
or for a single scalar 128/64 div/mod.
+Again, just as with `sv.madded` and `sv.adde`, adventurous implementors
+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.
+
Just as with `divdeu` on which this instruction is based an overflow
detection is required. When the divisor is too small compared to
the dividend then the result may not fit into 64 bit. Knuth's
Just as with `divdeu` on which this instruction is based an overflow
detection is required. When the divisor is too small compared to
the dividend then the result may not fit into 64 bit. Knuth's