(no commit message)

diff --git a/openpower/sv/bitmanip/appendix.mdwn b/openpower/sv/bitmanip/appendix.mdwn
index 59dc6f5f5b63a9c6c829be5af9437ee9e2716ae3..d6f5907e43d8bc473887b0d9865cf971c7f277bf 100644 (file)
--- 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) {