Repository navigation
Expand file tree
/
Copy pathparser.go
More file actions
554 lines (519 loc) · 15.7 KB
/
Copy pathparser.go
File metadata and controls
554 lines (519 loc) · 15.7 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
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
package plan9asm
import (
"bufio"
"fmt"
"strconv"
"strings"
)
// File is a parsed Plan 9 asm source file (subset).
type File struct {
Arch Arch
Funcs []Func
// Data and Globl capture a minimal subset of the Plan 9 DATA/GLOBL directives
// used by some stdlib asm (e.g. hash/crc32/crc32_amd64.s).
//
// These are emitted as LLVM globals by the translator so loads like:
// MOVOA r2r1<>+0(SB), X0
// can be translated without relying on an overlay/alt package.
Data []DataStmt
Globl []GloblStmt
}
type Func struct {
// Sym is the symbol name from the TEXT directive with (SB) trimmed.
// It may contain the Plan 9 middle dot (·).
Sym string
// FrameSize and ArgSize retain the numeric $frame-args values from TEXT.
// WebAssembly's Go ABI uses FrameSize to address FP operands through the
// linear-memory stack and to restore SP on return. A missing -args suffix
// leaves ArgSize at zero.
FrameSize int64
ArgSize int64
Instrs []Instr
}
// Parse parses a subset of Go/Plan 9 assembly syntax.
//
// Currently supported:
// - TEXT directives (function start)
// - MOVQ/ADDQ/SUBQ/XORQ/MOVL, CPUID, XGETBV, BYTE, RET
// - Operands: immediate ($imm), register (AX/BX/CX/DX), and name+off(FP)
//
// Also supported at a minimal level:
// - #include is ignored
// - #define NAME <body> with optional single-line continuation via '\' and
// macro invocation when the entire statement is just NAME.
func Parse(arch Arch, src string) (*File, error) {
f := &File{Arch: arch}
pp, err := preprocess(src)
if err != nil {
return nil, err
}
sc := bufio.NewScanner(strings.NewReader(pp))
lineno := 0
var cur *Func
for sc.Scan() {
lineno++
line := strings.TrimSpace(sc.Text())
if line == "" {
continue
}
for _, stmt := range splitSemicolons(line) {
if stmt == "" {
continue
}
if strings.HasSuffix(stmt, ":") {
if cur == nil {
return nil, fmt.Errorf("line %d: label outside TEXT: %q", lineno, stmt)
}
lbl := strings.TrimSpace(strings.TrimSuffix(stmt, ":"))
if lbl == "" {
return nil, fmt.Errorf("line %d: empty label: %q", lineno, stmt)
}
cur.Instrs = append(cur.Instrs, Instr{
Op: OpLABEL,
Args: []Operand{{Kind: OpLabel, Sym: lbl}},
Raw: stmt,
})
continue
}
// Support "label: INSTR ..." on one statement.
if c := strings.IndexByte(stmt, ':'); c >= 0 {
left := strings.TrimSpace(stmt[:c])
right := strings.TrimSpace(stmt[c+1:])
if left != "" && right != "" && !strings.ContainsAny(left, " \t") {
if cur == nil {
return nil, fmt.Errorf("line %d: label outside TEXT: %q", lineno, stmt)
}
cur.Instrs = append(cur.Instrs, Instr{
Op: OpLABEL,
Args: []Operand{{Kind: OpLabel, Sym: left}},
Raw: left + ":",
})
stmt = right
}
}
opStr, rest := splitOpcode(stmt)
op := Op(strings.ToUpper(opStr))
if arch == ArchWASM {
// Go's wasm assembler distinguishes low-level WebAssembly Call
// and Return from the high-level Go ABI CALL and RET pseudos by
// spelling. Preserve that distinction after normalization.
switch opStr {
case "Call":
op = "WASMCALL"
case "Return":
op = "WASMRETURN"
}
}
switch op {
case OpTEXT:
// TEXT name(SB), flags, $frame-args
parts := strings.Split(rest, ",")
if len(parts) < 1 {
return nil, fmt.Errorf("line %d: invalid TEXT: %q", lineno, stmt)
}
sym := strings.TrimSpace(parts[0])
if !strings.HasSuffix(sym, "(SB)") {
return nil, fmt.Errorf("line %d: TEXT symbol must end with (SB): %q", lineno, sym)
}
sym = strings.TrimSpace(strings.TrimSuffix(sym, "(SB)"))
if sym == "" {
return nil, fmt.Errorf("line %d: empty TEXT symbol: %q", lineno, stmt)
}
frameSize, argSize, err := parseTEXTFrame(parts)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
f.Funcs = append(f.Funcs, Func{Sym: sym, FrameSize: frameSize, ArgSize: argSize})
cur = &f.Funcs[len(f.Funcs)-1]
cur.Instrs = append(cur.Instrs, Instr{Op: OpTEXT, Raw: stmt})
continue
case "DATA":
// Be permissive: some stdlib asm emits DATA while parser still
// tracks the previous TEXT as current.
ds, err := parseDATAStmt(arch, rest)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
f.Data = append(f.Data, ds)
continue
case "GLOBL":
// Be permissive: some stdlib asm emits data symbols while parser
// still tracks the previous TEXT as current.
gs, err := parseGLOBLStmt(rest)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
f.Globl = append(f.Globl, gs)
continue
case OpCPUID, OpXGETBV:
if cur == nil {
return nil, fmt.Errorf("line %d: %s outside TEXT: %q", lineno, op, stmt)
}
if strings.TrimSpace(rest) != "" {
return nil, fmt.Errorf("line %d: %s takes no operands: %q", lineno, op, stmt)
}
cur.Instrs = append(cur.Instrs, Instr{Op: op, Raw: stmt})
continue
case OpBYTE, OpWORD:
if cur == nil {
return nil, fmt.Errorf("line %d: %s outside TEXT: %q", lineno, op, stmt)
}
args, err := parseOperandsCSV(arch, op, rest)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
if len(args) != 1 || args[0].Kind != OpImm {
return nil, fmt.Errorf("line %d: %s expects single immediate operand: %q", lineno, op, stmt)
}
cur.Instrs = append(cur.Instrs, Instr{Op: op, Args: args, Raw: stmt})
continue
case OpRET:
if cur == nil {
return nil, fmt.Errorf("line %d: RET outside TEXT: %q", lineno, stmt)
}
if strings.TrimSpace(rest) != "" {
// A symbol operand is a tail call; register operands retain the
// architecture-specific return behavior.
args, err := parseOperandsCSV(arch, op, rest)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
cur.Instrs = append(cur.Instrs, Instr{Op: op, Args: args, Raw: stmt})
continue
}
cur.Instrs = append(cur.Instrs, Instr{Op: OpRET, Raw: stmt})
continue
default:
if cur == nil {
return nil, fmt.Errorf("line %d: instruction outside TEXT: %q", lineno, stmt)
}
// For now, parse unknown opcodes as generic instructions. The translator
// is responsible for rejecting unsupported ones.
args, err := parseOperandsCSV(arch, op, rest)
if err != nil {
return nil, fmt.Errorf("line %d: %v", lineno, err)
}
cur.Instrs = append(cur.Instrs, Instr{Op: op, Args: args, Raw: stmt})
continue
}
}
}
if err := sc.Err(); err != nil {
return nil, err
}
if len(f.Funcs) == 0 && len(f.Data) == 0 && len(f.Globl) == 0 {
return nil, fmt.Errorf("no TEXT directive found")
}
return f, nil
}
func parseTEXTFrame(parts []string) (frameSize, argSize int64, err error) {
if len(parts) < 2 {
return 0, 0, nil
}
spec := strings.TrimSpace(parts[len(parts)-1])
if !strings.HasPrefix(spec, "$") {
return 0, 0, nil
}
spec = strings.TrimSpace(strings.TrimPrefix(spec, "$"))
frameText, argText := spec, ""
if i := strings.LastIndex(spec, "-"); i > 0 {
frameText, argText = strings.TrimSpace(spec[:i]), strings.TrimSpace(spec[i+1:])
}
frame, ok := parseImmExpr(frameText)
if !ok {
return 0, 0, fmt.Errorf("unresolved TEXT frame size %q", frameText)
}
if argText == "" {
return int64(frame), 0, nil
}
args, ok := parseImmExpr(argText)
if !ok {
return 0, 0, fmt.Errorf("unresolved TEXT argument size %q", argText)
}
return int64(frame), int64(args), nil
}
func parseDATAStmt(arch Arch, rest string) (DataStmt, error) {
// DATA sym+off(SB)/width, $value
lhs, rhs, ok := strings.Cut(rest, ",")
if !ok {
return DataStmt{}, fmt.Errorf("invalid DATA: %q", "DATA "+rest)
}
lhs = strings.TrimSpace(lhs)
rhs = strings.TrimSpace(rhs)
if lhs == "" || rhs == "" {
return DataStmt{}, fmt.Errorf("invalid DATA: %q", "DATA "+rest)
}
// lhs: sym+off(SB)/width
symPart, widthStr, ok := strings.Cut(lhs, "/")
if !ok {
return DataStmt{}, fmt.Errorf("DATA missing /width: %q", "DATA "+rest)
}
width, err := parseWidth(arch, widthStr)
if err != nil || width <= 0 {
return DataStmt{}, fmt.Errorf("DATA invalid width %q: %q", widthStr, "DATA "+rest)
}
symPart = strings.TrimSpace(symPart)
if !strings.HasSuffix(symPart, "(SB)") {
return DataStmt{}, fmt.Errorf("DATA symbol must end with (SB): %q", "DATA "+rest)
}
symPart = strings.TrimSuffix(symPart, "(SB)")
symPart = strings.TrimSpace(symPart)
if symPart == "" {
return DataStmt{}, fmt.Errorf("DATA empty symbol: %q", "DATA "+rest)
}
sym, off := splitSymPlusOff(symPart)
val, ok := parseImm(rhs)
var payload []byte
var addr string
if !ok {
trimRHS := strings.TrimSpace(rhs)
if strings.HasPrefix(trimRHS, "$\"") {
str, err := strconv.Unquote(strings.TrimPrefix(trimRHS, "$"))
if err == nil && int64(len(str)) <= width {
payload = []byte(str)
ok = true
}
}
}
if !ok {
// Accept symbol-address initializers (e.g. $runtime·main(SB)) even when
// relocation details are not modeled; encode as zero placeholder.
if strings.HasPrefix(strings.TrimSpace(rhs), "$") {
if sym, symOK := parseSym(strings.TrimPrefix(strings.TrimSpace(rhs), "$")); symOK {
addr = sym
val = 0
ok = true
}
}
}
if !ok {
return DataStmt{}, fmt.Errorf("DATA invalid immediate %q: %q", rhs, "DATA "+rest)
}
return DataStmt{Sym: sym, Off: off, Width: width, Value: uint64(val), Payload: payload, Addr: addr}, nil
}
func parseWidth(arch Arch, s string) (int64, error) {
s = strings.TrimSpace(s)
switch strings.ToUpper(s) {
case "PTRSIZE":
switch arch {
case ArchAMD64, ArchARM64, ArchWASM:
return 8, nil
default:
return 4, nil
}
}
return parseInt(s)
}
func parseGLOBLStmt(rest string) (GloblStmt, error) {
// GLOBL sym(SB), flags, $size
parts := strings.Split(rest, ",")
if len(parts) != 3 {
return GloblStmt{}, fmt.Errorf("invalid GLOBL: %q", "GLOBL "+rest)
}
symPart := strings.TrimSpace(parts[0])
flags := strings.TrimSpace(parts[1])
sizePart := strings.TrimSpace(parts[2])
if !strings.HasSuffix(symPart, "(SB)") {
return GloblStmt{}, fmt.Errorf("GLOBL symbol must end with (SB): %q", "GLOBL "+rest)
}
sym := strings.TrimSpace(strings.TrimSuffix(symPart, "(SB)"))
if sym == "" {
return GloblStmt{}, fmt.Errorf("GLOBL empty symbol: %q", "GLOBL "+rest)
}
sz, ok := parseImm(sizePart)
if (!ok || sz < 0) && strings.HasPrefix(sizePart, "$(") && strings.HasSuffix(sizePart, ")") {
// Some platform asm uses symbolic struct-size macros in GLOBL sizes
// (e.g. $(machTimebaseInfo__size)). We don't evaluate include-time
// macros here, so keep a conservative non-zero placeholder size.
sz, ok = 64, true
}
if !ok || sz < 0 {
return GloblStmt{}, fmt.Errorf("GLOBL invalid size %q: %q", sizePart, "GLOBL "+rest)
}
return GloblStmt{Sym: sym, Flags: flags, Size: int64(sz)}, nil
}
func splitSymPlusOff(s string) (sym string, off int64) {
// Best-effort parse for forms like:
// name+0
// name-8
// If offset parsing fails, treat the entire string as a symbol name.
s = strings.TrimSpace(s)
if s == "" {
return "", 0
}
// Prefer the last '+' or '-' as the separator.
sep := strings.LastIndexAny(s, "+-")
if sep <= 0 || sep == len(s)-1 {
return s, 0
}
n, err := parseInt(s[sep:])
if err != nil {
return s, 0
}
return strings.TrimSpace(s[:sep]), n
}
func parseInt(s string) (int64, error) {
s = strings.TrimSpace(s)
if s == "" {
return 0, fmt.Errorf("empty int")
}
// Accept 0x... too.
return strconv.ParseInt(s, 0, 64)
}
func parseOperandsCSV(arch Arch, op Op, s string) ([]Operand, error) {
if s == "" {
return nil, nil
}
parts := splitTopLevelCSV(s)
out := make([]Operand, 0, len(parts))
for _, part := range parts {
part = strings.TrimSpace(part)
if part == "" {
continue
}
legacy := []string{part}
if arch == ArchAMD64 && op == "SHLL" {
legacy = splitLegacyColonOperand(part)
}
for _, item := range legacy {
op, err := parseOperandForArch(arch, item)
if err != nil {
return nil, err
}
out = append(out, op)
}
}
// Direct branches treat a bare token as a label even when it also looks like
// an architecture register (for example amd64 JL V1 and ARM BEQ X7 in Go
// 1.23's math/big assembly). Indirect branch and call opcodes stay outside
// this rule because their bare register operands are meaningful.
if branchRegisterTokenIsLabel(arch, op) && len(out) == 1 && out[0].Kind == OpReg {
out[0] = Operand{Kind: OpIdent, Ident: strings.TrimSpace(s)}
}
return out, nil
}
func parseOperandForArch(arch Arch, s string) (Operand, error) {
if arch == ArchWASM {
if reg, ok := parseWASMReg(s); ok {
return Operand{Kind: OpReg, Reg: reg}, nil
}
if !strings.HasPrefix(strings.TrimSpace(s), "$") {
if mem, matched, err := parseWASMMem(s); matched {
if err != nil {
return Operand{}, err
}
return Operand{Kind: OpMem, Mem: mem}, nil
}
}
}
return parseOperand(s)
}
func parseWASMMem(s string) (mem MemRef, matched bool, err error) {
s = strings.TrimSpace(s)
open := strings.LastIndexByte(s, '(')
if open < 0 || !strings.HasSuffix(s, ")") {
return MemRef{}, false, nil
}
base, ok := parseWASMReg(strings.TrimSpace(s[open+1 : len(s)-1]))
if !ok {
return MemRef{}, false, nil
}
offset := strings.TrimSpace(s[:open])
if offset == "" {
return MemRef{Base: base}, true, nil
}
if n, parseErr := strconv.ParseInt(offset, 0, 64); parseErr == nil {
return MemRef{Base: base, Off: n}, true, nil
}
if n, ok := parseImmExpr(offset); ok {
return MemRef{Base: base, Off: int64(n)}, true, nil
}
return MemRef{Base: base, OffRaw: offset}, true, nil
}
var wasmRegisterPrefixes = [...]struct {
name string
max int
}{
{name: "R", max: 15},
{name: "F", max: 31},
{name: "V", max: 15},
}
func parseWASMReg(s string) (Reg, bool) {
name := strings.TrimSpace(s)
upper := strings.ToUpper(name)
switch upper {
case "SP", "CTXT", "G", "RET0", "RET1", "RET2", "RET3", "PAUSE", "PC_B":
return Reg(upper), true
}
for _, prefix := range wasmRegisterPrefixes {
if !strings.HasPrefix(upper, prefix.name) {
continue
}
n, err := strconv.Atoi(strings.TrimPrefix(upper, prefix.name))
if err == nil && 0 <= n && n <= prefix.max {
return Reg(upper), true
}
}
return "", false
}
func branchRegisterTokenIsLabel(arch Arch, op Op) bool {
name := normalizeInstructionOpcode(op)
switch arch {
case ArchAMD64:
return (strings.HasPrefix(name, "J") && name != "JMP") || strings.HasPrefix(name, "LOOP")
case ArchARM:
return isARMBranchOpcode(name) && name != "BL" && name != "BX" && name != "BLX" && name != "RET"
case ArchARM64:
return isARM64BranchOpcode(name) && name != "BL" && name != "BR" && name != "BLR" && name != "RET" && name != "ERET"
default:
return false
}
}
// Go's x86 assembler retains an old three-operand spelling where left:right
// means right, left. For example R11:AX in SHLL CX, R11:AX is equivalent to
// SHLL CX, AX, R11. Keep this in the parser so official assembler testdata can
// describe the canonical three-operand form.
func splitLegacyColonOperand(s string) []string {
par := 0
brk := 0
for i := 0; i < len(s); i++ {
switch s[i] {
case '(':
par++
case ')':
if par > 0 {
par--
}
case '[':
brk++
case ']':
if brk > 0 {
brk--
}
case ':':
if par == 0 && brk == 0 {
left := strings.TrimSpace(s[:i])
right := strings.TrimSpace(s[i+1:])
if left != "" && right != "" {
return []string{right, left}
}
}
}
}
return []string{s}
}
func splitOpcode(stmt string) (op, rest string) {
opEnd := strings.IndexAny(stmt, " \t")
if opEnd < 0 {
return stmt, ""
}
return strings.TrimSpace(stmt[:opEnd]), strings.TrimSpace(stmt[opEnd:])
}
func splitSemicolons(line string) []string {
parts := strings.Split(line, ";")
out := make([]string, 0, len(parts))
for _, p := range parts {
out = append(out, strings.TrimSpace(p))
}
return out
}