2010-12-03 05:34:57 +01:00
|
|
|
// Copyright 2009 The Go Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
2012-03-02 17:38:43 +01:00
|
|
|
// GOMAXPROCS=10 go test
|
2010-12-03 05:34:57 +01:00
|
|
|
|
|
|
|
package sync_test
|
|
|
|
|
|
|
|
import (
|
|
|
|
"runtime"
|
|
|
|
. "sync"
|
|
|
|
"testing"
|
|
|
|
)
|
|
|
|
|
|
|
|
func HammerSemaphore(s *uint32, loops int, cdone chan bool) {
|
|
|
|
for i := 0; i < loops; i++ {
|
2012-03-02 21:01:37 +01:00
|
|
|
Runtime_Semacquire(s)
|
|
|
|
Runtime_Semrelease(s)
|
2010-12-03 05:34:57 +01:00
|
|
|
}
|
|
|
|
cdone <- true
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSemaphore(t *testing.T) {
|
|
|
|
s := new(uint32)
|
|
|
|
*s = 1
|
|
|
|
c := make(chan bool)
|
|
|
|
for i := 0; i < 10; i++ {
|
|
|
|
go HammerSemaphore(s, 1000, c)
|
|
|
|
}
|
|
|
|
for i := 0; i < 10; i++ {
|
|
|
|
<-c
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkUncontendedSemaphore(b *testing.B) {
|
|
|
|
s := new(uint32)
|
|
|
|
*s = 1
|
|
|
|
HammerSemaphore(s, b.N, make(chan bool, 2))
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkContendedSemaphore(b *testing.B) {
|
|
|
|
b.StopTimer()
|
|
|
|
s := new(uint32)
|
|
|
|
*s = 1
|
|
|
|
c := make(chan bool)
|
2011-09-16 17:47:21 +02:00
|
|
|
defer runtime.GOMAXPROCS(runtime.GOMAXPROCS(2))
|
2010-12-03 05:34:57 +01:00
|
|
|
b.StartTimer()
|
|
|
|
|
|
|
|
go HammerSemaphore(s, b.N/2, c)
|
|
|
|
go HammerSemaphore(s, b.N/2, c)
|
|
|
|
<-c
|
|
|
|
<-c
|
|
|
|
}
|
|
|
|
|
|
|
|
func HammerMutex(m *Mutex, loops int, cdone chan bool) {
|
|
|
|
for i := 0; i < loops; i++ {
|
|
|
|
m.Lock()
|
|
|
|
m.Unlock()
|
|
|
|
}
|
|
|
|
cdone <- true
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestMutex(t *testing.T) {
|
|
|
|
m := new(Mutex)
|
|
|
|
c := make(chan bool)
|
|
|
|
for i := 0; i < 10; i++ {
|
|
|
|
go HammerMutex(m, 1000, c)
|
|
|
|
}
|
|
|
|
for i := 0; i < 10; i++ {
|
|
|
|
<-c
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-17 00:05:44 +01:00
|
|
|
func TestMutexPanic(t *testing.T) {
|
|
|
|
defer func() {
|
|
|
|
if recover() == nil {
|
|
|
|
t.Fatalf("unlock of unlocked mutex did not panic")
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
|
|
|
|
var mu Mutex
|
|
|
|
mu.Lock()
|
|
|
|
mu.Unlock()
|
|
|
|
mu.Unlock()
|
|
|
|
}
|
2011-09-16 17:47:21 +02:00
|
|
|
|
|
|
|
func BenchmarkMutexUncontended(b *testing.B) {
|
|
|
|
type PaddedMutex struct {
|
|
|
|
Mutex
|
|
|
|
pad [128]uint8
|
|
|
|
}
|
2014-07-19 10:53:52 +02:00
|
|
|
b.RunParallel(func(pb *testing.PB) {
|
|
|
|
var mu PaddedMutex
|
|
|
|
for pb.Next() {
|
|
|
|
mu.Lock()
|
|
|
|
mu.Unlock()
|
|
|
|
}
|
|
|
|
})
|
2011-09-16 17:47:21 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func benchmarkMutex(b *testing.B, slack, work bool) {
|
2014-07-19 10:53:52 +02:00
|
|
|
var mu Mutex
|
2011-09-16 17:47:21 +02:00
|
|
|
if slack {
|
2014-07-19 10:53:52 +02:00
|
|
|
b.SetParallelism(10)
|
2011-09-16 17:47:21 +02:00
|
|
|
}
|
2014-07-19 10:53:52 +02:00
|
|
|
b.RunParallel(func(pb *testing.PB) {
|
|
|
|
foo := 0
|
|
|
|
for pb.Next() {
|
|
|
|
mu.Lock()
|
|
|
|
mu.Unlock()
|
|
|
|
if work {
|
|
|
|
for i := 0; i < 100; i++ {
|
|
|
|
foo *= 2
|
|
|
|
foo /= 2
|
2011-09-16 17:47:21 +02:00
|
|
|
}
|
|
|
|
}
|
2014-07-19 10:53:52 +02:00
|
|
|
}
|
|
|
|
_ = foo
|
|
|
|
})
|
2011-09-16 17:47:21 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkMutex(b *testing.B) {
|
|
|
|
benchmarkMutex(b, false, false)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkMutexSlack(b *testing.B) {
|
|
|
|
benchmarkMutex(b, true, false)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkMutexWork(b *testing.B) {
|
|
|
|
benchmarkMutex(b, false, true)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkMutexWorkSlack(b *testing.B) {
|
|
|
|
benchmarkMutex(b, true, true)
|
|
|
|
}
|