-
-
Notifications
You must be signed in to change notification settings - Fork 179
/
exp.go
379 lines (329 loc) · 7.58 KB
/
exp.go
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
package qcode
import (
"errors"
"fmt"
"github.com/dosco/graphjin/core/internal/graph"
"github.com/dosco/graphjin/core/internal/sdata"
"github.com/dosco/graphjin/core/internal/util"
)
func (co *Compiler) compileArgObj(ti sdata.DBTable, st *util.StackInf, arg *graph.Arg) (*Exp, bool, error) {
if arg.Val.Type != graph.NodeObj {
return nil, false, fmt.Errorf("expecting an object")
}
return co.compileArgNode(ti, st, arg.Val, false)
}
type aexpst struct {
co *Compiler
st *util.StackInf
ti sdata.DBTable
savePath bool
}
type aexp struct {
exp *Exp
node *graph.Node
path []string
}
func (co *Compiler) compileArgNode(
ti sdata.DBTable,
st *util.StackInf,
node *graph.Node,
savePath bool) (*Exp, bool, error) {
var root *Exp
var needsUser bool
if node == nil || len(node.Children) == 0 {
return nil, false, errors.New("invalid argument value")
}
ast := &aexpst{co: co, st: st, ti: ti, savePath: savePath}
ast.pushChildren(nil, node)
for {
if st.Len() == 0 {
break
}
intf := st.Pop()
av, ok := intf.(aexp)
if !ok {
return nil, needsUser, fmt.Errorf("16: unexpected value %v (%t)", intf, intf)
}
// Objects inside a list
if av.node.Name == "" {
ast.pushChildren(av.exp, av.node)
continue
}
ex, err := ast.parseNode(av)
if err != nil {
return nil, needsUser, err
}
if ex == nil {
continue
}
if ex.Right.ValType == ValVar && ex.Right.Val == "user_id" {
needsUser = true
}
if av.exp == nil {
root = ex
} else {
av.exp.Children = append(av.exp.Children, ex)
}
}
return root, needsUser, nil
}
func newExp() *Exp {
ex := &Exp{Op: OpNop}
ex.Left.ID = -1
ex.Right.ID = -1
ex.Children = ex.childrenA[:0]
return ex
}
func newExpOp(op ExpOp) *Exp {
ex := newExp()
ex.Op = op
return ex
}
func (ast *aexpst) parseNode(av aexp) (*Exp, error) {
var err error
node := av.node
name := node.Name
if name[0] == '_' {
name = name[1:]
}
ex := newExp()
if ast.savePath {
ex.Right.Path = append(av.path, node.Name)
}
switch name {
case "and":
if len(node.Children) == 0 {
return nil, errors.New("missing expression after 'AND' operator")
}
ex.Op = OpAnd
ast.pushChildren(ex, node)
case "or":
if len(node.Children) == 0 {
return nil, errors.New("missing expression after 'OR' operator")
}
ex.Op = OpOr
ast.pushChildren(ex, node)
case "not":
if len(node.Children) == 0 {
return nil, errors.New("missing expression after 'NOT' operator")
}
ex.Op = OpNot
ast.pushChildren(ex, node)
case "eq", "equals":
ex.Op = OpEquals
ex.Right.Val = node.Val
case "neq", "not_equals":
ex.Op = OpNotEquals
ex.Right.Val = node.Val
case "gt", "greater_than":
ex.Op = OpGreaterThan
ex.Right.Val = node.Val
case "lt", "lesser_than":
ex.Op = OpLesserThan
ex.Right.Val = node.Val
case "gte", "gteq", "greater_or_equals":
ex.Op = OpGreaterOrEquals
ex.Right.Val = node.Val
case "lte", "lteq", "lesser_or_equals":
ex.Op = OpLesserOrEquals
ex.Right.Val = node.Val
case "in":
ex.Op = OpIn
setListVal(ex, node)
case "nin", "not_in":
ex.Op = OpNotIn
setListVal(ex, node)
case "like":
ex.Op = OpLike
ex.Right.Val = node.Val
case "nlike", "not_like":
ex.Op = OpNotLike
ex.Right.Val = node.Val
case "ilike":
ex.Op = OpILike
ex.Right.Val = node.Val
case "nilike", "not_ilike":
ex.Op = OpNotILike
ex.Right.Val = node.Val
case "similar":
ex.Op = OpSimilar
ex.Right.Val = node.Val
case "nsimilar", "not_similar":
ex.Op = OpNotSimilar
ex.Right.Val = node.Val
case "regex":
ex.Op = OpRegex
ex.Right.Val = node.Val
case "nregex", "not_regex":
ex.Op = OpNotRegex
ex.Right.Val = node.Val
case "iregex":
ex.Op = OpIRegex
ex.Right.Val = node.Val
case "niregex", "not_iregex":
ex.Op = OpNotIRegex
ex.Right.Val = node.Val
case "contains":
ex.Op = OpContains
ex.Right.Val = node.Val
case "contained_in":
ex.Op = OpContainedIn
ex.Right.Val = node.Val
case "has_key":
ex.Op = OpHasKey
ex.Right.Val = node.Val
case "has_key_any":
ex.Op = OpHasKeyAny
ex.Right.Val = node.Val
case "has_key_all":
ex.Op = OpHasKeyAll
ex.Right.Val = node.Val
case "is_null":
ex.Op = OpIsNull
ex.Right.Val = node.Val
case "null_eq", "ndis", "not_distinct":
ex.Op = OpNotDistinct
ex.Right.Val = node.Val
case "null_neq", "dis", "distinct":
ex.Op = OpDistinct
ex.Right.Val = node.Val
default:
if node.Type == graph.NodeObj {
if len(node.Children) == 0 {
return nil, fmt.Errorf("[Where] invalid operation: %s", name)
}
ast.pushChildren(av.exp, node)
return nil, nil // skip node
}
// Support existing { column: <value> } format
switch node.Type {
case graph.NodeList:
ex.Op = OpIn
ex.Right.ValType = ValList
setListVal(ex, node)
default:
ex.Op = OpEquals
ex.Right.Val = node.Val
}
}
if ex.Op != OpAnd && ex.Op != OpOr && ex.Op != OpNot {
if ex.Right.ValType, err = getExpType(node); err != nil {
return nil, err
}
if err := setExpColName(ast.co.s, ast.ti, ex, node); err != nil {
return nil, err
}
}
return ex, nil
}
func getExpType(node *graph.Node) (ValType, error) {
switch node.Type {
case graph.NodeStr:
return ValStr, nil
case graph.NodeNum:
return ValNum, nil
case graph.NodeBool:
return ValBool, nil
case graph.NodeList:
return ValList, nil
case graph.NodeVar:
return ValVar, nil
default:
return ValNone, fmt.Errorf("[Where] invalid values for: %s", node.Name)
}
}
func setListVal(ex *Exp, node *graph.Node) {
if len(node.Children) != 0 {
switch node.Children[0].Type {
case graph.NodeStr:
ex.Right.ListType = ValStr
case graph.NodeNum:
ex.Right.ListType = ValNum
case graph.NodeBool:
ex.Right.ListType = ValBool
}
} else {
ex.Right.Val = node.Val
return
}
for i := range node.Children {
ex.Right.ListVal = append(ex.Right.ListVal, node.Children[i].Val)
}
}
func setExpColName(s *sdata.DBSchema, ti sdata.DBTable, ex *Exp, node *graph.Node) error {
var list []string
var err error
for n := node; n != nil; n = n.Parent {
// if n.Type != graph.NodeObj {
// continue
// }
if n.Name != "" {
k := n.Name
if k == "and" || k == "or" || k == "not" ||
k == "_and" || k == "_or" || k == "_not" {
continue
}
list = append([]string{k}, list...)
}
}
switch len(list) {
case 1:
if col, err := ti.GetColumn(node.Name); err == nil {
ex.Left.Col = col
} else {
return err
}
case 2:
if col, err := ti.GetColumn(list[0]); err == nil {
ex.Left.Col = col
return nil
}
fallthrough
default:
var prev, curr string
prev = ti.Name
for i := 0; i < len(list)-1; i++ {
curr = list[i]
if curr == ti.Name {
continue
// return fmt.Errorf("selector table not allowed in where: %s", ti.Name)
}
var paths []sdata.TPath
paths, err = s.FindPath(curr, prev, "")
if err == nil {
rel := sdata.PathToRel(paths[0])
ex.Joins = append(ex.Joins, Join{Rel: rel, Filter: buildFilter(rel, -1)})
prev = curr
} else {
break
}
// return graphError(err, curr, prev, "")
}
if len(ex.Joins) == 0 {
return graphError(err, curr, prev, "")
}
join := ex.Joins[len(ex.Joins)-1]
for i := len(list) - 1; i > 0; i-- {
var col sdata.DBColumn
cn := list[i]
if col, err = join.Rel.Left.Ti.GetColumn(cn); err == nil {
ex.Left.Col = col
break
}
}
}
return err
}
func (ast *aexpst) pushChildren(exp *Exp, node *graph.Node) {
var path []string
if ast.savePath && node.Name != "" {
if exp != nil {
path = append(exp.Right.Path, node.Name)
} else {
path = append(path, node.Name)
}
}
for i := range node.Children {
ast.st.Push(aexp{exp: exp, node: node.Children[i], path: path})
}
}