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