-
Notifications
You must be signed in to change notification settings - Fork 22
/
compiler_encode.go
272 lines (240 loc) · 7.86 KB
/
compiler_encode.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
/*
* Copyright 2022 ByteDance Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package encoder
import (
`github.com/cloudwego/frugal/internal/atm/abi`
`github.com/cloudwego/frugal/internal/binary/defs`
)
func (self Compiler) compile(p *Program, sp int, vt *defs.Type, maxpc int) {
rt := vt.S
tt := vt.T
/* check for loops, recursive only on structs with inlining depth limit */
if tt == defs.T_struct && (self[rt] || p.pc() >= maxpc || sp >= defs.MaxNesting) {
p.rtt(OP_defer, rt)
return
}
/* compile the type recursively */
self[rt] = true
self.compileOne(p, sp, vt, maxpc)
delete(self, rt)
}
func (self Compiler) compileOne(p *Program, sp int, vt *defs.Type, maxpc int) {
switch vt.T {
case defs.T_bool : p.i64(OP_size_check, 1); p.i64(OP_sint, 1)
case defs.T_i8 : p.i64(OP_size_check, 1); p.i64(OP_sint, 1)
case defs.T_i16 : p.i64(OP_size_check, 2); p.i64(OP_sint, 2)
case defs.T_i32 : p.i64(OP_size_check, 4); p.i64(OP_sint, 4)
case defs.T_i64 : p.i64(OP_size_check, 8); p.i64(OP_sint, 8)
case defs.T_enum : p.i64(OP_size_check, 4); p.i64(OP_sint, 4)
case defs.T_double : p.i64(OP_size_check, 8); p.i64(OP_sint, 8)
case defs.T_string : p.i64(OP_size_check, 4); p.i64(OP_length, abi.PtrSize); p.dyn(OP_memcpy_be, abi.PtrSize, 1)
case defs.T_binary : p.i64(OP_size_check, 4); p.i64(OP_length, abi.PtrSize); p.dyn(OP_memcpy_be, abi.PtrSize, 1)
case defs.T_map : self.compileMap(p, sp, vt, maxpc)
case defs.T_set : self.compileSeq(p, sp, vt, maxpc, true)
case defs.T_list : self.compileSeq(p, sp, vt, maxpc, false)
case defs.T_struct : self.compileStruct(p, sp, vt, maxpc)
case defs.T_pointer : self.compilePtr(p, sp, vt, maxpc)
default : panic("unreachable")
}
}
func (self Compiler) compilePtr(p *Program, sp int, vt *defs.Type, maxpc int) {
i := p.pc()
p.tag(sp)
p.add(OP_if_nil)
p.add(OP_make_state)
p.add(OP_deref)
self.compile(p, sp + 1, vt.V, maxpc)
p.add(OP_drop_state)
p.pin(i)
}
func (self Compiler) compileMap(p *Program, sp int, vt *defs.Type, maxpc int) {
kt := vt.K
et := vt.V
/* 6-byte map header */
p.tag(sp)
p.i64(OP_size_check, 6)
p.i64(OP_byte, int64(kt.Tag()))
p.i64(OP_byte, int64(et.Tag()))
/* check for nil maps */
i := p.pc()
p.add(OP_if_nil)
/* encode the map */
p.add(OP_map_len)
j := p.pc()
p.add(OP_map_if_empty)
p.add(OP_make_state)
p.rtt(OP_map_begin, vt.S)
k := p.pc()
p.add(OP_map_key)
self.compile(p, sp + 1, kt, maxpc)
p.add(OP_map_value)
self.compile(p, sp + 1, et, maxpc)
p.add(OP_map_next)
p.jmp(OP_map_if_next, k)
p.add(OP_drop_state)
/* encode the length for nil maps */
r := p.pc()
p.add(OP_goto)
p.pin(i)
p.i64(OP_long, 0)
p.pin(j)
p.pin(r)
}
func (self Compiler) compileSeq(p *Program, sp int, vt *defs.Type, maxpc int, verifyUnique bool) {
nb := -1
et := vt.V
/* 5-byte set or list header */
p.tag(sp)
p.i64(OP_size_check, 5)
p.i64(OP_byte, int64(et.Tag()))
p.i64(OP_length, abi.PtrSize)
/* check for nil slice */
i := p.pc()
p.add(OP_if_nil)
/* special case of primitive sets or lists */
switch et.T {
case defs.T_bool : nb = 1
case defs.T_i8 : nb = 1
case defs.T_i16 : nb = 2
case defs.T_i32 : nb = 4
case defs.T_i64 : nb = 8
case defs.T_double : nb = 8
}
/* check for uniqueness if needed */
if verifyUnique {
p.rtt(OP_unique, et.S)
}
/* check if this is the special case */
if nb != -1 {
p.dyn(OP_memcpy_be, abi.PtrSize, int64(nb))
p.pin(i)
return
}
/* complex sets or lists */
j := p.pc()
p.add(OP_list_if_empty)
p.add(OP_make_state)
p.add(OP_list_begin)
k := p.pc()
p.add(OP_goto)
r := p.pc()
p.i64(OP_seek, int64(et.S.Size()))
p.pin(k)
self.compile(p, sp + 1, et, maxpc)
p.add(OP_list_decr)
p.jmp(OP_list_if_next, r)
p.add(OP_drop_state)
p.pin(i)
p.pin(j)
}
func (self Compiler) compileStruct(p *Program, sp int, vt *defs.Type, maxpc int) {
var off int
var err error
var fvs []defs.Field
/* resolve the field */
if fvs, err = defs.ResolveFields(vt.S); err != nil {
panic(err)
}
/* compile every field */
for _, fv := range fvs {
p.tag(sp)
p.i64(OP_seek, int64(fv.F - off))
self.compileStructField(p, sp + 1, fv, maxpc)
off = fv.F
}
/* add the STOP field */
p.i64(OP_size_check, 1)
p.i64(OP_byte, 0)
}
func (self Compiler) compileStructField(p *Program, sp int, fv defs.Field, maxpc int) {
switch fv.Type.T {
default: {
panic("fatal: invalid field type: " + fv.Type.String())
}
/* non-pointer types */
case defs.T_bool : fallthrough
case defs.T_i8 : fallthrough
case defs.T_double : fallthrough
case defs.T_i16 : fallthrough
case defs.T_i32 : fallthrough
case defs.T_i64 : fallthrough
case defs.T_string : fallthrough
case defs.T_struct : fallthrough
case defs.T_enum : fallthrough
case defs.T_binary : self.compileStructRequired(p, sp, fv, maxpc)
/* sequencial types */
case defs.T_map : fallthrough
case defs.T_set : fallthrough
case defs.T_list : {
if fv.Spec != defs.Optional {
self.compileStructRequired(p, sp, fv, maxpc)
} else {
self.compileStructIterable(p, sp, fv, maxpc)
}
}
/* pointers */
case defs.T_pointer: {
if fv.Spec == defs.Optional {
self.compileStructOptional(p, sp, fv, maxpc)
} else if fv.Type.V.T == defs.T_struct {
self.compileStructPointer(p, sp, fv, maxpc)
} else {
panic("fatal: non-optional non-struct pointers")
}
}
}
}
func (self Compiler) compileStructPointer(p *Program, sp int, fv defs.Field, maxpc int) {
i := p.pc()
p.add(OP_if_nil)
self.compileStructFieldBegin(p, fv, 4)
p.add(OP_make_state)
p.add(OP_deref)
self.compile(p, sp + 1, fv.Type.V, maxpc)
p.add(OP_drop_state)
j := p.pc()
p.add(OP_goto)
p.pin(i)
self.compileStructFieldBegin(p, fv, 4)
p.i64(OP_byte, 0)
p.pin(j)
}
func (self Compiler) compileStructOptional(p *Program, sp int, fv defs.Field, maxpc int) {
i := p.pc()
p.add(OP_if_nil)
self.compileStructFieldBegin(p, fv, 3)
p.add(OP_make_state)
p.add(OP_deref)
self.compile(p, sp + 1, fv.Type.V, maxpc)
p.add(OP_drop_state)
p.pin(i)
}
func (self Compiler) compileStructRequired(p *Program, sp int, fv defs.Field, maxpc int) {
self.compileStructFieldBegin(p, fv, 3)
self.compile(p, sp, fv.Type, maxpc)
}
func (self Compiler) compileStructIterable(p *Program, sp int, fv defs.Field, maxpc int) {
i := p.pc()
p.add(OP_if_nil)
self.compileStructFieldBegin(p, fv, 3)
self.compile(p, sp, fv.Type, maxpc)
p.pin(i)
}
func (self Compiler) compileStructFieldBegin(p *Program, fv defs.Field, nb int64) {
p.i64(OP_size_check, nb)
p.i64(OP_byte, int64(fv.Type.Tag()))
p.i64(OP_word, int64(fv.ID))
}