2018-08-05 16:27:46 +03:00
|
|
|
/*
|
|
|
|
|
|
|
|
This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
License, v. 2.0. If a copy of the MPL was not distributed with this file,
|
|
|
|
You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
|
|
|
|
|
|
Copyright (c) 2013, Armon Dadgar armon.dadgar@gmail.com
|
|
|
|
Copyright (c) 2013, Mitchell Hashimoto mitchell.hashimoto@gmail.com
|
|
|
|
|
|
|
|
Alternatively, the contents of this file may be used under the terms
|
|
|
|
of the GNU General Public License Version 3 or later, as described below:
|
|
|
|
|
|
|
|
This file is free software: you may copy, redistribute and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by the
|
|
|
|
Free Software Foundation, either version 3 of the License, or (at your
|
|
|
|
option) any later version.
|
|
|
|
|
|
|
|
This file is distributed in the hope that it will be useful, but
|
|
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
|
|
|
Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see http://www.gnu.org/licenses/.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
2018-09-11 23:04:16 +03:00
|
|
|
package lamport
|
2018-08-05 16:27:46 +03:00
|
|
|
|
|
|
|
import (
|
|
|
|
"sync/atomic"
|
|
|
|
)
|
|
|
|
|
2018-09-11 23:04:16 +03:00
|
|
|
// Clock is a thread safe implementation of a lamport clock. It
|
2018-08-05 16:27:46 +03:00
|
|
|
// uses efficient atomic operations for all of its functions, falling back
|
|
|
|
// to a heavy lock only if there are enough CAS failures.
|
2018-09-11 23:04:16 +03:00
|
|
|
type Clock struct {
|
2018-08-05 16:27:46 +03:00
|
|
|
counter uint64
|
|
|
|
}
|
|
|
|
|
2018-09-11 23:04:16 +03:00
|
|
|
// Time is the value of a Clock.
|
|
|
|
type Time uint64
|
2018-08-05 16:27:46 +03:00
|
|
|
|
2018-09-24 13:46:39 +03:00
|
|
|
// NewClock create a new clock with the value 1.
|
|
|
|
// Value 0 is considered as invalid.
|
2018-09-11 23:04:16 +03:00
|
|
|
func NewClock() Clock {
|
|
|
|
return Clock{
|
2018-08-05 16:27:46 +03:00
|
|
|
counter: 1,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-09-24 13:46:39 +03:00
|
|
|
// NewClockWithTime create a new clock with a value.
|
2018-09-11 23:04:16 +03:00
|
|
|
func NewClockWithTime(time uint64) Clock {
|
|
|
|
return Clock{
|
2018-08-05 16:27:46 +03:00
|
|
|
counter: time,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Time is used to return the current value of the lamport clock
|
2018-09-11 23:04:16 +03:00
|
|
|
func (l *Clock) Time() Time {
|
|
|
|
return Time(atomic.LoadUint64(&l.counter))
|
2018-08-05 16:27:46 +03:00
|
|
|
}
|
|
|
|
|
2018-08-06 21:31:20 +03:00
|
|
|
// Increment is used to return the value of the lamport clock and increment it afterwards
|
2018-09-11 23:04:16 +03:00
|
|
|
func (l *Clock) Increment() Time {
|
|
|
|
return Time(atomic.AddUint64(&l.counter, 1) - 1)
|
2018-08-05 16:27:46 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Witness is called to update our local clock if necessary after
|
|
|
|
// witnessing a clock value received from another process
|
2018-09-11 23:04:16 +03:00
|
|
|
func (l *Clock) Witness(v Time) {
|
2018-08-05 16:27:46 +03:00
|
|
|
WITNESS:
|
|
|
|
// If the other value is old, we do not need to do anything
|
|
|
|
cur := atomic.LoadUint64(&l.counter)
|
|
|
|
other := uint64(v)
|
|
|
|
if other < cur {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ensure that our local clock is at least one ahead.
|
|
|
|
if !atomic.CompareAndSwapUint64(&l.counter, cur, other+1) {
|
|
|
|
// CAS: CompareAndSwap
|
|
|
|
// The CAS failed, so we just retry. Eventually our CAS should
|
|
|
|
// succeed or a future witness will pass us by and our witness
|
|
|
|
// will end.
|
|
|
|
goto WITNESS
|
|
|
|
}
|
|
|
|
}
|