From: lkcl <lkcl@web>
Date: Mon, 18 Apr 2022 09:58:46 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2736
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=3c4b4de4464c4b5ffe1ae93750c7d71512e5b239;p=libreriscv.git

---

diff --git a/openpower/sv/bitmanip/appendix.mdwn b/openpower/sv/bitmanip/appendix.mdwn
index 59dc6f5f5..d6f5907e4 100644
--- a/openpower/sv/bitmanip/appendix.mdwn
+++ b/openpower/sv/bitmanip/appendix.mdwn
@@ -12,7 +12,7 @@ links
 the most efficient division algorithm is probably Knuth's Algorithm D (with modifications from the exercises section of his book) which is O(n^2) and uses 2N-by-N-bit div/rem
 
 an oversimplified version of the knuth algorithm d with 32-bit words is:
-(TODO find original)
+(TODO find original: <https://raw.githubusercontent.com/hcs0/Hackers-Delight/master/divmnu64.c.txt>
 
 ```
 void div(uint32_t *n, uint32_t *d, uint32_t* q, int n_bytes, int d_bytes) {