mirror of
https://github.com/gravitational/teleport.git
synced 2026-09-24 16:17:11 +08:00
* Dynamically resolve reverse tunnel address The reverse tunnel address is currently a static string that is retrieved from config and passed around for the duration of a services lifetime. When the `tunnel_public_address` is changed on the proxy and the proxy is then restarted, all established reverse tunnels over the old address will fail indefinintely. As a means to get around this, #8102 introduced a mechanism that would cause nodes to restart if their connection to the auth server was down for a period of time. While this did allow the nodes to pickup the new address after the nodes restarted it was meant to be a stop gap until a more robust solution could be applid. Instead of using a static address, the reverse tunnel address is now resolved via a `reversetunnel.Resolver`. Anywhere that previoulsy relied on the static proxy address now will fetch the actual reverse tunnel address via the webclient by using the Resolver. In addition this builds on the refactoring done in #4290 to further simplify the reversetunnel package. Since we no longer track multiple proxies, all the left over bits that did so have been removed to accomodate using a dynamic reverse tunnel address.
72 lines
1.9 KiB
Go
72 lines
1.9 KiB
Go
/*
|
|
Copyright 2021 Gravitational, Inc.
|
|
|
|
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 utils
|
|
|
|
import (
|
|
"time"
|
|
|
|
"github.com/jonboulle/clockwork"
|
|
)
|
|
|
|
// TimedCounter is essentially a lightweight rate calculator. It counts events
|
|
// that happen over a period of time, e.g. have there been more than 4 errors
|
|
// in the last 30 seconds. Automatically expires old events so they are not
|
|
// included in the count. Not safe for concurrent use.
|
|
type TimedCounter struct {
|
|
clock clockwork.Clock
|
|
timeout time.Duration
|
|
events []time.Time
|
|
}
|
|
|
|
// NewTimedCounter creates a new timed counter with the specified timeout
|
|
func NewTimedCounter(clock clockwork.Clock, timeout time.Duration) *TimedCounter {
|
|
return &TimedCounter{
|
|
clock: clock,
|
|
timeout: timeout,
|
|
events: nil,
|
|
}
|
|
}
|
|
|
|
// Increment adds a new item into the counter, returning the current count.
|
|
func (c *TimedCounter) Increment() int {
|
|
c.trim()
|
|
c.events = append(c.events, c.clock.Now())
|
|
return len(c.events)
|
|
}
|
|
|
|
// Count fetches the number of recorded events currently in the measurement
|
|
// time window.
|
|
func (c *TimedCounter) Count() int {
|
|
c.trim()
|
|
return len(c.events)
|
|
}
|
|
|
|
func (c *TimedCounter) trim() {
|
|
deadline := c.clock.Now().Add(-c.timeout)
|
|
lastExpiredEvent := -1
|
|
for i := range c.events {
|
|
if c.events[i].After(deadline) {
|
|
break
|
|
}
|
|
lastExpiredEvent = i
|
|
}
|
|
|
|
if lastExpiredEvent > -1 {
|
|
c.events = c.events[lastExpiredEvent+1:]
|
|
}
|
|
}
|