socket: amortise cost of querying OS time counter

#116 adds a much needed ability to shrink the connection pool, but requires
tracking the last-used timestamp for each socket after every operation. Frequent
calls to time.Now() in the hot-path reduced read throughput by ~6% and increased
the latency (and variance) of socket operations as a whole.

This PR adds a periodically updated time value to amortise the cost of the last-
used bookkeeping, restoring the original throughput at the cost of approximate
last-used values (configured to be ~25ms of potential skew).

On some systems (currently including FreeBSD) querying the time counter also
requires a syscall/context switch.

Fixes #142.

Author: domodwyer

coarse_time.go

@@ -0,0 +1,62 @@
+package mgo
+
+import (
+	"sync"
+	"sync/atomic"
+	"time"
+)
+
+// coarseTime provides a periodically updated (approximate) time value to
+// amortise the cost of frequent calls to time.Now.
+//
+// A read throughput increase of ~6% was measured when using coarseTime with the
+// high-precision event timer (HPET) on FreeBSD 11.1 and Go 1.10.1 after merging
+// #116.
+//
+// Calling Now returns a time.Time that is updated at the configured interval,
+// however due to scheduling the value may be marginally older than expected.
+//
+// coarseTime is safe for concurrent use.
+type coarseTime struct {
+	once sync.Once
+	stop chan struct{}
+	last atomic.Value
+}
+
+// Now returns the most recently acquired time.Time value.
+func (t *coarseTime) Now() time.Time {
+	return t.last.Load().(time.Time)
+}
+
+// Close stops the periodic update of t.
+//
+// Any subsequent calls to Now will return the same value forever.
+func (t *coarseTime) Close() {
+	t.once.Do(func() {
+		close(t.stop)
+	})
+}
+
+// newCoarseTime returns a coarseTime configured to update at granularity.
+func newCoarseTime(granularity time.Duration) *coarseTime {
+	t := &coarseTime{
+		stop: make(chan struct{}),
+	}
+
+	t.last.Store(time.Now())
+
+	go func() {
+		ticker := time.NewTicker(granularity)
+		for {
+			select {
+			case <-t.stop:
+				ticker.Stop()
+				return
+			case <-ticker.C:
+				t.last.Store(time.Now())
+			}
+		}
+	}()
+
+	return t
+}

coarse_time_test.go

@@ -0,0 +1,23 @@
+package mgo
+
+import (
+	"testing"
+	"time"
+)
+
+func TestCoarseTime(t *testing.T) {
+	t.Parallel()
+
+	const granularity = 50 * time.Millisecond
+
+	ct := newCoarseTime(granularity)
+	defer ct.Close()
+
+	start := ct.Now().Unix()
+	time.Sleep(time.Second)
+
+	got := ct.Now().Unix()
+	if got <= start {
+		t.Fatalf("got %d, expected at least %d", got, start)
+	}
+}

server.go

@@ -36,6 +36,17 @@ import (
 	"github.com/globalsign/mgo/bson"
 )
 
+// coarseTime is used to amortise the cost of querying the timecounter (possibly
+// incurring a syscall too) when setting a socket.lastTimeUsed value which
+// happens frequently in the hot-path.
+//
+// The lastTimeUsed value may be skewed by at least 25ms (see coarseTime).
+var coarseTime *coarseTime
+
+func init() {
+	coarseTime = newCoarseTime(25 * time.Millisecond)
+}
+
 // ---------------------------------------------------------------------------
 // Mongo server encapsulation.
 
@@ -293,7 +304,7 @@ func (server *mongoServer) close(waitForIdle bool) {
 func (server *mongoServer) RecycleSocket(socket *mongoSocket) {
 	server.Lock()
 	if !server.closed {
-		socket.lastTimeUsed = time.Now()
+		socket.lastTimeUsed = coarseTime.Now() // A rough approximation of the current time - see courseTime
 		server.unusedSockets = append(server.unusedSockets, socket)
 	}
 	// If anybody is waiting for a connection, they should try now.