From: lkcl <lkcl@web>
Date: Tue, 26 Apr 2022 16:27:55 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2577
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=bcc26dd8e131e97d45d925566bc53cd219cd6a30;p=libreriscv.git

---

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index 76f0a37f5..870263858 100644
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -415,5 +415,5 @@ detection is required.  When the divisor is too small compared to
 the dividend then the result may not fit into 64 bit.  Knuth's
 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 dobe
+this, and also to return an overflow indicator: this can be done
 by always setting Rc=1 as a way to save opcode space