Coverage Report

Created: 2026-08-31 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/capstonev5/arch/BPF/BPFInstPrinter.c
Line
Count
Source
1
/* Capstone Disassembly Engine */
2
/* BPF Backend by david942j <david942j@gmail.com>, 2019 */
3
4
#include <capstone/platform.h>
5
6
#include "BPFConstants.h"
7
#include "BPFInstPrinter.h"
8
#include "BPFMapping.h"
9
10
static cs_bpf_op *expand_bpf_operands(cs_bpf *bpf)
11
24.5k
{
12
  /* assert(bpf->op_count < 3); */
13
24.5k
  return &bpf->operands[bpf->op_count++];
14
24.5k
}
15
16
static void push_op_reg(cs_bpf *bpf, bpf_op_type val, uint8_t ac_mode)
17
8.93k
{
18
8.93k
  cs_bpf_op *op = expand_bpf_operands(bpf);
19
20
8.93k
  op->type = BPF_OP_REG;
21
8.93k
  op->reg = val;
22
8.93k
  op->access = ac_mode;
23
8.93k
}
24
25
static void push_op_imm(cs_bpf *bpf, uint64_t val)
26
6.11k
{
27
6.11k
  cs_bpf_op *op = expand_bpf_operands(bpf);
28
29
6.11k
  op->type = BPF_OP_IMM;
30
6.11k
  op->imm = val;
31
6.11k
}
32
33
static void push_op_off(cs_bpf *bpf, uint32_t val)
34
3.04k
{
35
3.04k
  cs_bpf_op *op = expand_bpf_operands(bpf);
36
37
3.04k
  op->type = BPF_OP_OFF;
38
3.04k
  op->off = val;
39
3.04k
}
40
41
static void push_op_mem(cs_bpf *bpf, bpf_reg reg, uint32_t val)
42
5.26k
{
43
5.26k
  cs_bpf_op *op = expand_bpf_operands(bpf);
44
45
5.26k
  op->type = BPF_OP_MEM;
46
5.26k
  op->mem.base = reg;
47
5.26k
  op->mem.disp = val;
48
5.26k
}
49
50
static void push_op_mmem(cs_bpf *bpf, uint32_t val)
51
741
{
52
741
  cs_bpf_op *op = expand_bpf_operands(bpf);
53
54
741
  op->type = BPF_OP_MMEM;
55
741
  op->mmem = val;
56
741
}
57
58
static void push_op_msh(cs_bpf *bpf, uint32_t val)
59
238
{
60
238
  cs_bpf_op *op = expand_bpf_operands(bpf);
61
62
238
  op->type = BPF_OP_MSH;
63
238
  op->msh = val;
64
238
}
65
66
static void push_op_ext(cs_bpf *bpf, bpf_ext_type val)
67
209
{
68
209
  cs_bpf_op *op = expand_bpf_operands(bpf);
69
70
209
  op->type = BPF_OP_EXT;
71
209
  op->ext = val;
72
209
}
73
74
static void convert_operands(MCInst *MI, cs_bpf *bpf)
75
16.0k
{
76
16.0k
  unsigned opcode = MCInst_getOpcode(MI);
77
16.0k
  unsigned mc_op_count = MCInst_getNumOperands(MI);
78
16.0k
  MCOperand *op;
79
16.0k
  MCOperand *op2;
80
16.0k
  unsigned i;
81
82
16.0k
  bpf->op_count = 0;
83
16.0k
  if (BPF_CLASS(opcode) == BPF_CLASS_LD || BPF_CLASS(opcode) == BPF_CLASS_LDX) {
84
6.00k
    switch (BPF_MODE(opcode)) {
85
1.49k
    case BPF_MODE_IMM:
86
1.49k
      if (EBPF_MODE(MI->csh)) {
87
538
        push_op_reg(bpf, MCOperand_getReg(MCInst_getOperand(MI, 0)), CS_AC_WRITE);
88
538
        push_op_imm(bpf, MCOperand_getImm(MCInst_getOperand(MI, 1)));
89
953
      } else {
90
953
        push_op_imm(bpf, MCOperand_getImm(MCInst_getOperand(MI, 0)));
91
953
      }
92
1.49k
      break;
93
1.70k
    case BPF_MODE_ABS:
94
1.70k
      op = MCInst_getOperand(MI, 0);
95
1.70k
      push_op_mem(bpf, BPF_REG_INVALID, (uint32_t)MCOperand_getImm(op));
96
1.70k
      break;
97
1.07k
    case BPF_MODE_IND:
98
1.07k
      op = MCInst_getOperand(MI, 0);
99
1.07k
      op2 = MCInst_getOperand(MI, 1);
100
1.07k
      push_op_mem(bpf, MCOperand_getReg(op), (uint32_t)MCOperand_getImm(op2));
101
1.07k
      break;
102
1.28k
    case BPF_MODE_MEM:
103
1.28k
      if (EBPF_MODE(MI->csh)) {
104
        /* ldx{w,h,b,dw} dst, [src+off] */
105
1.17k
        push_op_reg(bpf, MCOperand_getReg(MCInst_getOperand(MI, 0)), CS_AC_WRITE);
106
1.17k
        op = MCInst_getOperand(MI, 1);
107
1.17k
        op2 = MCInst_getOperand(MI, 2);
108
1.17k
        push_op_mem(bpf, MCOperand_getReg(op), (uint32_t)MCOperand_getImm(op2));
109
1.17k
      }
110
108
      else {
111
108
        push_op_mmem(bpf, (uint32_t)MCOperand_getImm(MCInst_getOperand(MI, 0)));
112
108
      }
113
1.28k
      break;
114
209
    case BPF_MODE_LEN:
115
209
      push_op_ext(bpf, BPF_EXT_LEN);
116
209
      break;
117
238
    case BPF_MODE_MSH:
118
238
      op = MCInst_getOperand(MI, 0);
119
238
      push_op_msh(bpf, (uint32_t)MCOperand_getImm(op));
120
238
      break;
121
    /* case BPF_MODE_XADD: // not exists */
122
6.00k
    }
123
6.00k
    return;
124
6.00k
  }
125
10.0k
  if (BPF_CLASS(opcode) == BPF_CLASS_ST || BPF_CLASS(opcode) == BPF_CLASS_STX) {
126
1.93k
    if (!EBPF_MODE(MI->csh)) {
127
      // cBPF has only one case - st* M[k]
128
633
      push_op_mmem(bpf, (uint32_t)MCOperand_getImm(MCInst_getOperand(MI, 0)));
129
633
      return;
130
633
    }
131
    /* eBPF has two cases:
132
     * - st [dst + off], src
133
     * - xadd [dst + off], src
134
     * they have same form of operands.
135
     */
136
1.30k
    op = MCInst_getOperand(MI, 0);
137
1.30k
    op2 = MCInst_getOperand(MI, 1);
138
1.30k
    push_op_mem(bpf, MCOperand_getReg(op), (uint32_t)MCOperand_getImm(op2));
139
1.30k
    op = MCInst_getOperand(MI, 2);
140
1.30k
    if (MCOperand_isImm(op))
141
471
      push_op_imm(bpf, MCOperand_getImm(op));
142
835
    else if (MCOperand_isReg(op))
143
835
      push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ);
144
1.30k
    return;
145
1.93k
  }
146
147
8.13k
  if (BPF_CLASS(opcode) == BPF_CLASS_JMP) {
148
9.45k
    for (i = 0; i < mc_op_count; i++) {
149
6.54k
      op = MCInst_getOperand(MI, i);
150
6.54k
      if (MCOperand_isImm(op)) {
151
        /* decide the imm is BPF_OP_IMM or BPF_OP_OFF type here */
152
        /*
153
         * 1. ja +off
154
         * 2. j {x,k}, +jt, +jf // cBPF
155
         * 3. j dst_reg, {src_reg, k}, +off // eBPF
156
         */
157
4.61k
        if (BPF_OP(opcode) == BPF_JUMP_JA ||
158
4.12k
            (!EBPF_MODE(MI->csh) && i >= 1) ||
159
2.85k
            (EBPF_MODE(MI->csh) && i == 2))
160
3.04k
          push_op_off(bpf, (uint32_t)MCOperand_getImm(op));
161
1.57k
        else
162
1.57k
          push_op_imm(bpf, MCOperand_getImm(op));
163
4.61k
      }
164
1.93k
      else if (MCOperand_isReg(op)) {
165
1.93k
        push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ);
166
1.93k
      }
167
6.54k
    }
168
2.91k
    return;
169
2.91k
  }
170
171
5.22k
  if (!EBPF_MODE(MI->csh)) {
172
    /* In cBPF mode, all registers in operands are accessed as read */
173
4.17k
    for (i = 0; i < mc_op_count; i++) {
174
1.82k
      op = MCInst_getOperand(MI, i);
175
1.82k
      if (MCOperand_isImm(op))
176
606
        push_op_imm(bpf, MCOperand_getImm(op));
177
1.22k
      else if (MCOperand_isReg(op))
178
1.22k
        push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ);
179
1.82k
    }
180
2.34k
    return;
181
2.34k
  }
182
183
  /* remain cases are: eBPF mode && ALU */
184
  /* if (BPF_CLASS(opcode) == BPF_CLASS_ALU || BPF_CLASS(opcode) == BPF_CLASS_ALU64) */
185
186
  /* We have three types:
187
   * 1. {l,b}e dst               // dst = byteswap(dst)
188
   * 2. neg dst                  // dst = -dst
189
   * 3. <op> dst, {src_reg, imm} // dst = dst <op> src
190
   * so we can simply check the number of operands,
191
   * exactly one operand means we are in case 1. and 2.,
192
   * otherwise in case 3.
193
   */
194
2.87k
  if (mc_op_count == 1) {
195
544
    op = MCInst_getOperand(MI, 0);
196
544
    push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ | CS_AC_WRITE);
197
544
  }
198
2.33k
  else { // if (mc_op_count == 2)
199
2.33k
    op = MCInst_getOperand(MI, 0);
200
2.33k
    push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ | CS_AC_WRITE);
201
202
2.33k
    op = MCInst_getOperand(MI, 1);
203
2.33k
    if (MCOperand_isImm(op))
204
1.97k
      push_op_imm(bpf, MCOperand_getImm(op));
205
362
    else if (MCOperand_isReg(op))
206
362
      push_op_reg(bpf, MCOperand_getReg(op), CS_AC_READ);
207
2.33k
  }
208
2.87k
}
209
210
static void print_operand(MCInst *MI, struct SStream *O, const cs_bpf_op *op)
211
24.5k
{
212
24.5k
  switch (op->type) {
213
0
  case BPF_OP_INVALID:
214
0
    SStream_concat(O, "invalid");
215
0
    break;
216
8.93k
  case BPF_OP_REG:
217
8.93k
    SStream_concat(O, BPF_reg_name((csh)MI->csh, op->reg));
218
8.93k
    break;
219
6.11k
  case BPF_OP_IMM:
220
6.11k
    SStream_concat(O, "0x%" PRIx64, op->imm);
221
6.11k
    break;
222
3.04k
  case BPF_OP_OFF:
223
3.04k
    SStream_concat(O, "+0x%x", op->off);
224
3.04k
    break;
225
5.26k
  case BPF_OP_MEM:
226
5.26k
    SStream_concat(O, "[");
227
5.26k
    if (op->mem.base != BPF_REG_INVALID)
228
3.55k
      SStream_concat(O, BPF_reg_name((csh)MI->csh, op->mem.base));
229
5.26k
    if (op->mem.disp != 0) {
230
5.17k
      if (op->mem.base != BPF_REG_INVALID)
231
3.53k
        SStream_concat(O, "+");
232
5.17k
      SStream_concat(O, "0x%x", op->mem.disp);
233
5.17k
    }
234
5.26k
    if (op->mem.base == BPF_REG_INVALID && op->mem.disp == 0) // special case
235
75
      SStream_concat(O, "0x0");
236
5.26k
    SStream_concat(O, "]");
237
5.26k
    break;
238
741
  case BPF_OP_MMEM:
239
741
    SStream_concat(O, "m[0x%x]", op->mmem);
240
741
    break;
241
238
  case BPF_OP_MSH:
242
238
    SStream_concat(O, "4*([0x%x]&0xf)", op->msh);
243
238
    break;
244
209
  case BPF_OP_EXT:
245
209
    switch (op->ext) {
246
209
    case BPF_EXT_LEN:
247
209
      SStream_concat(O, "#len");
248
209
      break;
249
209
    }
250
209
    break;
251
24.5k
  }
252
24.5k
}
253
254
/*
255
 * 1. human readable mnemonic
256
 * 2. set pubOpcode (BPF_INSN_*)
257
 * 3. set detail->bpf.operands
258
 * */
259
void BPF_printInst(MCInst *MI, struct SStream *O, void *PrinterInfo)
260
16.0k
{
261
16.0k
  int i;
262
16.0k
  cs_insn insn;
263
16.0k
  cs_bpf bpf;
264
265
16.0k
  insn.detail = NULL;
266
  /* set pubOpcode as instruction id */
267
16.0k
  BPF_get_insn_id((cs_struct*)MI->csh, &insn, MCInst_getOpcode(MI));
268
16.0k
  MCInst_setOpcodePub(MI, insn.id);
269
270
16.0k
  SStream_concat(O, BPF_insn_name((csh)MI->csh, insn.id));
271
16.0k
  convert_operands(MI, &bpf);
272
40.6k
  for (i = 0; i < bpf.op_count; i++) {
273
24.5k
    if (i == 0)
274
15.3k
      SStream_concat(O, "\t");
275
9.18k
    else
276
9.18k
      SStream_concat(O, ", ");
277
24.5k
    print_operand(MI, O, &bpf.operands[i]);
278
24.5k
  }
279
280
16.0k
#ifndef CAPSTONE_DIET
281
16.0k
  if (MI->flat_insn->detail) {
282
16.0k
    MI->flat_insn->detail->bpf = bpf;
283
16.0k
  }
284
16.0k
#endif
285
16.0k
}