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 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530
// Copyright Materialize, Inc. and contributors. All rights reserved.
//
// Use of this software is governed by the Business Source License
// included in the LICENSE file.
//
// As of the Change Date specified in that file, in accordance with
// the Business Source License, use of this software will be governed
// by the Apache License, Version 2.0.
//! Tracing utilities for explainable plans.
use std::fmt::{Debug, Display};
use std::sync::Arc;
use mz_catalog::memory::objects::Cluster;
use mz_compute_types::dataflows::DataflowDescription;
use mz_compute_types::plan::Plan;
use mz_expr::explain::ExplainContext;
use mz_expr::{MirRelationExpr, MirScalarExpr, OptimizedMirRelationExpr, RowSetFinishing};
use mz_ore::collections::CollectionExt;
use mz_repr::explain::tracing::{PlanTrace, TraceEntry};
use mz_repr::explain::{
Explain, ExplainConfig, ExplainError, ExplainFormat, ExprHumanizer, UsedIndexes,
};
use mz_repr::optimize::OptimizerFeatures;
use mz_repr::{Datum, Row};
use mz_sql::ast::display::AstDisplay;
use mz_sql::plan::{self, HirRelationExpr, HirScalarExpr};
use mz_sql_parser::ast::{ExplainStage, NamedPlan};
use mz_transform::dataflow::DataflowMetainfo;
use mz_transform::notice::RawOptimizerNotice;
use smallvec::SmallVec;
use tracing::dispatcher;
use tracing_subscriber::prelude::*;
use crate::coord::peek::FastPathPlan;
use crate::explain::insights::{self, PlanInsightsContext};
use crate::explain::Explainable;
use crate::AdapterError;
/// Provides functionality for tracing plans generated by the execution of an
/// optimization pipeline.
///
/// Internally, this will create a layered [`tracing::subscriber::Subscriber`]
/// consisting of one layer for each supported plan type `T` and wrap it into a
/// [`dispatcher::Dispatch`] instance.
///
/// Use [`OptimizerTrace::as_guard`] to activate the [`dispatcher::Dispatch`]
/// and collect a trace.
///
/// Use [`OptimizerTrace::into_rows`] or [`OptimizerTrace::into_plan_insights`]
/// to cleanly destroy the [`OptimizerTrace`] instance and obtain the tracing
/// result.
pub struct OptimizerTrace(dispatcher::Dispatch);
impl std::fmt::Debug for OptimizerTrace {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_tuple("OptimizerTrace").finish() // Skip the dispatch field
}
}
impl OptimizerTrace {
/// Create a new [`OptimizerTrace`].
///
/// The instance will only accumulate [`TraceEntry`] instances along
/// the prefix of the given `path` if `path` is present, or it will
/// accumulate all [`TraceEntry`] instances otherwise.
pub fn new(filter: Option<SmallVec<[NamedPlan; 4]>>) -> OptimizerTrace {
let filter = || filter.clone();
if let Some(global_subscriber) = mz_ore::tracing::GLOBAL_SUBSCRIBER.get() {
let subscriber = Arc::clone(global_subscriber)
// Collect `explain_plan` types that are not used in the regular explain
// path, but are useful when instrumenting code for debugging purposes.
.with(PlanTrace::<String>::new(filter()))
.with(PlanTrace::<HirScalarExpr>::new(filter()))
.with(PlanTrace::<MirScalarExpr>::new(filter()))
// Collect `explain_plan` types that are used in the regular explain path.
.with(PlanTrace::<HirRelationExpr>::new(filter()))
.with(PlanTrace::<MirRelationExpr>::new(filter()))
.with(PlanTrace::<DataflowDescription<OptimizedMirRelationExpr>>::new(filter()))
.with(PlanTrace::<DataflowDescription<Plan>>::new(filter()))
// Don't filter for FastPathPlan entries (there can be at most one).
.with(PlanTrace::<FastPathPlan>::new(None))
.with(PlanTrace::<UsedIndexes>::new(None))
// All optimizer spans are `TRACE` and up. Technically this slows down the system
// by skipping the tracing fast path DURING an `EXPLAIN`, but we haven't
// seen this be a problem (yet).
//
// Note that we typically do NOT use global filters like this, preferring
// per-layer ones, but we are forced to because per-layer filters
// require an `Arc<dyn Subscriber + LookupSpan>`, which isn't a trait
// exposed by tracing, for now.
.with(tracing::level_filters::LevelFilter::TRACE);
OptimizerTrace(dispatcher::Dispatch::new(subscriber))
} else {
// This codepath should not be taken except in tests, and is left here as a
// convenience.
let subscriber = tracing_subscriber::registry()
.with(PlanTrace::<String>::new(filter()))
.with(PlanTrace::<HirScalarExpr>::new(filter()))
.with(PlanTrace::<MirScalarExpr>::new(filter()))
.with(PlanTrace::<HirRelationExpr>::new(filter()))
.with(PlanTrace::<MirRelationExpr>::new(filter()))
.with(PlanTrace::<DataflowDescription<OptimizedMirRelationExpr>>::new(filter()))
.with(PlanTrace::<DataflowDescription<Plan>>::new(filter()))
.with(PlanTrace::<FastPathPlan>::new(None))
.with(PlanTrace::<UsedIndexes>::new(None))
.with(tracing::level_filters::LevelFilter::TRACE);
OptimizerTrace(dispatcher::Dispatch::new(subscriber))
}
}
/// Enter this [`OptimizerTrace`]'s tracing [`dispatcher::Dispatch`], returning a guard.
///
/// Linked to this [`OptimizerTrace`] with a lifetime to ensure
/// [`OptimizerTrace::into_rows`] isn't called until the guard is dropped.
pub fn as_guard<'s>(&'s self) -> DispatchGuard<'s> {
let dispatch = self.0.clone();
let tracing_guard = tracing::dispatcher::set_default(&dispatch);
DispatchGuard {
_tracing_guard: tracing_guard,
_life: std::marker::PhantomData,
}
}
/// Convert the optimizer trace into a vector or rows that can be returned
/// to the client.
pub async fn into_rows(
self,
format: ExplainFormat,
config: &ExplainConfig,
features: &OptimizerFeatures,
humanizer: &dyn ExprHumanizer,
row_set_finishing: Option<RowSetFinishing>,
target_cluster: Option<&Cluster>,
dataflow_metainfo: DataflowMetainfo,
stage: ExplainStage,
stmt_kind: plan::ExplaineeStatementKind,
insights_ctx: Option<Box<PlanInsightsContext>>,
) -> Result<Vec<Row>, AdapterError> {
let collect_all = |format| {
self.collect_all(
format,
config,
features,
humanizer,
row_set_finishing.clone(),
target_cluster.map(|c| c.name.as_str()),
dataflow_metainfo.clone(),
)
};
let rows = match stage {
ExplainStage::Trace => {
// For the `Trace` (pseudo-)stage, return the entire trace as
// triples of (time, path, plan) values.
let rows = collect_all(format)?
.0
.into_iter()
.map(|entry| {
// The trace would have to take over 584 years to overflow a u64.
let span_duration = u64::try_from(entry.span_duration.as_nanos());
Row::pack_slice(&[
Datum::from(span_duration.unwrap_or(u64::MAX)),
Datum::from(entry.path.as_str()),
Datum::from(entry.plan.as_str()),
])
})
.collect();
rows
}
ExplainStage::PlanInsights => {
if format != ExplainFormat::Json {
coord_bail!("EXPLAIN PLAN INSIGHTS only supports JSON format");
}
let mut text_traces = collect_all(ExplainFormat::Text)?;
let mut json_traces = collect_all(ExplainFormat::Json)?;
let global_plan = self.collect_global_plan();
let fast_path_plan = self.collect_fast_path_plan();
// Plans can be very large and exhaust the json serialization recursion limit.
// Convert those into error objects.
let mut get_plan = |name: NamedPlan| {
let text_plan = match text_traces.remove(name.path()) {
None => "<unknown>".into(),
Some(entry) => entry.plan,
};
let json_plan = match json_traces.remove(name.path()) {
None => serde_json::Value::Null,
Some(entry) => serde_json::from_str(&entry.plan).unwrap_or_else(|e| {
serde_json::json!({
"error": format!("internal error: {e}"),
})
}),
};
serde_json::json!({
"text": text_plan,
"json": json_plan,
})
};
let is_fast_path = fast_path_plan.is_some();
let mut plan_insights =
insights::plan_insights(humanizer, global_plan, fast_path_plan);
let mut redacted_sql = None;
if let Some(insights_ctx) = insights_ctx {
redacted_sql = insights_ctx
.stmt
.as_ref()
.map(|s| Some(s.to_ast_string_redacted()));
if let (Some(plan_insights), false) = (plan_insights.as_mut(), is_fast_path) {
if insights_ctx.enable_re_optimize {
plan_insights
.compute_fast_path_clusters(humanizer, insights_ctx)
.await;
}
}
}
let cluster = target_cluster.map(|c| {
serde_json::json!({
"name": c.name,
"id": c.id,
})
});
let output = serde_json::json!({
"plans": {
"raw": get_plan(NamedPlan::Raw),
"optimized": {
"global": get_plan(NamedPlan::Global),
"fast_path": get_plan(NamedPlan::FastPath),
}
},
"insights": plan_insights,
"cluster": cluster,
"redacted_sql": redacted_sql,
});
let output = serde_json::to_string_pretty(&output).expect("JSON string");
vec![Row::pack_slice(&[Datum::from(output.as_str())])]
}
_ => {
// For everything else, return the plan for the stage identified
// by the corresponding path.
let path = stage
.paths()
.map(|path| path.into_element().path())
.ok_or_else(|| {
AdapterError::Internal("explain stage unexpectedly missing path".into())
})?;
let mut traces = collect_all(format)?;
// For certain stages we want to return the resulting fast path
// plan instead of the selected stage if it is present.
let plan = if stage.show_fast_path() && !config.no_fast_path {
traces
.remove(NamedPlan::FastPath.path())
.or_else(|| traces.remove(path))
} else {
traces.remove(path)
};
let row = plan
.map(|entry| Row::pack_slice(&[Datum::from(entry.plan.as_str())]))
.ok_or_else(|| {
if !stmt_kind.supports(&stage) {
// Print a nicer error for unsupported stages.
AdapterError::Unstructured(anyhow::anyhow!(format!(
"cannot EXPLAIN {stage} FOR {stmt_kind}"
)))
} else {
// We don't expect this stage to be missing.
AdapterError::Internal(format!(
"stage `{path}` not present in the collected optimizer trace",
))
}
})?;
vec![row]
}
};
// We assume that any `Dispatch` cloned from this `OptimizerTrace` has long been dropped
// (`as_guard` tries to ensure this.). We rebuild the tracing interest cache, as
// this `OptimizerTrace` is acting like a reload-layer, and tracing needs to
// recalculate what the max level is, using this often-unknown
// API. Note that the reference to the `Dispatch` in self MUST be dropped before
// re-calculating interest.
//
// Before this is dropped and rebuilt, there is small extra cost to all `DEBUG` spans and
// events, if the other layers (otel and stderr) are only interested in `INFO`.
drop(self);
tracing_core::callsite::rebuild_interest_cache();
Ok(rows)
}
/// Collect a [`insights::PlanInsights`] with insights about the the
/// optimized plans rendered as a JSON `String`.
pub async fn into_plan_insights(
self,
features: &OptimizerFeatures,
humanizer: &dyn ExprHumanizer,
row_set_finishing: Option<RowSetFinishing>,
target_cluster: Option<&Cluster>,
dataflow_metainfo: DataflowMetainfo,
insights_ctx: Option<Box<PlanInsightsContext>>,
) -> Result<String, AdapterError> {
let rows = self
.into_rows(
ExplainFormat::Json,
&ExplainConfig::default(),
features,
humanizer,
row_set_finishing,
target_cluster,
dataflow_metainfo,
ExplainStage::PlanInsights,
plan::ExplaineeStatementKind::Select,
insights_ctx,
)
.await?;
// When using `ExplainStage::PlanInsights`, we're guaranteed that the
// output is a single row containing a single column containing the plan
// insights as a string.
Ok(rows.into_element().into_element().unwrap_str().into())
}
/// Collect all traced plans for all plan types `T` that are available in
/// the wrapped [`dispatcher::Dispatch`].
fn collect_all(
&self,
format: ExplainFormat,
config: &ExplainConfig,
features: &OptimizerFeatures,
humanizer: &dyn ExprHumanizer,
row_set_finishing: Option<RowSetFinishing>,
target_cluster: Option<&str>,
dataflow_metainfo: DataflowMetainfo,
) -> Result<TraceEntries<String>, ExplainError> {
let mut results = vec![];
// First, create an ExplainContext without `used_indexes`. We'll use this to, e.g., collect
// HIR plans.
let mut context = ExplainContext {
config,
features,
humanizer,
cardinality_stats: Default::default(), // empty stats
used_indexes: Default::default(),
finishing: row_set_finishing.clone(),
duration: Default::default(),
target_cluster,
optimizer_notices: RawOptimizerNotice::explain(
&dataflow_metainfo.optimizer_notices,
humanizer,
config.redacted,
)?,
};
// Collect trace entries of types produced by local optimizer stages.
results.extend(itertools::chain!(
self.collect_explainable_entries::<HirRelationExpr>(&format, &mut context)?,
self.collect_explainable_entries::<MirRelationExpr>(&format, &mut context)?,
));
// Collect trace entries of types produced by global optimizer stages.
let mut context = ExplainContext {
config,
features,
humanizer,
cardinality_stats: Default::default(), // empty stats
used_indexes: Default::default(),
finishing: row_set_finishing,
duration: Default::default(),
target_cluster,
optimizer_notices: RawOptimizerNotice::explain(
&dataflow_metainfo.optimizer_notices,
humanizer,
config.redacted,
)?,
};
results.extend(itertools::chain!(
self.collect_explainable_entries::<DataflowDescription<OptimizedMirRelationExpr>>(
&format,
&mut context,
)?,
self.collect_explainable_entries::<DataflowDescription<Plan>>(&format, &mut context)?,
self.collect_explainable_entries::<FastPathPlan>(&format, &mut context)?,
));
// Collect trace entries of type String, HirScalarExpr, MirScalarExpr
// which are useful for ad-hoc debugging.
results.extend(itertools::chain!(
self.collect_scalar_entries::<HirScalarExpr>(),
self.collect_scalar_entries::<MirScalarExpr>(),
self.collect_string_entries(),
));
// sort plans by instant (TODO: this can be implemented in a more
// efficient way, as we can assume that each of the runs that are used
// to `*.extend` the `results` vector is already sorted).
results.sort_by_key(|x| x.instant);
Ok(TraceEntries(results))
}
/// Collects the global optimized plan from the trace, if it exists.
fn collect_global_plan(&self) -> Option<DataflowDescription<OptimizedMirRelationExpr>> {
self.0
.downcast_ref::<PlanTrace<DataflowDescription<OptimizedMirRelationExpr>>>()
.and_then(|trace| trace.find(NamedPlan::Global.path()))
.map(|entry| entry.plan)
}
/// Collects the fast path plan from the trace, if it exists.
fn collect_fast_path_plan(&self) -> Option<FastPathPlan> {
self.0
.downcast_ref::<PlanTrace<FastPathPlan>>()
.and_then(|trace| trace.find(NamedPlan::FastPath.path()))
.map(|entry| entry.plan)
}
/// Collect all trace entries of a plan type `T` that implements
/// [`Explainable`].
fn collect_explainable_entries<T>(
&self,
format: &ExplainFormat,
context: &mut ExplainContext,
) -> Result<Vec<TraceEntry<String>>, ExplainError>
where
T: Clone + Debug + 'static,
for<'a> Explainable<'a, T>: Explain<'a, Context = ExplainContext<'a>>,
{
if let Some(trace) = self.0.downcast_ref::<PlanTrace<T>>() {
// Get a handle of the associated `PlanTrace<UsedIndexes>`.
let used_indexes_trace = self.0.downcast_ref::<PlanTrace<UsedIndexes>>();
trace
.collect_as_vec()
.into_iter()
.map(|mut entry| {
// Update the context with the current time.
context.duration = entry.full_duration;
// Try to find the UsedIndexes instance for this entry.
let used_indexes = used_indexes_trace.map(|t| t.used_indexes_for(&entry.path));
// Render the EXPLAIN output string for this entry.
let plan = if let Some(mut used_indexes) = used_indexes {
// Temporary swap the found UsedIndexes with the default
// one in the ExplainContext while explaining the plan
// for this entry.
std::mem::swap(&mut context.used_indexes, &mut used_indexes);
let plan = Explainable::new(&mut entry.plan).explain(format, context)?;
std::mem::swap(&mut context.used_indexes, &mut used_indexes);
plan
} else {
// No UsedIndexes instance for this entry found - use
// the default UsedIndexes in the ExplainContext.
Explainable::new(&mut entry.plan).explain(format, context)?
};
Ok(TraceEntry {
instant: entry.instant,
span_duration: entry.span_duration,
full_duration: entry.full_duration,
path: entry.path,
plan,
})
})
.collect()
} else {
unreachable!("collect_explainable_entries called with wrong plan type T");
}
}
/// Collect all trace entries of a plan type `T`.
fn collect_scalar_entries<T>(&self) -> Vec<TraceEntry<String>>
where
T: Clone + Debug + 'static,
T: Display,
{
if let Some(trace) = self.0.downcast_ref::<PlanTrace<T>>() {
trace
.collect_as_vec()
.into_iter()
.map(|entry| TraceEntry {
instant: entry.instant,
span_duration: entry.span_duration,
full_duration: entry.full_duration,
path: entry.path,
plan: entry.plan.to_string(),
})
.collect()
} else {
vec![]
}
}
/// Collect all trace entries with plans of type [`String`].
fn collect_string_entries(&self) -> Vec<TraceEntry<String>> {
if let Some(trace) = self.0.downcast_ref::<PlanTrace<String>>() {
trace.collect_as_vec()
} else {
vec![]
}
}
}
/// A wrapper around a `tracing::subscriber::DefaultGuard`.
pub struct DispatchGuard<'a> {
_tracing_guard: tracing::subscriber::DefaultGuard,
_life: std::marker::PhantomData<&'a ()>,
}
/// A collection of optimizer trace entries with convenient accessor methods.
pub struct TraceEntries<T>(pub Vec<TraceEntry<T>>);
impl<T> TraceEntries<T> {
// Removes the first (and by assumption the only) trace that matches the
// given path from the collected trace.
pub fn remove(&mut self, path: &'static str) -> Option<TraceEntry<T>> {
let index = self.0.iter().position(|entry| entry.path == path);
index.map(|index| self.0.remove(index))
}
}