1use std::collections::{BTreeMap, BTreeSet};
16use std::fmt;
17
18use hawdb_sql_syntax::{
19 BinaryOperatorSyntax, ExpressionKindSyntax, ExpressionSyntax, GraphElementPatternSyntax,
20 GraphPathPrimarySyntax, GraphPathSyntax, GraphTable, Identifier, LiteralSyntax,
21 PostgresFromItemSyntax, PostgresSelectSyntax, QualifiedName, Span, TableAlias,
22};
23
24use super::{
25 BoundPgqColumn, BoundPgqExpression, BoundPgqExpressionKind, BoundPgqGraphPattern,
26 BoundPgqGraphTable, BoundPgqLiteral, BoundPgqPath, BoundPgqPathFactor, BoundPgqPathPrimary,
27 BoundPgqVariable, PgqBindingContext, PgqCatalog, PgqDataType, PgqElementKind, PgqSlotId,
28 PropertyGraphElementSchema, PropertyGraphSchema,
29};
30
31#[derive(Debug, Clone, Copy, PartialEq, Eq)]
32pub enum PgqBindErrorCode {
33 UnknownGraph,
34 UnknownLabel,
35 DuplicateVariable,
36 ConflictingVariable,
37 InvalidPath,
38 UnknownReference,
39 UnknownProperty,
40 MissingColumnName,
41 DuplicateColumn,
42 ColumnAliasCountMismatch,
43 UnsupportedExpression,
44 InvalidLiteral,
45 TypeMismatch,
46}
47
48#[derive(Debug, Clone, PartialEq, Eq)]
49pub struct PgqBindError {
50 pub code: PgqBindErrorCode,
51 pub span: Span,
52 pub message: String,
53}
54
55impl PgqBindError {
56 fn new(code: PgqBindErrorCode, span: Span, message: impl Into<String>) -> Self {
57 Self {
58 code,
59 span,
60 message: message.into(),
61 }
62 }
63}
64
65impl fmt::Display for PgqBindError {
66 fn fmt(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
67 write!(
68 formatter,
69 "SQL/PGQ binding error {:?} at bytes {}..{}: {}",
70 self.code, self.span.start, self.span.end, self.message
71 )
72 }
73}
74
75impl std::error::Error for PgqBindError {}
76
77pub fn bind_postgres_graph_tables(
78 input: &str,
79 select: &PostgresSelectSyntax,
80 catalog: &dyn PgqCatalog,
81 context: &PgqBindingContext,
82) -> Result<Vec<BoundPgqGraphTable>, PgqBindError> {
83 let mut bound = Vec::new();
84 for source in &select.from {
85 bind_from_item(input, &source.relation, catalog, context, &mut bound)?;
86 for join in &source.joins {
87 bind_from_item(input, &join.relation, catalog, context, &mut bound)?;
88 }
89 }
90 Ok(bound)
91}
92
93fn bind_from_item(
94 input: &str,
95 item: &PostgresFromItemSyntax,
96 catalog: &dyn PgqCatalog,
97 context: &PgqBindingContext,
98 bound: &mut Vec<BoundPgqGraphTable>,
99) -> Result<(), PgqBindError> {
100 let PostgresFromItemSyntax::GraphTable(table) = item else {
101 return Ok(());
102 };
103 let graph_name = normalize_qualified_name(input, &table.graph);
104 let graph = catalog.property_graph(&graph_name).ok_or_else(|| {
105 PgqBindError::new(
106 PgqBindErrorCode::UnknownGraph,
107 table.graph.span,
108 format!("property graph {} does not exist", graph_name.join(".")),
109 )
110 })?;
111 bound.push(GraphTableBinder::new(input, graph, context).bind(table, graph_name)?);
112 Ok(())
113}
114
115struct GraphTableBinder<'a> {
116 input: &'a str,
117 graph: &'a PropertyGraphSchema,
118 context: &'a PgqBindingContext,
119 variables: Vec<BoundPgqVariable>,
120 named_slots: BTreeMap<String, PgqSlotId>,
121 slots_by_span: BTreeMap<(usize, usize), PgqSlotId>,
122}
123
124impl<'a> GraphTableBinder<'a> {
125 fn new(input: &'a str, graph: &'a PropertyGraphSchema, context: &'a PgqBindingContext) -> Self {
126 Self {
127 input,
128 graph,
129 context,
130 variables: Vec::new(),
131 named_slots: BTreeMap::new(),
132 slots_by_span: BTreeMap::new(),
133 }
134 }
135
136 fn bind(
137 mut self,
138 table: &GraphTable,
139 graph_name: Vec<String>,
140 ) -> Result<BoundPgqGraphTable, PgqBindError> {
141 if table.pattern.paths.len() != 1 {
142 return Err(PgqBindError::new(
143 PgqBindErrorCode::InvalidPath,
144 table.pattern.span,
145 "the qualified GRAPH_TABLE slice requires exactly one graph path",
146 ));
147 }
148 for path in &table.pattern.paths {
149 self.validate_path_shape(path)?;
150 self.register_path(path)?;
151 }
152
153 let paths = table
154 .pattern
155 .paths
156 .iter()
157 .map(|path| self.bind_path(path))
158 .collect::<Result<Vec<_>, _>>()?;
159 let predicate = table
160 .pattern
161 .predicate
162 .as_ref()
163 .map(|predicate| self.bind_predicate(predicate))
164 .transpose()?;
165 let mut columns = self.bind_columns(&table.columns)?;
166 if let Some(alias) = &table.alias {
167 self.apply_table_column_aliases(alias, &mut columns)?;
168 }
169 let alias = table
170 .alias
171 .as_ref()
172 .map(|alias| normalize_table_alias(self.input, alias));
173
174 Ok(BoundPgqGraphTable {
175 graph_name,
176 variables: self.variables,
177 pattern: BoundPgqGraphPattern { paths, predicate },
178 columns,
179 alias,
180 span: table.span,
181 })
182 }
183
184 fn validate_path_shape(&self, path: &GraphPathSyntax) -> Result<(), PgqBindError> {
185 if path.factors.len() == 1
186 && matches!(
187 path.factors[0].primary,
188 GraphPathPrimarySyntax::Parenthesized { .. }
189 )
190 {
191 return Ok(());
192 }
193 let mut expect_vertex = true;
194 for factor in &path.factors {
195 let is_vertex = matches!(factor.primary, GraphPathPrimarySyntax::Vertex(_));
196 let is_edge = matches!(factor.primary, GraphPathPrimarySyntax::Edge(_));
197 if !is_vertex && !is_edge {
198 return Err(PgqBindError::new(
199 PgqBindErrorCode::InvalidPath,
200 factor.span,
201 "a parenthesized path must be a standalone path factor in this slice",
202 ));
203 }
204 if is_vertex != expect_vertex {
205 return Err(PgqBindError::new(
206 PgqBindErrorCode::InvalidPath,
207 factor.span,
208 "graph paths must alternate vertex and edge patterns and end at a vertex",
209 ));
210 }
211 if factor.quantifier.is_some() && is_vertex {
212 return Err(PgqBindError::new(
213 PgqBindErrorCode::InvalidPath,
214 factor.span,
215 "vertex pattern quantifiers are not supported",
216 ));
217 }
218 if let Some(quantifier) = &factor.quantifier
219 && quantifier.min > quantifier.max
220 {
221 return Err(PgqBindError::new(
222 PgqBindErrorCode::InvalidPath,
223 quantifier.span,
224 "graph quantifier lower bound exceeds upper bound",
225 ));
226 }
227 expect_vertex = !expect_vertex;
228 }
229 if expect_vertex {
230 return Err(PgqBindError::new(
231 PgqBindErrorCode::InvalidPath,
232 path.span,
233 "graph paths must end at a vertex pattern",
234 ));
235 }
236 Ok(())
237 }
238
239 fn register_path(&mut self, path: &GraphPathSyntax) -> Result<(), PgqBindError> {
240 for factor in &path.factors {
241 match &factor.primary {
242 GraphPathPrimarySyntax::Vertex(vertex) => {
243 self.register_element(vertex, PgqElementKind::Vertex)?;
244 }
245 GraphPathPrimarySyntax::Edge(edge) => {
246 self.register_element_fields(
247 edge.variable.as_ref(),
248 &edge.labels,
249 PgqElementKind::Edge,
250 edge.span,
251 )?;
252 }
253 GraphPathPrimarySyntax::Parenthesized { path, .. } => {
254 self.validate_path_shape(path)?;
255 self.register_path(path)?;
256 }
257 }
258 }
259 Ok(())
260 }
261
262 fn register_element(
263 &mut self,
264 element: &GraphElementPatternSyntax,
265 kind: PgqElementKind,
266 ) -> Result<PgqSlotId, PgqBindError> {
267 self.register_element_fields(
268 element.variable.as_ref(),
269 &element.labels,
270 kind,
271 element.span,
272 )
273 }
274
275 fn register_element_fields(
276 &mut self,
277 variable: Option<&Identifier>,
278 labels: &[Identifier],
279 kind: PgqElementKind,
280 span: Span,
281 ) -> Result<PgqSlotId, PgqBindError> {
282 let labels = labels
283 .iter()
284 .map(|label| normalize_identifier(self.input, label))
285 .collect::<Vec<_>>();
286 self.validate_labels(kind, &labels, span)?;
287 let name = variable.map(|variable| normalize_identifier(self.input, variable));
288 let slot = if let Some(name) = &name {
289 if let Some(slot) = self.named_slots.get(name).copied() {
290 let existing = &mut self.variables[slot.0 as usize];
291 if existing.kind != kind {
292 return Err(PgqBindError::new(
293 PgqBindErrorCode::ConflictingVariable,
294 span,
295 format!("graph variable {name} is used as both vertex and edge"),
296 ));
297 }
298 if !labels.is_empty() {
299 if existing.labels.is_empty() {
300 existing.labels.clone_from(&labels);
301 } else if existing.labels != labels {
302 return Err(PgqBindError::new(
303 PgqBindErrorCode::ConflictingVariable,
304 span,
305 format!("graph variable {name} has conflicting label predicates"),
306 ));
307 }
308 }
309 slot
310 } else {
311 let slot = self.next_slot(span)?;
312 self.named_slots.insert(name.clone(), slot);
313 self.variables.push(BoundPgqVariable {
314 slot,
315 name: Some(name.clone()),
316 kind,
317 labels,
318 span,
319 });
320 slot
321 }
322 } else {
323 let slot = self.next_slot(span)?;
324 self.variables.push(BoundPgqVariable {
325 slot,
326 name: None,
327 kind,
328 labels,
329 span,
330 });
331 slot
332 };
333 self.slots_by_span.insert((span.start, span.end), slot);
334 Ok(slot)
335 }
336
337 fn next_slot(&self, span: Span) -> Result<PgqSlotId, PgqBindError> {
338 u32::try_from(self.variables.len())
339 .map(PgqSlotId)
340 .map_err(|_| {
341 PgqBindError::new(
342 PgqBindErrorCode::DuplicateVariable,
343 span,
344 "too many graph variables",
345 )
346 })
347 }
348
349 fn validate_labels(
350 &self,
351 kind: PgqElementKind,
352 labels: &[String],
353 span: Span,
354 ) -> Result<(), PgqBindError> {
355 let schemas = self.element_schemas(kind);
356 for label in labels {
357 if !schemas.contains_key(label) {
358 return Err(PgqBindError::new(
359 PgqBindErrorCode::UnknownLabel,
360 span,
361 format!("unknown {} label {label}", element_kind_name(kind)),
362 ));
363 }
364 }
365 Ok(())
366 }
367
368 fn bind_path(&self, path: &GraphPathSyntax) -> Result<BoundPgqPath, PgqBindError> {
369 let factors = path
370 .factors
371 .iter()
372 .map(|factor| {
373 let primary = match &factor.primary {
374 GraphPathPrimarySyntax::Vertex(vertex) => BoundPgqPathPrimary::Vertex {
375 slot: self.slot_for_span(vertex.span)?,
376 predicate: vertex
377 .predicate
378 .as_ref()
379 .map(|predicate| self.bind_predicate(predicate))
380 .transpose()?,
381 },
382 GraphPathPrimarySyntax::Edge(edge) => BoundPgqPathPrimary::Edge {
383 slot: self.slot_for_span(edge.span)?,
384 direction: edge.direction,
385 predicate: edge
386 .predicate
387 .as_ref()
388 .map(|predicate| self.bind_predicate(predicate))
389 .transpose()?,
390 },
391 GraphPathPrimarySyntax::Parenthesized {
392 path, predicate, ..
393 } => BoundPgqPathPrimary::Parenthesized {
394 path: Box::new(self.bind_path(path)?),
395 predicate: predicate
396 .as_ref()
397 .map(|predicate| self.bind_predicate(predicate))
398 .transpose()?,
399 },
400 };
401 Ok(BoundPgqPathFactor {
402 primary,
403 quantifier: factor.quantifier.clone(),
404 })
405 })
406 .collect::<Result<Vec<_>, PgqBindError>>()?;
407 Ok(BoundPgqPath { factors })
408 }
409
410 fn slot_for_span(&self, span: Span) -> Result<PgqSlotId, PgqBindError> {
411 self.slots_by_span
412 .get(&(span.start, span.end))
413 .copied()
414 .ok_or_else(|| {
415 PgqBindError::new(
416 PgqBindErrorCode::UnknownReference,
417 span,
418 "graph element has no registered slot",
419 )
420 })
421 }
422
423 fn bind_columns(
424 &self,
425 columns: &[hawdb_sql_syntax::GraphTableColumn],
426 ) -> Result<Vec<BoundPgqColumn>, PgqBindError> {
427 let mut names = BTreeSet::new();
428 columns
429 .iter()
430 .map(|column| {
431 let expression = self.bind_expression(&column.expression)?;
432 let name = if let Some(alias) = &column.alias {
433 normalize_identifier(self.input, alias)
434 } else {
435 derive_column_name(self.input, &column.expression).ok_or_else(|| {
436 PgqBindError::new(
437 PgqBindErrorCode::MissingColumnName,
438 column.span,
439 "complex GRAPH_TABLE output expressions require an explicit alias",
440 )
441 })?
442 };
443 if !names.insert(name.clone()) {
444 return Err(PgqBindError::new(
445 PgqBindErrorCode::DuplicateColumn,
446 column.span,
447 format!("duplicate GRAPH_TABLE output column {name}"),
448 ));
449 }
450 Ok(BoundPgqColumn {
451 name,
452 data_type: expression.data_type,
453 expression,
454 })
455 })
456 .collect()
457 }
458
459 fn apply_table_column_aliases(
460 &self,
461 alias: &TableAlias,
462 columns: &mut [BoundPgqColumn],
463 ) -> Result<(), PgqBindError> {
464 if alias.columns.len() > columns.len() {
465 return Err(PgqBindError::new(
466 PgqBindErrorCode::ColumnAliasCountMismatch,
467 alias.span,
468 "GRAPH_TABLE alias has more column names than its output schema",
469 ));
470 }
471 for (column, alias) in columns.iter_mut().zip(&alias.columns) {
472 column.name = normalize_identifier(self.input, alias);
473 }
474 let mut names = BTreeSet::new();
475 for column in columns {
476 if !names.insert(column.name.clone()) {
477 return Err(PgqBindError::new(
478 PgqBindErrorCode::DuplicateColumn,
479 alias.span,
480 format!("duplicate GRAPH_TABLE output column {}", column.name),
481 ));
482 }
483 }
484 Ok(())
485 }
486
487 fn bind_predicate(
488 &self,
489 expression: &ExpressionSyntax,
490 ) -> Result<BoundPgqExpression, PgqBindError> {
491 let bound = self.bind_expression(expression)?;
492 if !matches!(bound.data_type, PgqDataType::Boolean | PgqDataType::Unknown) {
493 return Err(PgqBindError::new(
494 PgqBindErrorCode::TypeMismatch,
495 expression.span,
496 "graph predicates must have boolean type",
497 ));
498 }
499 Ok(bound)
500 }
501
502 fn bind_expression(
503 &self,
504 expression: &ExpressionSyntax,
505 ) -> Result<BoundPgqExpression, PgqBindError> {
506 let (kind, data_type) = match &expression.kind {
507 ExpressionKindSyntax::Column(name) => self.bind_column_reference(name)?,
508 ExpressionKindSyntax::Wildcard(_) => {
509 return Err(PgqBindError::new(
510 PgqBindErrorCode::UnsupportedExpression,
511 expression.span,
512 "wildcards are not scalar GRAPH_TABLE expressions",
513 ));
514 }
515 ExpressionKindSyntax::Parameter(position) => (
516 BoundPgqExpressionKind::Parameter(*position),
517 PgqDataType::Unknown,
518 ),
519 ExpressionKindSyntax::Literal(literal) => {
520 let (literal, data_type) = bind_literal(self.input, literal)?;
521 (BoundPgqExpressionKind::Literal(literal), data_type)
522 }
523 ExpressionKindSyntax::TypedString { data_type, value } => {
524 let data_type_name = normalize_identifier(self.input, data_type);
525 let value = decode_string(self.input, *value).ok_or_else(|| {
526 PgqBindError::new(
527 PgqBindErrorCode::InvalidLiteral,
528 *value,
529 "invalid PostgreSQL string literal",
530 )
531 })?;
532 (
533 BoundPgqExpressionKind::Literal(BoundPgqLiteral::TypedString {
534 data_type: data_type_name,
535 value,
536 }),
537 PgqDataType::String,
538 )
539 }
540 ExpressionKindSyntax::Unary {
541 operator,
542 expression: inner,
543 } => {
544 let inner = self.bind_expression(inner)?;
545 let data_type = match operator {
546 hawdb_sql_syntax::UnaryOperatorSyntax::Not => {
547 require_boolean(inner.data_type, expression.span)?;
548 PgqDataType::Boolean
549 }
550 hawdb_sql_syntax::UnaryOperatorSyntax::Plus
551 | hawdb_sql_syntax::UnaryOperatorSyntax::Minus => {
552 require_numeric(inner.data_type, expression.span)?;
553 inner.data_type
554 }
555 };
556 (
557 BoundPgqExpressionKind::Unary {
558 operator: *operator,
559 expression: Box::new(inner),
560 },
561 data_type,
562 )
563 }
564 ExpressionKindSyntax::Binary {
565 left,
566 operator,
567 right,
568 } => {
569 let left = self.bind_expression(left)?;
570 let right = self.bind_expression(right)?;
571 validate_binary_operands(
572 *operator,
573 left.data_type,
574 right.data_type,
575 expression.span,
576 )?;
577 let data_type = binary_result_type(*operator, left.data_type, right.data_type);
578 (
579 BoundPgqExpressionKind::Binary {
580 left: Box::new(left),
581 operator: *operator,
582 right: Box::new(right),
583 },
584 data_type,
585 )
586 }
587 ExpressionKindSyntax::IsNull {
588 expression: inner,
589 negated,
590 } => (
591 BoundPgqExpressionKind::IsNull {
592 expression: Box::new(self.bind_expression(inner)?),
593 negated: *negated,
594 },
595 PgqDataType::Boolean,
596 ),
597 ExpressionKindSyntax::InList {
598 expression: inner,
599 values,
600 negated,
601 } => {
602 let inner = self.bind_expression(inner)?;
603 let values = values
604 .iter()
605 .map(|value| self.bind_expression(value))
606 .collect::<Result<Vec<_>, _>>()?;
607 for value in &values {
608 require_comparable(inner.data_type, value.data_type, expression.span)?;
609 }
610 (
611 BoundPgqExpressionKind::InList {
612 expression: Box::new(inner),
613 values,
614 negated: *negated,
615 },
616 PgqDataType::Boolean,
617 )
618 }
619 ExpressionKindSyntax::Between {
620 expression: inner,
621 low,
622 high,
623 negated,
624 } => {
625 let inner = self.bind_expression(inner)?;
626 let low = self.bind_expression(low)?;
627 let high = self.bind_expression(high)?;
628 require_comparable(inner.data_type, low.data_type, expression.span)?;
629 require_comparable(inner.data_type, high.data_type, expression.span)?;
630 (
631 BoundPgqExpressionKind::Between {
632 expression: Box::new(inner),
633 low: Box::new(low),
634 high: Box::new(high),
635 negated: *negated,
636 },
637 PgqDataType::Boolean,
638 )
639 }
640 ExpressionKindSyntax::Function {
641 name,
642 arguments,
643 distinct,
644 } => {
645 let name = normalize_qualified_name(self.input, name);
646 let function = name.last().map(String::as_str).unwrap_or_default();
647 if is_disallowed_graph_table_function(function) {
648 return Err(PgqBindError::new(
649 PgqBindErrorCode::UnsupportedExpression,
650 expression.span,
651 format!("function {function} is not allowed in GRAPH_TABLE expressions"),
652 ));
653 }
654 let arguments = arguments
655 .iter()
656 .map(|argument| self.bind_expression(argument))
657 .collect::<Result<Vec<_>, _>>()?;
658 let data_type = function_result_type(function, &arguments);
659 (
660 BoundPgqExpressionKind::Function {
661 name,
662 arguments,
663 distinct: *distinct,
664 },
665 data_type,
666 )
667 }
668 ExpressionKindSyntax::Cast {
669 expression: inner,
670 data_type,
671 } => {
672 let inner = self.bind_expression(inner)?;
673 let data_type_name = normalize_qualified_name(self.input, data_type);
674 let result_type = cast_result_type(&data_type_name);
675 (
676 BoundPgqExpressionKind::Cast {
677 expression: Box::new(inner),
678 data_type: data_type_name,
679 },
680 result_type,
681 )
682 }
683 ExpressionKindSyntax::Collate {
684 expression: inner,
685 collation,
686 } => {
687 let inner = self.bind_expression(inner)?;
688 require_string(inner.data_type, expression.span)?;
689 let data_type = inner.data_type;
690 (
691 BoundPgqExpressionKind::Collate {
692 expression: Box::new(inner),
693 collation: normalize_qualified_name(self.input, collation),
694 },
695 data_type,
696 )
697 }
698 ExpressionKindSyntax::Parenthesized(inner) => {
699 let inner = self.bind_expression(inner)?;
700 return Ok(BoundPgqExpression {
701 span: expression.span,
702 ..inner
703 });
704 }
705 };
706 Ok(BoundPgqExpression {
707 kind,
708 data_type,
709 span: expression.span,
710 })
711 }
712
713 fn bind_column_reference(
714 &self,
715 name: &QualifiedName,
716 ) -> Result<(BoundPgqExpressionKind, PgqDataType), PgqBindError> {
717 let parts = normalize_qualified_name(self.input, name);
718 if let Some(variable) = parts
719 .first()
720 .and_then(|variable| self.named_slots.get(variable))
721 .and_then(|slot| self.variables.get(slot.0 as usize))
722 {
723 return match parts.as_slice() {
724 [_] => Ok((
725 BoundPgqExpressionKind::Variable(variable.slot),
726 PgqDataType::GraphElement(variable.kind),
727 )),
728 [_, property] => Ok((
729 BoundPgqExpressionKind::Property {
730 slot: variable.slot,
731 property: property.clone(),
732 },
733 self.property_type(variable, property, name.span)?,
734 )),
735 _ => Err(PgqBindError::new(
736 PgqBindErrorCode::UnsupportedExpression,
737 name.span,
738 "nested graph property paths are not supported",
739 )),
740 };
741 }
742 if let Some(data_type) = self.context.outer_columns.get(&parts).copied() {
743 return Ok((BoundPgqExpressionKind::OuterColumn(parts), data_type));
744 }
745 Err(PgqBindError::new(
746 PgqBindErrorCode::UnknownReference,
747 name.span,
748 format!(
749 "unknown GRAPH_TABLE expression reference {}",
750 parts.join(".")
751 ),
752 ))
753 }
754
755 fn property_type(
756 &self,
757 variable: &BoundPgqVariable,
758 property: &str,
759 span: Span,
760 ) -> Result<PgqDataType, PgqBindError> {
761 let schemas = self.element_schemas(variable.kind);
762 let candidates = if variable.labels.is_empty() {
763 schemas.values().collect::<Vec<_>>()
764 } else {
765 variable
766 .labels
767 .iter()
768 .filter_map(|label| schemas.get(label))
769 .collect::<Vec<_>>()
770 };
771 let mut types = candidates
772 .into_iter()
773 .filter_map(|schema| schema.properties.get(property).copied());
774 let Some(first) = types.next() else {
775 return Err(PgqBindError::new(
776 PgqBindErrorCode::UnknownProperty,
777 span,
778 format!("unknown property {property} for graph variable"),
779 ));
780 };
781 Ok(if types.all(|data_type| data_type == first) {
782 first
783 } else {
784 PgqDataType::Unknown
785 })
786 }
787
788 fn element_schemas(
789 &self,
790 kind: PgqElementKind,
791 ) -> &BTreeMap<String, PropertyGraphElementSchema> {
792 match kind {
793 PgqElementKind::Vertex => &self.graph.vertex_labels,
794 PgqElementKind::Edge => &self.graph.edge_labels,
795 }
796 }
797}
798
799fn normalize_table_alias(input: &str, alias: &TableAlias) -> String {
800 normalize_identifier(input, &alias.name)
801}
802
803fn normalize_qualified_name(input: &str, name: &QualifiedName) -> Vec<String> {
804 name.parts
805 .iter()
806 .map(|part| normalize_identifier(input, part))
807 .collect()
808}
809
810fn normalize_identifier(input: &str, identifier: &Identifier) -> String {
811 let text = &input[identifier.span.start..identifier.span.end];
812 if identifier.quoted {
813 text[1..text.len() - 1].replace("\"\"", "\"")
814 } else {
815 text.to_ascii_lowercase()
816 }
817}
818
819fn derive_column_name(input: &str, expression: &ExpressionSyntax) -> Option<String> {
820 let ExpressionKindSyntax::Column(name) = &expression.kind else {
821 return None;
822 };
823 name.parts
824 .last()
825 .map(|identifier| normalize_identifier(input, identifier))
826}
827
828fn bind_literal(
829 input: &str,
830 literal: &LiteralSyntax,
831) -> Result<(BoundPgqLiteral, PgqDataType), PgqBindError> {
832 match literal {
833 LiteralSyntax::Null => Ok((BoundPgqLiteral::Null, PgqDataType::Null)),
834 LiteralSyntax::Boolean(value) => {
835 Ok((BoundPgqLiteral::Boolean(*value), PgqDataType::Boolean))
836 }
837 LiteralSyntax::Number(span) => {
838 let text = &input[span.start..span.end];
839 if let Ok(value) = text.parse::<i64>() {
840 Ok((BoundPgqLiteral::Int64(value), PgqDataType::Int64))
841 } else if let Ok(value) = text.parse::<f64>() {
842 Ok((BoundPgqLiteral::Float64(value), PgqDataType::Float64))
843 } else {
844 Err(PgqBindError::new(
845 PgqBindErrorCode::InvalidLiteral,
846 *span,
847 "numeric literal is outside the supported range",
848 ))
849 }
850 }
851 LiteralSyntax::String(span) => decode_string(input, *span)
852 .map(|value| (BoundPgqLiteral::String(value), PgqDataType::String))
853 .ok_or_else(|| {
854 PgqBindError::new(
855 PgqBindErrorCode::InvalidLiteral,
856 *span,
857 "invalid PostgreSQL string literal",
858 )
859 }),
860 }
861}
862
863fn decode_string(input: &str, span: Span) -> Option<String> {
864 let text = input.get(span.start..span.end)?;
865 if text.starts_with('\'') && text.ends_with('\'') && text.len() >= 2 {
866 return Some(text[1..text.len() - 1].replace("''", "'"));
867 }
868 if let Some(without_prefix) = text.strip_prefix('$') {
869 let delimiter_end = without_prefix.find('$')? + 1;
870 let delimiter = &text[..=delimiter_end];
871 if text.ends_with(delimiter) && text.len() >= delimiter.len() * 2 {
872 return Some(text[delimiter.len()..text.len() - delimiter.len()].to_string());
873 }
874 }
875 None
876}
877
878fn binary_result_type(
879 operator: BinaryOperatorSyntax,
880 left: PgqDataType,
881 right: PgqDataType,
882) -> PgqDataType {
883 match operator {
884 BinaryOperatorSyntax::Or
885 | BinaryOperatorSyntax::And
886 | BinaryOperatorSyntax::Equal
887 | BinaryOperatorSyntax::NotEqual
888 | BinaryOperatorSyntax::Less
889 | BinaryOperatorSyntax::LessOrEqual
890 | BinaryOperatorSyntax::Greater
891 | BinaryOperatorSyntax::GreaterOrEqual => PgqDataType::Boolean,
892 BinaryOperatorSyntax::Concat => PgqDataType::String,
893 BinaryOperatorSyntax::Add
894 | BinaryOperatorSyntax::Subtract
895 | BinaryOperatorSyntax::Multiply
896 | BinaryOperatorSyntax::Divide
897 | BinaryOperatorSyntax::Modulo => numeric_common_type(left, right),
898 }
899}
900
901fn validate_binary_operands(
902 operator: BinaryOperatorSyntax,
903 left: PgqDataType,
904 right: PgqDataType,
905 span: Span,
906) -> Result<(), PgqBindError> {
907 match operator {
908 BinaryOperatorSyntax::Or | BinaryOperatorSyntax::And => {
909 require_boolean(left, span)?;
910 require_boolean(right, span)
911 }
912 BinaryOperatorSyntax::Concat => {
913 require_string(left, span)?;
914 require_string(right, span)
915 }
916 BinaryOperatorSyntax::Add
917 | BinaryOperatorSyntax::Subtract
918 | BinaryOperatorSyntax::Multiply
919 | BinaryOperatorSyntax::Divide
920 | BinaryOperatorSyntax::Modulo => {
921 require_numeric(left, span)?;
922 require_numeric(right, span)
923 }
924 BinaryOperatorSyntax::Equal
925 | BinaryOperatorSyntax::NotEqual
926 | BinaryOperatorSyntax::Less
927 | BinaryOperatorSyntax::LessOrEqual
928 | BinaryOperatorSyntax::Greater
929 | BinaryOperatorSyntax::GreaterOrEqual => require_comparable(left, right, span),
930 }
931}
932
933fn require_comparable(
934 left: PgqDataType,
935 right: PgqDataType,
936 span: Span,
937) -> Result<(), PgqBindError> {
938 if matches!(left, PgqDataType::Unknown | PgqDataType::Null)
939 || matches!(right, PgqDataType::Unknown | PgqDataType::Null)
940 || left == right
941 || matches!(
942 (left, right),
943 (PgqDataType::Int64, PgqDataType::Float64) | (PgqDataType::Float64, PgqDataType::Int64)
944 )
945 {
946 return Ok(());
947 }
948 Err(PgqBindError::new(
949 PgqBindErrorCode::TypeMismatch,
950 span,
951 format!("cannot compare {left:?} with {right:?}"),
952 ))
953}
954
955fn require_boolean(data_type: PgqDataType, span: Span) -> Result<(), PgqBindError> {
956 require_type(
957 data_type,
958 &[PgqDataType::Boolean],
959 span,
960 "boolean expression",
961 )
962}
963
964fn require_numeric(data_type: PgqDataType, span: Span) -> Result<(), PgqBindError> {
965 require_type(
966 data_type,
967 &[PgqDataType::Int64, PgqDataType::Float64],
968 span,
969 "numeric expression",
970 )
971}
972
973fn require_string(data_type: PgqDataType, span: Span) -> Result<(), PgqBindError> {
974 require_type(data_type, &[PgqDataType::String], span, "string expression")
975}
976
977fn require_type(
978 data_type: PgqDataType,
979 accepted: &[PgqDataType],
980 span: Span,
981 expected: &'static str,
982) -> Result<(), PgqBindError> {
983 if matches!(data_type, PgqDataType::Unknown | PgqDataType::Null)
984 || accepted.contains(&data_type)
985 {
986 return Ok(());
987 }
988 Err(PgqBindError::new(
989 PgqBindErrorCode::TypeMismatch,
990 span,
991 format!("expected {expected}, found {data_type:?}"),
992 ))
993}
994
995fn numeric_common_type(left: PgqDataType, right: PgqDataType) -> PgqDataType {
996 match (left, right) {
997 (PgqDataType::Float64, PgqDataType::Int64 | PgqDataType::Float64)
998 | (PgqDataType::Int64, PgqDataType::Float64) => PgqDataType::Float64,
999 (PgqDataType::Int64, PgqDataType::Int64) => PgqDataType::Int64,
1000 _ => PgqDataType::Unknown,
1001 }
1002}
1003
1004fn function_result_type(function: &str, arguments: &[BoundPgqExpression]) -> PgqDataType {
1005 if ["lower", "upper", "pg_typeof"]
1006 .into_iter()
1007 .any(|candidate| function.eq_ignore_ascii_case(candidate))
1008 {
1009 PgqDataType::String
1010 } else {
1011 arguments
1012 .first()
1013 .map_or(PgqDataType::Unknown, |argument| argument.data_type)
1014 }
1015}
1016
1017fn cast_result_type(name: &[String]) -> PgqDataType {
1018 match name.last().map(String::as_str) {
1019 Some("bool" | "boolean") => PgqDataType::Boolean,
1020 Some("bigint" | "int8" | "integer" | "int4") => PgqDataType::Int64,
1021 Some("float8" | "double" | "real" | "float4") => PgqDataType::Float64,
1022 Some("text" | "varchar" | "character") => PgqDataType::String,
1023 _ => PgqDataType::Unknown,
1024 }
1025}
1026
1027fn is_disallowed_graph_table_function(function: &str) -> bool {
1028 [
1029 "avg",
1030 "count",
1031 "generate_series",
1032 "max",
1033 "min",
1034 "row_number",
1035 "sum",
1036 ]
1037 .into_iter()
1038 .any(|candidate| function.eq_ignore_ascii_case(candidate))
1039}
1040
1041fn element_kind_name(kind: PgqElementKind) -> &'static str {
1042 match kind {
1043 PgqElementKind::Vertex => "vertex",
1044 PgqElementKind::Edge => "edge",
1045 }
1046}