analyzer.go 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332
  1. package analyzer
  2. import (
  3. "fmt"
  4. "strings"
  5. "github.com/danfragoso/pizzasql-next/pkg/lexer"
  6. "github.com/danfragoso/pizzasql-next/pkg/parser"
  7. )
  8. // ErrorType categorizes analysis errors.
  9. type ErrorType int
  10. const (
  11. ErrUnknown ErrorType = iota
  12. ErrTableNotFound
  13. ErrTableExists
  14. ErrColumnNotFound
  15. ErrColumnAmbiguous
  16. ErrTypeMismatch
  17. ErrInvalidFunction
  18. ErrInvalidArgCount
  19. ErrAggregateInWhere
  20. ErrNonAggregateInSelect
  21. ErrInvalidGroupBy
  22. )
  23. // AnalysisError represents a semantic analysis error.
  24. type AnalysisError struct {
  25. Type ErrorType
  26. Message string
  27. Line int
  28. Column int
  29. Context string
  30. }
  31. func (e *AnalysisError) Error() string {
  32. if e.Line > 0 {
  33. return fmt.Sprintf("analysis error at line %d, column %d: %s", e.Line, e.Column, e.Message)
  34. }
  35. return fmt.Sprintf("analysis error: %s", e.Message)
  36. }
  37. // Analyzer performs semantic analysis on parsed SQL statements.
  38. type Analyzer struct {
  39. catalog *Catalog
  40. scope *Scope
  41. errors []*AnalysisError
  42. }
  43. // New creates a new Analyzer with the given catalog.
  44. func New(catalog *Catalog) *Analyzer {
  45. if catalog == nil {
  46. catalog = NewCatalog()
  47. }
  48. return &Analyzer{
  49. catalog: catalog,
  50. }
  51. }
  52. // Analyze performs semantic analysis on a statement.
  53. func (a *Analyzer) Analyze(stmt parser.Statement) error {
  54. a.errors = nil
  55. a.scope = NewScope(nil)
  56. switch s := stmt.(type) {
  57. case *parser.SelectStmt:
  58. return a.analyzeSelect(s)
  59. case *parser.InsertStmt:
  60. return a.analyzeInsert(s)
  61. case *parser.UpdateStmt:
  62. return a.analyzeUpdate(s)
  63. case *parser.DeleteStmt:
  64. return a.analyzeDelete(s)
  65. case *parser.CreateTableStmt:
  66. return a.analyzeCreateTable(s)
  67. case *parser.DropTableStmt:
  68. return a.analyzeDropTable(s)
  69. case *parser.AlterTableStmt:
  70. // ALTER TABLE is handled directly by executor, no semantic analysis needed
  71. return nil
  72. case *parser.AttachStmt:
  73. // ATTACH DATABASE is handled directly by executor
  74. return nil
  75. case *parser.DetachStmt:
  76. // DETACH DATABASE is handled directly by executor
  77. return nil
  78. case *parser.BeginStmt, *parser.CommitStmt, *parser.RollbackStmt,
  79. *parser.SavepointStmt, *parser.ReleaseStmt:
  80. // Transaction statements don't need semantic analysis
  81. return nil
  82. case *parser.AnalyzeStmt:
  83. // ANALYZE is a documented no-op; nothing to validate.
  84. return nil
  85. case *parser.CreateIndexStmt, *parser.DropIndexStmt:
  86. // Index statements don't need semantic analysis
  87. return nil
  88. case *parser.ListenStmt, *parser.UnlistenStmt, *parser.NotifyStmt:
  89. // Channel names and payloads are validated by the parser; there is no
  90. // schema or expression to analyze.
  91. return nil
  92. default:
  93. return &AnalysisError{
  94. Type: ErrUnknown,
  95. Message: fmt.Sprintf("unknown statement type: %T", stmt),
  96. }
  97. }
  98. }
  99. // GetCatalog returns the analyzer's catalog.
  100. func (a *Analyzer) GetCatalog() *Catalog {
  101. return a.catalog
  102. }
  103. // analyzeSelect analyzes a SELECT statement.
  104. func (a *Analyzer) analyzeSelect(stmt *parser.SelectStmt) error {
  105. // Register CTE names before resolving FROM so both the main query and the
  106. // recursive legs can reference them.
  107. for _, cte := range stmt.With {
  108. a.scope.DefineTable(cteTableInfo(cte))
  109. }
  110. // First, resolve tables in FROM clause
  111. if err := a.resolveFromClause(stmt.From); err != nil {
  112. return err
  113. }
  114. // Analyze WHERE clause
  115. if stmt.Where != nil {
  116. info, err := a.analyzeExpr(stmt.Where)
  117. if err != nil {
  118. return err
  119. }
  120. // WHERE clause cannot contain aggregates
  121. if info.IsAggregate {
  122. return &AnalysisError{
  123. Type: ErrAggregateInWhere,
  124. Message: "aggregate functions not allowed in WHERE clause",
  125. }
  126. }
  127. }
  128. // Determine if this is an aggregate query
  129. hasAggregate := false
  130. hasGroupBy := len(stmt.GroupBy) > 0
  131. // Analyze SELECT columns and collect aliases for GROUP BY/ORDER BY/HAVING
  132. // reference. SELECT aliases are registered before GROUP BY so a query may
  133. // group by an output alias, matching SQLite.
  134. selectAliases := make(map[string]*ExprInfo)
  135. for _, col := range stmt.Columns {
  136. if col.Star {
  137. // SELECT * - all columns from all tables
  138. continue
  139. }
  140. if col.TableStar != "" {
  141. // Qualified wildcard (table.*) - validate the qualifier names a
  142. // table or alias in scope; expansion happens at execution time.
  143. if err := a.validateTableStar(col.TableStar); err != nil {
  144. return err
  145. }
  146. continue
  147. }
  148. info, err := a.analyzeExpr(col.Expr)
  149. if err != nil {
  150. return err
  151. }
  152. if info.IsAggregate {
  153. hasAggregate = true
  154. }
  155. // Track column aliases so ORDER BY and HAVING can reference them
  156. if col.Alias != "" {
  157. selectAliases[strings.ToUpper(col.Alias)] = info
  158. }
  159. }
  160. // Register SELECT aliases as virtual columns for GROUP BY/ORDER BY/HAVING
  161. // reference
  162. for alias, info := range selectAliases {
  163. a.scope.DefineSelectAlias(alias, info.Type)
  164. }
  165. // Analyze GROUP BY expressions after aliases are in scope
  166. for _, expr := range stmt.GroupBy {
  167. if _, err := a.analyzeExpr(expr); err != nil {
  168. return err
  169. }
  170. }
  171. // Validate GROUP BY semantics
  172. if hasAggregate && !hasGroupBy {
  173. // Aggregate query without GROUP BY - all non-aggregate columns must be constants
  174. for _, col := range stmt.Columns {
  175. if col.Star {
  176. return &AnalysisError{
  177. Type: ErrNonAggregateInSelect,
  178. Message: "SELECT * not allowed with aggregate functions without GROUP BY",
  179. }
  180. }
  181. if col.TableStar != "" {
  182. return &AnalysisError{
  183. Type: ErrNonAggregateInSelect,
  184. Message: fmt.Sprintf("SELECT %s.* not allowed with aggregate functions without GROUP BY", col.TableStar),
  185. }
  186. }
  187. info, exprErr := a.analyzeExpr(col.Expr)
  188. if exprErr != nil || info == nil {
  189. continue
  190. }
  191. if !info.IsAggregate && !info.IsConstant {
  192. // Check if it's a simple column reference
  193. if ref, ok := col.Expr.(*parser.ColumnRef); ok {
  194. return &AnalysisError{
  195. Type: ErrNonAggregateInSelect,
  196. Message: fmt.Sprintf("column %q must appear in GROUP BY clause or be in an aggregate function", ref.Column),
  197. }
  198. }
  199. }
  200. }
  201. }
  202. // Analyze HAVING clause
  203. if stmt.Having != nil {
  204. info, err := a.analyzeExpr(stmt.Having)
  205. if err != nil {
  206. return err
  207. }
  208. // HAVING without GROUP BY requires aggregates
  209. if !hasGroupBy && !info.IsAggregate {
  210. return &AnalysisError{
  211. Type: ErrInvalidGroupBy,
  212. Message: "HAVING clause requires GROUP BY or aggregate function",
  213. }
  214. }
  215. }
  216. // Analyze ORDER BY
  217. for _, item := range stmt.OrderBy {
  218. if _, err := a.analyzeExpr(item.Expr); err != nil {
  219. return err
  220. }
  221. }
  222. // Analyze LIMIT/OFFSET
  223. if stmt.Limit != nil {
  224. info, err := a.analyzeExpr(stmt.Limit)
  225. if err != nil {
  226. return err
  227. }
  228. if !info.Type.IsNumeric() && info.Type != TypeNull {
  229. return &AnalysisError{
  230. Type: ErrTypeMismatch,
  231. Message: "LIMIT must be numeric",
  232. }
  233. }
  234. }
  235. if stmt.Offset != nil {
  236. info, err := a.analyzeExpr(stmt.Offset)
  237. if err != nil {
  238. return err
  239. }
  240. if !info.Type.IsNumeric() && info.Type != TypeNull {
  241. return &AnalysisError{
  242. Type: ErrTypeMismatch,
  243. Message: "OFFSET must be numeric",
  244. }
  245. }
  246. }
  247. return nil
  248. }
  249. // resolveFromClause adds tables from FROM clause to scope.
  250. func (a *Analyzer) resolveFromClause(tables []parser.TableRef) error {
  251. for _, ref := range tables {
  252. if err := a.defineTableRef(ref); err != nil {
  253. return err
  254. }
  255. // Handle JOINs
  256. if ref.Join != nil {
  257. if err := a.resolveJoin(ref.Join); err != nil {
  258. return err
  259. }
  260. }
  261. }
  262. return nil
  263. }
  264. // defineTableRef adds a single FROM/JOIN table to scope. The reference may be a
  265. // derived table (subquery), a CTE, or a real catalog table.
  266. func (a *Analyzer) defineTableRef(ref parser.TableRef) error {
  267. if ref.Subquery != nil {
  268. if err := a.analyzeSelect(ref.Subquery); err != nil {
  269. return err
  270. }
  271. a.scope.DefineTable(a.derivedTableInfo(ref))
  272. return nil
  273. }
  274. if cte, ok := a.scope.LookupTable(ref.Name); ok {
  275. a.scope.DefineTable(&TableInfo{
  276. Name: cte.Name,
  277. Columns: cte.Columns,
  278. Alias: ref.Alias,
  279. IsView: cte.IsView,
  280. })
  281. return nil
  282. }
  283. table, ok := a.catalog.GetTable(ref.Name)
  284. if !ok {
  285. return &AnalysisError{
  286. Type: ErrTableNotFound,
  287. Message: fmt.Sprintf("table not found: %s", ref.Name),
  288. }
  289. }
  290. a.scope.DefineTable(&TableInfo{
  291. Name: table.Name,
  292. Columns: table.Columns,
  293. Alias: ref.Alias,
  294. IsView: table.IsView,
  295. })
  296. return nil
  297. }
  298. // derivedTableInfo builds the scope entry for a derived table. A compound
  299. // subquery (UNION/…) keeps its projection on the first leg. A wildcard expands
  300. // the columns of the subquery's source tables so callers can reference them.
  301. func (a *Analyzer) derivedTableInfo(ref parser.TableRef) *TableInfo {
  302. info := &TableInfo{Name: ref.Alias, Alias: ref.Alias}
  303. leg := firstSelectLeg(ref.Subquery)
  304. if leg == nil {
  305. return info
  306. }
  307. for _, col := range leg.Columns {
  308. if col.Star {
  309. for _, tref := range collectAllTableRefs(leg.From) {
  310. if t, ok := a.scope.LookupTable(tref.Name); ok {
  311. for _, c := range t.Columns {
  312. info.Columns = append(info.Columns, ColumnInfo{Name: c.Name, TableName: ref.Alias, Type: c.Type})
  313. }
  314. } else if t, ok := a.catalog.GetTable(tref.Name); ok {
  315. for _, c := range t.Columns {
  316. info.Columns = append(info.Columns, ColumnInfo{Name: c.Name, TableName: ref.Alias, Type: c.Type})
  317. }
  318. }
  319. }
  320. continue
  321. }
  322. name := ""
  323. switch {
  324. case col.Alias != "":
  325. name = col.Alias
  326. case col.Expr != nil:
  327. if colRef, ok := col.Expr.(*parser.ColumnRef); ok {
  328. name = colRef.Column
  329. }
  330. }
  331. if name == "" {
  332. name = fmt.Sprintf("col_%d", len(info.Columns))
  333. }
  334. info.Columns = append(info.Columns, ColumnInfo{Name: name, TableName: ref.Alias, Type: TypeAny})
  335. }
  336. return info
  337. }
  338. // collectAllTableRefs flattens a FROM list and its join chains.
  339. func collectAllTableRefs(from []parser.TableRef) []parser.TableRef {
  340. var refs []parser.TableRef
  341. var add func(parser.TableRef)
  342. add = func(ref parser.TableRef) {
  343. if ref.Subquery != nil {
  344. return
  345. }
  346. refs = append(refs, ref)
  347. if ref.Join != nil && ref.Join.Table != nil {
  348. add(*ref.Join.Table)
  349. }
  350. }
  351. for _, ref := range from {
  352. add(ref)
  353. }
  354. return refs
  355. }
  356. // cteTableInfo describes the columns a CTE exposes. The declared column list
  357. // wins; otherwise the anchor/first-leg projection names are used.
  358. func cteTableInfo(cte *parser.CTE) *TableInfo {
  359. leg := firstSelectLeg(cte.Query)
  360. info := &TableInfo{Name: cte.Name}
  361. if leg == nil {
  362. return info
  363. }
  364. for i, col := range leg.Columns {
  365. name := ""
  366. switch {
  367. case i < len(cte.Columns):
  368. name = cte.Columns[i]
  369. case col.Alias != "":
  370. name = col.Alias
  371. case col.Expr != nil:
  372. if ref, ok := col.Expr.(*parser.ColumnRef); ok {
  373. name = ref.Column
  374. }
  375. }
  376. if name == "" {
  377. name = fmt.Sprintf("col_%d", i)
  378. }
  379. info.Columns = append(info.Columns, ColumnInfo{
  380. Name: name,
  381. TableName: cte.Name,
  382. Type: TypeAny,
  383. })
  384. }
  385. return info
  386. }
  387. // firstSelectLeg returns the SELECT whose projection describes a (possibly
  388. // compound) subquery's output columns. A UNION/INTERSECT/EXCEPT keeps the
  389. // projection on its first leg.
  390. func firstSelectLeg(sel *parser.SelectStmt) *parser.SelectStmt {
  391. for sel != nil && sel.Compound != nil {
  392. sel = sel.Compound.Left
  393. }
  394. return sel
  395. }
  396. // validateTableStar checks that a qualified wildcard qualifier names a table or
  397. // alias present in scope, returning an error for unknown qualifiers instead of
  398. // silently falling back to a plain column expansion.
  399. func (a *Analyzer) validateTableStar(qualifier string) error {
  400. if _, ok := a.scope.LookupTable(qualifier); !ok {
  401. return &AnalysisError{
  402. Type: ErrTableNotFound,
  403. Message: fmt.Sprintf("no such table or alias: %s", qualifier),
  404. }
  405. }
  406. return nil
  407. }
  408. // resolveJoin resolves a JOIN clause.
  409. func (a *Analyzer) resolveJoin(join *parser.JoinClause) error {
  410. if join.Table == nil {
  411. return nil
  412. }
  413. if err := a.defineTableRef(*join.Table); err != nil {
  414. return err
  415. }
  416. // Analyze ON condition
  417. if join.Condition != nil {
  418. if _, err := a.analyzeExpr(join.Condition); err != nil {
  419. return err
  420. }
  421. }
  422. // Handle USING clause
  423. for _, colName := range join.Using {
  424. _, _, ok := a.scope.LookupColumn("", colName)
  425. if !ok {
  426. return &AnalysisError{
  427. Type: ErrColumnNotFound,
  428. Message: fmt.Sprintf("column not found in USING clause: %s", colName),
  429. }
  430. }
  431. }
  432. // Recursively handle chained JOINs
  433. if join.Table.Join != nil {
  434. if err := a.resolveJoin(join.Table.Join); err != nil {
  435. return err
  436. }
  437. }
  438. return nil
  439. }
  440. // analyzeInsert analyzes an INSERT statement.
  441. func (a *Analyzer) analyzeInsert(stmt *parser.InsertStmt) error {
  442. table, ok := a.catalog.GetTable(stmt.Table.Name)
  443. if !ok {
  444. return &AnalysisError{
  445. Type: ErrTableNotFound,
  446. Message: fmt.Sprintf("table not found: %s", stmt.Table.Name),
  447. }
  448. }
  449. a.scope.DefineTable(&TableInfo{Name: table.Name, Columns: table.Columns, IsView: table.IsView})
  450. // Validate column list if specified. Generated columns may never be written
  451. // explicitly.
  452. var targetCols []ColumnInfo
  453. if len(stmt.Columns) > 0 {
  454. for _, colName := range stmt.Columns {
  455. col, ok := table.GetColumn(colName)
  456. if !ok {
  457. return &AnalysisError{
  458. Type: ErrColumnNotFound,
  459. Message: fmt.Sprintf("column not found: %s", colName),
  460. }
  461. }
  462. if col.Generated {
  463. return &AnalysisError{
  464. Type: ErrTypeMismatch,
  465. Message: fmt.Sprintf("cannot INSERT into generated column %s", colName),
  466. }
  467. }
  468. targetCols = append(targetCols, *col)
  469. }
  470. } else {
  471. // Positional values map to the table's non-generated columns.
  472. for _, col := range table.Columns {
  473. if !col.Generated {
  474. targetCols = append(targetCols, col)
  475. }
  476. }
  477. }
  478. // An ON CONFLICT target names columns of the target table. An unknown name
  479. // must fail the statement rather than silently degrading to a scan. The
  480. // hidden rowid aliases are valid targets unless a real column shadows them.
  481. for _, colName := range stmt.ConflictTarget {
  482. if _, ok := table.GetColumn(colName); ok || isRowIDAlias(colName) {
  483. continue
  484. }
  485. return &AnalysisError{
  486. Type: ErrColumnNotFound,
  487. Message: fmt.Sprintf("column not found: %s", colName),
  488. }
  489. }
  490. // Validate VALUES
  491. for _, row := range stmt.Values {
  492. if len(row) != len(targetCols) {
  493. return &AnalysisError{
  494. Type: ErrTypeMismatch,
  495. Message: fmt.Sprintf("INSERT has %d columns but %d values", len(targetCols), len(row)),
  496. }
  497. }
  498. for _, expr := range row {
  499. _, err := a.analyzeExpr(expr)
  500. if err != nil {
  501. return err
  502. }
  503. }
  504. }
  505. // Analyze INSERT ... SELECT
  506. if stmt.Select != nil {
  507. if err := a.analyzeSelect(stmt.Select); err != nil {
  508. return err
  509. }
  510. }
  511. // Analyze RETURNING in the target table's scope.
  512. if err := a.analyzeReturning(stmt.Returning); err != nil {
  513. return err
  514. }
  515. return nil
  516. }
  517. // analyzeReturning validates a RETURNING projection. Wildcards are accepted; a
  518. // projection may not contain aggregates.
  519. func (a *Analyzer) analyzeReturning(cols []parser.SelectColumn) error {
  520. for _, col := range cols {
  521. if col.Star || col.TableStar != "" || col.Expr == nil {
  522. continue
  523. }
  524. info, err := a.analyzeExpr(col.Expr)
  525. if err != nil {
  526. return err
  527. }
  528. if info.IsAggregate {
  529. return &AnalysisError{
  530. Type: ErrAggregateInWhere,
  531. Message: "aggregate functions are not allowed in RETURNING",
  532. }
  533. }
  534. }
  535. return nil
  536. }
  537. // analyzeUpdate analyzes an UPDATE statement.
  538. func (a *Analyzer) analyzeUpdate(stmt *parser.UpdateStmt) error {
  539. table, ok := a.catalog.GetTable(stmt.Table.Name)
  540. if !ok {
  541. return &AnalysisError{
  542. Type: ErrTableNotFound,
  543. Message: fmt.Sprintf("table not found: %s", stmt.Table.Name),
  544. }
  545. }
  546. a.scope.DefineTable(&TableInfo{Name: table.Name, Columns: table.Columns, Alias: stmt.Table.Alias, IsView: table.IsView})
  547. // UPDATE ... FROM: source tables/derived tables join the target in scope so
  548. // SET and WHERE may reference their columns.
  549. if len(stmt.From) > 0 {
  550. if err := a.resolveFromClause(stmt.From); err != nil {
  551. return err
  552. }
  553. }
  554. // Validate SET assignments
  555. for _, assign := range stmt.Set {
  556. col, ok := table.GetColumn(assign.Column)
  557. if !ok {
  558. return &AnalysisError{
  559. Type: ErrColumnNotFound,
  560. Message: fmt.Sprintf("column not found: %s", assign.Column),
  561. }
  562. }
  563. if col.Generated {
  564. return &AnalysisError{
  565. Type: ErrTypeMismatch,
  566. Message: fmt.Sprintf("cannot UPDATE generated column %s", assign.Column),
  567. }
  568. }
  569. _, err := a.analyzeExpr(assign.Value)
  570. if err != nil {
  571. return err
  572. }
  573. }
  574. // Analyze WHERE clause
  575. if stmt.Where != nil {
  576. info, err := a.analyzeExpr(stmt.Where)
  577. if err != nil {
  578. return err
  579. }
  580. if info.IsAggregate {
  581. return &AnalysisError{
  582. Type: ErrAggregateInWhere,
  583. Message: "aggregate functions not allowed in WHERE clause",
  584. }
  585. }
  586. }
  587. if err := a.analyzeReturning(stmt.Returning); err != nil {
  588. return err
  589. }
  590. return nil
  591. }
  592. // analyzeDelete analyzes a DELETE statement.
  593. func (a *Analyzer) analyzeDelete(stmt *parser.DeleteStmt) error {
  594. table, ok := a.catalog.GetTable(stmt.Table.Name)
  595. if !ok {
  596. return &AnalysisError{
  597. Type: ErrTableNotFound,
  598. Message: fmt.Sprintf("table not found: %s", stmt.Table.Name),
  599. }
  600. }
  601. a.scope.DefineTable(&TableInfo{Name: table.Name, Columns: table.Columns, IsView: table.IsView})
  602. // Analyze WHERE clause
  603. if stmt.Where != nil {
  604. info, err := a.analyzeExpr(stmt.Where)
  605. if err != nil {
  606. return err
  607. }
  608. if info.IsAggregate {
  609. return &AnalysisError{
  610. Type: ErrAggregateInWhere,
  611. Message: "aggregate functions not allowed in WHERE clause",
  612. }
  613. }
  614. }
  615. if err := a.analyzeReturning(stmt.Returning); err != nil {
  616. return err
  617. }
  618. return nil
  619. }
  620. // analyzeCreateTable analyzes a CREATE TABLE statement.
  621. func (a *Analyzer) analyzeCreateTable(stmt *parser.CreateTableStmt) error {
  622. // Check if table already exists
  623. if a.catalog.TableExists(stmt.Table.Name) {
  624. if stmt.IfNotExists {
  625. return nil // Silently succeed
  626. }
  627. return &AnalysisError{
  628. Type: ErrTableExists,
  629. Message: fmt.Sprintf("table already exists: %s", stmt.Table.Name),
  630. }
  631. }
  632. // Build table info
  633. tableInfo := &TableInfo{
  634. Name: stmt.Table.Name,
  635. }
  636. columnNames := make(map[string]bool)
  637. for _, colDef := range stmt.Columns {
  638. upperName := strings.ToUpper(colDef.Name)
  639. if columnNames[upperName] {
  640. return &AnalysisError{
  641. Type: ErrColumnAmbiguous,
  642. Message: fmt.Sprintf("duplicate column name: %s", colDef.Name),
  643. }
  644. }
  645. columnNames[upperName] = true
  646. colInfo := ColumnInfo{
  647. Name: colDef.Name,
  648. Type: TypeFromName(colDef.Type.Name),
  649. Nullable: true,
  650. TableName: stmt.Table.Name,
  651. Generated: colDef.GeneratedExpr != nil,
  652. }
  653. // Process constraints
  654. for _, constraint := range colDef.Constraints {
  655. switch constraint.Type {
  656. case parser.ConstraintPrimaryKey:
  657. colInfo.PrimaryKey = true
  658. colInfo.Nullable = false
  659. case parser.ConstraintNotNull:
  660. colInfo.Nullable = false
  661. case parser.ConstraintDefault:
  662. // Store default value (not evaluated here)
  663. colInfo.Default = constraint.Default
  664. }
  665. }
  666. tableInfo.Columns = append(tableInfo.Columns, colInfo)
  667. }
  668. // Process table-level constraints
  669. for _, constraint := range stmt.Constraints {
  670. switch constraint.Type {
  671. case parser.ConstraintPrimaryKey:
  672. for _, colName := range constraint.Columns {
  673. for i := range tableInfo.Columns {
  674. if strings.EqualFold(tableInfo.Columns[i].Name, colName) {
  675. tableInfo.Columns[i].PrimaryKey = true
  676. tableInfo.Columns[i].Nullable = false
  677. }
  678. }
  679. }
  680. }
  681. }
  682. // Validate generated-column expressions against the new table's columns.
  683. // Column references resolve within the table being created.
  684. for _, colDef := range stmt.Columns {
  685. if colDef.GeneratedExpr == nil {
  686. continue
  687. }
  688. genScope := NewScope(nil)
  689. genScope.DefineTable(tableInfo)
  690. oldScope := a.scope
  691. a.scope = genScope
  692. _, err := a.analyzeExpr(colDef.GeneratedExpr)
  693. a.scope = oldScope
  694. if err != nil {
  695. return err
  696. }
  697. }
  698. // Analysis is validation-only. Publishing the table before the durable
  699. // schema write can leave a phantom catalog entry when that write fails.
  700. return nil
  701. }
  702. // analyzeDropTable analyzes a DROP TABLE statement.
  703. func (a *Analyzer) analyzeDropTable(stmt *parser.DropTableStmt) error {
  704. for _, tableRef := range stmt.Tables {
  705. if !a.catalog.TableExists(tableRef.Name) {
  706. if stmt.IfExists {
  707. continue // Silently succeed
  708. }
  709. return &AnalysisError{
  710. Type: ErrTableNotFound,
  711. Message: fmt.Sprintf("table not found: %s", tableRef.Name),
  712. }
  713. }
  714. if err := a.catalog.DropTable(tableRef.Name); err != nil {
  715. return err
  716. }
  717. }
  718. return nil
  719. }
  720. // analyzeExpr analyzes an expression and returns type information.
  721. func (a *Analyzer) analyzeExpr(expr parser.Expr) (*ExprInfo, error) {
  722. switch e := expr.(type) {
  723. case *parser.LiteralExpr:
  724. return a.analyzeLiteral(e)
  725. case *parser.ColumnRef:
  726. return a.analyzeColumnRef(e)
  727. case *parser.BinaryExpr:
  728. return a.analyzeBinaryExpr(e)
  729. case *parser.UnaryExpr:
  730. return a.analyzeUnaryExpr(e)
  731. case *parser.FunctionCall:
  732. return a.analyzeFunctionCall(e)
  733. case *parser.ParenExpr:
  734. return a.analyzeExpr(e.Expr)
  735. case *parser.CaseExpr:
  736. return a.analyzeCaseExpr(e)
  737. case *parser.CastExpr:
  738. return a.analyzeCastExpr(e)
  739. case *parser.InExpr:
  740. return a.analyzeInExpr(e)
  741. case *parser.BetweenExpr:
  742. return a.analyzeBetweenExpr(e)
  743. case *parser.LikeExpr:
  744. return a.analyzeLikeExpr(e)
  745. case *parser.IsNullExpr:
  746. return a.analyzeIsNullExpr(e)
  747. case *parser.IsDistinctExpr:
  748. left, err := a.analyzeExpr(e.Left)
  749. if err != nil {
  750. return nil, err
  751. }
  752. right, err := a.analyzeExpr(e.Right)
  753. if err != nil {
  754. return nil, err
  755. }
  756. return &ExprInfo{
  757. Type: TypeBoolean,
  758. IsAggregate: left.IsAggregate || right.IsAggregate,
  759. Nullable: false,
  760. }, nil
  761. case *parser.ExistsExpr:
  762. return a.analyzeExistsExpr(e)
  763. case *parser.SubqueryExpr:
  764. return a.analyzeSubqueryExpr(e)
  765. case *parser.WindowExpr:
  766. return a.analyzeWindowExpr(e)
  767. default:
  768. return &ExprInfo{Type: TypeUnknown}, nil
  769. }
  770. }
  771. // analyzeWindowExpr analyzes a window function. Window functions are not
  772. // aggregates for the purpose of GROUP BY handling.
  773. func (a *Analyzer) analyzeWindowExpr(e *parser.WindowExpr) (*ExprInfo, error) {
  774. if e.Func != nil {
  775. for _, arg := range e.Func.Args {
  776. if _, err := a.analyzeExpr(arg); err != nil {
  777. return nil, err
  778. }
  779. }
  780. }
  781. for _, p := range e.PartitionBy {
  782. if _, err := a.analyzeExpr(p); err != nil {
  783. return nil, err
  784. }
  785. }
  786. for _, o := range e.OrderBy {
  787. if _, err := a.analyzeExpr(o.Expr); err != nil {
  788. return nil, err
  789. }
  790. }
  791. ret := TypeInteger
  792. if e.Func != nil {
  793. if sig, ok := builtinFunctions[e.Func.Name]; ok {
  794. ret = sig.ReturnType
  795. }
  796. }
  797. return &ExprInfo{Type: ret}, nil
  798. }
  799. func (a *Analyzer) analyzeLiteral(e *parser.LiteralExpr) (*ExprInfo, error) {
  800. info := &ExprInfo{IsConstant: true}
  801. switch e.Type {
  802. case lexer.TokenNumber:
  803. if strings.Contains(e.Value, ".") || strings.Contains(strings.ToLower(e.Value), "e") {
  804. info.Type = TypeReal
  805. } else {
  806. info.Type = TypeInteger
  807. }
  808. case lexer.TokenString:
  809. info.Type = TypeText
  810. case lexer.TokenBlob:
  811. info.Type = TypeBlob
  812. case lexer.TokenNULL:
  813. info.Type = TypeNull
  814. info.Nullable = true
  815. case lexer.TokenTRUE, lexer.TokenFALSE:
  816. info.Type = TypeBoolean
  817. case lexer.TokenStar:
  818. info.Type = TypeAny
  819. default:
  820. info.Type = TypeUnknown
  821. }
  822. return info, nil
  823. }
  824. func (a *Analyzer) analyzeColumnRef(e *parser.ColumnRef) (*ExprInfo, error) {
  825. col, _, ok := a.scope.LookupColumn(e.Table, e.Column)
  826. if !ok {
  827. // If no tables are in scope, treat as unknown (for standalone expressions)
  828. if len(a.scope.GetTables()) == 0 {
  829. return &ExprInfo{Type: TypeUnknown}, nil
  830. }
  831. // Hidden rowid alias (rowid/oid/_rowid_) when the table has no real column
  832. // of that name. LookupColumn already resolved a real column, so this only
  833. // fires for the alias (SQLite gives explicit columns precedence).
  834. if isRowIDAlias(e.Column) {
  835. if e.Table != "" {
  836. if _, found := a.scope.LookupTable(e.Table); !found {
  837. return nil, &AnalysisError{
  838. Type: ErrColumnNotFound,
  839. Message: fmt.Sprintf("column not found: %s", formatColumnRef(e)),
  840. }
  841. }
  842. }
  843. return &ExprInfo{Type: TypeInteger}, nil
  844. }
  845. return nil, &AnalysisError{
  846. Type: ErrColumnNotFound,
  847. Message: fmt.Sprintf("column not found: %s", formatColumnRef(e)),
  848. }
  849. }
  850. return &ExprInfo{
  851. Type: col.Type,
  852. Nullable: col.Nullable,
  853. }, nil
  854. }
  855. // isRowIDAlias reports whether a column name is a hidden rowid alias (rowid, oid,
  856. // or _rowid_), matching the storage layer's IsRowIDColumn.
  857. func isRowIDAlias(name string) bool {
  858. switch strings.ToLower(name) {
  859. case "rowid", "oid", "_rowid_":
  860. return true
  861. }
  862. return false
  863. }
  864. func formatColumnRef(e *parser.ColumnRef) string {
  865. if e.Table != "" {
  866. return e.Table + "." + e.Column
  867. }
  868. return e.Column
  869. }
  870. func (a *Analyzer) analyzeBinaryExpr(e *parser.BinaryExpr) (*ExprInfo, error) {
  871. left, err := a.analyzeExpr(e.Left)
  872. if err != nil {
  873. return nil, err
  874. }
  875. right, err := a.analyzeExpr(e.Right)
  876. if err != nil {
  877. return nil, err
  878. }
  879. info := &ExprInfo{
  880. IsAggregate: left.IsAggregate || right.IsAggregate,
  881. IsConstant: left.IsConstant && right.IsConstant,
  882. Nullable: left.Nullable || right.Nullable,
  883. }
  884. switch e.Op {
  885. case lexer.TokenPlus, lexer.TokenMinus, lexer.TokenStar, lexer.TokenSlash, lexer.TokenPercent:
  886. // Arithmetic operators. TypeAny comes from derived tables and CTEs whose
  887. // column types are not tracked, so it is allowed rather than rejected.
  888. info.Type = CommonType(left.Type, right.Type)
  889. if !left.Type.IsNumeric() && left.Type != TypeNull && left.Type != TypeUnknown && left.Type != TypeAny {
  890. return nil, &AnalysisError{
  891. Type: ErrTypeMismatch,
  892. Message: fmt.Sprintf("arithmetic operator requires numeric type, got %s", left.Type),
  893. }
  894. }
  895. case lexer.TokenEq, lexer.TokenNeq, lexer.TokenLt, lexer.TokenLte, lexer.TokenGt, lexer.TokenGte:
  896. // Comparison operators
  897. info.Type = TypeBoolean
  898. if !left.Type.IsComparable(right.Type) {
  899. return nil, &AnalysisError{
  900. Type: ErrTypeMismatch,
  901. Message: fmt.Sprintf("cannot compare %s with %s", left.Type, right.Type),
  902. }
  903. }
  904. case lexer.TokenBitAnd, lexer.TokenBitOr, lexer.TokenShiftLeft, lexer.TokenShiftRight:
  905. // Bitwise operators coerce operands to integers.
  906. info.Type = TypeInteger
  907. for _, operand := range []Type{left.Type, right.Type} {
  908. if !operand.IsNumeric() && operand != TypeNull && operand != TypeUnknown && operand != TypeAny {
  909. return nil, &AnalysisError{
  910. Type: ErrTypeMismatch,
  911. Message: fmt.Sprintf("bitwise operator requires numeric type, got %s", operand),
  912. }
  913. }
  914. }
  915. case lexer.TokenAND, lexer.TokenOR:
  916. // Logical operators
  917. info.Type = TypeBoolean
  918. case lexer.TokenConcat:
  919. // String concatenation
  920. info.Type = TypeText
  921. default:
  922. info.Type = TypeUnknown
  923. }
  924. return info, nil
  925. }
  926. func (a *Analyzer) analyzeUnaryExpr(e *parser.UnaryExpr) (*ExprInfo, error) {
  927. operand, err := a.analyzeExpr(e.Operand)
  928. if err != nil {
  929. return nil, err
  930. }
  931. info := &ExprInfo{
  932. IsAggregate: operand.IsAggregate,
  933. IsConstant: operand.IsConstant,
  934. Nullable: operand.Nullable,
  935. }
  936. switch e.Op {
  937. case lexer.TokenPlus:
  938. // Unary + is a no-op in SQLite — passes any type through unchanged.
  939. info.Type = operand.Type
  940. case lexer.TokenMinus:
  941. info.Type = operand.Type
  942. if !operand.Type.IsNumeric() && operand.Type != TypeNull && operand.Type != TypeUnknown {
  943. return nil, &AnalysisError{
  944. Type: ErrTypeMismatch,
  945. Message: fmt.Sprintf("unary - requires numeric type, got %s", operand.Type),
  946. }
  947. }
  948. case lexer.TokenNOT:
  949. info.Type = TypeBoolean
  950. case lexer.TokenBitNot:
  951. info.Type = TypeInteger
  952. default:
  953. info.Type = operand.Type
  954. }
  955. return info, nil
  956. }
  957. func (a *Analyzer) analyzeFunctionCall(e *parser.FunctionCall) (*ExprInfo, error) {
  958. sig, ok := LookupFunction(e.Name)
  959. if !ok {
  960. return nil, &AnalysisError{
  961. Type: ErrInvalidFunction,
  962. Message: fmt.Sprintf("unknown function: %s", e.Name),
  963. }
  964. }
  965. // Handle COUNT(*)
  966. argCount := len(e.Args)
  967. if e.Star {
  968. argCount = 0 // COUNT(*) has 0 real args
  969. }
  970. // Check argument count
  971. if argCount < sig.MinArgs {
  972. return nil, &AnalysisError{
  973. Type: ErrInvalidArgCount,
  974. Message: fmt.Sprintf("function %s requires at least %d arguments, got %d", e.Name, sig.MinArgs, argCount),
  975. }
  976. }
  977. if sig.MaxArgs >= 0 && argCount > sig.MaxArgs {
  978. return nil, &AnalysisError{
  979. Type: ErrInvalidArgCount,
  980. Message: fmt.Sprintf("function %s accepts at most %d arguments, got %d", e.Name, sig.MaxArgs, argCount),
  981. }
  982. }
  983. // Analyze arguments
  984. info := &ExprInfo{
  985. Type: sig.ReturnType,
  986. IsAggregate: sig.IsAggregate,
  987. }
  988. for _, arg := range e.Args {
  989. argInfo, err := a.analyzeExpr(arg)
  990. if err != nil {
  991. return nil, err
  992. }
  993. if argInfo.Nullable {
  994. info.Nullable = true
  995. }
  996. // Propagate aggregate status from arguments
  997. if argInfo.IsAggregate && !sig.IsAggregate {
  998. info.IsAggregate = true
  999. }
  1000. }
  1001. // Special case: polymorphic functions (MIN/MAX/COALESCE/...) return a value
  1002. // whose type follows their first argument.
  1003. if sig.ReturnType == TypeAny && len(e.Args) > 0 && isPolymorphicFunction(e.Name) {
  1004. argInfo, _ := a.analyzeExpr(e.Args[0])
  1005. if argInfo != nil {
  1006. info.Type = argInfo.Type
  1007. }
  1008. }
  1009. return info, nil
  1010. }
  1011. // isPolymorphicFunction reports whether a function's result type follows its
  1012. // first argument rather than a fixed signature type.
  1013. func isPolymorphicFunction(name string) bool {
  1014. switch strings.ToUpper(name) {
  1015. case "MIN", "MAX", "COALESCE", "IFNULL", "NVL", "NULLIF", "IIF":
  1016. return true
  1017. }
  1018. return false
  1019. }
  1020. func (a *Analyzer) analyzeCaseExpr(e *parser.CaseExpr) (*ExprInfo, error) {
  1021. info := &ExprInfo{
  1022. Nullable: true, // CASE can return NULL
  1023. }
  1024. // Analyze operand if present (simple CASE)
  1025. if e.Operand != nil {
  1026. opInfo, err := a.analyzeExpr(e.Operand)
  1027. if err != nil {
  1028. return nil, err
  1029. }
  1030. if opInfo.IsAggregate {
  1031. info.IsAggregate = true
  1032. }
  1033. }
  1034. // Analyze WHEN clauses
  1035. var resultType Type
  1036. for _, when := range e.Whens {
  1037. condInfo, err := a.analyzeExpr(when.Condition)
  1038. if err != nil {
  1039. return nil, err
  1040. }
  1041. if condInfo.IsAggregate {
  1042. info.IsAggregate = true
  1043. }
  1044. resInfo, err := a.analyzeExpr(when.Result)
  1045. if err != nil {
  1046. return nil, err
  1047. }
  1048. if resInfo.IsAggregate {
  1049. info.IsAggregate = true
  1050. }
  1051. if resultType == TypeUnknown {
  1052. resultType = resInfo.Type
  1053. } else {
  1054. resultType = CommonType(resultType, resInfo.Type)
  1055. }
  1056. }
  1057. // Analyze ELSE clause
  1058. if e.Else != nil {
  1059. elseInfo, err := a.analyzeExpr(e.Else)
  1060. if err != nil {
  1061. return nil, err
  1062. }
  1063. if elseInfo.IsAggregate {
  1064. info.IsAggregate = true
  1065. }
  1066. resultType = CommonType(resultType, elseInfo.Type)
  1067. }
  1068. info.Type = resultType
  1069. return info, nil
  1070. }
  1071. func (a *Analyzer) analyzeCastExpr(e *parser.CastExpr) (*ExprInfo, error) {
  1072. exprInfo, err := a.analyzeExpr(e.Expr)
  1073. if err != nil {
  1074. return nil, err
  1075. }
  1076. return &ExprInfo{
  1077. Type: TypeFromName(e.Type.Name),
  1078. IsAggregate: exprInfo.IsAggregate,
  1079. IsConstant: exprInfo.IsConstant,
  1080. Nullable: exprInfo.Nullable,
  1081. }, nil
  1082. }
  1083. func (a *Analyzer) analyzeInExpr(e *parser.InExpr) (*ExprInfo, error) {
  1084. leftInfo, err := a.analyzeExpr(e.Left)
  1085. if err != nil {
  1086. return nil, err
  1087. }
  1088. info := &ExprInfo{
  1089. Type: TypeBoolean,
  1090. IsAggregate: leftInfo.IsAggregate,
  1091. }
  1092. // Analyze value list
  1093. for _, val := range e.Values {
  1094. valInfo, err := a.analyzeExpr(val)
  1095. if err != nil {
  1096. return nil, err
  1097. }
  1098. if valInfo.IsAggregate {
  1099. info.IsAggregate = true
  1100. }
  1101. }
  1102. // Analyze subquery
  1103. if e.Subquery != nil {
  1104. subScope := NewScope(a.scope)
  1105. oldScope := a.scope
  1106. a.scope = subScope
  1107. err := a.analyzeSelect(e.Subquery)
  1108. a.scope = oldScope
  1109. if err != nil {
  1110. return nil, err
  1111. }
  1112. }
  1113. return info, nil
  1114. }
  1115. func (a *Analyzer) analyzeBetweenExpr(e *parser.BetweenExpr) (*ExprInfo, error) {
  1116. leftInfo, err := a.analyzeExpr(e.Left)
  1117. if err != nil {
  1118. return nil, err
  1119. }
  1120. lowInfo, err := a.analyzeExpr(e.Low)
  1121. if err != nil {
  1122. return nil, err
  1123. }
  1124. highInfo, err := a.analyzeExpr(e.High)
  1125. if err != nil {
  1126. return nil, err
  1127. }
  1128. return &ExprInfo{
  1129. Type: TypeBoolean,
  1130. IsAggregate: leftInfo.IsAggregate || lowInfo.IsAggregate || highInfo.IsAggregate,
  1131. Nullable: leftInfo.Nullable || lowInfo.Nullable || highInfo.Nullable,
  1132. }, nil
  1133. }
  1134. func (a *Analyzer) analyzeLikeExpr(e *parser.LikeExpr) (*ExprInfo, error) {
  1135. leftInfo, err := a.analyzeExpr(e.Left)
  1136. if err != nil {
  1137. return nil, err
  1138. }
  1139. patternInfo, err := a.analyzeExpr(e.Pattern)
  1140. if err != nil {
  1141. return nil, err
  1142. }
  1143. info := &ExprInfo{
  1144. Type: TypeBoolean,
  1145. IsAggregate: leftInfo.IsAggregate || patternInfo.IsAggregate,
  1146. Nullable: leftInfo.Nullable || patternInfo.Nullable,
  1147. }
  1148. if e.Escape != nil {
  1149. escInfo, err := a.analyzeExpr(e.Escape)
  1150. if err != nil {
  1151. return nil, err
  1152. }
  1153. if escInfo.IsAggregate {
  1154. info.IsAggregate = true
  1155. }
  1156. }
  1157. return info, nil
  1158. }
  1159. func (a *Analyzer) analyzeIsNullExpr(e *parser.IsNullExpr) (*ExprInfo, error) {
  1160. leftInfo, err := a.analyzeExpr(e.Left)
  1161. if err != nil {
  1162. return nil, err
  1163. }
  1164. return &ExprInfo{
  1165. Type: TypeBoolean,
  1166. IsAggregate: leftInfo.IsAggregate,
  1167. IsConstant: leftInfo.IsConstant,
  1168. }, nil
  1169. }
  1170. func (a *Analyzer) analyzeExistsExpr(e *parser.ExistsExpr) (*ExprInfo, error) {
  1171. // Analyze subquery in its own scope
  1172. subScope := NewScope(a.scope)
  1173. oldScope := a.scope
  1174. a.scope = subScope
  1175. err := a.analyzeSelect(e.Subquery)
  1176. a.scope = oldScope
  1177. if err != nil {
  1178. return nil, err
  1179. }
  1180. return &ExprInfo{
  1181. Type: TypeBoolean,
  1182. }, nil
  1183. }
  1184. func (a *Analyzer) analyzeSubqueryExpr(e *parser.SubqueryExpr) (*ExprInfo, error) {
  1185. // Analyze subquery in its own scope
  1186. subScope := NewScope(a.scope)
  1187. oldScope := a.scope
  1188. a.scope = subScope
  1189. err := a.analyzeSelect(e.Query)
  1190. a.scope = oldScope
  1191. if err != nil {
  1192. return nil, err
  1193. }
  1194. // Scalar subquery - return type of first column
  1195. // For simplicity, return TypeAny
  1196. return &ExprInfo{
  1197. Type: TypeAny,
  1198. }, nil
  1199. }