risingwave_frontend/optimizer/rule/dag_to_tree_rule.rs
1// Copyright 2025 RisingWave Labs
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7// http://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14
15use super::prelude::{PlanRef, *};
16use crate::optimizer::plan_node::{LogicalShare, PlanTreeNodeUnary};
17
18pub struct DagToTreeRule {}
19impl Rule<Logical> for DagToTreeRule {
20 fn apply(&self, plan: PlanRef) -> Option<PlanRef> {
21 let mut inputs = plan.inputs();
22 let mut has_share = false;
23 for i in 0..inputs.len() {
24 if let Some(logical_share) = inputs[i].as_logical_share() {
25 let logical_share: &LogicalShare = logical_share;
26 inputs[i] = logical_share.input();
27 has_share = true;
28 }
29 }
30
31 if has_share {
32 Some(plan.clone_root_with_inputs(&inputs))
33 } else {
34 None
35 }
36 }
37}
38
39impl DagToTreeRule {
40 pub fn create() -> BoxedRule {
41 Box::new(DagToTreeRule {})
42 }
43}