/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.0k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { |
12 | 11.0k | static int paddedLength = 512 * 1024; |
13 | 11.0k | static char *padded = new char[128 + paddedLength + 128]; |
14 | | |
15 | | /* Increase landing area if required */ |
16 | 11.0k | if (paddedLength < size) { |
17 | 150 | delete [] padded; |
18 | 150 | paddedLength = size; |
19 | 150 | padded = new char [128 + paddedLength + 128]; |
20 | 150 | } |
21 | | |
22 | 11.0k | memcpy(padded + 128, data, size); |
23 | | |
24 | 11.0k | return (uint8_t *) padded + 128; |
25 | 11.0k | } WebSocket.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 1.44k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 1.44k | static int paddedLength = 512 * 1024; | 13 | 1.44k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 1.44k | if (paddedLength < size) { | 17 | 27 | delete [] padded; | 18 | 27 | paddedLength = size; | 19 | 27 | padded = new char [128 + paddedLength + 128]; | 20 | 27 | } | 21 | | | 22 | 1.44k | memcpy(padded + 128, data, size); | 23 | | | 24 | 1.44k | return (uint8_t *) padded + 128; | 25 | 1.44k | } |
TopicTree.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 3.03k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 3.03k | static int paddedLength = 512 * 1024; | 13 | 3.03k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 3.03k | if (paddedLength < size) { | 17 | 32 | delete [] padded; | 18 | 32 | paddedLength = size; | 19 | 32 | padded = new char [128 + paddedLength + 128]; | 20 | 32 | } | 21 | | | 22 | 3.03k | memcpy(padded + 128, data, size); | 23 | | | 24 | 3.03k | return (uint8_t *) padded + 128; | 25 | 3.03k | } |
PerMessageDeflate.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 308 | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 308 | static int paddedLength = 512 * 1024; | 13 | 308 | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 308 | if (paddedLength < size) { | 17 | 22 | delete [] padded; | 18 | 22 | paddedLength = size; | 19 | 22 | padded = new char [128 + paddedLength + 128]; | 20 | 22 | } | 21 | | | 22 | 308 | memcpy(padded + 128, data, size); | 23 | | | 24 | 308 | return (uint8_t *) padded + 128; | 25 | 308 | } |
Http.cpp:makePadded(unsigned char const*, unsigned long) Line | Count | Source | 11 | 6.30k | static inline const uint8_t *makePadded(const uint8_t *data, size_t size) { | 12 | 6.30k | static int paddedLength = 512 * 1024; | 13 | 6.30k | static char *padded = new char[128 + paddedLength + 128]; | 14 | | | 15 | | /* Increase landing area if required */ | 16 | 6.30k | if (paddedLength < size) { | 17 | 69 | delete [] padded; | 18 | 69 | paddedLength = size; | 19 | 69 | padded = new char [128 + paddedLength + 128]; | 20 | 69 | } | 21 | | | 22 | 6.30k | memcpy(padded + 128, data, size); | 23 | | | 24 | 6.30k | return (uint8_t *) padded + 128; | 25 | 6.30k | } |
|
26 | | |
27 | | /* Splits the fuzz data in one or many chunks */ |
28 | 11.0k | 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.61M | for (int i = 0; i < size; ) { |
31 | 5.60M | unsigned int chunkSize = data[i++]; |
32 | 5.60M | if (!chunkSize) { |
33 | 3.38k | chunkSize = size - i; |
34 | 5.60M | } else { |
35 | 5.60M | chunkSize = std::min<int>(chunkSize, size - i); |
36 | 5.60M | } |
37 | | |
38 | 5.60M | cb(data + i, chunkSize); |
39 | 5.60M | i += chunkSize; |
40 | 5.60M | } |
41 | 11.0k | } WebSocket.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 1.44k | 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 | 211k | for (int i = 0; i < size; ) { | 31 | 210k | unsigned int chunkSize = data[i++]; | 32 | 210k | if (!chunkSize) { | 33 | 457 | chunkSize = size - i; | 34 | 210k | } else { | 35 | 210k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 210k | } | 37 | | | 38 | 210k | cb(data + i, chunkSize); | 39 | 210k | i += chunkSize; | 40 | 210k | } | 41 | 1.44k | } |
TopicTree.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 3.03k | 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.14M | for (int i = 0; i < size; ) { | 31 | 5.14M | unsigned int chunkSize = data[i++]; | 32 | 5.14M | if (!chunkSize) { | 33 | 249 | chunkSize = size - i; | 34 | 5.14M | } else { | 35 | 5.14M | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 5.14M | } | 37 | | | 38 | 5.14M | cb(data + i, chunkSize); | 39 | 5.14M | i += chunkSize; | 40 | 5.14M | } | 41 | 3.03k | } |
PerMessageDeflate.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 308 | 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 | 66.8k | for (int i = 0; i < size; ) { | 31 | 66.5k | unsigned int chunkSize = data[i++]; | 32 | 66.5k | if (!chunkSize) { | 33 | 164 | chunkSize = size - i; | 34 | 66.3k | } else { | 35 | 66.3k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 66.3k | } | 37 | | | 38 | 66.5k | cb(data + i, chunkSize); | 39 | 66.5k | i += chunkSize; | 40 | 66.5k | } | 41 | 308 | } |
Http.cpp:makeChunked(unsigned char const*, unsigned long, std::__1::function<void (unsigned char const*, unsigned long)>) Line | Count | Source | 28 | 6.30k | 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 | 189k | for (int i = 0; i < size; ) { | 31 | 183k | unsigned int chunkSize = data[i++]; | 32 | 183k | if (!chunkSize) { | 33 | 2.51k | chunkSize = size - i; | 34 | 180k | } else { | 35 | 180k | chunkSize = std::min<int>(chunkSize, size - i); | 36 | 180k | } | 37 | | | 38 | 183k | cb(data + i, chunkSize); | 39 | 183k | i += chunkSize; | 40 | 183k | } | 41 | 6.30k | } |
|
42 | | |
43 | | /* Reads all bytes to trigger invalid reads */ |
44 | 163k | static inline void readBytes(std::string_view s) { |
45 | 163k | volatile int sum = 0; |
46 | 3.12M | for (int i = 0; i < s.size(); i++) { |
47 | 2.95M | sum += s[i]; |
48 | 2.95M | } |
49 | 163k | } 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 | 163k | static inline void readBytes(std::string_view s) { | 45 | 163k | volatile int sum = 0; | 46 | 3.12M | for (int i = 0; i < s.size(); i++) { | 47 | 2.95M | sum += s[i]; | 48 | 2.95M | } | 49 | 163k | } |
|
50 | | |
51 | | #endif |