Coverage Report

Created: 2026-02-26 06:31

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