mirror of https://github.com/bellard/quickjs
60 lines
1.6 KiB
C
60 lines
1.6 KiB
C
|
/* Copyright 2020 Google Inc.
|
||
|
|
|
||
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
|
you may not use this file except in compliance with the License.
|
||
|
|
You may obtain a copy of the License at
|
||
|
|
|
||
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
||
|
|
|
||
|
|
Unless required by applicable law or agreed to in writing, software
|
||
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
|
See the License for the specific language governing permissions and
|
||
|
|
limitations under the License.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "libregexp.h"
|
||
|
|
#include "quickjs-libc.h"
|
||
|
|
|
||
|
|
|
||
|
|
int lre_check_stack_overflow(void *opaque, size_t alloca_size) { return 0; }
|
||
|
|
|
||
|
|
void *lre_realloc(void *opaque, void *ptr, size_t size)
|
||
|
|
{
|
||
|
|
return realloc(ptr, size);
|
||
|
|
}
|
||
|
|
|
||
|
|
int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
|
||
|
|
int len, ret, i;
|
||
|
|
uint8_t *bc;
|
||
|
|
char error_msg[64];
|
||
|
|
const uint8_t *input;
|
||
|
|
uint8_t *capture[255 * 2];
|
||
|
|
size_t size1 = size;
|
||
|
|
|
||
|
|
//Splits buffer into 2 sub buffers delimited by null character
|
||
|
|
for (i = 0; i < size; i++) {
|
||
|
|
if (data[i] == 0) {
|
||
|
|
size1 = i;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (size1 == size) {
|
||
|
|
//missing delimiter
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
bc = lre_compile(&len, error_msg, sizeof(error_msg), (const char *) data,
|
||
|
|
size1, 0, NULL);
|
||
|
|
if (!bc) {
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
input = data + size1 + 1;
|
||
|
|
ret = lre_exec(capture, bc, input, 0, size - (size1 + 1), 0, NULL);
|
||
|
|
if (ret == 1) {
|
||
|
|
lre_get_capture_count(bc);
|
||
|
|
}
|
||
|
|
free(bc);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|