Some checks failed
NATS Server Tests / Lint (push) Failing after 3s
NATS Server Tests / Build (Latest Go) (push) Has been skipped
NATS Server Tests / Build (Minimum Go) (push) Has been skipped
NATS Server Tests / Build (Minimum Go, windows-2022) (push) Has been skipped
NATS Server Tests / Build (Minimum Go, windows-2025) (push) Has been skipped
NATS Server Tests / Test Stores (push) Has been skipped
NATS Server Tests / Test JetStream (push) Has been skipped
NATS Server Tests / Test Raft (push) Has been skipped
NATS Server Tests / Test JetStream Consumers (push) Has been skipped
NATS Server Tests / Test JetStream Cluster 1 (push) Has been skipped
NATS Server Tests / Test JetStream Cluster 2 (push) Has been skipped
NATS Server Tests / Test JetStream Cluster 3 (push) Has been skipped
NATS Server Tests / Test JetStream Cluster 4 (push) Has been skipped
NATS Server Tests / Test JetStream Supercluster (push) Has been skipped
NATS Server Tests / Test No-Race 1 (push) Has been skipped
NATS Server Tests / Test No-Race 2 (push) Has been skipped
NATS Server Tests / Test MQTT (push) Has been skipped
NATS Server Tests / Test Message Tracing (push) Has been skipped
NATS Server Tests / Test JWT (push) Has been skipped
NATS Server Tests / Test Remaining Server Tests (push) Has been skipped
NATS Server Tests / Test Other Packages (push) Has been skipped
Vulnerability Scan / govulncheck (push) Failing after 12m2s
94 lines
2.4 KiB
Go
94 lines
2.4 KiB
Go
// Copyright 2018-2026 The NATS 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 server
|
|
|
|
import "sync"
|
|
|
|
// We wrap to hold onto optional items for /connz.
|
|
type closedClient struct {
|
|
ConnInfo
|
|
subs []SubDetail
|
|
user string
|
|
acc string
|
|
}
|
|
|
|
// Fixed sized ringbuffer for closed connections.
|
|
type closedRingBuffer struct {
|
|
mu sync.Mutex
|
|
total uint64
|
|
conns []*closedClient
|
|
}
|
|
|
|
// Create a new ring buffer with at most max items.
|
|
func newClosedRingBuffer(max int) *closedRingBuffer {
|
|
rb := &closedRingBuffer{}
|
|
rb.conns = make([]*closedClient, max)
|
|
return rb
|
|
}
|
|
|
|
// Adds in a new closed connection. If there is no more room,
|
|
// remove the oldest.
|
|
func (rb *closedRingBuffer) append(cc *closedClient) {
|
|
rb.mu.Lock()
|
|
defer rb.mu.Unlock()
|
|
rb.conns[rb.nextLocked()] = cc
|
|
rb.total++
|
|
}
|
|
|
|
func (rb *closedRingBuffer) nextLocked() int {
|
|
return int(rb.total % uint64(cap(rb.conns)))
|
|
}
|
|
|
|
func (rb *closedRingBuffer) len() int {
|
|
rb.mu.Lock()
|
|
defer rb.mu.Unlock()
|
|
return rb.lenLocked()
|
|
}
|
|
|
|
func (rb *closedRingBuffer) lenLocked() int {
|
|
if rb.total > uint64(cap(rb.conns)) {
|
|
return cap(rb.conns)
|
|
}
|
|
return int(rb.total)
|
|
}
|
|
|
|
func (rb *closedRingBuffer) totalConns() uint64 {
|
|
rb.mu.Lock()
|
|
defer rb.mu.Unlock()
|
|
return rb.total
|
|
}
|
|
|
|
// This will return a sorted copy of the list which recipient can
|
|
// modify. If the contents of the client itself need to be modified,
|
|
// meaning swapping in any optional items, a copy should be made. We
|
|
// could introduce a new lock and hold that but since we return this
|
|
// list inside monitor which allows programatic access, we do not
|
|
// know when it would be done.
|
|
func (rb *closedRingBuffer) closedClients() []*closedClient {
|
|
rb.mu.Lock()
|
|
defer rb.mu.Unlock()
|
|
n := rb.lenLocked()
|
|
dup := make([]*closedClient, n)
|
|
head := rb.nextLocked()
|
|
if rb.total <= uint64(cap(rb.conns)) || head == 0 {
|
|
copy(dup, rb.conns[:n])
|
|
} else {
|
|
fp := rb.conns[head:]
|
|
sp := rb.conns[:head]
|
|
copy(dup, fp)
|
|
copy(dup[len(fp):], sp)
|
|
}
|
|
return dup
|
|
}
|