mirror of
https://github.com/janet-lang/janet
synced 2025-10-31 07:33:01 +00:00
a87015598c
This makes these operatios use constant stack space rather than linear stackspace given the size of the inputs. This is important to prevent certain parser input from causing a stack overflow - in general, we try to avoid unbounded recursion.
46 lines
1.1 KiB
C
46 lines
1.1 KiB
C
#include <stdint.h>
|
|
#include <string.h>
|
|
#include <janet.h>
|
|
|
|
int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
|
|
|
|
/* init Janet */
|
|
janet_init();
|
|
|
|
/* fuzz the parser */
|
|
JanetParser parser;
|
|
janet_parser_init(&parser);
|
|
for (int i = 0, done = 0; i < size; i++) {
|
|
switch (janet_parser_status(&parser)) {
|
|
case JANET_PARSE_DEAD:
|
|
case JANET_PARSE_ERROR:
|
|
done = 1;
|
|
break;
|
|
case JANET_PARSE_PENDING:
|
|
if (i == size) {
|
|
janet_parser_eof(&parser);
|
|
} else {
|
|
janet_parser_consume(&parser, data[i]);
|
|
}
|
|
break;
|
|
case JANET_PARSE_ROOT:
|
|
if (i >= size) {
|
|
janet_parser_eof(&parser);
|
|
} else {
|
|
janet_parser_consume(&parser, data[i]);
|
|
}
|
|
break;
|
|
}
|
|
|
|
if (done == 1)
|
|
break;
|
|
}
|
|
janet_parser_deinit(&parser);
|
|
|
|
/* cleanup Janet */
|
|
janet_deinit();
|
|
|
|
return 0;
|
|
}
|
|
|