universe@27: /* universe@34: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. universe@57: * Copyright 2018 Mike Becker. All rights reserved. universe@34: * universe@34: * Redistribution and use in source and binary forms, with or without universe@34: * modification, are permitted provided that the following conditions are met: universe@34: * universe@34: * 1. Redistributions of source code must retain the above copyright universe@34: * notice, this list of conditions and the following disclaimer. universe@34: * universe@34: * 2. Redistributions in binary form must reproduce the above copyright universe@34: * notice, this list of conditions and the following disclaimer in the universe@34: * documentation and/or other materials provided with the distribution. universe@34: * universe@34: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" universe@34: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE universe@34: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE universe@34: * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE universe@34: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL universe@34: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR universe@34: * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER universe@34: * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, universe@34: * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE universe@57: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. universe@27: */ universe@27: universe@27: #ifndef REGEX_PARSER_H_ universe@27: #define REGEX_PARSER_H_ universe@27: universe@66: #define MAX_LINELENGTH 4096u universe@27: universe@27: #include universe@27: #include universe@27: #include universe@27: #include "string_list.h" universe@27: universe@27: typedef struct { universe@27: string_list_t* pattern_list; /* even entries: start ; odd entries: end */ universe@27: regex_t** compiled_patterns; universe@28: size_t compiled_pattern_count; universe@27: unsigned int pattern_match; /* save position of end pattern to match - universe@27: NULL when a start pattern shall match first */ universe@66: unsigned int matched_counted; universe@66: bool count_chars; universe@27: } regex_parser_t; universe@27: universe@27: #ifdef _cplusplus universe@27: extern "C" { universe@27: #endif universe@27: universe@27: regex_parser_t* new_regex_parser_t(); universe@27: void destroy_regex_parser_t(regex_parser_t*); universe@54: void regex_parser_reset(regex_parser_t* parser); universe@27: universe@27: bool regex_parser_matching(regex_parser_t*); universe@28: bool regex_compile_all(regex_parser_t*); universe@28: int regex_parser_do(regex_parser_t*, char*); universe@27: universe@27: #ifdef _cplusplus universe@27: } universe@27: #endif universe@27: universe@27: #endif /* REGEX_PARSER_H_ */