xlog/ast_cache_bench_test.go at master · emad-elsaid/xlog · GitHub

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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
package xlog

import (
	"sync/atomic"
	"testing"
)

// BenchmarkASTQueryCache_ColdAccess measures performance on first access (cache miss).
func BenchmarkASTQueryCache_ColdAccess(b *testing.B) {
	b.ReportAllocs()

	for i := 0; i < b.N; i++ {
		cache := NewASTQueryCache()
		cache.Get("test-key", func() any {
			return "computed-value"
		})
	}
}

// BenchmarkASTQueryCache_WarmAccess measures performance on subsequent accesses (cache hits).
func BenchmarkASTQueryCache_WarmAccess(b *testing.B) {
	cache := NewASTQueryCache()
	cache.Get("test-key", func() any {
		return "computed-value"
	})

	b.ResetTimer()
	b.ReportAllocs()

	for i := 0; i < b.N; i++ {
		cache.Get("test-key", func() any {
			return "computed-value"
		})
	}
}

// BenchmarkASTQueryCache_ExpensiveComputation simulates caching expensive operations.
func BenchmarkASTQueryCache_ExpensiveComputation(b *testing.B) {
	cache := NewASTQueryCache()

	expensiveCompute := func() any {
		// Simulate expensive computation
		result := 0
		for i := 0; i < 1000; i++ {
			result += i
		}
		return result
	}

	b.Run("Uncached", func(b *testing.B) {
		b.ReportAllocs()
		for i := 0; i < b.N; i++ {
			expensiveCompute()
		}
	})

	b.Run("Cached", func(b *testing.B) {
		b.ReportAllocs()
		for i := 0; i < b.N; i++ {
			cache.Get("expensive", expensiveCompute)
		}
	})
}

// BenchmarkASTQueryCache_ConcurrentReads measures performance under concurrent read load.
func BenchmarkASTQueryCache_ConcurrentReads(b *testing.B) {
	cache := NewASTQueryCache()
	cache.Get("test-key", func() any {
		return "computed-value"
	})

	b.ResetTimer()
	b.ReportAllocs()

	b.RunParallel(func(pb *testing.PB) {
		for pb.Next() {
			cache.Get("test-key", func() any {
				return "computed-value"
			})
		}
	})
}

// BenchmarkASTQueryCache_ConcurrentWrites measures performance under concurrent invalidation.
func BenchmarkASTQueryCache_ConcurrentWrites(b *testing.B) {
	cache := NewASTQueryCache()
	var counter int32

	b.ResetTimer()
	b.ReportAllocs()

	b.RunParallel(func(pb *testing.PB) {
		for pb.Next() {
			key := "test-key"
			cache.Get(key, func() any {
				return atomic.AddInt32(&counter, 1)
			})
			cache.Invalidate(key)
		}
	})
}

// BenchmarkASTQueryCache_MultipleKeys measures performance with multiple independent cache keys.
func BenchmarkASTQueryCache_MultipleKeys(b *testing.B) {
	cache := NewASTQueryCache()

	// Pre-populate cache
	for i := 0; i < 10; i++ {
		cache.Get(string(rune('a'+i)), func() any {
			return i
		})
	}

	b.ResetTimer()
	b.ReportAllocs()

	for i := 0; i < b.N; i++ {
		cache.Get(string(rune('a'+(i%10))), func() any {
			return i
		})
	}
}