(no commit message)

diff --git a/openpower/sv/rfc/ls012.mdwn b/openpower/sv/rfc/ls012.mdwn
index 2dbde3444107835bf49cee0feb4fc8d20517a099..99fcbec2ee02a07400a62eb2f6b95429e86f2cb6 100644 (file)
--- 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.