Coverage Report

Created: 2025-11-23 06:46

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