-
Notifications
You must be signed in to change notification settings - Fork 787
/
interface.go
91 lines (82 loc) · 3.62 KB
/
interface.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
// Copyright (c) 2020 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//go:generate mockgen -package $GOPACKAGE -source $GOFILE -destination interface_mock.go -self_package github.com/uber/cadence/service/history/queue
package queue
import (
"github.com/uber/cadence/common"
"github.com/uber/cadence/common/persistence"
"github.com/uber/cadence/service/history/task"
)
type (
// DomainFilter filters domain
DomainFilter struct {
DomainIDs map[string]struct{}
// by default, a DomainFilter matches domains listed in the Domains field
// if reverseMatch is true then the DomainFilter matches domains that are
// not in the Domains field.
ReverseMatch bool
}
// ProcessingQueueState indicates the scope of a task processing queue and its current progress
ProcessingQueueState interface {
Level() int
AckLevel() task.Key
ReadLevel() task.Key
MaxLevel() task.Key
DomainFilter() DomainFilter
}
// ProcessingQueue is responsible for keeping track of the state of tasks
// within the scope defined by its state; it can also be split into multiple
// ProcessingQueues with non-overlapping scope or be merged with another
// ProcessingQueue
ProcessingQueue interface {
State() ProcessingQueueState
Split(ProcessingQueueSplitPolicy) []ProcessingQueue
Merge(ProcessingQueue) []ProcessingQueue
AddTasks(map[task.Key]task.Task, task.Key)
UpdateAckLevel() (task.Key, int) // return new ack level and number of pending tasks
// TODO: add Offload() method
}
// ProcessingQueueSplitPolicy determines if one ProcessingQueue should be split
// into multiple ProcessingQueues
ProcessingQueueSplitPolicy interface {
Evaluate(ProcessingQueue) []ProcessingQueueState
}
// ProcessingQueueCollection manages a list of non-overlapping ProcessingQueues
// and keep track of the current active ProcessingQueue
ProcessingQueueCollection interface {
Level() int
Queues() []ProcessingQueue
ActiveQueue() ProcessingQueue
AddTasks(map[task.Key]task.Task, task.Key)
UpdateAckLevels() (task.Key, int) // return min of all new ack levels and number of total pending tasks
Split(ProcessingQueueSplitPolicy) []ProcessingQueue
Merge([]ProcessingQueue)
// TODO: add Offload() method
}
// Processor is the interface for task queue processor
Processor interface {
common.Daemon
FailoverDomain(domainIDs map[string]struct{})
NotifyNewTask(clusterName string, executionInfo *persistence.WorkflowExecutionInfo, tasks []persistence.Task)
HandleAction(clusterName string, action *Action) (*ActionResult, error) // TODO: enforce context timeout for Actions
LockTaskProcessing()
UnlockTaskProcessing()
}
)