(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index 870263858f002f568196d981c53954bb7c38b2df..7c1f423e226ce573d6997b3261dafb1b3af05083 100644 (file)
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -417,3 +417,7 @@ original algorithm detects overflow and manually places 0xffffffff
 (all ones) into `qhat`. It makes sense for `divrem2du` to do
 this, and also to return an overflow indicator: this can be done
 by always setting Rc=1 as a way to save opcode space
+
+Looking closely at the loop however we can see that overflow 
+will not occur. The initial value k is zero, and on subsequent iterations
+new k, being the modulo, is always less than the divisor