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
// 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.
use std::collections::BTreeMap;
use std::convert::Infallible;
use std::ops::Rem;
use std::sync::Arc;
use std::time::Duration;
use differential_dataflow::AsCollection;
use futures::StreamExt;
use mz_ore::iter::IteratorExt;
use mz_repr::Row;
use mz_storage_types::errors::DataflowError;
use mz_storage_types::sources::load_generator::{
Event, Generator, KeyValueLoadGenerator, LoadGenerator, LoadGeneratorOutput,
LoadGeneratorSourceConnection,
};
use mz_storage_types::sources::{MzOffset, SourceExportDetails, SourceTimestamp};
use mz_timely_util::builder_async::{OperatorBuilder as AsyncOperatorBuilder, PressOnDropButton};
use mz_timely_util::containers::stack::AccountedStackBuilder;
use timely::dataflow::{Scope, Stream};
use timely::progress::Antichain;
use tokio::time::{interval_at, Instant};
use crate::healthcheck::{HealthStatusMessage, HealthStatusUpdate, StatusNamespace};
use crate::source::types::{
Probe, ProgressStatisticsUpdate, SignaledFuture, SourceRender, StackedCollection,
};
use crate::source::{RawSourceCreationConfig, SourceMessage};
mod auction;
mod clock;
mod counter;
mod datums;
mod key_value;
mod marketing;
mod tpch;
pub use auction::Auction;
pub use clock::Clock;
pub use counter::Counter;
pub use datums::Datums;
pub use tpch::Tpch;
use self::marketing::Marketing;
enum GeneratorKind {
Simple {
generator: Box<dyn Generator>,
tick_micros: Option<u64>,
as_of: u64,
up_to: u64,
},
KeyValue(KeyValueLoadGenerator),
}
impl GeneratorKind {
fn new(g: &LoadGenerator, tick_micros: Option<u64>, as_of: u64, up_to: u64) -> Self {
match g {
LoadGenerator::Auction => GeneratorKind::Simple {
generator: Box::new(Auction {}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::Clock => GeneratorKind::Simple {
generator: Box::new(Clock {
tick_ms: tick_micros
.map(Duration::from_micros)
.unwrap_or(Duration::from_secs(1))
.as_millis()
.try_into()
.expect("reasonable tick interval"),
as_of_ms: as_of,
}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::Counter { max_cardinality } => GeneratorKind::Simple {
generator: Box::new(Counter {
max_cardinality: max_cardinality.clone(),
}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::Datums => GeneratorKind::Simple {
generator: Box::new(Datums {}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::Marketing => GeneratorKind::Simple {
generator: Box::new(Marketing {}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::Tpch {
count_supplier,
count_part,
count_customer,
count_orders,
count_clerk,
} => GeneratorKind::Simple {
generator: Box::new(Tpch {
count_supplier: *count_supplier,
count_part: *count_part,
count_customer: *count_customer,
count_orders: *count_orders,
count_clerk: *count_clerk,
// The default tick behavior 1s. For tpch we want to disable ticking
// completely.
tick: Duration::from_micros(tick_micros.unwrap_or(0)),
}),
tick_micros,
as_of,
up_to,
},
LoadGenerator::KeyValue(kv) => GeneratorKind::KeyValue(kv.clone()),
}
}
fn render<G: Scope<Timestamp = MzOffset>>(
self,
scope: &mut G,
config: RawSourceCreationConfig,
committed_uppers: impl futures::Stream<Item = Antichain<MzOffset>> + 'static,
start_signal: impl std::future::Future<Output = ()> + 'static,
) -> (
StackedCollection<G, (usize, Result<SourceMessage, DataflowError>)>,
Option<Stream<G, Infallible>>,
Stream<G, HealthStatusMessage>,
Stream<G, ProgressStatisticsUpdate>,
Vec<PressOnDropButton>,
) {
// figure out which output types from the generator belong to which output indexes
let mut output_map = BTreeMap::new();
for (_, export) in config.source_exports.iter() {
let output_type = match &export.export.details {
SourceExportDetails::LoadGenerator(details) => details.output,
// This is an export that doesn't need any data output to it.
SourceExportDetails::None => continue,
_ => panic!(
"unexpected source export details: {:?}",
export.export.details
),
};
output_map
.entry(output_type)
.or_insert_with(Vec::new)
.push(export.ingestion_output);
}
match self {
GeneratorKind::Simple {
tick_micros,
as_of,
up_to,
generator,
} => render_simple_generator(
generator,
tick_micros,
as_of.into(),
up_to.into(),
scope,
config,
committed_uppers,
output_map,
),
GeneratorKind::KeyValue(kv) => key_value::render(
kv,
scope,
config,
committed_uppers,
start_signal,
output_map,
),
}
}
}
impl SourceRender for LoadGeneratorSourceConnection {
type Time = MzOffset;
const STATUS_NAMESPACE: StatusNamespace = StatusNamespace::Generator;
fn render<G: Scope<Timestamp = MzOffset>>(
self,
scope: &mut G,
config: RawSourceCreationConfig,
committed_uppers: impl futures::Stream<Item = Antichain<MzOffset>> + 'static,
start_signal: impl std::future::Future<Output = ()> + 'static,
) -> (
StackedCollection<G, (usize, Result<SourceMessage, DataflowError>)>,
Option<Stream<G, Infallible>>,
Stream<G, HealthStatusMessage>,
Stream<G, ProgressStatisticsUpdate>,
Option<Stream<G, Probe<MzOffset>>>,
Vec<PressOnDropButton>,
) {
let generator_kind = GeneratorKind::new(
&self.load_generator,
self.tick_micros,
self.as_of,
self.up_to,
);
let (updates, uppers, health, stats, button) =
generator_kind.render(scope, config, committed_uppers, start_signal);
(updates, uppers, health, stats, None, button)
}
}
fn render_simple_generator<G: Scope<Timestamp = MzOffset>>(
generator: Box<dyn Generator>,
tick_micros: Option<u64>,
as_of: MzOffset,
up_to: MzOffset,
scope: &G,
config: RawSourceCreationConfig,
committed_uppers: impl futures::Stream<Item = Antichain<MzOffset>> + 'static,
output_map: BTreeMap<LoadGeneratorOutput, Vec<usize>>,
) -> (
StackedCollection<G, (usize, Result<SourceMessage, DataflowError>)>,
Option<Stream<G, Infallible>>,
Stream<G, HealthStatusMessage>,
Stream<G, ProgressStatisticsUpdate>,
Vec<PressOnDropButton>,
) {
let mut builder = AsyncOperatorBuilder::new(config.name.clone(), scope.clone());
let (data_output, stream) = builder.new_output::<AccountedStackBuilder<_>>();
let (health_output, health_stream) = builder.new_output();
let (stats_output, stats_stream) = builder.new_output();
let busy_signal = Arc::clone(&config.busy_signal);
let button = builder.build(move |caps| {
SignaledFuture::new(busy_signal, async move {
let [mut cap, health_cap, stats_cap]: [_; 3] = caps.try_into().unwrap();
// We only need this until we reported ourselves as Running.
let mut health_cap = Some(health_cap);
if !config.responsible_for(()) {
// Emit 0, to mark this worker as having started up correctly.
stats_output.give(
&stats_cap,
ProgressStatisticsUpdate::SteadyState {
offset_known: 0,
offset_committed: 0,
},
);
return;
}
let resume_upper = Antichain::from_iter(
config
.source_resume_uppers
.values()
.flat_map(|f| f.iter().map(MzOffset::decode_row)),
);
let Some(resume_offset) = resume_upper.into_option() else {
return;
};
let now_fn = mz_ore::now::SYSTEM_TIME.clone();
let start_instant = {
// We want to have our interval start at a nice round number...
// for example, if our tick interval is one minute, to start at a minute boundary.
// However, the `Interval` type from tokio can't be "floored" in that way.
// Instead, figure out the amount we should step forward based on the wall clock,
// then apply that to our monotonic clock to make things start at approximately the
// right time.
let now_millis = now_fn();
let now_instant = Instant::now();
let delay_millis = tick_micros
.map(|tick_micros| tick_micros / 1000)
.filter(|tick_millis| *tick_millis > 0)
.map(|tick_millis| tick_millis - now_millis.rem(tick_millis))
.unwrap_or(0);
now_instant + Duration::from_millis(delay_millis)
};
let tick = Duration::from_micros(tick_micros.unwrap_or(1_000_000));
let mut tick_interval = interval_at(start_instant, tick);
let mut rows = generator.by_seed(now_fn, None, resume_offset);
let mut committed_uppers = std::pin::pin!(committed_uppers);
// If we are just starting up, report 0 as our `offset_committed`.
let mut offset_committed = if resume_offset.offset == 0 {
Some(0)
} else {
None
};
while let Some((output_type, event)) = rows.next() {
match event {
Event::Message(mut offset, (value, diff)) => {
// Fast forward any data before the requested as of.
if offset <= as_of {
offset = as_of;
}
// If the load generator produces data at or beyond the
// requested `up_to`, drop it. We'll terminate the load
// generator when the capability advances to the `up_to`,
// but the load generator might produce data far in advance
// of its capability.
if offset >= up_to {
continue;
}
let outputs = match output_map.get(&output_type) {
Some(outputs) => outputs,
// We don't have an output index for this output type, so drop it
None => continue,
};
let message = Ok(SourceMessage {
key: Row::default(),
value,
metadata: Row::default(),
});
// Some generators always reproduce their TVC from the beginning which can
// generate a significant amount of data that will overwhelm the dataflow.
// Since those are not required downstream we eagerly ignore them here.
if resume_offset <= offset {
for (&output, message) in outputs.iter().repeat_clone(message) {
data_output
.give_fueled(&cap, ((output, message), offset, diff))
.await;
}
}
}
Event::Progress(Some(offset)) => {
if resume_offset <= offset && health_cap.is_some() {
let health_cap = health_cap.take().expect("known to exist");
health_output.give(
&health_cap,
HealthStatusMessage {
index: 0,
namespace: StatusNamespace::Generator,
update: HealthStatusUpdate::running(),
},
);
}
// If we've reached the requested maximum offset, cease.
if offset >= up_to {
break;
}
// If the offset is at or below the requested `as_of`, don't
// downgrade the capability.
if offset <= as_of {
continue;
}
cap.downgrade(&offset);
// We only sleep if we have surpassed the resume offset so that we can
// quickly go over any historical updates that a generator might choose to
// emit.
// TODO(petrosagg): Remove the sleep below and make generators return an
// async stream so that they can drive the rate of production directly
if resume_offset < offset {
loop {
tokio::select! {
_tick = tick_interval.tick() => {
break;
}
Some(frontier) = committed_uppers.next() => {
if let Some(offset) = frontier.as_option() {
// Offset N means we have committed N offsets (offsets are
// 0-indexed)
offset_committed = Some(offset.offset);
}
}
}
}
// TODO(guswynn): generators have various definitions of "snapshot", so
// we are not going to implement snapshot progress statistics for them
// right now, but will come back to it.
if let Some(offset_committed) = offset_committed {
stats_output.give(
&stats_cap,
ProgressStatisticsUpdate::SteadyState {
// technically we could have _known_ a larger offset
// than the one that has been committed, but we can
// never recover that known amount on restart, so we
// just advance these in lock step.
offset_known: offset_committed,
offset_committed,
},
);
}
}
}
Event::Progress(None) => return,
}
}
})
});
(
stream.as_collection(),
None,
health_stream,
stats_stream,
vec![button.press_on_drop()],
)
}