Coverage Report

Created: 2025-10-13 07:08

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/fuzz_libunwind.c
Line
Count
Source
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
824
void get_save_loc(int regnum) {
35
824
  unw_cursor_t cursor;
36
824
  unw_context_t uc;
37
824
  unw_word_t reference_reg;
38
39
824
  unw_getcontext(&uc);
40
824
  unw_init_local(&cursor, &uc);
41
824
  unw_save_loc_t loc;
42
7.41k
  while (unw_step(&cursor) > 0) {
43
6.59k
    unw_get_save_loc(&cursor, regnum, &loc);
44
6.59k
  }
45
824
}
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
158
void check_is_signal() {
60
158
  unw_cursor_t cursor;
61
158
  unw_context_t uc;
62
158
  unw_word_t reference_reg;
63
64
158
  unw_getcontext(&uc);
65
158
  unw_init_local(&cursor, &uc);
66
1.42k
  while (unw_step(&cursor) > 0) {
67
1.26k
    if (unw_is_signal_frame(&cursor)) {
68
0
      return;
69
0
    }
70
1.26k
  }
71
158
}
72
73
4.24k
void get_proc_name() {
74
4.24k
  unw_cursor_t cursor;
75
4.24k
  unw_context_t uc;
76
77
4.24k
  unw_getcontext(&uc);
78
4.24k
  unw_init_local(&cursor, &uc);
79
38.1k
  while (unw_step(&cursor) > 0) {
80
33.9k
    unw_word_t offset;
81
33.9k
    char buf[512];
82
33.9k
    unw_get_proc_name(&cursor, buf, sizeof(buf), &offset);
83
33.9k
  }
84
4.24k
}
85
86
8.45k
void dispatch(const uint8_t *data, size_t size) {
87
8.45k
  if (size < 8) {
88
321
    return;
89
321
  }
90
8.13k
  uint8_t decider = data[0] % 4;
91
8.13k
  data += 2;
92
8.13k
  size -= 2;
93
8.13k
  if (decider == 0) {
94
4.71k
    recurse1(data, size);
95
4.71k
  } else if (decider == 1) {
96
1.89k
    recurse2(data, size);
97
1.89k
  } else if (decider == 2) {
98
457
    recurse3(data, size);
99
1.07k
  } else {
100
1.07k
    recurse4(data, size);
101
1.07k
  }
102
8.13k
}
103
104
4.71k
void recurse1(const uint8_t *data, size_t size) {
105
4.71k
  if (data[0] == 0x01) {
106
4.24k
    get_proc_name();
107
4.24k
  }
108
4.71k
  data += 2;
109
4.71k
  size -= 2;
110
111
4.71k
  dispatch(data, size);
112
4.71k
  return;
113
4.71k
}
114
115
1.89k
void recurse2(const uint8_t *data, size_t size) {
116
1.89k
  if (data[0] == 0x01) {
117
1.39k
    get_random_reg((int)data[1]);
118
1.39k
  }
119
1.89k
  data += 2;
120
1.89k
  size -= 2;
121
122
1.89k
  dispatch(data, size);
123
1.89k
  return;
124
1.89k
}
125
126
457
void recurse3(const uint8_t *data, size_t size) {
127
457
  if (data[0] == 0x01) {
128
158
    check_is_signal((int)data[1]);
129
158
  }
130
457
  data += 2;
131
457
  size -= 2;
132
133
457
  dispatch(data, size);
134
457
  return;
135
457
}
136
137
1.07k
void recurse4(const uint8_t *data, size_t size) {
138
1.07k
  if (data[0] == 0x01) {
139
824
    get_save_loc((int)data[1]);
140
824
  }
141
1.07k
  data += 2;
142
1.07k
  size -= 2;
143
144
1.07k
  dispatch(data, size);
145
1.07k
  return;
146
1.07k
}
147
148
350
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
350
  if (size < 12 || size > 512) {
151
29
    return 0;
152
29
  }
153
154
321
  dispatch(data, size);
155
321
  return 0;
156
350
}