From 3c4b4de4464c4b5ffe1ae93750c7d71512e5b239 Mon Sep 17 00:00:00 2001 From: lkcl Date: Mon, 18 Apr 2022 10:58:46 +0100 Subject: [PATCH] --- openpower/sv/bitmanip/appendix.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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: ``` void div(uint32_t *n, uint32_t *d, uint32_t* q, int n_bytes, int d_bytes) { -- 2.30.2