/
state.go
205 lines (174 loc) · 5.8 KB
/
state.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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
// Copyright (c) 2018 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.
package executor
import (
"context"
"fmt"
"github.com/m3db/m3/src/query/executor/transform"
"github.com/m3db/m3/src/query/parser"
"github.com/m3db/m3/src/query/plan"
"github.com/m3db/m3/src/query/storage"
"github.com/m3db/m3/src/query/util/execution"
"github.com/pkg/errors"
)
// ExecutionState represents the execution hierarchy
type ExecutionState struct {
plan plan.PhysicalPlan
sources []parser.Source
resultNode Result
storage storage.Storage
}
// CreateSource creates a source node
func CreateSource(
ID parser.NodeID,
params SourceParams, storage storage.Storage,
options transform.Options,
) (parser.Source, *transform.Controller) {
controller := &transform.Controller{ID: ID}
return params.Node(controller, storage, options), controller
}
// CreateScalarSource creates a scalar source node
func CreateScalarSource(
ID parser.NodeID,
params ScalarParams,
options transform.Options,
) (parser.Source, *transform.Controller) {
controller := &transform.Controller{ID: ID}
return params.Node(controller, options), controller
}
// CreateTransform creates a transform node which works on functions and contains state
func CreateTransform(
ID parser.NodeID,
params transform.Params,
options transform.Options,
) (transform.OpNode, *transform.Controller) {
controller := &transform.Controller{ID: ID}
node := params.Node(controller, options)
switch node.(type) {
case transform.SeriesNode:
return transform.NewLazyNode(node, controller)
case transform.StepNode:
return transform.NewLazyNode(node, controller)
default:
return node, controller
}
}
// SourceParams are defined by sources
type SourceParams interface {
parser.Params
Node(
controller *transform.Controller,
storage storage.Storage,
options transform.Options,
) parser.Source
}
// ScalarParams are defined by sources
type ScalarParams interface {
parser.Params
Node(
controller *transform.Controller,
options transform.Options,
) parser.Source
}
// GenerateExecutionState creates an execution state from the physical plan
func GenerateExecutionState(
pplan plan.PhysicalPlan,
storage storage.Storage,
) (*ExecutionState, error) {
result := pplan.ResultStep
state := &ExecutionState{
plan: pplan,
storage: storage,
}
step, ok := pplan.Step(result.Parent)
if !ok {
return nil, fmt.Errorf("incorrect parent reference in result node, parentId: %s", result.Parent)
}
options := transform.Options{
TimeSpec: pplan.TimeSpec,
Debug: pplan.Debug,
}
controller, err := state.createNode(step, options)
if err != nil {
return nil, err
}
if len(state.sources) == 0 {
return nil, errors.New("empty sources for the execution state")
}
rNode := newResultNode()
state.resultNode = rNode
controller.AddTransform(rNode)
return state, nil
}
// createNode helps to create an execution node recursively
// TODO: consider modifying this function so that ExecutionState can have a non pointer receiver
func (s *ExecutionState) createNode(
step plan.LogicalStep,
options transform.Options,
) (*transform.Controller, error) {
// TODO: consider using a registry instead of casting to an interface
sourceParams, ok := step.Transform.Op.(SourceParams)
if ok {
source, controller := CreateSource(step.ID(), sourceParams, s.storage, options)
s.sources = append(s.sources, source)
return controller, nil
}
scalarParams, ok := step.Transform.Op.(ScalarParams)
if ok {
source, controller := CreateScalarSource(step.ID(), scalarParams, options)
s.sources = append(s.sources, source)
return controller, nil
}
transformParams, ok := step.Transform.Op.(transform.Params)
if !ok {
return nil, fmt.Errorf("invalid transform step, %s", step)
}
transformNode, controller := CreateTransform(step.ID(), transformParams, options)
for _, parentID := range step.Parents {
parentStep, ok := s.plan.Step(parentID)
if !ok {
return nil, fmt.Errorf("incorrect parent reference, parentId: %s, node: %s", parentID, step.ID())
}
parentController, err := s.createNode(parentStep, options)
if err != nil {
return nil, err
}
parentController.AddTransform(transformNode)
}
return controller, nil
}
// Execute the sources in parallel and return the first error
func (s *ExecutionState) Execute(ctx context.Context) error {
requests := make([]execution.Request, len(s.sources))
for idx, source := range s.sources {
requests[idx] = sourceRequest{source}
}
return execution.ExecuteParallel(ctx, requests)
}
// String representation of the state
func (s *ExecutionState) String() string {
return fmt.Sprintf("plan: %s\nsources: %s\nresult: %s", s.plan, s.sources, s.resultNode)
}
type sourceRequest struct {
source parser.Source
}
func (s sourceRequest) Process(ctx context.Context) error {
return s.source.Execute(ctx)
}