This repository has been archived by the owner on Nov 15, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
physical.go
105 lines (89 loc) · 3.15 KB
/
physical.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
// 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 plan
import (
"fmt"
"time"
"github.com/m3db/m3coordinator/parser"
"github.com/m3db/m3coordinator/storage"
)
// PhysicalPlan represents the physical plan
type PhysicalPlan struct {
steps map[parser.NodeID]LogicalStep
pipeline []parser.NodeID // Ordered list of steps to be performed
ResultStep ResultOp
Now time.Time
}
// ResultOp is resonsible for delivering results to the clients
type ResultOp struct {
Parent parser.NodeID
}
// NewPhysicalPlan is used to generate a physical plan. Its responsibilities include creating consolidation nodes, result nodes,
// pushing down predicates, changing the ordering for nodes
// nolint: unparam
func NewPhysicalPlan(lp LogicalPlan, storage storage.Storage, now time.Time) (PhysicalPlan, error) {
// generate a new physical plan after cloning the logical plan so that any changes here do not update the logical plan
cloned := lp.Clone()
p := PhysicalPlan{
steps: cloned.Steps,
pipeline: cloned.Pipeline,
Now: now,
}
pl, err := p.createResultNode()
if err != nil {
return PhysicalPlan{}, err
}
return pl, nil
}
func (p PhysicalPlan) createResultNode() (PhysicalPlan, error) {
leaf, err := p.leafNode()
if err != nil {
return p, err
}
p.ResultStep = ResultOp{Parent: leaf.ID()}
return p, nil
}
func (p PhysicalPlan) leafNode() (LogicalStep, error) {
var leaf LogicalStep
found := false
for _, transformID := range p.pipeline {
node, ok := p.steps[transformID]
if !ok {
return leaf, fmt.Errorf("transform not found, %s", transformID)
}
if len(node.Children) == 0 {
if found {
return leaf, fmt.Errorf("multiple leaf nodes found, %v - %v", leaf, node)
}
leaf = node
found = true
}
}
return leaf, nil
}
// Step gets the logical step using its unique ID in the DAG
func (p PhysicalPlan) Step(ID parser.NodeID) (LogicalStep, bool) {
// Editor complains when inlining the map get
step, ok := p.steps[ID]
return step, ok
}
func (p PhysicalPlan) String() string {
return fmt.Sprintf("Steps: %s, Pipeline: %s, Result: %s", p.steps, p.pipeline, p.ResultStep)
}