forked from qmonnet/rbpf
-
Notifications
You must be signed in to change notification settings - Fork 0
/
insn_builder.rs
1562 lines (1254 loc) · 52.1 KB
/
insn_builder.rs
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
// SPDX-License-Identifier: (Apache-2.0 OR MIT)
// Copyright 2017 Alex Dukhno <alex.dukhno@icloud.com>
//! Module provides API to create eBPF programs by Rust programming language
use ebpf::*;
/// Represents single eBPF instruction
pub trait Instruction: Sized {
/// returns instruction opt code
fn opt_code_byte(&self) -> u8;
/// returns destination register
fn get_dst(&self) -> u8 {
self.get_insn().dst
}
/// returns source register
fn get_src(&self) -> u8 {
self.get_insn().src
}
/// returns offset bytes
fn get_off(&self) -> i16 {
self.get_insn().off
}
/// returns immediate value
fn get_imm(&self) -> i32 {
self.get_insn().imm
}
/// sets destination register
fn set_dst(mut self, dst: u8) -> Self {
self.get_insn_mut().dst = dst;
self
}
/// sets source register
fn set_src(mut self, src: u8) -> Self {
self.get_insn_mut().src = src;
self
}
/// sets offset bytes
fn set_off(mut self, offset: i16) -> Self {
self.get_insn_mut().off = offset;
self
}
/// sets immediate value
fn set_imm(mut self, imm: i32) -> Self {
self.get_insn_mut().imm = imm;
self
}
/// get `ebpf::Insn` struct
fn get_insn(&self) -> &Insn;
/// get mutable `ebpf::Insn` struct
fn get_insn_mut(&mut self) -> &mut Insn;
}
/// General trait for `Instruction`s and `BpfCode`.
/// Provides functionality to transform `struct` into collection of bytes
pub trait IntoBytes {
/// type of targeted transformation
type Bytes;
/// consume `Self` with transformation into `Self::Bytes`
fn into_bytes(self) -> Self::Bytes;
}
/// General implementation of `IntoBytes` for `Instruction`
impl<'i, I: Instruction> IntoBytes for &'i I {
type Bytes = Vec<u8>;
/// transform immutable reference of `Instruction` into `Vec<u8>` with size of 8
/// [ 1 byte , 1 byte , 2 bytes, 4 bytes ]
/// [ OP_CODE, SRC_REG | DST_REG, OFFSET , IMMEDIATE ]
fn into_bytes(self) -> Self::Bytes {
let buffer = vec![
self.opt_code_byte(),
self.get_src() << 4 | self.get_dst(),
self.get_off() as u8,
(self.get_off() >> 8) as u8,
self.get_imm() as u8,
(self.get_imm() >> 8) as u8,
(self.get_imm() >> 16) as u8,
(self.get_imm() >> 24) as u8,
];
buffer
}
}
/// BPF instruction stack in byte representation
#[derive(Default)]
pub struct BpfCode {
instructions: Vec<u8>
}
impl BpfCode {
/// creates new empty BPF instruction stack
pub fn new() -> Self {
BpfCode { instructions: vec![] }
}
/// create ADD instruction
pub fn add(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Add)
}
/// create SUB instruction
pub fn sub(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Sub)
}
/// create MUL instruction
pub fn mul(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Mul)
}
/// create DIV instruction
pub fn div(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Div)
}
/// create OR instruction
pub fn bit_or(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::BitOr)
}
/// create AND instruction
pub fn bit_and(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::BitAnd)
}
/// create LSHIFT instruction
pub fn left_shift(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::LShift)
}
/// create RSHIFT instruction
pub fn right_shift(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::RShift)
}
/// create NEGATE instruction
pub fn negate(&mut self, arch: Arch) -> Move {
self.mov_internal(Source::Imm, arch, OpBits::Negate)
}
/// create MOD instruction
pub fn modulo(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Mod)
}
/// create XOR instruction
pub fn bit_xor(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::BitXor)
}
/// create MOV instruction
pub fn mov(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::Mov)
}
/// create SIGNED RSHIFT instruction
pub fn signed_right_shift(&mut self, source: Source, arch: Arch) -> Move {
self.mov_internal(source, arch, OpBits::SignRShift)
}
#[inline]
fn mov_internal(&mut self, source: Source, arch_bits: Arch, op_bits: OpBits) -> Move {
Move {
bpf_code: self,
src_bit: source,
op_bits,
arch_bits,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// create byte swap instruction
pub fn swap_bytes(&mut self, endian: Endian) -> SwapBytes {
SwapBytes {
bpf_code: self,
endian,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// create LOAD instruction, IMMEDIATE is the source
pub fn load(&mut self, mem_size: MemSize) -> Load {
self.load_internal(mem_size, Addressing::Imm, BPF_LD)
}
/// create ABSOLUTE LOAD instruction
pub fn load_abs(&mut self, mem_size: MemSize) -> Load {
self.load_internal(mem_size, Addressing::Abs, BPF_LD)
}
/// create INDIRECT LOAD instruction
pub fn load_ind(&mut self, mem_size: MemSize) -> Load {
self.load_internal(mem_size, Addressing::Ind, BPF_LD)
}
/// create LOAD instruction, MEMORY is the source
pub fn load_x(&mut self, mem_size: MemSize) -> Load {
self.load_internal(mem_size, Addressing::Mem, BPF_LDX)
}
#[inline]
fn load_internal(&mut self, mem_size: MemSize, addressing: Addressing, source: u8) -> Load {
Load {
bpf_code: self,
addressing,
mem_size,
source,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// creates STORE instruction, IMMEDIATE is the source
pub fn store(&mut self, mem_size: MemSize) -> Store {
self.store_internal(mem_size, BPF_IMM)
}
/// creates STORE instruction, MEMORY is the source
pub fn store_x(&mut self, mem_size: MemSize) -> Store {
self.store_internal(mem_size, BPF_MEM | BPF_STX)
}
#[inline]
fn store_internal(&mut self, mem_size: MemSize, source: u8) -> Store {
Store {
bpf_code: self,
mem_size,
source,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// create unconditional JMP instruction
pub fn jump_unconditional(&mut self) -> Jump {
self.jump_conditional(Cond::Abs, Source::Imm)
}
/// create conditional JMP instruction
pub fn jump_conditional(&mut self, cond: Cond, src_bit: Source) -> Jump {
Jump {
bpf_code: self,
cond,
src_bit,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// create CALL instruction
pub fn call(&mut self) -> FunctionCall {
FunctionCall {
bpf_code: self,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
/// create EXIT instruction
pub fn exit(&mut self) -> Exit {
Exit {
bpf_code: self,
insn: Insn {
opc: 0x00,
dst: 0x00,
src: 0x00,
off: 0x00_00,
imm: 0x00_00_00_00
}
}
}
}
/// Transform `BpfCode` into assemble representation
impl<'a> IntoBytes for &'a BpfCode {
type Bytes = &'a [u8];
/// returns `BpfCode` instruction stack as `&[u8]`
fn into_bytes(self) -> Self::Bytes {
self.instructions.as_slice()
}
}
/// struct to represent `MOV ALU` instructions
pub struct Move<'i> {
bpf_code: &'i mut BpfCode,
src_bit: Source,
op_bits: OpBits,
arch_bits: Arch,
insn: Insn
}
impl<'i> Move<'i> {
/// push MOV instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for Move<'i> {
fn opt_code_byte(&self) -> u8 {
let op_bits = self.op_bits as u8;
let src_bit = self.src_bit as u8;
let arch_bits = self.arch_bits as u8;
op_bits | src_bit | arch_bits
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
#[derive(Copy, Clone, PartialEq, Eq)]
/// The source of ALU and JMP instructions
pub enum Source {
/// immediate field will be used as a source
Imm = BPF_IMM as isize,
/// src register will be used as a source
Reg = BPF_X as isize
}
#[derive(Copy, Clone)]
enum OpBits {
Add = BPF_ADD as isize,
Sub = BPF_SUB as isize,
Mul = BPF_MUL as isize,
Div = BPF_DIV as isize,
BitOr = BPF_OR as isize,
BitAnd = BPF_AND as isize,
LShift = BPF_LSH as isize,
RShift = BPF_RSH as isize,
Negate = BPF_NEG as isize,
Mod = BPF_MOD as isize,
BitXor = BPF_XOR as isize,
Mov = BPF_MOV as isize,
SignRShift = BPF_ARSH as isize
}
#[derive(Copy, Clone)]
/// Architecture of instructions
pub enum Arch {
/// 64-bit instructions
X64 = BPF_ALU64 as isize,
/// 32-bit instructions
X32 = BPF_ALU as isize
}
/// struct representation of byte swap operation
pub struct SwapBytes<'i> {
bpf_code: &'i mut BpfCode,
endian: Endian,
insn: Insn
}
impl<'i> SwapBytes<'i> {
/// push bytes swap instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for SwapBytes<'i> {
fn opt_code_byte(&self) -> u8 {
self.endian as u8
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
#[derive(Copy, Clone)]
/// Bytes endian
pub enum Endian {
/// Little endian
Little = LE as isize,
/// Big endian
Big = BE as isize
}
/// struct representation of LOAD instructions
pub struct Load<'i> {
bpf_code: &'i mut BpfCode,
addressing: Addressing,
mem_size: MemSize,
source: u8,
insn: Insn
}
impl<'i> Load<'i> {
/// push LOAD instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for Load<'i> {
fn opt_code_byte(&self) -> u8 {
let size = self.mem_size as u8;
let addressing = self.addressing as u8;
addressing | size | self.source
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
/// struct representation of STORE instructions
pub struct Store<'i> {
bpf_code: &'i mut BpfCode,
mem_size: MemSize,
source: u8,
insn: Insn
}
impl<'i> Store<'i> {
/// push STORE instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for Store<'i> {
fn opt_code_byte(&self) -> u8 {
let size = self.mem_size as u8;
BPF_MEM | BPF_ST | size | self.source
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
#[derive(Copy, Clone)]
/// Memory size for LOAD and STORE instructions
pub enum MemSize {
/// 8-bit size
Byte = BPF_B as isize,
/// 16-bit size
HalfWord = BPF_H as isize,
/// 32-bit size
Word = BPF_W as isize,
/// 64-bit size
DoubleWord = BPF_DW as isize
}
#[derive(Copy, Clone)]
enum Addressing {
Imm = BPF_IMM as isize,
Abs = BPF_ABS as isize,
Ind = BPF_IND as isize,
Mem = BPF_MEM as isize
}
/// struct representation of JMP instructions
pub struct Jump<'i> {
bpf_code: &'i mut BpfCode,
cond: Cond,
src_bit: Source,
insn: Insn
}
impl<'i> Jump<'i> {
/// push JMP instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for Jump<'i> {
fn opt_code_byte(&self) -> u8 {
let cmp: u8 = self.cond as u8;
let src_bit = self.src_bit as u8;
cmp | src_bit | BPF_JMP
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
#[derive(Copy, Clone, PartialEq, Eq)]
/// Conditions for JMP instructions
pub enum Cond {
/// Absolute or unconditional
Abs = BPF_JA as isize,
/// Jump if `==`
Equals = BPF_JEQ as isize,
/// Jump if `>`
Greater = BPF_JGT as isize,
/// Jump if `>=`
GreaterEquals = BPF_JGE as isize,
/// Jump if `<`
Lower = BPF_JLT as isize,
/// Jump if `<=`
LowerEquals = BPF_JLE as isize,
/// Jump if `src` & `dst`
BitAnd = BPF_JSET as isize,
/// Jump if `!=`
NotEquals = BPF_JNE as isize,
/// Jump if `>` (signed)
GreaterSigned = BPF_JSGT as isize,
/// Jump if `>=` (signed)
GreaterEqualsSigned = BPF_JSGE as isize,
/// Jump if `<` (signed)
LowerSigned = BPF_JSLT as isize,
/// Jump if `<=` (signed)
LowerEqualsSigned = BPF_JSLE as isize
}
/// struct representation of CALL instruction
pub struct FunctionCall<'i> {
bpf_code: &'i mut BpfCode,
insn: Insn
}
impl<'i> FunctionCall<'i> {
/// push CALL instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for FunctionCall<'i> {
fn opt_code_byte(&self) -> u8 {
BPF_CALL | BPF_JMP
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
/// struct representation of EXIT instruction
pub struct Exit<'i> {
bpf_code: &'i mut BpfCode,
insn: Insn
}
impl<'i> Exit<'i> {
/// push EXIT instruction into BpfCode instruction stack
pub fn push(self) -> &'i mut BpfCode {
let mut asm = self.into_bytes();
self.bpf_code.instructions.append(&mut asm);
self.bpf_code
}
}
impl<'i> Instruction for Exit<'i> {
fn opt_code_byte(&self) -> u8 {
BPF_EXIT | BPF_JMP
}
fn get_insn_mut(&mut self) -> &mut Insn {
&mut self.insn
}
fn get_insn(&self) -> &Insn {
&self.insn
}
}
#[cfg(test)]
mod tests {
#[cfg(test)]
mod special {
use super::super::*;
#[test]
fn call_immediate() {
let mut program = BpfCode::new();
program.call().set_imm(0x11_22_33_44).push();
assert_eq!(program.into_bytes(), &[0x85, 0x00, 0x00, 0x00, 0x44, 0x33, 0x22, 0x11]);
}
#[test]
fn exit_operation() {
let mut program = BpfCode::new();
program.exit().push();
assert_eq!(program.into_bytes(), &[0x95, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
}
#[cfg(test)]
mod jump_instructions {
#[cfg(test)]
mod register {
use super::super::super::*;
#[test]
fn jump_on_dst_equals_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Equals, Source::Reg).set_dst(0x01).set_src(0x02).push();
assert_eq!(program.into_bytes(), &[0x1d, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_than_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Greater, Source::Reg).set_dst(0x03).set_src(0x02).push();
assert_eq!(program.into_bytes(), &[0x2d, 0x23, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_or_equals_to_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterEquals, Source::Reg).set_dst(0x04).set_src(0x01).push();
assert_eq!(program.into_bytes(), &[0x3d, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_than_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Lower, Source::Reg).set_dst(0x03).set_src(0x02).push();
assert_eq!(program.into_bytes(), &[0xad, 0x23, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_or_equals_to_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerEquals, Source::Reg).set_dst(0x04).set_src(0x01).push();
assert_eq!(program.into_bytes(), &[0xbd, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_bit_and_with_src_not_equal_zero() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::BitAnd, Source::Reg).set_dst(0x05).set_src(0x02).push();
assert_eq!(program.into_bytes(), &[0x4d, 0x25, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_not_equals_src() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::NotEquals, Source::Reg).set_dst(0x03).set_src(0x05).push();
assert_eq!(program.into_bytes(), &[0x5d, 0x53, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_than_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterSigned, Source::Reg).set_dst(0x04).set_src(0x01).push();
assert_eq!(program.into_bytes(), &[0x6d, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_or_equals_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterEqualsSigned, Source::Reg).set_dst(0x01).set_src(0x03).push();
assert_eq!(program.into_bytes(), &[0x7d, 0x31, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_than_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerSigned, Source::Reg).set_dst(0x04).set_src(0x01).push();
assert_eq!(program.into_bytes(), &[0xcd, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_or_equals_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerEqualsSigned, Source::Reg).set_dst(0x01).set_src(0x03).push();
assert_eq!(program.into_bytes(), &[0xdd, 0x31, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
}
#[cfg(test)]
mod immediate {
use super::super::super::*;
#[test]
fn jump_to_label() {
let mut program = BpfCode::new();
program.jump_unconditional().set_off(0x00_11).push();
assert_eq!(program.into_bytes(), &[0x05, 0x00, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_equals_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Equals, Source::Imm).set_dst(0x01).set_imm(0x00_11_22_33).push();
assert_eq!(program.into_bytes(), &[0x15, 0x01, 0x00, 0x00, 0x33, 0x22, 0x11, 0x00]);
}
#[test]
fn jump_on_dst_greater_than_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Greater, Source::Imm).set_dst(0x02).set_imm(0x00_11_00_11).push();
assert_eq!(program.into_bytes(), &[0x25, 0x02, 0x00, 0x00, 0x11, 0x00, 0x11, 0x00]);
}
#[test]
fn jump_on_dst_greater_or_equals_to_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterEquals, Source::Imm).set_dst(0x04).set_imm(0x00_22_11_00).push();
assert_eq!(program.into_bytes(), &[0x35, 0x04, 0x00, 0x00, 0x00, 0x11, 0x22, 0x00]);
}
#[test]
fn jump_on_dst_lower_than_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::Lower, Source::Imm).set_dst(0x02).set_imm(0x00_11_00_11).push();
assert_eq!(program.into_bytes(), &[0xa5, 0x02, 0x00, 0x00, 0x11, 0x00, 0x11, 0x00]);
}
#[test]
fn jump_on_dst_lower_or_equals_to_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerEquals, Source::Imm).set_dst(0x04).set_imm(0x00_22_11_00).push();
assert_eq!(program.into_bytes(), &[0xb5, 0x04, 0x00, 0x00, 0x00, 0x11, 0x22, 0x00]);
}
#[test]
fn jump_on_dst_bit_and_with_const_not_equal_zero() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::BitAnd, Source::Imm).set_dst(0x05).push();
assert_eq!(program.into_bytes(), &[0x45, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_not_equals_const() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::NotEquals, Source::Imm).set_dst(0x03).push();
assert_eq!(program.into_bytes(), &[0x55, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_than_const_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterSigned, Source::Imm).set_dst(0x04).push();
assert_eq!(program.into_bytes(), &[0x65, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_greater_or_equals_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::GreaterEqualsSigned, Source::Imm).set_dst(0x01).push();
assert_eq!(program.into_bytes(), &[0x75, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_than_const_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerSigned, Source::Imm).set_dst(0x04).push();
assert_eq!(program.into_bytes(), &[0xc5, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn jump_on_dst_lower_or_equals_src_signed() {
let mut program = BpfCode::new();
program.jump_conditional(Cond::LowerEqualsSigned, Source::Imm).set_dst(0x01).push();
assert_eq!(program.into_bytes(), &[0xd5, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
}
}
#[cfg(test)]
mod store_instructions {
use super::super::*;
#[test]
fn store_word_from_dst_into_immediate_address() {
let mut program = BpfCode::new();
program.store(MemSize::Word).set_dst(0x01).set_off(0x00_11).set_imm(0x11_22_33_44).push();
assert_eq!(program.into_bytes(), &[0x62, 0x01, 0x11, 0x00, 0x44, 0x33, 0x22, 0x11]);
}
#[test]
fn store_half_word_from_dst_into_immediate_address() {
let mut program = BpfCode::new();
program.store(MemSize::HalfWord).set_dst(0x02).set_off(0x11_22).push();
assert_eq!(program.into_bytes(), &[0x6a, 0x02, 0x22, 0x11, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_byte_from_dst_into_immediate_address() {
let mut program = BpfCode::new();
program.store(MemSize::Byte).push();
assert_eq!(program.into_bytes(), &[0x72, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_double_word_from_dst_into_immediate_address() {
let mut program = BpfCode::new();
program.store(MemSize::DoubleWord).push();
assert_eq!(program.into_bytes(), &[0x7a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_word_from_dst_into_src_address() {
let mut program = BpfCode::new();
program.store_x(MemSize::Word).set_dst(0x01).set_src(0x02).push();
assert_eq!(program.into_bytes(), &[0x63, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_half_word_from_dst_into_src_address() {
let mut program = BpfCode::new();
program.store_x(MemSize::HalfWord).push();
assert_eq!(program.into_bytes(), &[0x6b, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_byte_from_dst_into_src_address() {
let mut program = BpfCode::new();
program.store_x(MemSize::Byte).push();
assert_eq!(program.into_bytes(), &[0x73, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn store_double_word_from_dst_into_src_address() {
let mut program = BpfCode::new();
program.store_x(MemSize::DoubleWord).push();
assert_eq!(program.into_bytes(), &[0x7b, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
}
#[cfg(test)]
mod load_instructions {
#[cfg(test)]
mod register {
use super::super::super::*;
#[test]
fn load_word_from_set_src_with_offset() {
let mut program = BpfCode::new();
program.load_x(MemSize::Word).set_dst(0x01).set_src(0x02).set_off(0x00_02).push();
assert_eq!(program.into_bytes(), &[0x61, 0x21, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn load_half_word_from_set_src_with_offset() {
let mut program = BpfCode::new();
program.load_x(MemSize::HalfWord).set_dst(0x02).set_src(0x01).set_off(0x11_22).push();
assert_eq!(program.into_bytes(), &[0x69, 0x12, 0x22, 0x11, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn load_byte_from_set_src_with_offset() {
let mut program = BpfCode::new();
program.load_x(MemSize::Byte).set_dst(0x01).set_src(0x04).set_off(0x00_11).push();
assert_eq!(program.into_bytes(), &[0x71, 0x41, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn load_double_word_from_set_src_with_offset() {
let mut program = BpfCode::new();
program.load_x(MemSize::DoubleWord).set_dst(0x04).set_src(0x05).set_off(0x44_55).push();
assert_eq!(program.into_bytes(), &[0x79, 0x54, 0x55, 0x44, 0x00, 0x00, 0x00, 0x00]);
}
}
#[cfg(test)]
mod immediate {
use super::super::super::*;
#[test]
fn load_double_word() {
let mut program = BpfCode::new();
program.load(MemSize::DoubleWord).set_dst(0x01).set_imm(0x00_01_02_03).push();
assert_eq!(program.into_bytes(), &[0x18, 0x01, 0x00, 0x00, 0x03, 0x02, 0x01, 0x00]);
}
#[test]
fn load_abs_word() {
let mut program = BpfCode::new();
program.load_abs(MemSize::Word).push();
assert_eq!(program.into_bytes(), &[0x20, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]
fn load_abs_half_word() {
let mut program = BpfCode::new();
program.load_abs(MemSize::HalfWord).set_dst(0x05).push();
assert_eq!(program.into_bytes(), &[0x28, 0x05, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]);
}
#[test]