2023-05-09 20:19:48 +03:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Copyright 2017 gRPC 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2024-08-26 19:05:54 +03:00
|
|
|
// Package pickfirst contains the pick_first load balancing policy.
|
|
|
|
package pickfirst
|
2023-05-09 20:19:48 +03:00
|
|
|
|
|
|
|
import (
|
2023-09-07 14:20:37 +03:00
|
|
|
"encoding/json"
|
2023-05-09 20:19:48 +03:00
|
|
|
"errors"
|
|
|
|
"fmt"
|
2024-08-26 19:05:54 +03:00
|
|
|
"math/rand"
|
2023-05-09 20:19:48 +03:00
|
|
|
|
|
|
|
"google.golang.org/grpc/balancer"
|
|
|
|
"google.golang.org/grpc/connectivity"
|
2024-08-26 19:05:54 +03:00
|
|
|
"google.golang.org/grpc/grpclog"
|
|
|
|
"google.golang.org/grpc/internal"
|
2023-09-18 15:47:28 +03:00
|
|
|
internalgrpclog "google.golang.org/grpc/internal/grpclog"
|
|
|
|
"google.golang.org/grpc/internal/pretty"
|
|
|
|
"google.golang.org/grpc/resolver"
|
2023-09-07 14:20:37 +03:00
|
|
|
"google.golang.org/grpc/serviceconfig"
|
2023-05-09 20:19:48 +03:00
|
|
|
)
|
|
|
|
|
2024-08-26 19:05:54 +03:00
|
|
|
func init() {
|
|
|
|
balancer.Register(pickfirstBuilder{})
|
|
|
|
internal.ShuffleAddressListForTesting = func(n int, swap func(i, j int)) { rand.Shuffle(n, swap) }
|
|
|
|
}
|
|
|
|
|
|
|
|
var logger = grpclog.Component("pick-first-lb")
|
|
|
|
|
2023-09-18 15:47:28 +03:00
|
|
|
const (
|
2024-08-26 19:05:54 +03:00
|
|
|
// Name is the name of the pick_first balancer.
|
|
|
|
Name = "pick_first"
|
|
|
|
logPrefix = "[pick-first-lb %p] "
|
2023-09-18 15:47:28 +03:00
|
|
|
)
|
2023-05-09 20:19:48 +03:00
|
|
|
|
|
|
|
type pickfirstBuilder struct{}
|
|
|
|
|
2024-04-11 12:46:18 +03:00
|
|
|
func (pickfirstBuilder) Build(cc balancer.ClientConn, opt balancer.BuildOptions) balancer.Balancer {
|
2023-09-18 15:47:28 +03:00
|
|
|
b := &pickfirstBalancer{cc: cc}
|
|
|
|
b.logger = internalgrpclog.NewPrefixLogger(logger, fmt.Sprintf(logPrefix, b))
|
|
|
|
return b
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
|
2024-04-11 12:46:18 +03:00
|
|
|
func (pickfirstBuilder) Name() string {
|
2024-08-26 19:05:54 +03:00
|
|
|
return Name
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
|
2023-09-07 14:20:37 +03:00
|
|
|
type pfConfig struct {
|
|
|
|
serviceconfig.LoadBalancingConfig `json:"-"`
|
|
|
|
|
|
|
|
// If set to true, instructs the LB policy to shuffle the order of the list
|
2024-08-26 19:05:54 +03:00
|
|
|
// of endpoints received from the name resolver before attempting to
|
2023-09-07 14:20:37 +03:00
|
|
|
// connect to them.
|
|
|
|
ShuffleAddressList bool `json:"shuffleAddressList"`
|
|
|
|
}
|
|
|
|
|
2024-04-11 12:46:18 +03:00
|
|
|
func (pickfirstBuilder) ParseConfig(js json.RawMessage) (serviceconfig.LoadBalancingConfig, error) {
|
2023-09-18 15:47:28 +03:00
|
|
|
var cfg pfConfig
|
|
|
|
if err := json.Unmarshal(js, &cfg); err != nil {
|
2023-09-07 14:20:37 +03:00
|
|
|
return nil, fmt.Errorf("pickfirst: unable to unmarshal LB policy config: %s, error: %v", string(js), err)
|
|
|
|
}
|
|
|
|
return cfg, nil
|
|
|
|
}
|
|
|
|
|
2023-05-09 20:19:48 +03:00
|
|
|
type pickfirstBalancer struct {
|
2023-09-18 15:47:28 +03:00
|
|
|
logger *internalgrpclog.PrefixLogger
|
2023-05-09 20:19:48 +03:00
|
|
|
state connectivity.State
|
|
|
|
cc balancer.ClientConn
|
|
|
|
subConn balancer.SubConn
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *pickfirstBalancer) ResolverError(err error) {
|
2023-09-18 15:47:28 +03:00
|
|
|
if b.logger.V(2) {
|
|
|
|
b.logger.Infof("Received error from the name resolver: %v", err)
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
if b.subConn == nil {
|
|
|
|
b.state = connectivity.TransientFailure
|
|
|
|
}
|
|
|
|
|
|
|
|
if b.state != connectivity.TransientFailure {
|
|
|
|
// The picker will not change since the balancer does not currently
|
|
|
|
// report an error.
|
|
|
|
return
|
|
|
|
}
|
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: connectivity.TransientFailure,
|
|
|
|
Picker: &picker{err: fmt.Errorf("name resolver error: %v", err)},
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2024-08-26 19:05:54 +03:00
|
|
|
type Shuffler interface {
|
|
|
|
ShuffleAddressListForTesting(n int, swap func(i, j int))
|
|
|
|
}
|
|
|
|
|
|
|
|
func ShuffleAddressListForTesting(n int, swap func(i, j int)) { rand.Shuffle(n, swap) }
|
|
|
|
|
2023-05-09 20:19:48 +03:00
|
|
|
func (b *pickfirstBalancer) UpdateClientConnState(state balancer.ClientConnState) error {
|
2024-08-26 19:05:54 +03:00
|
|
|
if len(state.ResolverState.Addresses) == 0 && len(state.ResolverState.Endpoints) == 0 {
|
2023-05-09 20:19:48 +03:00
|
|
|
// The resolver reported an empty address list. Treat it like an error by
|
|
|
|
// calling b.ResolverError.
|
|
|
|
if b.subConn != nil {
|
2023-09-18 15:47:28 +03:00
|
|
|
// Shut down the old subConn. All addresses were removed, so it is
|
|
|
|
// no longer valid.
|
|
|
|
b.subConn.Shutdown()
|
2023-05-09 20:19:48 +03:00
|
|
|
b.subConn = nil
|
|
|
|
}
|
|
|
|
b.ResolverError(errors.New("produced zero addresses"))
|
|
|
|
return balancer.ErrBadResolverState
|
|
|
|
}
|
2023-09-18 15:47:28 +03:00
|
|
|
// We don't have to guard this block with the env var because ParseConfig
|
|
|
|
// already does so.
|
|
|
|
cfg, ok := state.BalancerConfig.(pfConfig)
|
|
|
|
if state.BalancerConfig != nil && !ok {
|
|
|
|
return fmt.Errorf("pickfirst: received illegal BalancerConfig (type %T): %v", state.BalancerConfig, state.BalancerConfig)
|
2023-09-07 14:20:37 +03:00
|
|
|
}
|
2023-09-18 15:47:28 +03:00
|
|
|
|
|
|
|
if b.logger.V(2) {
|
|
|
|
b.logger.Infof("Received new config %s, resolver state %s", pretty.ToJSON(cfg), pretty.ToJSON(state.ResolverState))
|
|
|
|
}
|
|
|
|
|
2024-08-26 19:05:54 +03:00
|
|
|
var addrs []resolver.Address
|
|
|
|
if endpoints := state.ResolverState.Endpoints; len(endpoints) != 0 {
|
|
|
|
// Perform the optional shuffling described in gRFC A62. The shuffling will
|
|
|
|
// change the order of endpoints but not touch the order of the addresses
|
|
|
|
// within each endpoint. - A61
|
|
|
|
if cfg.ShuffleAddressList {
|
|
|
|
endpoints = append([]resolver.Endpoint{}, endpoints...)
|
|
|
|
internal.ShuffleAddressListForTesting.(func(int, func(int, int)))(len(endpoints), func(i, j int) { endpoints[i], endpoints[j] = endpoints[j], endpoints[i] })
|
|
|
|
}
|
|
|
|
|
|
|
|
// "Flatten the list by concatenating the ordered list of addresses for each
|
|
|
|
// of the endpoints, in order." - A61
|
|
|
|
for _, endpoint := range endpoints {
|
|
|
|
// "In the flattened list, interleave addresses from the two address
|
|
|
|
// families, as per RFC-8304 section 4." - A61
|
|
|
|
// TODO: support the above language.
|
|
|
|
addrs = append(addrs, endpoint.Addresses...)
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Endpoints not set, process addresses until we migrate resolver
|
|
|
|
// emissions fully to Endpoints. The top channel does wrap emitted
|
|
|
|
// addresses with endpoints, however some balancers such as weighted
|
2024-09-16 12:06:00 +03:00
|
|
|
// target do not forward the corresponding correct endpoints down/split
|
2024-08-26 19:05:54 +03:00
|
|
|
// endpoints properly. Once all balancers correctly forward endpoints
|
|
|
|
// down, can delete this else conditional.
|
|
|
|
addrs = state.ResolverState.Addresses
|
|
|
|
if cfg.ShuffleAddressList {
|
|
|
|
addrs = append([]resolver.Address{}, addrs...)
|
|
|
|
rand.Shuffle(len(addrs), func(i, j int) { addrs[i], addrs[j] = addrs[j], addrs[i] })
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-05-09 20:19:48 +03:00
|
|
|
if b.subConn != nil {
|
2023-09-07 14:20:37 +03:00
|
|
|
b.cc.UpdateAddresses(b.subConn, addrs)
|
2023-05-09 20:19:48 +03:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2023-09-18 15:47:28 +03:00
|
|
|
var subConn balancer.SubConn
|
|
|
|
subConn, err := b.cc.NewSubConn(addrs, balancer.NewSubConnOptions{
|
|
|
|
StateListener: func(state balancer.SubConnState) {
|
|
|
|
b.updateSubConnState(subConn, state)
|
|
|
|
},
|
|
|
|
})
|
2023-05-09 20:19:48 +03:00
|
|
|
if err != nil {
|
2023-09-18 15:47:28 +03:00
|
|
|
if b.logger.V(2) {
|
|
|
|
b.logger.Infof("Failed to create new SubConn: %v", err)
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
b.state = connectivity.TransientFailure
|
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: connectivity.TransientFailure,
|
|
|
|
Picker: &picker{err: fmt.Errorf("error creating connection: %v", err)},
|
|
|
|
})
|
|
|
|
return balancer.ErrBadResolverState
|
|
|
|
}
|
|
|
|
b.subConn = subConn
|
|
|
|
b.state = connectivity.Idle
|
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: connectivity.Connecting,
|
|
|
|
Picker: &picker{err: balancer.ErrNoSubConnAvailable},
|
|
|
|
})
|
|
|
|
b.subConn.Connect()
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2023-09-18 15:47:28 +03:00
|
|
|
// UpdateSubConnState is unused as a StateListener is always registered when
|
|
|
|
// creating SubConns.
|
2023-05-09 20:19:48 +03:00
|
|
|
func (b *pickfirstBalancer) UpdateSubConnState(subConn balancer.SubConn, state balancer.SubConnState) {
|
2023-09-18 15:47:28 +03:00
|
|
|
b.logger.Errorf("UpdateSubConnState(%v, %+v) called unexpectedly", subConn, state)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *pickfirstBalancer) updateSubConnState(subConn balancer.SubConn, state balancer.SubConnState) {
|
|
|
|
if b.logger.V(2) {
|
|
|
|
b.logger.Infof("Received SubConn state update: %p, %+v", subConn, state)
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
if b.subConn != subConn {
|
2023-09-18 15:47:28 +03:00
|
|
|
if b.logger.V(2) {
|
|
|
|
b.logger.Infof("Ignored state change because subConn is not recognized")
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
return
|
|
|
|
}
|
|
|
|
if state.ConnectivityState == connectivity.Shutdown {
|
|
|
|
b.subConn = nil
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
switch state.ConnectivityState {
|
|
|
|
case connectivity.Ready:
|
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: state.ConnectivityState,
|
|
|
|
Picker: &picker{result: balancer.PickResult{SubConn: subConn}},
|
|
|
|
})
|
|
|
|
case connectivity.Connecting:
|
2023-09-07 14:20:37 +03:00
|
|
|
if b.state == connectivity.TransientFailure {
|
|
|
|
// We stay in TransientFailure until we are Ready. See A62.
|
|
|
|
return
|
|
|
|
}
|
2023-05-09 20:19:48 +03:00
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: state.ConnectivityState,
|
|
|
|
Picker: &picker{err: balancer.ErrNoSubConnAvailable},
|
|
|
|
})
|
|
|
|
case connectivity.Idle:
|
2023-09-07 14:20:37 +03:00
|
|
|
if b.state == connectivity.TransientFailure {
|
|
|
|
// We stay in TransientFailure until we are Ready. Also kick the
|
|
|
|
// subConn out of Idle into Connecting. See A62.
|
|
|
|
b.subConn.Connect()
|
|
|
|
return
|
|
|
|
}
|
2023-05-09 20:19:48 +03:00
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: state.ConnectivityState,
|
|
|
|
Picker: &idlePicker{subConn: subConn},
|
|
|
|
})
|
|
|
|
case connectivity.TransientFailure:
|
|
|
|
b.cc.UpdateState(balancer.State{
|
|
|
|
ConnectivityState: state.ConnectivityState,
|
|
|
|
Picker: &picker{err: state.ConnectionError},
|
|
|
|
})
|
|
|
|
}
|
2023-09-07 14:20:37 +03:00
|
|
|
b.state = state.ConnectivityState
|
2023-05-09 20:19:48 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
func (b *pickfirstBalancer) Close() {
|
|
|
|
}
|
|
|
|
|
|
|
|
func (b *pickfirstBalancer) ExitIdle() {
|
|
|
|
if b.subConn != nil && b.state == connectivity.Idle {
|
|
|
|
b.subConn.Connect()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type picker struct {
|
|
|
|
result balancer.PickResult
|
|
|
|
err error
|
|
|
|
}
|
|
|
|
|
|
|
|
func (p *picker) Pick(balancer.PickInfo) (balancer.PickResult, error) {
|
|
|
|
return p.result, p.err
|
|
|
|
}
|
|
|
|
|
|
|
|
// idlePicker is used when the SubConn is IDLE and kicks the SubConn into
|
|
|
|
// CONNECTING when Pick is called.
|
|
|
|
type idlePicker struct {
|
|
|
|
subConn balancer.SubConn
|
|
|
|
}
|
|
|
|
|
|
|
|
func (i *idlePicker) Pick(balancer.PickInfo) (balancer.PickResult, error) {
|
|
|
|
i.subConn.Connect()
|
|
|
|
return balancer.PickResult{}, balancer.ErrNoSubConnAvailable
|
|
|
|
}
|