status-im/nim-bncurve
2
0
Fork 0
mirror of https://github.com/status-im/nim-bncurve.git synced 2025-02-25 11:15:24 +00:00
Code Issues Projects Releases Wiki Activity

assert() -> doAssert()

Browse Source
This commit is contained in:
Ștefan Talpalaru 2019-03-14 00:10:49 +01:00
parent 8c74ae19a9
commit c356fd9fa9
No known key found for this signature in database
GPG Key ID: CBF7934204F1B6F9
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
bncurve/arith.nim
View File

@ -119,7 +119,7 @@ proc addNoCarry*(a: var BNU256, b: BNU256) {.inline.} =
a[1] = adc(a[1], b[1], carry) a[1] = adc(a[1], b[1], carry)
a[2] = adc(a[2], b[2], carry) a[2] = adc(a[2], b[2], carry)
a[3] = adc(a[3], b[3], carry) a[3] = adc(a[3], b[3], carry)
assert(carry == 0) doAssert(carry == 0)
proc subNoBorrow*(a: var BNU256, b: BNU256) {.inline.} = proc subNoBorrow*(a: var BNU256, b: BNU256) {.inline.} =
## Calculate integer substraction ``a = a - b``. ## Calculate integer substraction ``a = a - b``.
@ -139,7 +139,7 @@ proc subNoBorrow*(a: var BNU256, b: BNU256) {.inline.} =
a[1] = sbb(a[1], b[1], borrow) a[1] = sbb(a[1], b[1], borrow)
a[2] = sbb(a[2], b[2], borrow) a[2] = sbb(a[2], b[2], borrow)
a[3] = sbb(a[3], b[3], borrow) a[3] = sbb(a[3], b[3], borrow)
assert(borrow == 0) doAssert(borrow == 0)
proc macDigit(acc: var openarray[uint64], pos: int, b: openarray[uint64], proc macDigit(acc: var openarray[uint64], pos: int, b: openarray[uint64],
c: uint64) = c: uint64) =
@ -168,7 +168,7 @@ proc macDigit(acc: var openarray[uint64], pos: int, b: openarray[uint64],
acc[i] = macWithCarry(acc[i], 0'u64, c, carry) acc[i] = macWithCarry(acc[i], 0'u64, c, carry)
else: else:
break break
assert(carry == 0) doAssert(carry == 0)
proc mulReduce(a: var BNU256, by: BNU256, modulus: BNU256, proc mulReduce(a: var BNU256, by: BNU256, modulus: BNU256,
inv: uint64) = inv: uint64) =
@ -248,7 +248,7 @@ proc divrem*(a: BNU512, modulo: BNU256, reminder: var BNU256): Option[BNU256] =
for i in countdown(511, 0): for i in countdown(511, 0):
mul2(reminder) mul2(reminder)
let ret = reminder.setBit(0, a.getBit(i)) let ret = reminder.setBit(0, a.getBit(i))
assert ret doAssert ret
if reminder >= modulo: if reminder >= modulo:
subNoBorrow(reminder, modulo) subNoBorrow(reminder, modulo)
if result.isSome(): if result.isSome():
@ -275,7 +275,7 @@ proc into*(t: typedesc[BNU512], c1: BNU256,
result[i] = adc(result[i], 0'u64, carry) result[i] = adc(result[i], 0'u64, carry)
else: else:
break break
assert(carry == 0'u64) doAssert(carry == 0'u64)
proc fromBytes*(dst: var BNU256, src: openarray[byte]): bool = proc fromBytes*(dst: var BNU256, src: openarray[byte]): bool =
## Create 256bit integer from big-endian bytes representation ``src``. ## Create 256bit integer from big-endian bytes representation ``src``.

2
bncurve/fp.nim
View File

@ -89,7 +89,7 @@ template fieldImplementation(finame, fimodulus, firsquared, fircubed,
acc += finame.one() acc += finame.one()
result.setZero() result.setZero()
for ch in number: for ch in number:
assert(ch in {'0'..'9'}) doAssert(ch in {'0'..'9'})
let idx = ord(ch) - ord('0') let idx = ord(ch) - ord('0')
result *= numis[10] result *= numis[10]
result += numis[idx] result += numis[idx]