v/vlib/sync/atomic2/atomic_test.v

106 lines
2.7 KiB
V
Raw Normal View History

2020-06-26 23:31:03 +02:00
import atomic2
2020-06-26 20:04:17 +02:00
import sync
const (
iterations_per_cycle = 100_000
)
2020-06-26 20:04:17 +02:00
struct Counter {
mut:
2020-09-09 14:14:44 +02:00
counter u64
2020-06-26 20:04:17 +02:00
}
// without proper syncronization this would fail
fn test_count_10_times_1_cycle_should_result_10_cycles_with_sync() {
desired_iterations := 10 * iterations_per_cycle
2020-06-26 20:04:17 +02:00
mut wg := sync.new_waitgroup()
mut counter := &Counter{}
wg.add(10)
for i := 0; i < 10; i++ {
go count_one_cycle(mut counter, mut wg)
2020-06-26 20:04:17 +02:00
}
wg.wait()
assert counter.counter == desired_iterations
eprintln(' with synchronization the counter is: ${counter.counter:10} , expectedly == ${desired_iterations:10}')
2020-06-26 20:04:17 +02:00
}
// This test just to make sure that we have an anti-test to prove it works
fn test_count_10_times_1_cycle_should_not_be_10_cycles_without_sync() {
desired_iterations := 10 * iterations_per_cycle
mut wg := sync.new_waitgroup()
mut counter := &Counter{}
wg.add(10)
for i := 0; i < 10; i++ {
go count_one_cycle_without_sync(mut counter, mut wg)
}
wg.wait()
// NB: we do not assert here, just print, because sometimes by chance counter.counter may be == desired_iterations
eprintln('without synchronization the counter is: ${counter.counter:10} , expectedly != ${desired_iterations:10}')
}
2020-06-26 20:04:17 +02:00
fn test_count_plus_one_u64() {
mut c := u64(0)
2020-06-26 23:31:03 +02:00
atomic2.add_u64(&c, 1)
assert atomic2.load_u64(&c) == 1
2020-06-26 20:04:17 +02:00
}
fn test_count_plus_one_i64() {
mut c := i64(0)
2020-06-26 23:31:03 +02:00
atomic2.add_i64(&c, 1)
assert atomic2.load_i64(&c) == 1
2020-06-26 20:04:17 +02:00
}
fn test_count_plus_greater_than_one_u64() {
mut c := u64(0)
2020-06-26 23:31:03 +02:00
atomic2.add_u64(&c, 10)
assert atomic2.load_u64(&c) == 10
2020-06-26 20:04:17 +02:00
}
fn test_count_plus_greater_than_one_i64() {
mut c := i64(0)
2020-06-26 23:31:03 +02:00
atomic2.add_i64(&c, 10)
assert atomic2.load_i64(&c) == 10
2020-06-26 20:04:17 +02:00
}
fn test_count_minus_one_u64() {
mut c := u64(1)
2020-06-26 23:31:03 +02:00
atomic2.sub_u64(&c, 1)
assert atomic2.load_u64(&c) == 0
2020-06-26 20:04:17 +02:00
}
fn test_count_minus_one_i64() {
mut c := i64(0)
2020-06-26 23:31:03 +02:00
atomic2.sub_i64(&c, 1)
assert atomic2.load_i64(&c) == -1
2020-06-26 20:04:17 +02:00
}
fn test_count_minus_greater_than_one_u64() {
mut c := u64(0)
atomic2.store_u64(&c, 10)
2020-06-26 23:31:03 +02:00
atomic2.sub_u64(&c, 10)
assert atomic2.load_u64(&c) == 0
2020-06-26 20:04:17 +02:00
}
fn test_count_minus_greater_than_one_i64() {
mut c := i64(0)
atomic2.store_i64(&c, 10)
2020-06-26 23:31:03 +02:00
atomic2.sub_i64(&c, 20)
assert atomic2.load_i64(&c) == -10
2020-06-26 20:04:17 +02:00
}
// count_one_cycle counts the common counter iterations_per_cycle times in thread-safe way
fn count_one_cycle(mut counter Counter, mut group sync.WaitGroup) {
for i := 0; i < iterations_per_cycle; i++ {
2020-06-26 23:31:03 +02:00
atomic2.add_u64(&counter.counter, 1)
2020-06-26 20:04:17 +02:00
}
group.done()
}
// count_one_cycle_without_sync counts the common counter iterations_per_cycle times in none thread-safe way
fn count_one_cycle_without_sync(mut counter Counter, mut group sync.WaitGroup) {
for i := 0; i < iterations_per_cycle; i++ {
counter.counter++
}
group.done()
}