From bf1f63a2738ef80d7aa2270183ebc36b4d0c0710 Mon Sep 17 00:00:00 2001
From: Adam Langley <agl@golang.org>
Date: Wed, 18 Nov 2009 19:26:12 -0800
Subject: [PATCH] big: fix large division.

I missed a case.

R=rsc, agl
CC=golang-dev
https://golang.org/cl/156092
---
 src/pkg/big/nat.go | 32 +++++++++++++++++++-------------
 1 file changed, 19 insertions(+), 13 deletions(-)

diff --git a/src/pkg/big/nat.go b/src/pkg/big/nat.go
index 8fabd7c8d0..7fad9f8298 100644
--- a/src/pkg/big/nat.go
+++ b/src/pkg/big/nat.go
@@ -310,20 +310,26 @@ func divLargeNN(z, z2, uIn, v []Word) (q, r []Word) {
 	// D2.
 	for j := m; j >= 0; j-- {
 		// D3.
-		qhat, rhat := divWW_g(u[j+n], u[j+n-1], v[n-1]);
-
-		// x1 | x2 = q̂v_{n-2}
-		x1, x2 := mulWW_g(qhat, v[n-2]);
-		// test if q̂v_{n-2} > br̂ + u_{j+n-2}
-		for greaterThan(x1, x2, rhat, u[j+n-2]) {
-			qhat--;
-			prevRhat := rhat;
-			rhat += v[n-1];
-			// v[n-1] >= 0, so this tests for overflow.
-			if rhat < prevRhat {
-				break
+		var qhat Word;
+		if u[j+n] == v[n-1] {
+			qhat = _B - 1
+		} else {
+			var rhat Word;
+			qhat, rhat = divWW_g(u[j+n], u[j+n-1], v[n-1]);
+
+			// x1 | x2 = q̂v_{n-2}
+			x1, x2 := mulWW_g(qhat, v[n-2]);
+			// test if q̂v_{n-2} > br̂ + u_{j+n-2}
+			for greaterThan(x1, x2, rhat, u[j+n-2]) {
+				qhat--;
+				prevRhat := rhat;
+				rhat += v[n-1];
+				// v[n-1] >= 0, so this tests for overflow.
+				if rhat < prevRhat {
+					break
+				}
+				x1, x2 = mulWW_g(qhat, v[n-2]);
 			}
-			x1, x2 = mulWW_g(qhat, v[n-2]);
 		}
 
 		// D4.
-- 
2.50.0