Coverage Report

Created: 2026-10-28 07:09

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
726
void get_save_loc(int regnum) {
35
726
  unw_cursor_t cursor;
36
726
  unw_context_t uc;
37
726
  unw_word_t reference_reg;
38
39
726
  unw_getcontext(&uc);
40
726
  unw_init_local(&cursor, &uc);
41
726
  unw_save_loc_t loc;
42
6.53k
  while (unw_step(&cursor) > 0) {
43
5.80k
    unw_get_save_loc(&cursor, regnum, &loc);
44
5.80k
  }
45
726
}
46
47
1.43k
void get_random_reg(int regnum) {
48
1.43k
  unw_cursor_t cursor;
49
1.43k
  unw_context_t uc;
50
1.43k
  unw_word_t reference_reg;
51
52
1.43k
  unw_getcontext(&uc);
53
1.43k
  unw_init_local(&cursor, &uc);
54
12.9k
  while (unw_step(&cursor) > 0) {
55
11.5k
    unw_get_reg(&cursor, regnum, &reference_reg);
56
11.5k
  }
57
1.43k
}
58
59
206
void check_is_signal() {
60
206
  unw_cursor_t cursor;
61
206
  unw_context_t uc;
62
206
  unw_word_t reference_reg;
63
64
206
  unw_getcontext(&uc);
65
206
  unw_init_local(&cursor, &uc);
66
1.85k
  while (unw_step(&cursor) > 0) {
67
1.64k
    if (unw_is_signal_frame(&cursor)) {
68
0
      return;
69
0
    }
70
1.64k
  }
71
206
}
72
73
4.20k
void get_proc_name() {
74
4.20k
  unw_cursor_t cursor;
75
4.20k
  unw_context_t uc;
76
77
4.20k
  unw_getcontext(&uc);
78
4.20k
  unw_init_local(&cursor, &uc);
79
37.8k
  while (unw_step(&cursor) > 0) {
80
33.6k
    unw_word_t offset;
81
33.6k
    char buf[512];
82
33.6k
    unw_get_proc_name(&cursor, buf, sizeof(buf), &offset);
83
33.6k
  }
84
4.20k
}
85
86
8.42k
void dispatch(const uint8_t *data, size_t size) {
87
8.42k
  if (size < 8) {
88
322
    return;
89
322
  }
90
8.10k
  uint8_t decider = data[0] % 4;
91
8.10k
  data += 2;
92
8.10k
  size -= 2;
93
8.10k
  if (decider == 0) {
94
4.64k
    recurse1(data, size);
95
4.64k
  } else if (decider == 1) {
96
1.88k
    recurse2(data, size);
97
1.88k
  } else if (decider == 2) {
98
547
    recurse3(data, size);
99
1.02k
  } else {
100
1.02k
    recurse4(data, size);
101
1.02k
  }
102
8.10k
}
103
104
4.64k
void recurse1(const uint8_t *data, size_t size) {
105
4.64k
  if (data[0] == 0x01) {
106
4.20k
    get_proc_name();
107
4.20k
  }
108
4.64k
  data += 2;
109
4.64k
  size -= 2;
110
111
4.64k
  dispatch(data, size);
112
4.64k
  return;
113
4.64k
}
114
115
1.88k
void recurse2(const uint8_t *data, size_t size) {
116
1.88k
  if (data[0] == 0x01) {
117
1.43k
    get_random_reg((int)data[1]);
118
1.43k
  }
119
1.88k
  data += 2;
120
1.88k
  size -= 2;
121
122
1.88k
  dispatch(data, size);
123
1.88k
  return;
124
1.88k
}
125
126
547
void recurse3(const uint8_t *data, size_t size) {
127
547
  if (data[0] == 0x01) {
128
206
    check_is_signal((int)data[1]);
129
206
  }
130
547
  data += 2;
131
547
  size -= 2;
132
133
547
  dispatch(data, size);
134
547
  return;
135
547
}
136
137
1.02k
void recurse4(const uint8_t *data, size_t size) {
138
1.02k
  if (data[0] == 0x01) {
139
726
    get_save_loc((int)data[1]);
140
726
  }
141
1.02k
  data += 2;
142
1.02k
  size -= 2;
143
144
1.02k
  dispatch(data, size);
145
1.02k
  return;
146
1.02k
}
147
148
354
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
354
  if (size < 12 || size > 512) {
151
32
    return 0;
152
32
  }
153
154
322
  dispatch(data, size);
155
322
  return 0;
156
354
}