/
query_plan_debug.go
188 lines (164 loc) · 6 KB
/
query_plan_debug.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
/*
* Copyright 2018- The Pixie Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* SPDX-License-Identifier: Apache-2.0
*/
package controllers
import (
"fmt"
"strings"
"time"
"github.com/dustin/go-humanize"
"github.com/emicklei/dot"
"github.com/gofrs/uuid"
"px.dev/pixie/src/carnot/planner/distributedpb"
"px.dev/pixie/src/carnot/planpb"
"px.dev/pixie/src/carnot/queryresultspb"
"px.dev/pixie/src/utils"
)
func styleGraphNodeForPlan(p *planpb.PlanNode, n dot.Node, extraDetails string) dot.Node {
switch op := p.Op.OpType; op {
case planpb.GRPC_SINK_OPERATOR:
n.Attr("color", "yellow")
n.Attr("shape", "rect")
case planpb.GRPC_SOURCE_OPERATOR:
n.Attr("color", "darkorange")
n.Attr("shape", "rect")
case planpb.MEMORY_SINK_OPERATOR:
n.Attr("color", "red")
n.Attr("shape", "rect")
case planpb.MEMORY_SOURCE_OPERATOR:
n.Attr("color", "blue")
n.Attr("shape", "rect")
}
// If extraDetails is the empty string, dot strips the extra newline.
nodeLabel := fmt.Sprintf("%s[%d]\n%s", strings.ToLower(p.Op.OpType.String()), p.Id, extraDetails)
return n.Label(nodeLabel)
}
func graphNodeName(agentIDStr string, nodeID uint64) string {
return fmt.Sprintf("%s_%d", agentIDStr, nodeID)
}
func timeNSToString(timeNS int64) string {
return (time.Nanosecond * time.Duration(timeNS)).String()
}
func nodeExecTiming(nodeID int64, execStats *map[int64]*queryresultspb.OperatorExecutionStats) string {
stats, ok := (*execStats)[nodeID]
if !ok {
return ""
}
extraStats := []string{
fmt.Sprintf("self_time: %s", timeNSToString(stats.SelfExecutionTimeNs)),
fmt.Sprintf("total_time: %s", timeNSToString(stats.TotalExecutionTimeNs)),
fmt.Sprintf("bytes: %s", humanize.IBytes(uint64(stats.BytesOutput))),
fmt.Sprintf("records_processed: %d", stats.RecordsOutput),
}
for k, v := range stats.ExtraMetrics {
extraStats = append(extraStats, fmt.Sprintf("%s: %.3g", k, v))
}
for k, v := range stats.ExtraInfo {
extraStats = append(extraStats, fmt.Sprintf("%s: %s", k, v))
}
return strings.Join(extraStats, "\n")
}
// GetQueryPlanAsDotString converts the plan into a dotstring that can be rendered by GraphViz.
func GetQueryPlanAsDotString(distributedPlan *distributedpb.DistributedPlan, planMap map[uuid.UUID]*planpb.Plan,
planExecStats *[]*queryresultspb.AgentExecutionStats) (string, error) {
g := dot.NewGraph(dot.Directed)
execDetails := make(map[uuid.UUID]*queryresultspb.AgentExecutionStats)
if planExecStats != nil {
for _, execStat := range *planExecStats {
agentID := utils.UUIDFromProtoOrNil(execStat.AgentID)
execDetails[agentID] = execStat
}
}
// Node map keeps a map of strings to the graphviz nodes.
nodeMap := make(map[string]dot.Node)
for agentID, plan := range planMap {
if plan == nil {
return "", fmt.Errorf("plan for agent %s is nil", plan.String())
}
agentExecStats, hasExecStats := execDetails[agentID]
operatorExecStatsMap := make(map[int64]*queryresultspb.OperatorExecutionStats)
agentIDStr := agentID.String()
subGraphName := fmt.Sprintf("agent::%s", agentIDStr)
if hasExecStats {
for _, OperatorExecutionStats := range agentExecStats.OperatorExecutionStats {
operatorExecStatsMap[OperatorExecutionStats.NodeId] = OperatorExecutionStats
}
subGraphName += fmt.Sprintf("\n%s", timeNSToString(agentExecStats.ExecutionTimeNs))
}
s := g.Subgraph(subGraphName, dot.ClusterOption{})
s.Value(subGraphName)
s.Attr("color", "lightgrey")
if len(plan.Nodes) == 0 {
continue
}
queryFragment := plan.Nodes[0]
dag := queryFragment.Dag
for _, node := range queryFragment.Nodes {
nodeName := graphNodeName(agentIDStr, node.Id)
extraDetails := nodeExecTiming(int64(node.Id), &operatorExecStatsMap)
nodeMap[nodeName] = styleGraphNodeForPlan(node, s.Node(nodeName), extraDetails)
}
for _, node := range dag.Nodes {
if len(node.SortedChildren) == 0 {
continue
}
for _, child := range node.SortedChildren {
nodeName := graphNodeName(agentIDStr, node.Id)
childName := graphNodeName(agentIDStr, child)
s.Edge(nodeMap[nodeName], nodeMap[childName])
}
}
}
// Stitch up distributed plan nodes.
// This done by finding all the GRPC sink operators and looking up the destination ID.
// The destination ID refers to a node in another agents subgraph. The other agent subgraph is found
// by looking at the distributed plan dag.
// We need an inverted index to lookup the agentID by the distributed dag ID.
DAGIDToAgentIDMap := make(map[uint64]string)
for agentID, dagID := range distributedPlan.QbAddressToDagId {
DAGIDToAgentIDMap[dagID] = agentID
}
distChildrenList := make(map[uint64][]uint64)
for _, node := range distributedPlan.Dag.Nodes {
distChildrenList[node.Id] = node.SortedChildren
}
for agentID, plan := range planMap {
if plan == nil {
return "", fmt.Errorf("plan for agent %s is nil", plan.String())
}
agentIDStr := agentID.String()
if len(plan.Nodes) == 0 {
continue
}
queryFragment := plan.Nodes[0]
for _, node := range queryFragment.Nodes {
if node.Op.OpType == planpb.GRPC_SINK_OPERATOR {
fromNodeName := graphNodeName(agentIDStr, node.Id)
dest := node.Op.GetGRPCSinkOp().GetGRPCSourceID()
// Look up the children of the current agent and find all the valid destinations.
dagID := distributedPlan.QbAddressToDagId[agentID.String()]
for _, childID := range distChildrenList[dagID] {
nodeName := graphNodeName(DAGIDToAgentIDMap[childID], dest)
if gNode, ok := nodeMap[nodeName]; ok {
g.Edge(nodeMap[fromNodeName], gNode)
}
}
}
}
}
return g.String(), nil
}