From: lkcl <lkcl@web>
Date: Sun, 30 Apr 2023 01:57:09 +0000 (+0100)
Subject: (no commit message)
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=6530288a2d402dd3968d73324d2c11c7d33cd076;p=libreriscv.git

---

diff --git a/openpower/sv/rfc/ls012.mdwn b/openpower/sv/rfc/ls012.mdwn
index 2dbde3444..99fcbec2e 100644
--- a/openpower/sv/rfc/ls012.mdwn
+++ b/openpower/sv/rfc/ls012.mdwn
@@ -588,7 +588,8 @@ top speed.
 
 In the case of divide or Transcendentals the algorithms needed are so
 complex that simple implementations can often take an astounding 128
-clock cycles to complete.  Other instructions waiting for the results
+clock cycles to complete (Goldschmidtt reduces that significantly).
+Other instructions waiting for the results
 will back up and eventually stall, where in-order systems pretty much
 just stall straight away.