mirror of
https://github.com/hanzoai/visor.git
synced 2026-09-24 17:04:14 +00:00
The fake clock and networking helpers protect mutable state with mutexes without exposing those contracts to checklocks. Annotate the clock, timers, notifications, and helper state, including the existing locked clock and DAD initialization helpers. Adapt the helper annotations from #7053 to current source, including multicast forwarding state added since that proposal. Co-authored-by: Hanzo Dev <[email protected]>
395 lines
8.6 KiB
Go
395 lines
8.6 KiB
Go
// Copyright 2020 The gVisor Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
// Package faketime provides a fake clock that implements tcpip.Clock interface.
|
|
package faketime
|
|
|
|
import (
|
|
"container/heap"
|
|
"fmt"
|
|
"sync"
|
|
"time"
|
|
|
|
"gvisor.dev/gvisor/pkg/tcpip"
|
|
)
|
|
|
|
// NullClock implements a clock that never advances.
|
|
type NullClock struct{}
|
|
|
|
var _ tcpip.Clock = (*NullClock)(nil)
|
|
|
|
// Now implements tcpip.Clock.Now.
|
|
func (*NullClock) Now() time.Time {
|
|
return time.Time{}
|
|
}
|
|
|
|
// NowMonotonic implements tcpip.Clock.NowMonotonic.
|
|
func (*NullClock) NowMonotonic() tcpip.MonotonicTime {
|
|
return tcpip.MonotonicTime{}
|
|
}
|
|
|
|
// nullTimer implements a timer that never fires.
|
|
type nullTimer struct{}
|
|
|
|
var _ tcpip.Timer = (*nullTimer)(nil)
|
|
|
|
// Stop implements tcpip.Timer.
|
|
func (*nullTimer) Stop() bool {
|
|
return true
|
|
}
|
|
|
|
// Reset implements tcpip.Timer.
|
|
func (*nullTimer) Reset(time.Duration) {}
|
|
|
|
// AfterFunc implements tcpip.Clock.AfterFunc.
|
|
func (*NullClock) AfterFunc(time.Duration, func()) tcpip.Timer {
|
|
return &nullTimer{}
|
|
}
|
|
|
|
type notificationChannels struct {
|
|
mu struct {
|
|
sync.Mutex
|
|
|
|
// +checklocks:Mutex
|
|
ch []<-chan struct{}
|
|
}
|
|
}
|
|
|
|
func (n *notificationChannels) add(ch <-chan struct{}) {
|
|
n.mu.Lock()
|
|
defer n.mu.Unlock()
|
|
n.mu.ch = append(n.mu.ch, ch)
|
|
}
|
|
|
|
// wait returns once all the notification channels are readable.
|
|
//
|
|
// Channels that are added while waiting on existing channels will be waited on
|
|
// as well.
|
|
func (n *notificationChannels) wait() {
|
|
for {
|
|
n.mu.Lock()
|
|
ch := n.mu.ch
|
|
n.mu.ch = nil
|
|
n.mu.Unlock()
|
|
|
|
if len(ch) == 0 {
|
|
break
|
|
}
|
|
|
|
for _, c := range ch {
|
|
<-c
|
|
}
|
|
}
|
|
}
|
|
|
|
type manualClockMutex struct {
|
|
sync.RWMutex
|
|
|
|
// now is the current (fake) time of the clock.
|
|
//
|
|
// +checklocks:RWMutex
|
|
now time.Time
|
|
|
|
// times is min-heap of times.
|
|
//
|
|
// +checklocks:RWMutex
|
|
times timeHeap
|
|
|
|
// timers holds the timers scheduled for each time.
|
|
//
|
|
// +checklocks:RWMutex
|
|
timers map[time.Time]map[*manualTimer]struct{}
|
|
}
|
|
|
|
// ManualClock implements tcpip.Clock and only advances manually with Advance
|
|
// method.
|
|
//
|
|
// +stateify savable
|
|
type ManualClock struct {
|
|
// runningTimers tracks the completion of timer callbacks that began running
|
|
// immediately upon their scheduling. It is used to ensure the proper ordering
|
|
// of timer callback dispatch.
|
|
runningTimers notificationChannels
|
|
|
|
mu manualClockMutex
|
|
}
|
|
|
|
// NewManualClock creates a new ManualClock instance.
|
|
func NewManualClock() *ManualClock {
|
|
c := &ManualClock{}
|
|
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
// Set the initial time to a non-zero value since the zero value is used to
|
|
// detect inactive timers.
|
|
c.mu.now = time.Unix(0, 0)
|
|
c.mu.timers = make(map[time.Time]map[*manualTimer]struct{})
|
|
|
|
return c
|
|
}
|
|
|
|
var _ tcpip.Clock = (*ManualClock)(nil)
|
|
|
|
// Now implements tcpip.Clock.Now.
|
|
func (mc *ManualClock) Now() time.Time {
|
|
mc.mu.RLock()
|
|
defer mc.mu.RUnlock()
|
|
return mc.mu.now
|
|
}
|
|
|
|
// NowMonotonic implements tcpip.Clock.NowMonotonic.
|
|
func (mc *ManualClock) NowMonotonic() tcpip.MonotonicTime {
|
|
var mt tcpip.MonotonicTime
|
|
return mt.Add(mc.Now().Sub(time.Unix(0, 0)))
|
|
}
|
|
|
|
// AfterFunc implements tcpip.Clock.AfterFunc.
|
|
func (mc *ManualClock) AfterFunc(d time.Duration, f func()) tcpip.Timer {
|
|
mt := &manualTimer{
|
|
clock: mc,
|
|
f: f,
|
|
}
|
|
|
|
mc.mu.Lock()
|
|
defer mc.mu.Unlock()
|
|
|
|
mt.mu.Lock()
|
|
defer mt.mu.Unlock()
|
|
|
|
mc.resetTimerLocked(mt, d)
|
|
return mt
|
|
}
|
|
|
|
// resetTimerLocked schedules a timer to be fired after the given duration.
|
|
//
|
|
// +checklocks:mc.mu.RWMutex
|
|
// +checklocks:mt.mu.Mutex
|
|
func (mc *ManualClock) resetTimerLocked(mt *manualTimer, d time.Duration) {
|
|
if !mt.mu.firesAt.IsZero() {
|
|
panic("tried to reset an active timer")
|
|
}
|
|
|
|
t := mc.mu.now.Add(d)
|
|
|
|
if !mc.mu.now.Before(t) {
|
|
// If the timer is scheduled to fire immediately, call its callback
|
|
// in a new goroutine immediately.
|
|
//
|
|
// It needs to be called in its own goroutine to escape its current
|
|
// execution context - like an actual timer.
|
|
ch := make(chan struct{})
|
|
mc.runningTimers.add(ch)
|
|
|
|
go func() {
|
|
defer close(ch)
|
|
|
|
mt.f()
|
|
}()
|
|
|
|
return
|
|
}
|
|
|
|
mt.mu.firesAt = t
|
|
|
|
timers, ok := mc.mu.timers[t]
|
|
if !ok {
|
|
timers = make(map[*manualTimer]struct{})
|
|
mc.mu.timers[t] = timers
|
|
heap.Push(&mc.mu.times, t)
|
|
}
|
|
|
|
timers[mt] = struct{}{}
|
|
}
|
|
|
|
// stopTimerLocked stops a timer from firing.
|
|
//
|
|
// +checklocks:mc.mu.RWMutex
|
|
// +checklocks:mt.mu.Mutex
|
|
func (mc *ManualClock) stopTimerLocked(mt *manualTimer) {
|
|
t := mt.mu.firesAt
|
|
mt.mu.firesAt = time.Time{}
|
|
|
|
if t.IsZero() {
|
|
panic("tried to stop an inactive timer")
|
|
}
|
|
|
|
timers, ok := mc.mu.timers[t]
|
|
if !ok {
|
|
err := fmt.Sprintf("tried to stop an active timer but the clock does not have anything scheduled for the timer @ t = %s %p\nScheduled timers @:", t.UTC(), mt)
|
|
for t := range mc.mu.timers {
|
|
err += fmt.Sprintf("%s\n", t.UTC())
|
|
}
|
|
panic(err)
|
|
}
|
|
|
|
if _, ok := timers[mt]; !ok {
|
|
panic(fmt.Sprintf("did not have an entry in timers for an active timer @ t = %s", t.UTC()))
|
|
}
|
|
|
|
delete(timers, mt)
|
|
|
|
if len(timers) == 0 {
|
|
delete(mc.mu.timers, t)
|
|
}
|
|
}
|
|
|
|
// RunImmediatelyScheduledJobs runs all jobs scheduled to run at the current
|
|
// time.
|
|
func (mc *ManualClock) RunImmediatelyScheduledJobs() {
|
|
mc.Advance(0)
|
|
}
|
|
|
|
// Advance executes all work that have been scheduled to execute within d from
|
|
// the current time. Blocks until all work has completed execution.
|
|
func (mc *ManualClock) Advance(d time.Duration) {
|
|
// We spawn goroutines for timers that were scheduled to fire at the time of
|
|
// being reset. Wait for those goroutines to complete before proceeding so
|
|
// that timer callbacks are called in the right order.
|
|
mc.runningTimers.wait()
|
|
|
|
mc.mu.Lock()
|
|
defer mc.mu.Unlock()
|
|
|
|
until := mc.mu.now.Add(d)
|
|
for mc.mu.times.Len() > 0 {
|
|
t := heap.Pop(&mc.mu.times).(time.Time)
|
|
if t.After(until) {
|
|
// No work to do
|
|
heap.Push(&mc.mu.times, t)
|
|
break
|
|
}
|
|
|
|
timers := mc.mu.timers[t]
|
|
delete(mc.mu.timers, t)
|
|
|
|
mc.mu.now = t
|
|
|
|
// Mark the timers as inactive since they will be fired.
|
|
//
|
|
// This needs to be done while holding mc's lock because we remove the entry
|
|
// in the map of timers for the current time. If an attempt to stop a
|
|
// timer is made after mc's lock was dropped but before the timer is
|
|
// marked inactive, we would panic since no entry exists for the time when
|
|
// the timer was expected to fire.
|
|
for mt := range timers {
|
|
mt.mu.Lock()
|
|
mt.mu.firesAt = time.Time{}
|
|
mt.mu.Unlock()
|
|
}
|
|
|
|
// Release the lock before calling the timer's callback fn since the
|
|
// callback fn might try to schedule a timer which requires obtaining
|
|
// mc's lock.
|
|
mc.mu.Unlock()
|
|
|
|
for mt := range timers {
|
|
mt.f()
|
|
}
|
|
|
|
// The timer callbacks may have scheduled a timer to fire immediately.
|
|
// We spawn goroutines for these timers and need to wait for them to
|
|
// finish before proceeding so that timer callbacks are called in the
|
|
// right order.
|
|
mc.runningTimers.wait()
|
|
mc.mu.Lock()
|
|
}
|
|
|
|
mc.mu.now = until
|
|
}
|
|
|
|
func (mc *ManualClock) resetTimer(mt *manualTimer, d time.Duration) {
|
|
mc.mu.Lock()
|
|
defer mc.mu.Unlock()
|
|
|
|
mt.mu.Lock()
|
|
defer mt.mu.Unlock()
|
|
|
|
if !mt.mu.firesAt.IsZero() {
|
|
mc.stopTimerLocked(mt)
|
|
}
|
|
|
|
mc.resetTimerLocked(mt, d)
|
|
}
|
|
|
|
func (mc *ManualClock) stopTimer(mt *manualTimer) bool {
|
|
mc.mu.Lock()
|
|
defer mc.mu.Unlock()
|
|
|
|
mt.mu.Lock()
|
|
defer mt.mu.Unlock()
|
|
|
|
if mt.mu.firesAt.IsZero() {
|
|
return false
|
|
}
|
|
|
|
mc.stopTimerLocked(mt)
|
|
return true
|
|
}
|
|
|
|
type manualTimerMu struct {
|
|
sync.Mutex
|
|
|
|
// firesAt is the time when the timer will fire.
|
|
//
|
|
// Zero only when the timer is not active.
|
|
//
|
|
// +checklocks:Mutex
|
|
firesAt time.Time
|
|
}
|
|
|
|
type manualTimer struct {
|
|
clock *ManualClock
|
|
f func()
|
|
mu manualTimerMu
|
|
}
|
|
|
|
var _ tcpip.Timer = (*manualTimer)(nil)
|
|
|
|
// Reset implements tcpip.Timer.Reset.
|
|
func (mt *manualTimer) Reset(d time.Duration) {
|
|
mt.clock.resetTimer(mt, d)
|
|
}
|
|
|
|
// Stop implements tcpip.Timer.Stop.
|
|
func (mt *manualTimer) Stop() bool {
|
|
return mt.clock.stopTimer(mt)
|
|
}
|
|
|
|
type timeHeap []time.Time
|
|
|
|
var _ heap.Interface = (*timeHeap)(nil)
|
|
|
|
func (h timeHeap) Len() int {
|
|
return len(h)
|
|
}
|
|
|
|
func (h timeHeap) Less(i, j int) bool {
|
|
return h[i].Before(h[j])
|
|
}
|
|
|
|
func (h timeHeap) Swap(i, j int) {
|
|
h[i], h[j] = h[j], h[i]
|
|
}
|
|
|
|
func (h *timeHeap) Push(x any) {
|
|
*h = append(*h, x.(time.Time))
|
|
}
|
|
|
|
func (h *timeHeap) Pop() any {
|
|
last := (*h)[len(*h)-1]
|
|
*h = (*h)[:len(*h)-1]
|
|
return last
|
|
}
|