/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 | 90.2k | { |
20 | 90.2k | csh handle; |
21 | 90.2k | cs_insn *all_insn; |
22 | 90.2k | cs_detail *detail; |
23 | 90.2k | cs_err err; |
24 | 90.2k | unsigned int i; |
25 | | |
26 | 90.2k | if (Size < 1) { |
27 | | // 1 byte for arch choice |
28 | 0 | return 0; |
29 | 90.2k | } else if (Size > 0x1000) { |
30 | | //limit input to 4kb |
31 | 0 | Size = 0x1000; |
32 | 0 | } |
33 | | |
34 | 90.2k | 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 | 90.2k | i = get_platform_entry((uint8_t)Data[0]); |
43 | | |
44 | 90.2k | err = cs_open(platforms[i].arch, platforms[i].mode, &handle); |
45 | 90.2k | if (err) { |
46 | 8 | return 0; |
47 | 8 | } |
48 | | |
49 | 90.2k | cs_option(handle, CS_OPT_DETAIL, CS_OPT_ON); |
50 | 90.2k | if (Data[0] & 0x80) { |
51 | | //hack |
52 | 22.2k | cs_option(handle, CS_OPT_SYNTAX, CS_OPT_SYNTAX_ATT); |
53 | 22.2k | } |
54 | | |
55 | 90.2k | uint64_t address = 0x1000; |
56 | 90.2k | size_t count = |
57 | 90.2k | cs_disasm(handle, Data + 1, Size - 1, address, 0, &all_insn); |
58 | | |
59 | 90.2k | if (count) { |
60 | 88.2k | size_t j; |
61 | 88.2k | unsigned int n; |
62 | | |
63 | 5.07M | for (j = 0; j < count; j++) { |
64 | 4.98M | cs_insn *insn = &(all_insn[j]); |
65 | 4.98M | fprintf(outfile, |
66 | 4.98M | "0x%" PRIx64 |
67 | 4.98M | ":\t%s\t\t%s // insn-ID: %u, insn-mnem: %s\n", |
68 | 4.98M | insn->address, insn->mnemonic, insn->op_str, |
69 | 4.98M | insn->id, cs_insn_name(handle, insn->id)); |
70 | | |
71 | 4.98M | detail = insn->detail; |
72 | | |
73 | 4.98M | if (detail->regs_read_count > 0) { |
74 | 1.14M | fprintf(outfile, "\tImplicit registers read: "); |
75 | 2.95M | for (n = 0; n < detail->regs_read_count; n++) { |
76 | 1.80M | fprintf(outfile, "%s ", |
77 | 1.80M | cs_reg_name( |
78 | 1.80M | handle, |
79 | 1.80M | detail->regs_read[n])); |
80 | 1.80M | } |
81 | 1.14M | } |
82 | | |
83 | 4.98M | if (detail->regs_write_count > 0) { |
84 | 1.97M | fprintf(outfile, |
85 | 1.97M | "\tImplicit registers modified: "); |
86 | 4.36M | for (n = 0; n < detail->regs_write_count; n++) { |
87 | 2.39M | fprintf(outfile, "%s ", |
88 | 2.39M | cs_reg_name( |
89 | 2.39M | handle, |
90 | 2.39M | detail->regs_write[n])); |
91 | 2.39M | } |
92 | 1.97M | } |
93 | | |
94 | 4.98M | if (detail->groups_count > 0) { |
95 | 2.82M | fprintf(outfile, |
96 | 2.82M | "\tThis instruction belongs to groups: "); |
97 | 6.97M | for (n = 0; n < detail->groups_count; n++) { |
98 | 4.15M | fprintf(outfile, "%s ", |
99 | 4.15M | cs_group_name( |
100 | 4.15M | handle, |
101 | 4.15M | detail->groups[n])); |
102 | 4.15M | } |
103 | 2.82M | } |
104 | 4.98M | } |
105 | | |
106 | 88.2k | fprintf(outfile, "0x%" PRIx64 ":\n", |
107 | 88.2k | all_insn[j - 1].address + all_insn[j - 1].size); |
108 | 88.2k | cs_free(all_insn, count); |
109 | 88.2k | } |
110 | | |
111 | 90.2k | cs_close(&handle); |
112 | | |
113 | 90.2k | return 0; |
114 | 90.2k | } |