Skip to content

armgit / Piik

Public Imported from GitHub
0

Free, open-source screen sharing for private live streams with friends. Watch together in a browser or self-host Piik. 免费开源的私密屏幕共享,支持游戏直播、一起看电影与自部署。

11.4 KB
Raw Blame
package mediaedge

import (
	"errors"
	"fmt"
	"log/slog"
	"time"

	"github.com/TNTcraftHIM/Piik/internal/diagnostics"
	"github.com/TNTcraftHIM/Piik/internal/media/encoded"
	"github.com/TNTcraftHIM/Piik/internal/media/forwarding"
	"github.com/pion/rtcp"
	"github.com/pion/webrtc/v4"
)

// Transport owns current attachment; this map owns only requested membership.
// An independent keyframe installs a requested source without replacing its PC.
type groupConsumer interface {
	CurrentSource() *forwarding.Source
	ReplaceSource(*forwarding.Source) error
}

type outputGroup struct {
	slot         int
	media        *forwarding.EncodedSource
	budget       uint32
	active       bool
	start        time.Duration
	clockPending bool
}

type outputDemand struct {
	consumer groupConsumer
	budget   uint32
	active   bool
	lower    bool
	original bool
}

func (source *Source) groupForMedia(media *forwarding.Source) *outputGroup {
	for _, group := range source.groups {
		if group.media.Source == media {
			return group
		}
	}
	return nil
}

func (source *Source) collectDemands(edges []*Edge, publications []*Publication) []outputDemand {
	demands := make([]outputDemand, 0, len(edges)+len(publications))
	ceiling := source.media.TrackInfo().Layers[0].Bitrate
	for _, edge := range edges {
		state := edge.transport.Output.State()
		_, observed := edge.transport.TargetBitrate()
		active := edge.State() == webrtc.PeerConnectionStateConnected && state.VideoBudget > 0
		lower := active && !edge.local && observed &&
			(state.Target == 0 || state.Current == 0 && !state.Paused || state.Paused && state.Prepare == 0)
		demands = append(demands, outputDemand{consumer: edge.transport, active: active, lower: lower,
			original: edge.transport.RequiredActiveCount() > 1,
			budget:   uint32(max(1000, min(state.VideoBudget, int64(ceiling))))})
	}
	for _, publication := range publications {
		required := publication.RequiredActiveCount()
		active := required > 0
		budget := publication.LowestLayerBudget()
		// Zero is an exhausted residual allocation, not an unknown estimate.
		demands = append(demands, outputDemand{consumer: publication.transport, active: active, lower: active,
			original: required > 1,
			budget:   uint32(max(1000, min(budget, int64(ceiling))))})
	}
	return demands
}

// Equal connection-level requests share one correction/adaptation owner. The
// group's RTP-to-codec conversion is applied once, not used as a membership key.
func (source *Source) planGroups(demands []outputDemand) (OutputPlan, error) {
	plan := OutputPlan{Active: make([]bool, len(source.outputBitrates)),
		Bitrates: append([]uint32(nil), source.outputBitrates...)}
	if len(source.formats) != 2 || len(plan.Bitrates) < 2 {
		return plan, errors.New("shared output groups need an original and derived slot")
	}
	if source.groups == nil {
		source.groups = map[int]*outputGroup{0: {slot: 0, media: source.media, budget: source.outputBitrates[0]}}
		source.memberships = make(map[groupConsumer]*outputGroup)
	}
	present := make(map[groupConsumer]bool, len(demands))
	hasLowerDemand := false
	for _, demand := range demands {
		present[demand.consumer] = true
		hasLowerDemand = hasLowerDemand || demand.active && demand.lower
		plan.Active[1] = plan.Active[1] || demand.active && demand.original
	}
	for consumer := range source.memberships {
		if !present[consumer] {
			delete(source.memberships, consumer)
		}
	}
	compatible := func(group *outputGroup, demand outputDemand) bool {
		for _, other := range demands {
			if other.active && other.lower && other.budget != demand.budget &&
				(other.consumer.CurrentSource() == group.media.Source || source.memberships[other.consumer] == group) {
				return false
			}
		}
		return true
	}
	// Revalidate pending joins before they can prevent an incumbent from
	// adjusting in place. Membership order must not give stale demand priority.
	for _, demand := range demands {
		group := source.memberships[demand.consumer]
		if demand.active && demand.lower && group != nil && demand.consumer.CurrentSource() != group.media.Source && !compatible(group, demand) {
			delete(source.memberships, demand.consumer)
		}
	}
	// The previous frame's active bit alone may outlive its last handoff.
	inUse := func(group *outputGroup) bool {
		if group == nil || !group.active {
			return false
		}
		for _, demand := range demands {
			if demand.active && (demand.consumer.CurrentSource() == group.media.Source || source.memberships[demand.consumer] == group) {
				return true
			}
		}
		return false
	}
	for _, demand := range demands {
		if !demand.active || !demand.lower {
			if source.memberships[demand.consumer] != nil {
				source.groupRecovery.Or(2)
			}
			source.memberships[demand.consumer] = nil
			continue
		}
		var selected *outputGroup
		for slot := 0; slot < len(source.outputBitrates); slot++ {
			group := source.groups[slot]
			if group != nil && source.outputBitrates[slot] > 0 && group.budget == demand.budget {
				if demand.consumer.CurrentSource() != group.media.Source && !compatible(group, demand) {
					continue
				}
				if selected == nil || inUse(group) {
					selected = group
				}
				if inUse(group) {
					break
				}
			}
		}
		if selected == nil || !inUse(selected) {
			// A group's rates can change in place only when no other current or
			// requested member still needs a different budget.
			owned := []*outputGroup{source.memberships[demand.consumer], source.groupForMedia(demand.consumer.CurrentSource())}
			var ordered []*outputGroup
			for _, group := range owned {
				if inUse(group) {
					ordered = append(ordered, group)
				}
			}
			// Keep an owned live pipeline before reviving an inactive cached match.
			ordered = append(ordered, selected)
			ordered = append(ordered, owned...)
			for slot := 0; slot < len(source.outputBitrates); slot++ {
				if group := source.groups[slot]; group != nil {
					ordered = append(ordered, group)
				}
			}
			for _, group := range ordered {
				if group == nil {
					continue
				}
				if source.outputBitrates[group.slot] == 0 {
					continue
				}
				if compatible(group, demand) {
					selected = group
					break
				}
			}
		}
		if selected == nil {
			for slot := 2; slot < len(source.outputBitrates); slot++ {
				if source.groups[slot] == nil && source.outputBitrates[slot] > 0 {
					var err error
					selected, err = source.newGroup(slot)
					if err != nil {
						return plan, err
					}
					break
				}
			}
		}
		if selected == nil {
			// Existing delivery remains while a prepared split releases its old
			// membership. No timer, retry queue or temporary capacity exemption.
			continue
		}
		if selected.budget != demand.budget || source.memberships[demand.consumer] != selected {
			if slog.Default().Enabled(source.engine.ctx, slog.LevelDebug) {
				slog.Debug("encoding-group", "event", "demand", "slot", selected.slot, "budget", demand.budget,
					"sourceId", diagnostics.ID(fmt.Sprintf("%p", source)), "rtcPeerId", groupConsumerID(demand.consumer))
			}
		}
		selected.budget = demand.budget
		if !selected.active {
			selected.start = source.inputPTS
		}
		if source.memberships[demand.consumer] != selected && demand.consumer.CurrentSource() != selected.media.Source {
			source.groupRecovery.Or(uint32(1) << selected.slot)
		}
		source.memberships[demand.consumer] = selected
	}
	for _, group := range source.groups {
		active := group.slot == 0 && plan.Active[1] && !hasLowerDemand
		for _, demand := range demands {
			if !demand.active {
				continue
			}
			if source.memberships[demand.consumer] == group ||
				demand.consumer.CurrentSource() == group.media.Source && (demand.lower || !demand.original || group.slot != 0) {
				active = true
			}
		}
		nextActive := active && source.outputBitrates[group.slot] > 0
		if nextActive && !group.active && source.relay != nil {
			group.clockPending = true
		}
		if group.active != nextActive {
			slog.Debug("encoding-group", "event", "activity", "slot", group.slot, "active", nextActive, "sourceId", diagnostics.ID(fmt.Sprintf("%p", source)))
		}
		group.active = nextActive
		plan.Active[group.slot] = group.active
		if group.active {
			plan.Bitrates[group.slot] = uint32(max(1000, min(group.media.CodecBudget(0, int64(group.budget)), int64(source.outputBitrates[group.slot]))))
		}
	}
	return plan, nil
}

func (source *Source) newGroup(slot int) (*outputGroup, error) {
	info := source.media.TrackInfo()
	formats := make([]forwarding.LayerFormat, len(info.Layers))
	for layer, format := range info.Layers {
		formats[layer] = forwarding.LayerFormat{Width: format.Width, Height: format.Height, Bitrate: format.Bitrate}
	}
	formats[0].Bitrate = source.outputBitrates[slot]
	media, err := forwarding.NewEncodedSource(forwarding.SourceOptions{
		ID: string(source.media.TrackID()), StreamID: source.media.StreamID(), Codec: videoCodecs[source.codec],
		Formats: formats, MaxPackets: encoded.MaxPacketWindow,
		OnRTCP: func(layer int, packets []rtcp.Packet) {
			for _, packet := range packets {
				switch packet.(type) {
				case *rtcp.PictureLossIndication, *rtcp.FullIntraRequest:
					if layer == 0 {
						source.requestLayerKeyFrame(slot)
					} else {
						source.requestLayerKeyFrame(1)
					}
				}
			}
		},
	})
	if err != nil {
		return nil, err
	}
	if source.relay != nil {
		media.UseSourceClock(source.media.Source, len(source.formats)-1)
	}
	media.SetLowestLayerRateControlled(true)
	group := &outputGroup{slot: slot, media: media, start: source.inputPTS, clockPending: source.relay != nil}
	if source.hasInput {
		if err = media.BeginFrame(source.inputPTS, source.inputAt); err != nil {
			media.Close()
			return nil, err
		}
	}
	source.groups[slot] = group
	return group, nil
}

func (source *Source) installGroup(group *outputGroup, original bool) {
	next := source.media.Source
	if group != nil {
		next = group.media.Source
	}
	for consumer, wanted := range source.memberships {
		if wanted == group && (original || group != nil) && consumer.CurrentSource() != next {
			err := consumer.ReplaceSource(next)
			if slog.Default().Enabled(source.engine.ctx, slog.LevelDebug) {
				slot := -1
				if group != nil {
					slot = group.slot
				}
				slog.Debug("encoding-group", "event", "attachment", "slot", slot, "original", original,
					"sourceId", diagnostics.ID(fmt.Sprintf("%p", source)), "rtcPeerId", groupConsumerID(consumer), diagnostics.Error(err))
			}
		}
	}
}

func groupConsumerID(consumer groupConsumer) string {
	switch consumer := consumer.(type) {
	case *forwarding.Transport:
		return diagnostics.ID(consumer.PC.ID())
	case *forwarding.Publication:
		return diagnostics.ID(consumer.PC.ID())
	}
	return ""
}

func (source *Source) beginGroupFrame(pts time.Duration, at time.Time) error {
	if source.hasInput {
		// New groups inherit the established capture clock. Pipe arrival time
		// can change independently of the input timestamps.
		at = source.inputAt.Add(pts - source.inputPTS)
	} else if source.relay == nil && !source.inputAt.IsZero() && !at.IsZero() {
		// Capture generations can reset PTS while first-arrival latency changes.
		// Normalize their common origin beyond the last input by one RTP tick;
		// relay input already supplies its authoritative upstream clock.
		earliest := source.inputAt.Add(time.Second/videoClockRate + time.Nanosecond)
		if at.Before(earliest) {
			at = earliest
		}
	}
	if err := source.media.BeginFrame(pts, at); err != nil {
		return err
	}
	source.inputPTS, source.inputAt, source.hasInput = pts, at, true
	for slot, group := range source.groups {
		if slot != 0 {
			if err := group.media.BeginFrame(pts, at); err != nil {
				return err
			}
		}
	}
	return nil
}