Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

benchmarkLookup #5

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
99 changes: 98 additions & 1 deletion iptree/iptree_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,12 @@

package iptree

import "testing"
import (
"fmt"
"math/rand"
"testing"
"time"
)

func TestCreate(t *testing.T) {
i := New()
Expand Down Expand Up @@ -72,3 +77,95 @@ func TestFailingSubnet(t *testing.T) {
}

}

// randNumber returns a random integer between 1 and maxIP
func randNumber(maxIP int) int {
return rand.Intn(maxIP-1) + 1
}

// benchmarkLookup is a crude iptree benchmark tool
// 1. Generates an iptree of IPs from 1.1.1.1 -> maxIP.maxIP.maxIP.maxIP
// 2. Generates a big list of random IPs to lookup. Range of each octet is 1-maxIP
// 3. Resets the benchmark timer, so the setup step 1-2 don't count in the benchmark
// 4. Performs the lookups
// TODO - This is a pretty crude test. Probably should use maps.
func benchmarkLookup(debugLevel int, maxIP int, lookups int, b *testing.B) {

if debugLevel > 100 {
fmt.Println("benchmarkLookup\tmaxIP:", maxIP, "\tlookups:", lookups)
}

var startMap = map[string]int{
"a": 1,
"b": 1,
"c": 1,
"d": 1,
}

var endMap = map[string]int{
"a": maxIP,
"b": maxIP,
"c": maxIP,
"d": maxIP,
}

var i int = 0
ip := New()
for a := startMap["a"]; a < endMap["a"]; a++ {
for b := startMap["b"]; b < endMap["b"]; b++ {
for c := startMap["c"]; c < endMap["c"]; c++ {
for d := startMap["d"]; d < endMap["d"]; d++ {
ipString := fmt.Sprintf("%d.%d.%d.%d/32", a, b, c, d)
ipLabel := fmt.Sprintf("a=%d.b=%d.c=%d.d=%d", a, b, c, d)
ip.AddByString(ipString, ipLabel)
if debugLevel > 1000 {
fmt.Println("i:", i, "\tipString:", ipString, "\tipLabel:", ipLabel)
}
i++
}
}
}
}
if debugLevel > 10 {
fmt.Println("ip trie loaded with:", i)
}

var lookupIPs = make([]string, lookups)
var lookupLabels = make([]string, lookups)

rand.Seed(time.Now().UnixNano())
for i := 0; i < lookups; i++ {
a := randNumber(maxIP)
b := randNumber(maxIP)
c := randNumber(maxIP)
d := randNumber(maxIP)
ipString := fmt.Sprintf("%d.%d.%d.%d", a, b, c, d)
ipLabel := fmt.Sprintf("a=%d.b=%d.c=%d.d=%d", a, b, c, d)
lookupIPs[i] = ipString
lookupLabels[i] = ipLabel
}

b.ResetTimer()

for i := 0; i < lookups; i++ {
if val, _, _ := ip.GetByString(lookupIPs[i]); val != lookupLabels[i] {
b.Error(i, "Test failed\texpected:", lookupLabels[i], "\tgot:", val)
}
}

}

// BenchmarkLookupA 1,000 lookups
func BenchmarkLookupA(b *testing.B) {
benchmarkLookup(111, 30, 1e+3, b)
}

// BenchmarkLookupA 1,000,000 lookups
func BenchmarkLookupB(b *testing.B) {
benchmarkLookup(111, 30, 1e+6, b)
}

// BenchmarkLookupA 10,000,000 lookups
func BenchmarkLookupC(b *testing.B) {
benchmarkLookup(111, 30, 1e+7, b)
}