/src/uWebSockets/fuzzing/helpers.h
Line | Count | Source |
1 | | #ifndef HELPERS_H |
2 | | #define HELPERS_H |
3 | | |
4 | | /* Common helpers for fuzzing */ |
5 | | |
6 | | #include <functional> |
7 | | #include <string_view> |
8 | | #include <cstring> |
9 | | |
10 | | /* We use this to pad the fuzz */ |
11 | 11.1k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { |
12 | 11.1k | static int paddedLength = 512 * 1024; |
13 | 11.1k | static char *padded = new char[128 + paddedLength + 128]; |
14 | | |
15 | | /* Increase landing area if required */ |
16 | 11.1k | if (paddedLength < size) { |
17 | 146 | delete [] padded; |
18 | 146 | paddedLength = size; |
19 | 146 | padded = new char [128 + paddedLength + 128]; |
20 | 146 | } |
21 | | |
22 | 11.1k | memcpy(padded + 128, data, size); |
23 | | |
24 | 11.1k | return (uint8_t *) padded + 128; |
25 | 11.1k | } WebSocket.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 1.43k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 1.43k | static int paddedLength = 512 * 1024; | 13 | 1.43k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 1.43k | if (paddedLength < size) { | 17 | 26 | delete [] padded; | 18 | 26 | paddedLength = size; | 19 | 26 | padded = new char [128 + paddedLength + 128]; | 20 | 26 | } | 21 | | | 22 | 1.43k | memcpy(padded + 128, data, size); | 23 | | | 24 | 1.43k | return (uint8_t *) padded + 128; | 25 | 1.43k | } |
TopicTree.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 3.09k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 3.09k | static int paddedLength = 512 * 1024; | 13 | 3.09k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 3.09k | if (paddedLength < size) { | 17 | 35 | delete [] padded; | 18 | 35 | paddedLength = size; | 19 | 35 | padded = new char [128 + paddedLength + 128]; | 20 | 35 | } | 21 | | | 22 | 3.09k | memcpy(padded + 128, data, size); | 23 | | | 24 | 3.09k | return (uint8_t *) padded + 128; | 25 | 3.09k | } |
PerMessageDeflate.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 304 | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 304 | static int paddedLength = 512 * 1024; | 13 | 304 | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 304 | if (paddedLength < size) { | 17 | 21 | delete [] padded; | 18 | 21 | paddedLength = size; | 19 | 21 | padded = new char [128 + paddedLength + 128]; | 20 | 21 | } | 21 | | | 22 | 304 | memcpy(padded + 128, data, size); | 23 | | | 24 | 304 | return (uint8_t *) padded + 128; | 25 | 304 | } |
Http.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 6.31k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 6.31k | static int paddedLength = 512 * 1024; | 13 | 6.31k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 6.31k | if (paddedLength < size) { | 17 | 64 | delete [] padded; | 18 | 64 | paddedLength = size; | 19 | 64 | padded = new char [128 + paddedLength + 128]; | 20 | 64 | } | 21 | | | 22 | 6.31k | memcpy(padded + 128, data, size); | 23 | | | 24 | 6.31k | return (uint8_t *) padded + 128; | 25 | 6.31k | } |
|
26 | | |
27 | | /* Splits the fuzz data in one or many chunks */ |
28 | 11.1k | static inline void makeChunked(const uint8_t *data, size_t size, std::function<void(const uint8_t *data, size_t size)> cb) { |
29 | | /* First byte determines chunk size; 0 is all that remains, 1-255 is small chunk */ |
30 | 6.86M | for (int i = 0; i < size; ) { |
31 | 6.85M | unsigned int chunkSize = data[i++]; |
32 | 6.85M | if (!chunkSize) { |
33 | 3.37k | chunkSize = size - i; |
34 | 6.85M | } else { |
35 | 6.85M | chunkSize = std::min<int>(chunkSize, size - i); |
36 | 6.85M | } |
37 | | |
38 | 6.85M | cb(data + i, chunkSize); |
39 | 6.85M | i += chunkSize; |
40 | 6.85M | } |
41 | 11.1k | } WebSocket.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 1.43k | static inline void makeChunked(const uint8_t *data, size_t size, std::function<void(const uint8_t *data, size_t size)> cb) { | 29 | | /* First byte determines chunk size; 0 is all that remains, 1-255 is small chunk */ | 30 | 186k | for (int i = 0; i < size; ) { | 31 | 184k | unsigned int chunkSize = data[i++]; | 32 | 184k | if (!chunkSize) { | 33 | 434 | chunkSize = size - i; | 34 | 184k | } else { | 35 | 184k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 184k | } | 37 | | | 38 | 184k | cb(data + i, chunkSize); | 39 | 184k | i += chunkSize; | 40 | 184k | } | 41 | 1.43k | } |
TopicTree.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 3.09k | static inline void makeChunked(const uint8_t *data, size_t size, std::function<void(const uint8_t *data, size_t size)> cb) { | 29 | | /* First byte determines chunk size; 0 is all that remains, 1-255 is small chunk */ | 30 | 5.72M | for (int i = 0; i < size; ) { | 31 | 5.72M | unsigned int chunkSize = data[i++]; | 32 | 5.72M | if (!chunkSize) { | 33 | 239 | chunkSize = size - i; | 34 | 5.72M | } else { | 35 | 5.72M | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 5.72M | } | 37 | | | 38 | 5.72M | cb(data + i, chunkSize); | 39 | 5.72M | i += chunkSize; | 40 | 5.72M | } | 41 | 3.09k | } |
PerMessageDeflate.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 304 | static inline void makeChunked(const uint8_t *data, size_t size, std::function<void(const uint8_t *data, size_t size)> cb) { | 29 | | /* First byte determines chunk size; 0 is all that remains, 1-255 is small chunk */ | 30 | 766k | for (int i = 0; i < size; ) { | 31 | 766k | unsigned int chunkSize = data[i++]; | 32 | 766k | if (!chunkSize) { | 33 | 186 | chunkSize = size - i; | 34 | 766k | } else { | 35 | 766k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 766k | } | 37 | | | 38 | 766k | cb(data + i, chunkSize); | 39 | 766k | i += chunkSize; | 40 | 766k | } | 41 | 304 | } |
Http.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 6.31k | static inline void makeChunked(const uint8_t *data, size_t size, std::function<void(const uint8_t *data, size_t size)> cb) { | 29 | | /* First byte determines chunk size; 0 is all that remains, 1-255 is small chunk */ | 30 | 187k | for (int i = 0; i < size; ) { | 31 | 181k | unsigned int chunkSize = data[i++]; | 32 | 181k | if (!chunkSize) { | 33 | 2.51k | chunkSize = size - i; | 34 | 179k | } else { | 35 | 179k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 179k | } | 37 | | | 38 | 181k | cb(data + i, chunkSize); | 39 | 181k | i += chunkSize; | 40 | 181k | } | 41 | 6.31k | } |
|
42 | | |
43 | | /* Reads all bytes to trigger invalid reads */ |
44 | 159k | static inline void readBytes(std::string_view s) { |
45 | 159k | volatile int sum = 0; |
46 | 4.40M | for (int i = 0; i < s.size(); i++) { |
47 | 4.24M | sum += s[i]; |
48 | 4.24M | } |
49 | 159k | } Unexecuted instantiation: WebSocket.cpp:readBytes(std::__1::basic_string_view<char, std::__1::char_traits<char> >) Unexecuted instantiation: TopicTree.cpp:readBytes(std::__1::basic_string_view<char, std::__1::char_traits<char> >) Unexecuted instantiation: PerMessageDeflate.cpp:readBytes(std::__1::basic_string_view<char, std::__1::char_traits<char> >) Http.cpp:readBytes(std::__1::basic_string_view<char, std::__1::char_traits<char> >) Line | Count | Source | 44 | 159k | static inline void readBytes(std::string_view s) { | 45 | 159k | volatile int sum = 0; | 46 | 4.40M | for (int i = 0; i < s.size(); i++) { | 47 | 4.24M | sum += s[i]; | 48 | 4.24M | } | 49 | 159k | } |
|
50 | | |
51 | | #endif |