/
visitor.go
203 lines (178 loc) Β· 5.28 KB
/
visitor.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
package runtime
import (
"fmt"
"reflect"
"github.com/cloudson/gitql/parser"
"github.com/cloudson/gitql/utilities"
)
func (v *RuntimeVisitor) Visit(n *parser.NodeProgram) error {
return v.VisitSelect(n.Child.(*parser.NodeSelect))
}
func (v *RuntimeVisitor) VisitSelect(n *parser.NodeSelect) error {
if builder.isProxyTable(n.Tables[0]) {
proxyTableName := n.Tables[0]
// refactor tree
proxy := builder.proxyTables[proxyTableName]
if n.Count {
// do nothing
} else if !n.WildCard {
err := testAllFieldsFromTable(n.Fields, proxyTableName)
if err != nil {
return err
}
} else {
n.Fields = builder.possibleTables[proxyTableName]
n.WildCard = false
}
err := testAllFieldsInExpr(n.Where, proxyTableName)
if err != nil {
return err
}
n.Tables[0] = proxy.table
var from, to string
for from, to = range proxy.fields {
break
}
oldWhere := n.Where
where := new(parser.NodeAnd)
condition := new(parser.NodeEqual)
conditionL := new(parser.NodeId)
conditionL.SetValue(from)
conditionR := new(parser.NodeLiteral)
conditionR.SetValue(to)
condition.SetLeftValue(conditionL)
condition.SetRightValue(conditionR)
where.SetLeftValue(condition)
where.SetRightValue(oldWhere)
n.Where = where
}
table := n.Tables[0]
var err error
err = builder.WithTable(table, table)
if err != nil {
return err
}
if n.Count {
n.Fields = []string{COUNT_FIELD_NAME}
}else{
err = testAllFieldsFromTable(n.Fields, table)
}
return err
// Why not visit expression right now ?
// Because we will, at first, discover the current object
}
func testAllFieldsInExpr(expr parser.NodeExpr, tableName string) error {
var err error
if expr != nil {
switch expr.(type) {
case *parser.NodeAnd, *parser.NodeOr:
err = testAllFieldsInExpr(expr.LeftValue(), tableName)
if err == nil {
return testAllFieldsInExpr(expr.RightValue(), tableName)
}
case *parser.NodeEqual, *parser.NodeNotEqual, *parser.NodeGreater, *parser.NodeSmaller, *parser.NodeIn:
return testAllFieldsInExpr(expr.LeftValue(), tableName)
case *parser.NodeId:
field := expr.(*parser.NodeId).Value()
if !utilities.IsFieldPresentInArray(builder.possibleTables[tableName], field) {
return fmt.Errorf("Table '%s' has not field '%s'", tableName, field)
}
}
}
return err
}
func testAllFieldsFromTable(fields []string, table string) error {
for _, f := range fields {
err := builder.UseFieldFromTable(f, table)
if err != nil {
return err
}
}
return nil
}
func (v *RuntimeVisitor) VisitExpr(n parser.NodeExpr) error {
switch reflect.TypeOf(n) {
case reflect.TypeOf(new(parser.NodeEqual)):
g := n.(*parser.NodeEqual)
return v.VisitEqual(g)
case reflect.TypeOf(new(parser.NodeGreater)):
g := n.(*parser.NodeGreater)
return v.VisitGreater(g)
case reflect.TypeOf(new(parser.NodeSmaller)):
g := n.(*parser.NodeSmaller)
return v.VisitSmaller(g)
case reflect.TypeOf(new(parser.NodeOr)):
g := n.(*parser.NodeOr)
return v.VisitOr(g)
case reflect.TypeOf(new(parser.NodeAnd)):
g := n.(*parser.NodeAnd)
return v.VisitAnd(g)
case reflect.TypeOf(new(parser.NodeIn)):
g := n.(*parser.NodeIn)
return v.VisitIn(g)
case reflect.TypeOf(new(parser.NodeLike)):
g := n.(*parser.NodeLike)
return v.VisitLike(g)
case reflect.TypeOf(new(parser.NodeNotEqual)):
g := n.(*parser.NodeNotEqual)
return v.VisitNotEqual(g)
}
return nil
}
func (v *RuntimeVisitor) VisitEqual(n *parser.NodeEqual) error {
lvalue := n.LeftValue().(*parser.NodeId).Value()
rvalue := n.RightValue().(*parser.NodeLiteral).Value()
boolRegister = n.Assertion(metadata(lvalue), rvalue)
return nil
}
func (v *RuntimeVisitor) VisitLike(n *parser.NodeLike) error {
lvalue := n.LeftValue().(*parser.NodeId).Value()
rvalue := n.RightValue().(*parser.NodeLiteral).Value()
boolRegister = n.Assertion(metadata(lvalue), rvalue)
return nil
}
func (v *RuntimeVisitor) VisitNotEqual(n *parser.NodeNotEqual) error {
lvalue := n.LeftValue().(*parser.NodeId).Value()
rvalue := n.RightValue().(*parser.NodeLiteral).Value()
boolRegister = n.Assertion(metadata(lvalue), rvalue)
return nil
}
func (v *RuntimeVisitor) VisitGreater(n *parser.NodeGreater) error {
lvalue := n.LeftValue().(*parser.NodeId).Value()
lvalue = metadata(lvalue)
rvalue := n.RightValue().(*parser.NodeLiteral).Value()
boolRegister = n.Assertion(lvalue, rvalue)
return nil
}
func (v *RuntimeVisitor) VisitSmaller(n *parser.NodeSmaller) error {
lvalue := n.LeftValue().(*parser.NodeId).Value()
lvalue = metadata(lvalue)
rvalue := n.RightValue().(*parser.NodeLiteral).Value()
boolRegister = n.Assertion(lvalue, rvalue)
return nil
}
func (v *RuntimeVisitor) VisitOr(n *parser.NodeOr) error {
v.VisitExpr(n.LeftValue())
boolLeft := boolRegister
v.VisitExpr(n.RightValue())
boolRight := boolRegister
boolRegister = boolLeft || boolRight
return nil
}
func (v *RuntimeVisitor) VisitAnd(n *parser.NodeAnd) error {
v.VisitExpr(n.LeftValue())
boolLeft := boolRegister
v.VisitExpr(n.RightValue())
boolRight := boolRegister
boolRegister = boolLeft && boolRight
return nil
}
func (v *RuntimeVisitor) VisitIn(n *parser.NodeIn) error {
lvalue := n.LeftValue().(*parser.NodeLiteral).Value()
rvalue := n.RightValue().(*parser.NodeId).Value()
boolRegister = n.Assertion(lvalue, metadata(rvalue))
return nil
}
func (v *RuntimeVisitor) Builder() *GitBuilder {
return nil
}