1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76
|
/*
* hashing_test.go - tests for computing and benchmarking hashing costs
*
* Copyright 2017 Google Inc.
* Author: Joe Richey (joerichey@google.com)
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
package actions
import (
"io"
"log"
"testing"
"time"
)
// Tests that we can find valid hashing costs for various time targets and the
// estimations are somewhat close to the targets.
func TestCostsSearch(t *testing.T) {
for _, target := range []time.Duration{
100 * time.Millisecond,
200 * time.Millisecond,
500 * time.Millisecond,
} {
costs, err := getHashingCosts(target)
if err != nil {
t.Error(err)
}
actual, err := timeHashingCosts(costs)
if err != nil {
t.Error(err)
}
if actual*3 < target {
t.Errorf("actual=%v is too small (target=%v)", actual, target)
}
if target*3 < actual {
t.Errorf("actual=%v is too big (target=%v)", actual, target)
}
}
}
func benchmarkCostsSearch(b *testing.B, target time.Duration) {
// Disable logging for benchmarks
log.SetOutput(io.Discard)
for i := 0; i < b.N; i++ {
_, err := getHashingCosts(target)
if err != nil {
b.Fatal(err)
}
}
}
func BenchmarkCostsSearch10ms(b *testing.B) {
benchmarkCostsSearch(b, 10*time.Millisecond)
}
func BenchmarkCostsSearch100ms(b *testing.B) {
benchmarkCostsSearch(b, 100*time.Millisecond)
}
func BenchmarkCostsSearch1s(b *testing.B) {
benchmarkCostsSearch(b, time.Second)
}
|