/* * Copyright (C) 2023 Teluu Inc. (http://www.teluu.com) * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include #include #include #include #include #define kMinInputLength 10 #define kMaxInputLength 5120 pj_pool_factory *mem; int XML_parse(uint8_t *data, size_t Size) { pj_pool_t *pool; pj_xml_node *root; char *output; size_t output_size; pool = pj_pool_create(mem, "xml", 4096, 1024, NULL); root = pj_xml_parse(pool, (char *)data, Size); if (!root) { goto on_error; } output = (char*)pj_pool_zalloc(pool, Size + 512); output_size = pj_xml_print(root, output, Size + 512, PJ_TRUE); if (output_size < 1) { goto on_error; } pj_pool_release(pool); return 0; on_error: pj_pool_release(pool); return 1; } extern int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { if (Size < kMinInputLength || Size > kMaxInputLength) { return 1; } int ret = 0; uint8_t *data; pj_caching_pool caching_pool; /* Add NULL byte */ data = (uint8_t *)calloc((Size+1), sizeof(uint8_t)); memcpy((void *)data, (void *)Data, Size); /* init Calls */ pj_init(); pj_caching_pool_init( &caching_pool, &pj_pool_factory_default_policy, 0); pj_log_set_level(0); mem = &caching_pool.factory; /*Calls fuzzer*/ ret = XML_parse(data, Size); free(data); pj_caching_pool_destroy(&caching_pool); return ret; }