mirror of
https://github.com/hanzoai/livekit.git
synced 2026-10-30 18:29:34 +00:00
zeekay
e9292da479
This fork lived at github.com/hanzoai/livekit but still declared
`module github.com/livekit/livekit-server`, so all 505 self-references pointed
at upstream. A fork that does not own its module path is the exact thing the
owned-module-paths rule exists to prevent: every import line in every consumer
carries someone else's brand, and `go get` resolves to their code, not ours.
module + 505 self-imports github.com/livekit/livekit-server -> github.com/hanzoai/livekit
KV client github.com/redis/go-redis/v9 -> github.com/hanzokv/go/v9
message bus github.com/livekit/psrpc -> github.com/hanzoai/psrpc
psrpc had to be forked (hanzoai/psrpc, Apache-2.0) because its bus is typed
against the KV client — the same shape redsync had for hanzoai/git.
DELIBERATELY NOT FORKED: github.com/livekit/{protocol,mediatransportutil,
mageutil} keep their addresses. Only `protocol` still reaches go-redis, through
a single file (redis/redis.go) out of 305. Forking an 11.5MB core wire-protocol
library that this server must track in lockstep — and that upstream pushed
yesterday — to change one file trades a tidy dependency graph for permanent
divergence on the fastest-moving dependency here. So one indirect
github.com/redis/go-redis entry remains, via livekit/protocol/redis, and that
is the correct place for it to live.
143 lines
3.0 KiB
Go
143 lines
3.0 KiB
Go
// Copyright 2023 LiveKit, 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 pacer
|
|
|
|
import (
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/frostbyte73/core"
|
|
"github.com/gammazero/deque"
|
|
"github.com/hanzoai/livekit/pkg/sfu/bwe"
|
|
"github.com/livekit/protocol/logger"
|
|
)
|
|
|
|
const (
|
|
maxOvershootFactor = 2.0
|
|
)
|
|
|
|
type LeakyBucket struct {
|
|
*Base
|
|
|
|
logger logger.Logger
|
|
|
|
lock sync.RWMutex
|
|
packets deque.Deque[*Packet]
|
|
interval time.Duration
|
|
bitrate int
|
|
stop core.Fuse
|
|
}
|
|
|
|
func NewLeakyBucket(logger logger.Logger, bwe bwe.BWE, interval time.Duration, bitrate int) *LeakyBucket {
|
|
l := &LeakyBucket{
|
|
Base: NewBase(logger, bwe),
|
|
logger: logger,
|
|
interval: interval,
|
|
bitrate: bitrate,
|
|
}
|
|
l.packets.SetBaseCap(512)
|
|
|
|
go l.sendWorker()
|
|
return l
|
|
}
|
|
|
|
func (l *LeakyBucket) SetInterval(interval time.Duration) {
|
|
l.lock.Lock()
|
|
defer l.lock.Unlock()
|
|
|
|
l.interval = interval
|
|
}
|
|
|
|
func (l *LeakyBucket) SetBitrate(bitrate int) {
|
|
l.lock.Lock()
|
|
defer l.lock.Unlock()
|
|
|
|
l.bitrate = bitrate
|
|
}
|
|
|
|
func (l *LeakyBucket) Stop() {
|
|
l.stop.Break()
|
|
}
|
|
|
|
func (l *LeakyBucket) Enqueue(p *Packet) {
|
|
l.lock.Lock()
|
|
l.packets.PushBack(p)
|
|
l.lock.Unlock()
|
|
}
|
|
|
|
func (l *LeakyBucket) sendWorker() {
|
|
l.lock.RLock()
|
|
interval := l.interval
|
|
l.lock.RUnlock()
|
|
var bitrate int
|
|
|
|
timer := time.NewTimer(interval)
|
|
overage := 0
|
|
|
|
for {
|
|
<-timer.C
|
|
|
|
l.lock.RLock()
|
|
interval = l.interval
|
|
bitrate = l.bitrate
|
|
l.lock.RUnlock()
|
|
|
|
// calculate number of bytes that can be sent in this interval
|
|
// adjusting for overage.
|
|
intervalBytes := int(interval.Seconds() * float64(bitrate) / 8.0)
|
|
maxOvershootBytes := int(float64(intervalBytes) * maxOvershootFactor)
|
|
toSendBytes := intervalBytes - overage
|
|
if toSendBytes < 0 {
|
|
// too much overage, wait for next interval
|
|
overage = -toSendBytes
|
|
timer.Reset(interval)
|
|
continue
|
|
}
|
|
|
|
// do not allow too much overshoot in an interval
|
|
if toSendBytes > maxOvershootBytes {
|
|
toSendBytes = maxOvershootBytes
|
|
}
|
|
|
|
for {
|
|
if l.stop.IsBroken() {
|
|
return
|
|
}
|
|
|
|
l.lock.Lock()
|
|
if l.packets.Len() == 0 {
|
|
l.lock.Unlock()
|
|
// allow overshoot in next interval with shortage in this interval
|
|
overage = -toSendBytes
|
|
timer.Reset(interval)
|
|
break
|
|
}
|
|
p := l.packets.PopFront()
|
|
l.lock.Unlock()
|
|
|
|
written, _ := l.Base.SendPacket(p)
|
|
toSendBytes -= written
|
|
if toSendBytes < 0 {
|
|
// overage, wait for next interval
|
|
overage = -toSendBytes
|
|
timer.Reset(interval)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// ------------------------------------------------
|