Coverage Report

Created: 2026-06-06 06:19

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
613
void get_save_loc(int regnum) {
35
613
  unw_cursor_t cursor;
36
613
  unw_context_t uc;
37
613
  unw_word_t reference_reg;
38
39
613
  unw_getcontext(&uc);
40
613
  unw_init_local(&cursor, &uc);
41
613
  unw_save_loc_t loc;
42
5.51k
  while (unw_step(&cursor) > 0) {
43
4.90k
    unw_get_save_loc(&cursor, regnum, &loc);
44
4.90k
  }
45
613
}
46
47
1.49k
void get_random_reg(int regnum) {
48
1.49k
  unw_cursor_t cursor;
49
1.49k
  unw_context_t uc;
50
1.49k
  unw_word_t reference_reg;
51
52
1.49k
  unw_getcontext(&uc);
53
1.49k
  unw_init_local(&cursor, &uc);
54
13.4k
  while (unw_step(&cursor) > 0) {
55
11.9k
    unw_get_reg(&cursor, regnum, &reference_reg);
56
11.9k
  }
57
1.49k
}
58
59
174
void check_is_signal() {
60
174
  unw_cursor_t cursor;
61
174
  unw_context_t uc;
62
174
  unw_word_t reference_reg;
63
64
174
  unw_getcontext(&uc);
65
174
  unw_init_local(&cursor, &uc);
66
1.56k
  while (unw_step(&cursor) > 0) {
67
1.39k
    if (unw_is_signal_frame(&cursor)) {
68
0
      return;
69
0
    }
70
1.39k
  }
71
174
}
72
73
3.97k
void get_proc_name() {
74
3.97k
  unw_cursor_t cursor;
75
3.97k
  unw_context_t uc;
76
77
3.97k
  unw_getcontext(&uc);
78
3.97k
  unw_init_local(&cursor, &uc);
79
35.7k
  while (unw_step(&cursor) > 0) {
80
31.7k
    unw_word_t offset;
81
31.7k
    char buf[512];
82
31.7k
    unw_get_proc_name(&cursor, buf, sizeof(buf), &offset);
83
31.7k
  }
84
3.97k
}
85
86
8.07k
void dispatch(const uint8_t *data, size_t size) {
87
8.07k
  if (size < 8) {
88
322
    return;
89
322
  }
90
7.75k
  uint8_t decider = data[0] % 4;
91
7.75k
  data += 2;
92
7.75k
  size -= 2;
93
7.75k
  if (decider == 0) {
94
4.33k
    recurse1(data, size);
95
4.33k
  } else if (decider == 1) {
96
1.94k
    recurse2(data, size);
97
1.94k
  } else if (decider == 2) {
98
529
    recurse3(data, size);
99
944
  } else {
100
944
    recurse4(data, size);
101
944
  }
102
7.75k
}
103
104
4.33k
void recurse1(const uint8_t *data, size_t size) {
105
4.33k
  if (data[0] == 0x01) {
106
3.97k
    get_proc_name();
107
3.97k
  }
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
1.94k
void recurse2(const uint8_t *data, size_t size) {
116
1.94k
  if (data[0] == 0x01) {
117
1.49k
    get_random_reg((int)data[1]);
118
1.49k
  }
119
1.94k
  data += 2;
120
1.94k
  size -= 2;
121
122
1.94k
  dispatch(data, size);
123
1.94k
  return;
124
1.94k
}
125
126
529
void recurse3(const uint8_t *data, size_t size) {
127
529
  if (data[0] == 0x01) {
128
174
    check_is_signal((int)data[1]);
129
174
  }
130
529
  data += 2;
131
529
  size -= 2;
132
133
529
  dispatch(data, size);
134
529
  return;
135
529
}
136
137
944
void recurse4(const uint8_t *data, size_t size) {
138
944
  if (data[0] == 0x01) {
139
613
    get_save_loc((int)data[1]);
140
613
  }
141
944
  data += 2;
142
944
  size -= 2;
143
144
944
  dispatch(data, size);
145
944
  return;
146
944
}
147
148
346
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
346
  if (size < 12 || size > 512) {
151
24
    return 0;
152
24
  }
153
154
322
  dispatch(data, size);
155
322
  return 0;
156
346
}