Merge pull request cosmos#30 from tendermint/sdk2-benchmarks

Sdk2 benchmarks

benchmarks/bench_test.go

@@ -11,14 +11,16 @@ import (
 	db "github.com/tendermint/tmlibs/db"
 )
 
+const historySize = 20
+
 func randBytes(length int) []byte {
 	key := make([]byte, length)
 	// math.rand.Read always returns err=nil
 	rand.Read(key)
 	return key
 }
 
-func prepareTree(db db.DB, size, keyLen, dataLen int) (*iavl.VersionedTree, [][]byte) {
+func prepareTree(b *testing.B, db db.DB, size, keyLen, dataLen int) (*iavl.VersionedTree, [][]byte) {
 	t := iavl.NewVersionedTree(db, size)
 	keys := make([][]byte, size)
 
@@ -27,12 +29,26 @@ func prepareTree(db db.DB, size, keyLen, dataLen int) (*iavl.VersionedTree, [][]
 		t.Set(key, randBytes(dataLen))
 		keys[i] = key
 	}
-	t.Hash()
-	t.SaveVersion()
+	commitTree(b, t)
 	runtime.GC()
 	return t, keys
 }
 
+// commit tree saves a new version and deletes and old one...
+func commitTree(b *testing.B, t *iavl.VersionedTree) {
+	t.Hash()
+	_, version, err := t.SaveVersion()
+	if err != nil {
+		b.Errorf("Can't save: %v", err)
+	}
+	if version > historySize {
+		err = t.DeleteVersion(version - historySize)
+		if err != nil {
+			b.Errorf("Can't delete: %v", err)
+		}
+	}
+}
+
 func runQueries(b *testing.B, t *iavl.VersionedTree, keyLen int) {
 	for i := 0; i < b.N; i++ {
 		q := randBytes(keyLen)
@@ -65,8 +81,7 @@ func runUpdate(b *testing.B, t *iavl.VersionedTree, dataLen, blockSize int, keys
 		key := keys[rand.Int31n(l)]
 		t.Set(key, randBytes(dataLen))
 		if i%blockSize == 0 {
-			t.Hash()
-			t.SaveVersion()
+			commitTree(b, t)
 		}
 	}
 	return t
@@ -81,8 +96,7 @@ func runDelete(b *testing.B, t *iavl.VersionedTree, blockSize int, keys [][]byte
 		// TODO: test if removed, use more keys (from insert)
 		t.Remove(key)
 		if i%blockSize == 0 {
-			t.Hash()
-			t.SaveVersion()
+			commitTree(b, t)
 		}
 	}
 	return t
@@ -96,7 +110,7 @@ func runBlock(b *testing.B, t *iavl.VersionedTree, keyLen, dataLen, blockSize in
 
 	lastCommit := t
 	real := t
-	check := t
+	// check := t
 
 	for i := 0; i < b.N; i++ {
 		for j := 0; j < blockSize; j++ {
@@ -110,15 +124,14 @@ func runBlock(b *testing.B, t *iavl.VersionedTree, keyLen, dataLen, blockSize in
 			data := randBytes(dataLen)
 
 			// perform query and write on check and then real
-			check.Get(key)
-			check.Set(key, data)
+			// check.Get(key)
+			// check.Set(key, data)
 			real.Get(key)
 			real.Set(key, data)
 		}
 
 		// at the end of a block, move it all along....
-		real.Hash()
-		real.SaveVersion()
+		commitTree(b, real)
 		lastCommit = real
 	}
 
@@ -214,7 +227,7 @@ func runBenchmarks(b *testing.B, benchmarks []benchmark) {
 		defer func() {
 			err := os.RemoveAll(dirName)
 			if err != nil {
-				fmt.Printf("%+v\n", err)
+				b.Errorf("%+v\n", err)
 			}
 		}()
 
@@ -244,7 +257,7 @@ func runSuite(b *testing.B, d db.DB, initSize, blockSize, keyLen, dataLen int) {
 	runtime.GC()
 	init := memUseMB()
 
-	t, keys := prepareTree(d, initSize, keyLen, dataLen)
+	t, keys := prepareTree(b, d, initSize, keyLen, dataLen)
 	used := memUseMB() - init
 	fmt.Printf("Init Tree took %0.2f MB\n", used)
 
@@ -265,15 +278,15 @@ func runSuite(b *testing.B, d db.DB, initSize, blockSize, keyLen, dataLen int) {
 
 	// both of these edit size of the tree too much
 	// need to run with their own tree
-	t = nil // for gc
-	b.Run("insert", func(sub *testing.B) {
-		it, _ := prepareTree(d, initSize, keyLen, dataLen)
-		sub.ResetTimer()
-		runInsert(sub, it, keyLen, dataLen, blockSize)
-	})
-	b.Run("delete", func(sub *testing.B) {
-		dt, dkeys := prepareTree(d, initSize+sub.N, keyLen, dataLen)
-		sub.ResetTimer()
-		runDelete(sub, dt, blockSize, dkeys)
-	})
+	// t = nil // for gc
+	// b.Run("insert", func(sub *testing.B) {
+	// 	it, _ := prepareTree(d, initSize, keyLen, dataLen)
+	// 	sub.ResetTimer()
+	// 	runInsert(sub, it, keyLen, dataLen, blockSize)
+	// })
+	// b.Run("delete", func(sub *testing.B) {
+	// 	dt, dkeys := prepareTree(d, initSize+sub.N, keyLen, dataLen)
+	// 	sub.ResetTimer()
+	// 	runDelete(sub, dt, blockSize, dkeys)
+	// })
 }

benchmarks/hash_test.go

@@ -0,0 +1,47 @@
+package benchmarks
+
+import (
+	"crypto"
+	"fmt"
+	"hash"
+	"testing"
+
+	_ "crypto/sha256"
+
+	_ "golang.org/x/crypto/ripemd160"
+	_ "golang.org/x/crypto/sha3"
+)
+
+func BenchmarkHash(b *testing.B) {
+	hashers := []struct {
+		name   string
+		size   int
+		hasher hash.Hash
+	}{
+		{"ripemd160", 64, crypto.RIPEMD160.New()},
+		{"ripemd160", 512, crypto.RIPEMD160.New()},
+		{"sha2-256", 64, crypto.SHA256.New()},
+		{"sha2-256", 512, crypto.SHA256.New()},
+		{"sha3-256", 64, crypto.SHA3_256.New()},
+		{"sha3-256", 512, crypto.SHA3_256.New()},
+	}
+
+	for _, h := range hashers {
+		prefix := fmt.Sprintf("%s-%d", h.name, h.size)
+		b.Run(prefix, func(sub *testing.B) {
+			benchHasher(sub, h.hasher, h.size)
+		})
+	}
+}
+
+func benchHasher(b *testing.B, hasher hash.Hash, size int) {
+	// create all random bytes before to avoid timing this
+	inputs := randBytes(b.N + size + 1)
+
+	for i := 0; i < b.N; i++ {
+		hasher.Reset()
+		// grab a slice of size bytes from random string
+		hasher.Write(inputs[i : i+size])
+		hasher.Sum(nil)
+	}
+}