Line | Count | Source (jump to first uncovered line) |
1 | | /* Copyright 2023 Google LLC |
2 | | Licensed under the Apache License, Version 2.0 (the "License"); |
3 | | you may not use this file except in compliance with the License. |
4 | | You may obtain a copy of the License at |
5 | | http://www.apache.org/licenses/LICENSE-2.0 |
6 | | Unless required by applicable law or agreed to in writing, software |
7 | | distributed under the License is distributed on an "AS IS" BASIS, |
8 | | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
9 | | See the License for the specific language governing permissions and |
10 | | limitations under the License. |
11 | | */ |
12 | | |
13 | | /* |
14 | | * The main idea behind this fuzzer is the generate arbitrary stack traces |
15 | | * by way of recursive funcitons, and then using various calls to libunwind |
16 | | * apis arbitrarily. |
17 | | */ |
18 | | #define UNW_LOCAL_ONLY |
19 | | #include <libunwind.h> |
20 | | #include <stdint.h> |
21 | | #include <stdlib.h> |
22 | | #include <string.h> |
23 | | |
24 | | void get_random_reg(int); |
25 | | void get_proc_name(); |
26 | | void dispatch(const uint8_t *data, size_t size); |
27 | | void check_is_signal(); |
28 | | void get_save_loc(int reg); |
29 | | void recurse1(const uint8_t *data, size_t size); |
30 | | void recurse2(const uint8_t *data, size_t size); |
31 | | void recurse3(const uint8_t *data, size_t size); |
32 | | void recurse4(const uint8_t *data, size_t size); |
33 | | |
34 | 862 | void get_save_loc(int regnum) { |
35 | 862 | unw_cursor_t cursor; |
36 | 862 | unw_context_t uc; |
37 | 862 | unw_word_t reference_reg; |
38 | | |
39 | 862 | unw_getcontext(&uc); |
40 | 862 | unw_init_local(&cursor, &uc); |
41 | 862 | unw_save_loc_t loc; |
42 | 7.75k | while (unw_step(&cursor) > 0) { |
43 | 6.89k | unw_get_save_loc(&cursor, regnum, &loc); |
44 | 6.89k | } |
45 | 862 | } |
46 | | |
47 | 1.39k | void get_random_reg(int regnum) { |
48 | 1.39k | unw_cursor_t cursor; |
49 | 1.39k | unw_context_t uc; |
50 | 1.39k | unw_word_t reference_reg; |
51 | | |
52 | 1.39k | unw_getcontext(&uc); |
53 | 1.39k | unw_init_local(&cursor, &uc); |
54 | 12.5k | while (unw_step(&cursor) > 0) { |
55 | 11.1k | unw_get_reg(&cursor, regnum, &reference_reg); |
56 | 11.1k | } |
57 | 1.39k | } |
58 | | |
59 | 149 | void check_is_signal() { |
60 | 149 | unw_cursor_t cursor; |
61 | 149 | unw_context_t uc; |
62 | 149 | unw_word_t reference_reg; |
63 | | |
64 | 149 | unw_getcontext(&uc); |
65 | 149 | unw_init_local(&cursor, &uc); |
66 | 1.34k | while (unw_step(&cursor) > 0) { |
67 | 1.19k | if (unw_is_signal_frame(&cursor)) { |
68 | 0 | return; |
69 | 0 | } |
70 | 1.19k | } |
71 | 149 | } |
72 | | |
73 | 3.12k | void get_proc_name() { |
74 | 3.12k | unw_cursor_t cursor; |
75 | 3.12k | unw_context_t uc; |
76 | | |
77 | 3.12k | unw_getcontext(&uc); |
78 | 3.12k | unw_init_local(&cursor, &uc); |
79 | 28.1k | while (unw_step(&cursor) > 0) { |
80 | 25.0k | unw_word_t offset; |
81 | 25.0k | char buf[512]; |
82 | 25.0k | unw_get_proc_name(&cursor, buf, sizeof(buf), &offset); |
83 | 25.0k | } |
84 | 3.12k | } |
85 | | |
86 | 7.23k | void dispatch(const uint8_t *data, size_t size) { |
87 | 7.23k | if (size < 8) { |
88 | 333 | return; |
89 | 333 | } |
90 | 6.90k | uint8_t decider = data[0] % 4; |
91 | 6.90k | data += 2; |
92 | 6.90k | size -= 2; |
93 | 6.90k | if (decider == 0) { |
94 | 3.52k | recurse1(data, size); |
95 | 3.52k | } else if (decider == 1) { |
96 | 1.93k | recurse2(data, size); |
97 | 1.93k | } else if (decider == 2) { |
98 | 394 | recurse3(data, size); |
99 | 1.05k | } else { |
100 | 1.05k | recurse4(data, size); |
101 | 1.05k | } |
102 | 6.90k | } |
103 | | |
104 | 3.52k | void recurse1(const uint8_t *data, size_t size) { |
105 | 3.52k | if (data[0] == 0x01) { |
106 | 3.12k | get_proc_name(); |
107 | 3.12k | } |
108 | 3.52k | data += 2; |
109 | 3.52k | size -= 2; |
110 | | |
111 | 3.52k | dispatch(data, size); |
112 | 3.52k | return; |
113 | 3.52k | } |
114 | | |
115 | 1.93k | void recurse2(const uint8_t *data, size_t size) { |
116 | 1.93k | if (data[0] == 0x01) { |
117 | 1.39k | get_random_reg((int)data[1]); |
118 | 1.39k | } |
119 | 1.93k | data += 2; |
120 | 1.93k | size -= 2; |
121 | | |
122 | 1.93k | dispatch(data, size); |
123 | 1.93k | return; |
124 | 1.93k | } |
125 | | |
126 | 394 | void recurse3(const uint8_t *data, size_t size) { |
127 | 394 | if (data[0] == 0x01) { |
128 | 149 | check_is_signal((int)data[1]); |
129 | 149 | } |
130 | 394 | data += 2; |
131 | 394 | size -= 2; |
132 | | |
133 | 394 | dispatch(data, size); |
134 | 394 | return; |
135 | 394 | } |
136 | | |
137 | 1.05k | void recurse4(const uint8_t *data, size_t size) { |
138 | 1.05k | if (data[0] == 0x01) { |
139 | 862 | get_save_loc((int)data[1]); |
140 | 862 | } |
141 | 1.05k | data += 2; |
142 | 1.05k | size -= 2; |
143 | | |
144 | 1.05k | dispatch(data, size); |
145 | 1.05k | return; |
146 | 1.05k | } |
147 | | |
148 | 365 | int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) { |
149 | | // Ensure we have a bit of data but not too much to cause stackoverflows. |
150 | 365 | if (size < 12 || size > 512) { |
151 | 32 | return 0; |
152 | 32 | } |
153 | | |
154 | 333 | dispatch(data, size); |
155 | 333 | return 0; |
156 | 365 | } |