Coverage Report

Created: 2025-10-10 06:20

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/capstonenext/suite/fuzz/fuzz_disasm.c
Line
Count
Source
1
// the following must precede stdio (woo, thanks msft)
2
#if defined(_MSC_VER) && _MSC_VER < 1900
3
#define _CRT_SECURE_NO_WARNINGS
4
#endif
5
6
#include <stdio.h>
7
#include <stdlib.h>
8
#include <inttypes.h>
9
10
#include <capstone/capstone.h>
11
12
#include "platform.h"
13
14
int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size);
15
16
static FILE *outfile = NULL;
17
18
int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size)
19
52.9k
{
20
52.9k
  csh handle;
21
52.9k
  cs_insn *all_insn;
22
52.9k
  cs_detail *detail;
23
52.9k
  cs_err err;
24
52.9k
  unsigned int i;
25
26
52.9k
  if (Size < 1) {
27
    // 1 byte for arch choice
28
0
    return 0;
29
52.9k
  } else if (Size > 0x1000) {
30
    //limit input to 4kb
31
0
    Size = 0x1000;
32
0
  }
33
34
52.9k
  if (outfile == NULL) {
35
    // we compute the output
36
2
    outfile = fopen("/dev/null", "w");
37
2
    if (outfile == NULL) {
38
0
      return 0;
39
0
    }
40
2
  }
41
42
52.9k
  i = get_platform_entry((uint8_t)Data[0]);
43
44
52.9k
  err = cs_open(platforms[i].arch, platforms[i].mode, &handle);
45
52.9k
  if (err) {
46
8
    return 0;
47
8
  }
48
49
52.9k
  cs_option(handle, CS_OPT_DETAIL, CS_OPT_ON);
50
52.9k
  if (Data[0] & 0x80) {
51
    //hack
52
13.7k
    cs_option(handle, CS_OPT_SYNTAX, CS_OPT_SYNTAX_ATT);
53
13.7k
  }
54
55
52.9k
  uint64_t address = 0x1000;
56
52.9k
  size_t count =
57
52.9k
    cs_disasm(handle, Data + 1, Size - 1, address, 0, &all_insn);
58
59
52.9k
  if (count) {
60
51.5k
    size_t j;
61
51.5k
    unsigned int n;
62
63
2.24M
    for (j = 0; j < count; j++) {
64
2.18M
      cs_insn *insn = &(all_insn[j]);
65
2.18M
      fprintf(outfile,
66
2.18M
        "0x%" PRIx64
67
2.18M
        ":\t%s\t\t%s // insn-ID: %u, insn-mnem: %s\n",
68
2.18M
        insn->address, insn->mnemonic, insn->op_str,
69
2.18M
        insn->id, cs_insn_name(handle, insn->id));
70
71
2.18M
      detail = insn->detail;
72
73
2.18M
      if (detail->regs_read_count > 0) {
74
470k
        fprintf(outfile, "\tImplicit registers read: ");
75
1.19M
        for (n = 0; n < detail->regs_read_count; n++) {
76
724k
          fprintf(outfile, "%s ",
77
724k
            cs_reg_name(
78
724k
              handle,
79
724k
              detail->regs_read[n]));
80
724k
        }
81
470k
      }
82
83
2.18M
      if (detail->regs_write_count > 0) {
84
810k
        fprintf(outfile,
85
810k
          "\tImplicit registers modified: ");
86
1.79M
        for (n = 0; n < detail->regs_write_count; n++) {
87
980k
          fprintf(outfile, "%s ",
88
980k
            cs_reg_name(
89
980k
              handle,
90
980k
              detail->regs_write[n]));
91
980k
        }
92
810k
      }
93
94
2.18M
      if (detail->groups_count > 0) {
95
1.28M
        fprintf(outfile,
96
1.28M
          "\tThis instruction belongs to groups: ");
97
3.10M
        for (n = 0; n < detail->groups_count; n++) {
98
1.81M
          fprintf(outfile, "%s ",
99
1.81M
            cs_group_name(
100
1.81M
              handle,
101
1.81M
              detail->groups[n]));
102
1.81M
        }
103
1.28M
      }
104
2.18M
    }
105
106
51.5k
    fprintf(outfile, "0x%" PRIx64 ":\n",
107
51.5k
      all_insn[j - 1].address + all_insn[j - 1].size);
108
51.5k
    cs_free(all_insn, count);
109
51.5k
  }
110
111
52.9k
  cs_close(&handle);
112
113
52.9k
  return 0;
114
52.9k
}