mirror of
https://github.com/aljazceru/turso.git
synced 2026-01-02 07:54:19 +01:00
418 lines
16 KiB
Rust
418 lines
16 KiB
Rust
use super::plan::{Aggregate, BTreeTableReference, Direction, Operator, Plan, ProjectionColumn};
|
|
use crate::{function::Func, schema::Schema, util::normalize_ident, Result};
|
|
use sqlite3_parser::ast::{self, FromClause, JoinType, ResultColumn};
|
|
|
|
pub struct OperatorIdCounter {
|
|
id: usize,
|
|
}
|
|
|
|
impl OperatorIdCounter {
|
|
pub fn new() -> Self {
|
|
Self { id: 1 }
|
|
}
|
|
pub fn get_next_id(&mut self) -> usize {
|
|
let id = self.id;
|
|
self.id += 1;
|
|
id
|
|
}
|
|
}
|
|
|
|
fn resolve_aggregates(expr: &ast::Expr, aggs: &mut Vec<Aggregate>) {
|
|
match expr {
|
|
ast::Expr::FunctionCall { name, args, .. } => {
|
|
let args_count = if let Some(args) = &args {
|
|
args.len()
|
|
} else {
|
|
0
|
|
};
|
|
match Func::resolve_function(normalize_ident(name.0.as_str()).as_str(), args_count) {
|
|
Ok(Func::Agg(f)) => aggs.push(Aggregate {
|
|
func: f,
|
|
args: args.clone().unwrap_or_default(),
|
|
original_expr: expr.clone(),
|
|
}),
|
|
_ => {
|
|
if let Some(args) = args {
|
|
for arg in args.iter() {
|
|
resolve_aggregates(arg, aggs);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
ast::Expr::FunctionCallStar { name, .. } => {
|
|
if let Ok(Func::Agg(f)) =
|
|
Func::resolve_function(normalize_ident(name.0.as_str()).as_str(), 0)
|
|
{
|
|
aggs.push(Aggregate {
|
|
func: f,
|
|
args: vec![],
|
|
original_expr: expr.clone(),
|
|
})
|
|
}
|
|
}
|
|
ast::Expr::Binary(lhs, _, rhs) => {
|
|
resolve_aggregates(lhs, aggs);
|
|
resolve_aggregates(rhs, aggs);
|
|
}
|
|
_ => {}
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::extra_unused_lifetimes)]
|
|
pub fn prepare_select_plan<'a>(schema: &Schema, select: ast::Select) -> Result<Plan> {
|
|
match select.body.select {
|
|
ast::OneSelect::Select {
|
|
columns,
|
|
from,
|
|
where_clause,
|
|
group_by,
|
|
..
|
|
} => {
|
|
let col_count = columns.len();
|
|
if col_count == 0 {
|
|
crate::bail_parse_error!("SELECT without columns is not allowed");
|
|
}
|
|
|
|
let mut operator_id_counter = OperatorIdCounter::new();
|
|
|
|
// Parse the FROM clause
|
|
let (mut operator, referenced_tables) =
|
|
parse_from(schema, from, &mut operator_id_counter)?;
|
|
|
|
// Parse the WHERE clause
|
|
if let Some(w) = where_clause {
|
|
let mut predicates = vec![];
|
|
break_predicate_at_and_boundaries(w, &mut predicates);
|
|
operator = Operator::Filter {
|
|
source: Box::new(operator),
|
|
predicates,
|
|
id: operator_id_counter.get_next_id(),
|
|
};
|
|
}
|
|
|
|
// If there are aggregate functions, we aggregate + project the columns.
|
|
// If there are no aggregate functions, we can simply project the columns.
|
|
// For a simple SELECT *, the projection operator is skipped as well.
|
|
let is_select_star = col_count == 1 && matches!(columns[0], ast::ResultColumn::Star);
|
|
if !is_select_star {
|
|
let mut aggregate_expressions = Vec::new();
|
|
let mut projection_expressions = Vec::with_capacity(col_count);
|
|
for column in columns.clone() {
|
|
match column {
|
|
ast::ResultColumn::Star => {
|
|
projection_expressions.push(ProjectionColumn::Star);
|
|
}
|
|
ast::ResultColumn::TableStar(name) => {
|
|
let name_normalized = normalize_ident(name.0.as_str());
|
|
let referenced_table = referenced_tables
|
|
.iter()
|
|
.find(|t| t.table_identifier == name_normalized);
|
|
|
|
if referenced_table.is_none() {
|
|
crate::bail_parse_error!("Table {} not found", name.0);
|
|
}
|
|
let table_reference = referenced_table.unwrap();
|
|
projection_expressions
|
|
.push(ProjectionColumn::TableStar(table_reference.clone()));
|
|
}
|
|
ast::ResultColumn::Expr(expr, _) => {
|
|
projection_expressions.push(ProjectionColumn::Column(expr.clone()));
|
|
match expr.clone() {
|
|
ast::Expr::FunctionCall {
|
|
name,
|
|
distinctness: _,
|
|
args,
|
|
filter_over: _,
|
|
order_by: _,
|
|
} => {
|
|
let args_count = if let Some(args) = &args {
|
|
args.len()
|
|
} else {
|
|
0
|
|
};
|
|
match Func::resolve_function(
|
|
normalize_ident(name.0.as_str()).as_str(),
|
|
args_count,
|
|
) {
|
|
Ok(Func::Agg(f)) => {
|
|
aggregate_expressions.push(Aggregate {
|
|
func: f,
|
|
args: args.unwrap(),
|
|
original_expr: expr.clone(),
|
|
});
|
|
}
|
|
Ok(_) => {
|
|
resolve_aggregates(&expr, &mut aggregate_expressions);
|
|
}
|
|
_ => {}
|
|
}
|
|
}
|
|
ast::Expr::FunctionCallStar {
|
|
name,
|
|
filter_over: _,
|
|
} => {
|
|
if let Ok(Func::Agg(f)) = Func::resolve_function(
|
|
normalize_ident(name.0.as_str()).as_str(),
|
|
0,
|
|
) {
|
|
aggregate_expressions.push(Aggregate {
|
|
func: f,
|
|
args: vec![ast::Expr::Literal(ast::Literal::Numeric(
|
|
"1".to_string(),
|
|
))],
|
|
original_expr: expr.clone(),
|
|
});
|
|
}
|
|
}
|
|
ast::Expr::Binary(lhs, _, rhs) => {
|
|
resolve_aggregates(&lhs, &mut aggregate_expressions);
|
|
resolve_aggregates(&rhs, &mut aggregate_expressions);
|
|
}
|
|
_ => {}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if let Some(_group_by) = group_by.as_ref() {
|
|
if aggregate_expressions.is_empty() {
|
|
crate::bail_parse_error!(
|
|
"GROUP BY clause without aggregate functions is not allowed"
|
|
);
|
|
}
|
|
for scalar in projection_expressions.iter() {
|
|
match scalar {
|
|
ProjectionColumn::Column(_) => {}
|
|
_ => {
|
|
crate::bail_parse_error!(
|
|
"Only column references are allowed in the SELECT clause when using GROUP BY"
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if !aggregate_expressions.is_empty() {
|
|
operator = Operator::Aggregate {
|
|
source: Box::new(operator),
|
|
aggregates: aggregate_expressions,
|
|
group_by: group_by.map(|g| g.exprs), // TODO: support HAVING
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
}
|
|
}
|
|
|
|
if !projection_expressions.is_empty() {
|
|
operator = Operator::Projection {
|
|
source: Box::new(operator),
|
|
expressions: projection_expressions,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
};
|
|
}
|
|
}
|
|
|
|
// Parse the ORDER BY clause
|
|
if let Some(order_by) = select.order_by {
|
|
let mut key = Vec::new();
|
|
|
|
for o in order_by {
|
|
// if the ORDER BY expression is a number, interpret it as an 1-indexed column number
|
|
// otherwise, interpret it normally as an expression
|
|
let expr = if let ast::Expr::Literal(ast::Literal::Numeric(num)) = &o.expr {
|
|
let column_number = num.parse::<usize>()?;
|
|
if column_number == 0 {
|
|
crate::bail_parse_error!("invalid column index: {}", column_number);
|
|
}
|
|
let maybe_result_column = columns.get(column_number - 1);
|
|
match maybe_result_column {
|
|
Some(ResultColumn::Expr(e, _)) => e.clone(),
|
|
None => {
|
|
crate::bail_parse_error!("invalid column index: {}", column_number)
|
|
}
|
|
_ => todo!(),
|
|
}
|
|
} else {
|
|
o.expr
|
|
};
|
|
|
|
key.push((
|
|
expr,
|
|
o.order.map_or(Direction::Ascending, |o| match o {
|
|
ast::SortOrder::Asc => Direction::Ascending,
|
|
ast::SortOrder::Desc => Direction::Descending,
|
|
}),
|
|
));
|
|
}
|
|
operator = Operator::Order {
|
|
source: Box::new(operator),
|
|
key,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
};
|
|
}
|
|
|
|
// Parse the LIMIT clause
|
|
if let Some(limit) = &select.limit {
|
|
operator = match &limit.expr {
|
|
ast::Expr::Literal(ast::Literal::Numeric(n)) => {
|
|
let l = n.parse()?;
|
|
if l == 0 {
|
|
Operator::Nothing
|
|
} else {
|
|
Operator::Limit {
|
|
source: Box::new(operator),
|
|
limit: l,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
}
|
|
}
|
|
}
|
|
_ => todo!(),
|
|
}
|
|
}
|
|
|
|
// Return the unoptimized query plan
|
|
Ok(Plan {
|
|
root_operator: operator,
|
|
referenced_tables,
|
|
available_indexes: schema.indexes.clone().into_values().flatten().collect(),
|
|
})
|
|
}
|
|
_ => todo!(),
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::type_complexity)]
|
|
fn parse_from(
|
|
schema: &Schema,
|
|
from: Option<FromClause>,
|
|
operator_id_counter: &mut OperatorIdCounter,
|
|
) -> Result<(Operator, Vec<BTreeTableReference>)> {
|
|
if from.as_ref().and_then(|f| f.select.as_ref()).is_none() {
|
|
return Ok((Operator::Nothing, vec![]));
|
|
}
|
|
|
|
let from = from.unwrap();
|
|
|
|
let first_table = match *from.select.unwrap() {
|
|
ast::SelectTable::Table(qualified_name, maybe_alias, _) => {
|
|
let Some(table) = schema.get_table(&qualified_name.name.0) else {
|
|
crate::bail_parse_error!("Table {} not found", qualified_name.name.0);
|
|
};
|
|
let alias = maybe_alias
|
|
.map(|a| match a {
|
|
ast::As::As(id) => id,
|
|
ast::As::Elided(id) => id,
|
|
})
|
|
.map(|a| a.0);
|
|
|
|
BTreeTableReference {
|
|
table: table.clone(),
|
|
table_identifier: alias.unwrap_or(qualified_name.name.0),
|
|
}
|
|
}
|
|
_ => todo!(),
|
|
};
|
|
|
|
let mut operator = Operator::Scan {
|
|
table_reference: first_table.clone(),
|
|
predicates: None,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
};
|
|
|
|
let mut tables = vec![first_table];
|
|
|
|
for join in from.joins.unwrap_or_default().into_iter() {
|
|
let (right, outer, predicates) =
|
|
parse_join(schema, join, operator_id_counter, &mut tables)?;
|
|
operator = Operator::Join {
|
|
left: Box::new(operator),
|
|
right: Box::new(right),
|
|
predicates,
|
|
outer,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
}
|
|
}
|
|
|
|
Ok((operator, tables))
|
|
}
|
|
|
|
fn parse_join(
|
|
schema: &Schema,
|
|
join: ast::JoinedSelectTable,
|
|
operator_id_counter: &mut OperatorIdCounter,
|
|
tables: &mut Vec<BTreeTableReference>,
|
|
) -> Result<(Operator, bool, Option<Vec<ast::Expr>>)> {
|
|
let ast::JoinedSelectTable {
|
|
operator,
|
|
table,
|
|
constraint,
|
|
} = join;
|
|
|
|
let table = match table {
|
|
ast::SelectTable::Table(qualified_name, maybe_alias, _) => {
|
|
let Some(table) = schema.get_table(&qualified_name.name.0) else {
|
|
crate::bail_parse_error!("Table {} not found", qualified_name.name.0);
|
|
};
|
|
let alias = maybe_alias
|
|
.map(|a| match a {
|
|
ast::As::As(id) => id,
|
|
ast::As::Elided(id) => id,
|
|
})
|
|
.map(|a| a.0);
|
|
BTreeTableReference {
|
|
table: table.clone(),
|
|
table_identifier: alias.unwrap_or(qualified_name.name.0),
|
|
}
|
|
}
|
|
_ => todo!(),
|
|
};
|
|
|
|
tables.push(table.clone());
|
|
|
|
let outer = match operator {
|
|
ast::JoinOperator::TypedJoin(Some(join_type)) => {
|
|
if join_type == JoinType::LEFT | JoinType::OUTER {
|
|
true
|
|
} else {
|
|
join_type == JoinType::RIGHT | JoinType::OUTER
|
|
}
|
|
}
|
|
_ => false,
|
|
};
|
|
|
|
let predicates = constraint.map(|c| match c {
|
|
ast::JoinConstraint::On(expr) => {
|
|
let mut predicates = vec![];
|
|
break_predicate_at_and_boundaries(expr, &mut predicates);
|
|
predicates
|
|
}
|
|
ast::JoinConstraint::Using(_) => todo!("USING joins not supported yet"),
|
|
});
|
|
|
|
Ok((
|
|
Operator::Scan {
|
|
table_reference: table.clone(),
|
|
predicates: None,
|
|
id: operator_id_counter.get_next_id(),
|
|
step: 0,
|
|
},
|
|
outer,
|
|
predicates,
|
|
))
|
|
}
|
|
|
|
fn break_predicate_at_and_boundaries(predicate: ast::Expr, out_predicates: &mut Vec<ast::Expr>) {
|
|
match predicate {
|
|
ast::Expr::Binary(left, ast::Operator::And, right) => {
|
|
break_predicate_at_and_boundaries(*left, out_predicates);
|
|
break_predicate_at_and_boundaries(*right, out_predicates);
|
|
}
|
|
_ => {
|
|
out_predicates.push(predicate);
|
|
}
|
|
}
|
|
}
|