Files
Yeuoly 888ad788bc refactor: plugin lifecycle control panel (#499)
* refactor: introduce local plugin control panel and cleanup environment setup process

* fix: args

* refactor: new local runtime

* temp: stash work for refactor on RemotePluginServer

* refactor: unify local runtime lifetime and sperate init environment process

* chore: add missing files

* stash

* refactor: local plugin lifetime control

* refactor: complete installation process of control panel

* refactor: adapt service layer to new controlpanel

* refactor: pluginManager.Install

* fix: add routine wrap to InstallServerless, avoid blocking main thread

* feat: reinstall serverless runtime

* chore: add comments to Reinstall and update confusing naming

* refactor: unify install plugin service

* refactor: add labels to debugging runtime

* refactor: add getters to plugin manager

* refactor: split install service to decode/install_task/install service

* ???

* refactor: adapt controllers

* refactor: session write

* refactor: session runtime

* Refine install task orchestration (#501)

* refactor: installing task

* refactor cluster management, decouple lifetime management and cluster

* fix cli test command

* fix: cleanup TODO comments and implement GracefulStop for instance

* feat: add logger to control panel

* fix: multiple nil references

* refactor: better lifetime control

* refactor: better cycle interval

* fix(LocalPluginRuntime): prevent returning err when it's not  error

* fix: avoid adding empty PipExtraArgs

* fix: missing errors in Environment init

* fix: add truncateMessage to avoid db explosion

* cleanup: better lifecycle management

* fix: init status at the beginning of installation

* optimize: GracefulStop for pluginInstance

* refactor: tests

* refactor: centralize routine labels (#504)

* cleanup: RoutineKey

* fix: init routine pool

* fix: correctly handle cluster register error

* fix: memory leak

* fix: add \n to instance write

* fix(installer.go): set success to true after succeed for defer func

* refactor

* fix: missing cwd in testutils

* fix: scaleup default runtime nums to 1 when testing

* fix: localruntime appconfig in testing module

* Update internal/core/local_runtime/load_balancing.go

Co-authored-by: gemini-code-assist[bot] <176961590+gemini-code-assist[bot]@users.noreply.github.com>

* fix: more efficiency implement in installer_local.go

* fix: returns after failing in onDebuggingRuntimeDisconnected

* fix: returns after failing in onDebuggingRuntimeDisconnected

* fix: splits tests

* refactor: naming

* refactor: manifest.VersionX

* fix: adapt SetDefault to tests

* fix: enforce use constants in DBType

* fix: generate

* fix: linter

* cleanup tests

* refactor: change  package to

* cleanup: useless codes

* Update internal/cluster/plugin.go

Co-authored-by: gemini-code-assist[bot] <176961590+gemini-code-assist[bot]@users.noreply.github.com>

* cleanup

* refactor: decouple connection_key management from debugging_time

* refactor: confused naming

* feat: recycle resources to adapt to https://github.com/langgenius/dify-plugin-daemon/pull/500

* refactor: confusing redirecting

* fix: support get serverless runtime

* fix: race condition in Launching

* fix: avoid ManifestValidate in first step of debugging handshake

* fix: adding ReleaseAllLocks to finalizers

* wtf: what a beautiful code

* refactor: rename Stream.Async to Stream.Process

* fix: kill process if daed instance was detected

* fix: correctly handle failures

* fix: consistence of difference interfaces

* fix: add stacktrace to panic

* fix: only trigger once  event

* fix: ensure plugin runtime was shutdown

* feat: cleanup install tasks

* fix: add scale logs

---------

Co-authored-by: gemini-code-assist[bot] <176961590+gemini-code-assist[bot]@users.noreply.github.com>
2025-11-18 17:28:02 +08:00

233 lines
4.2 KiB
Go

package stream
import (
"errors"
"sync"
"sync/atomic"
"github.com/gammazero/deque"
)
var ErrEmpty = errors.New("no data available")
type Stream[T any] struct {
q deque.Deque[T]
l *sync.Mutex
sig chan bool
closed int32
max int
listening bool
onClose []func()
beforeClose []func()
filter []func(T) error
err error
// Condition variable for blocking writes when queue is full
writeCond *sync.Cond
}
func NewStream[T any](max int) *Stream[T] {
mutex := &sync.Mutex{}
return &Stream[T]{
l: mutex,
sig: make(chan bool),
max: max,
writeCond: sync.NewCond(mutex),
}
}
// Filter filters the stream with a function
// if the function returns an error, the stream will be closed
func (r *Stream[T]) Filter(f func(T) error) {
r.filter = append(r.filter, f)
}
// OnClose adds a function to be called when the stream is closed
func (r *Stream[T]) OnClose(f func()) {
r.onClose = append(r.onClose, f)
}
// BeforeClose adds a function to be called before the stream is closed
func (r *Stream[T]) BeforeClose(f func()) {
r.beforeClose = append(r.beforeClose, f)
}
// Next returns true if there are more data to be read
// and waits for the next data to be available
// returns false if the stream is closed
// NOTE: even if the stream is closed, it will return true if there is data available
func (r *Stream[T]) Next() bool {
r.l.Lock()
if r.closed == 1 && r.q.Len() == 0 && r.err == nil {
r.l.Unlock()
return false
}
if r.q.Len() > 0 || r.err != nil {
r.l.Unlock()
return true
}
r.listening = true
defer func() {
r.listening = false
}()
r.l.Unlock()
return <-r.sig
}
// Read reads buffered data from the stream and
// it returns error only if the buffer is empty or an error is written to the stream
func (r *Stream[T]) Read() (T, error) {
r.l.Lock()
defer r.l.Unlock()
if r.q.Len() > 0 {
data := r.q.PopFront()
// Signal any waiting writers that there's now space in the queue
r.writeCond.Signal()
for _, f := range r.filter {
err := f(data)
if err != nil {
// close the stream
r.Close()
return data, err
}
}
return data, nil
} else {
var data T
if r.err != nil {
err := r.err
r.err = nil
return data, err
}
return data, ErrEmpty
}
}
// Process wraps the stream with a new stream, and allows customized operations
func (r *Stream[T]) Process(fn func(T)) error {
for r.Next() {
data, err := r.Read()
if err != nil {
return err
}
fn(data)
}
return nil
}
// Write writes data to the stream,
// returns error if the buffer is full
func (r *Stream[T]) Write(data T) error {
if atomic.LoadInt32(&r.closed) == 1 {
return nil
}
r.l.Lock()
if r.q.Len() >= r.max {
r.l.Unlock()
return errors.New("queue is full")
}
r.q.PushBack(data)
if r.q.Len() == 1 {
if r.listening {
r.sig <- true
}
}
r.l.Unlock()
return nil
}
// WriteBlocking writes data to the stream,
// blocks if the buffer is full until space becomes available
func (r *Stream[T]) WriteBlocking(data T) {
if atomic.LoadInt32(&r.closed) == 1 {
return
}
r.l.Lock()
defer r.l.Unlock()
// Wait until there's space in the queue or the stream is closed
for r.q.Len() >= r.max && atomic.LoadInt32(&r.closed) == 0 {
r.writeCond.Wait()
}
// Check if the stream was closed while waiting
if atomic.LoadInt32(&r.closed) == 1 {
return
}
r.q.PushBack(data)
if r.q.Len() == 1 {
if r.listening {
r.sig <- true
}
}
}
// Close closes the stream
func (r *Stream[T]) Close() {
if !atomic.CompareAndSwapInt32(&r.closed, 0, 1) {
return
}
for _, f := range r.beforeClose {
f()
}
select {
case r.sig <- false:
default:
}
close(r.sig)
// Wake up any waiting writers
r.l.Lock()
r.writeCond.Broadcast()
r.l.Unlock()
for _, f := range r.onClose {
f()
}
}
func (r *Stream[T]) IsClosed() bool {
return atomic.LoadInt32(&r.closed) == 1
}
func (r *Stream[T]) Size() int {
r.l.Lock()
defer r.l.Unlock()
return r.q.Len()
}
// WriteError writes an error to the stream
func (r *Stream[T]) WriteError(err error) {
if atomic.LoadInt32(&r.closed) == 1 {
return
}
r.l.Lock()
defer r.l.Unlock()
r.err = err
if r.q.Len() == 0 {
if r.listening {
r.sig <- true
}
}
}