2020-03-20 22:03:52 +00:00
|
|
|
# Constantine
|
|
|
|
# Copyright (c) 2018-2019 Status Research & Development GmbH
|
|
|
|
# Copyright (c) 2020-Present Mamy André-Ratsimbazafy
|
|
|
|
# Licensed and distributed under either of
|
|
|
|
# * MIT license (license terms in the root directory or at http://opensource.org/licenses/MIT).
|
|
|
|
# * Apache v2 license (license terms in the root directory or at http://www.apache.org/licenses/LICENSE-2.0).
|
|
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
|
|
|
|
# ############################################################
|
|
|
|
#
|
|
|
|
# Benchmark of finite fields
|
|
|
|
#
|
|
|
|
# ############################################################
|
|
|
|
|
|
|
|
import
|
|
|
|
# Internals
|
2020-04-14 00:05:42 +00:00
|
|
|
../constantine/config/curves,
|
2020-03-20 22:03:52 +00:00
|
|
|
../constantine/arithmetic,
|
2020-04-14 00:05:42 +00:00
|
|
|
../constantine/towers,
|
2020-03-20 22:03:52 +00:00
|
|
|
# Helpers
|
|
|
|
../helpers/[timers, prng, static_for],
|
|
|
|
# Standard library
|
|
|
|
std/[monotimes, times, strformat, strutils, macros]
|
|
|
|
|
|
|
|
var rng: RngState
|
|
|
|
let seed = uint32(getTime().toUnix() and (1'i64 shl 32 - 1)) # unixTime mod 2^32
|
|
|
|
rng.seed(seed)
|
2020-03-21 01:31:31 +00:00
|
|
|
echo "bench xoshiro512** seed: ", seed
|
2020-03-20 22:03:52 +00:00
|
|
|
|
|
|
|
# warmup
|
|
|
|
proc warmup*() =
|
|
|
|
# Warmup - make sure cpu is on max perf
|
|
|
|
let start = cpuTime()
|
|
|
|
var foo = 123
|
|
|
|
for i in 0 ..< 300_000_000:
|
|
|
|
foo += i*i mod 456
|
|
|
|
foo = foo mod 789
|
|
|
|
|
|
|
|
# Compiler shouldn't optimize away the results as cpuTime rely on sideeffects
|
|
|
|
let stop = cpuTime()
|
|
|
|
echo &"Warmup: {stop - start:>4.4f} s, result {foo} (displayed to avoid compiler optimizing warmup away)\n"
|
|
|
|
|
|
|
|
warmup()
|
|
|
|
|
|
|
|
echo "\n⚠️ Measurements are approximate and use the CPU nominal clock: Turbo-Boost and overclocking will skew them."
|
|
|
|
echo "==========================================================================================================\n"
|
|
|
|
echo "All benchmarks are using constant-time implementations to protect against side-channel attacks."
|
|
|
|
when defined(gcc):
|
|
|
|
echo "\nCompiled with GCC"
|
|
|
|
elif defined(clang):
|
|
|
|
echo "\nCompiled with Clang"
|
|
|
|
elif defined(vcc):
|
|
|
|
echo "\nCompiled with MSVC"
|
|
|
|
elif defined(icc):
|
|
|
|
echo "\nCompiled with ICC"
|
|
|
|
else:
|
|
|
|
echo "\nCompiled with an unknown compiler"
|
|
|
|
|
|
|
|
when defined(i386) or defined(amd64):
|
|
|
|
import ../helpers/x86
|
|
|
|
echo "Running on ", cpuName(), "\n\n"
|
|
|
|
|
|
|
|
proc report(op, field: string, start, stop: MonoTime, startClk, stopClk: int64, iters: int) =
|
|
|
|
echo &"{op:<15} {field:<15} {inNanoseconds((stop-start) div iters):>9} ns {(stopClk - startClk) div iters:>9} cycles"
|
|
|
|
|
|
|
|
macro fixFieldDisplay(T: typedesc): untyped =
|
|
|
|
# At compile-time, enums are integers and their display is buggy
|
|
|
|
# we get the Curve ID instead of the curve name.
|
|
|
|
let instantiated = T.getTypeInst()
|
|
|
|
var name = $instantiated[1][0] # Fp
|
|
|
|
name.add "[" & $Curve(instantiated[1][1].intVal) & "]"
|
|
|
|
result = newLit name
|
|
|
|
|
|
|
|
template bench(op: string, T: typedesc, iters: int, body: untyped): untyped =
|
|
|
|
let start = getMonotime()
|
|
|
|
let startClk = getTicks()
|
|
|
|
for _ in 0 ..< iters:
|
|
|
|
body
|
|
|
|
let stopClk = getTicks()
|
|
|
|
let stop = getMonotime()
|
|
|
|
|
|
|
|
report(op, fixFieldDisplay(T), start, stop, startClk, stopClk, iters)
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc addBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var x = rng.random(T)
|
|
|
|
let y = rng.random(T)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Addition", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
x += y
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc subBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var x = rng.random(T)
|
|
|
|
let y = rng.random(T)
|
|
|
|
preventOptimAway(x)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Substraction", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
x -= y
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc negBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var r: T
|
|
|
|
let x = rng.random(T)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Negation", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
r.neg(x)
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc mulBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var r: T
|
|
|
|
let x = rng.random(T)
|
|
|
|
let y = rng.random(T)
|
|
|
|
preventOptimAway(r)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Multiplication", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
r.prod(x, y)
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc sqrBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var r: T
|
|
|
|
let x = rng.random(T)
|
|
|
|
preventOptimAway(r)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Squaring", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
r.square(x)
|
|
|
|
|
2020-03-21 01:31:31 +00:00
|
|
|
proc invBench*(T: typedesc, iters: int) =
|
2020-03-20 22:03:52 +00:00
|
|
|
var r: T
|
|
|
|
let x = rng.random(T)
|
|
|
|
preventOptimAway(r)
|
2020-03-21 01:31:31 +00:00
|
|
|
bench("Inversion", T, iters):
|
2020-03-20 22:03:52 +00:00
|
|
|
r.inv(x)
|