代码拉取完成,页面将自动刷新
// Copyright 2016 The Cockroach 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 rpc
import (
"time"
"github.com/cenk/backoff"
"github.com/facebookgo/clock"
"github.com/rubyist/circuitbreaker"
"github.com/cockroachdb/cockroach/pkg/util/hlc"
)
const maxBackoff = time.Second
// breakerClock is an implementation of clock.Clock that internally uses an
// hlc.Clock. It is used to bridge the hlc clock to the circuit breaker
// clocks. Note that it only implements the After() and Now() methods needed by
// circuit breakers and backoffs.
type breakerClock struct {
clock *hlc.Clock
}
func (c *breakerClock) After(d time.Duration) <-chan time.Time {
return time.After(d)
}
func (c *breakerClock) AfterFunc(d time.Duration, f func()) *clock.Timer {
panic("unimplemented")
}
func (c *breakerClock) Now() time.Time {
return c.clock.PhysicalTime()
}
func (c *breakerClock) Sleep(d time.Duration) {
panic("unimplemented")
}
func (c *breakerClock) Tick(d time.Duration) <-chan time.Time {
panic("unimplemented")
}
func (c *breakerClock) Ticker(d time.Duration) *clock.Ticker {
panic("unimplemented")
}
func (c *breakerClock) Timer(d time.Duration) *clock.Timer {
panic("unimplemented")
}
var _ clock.Clock = &breakerClock{}
// newBackOff creates a new exponential backoff properly configured for RPC
// connection backoff.
func newBackOff(clock backoff.Clock) backoff.BackOff {
// This exponential backoff limits the circuit breaker to 1 second
// intervals between successive attempts to resolve a node address
// and connect via GRPC.
//
// NB (nota Ben): MaxInterval should be less than the Raft election timeout
// (1.5s) to avoid disruptions. A newly restarted node will be in follower
// mode with no knowledge of the Raft leader. If it doesn't hear from a
// leader before the election timeout expires, it will start to campaign,
// which can be disruptive. Therefore the leader needs to get in touch (via
// Raft heartbeats) with such nodes within one election timeout of their
// restart, which won't happen if their backoff is too high.
b := &backoff.ExponentialBackOff{
InitialInterval: 500 * time.Millisecond,
RandomizationFactor: 0.5,
Multiplier: 1.5,
MaxInterval: maxBackoff,
MaxElapsedTime: 0,
Clock: clock,
}
b.Reset()
return b
}
func newBreaker(clock clock.Clock) *circuit.Breaker {
return circuit.NewBreakerWithOptions(&circuit.Options{
BackOff: newBackOff(clock),
Clock: clock,
ShouldTrip: circuit.ThresholdTripFunc(1),
})
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。