risingwave_frontend/planner/
delete.rs

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
// Copyright 2024 RisingWave Labs
//
// 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.

use fixedbitset::FixedBitSet;

use super::Planner;
use crate::binder::BoundDelete;
use crate::error::Result;
use crate::optimizer::plan_node::{generic, LogicalDelete, LogicalProject};
use crate::optimizer::property::{Order, RequiredDist};
use crate::optimizer::{PlanRef, PlanRoot};

impl Planner {
    pub(super) fn plan_delete(&mut self, delete: BoundDelete) -> Result<PlanRoot> {
        let scan = self.plan_base_table(&delete.table)?;
        let input = if let Some(expr) = delete.selection {
            self.plan_where(scan, expr)?
        } else {
            scan
        };
        let input = if delete.table.table_catalog.has_generated_column()
            || delete.table.table_catalog.has_rw_timestamp_column()
        {
            LogicalProject::with_out_col_idx(
                input,
                delete
                    .table
                    .table_catalog
                    .columns()
                    .iter()
                    .enumerate()
                    .filter_map(|(i, c)| (c.can_dml()).then_some(i)),
            )
            .into()
        } else {
            input
        };
        let returning = !delete.returning_list.is_empty();
        let mut plan: PlanRef = LogicalDelete::from(generic::Delete::new(
            input,
            delete.table_name.clone(),
            delete.table_id,
            delete.table_version_id,
            returning,
        ))
        .into();

        if returning {
            plan = LogicalProject::create(plan, delete.returning_list);
        }

        // For delete, frontend will only schedule one task so do not need this to be single.
        let dist = RequiredDist::Any;
        let mut out_fields = FixedBitSet::with_capacity(plan.schema().len());
        out_fields.insert_range(..);
        let out_names = if returning {
            delete.returning_schema.expect("If returning list is not empty, should provide returning schema in BoundDelete.").names()
        } else {
            plan.schema().names()
        };

        let root = PlanRoot::new_with_logical_plan(plan, dist, Order::any(), out_fields, out_names);
        Ok(root)
    }
}