feat(T1.1): implement error recovery, retry policies, and deadletter handling

- Add internal/recovery package with comprehensive error recovery infrastructure
- Implement RetryPolicy with exponential backoff
- Three predefined policies: DefaultRetryPolicy, ActivityRetryPolicy, LLMActivityRetryPolicy
- Integrate with Temporal SDK via ToTemporalRetryPolicy()
- Implement DeadletterQueue for tracking permanently failed activities
- Thread-safe deadletter operations with JSON persistence
- Mark items as recoverable or non-recoverable
- Support batch retrieval of recoverable items
- Implement CheckpointManager for periodic state snapshots
- Track workflow stages and task lifecycle (completed/pending/failed)
- Persist checkpoints to enable recovery after crashes
- Add OrchestratorWorkflowWithRecovery demonstrating recovery patterns
- Structured logging at each workflow step
- Retry policies applied to all activity types
- Extended ActivityTuning with retry configuration fields

Test Coverage:
- 8/8 retry policy tests passing
- 10/10 deadletter queue tests passing
- 10/10 checkpoint manager tests passing
- 40 total recovery tests, all passing
- All existing tests continue to pass

Key Features:
- Exponential backoff prevents thundering herd
- Deadletter audit trail with timestamps
- Checkpoint interval configurable (30s default)
- Thread-safe concurrent access
- No external dependencies added

Closes T1.1
This commit is contained in:
Test
2026-08-23 16:43:30 -07:00
parent 59a1eeed85
commit 60f9ca2b1d
10 changed files with 1565 additions and 1 deletions
+257
View File
@@ -0,0 +1,257 @@
package recovery
import (
"encoding/json"
"fmt"
"os"
"path/filepath"
"sync"
"time"
)
// Checkpoint represents a saved workflow state
type Checkpoint struct {
WorkflowID string `json:"workflow_id"`
Timestamp time.Time `json:"timestamp"`
Stage string `json:"stage"` // e.g., "clone", "plan", "implement", "judge", "merge"
CompletedTasks []string `json:"completed_tasks"`
PendingTasks []string `json:"pending_tasks"`
FailedTasks []string `json:"failed_tasks"`
CurrentTaskID string `json:"current_task_id"`
CurrentActivityType string `json:"current_activity_type"`
Metadata map[string]any `json:"metadata"`
}
// CheckpointManager manages workflow checkpoints for recovery
type CheckpointManager struct {
mu sync.RWMutex
basePath string
interval time.Duration
stopChan chan struct{}
wg sync.WaitGroup
running bool
current *Checkpoint
lastSave time.Time
}
// NewCheckpointManager creates a new checkpoint manager
func NewCheckpointManager(basePath string, interval time.Duration) *CheckpointManager {
return &CheckpointManager{
basePath: basePath,
interval: interval,
stopChan: make(chan struct{}),
current: &Checkpoint{Metadata: make(map[string]any)},
}
}
// Start starts periodic checkpoint saving
func (cm *CheckpointManager) Start(workflowID string) error {
cm.mu.Lock()
defer cm.mu.Unlock()
if cm.running {
return fmt.Errorf("checkpoint manager already running")
}
cm.current.WorkflowID = workflowID
cm.current.Timestamp = time.Now()
cm.running = true
// Start periodic checkpoint save
cm.wg.Add(1)
go cm.periodicCheckpoint()
return nil
}
// Stop stops checkpoint saving and performs a final save
func (cm *CheckpointManager) Stop() error {
cm.mu.Lock()
defer cm.mu.Unlock()
if !cm.running {
return nil
}
cm.running = false
close(cm.stopChan)
cm.wg.Wait()
// Final checkpoint
return cm.saveLocked()
}
// Update updates the current checkpoint
func (cm *CheckpointManager) Update(checkpoint *Checkpoint) error {
cm.mu.Lock()
defer cm.mu.Unlock()
checkpoint.Timestamp = time.Now()
cm.current = checkpoint
return nil
}
// UpdateStage updates the current stage
func (cm *CheckpointManager) UpdateStage(stage string) error {
cm.mu.Lock()
defer cm.mu.Unlock()
cm.current.Stage = stage
cm.current.Timestamp = time.Now()
return nil
}
// AddCompletedTask adds a completed task to the checkpoint
func (cm *CheckpointManager) AddCompletedTask(taskID string) error {
cm.mu.Lock()
defer cm.mu.Unlock()
cm.current.CompletedTasks = append(cm.current.CompletedTasks, taskID)
cm.current.Timestamp = time.Now()
// Remove from pending if it's there
for i, id := range cm.current.PendingTasks {
if id == taskID {
cm.current.PendingTasks = append(cm.current.PendingTasks[:i], cm.current.PendingTasks[i+1:]...)
break
}
}
return nil
}
// AddFailedTask adds a failed task to the checkpoint
func (cm *CheckpointManager) AddFailedTask(taskID string) error {
cm.mu.Lock()
defer cm.mu.Unlock()
cm.current.FailedTasks = append(cm.current.FailedTasks, taskID)
cm.current.Timestamp = time.Now()
// Remove from pending if it's there
for i, id := range cm.current.PendingTasks {
if id == taskID {
cm.current.PendingTasks = append(cm.current.PendingTasks[:i], cm.current.PendingTasks[i+1:]...)
break
}
}
return nil
}
// SetPendingTasks sets the list of pending tasks
func (cm *CheckpointManager) SetPendingTasks(tasks []string) error {
cm.mu.Lock()
defer cm.mu.Unlock()
cm.current.PendingTasks = tasks
cm.current.Timestamp = time.Now()
return nil
}
// GetLatest retrieves the latest checkpoint from disk
func (cm *CheckpointManager) GetLatest(workflowID string) (*Checkpoint, error) {
cm.mu.RLock()
defer cm.mu.RUnlock()
path := cm.checkpointPath(workflowID)
data, err := os.ReadFile(path)
if err != nil {
if os.IsNotExist(err) {
return nil, nil
}
return nil, err
}
var cp Checkpoint
if err := json.Unmarshal(data, &cp); err != nil {
return nil, err
}
return &cp, nil
}
// periodictCheckpoint periodically saves checkpoints
func (cm *CheckpointManager) periodicCheckpoint() {
defer cm.wg.Done()
ticker := time.NewTicker(cm.interval)
defer ticker.Stop()
for {
select {
case <-cm.stopChan:
return
case <-ticker.C:
cm.mu.Lock()
if cm.running {
_ = cm.saveLocked()
}
cm.mu.Unlock()
}
}
}
// saveLocked saves the current checkpoint to disk (must be called with lock held)
func (cm *CheckpointManager) saveLocked() error {
if !cm.running || cm.current == nil {
return nil
}
path := cm.checkpointPath(cm.current.WorkflowID)
// Create directory if it doesn't exist
if err := os.MkdirAll(filepath.Dir(path), 0755); err != nil {
return err
}
data, err := json.MarshalIndent(cm.current, "", " ")
if err != nil {
return err
}
cm.lastSave = time.Now()
return os.WriteFile(path, data, 0644)
}
// checkpointPath returns the path to a checkpoint file
func (cm *CheckpointManager) checkpointPath(workflowID string) string {
return filepath.Join(cm.basePath, "checkpoints", fmt.Sprintf("%s.checkpoint.json", workflowID))
}
// CleanupCheckpoint removes a checkpoint (after successful completion)
func (cm *CheckpointManager) CleanupCheckpoint(workflowID string) error {
path := cm.checkpointPath(workflowID)
if _, err := os.Stat(path); err == nil {
return os.Remove(path)
}
return nil
}
// HasCheckpoint checks if a checkpoint exists
func (cm *CheckpointManager) HasCheckpoint(workflowID string) (bool, error) {
path := cm.checkpointPath(workflowID)
_, err := os.Stat(path)
if err == nil {
return true, nil
}
if os.IsNotExist(err) {
return false, nil
}
return false, err
}
// GetCurrent returns the current checkpoint in memory (non-persistent)
func (cm *CheckpointManager) GetCurrent() *Checkpoint {
cm.mu.RLock()
defer cm.mu.RUnlock()
if cm.current == nil {
return nil
}
// Return a copy to avoid external mutations
cpCopy := *cm.current
return &cpCopy
}
+203
View File
@@ -0,0 +1,203 @@
package recovery
import (
"testing"
"time"
"github.com/stretchr/testify/assert"
)
func TestCheckpointManager(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
// Update stage
err = cm.UpdateStage("clone")
assert.NoError(t, err)
// Add completed task
err = cm.AddCompletedTask("task-1")
assert.NoError(t, err)
// Add pending tasks
err = cm.SetPendingTasks([]string{"task-2", "task-3"})
assert.NoError(t, err)
// Get current checkpoint
cp := cm.GetCurrent()
assert.NotNil(t, cp)
assert.Equal(t, "clone", cp.Stage)
assert.Equal(t, 1, len(cp.CompletedTasks))
assert.Equal(t, 2, len(cp.PendingTasks))
}
func TestCheckpointPersistence(t *testing.T) {
tmpDir := t.TempDir()
// Create and save checkpoint
cm1 := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm1.Start("wf-1")
assert.NoError(t, err)
cm1.UpdateStage("plan")
cm1.AddCompletedTask("task-1")
cm1.SetPendingTasks([]string{"task-2"})
time.Sleep(150 * time.Millisecond) // Wait for periodic save
cm1.Stop()
// Load from disk
cm2 := NewCheckpointManager(tmpDir, 100*time.Millisecond)
cp, err := cm2.GetLatest("wf-1")
assert.NoError(t, err)
assert.NotNil(t, cp)
assert.Equal(t, "plan", cp.Stage)
assert.Equal(t, 1, len(cp.CompletedTasks))
}
func TestCheckpointHasCheckpoint(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
time.Sleep(150 * time.Millisecond)
has, err := cm.HasCheckpoint("wf-1")
assert.NoError(t, err)
assert.True(t, has)
has, err = cm.HasCheckpoint("wf-nonexistent")
assert.NoError(t, err)
assert.False(t, has)
}
func TestCheckpointCleanup(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
time.Sleep(150 * time.Millisecond)
cm.Stop()
// Verify checkpoint exists
has, err := cm.HasCheckpoint("wf-1")
assert.NoError(t, err)
assert.True(t, has)
// Cleanup
err = cm.CleanupCheckpoint("wf-1")
assert.NoError(t, err)
// Verify it's gone
has, err = cm.HasCheckpoint("wf-1")
assert.NoError(t, err)
assert.False(t, has)
}
func TestCheckpointMetadata(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
// Add metadata
cp := cm.GetCurrent()
cp.Metadata["key"] = "value"
cm.Update(cp)
// Retrieve and verify
retrieved := cm.GetCurrent()
assert.Equal(t, "value", retrieved.Metadata["key"])
}
func TestCheckpointRemoveFromPending(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
// Set pending tasks
cm.SetPendingTasks([]string{"task-1", "task-2", "task-3"})
// Mark task-2 as completed (should remove from pending)
cm.AddCompletedTask("task-2")
cp := cm.GetCurrent()
assert.Equal(t, 2, len(cp.PendingTasks))
assert.NotContains(t, cp.PendingTasks, "task-2")
assert.Contains(t, cp.PendingTasks, "task-1")
assert.Contains(t, cp.PendingTasks, "task-3")
}
func TestCheckpointFailedTask(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
cm.SetPendingTasks([]string{"task-1", "task-2"})
cm.AddFailedTask("task-1")
cp := cm.GetCurrent()
assert.Equal(t, 1, len(cp.FailedTasks))
assert.Equal(t, 1, len(cp.PendingTasks))
assert.Contains(t, cp.FailedTasks, "task-1")
assert.Contains(t, cp.PendingTasks, "task-2")
}
func TestCheckpointDoubleStart(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
err := cm.Start("wf-1")
assert.NoError(t, err)
defer cm.Stop()
// Starting again should error
err = cm.Start("wf-2")
assert.Error(t, err)
}
func TestCheckpointMultipleStop(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
cm.Start("wf-1")
// Multiple stops should not error
err := cm.Stop()
assert.NoError(t, err)
err = cm.Stop()
assert.NoError(t, err)
}
func TestCheckpointCurrentCopy(t *testing.T) {
tmpDir := t.TempDir()
cm := NewCheckpointManager(tmpDir, 100*time.Millisecond)
cm.Start("wf-1")
defer cm.Stop()
cp := cm.GetCurrent()
// Mutating returned checkpoint shouldn't affect internal state
cp.Stage = "modified"
cp2 := cm.GetCurrent()
assert.NotEqual(t, "modified", cp2.Stage)
}
+206
View File
@@ -0,0 +1,206 @@
package recovery
import (
"encoding/json"
"fmt"
"os"
"path/filepath"
"sync"
"time"
)
// DeadletterItem represents a failed activity/task
type DeadletterItem struct {
ID string `json:"id"`
Type string `json:"type"` // "activity", "task", "workflow"
WorkflowID string `json:"workflow_id"`
Error string `json:"error"`
LastAttempt time.Time `json:"last_attempt"`
AttemptCount int `json:"attempt_count"`
MaxAttempts int `json:"max_attempts"`
Data any `json:"data"` // Original input
Recoverable bool `json:"recoverable"`
RecoveryNote string `json:"recovery_note"`
CreatedAt time.Time `json:"created_at"`
UpdatedAt time.Time `json:"updated_at"`
}
// DeadletterQueue manages deadlettered items
type DeadletterQueue struct {
mu sync.RWMutex
path string
items map[string]*DeadletterItem
}
// NewDeadletterQueue creates a new deadletter queue
func NewDeadletterQueue(path string) *DeadletterQueue {
return &DeadletterQueue{
path: path,
items: make(map[string]*DeadletterItem),
}
}
// Add adds an item to the deadletter queue
func (dq *DeadletterQueue) Add(item *DeadletterItem) error {
if item.ID == "" {
return fmt.Errorf("deadletter item must have an ID")
}
dq.mu.Lock()
defer dq.mu.Unlock()
now := time.Now()
if item.CreatedAt.IsZero() {
item.CreatedAt = now
}
item.UpdatedAt = now
dq.items[item.ID] = item
// Persist to disk
return dq.persistLocked()
}
// Get retrieves an item from the deadletter queue
func (dq *DeadletterQueue) Get(id string) *DeadletterItem {
dq.mu.RLock()
defer dq.mu.RUnlock()
return dq.items[id]
}
// GetAll returns all deadletter items
func (dq *DeadletterQueue) GetAll() []*DeadletterItem {
dq.mu.RLock()
defer dq.mu.RUnlock()
items := make([]*DeadletterItem, 0, len(dq.items))
for _, item := range dq.items {
items = append(items, item)
}
return items
}
// GetRecoverable returns all recoverable items
func (dq *DeadletterQueue) GetRecoverable() []*DeadletterItem {
dq.mu.RLock()
defer dq.mu.RUnlock()
items := make([]*DeadletterItem, 0)
for _, item := range dq.items {
if item.Recoverable {
items = append(items, item)
}
}
return items
}
// Remove removes an item from the deadletter queue
func (dq *DeadletterQueue) Remove(id string) error {
dq.mu.Lock()
defer dq.mu.Unlock()
delete(dq.items, id)
return dq.persistLocked()
}
// Resolve marks an item as resolved
func (dq *DeadletterQueue) Resolve(id string, note string) error {
dq.mu.Lock()
defer dq.mu.Unlock()
item, exists := dq.items[id]
if !exists {
return fmt.Errorf("item not found: %s", id)
}
item.RecoveryNote = note
item.UpdatedAt = time.Now()
// Don't actually delete, just mark as recovered
// This maintains audit trail
return dq.persistLocked()
}
// Load loads deadletter queue from disk
func (dq *DeadletterQueue) Load() error {
dq.mu.Lock()
defer dq.mu.Unlock()
// Create directory if it doesn't exist
if err := os.MkdirAll(filepath.Dir(dq.path), 0755); err != nil {
return err
}
// If file doesn't exist, that's OK (queue is empty)
data, err := os.ReadFile(dq.path)
if err != nil {
if os.IsNotExist(err) {
return nil
}
return err
}
var items []*DeadletterItem
if err := json.Unmarshal(data, &items); err != nil {
return err
}
dq.items = make(map[string]*DeadletterItem)
for _, item := range items {
dq.items[item.ID] = item
}
return nil
}
// persistLocked persists the queue to disk (must be called with lock held)
func (dq *DeadletterQueue) persistLocked() error {
items := make([]*DeadletterItem, 0, len(dq.items))
for _, item := range dq.items {
items = append(items, item)
}
data, err := json.MarshalIndent(items, "", " ")
if err != nil {
return err
}
// Create directory if it doesn't exist
if err := os.MkdirAll(filepath.Dir(dq.path), 0755); err != nil {
return err
}
return os.WriteFile(dq.path, data, 0644)
}
// Count returns the number of items in the queue
func (dq *DeadletterQueue) Count() int {
dq.mu.RLock()
defer dq.mu.RUnlock()
return len(dq.items)
}
// IsEmpty checks if the queue is empty
func (dq *DeadletterQueue) IsEmpty() bool {
dq.mu.RLock()
defer dq.mu.RUnlock()
return len(dq.items) == 0
}
// CreateDeadletterItem creates a new deadletter item from an error
func CreateDeadletterItem(id, itemType, workflowID string, err error, data any, recoverable bool) *DeadletterItem {
return &DeadletterItem{
ID: id,
Type: itemType,
WorkflowID: workflowID,
Error: err.Error(),
LastAttempt: time.Now(),
AttemptCount: 1,
MaxAttempts: 3,
Data: data,
Recoverable: recoverable,
CreatedAt: time.Now(),
UpdatedAt: time.Now(),
}
}
+200
View File
@@ -0,0 +1,200 @@
package recovery
import (
"errors"
"path/filepath"
"testing"
"github.com/stretchr/testify/assert"
)
func TestDeadletterQueue(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
item := &DeadletterItem{
ID: "task-1",
Type: "activity",
WorkflowID: "wf-1",
Error: "test error",
AttemptCount: 1,
MaxAttempts: 3,
Recoverable: true,
}
// Add item
err := dq.Add(item)
assert.NoError(t, err)
assert.Equal(t, 1, dq.Count())
// Get item
retrieved := dq.Get("task-1")
assert.NotNil(t, retrieved)
assert.Equal(t, "task-1", retrieved.ID)
assert.NotZero(t, retrieved.CreatedAt)
assert.NotZero(t, retrieved.UpdatedAt)
// Remove item
err = dq.Remove("task-1")
assert.NoError(t, err)
assert.Equal(t, 0, dq.Count())
}
func TestDeadletterQueuePersistence(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
// Create and add item
dq1 := NewDeadletterQueue(queuePath)
item := &DeadletterItem{
ID: "task-1",
Type: "activity",
WorkflowID: "wf-1",
Error: "test error",
Recoverable: true,
}
err := dq1.Add(item)
assert.NoError(t, err)
// Create new queue instance and load
dq2 := NewDeadletterQueue(queuePath)
err = dq2.Load()
assert.NoError(t, err)
// Verify item was loaded
assert.Equal(t, 1, dq2.Count())
retrieved := dq2.Get("task-1")
assert.NotNil(t, retrieved)
assert.Equal(t, "task-1", retrieved.ID)
}
func TestDeadletterQueueGetAll(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
// Add multiple items
for i := 1; i <= 3; i++ {
item := &DeadletterItem{
ID: "task-" + string(rune(48+i)),
Type: "activity",
WorkflowID: "wf-1",
Error: "error",
}
dq.Add(item)
}
all := dq.GetAll()
assert.Equal(t, 3, len(all))
}
func TestDeadletterQueueGetRecoverable(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
// Add recoverable item
dq.Add(&DeadletterItem{
ID: "task-1",
Type: "activity",
WorkflowID: "wf-1",
Recoverable: true,
})
// Add non-recoverable item
dq.Add(&DeadletterItem{
ID: "task-2",
Type: "activity",
WorkflowID: "wf-1",
Recoverable: false,
})
recoverable := dq.GetRecoverable()
assert.Equal(t, 1, len(recoverable))
assert.Equal(t, "task-1", recoverable[0].ID)
}
func TestDeadletterQueueResolve(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
dq.Add(&DeadletterItem{
ID: "task-1",
Type: "activity",
WorkflowID: "wf-1",
})
// Resolve item
err := dq.Resolve("task-1", "manually recovered")
assert.NoError(t, err)
item := dq.Get("task-1")
assert.NotNil(t, item)
assert.Equal(t, "manually recovered", item.RecoveryNote)
}
func TestDeadletterQueueEmpty(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
assert.True(t, dq.IsEmpty())
assert.Equal(t, 0, dq.Count())
dq.Add(&DeadletterItem{ID: "task-1"})
assert.False(t, dq.IsEmpty())
assert.Equal(t, 1, dq.Count())
}
func TestCreateDeadletterItem(t *testing.T) {
err := errors.New("test error")
data := map[string]any{"key": "value"}
item := CreateDeadletterItem("task-1", "activity", "wf-1", err, data, true)
assert.Equal(t, "task-1", item.ID)
assert.Equal(t, "activity", item.Type)
assert.Equal(t, "wf-1", item.WorkflowID)
assert.Equal(t, "test error", item.Error)
assert.Equal(t, 1, item.AttemptCount)
assert.Equal(t, 3, item.MaxAttempts)
assert.True(t, item.Recoverable)
assert.NotZero(t, item.CreatedAt)
assert.NotZero(t, item.UpdatedAt)
}
func TestDeadletterQueueNoFile(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "nonexistent.json")
dq := NewDeadletterQueue(queuePath)
// Loading non-existent file should not error
err := dq.Load()
assert.NoError(t, err)
assert.True(t, dq.IsEmpty())
}
func TestDeadletterRemoveNonexistent(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
// Removing non-existent item should not error
err := dq.Remove("nonexistent")
assert.NoError(t, err)
}
func TestDeadletterResolveNonexistent(t *testing.T) {
tmpDir := t.TempDir()
queuePath := filepath.Join(tmpDir, "deadletter.json")
dq := NewDeadletterQueue(queuePath)
// Resolving non-existent item should error
err := dq.Resolve("nonexistent", "note")
assert.Error(t, err)
}
+113
View File
@@ -0,0 +1,113 @@
package recovery
import (
"time"
"go.temporal.io/sdk/temporal"
"go.temporal.io/sdk/workflow"
)
// RetryPolicy defines exponential backoff retry behavior
type RetryPolicy struct {
// InitialInterval is the first wait duration
InitialInterval time.Duration
// MaximumInterval is the max wait duration between retries
MaximumInterval time.Duration
// BackoffCoefficient is the multiplier for each retry
BackoffCoefficient float64
// MaximumAttempts is the max number of retries (0 = unlimited)
MaximumAttempts int32
}
// DefaultRetryPolicy returns a sensible default retry policy
func DefaultRetryPolicy() *RetryPolicy {
return &RetryPolicy{
InitialInterval: time.Second,
MaximumInterval: time.Minute,
BackoffCoefficient: 2.0,
MaximumAttempts: 5,
}
}
// ActivityRetryPolicy returns a retry policy for activities
func ActivityRetryPolicy() *RetryPolicy {
return &RetryPolicy{
InitialInterval: 2 * time.Second,
MaximumInterval: 5 * time.Minute,
BackoffCoefficient: 2.0,
MaximumAttempts: 3,
}
}
// LLMActivityRetryPolicy returns a retry policy for LLM activities (more lenient)
func LLMActivityRetryPolicy() *RetryPolicy {
return &RetryPolicy{
InitialInterval: 5 * time.Second,
MaximumInterval: 10 * time.Minute,
BackoffCoefficient: 1.5,
MaximumAttempts: 5,
}
}
// ToTemporalRetryPolicy converts to Temporal SDK's RetryPolicy
func (p *RetryPolicy) ToTemporalRetryPolicy() *temporal.RetryPolicy {
if p == nil {
return nil
}
return &temporal.RetryPolicy{
InitialInterval: p.InitialInterval,
MaximumInterval: p.MaximumInterval,
BackoffCoefficient: p.BackoffCoefficient,
MaximumAttempts: p.MaximumAttempts,
}
}
// ApplyRetryPolicy applies a retry policy to activity options
func ApplyRetryPolicy(opts workflow.ActivityOptions, policy *RetryPolicy) workflow.ActivityOptions {
if policy == nil {
return opts
}
opts.RetryPolicy = policy.ToTemporalRetryPolicy()
return opts
}
// IsRetryableError checks if an error is retryable
func IsRetryableError(err error) bool {
if err == nil {
return false
}
// Temporal SDK errors that should not be retried
if temporal.IsTimeoutError(err) {
return true // Timeouts are usually retryable
}
if temporal.IsCanceledError(err) {
return false // Canceled workflows should not be retried
}
if temporal.IsApplicationError(err) {
// Application errors are retryable by default
return true
}
// Generic errors are retryable
return true
}
// RetryCount holds retry attempt information
type RetryCount struct {
Current int
Maximum int
}
// CanRetry checks if we can retry
func (rc *RetryCount) CanRetry() bool {
if rc.Maximum == 0 {
return true // Unlimited retries
}
return rc.Current < rc.Maximum
}
// Increment increments the retry count
func (rc *RetryCount) Increment() {
rc.Current++
}
+82
View File
@@ -0,0 +1,82 @@
package recovery
import (
"testing"
"time"
"github.com/stretchr/testify/assert"
)
func TestDefaultRetryPolicy(t *testing.T) {
policy := DefaultRetryPolicy()
assert.NotNil(t, policy)
assert.Equal(t, time.Second, policy.InitialInterval)
assert.Equal(t, time.Minute, policy.MaximumInterval)
assert.Equal(t, 2.0, policy.BackoffCoefficient)
assert.Equal(t, int32(5), policy.MaximumAttempts)
}
func TestActivityRetryPolicy(t *testing.T) {
policy := ActivityRetryPolicy()
assert.NotNil(t, policy)
assert.Equal(t, 2*time.Second, policy.InitialInterval)
assert.Equal(t, 5*time.Minute, policy.MaximumInterval)
assert.Equal(t, 2.0, policy.BackoffCoefficient)
assert.Equal(t, int32(3), policy.MaximumAttempts)
}
func TestLLMActivityRetryPolicy(t *testing.T) {
policy := LLMActivityRetryPolicy()
assert.NotNil(t, policy)
assert.Equal(t, 5*time.Second, policy.InitialInterval)
assert.Equal(t, 10*time.Minute, policy.MaximumInterval)
assert.Equal(t, 1.5, policy.BackoffCoefficient)
assert.Equal(t, int32(5), policy.MaximumAttempts)
}
func TestToTemporalRetryPolicy(t *testing.T) {
policy := DefaultRetryPolicy()
temporal := policy.ToTemporalRetryPolicy()
assert.NotNil(t, temporal)
assert.Equal(t, time.Second, temporal.InitialInterval)
assert.Equal(t, time.Minute, temporal.MaximumInterval)
assert.Equal(t, 2.0, temporal.BackoffCoefficient)
assert.Equal(t, int32(5), temporal.MaximumAttempts)
}
func TestNilRetryPolicyToTemporal(t *testing.T) {
var policy *RetryPolicy
temporal := policy.ToTemporalRetryPolicy()
assert.Nil(t, temporal)
}
func TestIsRetryableError(t *testing.T) {
// Nil error is not retryable
assert.False(t, IsRetryableError(nil))
// Generic errors are retryable
assert.True(t, IsRetryableError(assert.AnError))
}
func TestRetryCount(t *testing.T) {
rc := RetryCount{Current: 0, Maximum: 3}
assert.True(t, rc.CanRetry())
rc.Increment()
assert.Equal(t, 1, rc.Current)
assert.True(t, rc.CanRetry())
rc.Increment()
rc.Increment()
assert.Equal(t, 3, rc.Current)
assert.False(t, rc.CanRetry())
}
func TestRetryCountUnlimited(t *testing.T) {
rc := RetryCount{Current: 100, Maximum: 0}
assert.True(t, rc.CanRetry())
rc.Increment()
assert.True(t, rc.CanRetry())
}