diff options
| author | Sanjay Patel <spatel@rotateright.com> | 2014-09-11 15:41:01 +0000 |
|---|---|---|
| committer | Sanjay Patel <spatel@rotateright.com> | 2014-09-11 15:41:01 +0000 |
| commit | 4cb54e0a789392b1109f4ca1cb80fba5411aa449 (patch) | |
| tree | 50aad033c75ae56ef4533c01b9588b46525eff5b /llvm/lib/Support | |
| parent | 1885e53a75cb7ea18297785c9e3f1d0cc2560f4c (diff) | |
| download | bcm5719-llvm-4cb54e0a789392b1109f4ca1cb80fba5411aa449.tar.gz bcm5719-llvm-4cb54e0a789392b1109f4ca1cb80fba5411aa449.zip | |
typo
llvm-svn: 217597
Diffstat (limited to 'llvm/lib/Support')
| -rw-r--r-- | llvm/lib/Support/APInt.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/Support/APInt.cpp b/llvm/lib/Support/APInt.cpp index fa929eb0a55..91895f360a1 100644 --- a/llvm/lib/Support/APInt.cpp +++ b/llvm/lib/Support/APInt.cpp @@ -1303,7 +1303,7 @@ APInt APInt::sqrt() const { // Okay, all the short cuts are exhausted. We must compute it. The following // is a classical Babylonian method for computing the square root. This code - // was adapted to APINt from a wikipedia article on such computations. + // was adapted to APInt from a wikipedia article on such computations. // See http://www.wikipedia.org/ and go to the page named // Calculate_an_integer_square_root. unsigned nbits = BitWidth, i = 4; |
