GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — meyer/ast/expr.go at v0.1.2 · sqlc-dev/meyer Expand file tree/ Copy pathexpr.goMore file actions 462 lines (399 loc) · 12.3 KB / Copy pathexpr.goFile metadata and controls462 lines (399 loc) · 12.3 KB 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 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 package ast // This file declares the expression nodes. Each carries a comment naming the // parse.y rule(s) it comes from. // QuoteStyle records how an identifier was spelled in the source. SQLite // accepts four quoting styles for identifiers plus the unquoted form, and // consumers (sqlc among them) need to tell them apart. type QuoteStyle byte const ( QuoteNone QuoteStyle = 0 QuoteDouble QuoteStyle = '"' QuoteBack QuoteStyle = '`' QuoteSquare QuoteStyle = '[' QuoteSingle QuoteStyle = '\'' // a string literal used in a name position ) // Ident is a name: a table, column, function, alias, collation, ... // // nm ::= idj. / nm ::= STRING. type Ident struct { Span Name string `json:"name"` // dequoted Raw string `json:"raw"` // exactly as it appeared Quote QuoteStyle `json:"quote"` // QuoteNone when unquoted } func (*Ident) exprNode() {} func (n *Ident) Children() []Node { return nil } // QualifiedName is a "nm dbnm" pair: an optionally schema-qualified object // name. Schema is nil when the name was unqualified. // // fullname ::= nm. / fullname ::= nm DOT nm. type QualifiedName struct { Span Schema *Ident `json:"schema,omitempty"` Name *Ident `json:"name"` } func (n *QualifiedName) Children() []Node { return nodes(n.Schema, n.Name) } // QualifiedRef is a dotted column reference with two or three parts. // // expr ::= nm DOT nm. / expr ::= nm DOT nm DOT nm. type QualifiedRef struct { Span Parts []*Ident `json:"parts"` } func (*QualifiedRef) exprNode() {} func (n *QualifiedRef) Children() []Node { out := make([]Node, len(n.Parts)) for i, p := range n.Parts { out[i] = p } return out } // Star is "*" or "tbl.*" in a result column list. // // selcollist ::= sclp scanpt STAR. / selcollist ::= sclp scanpt nm DOT STAR. type Star struct { Span Table *Ident `json:"table,omitempty"` } func (*Star) exprNode() {} func (n *Star) Children() []Node { return nodes(n.Table) } // LiteralKind distinguishes the literal forms of the "term" production. type LiteralKind int const ( LitNull LiteralKind = iota LitInteger LitFloat LitString LitBlob LitCurrentDate LitCurrentTime LitCurrentTimestamp ) // Literal is a constant. // // term ::= NULL|FLOAT|BLOB. / term ::= STRING. / term ::= INTEGER. // term ::= QNUMBER. / term ::= CTIME_KW. type Literal struct { Span Kind LiteralKind `json:"kind"` Value string `json:"value"` // dequoted for strings, raw otherwise Raw string `json:"raw"` } func (*Literal) exprNode() {} func (n *Literal) Children() []Node { return nil } // ParamKind distinguishes SQLite's four bind-parameter spellings. type ParamKind int const ( ParamAnon ParamKind = iota // ? ParamNumber // ?NNN ParamColon // :name ParamAt // @name ParamDollar // $name ) // BindParam is a parameter marker. Number is assigned the way // sqlite3ExprAssignVarNumber does: explicit for ?NNN, otherwise one past the // highest number used so far. // // expr ::= VARIABLE. type BindParam struct { Span Kind ParamKind `json:"kind"` Number int `json:"number"` Name string `json:"name,omitempty"` // without the sigil Raw string `json:"raw"` } func (*BindParam) exprNode() {} func (n *BindParam) Children() []Node { return nil } // Operator identifies a unary or binary operator. type Operator int const ( OpNone Operator = iota // Binary OpOr OpAnd OpEq OpNe OpLt OpLe OpGt OpGe OpBitAnd OpBitOr OpLShift OpRShift OpAdd OpSub OpMul OpDiv OpMod OpConcat OpPtr // -> OpPtr2 // ->> // Unary OpNot OpBitNot OpPlus OpMinus ) var opText = map[Operator]string{ OpOr: "OR", OpAnd: "AND", OpEq: "=", OpNe: "<>", OpLt: "<", OpLe: "<=", OpGt: ">", OpGe: ">=", OpBitAnd: "&", OpBitOr: "|", OpLShift: "<<", OpRShift: ">>", OpAdd: "+", OpSub: "-", OpMul: "*", OpDiv: "/", OpMod: "%", OpConcat: "||", OpPtr: "->", OpPtr2: "->>", OpNot: "NOT", OpBitNot: "~", OpPlus: "+", OpMinus: "-", } func (o Operator) String() string { return opText[o] } // BinaryExpr is an infix operator application. // // expr ::= expr AND expr. and the other %left/%right operator rules. type BinaryExpr struct { Span Op Operator `json:"op"` X Expr `json:"x"` Y Expr `json:"y"` } func (*BinaryExpr) exprNode() {} func (n *BinaryExpr) Children() []Node { return nodes(n.X, n.Y) } // UnaryExpr is a prefix operator application. // // expr ::= NOT expr. / expr ::= BITNOT expr. / expr ::= PLUS|MINUS expr. type UnaryExpr struct { Span Op Operator `json:"op"` X Expr `json:"x"` } func (*UnaryExpr) exprNode() {} func (n *UnaryExpr) Children() []Node { return nodes(n.X) } // ParenExpr preserves an explicit parenthesisation. SQLite discards these // (expr ::= LP expr RP just yields the inner expression), but keeping them // makes the round-trip renderer exact. type ParenExpr struct { Span X Expr `json:"x"` } func (*ParenExpr) exprNode() {} func (n *ParenExpr) Children() []Node { return nodes(n.X) } // LikeExpr is a LIKE/GLOB/REGEXP/MATCH application, optionally negated and // optionally with an ESCAPE operand. // // expr ::= expr likeop expr. / expr ::= expr likeop expr ESCAPE expr. type LikeExpr struct { Span Op *Ident `json:"op"` // the LIKE/GLOB/REGEXP/MATCH token, as written Not bool `json:"not"` X Expr `json:"x"` Y Expr `json:"y"` Escape Expr `json:"escape,omitempty"` } func (*LikeExpr) exprNode() {} func (n *LikeExpr) Children() []Node { return nodes(n.Op, n.X, n.Y, n.Escape) } // IsExpr is "IS", "IS NOT", "IS DISTINCT FROM" or "IS NOT DISTINCT FROM". // // expr ::= expr IS expr. and its three siblings. type IsExpr struct { Span Not bool `json:"not"` Distinct bool `json:"distinct"` // the DISTINCT FROM spelling was used X Expr `json:"x"` Y Expr `json:"y"` } func (*IsExpr) exprNode() {} func (n *IsExpr) Children() []Node { return nodes(n.X, n.Y) } // NullTest distinguishes the three spellings of a postfix null test. They // are not interchangeable: "expr NOT NULL" takes its precedence from NOT, // while ISNULL and NOTNULL are comparison-level operators, so "NOT x NOTNULL" // and "NOT x NOT NULL" are different trees. type NullTest int const ( TestIsNull NullTest = iota // ISNULL TestNotNull // NOTNULL TestNotNullWords // NOT NULL ) // NullCheckExpr is a postfix null test. // // expr ::= expr ISNULL|NOTNULL. / expr ::= expr NOT NULL. type NullCheckExpr struct { Span Test NullTest `json:"test"` X Expr `json:"x"` } func (*NullCheckExpr) exprNode() {} func (n *NullCheckExpr) Children() []Node { return nodes(n.X) } // BetweenExpr is "x BETWEEN lo AND hi", optionally negated. // // expr ::= expr between_op expr AND expr. type BetweenExpr struct { Span Not bool `json:"not"` X Expr `json:"x"` Lo Expr `json:"lo"` Hi Expr `json:"hi"` } func (*BetweenExpr) exprNode() {} func (n *BetweenExpr) Children() []Node { return nodes(n.X, n.Lo, n.Hi) } // InExpr is "x IN ...". Exactly one of List, Select and Table is set; an // empty parenthesised list leaves all three unset with Parens true. // // expr ::= expr in_op LP exprlist RP. // expr ::= expr in_op LP select RP. // expr ::= expr in_op nm dbnm paren_exprlist. type InExpr struct { Span Not bool `json:"not"` X Expr `json:"x"` Parens bool `json:"parens"` List []Expr `json:"list,omitempty"` Select *SelectStmt `json:"select,omitempty"` Table *QualifiedName `json:"table,omitempty"` Args []Expr `json:"args,omitempty"` // table-valued function args HasArgs bool `json:"hasArgs,omitempty"` } func (*InExpr) exprNode() {} func (n *InExpr) Children() []Node { out := nodes(n.X, n.Select, n.Table) out = appendNodes(out, n.List) out = appendNodes(out, n.Args) return out } // CaseExpr is a CASE expression. Operand is nil for the searched form. // // expr ::= CASE case_operand case_exprlist case_else END. type CaseExpr struct { Span Operand Expr `json:"operand,omitempty"` Whens []*CaseWhen `json:"whens"` Else Expr `json:"else,omitempty"` } func (*CaseExpr) exprNode() {} func (n *CaseExpr) Children() []Node { out := nodes(n.Operand) out = appendNodes(out, n.Whens) return append(out, nodes(n.Else)...) } // CaseWhen is one WHEN/THEN pair. // // case_exprlist ::= case_exprlist WHEN expr THEN expr. type CaseWhen struct { Span When Expr `json:"when"` Then Expr `json:"then"` } func (n *CaseWhen) Children() []Node { return nodes(n.When, n.Then) } // CastExpr is "CAST(expr AS type)". // // expr ::= CAST LP expr AS typetoken RP. type CastExpr struct { Span X Expr `json:"x"` Type *TypeName `json:"type"` } func (*CastExpr) exprNode() {} func (n *CastExpr) Children() []Node { return nodes(n.X, n.Type) } // CollateExpr is "expr COLLATE name". // // expr ::= expr COLLATE ids. type CollateExpr struct { Span X Expr `json:"x"` Name *Ident `json:"name"` } func (*CollateExpr) exprNode() {} func (n *CollateExpr) Children() []Node { return nodes(n.X, n.Name) } // FuncCall is a function invocation, including aggregate and window forms. // // expr ::= idj LP distinct exprlist RP [filter_over]. // expr ::= idj LP distinct exprlist ORDER BY sortlist RP [filter_over]. // expr ::= idj LP STAR RP [filter_over]. type FuncCall struct { Span Name *Ident `json:"name"` Distinct bool `json:"distinct"` All bool `json:"all"` // the redundant ALL qualifier Star bool `json:"star"` Args []Expr `json:"args,omitempty"` OrderBy []*OrderingTerm `json:"orderBy,omitempty"` // aggregate inner ORDER BY Filter Expr `json:"filter,omitempty"` // FILTER (WHERE ...) Over *WindowDef `json:"over,omitempty"` } func (*FuncCall) exprNode() {} func (n *FuncCall) Children() []Node { out := nodes(n.Name) out = appendNodes(out, n.Args) out = appendNodes(out, n.OrderBy) return append(out, nodes(n.Filter, n.Over)...) } // ExistsExpr is "EXISTS (select)". // // expr ::= EXISTS LP select RP. type ExistsExpr struct { Span Select *SelectStmt `json:"select"` } func (*ExistsExpr) exprNode() {} func (n *ExistsExpr) Children() []Node { return nodes(n.Select) } // SubqueryExpr is a parenthesised SELECT used as a scalar. // // expr ::= LP select RP. type SubqueryExpr struct { Span Select *SelectStmt `json:"select"` } func (*SubqueryExpr) exprNode() {} func (n *SubqueryExpr) Children() []Node { return nodes(n.Select) } // VectorExpr is a parenthesised row value with two or more elements. // // expr ::= LP nexprlist COMMA expr RP. type VectorExpr struct { Span List []Expr `json:"list"` } func (*VectorExpr) exprNode() {} func (n *VectorExpr) Children() []Node { out := make([]Node, len(n.List)) for i, e := range n.List { out[i] = e } return out } // RaiseExpr is the trigger-only RAISE() form. // // expr ::= RAISE LP IGNORE RP. / expr ::= RAISE LP raisetype COMMA expr RP. type RaiseExpr struct { Span Action string `json:"action"` // IGNORE, ROLLBACK, ABORT or FAIL Message Expr `json:"message,omitempty"` } func (*RaiseExpr) exprNode() {} func (n *RaiseExpr) Children() []Node { return nodes(n.Message) } // TypeName is a column or cast type: one or more identifier tokens followed // by an optional size specification. // // typetoken ::= typename [LP signed [COMMA signed] RP]. type TypeName struct { Span Name string `json:"name"` // the identifier tokens, space-joined Args []string `json:"args,omitempty"` // the signed numbers, as written Raw string `json:"raw"` // the whole source span } func (n *TypeName) Children() []Node { return nil } // nodes builds a Children() slice, dropping nil interfaces and nil // pointers. Optional fields are common, so a node whose children are all // absent allocates nothing. func nodes(list ...Node) []Node { var out []Node for _, n := range list { if !isNil(n) { out = append(out, n) } } return out } // appendNodes appends a slice of concrete node pointers to a Children() // result. It exists because every node with a repeated field would // otherwise spell the same three-line loop out again. func appendNodes[T Node](out []Node, list []T) []Node { for _, n := range list { out = append(out, n) } return out } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |