-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrewrite.py
executable file
·2262 lines (2026 loc) · 67.8 KB
/
rewrite.py
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
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/python3
import os
import io
import re
import sys
import cfg
import copy
import logging
import argparse
import itertools
import tree_sitter
from enum import Enum
from dataclasses import dataclass
from collections import defaultdict
from tree_sitter import Language, Parser
from dstring import *
from tree_sitter_matching import *
C_LANGUAGE = Language('build/my-languages.so', 'c')
def is_debug():
return logging.root.getEffectiveLevel() <= logging.DEBUG
def pptree(tree):
with io.StringIO() as out:
def recur(node, lvl):
for _ in range(0, lvl):
out.write(' ')
out.write(node.type)
if node.child_count > 0:
out.write(":\n")
elif node.is_named:
out.write(f": {node.text}\n")
else:
out.write("\n")
for child in node.children:
if not child.is_named and node.type != 'binary_expression':
continue
recur(child, lvl + 1)
recur(tree, 0)
return out.getvalue()
def parse_c_string(text):
parser = Parser()
parser.set_language(C_LANGUAGE)
tree = parser.parse(bytes(text, encoding='utf8'))
return tree.root_node
#################################
##### Instructions matching #####
#################################
def text_to_int(text):
if text.startswith('0x') or text.startswith('-0x'):
return int(text, 16)
else:
return int(text)
@dataclass(frozen=True)
class Imm:
text: str
base_name: str = None
insn: bool = False
class CallMatcher:
imm_counter = 0
def __init__(self, node, pending_fixup):
node.mtype('call_expression')
self._args = iter(node['arguments'].named_children)
self._pending_fixup = pending_fixup
def _next_arg(self):
try:
return next(self._args)
except StopIteration:
raise MatchError()
def _ident(self, expected=None):
it = self._next_arg().mtype('identifier')
if expected:
it.mtext(expected)
return it.text
def ensure_args_consumed(self):
try:
next(self._args)
raise MatchError()
except StopIteration:
pass
def _regno(self):
arg = self._next_arg()
def _regno_ident():
ident = arg.mtype('identifier').text
if m := re.match(r'^BPF_REG_([0-9]+)$', ident):
return m[1]
match ident:
case 'BPF_REG_ARG1': return 1
case 'BPF_REG_ARG2': return 2
case 'BPF_REG_ARG3': return 3
case 'BPF_REG_ARG4': return 4
case 'BPF_REG_ARG5': return 5
case 'BPF_REG_CTX' : return 6
case 'BPF_REG_FP' : return 10
raise MatchError()
def _regno_number():
num = int(arg.mtype('number_literal').text)
if num < 0 or num > 10:
raise MatchError(f'Register number out of range {num}')
return num
return match_any(_regno_ident, _regno_number)
def reg(self):
return f'r{self._regno()}'
def reg32(self):
return f'w{self._regno()}'
def size(self):
arg = self._next_arg()
def _size_ident():
match arg.mtype('identifier').text:
case 'BPF_DW': return 'u64'
case 'BPF_W' : return 'u32'
case 'BPF_H' : return 'u16'
case 'BPF_B' : return 'u8'
case _: raise MatchError()
def _size_number():
match text_to_int(arg.mtype('number_literal').text):
case 0x18: return 'u64'
case 0x00: return 'u32'
case 0x08: return 'u16'
case 0x10: return 'u8'
case _: raise MatchError()
return match_any(_size_ident, _size_number)
def _intern_expr(self, node):
if node.type == 'number_literal':
return node.text
return Imm(node.text)
def expr(self):
return self._intern_expr(self._next_arg())
def number(self):
arg = self._next_arg()
text = arg.mtype('number_literal').text
return text_to_int(text)
def off(self):
arg = self._next_arg()
match arg.type:
case 'number_literal':
text = arg.text
if re.match(r'^[+-]', text):
return text[0], text[1:]
else:
return '+', text
case 'unary_expression' if arg['operator'].text in ['-', '+']:
return arg['operator'].text, Imm(arg['argument'].text)
# SHRT_MIN is special, it is defined as -32768,
# numbers are substituted literally into the asm template,
# thus leading to the following sequence:
# asm ("r0 = *(u8*)(r1 + %[shrt_min]);", [shrt_min]"i"(SHRT_MIN))
# ->
# asm ("r0 = *(u8*)(r1 + -32768);")
# which can't be parsed.
case 'identifier' if arg.text == 'SHRT_MIN':
return '', Imm(arg.text)
case _:
return '+', Imm(arg.text)
def number(self):
return text_to_int(self._next_arg().mtype('number_literal').text)
def bpf_func_ident(self):
raw_func = self._ident()
func_match = re.match(r'BPF_FUNC_(.+)', raw_func)
if not func_match:
raise MatchError(d('Strange func name {raw_func}'))
return Imm(f'bpf_{func_match[1]}')
_ATOMIC_OPS = {
'BPF_ADD': '+=',
'BPF_AND': '&=',
'BPF_OR' : '|=',
'BPF_XOR': '^='
}
_ATOMIC_FETCH_OPS = {
'BPF_ADD': 'add',
'BPF_AND': 'and',
'BPF_OR' : 'or',
'BPF_XOR': 'xor'
}
_ALU_OPS = {
'BPF_MOV': '=',
'BPF_ADD': '+=',
'BPF_SUB': '-=',
'BPF_MUL': '*=',
'BPF_DIV': '/=',
'BPF_MOD': '%%=',
'BPF_OR' : '|=',
'BPF_AND': '&=',
'BPF_LSH': '<<=',
'BPF_RSH': '>>=',
'BPF_XOR': '^=',
'BPF_ARSH': 's>>=',
}
_JMP_OPS = {
'BPF_JEQ' : '==',
'BPF_JGT' : ">",
'BPF_JGE' : ">=",
'BPF_JNE' : "!=",
'BPF_JSGT': "s>",
'BPF_JSGE': "s>=",
'BPF_JLT' : "<",
'BPF_JLE' : "<=",
'BPF_JSLT': "s<",
'BPF_JSLE': "s<=",
}
def match_dict(node, d, name):
text = node.text
if text in d:
return d[text]
raise MatchError(f'Unexpected {name}: {text}')
def atomic_op(self):
def match_fetch(node):
return CallMatcher.match_dict(
node, CallMatcher._ATOMIC_FETCH_OPS, 'atomic fetch op')
arg = self._next_arg()
if arg.type == 'binary_expression' and arg['operator'].text == '|':
if arg['left'].text == 'BPF_FETCH' and arg['right'].type == 'identifier':
return match_fetch(arg['right']), True
if arg['right'].text == 'BPF_FETCH' and arg['left'].type == 'identifier':
return match_fetch(arg['left']), True
elif arg.type == 'identifier':
return CallMatcher.match_dict(arg, CallMatcher._ATOMIC_OPS, 'atomic op'), False
raise MatchError(f'Strange atomic_op {arg}')
def alu_op(self):
op = self._ident()
if op in CallMatcher._ALU_OPS:
return CallMatcher._ALU_OPS[op]
raise MatchError(f'Unsupported ALU op: {op}')
def jmp_op(self):
op = self._ident()
if op in CallMatcher._JMP_OPS:
return CallMatcher._JMP_OPS[op]
raise MatchError(f'Unsupported JMP op: {op}')
def zero(self):
self._next_arg().mtext('0')
def one(self):
self._next_arg().mtext('1')
def jmp_call(self):
arg = self._next_arg()
arg.mtype('binary_expression')
arg['operator'].mtext('|')
arg['left'].mtext('BPF_JMP')
arg['right'].mtext('BPF_CALL')
class InsnMatchers:
def BPF_MOV64_REG(m):
dst = m.reg()
src = m.reg()
return d('{dst} = {src};', 'w')
def BPF_ALU64_IMM(m):
op = m.alu_op()
dst = m.reg()
imm = m.expr()
dst_action = 'w' if op == '=' else 'rw'
return d('{dst} {op} {imm};', dst_action)
def BPF_ALU32_IMM(m):
op = m.alu_op()
dst = m.reg32()
imm = m.expr()
dst_action = 'w' if op == '=' else 'rw'
return d('{dst} {op} {imm};', dst_action)
def BPF_ALU64_REG(m):
op = m.alu_op()
dst = m.reg()
src = m.reg()
dst_action = 'w' if op == '=' else 'rw'
return d('{dst} {op} {src};', dst_action)
def BPF_ALU32_REG(m):
op = m.alu_op()
dst = m.reg32()
src = m.reg32()
dst_action = 'w' if op == '=' else 'rw'
return d('{dst} {op} {src};', dst_action)
def BPF_ALU32_IMM___BPF_NEG(m):
m._next_arg().mtext('BPF_NEG')
dst = m.reg32()
imm = m.number()
if imm != 0:
raise MatchError(f'BPF_ALU_IMM(BPF_NEG, ...) expect imm to be zero: {imm}')
return d('{dst} = -{dst};', 'rw')
def BPF_ALU64_IMM___BPF_NEG(m):
m._next_arg().mtext('BPF_NEG')
dst = m.reg()
imm = m.number()
if imm != 0:
raise MatchError(f'BPF_ALU_IMM(BPF_NEG, ...) expect imm to be zero: {imm}')
return d('{dst} = -{dst};', 'rw')
def BPF_ALU32_REG___BPF_NEG(m):
m._next_arg().mtext('BPF_NEG')
dst = m.reg32()
src = m.reg32()
return d('{dst} = -{src};', 'w')
def BPF_ALU64_REG___BPF_NEG(m):
m._next_arg().mtext('BPF_NEG')
dst = m.reg()
src = m.reg()
return d('{dst} = -{src};', 'w')
def BPF_MOV64_IMM(m):
dst = m.reg()
imm = m.expr()
return d('{dst} = {imm};', 'w')
def BPF_MOV32_IMM(m):
dst = m.reg32()
imm = m.expr()
return d('{dst} = {imm};', 'w')
def BPF_MOV32_REG(m):
dst = m.reg32()
src = m.reg32()
return d('{dst} = {src};', 'w')
def BPF_LD_IMM64(m):
dst = m.reg()
imm = m.expr()
insn = d('{dst} = {imm} ll;', 'w')
insn.size = 2
return insn
def BPF_LDX_MEM(m):
sz = m.size()
dst = m.reg()
src = m.reg()
sign, off = m.off()
return d('{dst} = *({sz}*)({src} {sign} {off});', 'w')
def BPF_ST_MEM(m):
sz = m.size()
dst = m.reg()
sign, off = m.off()
imm = m.expr()
insn = d('*({sz}*)({dst} {sign} {off}) = {imm};', 'r')
insn.st_mem = True
return insn
def BPF_STX_MEM(m):
sz = m.size()
dst = m.reg()
src = m.reg()
sign, off = m.off()
return d('*({sz}*)({dst} {sign} {off}) = {src};', 'r')
def BPF_ATOMIC_OP(m):
sz = m.size()
op, fetch = m.atomic_op()
dst = m.reg()
match sz:
case 'u64':
src = m.reg()
case 'u32':
src = m.reg32()
case _:
raise MatchError(f'Unexpected size for atomic op: {sz}')
sign, off = m.off()
if fetch:
return d('{src} = atomic_fetch_{op}(({sz} *)({dst} {sign} {off}), {src});')
else:
return d('lock *({sz} *)({dst} {sign} {off}) {op} {src};')
def BPF_ATOMIC_OP___xchg(m):
sz = m.size()
m._ident('BPF_XCHG')
match sz:
case 'u64':
op = 'xchg_64'
dst = m.reg()
src = m.reg()
case 'u32':
op = 'xchg32_32'
dst = m.reg32()
src = m.reg32()
case _:
raise MatchError(f'Unexpected size for atomic op: {sz}')
sign, off = m.off()
return d('{src} = {op}({dst} {sign} {off}, {src});')
def BPF_ATOMIC_OP___cmpxchg(m):
sz = m.size()
m._ident('BPF_CMPXCHG')
dst = m.reg()
match sz:
case 'u64':
op = 'cmpxchg_64'
r0 = 'r0'
src = m.reg()
case 'u32':
op = 'cmpxchg32_32'
r0 = 'w0'
src = m.reg32()
case _:
raise MatchError(f'Unexpected size for atomic op: {sz}')
sign, off = m.off()
return d('{r0} = {op}({dst} {sign} {off}, {r0}, {src});')
def BPF_LD_MAP_FD(m):
if type(m._pending_fixup) == MapFixup:
dst = m.reg()
imm = m.expr()
insn = d('{dst} = {imm} ll;')
insn.size = 2
insn.dst_action = 'w'
return insn
else:
dst = m._next_arg().text
imm = m._next_arg().text
raw = Imm(f'BPF_RAW_INSN(BPF_LD | BPF_DW | BPF_IMM, {dst}, ' +
f'BPF_PSEUDO_MAP_FD, 0, {imm})',
base_name='ld_map_fd',
insn=True)
return [d('.8byte {raw};'),
d('.8byte 0;')]
def BPF_LD_ABS(m):
sz = m.size()
imm = m.expr()
return d('r0 = *({sz}*)skb[{imm}];')
def BPF_LD_IND(m):
sz = m.size()
src = m.reg()
return d('r0 = *({sz}*)skb[{src}];')
def BPF_JMP_IMM(m):
op = m.jmp_op()
dst = m.reg()
imm = m.expr()
goto = m.number()
return d('if {dst} {op} {imm} goto {goto};', 'r')
def BPF_JMP32_IMM(m):
op = m.jmp_op()
dst = m.reg32()
imm = m.expr()
goto = m.number()
return d('if {dst} {op} {imm} goto {goto};', 'r')
def BPF_JMP_REG(m):
op = m.jmp_op()
dst = m.reg()
src = m.reg()
goto = m.number()
return d('if {dst} {op} {src} goto {goto};', 'r')
def BPF_JMP32_REG(m):
op = m.jmp_op()
dst = m.reg32()
src = m.reg32()
goto = m.number()
return d('if {dst} {op} {src} goto {goto};', 'r')
def BPF_JMP_IMM___goto(m):
m._next_arg().mtype('identifier').mtext('BPF_JA')
m.zero()
m.zero()
goto = m.number()
return d('goto {goto};')
def BPF_JMP_A(m):
goto = m.number()
return d('goto {goto};')
def BPF_EXIT_INSN(m):
return d('exit;')
def BPF_CALL_REL(m):
goto = m.number()
r = d('call {goto};')
r.pseudocall = True
return r
def BPF_RAW_INSN___bpf_call(m):
m.jmp_call()
m.zero()
m.one()
m.zero()
goto = m.number()
r = d('call {goto};')
r.pseudocall = True
return r
def BPF_RAW_INSN___helper_call(m):
m.jmp_call()
m.zero()
m.zero()
m.zero()
func = m.bpf_func_ident()
return d('call {func};')
def BPF_RAW_INSN___kfunc_call(m):
m.jmp_call()
m.zero()
m._next_arg().mtype('identifier').mtext('BPF_PSEUDO_KFUNC_CALL')
m.zero()
m.zero()
if type(m._pending_fixup) != KFuncFixup:
raise MatchError(f'Expecting pending kfunc fixup')
imm = Imm(m._pending_fixup.kfunc)
return d('call {imm};')
# BPF_RAW_INSN(BPF_STX | BPF_ATOMIC | BPF_DW, BPF_REG_10, BPF_REG_0, -8, BPF_ADD),
def BPF_RAW_INSN___atomic_inc_store(m):
# TODO: more elaborate match here
m._next_arg().mtext('BPF_STX | BPF_ATOMIC | BPF_DW')
sz = 'u64'
dst = m.reg()
src = m.reg()
sign, off = m.off()
op, fetch = m.atomic_op()
if fetch:
return d('{src} = atomic_fetch_{op}(({sz} *)({dst} {sign} {off}), {src});')
else:
return d('lock *({sz} *)({dst} {sign} {off}) {op} {src};')
def BPF_EMIT_CALL(m):
func = m.bpf_func_ident()
return d('call {func};')
def BPF_ENDIAN(m):
kind = m._ident()
match kind:
case 'BPF_TO_LE' | 'BPF_FROM_LE':
pfx = 'le'
case 'BPF_TO_BE' | 'BPF_FROM_BE':
pfx = 'be'
case _:
raise MatchError(f'Unexpected endian kind: {kind}')
dst = m.reg()
sz = m.number()
if sz not in [16, 32, 64]:
raise MatchError(f'Unexpected endian size: {sz}')
op = f'{pfx}{sz}'
return d('{dst} = {op} {dst};', 'rw')
def BPF_SK_LOOKUP(m):
func = m._ident()
func = Imm(f'bpf_{func}')
insn = d('BPF_SK_LOOKUP({func})')
insn.vars['imm1'] = Imm('sizeof(struct bpf_sock_tuple)')
insn.size = 13
insn.macro = 'BPF_SK_LOOKUP'
insn.call_like = True
return insn
def func_matchers_map():
func_matchers = defaultdict(list)
for name, fn in InsnMatchers.__dict__.items():
if not callable(fn):
continue
func_name_match = re.match(r'^(BPF_.+?)(?:___.+)?$', name)
if not func_name_match:
continue
func_name = func_name_match[1]
func_matchers[func_name].append(fn)
return defaultdict(tuple, func_matchers)
FUNC_MATCHERS = func_matchers_map()
EIGHT_BYTE_INSNS = set(
['BPF_ALU64_IMM', 'BPF_ALU32_IMM', 'BPF_ALU64_REG', 'BPF_ALU32_REG',
'BPF_MOV64_IMM', 'BPF_MOV32_IMM', 'BPF_MOV64_REG', 'BPF_MOV32_REG',
'BPF_JMP_IMM' , 'BPF_JMP32_IMM', 'BPF_JMP_REG' , 'BPF_JMP32_REG',
'BPF_JMP_A' , 'BPF_EXIT_INSN', 'BPF_EMIT_CALL', 'BPF_CALL_REL' ,
'BPF_LDX_MEM' , 'BPF_ST_MEM' , 'BPF_STX_MEM' , 'BPF_ATOMIC_OP',
'BPF_LD_ABS' , 'BPF_LD_IND' , 'BPF_RAW_INSN'
])
@dataclass
class MapFixup:
pass
@dataclass
class KFuncFixup:
kfunc: str
def convert_insn(call_node, pending_fixup):
errors = []
node_func_name = call_node['function'].text
for fn in FUNC_MATCHERS[node_func_name]:
m = CallMatcher(call_node, pending_fixup)
try:
result = fn(m)
m.ensure_args_consumed()
return result
except MatchError as e:
if is_debug():
errors.append((fn, e))
if node_func_name in EIGHT_BYTE_INSNS:
imm_base_name = re.sub(r'^BPF_', '', node_func_name).lower()
imm = Imm(call_node.text, base_name=imm_base_name, insn=True)
return d('.8byte {imm};')
text = call_node.text.replace('\n', ' ')
logging.warning(f"Can't convert {text}")
if is_debug():
with io.StringIO() as msg:
msg.write("\n")
msg.write("Errors:\n")
for fn, e in errors:
msg.write(f" {fn.__name__:<30}: {e}\n")
msg.write(f"Parse tree:\n")
msg.write(pptree(call_node))
logging.debug(msg.getvalue())
return d('NOT CONVERTED: {text}')
#################################
##### Test case matching #####
#################################
def convert_int_list(node):
node.mtype('initializer_list')
ints = []
for item in node.mtype('initializer_list').named_children:
ints.append(int(item.mtype('number_literal').text))
return ints
SEC_BY_PROG_TYPE = {
'BPF_PROG_TYPE_CGROUP_SKB' : 'cgroup/skb',
'BPF_PROG_TYPE_CGROUP_SOCK' : 'cgroup/sock',
# 'BPF_PROG_TYPE_CGROUP_SOCK_ADDR': '',
'BPF_PROG_TYPE_CGROUP_SYSCTL' : 'cgroup/sysctl',
'BPF_PROG_TYPE_KPROBE' : 'kprobe',
'BPF_PROG_TYPE_LSM' : 'lsm',
'BPF_PROG_TYPE_LWT_IN' : 'lwt_in',
'BPF_PROG_TYPE_LWT_OUT' : 'lwt_out',
'BPF_PROG_TYPE_LWT_XMIT' : 'lwt_xmit',
'BPF_PROG_TYPE_PERF_EVENT' : 'perf_event',
'BPF_PROG_TYPE_RAW_TRACEPOINT' : 'raw_tracepoint',
'BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE': 'raw_tracepoint.w',
'BPF_PROG_TYPE_SCHED_ACT' : 'action',
'BPF_PROG_TYPE_SCHED_CLS' : 'tc',
'BPF_PROG_TYPE_SK_LOOKUP' : 'sk_lookup',
'BPF_PROG_TYPE_SK_MSG' : 'sk_msg',
'BPF_PROG_TYPE_SK_REUSEPORT' : 'sk_reuseport',
'BPF_PROG_TYPE_SK_SKB' : 'sk_skb',
'BPF_PROG_TYPE_SOCKET_FILTER' : 'socket',
'BPF_PROG_TYPE_SOCK_OPS' : 'sockops',
'BPF_PROG_TYPE_TRACEPOINT' : 'tracepoint',
# TODO: 'BPF_PROG_TYPE_TRACING': '',
'BPF_PROG_TYPE_XDP' : 'xdp',
}
@dataclass
class SecInfo:
base_name: str
may_sleep: bool = False
need_kfunc: bool = False
SEC_BY_PROG_AND_ATTACH_TYPE = {
('BPF_PROG_TYPE_CGROUP_SOCK_ADDR', 'BPF_CGROUP_INET4_CONNECT' ): SecInfo("cgroup/connect4"),
('BPF_PROG_TYPE_CGROUP_SOCK' , 'BPF_CGROUP_INET4_POST_BIND'): SecInfo("cgroup/post_bind4"),
('BPF_PROG_TYPE_CGROUP_SOCKOPT' , 'BPF_CGROUP_SETSOCKOPT' ): SecInfo("cgroup/setsockopt"),
('BPF_PROG_TYPE_CGROUP_SOCK_ADDR', 'BPF_CGROUP_UDP6_SENDMSG' ): SecInfo("cgroup/sendmsg6"),
('BPF_PROG_TYPE_SK_LOOKUP' , 'BPF_SK_LOOKUP' ): SecInfo("sk_lookup"),
('BPF_PROG_TYPE_LSM' , 'BPF_LSM_MAC' ): SecInfo("lsm" , True, True),
('BPF_PROG_TYPE_TRACING' , 'BPF_MODIFY_RETURN' ): SecInfo("fmod_ret", True, True),
('BPF_PROG_TYPE_TRACING' , 'BPF_TRACE_FENTRY' ): SecInfo("fentry" , True, True),
('BPF_PROG_TYPE_TRACING' , 'BPF_TRACE_ITER' ): SecInfo("iter" , True, True),
('BPF_PROG_TYPE_TRACING' , 'BPF_TRACE_RAW_TP' ): SecInfo("tp_btf" , False, True),
}
class Verdict(Enum):
ACCEPT = 1
REJECT = 2
VERBOSE_ACCEPT = 3
class CommentsDict(dict):
def __missing__(self, key):
return None
class TestInfo:
def __init__(self):
self.name = None
self.func_name = None
self.insns = []
self.map_fixups = {}
self.prog_fixups = {}
self.result = Verdict.REJECT
self.result_unpriv = None
self.errstr = None
self.errstr_unpriv = None
self.retval = None
self.retval_unpriv = None
self.flags = []
self.prog_type = None
self.imms = {}
self.kfunc_pairs = {}
self.comments = CommentsDict()
self.sleepable = False
self.expected_attach_type = None
self.kfunc = None
self.sec = None
self.insn_processed = None
self.dont_run = False
def parse_test_result(node, field_name):
match node.text:
case 'ACCEPT':
return Verdict.ACCEPT
case 'VERBOSE_ACCEPT':
return Verdict.VERBOSE_ACCEPT
case 'REJECT':
return Verdict.REJECT
case _:
logging.warning(f"Unsupported '{field_name}' value '{value.text}'")
return None
def merge_comment_nodes(nodes):
last_line = None
with io.StringIO() as out:
for n in nodes:
if last_line and last_line != n.start_point[0]:
out.write('\n')
else:
out.write(' ')
out.write(n.text)
last_line = n.end_point[0]
return out.getvalue()
def convert_insn_list(insns_to_convert, map_locations, kfunc_locations):
insn_comments = []
insns = []
for insn in insns_to_convert:
if insn.type == 'comment':
insn_comments.append(insn)
else:
idx = len(insns)
if idx in map_locations:
pending_fixup = MapFixup()
elif kfunc := kfunc_locations.get(idx, None):
pending_fixup = KFuncFixup(kfunc)
else:
pending_fixup = None
converted = convert_insn(insn, pending_fixup)
if type(converted) != list:
converted = [converted]
converted[0].comment = merge_comment_nodes(insn_comments)
for cinsn in converted:
insns.append(cinsn)
if sz := getattr(cinsn, 'size', 1):
for _ in range(0, sz-1):
dummy = DString('__dummy__', {})
dummy.dummy = True
insns.append(dummy)
insn_comments = []
if len(insns) > 0:
insns[-1].after_comment = merge_comment_nodes(insn_comments)
elif len(insn_comments) > 0:
logging.warning(f'Dropping trailing comments {insn_comments} at {value}')
return insns
def parse_kfunc_pairs(initializer_list):
result = defaultdict(list)
for pair in initializer_list.named_children:
name = pair[0].mtype('string_literal').text.strip('"')
idx = int(pair[1].mtype('number_literal').text)
result[name].append(idx)
return dict(result)
def parse_flags(text):
sleepable = False
flag = None
match text:
case 'BPF_F_SLEEPABLE':
sleepable = True
case 'F_LOAD_WITH_STRICT_ALIGNMENT':
flag = 'BPF_F_STRICT_ALIGNMENT'
case 'F_NEEDS_EFFICIENT_UNALIGNED_ACCESS':
flag = 'BPF_F_ANY_ALIGNMENT'
case 'BPF_F_TEST_STATE_FREQ':
flag = text
case _:
logging.warning(f'Unsupported .flag: {text}')
return flag, sleepable
def match_test_info(node):
node.mtype('initializer_list')
elems = iter(node.named_children)
info = TestInfo()
pending_comments = []
insns_to_convert = []
while True:
node = mnext(elems)
match node.type:
case 'comment':
pending_comments.append(node)
case 'string_literal':
info.name = node.text
info.comments['name'] = merge_comment_nodes(pending_comments)
pending_comments = []
break
case _:
raise MatchError(f'Expecting comment or string literal at {node}')
while True:
pair = next(elems, None)
if pair is None:
break
if pair.type == 'comment':
pending_comments.append(pair)
continue
pair.mtype('initializer_pair')
field = pair['designator'][0].mtype('field_identifier').text
value = pair['value']
info.comments[field] = merge_comment_nodes(pending_comments)
pending_comments = []
# print(f' field={field} value={value}')
match field:
case 'insns':
insns_to_convert = value.mtype('initializer_list').named_children
case 'errstr':
info.errstr = value.text
case 'errstr_unpriv':
info.errstr_unpriv = value.text
case 'result':
info.result = parse_test_result(value, 'result')
case 'result_unpriv':
info.result_unpriv = parse_test_result(value, 'result_unpriv')
case map_fixup if (map_name := map_fixup.removeprefix('fixup_')) in MAPS:
info.map_fixups[map_name] = convert_int_list(value)
case 'fixup_prog1':
info.prog_fixups['map_prog1'] = convert_int_list(value)
case 'fixup_prog2':
info.prog_fixups['map_prog2'] = convert_int_list(value)
case 'flags':
text = value.mtype('identifier').text
flag, sleepable = parse_flags(text)
if flag:
info.flags = [flag]
info.sleepable = sleepable
case 'prog_type':
info.prog_type = value.mtype('identifier').text
case 'retval':
info.retval = value.text
case 'retval_unpriv':
info.retval_unpriv = value.text
case 'fixup_kfunc_btf_id':
info.kfunc_pairs = parse_kfunc_pairs(value.mtype('initializer_list'))
case 'expected_attach_type':
info.expected_attach_type = value.mtype('identifier').text
case 'kfunc':
info.kfunc = value.mtype('string_literal').text.strip('"')
case 'insn_processed':
info.insn_processed = value.text
case 'runs' if value.text == '-1':
info.dont_run = True
case _:
logging.warning(f"Unsupported field '{field}' at {pair.start_point}:" +
f" {value.text}")
info.sec = convert_prog_type(info)
map_locations = set()
for locations in info.map_fixups.values():
map_locations |= set(locations)
for locations in info.prog_fixups.values():
map_locations |= set(locations)
kfunc_locations = {}
for kfunc, locations in info.kfunc_pairs.items():
for loc in locations:
kfunc_locations[loc] = kfunc
info.insns = convert_insn_list(insns_to_convert, map_locations, kfunc_locations)
if pending_comments:
logging.warning(f'Dropping pending comments {pending_comments}')
return info
#################################
##### Instructions patching #####
#################################
def patch_ld_map_fd(text, map_name, test_name):
if 'imm' in text.vars:
text.vars['imm'] = Imm(f'&{map_name}')
else:
logging.warning(f'Unexpected insn to patch: {text} {map_name} {test_name}')
return text
def replace_st_mem(insns):
live_regs_map = cfg.compute_live_regs(insns)
index_remap = []
new_insns = []
new_idx = 0
#cfg.cfg_to_text(sys.stderr, cfg.build_cfg(insns), live_regs_map)
for old_idx, insn in enumerate(insns):
index_remap.append(len(new_insns))
live_regs = live_regs_map[old_idx]
if insn.st_mem and len(live_regs) < 9:
free_reg = next(filter(lambda r: r not in live_regs, range(0, 10)))
sz = insn.vars['sz']
dst = insn.vars['dst']
sign = insn.vars['sign']
off = insn.vars['off']
imm = insn.vars['imm']
src = f'r{free_reg}' # TODO: should this be 'w' ?
fst_insn = d('{src} = {imm};')
snd_insn = d('*({sz}*)({dst} {sign} {off}) = {src};')
if comment := getattr(insn, 'comment', None):
fst_insn.comment = comment
if comment := getattr(insn, 'after_comment', None):
snd_insn.after_comment = comment
new_insns.append(fst_insn)
new_insns.append(snd_insn)
else:
new_insns.append(insn)
if insn.st_mem:
logging.warn(f"Can't infer free register for ST_MEM at {old_idx}")
for old_idx, insn in enumerate(insns):
if 'goto' not in insn.vars:
continue
old_target = old_idx + insn.vars['goto'] + 1
new_idx = index_remap[old_idx]
if old_target < 0:
new_target = old_target
elif old_target >= len(insns):
new_target = len(new_insns) + old_target - len(insns)
else:
new_target = index_remap[old_target]
insn.vars['goto'] = new_target - new_idx - 1
return new_insns
def insert_labels(insns, options):
targets = {}
# long labels are used for testing
counter = options.label_start
for i, insn in enumerate(insns):
if isinstance(insn, str):
print((i, insn))
#print(f'{str(insn)}, {insn.template} {insn.vars}')
if 'goto' not in insn.vars:
continue
target = i + insn.vars['goto'] + 1
if target > len(insns) or target < 0:
continue
if target not in targets:
targets[target] = f'l{counter}_%='
counter += 1
insn.vars['goto'] = targets[target]
new_insns = []
for i, insn in enumerate(insns):
if i in targets:
new_insns.append(DString(f'{targets[i]}:', {}))
new_insns.append(insn)
if after_end_label := targets.get(len(insns), None):
new_insns.append(DString(f'{after_end_label}:', {}))
return new_insns
KNOWN_IMM_MACRO_DEFS= set(['INT_MIN', 'LLONG_MIN',
'SHRT_MIN', 'SHRT_MAX',
'MAX_ENTRIES', 'EINVAL'])
def guess_imm_basename(imm):
if imm.base_name:
return imm.base_name, False
text = imm.text
if text in KNOWN_IMM_MACRO_DEFS:
return text.lower(), False